1 // Copyright 2010 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: --allow-natives-syntax 29 30 // Test stack traces with method calls. 31 function Hest() {} 32 function Svin() {} 33 34 Svin.prototype.two = function() { /* xxxxxxx */ o.three(); } 35 36 Hest.prototype.one = function(x) { x.two(); } 37 38 Hest.prototype.three = function() { if (v == 42) throw new Error("urg"); } 39 40 var o = new Hest(); 41 var s = new Svin(); 42 var v = 0; 43 44 for (var i = 0; i < 5; i++) { 45 o.one(s); 46 } 47 %OptimizeFunctionOnNextCall(Hest.prototype.one); 48 %OptimizeFunctionOnNextCall(Hest.prototype.three); 49 o.one(s); 50 51 v = 42; 52 53 try { 54 o.one(s); 55 } catch (e) { 56 var stack = e.stack.toString(); 57 var p3 = stack.indexOf("at Hest.three"); 58 var p2 = stack.indexOf("at Svin.two"); 59 var p1 = stack.indexOf("at Hest.one"); 60 assertTrue(p3 != -1); 61 assertTrue(p2 != -1); 62 assertTrue(p1 != -1); 63 assertTrue(p3 < p2); 64 assertTrue(p2 < p1); 65 assertTrue(stack.indexOf("38:56") != -1); 66 assertTrue(stack.indexOf("34:51") != -1); 67 assertTrue(stack.indexOf("36:38") != -1); 68 assertTrue(stack.indexOf("54:5") != -1); 69 } 70
