michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: //-----------------------------------------------------------------------------
michael@0: var BUGNUMBER = 280769;
michael@0: var summary = 'Do not crash on overflow of 64K boundary of [] offset in regexp search string ';
michael@0: var actual = 'No Crash';
michael@0: var expect = 'No Crash';
michael@0: 
michael@0: printBugNumber(BUGNUMBER);
michael@0: printStatus (summary);
michael@0: 
michael@0: status = summary + ' ' + inSection(1) + ' (new RegExp("zzz...[AB]").exec("zzz...A") ';
michael@0: 
michael@0: var N = 100 * 1000; // N should be more then 64K
michael@0: var a = new Array(N + 1);
michael@0: var prefix = a.join("z"); // prefix is sequence of N "z", zzz...zzz
michael@0: var str = prefix+"[AB]"; // str is zzz...zzz[AB]
michael@0: var re = new RegExp(str);
michael@0: re.exec(prefix+"A");
michael@0: 
michael@0: reportCompare(expect, actual, status);