| 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 85 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 96 | 96 |
| 97 Matcher<Node*> GraphTest::IsTrueConstant() { | 97 Matcher<Node*> GraphTest::IsTrueConstant() { |
| 98 return IsHeapConstant(factory()->true_value()); | 98 return IsHeapConstant(factory()->true_value()); |
| 99 } | 99 } |
| 100 | 100 |
| 101 | 101 |
| 102 Matcher<Node*> GraphTest::IsUndefinedConstant() { | 102 Matcher<Node*> GraphTest::IsUndefinedConstant() { |
| 103 return IsHeapConstant(factory()->undefined_value()); | 103 return IsHeapConstant(factory()->undefined_value()); |
| 104 } | 104 } |
| 105 | 105 |
| 106 | |
| 107 TypedGraphTest::TypedGraphTest(int num_parameters) | 106 TypedGraphTest::TypedGraphTest(int num_parameters) |
| 108 : GraphTest(num_parameters), typer_(isolate(), graph()) {} | 107 : GraphTest(num_parameters), typer_(isolate(), Typer::kNoFlags, graph()) {} |
| 109 | |
| 110 | 108 |
| 111 TypedGraphTest::~TypedGraphTest() {} | 109 TypedGraphTest::~TypedGraphTest() {} |
| 112 | 110 |
| 113 | 111 |
| 114 Node* TypedGraphTest::Parameter(Type* type, int32_t index) { | 112 Node* TypedGraphTest::Parameter(Type* type, int32_t index) { |
| 115 Node* node = GraphTest::Parameter(index); | 113 Node* node = GraphTest::Parameter(index); |
| 116 NodeProperties::SetType(node, type); | 114 NodeProperties::SetType(node, type); |
| 117 return node; | 115 return node; |
| 118 } | 116 } |
| 119 | 117 |
| (...skipping 13 matching lines...) Expand all Loading... |
| 133 EXPECT_LT(0u, n0->id()); | 131 EXPECT_LT(0u, n0->id()); |
| 134 EXPECT_LT(0u, n1->id()); | 132 EXPECT_LT(0u, n1->id()); |
| 135 EXPECT_NE(n0->id(), n1->id()); | 133 EXPECT_NE(n0->id(), n1->id()); |
| 136 EXPECT_EQ(&kDummyOperator, n0->op()); | 134 EXPECT_EQ(&kDummyOperator, n0->op()); |
| 137 EXPECT_EQ(&kDummyOperator, n1->op()); | 135 EXPECT_EQ(&kDummyOperator, n1->op()); |
| 138 } | 136 } |
| 139 | 137 |
| 140 } // namespace compiler | 138 } // namespace compiler |
| 141 } // namespace internal | 139 } // namespace internal |
| 142 } // namespace v8 | 140 } // namespace v8 |
| OLD | NEW |