js/tests/js1_5/extensions/regress-348986.js

   1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
   2 /* ***** BEGIN LICENSE BLOCK *****
   3  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   4  *
   5  * The contents of this file are subject to the Mozilla Public License Version
   6  * 1.1 (the "License"); you may not use this file except in compliance with
   7  * the License. You may obtain a copy of the License at
   8  * http://www.mozilla.org/MPL/
   9  *
  10  * Software distributed under the License is distributed on an "AS IS" basis,
  11  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  12  * for the specific language governing rights and limitations under the
  13  * License.
  14  *
  15  * The Original Code is JavaScript Engine testing utilities.
  16  *
  17  * The Initial Developer of the Original Code is
  18  * Mozilla Foundation.
  19  * Portions created by the Initial Developer are Copyright (C) 2006
  20  * the Initial Developer. All Rights Reserved.
  21  *
  22  * Contributor(s): Igor Bukanov
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either the GNU General Public License Version 2 or later (the "GPL"), or
  26  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 var gTestfile = 'regress-348986.js';
  39 //-----------------------------------------------------------------------------
  40 var BUGNUMBER = 348986;
  41 var summary = 'Recursion check of nested functions';
  42 var actual = 'No Crash';
  43 var expect = 'No Crash';
  44
  45
  46 //-----------------------------------------------------------------------------
  47 test();
  48 //-----------------------------------------------------------------------------
  49
  50 function test()
  51 {
  52   enterFunc ('test');
  53   printBugNumber(BUGNUMBER);
  54   printStatus (summary);
  55
  56 // Construct f(){function f(){function f(){...}}} with maximum
  57 // nested function declaration still does not hit recursion limit.
  58
  59   var deepestFunction;
  60
  61   var n = findActionMax(function(n) {
  62                           var prefix="function f(){";
  63                           var suffix="}";
  64                           var source = Array(n+1).join(prefix) + Array(n+1).join(suffix);
  65                           try {
  66                             deepestFunction = Function(source);
  67                             return true;
  68                           } catch (e) {
  69                             if (!(e instanceof InternalError))
  70                               throw e;
  71                             return false;
  72                           }
  73
  74                         });
  75
  76   if (n == 0)
  77     throw "unexpected";
  78
  79   print("Max nested function leveles:"+n);
  80
  81   n = findActionMax(function(n) {
  82                       try {
  83                         callAfterConsumingCStack(n, function() {});
  84                         return true;
  85                       } catch (e) {
  86                         if (!(e instanceof InternalError))
  87                           throw e;
  88                         return false;
  89                       }
  90                     });
  91
  92   print("Max callAfterConsumingCStack levels:"+n);
  93
  94 // Here n is max possible value when callAfterConsumingCStack(n, emptyFunction)
  95 // does not trigger stackOverflow. Decrease it slightly to give some C stack
  96 // space for deepestFunction.toSource()
  97
  98   n = Math.max(0, n - 10);
  99   try {
 100     var src = callAfterConsumingCStack(n, function() {
 101                                          return deepestFunction.toSource();
 102                                        });
 103     throw "Test failed to hit the recursion limit.";
 104   } catch (e) {
 105     if (!(e instanceof InternalError))
 106       throw e;
 107   }
 108
 109   print('Done');
 110   expect = true;
 111   actual = true;
 112   reportCompare(expect, true, summary);
 113
 114   exitFunc ('test');
 115 }
 116
 117 function callAfterConsumingCStack(n, action)
 118 {
 119   var testObj = {
 120     get propertyWithGetter() {
 121       if (n == 0)
 122         return action();
 123       n--;
 124       return this.propertyWithGetter;
 125     }
 126   };
 127   return testObj.propertyWithGetter;
 128 }
 129
 130
 131 // Return the maximum positive value of N where action(N) still returns true
 132 // or 0 if no such value exists.
 133 function findActionMax(action)
 134 {
 135   var N, next, increase;
 136
 137   n = 0;
 138   for (;;) {
 139     var next = (n == 0 ? 1 : n * 2);
 140     if (!isFinite(next) || !action(next))
 141       break;
 142     n = next;
 143   }
 144   if (n == 0)
 145     return 0;
 146
 147   var increase = n / 2;
 148   for (;;) {
 149     var next = n + increase;
 150     if (next == n)
 151       break;
 152     if (isFinite(next) && action(next)) {
 153       n = next;
 154     } else if (increase == 1) {
 155       break;
 156     } else {
 157       increase = increase / 2;
 158     }
 159   }
 160   return n;
 161 }