AuroraMiddleware/v8
1
0
Fork 0
Code Issues 2 Pull Requests Releases Wiki Activity
112f8dc97a
v8/test/unittests/compiler/scheduler-unittest.cc
bmeurer 203438d9bc [turbofan] Connect non-terminating loops via Terminate. 
This revives the Terminate operator and removes the weird Always
operator. As a first step we let the ControlReducer connect non
terminating loops via Terminate. The next step will be to change the
graph builder to insert Terminate nodes into every loop.

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

Cr-Commit-Position: refs/heads/master@{#28259}
2015-05-06 12:51:44 +00:00

2496 lines
78 KiB
C++
Raw Blame History

// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/access-builder.h"
#include "src/compiler/common-operator.h"
#include "src/compiler/graph.h"
#include "src/compiler/graph-visualizer.h"
#include "src/compiler/js-operator.h"
#include "src/compiler/node.h"
#include "src/compiler/opcodes.h"
#include "src/compiler/operator.h"
#include "src/compiler/schedule.h"
#include "src/compiler/scheduler.h"
#include "src/compiler/simplified-operator.h"
#include "src/compiler/verifier.h"
#include "test/unittests/compiler/compiler-test-utils.h"
#include "test/unittests/test-utils.h"
#include "testing/gmock/include/gmock/gmock.h"
using testing::AnyOf;
namespace v8 {
namespace internal {
namespace compiler {
class SchedulerTest : public TestWithIsolateAndZone {
public:
SchedulerTest()
: graph_(zone()), common_(zone()), simplified_(zone()), js_(zone()) {}
Schedule* ComputeAndVerifySchedule(size_t expected) {
if (FLAG_trace_turbo) {
OFStream os(stdout);
os << AsDOT(*graph());
}
Schedule* schedule =
Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kSplitNodes);
if (FLAG_trace_turbo_scheduler) {
OFStream os(stdout);
os << *schedule << std::endl;
}
ScheduleVerifier::Run(schedule);
EXPECT_EQ(expected, GetScheduledNodeCount(schedule));
return schedule;
}
size_t GetScheduledNodeCount(const Schedule* schedule) {
size_t node_count = 0;
for (auto block : *schedule->rpo_order()) {
node_count += block->NodeCount();
if (block->control() != BasicBlock::kNone) ++node_count;
}
return node_count;
}
Graph* graph() { return &graph_; }
CommonOperatorBuilder* common() { return &common_; }
SimplifiedOperatorBuilder* simplified() { return &simplified_; }
JSOperatorBuilder* js() { return &js_; }
private:
Graph graph_;
CommonOperatorBuilder common_;
SimplifiedOperatorBuilder simplified_;
JSOperatorBuilder js_;
};
class SchedulerRPOTest : public SchedulerTest {
public:
SchedulerRPOTest() {}
// TODO(titzer): pull RPO tests out to their own file.
void CheckRPONumbers(BasicBlockVector* order, size_t expected,
bool loops_allowed) {
CHECK(expected == order->size());
for (int i = 0; i < static_cast<int>(order->size()); i++) {
CHECK(order->at(i)->rpo_number() == i);
if (!loops_allowed) {
CHECK(!order->at(i)->loop_end());
CHECK(!order->at(i)->loop_header());
}
}
}
void CheckLoop(BasicBlockVector* order, BasicBlock** blocks, int body_size) {
BasicBlock* header = blocks[0];
BasicBlock* end = header->loop_end();
CHECK(end);
CHECK_GT(end->rpo_number(), 0);
CHECK_EQ(body_size, end->rpo_number() - header->rpo_number());
for (int i = 0; i < body_size; i++) {
CHECK_GE(blocks[i]->rpo_number(), header->rpo_number());
CHECK_LT(blocks[i]->rpo_number(), end->rpo_number());
CHECK(header->LoopContains(blocks[i]));
CHECK(header->IsLoopHeader() || blocks[i]->loop_header() == header);
}
if (header->rpo_number() > 0) {
CHECK_NE(order->at(header->rpo_number() - 1)->loop_header(), header);
}
if (end->rpo_number() < static_cast<int>(order->size())) {
CHECK_NE(order->at(end->rpo_number())->loop_header(), header);
}
}
struct TestLoop {
int count;
BasicBlock** nodes;
BasicBlock* header() { return nodes[0]; }
BasicBlock* last() { return nodes[count - 1]; }
~TestLoop() { delete[] nodes; }
};
TestLoop* CreateLoop(Schedule* schedule, int count) {
TestLoop* loop = new TestLoop();
loop->count = count;
loop->nodes = new BasicBlock* [count];
for (int i = 0; i < count; i++) {
loop->nodes[i] = schedule->NewBasicBlock();
if (i > 0) {
schedule->AddSuccessorForTesting(loop->nodes[i - 1], loop->nodes[i]);
}
}
schedule->AddSuccessorForTesting(loop->nodes[count - 1], loop->nodes[0]);
return loop;
}
};
namespace {
const Operator kHeapConstant(IrOpcode::kHeapConstant, Operator::kPure,
"HeapConstant", 0, 0, 0, 1, 0, 0);
const Operator kIntAdd(IrOpcode::kInt32Add, Operator::kPure, "Int32Add", 2, 0,
0, 1, 0, 0);
const Operator kMockCall(IrOpcode::kCall, Operator::kNoProperties, "MockCall",
0, 0, 1, 1, 0, 2);
const Operator kMockTailCall(IrOpcode::kTailCall, Operator::kNoProperties,
"MockTailCall", 1, 1, 1, 0, 0, 1);
} // namespace
// -----------------------------------------------------------------------------
// Special reverse-post-order block ordering.
TEST_F(SchedulerRPOTest, Degenerate1) {
Schedule schedule(zone());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 1, false);
EXPECT_EQ(schedule.start(), order->at(0));
}
TEST_F(SchedulerRPOTest, Degenerate2) {
Schedule schedule(zone());
schedule.AddGoto(schedule.start(), schedule.end());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 2, false);
EXPECT_EQ(schedule.start(), order->at(0));
EXPECT_EQ(schedule.end(), order->at(1));
}
TEST_F(SchedulerRPOTest, Line) {
for (int i = 0; i < 10; i++) {
Schedule schedule(zone());
BasicBlock* last = schedule.start();
for (int j = 0; j < i; j++) {
BasicBlock* block = schedule.NewBasicBlock();
block->set_deferred(i & 1);
schedule.AddGoto(last, block);
last = block;
}
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 1 + i, false);
for (size_t i = 0; i < schedule.BasicBlockCount(); i++) {
BasicBlock* block = schedule.GetBlockById(BasicBlock::Id::FromSize(i));
if (block->rpo_number() >= 0 && block->SuccessorCount() == 1) {
EXPECT_EQ(block->rpo_number() + 1, block->SuccessorAt(0)->rpo_number());
}
}
}
}
TEST_F(SchedulerRPOTest, SelfLoop) {
Schedule schedule(zone());
schedule.AddSuccessorForTesting(schedule.start(), schedule.start());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 1, true);
BasicBlock* loop[] = {schedule.start()};
CheckLoop(order, loop, 1);
}
TEST_F(SchedulerRPOTest, EntryLoop) {
Schedule schedule(zone());
BasicBlock* body = schedule.NewBasicBlock();
schedule.AddSuccessorForTesting(schedule.start(), body);
schedule.AddSuccessorForTesting(body, schedule.start());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 2, true);
BasicBlock* loop[] = {schedule.start(), body};
CheckLoop(order, loop, 2);
}
TEST_F(SchedulerRPOTest, EndLoop) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, 2));
schedule.AddSuccessorForTesting(schedule.start(), loop1->header());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 3, true);
CheckLoop(order, loop1->nodes, loop1->count);
}
TEST_F(SchedulerRPOTest, EndLoopNested) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, 2));
schedule.AddSuccessorForTesting(schedule.start(), loop1->header());
schedule.AddSuccessorForTesting(loop1->last(), schedule.start());
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 3, true);
CheckLoop(order, loop1->nodes, loop1->count);
}
TEST_F(SchedulerRPOTest, Diamond) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(A, C);
schedule.AddSuccessorForTesting(B, D);
schedule.AddSuccessorForTesting(C, D);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 4, false);
EXPECT_EQ(0, A->rpo_number());
EXPECT_THAT(B->rpo_number(), AnyOf(1, 2));
EXPECT_THAT(C->rpo_number(), AnyOf(1, 2));
EXPECT_EQ(3, D->rpo_number());
}
TEST_F(SchedulerRPOTest, Loop1) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(C, B);
schedule.AddSuccessorForTesting(C, D);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 4, true);
BasicBlock* loop[] = {B, C};
CheckLoop(order, loop, 2);
}
TEST_F(SchedulerRPOTest, Loop2) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(C, B);
schedule.AddSuccessorForTesting(B, D);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 4, true);
BasicBlock* loop[] = {B, C};
CheckLoop(order, loop, 2);
}
TEST_F(SchedulerRPOTest, LoopN) {
for (int i = 0; i < 11; i++) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.NewBasicBlock();
BasicBlock* E = schedule.NewBasicBlock();
BasicBlock* F = schedule.NewBasicBlock();
BasicBlock* G = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(C, D);
schedule.AddSuccessorForTesting(D, E);
schedule.AddSuccessorForTesting(E, F);
schedule.AddSuccessorForTesting(F, B);
schedule.AddSuccessorForTesting(B, G);
// Throw in extra backedges from time to time.
if (i == 1) schedule.AddSuccessorForTesting(B, B);
if (i == 2) schedule.AddSuccessorForTesting(C, B);
if (i == 3) schedule.AddSuccessorForTesting(D, B);
if (i == 4) schedule.AddSuccessorForTesting(E, B);
if (i == 5) schedule.AddSuccessorForTesting(F, B);
// Throw in extra loop exits from time to time.
if (i == 6) schedule.AddSuccessorForTesting(B, G);
if (i == 7) schedule.AddSuccessorForTesting(C, G);
if (i == 8) schedule.AddSuccessorForTesting(D, G);
if (i == 9) schedule.AddSuccessorForTesting(E, G);
if (i == 10) schedule.AddSuccessorForTesting(F, G);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 7, true);
BasicBlock* loop[] = {B, C, D, E, F};
CheckLoop(order, loop, 5);
}
}
TEST_F(SchedulerRPOTest, LoopNest1) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.NewBasicBlock();
BasicBlock* E = schedule.NewBasicBlock();
BasicBlock* F = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(C, D);
schedule.AddSuccessorForTesting(D, C);
schedule.AddSuccessorForTesting(D, E);
schedule.AddSuccessorForTesting(E, B);
schedule.AddSuccessorForTesting(E, F);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 6, true);
BasicBlock* loop1[] = {B, C, D, E};
CheckLoop(order, loop1, 4);
BasicBlock* loop2[] = {C, D};
CheckLoop(order, loop2, 2);
}
TEST_F(SchedulerRPOTest, LoopNest2) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.NewBasicBlock();
BasicBlock* E = schedule.NewBasicBlock();
BasicBlock* F = schedule.NewBasicBlock();
BasicBlock* G = schedule.NewBasicBlock();
BasicBlock* H = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(C, D);
schedule.AddSuccessorForTesting(D, E);
schedule.AddSuccessorForTesting(E, F);
schedule.AddSuccessorForTesting(F, G);
schedule.AddSuccessorForTesting(G, H);
schedule.AddSuccessorForTesting(E, D);
schedule.AddSuccessorForTesting(F, C);
schedule.AddSuccessorForTesting(G, B);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 8, true);
BasicBlock* loop1[] = {B, C, D, E, F, G};
CheckLoop(order, loop1, 6);
BasicBlock* loop2[] = {C, D, E, F};
CheckLoop(order, loop2, 4);
BasicBlock* loop3[] = {D, E};
CheckLoop(order, loop3, 2);
}
TEST_F(SchedulerRPOTest, LoopFollow1) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, 1));
SmartPointer<TestLoop> loop2(CreateLoop(&schedule, 1));
BasicBlock* A = schedule.start();
BasicBlock* E = schedule.end();
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->header(), loop2->header());
schedule.AddSuccessorForTesting(loop2->last(), E);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
EXPECT_EQ(schedule.BasicBlockCount(), order->size());
CheckLoop(order, loop1->nodes, loop1->count);
CheckLoop(order, loop2->nodes, loop2->count);
}
TEST_F(SchedulerRPOTest, LoopFollow2) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, 1));
SmartPointer<TestLoop> loop2(CreateLoop(&schedule, 1));
BasicBlock* A = schedule.start();
BasicBlock* S = schedule.NewBasicBlock();
BasicBlock* E = schedule.end();
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->header(), S);
schedule.AddSuccessorForTesting(S, loop2->header());
schedule.AddSuccessorForTesting(loop2->last(), E);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
EXPECT_EQ(schedule.BasicBlockCount(), order->size());
CheckLoop(order, loop1->nodes, loop1->count);
CheckLoop(order, loop2->nodes, loop2->count);
}
TEST_F(SchedulerRPOTest, LoopFollowN) {
for (int size = 1; size < 5; size++) {
for (int exit = 0; exit < size; exit++) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, size));
SmartPointer<TestLoop> loop2(CreateLoop(&schedule, size));
BasicBlock* A = schedule.start();
BasicBlock* E = schedule.end();
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->nodes[exit], loop2->header());
schedule.AddSuccessorForTesting(loop2->nodes[exit], E);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
EXPECT_EQ(schedule.BasicBlockCount(), order->size());
CheckLoop(order, loop1->nodes, loop1->count);
CheckLoop(order, loop2->nodes, loop2->count);
}
}
}
TEST_F(SchedulerRPOTest, NestedLoopFollow1) {
Schedule schedule(zone());
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, 1));
SmartPointer<TestLoop> loop2(CreateLoop(&schedule, 1));
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* E = schedule.end();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, loop1->header());
schedule.AddSuccessorForTesting(loop1->header(), loop2->header());
schedule.AddSuccessorForTesting(loop2->last(), C);
schedule.AddSuccessorForTesting(C, E);
schedule.AddSuccessorForTesting(C, B);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
EXPECT_EQ(schedule.BasicBlockCount(), order->size());
CheckLoop(order, loop1->nodes, loop1->count);
CheckLoop(order, loop2->nodes, loop2->count);
BasicBlock* loop3[] = {B, loop1->nodes[0], loop2->nodes[0], C};
CheckLoop(order, loop3, 4);
}
TEST_F(SchedulerRPOTest, LoopBackedges1) {
int size = 8;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* E = schedule.end();
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, size));
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->last(), E);
schedule.AddSuccessorForTesting(loop1->nodes[i], loop1->header());
schedule.AddSuccessorForTesting(loop1->nodes[j], E);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, schedule.BasicBlockCount(), true);
CheckLoop(order, loop1->nodes, loop1->count);
}
}
}
TEST_F(SchedulerRPOTest, LoopOutedges1) {
int size = 8;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* D = schedule.NewBasicBlock();
BasicBlock* E = schedule.end();
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, size));
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->last(), E);
schedule.AddSuccessorForTesting(loop1->nodes[i], loop1->header());
schedule.AddSuccessorForTesting(loop1->nodes[j], D);
schedule.AddSuccessorForTesting(D, E);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, schedule.BasicBlockCount(), true);
CheckLoop(order, loop1->nodes, loop1->count);
}
}
}
TEST_F(SchedulerRPOTest, LoopOutedges2) {
int size = 8;
for (int i = 0; i < size; i++) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* E = schedule.end();
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, size));
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->last(), E);
for (int j = 0; j < size; j++) {
BasicBlock* O = schedule.NewBasicBlock();
schedule.AddSuccessorForTesting(loop1->nodes[j], O);
schedule.AddSuccessorForTesting(O, E);
}
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, schedule.BasicBlockCount(), true);
CheckLoop(order, loop1->nodes, loop1->count);
}
}
TEST_F(SchedulerRPOTest, LoopOutloops1) {
int size = 8;
for (int i = 0; i < size; i++) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* E = schedule.end();
SmartPointer<TestLoop> loop1(CreateLoop(&schedule, size));
schedule.AddSuccessorForTesting(A, loop1->header());
schedule.AddSuccessorForTesting(loop1->last(), E);
TestLoop** loopN = new TestLoop* [size];
for (int j = 0; j < size; j++) {
loopN[j] = CreateLoop(&schedule, 2);
schedule.AddSuccessorForTesting(loop1->nodes[j], loopN[j]->header());
schedule.AddSuccessorForTesting(loopN[j]->last(), E);
}
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, schedule.BasicBlockCount(), true);
CheckLoop(order, loop1->nodes, loop1->count);
for (int j = 0; j < size; j++) {
CheckLoop(order, loopN[j]->nodes, loopN[j]->count);
delete loopN[j];
}
delete[] loopN;
}
}
TEST_F(SchedulerRPOTest, LoopMultibackedge) {
Schedule schedule(zone());
BasicBlock* A = schedule.start();
BasicBlock* B = schedule.NewBasicBlock();
BasicBlock* C = schedule.NewBasicBlock();
BasicBlock* D = schedule.NewBasicBlock();
BasicBlock* E = schedule.NewBasicBlock();
schedule.AddSuccessorForTesting(A, B);
schedule.AddSuccessorForTesting(B, C);
schedule.AddSuccessorForTesting(B, D);
schedule.AddSuccessorForTesting(B, E);
schedule.AddSuccessorForTesting(C, B);
schedule.AddSuccessorForTesting(D, B);
schedule.AddSuccessorForTesting(E, B);
BasicBlockVector* order = Scheduler::ComputeSpecialRPO(zone(), &schedule);
CheckRPONumbers(order, 5, true);
BasicBlock* loop1[] = {B, C, D, E};
CheckLoop(order, loop1, 4);
}
// -----------------------------------------------------------------------------
// Graph end-to-end scheduling.
TEST_F(SchedulerTest, BuildScheduleEmpty) {
graph()->SetStart(graph()->NewNode(common()->Start(0)));
graph()->SetEnd(graph()->NewNode(common()->End(), graph()->start()));
USE(Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kNoFlags));
}
TEST_F(SchedulerTest, BuildScheduleOneParameter) {
graph()->SetStart(graph()->NewNode(common()->Start(0)));
Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start());
Node* ret = graph()->NewNode(common()->Return(), p1, graph()->start(),
graph()->start());
graph()->SetEnd(graph()->NewNode(common()->End(), ret));
USE(Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kNoFlags));
}
TEST_F(SchedulerTest, BuildScheduleIfSplit) {
graph()->SetStart(graph()->NewNode(common()->Start(3)));
Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start());
Node* p2 = graph()->NewNode(common()->Parameter(1), graph()->start());
Node* p3 = graph()->NewNode(common()->Parameter(2), graph()->start());
Node* p4 = graph()->NewNode(common()->Parameter(3), graph()->start());
Node* p5 = graph()->NewNode(common()->Parameter(4), graph()->start());
Node* cmp = graph()->NewNode(js()->LessThanOrEqual(LanguageMode::SLOPPY), p1,
p2, p3, graph()->start(), graph()->start());
Node* branch = graph()->NewNode(common()->Branch(), cmp, graph()->start());
Node* true_branch = graph()->NewNode(common()->IfTrue(), branch);
Node* false_branch = graph()->NewNode(common()->IfFalse(), branch);
Node* ret1 =
graph()->NewNode(common()->Return(), p4, graph()->start(), true_branch);
Node* ret2 =
graph()->NewNode(common()->Return(), p5, graph()->start(), false_branch);
Node* merge = graph()->NewNode(common()->Merge(2), ret1, ret2);
graph()->SetEnd(graph()->NewNode(common()->End(), merge));
ComputeAndVerifySchedule(13);
}
TEST_F(SchedulerTest, BuildScheduleIfSplitWithEffects) {
const Operator* op;
Unique<HeapObject> unique_constant =
Unique<HeapObject>::CreateImmovable(factory()->undefined_value());
// Manually transcripted code for:
// function turbo_fan_test(a, b, c, y) {
// if (a < b) {
// return a + b - c * c - a + y;
// } else {
// return c * c - a;
// }
// }
Node* nil = graph()->NewNode(common()->Dead());
op = common()->End();
Node* n39 = graph()->NewNode(op, nil);
USE(n39);
op = common()->Merge(2);
Node* n37 = graph()->NewNode(op, nil, nil);
USE(n37);
op = common()->Return();
Node* n29 = graph()->NewNode(op, nil, nil, nil);
USE(n29);
op = common()->Return();
Node* n36 = graph()->NewNode(op, nil, nil, nil);
USE(n36);
op = js()->Add(LanguageMode::SLOPPY);
Node* n27 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n27);
op = common()->IfSuccess();
Node* n28 = graph()->NewNode(op, nil);
USE(n28);
op = js()->Subtract(LanguageMode::SLOPPY);
Node* n34 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n34);
op = common()->IfSuccess();
Node* n35 = graph()->NewNode(op, nil);
USE(n35);
op = js()->Subtract(LanguageMode::SLOPPY);
Node* n25 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n25);
op = common()->Parameter(4);
Node* n5 = graph()->NewNode(op, nil);
USE(n5);
op = common()->Parameter(5);
Node* n7 = graph()->NewNode(op, nil);
USE(n7);
op = common()->FrameState(JS_FRAME, BailoutId(-1),
OutputFrameStateCombine::Ignore());
Node* n13 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n13);
op = common()->IfSuccess();
Node* n26 = graph()->NewNode(op, nil);
USE(n26);
op = js()->Multiply(LanguageMode::SLOPPY);
Node* n32 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n32);
op = common()->Parameter(1);
Node* n2 = graph()->NewNode(op, nil);
USE(n2);
op = common()->IfSuccess();
Node* n33 = graph()->NewNode(op, nil);
USE(n33);
op = js()->Subtract(LanguageMode::SLOPPY);
Node* n23 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n23);
op = common()->IfSuccess();
Node* n24 = graph()->NewNode(op, nil);
USE(n24);
op = common()->Start(4);
Node* n0 = graph()->NewNode(op);
USE(n0);
op = common()->StateValues(0);
Node* n11 = graph()->NewNode(op);
USE(n11);
op = common()->NumberConstant(0);
Node* n12 = graph()->NewNode(op);
USE(n12);
op = common()->HeapConstant(unique_constant);
Node* n6 = graph()->NewNode(op);
USE(n6);
op = common()->Parameter(3);
Node* n4 = graph()->NewNode(op, nil);
USE(n4);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n15 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n15);
op = common()->IfFalse();
Node* n31 = graph()->NewNode(op, nil);
USE(n31);
op = js()->Add(LanguageMode::SLOPPY);
Node* n19 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n19);
op = js()->Multiply(LanguageMode::SLOPPY);
Node* n21 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n21);
op = common()->IfSuccess();
Node* n22 = graph()->NewNode(op, nil);
USE(n22);
op = common()->Parameter(2);
Node* n3 = graph()->NewNode(op, nil);
USE(n3);
op = js()->StackCheck();
Node* n9 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n9);
op = common()->IfSuccess();
Node* n10 = graph()->NewNode(op, nil);
USE(n10);
op = common()->Branch();
Node* n17 = graph()->NewNode(op, nil, nil);
USE(n17);
op = common()->IfTrue();
Node* n18 = graph()->NewNode(op, nil);
USE(n18);
op = common()->IfSuccess();
Node* n20 = graph()->NewNode(op, nil);
USE(n20);
op = common()->IfSuccess();
Node* n16 = graph()->NewNode(op, nil);
USE(n16);
n39->ReplaceInput(0, n37);
n37->ReplaceInput(0, n29);
n37->ReplaceInput(1, n36);
n29->ReplaceInput(0, n27);
n29->ReplaceInput(1, n27);
n29->ReplaceInput(2, n28);
n36->ReplaceInput(0, n34);
n36->ReplaceInput(1, n34);
n36->ReplaceInput(2, n35);
n27->ReplaceInput(0, n25);
n27->ReplaceInput(1, n5);
n27->ReplaceInput(2, n7);
n27->ReplaceInput(3, n13);
n27->ReplaceInput(4, n13);
n27->ReplaceInput(5, n25);
n27->ReplaceInput(6, n26);
n28->ReplaceInput(0, n27);
n34->ReplaceInput(0, n32);
n34->ReplaceInput(1, n2);
n34->ReplaceInput(2, n7);
n34->ReplaceInput(3, n13);
n34->ReplaceInput(4, n13);
n34->ReplaceInput(5, n32);
n34->ReplaceInput(6, n33);
n35->ReplaceInput(0, n34);
n25->ReplaceInput(0, n23);
n25->ReplaceInput(1, n2);
n25->ReplaceInput(2, n7);
n25->ReplaceInput(3, n13);
n25->ReplaceInput(4, n13);
n25->ReplaceInput(5, n23);
n25->ReplaceInput(6, n24);
n5->ReplaceInput(0, n0);
n7->ReplaceInput(0, n0);
n13->ReplaceInput(0, n11);
n13->ReplaceInput(1, n11);
n13->ReplaceInput(2, n11);
n13->ReplaceInput(3, n12);
n13->ReplaceInput(4, n6);
n26->ReplaceInput(0, n25);
n32->ReplaceInput(0, n4);
n32->ReplaceInput(1, n4);
n32->ReplaceInput(2, n7);
n32->ReplaceInput(3, n13);
n32->ReplaceInput(4, n13);
n32->ReplaceInput(5, n15);
n32->ReplaceInput(6, n31);
n2->ReplaceInput(0, n0);
n33->ReplaceInput(0, n32);
n23->ReplaceInput(0, n19);
n23->ReplaceInput(1, n21);
n23->ReplaceInput(2, n7);
n23->ReplaceInput(3, n13);
n23->ReplaceInput(4, n13);
n23->ReplaceInput(5, n21);
n23->ReplaceInput(6, n22);
n24->ReplaceInput(0, n23);
n4->ReplaceInput(0, n0);
n15->ReplaceInput(0, n2);
n15->ReplaceInput(1, n3);
n15->ReplaceInput(2, n7);
n15->ReplaceInput(3, n13);
n15->ReplaceInput(4, n9);
n15->ReplaceInput(5, n10);
n31->ReplaceInput(0, n17);
n19->ReplaceInput(0, n2);
n19->ReplaceInput(1, n3);
n19->ReplaceInput(2, n7);
n19->ReplaceInput(3, n13);
n19->ReplaceInput(4, n13);
n19->ReplaceInput(5, n15);
n19->ReplaceInput(6, n18);
n21->ReplaceInput(0, n4);
n21->ReplaceInput(1, n4);
n21->ReplaceInput(2, n7);
n21->ReplaceInput(3, n13);
n21->ReplaceInput(4, n13);
n21->ReplaceInput(5, n19);
n21->ReplaceInput(6, n20);
n22->ReplaceInput(0, n21);
n3->ReplaceInput(0, n0);
n9->ReplaceInput(0, n7);
n9->ReplaceInput(1, n13);
n9->ReplaceInput(2, n0);
n9->ReplaceInput(3, n0);
n10->ReplaceInput(0, n9);
n17->ReplaceInput(0, n15);
n17->ReplaceInput(1, n16);
n18->ReplaceInput(0, n17);
n20->ReplaceInput(0, n19);
n16->ReplaceInput(0, n15);
graph()->SetStart(n0);
graph()->SetEnd(n39);
ComputeAndVerifySchedule(34);
}
TEST_F(SchedulerTest, BuildScheduleSimpleLoop) {
const Operator* op;
Unique<HeapObject> unique_constant =
Unique<HeapObject>::CreateImmovable(factory()->undefined_value());
// Manually transcripted code for:
// function turbo_fan_test(a, b) {
// while (a < b) {
// a++;
// }
// return a;
// }
Node* nil = graph()->NewNode(common()->Dead());
op = common()->End();
Node* n34 = graph()->NewNode(op, nil);
USE(n34);
op = common()->Return();
Node* n32 = graph()->NewNode(op, nil, nil, nil);
USE(n32);
op = common()->Phi(kMachAnyTagged, 2);
Node* n13 = graph()->NewNode(op, nil, nil, nil);
USE(n13);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n16 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n16);
op = common()->IfFalse();
Node* n22 = graph()->NewNode(op, nil);
USE(n22);
op = common()->Parameter(1);
Node* n2 = graph()->NewNode(op, nil);
USE(n2);
op = js()->Add(LanguageMode::SLOPPY);
Node* n29 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n29);
op = common()->Loop(2);
Node* n12 = graph()->NewNode(op, nil, nil);
USE(n12);
op = common()->Parameter(2);
Node* n3 = graph()->NewNode(op, nil);
USE(n3);
op = common()->Parameter(3);
Node* n5 = graph()->NewNode(op, nil);
USE(n5);
op = common()->FrameState(JS_FRAME, BailoutId(-1),
OutputFrameStateCombine::Ignore());
Node* n11 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n11);
op = common()->EffectPhi(2);
Node* n14 = graph()->NewNode(op, nil, nil, nil);
USE(n14);
op = common()->Branch();
Node* n19 = graph()->NewNode(op, nil, nil);
USE(n19);
op = common()->Start(2);
Node* n0 = graph()->NewNode(op);
USE(n0);
op = js()->ToNumber();
Node* n26 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n26);
op = common()->NumberConstant(1);
Node* n28 = graph()->NewNode(op);
USE(n28);
op = common()->IfSuccess();
Node* n27 = graph()->NewNode(op, nil);
USE(n27);
op = common()->IfSuccess();
Node* n8 = graph()->NewNode(op, nil);
USE(n8);
op = common()->IfSuccess();
Node* n30 = graph()->NewNode(op, nil);
USE(n30);
op = common()->StateValues(0);
Node* n9 = graph()->NewNode(op);
USE(n9);
op = common()->NumberConstant(0);
Node* n10 = graph()->NewNode(op);
USE(n10);
op = common()->HeapConstant(unique_constant);
Node* n4 = graph()->NewNode(op);
USE(n4);
op = js()->StackCheck();
Node* n7 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n7);
op = js()->ToBoolean();
Node* n18 = graph()->NewNode(op, nil, nil);
USE(n18);
op = common()->IfSuccess();
Node* n17 = graph()->NewNode(op, nil);
USE(n17);
op = js()->StackCheck();
Node* n24 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n24);
op = common()->IfSuccess();
Node* n25 = graph()->NewNode(op, nil);
USE(n25);
op = common()->IfTrue();
Node* n20 = graph()->NewNode(op, nil);
USE(n20);
n34->ReplaceInput(0, n32);
n32->ReplaceInput(0, n13);
n32->ReplaceInput(1, n16);
n32->ReplaceInput(2, n22);
n13->ReplaceInput(0, n2);
n13->ReplaceInput(1, n29);
n13->ReplaceInput(2, n12);
n16->ReplaceInput(0, n13);
n16->ReplaceInput(1, n3);
n16->ReplaceInput(2, n5);
n16->ReplaceInput(3, n11);
n16->ReplaceInput(4, n14);
n16->ReplaceInput(5, n12);
n22->ReplaceInput(0, n19);
n2->ReplaceInput(0, n0);
n29->ReplaceInput(0, n26);
n29->ReplaceInput(1, n28);
n29->ReplaceInput(2, n5);
n29->ReplaceInput(3, n11);
n29->ReplaceInput(4, n11);
n29->ReplaceInput(5, n26);
n29->ReplaceInput(6, n27);
n12->ReplaceInput(0, n8);
n12->ReplaceInput(1, n30);
n3->ReplaceInput(0, n0);
n5->ReplaceInput(0, n0);
n11->ReplaceInput(0, n9);
n11->ReplaceInput(1, n9);
n11->ReplaceInput(2, n9);
n11->ReplaceInput(3, n10);
n11->ReplaceInput(4, n4);
n14->ReplaceInput(0, n7);
n14->ReplaceInput(1, n29);
n14->ReplaceInput(2, n12);
n19->ReplaceInput(0, n18);
n19->ReplaceInput(1, n17);
n26->ReplaceInput(0, n13);
n26->ReplaceInput(1, n5);
n26->ReplaceInput(2, n11);
n26->ReplaceInput(3, n24);
n26->ReplaceInput(4, n25);
n27->ReplaceInput(0, n26);
n8->ReplaceInput(0, n7);
n30->ReplaceInput(0, n29);
n7->ReplaceInput(0, n5);
n7->ReplaceInput(1, n11);
n7->ReplaceInput(2, n0);
n7->ReplaceInput(3, n0);
n18->ReplaceInput(0, n16);
n18->ReplaceInput(1, n5);
n17->ReplaceInput(0, n16);
n24->ReplaceInput(0, n5);
n24->ReplaceInput(1, n11);
n24->ReplaceInput(2, n16);
n24->ReplaceInput(3, n20);
n25->ReplaceInput(0, n24);
n20->ReplaceInput(0, n19);
graph()->SetStart(n0);
graph()->SetEnd(n34);
ComputeAndVerifySchedule(30);
}
TEST_F(SchedulerTest, BuildScheduleComplexLoops) {
const Operator* op;
Unique<HeapObject> unique_constant =
Unique<HeapObject>::CreateImmovable(factory()->undefined_value());
// Manually transcripted code for:
// function turbo_fan_test(a, b, c) {
// while (a < b) {
// a++;
// while (c < b) {
// c++;
// }
// }
// while (a < b) {
// a += 2;
// }
// return a;
// }
Node* nil = graph()->NewNode(common()->Dead());
op = common()->End();
Node* n71 = graph()->NewNode(op, nil);
USE(n71);
op = common()->Return();
Node* n69 = graph()->NewNode(op, nil, nil, nil);
USE(n69);
op = common()->Phi(kMachAnyTagged, 2);
Node* n53 = graph()->NewNode(op, nil, nil, nil);
USE(n53);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n55 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n55);
op = common()->IfFalse();
Node* n61 = graph()->NewNode(op, nil);
USE(n61);
op = common()->Phi(kMachAnyTagged, 2);
Node* n14 = graph()->NewNode(op, nil, nil, nil);
USE(n14);
op = js()->Add(LanguageMode::SLOPPY);
Node* n66 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n66);
op = common()->Loop(2);
Node* n52 = graph()->NewNode(op, nil, nil);
USE(n52);
op = common()->Parameter(2);
Node* n3 = graph()->NewNode(op, nil);
USE(n3);
op = common()->Parameter(4);
Node* n6 = graph()->NewNode(op, nil);
USE(n6);
op = common()->FrameState(JS_FRAME, BailoutId(-1),
OutputFrameStateCombine::Ignore());
Node* n12 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n12);
op = common()->EffectPhi(2);
Node* n54 = graph()->NewNode(op, nil, nil, nil);
USE(n54);
op = common()->Branch();
Node* n58 = graph()->NewNode(op, nil, nil);
USE(n58);
op = common()->Parameter(1);
Node* n2 = graph()->NewNode(op, nil);
USE(n2);
op = js()->Add(LanguageMode::SLOPPY);
Node* n31 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n31);
op = common()->Loop(2);
Node* n13 = graph()->NewNode(op, nil, nil);
USE(n13);
op = common()->NumberConstant(2);
Node* n65 = graph()->NewNode(op);
USE(n65);
op = js()->StackCheck();
Node* n63 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n63);
op = common()->IfSuccess();
Node* n64 = graph()->NewNode(op, nil);
USE(n64);
op = common()->IfFalse();
Node* n24 = graph()->NewNode(op, nil);
USE(n24);
op = common()->IfSuccess();
Node* n67 = graph()->NewNode(op, nil);
USE(n67);
op = common()->Start(3);
Node* n0 = graph()->NewNode(op);
USE(n0);
op = common()->StateValues(0);
Node* n10 = graph()->NewNode(op);
USE(n10);
op = common()->NumberConstant(0);
Node* n11 = graph()->NewNode(op);
USE(n11);
op = common()->HeapConstant(unique_constant);
Node* n5 = graph()->NewNode(op);
USE(n5);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n18 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n18);
op = js()->ToBoolean();
Node* n57 = graph()->NewNode(op, nil, nil);
USE(n57);
op = common()->IfSuccess();
Node* n56 = graph()->NewNode(op, nil);
USE(n56);
op = js()->ToNumber();
Node* n28 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n28);
op = common()->NumberConstant(1);
Node* n30 = graph()->NewNode(op);
USE(n30);
op = common()->IfSuccess();
Node* n29 = graph()->NewNode(op, nil);
USE(n29);
op = common()->IfSuccess();
Node* n9 = graph()->NewNode(op, nil);
USE(n9);
op = common()->IfFalse();
Node* n42 = graph()->NewNode(op, nil);
USE(n42);
op = common()->IfTrue();
Node* n59 = graph()->NewNode(op, nil);
USE(n59);
op = common()->Branch();
Node* n21 = graph()->NewNode(op, nil, nil);
USE(n21);
op = common()->EffectPhi(2);
Node* n16 = graph()->NewNode(op, nil, nil, nil);
USE(n16);
op = js()->StackCheck();
Node* n26 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n26);
op = common()->IfSuccess();
Node* n27 = graph()->NewNode(op, nil);
USE(n27);
op = js()->StackCheck();
Node* n8 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n8);
op = common()->Branch();
Node* n39 = graph()->NewNode(op, nil, nil);
USE(n39);
op = js()->ToBoolean();
Node* n20 = graph()->NewNode(op, nil, nil);
USE(n20);
op = common()->IfSuccess();
Node* n19 = graph()->NewNode(op, nil);
USE(n19);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n36 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n36);
op = common()->IfTrue();
Node* n22 = graph()->NewNode(op, nil);
USE(n22);
op = js()->ToBoolean();
Node* n38 = graph()->NewNode(op, nil, nil);
USE(n38);
op = common()->IfSuccess();
Node* n37 = graph()->NewNode(op, nil);
USE(n37);
op = common()->Phi(kMachAnyTagged, 2);
Node* n34 = graph()->NewNode(op, nil, nil, nil);
USE(n34);
op = common()->EffectPhi(2);
Node* n35 = graph()->NewNode(op, nil, nil, nil);
USE(n35);
op = common()->Loop(2);
Node* n33 = graph()->NewNode(op, nil, nil);
USE(n33);
op = common()->Phi(kMachAnyTagged, 2);
Node* n15 = graph()->NewNode(op, nil, nil, nil);
USE(n15);
op = js()->Add(LanguageMode::SLOPPY);
Node* n48 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n48);
op = common()->IfSuccess();
Node* n32 = graph()->NewNode(op, nil);
USE(n32);
op = common()->IfSuccess();
Node* n49 = graph()->NewNode(op, nil);
USE(n49);
op = common()->Parameter(3);
Node* n4 = graph()->NewNode(op, nil);
USE(n4);
op = js()->ToNumber();
Node* n46 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n46);
op = common()->IfSuccess();
Node* n47 = graph()->NewNode(op, nil);
USE(n47);
op = js()->StackCheck();
Node* n44 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n44);
op = common()->IfSuccess();
Node* n45 = graph()->NewNode(op, nil);
USE(n45);
op = common()->IfTrue();
Node* n40 = graph()->NewNode(op, nil);
USE(n40);
n71->ReplaceInput(0, n69);
n69->ReplaceInput(0, n53);
n69->ReplaceInput(1, n55);
n69->ReplaceInput(2, n61);
n53->ReplaceInput(0, n14);
n53->ReplaceInput(1, n66);
n53->ReplaceInput(2, n52);
n55->ReplaceInput(0, n53);
n55->ReplaceInput(1, n3);
n55->ReplaceInput(2, n6);
n55->ReplaceInput(3, n12);
n55->ReplaceInput(4, n54);
n55->ReplaceInput(5, n52);
n61->ReplaceInput(0, n58);
n14->ReplaceInput(0, n2);
n14->ReplaceInput(1, n31);
n14->ReplaceInput(2, n13);
n66->ReplaceInput(0, n53);
n66->ReplaceInput(1, n65);
n66->ReplaceInput(2, n6);
n66->ReplaceInput(3, n12);
n66->ReplaceInput(4, n12);
n66->ReplaceInput(5, n63);
n66->ReplaceInput(6, n64);
n52->ReplaceInput(0, n24);
n52->ReplaceInput(1, n67);
n3->ReplaceInput(0, n0);
n6->ReplaceInput(0, n0);
n12->ReplaceInput(0, n10);
n12->ReplaceInput(1, n10);
n12->ReplaceInput(2, n10);
n12->ReplaceInput(3, n11);
n12->ReplaceInput(4, n5);
n54->ReplaceInput(0, n18);
n54->ReplaceInput(1, n66);
n54->ReplaceInput(2, n52);
n58->ReplaceInput(0, n57);
n58->ReplaceInput(1, n56);
n2->ReplaceInput(0, n0);
n31->ReplaceInput(0, n28);
n31->ReplaceInput(1, n30);
n31->ReplaceInput(2, n6);
n31->ReplaceInput(3, n12);
n31->ReplaceInput(4, n12);
n31->ReplaceInput(5, n28);
n31->ReplaceInput(6, n29);
n13->ReplaceInput(0, n9);
n13->ReplaceInput(1, n42);
n63->ReplaceInput(0, n6);
n63->ReplaceInput(1, n12);
n63->ReplaceInput(2, n55);
n63->ReplaceInput(3, n59);
n64->ReplaceInput(0, n63);
n24->ReplaceInput(0, n21);
n67->ReplaceInput(0, n66);
n18->ReplaceInput(0, n14);
n18->ReplaceInput(1, n3);
n18->ReplaceInput(2, n6);
n18->ReplaceInput(3, n12);
n18->ReplaceInput(4, n16);
n18->ReplaceInput(5, n13);
n57->ReplaceInput(0, n55);
n57->ReplaceInput(1, n6);
n56->ReplaceInput(0, n55);
n28->ReplaceInput(0, n14);
n28->ReplaceInput(1, n6);
n28->ReplaceInput(2, n12);
n28->ReplaceInput(3, n26);
n28->ReplaceInput(4, n27);
n29->ReplaceInput(0, n28);
n9->ReplaceInput(0, n8);
n42->ReplaceInput(0, n39);
n59->ReplaceInput(0, n58);
n21->ReplaceInput(0, n20);
n21->ReplaceInput(1, n19);
n16->ReplaceInput(0, n8);
n16->ReplaceInput(1, n36);
n16->ReplaceInput(2, n13);
n26->ReplaceInput(0, n6);
n26->ReplaceInput(1, n12);
n26->ReplaceInput(2, n18);
n26->ReplaceInput(3, n22);
n27->ReplaceInput(0, n26);
n8->ReplaceInput(0, n6);
n8->ReplaceInput(1, n12);
n8->ReplaceInput(2, n0);
n8->ReplaceInput(3, n0);
n39->ReplaceInput(0, n38);
n39->ReplaceInput(1, n37);
n20->ReplaceInput(0, n18);
n20->ReplaceInput(1, n6);
n19->ReplaceInput(0, n18);
n36->ReplaceInput(0, n34);
n36->ReplaceInput(1, n3);
n36->ReplaceInput(2, n6);
n36->ReplaceInput(3, n12);
n36->ReplaceInput(4, n35);
n36->ReplaceInput(5, n33);
n22->ReplaceInput(0, n21);
n38->ReplaceInput(0, n36);
n38->ReplaceInput(1, n6);
n37->ReplaceInput(0, n36);
n34->ReplaceInput(0, n15);
n34->ReplaceInput(1, n48);
n34->ReplaceInput(2, n33);
n35->ReplaceInput(0, n31);
n35->ReplaceInput(1, n48);
n35->ReplaceInput(2, n33);
n33->ReplaceInput(0, n32);
n33->ReplaceInput(1, n49);
n15->ReplaceInput(0, n4);
n15->ReplaceInput(1, n34);
n15->ReplaceInput(2, n13);
n48->ReplaceInput(0, n46);
n48->ReplaceInput(1, n30);
n48->ReplaceInput(2, n6);
n48->ReplaceInput(3, n12);
n48->ReplaceInput(4, n12);
n48->ReplaceInput(5, n46);
n48->ReplaceInput(6, n47);
n32->ReplaceInput(0, n31);
n49->ReplaceInput(0, n48);
n4->ReplaceInput(0, n0);
n46->ReplaceInput(0, n34);
n46->ReplaceInput(1, n6);
n46->ReplaceInput(2, n12);
n46->ReplaceInput(3, n44);
n46->ReplaceInput(4, n45);
n47->ReplaceInput(0, n46);
n44->ReplaceInput(0, n6);
n44->ReplaceInput(1, n12);
n44->ReplaceInput(2, n36);
n44->ReplaceInput(3, n40);
n45->ReplaceInput(0, n44);
n40->ReplaceInput(0, n39);
graph()->SetStart(n0);
graph()->SetEnd(n71);
ComputeAndVerifySchedule(65);
}
TEST_F(SchedulerTest, BuildScheduleBreakAndContinue) {
const Operator* op;
Unique<HeapObject> unique_constant =
Unique<HeapObject>::CreateImmovable(factory()->undefined_value());
// Manually transcripted code for:
// function turbo_fan_test(a, b, c) {
// var d = 0;
// while (a < b) {
// a++;
// while (c < b) {
// c++;
// if (d == 0) break;
// a++;
// }
// if (a == 1) continue;
// d++;
// }
// return a + d;
// }
Node* nil = graph()->NewNode(common()->Dead());
op = common()->End();
Node* n86 = graph()->NewNode(op, nil);
USE(n86);
op = common()->Return();
Node* n84 = graph()->NewNode(op, nil, nil, nil);
USE(n84);
op = js()->Add(LanguageMode::SLOPPY);
Node* n82 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n82);
op = common()->IfSuccess();
Node* n83 = graph()->NewNode(op, nil);
USE(n83);
op = common()->Phi(kMachAnyTagged, 2);
Node* n15 = graph()->NewNode(op, nil, nil, nil);
USE(n15);
op = common()->Phi(kMachAnyTagged, 2);
Node* n17 = graph()->NewNode(op, nil, nil, nil);
USE(n17);
op = common()->Parameter(4);
Node* n6 = graph()->NewNode(op, nil);
USE(n6);
op = common()->FrameState(JS_FRAME, BailoutId(-1),
OutputFrameStateCombine::Ignore());
Node* n12 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n12);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n19 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n19);
op = common()->IfFalse();
Node* n25 = graph()->NewNode(op, nil);
USE(n25);
op = common()->Parameter(1);
Node* n2 = graph()->NewNode(op, nil);
USE(n2);
op = common()->Phi(kMachAnyTagged, 2);
Node* n35 = graph()->NewNode(op, nil, nil, nil);
USE(n35);
op = common()->Loop(2);
Node* n14 = graph()->NewNode(op, nil, nil);
USE(n14);
op = common()->NumberConstant(0);
Node* n11 = graph()->NewNode(op);
USE(n11);
op = common()->Phi(kMachAnyTagged, 2);
Node* n81 = graph()->NewNode(op, nil, nil, nil);
USE(n81);
op = common()->Start(3);
Node* n0 = graph()->NewNode(op);
USE(n0);
op = common()->StateValues(0);
Node* n10 = graph()->NewNode(op);
USE(n10);
op = common()->HeapConstant(unique_constant);
Node* n5 = graph()->NewNode(op);
USE(n5);
op = common()->Parameter(2);
Node* n3 = graph()->NewNode(op, nil);
USE(n3);
op = common()->EffectPhi(2);
Node* n18 = graph()->NewNode(op, nil, nil, nil);
USE(n18);
op = common()->Branch();
Node* n22 = graph()->NewNode(op, nil, nil);
USE(n22);
op = js()->Add(LanguageMode::SLOPPY);
Node* n32 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n32);
op = js()->Add(LanguageMode::SLOPPY);
Node* n64 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n64);
op = common()->Loop(2);
Node* n34 = graph()->NewNode(op, nil, nil);
USE(n34);
op = common()->IfSuccess();
Node* n9 = graph()->NewNode(op, nil);
USE(n9);
op = common()->Merge(2);
Node* n72 = graph()->NewNode(op, nil, nil);
USE(n72);
op = js()->Add(LanguageMode::SLOPPY);
Node* n78 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n78);
op = js()->StackCheck();
Node* n8 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n8);
op = common()->EffectPhi(2);
Node* n80 = graph()->NewNode(op, nil, nil, nil);
USE(n80);
op = js()->ToBoolean();
Node* n21 = graph()->NewNode(op, nil, nil);
USE(n21);
op = common()->IfSuccess();
Node* n20 = graph()->NewNode(op, nil);
USE(n20);
op = js()->ToNumber();
Node* n29 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n29);
op = common()->NumberConstant(1);
Node* n31 = graph()->NewNode(op);
USE(n31);
op = common()->IfSuccess();
Node* n30 = graph()->NewNode(op, nil);
USE(n30);
op = js()->ToNumber();
Node* n62 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n62);
op = common()->IfSuccess();
Node* n63 = graph()->NewNode(op, nil);
USE(n63);
op = common()->IfSuccess();
Node* n33 = graph()->NewNode(op, nil);
USE(n33);
op = common()->IfSuccess();
Node* n65 = graph()->NewNode(op, nil);
USE(n65);
op = common()->IfTrue();
Node* n71 = graph()->NewNode(op, nil);
USE(n71);
op = common()->IfSuccess();
Node* n79 = graph()->NewNode(op, nil);
USE(n79);
op = js()->ToNumber();
Node* n76 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n76);
op = common()->IfSuccess();
Node* n77 = graph()->NewNode(op, nil);
USE(n77);
op = js()->Equal();
Node* n67 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n67);
op = js()->StackCheck();
Node* n27 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n27);
op = common()->IfSuccess();
Node* n28 = graph()->NewNode(op, nil);
USE(n28);
op = js()->Equal();
Node* n52 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n52);
op = common()->IfFalse();
Node* n60 = graph()->NewNode(op, nil);
USE(n60);
op = common()->Branch();
Node* n70 = graph()->NewNode(op, nil, nil);
USE(n70);
op = common()->IfFalse();
Node* n74 = graph()->NewNode(op, nil);
USE(n74);
op = common()->EffectPhi(2);
Node* n57 = graph()->NewNode(op, nil, nil, nil);
USE(n57);
op = common()->Merge(2);
Node* n45 = graph()->NewNode(op, nil, nil);
USE(n45);
op = common()->IfTrue();
Node* n23 = graph()->NewNode(op, nil);
USE(n23);
op = js()->Add(LanguageMode::SLOPPY);
Node* n50 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n50);
op = common()->IfSuccess();
Node* n51 = graph()->NewNode(op, nil);
USE(n51);
op = common()->Branch();
Node* n55 = graph()->NewNode(op, nil, nil);
USE(n55);
op = js()->ToBoolean();
Node* n69 = graph()->NewNode(op, nil, nil);
USE(n69);
op = common()->IfSuccess();
Node* n68 = graph()->NewNode(op, nil);
USE(n68);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n38 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n38);
op = common()->IfFalse();
Node* n44 = graph()->NewNode(op, nil);
USE(n44);
op = common()->IfTrue();
Node* n56 = graph()->NewNode(op, nil);
USE(n56);
op = js()->ToNumber();
Node* n48 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n48);
op = common()->IfSuccess();
Node* n49 = graph()->NewNode(op, nil);
USE(n49);
op = js()->ToBoolean();
Node* n54 = graph()->NewNode(op, nil, nil);
USE(n54);
op = common()->IfSuccess();
Node* n53 = graph()->NewNode(op, nil);
USE(n53);
op = common()->Phi(kMachAnyTagged, 2);
Node* n36 = graph()->NewNode(op, nil, nil, nil);
USE(n36);
op = common()->EffectPhi(2);
Node* n37 = graph()->NewNode(op, nil, nil, nil);
USE(n37);
op = common()->Branch();
Node* n41 = graph()->NewNode(op, nil, nil);
USE(n41);
op = js()->StackCheck();
Node* n46 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n46);
op = common()->IfSuccess();
Node* n47 = graph()->NewNode(op, nil);
USE(n47);
op = common()->Phi(kMachAnyTagged, 2);
Node* n16 = graph()->NewNode(op, nil, nil, nil);
USE(n16);
op = js()->ToBoolean();
Node* n40 = graph()->NewNode(op, nil, nil);
USE(n40);
op = common()->IfSuccess();
Node* n39 = graph()->NewNode(op, nil);
USE(n39);
op = common()->IfTrue();
Node* n42 = graph()->NewNode(op, nil);
USE(n42);
op = common()->Parameter(3);
Node* n4 = graph()->NewNode(op, nil);
USE(n4);
op = common()->Phi(kMachAnyTagged, 2);
Node* n58 = graph()->NewNode(op, nil, nil, nil);
USE(n58);
n86->ReplaceInput(0, n84);
n84->ReplaceInput(0, n82);
n84->ReplaceInput(1, n82);
n84->ReplaceInput(2, n83);
n82->ReplaceInput(0, n15);
n82->ReplaceInput(1, n17);
n82->ReplaceInput(2, n6);
n82->ReplaceInput(3, n12);
n82->ReplaceInput(4, n12);
n82->ReplaceInput(5, n19);
n82->ReplaceInput(6, n25);
n83->ReplaceInput(0, n82);
n15->ReplaceInput(0, n2);
n15->ReplaceInput(1, n35);
n15->ReplaceInput(2, n14);
n17->ReplaceInput(0, n11);
n17->ReplaceInput(1, n81);
n17->ReplaceInput(2, n14);
n6->ReplaceInput(0, n0);
n12->ReplaceInput(0, n10);
n12->ReplaceInput(1, n10);
n12->ReplaceInput(2, n10);
n12->ReplaceInput(3, n11);
n12->ReplaceInput(4, n5);
n19->ReplaceInput(0, n15);
n19->ReplaceInput(1, n3);
n19->ReplaceInput(2, n6);
n19->ReplaceInput(3, n12);
n19->ReplaceInput(4, n18);
n19->ReplaceInput(5, n14);
n25->ReplaceInput(0, n22);
n2->ReplaceInput(0, n0);
n35->ReplaceInput(0, n32);
n35->ReplaceInput(1, n64);
n35->ReplaceInput(2, n34);
n14->ReplaceInput(0, n9);
n14->ReplaceInput(1, n72);
n81->ReplaceInput(0, n17);
n81->ReplaceInput(1, n78);
n81->ReplaceInput(2, n72);
n3->ReplaceInput(0, n0);
n18->ReplaceInput(0, n8);
n18->ReplaceInput(1, n80);
n18->ReplaceInput(2, n14);
n22->ReplaceInput(0, n21);
n22->ReplaceInput(1, n20);
n32->ReplaceInput(0, n29);
n32->ReplaceInput(1, n31);
n32->ReplaceInput(2, n6);
n32->ReplaceInput(3, n12);
n32->ReplaceInput(4, n12);
n32->ReplaceInput(5, n29);
n32->ReplaceInput(6, n30);
n64->ReplaceInput(0, n62);
n64->ReplaceInput(1, n31);
n64->ReplaceInput(2, n6);
n64->ReplaceInput(3, n12);
n64->ReplaceInput(4, n12);
n64->ReplaceInput(5, n62);
n64->ReplaceInput(6, n63);
n34->ReplaceInput(0, n33);
n34->ReplaceInput(1, n65);
n9->ReplaceInput(0, n8);
n72->ReplaceInput(0, n71);
n72->ReplaceInput(1, n79);
n78->ReplaceInput(0, n76);
n78->ReplaceInput(1, n31);
n78->ReplaceInput(2, n6);
n78->ReplaceInput(3, n12);
n78->ReplaceInput(4, n12);
n78->ReplaceInput(5, n76);
n78->ReplaceInput(6, n77);
n8->ReplaceInput(0, n6);
n8->ReplaceInput(1, n12);
n8->ReplaceInput(2, n0);
n8->ReplaceInput(3, n0);
n80->ReplaceInput(0, n67);
n80->ReplaceInput(1, n78);
n80->ReplaceInput(2, n72);
n21->ReplaceInput(0, n19);
n21->ReplaceInput(1, n6);
n20->ReplaceInput(0, n19);
n29->ReplaceInput(0, n15);
n29->ReplaceInput(1, n6);
n29->ReplaceInput(2, n12);
n29->ReplaceInput(3, n27);
n29->ReplaceInput(4, n28);
n30->ReplaceInput(0, n29);
n62->ReplaceInput(0, n35);
n62->ReplaceInput(1, n6);
n62->ReplaceInput(2, n12);
n62->ReplaceInput(3, n52);
n62->ReplaceInput(4, n60);
n63->ReplaceInput(0, n62);
n33->ReplaceInput(0, n32);
n65->ReplaceInput(0, n64);
n71->ReplaceInput(0, n70);
n79->ReplaceInput(0, n78);
n76->ReplaceInput(0, n17);
n76->ReplaceInput(1, n6);
n76->ReplaceInput(2, n12);
n76->ReplaceInput(3, n67);
n76->ReplaceInput(4, n74);
n77->ReplaceInput(0, n76);
n67->ReplaceInput(0, n35);
n67->ReplaceInput(1, n31);
n67->ReplaceInput(2, n6);
n67->ReplaceInput(3, n12);
n67->ReplaceInput(4, n57);
n67->ReplaceInput(5, n45);
n27->ReplaceInput(0, n6);
n27->ReplaceInput(1, n12);
n27->ReplaceInput(2, n19);
n27->ReplaceInput(3, n23);
n28->ReplaceInput(0, n27);
n52->ReplaceInput(0, n17);
n52->ReplaceInput(1, n11);
n52->ReplaceInput(2, n6);
n52->ReplaceInput(3, n12);
n52->ReplaceInput(4, n50);
n52->ReplaceInput(5, n51);
n60->ReplaceInput(0, n55);
n70->ReplaceInput(0, n69);
n70->ReplaceInput(1, n68);
n74->ReplaceInput(0, n70);
n57->ReplaceInput(0, n38);
n57->ReplaceInput(1, n52);
n57->ReplaceInput(2, n45);
n45->ReplaceInput(0, n44);
n45->ReplaceInput(1, n56);
n23->ReplaceInput(0, n22);
n50->ReplaceInput(0, n48);
n50->ReplaceInput(1, n31);
n50->ReplaceInput(2, n6);
n50->ReplaceInput(3, n12);
n50->ReplaceInput(4, n12);
n50->ReplaceInput(5, n48);
n50->ReplaceInput(6, n49);
n51->ReplaceInput(0, n50);
n55->ReplaceInput(0, n54);
n55->ReplaceInput(1, n53);
n69->ReplaceInput(0, n67);
n69->ReplaceInput(1, n6);
n68->ReplaceInput(0, n67);
n38->ReplaceInput(0, n36);
n38->ReplaceInput(1, n3);
n38->ReplaceInput(2, n6);
n38->ReplaceInput(3, n12);
n38->ReplaceInput(4, n37);
n38->ReplaceInput(5, n34);
n44->ReplaceInput(0, n41);
n56->ReplaceInput(0, n55);
n48->ReplaceInput(0, n36);
n48->ReplaceInput(1, n6);
n48->ReplaceInput(2, n12);
n48->ReplaceInput(3, n46);
n48->ReplaceInput(4, n47);
n49->ReplaceInput(0, n48);
n54->ReplaceInput(0, n52);
n54->ReplaceInput(1, n6);
n53->ReplaceInput(0, n52);
n36->ReplaceInput(0, n16);
n36->ReplaceInput(1, n50);
n36->ReplaceInput(2, n34);
n37->ReplaceInput(0, n32);
n37->ReplaceInput(1, n64);
n37->ReplaceInput(2, n34);
n41->ReplaceInput(0, n40);
n41->ReplaceInput(1, n39);
n46->ReplaceInput(0, n6);
n46->ReplaceInput(1, n12);
n46->ReplaceInput(2, n38);
n46->ReplaceInput(3, n42);
n47->ReplaceInput(0, n46);
n16->ReplaceInput(0, n4);
n16->ReplaceInput(1, n58);
n16->ReplaceInput(2, n14);
n40->ReplaceInput(0, n38);
n40->ReplaceInput(1, n6);
n39->ReplaceInput(0, n38);
n42->ReplaceInput(0, n41);
n4->ReplaceInput(0, n0);
n58->ReplaceInput(0, n36);
n58->ReplaceInput(1, n50);
n58->ReplaceInput(2, n45);
graph()->SetStart(n0);
graph()->SetEnd(n86);
ComputeAndVerifySchedule(83);
}
TEST_F(SchedulerTest, BuildScheduleSimpleLoopWithCodeMotion) {
const Operator* op;
Unique<HeapObject> unique_constant =
Unique<HeapObject>::CreateImmovable(factory()->undefined_value());
// Manually transcripted code for:
// function turbo_fan_test(a, b, c) {
// while (a < b) {
// a += b + c;
// }
// return a;
// }
Node* nil = graph()->NewNode(common()->Dead());
op = common()->End();
Node* n34 = graph()->NewNode(op, nil);
USE(n34);
op = common()->Return();
Node* n32 = graph()->NewNode(op, nil, nil, nil);
USE(n32);
op = common()->Phi(kMachAnyTagged, 2);
Node* n14 = graph()->NewNode(op, nil, nil, nil);
USE(n14);
op = js()->LessThan(LanguageMode::SLOPPY);
Node* n17 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil);
USE(n17);
op = common()->IfFalse();
Node* n23 = graph()->NewNode(op, nil);
USE(n23);
op = common()->Parameter(1);
Node* n2 = graph()->NewNode(op, nil);
USE(n2);
op = js()->Add(LanguageMode::SLOPPY);
Node* n29 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n29);
op = common()->Loop(2);
Node* n13 = graph()->NewNode(op, nil, nil);
USE(n13);
op = common()->Parameter(2);
Node* n3 = graph()->NewNode(op, nil);
USE(n3);
op = common()->Parameter(4);
Node* n6 = graph()->NewNode(op, nil);
USE(n6);
op = common()->FrameState(JS_FRAME, BailoutId(-1),
OutputFrameStateCombine::Ignore());
Node* n12 = graph()->NewNode(op, nil, nil, nil, nil, nil);
USE(n12);
op = common()->EffectPhi(2);
Node* n15 = graph()->NewNode(op, nil, nil, nil);
USE(n15);
op = common()->Branch();
Node* n20 = graph()->NewNode(op, nil, nil);
USE(n20);
op = common()->Start(3);
Node* n0 = graph()->NewNode(op);
USE(n0);
op = js()->Add(LanguageMode::SLOPPY);
Node* n27 = graph()->NewNode(op, nil, nil, nil, nil, nil, nil, nil);
USE(n27);
op = common()->IfSuccess();
Node* n28 = graph()->NewNode(op, nil);
USE(n28);
op = common()->IfSuccess();
Node* n9 = graph()->NewNode(op, nil);
USE(n9);
op = common()->IfSuccess();
Node* n30 = graph()->NewNode(op, nil);
USE(n30);
op = common()->StateValues(0);
Node* n10 = graph()->NewNode(op);
USE(n10);
op = common()->NumberConstant(0);
Node* n11 = graph()->NewNode(op);
USE(n11);
op = common()->HeapConstant(unique_constant);
Node* n5 = graph()->NewNode(op);
USE(n5);
op = js()->StackCheck();
Node* n8 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n8);
op = js()->ToBoolean();
Node* n19 = graph()->NewNode(op, nil, nil);
USE(n19);
op = common()->IfSuccess();
Node* n18 = graph()->NewNode(op, nil);
USE(n18);
op = common()->Parameter(3);
Node* n4 = graph()->NewNode(op, nil);
USE(n4);
op = js()->StackCheck();
Node* n25 = graph()->NewNode(op, nil, nil, nil, nil);
USE(n25);
op = common()->IfSuccess();
Node* n26 = graph()->NewNode(op, nil);
USE(n26);
op = common()->IfTrue();
Node* n21 = graph()->NewNode(op, nil);
USE(n21);
n34->ReplaceInput(0, n32);
n32->ReplaceInput(0, n14);
n32->ReplaceInput(1, n17);
n32->ReplaceInput(2, n23);
n14->ReplaceInput(0, n2);
n14->ReplaceInput(1, n29);
n14->ReplaceInput(2, n13);
n17->ReplaceInput(0, n14);
n17->ReplaceInput(1, n3);
n17->ReplaceInput(2, n6);
n17->ReplaceInput(3, n12);
n17->ReplaceInput(4, n15);
n17->ReplaceInput(5, n13);
n23->ReplaceInput(0, n20);
n2->ReplaceInput(0, n0);
n29->ReplaceInput(0, n14);
n29->ReplaceInput(1, n27);
n29->ReplaceInput(2, n6);
n29->ReplaceInput(3, n12);
n29->ReplaceInput(4, n12);
n29->ReplaceInput(5, n27);
n29->ReplaceInput(6, n28);
n13->ReplaceInput(0, n9);
n13->ReplaceInput(1, n30);
n3->ReplaceInput(0, n0);
n6->ReplaceInput(0, n0);
n12->ReplaceInput(0, n10);
n12->ReplaceInput(1, n10);
n12->ReplaceInput(2, n10);
n12->ReplaceInput(3, n11);
n12->ReplaceInput(4, n5);
n15->ReplaceInput(0, n8);
n15->ReplaceInput(1, n29);
n15->ReplaceInput(2, n13);
n20->ReplaceInput(0, n19);
n20->ReplaceInput(1, n18);
n27->ReplaceInput(0, n3);
n27->ReplaceInput(1, n4);
n27->ReplaceInput(2, n6);
n27->ReplaceInput(3, n12);
n27->ReplaceInput(4, n12);
n27->ReplaceInput(5, n25);
n27->ReplaceInput(6, n26);
n28->ReplaceInput(0, n27);
n9->ReplaceInput(0, n8);
n30->ReplaceInput(0, n29);
n8->ReplaceInput(0, n6);
n8->ReplaceInput(1, n12);
n8->ReplaceInput(2, n0);
n8->ReplaceInput(3, n0);
n19->ReplaceInput(0, n17);
n19->ReplaceInput(1, n6);
n18->ReplaceInput(0, n17);
n4->ReplaceInput(0, n0);
n25->ReplaceInput(0, n6);
n25->ReplaceInput(1, n12);
n25->ReplaceInput(2, n17);
n25->ReplaceInput(3, n21);
n26->ReplaceInput(0, n25);
n21->ReplaceInput(0, n20);
graph()->SetStart(n0);
graph()->SetEnd(n34);
ComputeAndVerifySchedule(30);
}
namespace {
Node* CreateDiamond(Graph* graph, CommonOperatorBuilder* common, Node* cond) {
Node* tv = graph->NewNode(common->Int32Constant(6));
Node* fv = graph->NewNode(common->Int32Constant(7));
Node* br = graph->NewNode(common->Branch(), cond, graph->start());
Node* t = graph->NewNode(common->IfTrue(), br);
Node* f = graph->NewNode(common->IfFalse(), br);
Node* m = graph->NewNode(common->Merge(2), t, f);
Node* phi = graph->NewNode(common->Phi(kMachAnyTagged, 2), tv, fv, m);
return phi;
}
} // namespace
TARGET_TEST_F(SchedulerTest, FloatingDiamond1) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* d1 = CreateDiamond(graph(), common(), p0);
Node* ret = graph()->NewNode(common()->Return(), d1, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(13);
}
TARGET_TEST_F(SchedulerTest, FloatingDiamond2) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* p1 = graph()->NewNode(common()->Parameter(1), start);
Node* d1 = CreateDiamond(graph(), common(), p0);
Node* d2 = CreateDiamond(graph(), common(), p1);
Node* add = graph()->NewNode(&kIntAdd, d1, d2);
Node* ret = graph()->NewNode(common()->Return(), add, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(24);
}
TARGET_TEST_F(SchedulerTest, FloatingDiamond3) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* p1 = graph()->NewNode(common()->Parameter(1), start);
Node* d1 = CreateDiamond(graph(), common(), p0);
Node* d2 = CreateDiamond(graph(), common(), p1);
Node* add = graph()->NewNode(&kIntAdd, d1, d2);
Node* d3 = CreateDiamond(graph(), common(), add);
Node* ret = graph()->NewNode(common()->Return(), d3, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(33);
}
TARGET_TEST_F(SchedulerTest, NestedFloatingDiamonds) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* fv = graph()->NewNode(common()->Int32Constant(7));
Node* br = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* map = graph()->NewNode(
simplified()->LoadElement(AccessBuilder::ForFixedArrayElement()), p0, p0,
p0, start, f);
Node* br1 = graph()->NewNode(common()->Branch(), map, graph()->start());
Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1);
Node* ttrue = graph()->NewNode(common()->Int32Constant(1));
Node* ffalse = graph()->NewNode(common()->Int32Constant(0));
Node* phi1 =
graph()->NewNode(common()->Phi(kMachAnyTagged, 2), ttrue, ffalse, m1);
Node* m = graph()->NewNode(common()->Merge(2), t, f);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), fv, phi1, m);
Node* ephi1 = graph()->NewNode(common()->EffectPhi(2), start, map, m);
Node* ret = graph()->NewNode(common()->Return(), phi, ephi1, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(23);
}
TARGET_TEST_F(SchedulerTest, NestedFloatingDiamondWithChain) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* p1 = graph()->NewNode(common()->Parameter(1), start);
Node* c = graph()->NewNode(common()->Int32Constant(7));
Node* brA1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* tA1 = graph()->NewNode(common()->IfTrue(), brA1);
Node* fA1 = graph()->NewNode(common()->IfFalse(), brA1);
Node* mA1 = graph()->NewNode(common()->Merge(2), tA1, fA1);
Node* phiA1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p1, mA1);
Node* brB1 = graph()->NewNode(common()->Branch(), p1, graph()->start());
Node* tB1 = graph()->NewNode(common()->IfTrue(), brB1);
Node* fB1 = graph()->NewNode(common()->IfFalse(), brB1);
Node* mB1 = graph()->NewNode(common()->Merge(2), tB1, fB1);
Node* phiB1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p1, mB1);
Node* brA2 = graph()->NewNode(common()->Branch(), phiB1, mA1);
Node* tA2 = graph()->NewNode(common()->IfTrue(), brA2);
Node* fA2 = graph()->NewNode(common()->IfFalse(), brA2);
Node* mA2 = graph()->NewNode(common()->Merge(2), tA2, fA2);
Node* phiA2 =
graph()->NewNode(common()->Phi(kMachAnyTagged, 2), phiB1, c, mA2);
Node* brB2 = graph()->NewNode(common()->Branch(), phiA1, mB1);
Node* tB2 = graph()->NewNode(common()->IfTrue(), brB2);
Node* fB2 = graph()->NewNode(common()->IfFalse(), brB2);
Node* mB2 = graph()->NewNode(common()->Merge(2), tB2, fB2);
Node* phiB2 =
graph()->NewNode(common()->Phi(kMachAnyTagged, 2), phiA1, c, mB2);
Node* add = graph()->NewNode(&kIntAdd, phiA2, phiB2);
Node* ret = graph()->NewNode(common()->Return(), add, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(36);
}
TARGET_TEST_F(SchedulerTest, NestedFloatingDiamondWithLoop) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* fv = graph()->NewNode(common()->Int32Constant(7));
Node* br = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* loop = graph()->NewNode(common()->Loop(2), f, start);
Node* ind = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p0, loop);
Node* add = graph()->NewNode(&kIntAdd, ind, fv);
Node* br1 = graph()->NewNode(common()->Branch(), add, loop);
Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
loop->ReplaceInput(1, t1); // close loop.
ind->ReplaceInput(1, ind); // close induction variable.
Node* m = graph()->NewNode(common()->Merge(2), t, f1);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), fv, ind, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(20);
}
TARGET_TEST_F(SchedulerTest, LoopedFloatingDiamond1) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* c = graph()->NewNode(common()->Int32Constant(7));
Node* loop = graph()->NewNode(common()->Loop(2), start, start);
Node* ind = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p0, loop);
Node* add = graph()->NewNode(&kIntAdd, ind, c);
Node* br = graph()->NewNode(common()->Branch(), add, loop);
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* br1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1);
Node* phi1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), add, p0, m1);
loop->ReplaceInput(1, t); // close loop.
ind->ReplaceInput(1, phi1); // close induction variable.
Node* ret = graph()->NewNode(common()->Return(), ind, start, f);
Node* end = graph()->NewNode(common()->End(), ret, f);
graph()->SetEnd(end);
ComputeAndVerifySchedule(20);
}
TARGET_TEST_F(SchedulerTest, LoopedFloatingDiamond2) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* c = graph()->NewNode(common()->Int32Constant(7));
Node* loop = graph()->NewNode(common()->Loop(2), start, start);
Node* ind = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p0, loop);
Node* br1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1);
Node* phi1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), c, ind, m1);
Node* add = graph()->NewNode(&kIntAdd, ind, phi1);
Node* br = graph()->NewNode(common()->Branch(), add, loop);
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
loop->ReplaceInput(1, t); // close loop.
ind->ReplaceInput(1, add); // close induction variable.
Node* ret = graph()->NewNode(common()->Return(), ind, start, f);
Node* end = graph()->NewNode(common()->End(), ret, f);
graph()->SetEnd(end);
ComputeAndVerifySchedule(20);
}
TARGET_TEST_F(SchedulerTest, LoopedFloatingDiamond3) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* c = graph()->NewNode(common()->Int32Constant(7));
Node* loop = graph()->NewNode(common()->Loop(2), start, start);
Node* ind = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p0, loop);
Node* br1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
Node* f1 = graph()->NewNode(common()->IfFalse(), br1);
Node* loop1 = graph()->NewNode(common()->Loop(2), t1, start);
Node* ind1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), p0, p0, loop);
Node* add1 = graph()->NewNode(&kIntAdd, ind1, c);
Node* br2 = graph()->NewNode(common()->Branch(), add1, loop1);
Node* t2 = graph()->NewNode(common()->IfTrue(), br2);
Node* f2 = graph()->NewNode(common()->IfFalse(), br2);
loop1->ReplaceInput(1, t2); // close inner loop.
ind1->ReplaceInput(1, ind1); // close inner induction variable.
Node* m1 = graph()->NewNode(common()->Merge(2), f1, f2);
Node* phi1 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), c, ind1, m1);
Node* add = graph()->NewNode(&kIntAdd, ind, phi1);
Node* br = graph()->NewNode(common()->Branch(), add, loop);
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
loop->ReplaceInput(1, t); // close loop.
ind->ReplaceInput(1, add); // close induction variable.
Node* ret = graph()->NewNode(common()->Return(), ind, start, f);
Node* end = graph()->NewNode(common()->End(), ret, f);
graph()->SetEnd(end);
ComputeAndVerifySchedule(28);
}
TARGET_TEST_F(SchedulerTest, PhisPushedDownToDifferentBranches) {
Node* start = graph()->NewNode(common()->Start(2));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* p1 = graph()->NewNode(common()->Parameter(1), start);
Node* v1 = graph()->NewNode(common()->Int32Constant(1));
Node* v2 = graph()->NewNode(common()->Int32Constant(2));
Node* v3 = graph()->NewNode(common()->Int32Constant(3));
Node* v4 = graph()->NewNode(common()->Int32Constant(4));
Node* br = graph()->NewNode(common()->Branch(), p0, graph()->start());
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* m = graph()->NewNode(common()->Merge(2), t, f);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), v1, v2, m);
Node* phi2 = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), v3, v4, m);
Node* br2 = graph()->NewNode(common()->Branch(), p1, graph()->start());
Node* t2 = graph()->NewNode(common()->IfTrue(), br2);
Node* f2 = graph()->NewNode(common()->IfFalse(), br2);
Node* m2 = graph()->NewNode(common()->Merge(2), t2, f2);
Node* phi3 =
graph()->NewNode(common()->Phi(kMachAnyTagged, 2), phi, phi2, m2);
Node* ret = graph()->NewNode(common()->Return(), phi3, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
ComputeAndVerifySchedule(24);
}
TARGET_TEST_F(SchedulerTest, BranchHintTrue) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* tv = graph()->NewNode(common()->Int32Constant(6));
Node* fv = graph()->NewNode(common()->Int32Constant(7));
Node* br = graph()->NewNode(common()->Branch(BranchHint::kTrue), p0, start);
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* m = graph()->NewNode(common()->Merge(2), t, f);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), tv, fv, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
Schedule* schedule = ComputeAndVerifySchedule(13);
// Make sure the false block is marked as deferred.
EXPECT_FALSE(schedule->block(t)->deferred());
EXPECT_TRUE(schedule->block(f)->deferred());
}
TARGET_TEST_F(SchedulerTest, BranchHintFalse) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* tv = graph()->NewNode(common()->Int32Constant(6));
Node* fv = graph()->NewNode(common()->Int32Constant(7));
Node* br = graph()->NewNode(common()->Branch(BranchHint::kFalse), p0, start);
Node* t = graph()->NewNode(common()->IfTrue(), br);
Node* f = graph()->NewNode(common()->IfFalse(), br);
Node* m = graph()->NewNode(common()->Merge(2), t, f);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), tv, fv, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, start);
Node* end = graph()->NewNode(common()->End(), ret, start);
graph()->SetEnd(end);
Schedule* schedule = ComputeAndVerifySchedule(13);
// Make sure the true block is marked as deferred.
EXPECT_TRUE(schedule->block(t)->deferred());
EXPECT_FALSE(schedule->block(f)->deferred());
}
TARGET_TEST_F(SchedulerTest, CallException) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* c1 = graph()->NewNode(&kMockCall, start);
Node* ok1 = graph()->NewNode(common()->IfSuccess(), c1);
Node* ex1 = graph()->NewNode(common()->IfException(), c1);
Node* c2 = graph()->NewNode(&kMockCall, ok1);
Node* ok2 = graph()->NewNode(common()->IfSuccess(), c2);
Node* ex2 = graph()->NewNode(common()->IfException(), c2);
Node* hdl = graph()->NewNode(common()->Merge(2), ex1, ex2);
Node* m = graph()->NewNode(common()->Merge(2), ok2, hdl);
Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), c2, p0, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, m);
Node* end = graph()->NewNode(common()->End(), ret);
graph()->SetEnd(end);
Schedule* schedule = ComputeAndVerifySchedule(17);
// Make sure the exception blocks as well as the handler are deferred.
EXPECT_TRUE(schedule->block(ex1)->deferred());
EXPECT_TRUE(schedule->block(ex2)->deferred());
EXPECT_TRUE(schedule->block(hdl)->deferred());
EXPECT_FALSE(schedule->block(m)->deferred());
}
TARGET_TEST_F(SchedulerTest, TailCall) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* call = graph()->NewNode(&kMockTailCall, p0, start, start);
Node* end = graph()->NewNode(common()->End(), call);
graph()->SetEnd(end);
ComputeAndVerifySchedule(4);
}
TARGET_TEST_F(SchedulerTest, Switch) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* sw = graph()->NewNode(common()->Switch(3), p0, start);
Node* c0 = graph()->NewNode(common()->IfValue(0), sw);
Node* v0 = graph()->NewNode(common()->Int32Constant(11));
Node* c1 = graph()->NewNode(common()->IfValue(1), sw);
Node* v1 = graph()->NewNode(common()->Int32Constant(22));
Node* d = graph()->NewNode(common()->IfDefault(), sw);
Node* vd = graph()->NewNode(common()->Int32Constant(33));
Node* m = graph()->NewNode(common()->Merge(3), c0, c1, d);
Node* phi = graph()->NewNode(common()->Phi(kMachInt32, 3), v0, v1, vd, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, m);
Node* end = graph()->NewNode(common()->End(), ret);
graph()->SetEnd(end);
ComputeAndVerifySchedule(16);
}
TARGET_TEST_F(SchedulerTest, FloatingSwitch) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* p0 = graph()->NewNode(common()->Parameter(0), start);
Node* sw = graph()->NewNode(common()->Switch(3), p0, start);
Node* c0 = graph()->NewNode(common()->IfValue(0), sw);
Node* v0 = graph()->NewNode(common()->Int32Constant(11));
Node* c1 = graph()->NewNode(common()->IfValue(1), sw);
Node* v1 = graph()->NewNode(common()->Int32Constant(22));
Node* d = graph()->NewNode(common()->IfDefault(), sw);
Node* vd = graph()->NewNode(common()->Int32Constant(33));
Node* m = graph()->NewNode(common()->Merge(3), c0, c1, d);
Node* phi = graph()->NewNode(common()->Phi(kMachInt32, 3), v0, v1, vd, m);
Node* ret = graph()->NewNode(common()->Return(), phi, start, start);
Node* end = graph()->NewNode(common()->End(), ret);
graph()->SetEnd(end);
ComputeAndVerifySchedule(16);
}
TARGET_TEST_F(SchedulerTest, Terminate) {
Node* start = graph()->NewNode(common()->Start(1));
graph()->SetStart(start);
Node* loop = graph()->NewNode(common()->Loop(2), start, start);
loop->ReplaceInput(1, loop); // self loop, NTL.
Node* effect = graph()->NewNode(common()->EffectPhi(1), start, loop);
Node* terminate = graph()->NewNode(common()->Terminate(), effect, loop);
effect->ReplaceInput(1, terminate);
Node* end = graph()->NewNode(common()->End(), terminate);
graph()->SetEnd(end);
Schedule* schedule = ComputeAndVerifySchedule(6);
BasicBlock* block = schedule->block(loop);
EXPECT_EQ(block, schedule->block(effect));
EXPECT_GE(block->rpo_number(), 0);
}
} // namespace compiler
} // namespace internal
} // namespace v8
Reference in New Issue View Git Blame Copy Permalink