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 /// \brief Find the declaration that a class temploid member specialization was
1330 /// instantiated from, or the member itself if it is an explicit specialization.
1331 static Decl *getInstantiatedFrom(Decl *D, MemberSpecializationInfo *MSInfo) {
1332 return MSInfo->isExplicitSpecialization() ? D : MSInfo->getInstantiatedFrom();
1335 Module *Sema::getOwningModule(Decl *Entity) {
1336 // If it's imported, grab its owning module.
1337 Module *M = Entity->getImportedOwningModule();
1338 if (M || !isa<NamedDecl>(Entity) || !cast<NamedDecl>(Entity)->isHidden())
1340 assert(!Entity->isFromASTFile() &&
1341 "hidden entity from AST file has no owning module");
1343 if (!getLangOpts().ModulesLocalVisibility) {
1344 // If we're not tracking visibility locally, the only way a declaration
1345 // can be hidden and local is if it's hidden because it's parent is (for
1346 // instance, maybe this is a lazily-declared special member of an imported
1348 auto *Parent = cast<NamedDecl>(Entity->getDeclContext());
1349 assert(Parent->isHidden() && "unexpectedly hidden decl");
1350 return getOwningModule(Parent);
1353 // It's local and hidden; grab or compute its owning module.
1354 M = Entity->getLocalOwningModule();
1358 if (auto *Containing =
1359 PP.getModuleContainingLocation(Entity->getLocation())) {
1361 } else if (Entity->isInvalidDecl() || Entity->getLocation().isInvalid()) {
1362 // Don't bother tracking visibility for invalid declarations with broken
1364 cast<NamedDecl>(Entity)->setHidden(false);
1366 // We need to assign a module to an entity that exists outside of any
1367 // module, so that we can hide it from modules that we textually enter.
1368 // Invent a fake module for all such entities.
1369 if (!CachedFakeTopLevelModule) {
1370 CachedFakeTopLevelModule =
1371 PP.getHeaderSearchInfo().getModuleMap().findOrCreateModule(
1372 "<top-level>", nullptr, false, false).first;
1374 auto &SrcMgr = PP.getSourceManager();
1375 SourceLocation StartLoc =
1376 SrcMgr.getLocForStartOfFile(SrcMgr.getMainFileID());
1377 auto &TopLevel = ModuleScopes.empty()
1379 : ModuleScopes[0].OuterVisibleModules;
1380 TopLevel.setVisible(CachedFakeTopLevelModule, StartLoc);
1383 M = CachedFakeTopLevelModule;
1387 Entity->setLocalOwningModule(M);
1391 void Sema::makeMergedDefinitionVisible(NamedDecl *ND, SourceLocation Loc) {
1392 if (auto *M = PP.getModuleContainingLocation(Loc))
1393 Context.mergeDefinitionIntoModule(ND, M);
1395 // We're not building a module; just make the definition visible.
1396 ND->setHidden(false);
1398 // If ND is a template declaration, make the template parameters
1399 // visible too. They're not (necessarily) within a mergeable DeclContext.
1400 if (auto *TD = dyn_cast<TemplateDecl>(ND))
1401 for (auto *Param : *TD->getTemplateParameters())
1402 makeMergedDefinitionVisible(Param, Loc);
1405 /// \brief Find the module in which the given declaration was defined.
1406 static Module *getDefiningModule(Sema &S, Decl *Entity) {
1407 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Entity)) {
1408 // If this function was instantiated from a template, the defining module is
1409 // the module containing the pattern.
1410 if (FunctionDecl *Pattern = FD->getTemplateInstantiationPattern())
1412 } else if (CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(Entity)) {
1413 if (CXXRecordDecl *Pattern = RD->getTemplateInstantiationPattern())
1415 } else if (EnumDecl *ED = dyn_cast<EnumDecl>(Entity)) {
1416 if (MemberSpecializationInfo *MSInfo = ED->getMemberSpecializationInfo())
1417 Entity = getInstantiatedFrom(ED, MSInfo);
1418 } else if (VarDecl *VD = dyn_cast<VarDecl>(Entity)) {
1419 // FIXME: Map from variable template specializations back to the template.
1420 if (MemberSpecializationInfo *MSInfo = VD->getMemberSpecializationInfo())
1421 Entity = getInstantiatedFrom(VD, MSInfo);
1424 // Walk up to the containing context. That might also have been instantiated
1426 DeclContext *Context = Entity->getDeclContext();
1427 if (Context->isFileContext())
1428 return S.getOwningModule(Entity);
1429 return getDefiningModule(S, cast<Decl>(Context));
1432 llvm::DenseSet<Module*> &Sema::getLookupModules() {
1433 unsigned N = CodeSynthesisContexts.size();
1434 for (unsigned I = CodeSynthesisContextLookupModules.size();
1436 Module *M = getDefiningModule(*this, CodeSynthesisContexts[I].Entity);
1437 if (M && !LookupModulesCache.insert(M).second)
1439 CodeSynthesisContextLookupModules.push_back(M);
1441 return LookupModulesCache;
1444 bool Sema::hasVisibleMergedDefinition(NamedDecl *Def) {
1445 for (Module *Merged : Context.getModulesWithMergedDefinition(Def))
1446 if (isModuleVisible(Merged))
1451 template<typename ParmDecl>
1453 hasVisibleDefaultArgument(Sema &S, const ParmDecl *D,
1454 llvm::SmallVectorImpl<Module *> *Modules) {
1455 if (!D->hasDefaultArgument())
1459 auto &DefaultArg = D->getDefaultArgStorage();
1460 if (!DefaultArg.isInherited() && S.isVisible(D))
1463 if (!DefaultArg.isInherited() && Modules) {
1464 auto *NonConstD = const_cast<ParmDecl*>(D);
1465 Modules->push_back(S.getOwningModule(NonConstD));
1466 const auto &Merged = S.Context.getModulesWithMergedDefinition(NonConstD);
1467 Modules->insert(Modules->end(), Merged.begin(), Merged.end());
1470 // If there was a previous default argument, maybe its parameter is visible.
1471 D = DefaultArg.getInheritedFrom();
1476 bool Sema::hasVisibleDefaultArgument(const NamedDecl *D,
1477 llvm::SmallVectorImpl<Module *> *Modules) {
1478 if (auto *P = dyn_cast<TemplateTypeParmDecl>(D))
1479 return ::hasVisibleDefaultArgument(*this, P, Modules);
1480 if (auto *P = dyn_cast<NonTypeTemplateParmDecl>(D))
1481 return ::hasVisibleDefaultArgument(*this, P, Modules);
1482 return ::hasVisibleDefaultArgument(*this, cast<TemplateTemplateParmDecl>(D),
1486 bool Sema::hasVisibleMemberSpecialization(
1487 const NamedDecl *D, llvm::SmallVectorImpl<Module *> *Modules) {
1488 assert(isa<CXXRecordDecl>(D->getDeclContext()) &&
1489 "not a member specialization");
1490 for (auto *Redecl : D->redecls()) {
1491 // If the specialization is declared at namespace scope, then it's a member
1492 // specialization declaration. If it's lexically inside the class
1493 // definition then it was instantiated.
1495 // FIXME: This is a hack. There should be a better way to determine this.
1496 // FIXME: What about MS-style explicit specializations declared within a
1497 // class definition?
1498 if (Redecl->getLexicalDeclContext()->isFileContext()) {
1499 auto *NonConstR = const_cast<NamedDecl*>(cast<NamedDecl>(Redecl));
1501 if (isVisible(NonConstR))
1505 Modules->push_back(getOwningModule(NonConstR));
1506 const auto &Merged = Context.getModulesWithMergedDefinition(NonConstR);
1507 Modules->insert(Modules->end(), Merged.begin(), Merged.end());
1515 /// \brief Determine whether a declaration is visible to name lookup.
1517 /// This routine determines whether the declaration D is visible in the current
1518 /// lookup context, taking into account the current template instantiation
1519 /// stack. During template instantiation, a declaration is visible if it is
1520 /// visible from a module containing any entity on the template instantiation
1521 /// path (by instantiating a template, you allow it to see the declarations that
1522 /// your module can see, including those later on in your module).
1523 bool LookupResult::isVisibleSlow(Sema &SemaRef, NamedDecl *D) {
1524 assert(D->isHidden() && "should not call this: not in slow case");
1525 Module *DeclModule = nullptr;
1527 if (SemaRef.getLangOpts().ModulesLocalVisibility) {
1528 DeclModule = SemaRef.getOwningModule(D);
1530 // getOwningModule() may have decided the declaration should not be hidden.
1531 assert(!D->isHidden() && "hidden decl not from a module");
1535 // If the owning module is visible, and the decl is not module private,
1536 // then the decl is visible too. (Module private is ignored within the same
1537 // top-level module.)
1538 if ((!D->isFromASTFile() || !D->isModulePrivate()) &&
1539 (SemaRef.isModuleVisible(DeclModule) ||
1540 SemaRef.hasVisibleMergedDefinition(D)))
1544 // If this declaration is not at namespace scope nor module-private,
1545 // then it is visible if its lexical parent has a visible definition.
1546 DeclContext *DC = D->getLexicalDeclContext();
1547 if (!D->isModulePrivate() && DC && !DC->isFileContext() &&
1548 !isa<LinkageSpecDecl>(DC) && !isa<ExportDecl>(DC)) {
1549 // For a parameter, check whether our current template declaration's
1550 // lexical context is visible, not whether there's some other visible
1551 // definition of it, because parameters aren't "within" the definition.
1553 // In C++ we need to check for a visible definition due to ODR merging,
1554 // and in C we must not because each declaration of a function gets its own
1555 // set of declarations for tags in prototype scope.
1556 if ((D->isTemplateParameter() || isa<ParmVarDecl>(D)
1557 || (isa<FunctionDecl>(DC) && !SemaRef.getLangOpts().CPlusPlus))
1558 ? isVisible(SemaRef, cast<NamedDecl>(DC))
1559 : SemaRef.hasVisibleDefinition(cast<NamedDecl>(DC))) {
1560 if (SemaRef.CodeSynthesisContexts.empty() &&
1561 // FIXME: Do something better in this case.
1562 !SemaRef.getLangOpts().ModulesLocalVisibility) {
1563 // Cache the fact that this declaration is implicitly visible because
1564 // its parent has a visible definition.
1565 D->setHidden(false);
1572 // Find the extra places where we need to look.
1573 llvm::DenseSet<Module*> &LookupModules = SemaRef.getLookupModules();
1574 if (LookupModules.empty())
1578 DeclModule = SemaRef.getOwningModule(D);
1579 assert(DeclModule && "hidden decl not from a module");
1582 // If our lookup set contains the decl's module, it's visible.
1583 if (LookupModules.count(DeclModule))
1586 // If the declaration isn't exported, it's not visible in any other module.
1587 if (D->isModulePrivate())
1590 // Check whether DeclModule is transitively exported to an import of
1592 return std::any_of(LookupModules.begin(), LookupModules.end(),
1593 [&](Module *M) { return M->isModuleVisible(DeclModule); });
1596 bool Sema::isVisibleSlow(const NamedDecl *D) {
1597 return LookupResult::isVisible(*this, const_cast<NamedDecl*>(D));
1600 bool Sema::shouldLinkPossiblyHiddenDecl(LookupResult &R, const NamedDecl *New) {
1605 return New->isExternallyVisible();
1608 /// \brief Retrieve the visible declaration corresponding to D, if any.
1610 /// This routine determines whether the declaration D is visible in the current
1611 /// module, with the current imports. If not, it checks whether any
1612 /// redeclaration of D is visible, and if so, returns that declaration.
1614 /// \returns D, or a visible previous declaration of D, whichever is more recent
1615 /// and visible. If no declaration of D is visible, returns null.
1616 static NamedDecl *findAcceptableDecl(Sema &SemaRef, NamedDecl *D) {
1617 assert(!LookupResult::isVisible(SemaRef, D) && "not in slow case");
1619 for (auto RD : D->redecls()) {
1620 // Don't bother with extra checks if we already know this one isn't visible.
1624 auto ND = cast<NamedDecl>(RD);
1625 // FIXME: This is wrong in the case where the previous declaration is not
1626 // visible in the same scope as D. This needs to be done much more
1628 if (LookupResult::isVisible(SemaRef, ND))
1635 bool Sema::hasVisibleDeclarationSlow(const NamedDecl *D,
1636 llvm::SmallVectorImpl<Module *> *Modules) {
1637 assert(!isVisible(D) && "not in slow case");
1639 for (auto *Redecl : D->redecls()) {
1640 auto *NonConstR = const_cast<NamedDecl*>(cast<NamedDecl>(Redecl));
1641 if (isVisible(NonConstR))
1645 Modules->push_back(getOwningModule(NonConstR));
1646 const auto &Merged = Context.getModulesWithMergedDefinition(NonConstR);
1647 Modules->insert(Modules->end(), Merged.begin(), Merged.end());
1654 NamedDecl *LookupResult::getAcceptableDeclSlow(NamedDecl *D) const {
1655 if (auto *ND = dyn_cast<NamespaceDecl>(D)) {
1656 // Namespaces are a bit of a special case: we expect there to be a lot of
1657 // redeclarations of some namespaces, all declarations of a namespace are
1658 // essentially interchangeable, all declarations are found by name lookup
1659 // if any is, and namespaces are never looked up during template
1660 // instantiation. So we benefit from caching the check in this case, and
1661 // it is correct to do so.
1662 auto *Key = ND->getCanonicalDecl();
1663 if (auto *Acceptable = getSema().VisibleNamespaceCache.lookup(Key))
1666 isVisible(getSema(), Key) ? Key : findAcceptableDecl(getSema(), Key);
1668 getSema().VisibleNamespaceCache.insert(std::make_pair(Key, Acceptable));
1672 return findAcceptableDecl(getSema(), D);
1675 /// @brief Perform unqualified name lookup starting from a given
1678 /// Unqualified name lookup (C++ [basic.lookup.unqual], C99 6.2.1) is
1679 /// used to find names within the current scope. For example, 'x' in
1683 /// return x; // unqualified name look finds 'x' in the global scope
1687 /// Different lookup criteria can find different names. For example, a
1688 /// particular scope can have both a struct and a function of the same
1689 /// name, and each can be found by certain lookup criteria. For more
1690 /// information about lookup criteria, see the documentation for the
1691 /// class LookupCriteria.
1693 /// @param S The scope from which unqualified name lookup will
1694 /// begin. If the lookup criteria permits, name lookup may also search
1695 /// in the parent scopes.
1697 /// @param [in,out] R Specifies the lookup to perform (e.g., the name to
1698 /// look up and the lookup kind), and is updated with the results of lookup
1699 /// including zero or more declarations and possibly additional information
1700 /// used to diagnose ambiguities.
1702 /// @returns \c true if lookup succeeded and false otherwise.
1703 bool Sema::LookupName(LookupResult &R, Scope *S, bool AllowBuiltinCreation) {
1704 DeclarationName Name = R.getLookupName();
1705 if (!Name) return false;
1707 LookupNameKind NameKind = R.getLookupKind();
1709 if (!getLangOpts().CPlusPlus) {
1710 // Unqualified name lookup in C/Objective-C is purely lexical, so
1711 // search in the declarations attached to the name.
1712 if (NameKind == Sema::LookupRedeclarationWithLinkage) {
1713 // Find the nearest non-transparent declaration scope.
1714 while (!(S->getFlags() & Scope::DeclScope) ||
1715 (S->getEntity() && S->getEntity()->isTransparentContext()))
1719 // When performing a scope lookup, we want to find local extern decls.
1720 FindLocalExternScope FindLocals(R);
1722 // Scan up the scope chain looking for a decl that matches this
1723 // identifier that is in the appropriate namespace. This search
1724 // should not take long, as shadowing of names is uncommon, and
1725 // deep shadowing is extremely uncommon.
1726 bool LeftStartingScope = false;
1728 for (IdentifierResolver::iterator I = IdResolver.begin(Name),
1729 IEnd = IdResolver.end();
1731 if (NamedDecl *D = R.getAcceptableDecl(*I)) {
1732 if (NameKind == LookupRedeclarationWithLinkage) {
1733 // Determine whether this (or a previous) declaration is
1735 if (!LeftStartingScope && !S->isDeclScope(*I))
1736 LeftStartingScope = true;
1738 // If we found something outside of our starting scope that
1739 // does not have linkage, skip it.
1740 if (LeftStartingScope && !((*I)->hasLinkage())) {
1745 else if (NameKind == LookupObjCImplicitSelfParam &&
1746 !isa<ImplicitParamDecl>(*I))
1751 // Check whether there are any other declarations with the same name
1752 // and in the same scope.
1754 // Find the scope in which this declaration was declared (if it
1755 // actually exists in a Scope).
1756 while (S && !S->isDeclScope(D))
1759 // If the scope containing the declaration is the translation unit,
1760 // then we'll need to perform our checks based on the matching
1761 // DeclContexts rather than matching scopes.
1762 if (S && isNamespaceOrTranslationUnitScope(S))
1765 // Compute the DeclContext, if we need it.
1766 DeclContext *DC = nullptr;
1768 DC = (*I)->getDeclContext()->getRedeclContext();
1770 IdentifierResolver::iterator LastI = I;
1771 for (++LastI; LastI != IEnd; ++LastI) {
1773 // Match based on scope.
1774 if (!S->isDeclScope(*LastI))
1777 // Match based on DeclContext.
1779 = (*LastI)->getDeclContext()->getRedeclContext();
1780 if (!LastDC->Equals(DC))
1784 // If the declaration is in the right namespace and visible, add it.
1785 if (NamedDecl *LastD = R.getAcceptableDecl(*LastI))
1795 // Perform C++ unqualified name lookup.
1796 if (CppLookupName(R, S))
1800 // If we didn't find a use of this identifier, and if the identifier
1801 // corresponds to a compiler builtin, create the decl object for the builtin
1802 // now, injecting it into translation unit scope, and return it.
1803 if (AllowBuiltinCreation && LookupBuiltin(*this, R))
1806 // If we didn't find a use of this identifier, the ExternalSource
1807 // may be able to handle the situation.
1808 // Note: some lookup failures are expected!
1809 // See e.g. R.isForRedeclaration().
1810 return (ExternalSource && ExternalSource->LookupUnqualified(R, S));
1813 /// @brief Perform qualified name lookup in the namespaces nominated by
1814 /// using directives by the given context.
1816 /// C++98 [namespace.qual]p2:
1817 /// Given X::m (where X is a user-declared namespace), or given \::m
1818 /// (where X is the global namespace), let S be the set of all
1819 /// declarations of m in X and in the transitive closure of all
1820 /// namespaces nominated by using-directives in X and its used
1821 /// namespaces, except that using-directives are ignored in any
1822 /// namespace, including X, directly containing one or more
1823 /// declarations of m. No namespace is searched more than once in
1824 /// the lookup of a name. If S is the empty set, the program is
1825 /// ill-formed. Otherwise, if S has exactly one member, or if the
1826 /// context of the reference is a using-declaration
1827 /// (namespace.udecl), S is the required set of declarations of
1828 /// m. Otherwise if the use of m is not one that allows a unique
1829 /// declaration to be chosen from S, the program is ill-formed.
1831 /// C++98 [namespace.qual]p5:
1832 /// During the lookup of a qualified namespace member name, if the
1833 /// lookup finds more than one declaration of the member, and if one
1834 /// declaration introduces a class name or enumeration name and the
1835 /// other declarations either introduce the same object, the same
1836 /// enumerator or a set of functions, the non-type name hides the
1837 /// class or enumeration name if and only if the declarations are
1838 /// from the same namespace; otherwise (the declarations are from
1839 /// different namespaces), the program is ill-formed.
1840 static bool LookupQualifiedNameInUsingDirectives(Sema &S, LookupResult &R,
1841 DeclContext *StartDC) {
1842 assert(StartDC->isFileContext() && "start context is not a file context");
1844 DeclContext::udir_range UsingDirectives = StartDC->using_directives();
1845 if (UsingDirectives.begin() == UsingDirectives.end()) return false;
1847 // We have at least added all these contexts to the queue.
1848 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1849 Visited.insert(StartDC);
1851 // We have not yet looked into these namespaces, much less added
1852 // their "using-children" to the queue.
1853 SmallVector<NamespaceDecl*, 8> Queue;
1855 // We have already looked into the initial namespace; seed the queue
1856 // with its using-children.
1857 for (auto *I : UsingDirectives) {
1858 NamespaceDecl *ND = I->getNominatedNamespace()->getOriginalNamespace();
1859 if (Visited.insert(ND).second)
1860 Queue.push_back(ND);
1863 // The easiest way to implement the restriction in [namespace.qual]p5
1864 // is to check whether any of the individual results found a tag
1865 // and, if so, to declare an ambiguity if the final result is not
1867 bool FoundTag = false;
1868 bool FoundNonTag = false;
1870 LookupResult LocalR(LookupResult::Temporary, R);
1873 while (!Queue.empty()) {
1874 NamespaceDecl *ND = Queue.pop_back_val();
1876 // We go through some convolutions here to avoid copying results
1877 // between LookupResults.
1878 bool UseLocal = !R.empty();
1879 LookupResult &DirectR = UseLocal ? LocalR : R;
1880 bool FoundDirect = LookupDirect(S, DirectR, ND);
1883 // First do any local hiding.
1884 DirectR.resolveKind();
1886 // If the local result is a tag, remember that.
1887 if (DirectR.isSingleTagDecl())
1892 // Append the local results to the total results if necessary.
1894 R.addAllDecls(LocalR);
1899 // If we find names in this namespace, ignore its using directives.
1905 for (auto I : ND->using_directives()) {
1906 NamespaceDecl *Nom = I->getNominatedNamespace();
1907 if (Visited.insert(Nom).second)
1908 Queue.push_back(Nom);
1913 if (FoundTag && FoundNonTag)
1914 R.setAmbiguousQualifiedTagHiding();
1922 /// \brief Callback that looks for any member of a class with the given name.
1923 static bool LookupAnyMember(const CXXBaseSpecifier *Specifier,
1924 CXXBasePath &Path, DeclarationName Name) {
1925 RecordDecl *BaseRecord = Specifier->getType()->getAs<RecordType>()->getDecl();
1927 Path.Decls = BaseRecord->lookup(Name);
1928 return !Path.Decls.empty();
1931 /// \brief Determine whether the given set of member declarations contains only
1932 /// static members, nested types, and enumerators.
1933 template<typename InputIterator>
1934 static bool HasOnlyStaticMembers(InputIterator First, InputIterator Last) {
1935 Decl *D = (*First)->getUnderlyingDecl();
1936 if (isa<VarDecl>(D) || isa<TypeDecl>(D) || isa<EnumConstantDecl>(D))
1939 if (isa<CXXMethodDecl>(D)) {
1940 // Determine whether all of the methods are static.
1941 bool AllMethodsAreStatic = true;
1942 for(; First != Last; ++First) {
1943 D = (*First)->getUnderlyingDecl();
1945 if (!isa<CXXMethodDecl>(D)) {
1946 assert(isa<TagDecl>(D) && "Non-function must be a tag decl");
1950 if (!cast<CXXMethodDecl>(D)->isStatic()) {
1951 AllMethodsAreStatic = false;
1956 if (AllMethodsAreStatic)
1963 /// \brief Perform qualified name lookup into a given context.
1965 /// Qualified name lookup (C++ [basic.lookup.qual]) is used to find
1966 /// names when the context of those names is explicit specified, e.g.,
1967 /// "std::vector" or "x->member", or as part of unqualified name lookup.
1969 /// Different lookup criteria can find different names. For example, a
1970 /// particular scope can have both a struct and a function of the same
1971 /// name, and each can be found by certain lookup criteria. For more
1972 /// information about lookup criteria, see the documentation for the
1973 /// class LookupCriteria.
1975 /// \param R captures both the lookup criteria and any lookup results found.
1977 /// \param LookupCtx The context in which qualified name lookup will
1978 /// search. If the lookup criteria permits, name lookup may also search
1979 /// in the parent contexts or (for C++ classes) base classes.
1981 /// \param InUnqualifiedLookup true if this is qualified name lookup that
1982 /// occurs as part of unqualified name lookup.
1984 /// \returns true if lookup succeeded, false if it failed.
1985 bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
1986 bool InUnqualifiedLookup) {
1987 assert(LookupCtx && "Sema::LookupQualifiedName requires a lookup context");
1989 if (!R.getLookupName())
1992 // Make sure that the declaration context is complete.
1993 assert((!isa<TagDecl>(LookupCtx) ||
1994 LookupCtx->isDependentContext() ||
1995 cast<TagDecl>(LookupCtx)->isCompleteDefinition() ||
1996 cast<TagDecl>(LookupCtx)->isBeingDefined()) &&
1997 "Declaration context must already be complete!");
1999 struct QualifiedLookupInScope {
2001 DeclContext *Context;
2002 // Set flag in DeclContext informing debugger that we're looking for qualified name
2003 QualifiedLookupInScope(DeclContext *ctx) : Context(ctx) {
2004 oldVal = ctx->setUseQualifiedLookup();
2006 ~QualifiedLookupInScope() {
2007 Context->setUseQualifiedLookup(oldVal);
2011 if (LookupDirect(*this, R, LookupCtx)) {
2013 if (isa<CXXRecordDecl>(LookupCtx))
2014 R.setNamingClass(cast<CXXRecordDecl>(LookupCtx));
2018 // Don't descend into implied contexts for redeclarations.
2019 // C++98 [namespace.qual]p6:
2020 // In a declaration for a namespace member in which the
2021 // declarator-id is a qualified-id, given that the qualified-id
2022 // for the namespace member has the form
2023 // nested-name-specifier unqualified-id
2024 // the unqualified-id shall name a member of the namespace
2025 // designated by the nested-name-specifier.
2026 // See also [class.mfct]p5 and [class.static.data]p2.
2027 if (R.isForRedeclaration())
2030 // If this is a namespace, look it up in the implied namespaces.
2031 if (LookupCtx->isFileContext())
2032 return LookupQualifiedNameInUsingDirectives(*this, R, LookupCtx);
2034 // If this isn't a C++ class, we aren't allowed to look into base
2035 // classes, we're done.
2036 CXXRecordDecl *LookupRec = dyn_cast<CXXRecordDecl>(LookupCtx);
2037 if (!LookupRec || !LookupRec->getDefinition())
2040 // If we're performing qualified name lookup into a dependent class,
2041 // then we are actually looking into a current instantiation. If we have any
2042 // dependent base classes, then we either have to delay lookup until
2043 // template instantiation time (at which point all bases will be available)
2044 // or we have to fail.
2045 if (!InUnqualifiedLookup && LookupRec->isDependentContext() &&
2046 LookupRec->hasAnyDependentBases()) {
2047 R.setNotFoundInCurrentInstantiation();
2051 // Perform lookup into our base classes.
2053 Paths.setOrigin(LookupRec);
2055 // Look for this member in our base classes
2056 bool (*BaseCallback)(const CXXBaseSpecifier *Specifier, CXXBasePath &Path,
2057 DeclarationName Name) = nullptr;
2058 switch (R.getLookupKind()) {
2059 case LookupObjCImplicitSelfParam:
2060 case LookupOrdinaryName:
2061 case LookupMemberName:
2062 case LookupRedeclarationWithLinkage:
2063 case LookupLocalFriendName:
2064 BaseCallback = &CXXRecordDecl::FindOrdinaryMember;
2068 BaseCallback = &CXXRecordDecl::FindTagMember;
2072 BaseCallback = &LookupAnyMember;
2075 case LookupOMPReductionName:
2076 BaseCallback = &CXXRecordDecl::FindOMPReductionMember;
2079 case LookupUsingDeclName:
2080 // This lookup is for redeclarations only.
2082 case LookupOperatorName:
2083 case LookupNamespaceName:
2084 case LookupObjCProtocolName:
2086 // These lookups will never find a member in a C++ class (or base class).
2089 case LookupNestedNameSpecifierName:
2090 BaseCallback = &CXXRecordDecl::FindNestedNameSpecifierMember;
2094 DeclarationName Name = R.getLookupName();
2095 if (!LookupRec->lookupInBases(
2096 [=](const CXXBaseSpecifier *Specifier, CXXBasePath &Path) {
2097 return BaseCallback(Specifier, Path, Name);
2102 R.setNamingClass(LookupRec);
2104 // C++ [class.member.lookup]p2:
2105 // [...] If the resulting set of declarations are not all from
2106 // sub-objects of the same type, or the set has a nonstatic member
2107 // and includes members from distinct sub-objects, there is an
2108 // ambiguity and the program is ill-formed. Otherwise that set is
2109 // the result of the lookup.
2110 QualType SubobjectType;
2111 int SubobjectNumber = 0;
2112 AccessSpecifier SubobjectAccess = AS_none;
2114 for (CXXBasePaths::paths_iterator Path = Paths.begin(), PathEnd = Paths.end();
2115 Path != PathEnd; ++Path) {
2116 const CXXBasePathElement &PathElement = Path->back();
2118 // Pick the best (i.e. most permissive i.e. numerically lowest) access
2119 // across all paths.
2120 SubobjectAccess = std::min(SubobjectAccess, Path->Access);
2122 // Determine whether we're looking at a distinct sub-object or not.
2123 if (SubobjectType.isNull()) {
2124 // This is the first subobject we've looked at. Record its type.
2125 SubobjectType = Context.getCanonicalType(PathElement.Base->getType());
2126 SubobjectNumber = PathElement.SubobjectNumber;
2131 != Context.getCanonicalType(PathElement.Base->getType())) {
2132 // We found members of the given name in two subobjects of
2133 // different types. If the declaration sets aren't the same, this
2134 // lookup is ambiguous.
2135 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end())) {
2136 CXXBasePaths::paths_iterator FirstPath = Paths.begin();
2137 DeclContext::lookup_iterator FirstD = FirstPath->Decls.begin();
2138 DeclContext::lookup_iterator CurrentD = Path->Decls.begin();
2140 while (FirstD != FirstPath->Decls.end() &&
2141 CurrentD != Path->Decls.end()) {
2142 if ((*FirstD)->getUnderlyingDecl()->getCanonicalDecl() !=
2143 (*CurrentD)->getUnderlyingDecl()->getCanonicalDecl())
2150 if (FirstD == FirstPath->Decls.end() &&
2151 CurrentD == Path->Decls.end())
2155 R.setAmbiguousBaseSubobjectTypes(Paths);
2159 if (SubobjectNumber != PathElement.SubobjectNumber) {
2160 // We have a different subobject of the same type.
2162 // C++ [class.member.lookup]p5:
2163 // A static member, a nested type or an enumerator defined in
2164 // a base class T can unambiguously be found even if an object
2165 // has more than one base class subobject of type T.
2166 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end()))
2169 // We have found a nonstatic member name in multiple, distinct
2170 // subobjects. Name lookup is ambiguous.
2171 R.setAmbiguousBaseSubobjects(Paths);
2176 // Lookup in a base class succeeded; return these results.
2178 for (auto *D : Paths.front().Decls) {
2179 AccessSpecifier AS = CXXRecordDecl::MergeAccess(SubobjectAccess,
2187 /// \brief Performs qualified name lookup or special type of lookup for
2188 /// "__super::" scope specifier.
2190 /// This routine is a convenience overload meant to be called from contexts
2191 /// that need to perform a qualified name lookup with an optional C++ scope
2192 /// specifier that might require special kind of lookup.
2194 /// \param R captures both the lookup criteria and any lookup results found.
2196 /// \param LookupCtx The context in which qualified name lookup will
2199 /// \param SS An optional C++ scope-specifier.
2201 /// \returns true if lookup succeeded, false if it failed.
2202 bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
2204 auto *NNS = SS.getScopeRep();
2205 if (NNS && NNS->getKind() == NestedNameSpecifier::Super)
2206 return LookupInSuper(R, NNS->getAsRecordDecl());
2209 return LookupQualifiedName(R, LookupCtx);
2212 /// @brief Performs name lookup for a name that was parsed in the
2213 /// source code, and may contain a C++ scope specifier.
2215 /// This routine is a convenience routine meant to be called from
2216 /// contexts that receive a name and an optional C++ scope specifier
2217 /// (e.g., "N::M::x"). It will then perform either qualified or
2218 /// unqualified name lookup (with LookupQualifiedName or LookupName,
2219 /// respectively) on the given name and return those results. It will
2220 /// perform a special type of lookup for "__super::" scope specifier.
2222 /// @param S The scope from which unqualified name lookup will
2225 /// @param SS An optional C++ scope-specifier, e.g., "::N::M".
2227 /// @param EnteringContext Indicates whether we are going to enter the
2228 /// context of the scope-specifier SS (if present).
2230 /// @returns True if any decls were found (but possibly ambiguous)
2231 bool Sema::LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
2232 bool AllowBuiltinCreation, bool EnteringContext) {
2233 if (SS && SS->isInvalid()) {
2234 // When the scope specifier is invalid, don't even look for
2239 if (SS && SS->isSet()) {
2240 NestedNameSpecifier *NNS = SS->getScopeRep();
2241 if (NNS->getKind() == NestedNameSpecifier::Super)
2242 return LookupInSuper(R, NNS->getAsRecordDecl());
2244 if (DeclContext *DC = computeDeclContext(*SS, EnteringContext)) {
2245 // We have resolved the scope specifier to a particular declaration
2246 // contex, and will perform name lookup in that context.
2247 if (!DC->isDependentContext() && RequireCompleteDeclContext(*SS, DC))
2250 R.setContextRange(SS->getRange());
2251 return LookupQualifiedName(R, DC);
2254 // We could not resolve the scope specified to a specific declaration
2255 // context, which means that SS refers to an unknown specialization.
2256 // Name lookup can't find anything in this case.
2257 R.setNotFoundInCurrentInstantiation();
2258 R.setContextRange(SS->getRange());
2262 // Perform unqualified name lookup starting in the given scope.
2263 return LookupName(R, S, AllowBuiltinCreation);
2266 /// \brief Perform qualified name lookup into all base classes of the given
2269 /// \param R captures both the lookup criteria and any lookup results found.
2271 /// \param Class The context in which qualified name lookup will
2272 /// search. Name lookup will search in all base classes merging the results.
2274 /// @returns True if any decls were found (but possibly ambiguous)
2275 bool Sema::LookupInSuper(LookupResult &R, CXXRecordDecl *Class) {
2276 // The access-control rules we use here are essentially the rules for
2277 // doing a lookup in Class that just magically skipped the direct
2278 // members of Class itself. That is, the naming class is Class, and the
2279 // access includes the access of the base.
2280 for (const auto &BaseSpec : Class->bases()) {
2281 CXXRecordDecl *RD = cast<CXXRecordDecl>(
2282 BaseSpec.getType()->castAs<RecordType>()->getDecl());
2283 LookupResult Result(*this, R.getLookupNameInfo(), R.getLookupKind());
2284 Result.setBaseObjectType(Context.getRecordType(Class));
2285 LookupQualifiedName(Result, RD);
2287 // Copy the lookup results into the target, merging the base's access into
2289 for (auto I = Result.begin(), E = Result.end(); I != E; ++I) {
2290 R.addDecl(I.getDecl(),
2291 CXXRecordDecl::MergeAccess(BaseSpec.getAccessSpecifier(),
2295 Result.suppressDiagnostics();
2299 R.setNamingClass(Class);
2304 /// \brief Produce a diagnostic describing the ambiguity that resulted
2305 /// from name lookup.
2307 /// \param Result The result of the ambiguous lookup to be diagnosed.
2308 void Sema::DiagnoseAmbiguousLookup(LookupResult &Result) {
2309 assert(Result.isAmbiguous() && "Lookup result must be ambiguous");
2311 DeclarationName Name = Result.getLookupName();
2312 SourceLocation NameLoc = Result.getNameLoc();
2313 SourceRange LookupRange = Result.getContextRange();
2315 switch (Result.getAmbiguityKind()) {
2316 case LookupResult::AmbiguousBaseSubobjects: {
2317 CXXBasePaths *Paths = Result.getBasePaths();
2318 QualType SubobjectType = Paths->front().back().Base->getType();
2319 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobjects)
2320 << Name << SubobjectType << getAmbiguousPathsDisplayString(*Paths)
2323 DeclContext::lookup_iterator Found = Paths->front().Decls.begin();
2324 while (isa<CXXMethodDecl>(*Found) &&
2325 cast<CXXMethodDecl>(*Found)->isStatic())
2328 Diag((*Found)->getLocation(), diag::note_ambiguous_member_found);
2332 case LookupResult::AmbiguousBaseSubobjectTypes: {
2333 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobject_types)
2334 << Name << LookupRange;
2336 CXXBasePaths *Paths = Result.getBasePaths();
2337 std::set<Decl *> DeclsPrinted;
2338 for (CXXBasePaths::paths_iterator Path = Paths->begin(),
2339 PathEnd = Paths->end();
2340 Path != PathEnd; ++Path) {
2341 Decl *D = Path->Decls.front();
2342 if (DeclsPrinted.insert(D).second)
2343 Diag(D->getLocation(), diag::note_ambiguous_member_found);
2348 case LookupResult::AmbiguousTagHiding: {
2349 Diag(NameLoc, diag::err_ambiguous_tag_hiding) << Name << LookupRange;
2351 llvm::SmallPtrSet<NamedDecl*, 8> TagDecls;
2353 for (auto *D : Result)
2354 if (TagDecl *TD = dyn_cast<TagDecl>(D)) {
2355 TagDecls.insert(TD);
2356 Diag(TD->getLocation(), diag::note_hidden_tag);
2359 for (auto *D : Result)
2360 if (!isa<TagDecl>(D))
2361 Diag(D->getLocation(), diag::note_hiding_object);
2363 // For recovery purposes, go ahead and implement the hiding.
2364 LookupResult::Filter F = Result.makeFilter();
2365 while (F.hasNext()) {
2366 if (TagDecls.count(F.next()))
2373 case LookupResult::AmbiguousReference: {
2374 Diag(NameLoc, diag::err_ambiguous_reference) << Name << LookupRange;
2376 for (auto *D : Result)
2377 Diag(D->getLocation(), diag::note_ambiguous_candidate) << D;
2384 struct AssociatedLookup {
2385 AssociatedLookup(Sema &S, SourceLocation InstantiationLoc,
2386 Sema::AssociatedNamespaceSet &Namespaces,
2387 Sema::AssociatedClassSet &Classes)
2388 : S(S), Namespaces(Namespaces), Classes(Classes),
2389 InstantiationLoc(InstantiationLoc) {
2393 Sema::AssociatedNamespaceSet &Namespaces;
2394 Sema::AssociatedClassSet &Classes;
2395 SourceLocation InstantiationLoc;
2397 } // end anonymous namespace
2400 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType T);
2402 static void CollectEnclosingNamespace(Sema::AssociatedNamespaceSet &Namespaces,
2404 // Add the associated namespace for this class.
2406 // We don't use DeclContext::getEnclosingNamespaceContext() as this may
2407 // be a locally scoped record.
2409 // We skip out of inline namespaces. The innermost non-inline namespace
2410 // contains all names of all its nested inline namespaces anyway, so we can
2411 // replace the entire inline namespace tree with its root.
2412 while (Ctx->isRecord() || Ctx->isTransparentContext() ||
2413 Ctx->isInlineNamespace())
2414 Ctx = Ctx->getParent();
2416 if (Ctx->isFileContext())
2417 Namespaces.insert(Ctx->getPrimaryContext());
2420 // \brief Add the associated classes and namespaces for argument-dependent
2421 // lookup that involves a template argument (C++ [basic.lookup.koenig]p2).
2423 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
2424 const TemplateArgument &Arg) {
2425 // C++ [basic.lookup.koenig]p2, last bullet:
2427 switch (Arg.getKind()) {
2428 case TemplateArgument::Null:
2431 case TemplateArgument::Type:
2432 // [...] the namespaces and classes associated with the types of the
2433 // template arguments provided for template type parameters (excluding
2434 // template template parameters)
2435 addAssociatedClassesAndNamespaces(Result, Arg.getAsType());
2438 case TemplateArgument::Template:
2439 case TemplateArgument::TemplateExpansion: {
2440 // [...] the namespaces in which any template template arguments are
2441 // defined; and the classes in which any member templates used as
2442 // template template arguments are defined.
2443 TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
2444 if (ClassTemplateDecl *ClassTemplate
2445 = dyn_cast<ClassTemplateDecl>(Template.getAsTemplateDecl())) {
2446 DeclContext *Ctx = ClassTemplate->getDeclContext();
2447 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2448 Result.Classes.insert(EnclosingClass);
2449 // Add the associated namespace for this class.
2450 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2455 case TemplateArgument::Declaration:
2456 case TemplateArgument::Integral:
2457 case TemplateArgument::Expression:
2458 case TemplateArgument::NullPtr:
2459 // [Note: non-type template arguments do not contribute to the set of
2460 // associated namespaces. ]
2463 case TemplateArgument::Pack:
2464 for (const auto &P : Arg.pack_elements())
2465 addAssociatedClassesAndNamespaces(Result, P);
2470 // \brief Add the associated classes and namespaces for
2471 // argument-dependent lookup with an argument of class type
2472 // (C++ [basic.lookup.koenig]p2).
2474 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
2475 CXXRecordDecl *Class) {
2477 // Just silently ignore anything whose name is __va_list_tag.
2478 if (Class->getDeclName() == Result.S.VAListTagName)
2481 // C++ [basic.lookup.koenig]p2:
2483 // -- If T is a class type (including unions), its associated
2484 // classes are: the class itself; the class of which it is a
2485 // member, if any; and its direct and indirect base
2486 // classes. Its associated namespaces are the namespaces in
2487 // which its associated classes are defined.
2489 // Add the class of which it is a member, if any.
2490 DeclContext *Ctx = Class->getDeclContext();
2491 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2492 Result.Classes.insert(EnclosingClass);
2493 // Add the associated namespace for this class.
2494 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2496 // Add the class itself. If we've already seen this class, we don't
2497 // need to visit base classes.
2499 // FIXME: That's not correct, we may have added this class only because it
2500 // was the enclosing class of another class, and in that case we won't have
2501 // added its base classes yet.
2502 if (!Result.Classes.insert(Class))
2505 // -- If T is a template-id, its associated namespaces and classes are
2506 // the namespace in which the template is defined; for member
2507 // templates, the member template's class; the namespaces and classes
2508 // associated with the types of the template arguments provided for
2509 // template type parameters (excluding template template parameters); the
2510 // namespaces in which any template template arguments are defined; and
2511 // the classes in which any member templates used as template template
2512 // arguments are defined. [Note: non-type template arguments do not
2513 // contribute to the set of associated namespaces. ]
2514 if (ClassTemplateSpecializationDecl *Spec
2515 = dyn_cast<ClassTemplateSpecializationDecl>(Class)) {
2516 DeclContext *Ctx = Spec->getSpecializedTemplate()->getDeclContext();
2517 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2518 Result.Classes.insert(EnclosingClass);
2519 // Add the associated namespace for this class.
2520 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2522 const TemplateArgumentList &TemplateArgs = Spec->getTemplateArgs();
2523 for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
2524 addAssociatedClassesAndNamespaces(Result, TemplateArgs[I]);
2527 // Only recurse into base classes for complete types.
2528 if (!Result.S.isCompleteType(Result.InstantiationLoc,
2529 Result.S.Context.getRecordType(Class)))
2532 // Add direct and indirect base classes along with their associated
2534 SmallVector<CXXRecordDecl *, 32> Bases;
2535 Bases.push_back(Class);
2536 while (!Bases.empty()) {
2537 // Pop this class off the stack.
2538 Class = Bases.pop_back_val();
2540 // Visit the base classes.
2541 for (const auto &Base : Class->bases()) {
2542 const RecordType *BaseType = Base.getType()->getAs<RecordType>();
2543 // In dependent contexts, we do ADL twice, and the first time around,
2544 // the base type might be a dependent TemplateSpecializationType, or a
2545 // TemplateTypeParmType. If that happens, simply ignore it.
2546 // FIXME: If we want to support export, we probably need to add the
2547 // namespace of the template in a TemplateSpecializationType, or even
2548 // the classes and namespaces of known non-dependent arguments.
2551 CXXRecordDecl *BaseDecl = cast<CXXRecordDecl>(BaseType->getDecl());
2552 if (Result.Classes.insert(BaseDecl)) {
2553 // Find the associated namespace for this base class.
2554 DeclContext *BaseCtx = BaseDecl->getDeclContext();
2555 CollectEnclosingNamespace(Result.Namespaces, BaseCtx);
2557 // Make sure we visit the bases of this base class.
2558 if (BaseDecl->bases_begin() != BaseDecl->bases_end())
2559 Bases.push_back(BaseDecl);
2565 // \brief Add the associated classes and namespaces for
2566 // argument-dependent lookup with an argument of type T
2567 // (C++ [basic.lookup.koenig]p2).
2569 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType Ty) {
2570 // C++ [basic.lookup.koenig]p2:
2572 // For each argument type T in the function call, there is a set
2573 // of zero or more associated namespaces and a set of zero or more
2574 // associated classes to be considered. The sets of namespaces and
2575 // classes is determined entirely by the types of the function
2576 // arguments (and the namespace of any template template
2577 // argument). Typedef names and using-declarations used to specify
2578 // the types do not contribute to this set. The sets of namespaces
2579 // and classes are determined in the following way:
2581 SmallVector<const Type *, 16> Queue;
2582 const Type *T = Ty->getCanonicalTypeInternal().getTypePtr();
2585 switch (T->getTypeClass()) {
2587 #define TYPE(Class, Base)
2588 #define DEPENDENT_TYPE(Class, Base) case Type::Class:
2589 #define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
2590 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) case Type::Class:
2591 #define ABSTRACT_TYPE(Class, Base)
2592 #include "clang/AST/TypeNodes.def"
2593 // T is canonical. We can also ignore dependent types because
2594 // we don't need to do ADL at the definition point, but if we
2595 // wanted to implement template export (or if we find some other
2596 // use for associated classes and namespaces...) this would be
2600 // -- If T is a pointer to U or an array of U, its associated
2601 // namespaces and classes are those associated with U.
2603 T = cast<PointerType>(T)->getPointeeType().getTypePtr();
2605 case Type::ConstantArray:
2606 case Type::IncompleteArray:
2607 case Type::VariableArray:
2608 T = cast<ArrayType>(T)->getElementType().getTypePtr();
2611 // -- If T is a fundamental type, its associated sets of
2612 // namespaces and classes are both empty.
2616 // -- If T is a class type (including unions), its associated
2617 // classes are: the class itself; the class of which it is a
2618 // member, if any; and its direct and indirect base
2619 // classes. Its associated namespaces are the namespaces in
2620 // which its associated classes are defined.
2621 case Type::Record: {
2622 CXXRecordDecl *Class =
2623 cast<CXXRecordDecl>(cast<RecordType>(T)->getDecl());
2624 addAssociatedClassesAndNamespaces(Result, Class);
2628 // -- If T is an enumeration type, its associated namespace is
2629 // the namespace in which it is defined. If it is class
2630 // member, its associated class is the member's class; else
2631 // it has no associated class.
2633 EnumDecl *Enum = cast<EnumType>(T)->getDecl();
2635 DeclContext *Ctx = Enum->getDeclContext();
2636 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2637 Result.Classes.insert(EnclosingClass);
2639 // Add the associated namespace for this class.
2640 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2645 // -- If T is a function type, its associated namespaces and
2646 // classes are those associated with the function parameter
2647 // types and those associated with the return type.
2648 case Type::FunctionProto: {
2649 const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
2650 for (const auto &Arg : Proto->param_types())
2651 Queue.push_back(Arg.getTypePtr());
2654 case Type::FunctionNoProto: {
2655 const FunctionType *FnType = cast<FunctionType>(T);
2656 T = FnType->getReturnType().getTypePtr();
2660 // -- If T is a pointer to a member function of a class X, its
2661 // associated namespaces and classes are those associated
2662 // with the function parameter types and return type,
2663 // together with those associated with X.
2665 // -- If T is a pointer to a data member of class X, its
2666 // associated namespaces and classes are those associated
2667 // with the member type together with those associated with
2669 case Type::MemberPointer: {
2670 const MemberPointerType *MemberPtr = cast<MemberPointerType>(T);
2672 // Queue up the class type into which this points.
2673 Queue.push_back(MemberPtr->getClass());
2675 // And directly continue with the pointee type.
2676 T = MemberPtr->getPointeeType().getTypePtr();
2680 // As an extension, treat this like a normal pointer.
2681 case Type::BlockPointer:
2682 T = cast<BlockPointerType>(T)->getPointeeType().getTypePtr();
2685 // References aren't covered by the standard, but that's such an
2686 // obvious defect that we cover them anyway.
2687 case Type::LValueReference:
2688 case Type::RValueReference:
2689 T = cast<ReferenceType>(T)->getPointeeType().getTypePtr();
2692 // These are fundamental types.
2694 case Type::ExtVector:
2698 // Non-deduced auto types only get here for error cases.
2700 case Type::DeducedTemplateSpecialization:
2703 // If T is an Objective-C object or interface type, or a pointer to an
2704 // object or interface type, the associated namespace is the global
2706 case Type::ObjCObject:
2707 case Type::ObjCInterface:
2708 case Type::ObjCObjectPointer:
2709 Result.Namespaces.insert(Result.S.Context.getTranslationUnitDecl());
2712 // Atomic types are just wrappers; use the associations of the
2715 T = cast<AtomicType>(T)->getValueType().getTypePtr();
2718 T = cast<PipeType>(T)->getElementType().getTypePtr();
2724 T = Queue.pop_back_val();
2728 /// \brief Find the associated classes and namespaces for
2729 /// argument-dependent lookup for a call with the given set of
2732 /// This routine computes the sets of associated classes and associated
2733 /// namespaces searched by argument-dependent lookup
2734 /// (C++ [basic.lookup.argdep]) for a given set of arguments.
2735 void Sema::FindAssociatedClassesAndNamespaces(
2736 SourceLocation InstantiationLoc, ArrayRef<Expr *> Args,
2737 AssociatedNamespaceSet &AssociatedNamespaces,
2738 AssociatedClassSet &AssociatedClasses) {
2739 AssociatedNamespaces.clear();
2740 AssociatedClasses.clear();
2742 AssociatedLookup Result(*this, InstantiationLoc,
2743 AssociatedNamespaces, AssociatedClasses);
2745 // C++ [basic.lookup.koenig]p2:
2746 // For each argument type T in the function call, there is a set
2747 // of zero or more associated namespaces and a set of zero or more
2748 // associated classes to be considered. The sets of namespaces and
2749 // classes is determined entirely by the types of the function
2750 // arguments (and the namespace of any template template
2752 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
2753 Expr *Arg = Args[ArgIdx];
2755 if (Arg->getType() != Context.OverloadTy) {
2756 addAssociatedClassesAndNamespaces(Result, Arg->getType());
2760 // [...] In addition, if the argument is the name or address of a
2761 // set of overloaded functions and/or function templates, its
2762 // associated classes and namespaces are the union of those
2763 // associated with each of the members of the set: the namespace
2764 // in which the function or function template is defined and the
2765 // classes and namespaces associated with its (non-dependent)
2766 // parameter types and return type.
2767 Arg = Arg->IgnoreParens();
2768 if (UnaryOperator *unaryOp = dyn_cast<UnaryOperator>(Arg))
2769 if (unaryOp->getOpcode() == UO_AddrOf)
2770 Arg = unaryOp->getSubExpr();
2772 UnresolvedLookupExpr *ULE = dyn_cast<UnresolvedLookupExpr>(Arg);
2775 for (const auto *D : ULE->decls()) {
2776 // Look through any using declarations to find the underlying function.
2777 const FunctionDecl *FDecl = D->getUnderlyingDecl()->getAsFunction();
2779 // Add the classes and namespaces associated with the parameter
2780 // types and return type of this function.
2781 addAssociatedClassesAndNamespaces(Result, FDecl->getType());
2786 NamedDecl *Sema::LookupSingleName(Scope *S, DeclarationName Name,
2788 LookupNameKind NameKind,
2789 RedeclarationKind Redecl) {
2790 LookupResult R(*this, Name, Loc, NameKind, Redecl);
2792 return R.getAsSingle<NamedDecl>();
2795 /// \brief Find the protocol with the given name, if any.
2796 ObjCProtocolDecl *Sema::LookupProtocol(IdentifierInfo *II,
2797 SourceLocation IdLoc,
2798 RedeclarationKind Redecl) {
2799 Decl *D = LookupSingleName(TUScope, II, IdLoc,
2800 LookupObjCProtocolName, Redecl);
2801 return cast_or_null<ObjCProtocolDecl>(D);
2804 void Sema::LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
2805 QualType T1, QualType T2,
2806 UnresolvedSetImpl &Functions) {
2807 // C++ [over.match.oper]p3:
2808 // -- The set of non-member candidates is the result of the
2809 // unqualified lookup of operator@ in the context of the
2810 // expression according to the usual rules for name lookup in
2811 // unqualified function calls (3.4.2) except that all member
2812 // functions are ignored.
2813 DeclarationName OpName = Context.DeclarationNames.getCXXOperatorName(Op);
2814 LookupResult Operators(*this, OpName, SourceLocation(), LookupOperatorName);
2815 LookupName(Operators, S);
2817 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
2818 Functions.append(Operators.begin(), Operators.end());
2821 Sema::SpecialMemberOverloadResult Sema::LookupSpecialMember(CXXRecordDecl *RD,
2822 CXXSpecialMember SM,
2827 bool VolatileThis) {
2828 assert(CanDeclareSpecialMemberFunction(RD) &&
2829 "doing special member lookup into record that isn't fully complete");
2830 RD = RD->getDefinition();
2831 if (RValueThis || ConstThis || VolatileThis)
2832 assert((SM == CXXCopyAssignment || SM == CXXMoveAssignment) &&
2833 "constructors and destructors always have unqualified lvalue this");
2834 if (ConstArg || VolatileArg)
2835 assert((SM != CXXDefaultConstructor && SM != CXXDestructor) &&
2836 "parameter-less special members can't have qualified arguments");
2838 // FIXME: Get the caller to pass in a location for the lookup.
2839 SourceLocation LookupLoc = RD->getLocation();
2841 llvm::FoldingSetNodeID ID;
2844 ID.AddInteger(ConstArg);
2845 ID.AddInteger(VolatileArg);
2846 ID.AddInteger(RValueThis);
2847 ID.AddInteger(ConstThis);
2848 ID.AddInteger(VolatileThis);
2851 SpecialMemberOverloadResultEntry *Result =
2852 SpecialMemberCache.FindNodeOrInsertPos(ID, InsertPoint);
2854 // This was already cached
2858 Result = BumpAlloc.Allocate<SpecialMemberOverloadResultEntry>();
2859 Result = new (Result) SpecialMemberOverloadResultEntry(ID);
2860 SpecialMemberCache.InsertNode(Result, InsertPoint);
2862 if (SM == CXXDestructor) {
2863 if (RD->needsImplicitDestructor())
2864 DeclareImplicitDestructor(RD);
2865 CXXDestructorDecl *DD = RD->getDestructor();
2866 assert(DD && "record without a destructor");
2867 Result->setMethod(DD);
2868 Result->setKind(DD->isDeleted() ?
2869 SpecialMemberOverloadResult::NoMemberOrDeleted :
2870 SpecialMemberOverloadResult::Success);
2874 // Prepare for overload resolution. Here we construct a synthetic argument
2875 // if necessary and make sure that implicit functions are declared.
2876 CanQualType CanTy = Context.getCanonicalType(Context.getTagDeclType(RD));
2877 DeclarationName Name;
2878 Expr *Arg = nullptr;
2881 QualType ArgType = CanTy;
2882 ExprValueKind VK = VK_LValue;
2884 if (SM == CXXDefaultConstructor) {
2885 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2887 if (RD->needsImplicitDefaultConstructor())
2888 DeclareImplicitDefaultConstructor(RD);
2890 if (SM == CXXCopyConstructor || SM == CXXMoveConstructor) {
2891 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2892 if (RD->needsImplicitCopyConstructor())
2893 DeclareImplicitCopyConstructor(RD);
2894 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveConstructor())
2895 DeclareImplicitMoveConstructor(RD);
2897 Name = Context.DeclarationNames.getCXXOperatorName(OO_Equal);
2898 if (RD->needsImplicitCopyAssignment())
2899 DeclareImplicitCopyAssignment(RD);
2900 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveAssignment())
2901 DeclareImplicitMoveAssignment(RD);
2907 ArgType.addVolatile();
2909 // This isn't /really/ specified by the standard, but it's implied
2910 // we should be working from an RValue in the case of move to ensure
2911 // that we prefer to bind to rvalue references, and an LValue in the
2912 // case of copy to ensure we don't bind to rvalue references.
2913 // Possibly an XValue is actually correct in the case of move, but
2914 // there is no semantic difference for class types in this restricted
2916 if (SM == CXXCopyConstructor || SM == CXXCopyAssignment)
2922 OpaqueValueExpr FakeArg(LookupLoc, ArgType, VK);
2924 if (SM != CXXDefaultConstructor) {
2929 // Create the object argument
2930 QualType ThisTy = CanTy;
2934 ThisTy.addVolatile();
2935 Expr::Classification Classification =
2936 OpaqueValueExpr(LookupLoc, ThisTy,
2937 RValueThis ? VK_RValue : VK_LValue).Classify(Context);
2939 // Now we perform lookup on the name we computed earlier and do overload
2940 // resolution. Lookup is only performed directly into the class since there
2941 // will always be a (possibly implicit) declaration to shadow any others.
2942 OverloadCandidateSet OCS(LookupLoc, OverloadCandidateSet::CSK_Normal);
2943 DeclContext::lookup_result R = RD->lookup(Name);
2946 // We might have no default constructor because we have a lambda's closure
2947 // type, rather than because there's some other declared constructor.
2948 // Every class has a copy/move constructor, copy/move assignment, and
2950 assert(SM == CXXDefaultConstructor &&
2951 "lookup for a constructor or assignment operator was empty");
2952 Result->setMethod(nullptr);
2953 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2957 // Copy the candidates as our processing of them may load new declarations
2958 // from an external source and invalidate lookup_result.
2959 SmallVector<NamedDecl *, 8> Candidates(R.begin(), R.end());
2961 for (NamedDecl *CandDecl : Candidates) {
2962 if (CandDecl->isInvalidDecl())
2965 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public);
2966 auto CtorInfo = getConstructorInfo(Cand);
2967 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand->getUnderlyingDecl())) {
2968 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2969 AddMethodCandidate(M, Cand, RD, ThisTy, Classification,
2970 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2972 AddOverloadCandidate(CtorInfo.Constructor, CtorInfo.FoundDecl,
2973 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2975 AddOverloadCandidate(M, Cand, llvm::makeArrayRef(&Arg, NumArgs), OCS,
2977 } else if (FunctionTemplateDecl *Tmpl =
2978 dyn_cast<FunctionTemplateDecl>(Cand->getUnderlyingDecl())) {
2979 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2980 AddMethodTemplateCandidate(
2981 Tmpl, Cand, RD, nullptr, ThisTy, Classification,
2982 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2984 AddTemplateOverloadCandidate(
2985 CtorInfo.ConstructorTmpl, CtorInfo.FoundDecl, nullptr,
2986 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2988 AddTemplateOverloadCandidate(
2989 Tmpl, Cand, nullptr, llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2991 assert(isa<UsingDecl>(Cand.getDecl()) &&
2992 "illegal Kind of operator = Decl");
2996 OverloadCandidateSet::iterator Best;
2997 switch (OCS.BestViableFunction(*this, LookupLoc, Best)) {
2999 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
3000 Result->setKind(SpecialMemberOverloadResult::Success);
3004 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
3005 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
3009 Result->setMethod(nullptr);
3010 Result->setKind(SpecialMemberOverloadResult::Ambiguous);
3013 case OR_No_Viable_Function:
3014 Result->setMethod(nullptr);
3015 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
3022 /// \brief Look up the default constructor for the given class.
3023 CXXConstructorDecl *Sema::LookupDefaultConstructor(CXXRecordDecl *Class) {
3024 SpecialMemberOverloadResult Result =
3025 LookupSpecialMember(Class, CXXDefaultConstructor, false, false, false,
3028 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
3031 /// \brief Look up the copying constructor for the given class.
3032 CXXConstructorDecl *Sema::LookupCopyingConstructor(CXXRecordDecl *Class,
3034 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3035 "non-const, non-volatile qualifiers for copy ctor arg");
3036 SpecialMemberOverloadResult Result =
3037 LookupSpecialMember(Class, CXXCopyConstructor, Quals & Qualifiers::Const,
3038 Quals & Qualifiers::Volatile, false, false, false);
3040 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
3043 /// \brief Look up the moving constructor for the given class.
3044 CXXConstructorDecl *Sema::LookupMovingConstructor(CXXRecordDecl *Class,
3046 SpecialMemberOverloadResult Result =
3047 LookupSpecialMember(Class, CXXMoveConstructor, Quals & Qualifiers::Const,
3048 Quals & Qualifiers::Volatile, false, false, false);
3050 return cast_or_null<CXXConstructorDecl>(Result.getMethod());
3053 /// \brief Look up the constructors for the given class.
3054 DeclContext::lookup_result Sema::LookupConstructors(CXXRecordDecl *Class) {
3055 // If the implicit constructors have not yet been declared, do so now.
3056 if (CanDeclareSpecialMemberFunction(Class)) {
3057 if (Class->needsImplicitDefaultConstructor())
3058 DeclareImplicitDefaultConstructor(Class);
3059 if (Class->needsImplicitCopyConstructor())
3060 DeclareImplicitCopyConstructor(Class);
3061 if (getLangOpts().CPlusPlus11 && Class->needsImplicitMoveConstructor())
3062 DeclareImplicitMoveConstructor(Class);
3065 CanQualType T = Context.getCanonicalType(Context.getTypeDeclType(Class));
3066 DeclarationName Name = Context.DeclarationNames.getCXXConstructorName(T);
3067 return Class->lookup(Name);
3070 /// \brief Look up the copying assignment operator for the given class.
3071 CXXMethodDecl *Sema::LookupCopyingAssignment(CXXRecordDecl *Class,
3072 unsigned Quals, bool RValueThis,
3073 unsigned ThisQuals) {
3074 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3075 "non-const, non-volatile qualifiers for copy assignment arg");
3076 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3077 "non-const, non-volatile qualifiers for copy assignment this");
3078 SpecialMemberOverloadResult Result =
3079 LookupSpecialMember(Class, CXXCopyAssignment, Quals & Qualifiers::Const,
3080 Quals & Qualifiers::Volatile, RValueThis,
3081 ThisQuals & Qualifiers::Const,
3082 ThisQuals & Qualifiers::Volatile);
3084 return Result.getMethod();
3087 /// \brief Look up the moving assignment operator for the given class.
3088 CXXMethodDecl *Sema::LookupMovingAssignment(CXXRecordDecl *Class,
3091 unsigned ThisQuals) {
3092 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
3093 "non-const, non-volatile qualifiers for copy assignment this");
3094 SpecialMemberOverloadResult Result =
3095 LookupSpecialMember(Class, CXXMoveAssignment, Quals & Qualifiers::Const,
3096 Quals & Qualifiers::Volatile, RValueThis,
3097 ThisQuals & Qualifiers::Const,
3098 ThisQuals & Qualifiers::Volatile);
3100 return Result.getMethod();
3103 /// \brief Look for the destructor of the given class.
3105 /// During semantic analysis, this routine should be used in lieu of
3106 /// CXXRecordDecl::getDestructor().
3108 /// \returns The destructor for this class.
3109 CXXDestructorDecl *Sema::LookupDestructor(CXXRecordDecl *Class) {
3110 return cast<CXXDestructorDecl>(LookupSpecialMember(Class, CXXDestructor,
3111 false, false, false,
3112 false, false).getMethod());
3115 /// LookupLiteralOperator - Determine which literal operator should be used for
3116 /// a user-defined literal, per C++11 [lex.ext].
3118 /// Normal overload resolution is not used to select which literal operator to
3119 /// call for a user-defined literal. Look up the provided literal operator name,
3120 /// and filter the results to the appropriate set for the given argument types.
3121 Sema::LiteralOperatorLookupResult
3122 Sema::LookupLiteralOperator(Scope *S, LookupResult &R,
3123 ArrayRef<QualType> ArgTys,
3124 bool AllowRaw, bool AllowTemplate,
3125 bool AllowStringTemplate) {
3127 assert(R.getResultKind() != LookupResult::Ambiguous &&
3128 "literal operator lookup can't be ambiguous");
3130 // Filter the lookup results appropriately.
3131 LookupResult::Filter F = R.makeFilter();
3133 bool FoundRaw = false;
3134 bool FoundTemplate = false;
3135 bool FoundStringTemplate = false;
3136 bool FoundExactMatch = false;
3138 while (F.hasNext()) {
3140 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
3141 D = USD->getTargetDecl();
3143 // If the declaration we found is invalid, skip it.
3144 if (D->isInvalidDecl()) {
3150 bool IsTemplate = false;
3151 bool IsStringTemplate = false;
3152 bool IsExactMatch = false;
3154 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
3155 if (FD->getNumParams() == 1 &&
3156 FD->getParamDecl(0)->getType()->getAs<PointerType>())
3158 else if (FD->getNumParams() == ArgTys.size()) {
3159 IsExactMatch = true;
3160 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
3161 QualType ParamTy = FD->getParamDecl(ArgIdx)->getType();
3162 if (!Context.hasSameUnqualifiedType(ArgTys[ArgIdx], ParamTy)) {
3163 IsExactMatch = false;
3169 if (FunctionTemplateDecl *FD = dyn_cast<FunctionTemplateDecl>(D)) {
3170 TemplateParameterList *Params = FD->getTemplateParameters();
3171 if (Params->size() == 1)
3174 IsStringTemplate = true;
3178 FoundExactMatch = true;
3180 AllowTemplate = false;
3181 AllowStringTemplate = false;
3182 if (FoundRaw || FoundTemplate || FoundStringTemplate) {
3183 // Go through again and remove the raw and template decls we've
3186 FoundRaw = FoundTemplate = FoundStringTemplate = false;
3188 } else if (AllowRaw && IsRaw) {
3190 } else if (AllowTemplate && IsTemplate) {
3191 FoundTemplate = true;
3192 } else if (AllowStringTemplate && IsStringTemplate) {
3193 FoundStringTemplate = true;
3201 // C++11 [lex.ext]p3, p4: If S contains a literal operator with a matching
3202 // parameter type, that is used in preference to a raw literal operator
3203 // or literal operator template.
3204 if (FoundExactMatch)
3207 // C++11 [lex.ext]p3, p4: S shall contain a raw literal operator or a literal
3208 // operator template, but not both.
3209 if (FoundRaw && FoundTemplate) {
3210 Diag(R.getNameLoc(), diag::err_ovl_ambiguous_call) << R.getLookupName();
3211 for (LookupResult::iterator I = R.begin(), E = R.end(); I != E; ++I)
3212 NoteOverloadCandidate(*I, (*I)->getUnderlyingDecl()->getAsFunction());
3220 return LOLR_Template;
3222 if (FoundStringTemplate)
3223 return LOLR_StringTemplate;
3225 // Didn't find anything we could use.
3226 Diag(R.getNameLoc(), diag::err_ovl_no_viable_literal_operator)
3227 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
3228 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRaw
3229 << (AllowTemplate || AllowStringTemplate);
3233 void ADLResult::insert(NamedDecl *New) {
3234 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
3236 // If we haven't yet seen a decl for this key, or the last decl
3237 // was exactly this one, we're done.
3238 if (Old == nullptr || Old == New) {
3243 // Otherwise, decide which is a more recent redeclaration.
3244 FunctionDecl *OldFD = Old->getAsFunction();
3245 FunctionDecl *NewFD = New->getAsFunction();
3247 FunctionDecl *Cursor = NewFD;
3249 Cursor = Cursor->getPreviousDecl();
3251 // If we got to the end without finding OldFD, OldFD is the newer
3252 // declaration; leave things as they are.
3253 if (!Cursor) return;
3255 // If we do find OldFD, then NewFD is newer.
3256 if (Cursor == OldFD) break;
3258 // Otherwise, keep looking.
3264 void Sema::ArgumentDependentLookup(DeclarationName Name, SourceLocation Loc,
3265 ArrayRef<Expr *> Args, ADLResult &Result) {
3266 // Find all of the associated namespaces and classes based on the
3267 // arguments we have.
3268 AssociatedNamespaceSet AssociatedNamespaces;
3269 AssociatedClassSet AssociatedClasses;
3270 FindAssociatedClassesAndNamespaces(Loc, Args,
3271 AssociatedNamespaces,
3274 // C++ [basic.lookup.argdep]p3:
3275 // Let X be the lookup set produced by unqualified lookup (3.4.1)
3276 // and let Y be the lookup set produced by argument dependent
3277 // lookup (defined as follows). If X contains [...] then Y is
3278 // empty. Otherwise Y is the set of declarations found in the
3279 // namespaces associated with the argument types as described
3280 // below. The set of declarations found by the lookup of the name
3281 // is the union of X and Y.
3283 // Here, we compute Y and add its members to the overloaded
3285 for (auto *NS : AssociatedNamespaces) {
3286 // When considering an associated namespace, the lookup is the
3287 // same as the lookup performed when the associated namespace is
3288 // used as a qualifier (3.4.3.2) except that:
3290 // -- Any using-directives in the associated namespace are
3293 // -- Any namespace-scope friend functions declared in
3294 // associated classes are visible within their respective
3295 // namespaces even if they are not visible during an ordinary
3297 DeclContext::lookup_result R = NS->lookup(Name);
3299 // If the only declaration here is an ordinary friend, consider
3300 // it only if it was declared in an associated classes.
3301 if ((D->getIdentifierNamespace() & Decl::IDNS_Ordinary) == 0) {
3302 // If it's neither ordinarily visible nor a friend, we can't find it.
3303 if ((D->getIdentifierNamespace() & Decl::IDNS_OrdinaryFriend) == 0)
3306 bool DeclaredInAssociatedClass = false;
3307 for (Decl *DI = D; DI; DI = DI->getPreviousDecl()) {
3308 DeclContext *LexDC = DI->getLexicalDeclContext();
3309 if (isa<CXXRecordDecl>(LexDC) &&
3310 AssociatedClasses.count(cast<CXXRecordDecl>(LexDC)) &&
3311 isVisible(cast<NamedDecl>(DI))) {
3312 DeclaredInAssociatedClass = true;
3316 if (!DeclaredInAssociatedClass)
3320 if (isa<UsingShadowDecl>(D))
3321 D = cast<UsingShadowDecl>(D)->getTargetDecl();
3323 if (!isa<FunctionDecl>(D) && !isa<FunctionTemplateDecl>(D))
3326 if (!isVisible(D) && !(D = findAcceptableDecl(*this, D)))
3334 //----------------------------------------------------------------------------
3335 // Search for all visible declarations.
3336 //----------------------------------------------------------------------------
3337 VisibleDeclConsumer::~VisibleDeclConsumer() { }
3339 bool VisibleDeclConsumer::includeHiddenDecls() const { return false; }
3343 class ShadowContextRAII;
3345 class VisibleDeclsRecord {
3347 /// \brief An entry in the shadow map, which is optimized to store a
3348 /// single declaration (the common case) but can also store a list
3349 /// of declarations.
3350 typedef llvm::TinyPtrVector<NamedDecl*> ShadowMapEntry;
3353 /// \brief A mapping from declaration names to the declarations that have
3354 /// this name within a particular scope.
3355 typedef llvm::DenseMap<DeclarationName, ShadowMapEntry> ShadowMap;
3357 /// \brief A list of shadow maps, which is used to model name hiding.
3358 std::list<ShadowMap> ShadowMaps;
3360 /// \brief The declaration contexts we have already visited.
3361 llvm::SmallPtrSet<DeclContext *, 8> VisitedContexts;
3363 friend class ShadowContextRAII;
3366 /// \brief Determine whether we have already visited this context
3367 /// (and, if not, note that we are going to visit that context now).
3368 bool visitedContext(DeclContext *Ctx) {
3369 return !VisitedContexts.insert(Ctx).second;
3372 bool alreadyVisitedContext(DeclContext *Ctx) {
3373 return VisitedContexts.count(Ctx);
3376 /// \brief Determine whether the given declaration is hidden in the
3379 /// \returns the declaration that hides the given declaration, or
3380 /// NULL if no such declaration exists.
3381 NamedDecl *checkHidden(NamedDecl *ND);
3383 /// \brief Add a declaration to the current shadow map.
3384 void add(NamedDecl *ND) {
3385 ShadowMaps.back()[ND->getDeclName()].push_back(ND);
3389 /// \brief RAII object that records when we've entered a shadow context.
3390 class ShadowContextRAII {
3391 VisibleDeclsRecord &Visible;
3393 typedef VisibleDeclsRecord::ShadowMap ShadowMap;
3396 ShadowContextRAII(VisibleDeclsRecord &Visible) : Visible(Visible) {
3397 Visible.ShadowMaps.emplace_back();
3400 ~ShadowContextRAII() {
3401 Visible.ShadowMaps.pop_back();
3405 } // end anonymous namespace
3407 NamedDecl *VisibleDeclsRecord::checkHidden(NamedDecl *ND) {
3408 unsigned IDNS = ND->getIdentifierNamespace();
3409 std::list<ShadowMap>::reverse_iterator SM = ShadowMaps.rbegin();
3410 for (std::list<ShadowMap>::reverse_iterator SMEnd = ShadowMaps.rend();
3411 SM != SMEnd; ++SM) {
3412 ShadowMap::iterator Pos = SM->find(ND->getDeclName());
3413 if (Pos == SM->end())
3416 for (auto *D : Pos->second) {
3417 // A tag declaration does not hide a non-tag declaration.
3418 if (D->hasTagIdentifierNamespace() &&
3419 (IDNS & (Decl::IDNS_Member | Decl::IDNS_Ordinary |
3420 Decl::IDNS_ObjCProtocol)))
3423 // Protocols are in distinct namespaces from everything else.
3424 if (((D->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol)
3425 || (IDNS & Decl::IDNS_ObjCProtocol)) &&
3426 D->getIdentifierNamespace() != IDNS)
3429 // Functions and function templates in the same scope overload
3430 // rather than hide. FIXME: Look for hiding based on function
3432 if (D->getUnderlyingDecl()->isFunctionOrFunctionTemplate() &&
3433 ND->getUnderlyingDecl()->isFunctionOrFunctionTemplate() &&
3434 SM == ShadowMaps.rbegin())
3437 // A shadow declaration that's created by a resolved using declaration
3438 // is not hidden by the same using declaration.
3439 if (isa<UsingShadowDecl>(ND) && isa<UsingDecl>(D) &&
3440 cast<UsingShadowDecl>(ND)->getUsingDecl() == D)
3443 // We've found a declaration that hides this one.
3451 static void LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result,
3452 bool QualifiedNameLookup,
3454 VisibleDeclConsumer &Consumer,
3455 VisibleDeclsRecord &Visited) {
3459 // Make sure we don't visit the same context twice.
3460 if (Visited.visitedContext(Ctx->getPrimaryContext()))
3463 // Outside C++, lookup results for the TU live on identifiers.
3464 if (isa<TranslationUnitDecl>(Ctx) &&
3465 !Result.getSema().getLangOpts().CPlusPlus) {
3466 auto &S = Result.getSema();
3467 auto &Idents = S.Context.Idents;
3469 // Ensure all external identifiers are in the identifier table.
3470 if (IdentifierInfoLookup *External = Idents.getExternalIdentifierLookup()) {
3471 std::unique_ptr<IdentifierIterator> Iter(External->getIdentifiers());
3472 for (StringRef Name = Iter->Next(); !Name.empty(); Name = Iter->Next())
3476 // Walk all lookup results in the TU for each identifier.
3477 for (const auto &Ident : Idents) {
3478 for (auto I = S.IdResolver.begin(Ident.getValue()),
3479 E = S.IdResolver.end();
3481 if (S.IdResolver.isDeclInScope(*I, Ctx)) {
3482 if (NamedDecl *ND = Result.getAcceptableDecl(*I)) {
3483 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3493 if (CXXRecordDecl *Class = dyn_cast<CXXRecordDecl>(Ctx))
3494 Result.getSema().ForceDeclarationOfImplicitMembers(Class);
3496 // Enumerate all of the results in this context.
3497 for (DeclContextLookupResult R : Ctx->lookups()) {
3499 if (auto *ND = Result.getAcceptableDecl(D)) {
3500 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3506 // Traverse using directives for qualified name lookup.
3507 if (QualifiedNameLookup) {
3508 ShadowContextRAII Shadow(Visited);
3509 for (auto I : Ctx->using_directives()) {
3510 LookupVisibleDecls(I->getNominatedNamespace(), Result,
3511 QualifiedNameLookup, InBaseClass, Consumer, Visited);
3515 // Traverse the contexts of inherited C++ classes.
3516 if (CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(Ctx)) {
3517 if (!Record->hasDefinition())
3520 for (const auto &B : Record->bases()) {
3521 QualType BaseType = B.getType();
3523 // Don't look into dependent bases, because name lookup can't look
3525 if (BaseType->isDependentType())
3528 const RecordType *Record = BaseType->getAs<RecordType>();
3532 // FIXME: It would be nice to be able to determine whether referencing
3533 // a particular member would be ambiguous. For example, given
3535 // struct A { int member; };
3536 // struct B { int member; };
3537 // struct C : A, B { };
3539 // void f(C *c) { c->### }
3541 // accessing 'member' would result in an ambiguity. However, we
3542 // could be smart enough to qualify the member with the base
3551 // Find results in this base class (and its bases).
3552 ShadowContextRAII Shadow(Visited);
3553 LookupVisibleDecls(Record->getDecl(), Result, QualifiedNameLookup,
3554 true, Consumer, Visited);
3558 // Traverse the contexts of Objective-C classes.
3559 if (ObjCInterfaceDecl *IFace = dyn_cast<ObjCInterfaceDecl>(Ctx)) {
3560 // Traverse categories.
3561 for (auto *Cat : IFace->visible_categories()) {
3562 ShadowContextRAII Shadow(Visited);
3563 LookupVisibleDecls(Cat, Result, QualifiedNameLookup, false,
3567 // Traverse protocols.
3568 for (auto *I : IFace->all_referenced_protocols()) {
3569 ShadowContextRAII Shadow(Visited);
3570 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3574 // Traverse the superclass.
3575 if (IFace->getSuperClass()) {
3576 ShadowContextRAII Shadow(Visited);
3577 LookupVisibleDecls(IFace->getSuperClass(), Result, QualifiedNameLookup,
3578 true, Consumer, Visited);
3581 // If there is an implementation, traverse it. We do this to find
3582 // synthesized ivars.
3583 if (IFace->getImplementation()) {
3584 ShadowContextRAII Shadow(Visited);
3585 LookupVisibleDecls(IFace->getImplementation(), Result,
3586 QualifiedNameLookup, InBaseClass, Consumer, Visited);
3588 } else if (ObjCProtocolDecl *Protocol = dyn_cast<ObjCProtocolDecl>(Ctx)) {
3589 for (auto *I : Protocol->protocols()) {
3590 ShadowContextRAII Shadow(Visited);
3591 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3594 } else if (ObjCCategoryDecl *Category = dyn_cast<ObjCCategoryDecl>(Ctx)) {
3595 for (auto *I : Category->protocols()) {
3596 ShadowContextRAII Shadow(Visited);
3597 LookupVisibleDecls(I, Result, QualifiedNameLookup, false, Consumer,
3601 // If there is an implementation, traverse it.
3602 if (Category->getImplementation()) {
3603 ShadowContextRAII Shadow(Visited);
3604 LookupVisibleDecls(Category->getImplementation(), Result,
3605 QualifiedNameLookup, true, Consumer, Visited);
3610 static void LookupVisibleDecls(Scope *S, LookupResult &Result,
3611 UnqualUsingDirectiveSet &UDirs,
3612 VisibleDeclConsumer &Consumer,
3613 VisibleDeclsRecord &Visited) {
3617 if (!S->getEntity() ||
3619 !Visited.alreadyVisitedContext(S->getEntity())) ||
3620 (S->getEntity())->isFunctionOrMethod()) {
3621 FindLocalExternScope FindLocals(Result);
3622 // Walk through the declarations in this Scope.
3623 for (auto *D : S->decls()) {
3624 if (NamedDecl *ND = dyn_cast<NamedDecl>(D))
3625 if ((ND = Result.getAcceptableDecl(ND))) {
3626 Consumer.FoundDecl(ND, Visited.checkHidden(ND), nullptr, false);
3632 // FIXME: C++ [temp.local]p8
3633 DeclContext *Entity = nullptr;
3634 if (S->getEntity()) {
3635 // Look into this scope's declaration context, along with any of its
3636 // parent lookup contexts (e.g., enclosing classes), up to the point
3637 // where we hit the context stored in the next outer scope.
3638 Entity = S->getEntity();
3639 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
3641 for (DeclContext *Ctx = Entity; Ctx && !Ctx->Equals(OuterCtx);
3642 Ctx = Ctx->getLookupParent()) {
3643 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
3644 if (Method->isInstanceMethod()) {
3645 // For instance methods, look for ivars in the method's interface.
3646 LookupResult IvarResult(Result.getSema(), Result.getLookupName(),
3647 Result.getNameLoc(), Sema::LookupMemberName);
3648 if (ObjCInterfaceDecl *IFace = Method->getClassInterface()) {
3649 LookupVisibleDecls(IFace, IvarResult, /*QualifiedNameLookup=*/false,
3650 /*InBaseClass=*/false, Consumer, Visited);
3654 // We've already performed all of the name lookup that we need
3655 // to for Objective-C methods; the next context will be the
3660 if (Ctx->isFunctionOrMethod())
3663 LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/false,
3664 /*InBaseClass=*/false, Consumer, Visited);
3666 } else if (!S->getParent()) {
3667 // Look into the translation unit scope. We walk through the translation
3668 // unit's declaration context, because the Scope itself won't have all of
3669 // the declarations if we loaded a precompiled header.
3670 // FIXME: We would like the translation unit's Scope object to point to the
3671 // translation unit, so we don't need this special "if" branch. However,
3672 // doing so would force the normal C++ name-lookup code to look into the
3673 // translation unit decl when the IdentifierInfo chains would suffice.
3674 // Once we fix that problem (which is part of a more general "don't look
3675 // in DeclContexts unless we have to" optimization), we can eliminate this.
3676 Entity = Result.getSema().Context.getTranslationUnitDecl();
3677 LookupVisibleDecls(Entity, Result, /*QualifiedNameLookup=*/false,
3678 /*InBaseClass=*/false, Consumer, Visited);
3682 // Lookup visible declarations in any namespaces found by using
3684 for (const UnqualUsingEntry &UUE : UDirs.getNamespacesFor(Entity))
3685 LookupVisibleDecls(const_cast<DeclContext *>(UUE.getNominatedNamespace()),
3686 Result, /*QualifiedNameLookup=*/false,
3687 /*InBaseClass=*/false, Consumer, Visited);
3690 // Lookup names in the parent scope.
3691 ShadowContextRAII Shadow(Visited);
3692 LookupVisibleDecls(S->getParent(), Result, UDirs, Consumer, Visited);
3695 void Sema::LookupVisibleDecls(Scope *S, LookupNameKind Kind,
3696 VisibleDeclConsumer &Consumer,
3697 bool IncludeGlobalScope) {
3698 // Determine the set of using directives available during
3699 // unqualified name lookup.
3701 UnqualUsingDirectiveSet UDirs;
3702 if (getLangOpts().CPlusPlus) {
3703 // Find the first namespace or translation-unit scope.
3704 while (S && !isNamespaceOrTranslationUnitScope(S))
3707 UDirs.visitScopeChain(Initial, S);
3711 // Look for visible declarations.
3712 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3713 Result.setAllowHidden(Consumer.includeHiddenDecls());
3714 VisibleDeclsRecord Visited;
3715 if (!IncludeGlobalScope)
3716 Visited.visitedContext(Context.getTranslationUnitDecl());
3717 ShadowContextRAII Shadow(Visited);
3718 ::LookupVisibleDecls(Initial, Result, UDirs, Consumer, Visited);
3721 void Sema::LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
3722 VisibleDeclConsumer &Consumer,
3723 bool IncludeGlobalScope) {
3724 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3725 Result.setAllowHidden(Consumer.includeHiddenDecls());
3726 VisibleDeclsRecord Visited;
3727 if (!IncludeGlobalScope)
3728 Visited.visitedContext(Context.getTranslationUnitDecl());
3729 ShadowContextRAII Shadow(Visited);
3730 ::LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/true,
3731 /*InBaseClass=*/false, Consumer, Visited);
3734 /// LookupOrCreateLabel - Do a name lookup of a label with the specified name.
3735 /// If GnuLabelLoc is a valid source location, then this is a definition
3736 /// of an __label__ label name, otherwise it is a normal label definition
3738 LabelDecl *Sema::LookupOrCreateLabel(IdentifierInfo *II, SourceLocation Loc,
3739 SourceLocation GnuLabelLoc) {
3740 // Do a lookup to see if we have a label with this name already.
3741 NamedDecl *Res = nullptr;
3743 if (GnuLabelLoc.isValid()) {
3744 // Local label definitions always shadow existing labels.
3745 Res = LabelDecl::Create(Context, CurContext, Loc, II, GnuLabelLoc);
3746 Scope *S = CurScope;
3747 PushOnScopeChains(Res, S, true);
3748 return cast<LabelDecl>(Res);
3751 // Not a GNU local label.
3752 Res = LookupSingleName(CurScope, II, Loc, LookupLabel, NotForRedeclaration);
3753 // If we found a label, check to see if it is in the same context as us.
3754 // When in a Block, we don't want to reuse a label in an enclosing function.
3755 if (Res && Res->getDeclContext() != CurContext)
3758 // If not forward referenced or defined already, create the backing decl.
3759 Res = LabelDecl::Create(Context, CurContext, Loc, II);
3760 Scope *S = CurScope->getFnParent();
3761 assert(S && "Not in a function?");
3762 PushOnScopeChains(Res, S, true);
3764 return cast<LabelDecl>(Res);
3767 //===----------------------------------------------------------------------===//
3769 //===----------------------------------------------------------------------===//
3771 static bool isCandidateViable(CorrectionCandidateCallback &CCC,
3772 TypoCorrection &Candidate) {
3773 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3774 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3777 static void LookupPotentialTypoResult(Sema &SemaRef,
3779 IdentifierInfo *Name,
3780 Scope *S, CXXScopeSpec *SS,
3781 DeclContext *MemberContext,
3782 bool EnteringContext,
3783 bool isObjCIvarLookup,
3786 /// \brief Check whether the declarations found for a typo correction are
3787 /// visible, and if none of them are, convert the correction to an 'import
3788 /// a module' correction.
3789 static void checkCorrectionVisibility(Sema &SemaRef, TypoCorrection &TC) {
3790 if (TC.begin() == TC.end())
3793 TypoCorrection::decl_iterator DI = TC.begin(), DE = TC.end();
3795 for (/**/; DI != DE; ++DI)
3796 if (!LookupResult::isVisible(SemaRef, *DI))
3798 // Nothing to do if all decls are visible.
3802 llvm::SmallVector<NamedDecl*, 4> NewDecls(TC.begin(), DI);
3803 bool AnyVisibleDecls = !NewDecls.empty();
3805 for (/**/; DI != DE; ++DI) {
3806 NamedDecl *VisibleDecl = *DI;
3807 if (!LookupResult::isVisible(SemaRef, *DI))
3808 VisibleDecl = findAcceptableDecl(SemaRef, *DI);
3811 if (!AnyVisibleDecls) {
3812 // Found a visible decl, discard all hidden ones.
3813 AnyVisibleDecls = true;
3816 NewDecls.push_back(VisibleDecl);
3817 } else if (!AnyVisibleDecls && !(*DI)->isModulePrivate())
3818 NewDecls.push_back(*DI);
3821 if (NewDecls.empty())
3822 TC = TypoCorrection();
3824 TC.setCorrectionDecls(NewDecls);
3825 TC.setRequiresImport(!AnyVisibleDecls);
3829 // Fill the supplied vector with the IdentifierInfo pointers for each piece of
3830 // the given NestedNameSpecifier (i.e. given a NestedNameSpecifier "foo::bar::",
3831 // fill the vector with the IdentifierInfo pointers for "foo" and "bar").
3832 static void getNestedNameSpecifierIdentifiers(
3833 NestedNameSpecifier *NNS,
3834 SmallVectorImpl<const IdentifierInfo*> &Identifiers) {
3835 if (NestedNameSpecifier *Prefix = NNS->getPrefix())
3836 getNestedNameSpecifierIdentifiers(Prefix, Identifiers);
3838 Identifiers.clear();
3840 const IdentifierInfo *II = nullptr;
3842 switch (NNS->getKind()) {
3843 case NestedNameSpecifier::Identifier:
3844 II = NNS->getAsIdentifier();
3847 case NestedNameSpecifier::Namespace:
3848 if (NNS->getAsNamespace()->isAnonymousNamespace())
3850 II = NNS->getAsNamespace()->getIdentifier();
3853 case NestedNameSpecifier::NamespaceAlias:
3854 II = NNS->getAsNamespaceAlias()->getIdentifier();
3857 case NestedNameSpecifier::TypeSpecWithTemplate:
3858 case NestedNameSpecifier::TypeSpec:
3859 II = QualType(NNS->getAsType(), 0).getBaseTypeIdentifier();
3862 case NestedNameSpecifier::Global:
3863 case NestedNameSpecifier::Super:
3868 Identifiers.push_back(II);
3871 void TypoCorrectionConsumer::FoundDecl(NamedDecl *ND, NamedDecl *Hiding,
3872 DeclContext *Ctx, bool InBaseClass) {
3873 // Don't consider hidden names for typo correction.
3877 // Only consider entities with identifiers for names, ignoring
3878 // special names (constructors, overloaded operators, selectors,
3880 IdentifierInfo *Name = ND->getIdentifier();
3884 // Only consider visible declarations and declarations from modules with
3885 // names that exactly match.
3886 if (!LookupResult::isVisible(SemaRef, ND) && Name != Typo &&
3887 !findAcceptableDecl(SemaRef, ND))
3890 FoundName(Name->getName());
3893 void TypoCorrectionConsumer::FoundName(StringRef Name) {
3894 // Compute the edit distance between the typo and the name of this
3895 // entity, and add the identifier to the list of results.
3896 addName(Name, nullptr);
3899 void TypoCorrectionConsumer::addKeywordResult(StringRef Keyword) {
3900 // Compute the edit distance between the typo and this keyword,
3901 // and add the keyword to the list of results.
3902 addName(Keyword, nullptr, nullptr, true);
3905 void TypoCorrectionConsumer::addName(StringRef Name, NamedDecl *ND,
3906 NestedNameSpecifier *NNS, bool isKeyword) {
3907 // Use a simple length-based heuristic to determine the minimum possible
3908 // edit distance. If the minimum isn't good enough, bail out early.
3909 StringRef TypoStr = Typo->getName();
3910 unsigned MinED = abs((int)Name.size() - (int)TypoStr.size());
3911 if (MinED && TypoStr.size() / MinED < 3)
3914 // Compute an upper bound on the allowable edit distance, so that the
3915 // edit-distance algorithm can short-circuit.
3916 unsigned UpperBound = (TypoStr.size() + 2) / 3 + 1;
3917 unsigned ED = TypoStr.edit_distance(Name, true, UpperBound);
3918 if (ED >= UpperBound) return;
3920 TypoCorrection TC(&SemaRef.Context.Idents.get(Name), ND, NNS, ED);
3921 if (isKeyword) TC.makeKeyword();
3922 TC.setCorrectionRange(nullptr, Result.getLookupNameInfo());
3926 static const unsigned MaxTypoDistanceResultSets = 5;
3928 void TypoCorrectionConsumer::addCorrection(TypoCorrection Correction) {
3929 StringRef TypoStr = Typo->getName();
3930 StringRef Name = Correction.getCorrectionAsIdentifierInfo()->getName();
3932 // For very short typos, ignore potential corrections that have a different
3933 // base identifier from the typo or which have a normalized edit distance
3934 // longer than the typo itself.
3935 if (TypoStr.size() < 3 &&
3936 (Name != TypoStr || Correction.getEditDistance(true) > TypoStr.size()))
3939 // If the correction is resolved but is not viable, ignore it.
3940 if (Correction.isResolved()) {
3941 checkCorrectionVisibility(SemaRef, Correction);
3942 if (!Correction || !isCandidateViable(*CorrectionValidator, Correction))
3946 TypoResultList &CList =
3947 CorrectionResults[Correction.getEditDistance(false)][Name];
3949 if (!CList.empty() && !CList.back().isResolved())
3951 if (NamedDecl *NewND = Correction.getCorrectionDecl()) {
3952 std::string CorrectionStr = Correction.getAsString(SemaRef.getLangOpts());
3953 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
3954 RI != RIEnd; ++RI) {
3955 // If the Correction refers to a decl already in the result list,
3956 // replace the existing result if the string representation of Correction
3957 // comes before the current result alphabetically, then stop as there is
3958 // nothing more to be done to add Correction to the candidate set.
3959 if (RI->getCorrectionDecl() == NewND) {
3960 if (CorrectionStr < RI->getAsString(SemaRef.getLangOpts()))
3966 if (CList.empty() || Correction.isResolved())
3967 CList.push_back(Correction);
3969 while (CorrectionResults.size() > MaxTypoDistanceResultSets)
3970 CorrectionResults.erase(std::prev(CorrectionResults.end()));
3973 void TypoCorrectionConsumer::addNamespaces(
3974 const llvm::MapVector<NamespaceDecl *, bool> &KnownNamespaces) {
3975 SearchNamespaces = true;
3977 for (auto KNPair : KnownNamespaces)
3978 Namespaces.addNameSpecifier(KNPair.first);
3980 bool SSIsTemplate = false;
3981 if (NestedNameSpecifier *NNS =
3982 (SS && SS->isValid()) ? SS->getScopeRep() : nullptr) {
3983 if (const Type *T = NNS->getAsType())
3984 SSIsTemplate = T->getTypeClass() == Type::TemplateSpecialization;
3986 // Do not transform this into an iterator-based loop. The loop body can
3987 // trigger the creation of further types (through lazy deserialization) and
3988 // invalide iterators into this list.
3989 auto &Types = SemaRef.getASTContext().getTypes();
3990 for (unsigned I = 0; I != Types.size(); ++I) {
3991 const auto *TI = Types[I];
3992 if (CXXRecordDecl *CD = TI->getAsCXXRecordDecl()) {
3993 CD = CD->getCanonicalDecl();
3994 if (!CD->isDependentType() && !CD->isAnonymousStructOrUnion() &&
3995 !CD->isUnion() && CD->getIdentifier() &&
3996 (SSIsTemplate || !isa<ClassTemplateSpecializationDecl>(CD)) &&
3997 (CD->isBeingDefined() || CD->isCompleteDefinition()))
3998 Namespaces.addNameSpecifier(CD);
4003 const TypoCorrection &TypoCorrectionConsumer::getNextCorrection() {
4004 if (++CurrentTCIndex < ValidatedCorrections.size())
4005 return ValidatedCorrections[CurrentTCIndex];
4007 CurrentTCIndex = ValidatedCorrections.size();
4008 while (!CorrectionResults.empty()) {
4009 auto DI = CorrectionResults.begin();
4010 if (DI->second.empty()) {
4011 CorrectionResults.erase(DI);
4015 auto RI = DI->second.begin();
4016 if (RI->second.empty()) {
4017 DI->second.erase(RI);
4018 performQualifiedLookups();
4022 TypoCorrection TC = RI->second.pop_back_val();
4023 if (TC.isResolved() || TC.requiresImport() || resolveCorrection(TC)) {
4024 ValidatedCorrections.push_back(TC);
4025 return ValidatedCorrections[CurrentTCIndex];
4028 return ValidatedCorrections[0]; // The empty correction.
4031 bool TypoCorrectionConsumer::resolveCorrection(TypoCorrection &Candidate) {
4032 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
4033 DeclContext *TempMemberContext = MemberContext;
4034 CXXScopeSpec *TempSS = SS.get();
4036 LookupPotentialTypoResult(SemaRef, Result, Name, S, TempSS, TempMemberContext,
4038 CorrectionValidator->IsObjCIvarLookup,
4039 Name == Typo && !Candidate.WillReplaceSpecifier());
4040 switch (Result.getResultKind()) {
4041 case LookupResult::NotFound:
4042 case LookupResult::NotFoundInCurrentInstantiation:
4043 case LookupResult::FoundUnresolvedValue:
4045 // Immediately retry the lookup without the given CXXScopeSpec
4047 Candidate.WillReplaceSpecifier(true);
4050 if (TempMemberContext) {
4053 TempMemberContext = nullptr;
4056 if (SearchNamespaces)
4057 QualifiedResults.push_back(Candidate);
4060 case LookupResult::Ambiguous:
4061 // We don't deal with ambiguities.
4064 case LookupResult::Found:
4065 case LookupResult::FoundOverloaded:
4066 // Store all of the Decls for overloaded symbols
4067 for (auto *TRD : Result)
4068 Candidate.addCorrectionDecl(TRD);
4069 checkCorrectionVisibility(SemaRef, Candidate);
4070 if (!isCandidateViable(*CorrectionValidator, Candidate)) {
4071 if (SearchNamespaces)
4072 QualifiedResults.push_back(Candidate);
4075 Candidate.setCorrectionRange(SS.get(), Result.getLookupNameInfo());
4081 void TypoCorrectionConsumer::performQualifiedLookups() {
4082 unsigned TypoLen = Typo->getName().size();
4083 for (const TypoCorrection &QR : QualifiedResults) {
4084 for (const auto &NSI : Namespaces) {
4085 DeclContext *Ctx = NSI.DeclCtx;
4086 const Type *NSType = NSI.NameSpecifier->getAsType();
4088 // If the current NestedNameSpecifier refers to a class and the
4089 // current correction candidate is the name of that class, then skip
4090 // it as it is unlikely a qualified version of the class' constructor
4091 // is an appropriate correction.
4092 if (CXXRecordDecl *NSDecl = NSType ? NSType->getAsCXXRecordDecl() :
4094 if (NSDecl->getIdentifier() == QR.getCorrectionAsIdentifierInfo())
4098 TypoCorrection TC(QR);
4099 TC.ClearCorrectionDecls();
4100 TC.setCorrectionSpecifier(NSI.NameSpecifier);
4101 TC.setQualifierDistance(NSI.EditDistance);
4102 TC.setCallbackDistance(0); // Reset the callback distance
4104 // If the current correction candidate and namespace combination are
4105 // too far away from the original typo based on the normalized edit
4106 // distance, then skip performing a qualified name lookup.
4107 unsigned TmpED = TC.getEditDistance(true);
4108 if (QR.getCorrectionAsIdentifierInfo() != Typo && TmpED &&
4109 TypoLen / TmpED < 3)
4113 Result.setLookupName(QR.getCorrectionAsIdentifierInfo());
4114 if (!SemaRef.LookupQualifiedName(Result, Ctx))
4117 // Any corrections added below will be validated in subsequent
4118 // iterations of the main while() loop over the Consumer's contents.
4119 switch (Result.getResultKind()) {
4120 case LookupResult::Found:
4121 case LookupResult::FoundOverloaded: {
4122 if (SS && SS->isValid()) {
4123 std::string NewQualified = TC.getAsString(SemaRef.getLangOpts());
4124 std::string OldQualified;
4125 llvm::raw_string_ostream OldOStream(OldQualified);
4126 SS->getScopeRep()->print(OldOStream, SemaRef.getPrintingPolicy());
4127 OldOStream << Typo->getName();
4128 // If correction candidate would be an identical written qualified
4129 // identifer, then the existing CXXScopeSpec probably included a
4130 // typedef that didn't get accounted for properly.
4131 if (OldOStream.str() == NewQualified)
4134 for (LookupResult::iterator TRD = Result.begin(), TRDEnd = Result.end();
4135 TRD != TRDEnd; ++TRD) {
4136 if (SemaRef.CheckMemberAccess(TC.getCorrectionRange().getBegin(),
4137 NSType ? NSType->getAsCXXRecordDecl()
4139 TRD.getPair()) == Sema::AR_accessible)
4140 TC.addCorrectionDecl(*TRD);
4142 if (TC.isResolved()) {
4143 TC.setCorrectionRange(SS.get(), Result.getLookupNameInfo());
4148 case LookupResult::NotFound:
4149 case LookupResult::NotFoundInCurrentInstantiation:
4150 case LookupResult::Ambiguous:
4151 case LookupResult::FoundUnresolvedValue:
4156 QualifiedResults.clear();
4159 TypoCorrectionConsumer::NamespaceSpecifierSet::NamespaceSpecifierSet(
4160 ASTContext &Context, DeclContext *CurContext, CXXScopeSpec *CurScopeSpec)
4161 : Context(Context), CurContextChain(buildContextChain(CurContext)) {
4162 if (NestedNameSpecifier *NNS =
4163 CurScopeSpec ? CurScopeSpec->getScopeRep() : nullptr) {
4164 llvm::raw_string_ostream SpecifierOStream(CurNameSpecifier);
4165 NNS->print(SpecifierOStream, Context.getPrintingPolicy());
4167 getNestedNameSpecifierIdentifiers(NNS, CurNameSpecifierIdentifiers);
4169 // Build the list of identifiers that would be used for an absolute
4170 // (from the global context) NestedNameSpecifier referring to the current
4172 for (DeclContext *C : llvm::reverse(CurContextChain)) {
4173 if (auto *ND = dyn_cast_or_null<NamespaceDecl>(C))
4174 CurContextIdentifiers.push_back(ND->getIdentifier());
4177 // Add the global context as a NestedNameSpecifier
4178 SpecifierInfo SI = {cast<DeclContext>(Context.getTranslationUnitDecl()),
4179 NestedNameSpecifier::GlobalSpecifier(Context), 1};
4180 DistanceMap[1].push_back(SI);
4183 auto TypoCorrectionConsumer::NamespaceSpecifierSet::buildContextChain(
4184 DeclContext *Start) -> DeclContextList {
4185 assert(Start && "Building a context chain from a null context");
4186 DeclContextList Chain;
4187 for (DeclContext *DC = Start->getPrimaryContext(); DC != nullptr;
4188 DC = DC->getLookupParent()) {
4189 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(DC);
4190 if (!DC->isInlineNamespace() && !DC->isTransparentContext() &&
4191 !(ND && ND->isAnonymousNamespace()))
4192 Chain.push_back(DC->getPrimaryContext());
4198 TypoCorrectionConsumer::NamespaceSpecifierSet::buildNestedNameSpecifier(
4199 DeclContextList &DeclChain, NestedNameSpecifier *&NNS) {
4200 unsigned NumSpecifiers = 0;
4201 for (DeclContext *C : llvm::reverse(DeclChain)) {
4202 if (auto *ND = dyn_cast_or_null<NamespaceDecl>(C)) {
4203 NNS = NestedNameSpecifier::Create(Context, NNS, ND);
4205 } else if (auto *RD = dyn_cast_or_null<RecordDecl>(C)) {
4206 NNS = NestedNameSpecifier::Create(Context, NNS, RD->isTemplateDecl(),
4207 RD->getTypeForDecl());
4211 return NumSpecifiers;
4214 void TypoCorrectionConsumer::NamespaceSpecifierSet::addNameSpecifier(
4216 NestedNameSpecifier *NNS = nullptr;
4217 unsigned NumSpecifiers = 0;
4218 DeclContextList NamespaceDeclChain(buildContextChain(Ctx));
4219 DeclContextList FullNamespaceDeclChain(NamespaceDeclChain);
4221 // Eliminate common elements from the two DeclContext chains.
4222 for (DeclContext *C : llvm::reverse(CurContextChain)) {
4223 if (NamespaceDeclChain.empty() || NamespaceDeclChain.back() != C)
4225 NamespaceDeclChain.pop_back();
4228 // Build the NestedNameSpecifier from what is left of the NamespaceDeclChain
4229 NumSpecifiers = buildNestedNameSpecifier(NamespaceDeclChain, NNS);
4231 // Add an explicit leading '::' specifier if needed.
4232 if (NamespaceDeclChain.empty()) {
4233 // Rebuild the NestedNameSpecifier as a globally-qualified specifier.
4234 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
4236 buildNestedNameSpecifier(FullNamespaceDeclChain, NNS);
4237 } else if (NamedDecl *ND =
4238 dyn_cast_or_null<NamedDecl>(NamespaceDeclChain.back())) {
4239 IdentifierInfo *Name = ND->getIdentifier();
4240 bool SameNameSpecifier = false;
4241 if (std::find(CurNameSpecifierIdentifiers.begin(),
4242 CurNameSpecifierIdentifiers.end(),
4243 Name) != CurNameSpecifierIdentifiers.end()) {
4244 std::string NewNameSpecifier;
4245 llvm::raw_string_ostream SpecifierOStream(NewNameSpecifier);
4246 SmallVector<const IdentifierInfo *, 4> NewNameSpecifierIdentifiers;
4247 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
4248 NNS->print(SpecifierOStream, Context.getPrintingPolicy());
4249 SpecifierOStream.flush();
4250 SameNameSpecifier = NewNameSpecifier == CurNameSpecifier;
4252 if (SameNameSpecifier ||
4253 std::find(CurContextIdentifiers.begin(), CurContextIdentifiers.end(),
4254 Name) != CurContextIdentifiers.end()) {
4255 // Rebuild the NestedNameSpecifier as a globally-qualified specifier.
4256 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
4258 buildNestedNameSpecifier(FullNamespaceDeclChain, NNS);
4262 // If the built NestedNameSpecifier would be replacing an existing
4263 // NestedNameSpecifier, use the number of component identifiers that
4264 // would need to be changed as the edit distance instead of the number
4265 // of components in the built NestedNameSpecifier.
4266 if (NNS && !CurNameSpecifierIdentifiers.empty()) {
4267 SmallVector<const IdentifierInfo*, 4> NewNameSpecifierIdentifiers;
4268 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
4269 NumSpecifiers = llvm::ComputeEditDistance(
4270 llvm::makeArrayRef(CurNameSpecifierIdentifiers),
4271 llvm::makeArrayRef(NewNameSpecifierIdentifiers));
4274 SpecifierInfo SI = {Ctx, NNS, NumSpecifiers};
4275 DistanceMap[NumSpecifiers].push_back(SI);
4278 /// \brief Perform name lookup for a possible result for typo correction.
4279 static void LookupPotentialTypoResult(Sema &SemaRef,
4281 IdentifierInfo *Name,
4282 Scope *S, CXXScopeSpec *SS,
4283 DeclContext *MemberContext,
4284 bool EnteringContext,
4285 bool isObjCIvarLookup,
4287 Res.suppressDiagnostics();
4289 Res.setLookupName(Name);
4290 Res.setAllowHidden(FindHidden);
4291 if (MemberContext) {
4292 if (ObjCInterfaceDecl *Class = dyn_cast<ObjCInterfaceDecl>(MemberContext)) {
4293 if (isObjCIvarLookup) {
4294 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(Name)) {
4301 if (ObjCPropertyDecl *Prop = Class->FindPropertyDeclaration(
4302 Name, ObjCPropertyQueryKind::OBJC_PR_query_instance)) {
4309 SemaRef.LookupQualifiedName(Res, MemberContext);
4313 SemaRef.LookupParsedName(Res, S, SS, /*AllowBuiltinCreation=*/false,
4316 // Fake ivar lookup; this should really be part of
4317 // LookupParsedName.
4318 if (ObjCMethodDecl *Method = SemaRef.getCurMethodDecl()) {
4319 if (Method->isInstanceMethod() && Method->getClassInterface() &&
4321 (Res.isSingleResult() &&
4322 Res.getFoundDecl()->isDefinedOutsideFunctionOrMethod()))) {
4323 if (ObjCIvarDecl *IV
4324 = Method->getClassInterface()->lookupInstanceVariable(Name)) {
4332 /// \brief Add keywords to the consumer as possible typo corrections.
4333 static void AddKeywordsToConsumer(Sema &SemaRef,
4334 TypoCorrectionConsumer &Consumer,
4335 Scope *S, CorrectionCandidateCallback &CCC,
4336 bool AfterNestedNameSpecifier) {
4337 if (AfterNestedNameSpecifier) {
4338 // For 'X::', we know exactly which keywords can appear next.
4339 Consumer.addKeywordResult("template");
4340 if (CCC.WantExpressionKeywords)
4341 Consumer.addKeywordResult("operator");
4345 if (CCC.WantObjCSuper)
4346 Consumer.addKeywordResult("super");
4348 if (CCC.WantTypeSpecifiers) {
4349 // Add type-specifier keywords to the set of results.
4350 static const char *const CTypeSpecs[] = {
4351 "char", "const", "double", "enum", "float", "int", "long", "short",
4352 "signed", "struct", "union", "unsigned", "void", "volatile",
4353 "_Complex", "_Imaginary",
4354 // storage-specifiers as well
4355 "extern", "inline", "static", "typedef"
4358 const unsigned NumCTypeSpecs = llvm::array_lengthof(CTypeSpecs);
4359 for (unsigned I = 0; I != NumCTypeSpecs; ++I)
4360 Consumer.addKeywordResult(CTypeSpecs[I]);
4362 if (SemaRef.getLangOpts().C99)
4363 Consumer.addKeywordResult("restrict");
4364 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus)
4365 Consumer.addKeywordResult("bool");
4366 else if (SemaRef.getLangOpts().C99)
4367 Consumer.addKeywordResult("_Bool");
4369 if (SemaRef.getLangOpts().CPlusPlus) {
4370 Consumer.addKeywordResult("class");
4371 Consumer.addKeywordResult("typename");
4372 Consumer.addKeywordResult("wchar_t");
4374 if (SemaRef.getLangOpts().CPlusPlus11) {
4375 Consumer.addKeywordResult("char16_t");
4376 Consumer.addKeywordResult("char32_t");
4377 Consumer.addKeywordResult("constexpr");
4378 Consumer.addKeywordResult("decltype");
4379 Consumer.addKeywordResult("thread_local");
4383 if (SemaRef.getLangOpts().GNUMode)
4384 Consumer.addKeywordResult("typeof");
4385 } else if (CCC.WantFunctionLikeCasts) {
4386 static const char *const CastableTypeSpecs[] = {
4387 "char", "double", "float", "int", "long", "short",
4388 "signed", "unsigned", "void"
4390 for (auto *kw : CastableTypeSpecs)
4391 Consumer.addKeywordResult(kw);
4394 if (CCC.WantCXXNamedCasts && SemaRef.getLangOpts().CPlusPlus) {
4395 Consumer.addKeywordResult("const_cast");
4396 Consumer.addKeywordResult("dynamic_cast");
4397 Consumer.addKeywordResult("reinterpret_cast");
4398 Consumer.addKeywordResult("static_cast");
4401 if (CCC.WantExpressionKeywords) {
4402 Consumer.addKeywordResult("sizeof");
4403 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus) {
4404 Consumer.addKeywordResult("false");
4405 Consumer.addKeywordResult("true");
4408 if (SemaRef.getLangOpts().CPlusPlus) {
4409 static const char *const CXXExprs[] = {
4410 "delete", "new", "operator", "throw", "typeid"
4412 const unsigned NumCXXExprs = llvm::array_lengthof(CXXExprs);
4413 for (unsigned I = 0; I != NumCXXExprs; ++I)
4414 Consumer.addKeywordResult(CXXExprs[I]);
4416 if (isa<CXXMethodDecl>(SemaRef.CurContext) &&
4417 cast<CXXMethodDecl>(SemaRef.CurContext)->isInstance())
4418 Consumer.addKeywordResult("this");
4420 if (SemaRef.getLangOpts().CPlusPlus11) {
4421 Consumer.addKeywordResult("alignof");
4422 Consumer.addKeywordResult("nullptr");
4426 if (SemaRef.getLangOpts().C11) {
4427 // FIXME: We should not suggest _Alignof if the alignof macro
4429 Consumer.addKeywordResult("_Alignof");
4433 if (CCC.WantRemainingKeywords) {
4434 if (SemaRef.getCurFunctionOrMethodDecl() || SemaRef.getCurBlock()) {
4436 static const char *const CStmts[] = {
4437 "do", "else", "for", "goto", "if", "return", "switch", "while" };
4438 const unsigned NumCStmts = llvm::array_lengthof(CStmts);
4439 for (unsigned I = 0; I != NumCStmts; ++I)
4440 Consumer.addKeywordResult(CStmts[I]);
4442 if (SemaRef.getLangOpts().CPlusPlus) {
4443 Consumer.addKeywordResult("catch");
4444 Consumer.addKeywordResult("try");
4447 if (S && S->getBreakParent())
4448 Consumer.addKeywordResult("break");
4450 if (S && S->getContinueParent())
4451 Consumer.addKeywordResult("continue");
4453 if (!SemaRef.getCurFunction()->SwitchStack.empty()) {
4454 Consumer.addKeywordResult("case");
4455 Consumer.addKeywordResult("default");
4458 if (SemaRef.getLangOpts().CPlusPlus) {
4459 Consumer.addKeywordResult("namespace");
4460 Consumer.addKeywordResult("template");
4463 if (S && S->isClassScope()) {
4464 Consumer.addKeywordResult("explicit");
4465 Consumer.addKeywordResult("friend");
4466 Consumer.addKeywordResult("mutable");
4467 Consumer.addKeywordResult("private");
4468 Consumer.addKeywordResult("protected");
4469 Consumer.addKeywordResult("public");
4470 Consumer.addKeywordResult("virtual");
4474 if (SemaRef.getLangOpts().CPlusPlus) {
4475 Consumer.addKeywordResult("using");
4477 if (SemaRef.getLangOpts().CPlusPlus11)
4478 Consumer.addKeywordResult("static_assert");
4483 std::unique_ptr<TypoCorrectionConsumer> Sema::makeTypoCorrectionConsumer(
4484 const DeclarationNameInfo &TypoName, Sema::LookupNameKind LookupKind,
4485 Scope *S, CXXScopeSpec *SS,
4486 std::unique_ptr<CorrectionCandidateCallback> CCC,
4487 DeclContext *MemberContext, bool EnteringContext,
4488 const ObjCObjectPointerType *OPT, bool ErrorRecovery) {
4490 if (Diags.hasFatalErrorOccurred() || !getLangOpts().SpellChecking ||
4491 DisableTypoCorrection)
4494 // In Microsoft mode, don't perform typo correction in a template member
4495 // function dependent context because it interferes with the "lookup into
4496 // dependent bases of class templates" feature.
4497 if (getLangOpts().MSVCCompat && CurContext->isDependentContext() &&
4498 isa<CXXMethodDecl>(CurContext))
4501 // We only attempt to correct typos for identifiers.
4502 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4506 // If the scope specifier itself was invalid, don't try to correct
4508 if (SS && SS->isInvalid())
4511 // Never try to correct typos during any kind of code synthesis.
4512 if (!CodeSynthesisContexts.empty())
4515 // Don't try to correct 'super'.
4516 if (S && S->isInObjcMethodScope() && Typo == getSuperIdentifier())
4519 // Abort if typo correction already failed for this specific typo.
4520 IdentifierSourceLocations::iterator locs = TypoCorrectionFailures.find(Typo);
4521 if (locs != TypoCorrectionFailures.end() &&
4522 locs->second.count(TypoName.getLoc()))
4525 // Don't try to correct the identifier "vector" when in AltiVec mode.
4526 // TODO: Figure out why typo correction misbehaves in this case, fix it, and
4527 // remove this workaround.
4528 if ((getLangOpts().AltiVec || getLangOpts().ZVector) && Typo->isStr("vector"))
4531 // Provide a stop gap for files that are just seriously broken. Trying
4532 // to correct all typos can turn into a HUGE performance penalty, causing
4533 // some files to take minutes to get rejected by the parser.
4534 unsigned Limit = getDiagnostics().getDiagnosticOptions().SpellCheckingLimit;
4535 if (Limit && TyposCorrected >= Limit)
4539 // If we're handling a missing symbol error, using modules, and the
4540 // special search all modules option is used, look for a missing import.
4541 if (ErrorRecovery && getLangOpts().Modules &&
4542 getLangOpts().ModulesSearchAll) {
4543 // The following has the side effect of loading the missing module.
4544 getModuleLoader().lookupMissingImports(Typo->getName(),
4545 TypoName.getLocStart());
4548 CorrectionCandidateCallback &CCCRef = *CCC;
4549 auto Consumer = llvm::make_unique<TypoCorrectionConsumer>(
4550 *this, TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4553 // Perform name lookup to find visible, similarly-named entities.
4554 bool IsUnqualifiedLookup = false;
4555 DeclContext *QualifiedDC = MemberContext;
4556 if (MemberContext) {
4557 LookupVisibleDecls(MemberContext, LookupKind, *Consumer);
4559 // Look in qualified interfaces.
4561 for (auto *I : OPT->quals())
4562 LookupVisibleDecls(I, LookupKind, *Consumer);
4564 } else if (SS && SS->isSet()) {
4565 QualifiedDC = computeDeclContext(*SS, EnteringContext);
4569 LookupVisibleDecls(QualifiedDC, LookupKind, *Consumer);
4571 IsUnqualifiedLookup = true;
4574 // Determine whether we are going to search in the various namespaces for
4576 bool SearchNamespaces
4577 = getLangOpts().CPlusPlus &&
4578 (IsUnqualifiedLookup || (SS && SS->isSet()));
4580 if (IsUnqualifiedLookup || SearchNamespaces) {
4581 // For unqualified lookup, look through all of the names that we have
4582 // seen in this translation unit.
4583 // FIXME: Re-add the ability to skip very unlikely potential corrections.
4584 for (const auto &I : Context.Idents)
4585 Consumer->FoundName(I.getKey());
4587 // Walk through identifiers in external identifier sources.
4588 // FIXME: Re-add the ability to skip very unlikely potential corrections.
4589 if (IdentifierInfoLookup *External
4590 = Context.Idents.getExternalIdentifierLookup()) {
4591 std::unique_ptr<IdentifierIterator> Iter(External->getIdentifiers());
4593 StringRef Name = Iter->Next();
4597 Consumer->FoundName(Name);
4602 AddKeywordsToConsumer(*this, *Consumer, S, CCCRef, SS && SS->isNotEmpty());
4604 // Build the NestedNameSpecifiers for the KnownNamespaces, if we're going
4605 // to search those namespaces.
4606 if (SearchNamespaces) {
4607 // Load any externally-known namespaces.
4608 if (ExternalSource && !LoadedExternalKnownNamespaces) {
4609 SmallVector<NamespaceDecl *, 4> ExternalKnownNamespaces;
4610 LoadedExternalKnownNamespaces = true;
4611 ExternalSource->ReadKnownNamespaces(ExternalKnownNamespaces);
4612 for (auto *N : ExternalKnownNamespaces)
4613 KnownNamespaces[N] = true;
4616 Consumer->addNamespaces(KnownNamespaces);
4622 /// \brief Try to "correct" a typo in the source code by finding
4623 /// visible declarations whose names are similar to the name that was
4624 /// present in the source code.
4626 /// \param TypoName the \c DeclarationNameInfo structure that contains
4627 /// the name that was present in the source code along with its location.
4629 /// \param LookupKind the name-lookup criteria used to search for the name.
4631 /// \param S the scope in which name lookup occurs.
4633 /// \param SS the nested-name-specifier that precedes the name we're
4634 /// looking for, if present.
4636 /// \param CCC A CorrectionCandidateCallback object that provides further
4637 /// validation of typo correction candidates. It also provides flags for
4638 /// determining the set of keywords permitted.
4640 /// \param MemberContext if non-NULL, the context in which to look for
4641 /// a member access expression.
4643 /// \param EnteringContext whether we're entering the context described by
4644 /// the nested-name-specifier SS.
4646 /// \param OPT when non-NULL, the search for visible declarations will
4647 /// also walk the protocols in the qualified interfaces of \p OPT.
4649 /// \returns a \c TypoCorrection containing the corrected name if the typo
4650 /// along with information such as the \c NamedDecl where the corrected name
4651 /// was declared, and any additional \c NestedNameSpecifier needed to access
4652 /// it (C++ only). The \c TypoCorrection is empty if there is no correction.
4653 TypoCorrection Sema::CorrectTypo(const DeclarationNameInfo &TypoName,
4654 Sema::LookupNameKind LookupKind,
4655 Scope *S, CXXScopeSpec *SS,
4656 std::unique_ptr<CorrectionCandidateCallback> CCC,
4657 CorrectTypoKind Mode,
4658 DeclContext *MemberContext,
4659 bool EnteringContext,
4660 const ObjCObjectPointerType *OPT,
4661 bool RecordFailure) {
4662 assert(CCC && "CorrectTypo requires a CorrectionCandidateCallback");
4664 // Always let the ExternalSource have the first chance at correction, even
4665 // if we would otherwise have given up.
4666 if (ExternalSource) {
4667 if (TypoCorrection Correction = ExternalSource->CorrectTypo(
4668 TypoName, LookupKind, S, SS, *CCC, MemberContext, EnteringContext, OPT))
4672 // Ugly hack equivalent to CTC == CTC_ObjCMessageReceiver;
4673 // WantObjCSuper is only true for CTC_ObjCMessageReceiver and for
4674 // some instances of CTC_Unknown, while WantRemainingKeywords is true
4675 // for CTC_Unknown but not for CTC_ObjCMessageReceiver.
4676 bool ObjCMessageReceiver = CCC->WantObjCSuper && !CCC->WantRemainingKeywords;
4678 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4679 auto Consumer = makeTypoCorrectionConsumer(
4680 TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4681 EnteringContext, OPT, Mode == CTK_ErrorRecovery);
4684 return TypoCorrection();
4686 // If we haven't found anything, we're done.
4687 if (Consumer->empty())
4688 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4690 // Make sure the best edit distance (prior to adding any namespace qualifiers)
4691 // is not more that about a third of the length of the typo's identifier.
4692 unsigned ED = Consumer->getBestEditDistance(true);
4693 unsigned TypoLen = Typo->getName().size();
4694 if (ED > 0 && TypoLen / ED < 3)
4695 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4697 TypoCorrection BestTC = Consumer->getNextCorrection();
4698 TypoCorrection SecondBestTC = Consumer->getNextCorrection();
4700 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4702 ED = BestTC.getEditDistance();
4704 if (TypoLen >= 3 && ED > 0 && TypoLen / ED < 3) {
4705 // If this was an unqualified lookup and we believe the callback
4706 // object wouldn't have filtered out possible corrections, note
4707 // that no correction was found.
4708 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4711 // If only a single name remains, return that result.
4712 if (!SecondBestTC ||
4713 SecondBestTC.getEditDistance(false) > BestTC.getEditDistance(false)) {
4714 const TypoCorrection &Result = BestTC;
4716 // Don't correct to a keyword that's the same as the typo; the keyword
4717 // wasn't actually in scope.
4718 if (ED == 0 && Result.isKeyword())
4719 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4721 TypoCorrection TC = Result;
4722 TC.setCorrectionRange(SS, TypoName);
4723 checkCorrectionVisibility(*this, TC);
4725 } else if (SecondBestTC && ObjCMessageReceiver) {
4726 // Prefer 'super' when we're completing in a message-receiver
4729 if (BestTC.getCorrection().getAsString() != "super") {
4730 if (SecondBestTC.getCorrection().getAsString() == "super")
4731 BestTC = SecondBestTC;
4732 else if ((*Consumer)["super"].front().isKeyword())
4733 BestTC = (*Consumer)["super"].front();
4735 // Don't correct to a keyword that's the same as the typo; the keyword
4736 // wasn't actually in scope.
4737 if (BestTC.getEditDistance() == 0 ||
4738 BestTC.getCorrection().getAsString() != "super")
4739 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure);
4741 BestTC.setCorrectionRange(SS, TypoName);
4745 // Record the failure's location if needed and return an empty correction. If
4746 // this was an unqualified lookup and we believe the callback object did not
4747 // filter out possible corrections, also cache the failure for the typo.
4748 return FailedCorrection(Typo, TypoName.getLoc(), RecordFailure && !SecondBestTC);
4751 /// \brief Try to "correct" a typo in the source code by finding
4752 /// visible declarations whose names are similar to the name that was
4753 /// present in the source code.
4755 /// \param TypoName the \c DeclarationNameInfo structure that contains
4756 /// the name that was present in the source code along with its location.
4758 /// \param LookupKind the name-lookup criteria used to search for the name.
4760 /// \param S the scope in which name lookup occurs.
4762 /// \param SS the nested-name-specifier that precedes the name we're
4763 /// looking for, if present.
4765 /// \param CCC A CorrectionCandidateCallback object that provides further
4766 /// validation of typo correction candidates. It also provides flags for
4767 /// determining the set of keywords permitted.
4769 /// \param TDG A TypoDiagnosticGenerator functor that will be used to print
4770 /// diagnostics when the actual typo correction is attempted.
4772 /// \param TRC A TypoRecoveryCallback functor that will be used to build an
4773 /// Expr from a typo correction candidate.
4775 /// \param MemberContext if non-NULL, the context in which to look for
4776 /// a member access expression.
4778 /// \param EnteringContext whether we're entering the context described by
4779 /// the nested-name-specifier SS.
4781 /// \param OPT when non-NULL, the search for visible declarations will
4782 /// also walk the protocols in the qualified interfaces of \p OPT.
4784 /// \returns a new \c TypoExpr that will later be replaced in the AST with an
4785 /// Expr representing the result of performing typo correction, or nullptr if
4786 /// typo correction is not possible. If nullptr is returned, no diagnostics will
4787 /// be emitted and it is the responsibility of the caller to emit any that are
4789 TypoExpr *Sema::CorrectTypoDelayed(
4790 const DeclarationNameInfo &TypoName, Sema::LookupNameKind LookupKind,
4791 Scope *S, CXXScopeSpec *SS,
4792 std::unique_ptr<CorrectionCandidateCallback> CCC,
4793 TypoDiagnosticGenerator TDG, TypoRecoveryCallback TRC, CorrectTypoKind Mode,
4794 DeclContext *MemberContext, bool EnteringContext,
4795 const ObjCObjectPointerType *OPT) {
4796 assert(CCC && "CorrectTypoDelayed requires a CorrectionCandidateCallback");
4798 auto Consumer = makeTypoCorrectionConsumer(
4799 TypoName, LookupKind, S, SS, std::move(CCC), MemberContext,
4800 EnteringContext, OPT, Mode == CTK_ErrorRecovery);
4802 // Give the external sema source a chance to correct the typo.
4803 TypoCorrection ExternalTypo;
4804 if (ExternalSource && Consumer) {
4805 ExternalTypo = ExternalSource->CorrectTypo(
4806 TypoName, LookupKind, S, SS, *Consumer->getCorrectionValidator(),
4807 MemberContext, EnteringContext, OPT);
4809 Consumer->addCorrection(ExternalTypo);
4812 if (!Consumer || Consumer->empty())
4815 // Make sure the best edit distance (prior to adding any namespace qualifiers)
4816 // is not more that about a third of the length of the typo's identifier.
4817 unsigned ED = Consumer->getBestEditDistance(true);
4818 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
4819 if (!ExternalTypo && ED > 0 && Typo->getName().size() / ED < 3)
4822 ExprEvalContexts.back().NumTypos++;
4823 return createDelayedTypo(std::move(Consumer), std::move(TDG), std::move(TRC));
4826 void TypoCorrection::addCorrectionDecl(NamedDecl *CDecl) {
4830 CorrectionDecls.clear();
4832 CorrectionDecls.push_back(CDecl);
4834 if (!CorrectionName)
4835 CorrectionName = CDecl->getDeclName();
4838 std::string TypoCorrection::getAsString(const LangOptions &LO) const {
4839 if (CorrectionNameSpec) {
4840 std::string tmpBuffer;
4841 llvm::raw_string_ostream PrefixOStream(tmpBuffer);
4842 CorrectionNameSpec->print(PrefixOStream, PrintingPolicy(LO));
4843 PrefixOStream << CorrectionName;
4844 return PrefixOStream.str();
4847 return CorrectionName.getAsString();
4850 bool CorrectionCandidateCallback::ValidateCandidate(
4851 const TypoCorrection &candidate) {
4852 if (!candidate.isResolved())
4855 if (candidate.isKeyword())
4856 return WantTypeSpecifiers || WantExpressionKeywords || WantCXXNamedCasts ||
4857 WantRemainingKeywords || WantObjCSuper;
4859 bool HasNonType = false;
4860 bool HasStaticMethod = false;
4861 bool HasNonStaticMethod = false;
4862 for (Decl *D : candidate) {
4863 if (FunctionTemplateDecl *FTD = dyn_cast<FunctionTemplateDecl>(D))
4864 D = FTD->getTemplatedDecl();
4865 if (CXXMethodDecl *Method = dyn_cast<CXXMethodDecl>(D)) {
4866 if (Method->isStatic())
4867 HasStaticMethod = true;
4869 HasNonStaticMethod = true;
4871 if (!isa<TypeDecl>(D))
4875 if (IsAddressOfOperand && HasNonStaticMethod && !HasStaticMethod &&
4876 !candidate.getCorrectionSpecifier())
4879 return WantTypeSpecifiers || HasNonType;
4882 FunctionCallFilterCCC::FunctionCallFilterCCC(Sema &SemaRef, unsigned NumArgs,
4883 bool HasExplicitTemplateArgs,
4885 : NumArgs(NumArgs), HasExplicitTemplateArgs(HasExplicitTemplateArgs),
4886 CurContext(SemaRef.CurContext), MemberFn(ME) {
4887 WantTypeSpecifiers = false;
4888 WantFunctionLikeCasts = SemaRef.getLangOpts().CPlusPlus && NumArgs == 1;
4889 WantRemainingKeywords = false;
4892 bool FunctionCallFilterCCC::ValidateCandidate(const TypoCorrection &candidate) {
4893 if (!candidate.getCorrectionDecl())
4894 return candidate.isKeyword();
4896 for (auto *C : candidate) {
4897 FunctionDecl *FD = nullptr;
4898 NamedDecl *ND = C->getUnderlyingDecl();
4899 if (FunctionTemplateDecl *FTD = dyn_cast<FunctionTemplateDecl>(ND))
4900 FD = FTD->getTemplatedDecl();
4901 if (!HasExplicitTemplateArgs && !FD) {
4902 if (!(FD = dyn_cast<FunctionDecl>(ND)) && isa<ValueDecl>(ND)) {
4903 // If the Decl is neither a function nor a template function,
4904 // determine if it is a pointer or reference to a function. If so,
4905 // check against the number of arguments expected for the pointee.
4906 QualType ValType = cast<ValueDecl>(ND)->getType();
4907 if (ValType->isAnyPointerType() || ValType->isReferenceType())
4908 ValType = ValType->getPointeeType();
4909 if (const FunctionProtoType *FPT = ValType->getAs<FunctionProtoType>())
4910 if (FPT->getNumParams() == NumArgs)
4915 // Skip the current candidate if it is not a FunctionDecl or does not accept
4916 // the current number of arguments.
4917 if (!FD || !(FD->getNumParams() >= NumArgs &&
4918 FD->getMinRequiredArguments() <= NumArgs))
4921 // If the current candidate is a non-static C++ method, skip the candidate
4922 // unless the method being corrected--or the current DeclContext, if the
4923 // function being corrected is not a method--is a method in the same class
4924 // or a descendent class of the candidate's parent class.
4925 if (CXXMethodDecl *MD = dyn_cast<CXXMethodDecl>(FD)) {
4926 if (MemberFn || !MD->isStatic()) {
4927 CXXMethodDecl *CurMD =
4929 ? dyn_cast_or_null<CXXMethodDecl>(MemberFn->getMemberDecl())
4930 : dyn_cast_or_null<CXXMethodDecl>(CurContext);
4931 CXXRecordDecl *CurRD =
4932 CurMD ? CurMD->getParent()->getCanonicalDecl() : nullptr;
4933 CXXRecordDecl *RD = MD->getParent()->getCanonicalDecl();
4934 if (!CurRD || (CurRD != RD && !CurRD->isDerivedFrom(RD)))
4943 void Sema::diagnoseTypo(const TypoCorrection &Correction,
4944 const PartialDiagnostic &TypoDiag,
4945 bool ErrorRecovery) {
4946 diagnoseTypo(Correction, TypoDiag, PDiag(diag::note_previous_decl),
4950 /// Find which declaration we should import to provide the definition of
4951 /// the given declaration.
4952 static NamedDecl *getDefinitionToImport(NamedDecl *D) {
4953 if (VarDecl *VD = dyn_cast<VarDecl>(D))
4954 return VD->getDefinition();
4955 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D))
4956 return FD->getDefinition();
4957 if (TagDecl *TD = dyn_cast<TagDecl>(D))
4958 return TD->getDefinition();
4959 if (ObjCInterfaceDecl *ID = dyn_cast<ObjCInterfaceDecl>(D))
4960 return ID->getDefinition();
4961 if (ObjCProtocolDecl *PD = dyn_cast<ObjCProtocolDecl>(D))
4962 return PD->getDefinition();
4963 if (TemplateDecl *TD = dyn_cast<TemplateDecl>(D))
4964 return getDefinitionToImport(TD->getTemplatedDecl());
4968 void Sema::diagnoseMissingImport(SourceLocation Loc, NamedDecl *Decl,
4969 MissingImportKind MIK, bool Recover) {
4970 assert(!isVisible(Decl) && "missing import for non-hidden decl?");
4972 // Suggest importing a module providing the definition of this entity, if
4974 NamedDecl *Def = getDefinitionToImport(Decl);
4978 Module *Owner = getOwningModule(Decl);
4979 assert(Owner && "definition of hidden declaration is not in a module");
4981 llvm::SmallVector<Module*, 8> OwningModules;
4982 OwningModules.push_back(Owner);
4983 auto Merged = Context.getModulesWithMergedDefinition(Decl);
4984 OwningModules.insert(OwningModules.end(), Merged.begin(), Merged.end());
4986 diagnoseMissingImport(Loc, Decl, Decl->getLocation(), OwningModules, MIK,
4990 /// \brief Get a "quoted.h" or <angled.h> include path to use in a diagnostic
4991 /// suggesting the addition of a #include of the specified file.
4992 static std::string getIncludeStringForHeader(Preprocessor &PP,
4993 const FileEntry *E) {
4996 PP.getHeaderSearchInfo().suggestPathToFileForDiagnostics(E, &IsSystem);
4997 return (IsSystem ? '<' : '"') + Path + (IsSystem ? '>' : '"');
5000 void Sema::diagnoseMissingImport(SourceLocation UseLoc, NamedDecl *Decl,
5001 SourceLocation DeclLoc,
5002 ArrayRef<Module *> Modules,
5003 MissingImportKind MIK, bool Recover) {
5004 assert(!Modules.empty());
5006 if (Modules.size() > 1) {
5007 std::string ModuleList;
5009 for (Module *M : Modules) {
5010 ModuleList += "\n ";
5011 if (++N == 5 && N != Modules.size()) {
5012 ModuleList += "[...]";
5015 ModuleList += M->getFullModuleName();
5018 Diag(UseLoc, diag::err_module_unimported_use_multiple)
5019 << (int)MIK << Decl << ModuleList;
5020 } else if (const FileEntry *E =
5021 PP.getModuleHeaderToIncludeForDiagnostics(UseLoc, DeclLoc)) {
5022 // The right way to make the declaration visible is to include a header;
5023 // suggest doing so.
5025 // FIXME: Find a smart place to suggest inserting a #include, and add
5026 // a FixItHint there.
5027 Diag(UseLoc, diag::err_module_unimported_use_header)
5028 << (int)MIK << Decl << Modules[0]->getFullModuleName()
5029 << getIncludeStringForHeader(PP, E);
5031 // FIXME: Add a FixItHint that imports the corresponding module.
5032 Diag(UseLoc, diag::err_module_unimported_use)
5033 << (int)MIK << Decl << Modules[0]->getFullModuleName();
5038 case MissingImportKind::Declaration:
5039 DiagID = diag::note_previous_declaration;
5041 case MissingImportKind::Definition:
5042 DiagID = diag::note_previous_definition;
5044 case MissingImportKind::DefaultArgument:
5045 DiagID = diag::note_default_argument_declared_here;
5047 case MissingImportKind::ExplicitSpecialization:
5048 DiagID = diag::note_explicit_specialization_declared_here;
5050 case MissingImportKind::PartialSpecialization:
5051 DiagID = diag::note_partial_specialization_declared_here;
5054 Diag(DeclLoc, DiagID);
5056 // Try to recover by implicitly importing this module.
5058 createImplicitModuleImportForErrorRecovery(UseLoc, Modules[0]);
5061 /// \brief Diagnose a successfully-corrected typo. Separated from the correction
5062 /// itself to allow external validation of the result, etc.
5064 /// \param Correction The result of performing typo correction.
5065 /// \param TypoDiag The diagnostic to produce. This will have the corrected
5066 /// string added to it (and usually also a fixit).
5067 /// \param PrevNote A note to use when indicating the location of the entity to
5068 /// which we are correcting. Will have the correction string added to it.
5069 /// \param ErrorRecovery If \c true (the default), the caller is going to
5070 /// recover from the typo as if the corrected string had been typed.
5071 /// In this case, \c PDiag must be an error, and we will attach a fixit
5073 void Sema::diagnoseTypo(const TypoCorrection &Correction,
5074 const PartialDiagnostic &TypoDiag,
5075 const PartialDiagnostic &PrevNote,
5076 bool ErrorRecovery) {
5077 std::string CorrectedStr = Correction.getAsString(getLangOpts());
5078 std::string CorrectedQuotedStr = Correction.getQuoted(getLangOpts());
5079 FixItHint FixTypo = FixItHint::CreateReplacement(
5080 Correction.getCorrectionRange(), CorrectedStr);
5082 // Maybe we're just missing a module import.
5083 if (Correction.requiresImport()) {
5084 NamedDecl *Decl = Correction.getFoundDecl();
5085 assert(Decl && "import required but no declaration to import");
5087 diagnoseMissingImport(Correction.getCorrectionRange().getBegin(), Decl,
5088 MissingImportKind::Declaration, ErrorRecovery);
5092 Diag(Correction.getCorrectionRange().getBegin(), TypoDiag)
5093 << CorrectedQuotedStr << (ErrorRecovery ? FixTypo : FixItHint());
5095 NamedDecl *ChosenDecl =
5096 Correction.isKeyword() ? nullptr : Correction.getFoundDecl();
5097 if (PrevNote.getDiagID() && ChosenDecl)
5098 Diag(ChosenDecl->getLocation(), PrevNote)
5099 << CorrectedQuotedStr << (ErrorRecovery ? FixItHint() : FixTypo);
5101 // Add any extra diagnostics.
5102 for (const PartialDiagnostic &PD : Correction.getExtraDiagnostics())
5103 Diag(Correction.getCorrectionRange().getBegin(), PD);
5106 TypoExpr *Sema::createDelayedTypo(std::unique_ptr<TypoCorrectionConsumer> TCC,
5107 TypoDiagnosticGenerator TDG,
5108 TypoRecoveryCallback TRC) {
5109 assert(TCC && "createDelayedTypo requires a valid TypoCorrectionConsumer");
5110 auto TE = new (Context) TypoExpr(Context.DependentTy);
5111 auto &State = DelayedTypos[TE];
5112 State.Consumer = std::move(TCC);
5113 State.DiagHandler = std::move(TDG);
5114 State.RecoveryHandler = std::move(TRC);
5118 const Sema::TypoExprState &Sema::getTypoExprState(TypoExpr *TE) const {
5119 auto Entry = DelayedTypos.find(TE);
5120 assert(Entry != DelayedTypos.end() &&
5121 "Failed to get the state for a TypoExpr!");
5122 return Entry->second;
5125 void Sema::clearDelayedTypo(TypoExpr *TE) {
5126 DelayedTypos.erase(TE);
5129 void Sema::ActOnPragmaDump(Scope *S, SourceLocation IILoc, IdentifierInfo *II) {
5130 DeclarationNameInfo Name(II, IILoc);
5131 LookupResult R(*this, Name, LookupAnyName, Sema::NotForRedeclaration);
5132 R.suppressDiagnostics();
5133 R.setHideTags(false);