diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 14:29:10 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 14:29:10 +0000 |
commit | 2aa4a82499d4becd2284cdb482213d541b8804dd (patch) | |
tree | b80bf8bf13c3766139fbacc530efd0dd9d54394c /js/src/jit-test/tests/ion/getelem-bounds-coalesce.js | |
parent | Initial commit. (diff) | |
download | firefox-2aa4a82499d4becd2284cdb482213d541b8804dd.tar.xz firefox-2aa4a82499d4becd2284cdb482213d541b8804dd.zip |
Adding upstream version 86.0.1.upstream/86.0.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'js/src/jit-test/tests/ion/getelem-bounds-coalesce.js')
-rw-r--r-- | js/src/jit-test/tests/ion/getelem-bounds-coalesce.js | 49 |
1 files changed, 49 insertions, 0 deletions
diff --git a/js/src/jit-test/tests/ion/getelem-bounds-coalesce.js b/js/src/jit-test/tests/ion/getelem-bounds-coalesce.js new file mode 100644 index 0000000000..c5dda1784d --- /dev/null +++ b/js/src/jit-test/tests/ion/getelem-bounds-coalesce.js @@ -0,0 +1,49 @@ +var a = [1,2,3,4]; + +// Basic constants. +function foo(x) { + return x[0] + x[1] + x[2] + x[3]; +} +for (var i = 0; i < 100; i++) + assertEq(foo(a), 10); +assertEq(foo([1,2,3]), NaN); + +// Basic terms. +function foo2(x, n) { + return x[n] + x[n + 1] + x[n + 2]; +} +for (var i = 0; i < 100; i++) + assertEq(foo2(a, 1), 9); +assertEq(foo2(a, 2), NaN); + +// Term underflow. +function foo3(x, n) { + return x[n] + x[n + 1] + x[n + 2]; +} +for (var i = 0; i < 100; i++) + assertEq(foo3(a, 1), 9); +assertEq(foo3(a, -1), NaN); + +// Integer overflow computing bound. +function foo4(x, n) { + return x[n] + x[n + 1] + x[n + 2]; +} +for (var i = 0; i < 45; i++) + assertEq(foo4(a, 1), 9); +assertEq(foo4(a, 0x7fffffff), NaN); + +// Underflow at an offset. +function foo5(x, n) { + return x[n + 10] + x[n + 11] + x[n + 12]; +} +for (var i = 0; i < 45; i++) + assertEq(foo5(a, -9), 9); +assertEq(foo5(a, -11), NaN); + +// Overflow at offset. +function foo6(x, n) { + return x[n - 10] + x[n - 11] + x[n - 12]; +} +for (var i = 0; i < 45; i++) + assertEq(foo6(a, 13), 9); +assertEq(foo6(a, 14), NaN); |