Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(825)

Side by Side Diff: runtime/vm/flow_graph.h

Issue 14135006: Reapply "Incrementally recompute dominators when inlining." (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 7 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « no previous file | runtime/vm/flow_graph.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 VM_FLOW_GRAPH_H_ 5 #ifndef VM_FLOW_GRAPH_H_
6 #define VM_FLOW_GRAPH_H_ 6 #define VM_FLOW_GRAPH_H_
7 7
8 #include "vm/growable_array.h" 8 #include "vm/growable_array.h"
9 #include "vm/intermediate_language.h" 9 #include "vm/intermediate_language.h"
10 #include "vm/parser.h" 10 #include "vm/parser.h"
(...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after
122 Definition::UseKind use_kind); 122 Definition::UseKind use_kind);
123 123
124 // Operations on the flow graph. 124 // Operations on the flow graph.
125 void ComputeSSA(intptr_t next_virtual_register_number, 125 void ComputeSSA(intptr_t next_virtual_register_number,
126 GrowableArray<Definition*>* inlining_parameters); 126 GrowableArray<Definition*>* inlining_parameters);
127 127
128 // Finds natural loops in the flow graph and attaches a list of loop 128 // Finds natural loops in the flow graph and attaches a list of loop
129 // body blocks for each loop header. 129 // body blocks for each loop header.
130 void ComputeLoops(GrowableArray<BlockEntryInstr*>* loop_headers); 130 void ComputeLoops(GrowableArray<BlockEntryInstr*>* loop_headers);
131 131
132 void RepairGraphAfterInlining();
133
134 // TODO(zerny): Once the SSA is feature complete this should be removed. 132 // TODO(zerny): Once the SSA is feature complete this should be removed.
135 void Bailout(const char* reason) const; 133 void Bailout(const char* reason) const;
136 134
137 void InvalidateDominatorTree() { invalid_dominator_tree_ = true; }
138
139 #ifdef DEBUG 135 #ifdef DEBUG
140 // Verification methods for debugging. 136 // Verification methods for debugging.
141 bool VerifyUseLists(); 137 bool VerifyUseLists();
142 #endif // DEBUG 138 #endif // DEBUG
143 139
140 void DiscoverBlocks();
141
144 private: 142 private:
145 friend class IfConverter; 143 friend class IfConverter;
146 friend class BranchSimplifier; 144 friend class BranchSimplifier;
147 friend class ConstantPropagator; 145 friend class ConstantPropagator;
148 146
149 void DiscoverBlocks();
150
151 // SSA transformation methods and fields. 147 // SSA transformation methods and fields.
152 void ComputeDominators(GrowableArray<BitVector*>* dominance_frontier); 148 void ComputeDominators(GrowableArray<BitVector*>* dominance_frontier);
153 149
154 void CompressPath( 150 void CompressPath(
155 intptr_t start_index, 151 intptr_t start_index,
156 intptr_t current_index, 152 intptr_t current_index,
157 GrowableArray<intptr_t>* parent, 153 GrowableArray<intptr_t>* parent,
158 GrowableArray<intptr_t>* label); 154 GrowableArray<intptr_t>* label);
159 155
160 void Rename(GrowableArray<PhiInstr*>* live_phis, 156 void Rename(GrowableArray<PhiInstr*>* live_phis,
(...skipping 23 matching lines...) Expand all
184 180
185 // Flow graph fields. 181 // Flow graph fields.
186 const ParsedFunction& parsed_function_; 182 const ParsedFunction& parsed_function_;
187 const intptr_t num_copied_params_; 183 const intptr_t num_copied_params_;
188 const intptr_t num_non_copied_params_; 184 const intptr_t num_non_copied_params_;
189 const intptr_t num_stack_locals_; 185 const intptr_t num_stack_locals_;
190 GraphEntryInstr* graph_entry_; 186 GraphEntryInstr* graph_entry_;
191 GrowableArray<BlockEntryInstr*> preorder_; 187 GrowableArray<BlockEntryInstr*> preorder_;
192 GrowableArray<BlockEntryInstr*> postorder_; 188 GrowableArray<BlockEntryInstr*> postorder_;
193 GrowableArray<BlockEntryInstr*> reverse_postorder_; 189 GrowableArray<BlockEntryInstr*> reverse_postorder_;
194 bool invalid_dominator_tree_;
195 ConstantInstr* constant_null_; 190 ConstantInstr* constant_null_;
196 }; 191 };
197 192
198 } // namespace dart 193 } // namespace dart
199 194
200 #endif // VM_FLOW_GRAPH_H_ 195 #endif // VM_FLOW_GRAPH_H_
OLDNEW
« no previous file with comments | « no previous file | runtime/vm/flow_graph.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698