Implement range analysis for smi values.

runtime/vm/il_printer.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/il_printer.h"
 
 #include "vm/intermediate_language.h"
 #include "vm/os.h"
 #include "vm/parser.h"
 
@@ skipping 165 matching lines @@
 
 void Definition::PrintTo(BufferFormatter* f) const {
   PrintUse(f, *this);
   if (is_used()) {
     if (HasSSATemp() || (temp_index() != -1)) f->Print(" <- ");
   }
   f->Print("%s:%"Pd"(", DebugName(), GetDeoptId());
   PrintOperandsTo(f);
   f->Print(")");
   PrintPropagatedType(f, *this);
+  if (range_ != NULL) {
+    f->Print(" ");
+    range_->PrintTo(f);
+  }
 }
 
 
 void Definition::PrintOperandsTo(BufferFormatter* f) const {
   for (int i = 0; i < InputCount(); ++i) {
     if (i > 0) f->Print(", ");
     if (InputAt(i) != NULL) InputAt(i)->PrintTo(f);
   }
 }
 
 
 void Definition::PrintToVisualizer(BufferFormatter* f) const {
   PrintTo(f);
 }
 
 
 void Value::PrintTo(BufferFormatter* f) const {
   PrintUse(f, *definition());
 }
 
 
 void ConstantInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("#%s", value().ToCString());
 }
 
 
+void ConstraintInstr::PrintOperandsTo(BufferFormatter* f) const {
+  value()->PrintTo(f);
+  f->Print(" ^ ");
+  constraint()->PrintTo(f);
+}
+
+
+void Range::PrintTo(BufferFormatter* f) const {
+  f->Print("[");
+  min_.PrintTo(f);
+  f->Print(", ");
+  max_.PrintTo(f);
+  f->Print("]");
+}
+
+
+void RangeBoundary::PrintTo(BufferFormatter* f) const {
+  switch (kind_) {
+    case kSymbol:
+      f->Print("v%"Pd, reinterpret_cast<Definition*>(value_)->ssa_temp_index());
+      if (offset_ != 0) f->Print("%+"Pd, offset_);
+      break;
+    case kConstant:
+      f->Print("%"Pd, value_);
+      break;
+    case kUnknown:
+      f->Print("_|_");
+      break;
+  }
+}
+
+
 void AssertAssignableInstr::PrintOperandsTo(BufferFormatter* f) const {
   value()->PrintTo(f);
   f->Print(", %s, '%s'%s",
            String::Handle(dst_type().Name()).ToCString(),
            dst_name().ToCString(),
            is_eliminated() ? " eliminated" : "");
   f->Print(" instantiator(");
   instantiator()->PrintTo(f);
   f->Print(")");
   f->Print(" instantiator_type_arguments(");
@@ skipping 200 matching lines @@
 }
 
 
 void CatchEntryInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("%s, %s",
            exception_var().name().ToCString(),
            stacktrace_var().name().ToCString());
 }
 
 
+void BinarySmiOpInstr::PrintTo(BufferFormatter* f) const {
+  Definition::PrintTo(f);
+  f->Print(" %co", overflow_ ? '+' : '-');
+}
+
 void BinarySmiOpInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("%s, ", Token::Str(op_kind()));
   left()->PrintTo(f);
   f->Print(", ");
   right()->PrintTo(f);
 }
 
 
 void BinaryMintOpInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("%s, ", Token::Str(op_kind()));
@@ skipping 57 matching lines @@
 
 
 void PhiInstr::PrintTo(BufferFormatter* f) const {
   f->Print("v%"Pd" <- phi(", ssa_temp_index());
   for (intptr_t i = 0; i < inputs_.length(); ++i) {
     if (inputs_[i] != NULL) inputs_[i]->PrintTo(f);
     if (i < inputs_.length() - 1) f->Print(", ");
   }
   f->Print(")");
   PrintPropagatedType(f, *this);
+  if (range_ != NULL) {
+    f->Print(" ");
+    range_->PrintTo(f);
+  }
 }
 
 
 void ParameterInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("%"Pd, index());
 }
 
 
 void TargetEntryInstr::PrintTo(BufferFormatter* f) const {
   f->Print("B%"Pd"[target", block_id());
@@ skipping 267 matching lines @@
       f->Print(" [");
       locations_[i].PrintTo(f);
       f->Print("]");
     }
   }
   f->Print(" }");
   if (outer_ != NULL) outer_->PrintTo(f);
 }
 
 }  // namespace dart