[turbofan] Fix a couple of invalid Uint32Constant/Int32Constant uses.

src/compiler/js-builtin-reducer.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-builtin-reducer.h"
 
 #include "src/compilation-dependencies.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-matchers.h"
@@ skipping 1098 matching lines @@
     Node* etrue0 = effect;
     Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
     Node* done_true;
     Node* vtrue0;
     {
       done_true = jsgraph()->FalseConstant();
       Node* lead = graph()->NewNode(simplified()->StringCharCodeAt(), string,
                                     index, if_true0);
 
       // branch1: if ((lead & 0xFC00) === 0xD800)
-      Node* check1 = graph()->NewNode(
-          simplified()->NumberEqual(),
-          graph()->NewNode(simplified()->NumberBitwiseAnd(), lead,
-                           jsgraph()->Int32Constant(0xFC00)),
-          jsgraph()->Int32Constant(0xD800));
+      Node* check1 =
+          graph()->NewNode(simplified()->NumberEqual(),
+                           graph()->NewNode(simplified()->NumberBitwiseAnd(),
+                                            lead, jsgraph()->Constant(0xFC00)),
+                           jsgraph()->Constant(0xD800));
       Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse),
                                        check1, if_true0);
       Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
       Node* vtrue1;
       {
         Node* next_index = graph()->NewNode(simplified()->NumberAdd(), index,
                                             jsgraph()->OneConstant());
         // branch2: if ((index + 1) < length)
         Node* check2 = graph()->NewNode(simplified()->NumberLessThan(),
                                         next_index, length);
         Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kTrue),
                                          check2, if_true1);
         Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
         Node* vtrue2;
         {
           Node* trail = graph()->NewNode(simplified()->StringCharCodeAt(),
                                          string, next_index, if_true2);
           // branch3: if ((trail & 0xFC00) === 0xDC00)
           Node* check3 = graph()->NewNode(
               simplified()->NumberEqual(),
               graph()->NewNode(simplified()->NumberBitwiseAnd(), trail,
-                               jsgraph()->Int32Constant(0xFC00)),
-              jsgraph()->Int32Constant(0xDC00));
+                               jsgraph()->Constant(0xFC00)),
+              jsgraph()->Constant(0xDC00));
           Node* branch3 = graph()->NewNode(common()->Branch(BranchHint::kTrue),
                                            check3, if_true2);
           Node* if_true3 = graph()->NewNode(common()->IfTrue(), branch3);
           Node* vtrue3;
           {
             vtrue3 = graph()->NewNode(
                 simplified()->NumberBitwiseOr(),
 // Need to swap the order for big-endian platforms
 #if V8_TARGET_BIG_ENDIAN
                 graph()->NewNode(simplified()->NumberShiftLeft(), lead,
-                                 jsgraph()->Int32Constant(16)),
+                                 jsgraph()->Constant(16)),
                 trail);
 #else
                 graph()->NewNode(simplified()->NumberShiftLeft(), trail,
-                                 jsgraph()->Int32Constant(16)),
+                                 jsgraph()->Constant(16)),
                 lead);
 #endif
           }
 
           Node* if_false3 = graph()->NewNode(common()->IfFalse(), branch3);
           Node* vfalse3 = lead;
           if_true2 = graph()->NewNode(common()->Merge(2), if_true3, if_false3);
           vtrue2 =
               graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2),
                                vtrue3, vfalse3, if_true2);
@@ skipping 284 matching lines @@
   return jsgraph()->simplified();
 }
 
 JSOperatorBuilder* JSBuiltinReducer::javascript() const {
   return jsgraph()->javascript();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8