[turbofan] Drop broken StaticParameterTraits.

src/compiler/js-graph.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/js-graph.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/typer.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-Node* JSGraph::ImmovableHeapConstant(Handle<Object> object) {
-  Unique<Object> unique = Unique<Object>::CreateImmovable(object);
+Node* JSGraph::ImmovableHeapConstant(Handle<HeapObject> object) {
+  Unique<HeapObject> unique = Unique<HeapObject>::CreateImmovable(object);
   return NewNode(common()->HeapConstant(unique));
 }
 
 
 Node* JSGraph::NewNode(const Operator* op) {
   Node* node = graph()->NewNode(op);
   typer_->Init(node);
   return node;
 }
 
@@ skipping 61 matching lines @@
 
 
 Node* JSGraph::NaNConstant() {
   if (!nan_constant_.is_set()) {
     nan_constant_.set(NumberConstant(base::OS::nan_value()));
   }
   return nan_constant_.get();
 }
 
 
-Node* JSGraph::HeapConstant(Unique<Object> value) {
+Node* JSGraph::HeapConstant(Unique<HeapObject> value) {
   // TODO(turbofan): canonicalize heap constants using Unique<T>
   return NewNode(common()->HeapConstant(value));
 }
 
 
-Node* JSGraph::HeapConstant(Handle<Object> value) {
+Node* JSGraph::HeapConstant(Handle<HeapObject> value) {
   // TODO(titzer): We could also match against the addresses of immortable
   // immovables here, even without access to the heap, thus always
   // canonicalizing references to them.
   // return HeapConstant(Unique<Object>::CreateUninitialized(value));
   // TODO(turbofan): This is a work-around to make Unique::HashCode() work for
   // value numbering. We need some sane way to compute a unique hash code for
   // arbitrary handles here.
-  Unique<Object> unique(reinterpret_cast<Address>(*value.location()), value);
+  Unique<HeapObject> unique(reinterpret_cast<Address>(*value.location()),
+                            value);
   return HeapConstant(unique);
 }
 
 
 Node* JSGraph::Constant(Handle<Object> value) {
   // Dereference the handle to determine if a number constant or other
   // canonicalized node can be used.
   if (value->IsNumber()) {
     return Constant(value->Number());
   } else if (value->IsUndefined()) {
     return UndefinedConstant();
   } else if (value->IsTrue()) {
     return TrueConstant();
   } else if (value->IsFalse()) {
     return FalseConstant();
   } else if (value->IsNull()) {
     return NullConstant();
   } else if (value->IsTheHole()) {
     return TheHoleConstant();
   } else {
-    return HeapConstant(value);
+    return HeapConstant(Handle<HeapObject>::cast(value));
   }
 }
 
 
 Node* JSGraph::Constant(double value) {
   if (bit_cast<int64_t>(value) == bit_cast<int64_t>(0.0)) return ZeroConstant();
   if (bit_cast<int64_t>(value) == bit_cast<int64_t>(1.0)) return OneConstant();
   return NumberConstant(value);
 }
 
@@ skipping 41 matching lines @@
 Node* JSGraph::ExternalConstant(ExternalReference reference) {
   Node** loc = cache_.FindExternalConstant(reference);
   if (*loc == NULL) {
     *loc = NewNode(common()->ExternalConstant(reference));
   }
   return *loc;
 }
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8