Lines Matching refs:Patterns
62 // In particular, we want to match maximal patterns first and lowest cost within
82 // Otherwise, if the patterns might both match, sort based on complexity,
83 // which means that we prefer to match patterns that cover more nodes in the
90 // If the patterns have equal complexity, compare generated instruction cost
118 DEBUG(errs() << "\n\nALL PATTERNS TO MATCH:\n\n";
126 // Add all the patterns to a temporary list so we can sort them.
127 std::vector<const PatternToMatch*> Patterns;
130 Patterns.push_back(&*I);
132 // We want to process the matches in order of minimal cost. Sort the patterns
134 std::sort(Patterns.begin(), Patterns.end(), PatternSortingPredicate(CGP));
139 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
141 if (Matcher *M = ConvertPatternToMatcher(*Patterns[i], Variant, CGP))
