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: 10 February 2003 38* SUMMARY: Object.toSource() recursion should check stack overflow 39* 40* See http://bugzilla.mozilla.org/show_bug.cgi?id=192465 41* 42* MODIFIED: 27 February 2003 43* 44* We are adding an early return to this testcase, since it is causing 45* big problems on Linux RedHat8! For a discussion of this issue, see 46* http://bugzilla.mozilla.org/show_bug.cgi?id=174341#c24 and following. 47* 48* 49* MODIFIED: 20 March 2003 50* 51* Removed the early return and changed |N| below from 1000 to 90. 52* Note |make_deep_nest(N)| returns an object graph of length N(N+1). 53* So the graph has now been reduced from 1,001,000 to 8190. 54* 55* With this reduction, the bug still manifests on my WinNT and Linux 56* boxes (crash due to stack overflow). So the testcase is again of use 57* on those boxes. At the same time, Linux RedHat8 boxes can now run 58* the test in a reasonable amount of time. 59*/ 60//----------------------------------------------------------------------------- 61var UBound = 0; 62var bug = 192465; 63var summary = 'Object.toSource() recursion should check stack overflow'; 64var status = ''; 65var statusitems = []; 66var actual = ''; 67var actualvalues = []; 68var expect= ''; 69var expectedvalues = []; 70 71 72/* 73 * We're just testing that this script will compile and run. 74 * Set both |actual| and |expect| to a dummy value. 75 */ 76status = inSection(1); 77var N = 90; 78try 79{ 80 make_deep_nest(N); 81} 82catch (e) 83{ 84 // An exception is OK, as the runtime can throw one in response to too deep 85 // recursion. We haven't crashed; good! Continue on to set the dummy values - 86} 87actual = 1; 88expect = 1; 89addThis(); 90 91 92 93//----------------------------------------------------------------------------- 94test(); 95//----------------------------------------------------------------------------- 96 97 98/* 99 * EXAMPLE: 100 * 101 * If the global variable |N| is 2, then for |level| == 0, 1, 2, the return 102 * value of this function will be toSource() of these objects, respectively: 103 * 104 * {next:{next:END}} 105 * {next:{next:{next:{next:END}}}} 106 * {next:{next:{next:{next:{next:{next:END}}}}}} 107 * 108 */ 109function make_deep_nest(level) 110{ 111 var head = {}; 112 var cursor = head; 113 114 for (var i=0; i!=N; ++i) 115 { 116 cursor.next = {}; 117 cursor = cursor.next; 118 } 119 120 cursor.toSource = function() 121 { 122 if (level != 0) 123 return make_deep_nest(level - 1); 124 return "END"; 125 } 126 127 return head.toSource(); 128} 129 130 131function addThis() 132{ 133 statusitems[UBound] = status; 134 actualvalues[UBound] = actual; 135 expectedvalues[UBound] = expect; 136 UBound++; 137} 138 139 140function test() 141{ 142 enterFunc('test'); 143 printBugNumber(bug); 144 printStatus(summary); 145 146 for (var i=0; i<UBound; i++) 147 { 148 reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]); 149 } 150 151 exitFunc ('test'); 152} 153