diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
commit | 36d22d82aa202bb199967e9512281e9a53db42c9 (patch) | |
tree | 105e8c98ddea1c1e4784a60a5a6410fa416be2de /js/src/tests/non262/regress/regress-192414.js | |
parent | Initial commit. (diff) | |
download | firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.tar.xz firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.zip |
Adding upstream version 115.7.0esr.upstream/115.7.0esrupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r-- | js/src/tests/non262/regress/regress-192414.js | 85 |
1 files changed, 85 insertions, 0 deletions
diff --git a/js/src/tests/non262/regress/regress-192414.js b/js/src/tests/non262/regress/regress-192414.js new file mode 100644 index 0000000000..e6843269cc --- /dev/null +++ b/js/src/tests/non262/regress/regress-192414.js @@ -0,0 +1,85 @@ +/* -*- indent-tabs-mode: nil; js-indent-level: 2 -*- */ +/* This Source Code Form is subject to the terms of the Mozilla Public + * License, v. 2.0. If a copy of the MPL was not distributed with this + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ + +/* + * + * Date: 08 February 2003 + * SUMMARY: Parser recursion should check stack overflow + * + * See http://bugzilla.mozilla.org/show_bug.cgi?id=192414 + * + */ +//----------------------------------------------------------------------------- +var UBound = 0; +var BUGNUMBER = 192414; +var summary = 'Parser recursion should check stack overflow'; +var status = ''; +var statusitems = []; +var actual = ''; +var actualvalues = []; +var expect= ''; +var expectedvalues = []; + +/* + * We will form an eval string to set the result-variable |actual|. + * To get a feel for this, suppose N were 3. Then the eval string is + * 'actual = (1&(1&(1&1)));' The expected value after eval() is 1. + */ +status = inSection(1); +var N = 10000; +var left = repeat_str('(1&', N); +var right = repeat_str(')', N); +var str = 'actual = '.concat(left, '1', right, ';'); +try +{ + eval(str); +} +catch (e) +{ + /* + * An exception during this eval is OK, as the runtime can throw one + * in response to too deep recursion. We haven't crashed; good! + */ + actual = 1; +} +expect = 1; +addThis(); + + + +//----------------------------------------------------------------------------- +test(); +//----------------------------------------------------------------------------- + + + +function repeat_str(str, repeat_count) +{ + var arr = new Array(--repeat_count); + while (repeat_count != 0) + arr[--repeat_count] = str; + return str.concat.apply(str, arr); +} + + +function addThis() +{ + statusitems[UBound] = status; + actualvalues[UBound] = actual; + expectedvalues[UBound] = expect; + UBound++; +} + + +function test() +{ + printBugNumber(BUGNUMBER); + printStatus(summary); + + for (var i=0; i<UBound; i++) + { + reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]); + } +} |