/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* ***** BEGIN LICENSE BLOCK ***** * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License * for the specific language governing rights and limitations under the * License. * * The Original Code is JavaScript Engine testing utilities. * * The Initial Developer of the Original Code is * Mozilla Foundation. * Portions created by the Initial Developer are Copyright (C) 2005 * the Initial Developer. All Rights Reserved. * * Contributor(s): Igor Bukanov * Bob Clary * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ var gTestfile = 'regress-280769-4.js'; //----------------------------------------------------------------------------- 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] 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);