b070765427
The native emitter will not release/bounce the GIL when running code, so if it runs tight loops then no other threads get a chance to run (if the GIL is enabled). So for the thread tests, explicitly include a call to `time.sleep(0)` (or equivalent) to bounce the GIL and give other threads a chance to run. For some tests (eg `thread_coop.py`) the whole point of the test is to test that the GIL is correctly bounced. So for those cases force the use of the bytecode emitter for the busy functions. Signed-off-by: Damien George <damien@micropython.org>
47 lines
952 B
Python
47 lines
952 B
Python
# test concurrent mutating access to a shared list object
|
|
#
|
|
# MIT license; Copyright (c) 2016 Damien P. George on behalf of Pycom Ltd
|
|
|
|
import time
|
|
import _thread
|
|
|
|
# the shared list
|
|
li = list()
|
|
|
|
|
|
# main thread function
|
|
def th(n, lo, hi):
|
|
for repeat in range(n):
|
|
for i in range(lo, hi):
|
|
li.append(i)
|
|
assert li.count(i) == repeat + 1
|
|
|
|
li.extend([i, i])
|
|
assert li.count(i) == repeat + 3
|
|
|
|
li.remove(i)
|
|
assert li.count(i) == repeat + 2
|
|
|
|
li.remove(i)
|
|
assert li.count(i) == repeat + 1
|
|
|
|
with lock:
|
|
global n_finished
|
|
n_finished += 1
|
|
|
|
|
|
lock = _thread.allocate_lock()
|
|
n_thread = 4
|
|
n_finished = 0
|
|
|
|
# spawn threads
|
|
for i in range(n_thread):
|
|
_thread.start_new_thread(th, (4, i * 60, (i + 1) * 60))
|
|
|
|
# busy wait for threads to finish
|
|
while n_finished < n_thread:
|
|
time.sleep(0)
|
|
|
|
# check list has correct contents
|
|
li.sort()
|
|
print(li)
|