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 //===----------------------------------------------------------------------===//
14 #include "clang/Sema/Lookup.h"
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/Sema/DeclSpec.h"
27 #include "clang/Sema/ExternalSemaSource.h"
28 #include "clang/Sema/Overload.h"
29 #include "clang/Sema/Scope.h"
30 #include "clang/Sema/ScopeInfo.h"
31 #include "clang/Sema/Sema.h"
32 #include "clang/Sema/SemaInternal.h"
33 #include "clang/Sema/TemplateDeduction.h"
34 #include "clang/Sema/TypoCorrection.h"
35 #include "llvm/ADT/STLExtras.h"
36 #include "llvm/ADT/SetVector.h"
37 #include "llvm/ADT/SmallPtrSet.h"
38 #include "llvm/ADT/StringMap.h"
39 #include "llvm/ADT/TinyPtrVector.h"
40 #include "llvm/ADT/edit_distance.h"
41 #include "llvm/Support/ErrorHandling.h"
51 using namespace clang;
55 class UnqualUsingEntry {
56 const DeclContext *Nominated;
57 const DeclContext *CommonAncestor;
60 UnqualUsingEntry(const DeclContext *Nominated,
61 const DeclContext *CommonAncestor)
62 : Nominated(Nominated), CommonAncestor(CommonAncestor) {
65 const DeclContext *getCommonAncestor() const {
66 return CommonAncestor;
69 const DeclContext *getNominatedNamespace() const {
73 // Sort by the pointer value of the common ancestor.
75 bool operator()(const UnqualUsingEntry &L, const UnqualUsingEntry &R) {
76 return L.getCommonAncestor() < R.getCommonAncestor();
79 bool operator()(const UnqualUsingEntry &E, const DeclContext *DC) {
80 return E.getCommonAncestor() < DC;
83 bool operator()(const DeclContext *DC, const UnqualUsingEntry &E) {
84 return DC < E.getCommonAncestor();
89 /// A collection of using directives, as used by C++ unqualified
91 class UnqualUsingDirectiveSet {
92 typedef SmallVector<UnqualUsingEntry, 8> ListTy;
95 llvm::SmallPtrSet<DeclContext*, 8> visited;
98 UnqualUsingDirectiveSet() {}
100 void visitScopeChain(Scope *S, Scope *InnermostFileScope) {
101 // C++ [namespace.udir]p1:
102 // During unqualified name lookup, the names appear as if they
103 // were declared in the nearest enclosing namespace which contains
104 // both the using-directive and the nominated namespace.
105 DeclContext *InnermostFileDC
106 = static_cast<DeclContext*>(InnermostFileScope->getEntity());
107 assert(InnermostFileDC && InnermostFileDC->isFileContext());
109 for (; S; S = S->getParent()) {
110 // C++ [namespace.udir]p1:
111 // A using-directive shall not appear in class scope, but may
112 // appear in namespace scope or in block scope.
113 DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity());
114 if (Ctx && Ctx->isFileContext()) {
116 } else if (!Ctx || Ctx->isFunctionOrMethod()) {
117 Scope::udir_iterator I = S->using_directives_begin(),
118 End = S->using_directives_end();
119 for (; I != End; ++I)
120 visit(*I, InnermostFileDC);
125 // Visits a context and collect all of its using directives
126 // recursively. Treats all using directives as if they were
127 // declared in the context.
129 // A given context is only every visited once, so it is important
130 // that contexts be visited from the inside out in order to get
131 // the effective DCs right.
132 void visit(DeclContext *DC, DeclContext *EffectiveDC) {
133 if (!visited.insert(DC))
136 addUsingDirectives(DC, EffectiveDC);
139 // Visits a using directive and collects all of its using
140 // directives recursively. Treats all using directives as if they
141 // were declared in the effective DC.
142 void visit(UsingDirectiveDecl *UD, DeclContext *EffectiveDC) {
143 DeclContext *NS = UD->getNominatedNamespace();
144 if (!visited.insert(NS))
147 addUsingDirective(UD, EffectiveDC);
148 addUsingDirectives(NS, EffectiveDC);
151 // Adds all the using directives in a context (and those nominated
152 // by its using directives, transitively) as if they appeared in
153 // the given effective context.
154 void addUsingDirectives(DeclContext *DC, DeclContext *EffectiveDC) {
155 SmallVector<DeclContext*,4> queue;
157 DeclContext::udir_iterator I, End;
158 for (llvm::tie(I, End) = DC->getUsingDirectives(); I != End; ++I) {
159 UsingDirectiveDecl *UD = *I;
160 DeclContext *NS = UD->getNominatedNamespace();
161 if (visited.insert(NS)) {
162 addUsingDirective(UD, EffectiveDC);
175 // Add a using directive as if it had been declared in the given
176 // context. This helps implement C++ [namespace.udir]p3:
177 // The using-directive is transitive: if a scope contains a
178 // using-directive that nominates a second namespace that itself
179 // contains using-directives, the effect is as if the
180 // using-directives from the second namespace also appeared in
182 void addUsingDirective(UsingDirectiveDecl *UD, DeclContext *EffectiveDC) {
183 // Find the common ancestor between the effective context and
184 // the nominated namespace.
185 DeclContext *Common = UD->getNominatedNamespace();
186 while (!Common->Encloses(EffectiveDC))
187 Common = Common->getParent();
188 Common = Common->getPrimaryContext();
190 list.push_back(UnqualUsingEntry(UD->getNominatedNamespace(), Common));
194 std::sort(list.begin(), list.end(), UnqualUsingEntry::Comparator());
197 typedef ListTy::const_iterator const_iterator;
199 const_iterator begin() const { return list.begin(); }
200 const_iterator end() const { return list.end(); }
202 std::pair<const_iterator,const_iterator>
203 getNamespacesFor(DeclContext *DC) const {
204 return std::equal_range(begin(), end(), DC->getPrimaryContext(),
205 UnqualUsingEntry::Comparator());
210 // Retrieve the set of identifier namespaces that correspond to a
211 // specific kind of name lookup.
212 static inline unsigned getIDNS(Sema::LookupNameKind NameKind,
214 bool Redeclaration) {
217 case Sema::LookupObjCImplicitSelfParam:
218 case Sema::LookupOrdinaryName:
219 case Sema::LookupRedeclarationWithLinkage:
220 IDNS = Decl::IDNS_Ordinary;
222 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Member | Decl::IDNS_Namespace;
224 IDNS |= Decl::IDNS_TagFriend | Decl::IDNS_OrdinaryFriend;
228 case Sema::LookupOperatorName:
229 // Operator lookup is its own crazy thing; it is not the same
230 // as (e.g.) looking up an operator name for redeclaration.
231 assert(!Redeclaration && "cannot do redeclaration operator lookup");
232 IDNS = Decl::IDNS_NonMemberOperator;
235 case Sema::LookupTagName:
237 IDNS = Decl::IDNS_Type;
239 // When looking for a redeclaration of a tag name, we add:
240 // 1) TagFriend to find undeclared friend decls
241 // 2) Namespace because they can't "overload" with tag decls.
242 // 3) Tag because it includes class templates, which can't
243 // "overload" with tag decls.
245 IDNS |= Decl::IDNS_Tag | Decl::IDNS_TagFriend | Decl::IDNS_Namespace;
247 IDNS = Decl::IDNS_Tag;
250 case Sema::LookupLabel:
251 IDNS = Decl::IDNS_Label;
254 case Sema::LookupMemberName:
255 IDNS = Decl::IDNS_Member;
257 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Ordinary;
260 case Sema::LookupNestedNameSpecifierName:
261 IDNS = Decl::IDNS_Type | Decl::IDNS_Namespace;
264 case Sema::LookupNamespaceName:
265 IDNS = Decl::IDNS_Namespace;
268 case Sema::LookupUsingDeclName:
269 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag
270 | Decl::IDNS_Member | Decl::IDNS_Using;
273 case Sema::LookupObjCProtocolName:
274 IDNS = Decl::IDNS_ObjCProtocol;
277 case Sema::LookupAnyName:
278 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag | Decl::IDNS_Member
279 | Decl::IDNS_Using | Decl::IDNS_Namespace | Decl::IDNS_ObjCProtocol
286 void LookupResult::configure() {
287 IDNS = getIDNS(LookupKind, SemaRef.getLangOpts().CPlusPlus,
288 isForRedeclaration());
290 if (!isForRedeclaration()) {
291 // If we're looking for one of the allocation or deallocation
292 // operators, make sure that the implicitly-declared new and delete
293 // operators can be found.
294 switch (NameInfo.getName().getCXXOverloadedOperator()) {
298 case OO_Array_Delete:
299 SemaRef.DeclareGlobalNewDelete();
306 // Compiler builtins are always visible, regardless of where they end
307 // up being declared.
308 if (IdentifierInfo *Id = NameInfo.getName().getAsIdentifierInfo()) {
309 if (unsigned BuiltinID = Id->getBuiltinID()) {
310 if (!SemaRef.Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
317 void LookupResult::sanityImpl() const {
318 // Note that this function is never called by NDEBUG builds. See
319 // LookupResult::sanity().
320 assert(ResultKind != NotFound || Decls.size() == 0);
321 assert(ResultKind != Found || Decls.size() == 1);
322 assert(ResultKind != FoundOverloaded || Decls.size() > 1 ||
323 (Decls.size() == 1 &&
324 isa<FunctionTemplateDecl>((*begin())->getUnderlyingDecl())));
325 assert(ResultKind != FoundUnresolvedValue || sanityCheckUnresolved());
326 assert(ResultKind != Ambiguous || Decls.size() > 1 ||
327 (Decls.size() == 1 && (Ambiguity == AmbiguousBaseSubobjects ||
328 Ambiguity == AmbiguousBaseSubobjectTypes)));
329 assert((Paths != NULL) == (ResultKind == Ambiguous &&
330 (Ambiguity == AmbiguousBaseSubobjectTypes ||
331 Ambiguity == AmbiguousBaseSubobjects)));
334 // Necessary because CXXBasePaths is not complete in Sema.h
335 void LookupResult::deletePaths(CXXBasePaths *Paths) {
339 static NamedDecl *getVisibleDecl(NamedDecl *D);
341 NamedDecl *LookupResult::getAcceptableDeclSlow(NamedDecl *D) const {
342 return getVisibleDecl(D);
345 /// Resolves the result kind of this lookup.
346 void LookupResult::resolveKind() {
347 unsigned N = Decls.size();
349 // Fast case: no possible ambiguity.
351 assert(ResultKind == NotFound || ResultKind == NotFoundInCurrentInstantiation);
355 // If there's a single decl, we need to examine it to decide what
356 // kind of lookup this is.
358 NamedDecl *D = (*Decls.begin())->getUnderlyingDecl();
359 if (isa<FunctionTemplateDecl>(D))
360 ResultKind = FoundOverloaded;
361 else if (isa<UnresolvedUsingValueDecl>(D))
362 ResultKind = FoundUnresolvedValue;
366 // Don't do any extra resolution if we've already resolved as ambiguous.
367 if (ResultKind == Ambiguous) return;
369 llvm::SmallPtrSet<NamedDecl*, 16> Unique;
370 llvm::SmallPtrSet<QualType, 16> UniqueTypes;
372 bool Ambiguous = false;
373 bool HasTag = false, HasFunction = false, HasNonFunction = false;
374 bool HasFunctionTemplate = false, HasUnresolved = false;
376 unsigned UniqueTagIndex = 0;
380 NamedDecl *D = Decls[I]->getUnderlyingDecl();
381 D = cast<NamedDecl>(D->getCanonicalDecl());
383 // Ignore an invalid declaration unless it's the only one left.
384 if (D->isInvalidDecl() && I < N-1) {
385 Decls[I] = Decls[--N];
389 // Redeclarations of types via typedef can occur both within a scope
390 // and, through using declarations and directives, across scopes. There is
391 // no ambiguity if they all refer to the same type, so unique based on the
393 if (TypeDecl *TD = dyn_cast<TypeDecl>(D)) {
394 if (!TD->getDeclContext()->isRecord()) {
395 QualType T = SemaRef.Context.getTypeDeclType(TD);
396 if (!UniqueTypes.insert(SemaRef.Context.getCanonicalType(T))) {
397 // The type is not unique; pull something off the back and continue
399 Decls[I] = Decls[--N];
405 if (!Unique.insert(D)) {
406 // If it's not unique, pull something off the back (and
407 // continue at this index).
408 Decls[I] = Decls[--N];
412 // Otherwise, do some decl type analysis and then continue.
414 if (isa<UnresolvedUsingValueDecl>(D)) {
415 HasUnresolved = true;
416 } else if (isa<TagDecl>(D)) {
421 } else if (isa<FunctionTemplateDecl>(D)) {
423 HasFunctionTemplate = true;
424 } else if (isa<FunctionDecl>(D)) {
429 HasNonFunction = true;
434 // C++ [basic.scope.hiding]p2:
435 // A class name or enumeration name can be hidden by the name of
436 // an object, function, or enumerator declared in the same
437 // scope. If a class or enumeration name and an object, function,
438 // or enumerator are declared in the same scope (in any order)
439 // with the same name, the class or enumeration name is hidden
440 // wherever the object, function, or enumerator name is visible.
441 // But it's still an error if there are distinct tag types found,
442 // even if they're not visible. (ref?)
443 if (HideTags && HasTag && !Ambiguous &&
444 (HasFunction || HasNonFunction || HasUnresolved)) {
445 if (Decls[UniqueTagIndex]->getDeclContext()->getRedeclContext()->Equals(
446 Decls[UniqueTagIndex? 0 : N-1]->getDeclContext()->getRedeclContext()))
447 Decls[UniqueTagIndex] = Decls[--N];
454 if (HasNonFunction && (HasFunction || HasUnresolved))
458 setAmbiguous(LookupResult::AmbiguousReference);
459 else if (HasUnresolved)
460 ResultKind = LookupResult::FoundUnresolvedValue;
461 else if (N > 1 || HasFunctionTemplate)
462 ResultKind = LookupResult::FoundOverloaded;
464 ResultKind = LookupResult::Found;
467 void LookupResult::addDeclsFromBasePaths(const CXXBasePaths &P) {
468 CXXBasePaths::const_paths_iterator I, E;
469 for (I = P.begin(), E = P.end(); I != E; ++I)
470 for (DeclContext::lookup_iterator DI = I->Decls.begin(),
471 DE = I->Decls.end(); DI != DE; ++DI)
475 void LookupResult::setAmbiguousBaseSubobjects(CXXBasePaths &P) {
476 Paths = new CXXBasePaths;
478 addDeclsFromBasePaths(*Paths);
480 setAmbiguous(AmbiguousBaseSubobjects);
483 void LookupResult::setAmbiguousBaseSubobjectTypes(CXXBasePaths &P) {
484 Paths = new CXXBasePaths;
486 addDeclsFromBasePaths(*Paths);
488 setAmbiguous(AmbiguousBaseSubobjectTypes);
491 void LookupResult::print(raw_ostream &Out) {
492 Out << Decls.size() << " result(s)";
493 if (isAmbiguous()) Out << ", ambiguous";
494 if (Paths) Out << ", base paths present";
496 for (iterator I = begin(), E = end(); I != E; ++I) {
502 /// \brief Lookup a builtin function, when name lookup would otherwise
504 static bool LookupBuiltin(Sema &S, LookupResult &R) {
505 Sema::LookupNameKind NameKind = R.getLookupKind();
507 // If we didn't find a use of this identifier, and if the identifier
508 // corresponds to a compiler builtin, create the decl object for the builtin
509 // now, injecting it into translation unit scope, and return it.
510 if (NameKind == Sema::LookupOrdinaryName ||
511 NameKind == Sema::LookupRedeclarationWithLinkage) {
512 IdentifierInfo *II = R.getLookupName().getAsIdentifierInfo();
514 // If this is a builtin on this (or all) targets, create the decl.
515 if (unsigned BuiltinID = II->getBuiltinID()) {
516 // In C++, we don't have any predefined library functions like
517 // 'malloc'. Instead, we'll just error.
518 if (S.getLangOpts().CPlusPlus &&
519 S.Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
522 if (NamedDecl *D = S.LazilyCreateBuiltin((IdentifierInfo *)II,
523 BuiltinID, S.TUScope,
524 R.isForRedeclaration(),
530 if (R.isForRedeclaration()) {
531 // If we're redeclaring this function anyway, forget that
532 // this was a builtin at all.
533 S.Context.BuiltinInfo.ForgetBuiltin(BuiltinID, S.Context.Idents);
544 /// \brief Determine whether we can declare a special member function within
545 /// the class at this point.
546 static bool CanDeclareSpecialMemberFunction(const CXXRecordDecl *Class) {
547 // We need to have a definition for the class.
548 if (!Class->getDefinition() || Class->isDependentContext())
551 // We can't be in the middle of defining the class.
552 return !Class->isBeingDefined();
555 void Sema::ForceDeclarationOfImplicitMembers(CXXRecordDecl *Class) {
556 if (!CanDeclareSpecialMemberFunction(Class))
559 // If the default constructor has not yet been declared, do so now.
560 if (Class->needsImplicitDefaultConstructor())
561 DeclareImplicitDefaultConstructor(Class);
563 // If the copy constructor has not yet been declared, do so now.
564 if (Class->needsImplicitCopyConstructor())
565 DeclareImplicitCopyConstructor(Class);
567 // If the copy assignment operator has not yet been declared, do so now.
568 if (Class->needsImplicitCopyAssignment())
569 DeclareImplicitCopyAssignment(Class);
571 if (getLangOpts().CPlusPlus11) {
572 // If the move constructor has not yet been declared, do so now.
573 if (Class->needsImplicitMoveConstructor())
574 DeclareImplicitMoveConstructor(Class); // might not actually do it
576 // If the move assignment operator has not yet been declared, do so now.
577 if (Class->needsImplicitMoveAssignment())
578 DeclareImplicitMoveAssignment(Class); // might not actually do it
581 // If the destructor has not yet been declared, do so now.
582 if (Class->needsImplicitDestructor())
583 DeclareImplicitDestructor(Class);
586 /// \brief Determine whether this is the name of an implicitly-declared
587 /// special member function.
588 static bool isImplicitlyDeclaredMemberFunctionName(DeclarationName Name) {
589 switch (Name.getNameKind()) {
590 case DeclarationName::CXXConstructorName:
591 case DeclarationName::CXXDestructorName:
594 case DeclarationName::CXXOperatorName:
595 return Name.getCXXOverloadedOperator() == OO_Equal;
604 /// \brief If there are any implicit member functions with the given name
605 /// that need to be declared in the given declaration context, do so.
606 static void DeclareImplicitMemberFunctionsWithName(Sema &S,
607 DeclarationName Name,
608 const DeclContext *DC) {
612 switch (Name.getNameKind()) {
613 case DeclarationName::CXXConstructorName:
614 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
615 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
616 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
617 if (Record->needsImplicitDefaultConstructor())
618 S.DeclareImplicitDefaultConstructor(Class);
619 if (Record->needsImplicitCopyConstructor())
620 S.DeclareImplicitCopyConstructor(Class);
621 if (S.getLangOpts().CPlusPlus11 &&
622 Record->needsImplicitMoveConstructor())
623 S.DeclareImplicitMoveConstructor(Class);
627 case DeclarationName::CXXDestructorName:
628 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
629 if (Record->getDefinition() && Record->needsImplicitDestructor() &&
630 CanDeclareSpecialMemberFunction(Record))
631 S.DeclareImplicitDestructor(const_cast<CXXRecordDecl *>(Record));
634 case DeclarationName::CXXOperatorName:
635 if (Name.getCXXOverloadedOperator() != OO_Equal)
638 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC)) {
639 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
640 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
641 if (Record->needsImplicitCopyAssignment())
642 S.DeclareImplicitCopyAssignment(Class);
643 if (S.getLangOpts().CPlusPlus11 &&
644 Record->needsImplicitMoveAssignment())
645 S.DeclareImplicitMoveAssignment(Class);
655 // Adds all qualifying matches for a name within a decl context to the
656 // given lookup result. Returns true if any matches were found.
657 static bool LookupDirect(Sema &S, LookupResult &R, const DeclContext *DC) {
660 // Lazily declare C++ special member functions.
661 if (S.getLangOpts().CPlusPlus)
662 DeclareImplicitMemberFunctionsWithName(S, R.getLookupName(), DC);
664 // Perform lookup into this declaration context.
665 DeclContext::lookup_const_result DR = DC->lookup(R.getLookupName());
666 for (DeclContext::lookup_const_iterator I = DR.begin(), E = DR.end(); I != E;
669 if ((D = R.getAcceptableDecl(D))) {
675 if (!Found && DC->isTranslationUnit() && LookupBuiltin(S, R))
678 if (R.getLookupName().getNameKind()
679 != DeclarationName::CXXConversionFunctionName ||
680 R.getLookupName().getCXXNameType()->isDependentType() ||
681 !isa<CXXRecordDecl>(DC))
685 // A specialization of a conversion function template is not found by
686 // name lookup. Instead, any conversion function templates visible in the
687 // context of the use are considered. [...]
688 const CXXRecordDecl *Record = cast<CXXRecordDecl>(DC);
689 if (!Record->isCompleteDefinition())
692 for (CXXRecordDecl::conversion_iterator U = Record->conversion_begin(),
693 UEnd = Record->conversion_end(); U != UEnd; ++U) {
694 FunctionTemplateDecl *ConvTemplate = dyn_cast<FunctionTemplateDecl>(*U);
698 // When we're performing lookup for the purposes of redeclaration, just
699 // add the conversion function template. When we deduce template
700 // arguments for specializations, we'll end up unifying the return
701 // type of the new declaration with the type of the function template.
702 if (R.isForRedeclaration()) {
703 R.addDecl(ConvTemplate);
709 // [...] For each such operator, if argument deduction succeeds
710 // (14.9.2.3), the resulting specialization is used as if found by
713 // When referencing a conversion function for any purpose other than
714 // a redeclaration (such that we'll be building an expression with the
715 // result), perform template argument deduction and place the
716 // specialization into the result set. We do this to avoid forcing all
717 // callers to perform special deduction for conversion functions.
718 TemplateDeductionInfo Info(R.getNameLoc());
719 FunctionDecl *Specialization = 0;
721 const FunctionProtoType *ConvProto
722 = ConvTemplate->getTemplatedDecl()->getType()->getAs<FunctionProtoType>();
723 assert(ConvProto && "Nonsensical conversion function template type");
725 // Compute the type of the function that we would expect the conversion
726 // function to have, if it were to match the name given.
727 // FIXME: Calling convention!
728 FunctionProtoType::ExtProtoInfo EPI = ConvProto->getExtProtoInfo();
729 EPI.ExtInfo = EPI.ExtInfo.withCallingConv(CC_Default);
730 EPI.ExceptionSpecType = EST_None;
731 EPI.NumExceptions = 0;
732 QualType ExpectedType
733 = R.getSema().Context.getFunctionType(R.getLookupName().getCXXNameType(),
736 // Perform template argument deduction against the type that we would
737 // expect the function to have.
738 if (R.getSema().DeduceTemplateArguments(ConvTemplate, 0, ExpectedType,
739 Specialization, Info)
740 == Sema::TDK_Success) {
741 R.addDecl(Specialization);
749 // Performs C++ unqualified lookup into the given file context.
751 CppNamespaceLookup(Sema &S, LookupResult &R, ASTContext &Context,
752 DeclContext *NS, UnqualUsingDirectiveSet &UDirs) {
754 assert(NS && NS->isFileContext() && "CppNamespaceLookup() requires namespace!");
756 // Perform direct name lookup into the LookupCtx.
757 bool Found = LookupDirect(S, R, NS);
759 // Perform direct name lookup into the namespaces nominated by the
760 // using directives whose common ancestor is this namespace.
761 UnqualUsingDirectiveSet::const_iterator UI, UEnd;
762 llvm::tie(UI, UEnd) = UDirs.getNamespacesFor(NS);
764 for (; UI != UEnd; ++UI)
765 if (LookupDirect(S, R, UI->getNominatedNamespace()))
773 static bool isNamespaceOrTranslationUnitScope(Scope *S) {
774 if (DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity()))
775 return Ctx->isFileContext();
779 // Find the next outer declaration context from this scope. This
780 // routine actually returns the semantic outer context, which may
781 // differ from the lexical context (encoded directly in the Scope
782 // stack) when we are parsing a member of a class template. In this
783 // case, the second element of the pair will be true, to indicate that
784 // name lookup should continue searching in this semantic context when
785 // it leaves the current template parameter scope.
786 static std::pair<DeclContext *, bool> findOuterContext(Scope *S) {
787 DeclContext *DC = static_cast<DeclContext *>(S->getEntity());
788 DeclContext *Lexical = 0;
789 for (Scope *OuterS = S->getParent(); OuterS;
790 OuterS = OuterS->getParent()) {
791 if (OuterS->getEntity()) {
792 Lexical = static_cast<DeclContext *>(OuterS->getEntity());
797 // C++ [temp.local]p8:
798 // In the definition of a member of a class template that appears
799 // outside of the namespace containing the class template
800 // definition, the name of a template-parameter hides the name of
801 // a member of this namespace.
808 // template<class T> class B {
813 // template<class C> void N::B<C>::f(C) {
814 // C b; // C is the template parameter, not N::C
817 // In this example, the lexical context we return is the
818 // TranslationUnit, while the semantic context is the namespace N.
819 if (!Lexical || !DC || !S->getParent() ||
820 !S->getParent()->isTemplateParamScope())
821 return std::make_pair(Lexical, false);
823 // Find the outermost template parameter scope.
824 // For the example, this is the scope for the template parameters of
825 // template<class C>.
826 Scope *OutermostTemplateScope = S->getParent();
827 while (OutermostTemplateScope->getParent() &&
828 OutermostTemplateScope->getParent()->isTemplateParamScope())
829 OutermostTemplateScope = OutermostTemplateScope->getParent();
831 // Find the namespace context in which the original scope occurs. In
832 // the example, this is namespace N.
833 DeclContext *Semantic = DC;
834 while (!Semantic->isFileContext())
835 Semantic = Semantic->getParent();
837 // Find the declaration context just outside of the template
838 // parameter scope. This is the context in which the template is
839 // being lexically declaration (a namespace context). In the
840 // example, this is the global scope.
841 if (Lexical->isFileContext() && !Lexical->Equals(Semantic) &&
842 Lexical->Encloses(Semantic))
843 return std::make_pair(Semantic, true);
845 return std::make_pair(Lexical, false);
848 bool Sema::CppLookupName(LookupResult &R, Scope *S) {
849 assert(getLangOpts().CPlusPlus && "Can perform only C++ lookup");
851 DeclarationName Name = R.getLookupName();
853 // If this is the name of an implicitly-declared special member function,
854 // go through the scope stack to implicitly declare
855 if (isImplicitlyDeclaredMemberFunctionName(Name)) {
856 for (Scope *PreS = S; PreS; PreS = PreS->getParent())
857 if (DeclContext *DC = static_cast<DeclContext *>(PreS->getEntity()))
858 DeclareImplicitMemberFunctionsWithName(*this, Name, DC);
861 // Implicitly declare member functions with the name we're looking for, if in
862 // fact we are in a scope where it matters.
865 IdentifierResolver::iterator
866 I = IdResolver.begin(Name),
867 IEnd = IdResolver.end();
869 // First we lookup local scope.
870 // We don't consider using-directives, as per 7.3.4.p1 [namespace.udir]
871 // ...During unqualified name lookup (3.4.1), the names appear as if
872 // they were declared in the nearest enclosing namespace which contains
873 // both the using-directive and the nominated namespace.
874 // [Note: in this context, "contains" means "contains directly or
878 // namespace A { int i; }
882 // using namespace A;
883 // ++i; // finds local 'i', A::i appears at global scope
887 UnqualUsingDirectiveSet UDirs;
888 bool VisitedUsingDirectives = false;
889 DeclContext *OutsideOfTemplateParamDC = 0;
890 for (; S && !isNamespaceOrTranslationUnitScope(S); S = S->getParent()) {
891 DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity());
893 // Check whether the IdResolver has anything in this scope.
895 for (; I != IEnd && S->isDeclScope(*I); ++I) {
896 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
903 if (S->isClassScope())
904 if (CXXRecordDecl *Record = dyn_cast_or_null<CXXRecordDecl>(Ctx))
905 R.setNamingClass(Record);
909 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
910 S->getParent() && !S->getParent()->isTemplateParamScope()) {
911 // We've just searched the last template parameter scope and
912 // found nothing, so look into the contexts between the
913 // lexical and semantic declaration contexts returned by
914 // findOuterContext(). This implements the name lookup behavior
915 // of C++ [temp.local]p8.
916 Ctx = OutsideOfTemplateParamDC;
917 OutsideOfTemplateParamDC = 0;
921 DeclContext *OuterCtx;
922 bool SearchAfterTemplateScope;
923 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
924 if (SearchAfterTemplateScope)
925 OutsideOfTemplateParamDC = OuterCtx;
927 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
928 // We do not directly look into transparent contexts, since
929 // those entities will be found in the nearest enclosing
930 // non-transparent context.
931 if (Ctx->isTransparentContext())
934 // We do not look directly into function or method contexts,
935 // since all of the local variables and parameters of the
936 // function/method are present within the Scope.
937 if (Ctx->isFunctionOrMethod()) {
938 // If we have an Objective-C instance method, look for ivars
939 // in the corresponding interface.
940 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
941 if (Method->isInstanceMethod() && Name.getAsIdentifierInfo())
942 if (ObjCInterfaceDecl *Class = Method->getClassInterface()) {
943 ObjCInterfaceDecl *ClassDeclared;
944 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(
945 Name.getAsIdentifierInfo(),
947 if (NamedDecl *ND = R.getAcceptableDecl(Ivar)) {
959 // If this is a file context, we need to perform unqualified name
960 // lookup considering using directives.
961 if (Ctx->isFileContext()) {
962 // If we haven't handled using directives yet, do so now.
963 if (!VisitedUsingDirectives) {
964 // Add using directives from this context up to the top level.
965 for (DeclContext *UCtx = Ctx; UCtx; UCtx = UCtx->getParent()) {
966 if (UCtx->isTransparentContext())
969 UDirs.visit(UCtx, UCtx);
972 // Find the innermost file scope, so we can add using directives
973 // from local scopes.
974 Scope *InnermostFileScope = S;
975 while (InnermostFileScope &&
976 !isNamespaceOrTranslationUnitScope(InnermostFileScope))
977 InnermostFileScope = InnermostFileScope->getParent();
978 UDirs.visitScopeChain(Initial, InnermostFileScope);
982 VisitedUsingDirectives = true;
985 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs)) {
993 // Perform qualified name lookup into this context.
994 // FIXME: In some cases, we know that every name that could be found by
995 // this qualified name lookup will also be on the identifier chain. For
996 // example, inside a class without any base classes, we never need to
997 // perform qualified lookup because all of the members are on top of the
999 if (LookupQualifiedName(R, Ctx, /*InUnqualifiedLookup=*/true))
1005 // Stop if we ran out of scopes.
1006 // FIXME: This really, really shouldn't be happening.
1007 if (!S) return false;
1009 // If we are looking for members, no need to look into global/namespace scope.
1010 if (R.getLookupKind() == LookupMemberName)
1013 // Collect UsingDirectiveDecls in all scopes, and recursively all
1014 // nominated namespaces by those using-directives.
1016 // FIXME: Cache this sorted list in Scope structure, and DeclContext, so we
1017 // don't build it for each lookup!
1018 if (!VisitedUsingDirectives) {
1019 UDirs.visitScopeChain(Initial, S);
1023 // Lookup namespace scope, and global scope.
1024 // Unqualified name lookup in C++ requires looking into scopes
1025 // that aren't strictly lexical, and therefore we walk through the
1026 // context as well as walking through the scopes.
1027 for (; S; S = S->getParent()) {
1028 // Check whether the IdResolver has anything in this scope.
1030 for (; I != IEnd && S->isDeclScope(*I); ++I) {
1031 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
1032 // We found something. Look for anything else in our scope
1033 // with this same name and in an acceptable identifier
1034 // namespace, so that we can construct an overload set if we
1041 if (Found && S->isTemplateParamScope()) {
1046 DeclContext *Ctx = static_cast<DeclContext *>(S->getEntity());
1047 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
1048 S->getParent() && !S->getParent()->isTemplateParamScope()) {
1049 // We've just searched the last template parameter scope and
1050 // found nothing, so look into the contexts between the
1051 // lexical and semantic declaration contexts returned by
1052 // findOuterContext(). This implements the name lookup behavior
1053 // of C++ [temp.local]p8.
1054 Ctx = OutsideOfTemplateParamDC;
1055 OutsideOfTemplateParamDC = 0;
1059 DeclContext *OuterCtx;
1060 bool SearchAfterTemplateScope;
1061 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
1062 if (SearchAfterTemplateScope)
1063 OutsideOfTemplateParamDC = OuterCtx;
1065 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
1066 // We do not directly look into transparent contexts, since
1067 // those entities will be found in the nearest enclosing
1068 // non-transparent context.
1069 if (Ctx->isTransparentContext())
1072 // If we have a context, and it's not a context stashed in the
1073 // template parameter scope for an out-of-line definition, also
1074 // look into that context.
1075 if (!(Found && S && S->isTemplateParamScope())) {
1076 assert(Ctx->isFileContext() &&
1077 "We should have been looking only at file context here already.");
1079 // Look into context considering using-directives.
1080 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs))
1089 if (R.isForRedeclaration() && !Ctx->isTransparentContext())
1094 if (R.isForRedeclaration() && Ctx && !Ctx->isTransparentContext())
1101 /// \brief Retrieve the visible declaration corresponding to D, if any.
1103 /// This routine determines whether the declaration D is visible in the current
1104 /// module, with the current imports. If not, it checks whether any
1105 /// redeclaration of D is visible, and if so, returns that declaration.
1107 /// \returns D, or a visible previous declaration of D, whichever is more recent
1108 /// and visible. If no declaration of D is visible, returns null.
1109 static NamedDecl *getVisibleDecl(NamedDecl *D) {
1110 if (LookupResult::isVisible(D))
1113 for (Decl::redecl_iterator RD = D->redecls_begin(), RDEnd = D->redecls_end();
1114 RD != RDEnd; ++RD) {
1115 if (NamedDecl *ND = dyn_cast<NamedDecl>(*RD)) {
1116 if (LookupResult::isVisible(ND))
1124 /// @brief Perform unqualified name lookup starting from a given
1127 /// Unqualified name lookup (C++ [basic.lookup.unqual], C99 6.2.1) is
1128 /// used to find names within the current scope. For example, 'x' in
1132 /// return x; // unqualified name look finds 'x' in the global scope
1136 /// Different lookup criteria can find different names. For example, a
1137 /// particular scope can have both a struct and a function of the same
1138 /// name, and each can be found by certain lookup criteria. For more
1139 /// information about lookup criteria, see the documentation for the
1140 /// class LookupCriteria.
1142 /// @param S The scope from which unqualified name lookup will
1143 /// begin. If the lookup criteria permits, name lookup may also search
1144 /// in the parent scopes.
1146 /// @param [in,out] R Specifies the lookup to perform (e.g., the name to
1147 /// look up and the lookup kind), and is updated with the results of lookup
1148 /// including zero or more declarations and possibly additional information
1149 /// used to diagnose ambiguities.
1151 /// @returns \c true if lookup succeeded and false otherwise.
1152 bool Sema::LookupName(LookupResult &R, Scope *S, bool AllowBuiltinCreation) {
1153 DeclarationName Name = R.getLookupName();
1154 if (!Name) return false;
1156 LookupNameKind NameKind = R.getLookupKind();
1158 if (!getLangOpts().CPlusPlus) {
1159 // Unqualified name lookup in C/Objective-C is purely lexical, so
1160 // search in the declarations attached to the name.
1161 if (NameKind == Sema::LookupRedeclarationWithLinkage) {
1162 // Find the nearest non-transparent declaration scope.
1163 while (!(S->getFlags() & Scope::DeclScope) ||
1165 static_cast<DeclContext *>(S->getEntity())
1166 ->isTransparentContext()))
1170 unsigned IDNS = R.getIdentifierNamespace();
1172 // Scan up the scope chain looking for a decl that matches this
1173 // identifier that is in the appropriate namespace. This search
1174 // should not take long, as shadowing of names is uncommon, and
1175 // deep shadowing is extremely uncommon.
1176 bool LeftStartingScope = false;
1178 for (IdentifierResolver::iterator I = IdResolver.begin(Name),
1179 IEnd = IdResolver.end();
1181 if ((*I)->isInIdentifierNamespace(IDNS)) {
1182 if (NameKind == LookupRedeclarationWithLinkage) {
1183 // Determine whether this (or a previous) declaration is
1185 if (!LeftStartingScope && !S->isDeclScope(*I))
1186 LeftStartingScope = true;
1188 // If we found something outside of our starting scope that
1189 // does not have linkage, skip it.
1190 if (LeftStartingScope && !((*I)->hasLinkage()))
1193 else if (NameKind == LookupObjCImplicitSelfParam &&
1194 !isa<ImplicitParamDecl>(*I))
1197 // If this declaration is module-private and it came from an AST
1198 // file, we can't see it.
1199 NamedDecl *D = R.isHiddenDeclarationVisible()? *I : getVisibleDecl(*I);
1205 // Check whether there are any other declarations with the same name
1206 // and in the same scope.
1208 // Find the scope in which this declaration was declared (if it
1209 // actually exists in a Scope).
1210 while (S && !S->isDeclScope(D))
1213 // If the scope containing the declaration is the translation unit,
1214 // then we'll need to perform our checks based on the matching
1215 // DeclContexts rather than matching scopes.
1216 if (S && isNamespaceOrTranslationUnitScope(S))
1219 // Compute the DeclContext, if we need it.
1220 DeclContext *DC = 0;
1222 DC = (*I)->getDeclContext()->getRedeclContext();
1224 IdentifierResolver::iterator LastI = I;
1225 for (++LastI; LastI != IEnd; ++LastI) {
1227 // Match based on scope.
1228 if (!S->isDeclScope(*LastI))
1231 // Match based on DeclContext.
1233 = (*LastI)->getDeclContext()->getRedeclContext();
1234 if (!LastDC->Equals(DC))
1238 // If the declaration isn't in the right namespace, skip it.
1239 if (!(*LastI)->isInIdentifierNamespace(IDNS))
1242 D = R.isHiddenDeclarationVisible()? *LastI : getVisibleDecl(*LastI);
1252 // Perform C++ unqualified name lookup.
1253 if (CppLookupName(R, S))
1257 // If we didn't find a use of this identifier, and if the identifier
1258 // corresponds to a compiler builtin, create the decl object for the builtin
1259 // now, injecting it into translation unit scope, and return it.
1260 if (AllowBuiltinCreation && LookupBuiltin(*this, R))
1263 // If we didn't find a use of this identifier, the ExternalSource
1264 // may be able to handle the situation.
1265 // Note: some lookup failures are expected!
1266 // See e.g. R.isForRedeclaration().
1267 return (ExternalSource && ExternalSource->LookupUnqualified(R, S));
1270 /// @brief Perform qualified name lookup in the namespaces nominated by
1271 /// using directives by the given context.
1273 /// C++98 [namespace.qual]p2:
1274 /// Given X::m (where X is a user-declared namespace), or given \::m
1275 /// (where X is the global namespace), let S be the set of all
1276 /// declarations of m in X and in the transitive closure of all
1277 /// namespaces nominated by using-directives in X and its used
1278 /// namespaces, except that using-directives are ignored in any
1279 /// namespace, including X, directly containing one or more
1280 /// declarations of m. No namespace is searched more than once in
1281 /// the lookup of a name. If S is the empty set, the program is
1282 /// ill-formed. Otherwise, if S has exactly one member, or if the
1283 /// context of the reference is a using-declaration
1284 /// (namespace.udecl), S is the required set of declarations of
1285 /// m. Otherwise if the use of m is not one that allows a unique
1286 /// declaration to be chosen from S, the program is ill-formed.
1288 /// C++98 [namespace.qual]p5:
1289 /// During the lookup of a qualified namespace member name, if the
1290 /// lookup finds more than one declaration of the member, and if one
1291 /// declaration introduces a class name or enumeration name and the
1292 /// other declarations either introduce the same object, the same
1293 /// enumerator or a set of functions, the non-type name hides the
1294 /// class or enumeration name if and only if the declarations are
1295 /// from the same namespace; otherwise (the declarations are from
1296 /// different namespaces), the program is ill-formed.
1297 static bool LookupQualifiedNameInUsingDirectives(Sema &S, LookupResult &R,
1298 DeclContext *StartDC) {
1299 assert(StartDC->isFileContext() && "start context is not a file context");
1301 DeclContext::udir_iterator I = StartDC->using_directives_begin();
1302 DeclContext::udir_iterator E = StartDC->using_directives_end();
1304 if (I == E) return false;
1306 // We have at least added all these contexts to the queue.
1307 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1308 Visited.insert(StartDC);
1310 // We have not yet looked into these namespaces, much less added
1311 // their "using-children" to the queue.
1312 SmallVector<NamespaceDecl*, 8> Queue;
1314 // We have already looked into the initial namespace; seed the queue
1315 // with its using-children.
1316 for (; I != E; ++I) {
1317 NamespaceDecl *ND = (*I)->getNominatedNamespace()->getOriginalNamespace();
1318 if (Visited.insert(ND))
1319 Queue.push_back(ND);
1322 // The easiest way to implement the restriction in [namespace.qual]p5
1323 // is to check whether any of the individual results found a tag
1324 // and, if so, to declare an ambiguity if the final result is not
1326 bool FoundTag = false;
1327 bool FoundNonTag = false;
1329 LookupResult LocalR(LookupResult::Temporary, R);
1332 while (!Queue.empty()) {
1333 NamespaceDecl *ND = Queue.back();
1336 // We go through some convolutions here to avoid copying results
1337 // between LookupResults.
1338 bool UseLocal = !R.empty();
1339 LookupResult &DirectR = UseLocal ? LocalR : R;
1340 bool FoundDirect = LookupDirect(S, DirectR, ND);
1343 // First do any local hiding.
1344 DirectR.resolveKind();
1346 // If the local result is a tag, remember that.
1347 if (DirectR.isSingleTagDecl())
1352 // Append the local results to the total results if necessary.
1354 R.addAllDecls(LocalR);
1359 // If we find names in this namespace, ignore its using directives.
1365 for (llvm::tie(I,E) = ND->getUsingDirectives(); I != E; ++I) {
1366 NamespaceDecl *Nom = (*I)->getNominatedNamespace();
1367 if (Visited.insert(Nom))
1368 Queue.push_back(Nom);
1373 if (FoundTag && FoundNonTag)
1374 R.setAmbiguousQualifiedTagHiding();
1382 /// \brief Callback that looks for any member of a class with the given name.
1383 static bool LookupAnyMember(const CXXBaseSpecifier *Specifier,
1386 RecordDecl *BaseRecord = Specifier->getType()->getAs<RecordType>()->getDecl();
1388 DeclarationName N = DeclarationName::getFromOpaquePtr(Name);
1389 Path.Decls = BaseRecord->lookup(N);
1390 return !Path.Decls.empty();
1393 /// \brief Determine whether the given set of member declarations contains only
1394 /// static members, nested types, and enumerators.
1395 template<typename InputIterator>
1396 static bool HasOnlyStaticMembers(InputIterator First, InputIterator Last) {
1397 Decl *D = (*First)->getUnderlyingDecl();
1398 if (isa<VarDecl>(D) || isa<TypeDecl>(D) || isa<EnumConstantDecl>(D))
1401 if (isa<CXXMethodDecl>(D)) {
1402 // Determine whether all of the methods are static.
1403 bool AllMethodsAreStatic = true;
1404 for(; First != Last; ++First) {
1405 D = (*First)->getUnderlyingDecl();
1407 if (!isa<CXXMethodDecl>(D)) {
1408 assert(isa<TagDecl>(D) && "Non-function must be a tag decl");
1412 if (!cast<CXXMethodDecl>(D)->isStatic()) {
1413 AllMethodsAreStatic = false;
1418 if (AllMethodsAreStatic)
1425 /// \brief Perform qualified name lookup into a given context.
1427 /// Qualified name lookup (C++ [basic.lookup.qual]) is used to find
1428 /// names when the context of those names is explicit specified, e.g.,
1429 /// "std::vector" or "x->member", or as part of unqualified name lookup.
1431 /// Different lookup criteria can find different names. For example, a
1432 /// particular scope can have both a struct and a function of the same
1433 /// name, and each can be found by certain lookup criteria. For more
1434 /// information about lookup criteria, see the documentation for the
1435 /// class LookupCriteria.
1437 /// \param R captures both the lookup criteria and any lookup results found.
1439 /// \param LookupCtx The context in which qualified name lookup will
1440 /// search. If the lookup criteria permits, name lookup may also search
1441 /// in the parent contexts or (for C++ classes) base classes.
1443 /// \param InUnqualifiedLookup true if this is qualified name lookup that
1444 /// occurs as part of unqualified name lookup.
1446 /// \returns true if lookup succeeded, false if it failed.
1447 bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
1448 bool InUnqualifiedLookup) {
1449 assert(LookupCtx && "Sema::LookupQualifiedName requires a lookup context");
1451 if (!R.getLookupName())
1454 // Make sure that the declaration context is complete.
1455 assert((!isa<TagDecl>(LookupCtx) ||
1456 LookupCtx->isDependentContext() ||
1457 cast<TagDecl>(LookupCtx)->isCompleteDefinition() ||
1458 cast<TagDecl>(LookupCtx)->isBeingDefined()) &&
1459 "Declaration context must already be complete!");
1461 // Perform qualified name lookup into the LookupCtx.
1462 if (LookupDirect(*this, R, LookupCtx)) {
1464 if (isa<CXXRecordDecl>(LookupCtx))
1465 R.setNamingClass(cast<CXXRecordDecl>(LookupCtx));
1469 // Don't descend into implied contexts for redeclarations.
1470 // C++98 [namespace.qual]p6:
1471 // In a declaration for a namespace member in which the
1472 // declarator-id is a qualified-id, given that the qualified-id
1473 // for the namespace member has the form
1474 // nested-name-specifier unqualified-id
1475 // the unqualified-id shall name a member of the namespace
1476 // designated by the nested-name-specifier.
1477 // See also [class.mfct]p5 and [class.static.data]p2.
1478 if (R.isForRedeclaration())
1481 // If this is a namespace, look it up in the implied namespaces.
1482 if (LookupCtx->isFileContext())
1483 return LookupQualifiedNameInUsingDirectives(*this, R, LookupCtx);
1485 // If this isn't a C++ class, we aren't allowed to look into base
1486 // classes, we're done.
1487 CXXRecordDecl *LookupRec = dyn_cast<CXXRecordDecl>(LookupCtx);
1488 if (!LookupRec || !LookupRec->getDefinition())
1491 // If we're performing qualified name lookup into a dependent class,
1492 // then we are actually looking into a current instantiation. If we have any
1493 // dependent base classes, then we either have to delay lookup until
1494 // template instantiation time (at which point all bases will be available)
1495 // or we have to fail.
1496 if (!InUnqualifiedLookup && LookupRec->isDependentContext() &&
1497 LookupRec->hasAnyDependentBases()) {
1498 R.setNotFoundInCurrentInstantiation();
1502 // Perform lookup into our base classes.
1504 Paths.setOrigin(LookupRec);
1506 // Look for this member in our base classes
1507 CXXRecordDecl::BaseMatchesCallback *BaseCallback = 0;
1508 switch (R.getLookupKind()) {
1509 case LookupObjCImplicitSelfParam:
1510 case LookupOrdinaryName:
1511 case LookupMemberName:
1512 case LookupRedeclarationWithLinkage:
1513 BaseCallback = &CXXRecordDecl::FindOrdinaryMember;
1517 BaseCallback = &CXXRecordDecl::FindTagMember;
1521 BaseCallback = &LookupAnyMember;
1524 case LookupUsingDeclName:
1525 // This lookup is for redeclarations only.
1527 case LookupOperatorName:
1528 case LookupNamespaceName:
1529 case LookupObjCProtocolName:
1531 // These lookups will never find a member in a C++ class (or base class).
1534 case LookupNestedNameSpecifierName:
1535 BaseCallback = &CXXRecordDecl::FindNestedNameSpecifierMember;
1539 if (!LookupRec->lookupInBases(BaseCallback,
1540 R.getLookupName().getAsOpaquePtr(), Paths))
1543 R.setNamingClass(LookupRec);
1545 // C++ [class.member.lookup]p2:
1546 // [...] If the resulting set of declarations are not all from
1547 // sub-objects of the same type, or the set has a nonstatic member
1548 // and includes members from distinct sub-objects, there is an
1549 // ambiguity and the program is ill-formed. Otherwise that set is
1550 // the result of the lookup.
1551 QualType SubobjectType;
1552 int SubobjectNumber = 0;
1553 AccessSpecifier SubobjectAccess = AS_none;
1555 for (CXXBasePaths::paths_iterator Path = Paths.begin(), PathEnd = Paths.end();
1556 Path != PathEnd; ++Path) {
1557 const CXXBasePathElement &PathElement = Path->back();
1559 // Pick the best (i.e. most permissive i.e. numerically lowest) access
1560 // across all paths.
1561 SubobjectAccess = std::min(SubobjectAccess, Path->Access);
1563 // Determine whether we're looking at a distinct sub-object or not.
1564 if (SubobjectType.isNull()) {
1565 // This is the first subobject we've looked at. Record its type.
1566 SubobjectType = Context.getCanonicalType(PathElement.Base->getType());
1567 SubobjectNumber = PathElement.SubobjectNumber;
1572 != Context.getCanonicalType(PathElement.Base->getType())) {
1573 // We found members of the given name in two subobjects of
1574 // different types. If the declaration sets aren't the same, this
1575 // this lookup is ambiguous.
1576 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end())) {
1577 CXXBasePaths::paths_iterator FirstPath = Paths.begin();
1578 DeclContext::lookup_iterator FirstD = FirstPath->Decls.begin();
1579 DeclContext::lookup_iterator CurrentD = Path->Decls.begin();
1581 while (FirstD != FirstPath->Decls.end() &&
1582 CurrentD != Path->Decls.end()) {
1583 if ((*FirstD)->getUnderlyingDecl()->getCanonicalDecl() !=
1584 (*CurrentD)->getUnderlyingDecl()->getCanonicalDecl())
1591 if (FirstD == FirstPath->Decls.end() &&
1592 CurrentD == Path->Decls.end())
1596 R.setAmbiguousBaseSubobjectTypes(Paths);
1600 if (SubobjectNumber != PathElement.SubobjectNumber) {
1601 // We have a different subobject of the same type.
1603 // C++ [class.member.lookup]p5:
1604 // A static member, a nested type or an enumerator defined in
1605 // a base class T can unambiguously be found even if an object
1606 // has more than one base class subobject of type T.
1607 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end()))
1610 // We have found a nonstatic member name in multiple, distinct
1611 // subobjects. Name lookup is ambiguous.
1612 R.setAmbiguousBaseSubobjects(Paths);
1617 // Lookup in a base class succeeded; return these results.
1619 DeclContext::lookup_result DR = Paths.front().Decls;
1620 for (DeclContext::lookup_iterator I = DR.begin(), E = DR.end(); I != E; ++I) {
1622 AccessSpecifier AS = CXXRecordDecl::MergeAccess(SubobjectAccess,
1630 /// @brief Performs name lookup for a name that was parsed in the
1631 /// source code, and may contain a C++ scope specifier.
1633 /// This routine is a convenience routine meant to be called from
1634 /// contexts that receive a name and an optional C++ scope specifier
1635 /// (e.g., "N::M::x"). It will then perform either qualified or
1636 /// unqualified name lookup (with LookupQualifiedName or LookupName,
1637 /// respectively) on the given name and return those results.
1639 /// @param S The scope from which unqualified name lookup will
1642 /// @param SS An optional C++ scope-specifier, e.g., "::N::M".
1644 /// @param EnteringContext Indicates whether we are going to enter the
1645 /// context of the scope-specifier SS (if present).
1647 /// @returns True if any decls were found (but possibly ambiguous)
1648 bool Sema::LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
1649 bool AllowBuiltinCreation, bool EnteringContext) {
1650 if (SS && SS->isInvalid()) {
1651 // When the scope specifier is invalid, don't even look for
1656 if (SS && SS->isSet()) {
1657 if (DeclContext *DC = computeDeclContext(*SS, EnteringContext)) {
1658 // We have resolved the scope specifier to a particular declaration
1659 // contex, and will perform name lookup in that context.
1660 if (!DC->isDependentContext() && RequireCompleteDeclContext(*SS, DC))
1663 R.setContextRange(SS->getRange());
1664 return LookupQualifiedName(R, DC);
1667 // We could not resolve the scope specified to a specific declaration
1668 // context, which means that SS refers to an unknown specialization.
1669 // Name lookup can't find anything in this case.
1670 R.setNotFoundInCurrentInstantiation();
1671 R.setContextRange(SS->getRange());
1675 // Perform unqualified name lookup starting in the given scope.
1676 return LookupName(R, S, AllowBuiltinCreation);
1680 /// \brief Produce a diagnostic describing the ambiguity that resulted
1681 /// from name lookup.
1683 /// \param Result The result of the ambiguous lookup to be diagnosed.
1686 bool Sema::DiagnoseAmbiguousLookup(LookupResult &Result) {
1687 assert(Result.isAmbiguous() && "Lookup result must be ambiguous");
1689 DeclarationName Name = Result.getLookupName();
1690 SourceLocation NameLoc = Result.getNameLoc();
1691 SourceRange LookupRange = Result.getContextRange();
1693 switch (Result.getAmbiguityKind()) {
1694 case LookupResult::AmbiguousBaseSubobjects: {
1695 CXXBasePaths *Paths = Result.getBasePaths();
1696 QualType SubobjectType = Paths->front().back().Base->getType();
1697 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobjects)
1698 << Name << SubobjectType << getAmbiguousPathsDisplayString(*Paths)
1701 DeclContext::lookup_iterator Found = Paths->front().Decls.begin();
1702 while (isa<CXXMethodDecl>(*Found) &&
1703 cast<CXXMethodDecl>(*Found)->isStatic())
1706 Diag((*Found)->getLocation(), diag::note_ambiguous_member_found);
1711 case LookupResult::AmbiguousBaseSubobjectTypes: {
1712 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobject_types)
1713 << Name << LookupRange;
1715 CXXBasePaths *Paths = Result.getBasePaths();
1716 std::set<Decl *> DeclsPrinted;
1717 for (CXXBasePaths::paths_iterator Path = Paths->begin(),
1718 PathEnd = Paths->end();
1719 Path != PathEnd; ++Path) {
1720 Decl *D = Path->Decls.front();
1721 if (DeclsPrinted.insert(D).second)
1722 Diag(D->getLocation(), diag::note_ambiguous_member_found);
1728 case LookupResult::AmbiguousTagHiding: {
1729 Diag(NameLoc, diag::err_ambiguous_tag_hiding) << Name << LookupRange;
1731 llvm::SmallPtrSet<NamedDecl*,8> TagDecls;
1733 LookupResult::iterator DI, DE = Result.end();
1734 for (DI = Result.begin(); DI != DE; ++DI)
1735 if (TagDecl *TD = dyn_cast<TagDecl>(*DI)) {
1736 TagDecls.insert(TD);
1737 Diag(TD->getLocation(), diag::note_hidden_tag);
1740 for (DI = Result.begin(); DI != DE; ++DI)
1741 if (!isa<TagDecl>(*DI))
1742 Diag((*DI)->getLocation(), diag::note_hiding_object);
1744 // For recovery purposes, go ahead and implement the hiding.
1745 LookupResult::Filter F = Result.makeFilter();
1746 while (F.hasNext()) {
1747 if (TagDecls.count(F.next()))
1755 case LookupResult::AmbiguousReference: {
1756 Diag(NameLoc, diag::err_ambiguous_reference) << Name << LookupRange;
1758 LookupResult::iterator DI = Result.begin(), DE = Result.end();
1759 for (; DI != DE; ++DI)
1760 Diag((*DI)->getLocation(), diag::note_ambiguous_candidate) << *DI;
1766 llvm_unreachable("unknown ambiguity kind");
1770 struct AssociatedLookup {
1771 AssociatedLookup(Sema &S, SourceLocation InstantiationLoc,
1772 Sema::AssociatedNamespaceSet &Namespaces,
1773 Sema::AssociatedClassSet &Classes)
1774 : S(S), Namespaces(Namespaces), Classes(Classes),
1775 InstantiationLoc(InstantiationLoc) {
1779 Sema::AssociatedNamespaceSet &Namespaces;
1780 Sema::AssociatedClassSet &Classes;
1781 SourceLocation InstantiationLoc;
1786 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType T);
1788 static void CollectEnclosingNamespace(Sema::AssociatedNamespaceSet &Namespaces,
1790 // Add the associated namespace for this class.
1792 // We don't use DeclContext::getEnclosingNamespaceContext() as this may
1793 // be a locally scoped record.
1795 // We skip out of inline namespaces. The innermost non-inline namespace
1796 // contains all names of all its nested inline namespaces anyway, so we can
1797 // replace the entire inline namespace tree with its root.
1798 while (Ctx->isRecord() || Ctx->isTransparentContext() ||
1799 Ctx->isInlineNamespace())
1800 Ctx = Ctx->getParent();
1802 if (Ctx->isFileContext())
1803 Namespaces.insert(Ctx->getPrimaryContext());
1806 // \brief Add the associated classes and namespaces for argument-dependent
1807 // lookup that involves a template argument (C++ [basic.lookup.koenig]p2).
1809 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1810 const TemplateArgument &Arg) {
1811 // C++ [basic.lookup.koenig]p2, last bullet:
1813 switch (Arg.getKind()) {
1814 case TemplateArgument::Null:
1817 case TemplateArgument::Type:
1818 // [...] the namespaces and classes associated with the types of the
1819 // template arguments provided for template type parameters (excluding
1820 // template template parameters)
1821 addAssociatedClassesAndNamespaces(Result, Arg.getAsType());
1824 case TemplateArgument::Template:
1825 case TemplateArgument::TemplateExpansion: {
1826 // [...] the namespaces in which any template template arguments are
1827 // defined; and the classes in which any member templates used as
1828 // template template arguments are defined.
1829 TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
1830 if (ClassTemplateDecl *ClassTemplate
1831 = dyn_cast<ClassTemplateDecl>(Template.getAsTemplateDecl())) {
1832 DeclContext *Ctx = ClassTemplate->getDeclContext();
1833 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
1834 Result.Classes.insert(EnclosingClass);
1835 // Add the associated namespace for this class.
1836 CollectEnclosingNamespace(Result.Namespaces, Ctx);
1841 case TemplateArgument::Declaration:
1842 case TemplateArgument::Integral:
1843 case TemplateArgument::Expression:
1844 case TemplateArgument::NullPtr:
1845 // [Note: non-type template arguments do not contribute to the set of
1846 // associated namespaces. ]
1849 case TemplateArgument::Pack:
1850 for (TemplateArgument::pack_iterator P = Arg.pack_begin(),
1851 PEnd = Arg.pack_end();
1853 addAssociatedClassesAndNamespaces(Result, *P);
1858 // \brief Add the associated classes and namespaces for
1859 // argument-dependent lookup with an argument of class type
1860 // (C++ [basic.lookup.koenig]p2).
1862 addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1863 CXXRecordDecl *Class) {
1865 // Just silently ignore anything whose name is __va_list_tag.
1866 if (Class->getDeclName() == Result.S.VAListTagName)
1869 // C++ [basic.lookup.koenig]p2:
1871 // -- If T is a class type (including unions), its associated
1872 // classes are: the class itself; the class of which it is a
1873 // member, if any; and its direct and indirect base
1874 // classes. Its associated namespaces are the namespaces in
1875 // which its associated classes are defined.
1877 // Add the class of which it is a member, if any.
1878 DeclContext *Ctx = Class->getDeclContext();
1879 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
1880 Result.Classes.insert(EnclosingClass);
1881 // Add the associated namespace for this class.
1882 CollectEnclosingNamespace(Result.Namespaces, Ctx);
1884 // Add the class itself. If we've already seen this class, we don't
1885 // need to visit base classes.
1886 if (!Result.Classes.insert(Class))
1889 // -- If T is a template-id, its associated namespaces and classes are
1890 // the namespace in which the template is defined; for member
1891 // templates, the member template's class; the namespaces and classes
1892 // associated with the types of the template arguments provided for
1893 // template type parameters (excluding template template parameters); the
1894 // namespaces in which any template template arguments are defined; and
1895 // the classes in which any member templates used as template template
1896 // arguments are defined. [Note: non-type template arguments do not
1897 // contribute to the set of associated namespaces. ]
1898 if (ClassTemplateSpecializationDecl *Spec
1899 = dyn_cast<ClassTemplateSpecializationDecl>(Class)) {
1900 DeclContext *Ctx = Spec->getSpecializedTemplate()->getDeclContext();
1901 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
1902 Result.Classes.insert(EnclosingClass);
1903 // Add the associated namespace for this class.
1904 CollectEnclosingNamespace(Result.Namespaces, Ctx);
1906 const TemplateArgumentList &TemplateArgs = Spec->getTemplateArgs();
1907 for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
1908 addAssociatedClassesAndNamespaces(Result, TemplateArgs[I]);
1911 // Only recurse into base classes for complete types.
1912 if (!Class->hasDefinition()) {
1913 QualType type = Result.S.Context.getTypeDeclType(Class);
1914 if (Result.S.RequireCompleteType(Result.InstantiationLoc, type,
1915 /*no diagnostic*/ 0))
1919 // Add direct and indirect base classes along with their associated
1921 SmallVector<CXXRecordDecl *, 32> Bases;
1922 Bases.push_back(Class);
1923 while (!Bases.empty()) {
1924 // Pop this class off the stack.
1925 Class = Bases.back();
1928 // Visit the base classes.
1929 for (CXXRecordDecl::base_class_iterator Base = Class->bases_begin(),
1930 BaseEnd = Class->bases_end();
1931 Base != BaseEnd; ++Base) {
1932 const RecordType *BaseType = Base->getType()->getAs<RecordType>();
1933 // In dependent contexts, we do ADL twice, and the first time around,
1934 // the base type might be a dependent TemplateSpecializationType, or a
1935 // TemplateTypeParmType. If that happens, simply ignore it.
1936 // FIXME: If we want to support export, we probably need to add the
1937 // namespace of the template in a TemplateSpecializationType, or even
1938 // the classes and namespaces of known non-dependent arguments.
1941 CXXRecordDecl *BaseDecl = cast<CXXRecordDecl>(BaseType->getDecl());
1942 if (Result.Classes.insert(BaseDecl)) {
1943 // Find the associated namespace for this base class.
1944 DeclContext *BaseCtx = BaseDecl->getDeclContext();
1945 CollectEnclosingNamespace(Result.Namespaces, BaseCtx);
1947 // Make sure we visit the bases of this base class.
1948 if (BaseDecl->bases_begin() != BaseDecl->bases_end())
1949 Bases.push_back(BaseDecl);
1955 // \brief Add the associated classes and namespaces for
1956 // argument-dependent lookup with an argument of type T
1957 // (C++ [basic.lookup.koenig]p2).
1959 addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType Ty) {
1960 // C++ [basic.lookup.koenig]p2:
1962 // For each argument type T in the function call, there is a set
1963 // of zero or more associated namespaces and a set of zero or more
1964 // associated classes to be considered. The sets of namespaces and
1965 // classes is determined entirely by the types of the function
1966 // arguments (and the namespace of any template template
1967 // argument). Typedef names and using-declarations used to specify
1968 // the types do not contribute to this set. The sets of namespaces
1969 // and classes are determined in the following way:
1971 SmallVector<const Type *, 16> Queue;
1972 const Type *T = Ty->getCanonicalTypeInternal().getTypePtr();
1975 switch (T->getTypeClass()) {
1977 #define TYPE(Class, Base)
1978 #define DEPENDENT_TYPE(Class, Base) case Type::Class:
1979 #define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
1980 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) case Type::Class:
1981 #define ABSTRACT_TYPE(Class, Base)
1982 #include "clang/AST/TypeNodes.def"
1983 // T is canonical. We can also ignore dependent types because
1984 // we don't need to do ADL at the definition point, but if we
1985 // wanted to implement template export (or if we find some other
1986 // use for associated classes and namespaces...) this would be
1990 // -- If T is a pointer to U or an array of U, its associated
1991 // namespaces and classes are those associated with U.
1993 T = cast<PointerType>(T)->getPointeeType().getTypePtr();
1995 case Type::ConstantArray:
1996 case Type::IncompleteArray:
1997 case Type::VariableArray:
1998 T = cast<ArrayType>(T)->getElementType().getTypePtr();
2001 // -- If T is a fundamental type, its associated sets of
2002 // namespaces and classes are both empty.
2006 // -- If T is a class type (including unions), its associated
2007 // classes are: the class itself; the class of which it is a
2008 // member, if any; and its direct and indirect base
2009 // classes. Its associated namespaces are the namespaces in
2010 // which its associated classes are defined.
2011 case Type::Record: {
2012 CXXRecordDecl *Class
2013 = cast<CXXRecordDecl>(cast<RecordType>(T)->getDecl());
2014 addAssociatedClassesAndNamespaces(Result, Class);
2018 // -- If T is an enumeration type, its associated namespace is
2019 // the namespace in which it is defined. If it is class
2020 // member, its associated class is the member's class; else
2021 // it has no associated class.
2023 EnumDecl *Enum = cast<EnumType>(T)->getDecl();
2025 DeclContext *Ctx = Enum->getDeclContext();
2026 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
2027 Result.Classes.insert(EnclosingClass);
2029 // Add the associated namespace for this class.
2030 CollectEnclosingNamespace(Result.Namespaces, Ctx);
2035 // -- If T is a function type, its associated namespaces and
2036 // classes are those associated with the function parameter
2037 // types and those associated with the return type.
2038 case Type::FunctionProto: {
2039 const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
2040 for (FunctionProtoType::arg_type_iterator Arg = Proto->arg_type_begin(),
2041 ArgEnd = Proto->arg_type_end();
2042 Arg != ArgEnd; ++Arg)
2043 Queue.push_back(Arg->getTypePtr());
2046 case Type::FunctionNoProto: {
2047 const FunctionType *FnType = cast<FunctionType>(T);
2048 T = FnType->getResultType().getTypePtr();
2052 // -- If T is a pointer to a member function of a class X, its
2053 // associated namespaces and classes are those associated
2054 // with the function parameter types and return type,
2055 // together with those associated with X.
2057 // -- If T is a pointer to a data member of class X, its
2058 // associated namespaces and classes are those associated
2059 // with the member type together with those associated with
2061 case Type::MemberPointer: {
2062 const MemberPointerType *MemberPtr = cast<MemberPointerType>(T);
2064 // Queue up the class type into which this points.
2065 Queue.push_back(MemberPtr->getClass());
2067 // And directly continue with the pointee type.
2068 T = MemberPtr->getPointeeType().getTypePtr();
2072 // As an extension, treat this like a normal pointer.
2073 case Type::BlockPointer:
2074 T = cast<BlockPointerType>(T)->getPointeeType().getTypePtr();
2077 // References aren't covered by the standard, but that's such an
2078 // obvious defect that we cover them anyway.
2079 case Type::LValueReference:
2080 case Type::RValueReference:
2081 T = cast<ReferenceType>(T)->getPointeeType().getTypePtr();
2084 // These are fundamental types.
2086 case Type::ExtVector:
2090 // Non-deduced auto types only get here for error cases.
2094 // If T is an Objective-C object or interface type, or a pointer to an
2095 // object or interface type, the associated namespace is the global
2097 case Type::ObjCObject:
2098 case Type::ObjCInterface:
2099 case Type::ObjCObjectPointer:
2100 Result.Namespaces.insert(Result.S.Context.getTranslationUnitDecl());
2103 // Atomic types are just wrappers; use the associations of the
2106 T = cast<AtomicType>(T)->getValueType().getTypePtr();
2110 if (Queue.empty()) break;
2116 /// \brief Find the associated classes and namespaces for
2117 /// argument-dependent lookup for a call with the given set of
2120 /// This routine computes the sets of associated classes and associated
2121 /// namespaces searched by argument-dependent lookup
2122 /// (C++ [basic.lookup.argdep]) for a given set of arguments.
2124 Sema::FindAssociatedClassesAndNamespaces(SourceLocation InstantiationLoc,
2125 llvm::ArrayRef<Expr *> Args,
2126 AssociatedNamespaceSet &AssociatedNamespaces,
2127 AssociatedClassSet &AssociatedClasses) {
2128 AssociatedNamespaces.clear();
2129 AssociatedClasses.clear();
2131 AssociatedLookup Result(*this, InstantiationLoc,
2132 AssociatedNamespaces, AssociatedClasses);
2134 // C++ [basic.lookup.koenig]p2:
2135 // For each argument type T in the function call, there is a set
2136 // of zero or more associated namespaces and a set of zero or more
2137 // associated classes to be considered. The sets of namespaces and
2138 // classes is determined entirely by the types of the function
2139 // arguments (and the namespace of any template template
2141 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
2142 Expr *Arg = Args[ArgIdx];
2144 if (Arg->getType() != Context.OverloadTy) {
2145 addAssociatedClassesAndNamespaces(Result, Arg->getType());
2149 // [...] In addition, if the argument is the name or address of a
2150 // set of overloaded functions and/or function templates, its
2151 // associated classes and namespaces are the union of those
2152 // associated with each of the members of the set: the namespace
2153 // in which the function or function template is defined and the
2154 // classes and namespaces associated with its (non-dependent)
2155 // parameter types and return type.
2156 Arg = Arg->IgnoreParens();
2157 if (UnaryOperator *unaryOp = dyn_cast<UnaryOperator>(Arg))
2158 if (unaryOp->getOpcode() == UO_AddrOf)
2159 Arg = unaryOp->getSubExpr();
2161 UnresolvedLookupExpr *ULE = dyn_cast<UnresolvedLookupExpr>(Arg);
2164 for (UnresolvedSetIterator I = ULE->decls_begin(), E = ULE->decls_end();
2166 // Look through any using declarations to find the underlying function.
2167 NamedDecl *Fn = (*I)->getUnderlyingDecl();
2169 FunctionDecl *FDecl = dyn_cast<FunctionDecl>(Fn);
2171 FDecl = cast<FunctionTemplateDecl>(Fn)->getTemplatedDecl();
2173 // Add the classes and namespaces associated with the parameter
2174 // types and return type of this function.
2175 addAssociatedClassesAndNamespaces(Result, FDecl->getType());
2180 /// IsAcceptableNonMemberOperatorCandidate - Determine whether Fn is
2181 /// an acceptable non-member overloaded operator for a call whose
2182 /// arguments have types T1 (and, if non-empty, T2). This routine
2183 /// implements the check in C++ [over.match.oper]p3b2 concerning
2184 /// enumeration types.
2186 IsAcceptableNonMemberOperatorCandidate(FunctionDecl *Fn,
2187 QualType T1, QualType T2,
2188 ASTContext &Context) {
2189 if (T1->isDependentType() || (!T2.isNull() && T2->isDependentType()))
2192 if (T1->isRecordType() || (!T2.isNull() && T2->isRecordType()))
2195 const FunctionProtoType *Proto = Fn->getType()->getAs<FunctionProtoType>();
2196 if (Proto->getNumArgs() < 1)
2199 if (T1->isEnumeralType()) {
2200 QualType ArgType = Proto->getArgType(0).getNonReferenceType();
2201 if (Context.hasSameUnqualifiedType(T1, ArgType))
2205 if (Proto->getNumArgs() < 2)
2208 if (!T2.isNull() && T2->isEnumeralType()) {
2209 QualType ArgType = Proto->getArgType(1).getNonReferenceType();
2210 if (Context.hasSameUnqualifiedType(T2, ArgType))
2217 NamedDecl *Sema::LookupSingleName(Scope *S, DeclarationName Name,
2219 LookupNameKind NameKind,
2220 RedeclarationKind Redecl) {
2221 LookupResult R(*this, Name, Loc, NameKind, Redecl);
2223 return R.getAsSingle<NamedDecl>();
2226 /// \brief Find the protocol with the given name, if any.
2227 ObjCProtocolDecl *Sema::LookupProtocol(IdentifierInfo *II,
2228 SourceLocation IdLoc,
2229 RedeclarationKind Redecl) {
2230 Decl *D = LookupSingleName(TUScope, II, IdLoc,
2231 LookupObjCProtocolName, Redecl);
2232 return cast_or_null<ObjCProtocolDecl>(D);
2235 void Sema::LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
2236 QualType T1, QualType T2,
2237 UnresolvedSetImpl &Functions) {
2238 // C++ [over.match.oper]p3:
2239 // -- The set of non-member candidates is the result of the
2240 // unqualified lookup of operator@ in the context of the
2241 // expression according to the usual rules for name lookup in
2242 // unqualified function calls (3.4.2) except that all member
2243 // functions are ignored. However, if no operand has a class
2244 // type, only those non-member functions in the lookup set
2245 // that have a first parameter of type T1 or "reference to
2246 // (possibly cv-qualified) T1", when T1 is an enumeration
2247 // type, or (if there is a right operand) a second parameter
2248 // of type T2 or "reference to (possibly cv-qualified) T2",
2249 // when T2 is an enumeration type, are candidate functions.
2250 DeclarationName OpName = Context.DeclarationNames.getCXXOperatorName(Op);
2251 LookupResult Operators(*this, OpName, SourceLocation(), LookupOperatorName);
2252 LookupName(Operators, S);
2254 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
2256 if (Operators.empty())
2259 for (LookupResult::iterator Op = Operators.begin(), OpEnd = Operators.end();
2260 Op != OpEnd; ++Op) {
2261 NamedDecl *Found = (*Op)->getUnderlyingDecl();
2262 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Found)) {
2263 if (IsAcceptableNonMemberOperatorCandidate(FD, T1, T2, Context))
2264 Functions.addDecl(*Op, Op.getAccess()); // FIXME: canonical FD
2265 } else if (FunctionTemplateDecl *FunTmpl
2266 = dyn_cast<FunctionTemplateDecl>(Found)) {
2267 // FIXME: friend operators?
2268 // FIXME: do we need to check IsAcceptableNonMemberOperatorCandidate,
2270 if (!FunTmpl->getDeclContext()->isRecord())
2271 Functions.addDecl(*Op, Op.getAccess());
2276 Sema::SpecialMemberOverloadResult *Sema::LookupSpecialMember(CXXRecordDecl *RD,
2277 CXXSpecialMember SM,
2282 bool VolatileThis) {
2283 assert(CanDeclareSpecialMemberFunction(RD) &&
2284 "doing special member lookup into record that isn't fully complete");
2285 RD = RD->getDefinition();
2286 if (RValueThis || ConstThis || VolatileThis)
2287 assert((SM == CXXCopyAssignment || SM == CXXMoveAssignment) &&
2288 "constructors and destructors always have unqualified lvalue this");
2289 if (ConstArg || VolatileArg)
2290 assert((SM != CXXDefaultConstructor && SM != CXXDestructor) &&
2291 "parameter-less special members can't have qualified arguments");
2293 llvm::FoldingSetNodeID ID;
2296 ID.AddInteger(ConstArg);
2297 ID.AddInteger(VolatileArg);
2298 ID.AddInteger(RValueThis);
2299 ID.AddInteger(ConstThis);
2300 ID.AddInteger(VolatileThis);
2303 SpecialMemberOverloadResult *Result =
2304 SpecialMemberCache.FindNodeOrInsertPos(ID, InsertPoint);
2306 // This was already cached
2310 Result = BumpAlloc.Allocate<SpecialMemberOverloadResult>();
2311 Result = new (Result) SpecialMemberOverloadResult(ID);
2312 SpecialMemberCache.InsertNode(Result, InsertPoint);
2314 if (SM == CXXDestructor) {
2315 if (RD->needsImplicitDestructor())
2316 DeclareImplicitDestructor(RD);
2317 CXXDestructorDecl *DD = RD->getDestructor();
2318 assert(DD && "record without a destructor");
2319 Result->setMethod(DD);
2320 Result->setKind(DD->isDeleted() ?
2321 SpecialMemberOverloadResult::NoMemberOrDeleted :
2322 SpecialMemberOverloadResult::Success);
2326 // Prepare for overload resolution. Here we construct a synthetic argument
2327 // if necessary and make sure that implicit functions are declared.
2328 CanQualType CanTy = Context.getCanonicalType(Context.getTagDeclType(RD));
2329 DeclarationName Name;
2333 QualType ArgType = CanTy;
2334 ExprValueKind VK = VK_LValue;
2336 if (SM == CXXDefaultConstructor) {
2337 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2339 if (RD->needsImplicitDefaultConstructor())
2340 DeclareImplicitDefaultConstructor(RD);
2342 if (SM == CXXCopyConstructor || SM == CXXMoveConstructor) {
2343 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2344 if (RD->needsImplicitCopyConstructor())
2345 DeclareImplicitCopyConstructor(RD);
2346 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveConstructor())
2347 DeclareImplicitMoveConstructor(RD);
2349 Name = Context.DeclarationNames.getCXXOperatorName(OO_Equal);
2350 if (RD->needsImplicitCopyAssignment())
2351 DeclareImplicitCopyAssignment(RD);
2352 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveAssignment())
2353 DeclareImplicitMoveAssignment(RD);
2359 ArgType.addVolatile();
2361 // This isn't /really/ specified by the standard, but it's implied
2362 // we should be working from an RValue in the case of move to ensure
2363 // that we prefer to bind to rvalue references, and an LValue in the
2364 // case of copy to ensure we don't bind to rvalue references.
2365 // Possibly an XValue is actually correct in the case of move, but
2366 // there is no semantic difference for class types in this restricted
2368 if (SM == CXXCopyConstructor || SM == CXXCopyAssignment)
2374 OpaqueValueExpr FakeArg(SourceLocation(), ArgType, VK);
2376 if (SM != CXXDefaultConstructor) {
2381 // Create the object argument
2382 QualType ThisTy = CanTy;
2386 ThisTy.addVolatile();
2387 Expr::Classification Classification =
2388 OpaqueValueExpr(SourceLocation(), ThisTy,
2389 RValueThis ? VK_RValue : VK_LValue).Classify(Context);
2391 // Now we perform lookup on the name we computed earlier and do overload
2392 // resolution. Lookup is only performed directly into the class since there
2393 // will always be a (possibly implicit) declaration to shadow any others.
2394 OverloadCandidateSet OCS((SourceLocation()));
2395 DeclContext::lookup_result R = RD->lookup(Name);
2397 assert(!R.empty() &&
2398 "lookup for a constructor or assignment operator was empty");
2399 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E; ++I) {
2402 if (Cand->isInvalidDecl())
2405 if (UsingShadowDecl *U = dyn_cast<UsingShadowDecl>(Cand)) {
2406 // FIXME: [namespace.udecl]p15 says that we should only consider a
2407 // using declaration here if it does not match a declaration in the
2408 // derived class. We do not implement this correctly in other cases
2410 Cand = U->getTargetDecl();
2412 if (Cand->isInvalidDecl())
2416 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand)) {
2417 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2418 AddMethodCandidate(M, DeclAccessPair::make(M, AS_public), RD, ThisTy,
2419 Classification, llvm::makeArrayRef(&Arg, NumArgs),
2422 AddOverloadCandidate(M, DeclAccessPair::make(M, AS_public),
2423 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
2424 } else if (FunctionTemplateDecl *Tmpl =
2425 dyn_cast<FunctionTemplateDecl>(Cand)) {
2426 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2427 AddMethodTemplateCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
2428 RD, 0, ThisTy, Classification,
2429 llvm::makeArrayRef(&Arg, NumArgs),
2432 AddTemplateOverloadCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
2433 0, llvm::makeArrayRef(&Arg, NumArgs),
2436 assert(isa<UsingDecl>(Cand) && "illegal Kind of operator = Decl");
2440 OverloadCandidateSet::iterator Best;
2441 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2443 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2444 Result->setKind(SpecialMemberOverloadResult::Success);
2448 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2449 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2453 Result->setMethod(0);
2454 Result->setKind(SpecialMemberOverloadResult::Ambiguous);
2457 case OR_No_Viable_Function:
2458 Result->setMethod(0);
2459 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
2466 /// \brief Look up the default constructor for the given class.
2467 CXXConstructorDecl *Sema::LookupDefaultConstructor(CXXRecordDecl *Class) {
2468 SpecialMemberOverloadResult *Result =
2469 LookupSpecialMember(Class, CXXDefaultConstructor, false, false, false,
2472 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2475 /// \brief Look up the copying constructor for the given class.
2476 CXXConstructorDecl *Sema::LookupCopyingConstructor(CXXRecordDecl *Class,
2478 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2479 "non-const, non-volatile qualifiers for copy ctor arg");
2480 SpecialMemberOverloadResult *Result =
2481 LookupSpecialMember(Class, CXXCopyConstructor, Quals & Qualifiers::Const,
2482 Quals & Qualifiers::Volatile, false, false, false);
2484 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2487 /// \brief Look up the moving constructor for the given class.
2488 CXXConstructorDecl *Sema::LookupMovingConstructor(CXXRecordDecl *Class,
2490 SpecialMemberOverloadResult *Result =
2491 LookupSpecialMember(Class, CXXMoveConstructor, Quals & Qualifiers::Const,
2492 Quals & Qualifiers::Volatile, false, false, false);
2494 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2497 /// \brief Look up the constructors for the given class.
2498 DeclContext::lookup_result Sema::LookupConstructors(CXXRecordDecl *Class) {
2499 // If the implicit constructors have not yet been declared, do so now.
2500 if (CanDeclareSpecialMemberFunction(Class)) {
2501 if (Class->needsImplicitDefaultConstructor())
2502 DeclareImplicitDefaultConstructor(Class);
2503 if (Class->needsImplicitCopyConstructor())
2504 DeclareImplicitCopyConstructor(Class);
2505 if (getLangOpts().CPlusPlus11 && Class->needsImplicitMoveConstructor())
2506 DeclareImplicitMoveConstructor(Class);
2509 CanQualType T = Context.getCanonicalType(Context.getTypeDeclType(Class));
2510 DeclarationName Name = Context.DeclarationNames.getCXXConstructorName(T);
2511 return Class->lookup(Name);
2514 /// \brief Look up the copying assignment operator for the given class.
2515 CXXMethodDecl *Sema::LookupCopyingAssignment(CXXRecordDecl *Class,
2516 unsigned Quals, bool RValueThis,
2517 unsigned ThisQuals) {
2518 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2519 "non-const, non-volatile qualifiers for copy assignment arg");
2520 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2521 "non-const, non-volatile qualifiers for copy assignment this");
2522 SpecialMemberOverloadResult *Result =
2523 LookupSpecialMember(Class, CXXCopyAssignment, Quals & Qualifiers::Const,
2524 Quals & Qualifiers::Volatile, RValueThis,
2525 ThisQuals & Qualifiers::Const,
2526 ThisQuals & Qualifiers::Volatile);
2528 return Result->getMethod();
2531 /// \brief Look up the moving assignment operator for the given class.
2532 CXXMethodDecl *Sema::LookupMovingAssignment(CXXRecordDecl *Class,
2535 unsigned ThisQuals) {
2536 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2537 "non-const, non-volatile qualifiers for copy assignment this");
2538 SpecialMemberOverloadResult *Result =
2539 LookupSpecialMember(Class, CXXMoveAssignment, Quals & Qualifiers::Const,
2540 Quals & Qualifiers::Volatile, RValueThis,
2541 ThisQuals & Qualifiers::Const,
2542 ThisQuals & Qualifiers::Volatile);
2544 return Result->getMethod();
2547 /// \brief Look for the destructor of the given class.
2549 /// During semantic analysis, this routine should be used in lieu of
2550 /// CXXRecordDecl::getDestructor().
2552 /// \returns The destructor for this class.
2553 CXXDestructorDecl *Sema::LookupDestructor(CXXRecordDecl *Class) {
2554 return cast<CXXDestructorDecl>(LookupSpecialMember(Class, CXXDestructor,
2555 false, false, false,
2556 false, false)->getMethod());
2559 /// LookupLiteralOperator - Determine which literal operator should be used for
2560 /// a user-defined literal, per C++11 [lex.ext].
2562 /// Normal overload resolution is not used to select which literal operator to
2563 /// call for a user-defined literal. Look up the provided literal operator name,
2564 /// and filter the results to the appropriate set for the given argument types.
2565 Sema::LiteralOperatorLookupResult
2566 Sema::LookupLiteralOperator(Scope *S, LookupResult &R,
2567 ArrayRef<QualType> ArgTys,
2568 bool AllowRawAndTemplate) {
2570 assert(R.getResultKind() != LookupResult::Ambiguous &&
2571 "literal operator lookup can't be ambiguous");
2573 // Filter the lookup results appropriately.
2574 LookupResult::Filter F = R.makeFilter();
2576 bool FoundTemplate = false;
2577 bool FoundRaw = false;
2578 bool FoundExactMatch = false;
2580 while (F.hasNext()) {
2582 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2583 D = USD->getTargetDecl();
2585 bool IsTemplate = isa<FunctionTemplateDecl>(D);
2587 bool IsExactMatch = false;
2589 // If the declaration we found is invalid, skip it.
2590 if (D->isInvalidDecl()) {
2595 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
2596 if (FD->getNumParams() == 1 &&
2597 FD->getParamDecl(0)->getType()->getAs<PointerType>())
2599 else if (FD->getNumParams() == ArgTys.size()) {
2600 IsExactMatch = true;
2601 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
2602 QualType ParamTy = FD->getParamDecl(ArgIdx)->getType();
2603 if (!Context.hasSameUnqualifiedType(ArgTys[ArgIdx], ParamTy)) {
2604 IsExactMatch = false;
2612 FoundExactMatch = true;
2613 AllowRawAndTemplate = false;
2614 if (FoundRaw || FoundTemplate) {
2615 // Go through again and remove the raw and template decls we've
2618 FoundRaw = FoundTemplate = false;
2620 } else if (AllowRawAndTemplate && (IsTemplate || IsRaw)) {
2621 FoundTemplate |= IsTemplate;
2630 // C++11 [lex.ext]p3, p4: If S contains a literal operator with a matching
2631 // parameter type, that is used in preference to a raw literal operator
2632 // or literal operator template.
2633 if (FoundExactMatch)
2636 // C++11 [lex.ext]p3, p4: S shall contain a raw literal operator or a literal
2637 // operator template, but not both.
2638 if (FoundRaw && FoundTemplate) {
2639 Diag(R.getNameLoc(), diag::err_ovl_ambiguous_call) << R.getLookupName();
2640 for (LookupResult::iterator I = R.begin(), E = R.end(); I != E; ++I) {
2642 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2643 D = USD->getTargetDecl();
2644 if (FunctionTemplateDecl *FunTmpl = dyn_cast<FunctionTemplateDecl>(D))
2645 D = FunTmpl->getTemplatedDecl();
2646 NoteOverloadCandidate(cast<FunctionDecl>(D));
2655 return LOLR_Template;
2657 // Didn't find anything we could use.
2658 Diag(R.getNameLoc(), diag::err_ovl_no_viable_literal_operator)
2659 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
2660 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRawAndTemplate;
2664 void ADLResult::insert(NamedDecl *New) {
2665 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
2667 // If we haven't yet seen a decl for this key, or the last decl
2668 // was exactly this one, we're done.
2669 if (Old == 0 || Old == New) {
2674 // Otherwise, decide which is a more recent redeclaration.
2675 FunctionDecl *OldFD, *NewFD;
2676 if (isa<FunctionTemplateDecl>(New)) {
2677 OldFD = cast<FunctionTemplateDecl>(Old)->getTemplatedDecl();
2678 NewFD = cast<FunctionTemplateDecl>(New)->getTemplatedDecl();
2680 OldFD = cast<FunctionDecl>(Old);
2681 NewFD = cast<FunctionDecl>(New);
2684 FunctionDecl *Cursor = NewFD;
2686 Cursor = Cursor->getPreviousDecl();
2688 // If we got to the end without finding OldFD, OldFD is the newer
2689 // declaration; leave things as they are.
2690 if (!Cursor) return;
2692 // If we do find OldFD, then NewFD is newer.
2693 if (Cursor == OldFD) break;
2695 // Otherwise, keep looking.
2701 void Sema::ArgumentDependentLookup(DeclarationName Name, bool Operator,
2703 llvm::ArrayRef<Expr *> Args,
2704 ADLResult &Result) {
2705 // Find all of the associated namespaces and classes based on the
2706 // arguments we have.
2707 AssociatedNamespaceSet AssociatedNamespaces;
2708 AssociatedClassSet AssociatedClasses;
2709 FindAssociatedClassesAndNamespaces(Loc, Args,
2710 AssociatedNamespaces,
2715 T1 = Args[0]->getType();
2716 if (Args.size() >= 2)
2717 T2 = Args[1]->getType();
2720 // C++ [basic.lookup.argdep]p3:
2721 // Let X be the lookup set produced by unqualified lookup (3.4.1)
2722 // and let Y be the lookup set produced by argument dependent
2723 // lookup (defined as follows). If X contains [...] then Y is
2724 // empty. Otherwise Y is the set of declarations found in the
2725 // namespaces associated with the argument types as described
2726 // below. The set of declarations found by the lookup of the name
2727 // is the union of X and Y.
2729 // Here, we compute Y and add its members to the overloaded
2731 for (AssociatedNamespaceSet::iterator NS = AssociatedNamespaces.begin(),
2732 NSEnd = AssociatedNamespaces.end();
2733 NS != NSEnd; ++NS) {
2734 // When considering an associated namespace, the lookup is the
2735 // same as the lookup performed when the associated namespace is
2736 // used as a qualifier (3.4.3.2) except that:
2738 // -- Any using-directives in the associated namespace are
2741 // -- Any namespace-scope friend functions declared in
2742 // associated classes are visible within their respective
2743 // namespaces even if they are not visible during an ordinary
2745 DeclContext::lookup_result R = (*NS)->lookup(Name);
2746 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
2749 // If the only declaration here is an ordinary friend, consider
2750 // it only if it was declared in an associated classes.
2751 if (D->getIdentifierNamespace() == Decl::IDNS_OrdinaryFriend) {
2752 DeclContext *LexDC = D->getLexicalDeclContext();
2753 if (!AssociatedClasses.count(cast<CXXRecordDecl>(LexDC)))
2757 if (isa<UsingShadowDecl>(D))
2758 D = cast<UsingShadowDecl>(D)->getTargetDecl();
2760 if (isa<FunctionDecl>(D)) {
2762 !IsAcceptableNonMemberOperatorCandidate(cast<FunctionDecl>(D),
2765 } else if (!isa<FunctionTemplateDecl>(D))
2773 //----------------------------------------------------------------------------
2774 // Search for all visible declarations.
2775 //----------------------------------------------------------------------------
2776 VisibleDeclConsumer::~VisibleDeclConsumer() { }
2780 class ShadowContextRAII;
2782 class VisibleDeclsRecord {
2784 /// \brief An entry in the shadow map, which is optimized to store a
2785 /// single declaration (the common case) but can also store a list
2786 /// of declarations.
2787 typedef llvm::TinyPtrVector<NamedDecl*> ShadowMapEntry;
2790 /// \brief A mapping from declaration names to the declarations that have
2791 /// this name within a particular scope.
2792 typedef llvm::DenseMap<DeclarationName, ShadowMapEntry> ShadowMap;
2794 /// \brief A list of shadow maps, which is used to model name hiding.
2795 std::list<ShadowMap> ShadowMaps;
2797 /// \brief The declaration contexts we have already visited.
2798 llvm::SmallPtrSet<DeclContext *, 8> VisitedContexts;
2800 friend class ShadowContextRAII;
2803 /// \brief Determine whether we have already visited this context
2804 /// (and, if not, note that we are going to visit that context now).
2805 bool visitedContext(DeclContext *Ctx) {
2806 return !VisitedContexts.insert(Ctx);
2809 bool alreadyVisitedContext(DeclContext *Ctx) {
2810 return VisitedContexts.count(Ctx);
2813 /// \brief Determine whether the given declaration is hidden in the
2816 /// \returns the declaration that hides the given declaration, or
2817 /// NULL if no such declaration exists.
2818 NamedDecl *checkHidden(NamedDecl *ND);
2820 /// \brief Add a declaration to the current shadow map.
2821 void add(NamedDecl *ND) {
2822 ShadowMaps.back()[ND->getDeclName()].push_back(ND);
2826 /// \brief RAII object that records when we've entered a shadow context.
2827 class ShadowContextRAII {
2828 VisibleDeclsRecord &Visible;
2830 typedef VisibleDeclsRecord::ShadowMap ShadowMap;
2833 ShadowContextRAII(VisibleDeclsRecord &Visible) : Visible(Visible) {
2834 Visible.ShadowMaps.push_back(ShadowMap());
2837 ~ShadowContextRAII() {
2838 Visible.ShadowMaps.pop_back();
2842 } // end anonymous namespace
2844 NamedDecl *VisibleDeclsRecord::checkHidden(NamedDecl *ND) {
2845 // Look through using declarations.
2846 ND = ND->getUnderlyingDecl();
2848 unsigned IDNS = ND->getIdentifierNamespace();
2849 std::list<ShadowMap>::reverse_iterator SM = ShadowMaps.rbegin();
2850 for (std::list<ShadowMap>::reverse_iterator SMEnd = ShadowMaps.rend();
2851 SM != SMEnd; ++SM) {
2852 ShadowMap::iterator Pos = SM->find(ND->getDeclName());
2853 if (Pos == SM->end())
2856 for (ShadowMapEntry::iterator I = Pos->second.begin(),
2857 IEnd = Pos->second.end();
2859 // A tag declaration does not hide a non-tag declaration.
2860 if ((*I)->hasTagIdentifierNamespace() &&
2861 (IDNS & (Decl::IDNS_Member | Decl::IDNS_Ordinary |
2862 Decl::IDNS_ObjCProtocol)))
2865 // Protocols are in distinct namespaces from everything else.
2866 if ((((*I)->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol)
2867 || (IDNS & Decl::IDNS_ObjCProtocol)) &&
2868 (*I)->getIdentifierNamespace() != IDNS)
2871 // Functions and function templates in the same scope overload
2872 // rather than hide. FIXME: Look for hiding based on function
2874 if ((*I)->isFunctionOrFunctionTemplate() &&
2875 ND->isFunctionOrFunctionTemplate() &&
2876 SM == ShadowMaps.rbegin())
2879 // We've found a declaration that hides this one.
2887 static void LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result,
2888 bool QualifiedNameLookup,
2890 VisibleDeclConsumer &Consumer,
2891 VisibleDeclsRecord &Visited) {
2895 // Make sure we don't visit the same context twice.
2896 if (Visited.visitedContext(Ctx->getPrimaryContext()))
2899 if (CXXRecordDecl *Class = dyn_cast<CXXRecordDecl>(Ctx))
2900 Result.getSema().ForceDeclarationOfImplicitMembers(Class);
2902 // Enumerate all of the results in this context.
2903 for (DeclContext::all_lookups_iterator L = Ctx->lookups_begin(),
2904 LEnd = Ctx->lookups_end();
2906 DeclContext::lookup_result R = *L;
2907 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
2909 if (NamedDecl *ND = dyn_cast<NamedDecl>(*I)) {
2910 if ((ND = Result.getAcceptableDecl(ND))) {
2911 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
2918 // Traverse using directives for qualified name lookup.
2919 if (QualifiedNameLookup) {
2920 ShadowContextRAII Shadow(Visited);
2921 DeclContext::udir_iterator I, E;
2922 for (llvm::tie(I, E) = Ctx->getUsingDirectives(); I != E; ++I) {
2923 LookupVisibleDecls((*I)->getNominatedNamespace(), Result,
2924 QualifiedNameLookup, InBaseClass, Consumer, Visited);
2928 // Traverse the contexts of inherited C++ classes.
2929 if (CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(Ctx)) {
2930 if (!Record->hasDefinition())
2933 for (CXXRecordDecl::base_class_iterator B = Record->bases_begin(),
2934 BEnd = Record->bases_end();
2936 QualType BaseType = B->getType();
2938 // Don't look into dependent bases, because name lookup can't look
2940 if (BaseType->isDependentType())
2943 const RecordType *Record = BaseType->getAs<RecordType>();
2947 // FIXME: It would be nice to be able to determine whether referencing
2948 // a particular member would be ambiguous. For example, given
2950 // struct A { int member; };
2951 // struct B { int member; };
2952 // struct C : A, B { };
2954 // void f(C *c) { c->### }
2956 // accessing 'member' would result in an ambiguity. However, we
2957 // could be smart enough to qualify the member with the base
2966 // Find results in this base class (and its bases).
2967 ShadowContextRAII Shadow(Visited);
2968 LookupVisibleDecls(Record->getDecl(), Result, QualifiedNameLookup,
2969 true, Consumer, Visited);
2973 // Traverse the contexts of Objective-C classes.
2974 if (ObjCInterfaceDecl *IFace = dyn_cast<ObjCInterfaceDecl>(Ctx)) {
2975 // Traverse categories.
2976 for (ObjCInterfaceDecl::visible_categories_iterator
2977 Cat = IFace->visible_categories_begin(),
2978 CatEnd = IFace->visible_categories_end();
2979 Cat != CatEnd; ++Cat) {
2980 ShadowContextRAII Shadow(Visited);
2981 LookupVisibleDecls(*Cat, Result, QualifiedNameLookup, false,
2985 // Traverse protocols.
2986 for (ObjCInterfaceDecl::all_protocol_iterator
2987 I = IFace->all_referenced_protocol_begin(),
2988 E = IFace->all_referenced_protocol_end(); I != E; ++I) {
2989 ShadowContextRAII Shadow(Visited);
2990 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
2994 // Traverse the superclass.
2995 if (IFace->getSuperClass()) {
2996 ShadowContextRAII Shadow(Visited);
2997 LookupVisibleDecls(IFace->getSuperClass(), Result, QualifiedNameLookup,
2998 true, Consumer, Visited);
3001 // If there is an implementation, traverse it. We do this to find
3002 // synthesized ivars.
3003 if (IFace->getImplementation()) {
3004 ShadowContextRAII Shadow(Visited);
3005 LookupVisibleDecls(IFace->getImplementation(), Result,
3006 QualifiedNameLookup, InBaseClass, Consumer, Visited);
3008 } else if (ObjCProtocolDecl *Protocol = dyn_cast<ObjCProtocolDecl>(Ctx)) {
3009 for (ObjCProtocolDecl::protocol_iterator I = Protocol->protocol_begin(),
3010 E = Protocol->protocol_end(); I != E; ++I) {
3011 ShadowContextRAII Shadow(Visited);
3012 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
3015 } else if (ObjCCategoryDecl *Category = dyn_cast<ObjCCategoryDecl>(Ctx)) {
3016 for (ObjCCategoryDecl::protocol_iterator I = Category->protocol_begin(),
3017 E = Category->protocol_end(); I != E; ++I) {
3018 ShadowContextRAII Shadow(Visited);
3019 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
3023 // If there is an implementation, traverse it.
3024 if (Category->getImplementation()) {
3025 ShadowContextRAII Shadow(Visited);
3026 LookupVisibleDecls(Category->getImplementation(), Result,
3027 QualifiedNameLookup, true, Consumer, Visited);
3032 static void LookupVisibleDecls(Scope *S, LookupResult &Result,
3033 UnqualUsingDirectiveSet &UDirs,
3034 VisibleDeclConsumer &Consumer,
3035 VisibleDeclsRecord &Visited) {
3039 if (!S->getEntity() ||
3041 !Visited.alreadyVisitedContext((DeclContext *)S->getEntity())) ||
3042 ((DeclContext *)S->getEntity())->isFunctionOrMethod()) {
3043 // Walk through the declarations in this Scope.
3044 for (Scope::decl_iterator D = S->decl_begin(), DEnd = S->decl_end();
3046 if (NamedDecl *ND = dyn_cast<NamedDecl>(*D))
3047 if ((ND = Result.getAcceptableDecl(ND))) {
3048 Consumer.FoundDecl(ND, Visited.checkHidden(ND), 0, false);
3054 // FIXME: C++ [temp.local]p8
3055 DeclContext *Entity = 0;
3056 if (S->getEntity()) {
3057 // Look into this scope's declaration context, along with any of its
3058 // parent lookup contexts (e.g., enclosing classes), up to the point
3059 // where we hit the context stored in the next outer scope.
3060 Entity = (DeclContext *)S->getEntity();
3061 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
3063 for (DeclContext *Ctx = Entity; Ctx && !Ctx->Equals(OuterCtx);
3064 Ctx = Ctx->getLookupParent()) {
3065 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
3066 if (Method->isInstanceMethod()) {
3067 // For instance methods, look for ivars in the method's interface.
3068 LookupResult IvarResult(Result.getSema(), Result.getLookupName(),
3069 Result.getNameLoc(), Sema::LookupMemberName);
3070 if (ObjCInterfaceDecl *IFace = Method->getClassInterface()) {
3071 LookupVisibleDecls(IFace, IvarResult, /*QualifiedNameLookup=*/false,
3072 /*InBaseClass=*/false, Consumer, Visited);
3076 // We've already performed all of the name lookup that we need
3077 // to for Objective-C methods; the next context will be the
3082 if (Ctx->isFunctionOrMethod())
3085 LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/false,
3086 /*InBaseClass=*/false, Consumer, Visited);
3088 } else if (!S->getParent()) {
3089 // Look into the translation unit scope. We walk through the translation
3090 // unit's declaration context, because the Scope itself won't have all of
3091 // the declarations if we loaded a precompiled header.
3092 // FIXME: We would like the translation unit's Scope object to point to the
3093 // translation unit, so we don't need this special "if" branch. However,
3094 // doing so would force the normal C++ name-lookup code to look into the
3095 // translation unit decl when the IdentifierInfo chains would suffice.
3096 // Once we fix that problem (which is part of a more general "don't look
3097 // in DeclContexts unless we have to" optimization), we can eliminate this.
3098 Entity = Result.getSema().Context.getTranslationUnitDecl();
3099 LookupVisibleDecls(Entity, Result, /*QualifiedNameLookup=*/false,
3100 /*InBaseClass=*/false, Consumer, Visited);
3104 // Lookup visible declarations in any namespaces found by using
3106 UnqualUsingDirectiveSet::const_iterator UI, UEnd;
3107 llvm::tie(UI, UEnd) = UDirs.getNamespacesFor(Entity);
3108 for (; UI != UEnd; ++UI)
3109 LookupVisibleDecls(const_cast<DeclContext *>(UI->getNominatedNamespace()),
3110 Result, /*QualifiedNameLookup=*/false,
3111 /*InBaseClass=*/false, Consumer, Visited);
3114 // Lookup names in the parent scope.
3115 ShadowContextRAII Shadow(Visited);
3116 LookupVisibleDecls(S->getParent(), Result, UDirs, Consumer, Visited);
3119 void Sema::LookupVisibleDecls(Scope *S, LookupNameKind Kind,
3120 VisibleDeclConsumer &Consumer,
3121 bool IncludeGlobalScope) {
3122 // Determine the set of using directives available during
3123 // unqualified name lookup.
3125 UnqualUsingDirectiveSet UDirs;
3126 if (getLangOpts().CPlusPlus) {
3127 // Find the first namespace or translation-unit scope.
3128 while (S && !isNamespaceOrTranslationUnitScope(S))
3131 UDirs.visitScopeChain(Initial, S);
3135 // Look for visible declarations.
3136 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3137 VisibleDeclsRecord Visited;
3138 if (!IncludeGlobalScope)
3139 Visited.visitedContext(Context.getTranslationUnitDecl());
3140 ShadowContextRAII Shadow(Visited);
3141 ::LookupVisibleDecls(Initial, Result, UDirs, Consumer, Visited);
3144 void Sema::LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
3145 VisibleDeclConsumer &Consumer,
3146 bool IncludeGlobalScope) {
3147 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3148 VisibleDeclsRecord Visited;
3149 if (!IncludeGlobalScope)
3150 Visited.visitedContext(Context.getTranslationUnitDecl());
3151 ShadowContextRAII Shadow(Visited);
3152 ::LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/true,
3153 /*InBaseClass=*/false, Consumer, Visited);
3156 /// LookupOrCreateLabel - Do a name lookup of a label with the specified name.
3157 /// If GnuLabelLoc is a valid source location, then this is a definition
3158 /// of an __label__ label name, otherwise it is a normal label definition
3160 LabelDecl *Sema::LookupOrCreateLabel(IdentifierInfo *II, SourceLocation Loc,
3161 SourceLocation GnuLabelLoc) {
3162 // Do a lookup to see if we have a label with this name already.
3165 if (GnuLabelLoc.isValid()) {
3166 // Local label definitions always shadow existing labels.
3167 Res = LabelDecl::Create(Context, CurContext, Loc, II, GnuLabelLoc);
3168 Scope *S = CurScope;
3169 PushOnScopeChains(Res, S, true);
3170 return cast<LabelDecl>(Res);
3173 // Not a GNU local label.
3174 Res = LookupSingleName(CurScope, II, Loc, LookupLabel, NotForRedeclaration);
3175 // If we found a label, check to see if it is in the same context as us.
3176 // When in a Block, we don't want to reuse a label in an enclosing function.
3177 if (Res && Res->getDeclContext() != CurContext)
3180 // If not forward referenced or defined already, create the backing decl.
3181 Res = LabelDecl::Create(Context, CurContext, Loc, II);
3182 Scope *S = CurScope->getFnParent();
3183 assert(S && "Not in a function?");
3184 PushOnScopeChains(Res, S, true);
3186 return cast<LabelDecl>(Res);
3189 //===----------------------------------------------------------------------===//
3191 //===----------------------------------------------------------------------===//
3195 typedef SmallVector<TypoCorrection, 1> TypoResultList;
3196 typedef llvm::StringMap<TypoResultList, llvm::BumpPtrAllocator> TypoResultsMap;
3197 typedef std::map<unsigned, TypoResultsMap> TypoEditDistanceMap;
3199 static const unsigned MaxTypoDistanceResultSets = 5;
3201 class TypoCorrectionConsumer : public VisibleDeclConsumer {
3202 /// \brief The name written that is a typo in the source.
3205 /// \brief The results found that have the smallest edit distance
3206 /// found (so far) with the typo name.
3208 /// The pointer value being set to the current DeclContext indicates
3209 /// whether there is a keyword with this name.
3210 TypoEditDistanceMap CorrectionResults;
3215 explicit TypoCorrectionConsumer(Sema &SemaRef, IdentifierInfo *Typo)
3216 : Typo(Typo->getName()),
3217 SemaRef(SemaRef) { }
3219 virtual void FoundDecl(NamedDecl *ND, NamedDecl *Hiding, DeclContext *Ctx,
3221 void FoundName(StringRef Name);
3222 void addKeywordResult(StringRef Keyword);
3223 void addName(StringRef Name, NamedDecl *ND, unsigned Distance,
3224 NestedNameSpecifier *NNS=NULL, bool isKeyword=false);
3225 void addCorrection(TypoCorrection Correction);
3227 typedef TypoResultsMap::iterator result_iterator;
3228 typedef TypoEditDistanceMap::iterator distance_iterator;
3229 distance_iterator begin() { return CorrectionResults.begin(); }
3230 distance_iterator end() { return CorrectionResults.end(); }
3231 void erase(distance_iterator I) { CorrectionResults.erase(I); }
3232 unsigned size() const { return CorrectionResults.size(); }
3233 bool empty() const { return CorrectionResults.empty(); }
3235 TypoResultList &operator[](StringRef Name) {
3236 return CorrectionResults.begin()->second[Name];
3239 unsigned getBestEditDistance(bool Normalized) {
3240 if (CorrectionResults.empty())
3241 return (std::numeric_limits<unsigned>::max)();
3243 unsigned BestED = CorrectionResults.begin()->first;
3244 return Normalized ? TypoCorrection::NormalizeEditDistance(BestED) : BestED;
3247 TypoResultsMap &getBestResults() {
3248 return CorrectionResults.begin()->second;
3255 void TypoCorrectionConsumer::FoundDecl(NamedDecl *ND, NamedDecl *Hiding,
3256 DeclContext *Ctx, bool InBaseClass) {
3257 // Don't consider hidden names for typo correction.
3261 // Only consider entities with identifiers for names, ignoring
3262 // special names (constructors, overloaded operators, selectors,
3264 IdentifierInfo *Name = ND->getIdentifier();
3268 FoundName(Name->getName());
3271 void TypoCorrectionConsumer::FoundName(StringRef Name) {
3272 // Use a simple length-based heuristic to determine the minimum possible
3273 // edit distance. If the minimum isn't good enough, bail out early.
3274 unsigned MinED = abs((int)Name.size() - (int)Typo.size());
3275 if (MinED && Typo.size() / MinED < 3)
3278 // Compute an upper bound on the allowable edit distance, so that the
3279 // edit-distance algorithm can short-circuit.
3280 unsigned UpperBound = (Typo.size() + 2) / 3;
3282 // Compute the edit distance between the typo and the name of this
3283 // entity, and add the identifier to the list of results.
3284 addName(Name, NULL, Typo.edit_distance(Name, true, UpperBound));
3287 void TypoCorrectionConsumer::addKeywordResult(StringRef Keyword) {
3288 // Compute the edit distance between the typo and this keyword,
3289 // and add the keyword to the list of results.
3290 addName(Keyword, NULL, Typo.edit_distance(Keyword), NULL, true);
3293 void TypoCorrectionConsumer::addName(StringRef Name,
3296 NestedNameSpecifier *NNS,
3298 TypoCorrection TC(&SemaRef.Context.Idents.get(Name), ND, NNS, Distance);
3299 if (isKeyword) TC.makeKeyword();
3303 void TypoCorrectionConsumer::addCorrection(TypoCorrection Correction) {
3304 StringRef Name = Correction.getCorrectionAsIdentifierInfo()->getName();
3305 TypoResultList &CList =
3306 CorrectionResults[Correction.getEditDistance(false)][Name];
3308 if (!CList.empty() && !CList.back().isResolved())
3310 if (NamedDecl *NewND = Correction.getCorrectionDecl()) {
3311 std::string CorrectionStr = Correction.getAsString(SemaRef.getLangOpts());
3312 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
3313 RI != RIEnd; ++RI) {
3314 // If the Correction refers to a decl already in the result list,
3315 // replace the existing result if the string representation of Correction
3316 // comes before the current result alphabetically, then stop as there is
3317 // nothing more to be done to add Correction to the candidate set.
3318 if (RI->getCorrectionDecl() == NewND) {
3319 if (CorrectionStr < RI->getAsString(SemaRef.getLangOpts()))
3325 if (CList.empty() || Correction.isResolved())
3326 CList.push_back(Correction);
3328 while (CorrectionResults.size() > MaxTypoDistanceResultSets)
3329 erase(llvm::prior(CorrectionResults.end()));
3332 // Fill the supplied vector with the IdentifierInfo pointers for each piece of
3333 // the given NestedNameSpecifier (i.e. given a NestedNameSpecifier "foo::bar::",
3334 // fill the vector with the IdentifierInfo pointers for "foo" and "bar").
3335 static void getNestedNameSpecifierIdentifiers(
3336 NestedNameSpecifier *NNS,
3337 SmallVectorImpl<const IdentifierInfo*> &Identifiers) {
3338 if (NestedNameSpecifier *Prefix = NNS->getPrefix())
3339 getNestedNameSpecifierIdentifiers(Prefix, Identifiers);
3341 Identifiers.clear();
3343 const IdentifierInfo *II = NULL;
3345 switch (NNS->getKind()) {
3346 case NestedNameSpecifier::Identifier:
3347 II = NNS->getAsIdentifier();
3350 case NestedNameSpecifier::Namespace:
3351 if (NNS->getAsNamespace()->isAnonymousNamespace())
3353 II = NNS->getAsNamespace()->getIdentifier();
3356 case NestedNameSpecifier::NamespaceAlias:
3357 II = NNS->getAsNamespaceAlias()->getIdentifier();
3360 case NestedNameSpecifier::TypeSpecWithTemplate:
3361 case NestedNameSpecifier::TypeSpec:
3362 II = QualType(NNS->getAsType(), 0).getBaseTypeIdentifier();
3365 case NestedNameSpecifier::Global:
3370 Identifiers.push_back(II);
3375 class SpecifierInfo {
3377 DeclContext* DeclCtx;
3378 NestedNameSpecifier* NameSpecifier;
3379 unsigned EditDistance;
3381 SpecifierInfo(DeclContext *Ctx, NestedNameSpecifier *NNS, unsigned ED)
3382 : DeclCtx(Ctx), NameSpecifier(NNS), EditDistance(ED) {}
3385 typedef SmallVector<DeclContext*, 4> DeclContextList;
3386 typedef SmallVector<SpecifierInfo, 16> SpecifierInfoList;
3388 class NamespaceSpecifierSet {
3389 ASTContext &Context;
3390 DeclContextList CurContextChain;
3391 SmallVector<const IdentifierInfo*, 4> CurContextIdentifiers;
3392 SmallVector<const IdentifierInfo*, 4> CurNameSpecifierIdentifiers;
3395 SpecifierInfoList Specifiers;
3396 llvm::SmallSetVector<unsigned, 4> Distances;
3397 llvm::DenseMap<unsigned, SpecifierInfoList> DistanceMap;
3399 /// \brief Helper for building the list of DeclContexts between the current
3400 /// context and the top of the translation unit
3401 static DeclContextList BuildContextChain(DeclContext *Start);
3403 void SortNamespaces();
3406 NamespaceSpecifierSet(ASTContext &Context, DeclContext *CurContext,
3407 CXXScopeSpec *CurScopeSpec)
3408 : Context(Context), CurContextChain(BuildContextChain(CurContext)),
3410 if (CurScopeSpec && CurScopeSpec->getScopeRep())
3411 getNestedNameSpecifierIdentifiers(CurScopeSpec->getScopeRep(),
3412 CurNameSpecifierIdentifiers);
3413 // Build the list of identifiers that would be used for an absolute
3414 // (from the global context) NestedNameSpecifier referring to the current
3416 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3417 CEnd = CurContextChain.rend();
3419 if (NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C))
3420 CurContextIdentifiers.push_back(ND->getIdentifier());
3424 /// \brief Add the namespace to the set, computing the corresponding
3425 /// NestedNameSpecifier and its distance in the process.
3426 void AddNamespace(NamespaceDecl *ND);
3428 typedef SpecifierInfoList::iterator iterator;
3430 if (!isSorted) SortNamespaces();
3431 return Specifiers.begin();
3433 iterator end() { return Specifiers.end(); }
3438 DeclContextList NamespaceSpecifierSet::BuildContextChain(DeclContext *Start) {
3439 assert(Start && "Building a context chain from a null context");
3440 DeclContextList Chain;
3441 for (DeclContext *DC = Start->getPrimaryContext(); DC != NULL;
3442 DC = DC->getLookupParent()) {
3443 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(DC);
3444 if (!DC->isInlineNamespace() && !DC->isTransparentContext() &&
3445 !(ND && ND->isAnonymousNamespace()))
3446 Chain.push_back(DC->getPrimaryContext());
3451 void NamespaceSpecifierSet::SortNamespaces() {
3452 SmallVector<unsigned, 4> sortedDistances;
3453 sortedDistances.append(Distances.begin(), Distances.end());
3455 if (sortedDistances.size() > 1)
3456 std::sort(sortedDistances.begin(), sortedDistances.end());
3459 for (SmallVector<unsigned, 4>::iterator DI = sortedDistances.begin(),
3460 DIEnd = sortedDistances.end();
3461 DI != DIEnd; ++DI) {
3462 SpecifierInfoList &SpecList = DistanceMap[*DI];
3463 Specifiers.append(SpecList.begin(), SpecList.end());
3469 void NamespaceSpecifierSet::AddNamespace(NamespaceDecl *ND) {
3470 DeclContext *Ctx = cast<DeclContext>(ND);
3471 NestedNameSpecifier *NNS = NULL;
3472 unsigned NumSpecifiers = 0;
3473 DeclContextList NamespaceDeclChain(BuildContextChain(Ctx));
3474 DeclContextList FullNamespaceDeclChain(NamespaceDeclChain);
3476 // Eliminate common elements from the two DeclContext chains.
3477 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3478 CEnd = CurContextChain.rend();
3479 C != CEnd && !NamespaceDeclChain.empty() &&
3480 NamespaceDeclChain.back() == *C; ++C) {
3481 NamespaceDeclChain.pop_back();
3484 // Add an explicit leading '::' specifier if needed.
3485 if (NamespaceDecl *ND =
3486 NamespaceDeclChain.empty() ? NULL :
3487 dyn_cast_or_null<NamespaceDecl>(NamespaceDeclChain.back())) {
3488 IdentifierInfo *Name = ND->getIdentifier();
3489 if (std::find(CurContextIdentifiers.begin(), CurContextIdentifiers.end(),
3490 Name) != CurContextIdentifiers.end() ||
3491 std::find(CurNameSpecifierIdentifiers.begin(),
3492 CurNameSpecifierIdentifiers.end(),
3493 Name) != CurNameSpecifierIdentifiers.end()) {
3494 NamespaceDeclChain = FullNamespaceDeclChain;
3495 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
3499 // Build the NestedNameSpecifier from what is left of the NamespaceDeclChain
3500 for (DeclContextList::reverse_iterator C = NamespaceDeclChain.rbegin(),
3501 CEnd = NamespaceDeclChain.rend();
3503 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C);
3505 NNS = NestedNameSpecifier::Create(Context, NNS, ND);
3510 // If the built NestedNameSpecifier would be replacing an existing
3511 // NestedNameSpecifier, use the number of component identifiers that
3512 // would need to be changed as the edit distance instead of the number
3513 // of components in the built NestedNameSpecifier.
3514 if (NNS && !CurNameSpecifierIdentifiers.empty()) {
3515 SmallVector<const IdentifierInfo*, 4> NewNameSpecifierIdentifiers;
3516 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
3517 NumSpecifiers = llvm::ComputeEditDistance(
3518 llvm::ArrayRef<const IdentifierInfo*>(CurNameSpecifierIdentifiers),
3519 llvm::ArrayRef<const IdentifierInfo*>(NewNameSpecifierIdentifiers));
3523 Distances.insert(NumSpecifiers);
3524 DistanceMap[NumSpecifiers].push_back(SpecifierInfo(Ctx, NNS, NumSpecifiers));
3527 /// \brief Perform name lookup for a possible result for typo correction.
3528 static void LookupPotentialTypoResult(Sema &SemaRef,
3530 IdentifierInfo *Name,
3531 Scope *S, CXXScopeSpec *SS,
3532 DeclContext *MemberContext,
3533 bool EnteringContext,
3534 bool isObjCIvarLookup) {
3535 Res.suppressDiagnostics();
3537 Res.setLookupName(Name);
3538 if (MemberContext) {
3539 if (ObjCInterfaceDecl *Class = dyn_cast<ObjCInterfaceDecl>(MemberContext)) {
3540 if (isObjCIvarLookup) {
3541 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(Name)) {
3548 if (ObjCPropertyDecl *Prop = Class->FindPropertyDeclaration(Name)) {
3555 SemaRef.LookupQualifiedName(Res, MemberContext);
3559 SemaRef.LookupParsedName(Res, S, SS, /*AllowBuiltinCreation=*/false,
3562 // Fake ivar lookup; this should really be part of
3563 // LookupParsedName.
3564 if (ObjCMethodDecl *Method = SemaRef.getCurMethodDecl()) {
3565 if (Method->isInstanceMethod() && Method->getClassInterface() &&
3567 (Res.isSingleResult() &&
3568 Res.getFoundDecl()->isDefinedOutsideFunctionOrMethod()))) {
3569 if (ObjCIvarDecl *IV
3570 = Method->getClassInterface()->lookupInstanceVariable(Name)) {
3578 /// \brief Add keywords to the consumer as possible typo corrections.
3579 static void AddKeywordsToConsumer(Sema &SemaRef,
3580 TypoCorrectionConsumer &Consumer,
3581 Scope *S, CorrectionCandidateCallback &CCC,
3582 bool AfterNestedNameSpecifier) {
3583 if (AfterNestedNameSpecifier) {
3584 // For 'X::', we know exactly which keywords can appear next.
3585 Consumer.addKeywordResult("template");
3586 if (CCC.WantExpressionKeywords)
3587 Consumer.addKeywordResult("operator");
3591 if (CCC.WantObjCSuper)
3592 Consumer.addKeywordResult("super");
3594 if (CCC.WantTypeSpecifiers) {
3595 // Add type-specifier keywords to the set of results.
3596 const char *CTypeSpecs[] = {
3597 "char", "const", "double", "enum", "float", "int", "long", "short",
3598 "signed", "struct", "union", "unsigned", "void", "volatile",
3599 "_Complex", "_Imaginary",
3600 // storage-specifiers as well
3601 "extern", "inline", "static", "typedef"
3604 const unsigned NumCTypeSpecs = sizeof(CTypeSpecs) / sizeof(CTypeSpecs[0]);
3605 for (unsigned I = 0; I != NumCTypeSpecs; ++I)
3606 Consumer.addKeywordResult(CTypeSpecs[I]);
3608 if (SemaRef.getLangOpts().C99)
3609 Consumer.addKeywordResult("restrict");
3610 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus)
3611 Consumer.addKeywordResult("bool");
3612 else if (SemaRef.getLangOpts().C99)
3613 Consumer.addKeywordResult("_Bool");
3615 if (SemaRef.getLangOpts().CPlusPlus) {
3616 Consumer.addKeywordResult("class");
3617 Consumer.addKeywordResult("typename");
3618 Consumer.addKeywordResult("wchar_t");
3620 if (SemaRef.getLangOpts().CPlusPlus11) {
3621 Consumer.addKeywordResult("char16_t");
3622 Consumer.addKeywordResult("char32_t");
3623 Consumer.addKeywordResult("constexpr");
3624 Consumer.addKeywordResult("decltype");
3625 Consumer.addKeywordResult("thread_local");
3629 if (SemaRef.getLangOpts().GNUMode)
3630 Consumer.addKeywordResult("typeof");
3633 if (CCC.WantCXXNamedCasts && SemaRef.getLangOpts().CPlusPlus) {
3634 Consumer.addKeywordResult("const_cast");
3635 Consumer.addKeywordResult("dynamic_cast");
3636 Consumer.addKeywordResult("reinterpret_cast");
3637 Consumer.addKeywordResult("static_cast");
3640 if (CCC.WantExpressionKeywords) {
3641 Consumer.addKeywordResult("sizeof");
3642 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus) {
3643 Consumer.addKeywordResult("false");
3644 Consumer.addKeywordResult("true");
3647 if (SemaRef.getLangOpts().CPlusPlus) {
3648 const char *CXXExprs[] = {
3649 "delete", "new", "operator", "throw", "typeid"
3651 const unsigned NumCXXExprs = sizeof(CXXExprs) / sizeof(CXXExprs[0]);
3652 for (unsigned I = 0; I != NumCXXExprs; ++I)
3653 Consumer.addKeywordResult(CXXExprs[I]);
3655 if (isa<CXXMethodDecl>(SemaRef.CurContext) &&
3656 cast<CXXMethodDecl>(SemaRef.CurContext)->isInstance())
3657 Consumer.addKeywordResult("this");
3659 if (SemaRef.getLangOpts().CPlusPlus11) {
3660 Consumer.addKeywordResult("alignof");
3661 Consumer.addKeywordResult("nullptr");
3665 if (SemaRef.getLangOpts().C11) {
3666 // FIXME: We should not suggest _Alignof if the alignof macro
3668 Consumer.addKeywordResult("_Alignof");
3672 if (CCC.WantRemainingKeywords) {
3673 if (SemaRef.getCurFunctionOrMethodDecl() || SemaRef.getCurBlock()) {
3675 const char *CStmts[] = {
3676 "do", "else", "for", "goto", "if", "return", "switch", "while" };
3677 const unsigned NumCStmts = sizeof(CStmts) / sizeof(CStmts[0]);
3678 for (unsigned I = 0; I != NumCStmts; ++I)
3679 Consumer.addKeywordResult(CStmts[I]);
3681 if (SemaRef.getLangOpts().CPlusPlus) {
3682 Consumer.addKeywordResult("catch");
3683 Consumer.addKeywordResult("try");
3686 if (S && S->getBreakParent())
3687 Consumer.addKeywordResult("break");
3689 if (S && S->getContinueParent())
3690 Consumer.addKeywordResult("continue");
3692 if (!SemaRef.getCurFunction()->SwitchStack.empty()) {
3693 Consumer.addKeywordResult("case");
3694 Consumer.addKeywordResult("default");
3697 if (SemaRef.getLangOpts().CPlusPlus) {
3698 Consumer.addKeywordResult("namespace");
3699 Consumer.addKeywordResult("template");
3702 if (S && S->isClassScope()) {
3703 Consumer.addKeywordResult("explicit");
3704 Consumer.addKeywordResult("friend");
3705 Consumer.addKeywordResult("mutable");
3706 Consumer.addKeywordResult("private");
3707 Consumer.addKeywordResult("protected");
3708 Consumer.addKeywordResult("public");
3709 Consumer.addKeywordResult("virtual");
3713 if (SemaRef.getLangOpts().CPlusPlus) {
3714 Consumer.addKeywordResult("using");
3716 if (SemaRef.getLangOpts().CPlusPlus11)
3717 Consumer.addKeywordResult("static_assert");
3722 static bool isCandidateViable(CorrectionCandidateCallback &CCC,
3723 TypoCorrection &Candidate) {
3724 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3725 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3728 /// \brief Try to "correct" a typo in the source code by finding
3729 /// visible declarations whose names are similar to the name that was
3730 /// present in the source code.
3732 /// \param TypoName the \c DeclarationNameInfo structure that contains
3733 /// the name that was present in the source code along with its location.
3735 /// \param LookupKind the name-lookup criteria used to search for the name.
3737 /// \param S the scope in which name lookup occurs.
3739 /// \param SS the nested-name-specifier that precedes the name we're
3740 /// looking for, if present.
3742 /// \param CCC A CorrectionCandidateCallback object that provides further
3743 /// validation of typo correction candidates. It also provides flags for
3744 /// determining the set of keywords permitted.
3746 /// \param MemberContext if non-NULL, the context in which to look for
3747 /// a member access expression.
3749 /// \param EnteringContext whether we're entering the context described by
3750 /// the nested-name-specifier SS.
3752 /// \param OPT when non-NULL, the search for visible declarations will
3753 /// also walk the protocols in the qualified interfaces of \p OPT.
3755 /// \returns a \c TypoCorrection containing the corrected name if the typo
3756 /// along with information such as the \c NamedDecl where the corrected name
3757 /// was declared, and any additional \c NestedNameSpecifier needed to access
3758 /// it (C++ only). The \c TypoCorrection is empty if there is no correction.
3759 TypoCorrection Sema::CorrectTypo(const DeclarationNameInfo &TypoName,
3760 Sema::LookupNameKind LookupKind,
3761 Scope *S, CXXScopeSpec *SS,
3762 CorrectionCandidateCallback &CCC,
3763 DeclContext *MemberContext,
3764 bool EnteringContext,
3765 const ObjCObjectPointerType *OPT) {
3766 if (Diags.hasFatalErrorOccurred() || !getLangOpts().SpellChecking)
3767 return TypoCorrection();
3769 // In Microsoft mode, don't perform typo correction in a template member
3770 // function dependent context because it interferes with the "lookup into
3771 // dependent bases of class templates" feature.
3772 if (getLangOpts().MicrosoftMode && CurContext->isDependentContext() &&
3773 isa<CXXMethodDecl>(CurContext))
3774 return TypoCorrection();
3776 // We only attempt to correct typos for identifiers.
3777 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
3779 return TypoCorrection();
3781 // If the scope specifier itself was invalid, don't try to correct
3783 if (SS && SS->isInvalid())
3784 return TypoCorrection();
3786 // Never try to correct typos during template deduction or
3788 if (!ActiveTemplateInstantiations.empty())
3789 return TypoCorrection();
3791 // Don't try to correct 'super'.
3792 if (S && S->isInObjcMethodScope() && Typo == getSuperIdentifier())
3793 return TypoCorrection();
3795 NamespaceSpecifierSet Namespaces(Context, CurContext, SS);
3797 TypoCorrectionConsumer Consumer(*this, Typo);
3799 // If a callback object considers an empty typo correction candidate to be
3800 // viable, assume it does not do any actual validation of the candidates.
3801 TypoCorrection EmptyCorrection;
3802 bool ValidatingCallback = !isCandidateViable(CCC, EmptyCorrection);
3804 // Perform name lookup to find visible, similarly-named entities.
3805 bool IsUnqualifiedLookup = false;
3806 DeclContext *QualifiedDC = MemberContext;
3807 if (MemberContext) {
3808 LookupVisibleDecls(MemberContext, LookupKind, Consumer);
3810 // Look in qualified interfaces.
3812 for (ObjCObjectPointerType::qual_iterator
3813 I = OPT->qual_begin(), E = OPT->qual_end();
3815 LookupVisibleDecls(*I, LookupKind, Consumer);
3817 } else if (SS && SS->isSet()) {
3818 QualifiedDC = computeDeclContext(*SS, EnteringContext);
3820 return TypoCorrection();
3822 // Provide a stop gap for files that are just seriously broken. Trying
3823 // to correct all typos can turn into a HUGE performance penalty, causing
3824 // some files to take minutes to get rejected by the parser.
3825 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
3826 return TypoCorrection();
3829 LookupVisibleDecls(QualifiedDC, LookupKind, Consumer);
3831 IsUnqualifiedLookup = true;
3832 UnqualifiedTyposCorrectedMap::iterator Cached
3833 = UnqualifiedTyposCorrected.find(Typo);
3834 if (Cached != UnqualifiedTyposCorrected.end()) {
3835 // Add the cached value, unless it's a keyword or fails validation. In the
3836 // keyword case, we'll end up adding the keyword below.
3837 if (Cached->second) {
3838 if (!Cached->second.isKeyword() &&
3839 isCandidateViable(CCC, Cached->second))
3840 Consumer.addCorrection(Cached->second);
3842 // Only honor no-correction cache hits when a callback that will validate
3843 // correction candidates is not being used.
3844 if (!ValidatingCallback)
3845 return TypoCorrection();
3848 if (Cached == UnqualifiedTyposCorrected.end()) {
3849 // Provide a stop gap for files that are just seriously broken. Trying
3850 // to correct all typos can turn into a HUGE performance penalty, causing
3851 // some files to take minutes to get rejected by the parser.
3852 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
3853 return TypoCorrection();
3857 // Determine whether we are going to search in the various namespaces for
3859 bool SearchNamespaces
3860 = getLangOpts().CPlusPlus &&
3861 (IsUnqualifiedLookup || (QualifiedDC && QualifiedDC->isNamespace()));
3862 // In a few cases we *only* want to search for corrections bases on just
3863 // adding or changing the nested name specifier.
3864 bool AllowOnlyNNSChanges = Typo->getName().size() < 3;
3866 if (IsUnqualifiedLookup || SearchNamespaces) {
3867 // For unqualified lookup, look through all of the names that we have
3868 // seen in this translation unit.
3869 // FIXME: Re-add the ability to skip very unlikely potential corrections.
3870 for (IdentifierTable::iterator I = Context.Idents.begin(),
3871 IEnd = Context.Idents.end();
3873 Consumer.FoundName(I->getKey());
3875 // Walk through identifiers in external identifier sources.
3876 // FIXME: Re-add the ability to skip very unlikely potential corrections.
3877 if (IdentifierInfoLookup *External
3878 = Context.Idents.getExternalIdentifierLookup()) {
3879 OwningPtr<IdentifierIterator> Iter(External->getIdentifiers());
3881 StringRef Name = Iter->Next();
3885 Consumer.FoundName(Name);
3890 AddKeywordsToConsumer(*this, Consumer, S, CCC, SS && SS->isNotEmpty());
3892 // If we haven't found anything, we're done.
3893 if (Consumer.empty()) {
3894 // If this was an unqualified lookup, note that no correction was found.
3895 if (IsUnqualifiedLookup)
3896 (void)UnqualifiedTyposCorrected[Typo];
3898 return TypoCorrection();
3901 // Make sure the best edit distance (prior to adding any namespace qualifiers)
3902 // is not more that about a third of the length of the typo's identifier.
3903 unsigned ED = Consumer.getBestEditDistance(true);
3904 if (ED > 0 && Typo->getName().size() / ED < 3) {
3905 // If this was an unqualified lookup, note that no correction was found.
3906 if (IsUnqualifiedLookup)
3907 (void)UnqualifiedTyposCorrected[Typo];
3909 return TypoCorrection();
3912 // Build the NestedNameSpecifiers for the KnownNamespaces, if we're going
3913 // to search those namespaces.
3914 if (SearchNamespaces) {
3915 // Load any externally-known namespaces.
3916 if (ExternalSource && !LoadedExternalKnownNamespaces) {
3917 SmallVector<NamespaceDecl *, 4> ExternalKnownNamespaces;
3918 LoadedExternalKnownNamespaces = true;
3919 ExternalSource->ReadKnownNamespaces(ExternalKnownNamespaces);
3920 for (unsigned I = 0, N = ExternalKnownNamespaces.size(); I != N; ++I)
3921 KnownNamespaces[ExternalKnownNamespaces[I]] = true;
3924 for (llvm::MapVector<NamespaceDecl*, bool>::iterator
3925 KNI = KnownNamespaces.begin(),
3926 KNIEnd = KnownNamespaces.end();
3927 KNI != KNIEnd; ++KNI)
3928 Namespaces.AddNamespace(KNI->first);
3931 // Weed out any names that could not be found by name lookup or, if a
3932 // CorrectionCandidateCallback object was provided, failed validation.
3933 SmallVector<TypoCorrection, 16> QualifiedResults;
3934 LookupResult TmpRes(*this, TypoName, LookupKind);
3935 TmpRes.suppressDiagnostics();
3936 while (!Consumer.empty()) {
3937 TypoCorrectionConsumer::distance_iterator DI = Consumer.begin();
3938 unsigned ED = DI->first;
3939 for (TypoCorrectionConsumer::result_iterator I = DI->second.begin(),
3940 IEnd = DI->second.end();
3941 I != IEnd; /* Increment in loop. */) {
3942 // If we only want nested name specifier corrections, ignore potential
3943 // corrections that have a different base identifier from the typo.
3944 if (AllowOnlyNNSChanges &&
3945 I->second.front().getCorrectionAsIdentifierInfo() != Typo) {
3946 TypoCorrectionConsumer::result_iterator Prev = I;
3948 DI->second.erase(Prev);
3952 // If the item already has been looked up or is a keyword, keep it.
3953 // If a validator callback object was given, drop the correction
3954 // unless it passes validation.
3955 bool Viable = false;
3956 for (TypoResultList::iterator RI = I->second.begin();
3957 RI != I->second.end(); /* Increment in loop. */) {
3958 TypoResultList::iterator Prev = RI;
3960 if (Prev->isResolved()) {
3961 if (!isCandidateViable(CCC, *Prev))
3962 RI = I->second.erase(Prev);
3967 if (Viable || I->second.empty()) {
3968 TypoCorrectionConsumer::result_iterator Prev = I;
3971 DI->second.erase(Prev);
3974 assert(I->second.size() == 1 && "Expected a single unresolved candidate");
3976 // Perform name lookup on this name.
3977 TypoCorrection &Candidate = I->second.front();
3978 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
3979 LookupPotentialTypoResult(*this, TmpRes, Name, S, SS, MemberContext,
3980 EnteringContext, CCC.IsObjCIvarLookup);
3982 switch (TmpRes.getResultKind()) {
3983 case LookupResult::NotFound:
3984 case LookupResult::NotFoundInCurrentInstantiation:
3985 case LookupResult::FoundUnresolvedValue:
3986 QualifiedResults.push_back(Candidate);
3987 // We didn't find this name in our scope, or didn't like what we found;
3990 TypoCorrectionConsumer::result_iterator Next = I;
3992 DI->second.erase(I);
3997 case LookupResult::Ambiguous:
3998 // We don't deal with ambiguities.
3999 return TypoCorrection();
4001 case LookupResult::FoundOverloaded: {
4002 TypoCorrectionConsumer::result_iterator Prev = I;
4003 // Store all of the Decls for overloaded symbols
4004 for (LookupResult::iterator TRD = TmpRes.begin(),
4005 TRDEnd = TmpRes.end();
4006 TRD != TRDEnd; ++TRD)
4007 Candidate.addCorrectionDecl(*TRD);
4009 if (!isCandidateViable(CCC, Candidate))
4010 DI->second.erase(Prev);
4014 case LookupResult::Found: {
4015 TypoCorrectionConsumer::result_iterator Prev = I;
4016 Candidate.setCorrectionDecl(TmpRes.getAsSingle<NamedDecl>());
4018 if (!isCandidateViable(CCC, Candidate))
4019 DI->second.erase(Prev);
4026 if (DI->second.empty())
4028 else if (!getLangOpts().CPlusPlus || QualifiedResults.empty() || !ED)
4029 // If there are results in the closest possible bucket, stop
4032 // Only perform the qualified lookups for C++
4033 if (SearchNamespaces) {
4034 TmpRes.suppressDiagnostics();
4035 for (SmallVector<TypoCorrection,
4036 16>::iterator QRI = QualifiedResults.begin(),
4037 QRIEnd = QualifiedResults.end();
4038 QRI != QRIEnd; ++QRI) {
4039 for (NamespaceSpecifierSet::iterator NI = Namespaces.begin(),
4040 NIEnd = Namespaces.end();
4041 NI != NIEnd; ++NI) {
4042 DeclContext *Ctx = NI->DeclCtx;
4044 // FIXME: Stop searching once the namespaces are too far away to create
4045 // acceptable corrections for this identifier (since the namespaces
4046 // are sorted in ascending order by edit distance).
4049 TmpRes.setLookupName(QRI->getCorrectionAsIdentifierInfo());
4050 if (!LookupQualifiedName(TmpRes, Ctx)) continue;
4052 // Any corrections added below will be validated in subsequent
4053 // iterations of the main while() loop over the Consumer's contents.
4054 switch (TmpRes.getResultKind()) {
4055 case LookupResult::Found: {
4056 TypoCorrection TC(*QRI);
4057 TC.setCorrectionDecl(TmpRes.getAsSingle<NamedDecl>());
4058 TC.setCorrectionSpecifier(NI->NameSpecifier);
4059 TC.setQualifierDistance(NI->EditDistance);
4060 Consumer.addCorrection(TC);
4063 case LookupResult::FoundOverloaded: {
4064 TypoCorrection TC(*QRI);
4065 TC.setCorrectionSpecifier(NI->NameSpecifier);
4066 TC.setQualifierDistance(NI->EditDistance);
4067 for (LookupResult::iterator TRD = TmpRes.begin(),
4068 TRDEnd = TmpRes.end();
4069 TRD != TRDEnd; ++TRD)
4070 TC.addCorrectionDecl(*TRD);
4071 Consumer.addCorrection(TC);
4074 case LookupResult::NotFound:
4075 case LookupResult::NotFoundInCurrentInstantiation:
4076 case LookupResult::Ambiguous:
4077 case LookupResult::FoundUnresolvedValue:
4084 QualifiedResults.clear();
4087 // No corrections remain...
4088 if (Consumer.empty()) return TypoCorrection();
4090 TypoResultsMap &BestResults = Consumer.getBestResults();
4091 ED = Consumer.getBestEditDistance(true);
4093 if (!AllowOnlyNNSChanges && ED > 0 && Typo->getName().size() / ED < 3) {
4094 // If this was an unqualified lookup and we believe the callback
4095 // object wouldn't have filtered out possible corrections, note
4096 // that no correction was found.
4097 if (IsUnqualifiedLookup && !ValidatingCallback)
4098 (void)UnqualifiedTyposCorrected[Typo];
4100 return TypoCorrection();
4103 // If only a single name remains, return that result.
4104 if (BestResults.size() == 1) {
4105 const TypoResultList &CorrectionList = BestResults.begin()->second;
4106 const TypoCorrection &Result = CorrectionList.front();
4107 if (CorrectionList.size() != 1) return TypoCorrection();
4109 // Don't correct to a keyword that's the same as the typo; the keyword
4110 // wasn't actually in scope.
4111 if (ED == 0 && Result.isKeyword()) return TypoCorrection();
4113 // Record the correction for unqualified lookup.
4114 if (IsUnqualifiedLookup)
4115 UnqualifiedTyposCorrected[Typo] = Result;
4117 TypoCorrection TC = Result;
4118 TC.setCorrectionRange(SS, TypoName);
4121 else if (BestResults.size() > 1
4122 // Ugly hack equivalent to CTC == CTC_ObjCMessageReceiver;
4123 // WantObjCSuper is only true for CTC_ObjCMessageReceiver and for
4124 // some instances of CTC_Unknown, while WantRemainingKeywords is true
4125 // for CTC_Unknown but not for CTC_ObjCMessageReceiver.
4126 && CCC.WantObjCSuper && !CCC.WantRemainingKeywords
4127 && BestResults["super"].front().isKeyword()) {
4128 // Prefer 'super' when we're completing in a message-receiver
4131 // Don't correct to a keyword that's the same as the typo; the keyword
4132 // wasn't actually in scope.
4133 if (ED == 0) return TypoCorrection();
4135 // Record the correction for unqualified lookup.
4136 if (IsUnqualifiedLookup)
4137 UnqualifiedTyposCorrected[Typo] = BestResults["super"].front();
4139 TypoCorrection TC = BestResults["super"].front();
4140 TC.setCorrectionRange(SS, TypoName);
4144 // If this was an unqualified lookup and we believe the callback object did
4145 // not filter out possible corrections, note that no correction was found.
4146 if (IsUnqualifiedLookup && !ValidatingCallback)
4147 (void)UnqualifiedTyposCorrected[Typo];
4149 return TypoCorrection();
4152 void TypoCorrection::addCorrectionDecl(NamedDecl *CDecl) {
4156 CorrectionDecls.clear();
4158 CorrectionDecls.push_back(CDecl->getUnderlyingDecl());
4160 if (!CorrectionName)
4161 CorrectionName = CDecl->getDeclName();
4164 std::string TypoCorrection::getAsString(const LangOptions &LO) const {
4165 if (CorrectionNameSpec) {
4166 std::string tmpBuffer;
4167 llvm::raw_string_ostream PrefixOStream(tmpBuffer);
4168 CorrectionNameSpec->print(PrefixOStream, PrintingPolicy(LO));
4169 CorrectionName.printName(PrefixOStream);
4170 return PrefixOStream.str();
4173 return CorrectionName.getAsString();
4176 bool CorrectionCandidateCallback::ValidateCandidate(const TypoCorrection &candidate) {
4177 if (!candidate.isResolved())
4180 if (candidate.isKeyword())
4181 return WantTypeSpecifiers || WantExpressionKeywords || WantCXXNamedCasts ||
4182 WantRemainingKeywords || WantObjCSuper;
4184 for (TypoCorrection::const_decl_iterator CDecl = candidate.begin(),
4185 CDeclEnd = candidate.end();
4186 CDecl != CDeclEnd; ++CDecl) {
4187 if (!isa<TypeDecl>(*CDecl))
4191 return WantTypeSpecifiers;