blob: 46ff753df08f8cab3f6566541b124be721b7fa92 [file] [log] [blame]
Antoine Pitrouc98efe02009-11-06 22:34:35 +00001"""
2Various tests for synchronization primitives.
3"""
4
5import sys
6import time
7from thread import start_new_thread, get_ident
8import threading
9import unittest
10
11from test import test_support as support
12
13
14def _wait():
15 # A crude wait/yield function not relying on synchronization primitives.
16 time.sleep(0.01)
17
18class Bunch(object):
19 """
20 A bunch of threads.
21 """
22 def __init__(self, f, n, wait_before_exit=False):
23 """
24 Construct a bunch of `n` threads running the same function `f`.
25 If `wait_before_exit` is True, the threads won't terminate until
26 do_finish() is called.
27 """
28 self.f = f
29 self.n = n
30 self.started = []
31 self.finished = []
32 self._can_exit = not wait_before_exit
33 def task():
34 tid = get_ident()
35 self.started.append(tid)
36 try:
37 f()
38 finally:
39 self.finished.append(tid)
40 while not self._can_exit:
41 _wait()
Serhiy Storchaka53ea1622015-03-28 20:38:48 +020042 try:
43 for i in range(n):
44 start_new_thread(task, ())
45 except:
46 self._can_exit = True
47 raise
Antoine Pitrouc98efe02009-11-06 22:34:35 +000048
49 def wait_for_started(self):
50 while len(self.started) < self.n:
51 _wait()
52
53 def wait_for_finished(self):
54 while len(self.finished) < self.n:
55 _wait()
56
57 def do_finish(self):
58 self._can_exit = True
59
60
61class BaseTestCase(unittest.TestCase):
62 def setUp(self):
63 self._threads = support.threading_setup()
64
65 def tearDown(self):
66 support.threading_cleanup(*self._threads)
67 support.reap_children()
68
69
70class BaseLockTests(BaseTestCase):
71 """
72 Tests for both recursive and non-recursive locks.
73 """
74
75 def test_constructor(self):
76 lock = self.locktype()
77 del lock
78
79 def test_acquire_destroy(self):
80 lock = self.locktype()
81 lock.acquire()
82 del lock
83
84 def test_acquire_release(self):
85 lock = self.locktype()
86 lock.acquire()
87 lock.release()
88 del lock
89
90 def test_try_acquire(self):
91 lock = self.locktype()
92 self.assertTrue(lock.acquire(False))
93 lock.release()
94
95 def test_try_acquire_contended(self):
96 lock = self.locktype()
97 lock.acquire()
98 result = []
99 def f():
100 result.append(lock.acquire(False))
101 Bunch(f, 1).wait_for_finished()
102 self.assertFalse(result[0])
103 lock.release()
104
105 def test_acquire_contended(self):
106 lock = self.locktype()
107 lock.acquire()
108 N = 5
109 def f():
110 lock.acquire()
111 lock.release()
112
113 b = Bunch(f, N)
114 b.wait_for_started()
115 _wait()
116 self.assertEqual(len(b.finished), 0)
117 lock.release()
118 b.wait_for_finished()
119 self.assertEqual(len(b.finished), N)
120
121 def test_with(self):
122 lock = self.locktype()
123 def f():
124 lock.acquire()
125 lock.release()
126 def _with(err=None):
127 with lock:
128 if err is not None:
129 raise err
130 _with()
131 # Check the lock is unacquired
132 Bunch(f, 1).wait_for_finished()
133 self.assertRaises(TypeError, _with, TypeError)
134 # Check the lock is unacquired
135 Bunch(f, 1).wait_for_finished()
136
Antoine Pitroud7158d42009-11-09 16:00:11 +0000137 def test_thread_leak(self):
138 # The lock shouldn't leak a Thread instance when used from a foreign
139 # (non-threading) thread.
140 lock = self.locktype()
141 def f():
142 lock.acquire()
143 lock.release()
144 n = len(threading.enumerate())
145 # We run many threads in the hope that existing threads ids won't
146 # be recycled.
147 Bunch(f, 15).wait_for_finished()
148 self.assertEqual(n, len(threading.enumerate()))
149
Antoine Pitrouc98efe02009-11-06 22:34:35 +0000150
151class LockTests(BaseLockTests):
152 """
153 Tests for non-recursive, weak locks
154 (which can be acquired and released from different threads).
155 """
156 def test_reacquire(self):
157 # Lock needs to be released before re-acquiring.
158 lock = self.locktype()
159 phase = []
160 def f():
161 lock.acquire()
162 phase.append(None)
163 lock.acquire()
164 phase.append(None)
165 start_new_thread(f, ())
166 while len(phase) == 0:
167 _wait()
168 _wait()
169 self.assertEqual(len(phase), 1)
170 lock.release()
171 while len(phase) == 1:
172 _wait()
173 self.assertEqual(len(phase), 2)
174
175 def test_different_thread(self):
176 # Lock can be released from a different thread.
177 lock = self.locktype()
178 lock.acquire()
179 def f():
180 lock.release()
181 b = Bunch(f, 1)
182 b.wait_for_finished()
183 lock.acquire()
184 lock.release()
185
186
187class RLockTests(BaseLockTests):
188 """
189 Tests for recursive locks.
190 """
191 def test_reacquire(self):
192 lock = self.locktype()
193 lock.acquire()
194 lock.acquire()
195 lock.release()
196 lock.acquire()
197 lock.release()
198 lock.release()
199
200 def test_release_unacquired(self):
201 # Cannot release an unacquired lock
202 lock = self.locktype()
203 self.assertRaises(RuntimeError, lock.release)
204 lock.acquire()
205 lock.acquire()
206 lock.release()
207 lock.acquire()
208 lock.release()
209 lock.release()
210 self.assertRaises(RuntimeError, lock.release)
211
212 def test_different_thread(self):
213 # Cannot release from a different thread
214 lock = self.locktype()
215 def f():
216 lock.acquire()
217 b = Bunch(f, 1, True)
218 try:
219 self.assertRaises(RuntimeError, lock.release)
220 finally:
221 b.do_finish()
222
223 def test__is_owned(self):
224 lock = self.locktype()
225 self.assertFalse(lock._is_owned())
226 lock.acquire()
227 self.assertTrue(lock._is_owned())
228 lock.acquire()
229 self.assertTrue(lock._is_owned())
230 result = []
231 def f():
232 result.append(lock._is_owned())
233 Bunch(f, 1).wait_for_finished()
234 self.assertFalse(result[0])
235 lock.release()
236 self.assertTrue(lock._is_owned())
237 lock.release()
238 self.assertFalse(lock._is_owned())
239
240
241class EventTests(BaseTestCase):
242 """
243 Tests for Event objects.
244 """
245
246 def test_is_set(self):
247 evt = self.eventtype()
248 self.assertFalse(evt.is_set())
249 evt.set()
250 self.assertTrue(evt.is_set())
251 evt.set()
252 self.assertTrue(evt.is_set())
253 evt.clear()
254 self.assertFalse(evt.is_set())
255 evt.clear()
256 self.assertFalse(evt.is_set())
257
258 def _check_notify(self, evt):
259 # All threads get notified
260 N = 5
261 results1 = []
262 results2 = []
263 def f():
264 results1.append(evt.wait())
265 results2.append(evt.wait())
266 b = Bunch(f, N)
267 b.wait_for_started()
268 _wait()
269 self.assertEqual(len(results1), 0)
270 evt.set()
271 b.wait_for_finished()
272 self.assertEqual(results1, [True] * N)
273 self.assertEqual(results2, [True] * N)
274
275 def test_notify(self):
276 evt = self.eventtype()
277 self._check_notify(evt)
278 # Another time, after an explicit clear()
279 evt.set()
280 evt.clear()
281 self._check_notify(evt)
282
283 def test_timeout(self):
284 evt = self.eventtype()
285 results1 = []
286 results2 = []
287 N = 5
288 def f():
289 results1.append(evt.wait(0.0))
290 t1 = time.time()
291 r = evt.wait(0.2)
292 t2 = time.time()
293 results2.append((r, t2 - t1))
294 Bunch(f, N).wait_for_finished()
295 self.assertEqual(results1, [False] * N)
296 for r, dt in results2:
297 self.assertFalse(r)
298 self.assertTrue(dt >= 0.2, dt)
299 # The event is set
300 results1 = []
301 results2 = []
302 evt.set()
303 Bunch(f, N).wait_for_finished()
304 self.assertEqual(results1, [True] * N)
305 for r, dt in results2:
306 self.assertTrue(r)
307
Benjamin Peterson51cd53e2015-10-05 21:56:22 -0700308 def test_reset_internal_locks(self):
309 evt = self.eventtype()
310 old_lock = evt._Event__cond._Condition__lock
311 evt._reset_internal_locks()
312 new_lock = evt._Event__cond._Condition__lock
313 self.assertIsNot(new_lock, old_lock)
314 self.assertIs(type(new_lock), type(old_lock))
315
Antoine Pitrouc98efe02009-11-06 22:34:35 +0000316
317class ConditionTests(BaseTestCase):
318 """
319 Tests for condition variables.
320 """
321
322 def test_acquire(self):
323 cond = self.condtype()
324 # Be default we have an RLock: the condition can be acquired multiple
325 # times.
326 cond.acquire()
327 cond.acquire()
328 cond.release()
329 cond.release()
330 lock = threading.Lock()
331 cond = self.condtype(lock)
332 cond.acquire()
333 self.assertFalse(lock.acquire(False))
334 cond.release()
335 self.assertTrue(lock.acquire(False))
336 self.assertFalse(cond.acquire(False))
337 lock.release()
338 with cond:
339 self.assertFalse(lock.acquire(False))
340
341 def test_unacquired_wait(self):
342 cond = self.condtype()
343 self.assertRaises(RuntimeError, cond.wait)
344
345 def test_unacquired_notify(self):
346 cond = self.condtype()
347 self.assertRaises(RuntimeError, cond.notify)
348
349 def _check_notify(self, cond):
Victor Stinnerda6d3052017-06-22 02:09:40 +0200350 # Note that this test is sensitive to timing. If the worker threads
351 # don't execute in a timely fashion, the main thread may think they
352 # are further along then they are. The main thread therefore issues
353 # _wait() statements to try to make sure that it doesn't race ahead
354 # of the workers.
355 # Secondly, this test assumes that condition variables are not subject
356 # to spurious wakeups. The absence of spurious wakeups is an implementation
357 # detail of Condition Cariables in current CPython, but in general, not
358 # a guaranteed property of condition variables as a programming
359 # construct. In particular, it is possible that this can no longer
360 # be conveniently guaranteed should their implementation ever change.
Antoine Pitrouc98efe02009-11-06 22:34:35 +0000361 N = 5
362 results1 = []
363 results2 = []
364 phase_num = 0
365 def f():
366 cond.acquire()
367 cond.wait()
368 cond.release()
369 results1.append(phase_num)
370 cond.acquire()
371 cond.wait()
372 cond.release()
373 results2.append(phase_num)
374 b = Bunch(f, N)
375 b.wait_for_started()
376 _wait()
377 self.assertEqual(results1, [])
378 # Notify 3 threads at first
379 cond.acquire()
380 cond.notify(3)
381 _wait()
382 phase_num = 1
383 cond.release()
384 while len(results1) < 3:
385 _wait()
386 self.assertEqual(results1, [1] * 3)
387 self.assertEqual(results2, [])
Victor Stinnerda6d3052017-06-22 02:09:40 +0200388 # first wait, to ensure all workers settle into cond.wait() before
389 # we continue. See issue #8799
390 _wait()
Antoine Pitrouc98efe02009-11-06 22:34:35 +0000391 # Notify 5 threads: they might be in their first or second wait
392 cond.acquire()
393 cond.notify(5)
394 _wait()
395 phase_num = 2
396 cond.release()
397 while len(results1) + len(results2) < 8:
398 _wait()
399 self.assertEqual(results1, [1] * 3 + [2] * 2)
400 self.assertEqual(results2, [2] * 3)
Victor Stinnerda6d3052017-06-22 02:09:40 +0200401 _wait() # make sure all workers settle into cond.wait()
Antoine Pitrouc98efe02009-11-06 22:34:35 +0000402 # Notify all threads: they are all in their second wait
403 cond.acquire()
404 cond.notify_all()
405 _wait()
406 phase_num = 3
407 cond.release()
408 while len(results2) < 5:
409 _wait()
410 self.assertEqual(results1, [1] * 3 + [2] * 2)
411 self.assertEqual(results2, [2] * 3 + [3] * 2)
412 b.wait_for_finished()
413
414 def test_notify(self):
415 cond = self.condtype()
416 self._check_notify(cond)
417 # A second time, to check internal state is still ok.
418 self._check_notify(cond)
419
420 def test_timeout(self):
421 cond = self.condtype()
422 results = []
423 N = 5
424 def f():
425 cond.acquire()
426 t1 = time.time()
427 cond.wait(0.2)
428 t2 = time.time()
429 cond.release()
430 results.append(t2 - t1)
431 Bunch(f, N).wait_for_finished()
432 self.assertEqual(len(results), 5)
433 for dt in results:
434 self.assertTrue(dt >= 0.2, dt)
435
436
437class BaseSemaphoreTests(BaseTestCase):
438 """
439 Common tests for {bounded, unbounded} semaphore objects.
440 """
441
442 def test_constructor(self):
443 self.assertRaises(ValueError, self.semtype, value = -1)
444 self.assertRaises(ValueError, self.semtype, value = -sys.maxint)
445
446 def test_acquire(self):
447 sem = self.semtype(1)
448 sem.acquire()
449 sem.release()
450 sem = self.semtype(2)
451 sem.acquire()
452 sem.acquire()
453 sem.release()
454 sem.release()
455
456 def test_acquire_destroy(self):
457 sem = self.semtype()
458 sem.acquire()
459 del sem
460
461 def test_acquire_contended(self):
462 sem = self.semtype(7)
463 sem.acquire()
464 N = 10
465 results1 = []
466 results2 = []
467 phase_num = 0
468 def f():
469 sem.acquire()
470 results1.append(phase_num)
471 sem.acquire()
472 results2.append(phase_num)
473 b = Bunch(f, 10)
474 b.wait_for_started()
475 while len(results1) + len(results2) < 6:
476 _wait()
477 self.assertEqual(results1 + results2, [0] * 6)
478 phase_num = 1
479 for i in range(7):
480 sem.release()
481 while len(results1) + len(results2) < 13:
482 _wait()
483 self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7)
484 phase_num = 2
485 for i in range(6):
486 sem.release()
487 while len(results1) + len(results2) < 19:
488 _wait()
489 self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7 + [2] * 6)
490 # The semaphore is still locked
491 self.assertFalse(sem.acquire(False))
492 # Final release, to let the last thread finish
493 sem.release()
494 b.wait_for_finished()
495
496 def test_try_acquire(self):
497 sem = self.semtype(2)
498 self.assertTrue(sem.acquire(False))
499 self.assertTrue(sem.acquire(False))
500 self.assertFalse(sem.acquire(False))
501 sem.release()
502 self.assertTrue(sem.acquire(False))
503
504 def test_try_acquire_contended(self):
505 sem = self.semtype(4)
506 sem.acquire()
507 results = []
508 def f():
509 results.append(sem.acquire(False))
510 results.append(sem.acquire(False))
511 Bunch(f, 5).wait_for_finished()
512 # There can be a thread switch between acquiring the semaphore and
513 # appending the result, therefore results will not necessarily be
514 # ordered.
515 self.assertEqual(sorted(results), [False] * 7 + [True] * 3 )
516
517 def test_default_value(self):
518 # The default initial value is 1.
519 sem = self.semtype()
520 sem.acquire()
521 def f():
522 sem.acquire()
523 sem.release()
524 b = Bunch(f, 1)
525 b.wait_for_started()
526 _wait()
527 self.assertFalse(b.finished)
528 sem.release()
529 b.wait_for_finished()
530
531 def test_with(self):
532 sem = self.semtype(2)
533 def _with(err=None):
534 with sem:
535 self.assertTrue(sem.acquire(False))
536 sem.release()
537 with sem:
538 self.assertFalse(sem.acquire(False))
539 if err:
540 raise err
541 _with()
542 self.assertTrue(sem.acquire(False))
543 sem.release()
544 self.assertRaises(TypeError, _with, TypeError)
545 self.assertTrue(sem.acquire(False))
546 sem.release()
547
548class SemaphoreTests(BaseSemaphoreTests):
549 """
550 Tests for unbounded semaphores.
551 """
552
553 def test_release_unacquired(self):
554 # Unbounded releases are allowed and increment the semaphore's value
555 sem = self.semtype(1)
556 sem.release()
557 sem.acquire()
558 sem.acquire()
559 sem.release()
560
561
562class BoundedSemaphoreTests(BaseSemaphoreTests):
563 """
564 Tests for bounded semaphores.
565 """
566
567 def test_release_unacquired(self):
568 # Cannot go past the initial value
569 sem = self.semtype()
570 self.assertRaises(ValueError, sem.release)
571 sem.acquire()
572 sem.release()
573 self.assertRaises(ValueError, sem.release)