Don't merge indirect entries.

runtime/vm/flow_graph.cc

 // 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.
 
 #include "vm/flow_graph.h"
 
 #include "vm/bit_vector.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/intermediate_language.h"
 #include "vm/growable_array.h"
@@ skipping 216 matching lines @@
   BitVector* merged = new(isolate()) BitVector(isolate(), postorder().length());
   for (BlockIterator block_it = reverse_postorder_iterator();
        !block_it.Done();
        block_it.Advance()) {
     BlockEntryInstr* block = block_it.Current();
     if (block->IsGraphEntry()) continue;
     if (merged->Contains(block->postorder_number())) continue;
 
     Instruction* last = block->last_instruction();
     BlockEntryInstr* successor = NULL;
-    while ((last->SuccessorCount() == 1) &&
+    while ((!last->IsIndirectGoto()) &&
+           (last->SuccessorCount() == 1) &&
+           (!last->SuccessorAt(0)->IsIndirectEntry()) &&
            (last->SuccessorAt(0)->PredecessorCount() == 1) &&
            (block->try_index() == last->SuccessorAt(0)->try_index())) {
       successor = last->SuccessorAt(0);
       ASSERT(last->IsGoto());
 
       // Remove environment uses and unlink goto and block entry.
       successor->UnuseAllInputs();
       last->previous()->LinkTo(successor->next());
       last->UnuseAllInputs();
 
@@ skipping 1133 matching lines @@
 }
 
 
 bool BlockEffects::IsSideEffectFreePath(BlockEntryInstr* from,
                                         BlockEntryInstr* to) const {
   return available_at_[to->postorder_number()]->Contains(
       from->postorder_number());
 }
 
 }  // namespace dart