Lines Matching refs:Pattern
1 //===- DAGISelMatcher.h - Representation of DAG pattern matcher -*- C++ -*-===//
31 Matcher *ConvertPatternToMatcher(const PatternToMatch &Pattern,unsigned Variant,
429 /// to see if the entire pattern is capable of matching. This predicate does
719 const ComplexPattern &Pattern;
732 CheckComplexPatMatcher(const ComplexPattern &pattern, unsigned matchnumber,
734 : Matcher(CheckComplexPat), Pattern(pattern), MatchNumber(matchnumber),
737 const ComplexPattern &getPattern() const { return Pattern; }
747 // Not safe to move a pattern predicate past a complex pattern.
753 return &cast<CheckComplexPatMatcher>(M)->Pattern == &Pattern &&
757 return (unsigned)(intptr_t)&Pattern ^ MatchNumber;
810 /// (which defines a chain operand) is safe to fold into a larger pattern.
930 /// matched pattern that have chain input/outputs. This node adds all input
931 /// chains of these nodes if they are not themselves a node in the pattern.
1024 /// operands in the root of the pattern. The rest are appended to this node.
1098 const PatternToMatch &Pattern;
1105 int numfixedarityoperands, const PatternToMatch &pattern)
1109 Pattern(pattern) {
1112 const PatternToMatch &getPattern() const { return Pattern; }
1120 /// pattern produce glue. This allows CompleteMatchMatcher to update them
1148 /// pattern with the newly generated nodes. This also prints a comment
1152 const PatternToMatch &Pattern;
1155 const PatternToMatch &pattern)
1157 Pattern(pattern) {}
1161 const PatternToMatch &getPattern() const { return Pattern; }
1171 &cast<CompleteMatchMatcher>(M)->Pattern == &Pattern;
