OLD | NEW |
| (Empty) |
1 // Copyright 2013 the V8 project authors. All rights reserved. | |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | |
3 // | |
4 // Redistribution and use in source and binary forms, with or without | |
5 // modification, are permitted provided that the following conditions | |
6 // are met: | |
7 // 1. Redistributions of source code must retain the above copyright | |
8 // notice, this list of conditions and the following disclaimer. | |
9 // 2. Redistributions in binary form must reproduce the above copyright | |
10 // notice, this list of conditions and the following disclaimer in the | |
11 // documentation and/or other materials provided with the distribution. | |
12 // | |
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | |
14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | |
17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | |
20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
23 | |
24 description("This test how deep we can recurse, and that we get an exception whe
n we do, as opposed to a stack overflow."); | |
25 | |
26 function simpleRecursion(depth) { | |
27 if (depth) | |
28 simpleRecursion(depth - 1); | |
29 } | |
30 | |
31 try { | |
32 simpleRecursion(17472); | |
33 } catch (ex) { | |
34 debug("FAIL: " + ex); | |
35 } | |
36 | |
37 try { | |
38 simpleRecursion(10000000); | |
39 } catch (ex) { | |
40 var msg = String(eval(ex)); | |
41 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | |
42 } | |
43 | |
44 try { | |
45 simpleRecursion(1000000000); | |
46 } catch (ex) { | |
47 var msg = String(eval(ex)); | |
48 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | |
49 } | |
50 | |
51 var tooFewArgsDepth = 0; | |
52 | |
53 function tooFewArgsRecursion(a) { | |
54 if (tooFewArgsDepth) { | |
55 tooFewArgsDepth--; | |
56 tooFewArgsRecursion(); | |
57 } | |
58 } | |
59 | |
60 try { | |
61 tooFewArgsDepth = 10000000; | |
62 tooFewArgsRecursion(); | |
63 } catch (ex) { | |
64 var msg = String(eval(ex)); | |
65 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | |
66 } | |
67 | |
68 function tooManyArgsRecursion(depth) { | |
69 if (depth) | |
70 tooManyArgsRecursion(depth - 1, 1); | |
71 } | |
72 | |
73 try { | |
74 tooManyArgsRecursion(10000000, 1); | |
75 } catch (ex) { | |
76 var msg = String(eval(ex)); | |
77 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | |
78 } | |
OLD | NEW |