[turbofan] Sparse representation for state values

test/unittests/compiler/state-values-utils-unittest.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/state-values-utils.h"
 #include "test/unittests/compiler/graph-unittest.h"
 #include "test/unittests/compiler/node-test-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gmock/include/gmock/gmock.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
 class StateValuesIteratorTest : public GraphTest {
  public:
   StateValuesIteratorTest() : GraphTest(3) {}
 
   Node* StateValuesFromVector(NodeVector* nodes) {
     int count = static_cast<int>(nodes->size());
-    return graph()->NewNode(common()->StateValues(count), count,
+    return graph()->NewNode(common()->StateValues(count, 0u), count,
                             count == 0 ? nullptr : &(nodes->front()));
   }
 };
 
 
 TEST_F(StateValuesIteratorTest, SimpleIteration) {
   NodeVector inputs(zone());
   const int count = 10;
   for (int i = 0; i < count; i++) {
     inputs.push_back(Int32Constant(i));
@@ skipping 110 matching lines @@
         inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
 
     // The trees should be equal since the data was the same.
     EXPECT_EQ(node1, node2);
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8