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 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699
|
import py, sys
from rpython.jit.metainterp.test.support import LLJitMixin
from rpython.rlib.jit import JitDriver, dont_look_inside
from rpython.rlib.rarithmetic import ovfcheck, LONG_BIT, intmask
from rpython.rlib.objectmodel import keepalive_until_here
from rpython.jit.codewriter.policy import StopAtXPolicy
from rpython.rtyper.lltypesystem import lltype, rffi
class ExceptionTests:
def test_simple(self):
def g(n):
if n <= 0:
raise MyError(n)
return n - 1
def f(n):
try:
return g(n)
except MyError as e:
return e.n + 10
res = self.interp_operations(f, [9])
assert res == 8
res = self.interp_operations(f, [-99])
assert res == -89
def test_no_exception(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
class X:
pass
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
X()
n -= 1
return n
res = self.meta_interp(f, [10])
assert res == 0
self.check_resops({'jump': 1, 'guard_true': 2,
'int_gt': 2, 'int_sub': 2})
def test_bridge_from_guard_exception(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n % 2:
raise ValueError
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n)
n -= 1
except ValueError:
n -= 3
return n
res = self.meta_interp(f, [20], policy=StopAtXPolicy(check))
assert res == f(20)
res = self.meta_interp(f, [21], policy=StopAtXPolicy(check))
assert res == f(21)
def test_bridge_from_guard_exception_may_force(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
c_time = rffi.llexternal("time", [lltype.Signed], lltype.Signed)
def check(n):
if n % 2:
raise ValueError
if n == 100000:
c_time(0)
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n)
n -= 1
except ValueError:
n -= 3
return n
res = self.meta_interp(f, [20], policy=StopAtXPolicy(check))
assert res == f(20)
res = self.meta_interp(f, [21], policy=StopAtXPolicy(check))
assert res == f(21)
def test_bridge_from_guard_no_exception(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n % 2 == 0:
raise ValueError
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n)
n -= 1
except ValueError:
n -= 3
return n
res = self.meta_interp(f, [20], policy=StopAtXPolicy(check))
assert res == f(20)
def test_loop(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n < 0:
raise IndexError
def f(n):
try:
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
check(n)
n = n - 10
except IndexError:
return n
res = self.meta_interp(f, [54])
assert res == -6
def test_four_levels_checks(self):
def d(n):
if n < 0:
raise MyError(n * 10)
def c(n):
d(n)
def b(n):
try:
c(n)
except IndexError:
pass
def a(n):
try:
b(n)
return 0
except MyError as e:
return e.n
def f(n):
return a(n)
res = self.interp_operations(f, [-4])
assert res == -40
def test_exception_from_outside(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n, mode):
if mode == 0 and n > -100:
raise MyError(n)
return n - 5
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n, 0)
except MyError as e:
n = check(e.n, 1)
return n
assert f(53) == -2
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == -2
def test_exception_from_outside_2(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n > -100:
raise IndexError
def g(n):
check(n)
def f(n):
while n > 0:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
g(n)
except IndexError:
n = n - 5
return n
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == -2
def test_exception_two_cases(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
class Error1(Exception): pass
class Error2(Exception): pass
class Error3(Exception): pass
class Error4(Exception): pass
def check(n):
if n > 0:
raise Error3
else:
raise Error2
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n)
except Error1:
pass
except Error2:
break
except Error3:
n = n - 5
except Error4:
pass
return n
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == -2
def test_exception_two_cases_2(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
class Error1(Exception): pass
class Error2(Exception): pass
class Error3(Exception): pass
class Error4(Exception): pass
def check(n):
if n > 0:
raise Error3
else:
raise Error2
def g(n):
check(n)
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
g(n)
except Error1:
pass
except Error2:
break
except Error3:
n = n - 5
except Error4:
pass
return n
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == -2
def test_exception_four_cases(self):
myjitdriver = JitDriver(greens = [], reds = ['n', 'm'])
class Error1(Exception): pass
class Error2(Exception): pass
class Error3(Exception): pass
class Error4(Exception): pass
def check(n):
if n % 4 == 0: raise Error1
if n % 4 == 1: raise Error2
if n % 4 == 2: raise Error3
else: raise Error4
def f(n):
m = 1
while n > 0:
myjitdriver.can_enter_jit(n=n, m=m)
myjitdriver.jit_merge_point(n=n, m=m)
try:
check(n)
except Error1:
m = intmask(m * 3 + 1)
except Error2:
m = intmask(m * 5 + 1)
except Error3:
m = intmask(m * 7 + 1)
except Error4:
m = intmask(m * 11 + 1)
n -= 1
return m
res = self.meta_interp(f, [99], policy=StopAtXPolicy(check))
assert res == f(99)
def test_exception_later(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n < 0:
raise MyError(n)
return 5
def f(n):
try:
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
n = n - check(n)
except MyError as e:
return e.n
assert f(53) == -2
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == -2
def test_exception_and_then_no_exception(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n > 0:
raise ValueError
return n + 100
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
n = check(n)
break
except ValueError:
n = n - 5
return n
assert f(53) == 98
res = self.meta_interp(f, [53], policy=StopAtXPolicy(check))
assert res == 98
def test_raise(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
if n < 0:
raise ValueError
n = n - 1
def main(n):
try:
f(n)
except ValueError:
return 132
res = self.meta_interp(main, [13])
assert res == 132
def test_raise_through(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n < 0:
raise ValueError
return 1
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
n -= check(n)
def main(n):
try:
f(n)
except ValueError:
return 132
res = self.meta_interp(main, [13], policy=StopAtXPolicy(check))
assert res == 132
def test_raise_through_wrong_exc(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n < 0:
raise ValueError
return 1
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
n -= check(n)
except IndexError:
pass
def main(n):
try:
f(n)
except ValueError:
return 132
res = self.meta_interp(main, [13], policy=StopAtXPolicy(check))
assert res == 132
def test_raise_through_wrong_exc_2(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def check(n):
if n < 0:
raise ValueError
else:
raise IndexError
def f(n):
while True:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
check(n)
except IndexError:
n -= 1
def main(n):
try:
f(n)
except ValueError:
return 132
res = self.meta_interp(main, [13], policy=StopAtXPolicy(check))
assert res == 132
def test_int_ovf(self):
myjitdriver = JitDriver(greens = [], reds = ['n'])
def f(n):
try:
while 1:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
n = ovfcheck(n * -3)
except OverflowError:
return n
expected = f(1)
res = self.meta_interp(f, [1])
assert res == expected
def test_div_ovf(self):
def f(x, y):
try:
return ovfcheck(x/y)
except OverflowError:
return 42
res = self.interp_operations(f, [-sys.maxint-1, -1])
assert res == 42
def test_int_ovf_common(self):
import sys
myjitdriver = JitDriver(greens = [], reds = ['n'])
def f(n):
while 1:
myjitdriver.can_enter_jit(n=n)
myjitdriver.jit_merge_point(n=n)
try:
n = ovfcheck(n + sys.maxint)
except OverflowError:
n -= 1
else:
return n - 2000
res = self.meta_interp(f, [10], repeat=7)
assert res == sys.maxint - 2000
def test_int_mod_ovf_zer(self):
myjitdriver = JitDriver(greens = [], reds = ['i', 'x', 'y'])
def f(x, y):
i = 0
while i < 10:
myjitdriver.can_enter_jit(x=x, y=y, i=i)
myjitdriver.jit_merge_point(x=x, y=y, i=i)
try:
ovfcheck(i%x)
i += 1
except ZeroDivisionError:
i += 1
except OverflowError:
i += 2
return 0
self.meta_interp(f, [0, 0])
self.meta_interp(f, [1, 0])
def test_int_lshift_ovf(self):
myjitdriver = JitDriver(greens = [], reds = ['n', 'x', 'y', 'm'])
def f(x, y, n):
m = 0
while n < 100:
myjitdriver.can_enter_jit(n=n, x=x, y=y, m=m)
myjitdriver.jit_merge_point(n=n, x=x, y=y, m=m)
y += 1
y &= (LONG_BIT-1)
try:
ovfcheck(x<<y)
except OverflowError:
m += 1
n += 1
return m
res = self.meta_interp(f, [1, 1, 0], enable_opts='')
assert res == f(1, 1, 0)
res = self.meta_interp(f, [809644098, 16, 0],
enable_opts='')
assert res == f(809644098, 16, 0)
def test_int_neg_ovf(self):
import sys
myjitdriver = JitDriver(greens = [], reds = ['n', 'y', 'm'])
def f(y, n):
m = 0
while n < 115:
myjitdriver.can_enter_jit(n=n, y=y, m=m)
myjitdriver.jit_merge_point(n=n, y=y, m=m)
y -= 1
try:
ovfcheck(-y)
except OverflowError:
m += 1
y += 1
n += 1
return m
res = self.meta_interp(f, [-sys.maxint-1+100, 0],
enable_opts='')
assert res == 16
def test_reraise_through_portal(self):
jitdriver = JitDriver(greens = [], reds = ['n'])
class SomeException(Exception):
pass
def portal(n):
while n > 0:
jitdriver.can_enter_jit(n=n)
jitdriver.jit_merge_point(n=n)
if n == 10:
raise SomeException
n -= 1
def f(n):
try:
portal(n)
except SomeException as e:
return 3
return 2
res = self.meta_interp(f, [100])
assert res == 3
def test_bridge_from_interpreter_exc(self):
mydriver = JitDriver(reds = ['n'], greens = [])
def f(n):
while n > 0:
mydriver.can_enter_jit(n=n)
mydriver.jit_merge_point(n=n)
n -= 2
raise MyError(n)
def main(n):
try:
f(n)
except MyError as e:
return e.n
res = self.meta_interp(main, [41], repeat=7)
assert res == -1
self.check_target_token_count(2) # the loop and the entry path
# we get:
# ENTER - compile the new loop and the entry bridge
# ENTER - compile the leaving path (raising MyError)
self.check_enter_count(2)
def test_bridge_from_interpreter_exc_2(self):
mydriver = JitDriver(reds = ['n'], greens = [])
def x(n):
if n == 1:
raise MyError(n)
def f(n):
try:
while n > 0:
mydriver.can_enter_jit(n=n)
mydriver.jit_merge_point(n=n)
x(n)
n -= 1
except MyError:
z()
def z():
raise ValueError
def main(n):
try:
f(n)
return 3
except MyError as e:
return e.n
except ValueError:
return 8
res = self.meta_interp(main, [41], repeat=7, policy=StopAtXPolicy(x),
enable_opts='')
assert res == 8
def test_overflowerror_escapes(self):
def g(x):
try:
return ovfcheck(x + 1)
except OverflowError:
raise
def f(x):
try:
return g(x)
except Exception as e:
if isinstance(e, OverflowError):
return -42
raise
res = self.interp_operations(f, [sys.maxint])
assert res == -42
def test_bug_1(self):
def h(i):
if i > 10:
raise ValueError
if i > 5:
raise KeyError
return 5
def g(i):
try:
return h(i)
except ValueError:
return 21
def f(i):
try:
return g(i)
except KeyError:
return 42
res = self.interp_operations(f, [99])
assert res == 21
def test_bug_exc1_noexc_exc2(self):
myjitdriver = JitDriver(greens=[], reds=['i'])
@dont_look_inside
def rescall(i):
if i < 10:
raise KeyError
if i < 20:
return None
raise ValueError
def f(i):
while i < 30:
myjitdriver.can_enter_jit(i=i)
myjitdriver.jit_merge_point(i=i)
try:
rescall(i)
except KeyError:
assert i < 10
except ValueError:
assert i >= 20
else:
assert 10 <= i < 20
i += 1
return i
res = self.meta_interp(f, [0], inline=True)
assert res == 30
def test_catch_different_class(self):
def g(i):
if i < 0:
raise KeyError
return i
def f(i):
MyError(i)
try:
return g(i)
except MyError as e:
return e.n
res = self.interp_operations(f, [5], backendopt=True)
assert res == 5
def test_guard_no_exception_incorrectly_removed_from_bridge(self):
myjitdriver = JitDriver(greens=[], reds=['i'])
@dont_look_inside
def do(n):
if n > 7:
raise ValueError
if n > 1:
return n
raise IndexError
def f(i):
while i > 0:
myjitdriver.jit_merge_point(i=i)
f = str(i) + str(i)
# ^^^ this sticks a CALL_R in the resume data, inserted
# at the start of a bridge *before* the guard_no_exception.
# Some optimization step then thinks, correctly, that the
# CALL_R cannot raise and kills the guard_no_exception...
# As a result, the final IndexError we get for i == 1 is
# not caught here and escapes. It causes issue #2132.
try:
do(i)
except ValueError:
pass
except IndexError:
pass
i -= 1
keepalive_until_here(f)
return 10101
assert f(14) == 10101
res = self.meta_interp(f, [14])
assert res == 10101
class MyError(Exception):
def __init__(self, n):
self.n = n
class TestLLtype(ExceptionTests, LLJitMixin):
pass
|