[turbofan] Use appropriate type for NodeId.

test/cctest/compiler/test-js-constant-cache.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/v8.h"
 
 #include "src/assembler.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/typer.h"
@@ skipping 317 matching lines @@
 
 TEST(JSGraph_GetCachedNodes_int32) {
   JSConstantCacheTester T;
 
   int32_t constants[] = {0,  1,  1,   1,   1,   2,   3,   4,  11, 12, 13,
                          14, 55, -55, -44, -33, -22, -11, 16, 16, 17, 17,
                          18, 18, 19,  19,  20,  20,  21,  21, 22, 23, 24,
                          25, 15, 30,  31,  45,  46,  47,  48};
 
   for (size_t i = 0; i < arraysize(constants); i++) {
-    int count_before = T.graph()->NodeCount();
+    size_t count_before = T.graph()->NodeCount();
     NodeVector nodes_before(T.main_zone());
     T.GetCachedNodes(&nodes_before);
     Node* n = T.Int32Constant(constants[i]);
     if (n->id() < count_before) {
       // An old ID indicates a cached node. It should have been in the set.
       CHECK(Contains(&nodes_before, n));
     }
     // Old or new, it should be in the cached set afterwards.
     CheckGetCachedNodesContains(&T, n);
   }
 }
 
 
 TEST(JSGraph_GetCachedNodes_float64) {
   JSConstantCacheTester T;
 
   double constants[] = {0,   11.1, 12.2,  13,    14,   55.5, -55.5, -44.4,
                         -33, -22,  -11,   0,     11.1, 11.1, 12.3,  12.3,
                         11,  11,   -33.3, -33.3, -22,  -11};
 
   for (size_t i = 0; i < arraysize(constants); i++) {
-    int count_before = T.graph()->NodeCount();
+    size_t count_before = T.graph()->NodeCount();
     NodeVector nodes_before(T.main_zone());
     T.GetCachedNodes(&nodes_before);
     Node* n = T.Float64Constant(constants[i]);
     if (n->id() < count_before) {
       // An old ID indicates a cached node. It should have been in the set.
       CHECK(Contains(&nodes_before, n));
     }
     // Old or new, it should be in the cached set afterwards.
     CheckGetCachedNodesContains(&T, n);
   }
 }
 
 
 TEST(JSGraph_GetCachedNodes_int64) {
   JSConstantCacheTester T;
 
   int32_t constants[] = {0,   11,  12, 13, 14, 55, -55, -44, -33,
                          -22, -11, 16, 16, 17, 17, 18,  18,  19,
                          19,  20,  20, 21, 21, 22, 23,  24,  25};
 
   for (size_t i = 0; i < arraysize(constants); i++) {
-    int count_before = T.graph()->NodeCount();
+    size_t count_before = T.graph()->NodeCount();
     NodeVector nodes_before(T.main_zone());
     T.GetCachedNodes(&nodes_before);
     Node* n = T.Int64Constant(constants[i]);
     if (n->id() < count_before) {
       // An old ID indicates a cached node. It should have been in the set.
       CHECK(Contains(&nodes_before, n));
     }
     // Old or new, it should be in the cached set afterwards.
     CheckGetCachedNodesContains(&T, n);
   }
 }
 
 
 TEST(JSGraph_GetCachedNodes_number) {
   JSConstantCacheTester T;
 
   double constants[] = {0,   11.1, 12.2,  13,    14,   55.5, -55.5, -44.4,
                         -33, -22,  -11,   0,     11.1, 11.1, 12.3,  12.3,
                         11,  11,   -33.3, -33.3, -22,  -11};
 
   for (size_t i = 0; i < arraysize(constants); i++) {
-    int count_before = T.graph()->NodeCount();
+    size_t count_before = T.graph()->NodeCount();
     NodeVector nodes_before(T.main_zone());
     T.GetCachedNodes(&nodes_before);
     Node* n = T.Constant(constants[i]);
     if (n->id() < count_before) {
       // An old ID indicates a cached node. It should have been in the set.
       CHECK(Contains(&nodes_before, n));
     }
     // Old or new, it should be in the cached set afterwards.
     CheckGetCachedNodesContains(&T, n);
   }
 }
 
 
 TEST(JSGraph_GetCachedNodes_external) {
   JSConstantCacheTester T;
 
   ExternalReference constants[] = {ExternalReference::address_of_min_int(),
                                    ExternalReference::address_of_min_int(),
                                    ExternalReference::address_of_min_int(),
                                    ExternalReference::address_of_one_half(),
                                    ExternalReference::address_of_one_half(),
                                    ExternalReference::address_of_min_int(),
                                    ExternalReference::address_of_the_hole_nan(),
                                    ExternalReference::address_of_one_half()};
 
   for (size_t i = 0; i < arraysize(constants); i++) {
-    int count_before = T.graph()->NodeCount();
+    size_t count_before = T.graph()->NodeCount();
     NodeVector nodes_before(T.main_zone());
     T.GetCachedNodes(&nodes_before);
     Node* n = T.ExternalConstant(constants[i]);
     if (n->id() < count_before) {
       // An old ID indicates a cached node. It should have been in the set.
       CHECK(Contains(&nodes_before, n));
     }
     // Old or new, it should be in the cached set afterwards.
     CheckGetCachedNodesContains(&T, n);
   }
@@ skipping 23 matching lines @@
       T.Constant(1.11),
       T.ExternalConstant(ExternalReference::address_of_one_half())};
 
   NodeVector nodes(T.main_zone());
   T.GetCachedNodes(&nodes);
 
   for (size_t i = 0; i < arraysize(constants); i++) {
     CHECK(Contains(&nodes, constants[i]));
   }
 }