[turbofan] Optimize typeof in abstract/strict equality comparison.

src/compiler/change-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.
 
 #include "src/compiler/change-lowering.h"
 
 #include "src/address-map.h"
 #include "src/code-factory.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/linkage.h"
@@ skipping 31 matching lines @@
     case IrOpcode::kLoadField:
       return LoadField(node);
     case IrOpcode::kStoreField:
       return StoreField(node);
     case IrOpcode::kLoadElement:
       return LoadElement(node);
     case IrOpcode::kStoreElement:
       return StoreElement(node);
     case IrOpcode::kAllocate:
       return Allocate(node);
+    case IrOpcode::kObjectIsCallable:
+      return ObjectIsCallable(node);
     case IrOpcode::kObjectIsNumber:
       return ObjectIsNumber(node);
     case IrOpcode::kObjectIsReceiver:
       return ObjectIsReceiver(node);
     case IrOpcode::kObjectIsSmi:
       return ObjectIsSmi(node);
     case IrOpcode::kObjectIsString:
       return ObjectIsString(node);
     case IrOpcode::kObjectIsUndetectable:
       return ObjectIsUndetectable(node);
@@ skipping 583 matching lines @@
       graph()->start(), graph()->start());
 }
 
 Node* ChangeLowering::LoadMapInstanceType(Node* map) {
   return graph()->NewNode(
       machine()->Load(MachineType::Uint8()), map,
       jsgraph()->IntPtrConstant(Map::kInstanceTypeOffset - kHeapObjectTag),
       graph()->start(), graph()->start());
 }
 
+Reduction ChangeLowering::ObjectIsCallable(Node* node) {
+  Node* input = NodeProperties::GetValueInput(node, 0);
+  // TODO(bmeurer): Optimize somewhat based on input type.
+  Node* check = IsSmi(input);
+  Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
+  Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
+  Node* vtrue = jsgraph()->Int32Constant(0);
+  Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
+  Node* vfalse = graph()->NewNode(
+      machine()->Word32Equal(),
+      jsgraph()->Uint32Constant(1 << Map::kIsCallable),
+      graph()->NewNode(machine()->Word32And(),
+                       LoadMapBitField(LoadHeapObjectMap(input, if_false)),
+                       jsgraph()->Uint32Constant((1 << Map::kIsCallable) |
+                                                 (1 << Map::kIsUndetectable))));
+  Node* control = graph()->NewNode(common()->Merge(2), if_true, if_false);
+  node->ReplaceInput(0, vtrue);
+  node->AppendInput(graph()->zone(), vfalse);
+  node->AppendInput(graph()->zone(), control);
+  NodeProperties::ChangeOp(node, common()->Phi(MachineRepresentation::kBit, 2));
+  return Changed(node);
+}
+
 Reduction ChangeLowering::ObjectIsNumber(Node* node) {
   Node* input = NodeProperties::GetValueInput(node, 0);
   // TODO(bmeurer): Optimize somewhat based on input type.
   Node* check = IsSmi(input);
   Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
   Node* vtrue = jsgraph()->Int32Constant(1);
   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
   Node* vfalse = graph()->NewNode(
       machine()->WordEqual(), LoadHeapObjectMap(input, if_false),
@@ skipping 91 matching lines @@
 }
 
 
 MachineOperatorBuilder* ChangeLowering::machine() const {
   return jsgraph()->machine();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8