OLD | NEW |
1 // Copyright (c) 2016, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2016, 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/branch_optimizer.h" | 7 #include "vm/branch_optimizer.h" |
6 | 8 |
7 #include "vm/flow_graph.h" | 9 #include "vm/flow_graph.h" |
8 #include "vm/intermediate_language.h" | 10 #include "vm/intermediate_language.h" |
9 | 11 |
10 namespace dart { | 12 namespace dart { |
11 | 13 |
12 // Returns true if the given phi has a single input use and | 14 // Returns true if the given phi has a single input use and |
13 // is used in the environments either at the corresponding block entry or | 15 // is used in the environments either at the corresponding block entry or |
14 // at the same instruction where input use is. | 16 // at the same instruction where input use is. |
(...skipping 318 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
333 | 335 |
334 if (changed) { | 336 if (changed) { |
335 // We may have changed the block order and the dominator tree. | 337 // We may have changed the block order and the dominator tree. |
336 flow_graph->DiscoverBlocks(); | 338 flow_graph->DiscoverBlocks(); |
337 GrowableArray<BitVector*> dominance_frontier; | 339 GrowableArray<BitVector*> dominance_frontier; |
338 flow_graph->ComputeDominators(&dominance_frontier); | 340 flow_graph->ComputeDominators(&dominance_frontier); |
339 } | 341 } |
340 } | 342 } |
341 | 343 |
342 } // namespace dart | 344 } // namespace dart |
| 345 |
| 346 #endif // !defined(DART_PRECOMPILED_RUNTIME) |
OLD | NEW |