Revert of [turbofan] Initial support for monomorphic/polymorphic property loads.

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/code-stubs.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/typer.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-Node* JSGraph::ImmovableHeapConstant(Handle<HeapObject> value) {
-  if (value->IsConsString()) {
-    value = String::Flatten(Handle<String>::cast(value), TENURED);
-  }
-  return graph()->NewNode(common()->HeapConstant(value));
+Node* JSGraph::ImmovableHeapConstant(Handle<HeapObject> object) {
+  return graph()->NewNode(common()->HeapConstant(object));
 }
 
 
 #define CACHED(name, expr) \
   cached_nodes_[name] ? cached_nodes_[name] : (cached_nodes_[name] = (expr))
 
 
 Node* JSGraph::CEntryStubConstant(int result_size) {
   if (result_size == 1) {
     return CACHED(kCEntryStubConstant,
@@ skipping 45 matching lines @@
   return CACHED(kNaNConstant,
                 NumberConstant(std::numeric_limits<double>::quiet_NaN()));
 }
 
 
 Node* JSGraph::HeapConstant(Handle<HeapObject> value) {
   // TODO(turbofan): canonicalize heap constants using <magic approach>.
   // 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 ImmovableHeapConstant(value);
+  return graph()->NewNode(common()->HeapConstant(value));
 }
 
 
 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();
@@ skipping 109 matching lines @@
   for (size_t i = 0; i < arraysize(cached_nodes_); i++) {
     if (Node* node = cached_nodes_[i]) {
       if (!node->IsDead()) nodes->push_back(node);
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8