Better typing and type verification

src/compiler/typer.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/graph-inl.h"
 #include "src/compiler/js-operator.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/typer.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-Typer::Typer(Zone* zone) : zone_(zone) {
+
+class Typer::Decorator : public GraphDecorator {
+ public:
+  explicit Decorator(Typer* typer) : typer_(typer) {}
+  virtual void Decorate(Node* node);
+
+ private:
+  Typer* typer_;
+};
+
+
+Typer::Typer(Graph* graph, MaybeHandle<Context> context)
+    : graph_(graph), context_(context), decorator_(NULL) {
+  Zone* zone = this->zone();
   Type* number = Type::Number(zone);
   Type* signed32 = Type::Signed32(zone);
   Type* unsigned32 = Type::Unsigned32(zone);
   Type* integral32 = Type::Integral32(zone);
   Type* object = Type::Object(zone);
   Type* undefined = Type::Undefined(zone);
   number_fun0_ = Type::Function(number, zone);
   number_fun1_ = Type::Function(number, number, zone);
   number_fun2_ = Type::Function(number, number, number, zone);
   imul_fun_ = Type::Function(signed32, integral32, integral32, zone);
@@ skipping 27 matching lines @@
   int16_array_fun_ = Type::Function(int16_array, arg1, arg2, arg3, zone);
   int32_array_fun_ = Type::Function(int32_array, arg1, arg2, arg3, zone);
   uint8_array_fun_ = Type::Function(uint8_array, arg1, arg2, arg3, zone);
   uint16_array_fun_ = Type::Function(uint16_array, arg1, arg2, arg3, zone);
   uint32_array_fun_ = Type::Function(uint32_array, arg1, arg2, arg3, zone);
   float32_array_fun_ = Type::Function(float32_array, arg1, arg2, arg3, zone);
   float64_array_fun_ = Type::Function(float64_array, arg1, arg2, arg3, zone);
 }
 
 
