Change comparison-to-branch fusion to actually remove comparison from the graph.

runtime/vm/flow_graph_compiler.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/globals.h"  // Needed here to get TARGET_ARCH_XXX.
 
 #include "vm/flow_graph_compiler.h"
 
 #include "vm/dart_entry.h"
 #include "vm/debugger.h"
@@ skipping 533 matching lines @@
         reg = AllocateFreeRegister(blocked_registers);
       }
       locs->set_in(i, Location::RegisterLocation(reg));
     }
 
     Pop(reg, instr->InputAt(i));
   }
 
   // If this instruction is call spill everything that was not consumed by
   // input locations.
-  if (locs->is_call() || locs->is_branch()) {
+  if (locs->is_call() || instr->IsBranch()) {
     Spill();
   }
 
   // Allocate all unallocated temp locations.
   for (intptr_t i = 0; i < locs->temp_count(); i++) {
     Location loc = locs->temp(i);
     if (loc.kind() == Location::kUnallocated) {
       ASSERT(loc.policy() == Location::kRequiresRegister);
       loc = Location::RegisterLocation(
         AllocateFreeRegister(blocked_registers));
@@ skipping 58 matching lines @@
 
 
 void FrameRegisterAllocator::SpillInDeoptStub(DeoptimizationStub* stub) {
   for (int i = 0; i < stack_.length(); i++) {
     stub->Push(stack_[i]);
   }
 }
 
 
 }  // namespace dart