function test(){  enterFunc ('test');  printBugNumber (bug);  printStatus (summary);  // Construct f(){function f(){function f(){...}}} with maximum// nested function declaration still does not hit recursion limit.  var deepestFunction;  var n = findActionMax(function(n) {    var prefix="function f(){";    var suffix="}";    var source = Array(n+1).join(prefix) + Array(n+1).join(suffix);    try {      deepestFunction = Function(source);      return true;     } catch (e) {      if (!(e instanceof InternalError))			throw e;      return false;     }  });  if (n == 0)    throw "unexpected";  print("Max nested function leveles:"+n);  n = findActionMax(function(n) {    try {      callAfterConsumingCStack(n, function() {});      return true;    } catch (e) {      if (!(e instanceof InternalError))			throw e;      return false;	    }  });  print("Max callAfterConsumingCStack levels:"+n);// Here n is max possible value when callAfterConsumingCStack(n, emptyFunction)// does not trigger stackOverflow. Decrease it slightly to give some C stack // space for deepestFunction.toSource()    n = Math.max(0, n - 10);  try {    var src = callAfterConsumingCStack(n, function() {      return deepestFunction.toSource();    });    throw "Test failed to hit the recursion limit.";  } catch (e) {    if (!(e instanceof InternalError))      throw e;  }  print('Done');  expect = true;  actual = true;  reportCompare(expect, true, summary);  exitFunc ('test');}
5872	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/5872/3703c3c05f398a63e55992f7687ef65273b26d6a/regress-348986.js/clean/js/tests/js1_5/extensions/regress-348986.js