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 "test/unittests/compiler/node-test-utils.h" | 8 #include "test/unittests/compiler/node-test-utils.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 118 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
129 const Operator kDummyOperator(0, Operator::kNoProperties, "Dummy", 0, 0, 0, 1, | 129 const Operator kDummyOperator(0, Operator::kNoProperties, "Dummy", 0, 0, 0, 1, |
130 0, 0); | 130 0, 0); |
131 | 131 |
132 } // namespace | 132 } // namespace |
133 | 133 |
134 | 134 |
135 TEST_F(GraphTest, NewNode) { | 135 TEST_F(GraphTest, NewNode) { |
136 Node* n0 = graph()->NewNode(&kDummyOperator); | 136 Node* n0 = graph()->NewNode(&kDummyOperator); |
137 Node* n1 = graph()->NewNode(&kDummyOperator); | 137 Node* n1 = graph()->NewNode(&kDummyOperator); |
138 EXPECT_NE(n0, n1); | 138 EXPECT_NE(n0, n1); |
139 EXPECT_LT(0, n0->id()); | 139 EXPECT_LT(0u, n0->id()); |
140 EXPECT_LT(0, n1->id()); | 140 EXPECT_LT(0u, n1->id()); |
141 EXPECT_NE(n0->id(), n1->id()); | 141 EXPECT_NE(n0->id(), n1->id()); |
142 EXPECT_EQ(&kDummyOperator, n0->op()); | 142 EXPECT_EQ(&kDummyOperator, n0->op()); |
143 EXPECT_EQ(&kDummyOperator, n1->op()); | 143 EXPECT_EQ(&kDummyOperator, n1->op()); |
144 } | 144 } |
145 | 145 |
146 } // namespace compiler | 146 } // namespace compiler |
147 } // namespace internal | 147 } // namespace internal |
148 } // namespace v8 | 148 } // namespace v8 |
OLD | NEW |