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 |
5 #include "vm/block_scheduler.h" | 7 #include "vm/block_scheduler.h" |
6 | 8 |
7 #include "vm/allocation.h" | 9 #include "vm/allocation.h" |
8 #include "vm/code_patcher.h" | 10 #include "vm/code_patcher.h" |
9 #include "vm/compiler.h" | 11 #include "vm/compiler.h" |
10 #include "vm/flow_graph.h" | 12 #include "vm/flow_graph.h" |
11 | 13 |
12 namespace dart { | 14 namespace dart { |
13 | 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) { |
(...skipping 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
210 for (intptr_t i = block_count - 1; i >= 0; --i) { | 212 for (intptr_t i = block_count - 1; i >= 0; --i) { |
211 if (chains[i]->first->block == flow_graph()->postorder()[i]) { | 213 if (chains[i]->first->block == flow_graph()->postorder()[i]) { |
212 for (Link* link = chains[i]->first; link != NULL; link = link->next) { | 214 for (Link* link = chains[i]->first; link != NULL; link = link->next) { |
213 flow_graph()->CodegenBlockOrder(true)->Add(link->block); | 215 flow_graph()->CodegenBlockOrder(true)->Add(link->block); |
214 } | 216 } |
215 } | 217 } |
216 } | 218 } |
217 } | 219 } |
218 | 220 |
219 } // namespace dart | 221 } // namespace dart |
| 222 |
| 223 #endif // !defined(DART_PRECOMPILED_RUNTIME) |
OLD | NEW |