Merge chains of straight-line blocks.

runtime/vm/flow_graph.h

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef VM_FLOW_GRAPH_H_
 #define VM_FLOW_GRAPH_H_
 
 #include "vm/growable_array.h"
 #include "vm/hash_map.h"
 #include "vm/intermediate_language.h"
@@ skipping 179 matching lines @@
 
   // Operations on the flow graph.
   void ComputeSSA(intptr_t next_virtual_register_number,
                   ZoneGrowableArray<Definition*>* inlining_parameters);
 
   // Verification methods for debugging.
   bool VerifyUseLists();
 
   void DiscoverBlocks();
 
+  void MergeBlocks();
+
   // Compute information about effects occuring in different blocks and
   // discover side-effect free paths.
   void ComputeBlockEffects();
   BlockEffects* block_effects() const { return block_effects_; }
 
   // Remove the redefinition instructions inserted to inhibit code motion.
   void RemoveRedefinitions();
 
   // Copy deoptimization target from one instruction to another if we still
   // have to keep deoptimization environment at gotos for LICM purposes.
@@ skipping 229 matching lines @@
   // Per block sets of available blocks. Block A is available at the block B if
   // and only if A dominates B and all paths from A to B are free of side
   // effects.
   GrowableArray<BitVector*> available_at_;
 };
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_H_