2016-05-17 08:01:04 -04:00
|
|
|
# test concurrent interning of strings
|
|
|
|
#
|
|
|
|
# MIT license; Copyright (c) 2016 Damien P. George on behalf of Pycom Ltd
|
|
|
|
|
2017-02-04 07:33:20 -05:00
|
|
|
try:
|
|
|
|
import utime as time
|
|
|
|
except ImportError:
|
|
|
|
import time
|
2016-05-17 08:01:04 -04:00
|
|
|
import _thread
|
|
|
|
|
|
|
|
# function to check the interned string
|
|
|
|
def check(s, val):
|
|
|
|
assert type(s) == str
|
|
|
|
assert int(s) == val
|
|
|
|
|
2020-03-22 22:26:08 -04:00
|
|
|
|
2016-05-17 08:01:04 -04:00
|
|
|
# main thread function
|
|
|
|
def th(base, n):
|
|
|
|
for i in range(n):
|
|
|
|
# this will intern the string and check it
|
|
|
|
exec("check('%u', %u)" % (base + i, base + i))
|
|
|
|
|
|
|
|
with lock:
|
|
|
|
global n_finished
|
|
|
|
n_finished += 1
|
|
|
|
|
2020-03-22 22:26:08 -04:00
|
|
|
|
2016-05-17 08:01:04 -04:00
|
|
|
lock = _thread.allocate_lock()
|
|
|
|
n_thread = 4
|
|
|
|
n_finished = 0
|
2020-03-22 22:26:08 -04:00
|
|
|
n_qstr_per_thread = 100 # make 1000 for a more stressful test (uses more heap)
|
2016-05-17 08:01:04 -04:00
|
|
|
|
|
|
|
# spawn threads
|
|
|
|
for i in range(n_thread):
|
2016-05-31 12:36:06 -04:00
|
|
|
_thread.start_new_thread(th, (i * n_qstr_per_thread, n_qstr_per_thread))
|
2016-05-17 08:01:04 -04:00
|
|
|
|
2017-02-04 07:33:20 -05:00
|
|
|
# wait for threads to finish
|
2016-05-17 08:01:04 -04:00
|
|
|
while n_finished < n_thread:
|
2017-02-04 07:33:20 -05:00
|
|
|
time.sleep(1)
|
2016-05-17 08:01:04 -04:00
|
|
|
|
2020-03-22 22:26:08 -04:00
|
|
|
print("pass")
|