mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
208 lines
7.9 KiB
208 lines
7.9 KiB
// Copyright 2012 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.
|
|
|
|
// Flags: --expose-debug-as debug --allow-natives-syntax
|
|
// Get the Debug object exposed from the debug context global object.
|
|
Debug = debug.Debug
|
|
|
|
var listenerComplete = false;
|
|
var exception = false;
|
|
|
|
var testingConstructCall = false;
|
|
|
|
var expected = [
|
|
{ locals: {a0: 1, b0: 2}, args: { names: ["i", "x0", "y0"], values: [0, 3, 4] } },
|
|
{ locals: {a1: 3, b1: 4}, args: { names: ["i", "x1", "y1"], values: [1, 5, 6] } },
|
|
{ locals: {a2: 5, b2: 6}, args: { names: ["i"], values: [2] } },
|
|
{ locals: {a3: 7, b3: 8}, args: { names: ["i", "x3", "y3", "z3"], values: [3, 9, 10, undefined] } },
|
|
{ locals: {a4: 9, b4: 10}, args: { names: ["i", "x4", "y4"], values: [4, 11, 12] } }
|
|
];
|
|
|
|
function arraySum(arr) {
|
|
return arr.reduce(function (a, b) { return a + b; }, 0);
|
|
}
|
|
|
|
function listener(event, exec_state, event_data, data) {
|
|
try {
|
|
if (event == Debug.DebugEvent.Break)
|
|
{
|
|
assertEquals(6, exec_state.frameCount());
|
|
|
|
for (var i = 0; i < exec_state.frameCount(); i++) {
|
|
var frame = exec_state.frame(i);
|
|
if (i < exec_state.frameCount() - 1) {
|
|
var expected_args = expected[i].args;
|
|
var expected_locals = expected[i].locals;
|
|
|
|
// All frames except the bottom one have expected locals.
|
|
var locals = {};
|
|
for (var j = 0; j < frame.localCount(); j++) {
|
|
locals[frame.localName(j)] = frame.localValue(j).value();
|
|
}
|
|
assertPropertiesEqual(expected_locals, locals);
|
|
|
|
// All frames except the bottom one have expected arguments.
|
|
for (var j = 0; j < expected_args.names.length; j++) {
|
|
assertEquals(expected_args.names[j], frame.argumentName(j));
|
|
assertEquals(expected_args.values[j], frame.argumentValue(j).value());
|
|
}
|
|
|
|
// All frames except the bottom one have two scopes.
|
|
assertEquals(2, frame.scopeCount());
|
|
assertEquals(debug.ScopeType.Local, frame.scope(0).scopeType());
|
|
assertEquals(debug.ScopeType.Global, frame.scope(1).scopeType());
|
|
|
|
Object.keys(expected_locals).forEach(function (name) {
|
|
assertEquals(expected_locals[name], frame.scope(0).scopeObject().value()[name]);
|
|
});
|
|
|
|
for (var j = 0; j < expected_args.names.length; j++) {
|
|
var arg_name = expected_args.names[j];
|
|
var arg_value = expected_args.values[j];
|
|
assertEquals(arg_value, frame.scope(0).scopeObject().value()[arg_name]);
|
|
}
|
|
|
|
// Evaluate in the inlined frame.
|
|
Object.keys(expected_locals).forEach(function (name) {
|
|
assertEquals(expected_locals[name], frame.evaluate(name).value());
|
|
});
|
|
|
|
for (var j = 0; j < expected_args.names.length; j++) {
|
|
var arg_name = expected_args.names[j];
|
|
var arg_value = expected_args.values[j];
|
|
assertEquals(arg_value, frame.evaluate(arg_name).value());
|
|
assertEquals(arg_value, frame.evaluate('arguments['+j+']').value());
|
|
}
|
|
|
|
var expected_args_sum = arraySum(expected_args.values);
|
|
var expected_locals_sum =
|
|
arraySum(Object.keys(expected_locals).
|
|
map(function (k) { return expected_locals[k]; }));
|
|
|
|
assertEquals(expected_locals_sum + expected_args_sum,
|
|
frame.evaluate(Object.keys(expected_locals).join('+') + ' + ' +
|
|
expected_args.names.join('+')).value());
|
|
|
|
var arguments_sum = expected_args.names.map(function(_, idx) {
|
|
return "arguments[" + idx + "]";
|
|
}).join('+');
|
|
assertEquals(expected_args_sum,
|
|
frame.evaluate(arguments_sum).value());
|
|
} else {
|
|
// The bottom frame only have the global scope.
|
|
assertEquals(1, frame.scopeCount());
|
|
assertEquals(debug.ScopeType.Global, frame.scope(0).scopeType());
|
|
}
|
|
|
|
// Check the frame function.
|
|
switch (i) {
|
|
case 0: assertEquals(h, frame.func().value()); break;
|
|
case 1: assertEquals(g3, frame.func().value()); break;
|
|
case 2: assertEquals(g2, frame.func().value()); break;
|
|
case 3: assertEquals(g1, frame.func().value()); break;
|
|
case 4: assertEquals(f, frame.func().value()); break;
|
|
case 5: break;
|
|
default: assertUnreachable();
|
|
}
|
|
|
|
// Check for construct call.
|
|
assertEquals(testingConstructCall && i == 4, frame.isConstructCall());
|
|
|
|
// When function f is optimized (1 means YES, see runtime.cc) we
|
|
// expect an optimized frame for f with g1, g2 and g3 inlined.
|
|
if (%GetOptimizationStatus(f) == 1) {
|
|
if (i == 1 || i == 2 || i == 3) {
|
|
assertTrue(frame.isOptimizedFrame());
|
|
assertTrue(frame.isInlinedFrame());
|
|
assertEquals(4 - i, frame.inlinedFrameIndex());
|
|
} else if (i == 4) {
|
|
assertTrue(frame.isOptimizedFrame());
|
|
assertFalse(frame.isInlinedFrame());
|
|
} else {
|
|
assertFalse(frame.isOptimizedFrame());
|
|
assertFalse(frame.isInlinedFrame());
|
|
}
|
|
}
|
|
}
|
|
|
|
// Indicate that all was processed.
|
|
listenerComplete = true;
|
|
}
|
|
} catch (e) {
|
|
exception = e.toString() + e.stack;
|
|
};
|
|
};
|
|
|
|
for (var i = 0; i < 4; i++) f(expected.length - 1, 11, 12);
|
|
%OptimizeFunctionOnNextCall(f);
|
|
f(expected.length - 1, 11, 12);
|
|
|
|
// Add the debug event listener.
|
|
Debug.setListener(listener);
|
|
|
|
function h(i, x0, y0) {
|
|
var a0 = expected[i].locals.a0;
|
|
var b0 = expected[i].locals.b0;
|
|
debugger; // Breakpoint.
|
|
}
|
|
|
|
function g3(i, x1, y1) {
|
|
var a1 = expected[i].locals.a1;
|
|
var b1 = expected[i].locals.b1;
|
|
h(i - 1, a1, b1);
|
|
}
|
|
|
|
function g2(i) {
|
|
var a2 = expected[i].locals.a2;
|
|
var b2 = expected[i].locals.b2;
|
|
g3(i - 1, a2, b2);
|
|
}
|
|
|
|
function g1(i, x3, y3, z3) {
|
|
var a3 = expected[i].locals.a3;
|
|
var b3 = expected[i].locals.b3;
|
|
g2(i - 1, a3, b3);
|
|
}
|
|
|
|
function f(i, x4, y4) {
|
|
var a4 = expected[i].locals.a4;
|
|
var b4 = expected[i].locals.b4;
|
|
g1(i - 1, a4, b4);
|
|
}
|
|
|
|
// Test calling f normally and as a constructor.
|
|
f(expected.length - 1, 11, 12);
|
|
f(expected.length - 1, 11, 12, 0);
|
|
testingConstructCall = true;
|
|
new f(expected.length - 1, 11, 12);
|
|
new f(expected.length - 1, 11, 12, 0);
|
|
|
|
// Make sure that the debug event listener vas invoked.
|
|
assertFalse(exception, "exception in listener " + exception)
|
|
assertTrue(listenerComplete);
|
|
|
|
Debug.setListener(null);
|
|
|