[turbofan] Remove typeof optimization from typed lowering.

src/compiler/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.
 
 #include "src/compiler/js-typed-lowering.h"
 
 #include "src/ast/modules.h"
 #include "src/builtins/builtins-utils.h"
 #include "src/code-factory.h"
 #include "src/compilation-dependencies.h"
@@ skipping 824 matching lines @@
   } else if (type->Is(Type::Function())) {
     return Replace(jsgraph()->Constant(f->function_string()));
   } else if (type->IsHeapConstant()) {
     return Replace(jsgraph()->Constant(
         Object::TypeOf(isolate(), type->AsHeapConstant()->Value())));
   }
 
   return NoChange();
 }
 
-Reduction JSTypedLowering::ReduceJSEqualTypeOf(Node* node) {
-  Node* input;
-  Handle<String> type;
-  HeapObjectBinopMatcher m(node);
-  if (m.left().IsJSTypeOf() && m.right().HasValue() &&
-      m.right().Value()->IsString()) {
-    input = m.left().InputAt(0);
-    type = Handle<String>::cast(m.right().Value());
-  } else if (m.right().IsJSTypeOf() && m.left().HasValue() &&
-             m.left().Value()->IsString()) {
-    input = m.right().InputAt(0);
-    type = Handle<String>::cast(m.left().Value());
-  } else {
-    return NoChange();
-  }
-  Node* value;
-  if (String::Equals(type, factory()->boolean_string())) {
-    value =
-        graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
-                         graph()->NewNode(simplified()->ReferenceEqual(), input,
-                                          jsgraph()->TrueConstant()),
-                         jsgraph()->TrueConstant(),
-                         graph()->NewNode(simplified()->ReferenceEqual(), input,
-                                          jsgraph()->FalseConstant()));
-  } else if (String::Equals(type, factory()->function_string())) {
-    value = graph()->NewNode(simplified()->ObjectIsDetectableCallable(), input);
-  } else if (String::Equals(type, factory()->number_string())) {
-    value = graph()->NewNode(simplified()->ObjectIsNumber(), input);
-  } else if (String::Equals(type, factory()->object_string())) {
-    value = graph()->NewNode(
-        common()->Select(MachineRepresentation::kTagged),
-        graph()->NewNode(simplified()->ObjectIsNonCallable(), input),
-        jsgraph()->TrueConstant(),
-        graph()->NewNode(simplified()->ReferenceEqual(), input,
-                         jsgraph()->NullConstant()));
-  } else if (String::Equals(type, factory()->string_string())) {
-    value = graph()->NewNode(simplified()->ObjectIsString(), input);
-  } else if (String::Equals(type, factory()->symbol_string())) {
-    value = graph()->NewNode(simplified()->ObjectIsSymbol(), input);
-  } else if (String::Equals(type, factory()->undefined_string())) {
-    value = graph()->NewNode(
-        common()->Select(MachineRepresentation::kTagged),
-        graph()->NewNode(simplified()->ReferenceEqual(), input,
-                         jsgraph()->NullConstant()),
-        jsgraph()->FalseConstant(),
-        graph()->NewNode(simplified()->ObjectIsUndetectable(), input));
-  } else {
-    return NoChange();
-  }
-  ReplaceWithValue(node, value);
-  return Replace(value);
-}
-
 Reduction JSTypedLowering::ReduceJSEqual(Node* node) {
-  Reduction const reduction = ReduceJSEqualTypeOf(node);
-  if (reduction.Changed()) return reduction;
-
   JSBinopReduction r(this, node);
 
   if (r.BothInputsAre(Type::UniqueName())) {
     return r.ChangeToPureOperator(simplified()->ReferenceEqual());
   }
   if (r.IsInternalizedStringCompareOperation()) {
     r.CheckInputsToInternalizedString();
     return r.ChangeToPureOperator(simplified()->ReferenceEqual());
   }
   if (r.BothInputsAre(Type::String())) {
@@ skipping 42 matching lines @@
     // For values with canonical representation (i.e. neither String, nor
     // Number) an empty type intersection means the values cannot be strictly
     // equal.
     if (!r.left_type()->Maybe(r.right_type())) {
       Node* replacement = jsgraph()->FalseConstant();
       ReplaceWithValue(node, replacement);
       return Replace(replacement);
     }
   }
 
-  Reduction const reduction = ReduceJSEqualTypeOf(node);
-  if (reduction.Changed()) return reduction;
-
   if (r.BothInputsAre(Type::Unique())) {
     return r.ChangeToPureOperator(simplified()->ReferenceEqual());
   }
   if (r.OneInputIs(pointer_comparable_type_)) {
     return r.ChangeToPureOperator(simplified()->ReferenceEqual());
   }
   if (r.IsInternalizedStringCompareOperation()) {
     r.CheckInputsToInternalizedString();
     return r.ChangeToPureOperator(simplified()->ReferenceEqual());
   }
@@ skipping 1471 matching lines @@
 }
 
 
 CompilationDependencies* JSTypedLowering::dependencies() const {
   return dependencies_;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8