Repository navigation
Expand file tree
/
Copy pathtest_memory.py
More file actions
147 lines (117 loc) · 3.99 KB
/
Copy pathtest_memory.py
File metadata and controls
147 lines (117 loc) · 3.99 KB
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#####################################################################################
#
# Copyright (c) Microsoft Corporation. All rights reserved.
#
# This source code is subject to terms and conditions of the Apache License, Version 2.0. A
# copy of the license can be found in the License.html file at the root of this distribution. If
# you cannot locate the Apache License, Version 2.0, please send an email to
# ironpy@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
# by the terms of the Apache License, Version 2.0.
#
# You must not remove this notice, or any other, from this software.
#
#
#####################################################################################
from iptest.assert_util import *
skiptest("win32")
skiptest("silverlight") #no time.clock or GetTotalMemory
import clr
clr.AddReference("Microsoft.Dynamic")
from Microsoft.Scripting.Generation import Snippets
import gc
skipMemoryCheck = Snippets.Shared.SaveSnippets or clr.GetCurrentRuntime().Configuration.DebugMode
from time import clock
# GetTotalMemory() actually pulls in System
def evalLoop(N):
for i in range(N):
func = compile(code, '<>', 'exec')
eval(func)
def evalTest(N):
startMem = GetTotalMemory()
startTime = clock()
evalLoop(N)
endTime = clock()
gc.collect(2)
endMem = GetTotalMemory()
return max(endMem-startMem, 0)
t_list = [
"if not 1 + 2 == 3: raise AssertionError('Assertion Failed')",
"(a,b) = (0, 1)",
"2+"*10 + "2",
"import sys",
"from time import clock",
"eval('2+2')",
"globals(), locals()",
"try:\n x = 10\nexcept:\n pass",
"def f(): pass",
"def f(a): pass",
"def f(a, b, c, d, e, f, g, h, i, j): pass",
"def f(*args): pass",
"def f(a, *args): pass",
"def f(func, *args): func(args)",
"def f(**args): pass",
"def f(a, b=2, c=[2,3]): pass",
"def f(x):\n for i in range(x):\n yield i",
"def f(x):\n print locals()",
"def f(x):\n print globals()",
"lambda x: x + 2",
"(lambda x: x + 2)(0)",
"(lambda x, y, z, u, v, w: x + 2)(0, 0, 0, 0, 0, 0)",
"class C:\n pass",
"class C:\n class D:pass\n pass",
"def f(x):\n def g(y):pass\n pass",
"def f(x):\n def g(*y):pass\n pass",
"class C:\n def f(self):\n pass",
"def f():\n class C: pass\n pass",
"def f():pass\nclass C:pass\nf()",
]
# account for adaptive compilation
expectedMem = 24000
if is_cli64:
expectedMem = int(expectedMem*1.25)
for code in t_list:
baseMem = evalTest(10)
usedMax = max(expectedMem, 4*baseMem)
if not skipMemoryCheck:
for repetitions in [100, 500]:
usedMem = evalTest(repetitions)
Assert(usedMem < usedMax, "Allocated %i (max %i, base %i) running %s %d times" % (usedMem, usedMax, baseMem, code, repetitions))
else:
# not to measure the memory usage, but still try to peverify the code at the end
evalTest(2)
e = compile("def f(): return 42\n", "", "single")
names = {}
eval(e, names)
AreEqual(names['f'](), 42)
code = """
x=2
def f(y):
return x+y
z = f(3)
"""
e = compile(code, "", "exec")
names = {}
eval(e, names)
AreEqual(names['z'], 5)
def test_cp26005():
def coroutine():
try: pass
except: pass
just_numbers = range(1,1000)
def inner_method():
return just_numbers
yield None
yield None
from System import GC
def get_memory():
for _ in xrange(4):
GC.Collect()
GC.WaitForPendingFinalizers()
return GC.GetTotalMemory(True)/1e6
before = get_memory()
for j in xrange(10000):
crt = coroutine()
crt.next()
after = get_memory()
Assert(after-before < 10)
test_cp26005()