FilesExpand file tree

 master

/

stress_heap.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (37 loc) · 1.08 KB

 master

/

stress_heap.py

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (37 loc) · 1.08 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

# 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

try:

import utime as time

except ImportError:

import time

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,))

# wait for threads to finish

while n_finished < n_thread:

time.sleep(1)