| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 <deque> | 5 #include <deque> |
| 6 #include <queue> | 6 #include <queue> |
| 7 | 7 |
| 8 #include "src/compiler/scheduler.h" | 8 #include "src/compiler/scheduler.h" |
| 9 | 9 |
| 10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
| (...skipping 238 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 249 Trace("Connect #%d:%s, B%d -> end\n", node->id(), node->op()->mnemonic(), | 249 Trace("Connect #%d:%s, B%d -> end\n", node->id(), node->op()->mnemonic(), |
| 250 block->id()); | 250 block->id()); |
| 251 } else { | 251 } else { |
| 252 Trace("Connect #%d:%s, B%d -> B%d\n", node->id(), node->op()->mnemonic(), | 252 Trace("Connect #%d:%s, B%d -> B%d\n", node->id(), node->op()->mnemonic(), |
| 253 block->id(), succ->id()); | 253 block->id(), succ->id()); |
| 254 } | 254 } |
| 255 } | 255 } |
| 256 }; | 256 }; |
| 257 | 257 |
| 258 | 258 |
| 259 Scheduler::SchedulerData Scheduler::DefaultSchedulerData() { |
| 260 SchedulerData def = {0, 0, false, false, kUnknown}; |
| 261 return def; |
| 262 } |
| 263 |
| 264 |
| 259 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule) | 265 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule) |
| 260 : zone_(zone), | 266 : zone_(zone), |
| 261 graph_(graph), | 267 graph_(graph), |
| 262 schedule_(schedule), | 268 schedule_(schedule), |
| 263 scheduled_nodes_(zone), | 269 scheduled_nodes_(zone), |
| 264 schedule_root_nodes_(zone), | 270 schedule_root_nodes_(zone), |
| 265 node_data_(graph_->NodeCount(), {0, 0, false, false, kUnknown}, zone), | 271 node_data_(graph_->NodeCount(), DefaultSchedulerData(), zone), |
| 266 has_floating_control_(false) {} | 272 has_floating_control_(false) {} |
| 267 | 273 |
| 268 | 274 |
| 269 Schedule* Scheduler::ComputeSchedule(Graph* graph) { | 275 Schedule* Scheduler::ComputeSchedule(Graph* graph) { |
| 270 Schedule* schedule; | 276 Schedule* schedule; |
| 271 bool had_floating_control = false; | 277 bool had_floating_control = false; |
| 272 do { | 278 do { |
| 273 Zone tmp_zone(graph->zone()->isolate()); | 279 Zone tmp_zone(graph->zone()->isolate()); |
| 274 schedule = new (graph->zone()) Schedule(graph->zone()); | 280 schedule = new (graph->zone()) Schedule(graph->zone()); |
| 275 Scheduler scheduler(&tmp_zone, graph, schedule); | 281 Scheduler scheduler(&tmp_zone, graph, schedule); |
| (...skipping 866 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1142 | 1148 |
| 1143 #if DEBUG | 1149 #if DEBUG |
| 1144 if (FLAG_trace_turbo_scheduler) PrintRPO(num_loops, loops, final_order); | 1150 if (FLAG_trace_turbo_scheduler) PrintRPO(num_loops, loops, final_order); |
| 1145 VerifySpecialRPO(num_loops, loops, final_order); | 1151 VerifySpecialRPO(num_loops, loops, final_order); |
| 1146 #endif | 1152 #endif |
| 1147 return final_order; | 1153 return final_order; |
| 1148 } | 1154 } |
| 1149 } | 1155 } |
| 1150 } | 1156 } |
| 1151 } // namespace v8::internal::compiler | 1157 } // namespace v8::internal::compiler |
| OLD | NEW |