OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions | 5 // modification, are permitted provided that the following conditions |
6 // are met: | 6 // are met: |
7 // 1. Redistributions of source code must retain the above copyright | 7 // 1. Redistributions of source code must retain the above copyright |
8 // notice, this list of conditions and the following disclaimer. | 8 // notice, this list of conditions and the following disclaimer. |
9 // 2. Redistributions in binary form must reproduce the above copyright | 9 // 2. Redistributions in binary form must reproduce the above copyright |
10 // notice, this list of conditions and the following disclaimer in the | 10 // notice, this list of conditions and the following disclaimer in the |
(...skipping 11 matching lines...) Expand all Loading... |
22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | 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."); | 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 | 25 |
26 function simpleRecursion(depth) { | 26 function simpleRecursion(depth) { |
27 if (depth) | 27 if (depth) |
28 simpleRecursion(depth - 1); | 28 simpleRecursion(depth - 1); |
29 } | 29 } |
30 | 30 |
31 try { | 31 try { |
32 simpleRecursion(5000); | 32 simpleRecursion(4000); |
33 } catch (ex) { | 33 } catch (ex) { |
34 debug("FAIL: " + ex); | 34 debug("FAIL: " + ex); |
35 } | 35 } |
36 | 36 |
37 try { | 37 try { |
38 simpleRecursion(10000000); | 38 simpleRecursion(10000000); |
39 } catch (ex) { | 39 } catch (ex) { |
40 var msg = String(eval(ex)); | 40 var msg = String(eval(ex)); |
41 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | 41 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
42 } | 42 } |
(...skipping 26 matching lines...) Expand all Loading... |
69 if (depth) | 69 if (depth) |
70 tooManyArgsRecursion(depth - 1, 1); | 70 tooManyArgsRecursion(depth - 1, 1); |
71 } | 71 } |
72 | 72 |
73 try { | 73 try { |
74 tooManyArgsRecursion(10000000, 1); | 74 tooManyArgsRecursion(10000000, 1); |
75 } catch (ex) { | 75 } catch (ex) { |
76 var msg = String(eval(ex)); | 76 var msg = String(eval(ex)); |
77 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); | 77 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'"); |
78 } | 78 } |
OLD | NEW |