From 36d22d82aa202bb199967e9512281e9a53db42c9 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 7 Apr 2024 21:33:14 +0200 Subject: Adding upstream version 115.7.0esr. Signed-off-by: Daniel Baumann --- js/src/jit-test/tests/basic/bug972961.js | 40 ++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 js/src/jit-test/tests/basic/bug972961.js (limited to 'js/src/jit-test/tests/basic/bug972961.js') diff --git a/js/src/jit-test/tests/basic/bug972961.js b/js/src/jit-test/tests/basic/bug972961.js new file mode 100644 index 0000000000..10df12cad8 --- /dev/null +++ b/js/src/jit-test/tests/basic/bug972961.js @@ -0,0 +1,40 @@ +// Bug 972961 - Test compiler with very long chains of property accesses + +// Return true if we can compile a chain of n property accesses, +// false if we cannot. Throw if compilation fails in an unexpected way. +function test(n) { + print("testing " + n); + try { + eval('if (false) {' + Array(n).join(("a.")) + 'a}'); + } catch (exc) { + // Expected outcome if the expression is too deeply nested is an InternalError. + if (!(exc instanceof InternalError)) + throw exc; + print(exc.message); + return false; + } + print("no exception"); + return true; +} + +// Find out how long a chain is enough to break the compiler. +var n = 4, LIMIT = 0x000fffff; +var lo = 1, hi = 1; +while (n <= LIMIT && test(n)) { + lo = n; + n *= 4; +} + +// Using binary search, find a pass/fail boundary (in order to +// test the edge case). +if (n <= LIMIT) { + hi = n; + while (lo !== hi) { + var mid = Math.floor((lo + hi) / 2); + if (test(mid)) + lo = mid + 1; + else + hi = mid; + } + print((lo - 1) + " attributes should be enough for anyone"); +} -- cgit v1.2.3