diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 17:32:43 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 17:32:43 +0000 |
commit | 6bf0a5cb5034a7e684dcc3500e841785237ce2dd (patch) | |
tree | a68f146d7fa01f0134297619fbe7e33db084e0aa /js/src/tests/non262/regress/regress-280769-4.js | |
parent | Initial commit. (diff) | |
download | thunderbird-6bf0a5cb5034a7e684dcc3500e841785237ce2dd.tar.xz thunderbird-6bf0a5cb5034a7e684dcc3500e841785237ce2dd.zip |
Adding upstream version 1:115.7.0.upstream/1%115.7.0upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'js/src/tests/non262/regress/regress-280769-4.js')
-rw-r--r-- | js/src/tests/non262/regress/regress-280769-4.js | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/js/src/tests/non262/regress/regress-280769-4.js b/js/src/tests/non262/regress/regress-280769-4.js new file mode 100644 index 0000000000..eefc6db2c2 --- /dev/null +++ b/js/src/tests/non262/regress/regress-280769-4.js @@ -0,0 +1,47 @@ +/* -*- 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/. */ + +//----------------------------------------------------------------------------- +var BUGNUMBER = 280769; +var summary = 'Do not overflow 64K length of char sequence in RegExp []'; +var actual = 'No Crash'; +var expect = 'No Crash'; + +printBugNumber(BUGNUMBER); +printStatus (summary); + + +var N = 20 * 1000; // It should be that N*6 > 64K and N < 32K + +var prefixes = ["000", "00", "0"]; + +function to_4_hex(i) +{ + var printed = i.toString(16); + if (printed.length < 4) { + printed= prefixes[printed.length - 1]+printed; + } + return printed; + +} + +var a = new Array(N); +for (var i = 0; i != N; ++i) { + a[i] = to_4_hex(2*i); +} + +var str = '[\\u'+a.join('\\u')+']'; +// str is [\u0000\u0002\u0004...\u<printed value of 2N>] + +var re = new RegExp(str); + +var string_to_match = String.fromCharCode(2 * (N - 1)); + +var value = re.exec(string_to_match); + +var expect = string_to_match; +var actual = value ? value[0] : value; + +reportCompare(expect, actual, summary); |