| 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 #if !defined(DART_PRECOMPILED_RUNTIME) | |
| 6 | |
| 7 #include "vm/block_scheduler.h" | 5 #include "vm/block_scheduler.h" |
| 8 | 6 |
| 9 #include "vm/allocation.h" | 7 #include "vm/allocation.h" |
| 10 #include "vm/code_patcher.h" | 8 #include "vm/code_patcher.h" |
| 11 #include "vm/compiler.h" | 9 #include "vm/compiler.h" |
| 12 #include "vm/flow_graph.h" | 10 #include "vm/flow_graph.h" |
| 13 | 11 |
| 14 namespace dart { | 12 namespace dart { |
| 15 | 13 |
| 16 static intptr_t GetEdgeCount(const Array& edge_counters, intptr_t edge_id) { | 14 static intptr_t GetEdgeCount(const Array& edge_counters, intptr_t edge_id) { |
| (...skipping 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 204 for (intptr_t i = block_count - 1; i >= 0; --i) { | 202 for (intptr_t i = block_count - 1; i >= 0; --i) { |
| 205 if (chains[i]->first->block == flow_graph()->postorder()[i]) { | 203 if (chains[i]->first->block == flow_graph()->postorder()[i]) { |
| 206 for (Link* link = chains[i]->first; link != NULL; link = link->next) { | 204 for (Link* link = chains[i]->first; link != NULL; link = link->next) { |
| 207 flow_graph()->CodegenBlockOrder(true)->Add(link->block); | 205 flow_graph()->CodegenBlockOrder(true)->Add(link->block); |
| 208 } | 206 } |
| 209 } | 207 } |
| 210 } | 208 } |
| 211 } | 209 } |
| 212 | 210 |
| 213 } // namespace dart | 211 } // namespace dart |
| 214 | |
| 215 #endif // !defined(DART_PRECOMPILED_RUNTIME) | |
| OLD | NEW |