Index: test/webkit/fast/js/deep-recursion-test.js |
diff --git a/test/webkit/fast/js/deep-recursion-test.js b/test/webkit/fast/js/deep-recursion-test.js |
deleted file mode 100644 |
index 59df2f1c9ad72b4fc13dd6822299e1f4558b32d1..0000000000000000000000000000000000000000 |
--- a/test/webkit/fast/js/deep-recursion-test.js |
+++ /dev/null |
@@ -1,78 +0,0 @@ |
-// Copyright 2013 the V8 project authors. All rights reserved. |
-// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
-// |
-// Redistribution and use in source and binary forms, with or without |
-// modification, are permitted provided that the following conditions |
-// are met: |
-// 1. Redistributions of source code must retain the above copyright |
-// notice, this list of conditions and the following disclaimer. |
-// 2. 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. |
-// |
-// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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. |
- |
-description("This test how deep we can recurse, and that we get an exception when we do, as opposed to a stack overflow."); |
- |
- function simpleRecursion(depth) { |
- if (depth) |
- simpleRecursion(depth - 1); |
- } |
- |
- try { |
- simpleRecursion(17472); |
- } catch (ex) { |
- debug("FAIL: " + ex); |
- } |
- |
- try { |
- simpleRecursion(10000000); |
- } catch (ex) { |
- var msg = String(eval(ex)); |
- shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
- } |
- |
- try { |
- simpleRecursion(1000000000); |
- } catch (ex) { |
- var msg = String(eval(ex)); |
- shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
- } |
- |
- var tooFewArgsDepth = 0; |
- |
- function tooFewArgsRecursion(a) { |
- if (tooFewArgsDepth) { |
- tooFewArgsDepth--; |
- tooFewArgsRecursion(); |
- } |
- } |
- |
- try { |
- tooFewArgsDepth = 10000000; |
- tooFewArgsRecursion(); |
- } catch (ex) { |
- var msg = String(eval(ex)); |
- shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
- } |
- |
- function tooManyArgsRecursion(depth) { |
- if (depth) |
- tooManyArgsRecursion(depth - 1, 1); |
- } |
- |
- try { |
- tooManyArgsRecursion(10000000, 1); |
- } catch (ex) { |
- var msg = String(eval(ex)); |
- shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
- } |