js/src/jit-test/tests/ion/getelem-bounds-coalesce.js

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 var a = [1,2,3,4];
michael@0 2
michael@0 3 // Basic constants.
michael@0 4 function foo(x) {
michael@0 5 return x[0] + x[1] + x[2] + x[3];
michael@0 6 }
michael@0 7 for (var i = 0; i < 100; i++)
michael@0 8 assertEq(foo(a), 10);
michael@0 9 assertEq(foo([1,2,3]), NaN);
michael@0 10
michael@0 11 // Basic terms.
michael@0 12 function foo2(x, n) {
michael@0 13 return x[n] + x[n + 1] + x[n + 2];
michael@0 14 }
michael@0 15 for (var i = 0; i < 100; i++)
michael@0 16 assertEq(foo2(a, 1), 9);
michael@0 17 assertEq(foo2(a, 2), NaN);
michael@0 18
michael@0 19 // Term underflow.
michael@0 20 function foo3(x, n) {
michael@0 21 return x[n] + x[n + 1] + x[n + 2];
michael@0 22 }
michael@0 23 for (var i = 0; i < 100; i++)
michael@0 24 assertEq(foo3(a, 1), 9);
michael@0 25 assertEq(foo3(a, -1), NaN);
michael@0 26
michael@0 27 // Integer overflow computing bound.
michael@0 28 function foo4(x, n) {
michael@0 29 return x[n] + x[n + 1] + x[n + 2];
michael@0 30 }
michael@0 31 for (var i = 0; i < 45; i++)
michael@0 32 assertEq(foo4(a, 1), 9);
michael@0 33 assertEq(foo4(a, 0x7fffffff), NaN);
michael@0 34
michael@0 35 // Underflow at an offset.
michael@0 36 function foo5(x, n) {
michael@0 37 return x[n + 10] + x[n + 11] + x[n + 12];
michael@0 38 }
michael@0 39 for (var i = 0; i < 45; i++)
michael@0 40 assertEq(foo5(a, -9), 9);
michael@0 41 assertEq(foo5(a, -11), NaN);
michael@0 42
michael@0 43 // Overflow at offset.
michael@0 44 function foo6(x, n) {
michael@0 45 return x[n - 10] + x[n - 11] + x[n - 12];
michael@0 46 }
michael@0 47 for (var i = 0; i < 45; i++)
michael@0 48 assertEq(foo6(a, 13), 9);
michael@0 49 assertEq(foo6(a, 14), NaN);

mercurial