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