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