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
450
451
452
453
454
455
456
457
458
|
from rpython.jit.metainterp.optimizeopt.intutils import IntBound, IntUpperBound, \
IntLowerBound, IntUnbounded, next_pow2_m1
from copy import copy
import sys
from rpython.rlib.rarithmetic import LONG_BIT, ovfcheck
from hypothesis import given, strategies
special_values = (
range(-100, 100) +
[2 ** i for i in range(1, LONG_BIT)] +
[-2 ** i for i in range(1, LONG_BIT)] +
[2 ** i - 1 for i in range(1, LONG_BIT)] +
[-2 ** i - 1 for i in range(1, LONG_BIT)] +
[2 ** i + 1 for i in range(1, LONG_BIT)] +
[-2 ** i + 1 for i in range(1, LONG_BIT)] +
[sys.maxint, -sys.maxint-1])
special_values = strategies.sampled_from(
[int(v) for v in special_values if type(int(v)) is int])
ints = strategies.builds(
int, # strategies.integers sometimes returns a long?
special_values | strategies.integers(
min_value=int(-sys.maxint-1), max_value=sys.maxint))
ints_or_none = strategies.none() | ints
def bound(a, b):
if a is None and b is None:
return IntUnbounded()
elif a is None:
return IntUpperBound(b)
elif b is None:
return IntLowerBound(a)
else:
return IntBound(a, b)
def const(a):
return bound(a,a)
def build_bound_with_contained_number(a, b, c):
a, b, c = sorted([a, b, c])
r = bound(a, c)
assert r.contains(b)
return r, b
bound_with_contained_number = strategies.builds(
build_bound_with_contained_number,
ints_or_none,
ints_or_none,
ints
)
unbounded = strategies.builds(
lambda x: (bound(None, None), int(x)),
ints
)
lower_bounded = strategies.builds(
lambda x, y: (bound(min(x, y), None), max(x, y)),
ints,
ints
)
upper_bounded = strategies.builds(
lambda x, y: (bound(None, max(x, y)), min(x, y)),
ints,
ints
)
bounded = strategies.builds(
build_bound_with_contained_number,
ints, ints, ints
)
constant = strategies.builds(
lambda x: (const(x), x),
ints
)
bound_with_contained_number = strategies.one_of(
unbounded, lower_bounded, upper_bounded, constant, bounded)
def some_bounds():
brd = [None] + range(-2, 3)
for lower in brd:
for upper in brd:
if lower is not None and upper is not None and lower > upper:
continue
yield (lower, upper, bound(lower, upper))
nbr = range(-5, 6)
def test_known():
for lower, upper, b in some_bounds():
inside = []
border = []
for n in nbr:
if (lower is None or n >= lower) and \
(upper is None or n <= upper):
if n == lower or n ==upper:
border.append(n)
else:
inside.append(n)
for n in nbr:
c = const(n)
if n in inside:
assert b.contains(n)
assert not b.known_lt(c)
assert not b.known_gt(c)
assert not b.known_le(c)
assert not b.known_ge(c)
elif n in border:
assert b.contains(n)
if n == upper:
assert b.known_le(const(upper))
else:
assert b.known_ge(const(lower))
else:
assert not b.contains(n)
some = (border + inside)[0]
if n < some:
assert b.known_gt(c)
else:
assert b.known_lt(c)
def test_make():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
lt = IntUnbounded()
lt.make_lt(b1)
lt.make_lt(b2)
for n in nbr:
c = const(n)
if b1.known_le(c) or b2.known_le(c):
assert lt.known_lt(c)
else:
assert not lt.known_lt(c)
assert not lt.known_gt(c)
assert not lt.known_ge(c)
gt = IntUnbounded()
gt.make_gt(b1)
gt.make_gt(b2)
for n in nbr:
c = const(n)
if b1.known_ge(c) or b2.known_ge(c):
assert gt.known_gt(c)
else:
assert not gt.known_gt(c)
assert not gt.known_lt(c)
assert not gt.known_le(c)
le = IntUnbounded()
le.make_le(b1)
le.make_le(b2)
for n in nbr:
c = const(n)
if b1.known_le(c) or b2.known_le(c):
assert le.known_le(c)
else:
assert not le.known_le(c)
assert not le.known_gt(c)
assert not le.known_ge(c)
ge = IntUnbounded()
ge.make_ge(b1)
ge.make_ge(b2)
for n in nbr:
c = const(n)
if b1.known_ge(c) or b2.known_ge(c):
assert ge.known_ge(c)
else:
assert not ge.known_ge(c)
assert not ge.known_lt(c)
assert not ge.known_le(c)
gl = IntUnbounded()
gl.make_ge(b1)
gl.make_le(b2)
for n in nbr:
c = const(n)
if b1.known_ge(c):
assert gl.known_ge(c)
else:
assert not gl.known_ge(c)
assert not gl.known_gt(c)
if b2.known_le(c):
assert gl.known_le(c)
else:
assert not gl.known_le(c)
assert not gl.known_lt(c)
def test_intersect():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b = copy(b1)
b.intersect(b2)
for n in nbr:
if b1.contains(n) and b2.contains(n):
assert b.contains(n)
else:
assert not b.contains(n)
def test_add():
for _, _, b1 in some_bounds():
for n1 in nbr:
b2 = b1.add(n1)
for n2 in nbr:
c1 = const(n2)
c2 = const(n2 + n1)
if b1.known_le(c1):
assert b2.known_le(c2)
else:
assert not b2.known_le(c2)
if b1.known_ge(c1):
assert b2.known_ge(c2)
else:
assert not b2.known_ge(c2)
if b1.known_le(c1):
assert b2.known_le(c2)
else:
assert not b2.known_lt(c2)
if b1.known_lt(c1):
assert b2.known_lt(c2)
else:
assert not b2.known_lt(c2)
if b1.known_gt(c1):
assert b2.known_gt(c2)
else:
assert not b2.known_gt(c2)
def test_add_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.add_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
assert b3.contains(n1 + n2)
a=bound(2, 4).add_bound(bound(1, 2))
assert not a.contains(2)
assert not a.contains(7)
def test_mul_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.mul_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
assert b3.contains(n1 * n2)
a=bound(2, 4).mul_bound(bound(1, 2))
assert not a.contains(1)
assert not a.contains(9)
a=bound(-3, 2).mul_bound(bound(1, 2))
assert not a.contains(-7)
assert not a.contains(5)
assert a.contains(-6)
assert a.contains(4)
a=bound(-3, 2).mul(-1)
for i in range(-2,4):
assert a.contains(i)
assert not a.contains(4)
assert not a.contains(-3)
def test_shift_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
bleft = b1.lshift_bound(b2)
bright = b1.rshift_bound(b2)
for n1 in nbr:
for n2 in range(10):
if b1.contains(n1) and b2.contains(n2):
assert bleft.contains(n1 << n2)
assert bright.contains(n1 >> n2)
def test_shift_overflow():
b10 = IntBound(0, 10)
b100 = IntBound(0, 100)
bmax = IntBound(0, sys.maxint/2)
assert not b10.lshift_bound(b100).has_upper
assert not bmax.lshift_bound(b10).has_upper
assert b10.lshift_bound(b10).has_upper
for b in (b10, b100, bmax, IntBound(0, 0)):
for shift_count_bound in (IntBound(7, LONG_BIT), IntBound(-7, 7)):
#assert not b.lshift_bound(shift_count_bound).has_upper
assert not b.rshift_bound(shift_count_bound).has_upper
def test_div_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.py_div_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
if n2 != 0:
assert b3.contains(n1 / n2) # Python-style div
a=bound(2, 4).py_div_bound(bound(1, 2))
assert not a.contains(0)
assert not a.contains(5)
a=bound(-3, 2).py_div_bound(bound(1, 2))
assert not a.contains(-4)
assert not a.contains(3)
assert a.contains(-3)
assert a.contains(0)
def test_mod_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.mod_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
if n2 != 0:
assert b3.contains(n1 % n2) # Python-style div
def test_sub_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.sub_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
assert b3.contains(n1 - n2)
a=bound(2, 4).sub_bound(bound(1, 2))
assert not a.contains(-1)
assert not a.contains(4)
def test_and_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.and_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
assert b3.contains(n1 & n2)
def test_or_bound():
for _, _, b1 in some_bounds():
for _, _, b2 in some_bounds():
b3 = b1.or_bound(b2)
for n1 in nbr:
for n2 in nbr:
if b1.contains(n1) and b2.contains(n2):
assert b3.contains(n1 | n2)
assert b3.contains(n1 ^ n2) # we use it for xor too
def test_next_pow2_m1():
assert next_pow2_m1(0) == 0
assert next_pow2_m1(1) == 1
assert next_pow2_m1(7) == 7
assert next_pow2_m1(256) == 511
assert next_pow2_m1(255) == 255
assert next_pow2_m1(80) == 127
assert next_pow2_m1((1 << 32) - 5) == (1 << 32) - 1
assert next_pow2_m1((1 << 64) - 1) == (1 << 64) - 1
@given(bound_with_contained_number, bound_with_contained_number)
def test_add_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
print b1, n1
print b2, n2
b3 = b1.add_bound(b2)
try:
r = ovfcheck(n1 + n2)
except OverflowError:
assert not b3.bounded()
else:
assert b3.contains(r)
@given(bound_with_contained_number, bound_with_contained_number)
def test_sub_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
print b1, n1
print b2, n2
b3 = b1.sub_bound(b2)
try:
r = ovfcheck(n1 - n2)
except OverflowError:
assert not b3.bounded()
else:
assert b3.contains(r)
@given(bound_with_contained_number, bound_with_contained_number)
def test_mul_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
b3 = b1.mul_bound(b2)
try:
r = ovfcheck(n1 * n2)
except OverflowError:
assert not b3.bounded()
else:
assert b3.contains(r)
@given(bound_with_contained_number, bound_with_contained_number)
def test_div_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
b3 = b1.py_div_bound(b2)
if n1 == -sys.maxint-1 and n2 == -1:
return # overflow
if n2 != 0:
assert b3.contains(n1 / n2) # Python-style div
@given(bound_with_contained_number, bound_with_contained_number)
def test_mod_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
b3 = b1.mod_bound(b2)
if n1 == -sys.maxint-1 and n2 == -1:
return # overflow
if n2 != 0:
assert b3.contains(n1 % n2) # Python-style mod
@given(bound_with_contained_number, bound_with_contained_number)
def test_and_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
b3 = b1.and_bound(b2)
r = n1 & n2
assert b3.contains(r)
@given(bound_with_contained_number, bound_with_contained_number)
def test_or_bound_random(t1, t2):
b1, n1 = t1
b2, n2 = t2
b3 = b1.or_bound(b2)
r = n1 | n2
assert b3.contains(r)
r = n1 ^ n2
assert b3.contains(r)
|
