Searched refs:NumMatches (Results 1 – 5 of 5) sorted by relevance
1053 unsigned NumMatches = 0; in MatchAndEmitInstruction() local1054 if (Match1 == Match_Success) MatchChars[NumMatches++] = Suffixes[0]; in MatchAndEmitInstruction()1055 if (Match2 == Match_Success) MatchChars[NumMatches++] = Suffixes[1]; in MatchAndEmitInstruction()1056 if (Match3 == Match_Success) MatchChars[NumMatches++] = Suffixes[2]; in MatchAndEmitInstruction()1057 if (Match4 == Match_Success) MatchChars[NumMatches++] = Suffixes[3]; in MatchAndEmitInstruction()1062 for (unsigned i = 0; i != NumMatches; ++i) { in MatchAndEmitInstruction()1065 if (i + 1 == NumMatches) in MatchAndEmitInstruction()
118 int NumMatches = 0; in apply() local126 NumMatches++; in apply()153 NumMatches++; in apply()159 if (0 == NumMatches) in apply()
2698 unsigned NumMatches = 0; in MatchAndEmitATTInstruction() local2701 MatchChars[NumMatches++] = Suffixes[I]; in MatchAndEmitATTInstruction()2706 for (unsigned i = 0; i != NumMatches; ++i) { in MatchAndEmitATTInstruction()2709 if (i + 1 == NumMatches) in MatchAndEmitATTInstruction()
3020 unsigned NumMatches = 0; in MatchAndEmitATTInstruction() local3023 MatchChars[NumMatches++] = Suffixes[I]; in MatchAndEmitATTInstruction()3028 for (unsigned i = 0; i != NumMatches; ++i) { in MatchAndEmitATTInstruction()3031 if (i + 1 == NumMatches) in MatchAndEmitATTInstruction()
10689 int NumMatches = Resolver.getNumMatches(); in ResolveAddressOfOverloadedFunction() local10692 if (NumMatches == 0 && ShouldComplain) { in ResolveAddressOfOverloadedFunction()10698 else if (NumMatches > 1 && ShouldComplain) in ResolveAddressOfOverloadedFunction()10700 else if (NumMatches == 1) { in ResolveAddressOfOverloadedFunction()