"(no _at_fork_reinit method)")
-def _wait():
- # A crude wait/yield function not relying on synchronization primitives.
- time.sleep(0.01)
+def wait_threads_blocked(nthread):
+ # Arbitrary sleep to wait until N threads are blocked,
+ # like waiting for a lock.
+ time.sleep(0.010 * nthread)
+
class Bunch(object):
"""
A bunch of threads.
"""
- def __init__(self, f, n, wait_before_exit=False):
+ def __init__(self, func, nthread, wait_before_exit=False):
"""
- Construct a bunch of `n` threads running the same function `f`.
+ Construct a bunch of `nthread` threads running the same function `func`.
If `wait_before_exit` is True, the threads won't terminate until
do_finish() is called.
"""
- self.f = f
- self.n = n
+ self.func = func
+ self.nthread = nthread
self.started = []
self.finished = []
+ self.exceptions = []
self._can_exit = not wait_before_exit
- self.wait_thread = threading_helper.wait_threads_exit()
- self.wait_thread.__enter__()
+ self._wait_thread = None
- def task():
- tid = threading.get_ident()
- self.started.append(tid)
- try:
- f()
- finally:
- self.finished.append(tid)
- while not self._can_exit:
- _wait()
+ def task(self):
+ tid = threading.get_ident()
+ self.started.append(tid)
+ try:
+ self.func()
+ except BaseException as exc:
+ self.exceptions.append(exc)
+ finally:
+ self.finished.append(tid)
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if self._can_exit:
+ break
+
+ def __enter__(self):
+ self._wait_thread = threading_helper.wait_threads_exit(support.SHORT_TIMEOUT)
+ self._wait_thread.__enter__()
try:
- for i in range(n):
- start_new_thread(task, ())
+ for _ in range(self.nthread):
+ start_new_thread(self.task, ())
except:
self._can_exit = True
raise
- def wait_for_started(self):
- while len(self.started) < self.n:
- _wait()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(self.started) >= self.nthread:
+ break
+
+ return self
+
+ def __exit__(self, exc_type, exc_value, traceback):
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(self.finished) >= self.nthread:
+ break
- def wait_for_finished(self):
- while len(self.finished) < self.n:
- _wait()
- # Wait for threads exit
- self.wait_thread.__exit__(None, None, None)
+ # Wait until threads completely exit according to _thread._count()
+ self._wait_thread.__exit__(None, None, None)
+
+ # Break reference cycle
+ exceptions = self.exceptions
+ self.exceptions = None
+ if exceptions:
+ raise ExceptionGroup(f"{self.func} threads raised exceptions",
+ exceptions)
def do_finish(self):
self._can_exit = True
Tests for both recursive and non-recursive locks.
"""
+ def wait_phase(self, phase, expected):
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(phase) >= expected:
+ break
+ self.assertEqual(len(phase), expected)
+
def test_constructor(self):
lock = self.locktype()
del lock
result = []
def f():
result.append(lock.acquire(False))
- Bunch(f, 1).wait_for_finished()
+ with Bunch(f, 1):
+ pass
self.assertFalse(result[0])
lock.release()
def test_acquire_contended(self):
lock = self.locktype()
lock.acquire()
- N = 5
def f():
lock.acquire()
lock.release()
- b = Bunch(f, N)
- b.wait_for_started()
- _wait()
- self.assertEqual(len(b.finished), 0)
- lock.release()
- b.wait_for_finished()
- self.assertEqual(len(b.finished), N)
+ N = 5
+ with Bunch(f, N) as bunch:
+ # Threads block on lock.acquire()
+ wait_threads_blocked(N)
+ self.assertEqual(len(bunch.finished), 0)
+
+ # Threads unblocked
+ lock.release()
+
+ self.assertEqual(len(bunch.finished), N)
def test_with(self):
lock = self.locktype()
def f():
lock.acquire()
lock.release()
- def _with(err=None):
+
+ def with_lock(err=None):
with lock:
if err is not None:
raise err
- _with()
- # Check the lock is unacquired
- Bunch(f, 1).wait_for_finished()
- self.assertRaises(TypeError, _with, TypeError)
- # Check the lock is unacquired
- Bunch(f, 1).wait_for_finished()
+
+ # Acquire the lock, do nothing, with releases the lock
+ with lock:
+ pass
+
+ # Check that the lock is unacquired
+ with Bunch(f, 1):
+ pass
+
+ # Acquire the lock, raise an exception, with releases the lock
+ with self.assertRaises(TypeError):
+ with lock:
+ raise TypeError
+
+ # Check that the lock is unacquired even if after an exception
+ # was raised in the previous "with lock:" block
+ with Bunch(f, 1):
+ pass
def test_thread_leak(self):
# The lock shouldn't leak a Thread instance when used from a foreign
def f():
lock.acquire()
lock.release()
- n = len(threading.enumerate())
+
# We run many threads in the hope that existing threads ids won't
# be recycled.
- Bunch(f, 15).wait_for_finished()
- if len(threading.enumerate()) != n:
- # There is a small window during which a Thread instance's
- # target function has finished running, but the Thread is still
- # alive and registered. Avoid spurious failures by waiting a
- # bit more (seen on a buildbot).
- time.sleep(0.4)
- self.assertEqual(n, len(threading.enumerate()))
+ with Bunch(f, 15):
+ pass
def test_timeout(self):
lock = self.locktype()
results.append(lock.acquire(timeout=0.5))
t2 = time.monotonic()
results.append(t2 - t1)
- Bunch(f, 1).wait_for_finished()
+ with Bunch(f, 1):
+ pass
self.assertFalse(results[0])
self.assertTimeout(results[1], 0.5)
phase.append(None)
with threading_helper.wait_threads_exit():
+ # Thread blocked on lock.acquire()
start_new_thread(f, ())
- while len(phase) == 0:
- _wait()
- _wait()
- self.assertEqual(len(phase), 1)
+ self.wait_phase(phase, 1)
+
+ # Thread unblocked
lock.release()
- while len(phase) == 1:
- _wait()
- self.assertEqual(len(phase), 2)
+ self.wait_phase(phase, 2)
def test_different_thread(self):
# Lock can be released from a different thread.
lock.acquire()
def f():
lock.release()
- b = Bunch(f, 1)
- b.wait_for_finished()
+ with Bunch(f, 1):
+ pass
lock.acquire()
lock.release()
def f():
lock.acquire()
phase.append(None)
- while len(phase) == 1:
- _wait()
+
+ self.wait_phase(phase, 2)
lock.release()
phase.append(None)
with threading_helper.wait_threads_exit():
+ # Thread blocked on lock.acquire()
start_new_thread(f, ())
- while len(phase) == 0:
- _wait()
- self.assertEqual(len(phase), 1)
+ self.wait_phase(phase, 1)
self.assertEqual(0, lock._recursion_count())
+
+ # Thread unblocked
phase.append(None)
- while len(phase) == 2:
- _wait()
- self.assertEqual(len(phase), 3)
+ self.wait_phase(phase, 3)
self.assertEqual(0, lock._recursion_count())
def test_different_thread(self):
lock = self.locktype()
def f():
lock.acquire()
- b = Bunch(f, 1, True)
- try:
- self.assertRaises(RuntimeError, lock.release)
- finally:
- b.do_finish()
- b.wait_for_finished()
+
+ with Bunch(f, 1, True) as bunch:
+ try:
+ self.assertRaises(RuntimeError, lock.release)
+ finally:
+ bunch.do_finish()
def test__is_owned(self):
lock = self.locktype()
result = []
def f():
result.append(lock._is_owned())
- Bunch(f, 1).wait_for_finished()
+ with Bunch(f, 1):
+ pass
self.assertFalse(result[0])
lock.release()
self.assertTrue(lock._is_owned())
def f():
results1.append(evt.wait())
results2.append(evt.wait())
- b = Bunch(f, N)
- b.wait_for_started()
- _wait()
- self.assertEqual(len(results1), 0)
- evt.set()
- b.wait_for_finished()
+
+ with Bunch(f, N):
+ # Threads blocked on first evt.wait()
+ wait_threads_blocked(N)
+ self.assertEqual(len(results1), 0)
+
+ # Threads unblocked
+ evt.set()
+
self.assertEqual(results1, [True] * N)
self.assertEqual(results2, [True] * N)
r = evt.wait(0.5)
t2 = time.monotonic()
results2.append((r, t2 - t1))
- Bunch(f, N).wait_for_finished()
+
+ with Bunch(f, N):
+ pass
+
self.assertEqual(results1, [False] * N)
for r, dt in results2:
self.assertFalse(r)
self.assertTimeout(dt, 0.5)
+
# The event is set
results1 = []
results2 = []
evt.set()
- Bunch(f, N).wait_for_finished()
+ with Bunch(f, N):
+ pass
+
self.assertEqual(results1, [True] * N)
for r, dt in results2:
self.assertTrue(r)
def test_set_and_clear(self):
- # Issue #13502: check that wait() returns true even when the event is
+ # gh-57711: check that wait() returns true even when the event is
# cleared before the waiting thread is woken up.
- evt = self.eventtype()
+ event = self.eventtype()
results = []
- timeout = 0.250
- N = 5
def f():
- results.append(evt.wait(timeout * 4))
- b = Bunch(f, N)
- b.wait_for_started()
- time.sleep(timeout)
- evt.set()
- evt.clear()
- b.wait_for_finished()
+ results.append(event.wait(support.LONG_TIMEOUT))
+
+ N = 5
+ with Bunch(f, N):
+ # Threads blocked on event.wait()
+ wait_threads_blocked(N)
+
+ # Threads unblocked
+ event.set()
+ event.clear()
+
self.assertEqual(results, [True] * N)
@requires_fork
# Note that this test is sensitive to timing. If the worker threads
# don't execute in a timely fashion, the main thread may think they
# are further along then they are. The main thread therefore issues
- # _wait() statements to try to make sure that it doesn't race ahead
- # of the workers.
+ # wait_threads_blocked() statements to try to make sure that it doesn't
+ # race ahead of the workers.
# Secondly, this test assumes that condition variables are not subject
# to spurious wakeups. The absence of spurious wakeups is an implementation
# detail of Condition Variables in current CPython, but in general, not
# a guaranteed property of condition variables as a programming
# construct. In particular, it is possible that this can no longer
# be conveniently guaranteed should their implementation ever change.
- N = 5
ready = []
results1 = []
results2 = []
cond.acquire()
ready.append(phase_num)
result = cond.wait()
+
cond.release()
results1.append((result, phase_num))
+
cond.acquire()
ready.append(phase_num)
+
result = cond.wait()
cond.release()
results2.append((result, phase_num))
- b = Bunch(f, N)
- b.wait_for_started()
- # first wait, to ensure all workers settle into cond.wait() before
- # we continue. See issues #8799 and #30727.
- while len(ready) < 5:
- _wait()
- ready.clear()
- self.assertEqual(results1, [])
- # Notify 3 threads at first
- cond.acquire()
- cond.notify(3)
- _wait()
- phase_num = 1
- cond.release()
- while len(results1) < 3:
- _wait()
- self.assertEqual(results1, [(True, 1)] * 3)
- self.assertEqual(results2, [])
- # make sure all awaken workers settle into cond.wait()
- while len(ready) < 3:
- _wait()
- # Notify 5 threads: they might be in their first or second wait
- cond.acquire()
- cond.notify(5)
- _wait()
- phase_num = 2
- cond.release()
- while len(results1) + len(results2) < 8:
- _wait()
- self.assertEqual(results1, [(True, 1)] * 3 + [(True, 2)] * 2)
- self.assertEqual(results2, [(True, 2)] * 3)
- # make sure all workers settle into cond.wait()
- while len(ready) < 5:
- _wait()
- # Notify all threads: they are all in their second wait
- cond.acquire()
- cond.notify_all()
- _wait()
- phase_num = 3
- cond.release()
- while len(results2) < 5:
- _wait()
- self.assertEqual(results1, [(True, 1)] * 3 + [(True,2)] * 2)
- self.assertEqual(results2, [(True, 2)] * 3 + [(True, 3)] * 2)
- b.wait_for_finished()
+
+ N = 5
+ with Bunch(f, N):
+ # first wait, to ensure all workers settle into cond.wait() before
+ # we continue. See issues #8799 and #30727.
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(ready) >= N:
+ break
+
+ ready.clear()
+ self.assertEqual(results1, [])
+
+ # Notify 3 threads at first
+ count1 = 3
+ cond.acquire()
+ cond.notify(count1)
+ wait_threads_blocked(count1)
+
+ # Phase 1
+ phase_num = 1
+ cond.release()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(results1) >= count1:
+ break
+
+ self.assertEqual(results1, [(True, 1)] * count1)
+ self.assertEqual(results2, [])
+
+ # Wait until awaken workers are blocked on cond.wait()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(ready) >= count1 :
+ break
+
+ # Notify 5 threads: they might be in their first or second wait
+ cond.acquire()
+ cond.notify(5)
+ wait_threads_blocked(N)
+
+ # Phase 2
+ phase_num = 2
+ cond.release()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(results1) + len(results2) >= (N + count1):
+ break
+
+ count2 = N - count1
+ self.assertEqual(results1, [(True, 1)] * count1 + [(True, 2)] * count2)
+ self.assertEqual(results2, [(True, 2)] * count1)
+
+ # Make sure all workers settle into cond.wait()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(ready) >= N:
+ break
+
+ # Notify all threads: they are all in their second wait
+ cond.acquire()
+ cond.notify_all()
+ wait_threads_blocked(N)
+
+ # Phase 3
+ phase_num = 3
+ cond.release()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(results2) >= N:
+ break
+ self.assertEqual(results1, [(True, 1)] * count1 + [(True, 2)] * count2)
+ self.assertEqual(results2, [(True, 2)] * count1 + [(True, 3)] * count2)
def test_notify(self):
cond = self.condtype()
def test_timeout(self):
cond = self.condtype()
+ timeout = 0.5
results = []
- N = 5
def f():
cond.acquire()
t1 = time.monotonic()
- result = cond.wait(0.5)
+ result = cond.wait(timeout)
t2 = time.monotonic()
cond.release()
results.append((t2 - t1, result))
- Bunch(f, N).wait_for_finished()
+
+ N = 5
+ with Bunch(f, N):
+ pass
self.assertEqual(len(results), N)
+
for dt, result in results:
- self.assertTimeout(dt, 0.5)
+ self.assertTimeout(dt, timeout)
# Note that conceptually (that"s the condition variable protocol)
# a wait() may succeed even if no one notifies us and before any
# timeout occurs. Spurious wakeups can occur.
state = 0
def f():
with cond:
- result = cond.wait_for(lambda : state==4)
+ result = cond.wait_for(lambda: state == 4)
self.assertTrue(result)
self.assertEqual(state, 4)
- b = Bunch(f, 1)
- b.wait_for_started()
- for i in range(4):
- time.sleep(0.01)
- with cond:
- state += 1
- cond.notify()
- b.wait_for_finished()
+
+ with Bunch(f, 1):
+ for i in range(4):
+ time.sleep(0.010)
+ with cond:
+ state += 1
+ cond.notify()
def test_waitfor_timeout(self):
cond = self.condtype()
self.assertFalse(result)
self.assertTimeout(dt, 0.1)
success.append(None)
- b = Bunch(f, 1)
- b.wait_for_started()
- # Only increment 3 times, so state == 4 is never reached.
- for i in range(3):
- time.sleep(0.01)
- with cond:
- state += 1
- cond.notify()
- b.wait_for_finished()
+
+ with Bunch(f, 1):
+ # Only increment 3 times, so state == 4 is never reached.
+ for i in range(3):
+ time.sleep(0.010)
+ with cond:
+ state += 1
+ cond.notify()
+
self.assertEqual(len(success), 1)
del sem
def test_acquire_contended(self):
- sem = self.semtype(7)
+ sem_value = 7
+ sem = self.semtype(sem_value)
sem.acquire()
- N = 10
+
sem_results = []
results1 = []
results2 = []
phase_num = 0
- def f():
+
+ def func():
sem_results.append(sem.acquire())
results1.append(phase_num)
+
sem_results.append(sem.acquire())
results2.append(phase_num)
- b = Bunch(f, 10)
- b.wait_for_started()
- while len(results1) + len(results2) < 6:
- _wait()
- self.assertEqual(results1 + results2, [0] * 6)
- phase_num = 1
- for i in range(7):
- sem.release()
- while len(results1) + len(results2) < 13:
- _wait()
- self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7)
- phase_num = 2
- for i in range(6):
+
+ def wait_count(count):
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(results1) + len(results2) >= count:
+ break
+
+ N = 10
+ with Bunch(func, N):
+ # Phase 0
+ count1 = sem_value - 1
+ wait_count(count1)
+ self.assertEqual(results1 + results2, [0] * count1)
+
+ # Phase 1
+ phase_num = 1
+ for i in range(sem_value):
+ sem.release()
+ count2 = sem_value
+ wait_count(count1 + count2)
+ self.assertEqual(sorted(results1 + results2),
+ [0] * count1 + [1] * count2)
+
+ # Phase 2
+ phase_num = 2
+ count3 = (sem_value - 1)
+ for i in range(count3):
+ sem.release()
+ wait_count(count1 + count2 + count3)
+ self.assertEqual(sorted(results1 + results2),
+ [0] * count1 + [1] * count2 + [2] * count3)
+ # The semaphore is still locked
+ self.assertFalse(sem.acquire(False))
+
+ # Final release, to let the last thread finish
+ count4 = 1
sem.release()
- while len(results1) + len(results2) < 19:
- _wait()
- self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7 + [2] * 6)
- # The semaphore is still locked
- self.assertFalse(sem.acquire(False))
- # Final release, to let the last thread finish
- sem.release()
- b.wait_for_finished()
- self.assertEqual(sem_results, [True] * (6 + 7 + 6 + 1))
+
+ self.assertEqual(sem_results,
+ [True] * (count1 + count2 + count3 + count4))
def test_multirelease(self):
- sem = self.semtype(7)
+ sem_value = 7
+ sem = self.semtype(sem_value)
sem.acquire()
+
results1 = []
results2 = []
phase_num = 0
- def f():
+ def func():
sem.acquire()
results1.append(phase_num)
+
sem.acquire()
results2.append(phase_num)
- b = Bunch(f, 10)
- b.wait_for_started()
- while len(results1) + len(results2) < 6:
- _wait()
- self.assertEqual(results1 + results2, [0] * 6)
- phase_num = 1
- sem.release(7)
- while len(results1) + len(results2) < 13:
- _wait()
- self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7)
- phase_num = 2
- sem.release(6)
- while len(results1) + len(results2) < 19:
- _wait()
- self.assertEqual(sorted(results1 + results2), [0] * 6 + [1] * 7 + [2] * 6)
- # The semaphore is still locked
- self.assertFalse(sem.acquire(False))
- # Final release, to let the last thread finish
- sem.release()
- b.wait_for_finished()
+
+ def wait_count(count):
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if len(results1) + len(results2) >= count:
+ break
+
+ with Bunch(func, 10):
+ # Phase 0
+ count1 = sem_value - 1
+ wait_count(count1)
+ self.assertEqual(results1 + results2, [0] * count1)
+
+ # Phase 1
+ phase_num = 1
+ count2 = sem_value
+ sem.release(count2)
+ wait_count(count1 + count2)
+ self.assertEqual(sorted(results1 + results2),
+ [0] * count1 + [1] * count2)
+
+ # Phase 2
+ phase_num = 2
+ count3 = sem_value - 1
+ sem.release(count3)
+ wait_count(count1 + count2 + count3)
+ self.assertEqual(sorted(results1 + results2),
+ [0] * count1 + [1] * count2 + [2] * count3)
+ # The semaphore is still locked
+ self.assertFalse(sem.acquire(False))
+
+ # Final release, to let the last thread finish
+ sem.release()
def test_try_acquire(self):
sem = self.semtype(2)
def f():
results.append(sem.acquire(False))
results.append(sem.acquire(False))
- Bunch(f, 5).wait_for_finished()
+ with Bunch(f, 5):
+ pass
# There can be a thread switch between acquiring the semaphore and
# appending the result, therefore results will not necessarily be
# ordered.
def f():
sem.acquire()
sem.release()
- b = Bunch(f, 1)
- b.wait_for_started()
- _wait()
- self.assertFalse(b.finished)
- sem.release()
- b.wait_for_finished()
+
+ with Bunch(f, 1) as bunch:
+ # Thread blocked on sem.acquire()
+ wait_threads_blocked(1)
+ self.assertFalse(bunch.finished)
+
+ # Thread unblocked
+ sem.release()
def test_with(self):
sem = self.semtype(2)
def setUp(self):
self.barrier = self.barriertype(self.N, timeout=self.defaultTimeout)
+
def tearDown(self):
self.barrier.abort()
def run_threads(self, f):
- b = Bunch(f, self.N-1)
- f()
- b.wait_for_finished()
+ with Bunch(f, self.N):
+ pass
def multipass(self, results, n):
m = self.barrier.parties
i = self.barrier.wait()
if i == self.N//2:
# Wait until the other threads are all in the barrier.
- while self.barrier.n_waiting < self.N-1:
- time.sleep(0.001)
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if self.barrier.n_waiting >= (self.N - 1):
+ break
self.barrier.reset()
else:
try:
i = self.barrier.wait()
if i == self.N // 2:
# One thread is late!
- time.sleep(1.0)
+ time.sleep(self.defaultTimeout / 2)
# Default timeout is 2.0, so this is shorter.
self.assertRaises(threading.BrokenBarrierError,
- self.barrier.wait, 0.5)
+ self.barrier.wait, self.defaultTimeout / 4)
self.run_threads(f)
def test_default_timeout(self):
"""
Test the barrier's default timeout
"""
- # gh-109401: Barrier timeout should be long enough
- # to create 4 threads on a slow CI.
- timeout = 1.0
- barrier = self.barriertype(self.N, timeout=timeout)
+ timeout = 0.100
+ barrier = self.barriertype(2, timeout=timeout)
def f():
- i = barrier.wait()
- if i == self.N // 2:
- # One thread is later than the default timeout.
- time.sleep(timeout * 2)
- self.assertRaises(threading.BrokenBarrierError, barrier.wait)
- self.run_threads(f)
+ self.assertRaises(threading.BrokenBarrierError,
+ barrier.wait)
+
+ start_time = time.monotonic()
+ with Bunch(f, 1):
+ pass
+ dt = time.monotonic() - start_time
+ self.assertGreaterEqual(dt, timeout)
def test_single_thread(self):
b = self.barriertype(1)
b.wait()
def test_repr(self):
- b = self.barriertype(3)
- self.assertRegex(repr(b), r"<\w+\.Barrier at .*: waiters=0/3>")
+ barrier = self.barriertype(3)
+ timeout = support.LONG_TIMEOUT
+ self.assertRegex(repr(barrier), r"<\w+\.Barrier at .*: waiters=0/3>")
def f():
- b.wait(3)
- bunch = Bunch(f, 2)
- bunch.wait_for_started()
- time.sleep(0.2)
- self.assertRegex(repr(b), r"<\w+\.Barrier at .*: waiters=2/3>")
- b.wait(3)
- bunch.wait_for_finished()
- self.assertRegex(repr(b), r"<\w+\.Barrier at .*: waiters=0/3>")
- b.abort()
- self.assertRegex(repr(b), r"<\w+\.Barrier at .*: broken>")
+ barrier.wait(timeout)
+
+ N = 2
+ with Bunch(f, N):
+ # Threads blocked on barrier.wait()
+ for _ in support.sleeping_retry(support.SHORT_TIMEOUT):
+ if barrier.n_waiting >= N:
+ break
+ self.assertRegex(repr(barrier),
+ r"<\w+\.Barrier at .*: waiters=2/3>")
+
+ # Threads unblocked
+ barrier.wait(timeout)
+
+ self.assertRegex(repr(barrier),
+ r"<\w+\.Barrier at .*: waiters=0/3>")
+
+ # Abort the barrier
+ barrier.abort()
+ self.assertRegex(repr(barrier),
+ r"<\w+\.Barrier at .*: broken>")
projects / thirdparty / Python / cpython.git / commitdiff
