Searched refs:NearMatch (Results 1 – 3 of 3) sorted by relevance
185 NearMatch, // Close Match: use Specific Diagnostic enumerator192 : Predicate(Matches ? Match : NearMatch) {} in DiagnosticPredicate()197 constexpr bool isNearMatch() const { return Predicate == NearMatch; } in isNearMatch()
865 return DiagnosticPredicate::NearMatch; in isImmScaled()877 return DiagnosticPredicate::NearMatch; in isSVEPattern()889 return DiagnosticPredicate::NearMatch; in isSVEVecLenSpecifier()1065 return DiagnosticPredicate::NearMatch; in isSVECpyImm()1083 return DiagnosticPredicate::NearMatch; in isSVEAddSubImm()1318 return DiagnosticPredicate::NearMatch; in isSVEPredicateVectorRegOfWidth()1332 return DiagnosticPredicate::NearMatch; in isSVEPredicateOrPredicateAsCounterRegOfWidth()1343 return DiagnosticPredicate::NearMatch; in isSVEPredicateAsCounterRegOfWidth()1354 return DiagnosticPredicate::NearMatch; in isSVEDataVectorRegOfWidth()1377 return DiagnosticPredicate::NearMatch; in isSVEDataVectorRegWithShiftExtend()[all …]
9280 NearMatch = NearMatches.begin(), NearMatchEnd = NearMatches.end(); in DiagnoseInvalidRedeclaration() local9281 NearMatch != NearMatchEnd; ++NearMatch) { in DiagnoseInvalidRedeclaration()9282 FunctionDecl *FD = NearMatch->first; in DiagnoseInvalidRedeclaration()9288 if (unsigned Idx = NearMatch->second) { in DiagnoseInvalidRedeclaration()