OLD | NEW |
(Empty) | |
| 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 function rec1(a) { rec1(a+1); } |
| 29 function rec2(a) { rec3(a+1); } |
| 30 function rec3(a) { rec2(a+1); } |
| 31 |
| 32 // Test stack trace getter and setter. |
| 33 try { |
| 34 rec1(0); |
| 35 } catch (e) { |
| 36 assertTrue(e.stack.indexOf("rec1") > 0); |
| 37 e.stack = "123"; |
| 38 assertEquals("123", e.stack); |
| 39 } |
| 40 |
| 41 // Test setter w/o calling the getter. |
| 42 try { |
| 43 rec2(0); |
| 44 } catch (e) { |
| 45 assertTrue(e.stack.indexOf("rec2") > 0); |
| 46 assertTrue(e.stack.indexOf("rec3") > 0); |
| 47 e.stack = "123"; |
| 48 assertEquals("123", e.stack); |
| 49 } |
| 50 |
| 51 // Test getter to make sure setter does not affect the boilerplate. |
| 52 try { |
| 53 rec1(0); |
| 54 } catch (e) { |
| 55 assertTrue(e.stack.indexOf("rec1") > 0); |
| 56 assertInstanceof(e, RangeError); |
| 57 } |
| 58 |
| 59 |
| 60 // Check setting/getting stack property on the prototype chain. |
| 61 function testErrorPrototype(prototype) { |
| 62 var object = {}; |
| 63 object.__proto__ = prototype; |
| 64 object.stack = "123"; |
| 65 assertEquals("123", object.stack); |
| 66 assertTrue("123" != prototype.stack); |
| 67 } |
| 68 |
| 69 try { |
| 70 rec1(0); |
| 71 } catch (e) { |
| 72 e.stack; |
| 73 testErrorPrototype(e); |
| 74 } |
| 75 |
| 76 try { |
| 77 rec1(0); |
| 78 } catch (e) { |
| 79 testErrorPrototype(e); |
| 80 } |
| 81 |
| 82 try { |
| 83 throw new Error(); |
| 84 } catch (e) { |
| 85 testErrorPrototype(e); |
| 86 } |
| 87 |
| 88 Error.stackTraceLimit = 3; |
| 89 try { |
| 90 rec1(0); |
| 91 } catch (e) { |
| 92 assertEquals(4, e.stack.split('\n').length); |
| 93 } |
| 94 |
| 95 Error.stackTraceLimit = 25.9; |
| 96 try { |
| 97 rec1(0); |
| 98 } catch (e) { |
| 99 assertEquals(26, e.stack.split('\n').length); |
| 100 } |
| 101 |
| 102 Error.stackTraceLimit = NaN; |
| 103 try { |
| 104 rec1(0); |
| 105 } catch (e) { |
| 106 assertEquals(1, e.stack.split('\n').length); |
| 107 } |
| 108 |
| 109 Error.stackTraceLimit = "not a number"; |
| 110 try { |
| 111 rec1(0); |
| 112 } catch (e) { |
| 113 assertEquals(undefined, e.stack); |
| 114 } |
| 115 |
| 116 Error.stackTraceLimit = 3; |
| 117 Error = ""; // Overwrite Error in the global object. |
| 118 try { |
| 119 rec1(0); |
| 120 } catch (e) { |
| 121 assertEquals(4, e.stack.split('\n').length); |
| 122 } |
OLD | NEW |