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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
|
import py
from rpython.rlib.objectmodel import newlist_hint
from rpython.rlib.jit import JitDriver, promote, dont_look_inside
from rpython.jit.metainterp.test.support import LLJitMixin
class ListTests:
def check_all_virtualized(self):
self.check_resops(setarrayitem_gc=0, new_array=0, arraylen_gc=0,
getarrayitem_gc_i=0, getarrayitem_gc_r=0,
getarrayitem_gc_f=0)
def test_simple_array(self):
jitdriver = JitDriver(greens = [], reds = ['n'])
def f(n):
while n > 0:
jitdriver.can_enter_jit(n=n)
jitdriver.jit_merge_point(n=n)
lst = [n]
n = lst[0] - 1
return n
res = self.meta_interp(f, [10], listops=True)
assert res == 0
self.check_resops(int_sub=2)
self.check_all_virtualized()
def test_list_pass_around(self):
jitdriver = JitDriver(greens = [], reds = ['n', 'l'])
def f(n):
l = [3]
while n > 0:
jitdriver.can_enter_jit(n=n, l=l)
jitdriver.jit_merge_point(n=n, l=l)
x = l[0]
l = [x + 1]
n -= 1
return l[0]
res = self.meta_interp(f, [10], listops=True)
assert res == f(10)
self.check_all_virtualized()
def test_cannot_be_virtual(self):
jitdriver = JitDriver(greens = [], reds = ['n', 'l'])
def f(n):
l = [3] * 200
while n > 0:
jitdriver.can_enter_jit(n=n, l=l)
jitdriver.jit_merge_point(n=n, l=l)
x = l[n]
l = [3] * 200
l[3] = x
l[4] = x + 1
n -= 1
return l[0]
res = self.meta_interp(f, [10], listops=True)
assert res == f(10)
# one setitem should be gone by now
self.check_resops(setarrayitem_gc=4, getarrayitem_gc_i=2, call_r=2)
def test_ll_fixed_setitem_fast(self):
jitdriver = JitDriver(greens = [], reds = ['n', 'l'])
def f(n):
l = [1, 2, 3]
while n > 0:
jitdriver.can_enter_jit(n=n, l=l)
jitdriver.jit_merge_point(n=n, l=l)
l = l[:]
n -= 1
return l[0]
res = self.meta_interp(f, [10], listops=True)
assert res == 1
py.test.skip("Constant propagation of length missing")
self.check_loops(setarrayitem_gc=0, call=0)
def test_vlist_with_default_read(self):
jitdriver = JitDriver(greens=[], reds=['n'])
def f(n):
l = [1] * 20
while n > 0:
jitdriver.can_enter_jit(n=n)
jitdriver.jit_merge_point(n=n)
l = [0] * 20
l[3] = 5
x = l[-17] + l[5] # that should be zero
if n < 3:
return x
n -= 1
return l[0]
res = self.meta_interp(f, [10], listops=True, backendopt=True)
assert res == f(10)
self.check_resops(setarrayitem_gc=0, call=0, getarrayitem_gc_i=0)
def test_arraycopy_simpleoptimize(self):
def f():
l = [1, 2, 3, 4]
l2 = l[:]
return l2[0] + l2[1] + l2[2] + l2[3]
res = self.interp_operations(f, [], listops=True)
assert res == 10
def test_arraycopy_bug(self):
def f():
l = [1, 2, 3, 4]
l2 = [1, 2, 3, 5]
l[2] = 13
l2[0:len(l2)] = l[:]
return l2[0] + l2[1] + l2[2] + l2[3]
res = self.interp_operations(f, [], listops=True)
assert res == f()
def test_arraycopy_full(self):
jitdriver = JitDriver(greens = [], reds = ['n'])
def f(n):
l = []
l2 = []
while n > 0:
jitdriver.can_enter_jit(n=n)
jitdriver.jit_merge_point(n=n)
l = [1, 2, 3, n]
l2 = l[:]
n -= 1
return l2[0] + l2[1] + l2[2] + l2[3]
res = self.meta_interp(f, [5], listops=True)
assert res == 7
self.check_resops(call=0)
def test_arraymove_simpleoptimize(self):
def f():
l = [10, 20, 30, 40]
l.insert(1, 999)
return len(l) + l[1] + l[-1]
res = self.interp_operations(f, [], listops=True)
assert res == 5 + 999 + 40
def test_fold_getitem_1(self):
jitdriver = JitDriver(greens = ['pc', 'n', 'l'], reds = ['total'])
def f(n):
l = [100, n, 300, n, 500]
total = 0
pc = n
while True:
jitdriver.can_enter_jit(l=l, pc=pc, n=n, total=total)
jitdriver.jit_merge_point(l=l, pc=pc, n=n, total=total)
total += l[pc]
if total > 10000:
return total
pc -= 1
if pc < 0:
pc = n
res = self.meta_interp(f, [4], listops=True)
assert res == f(4)
self.check_resops(call=0)
def test_fold_getitem_2(self):
jitdriver = JitDriver(greens = ['pc', 'n', 'l'], reds = ['total', 'x'])
class X:
pass
def f(n):
l = [100, n, 300, n, 500]
total = 0
x = X()
x.pc = n
while True:
pc = x.pc
jitdriver.can_enter_jit(l=l, pc=pc, n=n, total=total, x=x)
jitdriver.jit_merge_point(l=l, pc=pc, n=n, total=total, x=x)
x.pc = pc
total += l[x.pc]
if total > 10000:
return total
x.pc -= 1
if x.pc < 0:
x.pc = n
res = self.meta_interp(f, [4], listops=True)
assert res == f(4)
self.check_resops(call=0, getfield_gc=0)
def test_fold_indexerror(self):
jitdriver = JitDriver(greens = [], reds = ['total', 'n', 'lst'])
def f(n):
lst = []
total = 0
while n > 0:
jitdriver.can_enter_jit(lst=lst, n=n, total=total)
jitdriver.jit_merge_point(lst=lst, n=n, total=total)
lst.append(n)
try:
total += lst[n]
except IndexError:
total += 1000
n -= 1
return total
res = self.meta_interp(f, [15], listops=True)
assert res == f(15)
self.check_resops(guard_exception=0)
def test_virtual_resize(self):
jitdriver = JitDriver(greens = [], reds = ['n', 's'])
def f(n):
s = 0
while n > 0:
jitdriver.jit_merge_point(n=n, s=s)
lst = []
lst += [1]
n -= len(lst)
s += lst[0]
lst.pop()
lst.append(1)
lst.insert(0, 5)
lst.insert(0, 5)
lst.insert(1, 6)
s *= lst.pop()
return s
res = self.meta_interp(f, [15], listops=True)
assert res == f(15)
self.check_resops({'jump': 1, 'int_gt': 2, 'int_add': 2,
'guard_true': 2, 'int_sub': 2})
def test_newlist_hint(self):
def f(i):
l = newlist_hint(i)
l[0] = 55
return len(l)
r = self.interp_operations(f, [3])
assert r == 0
def test_newlist_hint_optimized(self):
driver = JitDriver(greens = [], reds = ['i'])
def f(i):
while i > 0:
driver.jit_merge_point(i=i)
l = newlist_hint(5)
l.append(1)
i -= l[0]
self.meta_interp(f, [10], listops=True)
self.check_resops(new_array=0, call=0)
def test_list_mul(self):
def f(i):
l = [0] * i
return len(l)
r = self.interp_operations(f, [3])
assert r == 3
r = self.interp_operations(f, [-1])
assert r == 0
def test_list_mul_nonzero(self):
driver = JitDriver(greens=[], reds=['i', 'n'])
def f(n):
i = 0
while i < n:
driver.jit_merge_point(i=i, n=n)
x = promote(n)
l = [-1] * x
i -= l[2]
return i
res = self.meta_interp(f, [5])
assert res == 5
self.check_resops(call=0)
def test_list_mul_virtual(self):
class Foo:
def __init__(self, l):
self.l = l
l[0] = self
myjitdriver = JitDriver(greens = [], reds = ['y'])
def f(y):
while y > 0:
myjitdriver.jit_merge_point(y=y)
Foo([None] * 5)
y -= 1
return 42
self.meta_interp(f, [5])
self.check_resops({'int_sub': 2,
'int_gt': 2,
'guard_true': 2,
'jump': 1})
def test_list_mul_virtual_nonzero(self):
class base:
pass
class Foo(base):
def __init__(self, l):
self.l = l
l[0] = self
class nil(base):
pass
nil = nil()
myjitdriver = JitDriver(greens = [], reds = ['y'])
def f(y):
while y > 0:
myjitdriver.jit_merge_point(y=y)
Foo([nil] * 5)
y -= 1
return 42
self.meta_interp(f, [5])
self.check_resops({'int_sub': 2,
'int_gt': 2,
'guard_true': 2,
'jump': 1})
def test_list_mul_unsigned_virtual(self):
from rpython.rlib.rarithmetic import r_uint
class Foo:
def __init__(self, l):
self.l = l
l[0] = self
myjitdriver = JitDriver(greens = [], reds = ['y'])
def f(y):
while y > 0:
myjitdriver.jit_merge_point(y=y)
Foo([None] * r_uint(5))
y -= 1
return 42
self.meta_interp(f, [5])
self.check_resops({'int_sub': 2,
'int_gt': 2,
'guard_true': 2,
'jump': 1})
def test_conditional_call_append(self):
jitdriver = JitDriver(greens = [], reds = 'auto')
def f(n):
l = []
while n > 0:
jitdriver.jit_merge_point()
l.append(n)
n -= 1
return len(l)
res = self.meta_interp(f, [10])
assert res == 10
self.check_resops(call=0, cond_call=2)
def test_conditional_call_pop(self):
jitdriver = JitDriver(greens = [], reds = 'auto')
def f(n):
l = range(n)
while n > 0:
jitdriver.jit_merge_point()
l.pop()
n -= 1
return len(l)
res = self.meta_interp(f, [10])
assert res == 0
self.check_resops(call=0, cond_call=2)
def test_reverse_unrolling(self):
jitdriver = JitDriver(greens = ['constsize'], reds = 'auto')
def f(n, constsize):
l = range(n)
l.append(constsize * 100)
while n > 0:
jitdriver.jit_merge_point(constsize=constsize)
if constsize:
promote(len(l))
l2 = list(l)
l2.reverse()
n -= l2[-2]
l2.append(constsize * 100) # make resizable
return len(l)
# we know the size, let's unroll reverse
res = self.meta_interp(f, [10, True])
assert res == 11
self.check_resops(getarrayitem_gc_i=20)
# size unknown, mustn't unroll
res = self.meta_interp(f, [10, False])
assert res == 11
self.check_resops(getarrayitem_gc_i=2, call_n=4)
class TestLLtype(ListTests, LLJitMixin):
def test_listops_dont_invalidate_caches(self):
class A(object):
pass
jitdriver = JitDriver(greens = [], reds = ['n', 'a', 'lst'])
def f(n):
a = A()
a.x = 1
if n < 1091212:
a.x = 2 # fool the annotator
lst = [n * 5, n * 10, n * 20]
while n > 0:
jitdriver.can_enter_jit(n=n, a=a, lst=lst)
jitdriver.jit_merge_point(n=n, a=a, lst=lst)
n += a.x
n = lst.pop()
lst.append(n - 10 + a.x)
if a.x in lst:
pass
a.x = a.x + 1 - 1
a = lst.pop()
b = lst.pop()
return a * b
res = self.meta_interp(f, [37])
assert res == f(37)
# There is the one actual field on a, plus several fields on the list
# itself
self.check_resops(getfield_gc_i=2, getfield_gc_r=5)
def test_zero_init_resizable(self):
def f(n):
l = [0] * n
l.append(123)
return len(l) + l[0] + l[1] + l[2] + l[3] + l[4] + l[5] + l[6]
res = self.interp_operations(f, [10], listops=True, inline=True)
assert res == 11
self.check_operations_history(new_array_clear=1)
def test_mul_uses_alloc_and_set(self):
def f(n):
l = [[5], [1, 2, 3]]
return len(l[n] * 100)
res = self.interp_operations(f, [0], listops=True, inline=True)
self.check_operations_history(setarrayitem_gc=106)
|
