1 ;;;; This software is part of the SBCL system. See the README file for
4 ;;;; This software is derived from the CMU CL system, which was written at
5 ;;;; Carnegie Mellon University and released into the public domain. The
6 ;;;; software is in the public domain and is provided with absolutely no
7 ;;;; warranty. See the COPYING and CREDITS files for more information.
9 (in-package :sb-concurrency-test)
11 (deftest mailbox-trivia.1
12 (values (mailboxp (make-mailbox))
17 (deftest mailbox-trivia.2
18 (let ((mbox1 (make-mailbox :name "foof"))
19 (mbox2 (make-mailbox)))
20 (values (mailbox-name mbox1)
21 (mailbox-name mbox2)))
25 (deftest mailbox-trivia.3
26 (flet ((test (initial-contents)
27 (let ((mbox (make-mailbox :initial-contents initial-contents)))
28 (list (mailbox-count mbox)
29 (mailbox-empty-p mbox)
30 (list-mailbox-messages mbox)
31 (eq (list-mailbox-messages mbox) initial-contents)))))
32 (values (test '(1 2 3))
38 (3 nil (#\1 #\2 #\3) nil)
44 ;; Dummy struct for ATOMIC-INCF to work.
46 (ref 0 :type sb-vm:word))
48 (defun receiver-distribution (n-receivers)
49 (let* ((aux (floor n-receivers 2))
50 (n-recv-msg (- n-receivers aux))
51 (n-recv-pend-msgs (floor aux 3))
52 (n-recv-msg-n-h (- aux n-recv-pend-msgs)))
57 (defun test-mailbox-producers-consumers
58 (&key n-senders n-receivers n-messages interruptor)
59 (let ((mbox (make-mailbox))
60 (counter (make-counter))
62 (+fin-token+ :finish) ; end token for receivers to stop
63 (+blksize+ 5)) ; "block size" for RECEIVE-PENDING-MESSAGES
64 (multiple-value-bind (n-recv-msg
67 ;; We have three groups of receivers, one using
68 ;; RECEIVE-MESSAGE, one RECEIVE-MESSAGE-NO-HANG, and
69 ;; another one RECEIVE-PENDING-MESSAGES.
70 (receiver-distribution n-receivers)
72 (make-threads n-senders "SENDER"
74 (dotimes (i n-messages t)
76 (sleep (random +sleep+))))))
78 (flet ((process-msg (msg out)
82 ((not (< -1 msg n-messages))
85 (sb-ext:atomic-incf (counter-ref counter))))))
87 (make-threads n-recv-msg "RECV-MSG"
89 (sleep (random +sleep+))
90 (loop (process-msg (receive-message mbox)
91 #'(lambda (x) (return x))))))
92 (make-threads n-recv-pend-msgs "RECV-PEND-MSGS"
95 (sleep (random +sleep+))
97 (process-msg msg #'(lambda (x) (return x))))
98 (receive-pending-messages mbox +blksize+)))))
99 (make-threads n-recv-msg-n-h "RECV-MSG-NO-HANG"
102 (sleep (random +sleep+))
103 (multiple-value-bind (msg ok)
104 (receive-message-no-hang mbox)
106 (process-msg msg #'(lambda (x)
107 (return x))))))))))))
110 (funcall interruptor (append receivers senders)))
114 (flet ((wait-for (threads)
115 (mapc #'(lambda (thread)
116 (ecase (timed-join-thread thread)
118 ((nil) (incf garbage))
119 ((:aborted) (incf errors))
120 ((:timeout) (incf timeouts)
121 (kill-thread thread))))
123 ;; First wait until all messages are propagating.
125 ;; Senders are finished, inform and wait for the
127 (loop repeat (+ n-recv-msg
129 (* n-recv-pend-msgs +blksize+))
130 ;; The number computed above is an upper bound; if
131 ;; we send as many FINs as that, we can be sure that
132 ;; every receiver must have got at least one FIN.
133 do (send-message mbox +fin-token+))
135 ;; We may in fact have sent too many FINs, so make sure
136 ;; it's only FINs in the mailbox now.
137 (mapc #'(lambda (msg) (unless (eq msg +fin-token+)
139 (list-mailbox-messages mbox))
140 (values `(:received . ,(counter-ref counter))
141 `(:garbage . ,garbage)
143 `(:timeouts . ,timeouts))))))))
146 (deftest mailbox.single-producer-single-consumer
147 (test-mailbox-producers-consumers :n-senders 1
155 (deftest mailbox.single-producer-multiple-consumers
156 (test-mailbox-producers-consumers :n-senders 1
164 (deftest mailbox.multiple-producers-single-consumer
165 (test-mailbox-producers-consumers :n-senders 100
173 (deftest mailbox.multiple-producers-multiple-consumers
174 (test-mailbox-producers-consumers :n-senders 100
177 (:received . 1000000)
182 (deftest mailbox.interrupts-safety.1
183 (multiple-value-bind (received garbage errors timeouts)
184 (test-mailbox-producers-consumers
188 :interruptor #'(lambda (threads &aux (n (length threads)))
189 ;; 99 so even in the unlikely case that only
190 ;; receivers (or only senders) are shot
191 ;; dead, there's still one that survives to
192 ;; properly end the test.
194 for victim = (nth (random n) threads)
195 do (kill-thread victim)
196 (sleep (random 0.0001)))))
198 ;; We may have killed a receiver before it got to incrementing
200 (if (<= (cdr received) 1000000)
204 ;; we may have gotten errors due to our killing spree.
210 ) ; #+sb-thread (progn ...