[turbofan] Remove unused Type parameter from ReferenceEqual.

src/compiler/js-native-context-specialization.cc

 // Copyright 2015 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-native-context-specialization.h"
 
 #include "src/accessors.h"
 #include "src/code-factory.h"
 #include "src/compilation-dependencies.h"
 #include "src/compiler/access-builder.h"
@@ skipping 130 matching lines @@
   }
 
   // Nothing to do if we have no non-deprecated maps.
   if (access_infos.empty()) {
     return ReduceSoftDeoptimize(
         node, DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
   }
 
   // Ensure that {index} matches the specified {name} (if {index} is given).
   if (index != nullptr) {
-    Node* check = graph()->NewNode(simplified()->ReferenceEqual(Type::Name()),
-                                   index, jsgraph()->HeapConstant(name));
+    Node* check = graph()->NewNode(simplified()->ReferenceEqual(), index,
+                                   jsgraph()->HeapConstant(name));
     effect = graph()->NewNode(simplified()->CheckIf(), check, effect, control);
   }
 
   // Check for the monomorphic cases.
   if (access_infos.size() == 1) {
     PropertyAccessInfo access_info = access_infos.front();
     if (HasOnlyStringMaps(access_info.receiver_maps())) {
       // Monormorphic string access (ignoring the fact that there are multiple
       // String maps).
       receiver = effect = graph()->NewNode(simplified()->CheckString(),
@@ skipping 63 matching lines @@
       // Perform map check on {receiver}.
       MapList const& receiver_maps = access_info.receiver_maps();
       {
         // Emit a (sequence of) map checks for other {receiver}s.
         ZoneVector<Node*> this_controls(zone());
         ZoneVector<Node*> this_effects(zone());
         size_t num_classes = receiver_maps.size();
         for (auto map : receiver_maps) {
           DCHECK_LT(0u, num_classes);
           Node* check =
-              graph()->NewNode(simplified()->ReferenceEqual(Type::Internal()),
-                               receiver_map, jsgraph()->Constant(map));
+              graph()->NewNode(simplified()->ReferenceEqual(), receiver_map,
+                               jsgraph()->Constant(map));
           if (--num_classes == 0 && j == access_infos.size() - 1) {
             check = graph()->NewNode(simplified()->CheckIf(), check,
                                      this_effect, fallthrough_control);
             this_controls.push_back(fallthrough_control);
             this_effects.push_back(check);
             fallthrough_control = nullptr;
           } else {
             Node* branch = graph()->NewNode(common()->Branch(), check,
                                             fallthrough_control);
             fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
@@ skipping 276 matching lines @@
 
       // Perform map check(s) on {receiver}.
       MapList const& receiver_maps = access_info.receiver_maps();
       {
         ZoneVector<Node*> this_controls(zone());
         ZoneVector<Node*> this_effects(zone());
         size_t num_classes = receiver_maps.size();
         for (Handle<Map> map : receiver_maps) {
           DCHECK_LT(0u, num_classes);
           Node* check =
-              graph()->NewNode(simplified()->ReferenceEqual(Type::Any()),
-                               receiver_map, jsgraph()->Constant(map));
+              graph()->NewNode(simplified()->ReferenceEqual(), receiver_map,
+                               jsgraph()->Constant(map));
           if (--num_classes == 0 && j == access_infos.size() - 1) {
             // Last map check on the fallthrough control path, do a conditional
             // eager deoptimization exit here.
             // TODO(turbofan): This is ugly as hell! We should probably
             // introduce macro-ish operators for property access that
             // encapsulate this whole mess.
             check = graph()->NewNode(simplified()->CheckIf(), check,
                                      this_effect, this_control);
             this_controls.push_back(this_control);
             this_effects.push_back(check);
@@ skipping 200 matching lines @@
     AssumePrototypesStable(access_info.receiver_maps(), native_context, holder);
   }
 
   // Generate the actual property access.
   if (access_info.IsNotFound()) {
     DCHECK_EQ(AccessMode::kLoad, access_mode);
     value = jsgraph()->UndefinedConstant();
   } else if (access_info.IsDataConstant()) {
     value = jsgraph()->Constant(access_info.constant());
     if (access_mode == AccessMode::kStore) {
-      Node* check = graph()->NewNode(
-          simplified()->ReferenceEqual(Type::Tagged()), value, value);
+      Node* check =
+          graph()->NewNode(simplified()->ReferenceEqual(), value, value);
       effect =
           graph()->NewNode(simplified()->CheckIf(), check, effect, control);
     }
   } else if (access_info.IsAccessorConstant()) {
     // TODO(bmeurer): Properly rewire the IfException edge here if there's any.
     Node* target = jsgraph()->Constant(access_info.constant());
     FrameStateInfo const& frame_info = OpParameter<FrameStateInfo>(frame_state);
     Handle<SharedFunctionInfo> shared_info =
         frame_info.shared_info().ToHandleChecked();
     switch (access_mode) {
@@ skipping 649 matching lines @@
 }
 
 
 SimplifiedOperatorBuilder* JSNativeContextSpecialization::simplified() const {
   return jsgraph()->simplified();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8