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/compiler-unittests/node-matchers.h" | 5 #include "test/compiler-unittests/node-matchers.h" |
6 | 6 |
7 #include <ostream> // NOLINT(readability/streams) | 7 #include <ostream> // NOLINT(readability/streams) |
8 | 8 |
9 #include "src/compiler/node-properties-inl.h" | 9 #include "src/compiler/node-properties-inl.h" |
10 | 10 |
(...skipping 414 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
425 | 425 |
426 | 426 |
427 #define IS_BINOP_MATCHER(Name) \ | 427 #define IS_BINOP_MATCHER(Name) \ |
428 Matcher<Node*> Is##Name(const Matcher<Node*>& lhs_matcher, \ | 428 Matcher<Node*> Is##Name(const Matcher<Node*>& lhs_matcher, \ |
429 const Matcher<Node*>& rhs_matcher) { \ | 429 const Matcher<Node*>& rhs_matcher) { \ |
430 return MakeMatcher( \ | 430 return MakeMatcher( \ |
431 new IsBinopMatcher(IrOpcode::k##Name, lhs_matcher, rhs_matcher)); \ | 431 new IsBinopMatcher(IrOpcode::k##Name, lhs_matcher, rhs_matcher)); \ |
432 } | 432 } |
433 IS_BINOP_MATCHER(Word32And) | 433 IS_BINOP_MATCHER(Word32And) |
434 IS_BINOP_MATCHER(Word32Sar) | 434 IS_BINOP_MATCHER(Word32Sar) |
| 435 IS_BINOP_MATCHER(Word32Ror) |
435 IS_BINOP_MATCHER(Word32Equal) | 436 IS_BINOP_MATCHER(Word32Equal) |
436 IS_BINOP_MATCHER(Word64And) | 437 IS_BINOP_MATCHER(Word64And) |
437 IS_BINOP_MATCHER(Word64Sar) | 438 IS_BINOP_MATCHER(Word64Sar) |
438 IS_BINOP_MATCHER(Word64Shl) | 439 IS_BINOP_MATCHER(Word64Shl) |
439 IS_BINOP_MATCHER(Word64Equal) | 440 IS_BINOP_MATCHER(Word64Equal) |
440 IS_BINOP_MATCHER(Int32AddWithOverflow) | 441 IS_BINOP_MATCHER(Int32AddWithOverflow) |
441 #undef IS_BINOP_MATCHER | 442 #undef IS_BINOP_MATCHER |
442 | 443 |
443 | 444 |
444 #define IS_UNOP_MATCHER(Name) \ | 445 #define IS_UNOP_MATCHER(Name) \ |
445 Matcher<Node*> Is##Name(const Matcher<Node*>& input_matcher) { \ | 446 Matcher<Node*> Is##Name(const Matcher<Node*>& input_matcher) { \ |
446 return MakeMatcher(new IsUnopMatcher(IrOpcode::k##Name, input_matcher)); \ | 447 return MakeMatcher(new IsUnopMatcher(IrOpcode::k##Name, input_matcher)); \ |
447 } | 448 } |
448 IS_UNOP_MATCHER(ConvertInt64ToInt32) | 449 IS_UNOP_MATCHER(ConvertInt64ToInt32) |
449 IS_UNOP_MATCHER(ChangeInt32ToFloat64) | 450 IS_UNOP_MATCHER(ChangeInt32ToFloat64) |
450 #undef IS_UNOP_MATCHER | 451 #undef IS_UNOP_MATCHER |
451 | 452 |
452 } // namespace compiler | 453 } // namespace compiler |
453 } // namespace internal | 454 } // namespace internal |
454 } // namespace v8 | 455 } // namespace v8 |
OLD | NEW |