Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | // Flags: --stack-size=100 |
| 29 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 30 | function overflow() { |
| 31 | var a, b, c, d, e; // Allocates some locals on the function's stack frame. |
| 32 | overflow(); |
| 33 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 34 | function rec1(a) { rec1(a+1); } |
| 35 | function rec2(a) { rec3(a+1); } |
| 36 | function rec3(a) { rec2(a+1); } |
| 37 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 38 | // Test stack trace has correct function location at top of the stack. |
| 39 | try { |
| 40 | overflow(); |
| 41 | } catch (e) { |
| 42 | var first_frame = e.stack.split("\n")[1] |
| 43 | assertTrue(first_frame.indexOf("stack-traces-overflow.js:30:18") > 0); |
| 44 | } |
| 45 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 46 | // Test stack trace getter and setter. |
| 47 | try { |
| 48 | rec1(0); |
| 49 | } catch (e) { |
| 50 | assertTrue(e.stack.indexOf("rec1") > 0); |
| 51 | e.stack = "123"; |
| 52 | assertEquals("123", e.stack); |
| 53 | } |
| 54 | |
| 55 | // Test setter w/o calling the getter. |
| 56 | try { |
| 57 | rec2(0); |
| 58 | } catch (e) { |
| 59 | assertTrue(e.stack.indexOf("rec2") > 0); |
| 60 | assertTrue(e.stack.indexOf("rec3") > 0); |
| 61 | e.stack = "123"; |
| 62 | assertEquals("123", e.stack); |
| 63 | } |
| 64 | |
| 65 | // Test getter to make sure setter does not affect the boilerplate. |
| 66 | try { |
| 67 | rec1(0); |
| 68 | } catch (e) { |
| 69 | assertTrue(e.stack.indexOf("rec1") > 0); |
| 70 | assertInstanceof(e, RangeError); |
| 71 | } |
| 72 | |
| 73 | |
| 74 | // Check setting/getting stack property on the prototype chain. |
| 75 | function testErrorPrototype(prototype) { |
| 76 | var object = {}; |
| 77 | object.__proto__ = prototype; |
| 78 | object.stack = "123"; // Overwriting stack property fails. |
| 79 | assertEquals(prototype.stack, object.stack); |
| 80 | assertTrue("123" != prototype.stack); |
| 81 | } |
| 82 | |
| 83 | try { |
| 84 | rec1(0); |
| 85 | } catch (e) { |
| 86 | e.stack; |
| 87 | testErrorPrototype(e); |
| 88 | } |
| 89 | |
| 90 | try { |
| 91 | rec1(0); |
| 92 | } catch (e) { |
| 93 | testErrorPrototype(e); |
| 94 | } |
| 95 | |
| 96 | try { |
| 97 | throw new Error(); |
| 98 | } catch (e) { |
| 99 | testErrorPrototype(e); |
| 100 | } |
| 101 | |
| 102 | Error.stackTraceLimit = 3; |
| 103 | try { |
| 104 | rec1(0); |
| 105 | } catch (e) { |
| 106 | assertEquals(4, e.stack.split('\n').length); |
| 107 | } |
| 108 | |
| 109 | Error.stackTraceLimit = 25.9; |
| 110 | try { |
| 111 | rec1(0); |
| 112 | } catch (e) { |
| 113 | assertEquals(26, e.stack.split('\n').length); |
| 114 | } |
| 115 | |
| 116 | Error.stackTraceLimit = NaN; |
| 117 | try { |
| 118 | rec1(0); |
| 119 | } catch (e) { |
| 120 | assertEquals(1, e.stack.split('\n').length); |
| 121 | } |
| 122 | |
| 123 | // A limit outside the range of integers. |
| 124 | Error.stackTraceLimit = 1e12; |
| 125 | try { |
| 126 | rec1(0); |
| 127 | } catch (e) { |
| 128 | assertTrue(e.stack.split('\n').length > 100); |
| 129 | } |
| 130 | |
| 131 | Error.stackTraceLimit = Infinity; |
| 132 | try { |
| 133 | rec1(0); |
| 134 | } catch (e) { |
| 135 | assertTrue(e.stack.split('\n').length > 100); |
| 136 | } |
| 137 | |
| 138 | Error.stackTraceLimit = "not a number"; |
| 139 | try { |
| 140 | rec1(0); |
| 141 | } catch (e) { |
| 142 | assertEquals(undefined, e.stack); |
| 143 | e.stack = "abc"; |
| 144 | assertEquals("abc", e.stack); |
| 145 | } |
| 146 | |
| 147 | Error.stackTraceLimit = 3; |
| 148 | Error = ""; // Overwrite Error in the global object. |
| 149 | try { |
| 150 | rec1(0); |
| 151 | } catch (e) { |
| 152 | assertEquals(4, e.stack.split('\n').length); |
| 153 | } |