1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "src/compiler/state-values-utils.h"
6 #include "test/unittests/compiler/graph-unittest.h"
7 #include "test/unittests/compiler/node-test-utils.h"
8 #include "test/unittests/test-utils.h"
9 #include "testing/gmock/include/gmock/gmock.h"
15 class StateValuesIteratorTest : public GraphTest {
17 StateValuesIteratorTest() : GraphTest(3) {}
19 Node* StateValuesFromVector(NodeVector* nodes) {
20 int count = static_cast<int>(nodes->size());
21 return graph()->NewNode(common()->StateValues(count), count,
22 count == 0 ? nullptr : &(nodes->front()));
27 TEST_F(StateValuesIteratorTest, SimpleIteration) {
28 NodeVector inputs(zone());
30 for (int i = 0; i < count; i++) {
31 inputs.push_back(Int32Constant(i));
33 Node* state_values = StateValuesFromVector(&inputs);
35 for (StateValuesAccess::TypedNode node : StateValuesAccess(state_values)) {
36 EXPECT_THAT(node.node, IsInt32Constant(i));
43 TEST_F(StateValuesIteratorTest, EmptyIteration) {
44 NodeVector inputs(zone());
45 Node* state_values = StateValuesFromVector(&inputs);
46 for (auto node : StateValuesAccess(state_values)) {
53 TEST_F(StateValuesIteratorTest, NestedIteration) {
54 NodeVector inputs(zone());
56 for (int i = 0; i < 8; i++) {
58 // Single nested in index 2.
59 NodeVector nested_inputs(zone());
60 for (int j = 0; j < 8; j++) {
61 nested_inputs.push_back(Int32Constant(count++));
63 inputs.push_back(StateValuesFromVector(&nested_inputs));
65 // Double nested at index 5.
66 NodeVector nested_inputs(zone());
67 for (int j = 0; j < 8; j++) {
69 NodeVector doubly_nested_inputs(zone());
70 for (int k = 0; k < 2; k++) {
71 doubly_nested_inputs.push_back(Int32Constant(count++));
73 nested_inputs.push_back(StateValuesFromVector(&doubly_nested_inputs));
75 nested_inputs.push_back(Int32Constant(count++));
78 inputs.push_back(StateValuesFromVector(&nested_inputs));
80 inputs.push_back(Int32Constant(count++));
83 Node* state_values = StateValuesFromVector(&inputs);
85 for (StateValuesAccess::TypedNode node : StateValuesAccess(state_values)) {
86 EXPECT_THAT(node.node, IsInt32Constant(i));
93 TEST_F(StateValuesIteratorTest, TreeFromVector) {
94 int sizes[] = {0, 1, 2, 100, 5000, 30000};
95 TRACED_FOREACH(int, count, sizes) {
96 JSOperatorBuilder javascript(zone());
97 MachineOperatorBuilder machine(zone());
98 JSGraph jsgraph(isolate(), graph(), common(), &javascript, &machine);
100 // Generate the input vector.
101 NodeVector inputs(zone());
102 for (int i = 0; i < count; i++) {
103 inputs.push_back(Int32Constant(i));
107 StateValuesCache builder(&jsgraph);
108 Node* values_node = builder.GetNodeForValues(
109 inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
111 // Check the tree contents with vector.
113 for (StateValuesAccess::TypedNode node : StateValuesAccess(values_node)) {
114 EXPECT_THAT(node.node, IsInt32Constant(i));
117 EXPECT_EQ(inputs.size(), static_cast<size_t>(i));
122 TEST_F(StateValuesIteratorTest, BuildTreeIdentical) {
123 int sizes[] = {0, 1, 2, 100, 5000, 30000};
124 TRACED_FOREACH(int, count, sizes) {
125 JSOperatorBuilder javascript(zone());
126 MachineOperatorBuilder machine(zone());
127 JSGraph jsgraph(isolate(), graph(), common(), &javascript, &machine);
129 // Generate the input vector.
130 NodeVector inputs(zone());
131 for (int i = 0; i < count; i++) {
132 inputs.push_back(Int32Constant(i));
135 // Build two trees from the same data.
136 StateValuesCache builder(&jsgraph);
137 Node* node1 = builder.GetNodeForValues(
138 inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
139 Node* node2 = builder.GetNodeForValues(
140 inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
142 // The trees should be equal since the data was the same.
143 EXPECT_EQ(node1, node2);
147 } // namespace compiler
148 } // namespace internal