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

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

Issue 557413002: Merge chains of straight-line blocks. (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: fixed assertion Created 6 years 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/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 196 matching lines...) Expand 10 before | Expand all | Expand 10 after
207 207
208 // Operations on the flow graph. 208 // Operations on the flow graph.
209 void ComputeSSA(intptr_t next_virtual_register_number, 209 void ComputeSSA(intptr_t next_virtual_register_number,
210 ZoneGrowableArray<Definition*>* inlining_parameters); 210 ZoneGrowableArray<Definition*>* inlining_parameters);
211 211
212 // Verification methods for debugging. 212 // Verification methods for debugging.
213 bool VerifyUseLists(); 213 bool VerifyUseLists();
214 214
215 void DiscoverBlocks(); 215 void DiscoverBlocks();
216 216
217 void MergeBlocks();
218
217 // Compute information about effects occuring in different blocks and 219 // Compute information about effects occuring in different blocks and
218 // discover side-effect free paths. 220 // discover side-effect free paths.
219 void ComputeBlockEffects(); 221 void ComputeBlockEffects();
220 BlockEffects* block_effects() const { return block_effects_; } 222 BlockEffects* block_effects() const { return block_effects_; }
221 223
222 // Remove the redefinition instructions inserted to inhibit code motion. 224 // Remove the redefinition instructions inserted to inhibit code motion.
223 void RemoveRedefinitions(); 225 void RemoveRedefinitions();
224 226
225 // Copy deoptimization target from one instruction to another if we still 227 // Copy deoptimization target from one instruction to another if we still
226 // have to keep deoptimization environment at gotos for LICM purposes. 228 // have to keep deoptimization environment at gotos for LICM purposes.
(...skipping 281 matching lines...) Expand 10 before | Expand all | Expand 10 after
508 510
509 private: 511 private:
510 GrowableArray<Definition*> defs_; 512 GrowableArray<Definition*> defs_;
511 BitVector* contains_vector_; 513 BitVector* contains_vector_;
512 }; 514 };
513 515
514 516
515 } // namespace dart 517 } // namespace dart
516 518
517 #endif // VM_FLOW_GRAPH_H_ 519 #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