Fix bug in NodeCache::GetCachedNodes

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-inl.h"
 #include "src/compiler/typer.h"
@@ skipping 311 matching lines @@
   CheckGetCachedNodesContains(&T, T.NullConstant());
   CheckGetCachedNodesContains(&T, T.ZeroConstant());
   CheckGetCachedNodesContains(&T, T.OneConstant());
   CheckGetCachedNodesContains(&T, T.NaNConstant());
 }
 
 
 TEST(JSGraph_GetCachedNodes_int32) {
   JSConstantCacheTester T;
 
-  int32_t constants[] = {0, 11, 12, 13, 14, 55, -55, -44, -33, -22, -11,
-                         0, 11, 11, 12, 12, 11, 11,  -33, -33, -22, -11};
+  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();
     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));
     }
@@ skipping 21 matching lines @@
     }
     // 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,
-                         0, 11, 11, 12, 12, 11, 11,  -33, -33, -22, -11};
+  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();
     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));
     }
@@ skipping 75 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]));
   }
 }