| 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 #ifndef V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ | 5 #ifndef V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ |
| 6 #define V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ | 6 #define V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ |
| 7 | 7 |
| 8 #include "src/compiler/machine-operator.h" | 8 #include "src/compiler/machine-operator.h" |
| 9 #include "src/compiler/type-hints.h" | 9 #include "src/compiler/type-hints.h" |
| 10 #include "src/machine-type.h" | 10 #include "src/machine-type.h" |
| (...skipping 321 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 332 Matcher<Node*> IsWord64Or(const Matcher<Node*>& lhs_matcher, | 332 Matcher<Node*> IsWord64Or(const Matcher<Node*>& lhs_matcher, |
| 333 const Matcher<Node*>& rhs_matcher); | 333 const Matcher<Node*>& rhs_matcher); |
| 334 Matcher<Node*> IsWord64Shl(const Matcher<Node*>& lhs_matcher, | 334 Matcher<Node*> IsWord64Shl(const Matcher<Node*>& lhs_matcher, |
| 335 const Matcher<Node*>& rhs_matcher); | 335 const Matcher<Node*>& rhs_matcher); |
| 336 Matcher<Node*> IsWord64Sar(const Matcher<Node*>& lhs_matcher, | 336 Matcher<Node*> IsWord64Sar(const Matcher<Node*>& lhs_matcher, |
| 337 const Matcher<Node*>& rhs_matcher); | 337 const Matcher<Node*>& rhs_matcher); |
| 338 Matcher<Node*> IsWord64Equal(const Matcher<Node*>& lhs_matcher, | 338 Matcher<Node*> IsWord64Equal(const Matcher<Node*>& lhs_matcher, |
| 339 const Matcher<Node*>& rhs_matcher); | 339 const Matcher<Node*>& rhs_matcher); |
| 340 Matcher<Node*> IsInt32AddWithOverflow(const Matcher<Node*>& lhs_matcher, | 340 Matcher<Node*> IsInt32AddWithOverflow(const Matcher<Node*>& lhs_matcher, |
| 341 const Matcher<Node*>& rhs_matcher); | 341 const Matcher<Node*>& rhs_matcher); |
| 342 Matcher<Node*> IsInt32SubWithOverflow(const Matcher<Node*>& lhs_matcher, |
| 343 const Matcher<Node*>& rhs_matcher); |
| 342 Matcher<Node*> IsInt32Add(const Matcher<Node*>& lhs_matcher, | 344 Matcher<Node*> IsInt32Add(const Matcher<Node*>& lhs_matcher, |
| 343 const Matcher<Node*>& rhs_matcher); | 345 const Matcher<Node*>& rhs_matcher); |
| 344 Matcher<Node*> IsInt32Sub(const Matcher<Node*>& lhs_matcher, | 346 Matcher<Node*> IsInt32Sub(const Matcher<Node*>& lhs_matcher, |
| 345 const Matcher<Node*>& rhs_matcher); | 347 const Matcher<Node*>& rhs_matcher); |
| 346 Matcher<Node*> IsInt32Mul(const Matcher<Node*>& lhs_matcher, | 348 Matcher<Node*> IsInt32Mul(const Matcher<Node*>& lhs_matcher, |
| 347 const Matcher<Node*>& rhs_matcher); | 349 const Matcher<Node*>& rhs_matcher); |
| 348 Matcher<Node*> IsInt32MulHigh(const Matcher<Node*>& lhs_matcher, | 350 Matcher<Node*> IsInt32MulHigh(const Matcher<Node*>& lhs_matcher, |
| 349 const Matcher<Node*>& rhs_matcher); | 351 const Matcher<Node*>& rhs_matcher); |
| 350 Matcher<Node*> IsInt32LessThan(const Matcher<Node*>& lhs_matcher, | 352 Matcher<Node*> IsInt32LessThan(const Matcher<Node*>& lhs_matcher, |
| 351 const Matcher<Node*>& rhs_matcher); | 353 const Matcher<Node*>& rhs_matcher); |
| (...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 433 const Matcher<Node*>& mid_matcher, | 435 const Matcher<Node*>& mid_matcher, |
| 434 const Matcher<Node*>& rhs_matcher); | 436 const Matcher<Node*>& rhs_matcher); |
| 435 | 437 |
| 436 Matcher<Node*> IsStackSlot(); | 438 Matcher<Node*> IsStackSlot(); |
| 437 | 439 |
| 438 } // namespace compiler | 440 } // namespace compiler |
| 439 } // namespace internal | 441 } // namespace internal |
| 440 } // namespace v8 | 442 } // namespace v8 |
| 441 | 443 |
| 442 #endif // V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ | 444 #endif // V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_ |
| OLD | NEW |