diff options
| author | Damien George <damien.p.george@gmail.com> | 2016-04-25 18:16:43 +0000 |
|---|---|---|
| committer | Damien George <damien.p.george@gmail.com> | 2016-06-28 11:28:49 +0100 |
| commit | dcc7c5bd891c5da69f430ab93c24aa2567521b71 (patch) | |
| tree | d6184d91e9dab43c817e6e249d11f07ef36b1bd4 /tests/thread/thread_stress_heap.py | |
| parent | c93d9caa8b8be81f7e6faf9f2ca2ad16d4942ab8 (diff) | |
tests/thread: Add tests for running GC within a thread, and heap stress.
Diffstat (limited to 'tests/thread/thread_stress_heap.py')
| -rw-r--r-- | tests/thread/thread_stress_heap.py | 42 |
1 files changed, 42 insertions, 0 deletions
diff --git a/tests/thread/thread_stress_heap.py b/tests/thread/thread_stress_heap.py new file mode 100644 index 000000000..ac3ebe049 --- /dev/null +++ b/tests/thread/thread_stress_heap.py @@ -0,0 +1,42 @@ +# stress test for the heap by allocating lots of objects within threads +# allocates about 5mb on the heap +# +# MIT license; Copyright (c) 2016 Damien P. George on behalf of Pycom Ltd + +import _thread + +def last(l): + return l[-1] + +def thread_entry(n): + # allocate a bytearray and fill it + data = bytearray(i for i in range(256)) + + # run a loop which allocates a small list and uses it each iteration + lst = 8 * [0] + sum = 0 + for i in range(n): + sum += last(lst) + lst = [0, 0, 0, 0, 0, 0, 0, i + 1] + + # check that the bytearray still has the right data + for i, b in enumerate(data): + assert i == b + + # print the result of the loop and indicate we are finished + with lock: + print(sum, lst[-1]) + global n_finished + n_finished += 1 + +lock = _thread.allocate_lock() +n_thread = 10 +n_finished = 0 + +# spawn threads +for i in range(n_thread): + _thread.start_new_thread(thread_entry, (10000,)) + +# busy wait for threads to finish +while n_finished < n_thread: + pass |
