js/src/tests/js1_5/Regress/regress-280769-4.js@6474c204b198 (annotated)
js/src/tests/js1_5/Regress/regress-280769-4.js
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
| michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 5 | |
| michael@0 | 6 | //----------------------------------------------------------------------------- |
| michael@0 | 7 | var BUGNUMBER = 280769; |
| michael@0 | 8 | var summary = 'Do not overflow 64K length of char sequence in RegExp []'; |
| michael@0 | 9 | var actual = 'No Crash'; |
| michael@0 | 10 | var expect = 'No Crash'; |
| michael@0 | 11 | |
| michael@0 | 12 | printBugNumber(BUGNUMBER); |
| michael@0 | 13 | printStatus (summary); |
| michael@0 | 14 | |
| michael@0 | 15 | |
| michael@0 | 16 | var N = 20 * 1000; // It should be that N*6 > 64K and N < 32K |
| michael@0 | 17 | |
| michael@0 | 18 | var prefixes = ["000", "00", "0"]; |
| michael@0 | 19 | |
| michael@0 | 20 | function to_4_hex(i) |
| michael@0 | 21 | { |
| michael@0 | 22 | var printed = i.toString(16); |
| michael@0 | 23 | if (printed.length < 4) { |
| michael@0 | 24 | printed= prefixes[printed.length - 1]+printed; |
| michael@0 | 25 | } |
| michael@0 | 26 | return printed; |
| michael@0 | 27 | |
| michael@0 | 28 | } |
| michael@0 | 29 | |
| michael@0 | 30 | var a = new Array(N); |
| michael@0 | 31 | for (var i = 0; i != N; ++i) { |
| michael@0 | 32 | a[i] = to_4_hex(2*i); |
| michael@0 | 33 | } |
| michael@0 | 34 | |
| michael@0 | 35 | var str = '[\\u'+a.join('\\u')+']'; |
| michael@0 | 36 | // str is [\u0000\u0002\u0004...\u<printed value of 2N>] |
| michael@0 | 37 | |
| michael@0 | 38 | var re = new RegExp(str); |
| michael@0 | 39 | |
| michael@0 | 40 | var string_to_match = String.fromCharCode(2 * (N - 1)); |
| michael@0 | 41 | |
| michael@0 | 42 | var value = re.exec(string_to_match); |
| michael@0 | 43 | |
| michael@0 | 44 | var expect = string_to_match; |
| michael@0 | 45 | var actual = value ? value[0] : value; |
| michael@0 | 46 | |
| michael@0 | 47 | reportCompare(expect, actual, summary); |
