| 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 #ifndef VM_FLOW_GRAPH_OPTIMIZER_H_ | 5 #ifndef VM_FLOW_GRAPH_OPTIMIZER_H_ |
| 6 #define VM_FLOW_GRAPH_OPTIMIZER_H_ | 6 #define VM_FLOW_GRAPH_OPTIMIZER_H_ |
| 7 | 7 |
| 8 #include "vm/intermediate_language.h" | 8 #include "vm/intermediate_language.h" |
| 9 #include "vm/flow_graph.h" | 9 #include "vm/flow_graph.h" |
| 10 | 10 |
| (...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 177 // Sparse conditional constant propagation and unreachable code elimination. | 177 // Sparse conditional constant propagation and unreachable code elimination. |
| 178 // Assumes that use lists are computed and preserves them. | 178 // Assumes that use lists are computed and preserves them. |
| 179 class ConstantPropagator : public FlowGraphVisitor { | 179 class ConstantPropagator : public FlowGraphVisitor { |
| 180 public: | 180 public: |
| 181 ConstantPropagator(FlowGraph* graph, | 181 ConstantPropagator(FlowGraph* graph, |
| 182 const GrowableArray<BlockEntryInstr*>& ignored); | 182 const GrowableArray<BlockEntryInstr*>& ignored); |
| 183 | 183 |
| 184 static void Optimize(FlowGraph* graph); | 184 static void Optimize(FlowGraph* graph); |
| 185 | 185 |
| 186 // Used to initialize the abstract value of definitions. | 186 // Used to initialize the abstract value of definitions. |
| 187 static RawObject* Unknown() { return Object::transition_sentinel(); } | 187 static RawObject* Unknown() { return Object::transition_sentinel().raw(); } |
| 188 | 188 |
| 189 private: | 189 private: |
| 190 void Analyze(); | 190 void Analyze(); |
| 191 void Transform(); | 191 void Transform(); |
| 192 | 192 |
| 193 void SetReachable(BlockEntryInstr* block); | 193 void SetReachable(BlockEntryInstr* block); |
| 194 void SetValue(Definition* definition, const Object& value); | 194 void SetValue(Definition* definition, const Object& value); |
| 195 | 195 |
| 196 // Assign the join (least upper bound) of a pair of abstract values to the | 196 // Assign the join (least upper bound) of a pair of abstract values to the |
| 197 // first one. | 197 // first one. |
| (...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 230 | 230 |
| 231 // Worklists of blocks and definitions. | 231 // Worklists of blocks and definitions. |
| 232 GrowableArray<BlockEntryInstr*> block_worklist_; | 232 GrowableArray<BlockEntryInstr*> block_worklist_; |
| 233 GrowableArray<Definition*> definition_worklist_; | 233 GrowableArray<Definition*> definition_worklist_; |
| 234 }; | 234 }; |
| 235 | 235 |
| 236 | 236 |
| 237 } // namespace dart | 237 } // namespace dart |
| 238 | 238 |
| 239 #endif // VM_FLOW_GRAPH_OPTIMIZER_H_ | 239 #endif // VM_FLOW_GRAPH_OPTIMIZER_H_ |
| OLD | NEW |