v8/test/mjsunit/regress/regress-2564.js
yangguo@chromium.org 9155d20282 Stack trace API: poison stack frames below the first strict mode frame.
Function and receiver objects are not accessible for poisoned frames.

R=rossberg@chromium.org
BUG=v8:2564

Review URL: https://chromiumcodereview.appspot.com/13150003

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@14085 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2013-03-28 10:40:07 +00:00

123 lines
4.2 KiB
JavaScript

// Copyright 2013 the V8 project authors. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following
// disclaimer in the documentation and/or other materials provided
// with the distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
var o = [ function f0() { throw new Error(); },
function f1() { o[0](); },
function f2() { o[1](); },
function f3() { o[2](); } ];
Error.prepareStackTrace = function(error, frames) {
Error.prepareStackTrace = undefined; // Prevent recursion.
try {
assertEquals(5, frames.length);
// Don't check the last frame since that's the top-level code.
for (var i = 0; i < frames.length - 1; i++) {
assertEquals(o[i], frames[i].getFunction());
assertEquals(o, frames[i].getThis());
// Private fields are no longer accessible.
assertEquals(undefined, frames[i].receiver);
assertEquals(undefined, frames[i].fun);
assertEquals(undefined, frames[i].pos);
}
return "success";
} catch (e) {
return "fail";
}
}
try {
o[3]();
} catch (e) {
assertEquals("success", e.stack);
};
var o = [ function f0() { throw new Error(); },
function f1() { o[0](); },
function f2() { "use strict"; o[1](); },
function f3() { o[2](); } ];
Error.prepareStackTrace = function(error, frames) {
Error.prepareStackTrace = undefined; // Prevent recursion.
try {
assertEquals(5, frames.length);
for (var i = 0; i < 2; i++) {
// The first two frames are still classic mode.
assertEquals(o[i], frames[i].getFunction());
assertEquals(o, frames[i].getThis());
}
for (var i = 2; i < frames.length; i++) {
// The rest are poisoned by the first strict mode function.
assertEquals(undefined, frames[i].getFunction());
assertEquals(undefined, frames[i].getThis());
}
for (var i = 0; i < frames.length - 1; i++) {
// Function name remains accessible.
assertEquals("f"+i, frames[i].getFunctionName());
}
return "success";
} catch (e) {
return e;
}
}
try {
o[3]();
} catch (e) {
assertEquals("success", e.stack);
};
var o = [ function f0() { "use strict"; throw new Error(); },
function f1() { o[0](); },
function f2() { o[1](); },
function f3() { o[2](); } ];
Error.prepareStackTrace = function(error, frames) {
Error.prepareStackTrace = undefined; // Prevent recursion.
try {
assertEquals(5, frames.length);
for (var i = 0; i < frames.length; i++) {
// The rest are poisoned by the first strict mode function.
assertEquals(undefined, frames[i].getFunction());
assertEquals(undefined, frames[i].getThis());
if (i < frames.length - 1) { // Function name remains accessible.
assertEquals("f"+i, frames[i].getFunctionName());
}
}
return "success";
} catch (e) {
return e;
}
}
try {
o[3]();
} catch (e) {
assertEquals("success", e.stack);
};