Re-apply r20377.

runtime/vm/flow_graph_optimizer.cc

 // 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.
 
 #include "vm/flow_graph_optimizer.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cha.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/flow_graph_compiler.h"
@@ skipping 3353 matching lines @@
         } else {
           // TODO(vegorov): this can be optimized for the case of a single
           // predecessor.
           // TODO(vegorov): this can be reordered to reduce amount of operations
           // temp->CopyFrom(first_predecessor)
           temp->SetAll();
           ASSERT(block->PredecessorCount() > 0);
           for (intptr_t i = 0; i < block->PredecessorCount(); i++) {
             BlockEntryInstr* pred = block->PredecessorAt(i);
             BitVector* pred_out = out_[pred->preorder_number()];
-            temp->Intersect(*pred_out);
+            temp->Intersect(pred_out);
           }
         }
 
         if (!temp->Equals(*block_in)) {
           // If IN set has changed propagate the change to OUT set.
           block_in->CopyFrom(temp);
           if (block_out->KillAndAdd(block_kill, block_in)) {
             // If OUT set has changed then we have new values available out of
             // the block. Compute these values creating phi where necessary.
             for (BitVector::Iterator it(block_out);
@@ skipping 1631 matching lines @@
   if (changed) {
     // We may have changed the block order and the dominator tree.
     flow_graph->DiscoverBlocks();
     GrowableArray<BitVector*> dominance_frontier;
     flow_graph->ComputeDominators(&dominance_frontier);
   }
 }
 
 
 }  // namespace dart