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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
import py
from pypy.module.pypyjit.test_pypy_c.test_00_model import BaseTestPyPyC
class TestIntbound(BaseTestPyPyC):
def test_intbound_simple(self):
"""
This test only checks that we get the expected result, not that any
optimization has been applied.
"""
ops = ('<', '>', '<=', '>=', '==', '!=')
nbr = (3, 7)
for o1 in ops:
for o2 in ops:
for n1 in nbr:
for n2 in nbr:
src = '''
def f(i):
a, b = 3, 3
if i %s %d:
a = 0
else:
a = 1
if i %s %d:
b = 0
else:
b = 1
return a + b * 2
def main():
res = [0] * 4
idx = []
for i in range(15):
idx.extend([i] * 15)
for i in idx:
res[f(i)] += 1
return res
''' % (o1, n1, o2, n2)
yield self.run_and_check, src
def test_intbound_addsub_mix(self):
"""
This test only checks that we get the expected result, not that any
optimization has been applied.
"""
tests = ('i > 4', 'i > 2', 'i + 1 > 2', '1 + i > 4',
'i - 1 > 1', '1 - i > 1', '1 - i < -3',
'i == 1', 'i == 5', 'i != 1', '-2 * i < -4')
for t1 in tests:
for t2 in tests:
src = '''
def f(i):
a, b = 3, 3
if %s:
a = 0
else:
a = 1
if %s:
b = 0
else:
b = 1
return a + b * 2
def main():
res = [0] * 4
idx = []
for i in range(15):
idx.extend([i] * 15)
for i in idx:
res[f(i)] += 1
return res
''' % (t1, t2)
yield self.run_and_check, src
def test_intbound_gt(self):
def main(n):
i, a, b = 0, 0, 0
while i < n:
if i > -1:
a += 1
if i > -2:
b += 1
i += 1
return (a, b)
#
log = self.run(main, [300])
assert log.result == (300, 300)
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i10 = int_lt(i8, i9)
guard_true(i10, descr=...)
i12 = int_add_ovf(i7, 1)
guard_no_overflow(descr=...)
i14 = int_add_ovf(i6, 1)
guard_no_overflow(descr=...)
i17 = int_add(i8, 1)
--TICK--
jump(..., descr=...)
""")
def test_intbound_sub_lt(self):
def main():
i, a = 0, 0
while i < 300:
if i - 10 < 295:
a += 1
i += 1
return a
#
log = self.run(main, [])
assert log.result == 300
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i7 = int_lt(i5, 300)
guard_true(i7, descr=...)
i9 = int_sub_ovf(i5, 10)
guard_no_overflow(descr=...)
i11 = int_add_ovf(i4, 1)
guard_no_overflow(descr=...)
i13 = int_add(i5, 1)
--TICK--
jump(..., descr=...)
""")
def test_intbound_addsub_ge(self):
def main(n):
i, a, b = 0, 0, 0
while i < n:
if i + 5 >= 5:
a += 1
if i - 1 >= -1:
b += 1
i += 1
return (a, b)
#
log = self.run(main, [300])
assert log.result == (300, 300)
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i10 = int_lt(i8, i9)
guard_true(i10, descr=...)
i12 = int_add_ovf(i8, 5)
guard_no_overflow(descr=...)
i14 = int_add_ovf(i7, 1)
guard_no_overflow(descr=...)
i16s = int_sub(i8, 1)
i16 = int_add_ovf(i6, 1)
guard_no_overflow(descr=...)
i19 = int_add(i8, 1)
--TICK--
jump(..., descr=...)
""")
def test_intbound_addmul_ge(self):
def main(n):
i, a, b = 0, 0, 0
while i < 300:
if i + 5 >= 5:
a += 1
if 2 * i >= 0:
b += 1
i += 1
return (a, b)
#
log = self.run(main, [300])
assert log.result == (300, 300)
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i10 = int_lt(i8, 300)
guard_true(i10, descr=...)
i12 = int_add(i8, 5)
i14 = int_add_ovf(i7, 1)
guard_no_overflow(descr=...)
i16 = int_lshift(i8, 1)
i18 = int_add_ovf(i6, 1)
guard_no_overflow(descr=...)
i21 = int_add(i8, 1)
--TICK--
jump(..., descr=...)
""")
def test_intbound_eq(self):
def main(a, n):
i, s = 0, 0
while i < 300:
if a == 7:
s += a + 1
elif i == 10:
s += i
else:
s += 1
i += 1
return s
#
log = self.run(main, [7, 300])
assert log.result == main(7, 300)
log = self.run(main, [10, 300])
assert log.result == main(10, 300)
log = self.run(main, [42, 300])
assert log.result == main(42, 300)
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i10 = int_lt(i8, 300)
guard_true(i10, descr=...)
i12 = int_eq(i8, 10)
guard_false(i12, descr=...)
i14 = int_add_ovf(i7, 1)
guard_no_overflow(descr=...)
i16 = int_add(i8, 1)
--TICK--
jump(..., descr=...)
""")
def test_intbound_mul(self):
def main(a):
i, s = 0, 0
while i < 300:
assert i >= 0
if 2 * i < 30000:
s += 1
else:
s += a
i += 1
return s
#
log = self.run(main, [7])
assert log.result == 300
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i8 = int_lt(i6, 300)
guard_true(i8, descr=...)
guard_not_invalidated?
i10 = int_lshift(i6, 1)
i12 = int_add_ovf(i5, 1)
guard_no_overflow(descr=...)
i14 = int_add(i6, 1)
--TICK--
jump(..., descr=...)
""")
def test_assert(self):
def main(a):
i, s = 0, 0
while i < 300:
assert a == 7
s += a + 1
i += 1
return s
log = self.run(main, [7])
assert log.result == 300*8
loop, = log.loops_by_filename(self.filepath)
assert loop.match("""
i8 = int_lt(i6, 300)
guard_true(i8, descr=...)
guard_not_invalidated?
i10 = int_add_ovf(i5, 8)
guard_no_overflow(descr=...)
i12 = int_add(i6, 1)
--TICK--
jump(..., descr=...)
""")
def test_xor(self):
def main(b):
a = sa = 0
while a < 300:
if a > 0: # Specialises the loop
pass
if b > 10:
pass
if a^b >= 0: # ID: guard
sa += 1
sa += a^a # ID: a_xor_a
a += 1
return sa
log = self.run(main, [11])
assert log.result == 300
loop, = log.loops_by_filename(self.filepath)
# if both are >=0, a^b is known to be >=0
# note that we know that b>10
assert loop.match_by_id('guard', """
i10 = int_xor(i5, i7)
""")
#
# x^x is always optimized to 0
assert loop.match_by_id('a_xor_a', "")
log = self.run(main, [9])
assert log.result == 300
loop, = log.loops_by_filename(self.filepath, is_entry_bridge=True)
# we don't know that b>10, hence we cannot optimize it
assert loop.match_by_id('guard', """
i10 = int_xor(i5, i7)
i12 = int_ge(i10, 0)
guard_true(i12, descr=...)
""")
def test_abs_branch_free(self):
import sys
def main(start, stop):
res = 0
for i in range(start, stop):
res += abs(i) # ID: abs
return res
log = self.run(main, [-10000, 10000])
loop, = log.loops_by_filename(self.filepath)
assert loop.match_by_id('abs', """
setfield_gc(p18, i60, descr=...)
guard_not_invalidated(descr=...)
i63 = int_eq(i58, ...) # check whether it's MININT
guard_false(i63, descr=...)
i65 = int_rshift(i58, %s)
i66 = int_xor(i58, i65)
i67 = int_sub(i66, i65)
i68 = int_add_ovf(i51, i67)
guard_no_overflow(descr=...)
--TICK--
""" % sys.maxsize.bit_length())
|
