[turbofan] Add support for relevant ES6 type conversion intrinsics.

test/cctest/compiler/test-js-typed-lowering.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.
 
 // TODO(jochen): Remove this after the setting is turned on globally.
 #define V8_IMMINENT_DEPRECATION_WARNINGS
 
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/machine-operator.h"
@@ skipping 526 matching lines @@
     R.CheckHandle(R.isolate->factory()->undefined_string(), r);
   }
 
   {  // ToString(null) => "null"
     Node* r = R.ReduceUnop(op, Type::Null());
     R.CheckHandle(R.isolate->factory()->null_string(), r);
   }
 
   {  // ToString(boolean)
     Node* r = R.ReduceUnop(op, Type::Boolean());
-    // TODO(titzer): could be a branch
-    CHECK_EQ(IrOpcode::kJSToString, r->opcode());
+    CHECK_EQ(IrOpcode::kSelect, r->opcode());
   }
 
   {  // ToString(number)
     Node* r = R.ReduceUnop(op, Type::Number());
     // TODO(titzer): could remove effects
     CHECK_EQ(IrOpcode::kJSToString, r->opcode());
   }
 
   {  // ToString(string)
     Node* r = R.ReduceUnop(op, Type::String());
     CHECK_EQ(IrOpcode::kParameter, r->opcode());  // No-op
   }
 
   {  // ToString(object)
     Node* r = R.ReduceUnop(op, Type::Object());
     CHECK_EQ(IrOpcode::kJSToString, r->opcode());  // No reduction.
   }
 }
 
 
 TEST(JSToString_replacement) {
   JSTypedLoweringTester R;
 
   Type* types[] = {Type::Null(), Type::Undefined(), Type::String()};
 
   for (size_t i = 0; i < arraysize(types); i++) {
     Node* n = R.Parameter(types[i]);
-    Node* c = R.graph.NewNode(R.javascript.ToString(), n, R.context(),
-                              R.start(), R.start());
+    Node* c =
+        R.graph.NewNode(R.javascript.ToString(), n, R.context(),
+                        R.EmptyFrameState(R.context()), R.start(), R.start());
     Node* effect_use = R.UseForEffect(c);
     Node* add = R.graph.NewNode(R.simplified.ReferenceEqual(Type::Any()), n, c);
 
     R.CheckEffectInput(c, effect_use);
     Node* r = R.reduce(c);
 
     if (types[i]->Is(Type::String())) {
       CHECK_EQ(n, r);
     } else {
       CHECK_EQ(IrOpcode::kHeapConstant, r->opcode());
@@ skipping 672 matching lines @@
           CHECK_EQ(p1, r->InputAt(1));
         }
       }
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8