gecko-dev/js/tests/js1_5/Regress/regress-226507.js

179 lines
4.9 KiB
JavaScript

/* -*- 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
* Netscape Communications Corp.
* Portions created by the Initial Developer are Copyright (C) 2003
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* igor@fastmail.fm, PhilSchwartau@aol.com
*
* 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 *****
*
*
* Date: 24 Nov 2003
* SUMMARY: Testing for recursion check in js_EmitTree
*
* See http://bugzilla.mozilla.org/show_bug.cgi?id=226507
* Igor's comments:
*
* "For example, with N in the test set to 35, I got on my RedHat
* Linux 10 box a segmentation fault from js after setting the stack limit
* to 100K. When I set the stack limit to 20K I still got the segmentation fault.
* Only after -s was changed to 15K, too-deep recursion was detected:
*
~/w/js/x> ulimit -s
100
~/w/js/x> js fintest.js
Segmentation fault
~/w/js/x> js -S $((20*1024)) fintest.js
Segmentation fault
~/w/js/x> js -S $((15*1024)) fintest.js
fintest.js:19: InternalError: too much recursion
*
* After playing with numbers it seems that while processing try/finally the
* recursion in js_Emit takes 10 times more space the corresponding recursion
* in the parser."
*
*
* Note the use of the new -S option to the JS shell to limit stack size.
* See http://bugzilla.mozilla.org/show_bug.cgi?id=225061. This in turn
* can be passed to the JS shell by the test driver's -o option, as in:
*
* perl jsDriver.pl -e smdebug -fTEST.html -o "-S 100" -l js1_5/Regress
*
*/
//-----------------------------------------------------------------------------
var UBound = 0;
var bug = 226507;
var summary = 'Testing for recursion check in js_EmitTree';
var status = '';
var statusitems = [];
var actual = '';
var actualvalues = [];
var expect= '';
var expectedvalues = [];
/*
* With stack limit 100K on Linux debug build even N=30 already can cause
* stack overflow; use 35 to trigger it for sure.
*/
var N = 350;
var counter = 0;
function f()
{
++counter;
}
/*
* Example: if N were 3, this is what |source|
* would end up looking like:
*
* try { f(); } finally {
* try { f(); } finally {
* try { f(); } finally {
* f(1,1,1,1);
* }}}
*
*/
var source = "".concat(
repeat_str("try { f(); } finally {\n", N),
"f(",
repeat_str("1,", N),
"1);\n",
repeat_str("}", N));
// Repeat it for additional stress testing
source += source;
/*
* In Rhino, eval() always uses interpreted mode.
* To use compiled mode, use Script.exec() instead.
*/
if (typeof Script == 'undefined')
{
print('Test skipped. Script not defined.');
expect = actual = 0;
}
else
{
var script = Script(source);
script();
status = inSection(1);
actual = counter;
expect = (N + 1) * 2;
}
addThis();
//-----------------------------------------------------------------------------
test();
//-----------------------------------------------------------------------------
function repeat_str(str, repeat_count)
{
var arr = new Array(--repeat_count);
while (repeat_count != 0)
arr[--repeat_count] = str;
return str.concat.apply(str, arr);
}
function addThis()
{
statusitems[UBound] = status;
actualvalues[UBound] = actual;
expectedvalues[UBound] = expect;
UBound++;
}
function test()
{
enterFunc('test');
printBugNumber(bug);
printStatus(summary);
for (var i=0; i<UBound; i++)
{
reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]);
}
exitFunc ('test');
}