OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 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 | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "test/unittests/compiler/graph-unittest.h" | 5 #include "test/unittests/compiler/graph-unittest.h" |
6 | 6 |
7 #include "src/compiler/node-properties.h" | 7 #include "src/compiler/node-properties.h" |
8 #include "src/factory.h" | 8 #include "src/factory.h" |
9 #include "src/objects-inl.h" // TODO(everyone): Make typer.h IWYU compliant. | 9 #include "src/objects-inl.h" // TODO(everyone): Make typer.h IWYU compliant. |
10 #include "test/unittests/compiler/node-test-utils.h" | 10 #include "test/unittests/compiler/node-test-utils.h" |
(...skipping 62 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
73 return HeapConstant(factory()->true_value()); | 73 return HeapConstant(factory()->true_value()); |
74 } | 74 } |
75 | 75 |
76 | 76 |
77 Node* GraphTest::UndefinedConstant() { | 77 Node* GraphTest::UndefinedConstant() { |
78 return HeapConstant(factory()->undefined_value()); | 78 return HeapConstant(factory()->undefined_value()); |
79 } | 79 } |
80 | 80 |
81 | 81 |
82 Node* GraphTest::EmptyFrameState() { | 82 Node* GraphTest::EmptyFrameState() { |
83 Node* state_values = graph()->NewNode(common()->StateValues(0)); | 83 Node* state_values = |
| 84 graph()->NewNode(common()->StateValues(0, SparseInputMask::Dense())); |
84 return graph()->NewNode( | 85 return graph()->NewNode( |
85 common()->FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(), | 86 common()->FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(), |
86 nullptr), | 87 nullptr), |
87 state_values, state_values, state_values, NumberConstant(0), | 88 state_values, state_values, state_values, NumberConstant(0), |
88 UndefinedConstant(), graph()->start()); | 89 UndefinedConstant(), graph()->start()); |
89 } | 90 } |
90 | 91 |
91 | 92 |
92 Matcher<Node*> GraphTest::IsFalseConstant() { | 93 Matcher<Node*> GraphTest::IsFalseConstant() { |
93 return IsHeapConstant(factory()->false_value()); | 94 return IsHeapConstant(factory()->false_value()); |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
134 EXPECT_LT(0u, n0->id()); | 135 EXPECT_LT(0u, n0->id()); |
135 EXPECT_LT(0u, n1->id()); | 136 EXPECT_LT(0u, n1->id()); |
136 EXPECT_NE(n0->id(), n1->id()); | 137 EXPECT_NE(n0->id(), n1->id()); |
137 EXPECT_EQ(&kDummyOperator, n0->op()); | 138 EXPECT_EQ(&kDummyOperator, n0->op()); |
138 EXPECT_EQ(&kDummyOperator, n1->op()); | 139 EXPECT_EQ(&kDummyOperator, n1->op()); |
139 } | 140 } |
140 | 141 |
141 } // namespace compiler | 142 } // namespace compiler |
142 } // namespace internal | 143 } // namespace internal |
143 } // namespace v8 | 144 } // namespace v8 |
OLD | NEW |