| OLD | NEW |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 #include "vm/block_scheduler.h" | 5 #include "vm/block_scheduler.h" |
| 6 | 6 |
| 7 #include "vm/allocation.h" | 7 #include "vm/allocation.h" |
| 8 #include "vm/code_patcher.h" | 8 #include "vm/code_patcher.h" |
| 9 #include "vm/compiler.h" | 9 #include "vm/compiler.h" |
| 10 #include "vm/flow_graph.h" | 10 #include "vm/flow_graph.h" |
| 11 | 11 |
| 12 namespace dart { | 12 namespace dart { |
| 13 | 13 |
| 14 DEFINE_FLAG(bool, emit_edge_counters, true, "Emit edge counters at targets."); |
| 15 |
| 14 static intptr_t GetEdgeCount(const Array& edge_counters, intptr_t edge_id) { | 16 static intptr_t GetEdgeCount(const Array& edge_counters, intptr_t edge_id) { |
| 15 if (!FLAG_emit_edge_counters) { | 17 if (!FLAG_emit_edge_counters) { |
| 16 // Assume everything was visited once. | 18 // Assume everything was visited once. |
| 17 return 1; | 19 return 1; |
| 18 } | 20 } |
| 19 return Smi::Value(Smi::RawCast(edge_counters.At(edge_id))); | 21 return Smi::Value(Smi::RawCast(edge_counters.At(edge_id))); |
| 20 } | 22 } |
| 21 | 23 |
| 22 | 24 |
| 23 // There is an edge from instruction->successor. Set its weight (edge count | 25 // There is an edge from instruction->successor. Set its weight (edge count |
| (...skipping 184 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 208 for (intptr_t i = block_count - 1; i >= 0; --i) { | 210 for (intptr_t i = block_count - 1; i >= 0; --i) { |
| 209 if (chains[i]->first->block == flow_graph()->postorder()[i]) { | 211 if (chains[i]->first->block == flow_graph()->postorder()[i]) { |
| 210 for (Link* link = chains[i]->first; link != NULL; link = link->next) { | 212 for (Link* link = chains[i]->first; link != NULL; link = link->next) { |
| 211 flow_graph()->CodegenBlockOrder(true)->Add(link->block); | 213 flow_graph()->CodegenBlockOrder(true)->Add(link->block); |
| 212 } | 214 } |
| 213 } | 215 } |
| 214 } | 216 } |
| 215 } | 217 } |
| 216 | 218 |
| 217 } // namespace dart | 219 } // namespace dart |
| OLD | NEW |