Lines Matching defs:Pattern
1 //===- DAGISelMatcher.h - Representation of DAG pattern matcher -----------===//
31 Matcher *ConvertPatternToMatcher(const PatternToMatch &Pattern,unsigned Variant,
397 /// to see if the entire pattern is capable of matching. This predicate does
659 const ComplexPattern &Pattern;
672 CheckComplexPatMatcher(const ComplexPattern &pattern, unsigned matchnumber,
674 : Matcher(CheckComplexPat), Pattern(pattern), MatchNumber(matchnumber),
677 const ComplexPattern &getPattern() const { return Pattern; }
687 // Not safe to move a pattern predicate past a complex pattern.
693 return &cast<CheckComplexPatMatcher>(M)->Pattern == &Pattern &&
697 return (unsigned)(intptr_t)&Pattern ^ MatchNumber;
750 /// (which defines a chain operand) is safe to fold into a larger pattern.
870 /// matched pattern that have chain input/outputs. This node adds all input
871 /// chains of these nodes if they are not themselves a node in the pattern.
964 /// operands in the root of the pattern. The rest are appended to this node.
1036 const PatternToMatch &Pattern;
1043 int numfixedarityoperands, const PatternToMatch &pattern)
1047 Pattern(pattern) {
1050 const PatternToMatch &getPattern() const { return Pattern; }
1058 /// pattern produce glue. This allows CompleteMatchMatcher to update them
1086 /// pattern with the newly generated nodes. This also prints a comment
1090 const PatternToMatch &Pattern;
1093 const PatternToMatch &pattern)
1095 Pattern(pattern) {}
1099 const PatternToMatch &getPattern() const { return Pattern; }
1109 &cast<CompleteMatchMatcher>(M)->Pattern == &Pattern;
