Incrementally recompute dominators when inlining.

runtime/vm/flow_graph.h

Index: runtime/vm/flow_graph.h
diff --git a/runtime/vm/flow_graph.h b/runtime/vm/flow_graph.h
index 14c298a9ec22526962a85d3d5ab82c932d283998..4e7ad324e3adb791f28d15c5b06c8ac09572333d 100644
--- a/runtime/vm/flow_graph.h
+++ b/runtime/vm/flow_graph.h
@@ -129,24 +129,20 @@ class FlowGraph : public ZoneAllocated {
   // body blocks for each loop header.
   void ComputeLoops(GrowableArray<BlockEntryInstr*>* loop_headers);
 
-  void RepairGraphAfterInlining();
-
   // TODO(zerny): Once the SSA is feature complete this should be removed.
   void Bailout(const char* reason) const;
 
-  void InvalidateDominatorTree() { invalid_dominator_tree_ = true; }
-
 #ifdef DEBUG
   // Verification methods for debugging.
   bool VerifyUseLists();
 #endif  // DEBUG
 
+  void DiscoverBlocks();
+
  private:
   friend class BranchSimplifier;
   friend class ConstantPropagator;
 
-  void DiscoverBlocks();
-
   // SSA transformation methods and fields.
   void ComputeDominators(GrowableArray<BitVector*>* dominance_frontier);
 
@@ -190,7 +186,6 @@ class FlowGraph : public ZoneAllocated {
   GrowableArray<BlockEntryInstr*> preorder_;
   GrowableArray<BlockEntryInstr*> postorder_;
   GrowableArray<BlockEntryInstr*> reverse_postorder_;
-  bool invalid_dominator_tree_;
   ConstantInstr* constant_null_;
 };