Last cleanup int -> intptr_t. Also removed a hack.

runtime/vm/block_scheduler.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/block_scheduler.h"
 
 #include "vm/allocation.h"
 #include "vm/code_patcher.h"
 #include "vm/flow_graph.h"
 
@@ skipping 90 matching lines @@
   explicit Chain(BlockEntryInstr* block)
       : first(new Link(block, NULL)), last(first), length(1) { }
 
   Link* first;
   Link* last;
   intptr_t length;
 };
 
 
 int Edge::LowestWeightFirst(const Edge* a, const Edge* b) {
-  return (a->weight < b->weight) ? -1 : (a->weight > b->weight);
+  if (a->weight < b->weight) {
+    return -1;
+  }
+  return (a->weight > b->weight) ? 1 : 0;
 }
 
 
 // Combine two chains by adding the shorter chain's links to the longer
 // chain.
 static void Union(GrowableArray<Chain*>* chains,
                   Chain* source_chain,
                   Chain* target_chain) {
   if (source_chain->length < target_chain->length) {
     for (Link* link = source_chain->first; link != NULL; link = link->next) {
@@ skipping 71 matching lines @@
   for (intptr_t i = block_count - 1; i >= 0; --i) {
     if (chains[i]->first->block == flow_graph()->postorder()[i]) {
       for (Link* link = chains[i]->first; link != NULL; link = link->next) {
         flow_graph()->CodegenBlockOrder(true)->Add(link->block);
       }
     }
   }
 }
 
 }  // namespace dart