Correctly clone comparisons in branch optimizations of Dart VM.

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/dart_entry.h"
 #include "vm/flow_graph_builder.h"
@@ skipping 6950 matching lines @@
                                             right);
   } else if (comparison->IsEqualityCompare()) {
     EqualityCompareInstr* equality_compare = comparison->AsEqualityCompare();
     EqualityCompareInstr* new_equality_compare =
         new EqualityCompareInstr(equality_compare->token_pos(),
                                  comparison->kind(),
                                  left,
                                  right,
                                  Object::null_array());
     new_equality_compare->set_ic_data(equality_compare->ic_data());
+    new_equality_compare->set_operation_cid(equality_compare->operation_cid());
     new_comparison = new_equality_compare;
   } else {
     ASSERT(comparison->IsRelationalOp());
     RelationalOpInstr* relational_op = comparison->AsRelationalOp();
     RelationalOpInstr* new_relational_op =
         new RelationalOpInstr(relational_op->token_pos(),
                               comparison->kind(),
                               left,
                               right,
                               Object::null_array());
     new_relational_op->set_ic_data(relational_op->ic_data());
+    new_relational_op->set_operation_cid(relational_op->operation_cid());
     new_comparison = new_relational_op;
   }
   return new BranchInstr(new_comparison, branch->is_checked());
 }
 
 
 void BranchSimplifier::Simplify(FlowGraph* flow_graph) {
   // Optimize some branches that test the value of a phi.  When it is safe
   // to do so, push the branch to each of the predecessor blocks.  This is
   // an optimization when (a) it can avoid materializing a boolean object at
@@ skipping 512 matching lines @@
   }
 
   // Insert materializations at environment uses.
   for (intptr_t i = 0; i < exits.length(); i++) {
     CreateMaterializationAt(exits[i], alloc, alloc->cls(), *fields);
   }
 }
 
 
 }  // namespace dart