OLD | NEW |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, 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/flow_graph_optimizer.h" | 5 #include "vm/flow_graph_optimizer.h" |
6 | 6 |
7 #include "vm/flow_graph_builder.h" | 7 #include "vm/flow_graph_builder.h" |
8 #include "vm/il_printer.h" | 8 #include "vm/il_printer.h" |
9 #include "vm/object_store.h" | 9 #include "vm/object_store.h" |
10 #include "vm/parser.h" | 10 #include "vm/parser.h" |
(...skipping 698 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
709 } while (still_changing_); | 709 } while (still_changing_); |
710 } | 710 } |
711 | 711 |
712 | 712 |
713 void FlowGraphAnalyzer::Analyze() { | 713 void FlowGraphAnalyzer::Analyze() { |
714 is_leaf_ = true; | 714 is_leaf_ = true; |
715 for (intptr_t i = 0; i < blocks_.length(); ++i) { | 715 for (intptr_t i = 0; i < blocks_.length(); ++i) { |
716 BlockEntryInstr* entry = blocks_[i]; | 716 BlockEntryInstr* entry = blocks_[i]; |
717 for (ForwardInstructionIterator it(entry); !it.Done(); it.Advance()) { | 717 for (ForwardInstructionIterator it(entry); !it.Done(); it.Advance()) { |
718 LocationSummary* locs = it.Current()->locs(); | 718 LocationSummary* locs = it.Current()->locs(); |
719 if ((locs != NULL) && locs->contains_call()) { | 719 if ((locs != NULL) && locs->can_call()) { |
720 is_leaf_ = false; | 720 is_leaf_ = false; |
721 return; | 721 return; |
722 } | 722 } |
723 } | 723 } |
724 } | 724 } |
725 } | 725 } |
726 | 726 |
727 } // namespace dart | 727 } // namespace dart |
OLD | NEW |