| /* -*- 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); |