Extend Range analysis to 64-bit range and mint operations

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/cpu.h"
 #include "vm/dart_entry.h"
@@ skipping 4952 matching lines @@
   }
 }
 
 
 RangeAnalysis::Direction RangeAnalysis::ToDirection(Value* val) {
   if (val->BindsToConstant()) {
     return (Smi::Cast(val->BoundConstant()).Value() >= 0) ? kPositive
                                                           : kNegative;
   } else if (val->definition()->range() != NULL) {
     Range* range = val->definition()->range();
-    if (Range::ConstantMin(range).value() >= 0) {
+    if (Range::ConstantMin(range).ConstantValue() >= 0) {
       return kPositive;
-    } else if (Range::ConstantMax(range).value() <= 0) {
+    } else if (Range::ConstantMax(range).ConstantValue() <= 0) {
       return kNegative;
     }
   }
   return kUnknown;
 }
 
 
 Range* RangeAnalysis::InferInductionVariableRange(JoinEntryInstr* loop_header,
                                                   PhiInstr* var) {
   BitVector* loop_info = loop_header->loop_info();
@@ skipping 4867 matching lines @@
   }
 
   // Insert materializations at environment uses.
   for (intptr_t i = 0; i < exits.length(); i++) {
     CreateMaterializationAt(exits[i], alloc, alloc->cls(), *slots);
   }
 }
 
 
 }  // namespace dart