OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 #include "test/cctest/cctest.h" | 6 #include "test/cctest/cctest.h" |
7 | 7 |
8 #include "src/compiler/common-operator.h" | 8 #include "src/compiler/common-operator.h" |
9 #include "src/compiler/generic-node-inl.h" | 9 #include "src/compiler/generic-node-inl.h" |
10 #include "src/compiler/generic-node.h" | 10 #include "src/compiler/generic-node.h" |
(...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
88 static Schedule* ComputeAndVerifySchedule(int expected, Graph* graph) { | 88 static Schedule* ComputeAndVerifySchedule(int expected, Graph* graph) { |
89 if (FLAG_trace_turbo) { | 89 if (FLAG_trace_turbo) { |
90 OFStream os(stdout); | 90 OFStream os(stdout); |
91 os << AsDOT(*graph); | 91 os << AsDOT(*graph); |
92 } | 92 } |
93 | 93 |
94 Schedule* schedule = Scheduler::ComputeSchedule(graph); | 94 Schedule* schedule = Scheduler::ComputeSchedule(graph); |
95 | 95 |
96 if (FLAG_trace_turbo_scheduler) { | 96 if (FLAG_trace_turbo_scheduler) { |
97 OFStream os(stdout); | 97 OFStream os(stdout); |
98 os << *schedule << endl; | 98 os << *schedule << std::endl; |
99 } | 99 } |
100 ScheduleVerifier::Run(schedule); | 100 ScheduleVerifier::Run(schedule); |
101 CHECK_EQ(expected, GetScheduledNodeCount(schedule)); | 101 CHECK_EQ(expected, GetScheduledNodeCount(schedule)); |
102 return schedule; | 102 return schedule; |
103 } | 103 } |
104 | 104 |
105 | 105 |
106 TEST(RPODegenerate1) { | 106 TEST(RPODegenerate1) { |
107 HandleAndZoneScope scope; | 107 HandleAndZoneScope scope; |
108 Schedule schedule(scope.main_zone()); | 108 Schedule schedule(scope.main_zone()); |
(...skipping 1597 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1706 Node* d3 = CreateDiamond(&graph, &common, add); | 1706 Node* d3 = CreateDiamond(&graph, &common, add); |
1707 Node* ret = graph.NewNode(common.Return(), d3, start, start); | 1707 Node* ret = graph.NewNode(common.Return(), d3, start, start); |
1708 Node* end = graph.NewNode(common.End(), ret, start); | 1708 Node* end = graph.NewNode(common.End(), ret, start); |
1709 | 1709 |
1710 graph.SetEnd(end); | 1710 graph.SetEnd(end); |
1711 | 1711 |
1712 ComputeAndVerifySchedule(33, &graph); | 1712 ComputeAndVerifySchedule(33, &graph); |
1713 } | 1713 } |
1714 | 1714 |
1715 #endif | 1715 #endif |
OLD | NEW |