[turbofan] Use an IntPtrConstant in WordEqual comparisons.

src/compiler/effect-control-linearizer.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/effect-control-linearizer.h"
 
 #include "src/code-factory.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/linkage.h"
@@ skipping 907 matching lines @@
 
   // If {value} is a Smi, then we only need to check that it's not zero.
   Node* if_smi = graph()->NewNode(common()->IfTrue(), branch_smi);
   Node* esmi = effect;
   {
     controls[count] = if_smi;
     effects[count] = esmi;
     values[count] =
         graph()->NewNode(machine()->Word32Equal(),
                          graph()->NewNode(machine()->WordEqual(), value,
-                                          jsgraph()->ZeroConstant()),
+                                          jsgraph()->IntPtrConstant(0)),
                          zero);
     count++;
   }
   control = graph()->NewNode(common()->IfFalse(), branch_smi);
 
   // Load the map instance type of {value}.
   Node* value_map = effect = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForMap()), value, effect, control);
   Node* value_instance_type = effect = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForMapInstanceType()), value_map,
@@ skipping 32 matching lines @@
     // Load the {value} length.
     Node* value_length = estring = graph()->NewNode(
         simplified()->LoadField(AccessBuilder::ForStringLength()), value,
         estring, if_string);
 
     controls[count] = if_string;
     effects[count] = estring;
     values[count] =
         graph()->NewNode(machine()->Word32Equal(),
                          graph()->NewNode(machine()->WordEqual(), value_length,
-                                          jsgraph()->ZeroConstant()),
+                                          jsgraph()->IntPtrConstant(0)),
                          zero);
     count++;
   }
   control = graph()->NewNode(common()->IfFalse(), branch_string);
 
   // Check if {value} is a HeapNumber.
   Node* check_heapnumber =
       graph()->NewNode(machine()->Word32Equal(), value_instance_type,
                        jsgraph()->Int32Constant(HEAP_NUMBER_TYPE));
   Node* branch_heapnumber =
@@ skipping 2650 matching lines @@
         isolate(), graph()->zone(), callable.descriptor(), 0, flags,
         Operator::kEliminatable);
     to_number_operator_.set(common()->Call(desc));
   }
   return to_number_operator_.get();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8