+Typer::~Typer() {
+  if (decorator_) graph_->RemoveDecorator(decorator_);
+}
+
+
 class Typer::Visitor : public NullNodeVisitor {
  public:
-  Visitor(Typer* typer, MaybeHandle<Context> context)
-      : typer_(typer), context_(context) {}
+  explicit Visitor(Typer* typer) : typer_(typer) {}
 
   Bounds TypeNode(Node* node) {
     switch (node->opcode()) {
 #define DECLARE_CASE(x) case IrOpcode::k##x: return Type##x(node);
+      DECLARE_CASE(Start)
       VALUE_OP_LIST(DECLARE_CASE)
 #undef DECLARE_CASE
 
 #define DECLARE_CASE(x) case IrOpcode::k##x:
-      CONTROL_OP_LIST(DECLARE_CASE)
+      DECLARE_CASE(End)
+      INNER_CONTROL_OP_LIST(DECLARE_CASE)
 #undef DECLARE_CASE
       break;
     }
-    return Bounds(Type::None(zone()));
+    UNREACHABLE();
+    return Bounds();
   }
 
   Type* TypeConstant(Handle<Object> value);
 
  protected:
 #define DECLARE_METHOD(x) inline Bounds Type##x(Node* node);
+  DECLARE_METHOD(Start)
   VALUE_OP_LIST(DECLARE_METHOD)
 #undef DECLARE_METHOD
 
-  Bounds OperandType(Node* node, int i) {
-    return NodeProperties::GetBounds(NodeProperties::GetValueInput(node, i));
+  Bounds operand(Node* node, int i) {
+    Node* operand_node = NodeProperties::GetValueInput(node, i);
+    return GetBoundsOrNone(operand_node);
   }
 
-  Type* ContextType(Node* node) {
-    Bounds result =
-        NodeProperties::GetBounds(NodeProperties::GetContextInput(node));
+  Type* context_type(Node* node) {
+    Bounds result = GetBoundsOrNone(NodeProperties::GetContextInput(node));
     DCHECK(result.upper->Is(Type::Internal()));
     DCHECK(result.lower->Equals(result.upper));
     return result.upper;
   }
 
   Zone* zone() { return typer_->zone(); }
   Isolate* isolate() { return typer_->isolate(); }
-  MaybeHandle<Context> context() { return context_; }
+  Graph* graph() { return typer_->graph(); }
+  MaybeHandle<Context> context() { return typer_->context(); }
 
  private:
   Typer* typer_;
-  MaybeHandle<Context> context_;
+
+  Bounds GetBoundsOrNone(Node* node) {
+    return NodeProperties::IsTyped(node)
+        ? NodeProperties::GetBounds(node) : Bounds(Type::None(zone()));
+  }
 };
 
 
 class Typer::RunVisitor : public Typer::Visitor {
  public:
-  RunVisitor(Typer* typer, MaybeHandle<Context> context)
-      : Visitor(typer, context),
+  explicit RunVisitor(Typer* typer)
+      : Visitor(typer),
         phis(NodeSet::key_compare(), NodeSet::allocator_type(typer->zone())) {}
 
-  GenericGraphVisit::Control Pre(Node* node) {
-    return NodeProperties::IsControl(node)
-        && node->opcode() != IrOpcode::kEnd
-        && node->opcode() != IrOpcode::kMerge
-        && node->opcode() != IrOpcode::kReturn
-        ? GenericGraphVisit::SKIP : GenericGraphVisit::CONTINUE;
-  }
-
   GenericGraphVisit::Control Post(Node* node) {
-    Bounds bounds = TypeNode(node);
-    if (node->opcode() == IrOpcode::kPhi) {
+    if (OperatorProperties::HasValueOutput(node->op())) {
+      Bounds bounds = TypeNode(node);
+      NodeProperties::SetBounds(node, bounds);
       // Remember phis for least fixpoint iteration.
-      phis.insert(node);
-    } else {
-      NodeProperties::SetBounds(node, bounds);
+      if (node->opcode() == IrOpcode::kPhi) phis.insert(node);
     }
     return GenericGraphVisit::CONTINUE;
   }
 
   NodeSet phis;
 };
 
 
 class Typer::NarrowVisitor : public Typer::Visitor {
  public:
-  NarrowVisitor(Typer* typer, MaybeHandle<Context> context)
-      : Visitor(typer, context) {}
+  explicit NarrowVisitor(Typer* typer) : Visitor(typer) {}
 
   GenericGraphVisit::Control Pre(Node* node) {
-    Bounds previous = NodeProperties::GetBounds(node);
-    Bounds bounds = TypeNode(node);
-    NodeProperties::SetBounds(node, Bounds::Both(bounds, previous, zone()));
-    DCHECK(bounds.Narrows(previous));
-    // Stop when nothing changed (but allow reentry in case it does later).
-    return previous.Narrows(bounds)
-        ? GenericGraphVisit::DEFER : GenericGraphVisit::REENTER;
+    if (OperatorProperties::HasValueOutput(node->op())) {
+      Bounds previous = NodeProperties::GetBounds(node);
+      Bounds bounds = TypeNode(node);
+      NodeProperties::SetBounds(node, Bounds::Both(bounds, previous, zone()));
+      DCHECK(bounds.Narrows(previous));
+      // Stop when nothing changed (but allow re-entry in case it does later).
+      return previous.Narrows(bounds)
+          ? GenericGraphVisit::DEFER : GenericGraphVisit::REENTER;
+    } else {
+      return GenericGraphVisit::SKIP;
+    }
   }
 
   GenericGraphVisit::Control Post(Node* node) {
     return GenericGraphVisit::REENTER;
   }
 };
 
 
 class Typer::WidenVisitor : public Typer::Visitor {
  public:
-  WidenVisitor(Typer* typer, MaybeHandle<Context> context)
-      : Visitor(typer, context) {}
+  explicit WidenVisitor(Typer* typer) : Visitor(typer) {}
 
   GenericGraphVisit::Control Pre(Node* node) {
-    Bounds previous = NodeProperties::GetBounds(node);
-    Bounds bounds = TypeNode(node);
-    DCHECK(previous.lower->Is(bounds.lower));
-    DCHECK(previous.upper->Is(bounds.upper));
-    NodeProperties::SetBounds(node, bounds);  // TODO(rossberg): Either?
-    // Stop when nothing changed (but allow reentry in case it does later).
-    return bounds.Narrows(previous)
-        ? GenericGraphVisit::DEFER : GenericGraphVisit::REENTER;
+    if (OperatorProperties::HasValueOutput(node->op())) {
+      Bounds previous = NodeProperties::GetBounds(node);
+      Bounds bounds = TypeNode(node);
+      DCHECK(previous.lower->Is(bounds.lower));
+      DCHECK(previous.upper->Is(bounds.upper));
+      NodeProperties::SetBounds(node, bounds);  // TODO(rossberg): Either?
+      // Stop when nothing changed (but allow re-entry in case it does later).
+      return bounds.Narrows(previous)
+          ? GenericGraphVisit::DEFER : GenericGraphVisit::REENTER;
+    } else {
+      return GenericGraphVisit::SKIP;
+    }
   }
 
   GenericGraphVisit::Control Post(Node* node) {
     return GenericGraphVisit::REENTER;
   }
 };
 
 
-void Typer::Run(Graph* graph, MaybeHandle<Context> context) {
-  RunVisitor typing(this, context);
-  graph->VisitNodeInputsFromEnd(&typing);
+void Typer::Run() {
+  RunVisitor typing(this);
+  graph_->VisitNodeInputsFromEnd(&typing);
   // Find least fixpoint.
-  for (NodeSetIter i = typing.phis.begin(); i != typing.phis.end(); ++i) {
-    Widen(graph, *i, context);
+  WidenVisitor widen(this);
+  for (NodeSetIter it = typing.phis.begin(); it != typing.phis.end(); ++it) {
+    graph_->VisitNodeUsesFrom(*it, &widen);
+  }
+
+  DCHECK(decorator_ == NULL);
+  decorator_ = new (zone()) Decorator(this);
+  graph_->AddDecorator(decorator_);
+}
+
+
+void Typer::Narrow(Node* start) {
+  NarrowVisitor typing(this);
+  graph_->VisitNodeUsesFrom(start, &typing);
+}
+
+
+void Typer::Decorator::Decorate(Node* node) {
+  if (OperatorProperties::HasValueOutput(node->op())) {
+    Visitor typing(typer_);
+    Bounds bounds = typing.TypeNode(node);
+    NodeProperties::SetBounds(node, bounds);
   }
 }
 
 
-void Typer::Narrow(Graph* graph, Node* start, MaybeHandle<Context> context) {
-  NarrowVisitor typing(this, context);
-  graph->VisitNodeUsesFrom(start, &typing);
-}
+// -----------------------------------------------------------------------------
 
+// Control operators.
 
-void Typer::Widen(Graph* graph, Node* start, MaybeHandle<Context> context) {
-  WidenVisitor typing(this, context);
-  graph->VisitNodeUsesFrom(start, &typing);
-}
-
-
-void Typer::Init(Node* node) {
-  Visitor typing(this, MaybeHandle<Context>());
-  Bounds bounds = typing.TypeNode(node);
-  NodeProperties::SetBounds(node, bounds);
+Bounds Typer::Visitor::TypeStart(Node* node) {
+  return Bounds(Type::Internal(zone()));
 }
 
 
 // Common operators.
+
 Bounds Typer::Visitor::TypeParameter(Node* node) {
   return Bounds::Unbounded(zone());
 }
 
 
 Bounds Typer::Visitor::TypeInt32Constant(Node* node) {
   // TODO(titzer): only call Type::Of() if the type is not already known.
   return Bounds(Type::Of(ValueOf<int32_t>(node->op()), zone()));
 }
 
@@ skipping 22 matching lines @@
 }
 
 
 Bounds Typer::Visitor::TypeExternalConstant(Node* node) {
   return Bounds(Type::Internal(zone()));
 }
 
 
 Bounds Typer::Visitor::TypePhi(Node* node) {
   int arity = OperatorProperties::GetValueInputCount(node->op());
-  Bounds bounds = OperandType(node, 0);
+  Bounds bounds = operand(node, 0);
   for (int i = 1; i < arity; ++i) {
-    bounds = Bounds::Either(bounds, OperandType(node, i), zone());
+    bounds = Bounds::Either(bounds, operand(node, i), zone());
   }
   return bounds;
 }
 
 
 Bounds Typer::Visitor::TypeEffectPhi(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeControlEffect(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeValueEffect(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
-Bounds Typer::Visitor::TypeFinish(Node* node) { return OperandType(node, 0); }
+Bounds Typer::Visitor::TypeFinish(Node* node) {
+  return operand(node, 0);
+}
 
 
 Bounds Typer::Visitor::TypeFrameState(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeStateValues(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeCall(Node* node) {
   return Bounds::Unbounded(zone());
 }
 
 
 Bounds Typer::Visitor::TypeProjection(Node* node) {
   // TODO(titzer): use the output type of the input to determine the bounds.
   return Bounds::Unbounded(zone());
 }
 
 
 // JS comparison operators.
 
 #define DEFINE_METHOD(x)                       \
   Bounds Typer::Visitor::Type##x(Node* node) { \
     return Bounds(Type::Boolean(zone()));      \
   }
 JS_COMPARE_BINOP_LIST(DEFINE_METHOD)
 #undef DEFINE_METHOD
 
 
 // JS bitwise operators.
 
 Bounds Typer::Visitor::TypeJSBitwiseOr(Node* node) {
-  Bounds left = OperandType(node, 0);
-  Bounds right = OperandType(node, 1);
+  Bounds left = operand(node, 0);
+  Bounds right = operand(node, 1);
   Type* upper = Type::Union(left.upper, right.upper, zone());
   if (!upper->Is(Type::Signed32())) upper = Type::Signed32(zone());
   Type* lower = Type::Intersect(Type::SignedSmall(zone()), upper, zone());
   return Bounds(lower, upper);
 }
 
 
 Bounds Typer::Visitor::TypeJSBitwiseAnd(Node* node) {
-  Bounds left = OperandType(node, 0);
-  Bounds right = OperandType(node, 1);
+  Bounds left = operand(node, 0);
+  Bounds right = operand(node, 1);
   Type* upper = Type::Union(left.upper, right.upper, zone());
   if (!upper->Is(Type::Signed32())) upper = Type::Signed32(zone());
   Type* lower = Type::Intersect(Type::SignedSmall(zone()), upper, zone());
   return Bounds(lower, upper);
 }
 
 
 Bounds Typer::Visitor::TypeJSBitwiseXor(Node* node) {
   return Bounds(Type::SignedSmall(zone()), Type::Signed32(zone()));
 }
@@ skipping 10 matching lines @@
 
 
 Bounds Typer::Visitor::TypeJSShiftRightLogical(Node* node) {
   return Bounds(Type::UnsignedSmall(zone()), Type::Unsigned32(zone()));
 }
 
 
 // JS arithmetic operators.
 
 Bounds Typer::Visitor::TypeJSAdd(Node* node) {
-  Bounds left = OperandType(node, 0);
-  Bounds right = OperandType(node, 1);
+  Bounds left = operand(node, 0);
+  Bounds right = operand(node, 1);
   Type* lower =
       left.lower->Is(Type::None()) || right.lower->Is(Type::None()) ?
           Type::None(zone()) :
       left.lower->Is(Type::Number()) && right.lower->Is(Type::Number()) ?
           Type::SignedSmall(zone()) :
       left.lower->Is(Type::String()) || right.lower->Is(Type::String()) ?
           Type::String(zone()) : Type::None(zone());
   Type* upper =
       left.upper->Is(Type::None()) && right.upper->Is(Type::None()) ?
           Type::None(zone()) :
@@ skipping 53 matching lines @@
   return Bounds(Type::None(zone()), Type::String(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSToName(Node* node) {
   return Bounds(Type::None(zone()), Type::Name(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSToObject(Node* node) {
-  return Bounds(Type::None(zone()), Type::Object(zone()));
+  return Bounds(Type::None(zone()), Type::Receiver(zone()));
 }
 
 
 // JS object operators.
 
 Bounds Typer::Visitor::TypeJSCreate(Node* node) {
   return Bounds(Type::None(zone()), Type::Object(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSLoadProperty(Node* node) {
-  Bounds object = OperandType(node, 0);
-  Bounds name = OperandType(node, 1);
+  Bounds object = operand(node, 0);
+  Bounds name = operand(node, 1);
   Bounds result = Bounds::Unbounded(zone());
   // TODO(rossberg): Use range types and sized array types to filter undefined.
   if (object.lower->IsArray() && name.lower->Is(Type::Integral32())) {
     result.lower = Type::Union(
         object.lower->AsArray()->Element(), Type::Undefined(zone()), zone());
   }
   if (object.upper->IsArray() && name.upper->Is(Type::Integral32())) {
     result.upper = Type::Union(
         object.upper->AsArray()->Element(),  Type::Undefined(zone()), zone());
   }
   return result;
 }
 
 
 Bounds Typer::Visitor::TypeJSLoadNamed(Node* node) {
   return Bounds::Unbounded(zone());
 }
 
 
 Bounds Typer::Visitor::TypeJSStoreProperty(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeJSStoreNamed(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeJSDeleteProperty(Node* node) {
   return Bounds(Type::Boolean(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSHasProperty(Node* node) {
   return Bounds(Type::Boolean(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSInstanceOf(Node* node) {
   return Bounds(Type::Boolean(zone()));
 }
 
 
 // JS context operators.
 
 Bounds Typer::Visitor::TypeJSLoadContext(Node* node) {
-  Bounds outer = OperandType(node, 0);
-  DCHECK(outer.upper->Is(Type::Internal()));
-  DCHECK(outer.lower->Equals(outer.upper));
+  Bounds outer = operand(node, 0);
+  DCHECK(outer.upper->Maybe(Type::Internal()));
+  // TODO(rossberg): More precisely, instead of the above assertion, we should
+  // back-propagate the constraint that it has to be a subtype of Internal.
+
   ContextAccess access = OpParameter<ContextAccess>(node);
   Type* context_type = outer.upper;
   MaybeHandle<Context> context;
   if (context_type->IsConstant()) {
     context = Handle<Context>::cast(context_type->AsConstant()->Value());
   }
   // Walk context chain (as far as known), mirroring dynamic lookup.
   // Since contexts are mutable, the information is only useful as a lower
   // bound.
   // TODO(rossberg): Could use scope info to fix upper bounds for constant
@@ skipping 13 matching lines @@
   } else {
     Handle<Object> value =
         handle(context.ToHandleChecked()->get(access.index()), isolate());
     Type* lower = TypeConstant(value);
     return Bounds(lower, Type::Any(zone()));
   }
 }
 
 
 Bounds Typer::Visitor::TypeJSStoreContext(Node* node) {
-  return Bounds(Type::None(zone()));
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateFunctionContext(Node* node) {
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateCatchContext(Node* node) {
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateWithContext(Node* node) {
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateBlockContext(Node* node) {
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateModuleContext(Node* node) {
   // TODO(rossberg): this is probably incorrect
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCreateGlobalContext(Node* node) {
-  Type* outer = ContextType(node);
+  Type* outer = context_type(node);
   return Bounds(Type::Context(outer, zone()));
 }
 
 
 // JS other operators.
 
 Bounds Typer::Visitor::TypeJSYield(Node* node) {
   return Bounds::Unbounded(zone());
 }
 
 
 Bounds Typer::Visitor::TypeJSCallConstruct(Node* node) {
   return Bounds(Type::None(zone()), Type::Receiver(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeJSCallFunction(Node* node) {
-  Bounds fun = OperandType(node, 0);
+  Bounds fun = operand(node, 0);
   Type* lower = fun.lower->IsFunction()
       ? fun.lower->AsFunction()->Result() : Type::None(zone());
   Type* upper = fun.upper->IsFunction()
       ? fun.upper->AsFunction()->Result() : Type::Any(zone());
   return Bounds(lower, upper);
 }
 
 
 Bounds Typer::Visitor::TypeJSCallRuntime(Node* node) {
   return Bounds::Unbounded(zone());
@@ skipping 46 matching lines @@
   return Bounds(Type::Number(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeNumberModulus(Node* node) {
   return Bounds(Type::Number(zone()));
 }
 
 
 Bounds Typer::Visitor::TypeNumberToInt32(Node* node) {
-  Bounds arg = OperandType(node, 0);
+  Bounds arg = operand(node, 0);
   Type* s32 = Type::Signed32(zone());
   Type* lower = arg.lower->Is(s32) ? arg.lower : s32;
   Type* upper = arg.upper->Is(s32) ? arg.upper : s32;
   return Bounds(lower, upper);
 }
 
 
 Bounds Typer::Visitor::TypeNumberToUint32(Node* node) {
-  Bounds arg = OperandType(node, 0);
+  Bounds arg = operand(node, 0);
   Type* u32 = Type::Unsigned32(zone());
   Type* lower = arg.lower->Is(u32) ? arg.lower : u32;
   Type* upper = arg.upper->Is(u32) ? arg.upper : u32;
   return Bounds(lower, upper);
 }
 
 
 Bounds Typer::Visitor::TypeReferenceEqual(Node* node) {
   return Bounds(Type::Boolean(zone()));
 }
@@ skipping 70 matching lines @@
   return Bounds(FieldAccessOf(node->op()).type);
 }
 
 
 Bounds Typer::Visitor::TypeLoadElement(Node* node) {
   return Bounds(ElementAccessOf(node->op()).type);
 }
 
 
 Bounds Typer::Visitor::TypeStoreField(Node* node) {
-  return Bounds(Type::None());
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 Bounds Typer::Visitor::TypeStoreElement(Node* node) {
-  return Bounds(Type::None());
+  UNREACHABLE();
+  return Bounds();
 }
 
 
 // Machine operators.
 
 // TODO(rossberg): implement
 #define DEFINE_METHOD(x) \
     Bounds Typer::Visitor::Type##x(Node* node) { return Bounds(Type::None()); }
 MACHINE_OP_LIST(DEFINE_METHOD)
 #undef DEFINE_METHOD
@@ skipping 56 matching lines @@
       return typer_->uint32_array_fun_;
     } else if (*value == native->float32_array_fun()) {
       return typer_->float32_array_fun_;
     } else if (*value == native->float64_array_fun()) {
       return typer_->float64_array_fun_;
     }
   }
   return Type::Constant(value, zone());
 }
 
-
-namespace {
-
-class TyperDecorator : public GraphDecorator {
- public:
-  explicit TyperDecorator(Typer* typer) : typer_(typer) {}
-  virtual void Decorate(Node* node) { typer_->Init(node); }
-
- private:
-  Typer* typer_;
-};
-
-}
-
-
-void Typer::DecorateGraph(Graph* graph) {
-  graph->AddDecorator(new (zone()) TyperDecorator(this));
-}
-
 }
 }
 }  // namespace v8::internal::compiler