Commit 7bdba61b authored by sigurds@chromium.org's avatar sigurds@chromium.org

Simplify inlining now that the scheduler is smart(er).

* Only control adjustment is to move everything from the inlinee's
  start block to the block the call was in.
* Add a unit test to ensure that the scheduler actually picks the
  right order when placing the code.

R=mstarzinger@chromium.org, titzer@chromium.org

Review URL: https://codereview.chromium.org/508953002

git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@23489 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 6b1dd6b2
......@@ -49,35 +49,6 @@ void JSInliner::Inline() {
}
static void MoveWithDependencies(Graph* graph, Node* node, Node* old_block,
Node* new_block) {
if (OperatorProperties::HasControlInput(node->op())) {
// Check if we have left the old_block.
if (NodeProperties::GetControlInput(node) != old_block) return;
// If not, move this node to the new_block.
NodeProperties::ReplaceControlInput(node, new_block);
}
// Independent of whether a node has a control input or not,
// it might have a dependency that is pinned to old_block.
for (InputIter iter = node->inputs().begin(); iter != node->inputs().end();
++iter) {
if (NodeProperties::IsControlEdge(iter.edge())) continue;
MoveWithDependencies(graph, *iter, old_block, new_block);
}
}
static void MoveAllControlNodes(Node* from, Node* to) {
for (UseIter iter = from->uses().begin(); iter != from->uses().end();) {
if (NodeProperties::IsControlEdge(iter.edge())) {
iter.UpdateToAndIncrement(to);
} else {
++iter;
}
}
}
// TODO(sigurds) Find a home for this function and reuse it everywhere (esp. in
// test cases, where similar code is currently duplicated).
static void Parse(Handle<JSFunction> function, CompilationInfoWithZone* info) {
......@@ -187,13 +158,9 @@ void Inlinee::UnifyReturn() {
void Inlinee::InlineAtCall(JSGraph* jsgraph, Node* call) {
MachineOperatorBuilder machine(jsgraph->zone());
// The scheduler is smart enough to place our code; we just ensure {control}
// becomes the control input of the start of the inlinee.
Node* control = NodeProperties::GetControlInput(call);
// Move all the nodes to the end block.
MoveAllControlNodes(control, end_block());
// Now move the ones the call depends on back up.
// We have to do this back-and-forth to treat the case where the call is
// pinned to the start block.
MoveWithDependencies(graph(), call, end_block(), control);
// The inlinee uses the context from the JSFunction object. This will
// also be the effect dependency for the inlinee as it produces an effect.
......
......@@ -162,33 +162,34 @@ TEST(InlineTwiceDependent) {
TEST(InlineTwiceDependentDiamond) {
FunctionTester T(
"(function () {"
"function foo(s) { if (true) {"
" return 12 } else { return 13; } };"
"function bar(s,t) { return foo(foo(1)); };"
"var x = 41;"
"function foo(s) { AssertStackDepth(1); if (s % 2 == 0) {"
" return x - s } else { return x + s; } };"
"function bar(s,t) { return foo(foo(s)); };"
"return bar;"
"})();",
CompilationInfo::kInliningEnabled |
CompilationInfo::kContextSpecializing);
InstallAssertStackDepthHelper(CcTest::isolate());
T.CheckCall(T.Val(12), T.undefined(), T.undefined());
T.CheckCall(T.Val(-11), T.Val(11), T.Val(4));
}
TEST(InlineTwiceDependentDiamondReal) {
TEST(InlineTwiceDependentDiamondDifferent) {
FunctionTester T(
"(function () {"
"var x = 41;"
"function foo(s) { AssertStackDepth(1); if (s % 2 == 0) {"
" return x - s } else { return x + s; } };"
"function bar(s,t) { return foo(foo(s)); };"
"function foo(s,t) { AssertStackDepth(1); if (s % 2 == 0) {"
" return x - s * t } else { return x + s * t; } };"
"function bar(s,t) { return foo(foo(s, 3), 5); };"
"return bar;"
"})();",
CompilationInfo::kInliningEnabled |
CompilationInfo::kContextSpecializing);
InstallAssertStackDepthHelper(CcTest::isolate());
T.CheckCall(T.Val(-11), T.Val(11), T.Val(4));
T.CheckCall(T.Val(-329), T.Val(11), T.Val(4));
}
#endif // V8_TURBOFAN_TARGET
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment