1 //===--------------------- SemaLookup.cpp - Name Lookup ------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements name lookup for C, C++, Objective-C, and
13 //===----------------------------------------------------------------------===//
15 #include "clang/AST/ASTContext.h"
16 #include "clang/AST/CXXInheritance.h"
17 #include "clang/AST/Decl.h"
18 #include "clang/AST/DeclCXX.h"
19 #include "clang/AST/DeclLookups.h"
20 #include "clang/AST/DeclObjC.h"
21 #include "clang/AST/DeclTemplate.h"
22 #include "clang/AST/Expr.h"
23 #include "clang/AST/ExprCXX.h"
24 #include "clang/Basic/Builtins.h"
25 #include "clang/Basic/LangOptions.h"
26 #include "clang/Lex/HeaderSearch.h"
27 #include "clang/Lex/ModuleLoader.h"
28 #include "clang/Lex/Preprocessor.h"
29 #include "clang/Sema/DeclSpec.h"
30 #include "clang/Sema/Lookup.h"
31 #include "clang/Sema/Overload.h"
32 #include "clang/Sema/Scope.h"
33 #include "clang/Sema/ScopeInfo.h"
34 #include "clang/Sema/Sema.h"
35 #include "clang/Sema/SemaInternal.h"
36 #include "clang/Sema/TemplateDeduction.h"
37 #include "clang/Sema/TypoCorrection.h"
38 #include "llvm/ADT/STLExtras.h"
39 #include "llvm/ADT/SmallPtrSet.h"
40 #include "llvm/ADT/TinyPtrVector.h"
41 #include "llvm/ADT/edit_distance.h"
42 #include "llvm/Support/ErrorHandling.h"
50 using namespace clang;
54 class UnqualUsingEntry {
55 const DeclContext *Nominated;
56 const DeclContext *CommonAncestor;
59 UnqualUsingEntry(const DeclContext *Nominated,
60 const DeclContext *CommonAncestor)
61 : Nominated(Nominated), CommonAncestor(CommonAncestor) {
64 const DeclContext *getCommonAncestor() const {
65 return CommonAncestor;
68 const DeclContext *getNominatedNamespace() const {
72 // Sort by the pointer value of the common ancestor.
74 bool operator()(const UnqualUsingEntry &L, const UnqualUsingEntry &R) {
75 return L.getCommonAncestor() < R.getCommonAncestor();
78 bool operator()(const UnqualUsingEntry &E, const DeclContext *DC) {
79 return E.getCommonAncestor() < DC;
82 bool operator()(const DeclContext *DC, const UnqualUsingEntry &E) {
83 return DC < E.getCommonAncestor();
88 /// A collection of using directives, as used by C++ unqualified
90 class UnqualUsingDirectiveSet {
91 typedef SmallVector<UnqualUsingEntry, 8> ListTy;
94 llvm::SmallPtrSet<DeclContext*, 8> visited;
97 UnqualUsingDirectiveSet() {}
99 void visitScopeChain(Scope *S, Scope *InnermostFileScope) {
100 // C++ [namespace.udir]p1:
101 // During unqualified name lookup, the names appear as if they
102 // were declared in the nearest enclosing namespace which contains
103 // both the using-directive and the nominated namespace.
104 DeclContext *InnermostFileDC = InnermostFileScope->getEntity();
105 assert(InnermostFileDC && InnermostFileDC->isFileContext());
107 for (; S; S = S->getParent()) {
108 // C++ [namespace.udir]p1:
109 // A using-directive shall not appear in class scope, but may
110 // appear in namespace scope or in block scope.
111 DeclContext *Ctx = S->getEntity();
112 if (Ctx && Ctx->isFileContext()) {
114 } else if (!Ctx || Ctx->isFunctionOrMethod()) {
115 for (auto *I : S->using_directives())
116 visit(I, InnermostFileDC);
121 // Visits a context and collect all of its using directives
122 // recursively. Treats all using directives as if they were
123 // declared in the context.
125 // A given context is only every visited once, so it is important
126 // that contexts be visited from the inside out in order to get
127 // the effective DCs right.
128 void visit(DeclContext *DC, DeclContext *EffectiveDC) {
129 if (!visited.insert(DC).second)
132 addUsingDirectives(DC, EffectiveDC);
135 // Visits a using directive and collects all of its using
136 // directives recursively. Treats all using directives as if they
137 // were declared in the effective DC.
138 void visit(UsingDirectiveDecl *UD, DeclContext *EffectiveDC) {
139 DeclContext *NS = UD->getNominatedNamespace();
140 if (!visited.insert(NS).second)
143 addUsingDirective(UD, EffectiveDC);
144 addUsingDirectives(NS, EffectiveDC);
147 // Adds all the using directives in a context (and those nominated
148 // by its using directives, transitively) as if they appeared in
149 // the given effective context.
150 void addUsingDirectives(DeclContext *DC, DeclContext *EffectiveDC) {
151 SmallVector<DeclContext*, 4> queue;
153 for (auto UD : DC->using_directives()) {
154 DeclContext *NS = UD->getNominatedNamespace();
155 if (visited.insert(NS).second) {
156 addUsingDirective(UD, EffectiveDC);
164 DC = queue.pop_back_val();
168 // Add a using directive as if it had been declared in the given
169 // context. This helps implement C++ [namespace.udir]p3:
170 // The using-directive is transitive: if a scope contains a
171 // using-directive that nominates a second namespace that itself
172 // contains using-directives, the effect is as if the
173 // using-directives from the second namespace also appeared in
175 void addUsingDirective(UsingDirectiveDecl *UD, DeclContext *EffectiveDC) {
176 // Find the common ancestor between the effective context and
177 // the nominated namespace.
178 DeclContext *Common = UD->getNominatedNamespace();
179 while (!Common->Encloses(EffectiveDC))
180 Common = Common->getParent();
181 Common = Common->getPrimaryContext();
183 list.push_back(UnqualUsingEntry(UD->getNominatedNamespace(), Common));
187 std::sort(list.begin(), list.end(), UnqualUsingEntry::Comparator());
190 typedef ListTy::const_iterator const_iterator;
192 const_iterator begin() const { return list.begin(); }
193 const_iterator end() const { return list.end(); }
195 llvm::iterator_range<const_iterator>
196 getNamespacesFor(DeclContext *DC) const {
197 return llvm::make_range(std::equal_range(begin(), end(),
198 DC->getPrimaryContext(),
199 UnqualUsingEntry::Comparator()));
202 } // end anonymous namespace
204 // Retrieve the set of identifier namespaces that correspond to a
205 // specific kind of name lookup.
206 static inline unsigned getIDNS(Sema::LookupNameKind NameKind,
208 bool Redeclaration) {
211 case Sema::LookupObjCImplicitSelfParam:
212 case Sema::LookupOrdinaryName:
213 case Sema::LookupRedeclarationWithLinkage:
214 case Sema::LookupLocalFriendName:
215 IDNS = Decl::IDNS_Ordinary;
217 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Member | Decl::IDNS_Namespace;
219 IDNS |= Decl::IDNS_TagFriend | Decl::IDNS_OrdinaryFriend;
222 IDNS |= Decl::IDNS_LocalExtern;
225 case Sema::LookupOperatorName:
226 // Operator lookup is its own crazy thing; it is not the same
227 // as (e.g.) looking up an operator name for redeclaration.
228 assert(!Redeclaration && "cannot do redeclaration operator lookup");
229 IDNS = Decl::IDNS_NonMemberOperator;
232 case Sema::LookupTagName:
234 IDNS = Decl::IDNS_Type;
236 // When looking for a redeclaration of a tag name, we add:
237 // 1) TagFriend to find undeclared friend decls
238 // 2) Namespace because they can't "overload" with tag decls.
239 // 3) Tag because it includes class templates, which can't
240 // "overload" with tag decls.
242 IDNS |= Decl::IDNS_Tag | Decl::IDNS_TagFriend | Decl::IDNS_Namespace;
244 IDNS = Decl::IDNS_Tag;
248 case Sema::LookupLabel:
249 IDNS = Decl::IDNS_Label;
252 case Sema::LookupMemberName:
253 IDNS = Decl::IDNS_Member;
255 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Ordinary;
258 case Sema::LookupNestedNameSpecifierName:
259 IDNS = Decl::IDNS_Type | Decl::IDNS_Namespace;
262 case Sema::LookupNamespaceName:
263 IDNS = Decl::IDNS_Namespace;
266 case Sema::LookupUsingDeclName:
267 assert(Redeclaration && "should only be used for redecl lookup");
268 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag | Decl::IDNS_Member |
269 Decl::IDNS_Using | Decl::IDNS_TagFriend | Decl::IDNS_OrdinaryFriend |
270 Decl::IDNS_LocalExtern;
273 case Sema::LookupObjCProtocolName:
274 IDNS = Decl::IDNS_ObjCProtocol;
277 case Sema::LookupOMPReductionName:
278 IDNS = Decl::IDNS_OMPReduction;
281 case Sema::LookupAnyName:
282 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag | Decl::IDNS_Member
283 | Decl::IDNS_Using | Decl::IDNS_Namespace | Decl::IDNS_ObjCProtocol
290 void LookupResult::configure() {
291 IDNS = getIDNS(LookupKind, getSema().getLangOpts().CPlusPlus,
292 isForRedeclaration());
294 // If we're looking for one of the allocation or deallocation
295 // operators, make sure that the implicitly-declared new and delete
296 // operators can be found.
297 switch (NameInfo.getName().getCXXOverloadedOperator()) {
301 case OO_Array_Delete:
302 getSema().DeclareGlobalNewDelete();
309 // Compiler builtins are always visible, regardless of where they end
310 // up being declared.
311 if (IdentifierInfo *Id = NameInfo.getName().getAsIdentifierInfo()) {
312 if (unsigned BuiltinID = Id->getBuiltinID()) {
313 if (!getSema().Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
319 bool LookupResult::sanity() const {
320 // This function is never called by NDEBUG builds.
321 assert(ResultKind != NotFound || Decls.size() == 0);
322 assert(ResultKind != Found || Decls.size() == 1);
323 assert(ResultKind != FoundOverloaded || Decls.size() > 1 ||
324 (Decls.size() == 1 &&
325 isa<FunctionTemplateDecl>((*begin())->getUnderlyingDecl())));
326 assert(ResultKind != FoundUnresolvedValue || sanityCheckUnresolved());
327 assert(ResultKind != Ambiguous || Decls.size() > 1 ||
328 (Decls.size() == 1 && (Ambiguity == AmbiguousBaseSubobjects ||
329 Ambiguity == AmbiguousBaseSubobjectTypes)));
330 assert((Paths != nullptr) == (ResultKind == Ambiguous &&
331 (Ambiguity == AmbiguousBaseSubobjectTypes ||
332 Ambiguity == AmbiguousBaseSubobjects)));
336 // Necessary because CXXBasePaths is not complete in Sema.h
337 void LookupResult::deletePaths(CXXBasePaths *Paths) {
341 /// Get a representative context for a declaration such that two declarations
342 /// will have the same context if they were found within the same scope.
343 static DeclContext *getContextForScopeMatching(Decl *D) {
344 // For function-local declarations, use that function as the context. This
345 // doesn't account for scopes within the function; the caller must deal with
347 DeclContext *DC = D->getLexicalDeclContext();
348 if (DC->isFunctionOrMethod())
351 // Otherwise, look at the semantic context of the declaration. The
352 // declaration must have been found there.
353 return D->getDeclContext()->getRedeclContext();
356 /// \brief Determine whether \p D is a better lookup result than \p Existing,
357 /// given that they declare the same entity.
358 static bool isPreferredLookupResult(Sema &S, Sema::LookupNameKind Kind,
359 NamedDecl *D, NamedDecl *Existing) {
360 // When looking up redeclarations of a using declaration, prefer a using
361 // shadow declaration over any other declaration of the same entity.
362 if (Kind == Sema::LookupUsingDeclName && isa<UsingShadowDecl>(D) &&
363 !isa<UsingShadowDecl>(Existing))
366 auto *DUnderlying = D->getUnderlyingDecl();
367 auto *EUnderlying = Existing->getUnderlyingDecl();
369 // If they have different underlying declarations, prefer a typedef over the
370 // original type (this happens when two type declarations denote the same
371 // type), per a generous reading of C++ [dcl.typedef]p3 and p4. The typedef
372 // might carry additional semantic information, such as an alignment override.
373 // However, per C++ [dcl.typedef]p5, when looking up a tag name, prefer a tag
374 // declaration over a typedef.
375 if (DUnderlying->getCanonicalDecl() != EUnderlying->getCanonicalDecl()) {
376 assert(isa<TypeDecl>(DUnderlying) && isa<TypeDecl>(EUnderlying));
377 bool HaveTag = isa<TagDecl>(EUnderlying);
378 bool WantTag = Kind == Sema::LookupTagName;
379 return HaveTag != WantTag;
382 // Pick the function with more default arguments.
383 // FIXME: In the presence of ambiguous default arguments, we should keep both,
384 // so we can diagnose the ambiguity if the default argument is needed.
385 // See C++ [over.match.best]p3.
386 if (auto *DFD = dyn_cast<FunctionDecl>(DUnderlying)) {
387 auto *EFD = cast<FunctionDecl>(EUnderlying);
388 unsigned DMin = DFD->getMinRequiredArguments();
389 unsigned EMin = EFD->getMinRequiredArguments();
390 // If D has more default arguments, it is preferred.
393 // FIXME: When we track visibility for default function arguments, check
394 // that we pick the declaration with more visible default arguments.
397 // Pick the template with more default template arguments.
398 if (auto *DTD = dyn_cast<TemplateDecl>(DUnderlying)) {
399 auto *ETD = cast<TemplateDecl>(EUnderlying);
400 unsigned DMin = DTD->getTemplateParameters()->getMinRequiredArguments();
401 unsigned EMin = ETD->getTemplateParameters()->getMinRequiredArguments();
402 // If D has more default arguments, it is preferred. Note that default
403 // arguments (and their visibility) is monotonically increasing across the
404 // redeclaration chain, so this is a quick proxy for "is more recent".
407 // If D has more *visible* default arguments, it is preferred. Note, an
408 // earlier default argument being visible does not imply that a later
409 // default argument is visible, so we can't just check the first one.
410 for (unsigned I = DMin, N = DTD->getTemplateParameters()->size();
412 if (!S.hasVisibleDefaultArgument(
413 ETD->getTemplateParameters()->getParam(I)) &&
414 S.hasVisibleDefaultArgument(
415 DTD->getTemplateParameters()->getParam(I)))
420 // VarDecl can have incomplete array types, prefer the one with more complete
422 if (VarDecl *DVD = dyn_cast<VarDecl>(DUnderlying)) {
423 VarDecl *EVD = cast<VarDecl>(EUnderlying);
424 if (EVD->getType()->isIncompleteType() &&
425 !DVD->getType()->isIncompleteType()) {
426 // Prefer the decl with a more complete type if visible.
427 return S.isVisible(DVD);
429 return false; // Avoid picking up a newer decl, just because it was newer.
432 // For most kinds of declaration, it doesn't really matter which one we pick.
433 if (!isa<FunctionDecl>(DUnderlying) && !isa<VarDecl>(DUnderlying)) {
434 // If the existing declaration is hidden, prefer the new one. Otherwise,
435 // keep what we've got.
436 return !S.isVisible(Existing);
439 // Pick the newer declaration; it might have a more precise type.
440 for (Decl *Prev = DUnderlying->getPreviousDecl(); Prev;
441 Prev = Prev->getPreviousDecl())
442 if (Prev == EUnderlying)
447 /// Determine whether \p D can hide a tag declaration.
448 static bool canHideTag(NamedDecl *D) {
449 // C++ [basic.scope.declarative]p4:
450 // Given a set of declarations in a single declarative region [...]
451 // exactly one declaration shall declare a class name or enumeration name
452 // that is not a typedef name and the other declarations shall all refer to
453 // the same variable, non-static data member, or enumerator, or all refer
454 // to functions and function templates; in this case the class name or
455 // enumeration name is hidden.
456 // C++ [basic.scope.hiding]p2:
457 // A class name or enumeration name can be hidden by the name of a
458 // variable, data member, function, or enumerator declared in the same
460 // An UnresolvedUsingValueDecl always instantiates to one of these.
461 D = D->getUnderlyingDecl();
462 return isa<VarDecl>(D) || isa<EnumConstantDecl>(D) || isa<FunctionDecl>(D) ||
463 isa<FunctionTemplateDecl>(D) || isa<FieldDecl>(D) ||
464 isa<UnresolvedUsingValueDecl>(D);
467 /// Resolves the result kind of this lookup.
468 void LookupResult::resolveKind() {
469 unsigned N = Decls.size();
471 // Fast case: no possible ambiguity.
473 assert(ResultKind == NotFound ||
474 ResultKind == NotFoundInCurrentInstantiation);
478 // If there's a single decl, we need to examine it to decide what
479 // kind of lookup this is.
481 NamedDecl *D = (*Decls.begin())->getUnderlyingDecl();
482 if (isa<FunctionTemplateDecl>(D))
483 ResultKind = FoundOverloaded;
484 else if (isa<UnresolvedUsingValueDecl>(D))
485 ResultKind = FoundUnresolvedValue;
489 // Don't do any extra resolution if we've already resolved as ambiguous.
490 if (ResultKind == Ambiguous) return;
492 llvm::SmallDenseMap<NamedDecl*, unsigned, 16> Unique;
493 llvm::SmallDenseMap<QualType, unsigned, 16> UniqueTypes;
495 bool Ambiguous = false;
496 bool HasTag = false, HasFunction = false;
497 bool HasFunctionTemplate = false, HasUnresolved = false;
498 NamedDecl *HasNonFunction = nullptr;
500 llvm::SmallVector<NamedDecl*, 4> EquivalentNonFunctions;
502 unsigned UniqueTagIndex = 0;
506 NamedDecl *D = Decls[I]->getUnderlyingDecl();
507 D = cast<NamedDecl>(D->getCanonicalDecl());
509 // Ignore an invalid declaration unless it's the only one left.
510 if (D->isInvalidDecl() && !(I == 0 && N == 1)) {
511 Decls[I] = Decls[--N];
515 llvm::Optional<unsigned> ExistingI;
517 // Redeclarations of types via typedef can occur both within a scope
518 // and, through using declarations and directives, across scopes. There is
519 // no ambiguity if they all refer to the same type, so unique based on the
521 if (TypeDecl *TD = dyn_cast<TypeDecl>(D)) {
522 QualType T = getSema().Context.getTypeDeclType(TD);
523 auto UniqueResult = UniqueTypes.insert(
524 std::make_pair(getSema().Context.getCanonicalType(T), I));
525 if (!UniqueResult.second) {
526 // The type is not unique.
527 ExistingI = UniqueResult.first->second;
531 // For non-type declarations, check for a prior lookup result naming this
532 // canonical declaration.
534 auto UniqueResult = Unique.insert(std::make_pair(D, I));
535 if (!UniqueResult.second) {
536 // We've seen this entity before.
537 ExistingI = UniqueResult.first->second;
542 // This is not a unique lookup result. Pick one of the results and
543 // discard the other.
544 if (isPreferredLookupResult(getSema(), getLookupKind(), Decls[I],
546 Decls[*ExistingI] = Decls[I];
547 Decls[I] = Decls[--N];
551 // Otherwise, do some decl type analysis and then continue.
553 if (isa<UnresolvedUsingValueDecl>(D)) {
554 HasUnresolved = true;
555 } else if (isa<TagDecl>(D)) {
560 } else if (isa<FunctionTemplateDecl>(D)) {
562 HasFunctionTemplate = true;
563 } else if (isa<FunctionDecl>(D)) {
566 if (HasNonFunction) {
567 // If we're about to create an ambiguity between two declarations that
568 // are equivalent, but one is an internal linkage declaration from one
569 // module and the other is an internal linkage declaration from another
570 // module, just skip it.
571 if (getSema().isEquivalentInternalLinkageDeclaration(HasNonFunction,
573 EquivalentNonFunctions.push_back(D);
574 Decls[I] = Decls[--N];
585 // C++ [basic.scope.hiding]p2:
586 // A class name or enumeration name can be hidden by the name of
587 // an object, function, or enumerator declared in the same
588 // scope. If a class or enumeration name and an object, function,
589 // or enumerator are declared in the same scope (in any order)
590 // with the same name, the class or enumeration name is hidden
591 // wherever the object, function, or enumerator name is visible.
592 // But it's still an error if there are distinct tag types found,
593 // even if they're not visible. (ref?)
594 if (N > 1 && HideTags && HasTag && !Ambiguous &&
595 (HasFunction || HasNonFunction || HasUnresolved)) {
596 NamedDecl *OtherDecl = Decls[UniqueTagIndex ? 0 : N - 1];
597 if (isa<TagDecl>(Decls[UniqueTagIndex]->getUnderlyingDecl()) &&
598 getContextForScopeMatching(Decls[UniqueTagIndex])->Equals(
599 getContextForScopeMatching(OtherDecl)) &&
600 canHideTag(OtherDecl))
601 Decls[UniqueTagIndex] = Decls[--N];
606 // FIXME: This diagnostic should really be delayed until we're done with
607 // the lookup result, in case the ambiguity is resolved by the caller.
608 if (!EquivalentNonFunctions.empty() && !Ambiguous)
609 getSema().diagnoseEquivalentInternalLinkageDeclarations(
610 getNameLoc(), HasNonFunction, EquivalentNonFunctions);
614 if (HasNonFunction && (HasFunction || HasUnresolved))
618 setAmbiguous(LookupResult::AmbiguousReference);
619 else if (HasUnresolved)
620 ResultKind = LookupResult::FoundUnresolvedValue;
621 else if (N > 1 || HasFunctionTemplate)
622 ResultKind = LookupResult::FoundOverloaded;
624 ResultKind = LookupResult::Found;
627 void LookupResult::addDeclsFromBasePaths(const CXXBasePaths &P) {
628 CXXBasePaths::const_paths_iterator I, E;
629 for (I = P.begin(), E = P.end(); I != E; ++I)
630 for (DeclContext::lookup_iterator DI = I->Decls.begin(),
631 DE = I->Decls.end(); DI != DE; ++DI)
635 void LookupResult::setAmbiguousBaseSubobjects(CXXBasePaths &P) {
636 Paths = new CXXBasePaths;
638 addDeclsFromBasePaths(*Paths);
640 setAmbiguous(AmbiguousBaseSubobjects);
643 void LookupResult::setAmbiguousBaseSubobjectTypes(CXXBasePaths &P) {
644 Paths = new CXXBasePaths;
646 addDeclsFromBasePaths(*Paths);
648 setAmbiguous(AmbiguousBaseSubobjectTypes);
651 void LookupResult::print(raw_ostream &Out) {
652 Out << Decls.size() << " result(s)";
653 if (isAmbiguous()) Out << ", ambiguous";
654 if (Paths) Out << ", base paths present";
656 for (iterator I = begin(), E = end(); I != E; ++I) {
662 LLVM_DUMP_METHOD void LookupResult::dump() {
663 llvm::errs() << "lookup results for " << getLookupName().getAsString()
665 for (NamedDecl *D : *this)
669 /// \brief Lookup a builtin function, when name lookup would otherwise
671 static bool LookupBuiltin(Sema &S, LookupResult &R) {
672 Sema::LookupNameKind NameKind = R.getLookupKind();
674 // If we didn't find a use of this identifier, and if the identifier
675 // corresponds to a compiler builtin, create the decl object for the builtin
676 // now, injecting it into translation unit scope, and return it.
677 if (NameKind == Sema::LookupOrdinaryName ||
678 NameKind == Sema::LookupRedeclarationWithLinkage) {
679 IdentifierInfo *II = R.getLookupName().getAsIdentifierInfo();
681 if (S.getLangOpts().CPlusPlus && NameKind == Sema::LookupOrdinaryName) {
682 if (II == S.getASTContext().getMakeIntegerSeqName()) {
683 R.addDecl(S.getASTContext().getMakeIntegerSeqDecl());
685 } else if (II == S.getASTContext().getTypePackElementName()) {
686 R.addDecl(S.getASTContext().getTypePackElementDecl());
691 // If this is a builtin on this (or all) targets, create the decl.
692 if (unsigned BuiltinID = II->getBuiltinID()) {
693 // In C++ and OpenCL (spec v1.2 s6.9.f), we don't have any predefined
694 // library functions like 'malloc'. Instead, we'll just error.
695 if ((S.getLangOpts().CPlusPlus || S.getLangOpts().OpenCL) &&
696 S.Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
699 if (NamedDecl *D = S.LazilyCreateBuiltin((IdentifierInfo *)II,
700 BuiltinID, S.TUScope,
701 R.isForRedeclaration(),
713 /// \brief Determine whether we can declare a special member function within
714 /// the class at this point.
715 static bool CanDeclareSpecialMemberFunction(const CXXRecordDecl *Class) {
716 // We need to have a definition for the class.
717 if (!Class->getDefinition() || Class->isDependentContext())
720 // We can't be in the middle of defining the class.
721 return !Class->isBeingDefined();
724 void Sema::ForceDeclarationOfImplicitMembers(CXXRecordDecl *Class) {
725 if (!CanDeclareSpecialMemberFunction(Class))
728 // If the default constructor has not yet been declared, do so now.
729 if (Class->needsImplicitDefaultConstructor())
730 DeclareImplicitDefaultConstructor(Class);
732 // If the copy constructor has not yet been declared, do so now.
733 if (Class->needsImplicitCopyConstructor())
734 DeclareImplicitCopyConstructor(Class);
736 // If the copy assignment operator has not yet been declared, do so now.
737 if (Class->needsImplicitCopyAssignment())
738 DeclareImplicitCopyAssignment(Class);
740 if (getLangOpts().CPlusPlus11) {
741 // If the move constructor has not yet been declared, do so now.
742 if (Class->needsImplicitMoveConstructor())
743 DeclareImplicitMoveConstructor(Class);
745 // If the move assignment operator has not yet been declared, do so now.
746 if (Class->needsImplicitMoveAssignment())
747 DeclareImplicitMoveAssignment(Class);
750 // If the destructor has not yet been declared, do so now.
751 if (Class->needsImplicitDestructor())
752 DeclareImplicitDestructor(Class);
755 /// \brief Determine whether this is the name of an implicitly-declared
756 /// special member function.
757 static bool isImplicitlyDeclaredMemberFunctionName(DeclarationName Name) {
758 switch (Name.getNameKind()) {
759 case DeclarationName::CXXConstructorName:
760 case DeclarationName::CXXDestructorName:
763 case DeclarationName::CXXOperatorName:
764 return Name.getCXXOverloadedOperator() == OO_Equal;
773 /// \brief If there are any implicit member functions with the given name
774 /// that need to be declared in the given declaration context, do so.
775 static void DeclareImplicitMemberFunctionsWithName(Sema &S,
776 DeclarationName Name,
778 const DeclContext *DC) {
782 switch (Name.getNameKind()) {
783 case DeclarationName::CXXConstructorName:
784 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
785 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
786 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
787 if (Record->needsImplicitDefaultConstructor())
788 S.DeclareImplicitDefaultConstructor(Class);
789 if (Record->needsImplicitCopyConstructor())
790 S.DeclareImplicitCopyConstructor(Class);
791 if (S.getLangOpts().CPlusPlus11 &&
792 Record->needsImplicitMoveConstructor())
793 S.DeclareImplicitMoveConstructor(Class);
797 case DeclarationName::CXXDestructorName:
798 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
799 if (Record->getDefinition() && Record->needsImplicitDestructor() &&
800 CanDeclareSpecialMemberFunction(Record))
801 S.DeclareImplicitDestructor(const_cast<CXXRecordDecl *>(Record));
804 case DeclarationName::CXXOperatorName:
805 if (Name.getCXXOverloadedOperator() != OO_Equal)
808 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC)) {
809 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
810 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
811 if (Record->needsImplicitCopyAssignment())
812 S.DeclareImplicitCopyAssignment(Class);
813 if (S.getLangOpts().CPlusPlus11 &&
814 Record->needsImplicitMoveAssignment())
815 S.DeclareImplicitMoveAssignment(Class);
820 case DeclarationName::CXXDeductionGuideName:
821 S.DeclareImplicitDeductionGuides(Name.getCXXDeductionGuideTemplate(), Loc);
829 // Adds all qualifying matches for a name within a decl context to the
830 // given lookup result. Returns true if any matches were found.
831 static bool LookupDirect(Sema &S, LookupResult &R, const DeclContext *DC) {
834 // Lazily declare C++ special member functions.
835 if (S.getLangOpts().CPlusPlus)
836 DeclareImplicitMemberFunctionsWithName(S, R.getLookupName(), R.getNameLoc(),
839 // Perform lookup into this declaration context.
840 DeclContext::lookup_result DR = DC->lookup(R.getLookupName());
841 for (NamedDecl *D : DR) {
842 if ((D = R.getAcceptableDecl(D))) {
848 if (!Found && DC->isTranslationUnit() && LookupBuiltin(S, R))
851 if (R.getLookupName().getNameKind()
852 != DeclarationName::CXXConversionFunctionName ||
853 R.getLookupName().getCXXNameType()->isDependentType() ||
854 !isa<CXXRecordDecl>(DC))
858 // A specialization of a conversion function template is not found by
859 // name lookup. Instead, any conversion function templates visible in the
860 // context of the use are considered. [...]
861 const CXXRecordDecl *Record = cast<CXXRecordDecl>(DC);
862 if (!Record->isCompleteDefinition())
865 for (CXXRecordDecl::conversion_iterator U = Record->conversion_begin(),
866 UEnd = Record->conversion_end(); U != UEnd; ++U) {
867 FunctionTemplateDecl *ConvTemplate = dyn_cast<FunctionTemplateDecl>(*U);
871 // When we're performing lookup for the purposes of redeclaration, just
872 // add the conversion function template. When we deduce template
873 // arguments for specializations, we'll end up unifying the return
874 // type of the new declaration with the type of the function template.
875 if (R.isForRedeclaration()) {
876 R.addDecl(ConvTemplate);
882 // [...] For each such operator, if argument deduction succeeds
883 // (14.9.2.3), the resulting specialization is used as if found by
886 // When referencing a conversion function for any purpose other than
887 // a redeclaration (such that we'll be building an expression with the
888 // result), perform template argument deduction and place the
889 // specialization into the result set. We do this to avoid forcing all
890 // callers to perform special deduction for conversion functions.
891 TemplateDeductionInfo Info(R.getNameLoc());
892 FunctionDecl *Specialization = nullptr;
894 const FunctionProtoType *ConvProto
895 = ConvTemplate->getTemplatedDecl()->getType()->getAs<FunctionProtoType>();
896 assert(ConvProto && "Nonsensical conversion function template type");
898 // Compute the type of the function that we would expect the conversion
899 // function to have, if it were to match the name given.
900 // FIXME: Calling convention!
901 FunctionProtoType::ExtProtoInfo EPI = ConvProto->getExtProtoInfo();
902 EPI.ExtInfo = EPI.ExtInfo.withCallingConv(CC_C);
903 EPI.ExceptionSpec = EST_None;
904 QualType ExpectedType
905 = R.getSema().Context.getFunctionType(R.getLookupName().getCXXNameType(),
908 // Perform template argument deduction against the type that we would
909 // expect the function to have.
910 if (R.getSema().DeduceTemplateArguments(ConvTemplate, nullptr, ExpectedType,
911 Specialization, Info)
912 == Sema::TDK_Success) {
913 R.addDecl(Specialization);
921 // Performs C++ unqualified lookup into the given file context.
923 CppNamespaceLookup(Sema &S, LookupResult &R, ASTContext &Context,
924 DeclContext *NS, UnqualUsingDirectiveSet &UDirs) {
926 assert(NS && NS->isFileContext() && "CppNamespaceLookup() requires namespace!");
928 // Perform direct name lookup into the LookupCtx.
929 bool Found = LookupDirect(S, R, NS);
931 // Perform direct name lookup into the namespaces nominated by the
932 // using directives whose common ancestor is this namespace.
933 for (const UnqualUsingEntry &UUE : UDirs.getNamespacesFor(NS))
934 if (LookupDirect(S, R, UUE.getNominatedNamespace()))
942 static bool isNamespaceOrTranslationUnitScope(Scope *S) {
943 if (DeclContext *Ctx = S->getEntity())
944 return Ctx->isFileContext();
948 // Find the next outer declaration context from this scope. This
949 // routine actually returns the semantic outer context, which may
950 // differ from the lexical context (encoded directly in the Scope
951 // stack) when we are parsing a member of a class template. In this
952 // case, the second element of the pair will be true, to indicate that
953 // name lookup should continue searching in this semantic context when
954 // it leaves the current template parameter scope.
955 static std::pair<DeclContext *, bool> findOuterContext(Scope *S) {
956 DeclContext *DC = S->getEntity();
957 DeclContext *Lexical = nullptr;
958 for (Scope *OuterS = S->getParent(); OuterS;
959 OuterS = OuterS->getParent()) {
960 if (OuterS->getEntity()) {
961 Lexical = OuterS->getEntity();
966 // C++ [temp.local]p8:
967 // In the definition of a member of a class template that appears
968 // outside of the namespace containing the class template
969 // definition, the name of a template-parameter hides the name of
970 // a member of this namespace.
977 // template<class T> class B {
982 // template<class C> void N::B<C>::f(C) {
983 // C b; // C is the template parameter, not N::C
986 // In this example, the lexical context we return is the
987 // TranslationUnit, while the semantic context is the namespace N.
988 if (!Lexical || !DC || !S->getParent() ||
989 !S->getParent()->isTemplateParamScope())
990 return std::make_pair(Lexical, false);
992 // Find the outermost template parameter scope.
993 // For the example, this is the scope for the template parameters of
994 // template<class C>.
995 Scope *OutermostTemplateScope = S->getParent();
996 while (OutermostTemplateScope->getParent() &&
997 OutermostTemplateScope->getParent()->isTemplateParamScope())
998 OutermostTemplateScope = OutermostTemplateScope->getParent();
1000 // Find the namespace context in which the original scope occurs. In
1001 // the example, this is namespace N.
1002 DeclContext *Semantic = DC;
1003 while (!Semantic->isFileContext())
1004 Semantic = Semantic->getParent();
1006 // Find the declaration context just outside of the template
1007 // parameter scope. This is the context in which the template is
1008 // being lexically declaration (a namespace context). In the
1009 // example, this is the global scope.
1010 if (Lexical->isFileContext() && !Lexical->Equals(Semantic) &&
1011 Lexical->Encloses(Semantic))
1012 return std::make_pair(Semantic, true);
1014 return std::make_pair(Lexical, false);
1018 /// An RAII object to specify that we want to find block scope extern
1020 struct FindLocalExternScope {
1021 FindLocalExternScope(LookupResult &R)
1022 : R(R), OldFindLocalExtern(R.getIdentifierNamespace() &
1023 Decl::IDNS_LocalExtern) {
1024 R.setFindLocalExtern(R.getIdentifierNamespace() & Decl::IDNS_Ordinary);
1027 R.setFindLocalExtern(OldFindLocalExtern);
1029 ~FindLocalExternScope() {
1033 bool OldFindLocalExtern;
1035 } // end anonymous namespace
1037 bool Sema::CppLookupName(LookupResult &R, Scope *S) {
1038 assert(getLangOpts().CPlusPlus && "Can perform only C++ lookup");
1040 DeclarationName Name = R.getLookupName();
1041 Sema::LookupNameKind NameKind = R.getLookupKind();
1043 // If this is the name of an implicitly-declared special member function,
1044 // go through the scope stack to implicitly declare
1045 if (isImplicitlyDeclaredMemberFunctionName(Name)) {
1046 for (Scope *PreS = S; PreS; PreS = PreS->getParent())
1047 if (DeclContext *DC = PreS->getEntity())
1048 DeclareImplicitMemberFunctionsWithName(*this, Name, R.getNameLoc(), DC);
1051 // Implicitly declare member functions with the name we're looking for, if in
1052 // fact we are in a scope where it matters.
1055 IdentifierResolver::iterator
1056 I = IdResolver.begin(Name),
1057 IEnd = IdResolver.end();
1059 // First we lookup local scope.
1060 // We don't consider using-directives, as per 7.3.4.p1 [namespace.udir]
1061 // ...During unqualified name lookup (3.4.1), the names appear as if
1062 // they were declared in the nearest enclosing namespace which contains
1063 // both the using-directive and the nominated namespace.
1064 // [Note: in this context, "contains" means "contains directly or
1068 // namespace A { int i; }
1072 // using namespace A;
1073 // ++i; // finds local 'i', A::i appears at global scope
1077 UnqualUsingDirectiveSet UDirs;
1078 bool VisitedUsingDirectives = false;
1079 bool LeftStartingScope = false;
1080 DeclContext *OutsideOfTemplateParamDC = nullptr;
1082 // When performing a scope lookup, we want to find local extern decls.
1083 FindLocalExternScope FindLocals(R);
1085 for (; S && !isNamespaceOrTranslationUnitScope(S); S = S->getParent()) {
1086 DeclContext *Ctx = S->getEntity();
1087 bool SearchNamespaceScope = true;
1088 // Check whether the IdResolver has anything in this scope.
1089 for (; I != IEnd && S->isDeclScope(*I); ++I) {
1090 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
1091 if (NameKind == LookupRedeclarationWithLinkage &&
1092 !(*I)->isTemplateParameter()) {
1093 // If it's a template parameter, we still find it, so we can diagnose
1094 // the invalid redeclaration.
1096 // Determine whether this (or a previous) declaration is
1098 if (!LeftStartingScope && !Initial->isDeclScope(*I))
1099 LeftStartingScope = true;
1101 // If we found something outside of our starting scope that
1102 // does not have linkage, skip it.
1103 if (LeftStartingScope && !((*I)->hasLinkage())) {
1108 // We found something in this scope, we should not look at the
1110 SearchNamespaceScope = false;
1115 if (!SearchNamespaceScope) {
1117 if (S->isClassScope())
1118 if (CXXRecordDecl *Record = dyn_cast_or_null<CXXRecordDecl>(Ctx))
1119 R.setNamingClass(Record);
1123 if (NameKind == LookupLocalFriendName && !S->isClassScope()) {
1124 // C++11 [class.friend]p11:
1125 // If a friend declaration appears in a local class and the name
1126 // specified is an unqualified name, a prior declaration is
1127 // looked up without considering scopes that are outside the
1128 // innermost enclosing non-class scope.
1132 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
1133 S->getParent() && !S->getParent()->isTemplateParamScope()) {
1134 // We've just searched the last template parameter scope and
1135 // found nothing, so look into the contexts between the
1136 // lexical and semantic declaration contexts returned by
1137 // findOuterContext(). This implements the name lookup behavior
1138 // of C++ [temp.local]p8.
1139 Ctx = OutsideOfTemplateParamDC;
1140 OutsideOfTemplateParamDC = nullptr;
1144 DeclContext *OuterCtx;
1145 bool SearchAfterTemplateScope;
1146 std::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
1147 if (SearchAfterTemplateScope)
1148 OutsideOfTemplateParamDC = OuterCtx;
1150 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
1151 // We do not directly look into transparent contexts, since
1152 // those entities will be found in the nearest enclosing
1153 // non-transparent context.
1154 if (Ctx->isTransparentContext())
1157 // We do not look directly into function or method contexts,
1158 // since all of the local variables and parameters of the
1159 // function/method are present within the Scope.
1160 if (Ctx->isFunctionOrMethod()) {
1161 // If we have an Objective-C instance method, look for ivars
1162 // in the corresponding interface.
1163 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
1164 if (Method->isInstanceMethod() && Name.getAsIdentifierInfo())
1165 if (ObjCInterfaceDecl *Class = Method->getClassInterface()) {
1166 ObjCInterfaceDecl *ClassDeclared;
1167 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(
1168 Name.getAsIdentifierInfo(),
1170 if (NamedDecl *ND = R.getAcceptableDecl(Ivar)) {
1182 // If this is a file context, we need to perform unqualified name
1183 // lookup considering using directives.
1184 if (Ctx->isFileContext()) {
1185 // If we haven't handled using directives yet, do so now.
1186 if (!VisitedUsingDirectives) {
1187 // Add using directives from this context up to the top level.
1188 for (DeclContext *UCtx = Ctx; UCtx; UCtx = UCtx->getParent()) {
1189 if (UCtx->isTransparentContext())
1192 UDirs.visit(UCtx, UCtx);
1195 // Find the innermost file scope, so we can add using directives
1196 // from local scopes.
1197 Scope *InnermostFileScope = S;
1198 while (InnermostFileScope &&
1199 !isNamespaceOrTranslationUnitScope(InnermostFileScope))
1200 InnermostFileScope = InnermostFileScope->getParent();
1201 UDirs.visitScopeChain(Initial, InnermostFileScope);
1205 VisitedUsingDirectives = true;
1208 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs)) {
1216 // Perform qualified name lookup into this context.
1217 // FIXME: In some cases, we know that every name that could be found by
1218 // this qualified name lookup will also be on the identifier chain. For
1219 // example, inside a class without any base classes, we never need to
1220 // perform qualified lookup because all of the members are on top of the
1221 // identifier chain.
1222 if (LookupQualifiedName(R, Ctx, /*InUnqualifiedLookup=*/true))
1228 // Stop if we ran out of scopes.
1229 // FIXME: This really, really shouldn't be happening.
1230 if (!S) return false;
1232 // If we are looking for members, no need to look into global/namespace scope.
1233 if (NameKind == LookupMemberName)
1236 // Collect UsingDirectiveDecls in all scopes, and recursively all
1237 // nominated namespaces by those using-directives.
1239 // FIXME: Cache this sorted list in Scope structure, and DeclContext, so we
1240 // don't build it for each lookup!
1241 if (!VisitedUsingDirectives) {
1242 UDirs.visitScopeChain(Initial, S);
1246 // If we're not performing redeclaration lookup, do not look for local
1247 // extern declarations outside of a function scope.
1248 if (!R.isForRedeclaration())
1249 FindLocals.restore();
1251 // Lookup namespace scope, and global scope.
1252 // Unqualified name lookup in C++ requires looking into scopes
1253 // that aren't strictly lexical, and therefore we walk through the
1254 // context as well as walking through the scopes.
1255 for (; S; S = S->getParent()) {
1256 // Check whether the IdResolver has anything in this scope.
1258 for (; I != IEnd && S->isDeclScope(*I); ++I) {
1259 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
1260 // We found something. Look for anything else in our scope
1261 // with this same name and in an acceptable identifier
1262 // namespace, so that we can construct an overload set if we
1269 if (Found && S->isTemplateParamScope()) {
1274 DeclContext *Ctx = S->getEntity();
1275 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
1276 S->getParent() && !S->getParent()->isTemplateParamScope()) {
1277 // We've just searched the last template parameter scope and
1278 // found nothing, so look into the contexts between the
1279 // lexical and semantic declaration contexts returned by
1280 // findOuterContext(). This implements the name lookup behavior
1281 // of C++ [temp.local]p8.
1282 Ctx = OutsideOfTemplateParamDC;
1283 OutsideOfTemplateParamDC = nullptr;
1287 DeclContext *OuterCtx;
1288 bool SearchAfterTemplateScope;
1289 std::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
1290 if (SearchAfterTemplateScope)
1291 OutsideOfTemplateParamDC = OuterCtx;
1293 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
1294 // We do not directly look into transparent contexts, since
1295 // those entities will be found in the nearest enclosing
1296 // non-transparent context.
1297 if (Ctx->isTransparentContext())
1300 // If we have a context, and it's not a context stashed in the
1301 // template parameter scope for an out-of-line definition, also
1302 // look into that context.
1303 if (!(Found && S->isTemplateParamScope())) {
1304 assert(Ctx->isFileContext() &&
1305 "We should have been looking only at file context here already.");
1307 // Look into context considering using-directives.
1308 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs))
1317 if (R.isForRedeclaration() && !Ctx->isTransparentContext())
1322 if (R.isForRedeclaration() && Ctx && !Ctx->isTransparentContext())
1329 void Sema::makeMergedDefinitionVisible(NamedDecl *ND) {
1330 if (auto *M = getCurrentModule())
1331 Context.mergeDefinitionIntoModule(ND, M);
1333 // We're not building a module; just make the definition visible.
1334 ND->setHidden(false);
1336 // If ND is a template declaration, make the template parameters
1337 // visible too. They're not (necessarily) within a mergeable DeclContext.
1338 if (auto *TD = dyn_cast<TemplateDecl>(ND))
1339 for (auto *Param : *TD->getTemplateParameters())
1340 makeMergedDefinitionVisible(Param);
1343 /// \brief Find the module in which the given declaration was defined.
1344 static Module *getDefiningModule(Sema &S, Decl *Entity) {
1345 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Entity)) {
1346 // If this function was instantiated from a template, the defining module is
1347 // the module containing the pattern.
1348 if (FunctionDecl *Pattern = FD->getTemplateInstantiationPattern())
1350 } else if (CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(Entity)) {
1351 if (CXXRecordDecl *Pattern = RD->getTemplateInstantiationPattern())
1353 } else if (EnumDecl *ED = dyn_cast<EnumDecl>(Entity)) {
1354 if (auto *Pattern = ED->getTemplateInstantiationPattern())
1356 } else if (VarDecl *VD = dyn_cast<VarDecl>(Entity)) {
1357 if (VarDecl *Pattern = VD->getTemplateInstantiationPattern())
1361 // Walk up to the containing context. That might also have been instantiated
1363 DeclContext *Context = Entity->getDeclContext();
1364 if (Context->isFileContext())
1365 return S.getOwningModule(Entity);
1366 return getDefiningModule(S, cast<Decl>(Context));
1369 llvm::DenseSet<Module*> &Sema::getLookupModules() {
1370 unsigned N = CodeSynthesisContexts.size();
1371 for (unsigned I = CodeSynthesisContextLookupModules.size();
1373 Module *M = getDefiningModule(*this, CodeSynthesisContexts[I].Entity);
1374 if (M && !LookupModulesCache.insert(M).second)
1376 CodeSynthesisContextLookupModules.push_back(M);
1378 return LookupModulesCache;
1381 bool Sema::hasVisibleMergedDefinition(NamedDecl *Def) {
1382 for (Module *Merged : Context.getModulesWithMergedDefinition(Def))
1383 if (isModuleVisible(Merged))
1388 template<typename ParmDecl>
1390 hasVisibleDefaultArgument(Sema &S, const ParmDecl *D,
1391 llvm::SmallVectorImpl<Module *> *Modules) {
1392 if (!D->hasDefaultArgument())
1396 auto &DefaultArg = D->getDefaultArgStorage();
1397 if (!DefaultArg.isInherited() && S.isVisible(D))
1400 if (!DefaultArg.isInherited() && Modules) {
1401 auto *NonConstD = const_cast<ParmDecl*>(D);
1402 Modules->push_back(S.getOwningModule(NonConstD));
1403 const auto &Merged = S.Context.getModulesWithMergedDefinition(NonConstD);
1404 Modules->insert(Modules->end(), Merged.begin(), Merged.end());
1407 // If there was a previous default argument, maybe its parameter is visible.
1408 D = DefaultArg.getInheritedFrom();
1413 bool Sema::hasVisibleDefaultArgument(const NamedDecl *D,
1414 llvm::SmallVectorImpl<Module *> *Modules) {
1415 if (auto *P = dyn_cast<TemplateTypeParmDecl>(D))
1416 return ::hasVisibleDefaultArgument(*this, P, Modules);
1417 if (auto *P = dyn_cast<NonTypeTemplateParmDecl>(D))
1418 return ::hasVisibleDefaultArgument(*this, P, Modules);
1419 return ::hasVisibleDefaultArgument(*this, cast<TemplateTemplateParmDecl>(D),
1423 template<typename Filter>
1424 static bool hasVisibleDeclarationImpl(Sema &S, const NamedDecl *D,
1425 llvm::SmallVectorImpl<Module *> *Modules,
1427 for (auto *Redecl : D->redecls()) {
1428 auto *R = cast<NamedDecl>(Redecl);
1436 Modules->push_back(R->getOwningModule());
1437 const auto &Merged = S.Context.getModulesWithMergedDefinition(R);
1438 Modules->insert(Modules->end(), Merged.begin(), Merged.end());
1445 bool Sema::hasVisibleExplicitSpecialization(
1446 const NamedDecl *D, llvm::SmallVectorImpl<Module *> *Modules) {
1447 return hasVisibleDeclarationImpl(*this, D, Modules, [](const NamedDecl *D) {
1448 if (auto *RD = dyn_cast<CXXRecordDecl>(D))
1449 return RD->getTemplateSpecializationKind() == TSK_ExplicitSpecialization;
1450 if (auto *FD = dyn_cast<FunctionDecl>(D))
1451 return FD->getTemplateSpecializationKind() == TSK_ExplicitSpecialization;
1452 if (auto *VD = dyn_cast<VarDecl>(D))
1453 return VD->getTemplateSpecializationKind() == TSK_ExplicitSpecialization;
1454 llvm_unreachable("unknown explicit specialization kind");
1458 bool Sema::hasVisibleMemberSpecialization(
1459 const NamedDecl *D, llvm::SmallVectorImpl<Module *> *Modules) {
1460 assert(isa<CXXRecordDecl>(D->getDeclContext()) &&
1461 "not a member specialization");
1462 return hasVisibleDeclarationImpl(*this, D, Modules, [](const NamedDecl *D) {
1463 // If the specialization is declared at namespace scope, then it's a member
1464 // specialization declaration. If it's lexically inside the class
1465 // definition then it was instantiated.
1467 // FIXME: This is a hack. There should be a better way to determine this.
1468 // FIXME: What about MS-style explicit specializations declared within a
1469 // class definition?
1470 return D->getLexicalDeclContext()->isFileContext();
1476 /// \brief Determine whether a declaration is visible to name lookup.
1478 /// This routine determines whether the declaration D is visible in the current
1479 /// lookup context, taking into account the current template instantiation
1480 /// stack. During template instantiation, a declaration is visible if it is
1481 /// visible from a module containing any entity on the template instantiation
1482 /// path (by instantiating a template, you allow it to see the declarations that
1483 /// your module can see, including those later on in your module).
1484 bool LookupResult::isVisibleSlow(Sema &SemaRef, NamedDecl *D) {
1485 assert(D->isHidden() && "should not call this: not in slow case");
1487 Module *DeclModule = SemaRef.getOwningModule(D);
1488 assert(DeclModule && "hidden decl not from a module");
1490 // If the owning module is visible, and the decl is not module private,
1491 // then the decl is visible too. (Module private is ignored within the same
1492 // top-level module.)
1493 // FIXME: Check the owning module for module-private declarations rather than
1494 // assuming "same AST file" is the same thing as "same module".
1495 if ((!D->isFromASTFile() || !D->isModulePrivate()) &&
1496 (SemaRef.isModuleVisible(DeclModule) ||
1497 SemaRef.hasVisibleMergedDefinition(D)))
1500 // If this declaration is not at namespace scope nor module-private,
1501 // then it is visible if its lexical parent has a visible definition.
1502 DeclContext *DC = D->getLexicalDeclContext();
1503 if (!D->isModulePrivate() && DC && !DC->isFileContext() &&
1504 !isa<LinkageSpecDecl>(DC) && !isa<ExportDecl>(DC)) {
1505 // For a parameter, check whether our current template declaration's
1506 // lexical context is visible, not whether there's some other visible
1507 // definition of it, because parameters aren't "within" the definition.
1509 // In C++ we need to check for a visible definition due to ODR merging,
1510 // and in C we must not because each declaration of a function gets its own
1511 // set of declarations for tags in prototype scope.
1512 if ((D->isTemplateParameter() || isa<ParmVarDecl>(D)
1513 || (isa<FunctionDecl>(DC) && !SemaRef.getLangOpts().CPlusPlus))
1514 ? isVisible(SemaRef, cast<NamedDecl>(DC))
1515 : SemaRef.hasVisibleDefinition(cast<NamedDecl>(DC))) {
1516 if (SemaRef.CodeSynthesisContexts.empty() &&
1517 // FIXME: Do something better in this case.
1518 !SemaRef.getLangOpts().ModulesLocalVisibility) {
1519 // Cache the fact that this declaration is implicitly visible because
1520 // its parent has a visible definition.
1521 D->setHidden(false);
1528 // Find the extra places where we need to look.
1529 llvm::DenseSet<Module*> &LookupModules = SemaRef.getLookupModules();
1530 if (LookupModules.empty())
1534 DeclModule = SemaRef.getOwningModule(D);
1535 assert(DeclModule && "hidden decl not from a module");
1538 // If our lookup set contains the decl's module, it's visible.
1539 if (LookupModules.count(DeclModule))
1542 // If the declaration isn't exported, it's not visible in any other module.
1543 if (D->isModulePrivate())
1546 // Check whether DeclModule is transitively exported to an import of
1548 return std::any_of(LookupModules.begin(), LookupModules.end(),
1549 [&](Module *M) { return M->isModuleVisible(DeclModule); });
1552 bool Sema::isVisibleSlow(const NamedDecl *D) {
1553 return LookupResult::isVisible(*this, const_cast<NamedDecl*>(D));
1556 bool Sema::shouldLinkPossiblyHiddenDecl(LookupResult &R, const NamedDecl *New) {
1561 return New->isExternallyVisible();
1564 /// \brief Retrieve the visible declaration corresponding to D, if any.
1566 /// This routine determines whether the declaration D is visible in the current
1567 /// module, with the current imports. If not, it checks whether any
1568 /// redeclaration of D is visible, and if so, returns that declaration.
1570 /// \returns D, or a visible previous declaration of D, whichever is more recent
1571 /// and visible. If no declaration of D is visible, returns null.
1572 static NamedDecl *findAcceptableDecl(Sema &SemaRef, NamedDecl *D) {
1573 assert(!LookupResult::isVisible(SemaRef, D) && "not in slow case");
1575 for (auto RD : D->redecls()) {
1576 // Don't bother with extra checks if we already know this one isn't visible.
1580 auto ND = cast<NamedDecl>(RD);
1581 // FIXME: This is wrong in the case where the previous declaration is not
1582 // visible in the same scope as D. This needs to be done much more
1584 if (LookupResult::isVisible(SemaRef, ND))
1591 bool Sema::hasVisibleDeclarationSlow(const NamedDecl *D,
1592 llvm::SmallVectorImpl<Module *> *Modules) {
1593 assert(!isVisible(D) && "not in slow case");
1594 return hasVisibleDeclarationImpl(*this, D, Modules,
1595 [](const NamedDecl *) { return true; });
1598 NamedDecl *LookupResult::getAcceptableDeclSlow(NamedDecl *D) const {
1599 if (auto *ND = dyn_cast<NamespaceDecl>(D)) {
1600 // Namespaces are a bit of a special case: we expect there to be a lot of
1601 // redeclarations of some namespaces, all declarations of a namespace are
1602 // essentially interchangeable, all declarations are found by name lookup
1603 // if any is, and namespaces are never looked up during template
1604 // instantiation. So we benefit from caching the check in this case, and
1605 // it is correct to do so.
1606 auto *Key = ND->getCanonicalDecl();
1607 if (auto *Acceptable = getSema().VisibleNamespaceCache.lookup(Key))
1610 isVisible(getSema(), Key) ? Key : findAcceptableDecl(getSema(), Key);
1612 getSema().VisibleNamespaceCache.insert(std::make_pair(Key, Acceptable));
1616 return findAcceptableDecl(getSema(), D);
1619 /// @brief Perform unqualified name lookup starting from a given
1622 /// Unqualified name lookup (C++ [basic.lookup.unqual], C99 6.2.1) is
1623 /// used to find names within the current scope. For example, 'x' in
1627 /// return x; // unqualified name look finds 'x' in the global scope
1631 /// Different lookup criteria can find different names. For example, a
1632 /// particular scope can have both a struct and a function of the same
1633 /// name, and each can be found by certain lookup criteria. For more
1634 /// information about lookup criteria, see the documentation for the
1635 /// class LookupCriteria.
1637 /// @param S The scope from which unqualified name lookup will
1638 /// begin. If the lookup criteria permits, name lookup may also search
1639 /// in the parent scopes.
1641 /// @param [in,out] R Specifies the lookup to perform (e.g., the name to
1642 /// look up and the lookup kind), and is updated with the results of lookup
1643 /// including zero or more declarations and possibly additional information
1644 /// used to diagnose ambiguities.
1646 /// @returns \c true if lookup succeeded and false otherwise.
1647 bool Sema::LookupName(LookupResult &R, Scope *S, bool AllowBuiltinCreation) {
1648 DeclarationName Name = R.getLookupName();
1649 if (!Name) return false;
1651 LookupNameKind NameKind = R.getLookupKind();
1653 if (!getLangOpts().CPlusPlus) {
1654 // Unqualified name lookup in C/Objective-C is purely lexical, so
1655 // search in the declarations attached to the name.
1656 if (NameKind == Sema::LookupRedeclarationWithLinkage) {
1657 // Find the nearest non-transparent declaration scope.
1658 while (!(S->getFlags() & Scope::DeclScope) ||
1659 (S->getEntity() && S->getEntity()->isTransparentContext()))
1663 // When performing a scope lookup, we want to find local extern decls.
1664 FindLocalExternScope FindLocals(R);
1666 // Scan up the scope chain looking for a decl that matches this
1667 // identifier that is in the appropriate namespace. This search
1668 // should not take long, as shadowing of names is uncommon, and
1669 // deep shadowing is extremely uncommon.
1670 bool LeftStartingScope = false;
1672 for (IdentifierResolver::iterator I = IdResolver.begin(Name),
1673 IEnd = IdResolver.end();
1675 if (NamedDecl *D = R.getAcceptableDecl(*I)) {
1676 if (NameKind == LookupRedeclarationWithLinkage) {
1677 // Determine whether this (or a previous) declaration is
1679 if (!LeftStartingScope && !S->isDeclScope(*I))
1680 LeftStartingScope = true;
1682 // If we found something outside of our starting scope that
1683 // does not have linkage, skip it.
1684 if (LeftStartingScope && !((*I)->hasLinkage())) {
1689 else if (NameKind == LookupObjCImplicitSelfParam &&
1690 !isa<ImplicitParamDecl>(*I))
1695 // Check whether there are any other declarations with the same name
1696 // and in the same scope.
1698 // Find the scope in which this declaration was declared (if it
1699 // actually exists in a Scope).
1700 while (S && !S->isDeclScope(D))
1703 // If the scope containing the declaration is the translation unit,
1704 // then we'll need to perform our checks based on the matching
1705 // DeclContexts rather than matching scopes.
1706 if (S && isNamespaceOrTranslationUnitScope(S))
1709 // Compute the DeclContext, if we need it.
1710 DeclContext *DC = nullptr;
1712 DC = (*I)->getDeclContext()->getRedeclContext();
1714 IdentifierResolver::iterator LastI = I;
1715 for (++LastI; LastI != IEnd; ++LastI) {
1717 // Match based on scope.
1718 if (!S->isDeclScope(*LastI))
1721 // Match based on DeclContext.
1723 = (*LastI)->getDeclContext()->getRedeclContext();
1724 if (!LastDC->Equals(DC))
1728 // If the declaration is in the right namespace and visible, add it.
1729 if (NamedDecl *LastD = R.getAcceptableDecl(*LastI))
1739 // Perform C++ unqualified name lookup.
1740 if (CppLookupName(R, S))
1744 // If we didn't find a use of this identifier, and if the identifier
1745 // corresponds to a compiler builtin, create the decl object for the builtin
1746 // now, injecting it into translation unit scope, and return it.
1747 if (AllowBuiltinCreation && LookupBuiltin(*this, R))
1750 // If we didn't find a use of this identifier, the ExternalSource
1751 // may be able to handle the situation.
1752 // Note: some lookup failures are expected!
1753 // See e.g. R.isForRedeclaration().
1754 return (ExternalSource && ExternalSource->LookupUnqualified(R, S));
1757 /// @brief Perform qualified name lookup in the namespaces nominated by
1758 /// using directives by the given context.
1760 /// C++98 [namespace.qual]p2:
1761 /// Given X::m (where X is a user-declared namespace), or given \::m
1762 /// (where X is the global namespace), let S be the set of all
1763 /// declarations of m in X and in the transitive closure of all
1764 /// namespaces nominated by using-directives in X and its used
1765 /// namespaces, except that using-directives are ignored in any
1766 /// namespace, including X, directly containing one or more
1767 /// declarations of m. No namespace is searched more than once in
1768 /// the lookup of a name. If S is the empty set, the program is
1769 /// ill-formed. Otherwise, if S has exactly one member, or if the
1770 /// context of the reference is a using-declaration
1771 /// (namespace.udecl), S is the required set of declarations of
1772 /// m. Otherwise if the use of m is not one that allows a unique
1773 /// declaration to be chosen from S, the program is ill-formed.
1775 /// C++98 [namespace.qual]p5:
1776 /// During the lookup of a qualified namespace member name, if the
1777 /// lookup finds more than one declaration of the member, and if one
1778 /// declaration introduces a class name or enumeration name and the
1779 /// other declarations either introduce the same object, the same
1780 /// enumerator or a set of functions, the non-type name hides the
1781 /// class or enumeration name if and only if the declarations are
1782 /// from the same namespace; otherwise (the declarations are from
1783 /// different namespaces), the program is ill-formed.
1784 static bool LookupQualifiedNameInUsingDirectives(Sema &S, LookupResult &R,
1785 DeclContext *StartDC) {
1786 assert(StartDC->isFileContext() && "start context is not a file context");
1788 DeclContext::udir_range UsingDirectives = StartDC->using_directives();
1789 if (UsingDirectives.begin() == UsingDirectives.end()) return false;
1791 // We have at least added all these contexts to the queue.
1792 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1793 Visited.insert(StartDC);
1795 // We have not yet looked into these namespaces, much less added
1796 // their "using-children" to the queue.
1797 SmallVector<NamespaceDecl*, 8> Queue;
1799 // We have already looked into the initial namespace; seed the queue
1800 // with its using-children.
1801 for (auto *I : UsingDirectives) {
1802 NamespaceDecl *ND = I->getNominatedNamespace()->getOriginalNamespace();
1803 if (Visited.insert(ND).second)
1804 Queue.push_back(ND);
1807 // The easiest way to implement the restriction in [namespace.qual]p5
1808 // is to check whether any of the individual results found a tag
1809 // and, if so, to declare an ambiguity if the final result is not
1811 bool FoundTag = false;
1812 bool FoundNonTag = false;
1814 LookupResult LocalR(LookupResult::Temporary, R);
1817 while (!Queue.empty()) {
1818 NamespaceDecl *ND = Queue.pop_back_val();
1820 // We go through some convolutions here to avoid copying results
1821 // between LookupResults.
1822 bool UseLocal = !R.empty();
1823 LookupResult &DirectR = UseLocal ? LocalR : R;
1824 bool FoundDirect = LookupDirect(S, DirectR, ND);
1827 // First do any local hiding.
1828 DirectR.resolveKind();
1830 // If the local result is a tag, remember that.
1831 if (DirectR.isSingleTagDecl())
1836 // Append the local results to the total results if necessary.
1838 R.addAllDecls(LocalR);
1843 // If we find names in this namespace, ignore its using directives.
1849 for (auto I : ND->using_directives()) {
1850 NamespaceDecl *Nom = I->getNominatedNamespace();
1851 if (Visited.insert(Nom).second)
1852 Queue.push_back(Nom);
1857 if (FoundTag && FoundNonTag)
1858 R.setAmbiguousQualifiedTagHiding();
1866 /// \brief Callback that looks for any member of a class with the given name.
1867 static bool LookupAnyMember(const CXXBaseSpecifier *Specifier,
1868 CXXBasePath &Path, DeclarationName Name) {
1869 RecordDecl *BaseRecord = Specifier->getType()->getAs<RecordType>()->getDecl();
1871 Path.Decls = BaseRecord->lookup(Name);
1872 return !Path.Decls.empty();
1875 /// \brief Determine whether the given set of member declarations contains only
1876 /// static members, nested types, and enumerators.
1877 template<typename InputIterator>
1878 static bool HasOnlyStaticMembers(InputIterator First, InputIterator Last) {
1879 Decl *D = (*First)->getUnderlyingDecl();
1880 if (isa<VarDecl>(D) || isa<TypeDecl>(D) || isa<EnumConstantDecl>(D))
1883 if (isa<CXXMethodDecl>(D)) {
1884 // Determine whether all of the methods are static.
1885 bool AllMethodsAreStatic = true;
1886 for(; First != Last; ++First) {
1887 D = (*First)->getUnderlyingDecl();
1889 if (!isa<CXXMethodDecl>(D)) {
1890 assert(isa<TagDecl>(D) && "Non-function must be a tag decl");
1894 if (!cast<CXXMethodDecl>(D)->isStatic()) {
1895 AllMethodsAreStatic = false;
1900 if (AllMethodsAreStatic)
1907 /// \brief Perform qualified name lookup into a given context.
1909 /// Qualified name lookup (C++ [basic.lookup.qual]) is used to find
1910 /// names when the context of those names is explicit specified, e.g.,
1911 /// "std::vector" or "x->member", or as part of unqualified name lookup.
1913 /// Different lookup criteria can find different names. For example, a
1914 /// particular scope can have both a struct and a function of the same
1915 /// name, and each can be found by certain lookup criteria. For more
1916 /// information about lookup criteria, see the documentation for the
1917 /// class LookupCriteria.
1919 /// \param R captures both the lookup criteria and any lookup results found.
1921 /// \param LookupCtx The context in which qualified name lookup will
1922 /// search. If the lookup criteria permits, name lookup may also search
1923 /// in the parent contexts or (for C++ classes) base classes.
1925 /// \param InUnqualifiedLookup true if this is qualified name lookup that
1926 /// occurs as part of unqualified name lookup.
1928 /// \returns true if lookup succeeded, false if it failed.
1929 bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
1930 bool InUnqualifiedLookup) {
1931 assert(LookupCtx && "Sema::LookupQualifiedName requires a lookup context");
1933 if (!R.getLookupName())
1936 // Make sure that the declaration context is complete.
1937 assert((!isa<TagDecl>(LookupCtx) ||
1938 LookupCtx->isDependentContext() ||
1939 cast<TagDecl>(LookupCtx)->isCompleteDefinition() ||
1940 cast<TagDecl>(LookupCtx)->isBeingDefined()) &&
1941 "Declaration context must already be complete!");
1943 struct QualifiedLookupInScope {
1945 DeclContext *Context;
1946 // Set flag in DeclContext informing debugger that we're looking for qualified name
1947 QualifiedLookupInScope(DeclContext *ctx) : Context(ctx) {
1948 oldVal = ctx->setUseQualifiedLookup();
1950 ~QualifiedLookupInScope() {
1951 Context->setUseQualifiedLookup(oldVal);
1955 if (LookupDirect(*this, R, LookupCtx)) {
1957 if (isa<CXXRecordDecl>(LookupCtx))
1958 R.setNamingClass(cast<CXXRecordDecl>(LookupCtx));
1962 // Don't descend into implied contexts for redeclarations.
1963 // C++98 [namespace.qual]p6:
1964 // In a declaration for a namespace member in which the
1965 // declarator-id is a qualified-id, given that the qualified-id
1966 // for the namespace member has the form
1967 // nested-name-specifier unqualified-id
1968 // the unqualified-id shall name a member of the namespace
1969 // designated by the nested-name-specifier.
1970 // See also [class.mfct]p5 and [class.static.data]p2.
1971 if (R.isForRedeclaration())
1974 // If this is a namespace, look it up in the implied namespaces.
1975 if (LookupCtx->isFileContext())
1976 return LookupQualifiedNameInUsingDirectives(*this, R, LookupCtx);
1978 // If this isn't a C++ class, we aren't allowed to look into base
1979 // classes, we're done.
1980 CXXRecordDecl *LookupRec = dyn_cast<CXXRecordDecl>(LookupCtx);
1981 if (!LookupRec || !LookupRec->getDefinition())
1984 // If we're performing qualified name lookup into a dependent class,
1985 // then we are actually looking into a current instantiation. If we have any
1986 // dependent base classes, then we either have to delay lookup until
1987 // template instantiation time (at which point all bases will be available)
1988 // or we have to fail.
1989 if (!InUnqualifiedLookup && LookupRec->isDependentContext() &&
1990 LookupRec->hasAnyDependentBases()) {
1991 R.setNotFoundInCurrentInstantiation();
1995 // Perform lookup into our base classes.
1997 Paths.setOrigin(LookupRec);
1999 // Look for this member in our base classes
2000 bool (*BaseCallback)(const CXXBaseSpecifier *Specifier, CXXBasePath &Path,
2001 DeclarationName Name) = nullptr;
2002 switch (R.getLookupKind()) {
2003 case LookupObjCImplicitSelfParam:
2004 case LookupOrdinaryName:
2005 case LookupMemberName:
2006 case LookupRedeclarationWithLinkage:
2007 case LookupLocalFriendName:
2008 BaseCallback = &CXXRecordDecl::FindOrdinaryMember;
2012 BaseCallback = &CXXRecordDecl::FindTagMember;
2016 BaseCallback = &LookupAnyMember;
2019 case LookupOMPReductionName:
2020 BaseCallback = &CXXRecordDecl::FindOMPReductionMember;
2023 case LookupUsingDeclName:
2024 // This lookup is for redeclarations only.
2026 case LookupOperatorName:
2027 case LookupNamespaceName:
2028 case LookupObjCProtocolName:
2030 // These lookups will never find a member in a C++ class (or base class).
2033 case LookupNestedNameSpecifierName:
2034 BaseCallback = &CXXRecordDecl::FindNestedNameSpecifierMember;
2038 DeclarationName Name = R.getLookupName();
2039 if (!LookupRec->lookupInBases(
2040 [=](const CXXBaseSpecifier *Specifier, CXXBasePath &Path) {
2041 return BaseCallback(Specifier, Path, Name);
2046 R.setNamingClass(LookupRec);
2048 // C++ [class.member.lookup]p2:
2049 // [...] If the resulting set of declarations are not all from
2050 // sub-objects of the same type, or the set has a nonstatic member
2051 // and includes members from distinct sub-objects, there is an
2052 // ambiguity and the program is ill-formed. Otherwise that set is
2053 // the result of the lookup.
2054 QualType SubobjectType;
2055 int SubobjectNumber = 0;
2056 AccessSpecifier SubobjectAccess = AS_none;
2058 for (CXXBasePaths::paths_iterator Path = Paths.begin(), PathEnd = Paths.end();
2059 Path != PathEnd; ++Path) {
2060 const CXXBasePathElement &PathElement = Path->back();
2062 // Pick the best (i.e. most permissive i.e. numerically lowest) access
2063 // across all paths.
2064 SubobjectAccess = std::min(SubobjectAccess, Path->Access);
2066 // Determine whether we're looking at a distinct sub-object or not.
2067 if (SubobjectType.isNull()) {
2068 // This is the first subobject we've looked at. Record its type.
2069 SubobjectType = Context.getCanonicalType(PathElement.Base->getType());
2070 SubobjectNumber = PathElement.SubobjectNumber;
2075 != Context.getCanonicalType(PathElement.Base->getType())) {
2076 // We found members of the given name in two subobjects of
2077 // different types. If the declaration sets aren't the same, this
2078 // lookup is ambiguous.
2079 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end())) {
2080 CXXBasePaths::paths_iterator FirstPath = Paths.begin();
2081 DeclContext::lookup_iterator FirstD = FirstPath->Decls.begin();
2082 DeclContext::lookup_iterator CurrentD = Path->Decls.begin();
2084 while (FirstD != FirstPath->Decls.end() &&
2085 CurrentD != Path->Decls.end()) {
2086 if ((*FirstD)->getUnderlyingDecl()->getCanonicalDecl() !=
2087 (*CurrentD)->getUnderlyingDecl()->getCanonicalDecl())
2094 if (FirstD == FirstPath->Decls.end() &&
2095 CurrentD == Path->Decls.end())
2099 R.setAmbiguousBaseSubobjectTypes(Paths);
2103 if (SubobjectNumber != PathElement.SubobjectNumber) {
2104 // We have a different subobject of the same type.
2106 // C++ [class.member.lookup]p5:
2107 // A static member, a nested type or an enumerator defined in
2108 // a base class T can unambiguously be found even if an object
2109 // has more than one base class subobject of type T.
2110 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end()))
2113 // We have found a nonstatic member name in multiple, distinct
2114 // subobjects. Name lookup is ambiguous.
2115 R.setAmbiguousBaseSubobjects(Paths);
2120 // Lookup in a base class succeeded; return these results.
2122 for (auto *D : Paths.front().Decls) {
2123 AccessSpecifier AS = CXXRecordDecl::MergeAccess(SubobjectAccess,
2131 /// \brief Performs qualified name lookup or special type of lookup for
2132 /// "__super::" scope specifier.
2134 /// This routine is a convenience overload meant to be called from contexts
2135 /// that need to perform a qualified name lookup with an optional C++ scope
2136 /// specifier that might require special kind of lookup.
2138 /// \param R captures both the lookup criteria and any lookup results found.
2140 /// \param LookupCtx The context in which qualified name lookup will
2143 /// \param SS An optional C++ scope-specifier.
2145 /// \returns true if lookup succeeded, false if it failed.
2146 bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
2148 auto *NNS = SS.getScopeRep();
2149 if (NNS && NNS->getKind() == NestedNameSpecifier::Super)
2150 return LookupInSuper(R, NNS->getAsRecordDecl());
2153 return LookupQualifiedName(R, LookupCtx);
2156 /// @brief Performs name lookup for a name that was parsed in the
2157 /// source code, and may contain a C++ scope specifier.
2159 /// This routine is a convenience routine meant to be called from
2160 /// contexts that receive a name and an optional C++ scope specifier
2161 /// (e.g., "N::M::x"). It will then perform either qualified or
2162 /// unqualified name lookup (with LookupQualifiedName or LookupName,
2163 /// respectively) on the given name and return those results. It will
2164 /// perform a special type of lookup for "__super::" scope specifier.
2166 /// @param S The scope from which unqualified name lookup will
2169 /// @param SS An optional C++ scope-specifier, e.g., "::N::M".
2171 /// @param EnteringContext Indicates whether we are going to enter the
2172 /// context of the scope-specifier SS (if present).
2174 /// @returns True if any decls were found (but possibly ambiguous)
2175 bool Sema::LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
2176 bool AllowBuiltinCreation, bool EnteringContext) {
2177 if (SS && SS->isInvalid()) {
2178 // When the scope specifier is invalid, don't even look for
2183 if (SS && SS->isSet()) {
2184 NestedNameSpecifier *NNS = SS->getScopeRep();
2185 if (NNS->getKind() == NestedNameSpecifier::Super)
2186 return LookupInSuper(R, NNS->getAsRecordDecl());
2188 if (DeclContext *DC = computeDeclContext(*SS, EnteringContext)) {
2189 // We have resolved the scope specifier to a particular declaration
2190 // contex, and will perform name lookup in that context.
2191 if (!DC->isDependentContext() && RequireCompleteDeclContext(*SS, DC))
2194 R.setContextRange(SS->getRange());
2195 return LookupQualifiedName(R, DC);
2198 // We could not resolve the scope specified to a specific declaration
2199 // context, which means that SS refers to an unknown specialization.
2200 // Name lookup can't find anything in this case.
2201 R.setNotFoundInCurrentInstantiation();
2202 R.setContextRange(SS->getRange());
2206 // Perform unqualified name lookup starting in the given scope.
2207 return LookupName(R, S, AllowBuiltinCreation);
2210 /// \brief Perform qualified name lookup into all base classes of the given
2213 /// \param R captures both the lookup criteria and any lookup results found.
2215 /// \param Class The context in which qualified name lookup will
2216 /// search. Name lookup will search in all base classes merging the results.
2218 /// @returns True if any decls were found (but possibly ambiguous)
2219 bool Sema::LookupInSuper(LookupResult &R, CXXRecordDecl *Class) {
2220 // The access-control rules we use here are essentially the rules for
2221 // doing a lookup in Class that just magically skipped the direct
2222 // members of Class itself. That is, the naming class is Class, and the
2223 // access includes the access of the base.
2224 for (const auto &BaseSpec : Class->bases()) {
2225 CXXRecordDecl *RD = cast<CXXRecordDecl>(
2226 BaseSpec.getType()->castAs<RecordType>()->getDecl());
2227 LookupResult Result(*this, R.getLookupNameInfo(), R.getLookupKind());
2228 Result.setBaseObjectType(Context.getRecordType(Class));
2229 LookupQualifiedName(Result, RD);
2231 // Copy the lookup results into the target, merging the base's access into
2233 for (auto I = Result.begin(), E = Result.end(); I != E; ++I) {
2234 R.addDecl(I.getDecl(),
2235 CXXRecordDecl::MergeAccess(BaseSpec.getAccessSpecifier(),
2239 Result.suppressDiagnostics();
2243 R.setNamingClass(Class);
2248 /// \brief Produce a diagnostic describing the ambiguity that resulted
2249 /// from name lookup.
2251 /// \param Result The result of the ambiguous lookup to be diagnosed.
2252 void Sema::DiagnoseAmbiguousLookup(LookupResult &Result) {
2253 assert(Result.isAmbiguous() && "Lookup result must be ambiguous");
2255 DeclarationName Name = Result.getLookupName();
2256 SourceLocation NameLoc = Result.getNameLoc();
2257 SourceRange LookupRange = Result.getContextRange();
2259 switch (Result.getAmbiguityKind()) {
2260 case LookupResult::AmbiguousBaseSubobjects: {
2261 CXXBasePaths *Paths = Result.getBasePaths();
2262 QualType SubobjectType = Paths->front().back().Base->getType();
2263 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobjects)
2264 << Name << SubobjectType << getAmbiguousPathsDisplayString(*Paths)
2267 DeclContext::lookup_iterator Found = Paths->front().Decls.begin();
2268 while (isa<CXXMethodDecl>(*Found) &&
2269 cast<CXXMethodDecl>(*Found)->isStatic())
2272 Diag((*Found)->getLocation(), diag::note_ambiguous_member_found);
2276 case LookupResult::AmbiguousBaseSubobjectTypes: {
2277 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobject_types)
2278 << Name << LookupRange;
2280 CXXBasePaths *Paths = Result.getBasePaths();
2281 std::set<Decl *> DeclsPrinted;
2282 for (CXXBasePaths::paths_iterator Path = Paths->begin(),
2283 PathEnd = Paths->end();
2284 Path != PathEnd; ++Path) {
2285 Decl *D = Path->Decls.front();
2286 if (DeclsPrinted.insert(D).second)
2287 Diag(D->getLocation(), diag::note_ambiguous_member_found);
2292 case LookupResult::AmbiguousTagHiding: {
2293 Diag(NameLoc, diag::err_ambiguous_tag_hiding) << Name << LookupRange;
2295 llvm::SmallPtrSet<NamedDecl*, 8> TagDecls;
2297 for (auto *D : Result)
2298 if (TagDecl *TD = dyn_cast<TagDecl>(D)) {
2299 TagDecls.insert(TD);
2300 Diag(TD->getLocation(), diag::note_hidden_tag);
2303 for (auto *D : Result)
2304 if (!isa<TagDecl>(D))
2305 Diag(D->getLocation(), diag::note_hiding_object);
2307 // For recovery purposes, go ahead and implement the hiding.
2308 LookupResult::Filter F = Result.makeFilter();
2309 while (F.hasNext()) {
2310 if (TagDecls.count(F.next()))
2317 case LookupResult::AmbiguousReference: {
2318 Diag(NameLoc, diag::err_ambiguous_reference) << Name << LookupRange;
2320 for (auto *D : Result)
2321 Diag(D->getLocation(), diag::note_ambiguous_candidate) << D;
2328 struct AssociatedLookup {
2329 AssociatedLookup(Sema &S, SourceLocation InstantiationLoc,
2330 Sema::AssociatedNamespaceSet &Namespaces,
2331 Sema::AssociatedClassSet &Classes)
2332 : S(S), Namespaces(Namespaces), Classes(Classes),
2333 InstantiationLoc(InstantiationLoc) {
2337 Sema::AssociatedNamespaceSet &Namespaces;
2338 Sema::AssociatedClassSet &Classes;
2339 SourceLocation InstantiationLoc;
2341 } // end anonymous namespace
2344 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType T);
2346 static void CollectEnclosingNamespace(Sema::AssociatedNamespaceSet &Namespaces,
2348 // Add the associated namespace for this class.
2350 // We don't use DeclContext::getEnclosingNamespaceContext() as this may
2351 // be a locally scoped record.
2353 // We skip out of inline namespaces. The innermost non-inline namespace
2354 // contains all names of all its nested inline namespaces anyway, so we can
2355 // replace the entire inline namespace tree with its root.
2356 while (Ctx->isRecord() || Ctx->isTransparentContext() ||
2357 Ctx->isInlineNamespace())
2358 Ctx = Ctx->getParent();
2360 if (Ctx->isFileContext())
2361 Namespaces.insert(Ctx->getPrimaryContext());
2364 // \brief Add the associated classes and namespaces for argument-dependent
2365 // lookup that involves a template argument (C++ [basic.lookup.koenig]p2).
2367 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
2368 const TemplateArgument &Arg) {
2369 // C++ [basic.lookup.koenig]p2, last bullet:
2371 switch (Arg.getKind()) {
2372 case TemplateArgument::Null:
2375 case TemplateArgument::Type:
2376 // [...] the namespaces and classes associated with the types of the
2377 // template arguments provided for template type parameters (excluding
2378 // template template parameters)
2379 addAssociatedClassesAndNamespaces(Result, Arg.getAsType());
2382 case TemplateArgument::Template:
2383 case TemplateArgument::TemplateExpansion: {
2384 // [...] the namespaces in which any template template arguments are
2385 // defined; and the classes in which any member templates used as
2386 // template template arguments are defined.
2387 TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
2388 if (ClassTemplateDecl *ClassTemplate
2389 = dyn_cast<ClassTemplateDecl>(Template.getAsTemplateDecl())) {
2390 DeclContext *Ctx = ClassTemplate->getDeclContext();
2391 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2392 Result.Classes.insert(EnclosingClass);
2393 // Add the associated namespace for this class.
2394 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2399 case TemplateArgument::Declaration:
2400 case TemplateArgument::Integral:
2401 case TemplateArgument::Expression:
2402 case TemplateArgument::NullPtr:
2403 // [Note: non-type template arguments do not contribute to the set of
2404 // associated namespaces. ]
2407 case TemplateArgument::Pack:
2408 for (const auto &P : Arg.pack_elements())
2409 addAssociatedClassesAndNamespaces(Result, P);
2414 // \brief Add the associated classes and namespaces for
2415 // argument-dependent lookup with an argument of class type
2416 // (C++ [basic.lookup.koenig]p2).
2418 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
2419 CXXRecordDecl *Class) {
2421 // Just silently ignore anything whose name is __va_list_tag.
2422 if (Class->getDeclName() == Result.S.VAListTagName)
2425 // C++ [basic.lookup.koenig]p2:
2427 // -- If T is a class type (including unions), its associated
2428 // classes are: the class itself; the class of which it is a
2429 // member, if any; and its direct and indirect base
2430 // classes. Its associated namespaces are the namespaces in
2431 // which its associated classes are defined.
2433 // Add the class of which it is a member, if any.
2434 DeclContext *Ctx = Class->getDeclContext();
2435 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2436 Result.Classes.insert(EnclosingClass);
2437 // Add the associated namespace for this class.
2438 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2440 // Add the class itself. If we've already seen this class, we don't
2441 // need to visit base classes.
2443 // FIXME: That's not correct, we may have added this class only because it
2444 // was the enclosing class of another class, and in that case we won't have
2445 // added its base classes yet.
2446 if (!Result.Classes.insert(Class))
2449 // -- If T is a template-id, its associated namespaces and classes are
2450 // the namespace in which the template is defined; for member
2451 // templates, the member template's class; the namespaces and classes
2452 // associated with the types of the template arguments provided for
2453 // template type parameters (excluding template template parameters); the
2454 // namespaces in which any template template arguments are defined; and
2455 // the classes in which any member templates used as template template
2456 // arguments are defined. [Note: non-type template arguments do not
2457 // contribute to the set of associated namespaces. ]
2458 if (ClassTemplateSpecializationDecl *Spec
2459 = dyn_cast<ClassTemplateSpecializationDecl>(Class)) {
2460 DeclContext *Ctx = Spec->getSpecializedTemplate()->getDeclContext();
2461 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2462 Result.Classes.insert(EnclosingClass);
2463 // Add the associated namespace for this class.
2464 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2466 const TemplateArgumentList &TemplateArgs = Spec->getTemplateArgs();
2467 for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
2468 addAssociatedClassesAndNamespaces(Result, TemplateArgs[I]);
2471 // Only recurse into base classes for complete types.
2472 if (!Result.S.isCompleteType(Result.InstantiationLoc,
2473 Result.S.Context.getRecordType(Class)))
2476 // Add direct and indirect base classes along with their associated
2478 SmallVector<CXXRecordDecl *, 32> Bases;
2479 Bases.push_back(Class);
2480 while (!Bases.empty()) {
2481 // Pop this class off the stack.
2482 Class = Bases.pop_back_val();
2484 // Visit the base classes.
2485 for (const auto &Base : Class->bases()) {
2486 const RecordType *BaseType = Base.getType()->getAs<RecordType>();
2487 // In dependent contexts, we do ADL twice, and the first time around,
2488 // the base type might be a dependent TemplateSpecializationType, or a
2489 // TemplateTypeParmType. If that happens, simply ignore it.
2490 // FIXME: If we want to support export, we probably need to add the
2491 // namespace of the template in a TemplateSpecializationType, or even
2492 // the classes and namespaces of known non-dependent arguments.
2495 CXXRecordDecl *BaseDecl = cast<CXXRecordDecl>(BaseType->getDecl());
2496 if (Result.Classes.insert(BaseDecl)) {
2497 // Find the associated namespace for this base class.
2498 DeclContext *BaseCtx = BaseDecl->getDeclContext();
2499 CollectEnclosingNamespace(Result.Namespaces, BaseCtx);
2501 // Make sure we visit the bases of this base class.
2502 if (BaseDecl->bases_begin() != BaseDecl->bases_end())
2503 Bases.push_back(BaseDecl);
2509 // \brief Add the associated classes and namespaces for
2510 // argument-dependent lookup with an argument of type T
2511 // (C++ [basic.lookup.koenig]p2).
2513 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType Ty) {
2514 // C++ [basic.lookup.koenig]p2:
2516 // For each argument type T in the function call, there is a set
2517 // of zero or more associated namespaces and a set of zero or more
2518 // associated classes to be considered. The sets of namespaces and
2519 // classes is determined entirely by the types of the function
2520 // arguments (and the namespace of any template template
2521 // argument). Typedef names and using-declarations used to specify
2522 // the types do not contribute to this set. The sets of namespaces
2523 // and classes are determined in the following way:
2525 SmallVector<const Type *, 16> Queue;
2526 const Type *T = Ty->getCanonicalTypeInternal().getTypePtr();
2529 switch (T->getTypeClass()) {
2531 #define TYPE(Class, Base)
2532 #define DEPENDENT_TYPE(Class, Base) case Type::Class:
2533 #define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
2534 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) case Type::Class:
2535 #define ABSTRACT_TYPE(Class, Base)
2536 #include "clang/AST/TypeNodes.def"
2537 // T is canonical. We can also ignore dependent types because
2538 // we don't need to do ADL at the definition point, but if we
2539 // wanted to implement template export (or if we find some other
2540 // use for associated classes and namespaces...) this would be
2544 // -- If T is a pointer to U or an array of U, its associated
2545 // namespaces and classes are those associated with U.
2547 T = cast<PointerType>(T)->getPointeeType().getTypePtr();
2549 case Type::ConstantArray:
2550 case Type::IncompleteArray:
2551 case Type::VariableArray:
2552 T = cast<ArrayType>(T)->getElementType().getTypePtr();
2555 // -- If T is a fundamental type, its associated sets of
2556 // namespaces and classes are both empty.
2560 // -- If T is a class type (including unions), its associated
2561 // classes are: the class itself; the class of which it is a
2562 // member, if any; and its direct and indirect base
2563 // classes. Its associated namespaces are the namespaces in
2564 // which its associated classes are defined.
2565 case Type::Record: {
2566 CXXRecordDecl *Class =
2567 cast<CXXRecordDecl>(cast<RecordType>(T)->getDecl());
2568 addAssociatedClassesAndNamespaces(Result, Class);
2572 // -- If T is an enumeration type, its associated namespace is
2573 // the namespace in which it is defined. If it is class
2574 // member, its associated class is the member's class; else
2575 // it has no associated class.
2577 EnumDecl *Enum = cast<EnumType>(T)->getDecl();
2579 DeclContext *Ctx = Enum->getDeclContext();
2580 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2581 Result.Classes.insert(EnclosingClass);
2583 // Add the associated namespace for this class.
2584 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2589 // -- If T is a function type, its associated namespaces and
2590 // classes are those associated with the function parameter
2591 // types and those associated with the return type.
2592 case Type::FunctionProto: {
2593 const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
2594 for (const auto &Arg : Proto->param_types())
2595 Queue.push_back(Arg.getTypePtr());
2599 case Type::FunctionNoProto: {
2600 const FunctionType *FnType = cast<FunctionType>(T);
2601 T = FnType->getReturnType().getTypePtr();
2605 // -- If T is a pointer to a member function of a class X, its
2606 // associated namespaces and classes are those associated
2607 // with the function parameter types and return type,
2608 // together with those associated with X.
2610 // -- If T is a pointer to a data member of class X, its
2611 // associated namespaces and classes are those associated
2612 // with the member type together with those associated with
2614 case Type::MemberPointer: {
2615 const MemberPointerType *MemberPtr = cast<MemberPointerType>(T);
2617 // Queue up the class type into which this points.
2618 Queue.push_back(MemberPtr->getClass());
2620 // And directly continue with the pointee type.
2621 T = MemberPtr->getPointeeType().getTypePtr();
2625 // As an extension, treat this like a normal pointer.
2626 case Type::BlockPointer:
2627 T = cast<BlockPointerType>(T)->getPointeeType().getTypePtr();
2630 // References aren't covered by the standard, but that's such an
2631 // obvious defect that we cover them anyway.
2632 case Type::LValueReference:
2633 case Type::RValueReference:
2634 T = cast<ReferenceType>(T)->getPointeeType().getTypePtr();
2637 // These are fundamental types.
2639 case Type::ExtVector:
2643 // Non-deduced auto types only get here for error cases.
2645 case Type::DeducedTemplateSpecialization:
2648 // If T is an Objective-C object or interface type, or a pointer to an
2649 // object or interface type, the associated namespace is the global
2651 case Type::ObjCObject:
2652 case Type::ObjCInterface:
2653 case Type::ObjCObjectPointer:
2654 Result.Namespaces.insert(Result.S.Context.getTranslationUnitDecl());
2657 // Atomic types are just wrappers; use the associations of the
2660 T = cast<AtomicType>(T)->getValueType().getTypePtr();
2663 T = cast<PipeType>(T)->getElementType().getTypePtr();
2669 T = Queue.pop_back_val();
2673 /// \brief Find the associated classes and namespaces for
2674 /// argument-dependent lookup for a call with the given set of
2677 /// This routine computes the sets of associated classes and associated
2678 /// namespaces searched by argument-dependent lookup
2679 /// (C++ [basic.lookup.argdep]) for a given set of arguments.
2680 void Sema::FindAssociatedClassesAndNamespaces(
2681 SourceLocation InstantiationLoc, ArrayRef<Expr *> Args,
2682 AssociatedNamespaceSet &AssociatedNamespaces,
2683 AssociatedClassSet &AssociatedClasses) {
2684 AssociatedNamespaces.clear();
2685 AssociatedClasses.clear();
2687 AssociatedLookup Result(*this, InstantiationLoc,
2688 AssociatedNamespaces, AssociatedClasses);
2690 // C++ [basic.lookup.koenig]p2:
2691 // For each argument type T in the function call, there is a set
2692 // of zero or more associated namespaces and a set of zero or more
2693 // associated classes to be considered. The sets of namespaces and
2694 // classes is determined entirely by the types of the function
2695 // arguments (and the namespace of any template template
2697 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
2698 Expr *Arg = Args[ArgIdx];
2700 if (Arg->getType() != Context.OverloadTy) {
2701 addAssociatedClassesAndNamespaces(Result, Arg->getType());
2705 // [...] In addition, if the argument is the name or address of a
2706 // set of overloaded functions and/or function templates, its
2707 // associated classes and namespaces are the union of those
2708 // associated with each of the members of the set: the namespace
2709 // in which the function or function template is defined and the
2710 // classes and namespaces associated with its (non-dependent)
2711 // parameter types and return type.
2712 Arg = Arg->IgnoreParens();
2713 if (UnaryOperator *unaryOp = dyn_cast<UnaryOperator>(Arg))
2714 if (unaryOp->getOpcode() == UO_AddrOf)
2715 Arg = unaryOp->getSubExpr();
2717 UnresolvedLookupExpr *ULE = dyn_cast<UnresolvedLookupExpr>(Arg);
2720 for (const auto *D : ULE->decls()) {
2721 // Look through any using declarations to find the underlying function.
2722 const FunctionDecl *FDecl = D->getUnderlyingDecl()->getAsFunction();
2724 // Add the classes and namespaces associated with the parameter
2725 // types and return type of this function.
2726 addAssociatedClassesAndNamespaces(Result, FDecl->getType());
2731 NamedDecl *Sema::LookupSingleName(Scope *S, DeclarationName Name,
2733 LookupNameKind NameKind,
2734 RedeclarationKind Redecl) {
2735 LookupResult R(*this, Name, Loc, NameKind, Redecl);
2737 return R.getAsSingle<NamedDecl>();
2740 /// \brief Find the protocol with the given name, if any.
2741 ObjCProtocolDecl *Sema::LookupProtocol(IdentifierInfo *II,
2742 SourceLocation IdLoc,
2743 RedeclarationKind Redecl) {
2744 Decl *D = LookupSingleName(TUScope, II, IdLoc,
2745 LookupObjCProtocolName, Redecl);
2746 return cast_or_null<ObjCProtocolDecl>(D);
2749 void Sema::LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
2750 QualType T1, QualType T2,
2751 UnresolvedSetImpl &Functions) {
2752 // C++ [over.match.oper]p3:
2753 // -- The set of non-member candidates is the result of the
2754 // unqualified lookup of operator@ in the context of the
2755 // expression according to the usual rules for name lookup in
2756 // unqualified function calls (3.4.2) except that all member
2757 // functions are ignored.
2758 DeclarationName OpName = Context.DeclarationNames.getCXXOperatorName(Op);
2759 LookupResult Operators(*this, OpName, SourceLocation(), LookupOperatorName);
2760 LookupName(Operators, S);
2762 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
2763 Functions.append(Operators.begin(), Operators.end());
2766 Sema::SpecialMemberOverloadResult Sema::LookupSpecialMember(CXXRecordDecl *RD,
2767 CXXSpecialMember SM,
2772 bool VolatileThis) {
2773 assert(CanDeclareSpecialMemberFunction(RD) &&
2774 "doing special member lookup into record that isn't fully complete");
2775 RD = RD->getDefinition();
2776 if (RValueThis || ConstThis || VolatileThis)
2777 assert((SM == CXXCopyAssignment || SM == CXXMoveAssignment) &&
2778 "constructors and destructors always have unqualified lvalue this");
2779 if (ConstArg || VolatileArg)
2780 assert((SM != CXXDefaultConstructor && SM != CXXDestructor) &&
2781 "parameter-less special members can't have qualified arguments");
2783 // FIXME: Get the caller to pass in a location for the lookup.
2784 SourceLocation LookupLoc = RD->getLocation();
2786 llvm::FoldingSetNodeID ID;
2789 ID.AddInteger(ConstArg);
2790 ID.AddInteger(VolatileArg);
2791 ID.AddInteger(RValueThis);
2792 ID.AddInteger(ConstThis);
2793 ID.AddInteger(VolatileThis);
2796 SpecialMemberOverloadResultEntry *Result =
2797 SpecialMemberCache.FindNodeOrInsertPos(ID, InsertPoint);
2799 // This was already cached
2803 Result = BumpAlloc.Allocate<SpecialMemberOverloadResultEntry>();
2804 Result = new (Result) SpecialMemberOverloadResultEntry(ID);
2805 SpecialMemberCache.InsertNode(Result, InsertPoint);
2807 if (SM == CXXDestructor) {
2808 if (RD->needsImplicitDestructor())
2809 DeclareImplicitDestructor(RD);
2810 CXXDestructorDecl *DD = RD->getDestructor();
2811 assert(DD && "record without a destructor");
2812 Result->setMethod(DD);
2813 Result->setKind(DD->isDeleted() ?
2814 SpecialMemberOverloadResult::NoMemberOrDeleted :
2815 SpecialMemberOverloadResult::Success);
2819 // Prepare for overload resolution. Here we construct a synthetic argument
2820 // if necessary and make sure that implicit functions are declared.
2821 CanQualType CanTy = Context.getCanonicalType(Context.getTagDeclType(RD));
2822 DeclarationName Name;
2823 Expr *Arg = nullptr;
2826 QualType ArgType = CanTy;
2827 ExprValueKind VK = VK_LValue;
2829 if (SM == CXXDefaultConstructor) {
2830 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2832 if (RD->needsImplicitDefaultConstructor())
2833 DeclareImplicitDefaultConstructor(RD);
2835 if (SM == CXXCopyConstructor || SM == CXXMoveConstructor) {
2836 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2837 if (RD->needsImplicitCopyConstructor())
2838 DeclareImplicitCopyConstructor(RD);
2839 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveConstructor())
2840 DeclareImplicitMoveConstructor(RD);
2842 Name = Context.DeclarationNames.getCXXOperatorName(OO_Equal);
2843 if (RD->needsImplicitCopyAssignment())
2844 DeclareImplicitCopyAssignment(RD);
2845 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveAssignment())
2846 DeclareImplicitMoveAssignment(RD);
2852 ArgType.addVolatile();
2854 // This isn't /really/ specified by the standard, but it's implied
2855 // we should be working from an RValue in the case of move to ensure
2856 // that we prefer to bind to rvalue references, and an LValue in the
2857 // case of copy to ensure we don't bind to rvalue references.
2858 // Possibly an XValue is actually correct in the case of move, but
2859 // there is no semantic difference for class types in this restricted
2861 if (SM == CXXCopyConstructor || SM == CXXCopyAssignment)
2867 OpaqueValueExpr FakeArg(LookupLoc, ArgType, VK);
2869 if (SM != CXXDefaultConstructor) {
2874 // Create the object argument
2875 QualType ThisTy = CanTy;
2879 ThisTy.addVolatile();
2880 Expr::Classification Classification =
2881 OpaqueValueExpr(LookupLoc, ThisTy,
2882 RValueThis ? VK_RValue : VK_LValue).Classify(Context);
2884 // Now we perform lookup on the name we computed earlier and do overload
2885 // resolution. Lookup is only performed directly into the class since there
2886 // will always be a (possibly implicit) declaration to shadow any others.
2887 OverloadCandidateSet OCS(LookupLoc, OverloadCandidateSet::CSK_Normal);
2888 DeclContext::lookup_result R = RD->lookup(Name);
2891 // We might have no default constructor because we have a lambda's closure
2892 // type, rather than because there's some other declared constructor.
2893 // Every class has a copy/move constructor, copy/move assignment, and
2895 assert(SM == CXXDefaultConstructor &&
2896 "lookup for a constructor or assignment operator was empty");
2897 Result->setMethod(nullptr);
2898 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2902 // Copy the candidates as our processing of them may load new declarations
2903 // from an external source and invalidate lookup_result.
2904 SmallVector<NamedDecl *, 8> Candidates(R.begin(), R.end());
2906 for (NamedDecl *CandDecl : Candidates) {
2907 if (CandDecl->isInvalidDecl())
2910 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public);
2911 auto CtorInfo = getConstructorInfo(Cand);
2912 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand->getUnderlyingDecl())) {
2913 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2914 AddMethodCandidate(M, Cand, RD, ThisTy, Classification,
2915 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2917 AddOverloadCandidate(CtorInfo.Constructor, CtorInfo.FoundDecl,
2918 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2920 AddOverloadCandidate(M, Cand, llvm::makeArrayRef(&Arg, NumArgs), OCS,
2922 } else if (FunctionTemplateDecl *Tmpl =
2923 dyn_cast<FunctionTemplateDecl>(Cand->getUnderlyingDecl())) {
2924 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2925 AddMethodTemplateCandidate(
2926 Tmpl, Cand, RD, nullptr, ThisTy, Classification,
2927 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2929 AddTemplateOverloadCandidate(
2930 CtorInfo.ConstructorTmpl, CtorInfo.FoundDecl, nullptr,
2931 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2933 AddTemplateOverloadCandidate(
2934 Tmpl, Cand, nullptr, llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2936 assert(isa<UsingDecl>(Cand.getDecl()) &&
2937 "illegal Kind of operator = Decl");
2941 OverloadCandidateSet::iterator Best;
2942 switch (OCS.BestViableFunction(*this, LookupLoc, Best)) {
2944 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2945 Result->setKind(SpecialMemberOverloadResult::Success);
2949 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2950 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2954 Result->setMethod(nullptr);
2955 Result->setKind(SpecialMemberOverloadResult::Ambiguous);
2958 case OR_No_Viable_Function:
2959 Result->setMethod(nullptr);
2960 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2967 /// \brief Look up the default constructor for the given class.
2968 CXXConstructorDecl *Sema::LookupDefaultConstructor(CXXRecordDecl *Class) {
2969 SpecialMemberOverloadResult Result =
2970 LookupSpecialMember(Class, CXXDefaultConstructor, false, false, false,
2973 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
2976 /// \brief Look up the copying constructor for the given class.
2977 CXXConstructorDecl *Sema::LookupCopyingConstructor(CXXRecordDecl *Class,
2979 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2980 "non-const, non-volatile qualifiers for copy ctor arg");
2981 SpecialMemberOverloadResult Result =
2982 LookupSpecialMember(Class, CXXCopyConstructor, Quals & Qualifiers::Const,
2983 Quals & Qualifiers::Volatile, false, false, false);
2985 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
2988 /// \brief Look up the moving constructor for the given class.
2989 CXXConstructorDecl *Sema::LookupMovingConstructor(CXXRecordDecl *Class,
2991 SpecialMemberOverloadResult Result =
2992 LookupSpecialMember(Class, CXXMoveConstructor, Quals & Qualifiers::Const,
2993 Quals & Qualifiers::Volatile, false, false, false);
2995 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
2998 /// \brief Look up the constructors for the given class.
2999 DeclContext::lookup_result Sema::LookupConstructors(CXXRecordDecl *Class) {
3000 // If the implicit constructors have not yet been declared, do so now.
3001 if (CanDeclareSpecialMemberFunction(Class)) {
3002 if (Class->needsImplicitDefaultConstructor())
3003 DeclareImplicitDefaultConstructor(Class);
3004 if (Class->needsImplicitCopyConstructor())
3005 DeclareImplicitCopyConstructor(Class);
3006 if (getLangOpts().CPlusPlus11 && Class->needsImplicitMoveConstructor())
3007 DeclareImplicitMoveConstructor(Class);
3010 CanQualType T = Context.getCanonicalType(Context.getTypeDeclType(Class));
3011 DeclarationName Name = Context.DeclarationNames.getCXXConstructorName(T);
3012 return Class->lookup(Name);
3015 /// \brief Look up the copying assignment operator for the given class.
3016 CXXMethodDecl *Sema::LookupCopyingAssignment(CXXRecordDecl *Class,
3017 unsigned Quals, bool RValueThis,
3018 unsigned ThisQuals) {
3019 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3020 "non-const, non-volatile qualifiers for copy assignment arg");
3021 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3022 "non-const, non-volatile qualifiers for copy assignment this");
3023 SpecialMemberOverloadResult Result =
3024 LookupSpecialMember(Class, CXXCopyAssignment, Quals & Qualifiers::Const,
3025 Quals & Qualifiers::Volatile, RValueThis,
3026 ThisQuals & Qualifiers::Const,
3027 ThisQuals & Qualifiers::Volatile);
3029 return Result.getMethod();
3032 /// \brief Look up the moving assignment operator for the given class.
3033 CXXMethodDecl *Sema::LookupMovingAssignment(CXXRecordDecl *Class,
3036 unsigned ThisQuals) {
3037 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3038 "non-const, non-volatile qualifiers for copy assignment this");
3039 SpecialMemberOverloadResult Result =
3040 LookupSpecialMember(Class, CXXMoveAssignment, Quals & Qualifiers::Const,
3041 Quals & Qualifiers::Volatile, RValueThis,
3042 ThisQuals & Qualifiers::Const,
3043 ThisQuals & Qualifiers::Volatile);
3045 return Result.getMethod();
3048 /// \brief Look for the destructor of the given class.
3050 /// During semantic analysis, this routine should be used in lieu of
3051 /// CXXRecordDecl::getDestructor().
3053 /// \returns The destructor for this class.
3054 CXXDestructorDecl *Sema::LookupDestructor(CXXRecordDecl *Class) {
3055 return cast<CXXDestructorDecl>(LookupSpecialMember(Class, CXXDestructor,
3056 false, false, false,
3057 false, false).getMethod());
3060 /// LookupLiteralOperator - Determine which literal operator should be used for
3061 /// a user-defined literal, per C++11 [lex.ext].
3063 /// Normal overload resolution is not used to select which literal operator to
3064 /// call for a user-defined literal. Look up the provided literal operator name,
3065 /// and filter the results to the appropriate set for the given argument types.
3066 Sema::LiteralOperatorLookupResult
3067 Sema::LookupLiteralOperator(Scope *S, LookupResult &R,
3068 ArrayRef<QualType> ArgTys,
3069 bool AllowRaw, bool AllowTemplate,
3070 bool AllowStringTemplate) {
3072 assert(R.getResultKind() != LookupResult::Ambiguous &&
3073 "literal operator lookup can't be ambiguous");
3075 // Filter the lookup results appropriately.
3076 LookupResult::Filter F = R.makeFilter();
3078 bool FoundRaw = false;
3079 bool FoundTemplate = false;
3080 bool FoundStringTemplate = false;
3081 bool FoundExactMatch = false;
3083 while (F.hasNext()) {
3085 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
3086 D = USD->getTargetDecl();
3088 // If the declaration we found is invalid, skip it.
3089 if (D->isInvalidDecl()) {
3095 bool IsTemplate = false;
3096 bool IsStringTemplate = false;
3097 bool IsExactMatch = false;
3099 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
3100 if (FD->getNumParams() == 1 &&
3101 FD->getParamDecl(0)->getType()->getAs<PointerType>())
3103 else if (FD->getNumParams() == ArgTys.size()) {
3104 IsExactMatch = true;
3105 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
3106 QualType ParamTy = FD->getParamDecl(ArgIdx)->getType();
3107 if (!Context.hasSameUnqualifiedType(ArgTys[ArgIdx], ParamTy)) {
3108 IsExactMatch = false;
3114 if (FunctionTemplateDecl *FD = dyn_cast<FunctionTemplateDecl>(D)) {
3115 TemplateParameterList *Params = FD->getTemplateParameters();
3116 if (Params->size() == 1)
3119 IsStringTemplate = true;
3123 FoundExactMatch = true;
3125 AllowTemplate = false;
3126 AllowStringTemplate = false;
3127 if (FoundRaw || FoundTemplate || FoundStringTemplate) {
3128 // Go through again and remove the raw and template decls we've
3131 FoundRaw = FoundTemplate = FoundStringTemplate = false;
3133 } else if (AllowRaw && IsRaw) {
3135 } else if (AllowTemplate && IsTemplate) {
3136 FoundTemplate = true;
3137 } else if (AllowStringTemplate && IsStringTemplate) {
3138 FoundStringTemplate = true;
3146 // C++11 [lex.ext]p3, p4: If S contains a literal operator with a matching
3147 // parameter type, that is used in preference to a raw literal operator
3148 // or literal operator template.
3149 if (FoundExactMatch)
3152 // C++11 [lex.ext]p3, p4: S shall contain a raw literal operator or a literal
3153 // operator template, but not both.
3154 if (FoundRaw && FoundTemplate) {
3155 Diag(R.getNameLoc(), diag::err_ovl_ambiguous_call) << R.getLookupName();
3156 for (LookupResult::iterator I = R.begin(), E = R.end(); I != E; ++I)
3157 NoteOverloadCandidate(*I, (*I)->getUnderlyingDecl()->getAsFunction());
3165 return LOLR_Template;
3167 if (FoundStringTemplate)
3168 return LOLR_StringTemplate;
3170 // Didn't find anything we could use.
3171 Diag(R.getNameLoc(), diag::err_ovl_no_viable_literal_operator)
3172 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
3173 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRaw
3174 << (AllowTemplate || AllowStringTemplate);
3178 void ADLResult::insert(NamedDecl *New) {
3179 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
3181 // If we haven't yet seen a decl for this key, or the last decl
3182 // was exactly this one, we're done.
3183 if (Old == nullptr || Old == New) {
3188 // Otherwise, decide which is a more recent redeclaration.
3189 FunctionDecl *OldFD = Old->getAsFunction();
3190 FunctionDecl *NewFD = New->getAsFunction();
3192 FunctionDecl *Cursor = NewFD;
3194 Cursor = Cursor->getPreviousDecl();
3196 // If we got to the end without finding OldFD, OldFD is the newer
3197 // declaration; leave things as they are.
3198 if (!Cursor) return;
3200 // If we do find OldFD, then NewFD is newer.
3201 if (Cursor == OldFD) break;
3203 // Otherwise, keep looking.
3209 void Sema::ArgumentDependentLookup(DeclarationName Name, SourceLocation Loc,
3210 ArrayRef<Expr *> Args, ADLResult &Result) {
3211 // Find all of the associated namespaces and classes based on the
3212 // arguments we have.
3213 AssociatedNamespaceSet AssociatedNamespaces;
3214 AssociatedClassSet AssociatedClasses;
3215 FindAssociatedClassesAndNamespaces(Loc, Args,
3216 AssociatedNamespaces,
3219 // C++ [basic.lookup.argdep]p3:
3220 // Let X be the lookup set produced by unqualified lookup (3.4.1)
3221 // and let Y be the lookup set produced by argument dependent
3222 // lookup (defined as follows). If X contains [...] then Y is
3223 // empty. Otherwise Y is the set of declarations found in the
3224 // namespaces associated with the argument types as described
3225 // below. The set of declarations found by the lookup of the name
3226 // is the union of X and Y.
3228 // Here, we compute Y and add its members to the overloaded
3230 for (auto *NS : AssociatedNamespaces) {
3231 // When considering an associated namespace, the lookup is the
3232 // same as the lookup performed when the associated namespace is
3233 // used as a qualifier (3.4.3.2) except that:
3235 // -- Any using-directives in the associated namespace are
3238 // -- Any namespace-scope friend functions declared in
3239 // associated classes are visible within their respective
3240 // namespaces even if they are not visible during an ordinary
3242 DeclContext::lookup_result R = NS->lookup(Name);
3244 // If the only declaration here is an ordinary friend, consider
3245 // it only if it was declared in an associated classes.
3246 if ((D->getIdentifierNamespace() & Decl::IDNS_Ordinary) == 0) {
3247 // If it's neither ordinarily visible nor a friend, we can't find it.
3248 if ((D->getIdentifierNamespace() & Decl::IDNS_OrdinaryFriend) == 0)
3251 bool DeclaredInAssociatedClass = false;
3252 for (Decl *DI = D; DI; DI = DI->getPreviousDecl()) {
3253 DeclContext *LexDC = DI->getLexicalDeclContext();
3254 if (isa<CXXRecordDecl>(LexDC) &&
3255 AssociatedClasses.count(cast<CXXRecordDecl>(LexDC)) &&
3256 isVisible(cast<NamedDecl>(DI))) {
3257 DeclaredInAssociatedClass = true;
3261 if (!DeclaredInAssociatedClass)
3265 if (isa<UsingShadowDecl>(D))
3266 D = cast<UsingShadowDecl>(D)->getTargetDecl();
3268 if (!isa<FunctionDecl>(D) && !isa<FunctionTemplateDecl>(D))
3271 if (!isVisible(D) && !(D = findAcceptableDecl(*this, D)))
3279 //----------------------------------------------------------------------------
3280 // Search for all visible declarations.
3281 //----------------------------------------------------------------------------
3282 VisibleDeclConsumer::~VisibleDeclConsumer() { }
3284 bool VisibleDeclConsumer::includeHiddenDecls() const { return false; }
3288 class ShadowContextRAII;
3290 class VisibleDeclsRecord {
3292 /// \brief An entry in the shadow map, which is optimized to store a
3293 /// single declaration (the common case) but can also store a list
3294 /// of declarations.
3295 typedef llvm::TinyPtrVector<NamedDecl*> ShadowMapEntry;
3298 /// \brief A mapping from declaration names to the declarations that have
3299 /// this name within a particular scope.
3300 typedef llvm::DenseMap<DeclarationName, ShadowMapEntry> ShadowMap;
3302 /// \brief A list of shadow maps, which is used to model name hiding.
3303 std::list<ShadowMap> ShadowMaps;
3305 /// \brief The declaration contexts we have already visited.
3306 llvm::SmallPtrSet<DeclContext *, 8> VisitedContexts;
3308 friend class ShadowContextRAII;
3311 /// \brief Determine whether we have already visited this context
3312 /// (and, if not, note that we are going to visit that context now).
3313 bool visitedContext(DeclContext *Ctx) {
3314 return !VisitedContexts.insert(Ctx).second;
3317 bool alreadyVisitedContext(DeclContext *Ctx) {
3318 return VisitedContexts.count(Ctx);
3321 /// \brief Determine whether the given declaration is hidden in the
3324 /// \returns the declaration that hides the given declaration, or
3325 /// NULL if no such declaration exists.
3326 NamedDecl *checkHidden(NamedDecl *ND);
3328 /// \brief Add a declaration to the current shadow map.
3329 void add(NamedDecl *ND) {
3330 ShadowMaps.back()[ND->getDeclName()].push_back(ND);
3334 /// \brief RAII object that records when we've entered a shadow context.
3335 class ShadowContextRAII {
3336 VisibleDeclsRecord &Visible;
3338 typedef VisibleDeclsRecord::ShadowMap ShadowMap;
3341 ShadowContextRAII(VisibleDeclsRecord &Visible) : Visible(Visible) {
3342 Visible.ShadowMaps.emplace_back();
3345 ~ShadowContextRAII() {
3346 Visible.ShadowMaps.pop_back();
3350 } // end anonymous namespace
3352 NamedDecl *VisibleDeclsRecord::checkHidden(NamedDecl *ND) {
3353 unsigned IDNS = ND->getIdentifierNamespace();
3354 std::list<ShadowMap>::reverse_iterator SM = ShadowMaps.rbegin();
3355 for (std::list<ShadowMap>::reverse_iterator SMEnd = ShadowMaps.rend();
3356 SM != SMEnd; ++SM) {
3357 ShadowMap::iterator Pos = SM->find(ND->getDeclName());
3358 if (Pos == SM->end())
3361 for (auto *D : Pos->second) {
3362 // A tag declaration does not hide a non-tag declaration.
3363 if (D->hasTagIdentifierNamespace() &&
3364 (IDNS & (Decl::IDNS_Member | Decl::IDNS_Ordinary |
3365 Decl::IDNS_ObjCProtocol)))
3368 // Protocols are in distinct namespaces from everything else.
3369 if (((D->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol)
3370 || (IDNS & Decl::IDNS_ObjCProtocol)) &&
3371 D->getIdentifierNamespace() != IDNS)
3374 // Functions and function templates in the same scope overload
3375 // rather than hide. FIXME: Look for hiding based on function
3377 if (D->getUnderlyingDecl()->isFunctionOrFunctionTemplate() &&
3378 ND->getUnderlyingDecl()->isFunctionOrFunctionTemplate() &&
3379 SM == ShadowMaps.rbegin())
3382 // A shadow declaration that's created by a resolved using declaration
3383 // is not hidden by the same using declaration.
3384 if (isa<UsingShadowDecl>(ND) && isa<UsingDecl>(D) &&
3385 cast<UsingShadowDecl>(ND)->getUsingDecl() == D)
3388 // We've found a declaration that hides this one.
3396 static void LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result,
3397 bool QualifiedNameLookup,
3399 VisibleDeclConsumer &Consumer,
3400 VisibleDeclsRecord &Visited,
3401 bool IncludeDependentBases = false) {
3405 // Make sure we don't visit the same context twice.
3406 if (Visited.visitedContext(Ctx->getPrimaryContext()))
3409 // Outside C++, lookup results for the TU live on identifiers.
3410 if (isa<TranslationUnitDecl>(Ctx) &&
3411 !Result.getSema().getLangOpts().CPlusPlus) {
3412 auto &S = Result.getSema();
3413 auto &Idents = S.Context.Idents;
3415 // Ensure all external identifiers are in the identifier table.
3416 if (IdentifierInfoLookup *External = Idents.getExternalIdentifierLookup()) {
3417 std::unique_ptr<IdentifierIterator> Iter(External->getIdentifiers());
3418 for (StringRef Name = Iter->Next(); !Name.empty(); Name = Iter->Next())
3422 // Walk all lookup results in the TU for each identifier.
3423 for (const auto &Ident : Idents) {
3424 for (auto I = S.IdResolver.begin(Ident.getValue()),
3425 E = S.IdResolver.end();
3427 if (S.IdResolver.isDeclInScope(*I, Ctx)) {
3428 if (NamedDecl *ND = Result.getAcceptableDecl(*I)) {
3429 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3439 if (CXXRecordDecl *Class = dyn_cast<CXXRecordDecl>(Ctx))
3440 Result.getSema().ForceDeclarationOfImplicitMembers(Class);
3442 // Enumerate all of the results in this context.
3443 for (DeclContextLookupResult R : Ctx->lookups()) {
3445 if (auto *ND = Result.getAcceptableDecl(D)) {
3446 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3452 // Traverse using directives for qualified name lookup.
3453 if (QualifiedNameLookup) {
3454 ShadowContextRAII Shadow(Visited);
3455 for (auto I : Ctx->using_directives()) {
3456 LookupVisibleDecls(I->getNominatedNamespace(), Result,
3457 QualifiedNameLookup, InBaseClass, Consumer, Visited,
3458 IncludeDependentBases);
3462 // Traverse the contexts of inherited C++ classes.
3463 if (CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(Ctx)) {
3464 if (!Record->hasDefinition())
3467 for (const auto &B : Record->bases()) {
3468 QualType BaseType = B.getType();
3471 if (BaseType->isDependentType()) {
3472 if (!IncludeDependentBases) {
3473 // Don't look into dependent bases, because name lookup can't look
3477 const auto *TST = BaseType->getAs<TemplateSpecializationType>();
3480 TemplateName TN = TST->getTemplateName();
3482 dyn_cast_or_null<ClassTemplateDecl>(TN.getAsTemplateDecl());
3485 RD = TD->getTemplatedDecl();
3487 const auto *Record = BaseType->getAs<RecordType>();
3490 RD = Record->getDecl();
3493 // FIXME: It would be nice to be able to determine whether referencing
3494 // a particular member would be ambiguous. For example, given
3496 // struct A { int member; };
3497 // struct B { int member; };
3498 // struct C : A, B { };
3500 // void f(C *c) { c->### }
3502 // accessing 'member' would result in an ambiguity. However, we
3503 // could be smart enough to qualify the member with the base
3512 // Find results in this base class (and its bases).
3513 ShadowContextRAII Shadow(Visited);
3514 LookupVisibleDecls(RD, Result, QualifiedNameLookup, true, Consumer,
3515 Visited, IncludeDependentBases);
3519 // Traverse the contexts of Objective-C classes.
3520 if (ObjCInterfaceDecl *IFace = dyn_cast<ObjCInterfaceDecl>(Ctx)) {
3521 // Traverse categories.
3522 for (auto *Cat : IFace->visible_categories()) {
3523 ShadowContextRAII Shadow(Visited);
3524 LookupVisibleDecls(Cat, Result, QualifiedNameLookup, false,
3528 // Traverse protocols.
3529 for (auto *I : IFace->all_referenced_protocols()) {
3530 ShadowContextRAII Shadow(Visited);
3531 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3535 // Traverse the superclass.
3536 if (IFace->getSuperClass()) {
3537 ShadowContextRAII Shadow(Visited);
3538 LookupVisibleDecls(IFace->getSuperClass(), Result, QualifiedNameLookup,
3539 true, Consumer, Visited);
3542 // If there is an implementation, traverse it. We do this to find
3543 // synthesized ivars.
3544 if (IFace->getImplementation()) {
3545 ShadowContextRAII Shadow(Visited);
3546 LookupVisibleDecls(IFace->getImplementation(), Result,
3547 QualifiedNameLookup, InBaseClass, Consumer, Visited);
3549 } else if (ObjCProtocolDecl *Protocol = dyn_cast<ObjCProtocolDecl>(Ctx)) {
3550 for (auto *I : Protocol->protocols()) {
3551 ShadowContextRAII Shadow(Visited);
3552 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3555 } else if (ObjCCategoryDecl *Category = dyn_cast<ObjCCategoryDecl>(Ctx)) {
3556 for (auto *I : Category->protocols()) {
3557 ShadowContextRAII Shadow(Visited);
3558 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3562 // If there is an implementation, traverse it.
3563 if (Category->getImplementation()) {
3564 ShadowContextRAII Shadow(Visited);
3565 LookupVisibleDecls(Category->getImplementation(), Result,
3566 QualifiedNameLookup, true, Consumer, Visited);
3571 static void LookupVisibleDecls(Scope *S, LookupResult &Result,
3572 UnqualUsingDirectiveSet &UDirs,
3573 VisibleDeclConsumer &Consumer,
3574 VisibleDeclsRecord &Visited) {
3578 if (!S->getEntity() ||
3580 !Visited.alreadyVisitedContext(S->getEntity())) ||
3581 (S->getEntity())->isFunctionOrMethod()) {
3582 FindLocalExternScope FindLocals(Result);
3583 // Walk through the declarations in this Scope.
3584 for (auto *D : S->decls()) {
3585 if (NamedDecl *ND = dyn_cast<NamedDecl>(D))
3586 if ((ND = Result.getAcceptableDecl(ND))) {
3587 Consumer.FoundDecl(ND, Visited.checkHidden(ND), nullptr, false);
3593 // FIXME: C++ [temp.local]p8
3594 DeclContext *Entity = nullptr;
3595 if (S->getEntity()) {
3596 // Look into this scope's declaration context, along with any of its
3597 // parent lookup contexts (e.g., enclosing classes), up to the point
3598 // where we hit the context stored in the next outer scope.
3599 Entity = S->getEntity();
3600 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
3602 for (DeclContext *Ctx = Entity; Ctx && !Ctx->Equals(OuterCtx);
3603 Ctx = Ctx->getLookupParent()) {
3604 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
3605 if (Method->isInstanceMethod()) {
3606 // For instance methods, look for ivars in the method's interface.
3607 LookupResult IvarResult(Result.getSema(), Result.getLookupName(),
3608 Result.getNameLoc(), Sema::LookupMemberName);
3609 if (ObjCInterfaceDecl *IFace = Method->getClassInterface()) {
3610 LookupVisibleDecls(IFace, IvarResult, /*QualifiedNameLookup=*/false,
3611 /*InBaseClass=*/false, Consumer, Visited);
3615 // We've already performed all of the name lookup that we need
3616 // to for Objective-C methods; the next context will be the
3621 if (Ctx->isFunctionOrMethod())
3624 LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/false,
3625 /*InBaseClass=*/false, Consumer, Visited);
3627 } else if (!S->getParent()) {
3628 // Look into the translation unit scope. We walk through the translation
3629 // unit's declaration context, because the Scope itself won't have all of
3630 // the declarations if we loaded a precompiled header.
3631 // FIXME: We would like the translation unit's Scope object to point to the
3632 // translation unit, so we don't need this special "if" branch. However,
3633 // doing so would force the normal C++ name-lookup code to look into the
3634 // translation unit decl when the IdentifierInfo chains would suffice.
3635 // Once we fix that problem (which is part of a more general "don't look
3636 // in DeclContexts unless we have to" optimization), we can eliminate this.
3637 Entity = Result.getSema().Context.getTranslationUnitDecl();
3638 LookupVisibleDecls(Entity, Result, /*QualifiedNameLookup=*/false,
3639 /*InBaseClass=*/false, Consumer, Visited);
3643 // Lookup visible declarations in any namespaces found by using
3645 for (const UnqualUsingEntry &UUE : UDirs.getNamespacesFor(Entity))
3646 LookupVisibleDecls(const_cast<DeclContext *>(UUE.getNominatedNamespace()),
3647 Result, /*QualifiedNameLookup=*/false,
3648 /*InBaseClass=*/false, Consumer, Visited);
3651 // Lookup names in the parent scope.
3652 ShadowContextRAII Shadow(Visited);
3653 LookupVisibleDecls(S->getParent(), Result, UDirs, Consumer, Visited);
3656 void Sema::LookupVisibleDecls(Scope *S, LookupNameKind Kind,
3657 VisibleDeclConsumer &Consumer,
3658 bool IncludeGlobalScope) {
3659 // Determine the set of using directives available during
3660 // unqualified name lookup.
3662 UnqualUsingDirectiveSet UDirs;
3663 if (getLangOpts().CPlusPlus) {
3664 // Find the first namespace or translation-unit scope.
3665 while (S && !isNamespaceOrTranslationUnitScope(S))
3668 UDirs.visitScopeChain(Initial, S);
3672 // Look for visible declarations.
3673 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3674 Result.setAllowHidden(Consumer.includeHiddenDecls());
3675 VisibleDeclsRecord Visited;
3676 if (!IncludeGlobalScope)
3677 Visited.visitedContext(Context.getTranslationUnitDecl());
3678 ShadowContextRAII Shadow(Visited);
3679 ::LookupVisibleDecls(Initial, Result, UDirs, Consumer, Visited);
3682 void Sema::LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
3683 VisibleDeclConsumer &Consumer,
3684 bool IncludeGlobalScope,
3685 bool IncludeDependentBases) {
3686 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3687 Result.setAllowHidden(Consumer.includeHiddenDecls());
3688 VisibleDeclsRecord Visited;
3689 if (!IncludeGlobalScope)
3690 Visited.visitedContext(Context.getTranslationUnitDecl());
3691 ShadowContextRAII Shadow(Visited);
3692 ::LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/true,
3693 /*InBaseClass=*/false, Consumer, Visited,
3694 IncludeDependentBases);
3697 /// LookupOrCreateLabel - Do a name lookup of a label with the specified name.
3698 /// If GnuLabelLoc is a valid source location, then this is a definition
3699 /// of an __label__ label name, otherwise it is a normal label definition
3701 LabelDecl *Sema::LookupOrCreateLabel(IdentifierInfo *II, SourceLocation Loc,
3702 SourceLocation GnuLabelLoc) {
3703 // Do a lookup to see if we have a label with this name already.
3704 NamedDecl *Res = nullptr;
3706 if (GnuLabelLoc.isValid()) {
3707 // Local label definitions always shadow existing labels.
3708 Res = LabelDecl::Create(Context, CurContext, Loc, II, GnuLabelLoc);
3709 Scope *S = CurScope;
3710 PushOnScopeChains(Res, S, true);
3711 return cast<LabelDecl>(Res);
3714 // Not a GNU local label.
3715 Res = LookupSingleName(CurScope, II, Loc, LookupLabel, NotForRedeclaration);
3716 // If we found a label, check to see if it is in the same context as us.
3717 // When in a Block, we don't want to reuse a label in an enclosing function.
3718 if (Res && Res->getDeclContext() != CurContext)
3721 // If not forward referenced or defined already, create the backing decl.
3722 Res = LabelDecl::Create(Context, CurContext, Loc, II);
3723 Scope *S = CurScope->getFnParent();
3724 assert(S && "Not in a function?");
3725 PushOnScopeChains(Res, S, true);
3727 return cast<LabelDecl>(Res);
3730 //===----------------------------------------------------------------------===//
3732 //===----------------------------------------------------------------------===//
3734 static bool isCandidateViable(CorrectionCandidateCallback &CCC,
3735 TypoCorrection &Candidate) {
3736 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3737 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3740 static void LookupPotentialTypoResult(Sema &SemaRef,
3742 IdentifierInfo *Name,
3743 Scope *S, CXXScopeSpec *SS,
3744 DeclContext *MemberContext,
3745 bool EnteringContext,
3746 bool isObjCIvarLookup,
3749 /// \brief Check whether the declarations found for a typo correction are
3750 /// visible, and if none of them are, convert the correction to an 'import
3751 /// a module' correction.
3752 static void checkCorrectionVisibility(Sema &SemaRef, TypoCorrection &TC) {
3753 if (TC.begin() == TC.end())
3756 TypoCorrection::decl_iterator DI = TC.begin(), DE = TC.end();
3758 for (/**/; DI != DE; ++DI)
3759 if (!LookupResult::isVisible(SemaRef, *DI))
3761 // Nothing to do if all decls are visible.
3765 llvm::SmallVector<NamedDecl*, 4> NewDecls(TC.begin(), DI);
3766 bool AnyVisibleDecls = !NewDecls.empty();
3768 for (/**/; DI != DE; ++DI) {
3769 NamedDecl *VisibleDecl = *DI;
3770 if (!LookupResult::isVisible(SemaRef, *DI))
3771 VisibleDecl = findAcceptableDecl(SemaRef, *DI);
3774 if (!AnyVisibleDecls) {
3775 // Found a visible decl, discard all hidden ones.
3776 AnyVisibleDecls = true;
3779 NewDecls.push_back(VisibleDecl);
3780 } else if (!AnyVisibleDecls && !(*DI)->isModulePrivate())
3781 NewDecls.push_back(*DI);
3784 if (NewDecls.empty())
3785 TC = TypoCorrection();
3787 TC.setCorrectionDecls(NewDecls);
3788 TC.setRequiresImport(!AnyVisibleDecls);
3792 // Fill the supplied vector with the IdentifierInfo pointers for each piece of
3793 // the given NestedNameSpecifier (i.e. given a NestedNameSpecifier "foo::bar::",
3794 // fill the vector with the IdentifierInfo pointers for "foo" and "bar").
3795 static void getNestedNameSpecifierIdentifiers(
3796 NestedNameSpecifier *NNS,
3797 SmallVectorImpl<const IdentifierInfo*> &Identifiers) {
3798 if (NestedNameSpecifier *Prefix = NNS->getPrefix())
3799 getNestedNameSpecifierIdentifiers(Prefix, Identifiers);
3801 Identifiers.clear();
3803 const IdentifierInfo *II = nullptr;
3805 switch (NNS->getKind()) {
3806 case NestedNameSpecifier::Identifier:
3807 II = NNS->getAsIdentifier();
3810 case NestedNameSpecifier::Namespace:
3811 if (NNS->getAsNamespace()->isAnonymousNamespace())
3813 II = NNS->getAsNamespace()->getIdentifier();
3816 case NestedNameSpecifier::NamespaceAlias:
3817 II = NNS->getAsNamespaceAlias()->getIdentifier();
3820 case NestedNameSpecifier::TypeSpecWithTemplate:
3821 case NestedNameSpecifier::TypeSpec:
3822 II = QualType(NNS->getAsType(), 0).getBaseTypeIdentifier();
3825 case NestedNameSpecifier::Global:
3826 case NestedNameSpecifier::Super:
3831 Identifiers.push_back(II);
3834 void TypoCorrectionConsumer::FoundDecl(NamedDecl *ND, NamedDecl *Hiding,
3835 DeclContext *Ctx, bool InBaseClass) {
3836 // Don't consider hidden names for typo correction.
3840 // Only consider entities with identifiers for names, ignoring
3841 // special names (constructors, overloaded operators, selectors,
3843 IdentifierInfo *Name = ND->getIdentifier();
3847 // Only consider visible declarations and declarations from modules with
3848 // names that exactly match.
3849 if (!LookupResult::isVisible(SemaRef, ND) && Name != Typo &&
3850 !findAcceptableDecl(SemaRef, ND))
3853 FoundName(Name->getName());
3856 void TypoCorrectionConsumer::FoundName(StringRef Name) {
3857 // Compute the edit distance between the typo and the name of this
3858 // entity, and add the identifier to the list of results.
3859 addName(Name, nullptr);
3862 void TypoCorrectionConsumer::addKeywordResult(StringRef Keyword) {
3863 // Compute the edit distance between the typo and this keyword,
3864 // and add the keyword to the list of results.
3865 addName(Keyword, nullptr, nullptr, true);
3868 void TypoCorrectionConsumer::addName(StringRef Name, NamedDecl *ND,
3869 NestedNameSpecifier *NNS, bool isKeyword) {
3870 // Use a simple length-based heuristic to determine the minimum possible
3871 // edit distance. If the minimum isn't good enough, bail out early.
3872 StringRef TypoStr = Typo->getName();
3873 unsigned MinED = abs((int)Name.size() - (int)TypoStr.size());
3874 if (MinED && TypoStr.size() / MinED < 3)
3877 // Compute an upper bound on the allowable edit distance, so that the
3878 // edit-distance algorithm can short-circuit.
3879 unsigned UpperBound = (TypoStr.size() + 2) / 3 + 1;
3880 unsigned ED = TypoStr.edit_distance(Name, true, UpperBound);
3881 if (ED >= UpperBound) return;
3883 TypoCorrection TC(&SemaRef.Context.Idents.get(Name), ND, NNS, ED);
3884 if (isKeyword) TC.makeKeyword();
3885 TC.setCorrectionRange(nullptr, Result.getLookupNameInfo());
3889 static const unsigned MaxTypoDistanceResultSets = 5;
3891 void TypoCorrectionConsumer::addCorrection(TypoCorrection Correction) {
3892 StringRef TypoStr = Typo->getName();
3893 StringRef Name = Correction.getCorrectionAsIdentifierInfo()->getName();
3895 // For very short typos, ignore potential corrections that have a different
3896 // base identifier from the typo or which have a normalized edit distance
3897 // longer than the typo itself.
3898 if (TypoStr.size() < 3 &&
3899 (Name != TypoStr || Correction.getEditDistance(true) > TypoStr.size()))
3902 // If the correction is resolved but is not viable, ignore it.
3903 if (Correction.isResolved()) {
3904 checkCorrectionVisibility(SemaRef, Correction);
3905 if (!Correction || !isCandidateViable(*CorrectionValidator, Correction))
3909 TypoResultList &CList =
3910 CorrectionResults[Correction.getEditDistance(false)][Name];
3912 if (!CList.empty() && !CList.back().isResolved())
3914 if (NamedDecl *NewND = Correction.getCorrectionDecl()) {
3915 std::string CorrectionStr = Correction.getAsString(SemaRef.getLangOpts());
3916 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
3917 RI != RIEnd; ++RI) {
3918 // If the Correction refers to a decl already in the result list,
3919 // replace the existing result if the string representation of Correction
3920 // comes before the current result alphabetically, then stop as there is
3921 // nothing more to be done to add Correction to the candidate set.
3922 if (RI->getCorrectionDecl() == NewND) {
3923 if (CorrectionStr < RI->getAsString(SemaRef.getLangOpts()))
3929 if (CList.empty() || Correction.isResolved())
3930 CList.push_back(Correction);
3932 while (CorrectionResults.size() > MaxTypoDistanceResultSets)
3933 CorrectionResults.erase(std::prev(CorrectionResults.end()));
3936 void TypoCorrectionConsumer::addNamespaces(
3937 const llvm::MapVector<NamespaceDecl *, bool> &KnownNamespaces) {
3938 SearchNamespaces = true;
3940 for (auto KNPair : KnownNamespaces)
3941 Namespaces.addNameSpecifier(KNPair.first);
3943 bool SSIsTemplate = false;
3944 if (NestedNameSpecifier *NNS =
3945 (SS && SS->isValid()) ? SS->getScopeRep() : nullptr) {
3946 if (const Type *T = NNS->getAsType())
3947 SSIsTemplate = T->getTypeClass() == Type::TemplateSpecialization;
3949 // Do not transform this into an iterator-based loop. The loop body can
3950 // trigger the creation of further types (through lazy deserialization) and
3951 // invalide iterators into this list.
3952 auto &Types = SemaRef.getASTContext().getTypes();
3953 for (unsigned I = 0; I != Types.size(); ++I) {
3954 const auto *TI = Types[I];
3955 if (CXXRecordDecl *CD = TI->getAsCXXRecordDecl()) {
3956 CD = CD->getCanonicalDecl();
3957 if (!CD->isDependentType() && !CD->isAnonymousStructOrUnion() &&
3958 !CD->isUnion() && CD->getIdentifier() &&
3959 (SSIsTemplate || !isa<ClassTemplateSpecializationDecl>(CD)) &&
3960 (CD->isBeingDefined() || CD->isCompleteDefinition()))
3961 Namespaces.addNameSpecifier(CD);
3966 const TypoCorrection &TypoCorrectionConsumer::getNextCorrection() {
3967 if (++CurrentTCIndex < ValidatedCorrections.size())
3968 return ValidatedCorrections[CurrentTCIndex];
3970 CurrentTCIndex = ValidatedCorrections.size();
3971 while (!CorrectionResults.empty()) {
3972 auto DI = CorrectionResults.begin();
3973 if (DI->second.empty()) {
3974 CorrectionResults.erase(DI);
3978 auto RI = DI->second.begin();
3979 if (RI->second.empty()) {
3980 DI->second.erase(RI);
3981 performQualifiedLookups();
3985 TypoCorrection TC = RI->second.pop_back_val();
3986 if (TC.isResolved() || TC.requiresImport() || resolveCorrection(TC)) {
3987 ValidatedCorrections.push_back(TC);
3988 return ValidatedCorrections[CurrentTCIndex];
3991 return ValidatedCorrections[0]; // The empty correction.
3994 bool TypoCorrectionConsumer::resolveCorrection(TypoCorrection &Candidate) {
3995 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
3996 DeclContext *TempMemberContext = MemberContext;
3997 CXXScopeSpec *TempSS = SS.get();
3999 LookupPotentialTypoResult(SemaRef, Result, Name, S, TempSS, TempMemberContext,
4001 CorrectionValidator->IsObjCIvarLookup,
4002 Name == Typo && !Candidate.WillReplaceSpecifier());
4003 switch (Result.getResultKind()) {
4004 case LookupResult::NotFound:
4005 case LookupResult::NotFoundInCurrentInstantiation:
4006 case LookupResult::FoundUnresolvedValue:
4008 // Immediately retry the lookup without the given CXXScopeSpec
4010 Candidate.WillReplaceSpecifier(true);
4013 if (TempMemberContext) {
4016 TempMemberContext = nullptr;
4019 if (SearchNamespaces)
4020 QualifiedResults.push_back(Candidate);
4023 case LookupResult::Ambiguous:
4024 // We don't deal with ambiguities.
4027 case LookupResult::Found:
4028 case LookupResult::FoundOverloaded:
4029 // Store all of the Decls for overloaded symbols
4030 for (auto *TRD : Result)
4031 Candidate.addCorrectionDecl(TRD);
4032 checkCorrectionVisibility(SemaRef, Candidate);
4033 if (!isCandidateViable(*CorrectionValidator, Candidate)) {
4034 if (SearchNamespaces)
4035 QualifiedResults.push_back(Candidate);
4038 Candidate.setCorrectionRange(SS.get(), Result.getLookupNameInfo());
4044 void TypoCorrectionConsumer::performQualifiedLookups() {
4045 unsigned TypoLen = Typo->getName().size();
4046 for (const TypoCorrection &QR : QualifiedResults) {
4047 for (const auto &NSI : Namespaces) {
4048 DeclContext *Ctx = NSI.DeclCtx;
4049 const Type *NSType = NSI.NameSpecifier->getAsType();
4051 // If the current NestedNameSpecifier refers to a class and the
4052 // current correction candidate is the name of that class, then skip
4053 // it as it is unlikely a qualified version of the class' constructor
4054 // is an appropriate correction.
4055 if (CXXRecordDecl *NSDecl = NSType ? NSType->getAsCXXRecordDecl() :
4057 if (NSDecl->getIdentifier() == QR.getCorrectionAsIdentifierInfo())
4061 TypoCorrection TC(QR);
4062 TC.ClearCorrectionDecls();
4063 TC.setCorrectionSpecifier(NSI.NameSpecifier);
4064 TC.setQualifierDistance(NSI.EditDistance);
4065 TC.setCallbackDistance(0); // Reset the callback distance
4067 // If the current correction candidate and namespace combination are
4068 // too far away from the original typo based on the normalized edit
4069 // distance, then skip performing a qualified name lookup.
4070 unsigned TmpED = TC.getEditDistance(true);
4071 if (QR.getCorrectionAsIdentifierInfo() != Typo && TmpED &&
4072 TypoLen / TmpED < 3)
4076 Result.setLookupName(QR.getCorrectionAsIdentifierInfo());
4077 if (!SemaRef.LookupQualifiedName(Result, Ctx))
4080 // Any corrections added below will be validated in subsequent
4081 // iterations of the main while() loop over the Consumer's contents.
4082 switch (Result.getResultKind()) {
4083 case LookupResult::Found:
4084 case LookupResult::FoundOverloaded: {
4085 if (SS && SS->isValid()) {
4086 std::string NewQualified = TC.getAsString(SemaRef.getLangOpts());
4087 std::string OldQualified;
4088 llvm::raw_string_ostream OldOStream(OldQualified);
4089 SS->getScopeRep()->print(OldOStream, SemaRef.getPrintingPolicy());
4090 OldOStream << Typo->getName();
4091 // If correction candidate would be an identical written qualified
4092 // identifer, then the existing CXXScopeSpec probably included a
4093 // typedef that didn't get accounted for properly.
4094 if (OldOStream.str() == NewQualified)
4097 for (LookupResult::iterator TRD = Result.begin(), TRDEnd = Result.end();
4098 TRD != TRDEnd; ++TRD) {
4099 if (SemaRef.CheckMemberAccess(TC.getCorrectionRange().getBegin(),
4100 NSType ? NSType->getAsCXXRecordDecl()
4102 TRD.getPair()) == Sema::AR_accessible)
4103 TC.addCorrectionDecl(*TRD);
4105 if (TC.isResolved()) {
4106 TC.setCorrectionRange(SS.get(), Result.getLookupNameInfo());
4111 case LookupResult::NotFound:
4112 case LookupResult::NotFoundInCurrentInstantiation:
4113 case LookupResult::Ambiguous:
4114 case LookupResult::FoundUnresolvedValue:
4119 QualifiedResults.clear();
4122 TypoCorrectionConsumer::NamespaceSpecifierSet::NamespaceSpecifierSet(
4123 ASTContext &Context, DeclContext *CurContext, CXXScopeSpec *CurScopeSpec)
4124 : Context(Context), CurContextChain(buildContextChain(CurContext)) {
4125 if (NestedNameSpecifier *NNS =
4126 CurScopeSpec ? CurScopeSpec->getScopeRep() : nullptr) {
4127 llvm::raw_string_ostream SpecifierOStream(CurNameSpecifier);
4128 NNS->print(SpecifierOStream, Context.getPrintingPolicy());
4130 getNestedNameSpecifierIdentifiers(NNS, CurNameSpecifierIdentifiers);
4132 // Build the list of identifiers that would be used for an absolute
4133 // (from the global context) NestedNameSpecifier referring to the current
4135 for (DeclContext *C : llvm::reverse(CurContextChain)) {
4136 if (auto *ND = dyn_cast_or_null<NamespaceDecl>(C))
4137 CurContextIdentifiers.push_back(ND->getIdentifier());
4140 // Add the global context as a NestedNameSpecifier
4141 SpecifierInfo SI = {cast<DeclContext>(Context.getTranslationUnitDecl()),
4142 NestedNameSpecifier::GlobalSpecifier(Context), 1};
4143 DistanceMap[1].push_back(SI);
4146 auto TypoCorrectionConsumer::NamespaceSpecifierSet::buildContextChain(
4147 DeclContext *Start) -> DeclContextList {
4148 assert(Start && "Building a context chain from a null context");
4149 DeclContextList Chain;
4150 for (DeclContext *DC = Start->getPrimaryContext(); DC != nullptr;
4151 DC = DC->getLookupParent()) {
4152 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(DC);
4153 if (!DC->isInlineNamespace() && !DC->isTransparentContext() &&
4154 !(ND && ND->isAnonymousNamespace()))
4155 Chain.push_back(DC->getPrimaryContext());
4161 TypoCorrectionConsumer::NamespaceSpecifierSet::buildNestedNameSpecifier(
4162 DeclContextList &DeclChain, NestedNameSpecifier *&NNS) {
4163 unsigned NumSpecifiers = 0;
4164 for (DeclContext *C : llvm::reverse(DeclChain)) {
4165 if (auto *ND = dyn_cast_or_null<NamespaceDecl>(C)) {
4166 NNS = NestedNameSpecifier::Create(Context, NNS, ND);
4168 } else if (auto *RD = dyn_cast_or_null<RecordDecl>(C)) {
4169 NNS = NestedNameSpecifier::Create(Context, NNS, RD->isTemplateDecl(),
4170 RD->getTypeForDecl());
4174 return NumSpecifiers;
4177 void TypoCorrectionConsumer::NamespaceSpecifierSet::addNameSpecifier(
4179 NestedNameSpecifier *NNS = nullptr;
4180 unsigned NumSpecifiers = 0;
4181 DeclContextList NamespaceDeclChain(buildContextChain(Ctx));
4182 DeclContextList FullNamespaceDeclChain(NamespaceDeclChain);
4184 // Eliminate common elements from the two DeclContext chains.
4185 for (DeclContext *C : llvm::reverse(CurContextChain)) {
4186 if (NamespaceDeclChain.empty() || NamespaceDeclChain.back() != C)
4188 NamespaceDeclChain.pop_back();
4191 // Build the NestedNameSpecifier from what is left of the NamespaceDeclChain
4192 NumSpecifiers = buildNestedNameSpecifier(NamespaceDeclChain, NNS);
4194 // Add an explicit leading '::' specifier if needed.
4195 if (NamespaceDeclChain.empty()) {
4196 // Rebuild the NestedNameSpecifier as a globally-qualified specifier.
4197 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
4199 buildNestedNameSpecifier(FullNamespaceDeclChain, NNS);
4200 } else if (NamedDecl *ND =
4201 dyn_cast_or_null<NamedDecl>(NamespaceDeclChain.back())) {
4202 IdentifierInfo *Name = ND->getIdentifier();
4203 bool SameNameSpecifier = false;
4204 if (std::find(CurNameSpecifierIdentifiers.begin(),
4205 CurNameSpecifierIdentifiers.end(),
4206 Name) != CurNameSpecifierIdentifiers.end()) {
4207 std::string NewNameSpecifier;
4208 llvm::raw_string_ostream SpecifierOStream(NewNameSpecifier);
4209 SmallVector<const IdentifierInfo *, 4> NewNameSpecifierIdentifiers;
4210 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
4211 NNS->print(SpecifierOStream, Context.getPrintingPolicy());
4212 SpecifierOStream.flush();
4213 SameNameSpecifier = NewNameSpecifier == CurNameSpecifier;
4215 if (SameNameSpecifier ||
4216 std::find(CurContextIdentifiers.begin(), CurContextIdentifiers.end(),
4217 Name) != CurContextIdentifiers.end()) {
4218 // Rebuild the NestedNameSpecifier as a globally-qualified specifier.
4219 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
4221 buildNestedNameSpecifier(FullNamespaceDeclChain, NNS);
4225 // If the built NestedNameSpecifier would be replacing an existing
4226 // NestedNameSpecifier, use the number of component identifiers that
4227 // would need to be changed as the edit distance instead of the number
4228 // of components in the built NestedNameSpecifier.
4229 if (NNS && !CurNameSpecifierIdentifiers.empty()) {
4230 SmallVector<const IdentifierInfo*, 4> NewNameSpecifierIdentifiers;
4231 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
4232 NumSpecifiers = llvm::ComputeEditDistance(
4233 llvm::makeArrayRef(CurNameSpecifierIdentifiers),
4234 llvm::makeArrayRef(NewNameSpecifierIdentifiers));
4237 SpecifierInfo SI = {Ctx, NNS, NumSpecifiers};
4238 DistanceMap[NumSpecifiers].push_back(SI);
4241 /// \brief Perform name lookup for a possible result for typo correction.
4242 static void LookupPotentialTypoResult(Sema &SemaRef,
4244 IdentifierInfo *Name,
4245 Scope *S, CXXScopeSpec *SS,
4246 DeclContext *MemberContext,
4247 bool EnteringContext,
4248 bool isObjCIvarLookup,
4250 Res.suppressDiagnostics();
4252 Res.setLookupName(Name);
4253 Res.setAllowHidden(FindHidden);
4254 if (MemberContext) {
4255 if (ObjCInterfaceDecl *Class = dyn_cast<ObjCInterfaceDecl>(MemberContext)) {
4256 if (isObjCIvarLookup) {
4257 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(Name)) {
4264 if (ObjCPropertyDecl *Prop = Class->FindPropertyDeclaration(
4265 Name, ObjCPropertyQueryKind::OBJC_PR_query_instance)) {
4272 SemaRef.LookupQualifiedName(Res, MemberContext);
4276 SemaRef.LookupParsedName(Res, S, SS, /*AllowBuiltinCreation=*/false,
4279 // Fake ivar lookup; this should really be part of
4280 // LookupParsedName.
4281 if (ObjCMethodDecl *Method = SemaRef.getCurMethodDecl()) {
4282 if (Method->isInstanceMethod() && Method->getClassInterface() &&
4284 (Res.isSingleResult() &&
4285 Res.getFoundDecl()->isDefinedOutsideFunctionOrMethod()))) {
4286 if (ObjCIvarDecl *IV
4287 = Method->getClassInterface()->lookupInstanceVariable(Name)) {
4295 /// \brief Add keywords to the consumer as possible typo corrections.
4296 static void AddKeywordsToConsumer(Sema &SemaRef,
4297 TypoCorrectionConsumer &Consumer,
4298 Scope *S, CorrectionCandidateCallback &CCC,
4299 bool AfterNestedNameSpecifier) {
4300 if (AfterNestedNameSpecifier) {
4301 // For 'X::', we know exactly which keywords can appear next.
4302 Consumer.addKeywordResult("template");
4303 if (CCC.WantExpressionKeywords)
4304 Consumer.addKeywordResult("operator");
4308 if (CCC.WantObjCSuper)
4309 Consumer.addKeywordResult("super");
4311 if (CCC.WantTypeSpecifiers) {
4312 // Add type-specifier keywords to the set of results.
4313 static const char *const CTypeSpecs[] = {
4314 "char", "const", "double", "enum", "float", "int", "long", "short",
4315 "signed", "struct", "union", "unsigned", "void", "volatile",
4316 "_Complex", "_Imaginary",
4317 // storage-specifiers as well
4318 "extern", "inline", "static", "typedef"
4321 const unsigned NumCTypeSpecs = llvm::array_lengthof(CTypeSpecs);
4322 for (unsigned I = 0; I != NumCTypeSpecs; ++I)
4323 Consumer.addKeywordResult(CTypeSpecs[I]);
4325 if (SemaRef.getLangOpts().C99)
4326 Consumer.addKeywordResult("restrict");
4327 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus)
4328 Consumer.addKeywordResult("bool");
4329 else if (SemaRef.getLangOpts().C99)
4330 Consumer.addKeywordResult("_Bool");
4332 if (SemaRef.getLangOpts().CPlusPlus) {
4333 Consumer.addKeywordResult("class");
4334 Consumer.addKeywordResult("typename");
4335 Consumer.addKeywordResult("wchar_t");
4337 if (SemaRef.getLangOpts().CPlusPlus11) {
4338 Consumer.addKeywordResult("char16_t");
4339 Consumer.addKeywordResult("char32_t");
4340 Consumer.addKeywordResult("constexpr");
4341 Consumer.addKeywordResult("decltype");
4342 Consumer.addKeywordResult("thread_local");
4346 if (SemaRef.getLangOpts().GNUMode)
4347 Consumer.addKeywordResult("typeof");
4348 } else if (CCC.WantFunctionLikeCasts) {
4349 static const char *const CastableTypeSpecs[] = {
4350 "char", "double", "float", "int", "long", "short",
4351 "signed", "unsigned", "void"
4353 for (auto *kw : CastableTypeSpecs)
4354 Consumer.addKeywordResult(kw);
4357 if (CCC.WantCXXNamedCasts && SemaRef.getLangOpts().CPlusPlus) {
4358 Consumer.addKeywordResult("const_cast");
4359 Consumer.addKeywordResult("dynamic_cast");
4360 Consumer.addKeywordResult("reinterpret_cast");
4361 Consumer.addKeywordResult("static_cast");
4364 if (CCC.WantExpressionKeywords) {
4365 Consumer.addKeywordResult("sizeof");
4366 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus) {
4367 Consumer.addKeywordResult("false");
4368 Consumer.addKeywordResult("true");
4371 if (SemaRef.getLangOpts().CPlusPlus) {
4372 static const char *const CXXExprs[] = {
4373 "delete", "new", "operator", "throw", "typeid"
4375 const unsigned NumCXXExprs = llvm::array_lengthof(CXXExprs);
4376 for (unsigned I = 0; I != NumCXXExprs; ++I)
4377 Consumer.addKeywordResult(CXXExprs[I]);
4379 if (isa<CXXMethodDecl>(SemaRef.CurContext) &&
4380 cast<CXXMethodDecl>(SemaRef.CurContext)->isInstance())
4381 Consumer.addKeywordResult("this");
4383 if (SemaRef.getLangOpts().CPlusPlus11) {
4384 Consumer.addKeywordResult("alignof");
4385 Consumer.addKeywordResult("nullptr");
4389 if (SemaRef.getLangOpts().C11) {
4390 // FIXME: We should not suggest _Alignof if the alignof macro
4392 Consumer.addKeywordResult("_Alignof");
4396 if (CCC.WantRemainingKeywords) {
4397 if (SemaRef.getCurFunctionOrMethodDecl() || SemaRef.getCurBlock()) {
4399 static const char *const CStmts[] = {
4400 "do", "else", "for", "goto", "if", "return", "switch", "while" };
4401 const unsigned NumCStmts = llvm::array_lengthof(CStmts);
4402 for (unsigned I = 0; I != NumCStmts; ++I)
4403 Consumer.addKeywordResult(CStmts[I]);
4405 if (SemaRef.getLangOpts().CPlusPlus) {
4406 Consumer.addKeywordResult("catch");
4407 Consumer.addKeywordResult("try");
4410 if (S && S->getBreakParent())
4411 Consumer.addKeywordResult("break");
4413 if (S && S->getContinueParent())
4414 Consumer.addKeywordResult("continue");
4416 if (!SemaRef.getCurFunction()->SwitchStack.empty()) {
4417 Consumer.addKeywordResult("case");
4418 Consumer.addKeywordResult("default");
4421 if (SemaRef.getLangOpts().CPlusPlus) {
4422 Consumer.addKeywordResult("namespace");
4423 Consumer.addKeywordResult("template");
4426 if (S && S->isClassScope()) {
4427 Consumer.addKeywordResult("explicit");
4428 Consumer.addKeywordResult("friend");
4429 Consumer.addKeywordResult("mutable");
4430 Consumer.addKeywordResult("private");
4431 Consumer.addKeywordResult("protected");
4432 Consumer.addKeywordResult("public");
4433 Consumer.addKeywordResult("virtual");
4437 if (SemaRef.getLangOpts().CPlusPlus) {
4438 Consumer.addKeywordResult("using");
4440 if (SemaRef.getLangOpts().CPlusPlus11)
4441 Consumer.addKeywordResult("static_assert");
4446 std::unique_ptr<TypoCorrectionConsumer> Sema::makeTypoCorrectionConsumer(
4447 const DeclarationNameInfo &TypoName, Sema::LookupNameKind LookupKind,
4448 Scope *S, CXXScopeSpec *SS,
4449 std::unique_ptr<CorrectionCandidateCallback> CCC,
4450 DeclContext *MemberContext, bool EnteringContext,
4451 const ObjCObjectPointerType *OPT, bool ErrorRecovery) {
4453 if (Diags.hasFatalErrorOccurred() || !getLangOpts().SpellChecking ||
4454 DisableTypoCorrection)
4457 // In Microsoft mode, don't perform typo correction in a template member
4458 // function dependent context because it interferes with the "lookup into
4459 // dependent bases of class templates" feature.
4460 if (getLangOpts().MSVCCompat && CurContext->isDependentContext() &&
4461 isa<CXXMethodDecl>(CurContext))
4464 // We only attempt to correct typos for identifiers.
4465 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4469 // If the scope specifier itself was invalid, don't try to correct
4471 if (SS && SS->isInvalid())
4474 // Never try to correct typos during any kind of code synthesis.
4475 if (!CodeSynthesisContexts.empty())
4478 // Don't try to correct 'super'.
4479 if (S && S->isInObjcMethodScope() && Typo == getSuperIdentifier())
4482 // Abort if typo correction already failed for this specific typo.
4483 IdentifierSourceLocations::iterator locs = TypoCorrectionFailures.find(Typo);
4484 if (locs != TypoCorrectionFailures.end() &&
4485 locs->second.count(TypoName.getLoc()))
4488 // Don't try to correct the identifier "vector" when in AltiVec mode.
4489 // TODO: Figure out why typo correction misbehaves in this case, fix it, and
4490 // remove this workaround.
4491 if ((getLangOpts().AltiVec || getLangOpts().ZVector) && Typo->isStr("vector"))
4494 // Provide a stop gap for files that are just seriously broken. Trying
4495 // to correct all typos can turn into a HUGE performance penalty, causing
4496 // some files to take minutes to get rejected by the parser.
4497 unsigned Limit = getDiagnostics().getDiagnosticOptions().SpellCheckingLimit;
4498 if (Limit && TyposCorrected >= Limit)
4502 // If we're handling a missing symbol error, using modules, and the
4503 // special search all modules option is used, look for a missing import.
4504 if (ErrorRecovery && getLangOpts().Modules &&
4505 getLangOpts().ModulesSearchAll) {
4506 // The following has the side effect of loading the missing module.
4507 getModuleLoader().lookupMissingImports(Typo->getName(),
4508 TypoName.getLocStart());
4511 CorrectionCandidateCallback &CCCRef = *CCC;
4512 auto Consumer = llvm::make_unique<TypoCorrectionConsumer>(
4513 *this, TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4516 // Perform name lookup to find visible, similarly-named entities.
4517 bool IsUnqualifiedLookup = false;
4518 DeclContext *QualifiedDC = MemberContext;
4519 if (MemberContext) {
4520 LookupVisibleDecls(MemberContext, LookupKind, *Consumer);
4522 // Look in qualified interfaces.
4524 for (auto *I : OPT->quals())
4525 LookupVisibleDecls(I, LookupKind, *Consumer);
4527 } else if (SS && SS->isSet()) {
4528 QualifiedDC = computeDeclContext(*SS, EnteringContext);
4532 LookupVisibleDecls(QualifiedDC, LookupKind, *Consumer);
4534 IsUnqualifiedLookup = true;
4537 // Determine whether we are going to search in the various namespaces for
4539 bool SearchNamespaces
4540 = getLangOpts().CPlusPlus &&
4541 (IsUnqualifiedLookup || (SS && SS->isSet()));
4543 if (IsUnqualifiedLookup || SearchNamespaces) {
4544 // For unqualified lookup, look through all of the names that we have
4545 // seen in this translation unit.
4546 // FIXME: Re-add the ability to skip very unlikely potential corrections.
4547 for (const auto &I : Context.Idents)
4548 Consumer->FoundName(I.getKey());
4550 // Walk through identifiers in external identifier sources.
4551 // FIXME: Re-add the ability to skip very unlikely potential corrections.
4552 if (IdentifierInfoLookup *External
4553 = Context.Idents.getExternalIdentifierLookup()) {
4554 std::unique_ptr<IdentifierIterator> Iter(External->getIdentifiers());
4556 StringRef Name = Iter->Next();
4560 Consumer->FoundName(Name);
4565 AddKeywordsToConsumer(*this, *Consumer, S, CCCRef, SS && SS->isNotEmpty());
4567 // Build the NestedNameSpecifiers for the KnownNamespaces, if we're going
4568 // to search those namespaces.
4569 if (SearchNamespaces) {
4570 // Load any externally-known namespaces.
4571 if (ExternalSource && !LoadedExternalKnownNamespaces) {
4572 SmallVector<NamespaceDecl *, 4> ExternalKnownNamespaces;
4573 LoadedExternalKnownNamespaces = true;
4574 ExternalSource->ReadKnownNamespaces(ExternalKnownNamespaces);
4575 for (auto *N : ExternalKnownNamespaces)
4576 KnownNamespaces[N] = true;
4579 Consumer->addNamespaces(KnownNamespaces);
4585 /// \brief Try to "correct" a typo in the source code by finding
4586 /// visible declarations whose names are similar to the name that was
4587 /// present in the source code.
4589 /// \param TypoName the \c DeclarationNameInfo structure that contains
4590 /// the name that was present in the source code along with its location.
4592 /// \param LookupKind the name-lookup criteria used to search for the name.
4594 /// \param S the scope in which name lookup occurs.
4596 /// \param SS the nested-name-specifier that precedes the name we're
4597 /// looking for, if present.
4599 /// \param CCC A CorrectionCandidateCallback object that provides further
4600 /// validation of typo correction candidates. It also provides flags for
4601 /// determining the set of keywords permitted.
4603 /// \param MemberContext if non-NULL, the context in which to look for
4604 /// a member access expression.
4606 /// \param EnteringContext whether we're entering the context described by
4607 /// the nested-name-specifier SS.
4609 /// \param OPT when non-NULL, the search for visible declarations will
4610 /// also walk the protocols in the qualified interfaces of \p OPT.
4612 /// \returns a \c TypoCorrection containing the corrected name if the typo
4613 /// along with information such as the \c NamedDecl where the corrected name
4614 /// was declared, and any additional \c NestedNameSpecifier needed to access
4615 /// it (C++ only). The \c TypoCorrection is empty if there is no correction.
4616 TypoCorrection Sema::CorrectTypo(const DeclarationNameInfo &TypoName,
4617 Sema::LookupNameKind LookupKind,
4618 Scope *S, CXXScopeSpec *SS,
4619 std::unique_ptr<CorrectionCandidateCallback> CCC,
4620 CorrectTypoKind Mode,
4621 DeclContext *MemberContext,
4622 bool EnteringContext,
4623 const ObjCObjectPointerType *OPT,
4624 bool RecordFailure) {
4625 assert(CCC && "CorrectTypo requires a CorrectionCandidateCallback");
4627 // Always let the ExternalSource have the first chance at correction, even
4628 // if we would otherwise have given up.
4629 if (ExternalSource) {
4630 if (TypoCorrection Correction = ExternalSource->CorrectTypo(
4631 TypoName, LookupKind, S, SS, *CCC, MemberContext, EnteringContext, OPT))
4635 // Ugly hack equivalent to CTC == CTC_ObjCMessageReceiver;
4636 // WantObjCSuper is only true for CTC_ObjCMessageReceiver and for
4637 // some instances of CTC_Unknown, while WantRemainingKeywords is true
4638 // for CTC_Unknown but not for CTC_ObjCMessageReceiver.
4639 bool ObjCMessageReceiver = CCC->WantObjCSuper && !CCC->WantRemainingKeywords;
4641 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4642 auto Consumer = makeTypoCorrectionConsumer(
4643 TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4644 EnteringContext, OPT, Mode == CTK_ErrorRecovery);
4647 return TypoCorrection();
4649 // If we haven't found anything, we're done.
4650 if (Consumer->empty())
4651 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4653 // Make sure the best edit distance (prior to adding any namespace qualifiers)
4654 // is not more that about a third of the length of the typo's identifier.
4655 unsigned ED = Consumer->getBestEditDistance(true);
4656 unsigned TypoLen = Typo->getName().size();
4657 if (ED > 0 && TypoLen / ED < 3)
4658 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4660 TypoCorrection BestTC = Consumer->getNextCorrection();
4661 TypoCorrection SecondBestTC = Consumer->getNextCorrection();
4663 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4665 ED = BestTC.getEditDistance();
4667 if (TypoLen >= 3 && ED > 0 && TypoLen / ED < 3) {
4668 // If this was an unqualified lookup and we believe the callback
4669 // object wouldn't have filtered out possible corrections, note
4670 // that no correction was found.
4671 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4674 // If only a single name remains, return that result.
4675 if (!SecondBestTC ||
4676 SecondBestTC.getEditDistance(false) > BestTC.getEditDistance(false)) {
4677 const TypoCorrection &Result = BestTC;
4679 // Don't correct to a keyword that's the same as the typo; the keyword
4680 // wasn't actually in scope.
4681 if (ED == 0 && Result.isKeyword())
4682 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4684 TypoCorrection TC = Result;
4685 TC.setCorrectionRange(SS, TypoName);
4686 checkCorrectionVisibility(*this, TC);
4688 } else if (SecondBestTC && ObjCMessageReceiver) {
4689 // Prefer 'super' when we're completing in a message-receiver
4692 if (BestTC.getCorrection().getAsString() != "super") {
4693 if (SecondBestTC.getCorrection().getAsString() == "super")
4694 BestTC = SecondBestTC;
4695 else if ((*Consumer)["super"].front().isKeyword())
4696 BestTC = (*Consumer)["super"].front();
4698 // Don't correct to a keyword that's the same as the typo; the keyword
4699 // wasn't actually in scope.
4700 if (BestTC.getEditDistance() == 0 ||
4701 BestTC.getCorrection().getAsString() != "super")
4702 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4704 BestTC.setCorrectionRange(SS, TypoName);
4708 // Record the failure's location if needed and return an empty correction. If
4709 // this was an unqualified lookup and we believe the callback object did not
4710 // filter out possible corrections, also cache the failure for the typo.
4711 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure && !SecondBestTC);
4714 /// \brief Try to "correct" a typo in the source code by finding
4715 /// visible declarations whose names are similar to the name that was
4716 /// present in the source code.
4718 /// \param TypoName the \c DeclarationNameInfo structure that contains
4719 /// the name that was present in the source code along with its location.
4721 /// \param LookupKind the name-lookup criteria used to search for the name.
4723 /// \param S the scope in which name lookup occurs.
4725 /// \param SS the nested-name-specifier that precedes the name we're
4726 /// looking for, if present.
4728 /// \param CCC A CorrectionCandidateCallback object that provides further
4729 /// validation of typo correction candidates. It also provides flags for
4730 /// determining the set of keywords permitted.
4732 /// \param TDG A TypoDiagnosticGenerator functor that will be used to print
4733 /// diagnostics when the actual typo correction is attempted.
4735 /// \param TRC A TypoRecoveryCallback functor that will be used to build an
4736 /// Expr from a typo correction candidate.
4738 /// \param MemberContext if non-NULL, the context in which to look for
4739 /// a member access expression.
4741 /// \param EnteringContext whether we're entering the context described by
4742 /// the nested-name-specifier SS.
4744 /// \param OPT when non-NULL, the search for visible declarations will
4745 /// also walk the protocols in the qualified interfaces of \p OPT.
4747 /// \returns a new \c TypoExpr that will later be replaced in the AST with an
4748 /// Expr representing the result of performing typo correction, or nullptr if
4749 /// typo correction is not possible. If nullptr is returned, no diagnostics will
4750 /// be emitted and it is the responsibility of the caller to emit any that are
4752 TypoExpr *Sema::CorrectTypoDelayed(
4753 const DeclarationNameInfo &TypoName, Sema::LookupNameKind LookupKind,
4754 Scope *S, CXXScopeSpec *SS,
4755 std::unique_ptr<CorrectionCandidateCallback> CCC,
4756 TypoDiagnosticGenerator TDG, TypoRecoveryCallback TRC, CorrectTypoKind Mode,
4757 DeclContext *MemberContext, bool EnteringContext,
4758 const ObjCObjectPointerType *OPT) {
4759 assert(CCC && "CorrectTypoDelayed requires a CorrectionCandidateCallback");
4761 auto Consumer = makeTypoCorrectionConsumer(
4762 TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4763 EnteringContext, OPT, Mode == CTK_ErrorRecovery);
4765 // Give the external sema source a chance to correct the typo.
4766 TypoCorrection ExternalTypo;
4767 if (ExternalSource && Consumer) {
4768 ExternalTypo = ExternalSource->CorrectTypo(
4769 TypoName, LookupKind, S, SS, *Consumer->getCorrectionValidator(),
4770 MemberContext, EnteringContext, OPT);
4772 Consumer->addCorrection(ExternalTypo);
4775 if (!Consumer || Consumer->empty())
4778 // Make sure the best edit distance (prior to adding any namespace qualifiers)
4779 // is not more that about a third of the length of the typo's identifier.
4780 unsigned ED = Consumer->getBestEditDistance(true);
4781 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4782 if (!ExternalTypo && ED > 0 && Typo->getName().size() / ED < 3)
4785 ExprEvalContexts.back().NumTypos++;
4786 return createDelayedTypo(std::move(Consumer), std::move(TDG), std::move(TRC));
4789 void TypoCorrection::addCorrectionDecl(NamedDecl *CDecl) {
4793 CorrectionDecls.clear();
4795 CorrectionDecls.push_back(CDecl);
4797 if (!CorrectionName)
4798 CorrectionName = CDecl->getDeclName();
4801 std::string TypoCorrection::getAsString(const LangOptions &LO) const {
4802 if (CorrectionNameSpec) {
4803 std::string tmpBuffer;
4804 llvm::raw_string_ostream PrefixOStream(tmpBuffer);
4805 CorrectionNameSpec->print(PrefixOStream, PrintingPolicy(LO));
4806 PrefixOStream << CorrectionName;
4807 return PrefixOStream.str();
4810 return CorrectionName.getAsString();
4813 bool CorrectionCandidateCallback::ValidateCandidate(
4814 const TypoCorrection &candidate) {
4815 if (!candidate.isResolved())
4818 if (candidate.isKeyword())
4819 return WantTypeSpecifiers || WantExpressionKeywords || WantCXXNamedCasts ||
4820 WantRemainingKeywords || WantObjCSuper;
4822 bool HasNonType = false;
4823 bool HasStaticMethod = false;
4824 bool HasNonStaticMethod = false;
4825 for (Decl *D : candidate) {
4826 if (FunctionTemplateDecl *FTD = dyn_cast<FunctionTemplateDecl>(D))
4827 D = FTD->getTemplatedDecl();
4828 if (CXXMethodDecl *Method = dyn_cast<CXXMethodDecl>(D)) {
4829 if (Method->isStatic())
4830 HasStaticMethod = true;
4832 HasNonStaticMethod = true;
4834 if (!isa<TypeDecl>(D))
4838 if (IsAddressOfOperand && HasNonStaticMethod && !HasStaticMethod &&
4839 !candidate.getCorrectionSpecifier())
4842 return WantTypeSpecifiers || HasNonType;
4845 FunctionCallFilterCCC::FunctionCallFilterCCC(Sema &SemaRef, unsigned NumArgs,
4846 bool HasExplicitTemplateArgs,
4848 : NumArgs(NumArgs), HasExplicitTemplateArgs(HasExplicitTemplateArgs),
4849 CurContext(SemaRef.CurContext), MemberFn(ME) {
4850 WantTypeSpecifiers = false;
4851 WantFunctionLikeCasts = SemaRef.getLangOpts().CPlusPlus && NumArgs == 1;
4852 WantRemainingKeywords = false;
4855 bool FunctionCallFilterCCC::ValidateCandidate(const TypoCorrection &candidate) {
4856 if (!candidate.getCorrectionDecl())
4857 return candidate.isKeyword();
4859 for (auto *C : candidate) {
4860 FunctionDecl *FD = nullptr;
4861 NamedDecl *ND = C->getUnderlyingDecl();
4862 if (FunctionTemplateDecl *FTD = dyn_cast<FunctionTemplateDecl>(ND))
4863 FD = FTD->getTemplatedDecl();
4864 if (!HasExplicitTemplateArgs && !FD) {
4865 if (!(FD = dyn_cast<FunctionDecl>(ND)) && isa<ValueDecl>(ND)) {
4866 // If the Decl is neither a function nor a template function,
4867 // determine if it is a pointer or reference to a function. If so,
4868 // check against the number of arguments expected for the pointee.
4869 QualType ValType = cast<ValueDecl>(ND)->getType();
4870 if (ValType->isAnyPointerType() || ValType->isReferenceType())
4871 ValType = ValType->getPointeeType();
4872 if (const FunctionProtoType *FPT = ValType->getAs<FunctionProtoType>())
4873 if (FPT->getNumParams() == NumArgs)
4878 // Skip the current candidate if it is not a FunctionDecl or does not accept
4879 // the current number of arguments.
4880 if (!FD || !(FD->getNumParams() >= NumArgs &&
4881 FD->getMinRequiredArguments() <= NumArgs))
4884 // If the current candidate is a non-static C++ method, skip the candidate
4885 // unless the method being corrected--or the current DeclContext, if the
4886 // function being corrected is not a method--is a method in the same class
4887 // or a descendent class of the candidate's parent class.
4888 if (CXXMethodDecl *MD = dyn_cast<CXXMethodDecl>(FD)) {
4889 if (MemberFn || !MD->isStatic()) {
4890 CXXMethodDecl *CurMD =
4892 ? dyn_cast_or_null<CXXMethodDecl>(MemberFn->getMemberDecl())
4893 : dyn_cast_or_null<CXXMethodDecl>(CurContext);
4894 CXXRecordDecl *CurRD =
4895 CurMD ? CurMD->getParent()->getCanonicalDecl() : nullptr;
4896 CXXRecordDecl *RD = MD->getParent()->getCanonicalDecl();
4897 if (!CurRD || (CurRD != RD && !CurRD->isDerivedFrom(RD)))
4906 void Sema::diagnoseTypo(const TypoCorrection &Correction,
4907 const PartialDiagnostic &TypoDiag,
4908 bool ErrorRecovery) {
4909 diagnoseTypo(Correction, TypoDiag, PDiag(diag::note_previous_decl),
4913 /// Find which declaration we should import to provide the definition of
4914 /// the given declaration.
4915 static NamedDecl *getDefinitionToImport(NamedDecl *D) {
4916 if (VarDecl *VD = dyn_cast<VarDecl>(D))
4917 return VD->getDefinition();
4918 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D))
4919 return FD->getDefinition();
4920 if (TagDecl *TD = dyn_cast<TagDecl>(D))
4921 return TD->getDefinition();
4922 if (ObjCInterfaceDecl *ID = dyn_cast<ObjCInterfaceDecl>(D))
4923 return ID->getDefinition();
4924 if (ObjCProtocolDecl *PD = dyn_cast<ObjCProtocolDecl>(D))
4925 return PD->getDefinition();
4926 if (TemplateDecl *TD = dyn_cast<TemplateDecl>(D))
4927 return getDefinitionToImport(TD->getTemplatedDecl());
4931 void Sema::diagnoseMissingImport(SourceLocation Loc, NamedDecl *Decl,
4932 MissingImportKind MIK, bool Recover) {
4933 // Suggest importing a module providing the definition of this entity, if
4935 NamedDecl *Def = getDefinitionToImport(Decl);
4939 Module *Owner = getOwningModule(Decl);
4940 assert(Owner && "definition of hidden declaration is not in a module");
4942 llvm::SmallVector<Module*, 8> OwningModules;
4943 OwningModules.push_back(Owner);
4944 auto Merged = Context.getModulesWithMergedDefinition(Decl);
4945 OwningModules.insert(OwningModules.end(), Merged.begin(), Merged.end());
4947 diagnoseMissingImport(Loc, Decl, Decl->getLocation(), OwningModules, MIK,
4951 /// \brief Get a "quoted.h" or <angled.h> include path to use in a diagnostic
4952 /// suggesting the addition of a #include of the specified file.
4953 static std::string getIncludeStringForHeader(Preprocessor &PP,
4954 const FileEntry *E) {
4957 PP.getHeaderSearchInfo().suggestPathToFileForDiagnostics(E, &IsSystem);
4958 return (IsSystem ? '<' : '"') + Path + (IsSystem ? '>' : '"');
4961 void Sema::diagnoseMissingImport(SourceLocation UseLoc, NamedDecl *Decl,
4962 SourceLocation DeclLoc,
4963 ArrayRef<Module *> Modules,
4964 MissingImportKind MIK, bool Recover) {
4965 assert(!Modules.empty());
4967 // Weed out duplicates from module list.
4968 llvm::SmallVector<Module*, 8> UniqueModules;
4969 llvm::SmallDenseSet<Module*, 8> UniqueModuleSet;
4970 for (auto *M : Modules)
4971 if (UniqueModuleSet.insert(M).second)
4972 UniqueModules.push_back(M);
4973 Modules = UniqueModules;
4975 if (Modules.size() > 1) {
4976 std::string ModuleList;
4978 for (Module *M : Modules) {
4979 ModuleList += "\n ";
4980 if (++N == 5 && N != Modules.size()) {
4981 ModuleList += "[...]";
4984 ModuleList += M->getFullModuleName();
4987 Diag(UseLoc, diag::err_module_unimported_use_multiple)
4988 << (int)MIK << Decl << ModuleList;
4989 } else if (const FileEntry *E = PP.getModuleHeaderToIncludeForDiagnostics(
4990 UseLoc, Modules[0], DeclLoc)) {
4991 // The right way to make the declaration visible is to include a header;
4992 // suggest doing so.
4994 // FIXME: Find a smart place to suggest inserting a #include, and add
4995 // a FixItHint there.
4996 Diag(UseLoc, diag::err_module_unimported_use_header)
4997 << (int)MIK << Decl << Modules[0]->getFullModuleName()
4998 << getIncludeStringForHeader(PP, E);
5000 // FIXME: Add a FixItHint that imports the corresponding module.
5001 Diag(UseLoc, diag::err_module_unimported_use)
5002 << (int)MIK << Decl << Modules[0]->getFullModuleName();
5007 case MissingImportKind::Declaration:
5008 DiagID = diag::note_previous_declaration;
5010 case MissingImportKind::Definition:
5011 DiagID = diag::note_previous_definition;
5013 case MissingImportKind::DefaultArgument:
5014 DiagID = diag::note_default_argument_declared_here;
5016 case MissingImportKind::ExplicitSpecialization:
5017 DiagID = diag::note_explicit_specialization_declared_here;
5019 case MissingImportKind::PartialSpecialization:
5020 DiagID = diag::note_partial_specialization_declared_here;
5023 Diag(DeclLoc, DiagID);
5025 // Try to recover by implicitly importing this module.
5027 createImplicitModuleImportForErrorRecovery(UseLoc, Modules[0]);
5030 /// \brief Diagnose a successfully-corrected typo. Separated from the correction
5031 /// itself to allow external validation of the result, etc.
5033 /// \param Correction The result of performing typo correction.
5034 /// \param TypoDiag The diagnostic to produce. This will have the corrected
5035 /// string added to it (and usually also a fixit).
5036 /// \param PrevNote A note to use when indicating the location of the entity to
5037 /// which we are correcting. Will have the correction string added to it.
5038 /// \param ErrorRecovery If \c true (the default), the caller is going to
5039 /// recover from the typo as if the corrected string had been typed.
5040 /// In this case, \c PDiag must be an error, and we will attach a fixit
5042 void Sema::diagnoseTypo(const TypoCorrection &Correction,
5043 const PartialDiagnostic &TypoDiag,
5044 const PartialDiagnostic &PrevNote,
5045 bool ErrorRecovery) {
5046 std::string CorrectedStr = Correction.getAsString(getLangOpts());
5047 std::string CorrectedQuotedStr = Correction.getQuoted(getLangOpts());
5048 FixItHint FixTypo = FixItHint::CreateReplacement(
5049 Correction.getCorrectionRange(), CorrectedStr);
5051 // Maybe we're just missing a module import.
5052 if (Correction.requiresImport()) {
5053 NamedDecl *Decl = Correction.getFoundDecl();
5054 assert(Decl && "import required but no declaration to import");
5056 diagnoseMissingImport(Correction.getCorrectionRange().getBegin(), Decl,
5057 MissingImportKind::Declaration, ErrorRecovery);
5061 Diag(Correction.getCorrectionRange().getBegin(), TypoDiag)
5062 << CorrectedQuotedStr << (ErrorRecovery ? FixTypo : FixItHint());
5064 NamedDecl *ChosenDecl =
5065 Correction.isKeyword() ? nullptr : Correction.getFoundDecl();
5066 if (PrevNote.getDiagID() && ChosenDecl)
5067 Diag(ChosenDecl->getLocation(), PrevNote)
5068 << CorrectedQuotedStr << (ErrorRecovery ? FixItHint() : FixTypo);
5070 // Add any extra diagnostics.
5071 for (const PartialDiagnostic &PD : Correction.getExtraDiagnostics())
5072 Diag(Correction.getCorrectionRange().getBegin(), PD);
5075 TypoExpr *Sema::createDelayedTypo(std::unique_ptr<TypoCorrectionConsumer> TCC,
5076 TypoDiagnosticGenerator TDG,
5077 TypoRecoveryCallback TRC) {
5078 assert(TCC && "createDelayedTypo requires a valid TypoCorrectionConsumer");
5079 auto TE = new (Context) TypoExpr(Context.DependentTy);
5080 auto &State = DelayedTypos[TE];
5081 State.Consumer = std::move(TCC);
5082 State.DiagHandler = std::move(TDG);
5083 State.RecoveryHandler = std::move(TRC);
5087 const Sema::TypoExprState &Sema::getTypoExprState(TypoExpr *TE) const {
5088 auto Entry = DelayedTypos.find(TE);
5089 assert(Entry != DelayedTypos.end() &&
5090 "Failed to get the state for a TypoExpr!");
5091 return Entry->second;
5094 void Sema::clearDelayedTypo(TypoExpr *TE) {
5095 DelayedTypos.erase(TE);
5098 void Sema::ActOnPragmaDump(Scope *S, SourceLocation IILoc, IdentifierInfo *II) {
5099 DeclarationNameInfo Name(II, IILoc);
5100 LookupResult R(*this, Name, LookupAnyName, Sema::NotForRedeclaration);
5101 R.suppressDiagnostics();
5102 R.setHideTags(false);