1/* ***** BEGIN LICENSE BLOCK ***** 2* Version: NPL 1.1/GPL 2.0/LGPL 2.1 3* 4* The contents of this file are subject to the Netscape Public License 5* Version 1.1 (the "License"); you may not use this file except in 6* compliance with the License. You may obtain a copy of the License at 7* http://www.mozilla.org/NPL/ 8* 9* Software distributed under the License is distributed on an "AS IS" basis, 10* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License 11* for the specific language governing rights and limitations under the 12* License. 13* 14* The Original Code is JavaScript Engine testing utilities. 15* 16* The Initial Developer of the Original Code is Netscape Communications Corp. 17* Portions created by the Initial Developer are Copyright (C) 2003 18* the Initial Developer. All Rights Reserved. 19* 20* Contributor(s): igor@icesoft.com, pschwartau@netscape.com 21* 22* Alternatively, the contents of this file may be used under the terms of 23* either the GNU General Public License Version 2 or later (the "GPL"), or 24* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), 25* in which case the provisions of the GPL or the LGPL are applicable instead 26* of those above. If you wish to allow use of your version of this file only 27* under the terms of either the GPL or the LGPL, and not to allow others to 28* use your version of this file under the terms of the NPL, indicate your 29* decision by deleting the provisions above and replace them with the notice 30* and other provisions required by the GPL or the LGPL. If you do not delete 31* the provisions above, a recipient may use your version of this file under 32* the terms of any one of the NPL, the GPL or the LGPL. 33* 34* ***** END LICENSE BLOCK ***** 35* 36* 37* Date: 08 February 2003 38* SUMMARY: Parser recursion should check stack overflow 39* 40* See http://bugzilla.mozilla.org/show_bug.cgi?id=192414 41* 42*/ 43//----------------------------------------------------------------------------- 44var UBound = 0; 45var bug = 192414; 46var summary = 'Parser recursion should check stack overflow'; 47var status = ''; 48var statusitems = []; 49var actual = ''; 50var actualvalues = []; 51var expect= ''; 52var expectedvalues = []; 53 54/* 55 * We will form an eval string to set the result-variable |actual|. 56 * To get a feel for this, suppose N were 3. Then the eval string is 57 * 'actual = (1&(1&(1&1)));' The expected value after eval() is 1. 58 */ 59status = inSection(1); 60var N = 10000; 61var left = repeat_str('(1&', N); 62var right = repeat_str(')', N); 63var str = 'actual = '.concat(left, '1', right, ';'); 64try 65{ 66 eval(str); 67} 68catch (e) 69{ 70 /* 71 * An exception during this eval is OK, as the runtime can throw one 72 * in response to too deep recursion. We haven't crashed; good! 73 */ 74 actual = 1; 75} 76expect = 1; 77addThis(); 78 79 80 81//----------------------------------------------------------------------------- 82test(); 83//----------------------------------------------------------------------------- 84 85 86 87function repeat_str(str, repeat_count) 88{ 89 var arr = new Array(--repeat_count); 90 while (repeat_count != 0) 91 arr[--repeat_count] = str; 92 return str.concat.apply(str, arr); 93} 94 95 96function addThis() 97{ 98 statusitems[UBound] = status; 99 actualvalues[UBound] = actual; 100 expectedvalues[UBound] = expect; 101 UBound++; 102} 103 104 105function test() 106{ 107 enterFunc('test'); 108 printBugNumber(bug); 109 printStatus(summary); 110 111 for (var i=0; i<UBound; i++) 112 { 113 reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]); 114 } 115 116 exitFunc ('test'); 117} 118