| Index: test/mjsunit/compiler/recursive-deopt.js
|
| diff --git a/test/mjsunit/compiler/recursive-deopt.js b/test/mjsunit/compiler/recursive-deopt.js
|
| new file mode 100644
|
| index 0000000000000000000000000000000000000000..366f59ae1be3546ba78cbf4a29104c862b2471d2
|
| --- /dev/null
|
| +++ b/test/mjsunit/compiler/recursive-deopt.js
|
| @@ -0,0 +1,48 @@
|
| +// Copyright 2010 the V8 project authors. All rights reserved.
|
| +// Redistribution and use in source and binary forms, with or without
|
| +// modification, are permitted provided that the following conditions are
|
| +// met:
|
| +//
|
| +// * Redistributions of source code must retain the above copyright
|
| +// notice, this list of conditions and the following disclaimer.
|
| +// * Redistributions in binary form must reproduce the above
|
| +// copyright notice, this list of conditions and the following
|
| +// disclaimer in the documentation and/or other materials provided
|
| +// with the distribution.
|
| +// * Neither the name of Google Inc. nor the names of its
|
| +// contributors may be used to endorse or promote products derived
|
| +// from this software without specific prior written permission.
|
| +//
|
| +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| +
|
| +
|
| +function f(n) {
|
| + // Force deopt in both leaf case and when returning. To make
|
| + // debugging easier, the operation that bails out (<<) is so simple
|
| + // that it doesn't cause GCs.
|
| + if (n == 0) return 1 << one;
|
| + return f(n - 1) << one;
|
| +}
|
| +
|
| +function RunTests() {
|
| + assertEquals(1 << 1, f(0));
|
| + assertEquals(1 << 2, f(1));
|
| + assertEquals(1 << 5, f(4));
|
| +}
|
| +
|
| +
|
| +var one = 1;
|
| +for (var i = 0; i < 1000000; i++) RunTests();
|
| +
|
| +var one = { valueOf: function() { return 1; } };
|
| +for (var j = 0; j < 100000; j++) RunTests();
|
|
|