1// Copyright 2013 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28// Create a regexp in the form of a?a?...a? so that fully 29// traversing the entire graph would be prohibitively expensive. 30// This should not cause time out. 31var r1 = ""; 32for (var i = 0; i < 1000; i++) { 33 r1 += "a?"; 34} 35"test".match(RegExp(r1)); 36 37var r2 = ""; 38for (var i = 0; i < 100; i++) { 39 r2 += "(a?|b?|c?|d?|e?|f?|g?)"; 40} 41"test".match(RegExp(r2)); 42 43// Create a regexp in the form of ((..(a)a..)a. 44// Compiling it causes EatsAtLeast to reach the maximum 45// recursion depth possible with a given budget. 46// This should not cause a stack overflow. 47var r3 = "a"; 48for (var i = 0; i < 1000; i++) { 49 r3 = "(" + r3 + ")a"; 50} 51"test".match(RegExp(r3)); 52