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 #ifndef RUNTIME_VM_FLOW_GRAPH_H_ | 5 #ifndef RUNTIME_VM_FLOW_GRAPH_H_ |
6 #define RUNTIME_VM_FLOW_GRAPH_H_ | 6 #define RUNTIME_VM_FLOW_GRAPH_H_ |
7 | 7 |
8 #include "vm/bit_vector.h" | 8 #include "vm/bit_vector.h" |
9 #include "vm/growable_array.h" | 9 #include "vm/growable_array.h" |
10 #include "vm/hash_map.h" | 10 #include "vm/hash_map.h" |
(...skipping 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
198 ZoneGrowableArray<Definition*>* inlining_parameters); | 198 ZoneGrowableArray<Definition*>* inlining_parameters); |
199 | 199 |
200 // Verification methods for debugging. | 200 // Verification methods for debugging. |
201 bool VerifyUseLists(); | 201 bool VerifyUseLists(); |
202 bool VerifyRedefinitions(); | 202 bool VerifyRedefinitions(); |
203 | 203 |
204 void DiscoverBlocks(); | 204 void DiscoverBlocks(); |
205 | 205 |
206 void MergeBlocks(); | 206 void MergeBlocks(); |
207 | 207 |
208 // Compute information about effects occuring in different blocks and | 208 // Compute information about effects occurring in different blocks and |
209 // discover side-effect free paths. | 209 // discover side-effect free paths. |
210 void ComputeBlockEffects(); | 210 void ComputeBlockEffects(); |
211 BlockEffects* block_effects() const { return block_effects_; } | 211 BlockEffects* block_effects() const { return block_effects_; } |
212 | 212 |
213 // Insert a redefinition of an original definition after prev and rename all | 213 // Insert a redefinition of an original definition after prev and rename all |
214 // dominated uses of the original. If an equivalent redefinition is already | 214 // dominated uses of the original. If an equivalent redefinition is already |
215 // present, nothing is inserted. | 215 // present, nothing is inserted. |
216 // Returns the redefintion, if a redefinition was inserted, NULL otherwise. | 216 // Returns the redefintion, if a redefinition was inserted, NULL otherwise. |
217 RedefinitionInstr* EnsureRedefinition(Instruction* prev, | 217 RedefinitionInstr* EnsureRedefinition(Instruction* prev, |
218 Definition* original, | 218 Definition* original, |
(...skipping 337 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
556 | 556 |
557 private: | 557 private: |
558 GrowableArray<Definition*> defs_; | 558 GrowableArray<Definition*> defs_; |
559 BitVector* contains_vector_; | 559 BitVector* contains_vector_; |
560 }; | 560 }; |
561 | 561 |
562 | 562 |
563 } // namespace dart | 563 } // namespace dart |
564 | 564 |
565 #endif // RUNTIME_VM_FLOW_GRAPH_H_ | 565 #endif // RUNTIME_VM_FLOW_GRAPH_H_ |
OLD | NEW |