Dial down recursion in new test added by abd2dcd555f4 so as to not chew up so much C stack when the mjit is disabled (r=orange)
authorLuke Wagner <luke@mozilla.com>
Thu, 02 Jun 2011 18:39:48 -0700
changeset 70654 c72fed47c034c9aa4fa7f2a6c4d170615b2eec26
parent 70653 abd2dcd555f45b539b63f5ad0943803b7253dc88
child 70655 7a8dc72beb430c113aca7c080fc43bf7531370f1
push id20369
push usercleary@mozilla.com
push dateMon, 06 Jun 2011 20:24:54 +0000
treeherdermozilla-central@3589f8cefd83 [default view] [failures only]
perfherder[talos] [build metrics] [platform microbench] (compared to previous push)
reviewersorange
milestone6.0a1
first release with
nightly linux32
nightly linux64
nightly mac
nightly win32
nightly win64
last release without
nightly linux32
nightly linux64
nightly mac
nightly win32
nightly win64
Dial down recursion in new test added by abd2dcd555f4 so as to not chew up so much C stack when the mjit is disabled (r=orange)
js/src/jit-test/tests/basic/test-apply-many-args.js
--- a/js/src/jit-test/tests/basic/test-apply-many-args.js
+++ b/js/src/jit-test/tests/basic/test-apply-many-args.js
@@ -1,11 +1,14 @@
 function f(x) {
     if (x == 0)
         return;
     arguments[0]--;
     f.apply(null, arguments);
 }
 
-a = [100];
+// When the apply-optimization isn't on, each recursive call chews up the C
+// stack, so don't push it.
+a = [20];
+
 for (var i = 0; i < 2000; ++i)
   a.push(i);
 f.apply(null, a);