Avoid rediscovering blocks on each call to FlowGraph::InlineCall.

runtime/vm/flow_graph.h

 // Copyright (c) 2012, 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/parser.h"
 
@@ skipping 95 matching lines @@
 
   // Operations on the flow graph.
   void ComputeSSA(intptr_t next_virtual_register_number);
   void ComputeUseLists();
 
   // Finds natural loops in the flow graph and attaches a list of loop
   // body blocks for each loop header.
   void ComputeLoops(GrowableArray<BlockEntryInstr*>* loop_headers);
 
   void InlineCall(Definition* call, FlowGraph* callee_graph);
+  void RepairGraphAfterInlining();
 
   // TODO(zerny): Once the SSA is feature complete this should be removed.
   void Bailout(const char* reason) const;
 
 #ifdef DEBUG
   // Validation methods for debugging.
   bool ResetUseLists();
   bool ValidateUseLists();
 #endif  // DEBUG
 
@@ skipping 17 matching lines @@
       GrowableArray<Definition*>* env,
       GrowableArray<PhiInstr*>* live_phis);
 
   void InsertPhis(
       const GrowableArray<BlockEntryInstr*>& preorder,
       const GrowableArray<BitVector*>& assigned_vars,
       const GrowableArray<BitVector*>& dom_frontier);
 
   void MarkLivePhis(GrowableArray<PhiInstr*>* live_phis);
 
+  void ReplacePredecessor(BlockEntryInstr* old_block,
+                          BlockEntryInstr* new_block);
+
   // DiscoverBlocks computes parent_ and assigned_vars_ which are then used
   // if/when computing SSA.
   GrowableArray<intptr_t> parent_;
   GrowableArray<BitVector*> assigned_vars_;
 
   intptr_t current_ssa_temp_index_;
   intptr_t max_block_id_;
 
   // Flow graph fields.
   const ParsedFunction& parsed_function_;
   const intptr_t num_copied_params_;
   const intptr_t num_non_copied_params_;
   const intptr_t num_stack_locals_;
   GraphEntryInstr* graph_entry_;
   GrowableArray<BlockEntryInstr*> preorder_;
   GrowableArray<BlockEntryInstr*> postorder_;
   GrowableArray<BlockEntryInstr*> reverse_postorder_;
   ZoneGrowableArray<ReturnInstr*>* exits_;
+  bool invalid_dominator_tree_;
 };
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_H_