lib/Sema/SemaOverload.cpp

3056   OverloadCandidateSet::iterator Best;
3059                                             Best, true)) {
3063     CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
3069     User.FoundConversionFunction = Best->FoundDecl;
3239   OverloadCandidateSet::iterator Best;
3241                                                         Best, true)) {
3246           = dyn_cast<CXXConstructorDecl>(Best->Function)) {
3258         if (Best->Conversions[0].isEllipsis())
3261           User.Before = Best->Conversions[0].Standard;
3267       User.FoundConversionFunction = Best->FoundDecl;
3274                  = dyn_cast<CXXConversionDecl>(Best->Function)) {
3281       User.Before = Best->Conversions[0].Standard;
3284       User.FoundConversionFunction = Best->FoundDecl;
3296       User.After = Best->FinalConversion;
4218   OverloadCandidateSet::iterator Best;
4219   switch (CandidateSet.BestViableFunction(S, DeclLoc, Best, true)) {
4231     if (!Best->FinalConversion.DirectBinding)
4235     ICS.UserDefined.Before = Best->Conversions[0].Standard;
4236     ICS.UserDefined.After = Best->FinalConversion;
4238     ICS.UserDefined.ConversionFunction = Best->Function;
4239     ICS.UserDefined.FoundConversionFunction = Best->FoundDecl;
5585     OverloadCandidateSet::iterator Best;
5586     switch (CandidateSet.BestViableFunction(*this, Loc, Best)) {
5590           DeclAccessPair::make(Best->Function, Best->FoundDecl.getAccess());
8717 /// \param Best If overload resolution was successful or found a deleted
8718 /// function, \p Best points to the candidate function found.
8723                                          iterator &Best,
8726   Best = end();
8729       if (Best == end() || isBetterOverloadCandidate(S, *Cand, *Best, Loc,
8731         Best = Cand;
8735   if (Best == end())
8744         Cand != Best &&
8745         !isBetterOverloadCandidate(S, *Best, *Cand, Loc,
8747       if (S.isEquivalentInternalLinkageDeclaration(Best->Function,
8753       Best = end();
8758   // Best is the best viable function.
8759   if (Best->Function &&
8760       (Best->Function->isDeleted() ||
8761        S.isFunctionConsideredUnavailable(Best->Function)))
8765     S.diagnoseEquivalentInternalLinkageDeclarations(Loc, Best->Function,
10273     auto Best = Matches.begin();
10275       if (isBetterCandidate(I->second, Best->second))
10276         Best = I;
10278     const FunctionDecl *BestFn = Best->second;
10288     Matches[0] = *Best;
10933       OverloadCandidateSet::iterator Best;
10934       if (Candidates.BestViableFunction(SemaRef, FnLoc, Best) != OR_Success) {
10972         SemaRef.Diag(Best->Function->getLocation(),
10976         SemaRef.Diag(Best->Function->getLocation(),
10983         SemaRef.Diag(Best->Function->getLocation(),
11151     OverloadCandidateSet::iterator Best;
11153         CandidateSet->BestViableFunction(*this, Fn->getLocStart(), Best) ==
11186                                            OverloadCandidateSet::iterator *Best,
11196     FunctionDecl *FDecl = (*Best)->Function;
11197     SemaRef.CheckUnresolvedLookupAccess(ULE, (*Best)->FoundDecl);
11200     Fn = SemaRef.FixOverloadedFunctionReference(Fn, (*Best)->FoundDecl, FDecl);
11244       << (*Best)->Function->isDeleted()
11246       << SemaRef.getDeletedOrUnavailableSuffix((*Best)->Function)
11252     FunctionDecl *FDecl = (*Best)->Function;
11253     Fn = SemaRef.FixOverloadedFunctionReference(Fn, (*Best)->FoundDecl, FDecl);
11301   OverloadCandidateSet::iterator Best;
11303       CandidateSet.BestViableFunction(*this, Fn->getLocStart(), Best);
11307                                   &Best, OverloadResult,
11395   OverloadCandidateSet::iterator Best;
11396   switch (CandidateSet.BestViableFunction(*this, OpLoc, Best)) {
11399     FunctionDecl *FnDecl = Best->Function;
11407         CheckMemberOperatorAccess(OpLoc, Args[0], nullptr, Best->FoundDecl);
11411                                               Best->FoundDecl, Method);
11429       ExprResult FnExpr = CreateFunctionRefExpr(*this, FnDecl, Best->FoundDecl,
11453         PerformImplicitConversion(Input, Best->BuiltinTypes.ParamTypes[0],
11454                                   Best->Conversions[0], AA_Passing);
11485       << Best->Function->isDeleted()
11487       << getDeletedOrUnavailableSuffix(Best->Function)
11605   OverloadCandidateSet::iterator Best;
11606   switch (CandidateSet.BestViableFunction(*this, OpLoc, Best)) {
11609       FunctionDecl *FnDecl = Best->Function;
11617           // Best->Access is only meaningful for class members.
11618           CheckMemberOperatorAccess(OpLoc, Args[0], Args[1], Best->FoundDecl);
11630                                                 Best->FoundDecl, Method);
11657                                                   Best->FoundDecl,
11694           PerformImplicitConversion(Args[0], Best->BuiltinTypes.ParamTypes[0],
11695                                     Best->Conversions[0], AA_Passing);
11701           PerformImplicitConversion(Args[1], Best->BuiltinTypes.ParamTypes[1],
11702                                     Best->Conversions[1], AA_Passing);
11762       if (isImplicitlyDeleted(Best->Function)) {
11763         CXXMethodDecl *Method = cast<CXXMethodDecl>(Best->Function);
11774           << Best->Function->isDeleted()
11776           << getDeletedOrUnavailableSuffix(Best->Function)
11837   OverloadCandidateSet::iterator Best;
11838   switch (CandidateSet.BestViableFunction(*this, LLoc, Best)) {
11841       FunctionDecl *FnDecl = Best->Function;
11847         CheckMemberOperatorAccess(LLoc, Args[0], Args[1], Best->FoundDecl);
11853                                               Best->FoundDecl, Method);
11874                                                   Best->FoundDecl,
11901           PerformImplicitConversion(Args[0], Best->BuiltinTypes.ParamTypes[0],
11902                                     Best->Conversions[0], AA_Passing);
11908           PerformImplicitConversion(Args[1], Best->BuiltinTypes.ParamTypes[1],
11909                                     Best->Conversions[1], AA_Passing);
11943         << Best->Function->isDeleted() << "[]"
11944         << getDeletedOrUnavailableSuffix(Best->Function)
12096     OverloadCandidateSet::iterator Best;
12098                                             Best)) {
12100       Method = cast<CXXMethodDecl>(Best->Function);
12101       FoundDecl = Best->FoundDecl;
12102       CheckUnresolvedMemberAccess(UnresExpr, Best->FoundDecl);
12103       if (DiagnoseUseOfDecl(Best->FoundDecl, UnresExpr->getNameLoc()))
12133         << Best->Function->isDeleted()
12135         << getDeletedOrUnavailableSuffix(Best->Function)
12339   OverloadCandidateSet::iterator Best;
12341                              Best)) {
12369       << Best->Function->isDeleted()
12371       << getDeletedOrUnavailableSuffix(Best->Function)
12377   if (Best == CandidateSet.end())
12382   if (Best->Function == nullptr) {
12387                          Best->Conversions[0].UserDefined.ConversionFunction);
12390                               Best->FoundDecl);
12391     if (DiagnoseUseOfDecl(Best->FoundDecl, LParenLoc))
12393     assert(Conv == Best->FoundDecl.getDecl() &&
12401     ExprResult Call = BuildCXXMemberCallExpr(Object.get(), Best->FoundDecl,
12413   CheckMemberOperatorAccess(LParenLoc, Object.get(), nullptr, Best->FoundDecl);
12418   CXXMethodDecl *Method = cast<CXXMethodDecl>(Best->Function);
12432   ExprResult NewFn = CreateFunctionRefExpr(*this, Method, Best->FoundDecl,
12470                                         Best->FoundDecl, Method);
12570   OverloadCandidateSet::iterator Best;
12571   switch (CandidateSet.BestViableFunction(*this, OpLoc, Best)) {
12605       << Best->Function->isDeleted()
12607       << getDeletedOrUnavailableSuffix(Best->Function)
12613   CheckMemberOperatorAccess(OpLoc, Base, nullptr, Best->FoundDecl);
12616   CXXMethodDecl *Method = cast<CXXMethodDecl>(Best->Function);
12619                                         Best->FoundDecl, Method);
12625   ExprResult FnExpr = CreateFunctionRefExpr(*this, Method, Best->FoundDecl,
12661   OverloadCandidateSet::iterator Best;
12662   switch (CandidateSet.BestViableFunction(*this, UDSuffixLoc, Best)) {
12679   FunctionDecl *FD = Best->Function;
12680   ExprResult Fn = CreateFunctionRefExpr(*this, FD, Best->FoundDecl,
12765     OverloadCandidateSet::iterator Best;
12767         CandidateSet->BestViableFunction(*this, Fn->getLocStart(), Best);
12774                                          Loc, nullptr, CandidateSet, &Best,