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_BUILDER_H_ | 5 #ifndef VM_FLOW_GRAPH_BUILDER_H_ |
6 #define VM_FLOW_GRAPH_BUILDER_H_ | 6 #define VM_FLOW_GRAPH_BUILDER_H_ |
7 | 7 |
8 #include "vm/allocation.h" | 8 #include "vm/allocation.h" |
9 #include "vm/ast.h" | 9 #include "vm/ast.h" |
10 #include "vm/growable_array.h" | 10 #include "vm/growable_array.h" |
(...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
56 GrowableArray<BitVector*>* dominance_frontier); | 56 GrowableArray<BitVector*>* dominance_frontier); |
57 | 57 |
58 void CompressPath(intptr_t start_index, | 58 void CompressPath(intptr_t start_index, |
59 intptr_t current_index, | 59 intptr_t current_index, |
60 GrowableArray<intptr_t>* parent, | 60 GrowableArray<intptr_t>* parent, |
61 GrowableArray<intptr_t>* label); | 61 GrowableArray<intptr_t>* label); |
62 | 62 |
63 void Rename(intptr_t var_count); | 63 void Rename(intptr_t var_count); |
64 void RenameRecursive(BlockEntryInstr* block_entry, | 64 void RenameRecursive(BlockEntryInstr* block_entry, |
65 GrowableArray<Value*>* env, | 65 GrowableArray<Value*>* env, |
66 intptr_t var_count); | 66 intptr_t var_count, |
| 67 intptr_t param_count); |
67 | 68 |
68 void InsertPhis(const GrowableArray<BlockEntryInstr*>& preorder, | 69 void InsertPhis(const GrowableArray<BlockEntryInstr*>& preorder, |
69 const GrowableArray<BitVector*>& assigned_vars, | 70 const GrowableArray<BitVector*>& assigned_vars, |
70 const intptr_t var_count, | 71 const intptr_t var_count, |
71 const GrowableArray<BitVector*>& dom_frontier); | 72 const GrowableArray<BitVector*>& dom_frontier); |
72 | 73 |
73 const ParsedFunction& parsed_function_; | 74 const ParsedFunction& parsed_function_; |
74 GrowableArray<BlockEntryInstr*> preorder_block_entries_; | 75 GrowableArray<BlockEntryInstr*> preorder_block_entries_; |
75 GrowableArray<BlockEntryInstr*> postorder_block_entries_; | 76 GrowableArray<BlockEntryInstr*> postorder_block_entries_; |
76 intptr_t context_level_; | 77 intptr_t context_level_; |
(...skipping 266 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
343 // Output parameters. | 344 // Output parameters. |
344 TargetEntryInstr** true_successor_address_; | 345 TargetEntryInstr** true_successor_address_; |
345 TargetEntryInstr** false_successor_address_; | 346 TargetEntryInstr** false_successor_address_; |
346 | 347 |
347 intptr_t condition_token_pos_; | 348 intptr_t condition_token_pos_; |
348 }; | 349 }; |
349 | 350 |
350 } // namespace dart | 351 } // namespace dart |
351 | 352 |
352 #endif // VM_FLOW_GRAPH_BUILDER_H_ | 353 #endif // VM_FLOW_GRAPH_BUILDER_H_ |
OLD | NEW |