30                               StringMatcher::StringPair*> &Matches) {  in FindFirstNonCommonLetter()  argument
31   assert(!Matches.empty());  in FindFirstNonCommonLetter()
32   for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {  in FindFirstNonCommonLetter()
34     char Letter = Matches[0]->first[i];  in FindFirstNonCommonLetter()
36     for (const StringMatcher::StringPair *Match : Matches)  in FindFirstNonCommonLetter()
41   return Matches[0]->first.size();  in FindFirstNonCommonLetter()
50     const std::vector<const StringPair *> &Matches, unsigned CharNo,  in EmitStringMatcherForChar()  argument
52   assert(!Matches.empty() && "Must have at least one string to match!");  in EmitStringMatcherForChar()
55   // If we have verified that the entire string matches, we're done: output the  in EmitStringMatcherForChar()
57   if (CharNo == Matches[0]->first.size()) {  in EmitStringMatcherForChar()
58     if (Matches.size() > 1 && !IgnoreDuplicates)  in EmitStringMatcherForChar()
62     StringRef Code = Matches[0]->second;  in EmitStringMatcherForChar()
65     OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";  in EmitStringMatcherForChar()
76   // Bucket the matches by the character we are comparing.  in EmitStringMatcherForChar()
79   for (const StringPair *Match : Matches)  in EmitStringMatcherForChar()
85     unsigned FirstNonCommonLetter = FindFirstNonCommonLetter(Matches);  in EmitStringMatcherForChar()
93       << Matches[0]->first[CharNo] << "')\n";  in EmitStringMatcherForChar()
99          << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", "  in EmitStringMatcherForChar()
104     return EmitStringMatcherForChar(Matches, FirstNonCommonLetter, IndentCount,  in EmitStringMatcherForChar()
133   if (Matches.empty()) return;  in Emit()
138   for (const StringPair &Match : Matches)  in Emit()