81 // In particular, we want to match maximal patterns first and lowest cost within
99     // Otherwise, if the patterns might both match, sort based on complexity,  in operator ()()
100     // which means that we prefer to match patterns that cover more nodes in the  in operator ()()
109     // If the patterns have equal complexity, compare generated instruction cost  in operator ()()
126     // pattern may have been resolved into multiple match patterns due to  in operator ()()
135   Records.startTimer("Parse patterns");  in run()
154   LLVM_DEBUG(errs() << "\n\nALL PATTERNS TO MATCH:\n\n";  in run()
165   // Add all the patterns to a temporary list so we can sort them.  in run()
166   Records.startTimer("Sort patterns");  in run()
167   std::vector<const PatternToMatch *> Patterns;  in run()  local
169     Patterns.push_back(&PTM);  in run()
171   // We want to process the matches in order of minimal cost.  Sort the patterns  in run()
173   llvm::stable_sort(Patterns, PatternSortingPredicate(CGP));  in run()
178   for (const PatternToMatch *PTM : Patterns) {  in run()