[turbofan] Introduce PlainPrimitiveToNumber.

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 {
 
 #define CACHED(name, expr) \
   cached_nodes_[name] ? cached_nodes_[name] : (cached_nodes_[name] = (expr))
 
 Node* JSGraph::AllocateInNewSpaceStubConstant() {
   return CACHED(kAllocateInNewSpaceStubConstant,
                 HeapConstant(isolate()->builtins()->AllocateInNewSpace()));
 }
 
 Node* JSGraph::AllocateInOldSpaceStubConstant() {
   return CACHED(kAllocateInOldSpaceStubConstant,
                 HeapConstant(isolate()->builtins()->AllocateInOldSpace()));
 }
 
+Node* JSGraph::ToNumberBuiltinConstant() {
+  return CACHED(kToNumberBuiltinConstant,
+                HeapConstant(isolate()->builtins()->ToNumber()));
+}
+
 Node* JSGraph::CEntryStubConstant(int result_size) {
   if (result_size == 1) {
     return CACHED(kCEntryStubConstant,
                   HeapConstant(CEntryStub(isolate(), 1).GetCode()));
   }
   return HeapConstant(CEntryStub(isolate(), result_size).GetCode());
 }
 
 
 Node* JSGraph::EmptyFixedArrayConstant() {
@@ skipping 202 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