[turbofan] Sparse representation for state values

test/unittests/compiler/escape-analysis-unittest.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/escape-analysis.h"
 #include "src/bit-vector.h"
 #include "src/compiler/escape-analysis-reducer.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
@@ skipping 421 matching lines @@
 
 TEST_F(EscapeAnalysisTest, DeoptReplacement) {
   Node* object1 = Constant(1);
   BeginRegion();
   Node* allocation = Allocate(Constant(kPointerSize));
   Store(FieldAccessAtIndex(0), allocation, object1);
   Node* finish = FinishRegion(allocation);
   Node* effect1 = Store(FieldAccessAtIndex(0), allocation, object1, finish);
   Branch();
   Node* ifFalse = IfFalse();
-  Node* state_values1 = graph()->NewNode(common()->StateValues(1), finish);
-  Node* state_values2 = graph()->NewNode(common()->StateValues(0));
-  Node* state_values3 = graph()->NewNode(common()->StateValues(0));
+  Node* state_values1 = graph()->NewNode(common()->StateValues(1, 0u), finish);
+  Node* state_values2 = graph()->NewNode(common()->StateValues(0, 0u));
+  Node* state_values3 = graph()->NewNode(common()->StateValues(0, 0u));
   Node* frame_state = graph()->NewNode(
       common()->FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(),
                            nullptr),
       state_values1, state_values2, state_values3, UndefinedConstant(),
       graph()->start(), graph()->start());
   Node* deopt = graph()->NewNode(
       common()->Deoptimize(DeoptimizeKind::kEager, DeoptimizeReason::kNoReason),
       frame_state, effect1, ifFalse);
   Node* ifTrue = IfTrue();
   Node* load = Load(FieldAccessAtIndex(0), finish, effect1, ifTrue);
@@ skipping 17 matching lines @@
 TEST_F(EscapeAnalysisTest, DISABLED_DeoptReplacementIdentity) {
   Node* object1 = Constant(1);
   BeginRegion();
   Node* allocation = Allocate(Constant(kPointerSize * 2));
   Store(FieldAccessAtIndex(0), allocation, object1);
   Store(FieldAccessAtIndex(kPointerSize), allocation, allocation);
   Node* finish = FinishRegion(allocation);
   Node* effect1 = Store(FieldAccessAtIndex(0), allocation, object1, finish);
   Branch();
   Node* ifFalse = IfFalse();
-  Node* state_values1 = graph()->NewNode(common()->StateValues(1), finish);
-  Node* state_values2 = graph()->NewNode(common()->StateValues(1), finish);
-  Node* state_values3 = graph()->NewNode(common()->StateValues(0));
+  Node* state_values1 = graph()->NewNode(common()->StateValues(1, 0u), finish);
+  Node* state_values2 = graph()->NewNode(common()->StateValues(1, 0u), finish);
+  Node* state_values3 = graph()->NewNode(common()->StateValues(0, 0u));
   Node* frame_state = graph()->NewNode(
       common()->FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(),
                            nullptr),
       state_values1, state_values2, state_values3, UndefinedConstant(),
       graph()->start(), graph()->start());
   Node* deopt = graph()->NewNode(
       common()->Deoptimize(DeoptimizeKind::kEager, DeoptimizeReason::kNoReason),
       frame_state, effect1, ifFalse);
   Node* ifTrue = IfTrue();
   Node* load = Load(FieldAccessAtIndex(0), finish, effect1, ifTrue);
@@ skipping 15 matching lines @@
   ASSERT_EQ(object1, NodeProperties::GetValueInput(object_state, 0));
   ASSERT_EQ(object_state, NodeProperties::GetValueInput(object_state, 1));
 
   Node* object_state2 = NodeProperties::GetValueInput(state_values1, 0);
   ASSERT_EQ(object_state, object_state2);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8