blob: df9fdeb40d6caddcf51cd98cbd2976268efa2467 [file] [log] [blame]
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001//===--------------------- SemaLookup.cpp - Name Lookup ------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements name lookup for C, C++, Objective-C, and
11// Objective-C++.
12//
13//===----------------------------------------------------------------------===//
Douglas Gregore737f502010-08-12 20:07:10 +000014#include "clang/Sema/Lookup.h"
Douglas Gregor7176fff2009-01-15 00:26:24 +000015#include "clang/AST/ASTContext.h"
Douglas Gregora8f32e02009-10-06 17:59:45 +000016#include "clang/AST/CXXInheritance.h"
Douglas Gregoreb11cd02009-01-14 22:20:51 +000017#include "clang/AST/Decl.h"
18#include "clang/AST/DeclCXX.h"
Nick Lewycky173a37a2012-04-03 21:44:08 +000019#include "clang/AST/DeclLookups.h"
Douglas Gregoreb11cd02009-01-14 22:20:51 +000020#include "clang/AST/DeclObjC.h"
Douglas Gregor42af25f2009-05-11 19:58:34 +000021#include "clang/AST/DeclTemplate.h"
Douglas Gregorfa047642009-02-04 00:32:51 +000022#include "clang/AST/Expr.h"
Douglas Gregordaa439a2009-07-08 10:57:20 +000023#include "clang/AST/ExprCXX.h"
Chris Lattner1b63e4f2009-06-14 01:54:56 +000024#include "clang/Basic/Builtins.h"
Douglas Gregoreb11cd02009-01-14 22:20:51 +000025#include "clang/Basic/LangOptions.h"
Chandler Carruth55fc8732012-12-04 09:13:33 +000026#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"
Douglas Gregoreb11cd02009-01-14 22:20:51 +000035#include "llvm/ADT/STLExtras.h"
Chandler Carruth55fc8732012-12-04 09:13:33 +000036#include "llvm/ADT/SetVector.h"
Douglas Gregorfa047642009-02-04 00:32:51 +000037#include "llvm/ADT/SmallPtrSet.h"
Douglas Gregore24b5752010-10-14 20:34:08 +000038#include "llvm/ADT/StringMap.h"
Chris Lattnerb5f65472011-07-18 01:54:02 +000039#include "llvm/ADT/TinyPtrVector.h"
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +000040#include "llvm/ADT/edit_distance.h"
John McCall6e247262009-10-10 05:48:19 +000041#include "llvm/Support/ErrorHandling.h"
Nick Lewycky893a6ea2012-04-03 20:26:45 +000042#include <algorithm>
43#include <iterator>
Douglas Gregore24b5752010-10-14 20:34:08 +000044#include <limits>
Douglas Gregor546be3c2009-12-30 17:04:44 +000045#include <list>
Douglas Gregord8bba9c2011-06-28 16:20:02 +000046#include <map>
Nick Lewycky893a6ea2012-04-03 20:26:45 +000047#include <set>
48#include <utility>
49#include <vector>
Douglas Gregoreb11cd02009-01-14 22:20:51 +000050
51using namespace clang;
John McCall2a7fb272010-08-25 05:32:35 +000052using namespace sema;
Douglas Gregoreb11cd02009-01-14 22:20:51 +000053
John McCalld7be78a2009-11-10 07:01:13 +000054namespace {
55 class UnqualUsingEntry {
56 const DeclContext *Nominated;
57 const DeclContext *CommonAncestor;
Douglas Gregor2a3009a2009-02-03 19:21:40 +000058
John McCalld7be78a2009-11-10 07:01:13 +000059 public:
60 UnqualUsingEntry(const DeclContext *Nominated,
61 const DeclContext *CommonAncestor)
62 : Nominated(Nominated), CommonAncestor(CommonAncestor) {
63 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +000064
John McCalld7be78a2009-11-10 07:01:13 +000065 const DeclContext *getCommonAncestor() const {
66 return CommonAncestor;
67 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +000068
John McCalld7be78a2009-11-10 07:01:13 +000069 const DeclContext *getNominatedNamespace() const {
70 return Nominated;
71 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +000072
John McCalld7be78a2009-11-10 07:01:13 +000073 // Sort by the pointer value of the common ancestor.
74 struct Comparator {
75 bool operator()(const UnqualUsingEntry &L, const UnqualUsingEntry &R) {
76 return L.getCommonAncestor() < R.getCommonAncestor();
77 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +000078
John McCalld7be78a2009-11-10 07:01:13 +000079 bool operator()(const UnqualUsingEntry &E, const DeclContext *DC) {
80 return E.getCommonAncestor() < DC;
81 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +000082
John McCalld7be78a2009-11-10 07:01:13 +000083 bool operator()(const DeclContext *DC, const UnqualUsingEntry &E) {
84 return DC < E.getCommonAncestor();
85 }
86 };
87 };
Douglas Gregor2a3009a2009-02-03 19:21:40 +000088
John McCalld7be78a2009-11-10 07:01:13 +000089 /// A collection of using directives, as used by C++ unqualified
90 /// lookup.
91 class UnqualUsingDirectiveSet {
Chris Lattner5f9e2722011-07-23 10:55:15 +000092 typedef SmallVector<UnqualUsingEntry, 8> ListTy;
Douglas Gregor2a3009a2009-02-03 19:21:40 +000093
John McCalld7be78a2009-11-10 07:01:13 +000094 ListTy list;
95 llvm::SmallPtrSet<DeclContext*, 8> visited;
Douglas Gregor2a3009a2009-02-03 19:21:40 +000096
John McCalld7be78a2009-11-10 07:01:13 +000097 public:
98 UnqualUsingDirectiveSet() {}
Douglas Gregor2a3009a2009-02-03 19:21:40 +000099
John McCalld7be78a2009-11-10 07:01:13 +0000100 void visitScopeChain(Scope *S, Scope *InnermostFileScope) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000101 // C++ [namespace.udir]p1:
John McCalld7be78a2009-11-10 07:01:13 +0000102 // 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());
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000108
John McCalld7be78a2009-11-10 07:01:13 +0000109 for (; S; S = S->getParent()) {
Nick Lewycky65daef12012-03-13 04:12:34 +0000110 // 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.
Richard Smith1b7f9cb2012-03-13 03:12:56 +0000113 DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity());
Nick Lewycky65daef12012-03-13 04:12:34 +0000114 if (Ctx && Ctx->isFileContext()) {
115 visit(Ctx, Ctx);
116 } else if (!Ctx || Ctx->isFunctionOrMethod()) {
John McCalld7be78a2009-11-10 07:01:13 +0000117 Scope::udir_iterator I = S->using_directives_begin(),
118 End = S->using_directives_end();
John McCalld7be78a2009-11-10 07:01:13 +0000119 for (; I != End; ++I)
John McCalld226f652010-08-21 09:40:31 +0000120 visit(*I, InnermostFileDC);
John McCalld7be78a2009-11-10 07:01:13 +0000121 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000122 }
123 }
John McCalld7be78a2009-11-10 07:01:13 +0000124
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.
128 //
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))
134 return;
135
136 addUsingDirectives(DC, EffectiveDC);
137 }
138
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))
145 return;
146
147 addUsingDirective(UD, EffectiveDC);
148 addUsingDirectives(NS, EffectiveDC);
149 }
150
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) {
Chris Lattner5f9e2722011-07-23 10:55:15 +0000155 SmallVector<DeclContext*,4> queue;
John McCalld7be78a2009-11-10 07:01:13 +0000156 while (true) {
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);
163 queue.push_back(NS);
164 }
165 }
166
167 if (queue.empty())
168 return;
169
170 DC = queue.back();
171 queue.pop_back();
172 }
173 }
174
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
181 // the first.
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();
John McCall12ea5782009-11-10 09:20:04 +0000188 Common = Common->getPrimaryContext();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000189
John McCalld7be78a2009-11-10 07:01:13 +0000190 list.push_back(UnqualUsingEntry(UD->getNominatedNamespace(), Common));
191 }
192
193 void done() {
194 std::sort(list.begin(), list.end(), UnqualUsingEntry::Comparator());
195 }
196
John McCalld7be78a2009-11-10 07:01:13 +0000197 typedef ListTy::const_iterator const_iterator;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000198
John McCalld7be78a2009-11-10 07:01:13 +0000199 const_iterator begin() const { return list.begin(); }
200 const_iterator end() const { return list.end(); }
201
202 std::pair<const_iterator,const_iterator>
203 getNamespacesFor(DeclContext *DC) const {
John McCall12ea5782009-11-10 09:20:04 +0000204 return std::equal_range(begin(), end(), DC->getPrimaryContext(),
John McCalld7be78a2009-11-10 07:01:13 +0000205 UnqualUsingEntry::Comparator());
206 }
207 };
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000208}
209
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000210// Retrieve the set of identifier namespaces that correspond to a
211// specific kind of name lookup.
John McCall1d7c5282009-12-18 10:40:03 +0000212static inline unsigned getIDNS(Sema::LookupNameKind NameKind,
213 bool CPlusPlus,
214 bool Redeclaration) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000215 unsigned IDNS = 0;
216 switch (NameKind) {
Fariborz Jahanian98a54032011-07-12 17:16:56 +0000217 case Sema::LookupObjCImplicitSelfParam:
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000218 case Sema::LookupOrdinaryName:
Douglas Gregord6f7e9d2009-02-24 20:03:32 +0000219 case Sema::LookupRedeclarationWithLinkage:
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000220 IDNS = Decl::IDNS_Ordinary;
John McCall1d7c5282009-12-18 10:40:03 +0000221 if (CPlusPlus) {
John McCall0d6b1642010-04-23 18:46:30 +0000222 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Member | Decl::IDNS_Namespace;
Chris Lattner337e5502011-02-18 01:27:55 +0000223 if (Redeclaration)
224 IDNS |= Decl::IDNS_TagFriend | Decl::IDNS_OrdinaryFriend;
John McCall1d7c5282009-12-18 10:40:03 +0000225 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000226 break;
227
John McCall76d32642010-04-24 01:30:58 +0000228 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;
233 break;
234
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000235 case Sema::LookupTagName:
John McCall0d6b1642010-04-23 18:46:30 +0000236 if (CPlusPlus) {
237 IDNS = Decl::IDNS_Type;
238
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.
244 if (Redeclaration)
245 IDNS |= Decl::IDNS_Tag | Decl::IDNS_TagFriend | Decl::IDNS_Namespace;
246 } else {
247 IDNS = Decl::IDNS_Tag;
248 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000249 break;
Chris Lattner337e5502011-02-18 01:27:55 +0000250 case Sema::LookupLabel:
251 IDNS = Decl::IDNS_Label;
252 break;
253
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000254 case Sema::LookupMemberName:
255 IDNS = Decl::IDNS_Member;
256 if (CPlusPlus)
Mike Stump1eb44332009-09-09 15:08:12 +0000257 IDNS |= Decl::IDNS_Tag | Decl::IDNS_Ordinary;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000258 break;
259
260 case Sema::LookupNestedNameSpecifierName:
John McCall0d6b1642010-04-23 18:46:30 +0000261 IDNS = Decl::IDNS_Type | Decl::IDNS_Namespace;
262 break;
263
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000264 case Sema::LookupNamespaceName:
John McCall0d6b1642010-04-23 18:46:30 +0000265 IDNS = Decl::IDNS_Namespace;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000266 break;
Douglas Gregor6e378de2009-04-23 23:18:26 +0000267
John McCall9f54ad42009-12-10 09:41:52 +0000268 case Sema::LookupUsingDeclName:
269 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag
270 | Decl::IDNS_Member | Decl::IDNS_Using;
271 break;
272
Douglas Gregor8fc463a2009-04-24 00:11:27 +0000273 case Sema::LookupObjCProtocolName:
274 IDNS = Decl::IDNS_ObjCProtocol;
275 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000276
Douglas Gregor8071e422010-08-15 06:18:01 +0000277 case Sema::LookupAnyName:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000278 IDNS = Decl::IDNS_Ordinary | Decl::IDNS_Tag | Decl::IDNS_Member
Douglas Gregor8071e422010-08-15 06:18:01 +0000279 | Decl::IDNS_Using | Decl::IDNS_Namespace | Decl::IDNS_ObjCProtocol
280 | Decl::IDNS_Type;
281 break;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000282 }
283 return IDNS;
284}
285
John McCall1d7c5282009-12-18 10:40:03 +0000286void LookupResult::configure() {
David Blaikie4e4d0842012-03-11 07:00:24 +0000287 IDNS = getIDNS(LookupKind, SemaRef.getLangOpts().CPlusPlus,
John McCall1d7c5282009-12-18 10:40:03 +0000288 isForRedeclaration());
Douglas Gregorb5b2ccb2010-03-24 05:07:21 +0000289
Douglas Gregorb5b2ccb2010-03-24 05:07:21 +0000290 if (!isForRedeclaration()) {
Douglas Gregor96df3562013-04-03 23:06:26 +0000291 // 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.
Abramo Bagnara25777432010-08-11 22:01:17 +0000294 switch (NameInfo.getName().getCXXOverloadedOperator()) {
Douglas Gregorb5b2ccb2010-03-24 05:07:21 +0000295 case OO_New:
296 case OO_Delete:
297 case OO_Array_New:
298 case OO_Array_Delete:
299 SemaRef.DeclareGlobalNewDelete();
300 break;
301
302 default:
303 break;
304 }
Douglas Gregor96df3562013-04-03 23:06:26 +0000305
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))
311 AllowHidden = true;
312 }
313 }
Douglas Gregorb5b2ccb2010-03-24 05:07:21 +0000314 }
John McCall1d7c5282009-12-18 10:40:03 +0000315}
316
Daniel Dunbarc2bd73b2012-03-08 01:43:06 +0000317void LookupResult::sanityImpl() const {
318 // Note that this function is never called by NDEBUG builds. See
319 // LookupResult::sanity().
John McCall2a7fb272010-08-25 05:32:35 +0000320 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 ||
Douglas Gregorf17b58c2010-10-22 22:08:47 +0000327 (Decls.size() == 1 && (Ambiguity == AmbiguousBaseSubobjects ||
328 Ambiguity == AmbiguousBaseSubobjectTypes)));
John McCall2a7fb272010-08-25 05:32:35 +0000329 assert((Paths != NULL) == (ResultKind == Ambiguous &&
330 (Ambiguity == AmbiguousBaseSubobjectTypes ||
331 Ambiguity == AmbiguousBaseSubobjects)));
332}
John McCall2a7fb272010-08-25 05:32:35 +0000333
John McCallf36e02d2009-10-09 21:13:30 +0000334// Necessary because CXXBasePaths is not complete in Sema.h
John McCall7d384dd2009-11-18 07:57:50 +0000335void LookupResult::deletePaths(CXXBasePaths *Paths) {
John McCallf36e02d2009-10-09 21:13:30 +0000336 delete Paths;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000337}
338
Douglas Gregor55368912011-12-14 16:03:29 +0000339static NamedDecl *getVisibleDecl(NamedDecl *D);
340
341NamedDecl *LookupResult::getAcceptableDeclSlow(NamedDecl *D) const {
342 return getVisibleDecl(D);
343}
344
John McCall7453ed42009-11-22 00:44:51 +0000345/// Resolves the result kind of this lookup.
John McCall7d384dd2009-11-18 07:57:50 +0000346void LookupResult::resolveKind() {
John McCallf36e02d2009-10-09 21:13:30 +0000347 unsigned N = Decls.size();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000348
John McCallf36e02d2009-10-09 21:13:30 +0000349 // Fast case: no possible ambiguity.
John McCall68263142009-11-18 22:49:29 +0000350 if (N == 0) {
John McCalldc5c7862010-01-15 21:27:01 +0000351 assert(ResultKind == NotFound || ResultKind == NotFoundInCurrentInstantiation);
John McCall68263142009-11-18 22:49:29 +0000352 return;
353 }
354
John McCall7453ed42009-11-22 00:44:51 +0000355 // If there's a single decl, we need to examine it to decide what
356 // kind of lookup this is.
John McCall7ba107a2009-11-18 02:36:19 +0000357 if (N == 1) {
Douglas Gregor2b147f02010-04-25 21:15:30 +0000358 NamedDecl *D = (*Decls.begin())->getUnderlyingDecl();
359 if (isa<FunctionTemplateDecl>(D))
John McCall7453ed42009-11-22 00:44:51 +0000360 ResultKind = FoundOverloaded;
Douglas Gregor2b147f02010-04-25 21:15:30 +0000361 else if (isa<UnresolvedUsingValueDecl>(D))
John McCall7ba107a2009-11-18 02:36:19 +0000362 ResultKind = FoundUnresolvedValue;
363 return;
364 }
John McCallf36e02d2009-10-09 21:13:30 +0000365
John McCall6e247262009-10-10 05:48:19 +0000366 // Don't do any extra resolution if we've already resolved as ambiguous.
John McCalla24dc2e2009-11-17 02:14:36 +0000367 if (ResultKind == Ambiguous) return;
John McCall6e247262009-10-10 05:48:19 +0000368
John McCallf36e02d2009-10-09 21:13:30 +0000369 llvm::SmallPtrSet<NamedDecl*, 16> Unique;
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000370 llvm::SmallPtrSet<QualType, 16> UniqueTypes;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000371
John McCallf36e02d2009-10-09 21:13:30 +0000372 bool Ambiguous = false;
373 bool HasTag = false, HasFunction = false, HasNonFunction = false;
John McCall7453ed42009-11-22 00:44:51 +0000374 bool HasFunctionTemplate = false, HasUnresolved = false;
John McCallf36e02d2009-10-09 21:13:30 +0000375
376 unsigned UniqueTagIndex = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000377
John McCallf36e02d2009-10-09 21:13:30 +0000378 unsigned I = 0;
379 while (I < N) {
John McCall314be4e2009-11-17 07:50:12 +0000380 NamedDecl *D = Decls[I]->getUnderlyingDecl();
381 D = cast<NamedDecl>(D->getCanonicalDecl());
John McCallf36e02d2009-10-09 21:13:30 +0000382
Argyrios Kyrtzidis745af1c2013-02-22 06:58:37 +0000383 // Ignore an invalid declaration unless it's the only one left.
384 if (D->isInvalidDecl() && I < N-1) {
385 Decls[I] = Decls[--N];
386 continue;
387 }
388
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000389 // 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
392 // canonical type.
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
398 // at this index.
399 Decls[I] = Decls[--N];
400 continue;
401 }
402 }
403 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000404
John McCall314be4e2009-11-17 07:50:12 +0000405 if (!Unique.insert(D)) {
John McCallf36e02d2009-10-09 21:13:30 +0000406 // If it's not unique, pull something off the back (and
407 // continue at this index).
408 Decls[I] = Decls[--N];
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000409 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000410 }
411
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000412 // Otherwise, do some decl type analysis and then continue.
John McCall7ba107a2009-11-18 02:36:19 +0000413
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000414 if (isa<UnresolvedUsingValueDecl>(D)) {
415 HasUnresolved = true;
416 } else if (isa<TagDecl>(D)) {
417 if (HasTag)
418 Ambiguous = true;
419 UniqueTagIndex = I;
420 HasTag = true;
421 } else if (isa<FunctionTemplateDecl>(D)) {
422 HasFunction = true;
423 HasFunctionTemplate = true;
424 } else if (isa<FunctionDecl>(D)) {
425 HasFunction = true;
426 } else {
427 if (HasNonFunction)
428 Ambiguous = true;
429 HasNonFunction = true;
Douglas Gregor7176fff2009-01-15 00:26:24 +0000430 }
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000431 I++;
Mike Stump1eb44332009-09-09 15:08:12 +0000432 }
Douglas Gregor516ff432009-04-24 02:57:34 +0000433
John McCallf36e02d2009-10-09 21:13:30 +0000434 // 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?)
John McCallfda8e122009-12-03 00:58:24 +0000443 if (HideTags && HasTag && !Ambiguous &&
Douglas Gregor77a1a882010-10-23 16:06:17 +0000444 (HasFunction || HasNonFunction || HasUnresolved)) {
445 if (Decls[UniqueTagIndex]->getDeclContext()->getRedeclContext()->Equals(
446 Decls[UniqueTagIndex? 0 : N-1]->getDeclContext()->getRedeclContext()))
447 Decls[UniqueTagIndex] = Decls[--N];
448 else
449 Ambiguous = true;
450 }
Anders Carlsson8b50d012009-06-26 03:37:05 +0000451
John McCallf36e02d2009-10-09 21:13:30 +0000452 Decls.set_size(N);
Douglas Gregor7176fff2009-01-15 00:26:24 +0000453
John McCallfda8e122009-12-03 00:58:24 +0000454 if (HasNonFunction && (HasFunction || HasUnresolved))
John McCallf36e02d2009-10-09 21:13:30 +0000455 Ambiguous = true;
Douglas Gregor69d993a2009-01-17 01:13:24 +0000456
John McCallf36e02d2009-10-09 21:13:30 +0000457 if (Ambiguous)
John McCall6e247262009-10-10 05:48:19 +0000458 setAmbiguous(LookupResult::AmbiguousReference);
John McCall7ba107a2009-11-18 02:36:19 +0000459 else if (HasUnresolved)
460 ResultKind = LookupResult::FoundUnresolvedValue;
John McCall7453ed42009-11-22 00:44:51 +0000461 else if (N > 1 || HasFunctionTemplate)
John McCalla24dc2e2009-11-17 02:14:36 +0000462 ResultKind = LookupResult::FoundOverloaded;
John McCallf36e02d2009-10-09 21:13:30 +0000463 else
John McCalla24dc2e2009-11-17 02:14:36 +0000464 ResultKind = LookupResult::Found;
Douglas Gregoreb11cd02009-01-14 22:20:51 +0000465}
466
John McCall7d384dd2009-11-18 07:57:50 +0000467void LookupResult::addDeclsFromBasePaths(const CXXBasePaths &P) {
John McCall6b2accb2010-02-10 09:31:12 +0000468 CXXBasePaths::const_paths_iterator I, E;
John McCallf36e02d2009-10-09 21:13:30 +0000469 for (I = P.begin(), E = P.end(); I != E; ++I)
David Blaikie3bc93e32012-12-19 00:45:41 +0000470 for (DeclContext::lookup_iterator DI = I->Decls.begin(),
471 DE = I->Decls.end(); DI != DE; ++DI)
John McCallf36e02d2009-10-09 21:13:30 +0000472 addDecl(*DI);
Douglas Gregor31a19b62009-04-01 21:51:26 +0000473}
474
John McCall7d384dd2009-11-18 07:57:50 +0000475void LookupResult::setAmbiguousBaseSubobjects(CXXBasePaths &P) {
John McCallf36e02d2009-10-09 21:13:30 +0000476 Paths = new CXXBasePaths;
477 Paths->swap(P);
478 addDeclsFromBasePaths(*Paths);
479 resolveKind();
John McCall6e247262009-10-10 05:48:19 +0000480 setAmbiguous(AmbiguousBaseSubobjects);
Douglas Gregord8635172009-02-02 21:35:47 +0000481}
482
John McCall7d384dd2009-11-18 07:57:50 +0000483void LookupResult::setAmbiguousBaseSubobjectTypes(CXXBasePaths &P) {
John McCallf36e02d2009-10-09 21:13:30 +0000484 Paths = new CXXBasePaths;
485 Paths->swap(P);
486 addDeclsFromBasePaths(*Paths);
487 resolveKind();
John McCall6e247262009-10-10 05:48:19 +0000488 setAmbiguous(AmbiguousBaseSubobjectTypes);
John McCallf36e02d2009-10-09 21:13:30 +0000489}
490
Chris Lattner5f9e2722011-07-23 10:55:15 +0000491void LookupResult::print(raw_ostream &Out) {
John McCallf36e02d2009-10-09 21:13:30 +0000492 Out << Decls.size() << " result(s)";
493 if (isAmbiguous()) Out << ", ambiguous";
494 if (Paths) Out << ", base paths present";
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000495
John McCallf36e02d2009-10-09 21:13:30 +0000496 for (iterator I = begin(), E = end(); I != E; ++I) {
497 Out << "\n";
498 (*I)->print(Out, 2);
499 }
500}
501
Douglas Gregor85910982010-02-12 05:48:04 +0000502/// \brief Lookup a builtin function, when name lookup would otherwise
503/// fail.
504static bool LookupBuiltin(Sema &S, LookupResult &R) {
505 Sema::LookupNameKind NameKind = R.getLookupKind();
506
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();
513 if (II) {
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.
David Blaikie4e4d0842012-03-11 07:00:24 +0000518 if (S.getLangOpts().CPlusPlus &&
Douglas Gregor85910982010-02-12 05:48:04 +0000519 S.Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
520 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000521
522 if (NamedDecl *D = S.LazilyCreateBuiltin((IdentifierInfo *)II,
523 BuiltinID, S.TUScope,
Douglas Gregor6b9109e2011-01-03 09:37:44 +0000524 R.isForRedeclaration(),
525 R.getNameLoc())) {
Douglas Gregor85910982010-02-12 05:48:04 +0000526 R.addDecl(D);
Douglas Gregor6b9109e2011-01-03 09:37:44 +0000527 return true;
528 }
529
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);
534 }
535
536 return false;
Douglas Gregor85910982010-02-12 05:48:04 +0000537 }
538 }
539 }
540
541 return false;
542}
543
Douglas Gregor4923aa22010-07-02 20:37:36 +0000544/// \brief Determine whether we can declare a special member function within
545/// the class at this point.
Richard Smithd0adeb62012-11-27 21:20:31 +0000546static bool CanDeclareSpecialMemberFunction(const CXXRecordDecl *Class) {
Douglas Gregor4923aa22010-07-02 20:37:36 +0000547 // We need to have a definition for the class.
548 if (!Class->getDefinition() || Class->isDependentContext())
549 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000550
Douglas Gregor4923aa22010-07-02 20:37:36 +0000551 // We can't be in the middle of defining the class.
Richard Smithd0adeb62012-11-27 21:20:31 +0000552 return !Class->isBeingDefined();
Douglas Gregor4923aa22010-07-02 20:37:36 +0000553}
554
555void Sema::ForceDeclarationOfImplicitMembers(CXXRecordDecl *Class) {
Richard Smithd0adeb62012-11-27 21:20:31 +0000556 if (!CanDeclareSpecialMemberFunction(Class))
Douglas Gregor22584312010-07-02 23:41:54 +0000557 return;
Douglas Gregor18274032010-07-03 00:47:00 +0000558
559 // If the default constructor has not yet been declared, do so now.
Sean Huntcdee3fe2011-05-11 22:34:38 +0000560 if (Class->needsImplicitDefaultConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +0000561 DeclareImplicitDefaultConstructor(Class);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000562
Douglas Gregor22584312010-07-02 23:41:54 +0000563 // If the copy constructor has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000564 if (Class->needsImplicitCopyConstructor())
Douglas Gregor22584312010-07-02 23:41:54 +0000565 DeclareImplicitCopyConstructor(Class);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000566
Douglas Gregora376d102010-07-02 21:50:04 +0000567 // If the copy assignment operator has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000568 if (Class->needsImplicitCopyAssignment())
Douglas Gregora376d102010-07-02 21:50:04 +0000569 DeclareImplicitCopyAssignment(Class);
570
Richard Smith80ad52f2013-01-02 11:42:31 +0000571 if (getLangOpts().CPlusPlus11) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000572 // If the move constructor has not yet been declared, do so now.
573 if (Class->needsImplicitMoveConstructor())
574 DeclareImplicitMoveConstructor(Class); // might not actually do it
575
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
579 }
580
Douglas Gregor4923aa22010-07-02 20:37:36 +0000581 // If the destructor has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000582 if (Class->needsImplicitDestructor())
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000583 DeclareImplicitDestructor(Class);
Douglas Gregor4923aa22010-07-02 20:37:36 +0000584}
585
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000586/// \brief Determine whether this is the name of an implicitly-declared
Douglas Gregora376d102010-07-02 21:50:04 +0000587/// special member function.
588static bool isImplicitlyDeclaredMemberFunctionName(DeclarationName Name) {
589 switch (Name.getNameKind()) {
Douglas Gregor22584312010-07-02 23:41:54 +0000590 case DeclarationName::CXXConstructorName:
Douglas Gregora376d102010-07-02 21:50:04 +0000591 case DeclarationName::CXXDestructorName:
592 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000593
Douglas Gregora376d102010-07-02 21:50:04 +0000594 case DeclarationName::CXXOperatorName:
595 return Name.getCXXOverloadedOperator() == OO_Equal;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000596
Douglas Gregora376d102010-07-02 21:50:04 +0000597 default:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000598 break;
Douglas Gregora376d102010-07-02 21:50:04 +0000599 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000600
Douglas Gregora376d102010-07-02 21:50:04 +0000601 return false;
602}
603
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.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000606static void DeclareImplicitMemberFunctionsWithName(Sema &S,
Douglas Gregora376d102010-07-02 21:50:04 +0000607 DeclarationName Name,
608 const DeclContext *DC) {
609 if (!DC)
610 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000611
Douglas Gregora376d102010-07-02 21:50:04 +0000612 switch (Name.getNameKind()) {
Douglas Gregor22584312010-07-02 23:41:54 +0000613 case DeclarationName::CXXConstructorName:
614 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
Richard Smithd0adeb62012-11-27 21:20:31 +0000615 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000616 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
Sean Huntcdee3fe2011-05-11 22:34:38 +0000617 if (Record->needsImplicitDefaultConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000618 S.DeclareImplicitDefaultConstructor(Class);
Richard Smithe5411b72012-12-01 02:35:44 +0000619 if (Record->needsImplicitCopyConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000620 S.DeclareImplicitCopyConstructor(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +0000621 if (S.getLangOpts().CPlusPlus11 &&
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000622 Record->needsImplicitMoveConstructor())
623 S.DeclareImplicitMoveConstructor(Class);
Douglas Gregor18274032010-07-03 00:47:00 +0000624 }
Douglas Gregor22584312010-07-02 23:41:54 +0000625 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000626
Douglas Gregora376d102010-07-02 21:50:04 +0000627 case DeclarationName::CXXDestructorName:
628 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
Richard Smithe5411b72012-12-01 02:35:44 +0000629 if (Record->getDefinition() && Record->needsImplicitDestructor() &&
Richard Smithd0adeb62012-11-27 21:20:31 +0000630 CanDeclareSpecialMemberFunction(Record))
Douglas Gregora376d102010-07-02 21:50:04 +0000631 S.DeclareImplicitDestructor(const_cast<CXXRecordDecl *>(Record));
Douglas Gregora376d102010-07-02 21:50:04 +0000632 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000633
Douglas Gregora376d102010-07-02 21:50:04 +0000634 case DeclarationName::CXXOperatorName:
635 if (Name.getCXXOverloadedOperator() != OO_Equal)
636 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000637
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000638 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC)) {
Richard Smithd0adeb62012-11-27 21:20:31 +0000639 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000640 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
Richard Smithe5411b72012-12-01 02:35:44 +0000641 if (Record->needsImplicitCopyAssignment())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000642 S.DeclareImplicitCopyAssignment(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +0000643 if (S.getLangOpts().CPlusPlus11 &&
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000644 Record->needsImplicitMoveAssignment())
645 S.DeclareImplicitMoveAssignment(Class);
646 }
647 }
Douglas Gregora376d102010-07-02 21:50:04 +0000648 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000649
Douglas Gregora376d102010-07-02 21:50:04 +0000650 default:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000651 break;
Douglas Gregora376d102010-07-02 21:50:04 +0000652 }
653}
Douglas Gregor4923aa22010-07-02 20:37:36 +0000654
John McCallf36e02d2009-10-09 21:13:30 +0000655// Adds all qualifying matches for a name within a decl context to the
656// given lookup result. Returns true if any matches were found.
Douglas Gregor85910982010-02-12 05:48:04 +0000657static bool LookupDirect(Sema &S, LookupResult &R, const DeclContext *DC) {
John McCallf36e02d2009-10-09 21:13:30 +0000658 bool Found = false;
659
Douglas Gregor4923aa22010-07-02 20:37:36 +0000660 // Lazily declare C++ special member functions.
David Blaikie4e4d0842012-03-11 07:00:24 +0000661 if (S.getLangOpts().CPlusPlus)
Douglas Gregora376d102010-07-02 21:50:04 +0000662 DeclareImplicitMemberFunctionsWithName(S, R.getLookupName(), DC);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000663
Douglas Gregor4923aa22010-07-02 20:37:36 +0000664 // Perform lookup into this declaration context.
David Blaikie3bc93e32012-12-19 00:45:41 +0000665 DeclContext::lookup_const_result DR = DC->lookup(R.getLookupName());
666 for (DeclContext::lookup_const_iterator I = DR.begin(), E = DR.end(); I != E;
667 ++I) {
John McCall46460a62010-01-20 21:53:11 +0000668 NamedDecl *D = *I;
Douglas Gregor55368912011-12-14 16:03:29 +0000669 if ((D = R.getAcceptableDecl(D))) {
John McCall46460a62010-01-20 21:53:11 +0000670 R.addDecl(D);
Douglas Gregor48026d22010-01-11 18:40:55 +0000671 Found = true;
672 }
673 }
John McCallf36e02d2009-10-09 21:13:30 +0000674
Douglas Gregor85910982010-02-12 05:48:04 +0000675 if (!Found && DC->isTranslationUnit() && LookupBuiltin(S, R))
676 return true;
677
Douglas Gregor48026d22010-01-11 18:40:55 +0000678 if (R.getLookupName().getNameKind()
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000679 != DeclarationName::CXXConversionFunctionName ||
680 R.getLookupName().getCXXNameType()->isDependentType() ||
681 !isa<CXXRecordDecl>(DC))
682 return Found;
683
684 // C++ [temp.mem]p6:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000685 // A specialization of a conversion function template is not found by
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000686 // name lookup. Instead, any conversion function templates visible in the
687 // context of the use are considered. [...]
688 const CXXRecordDecl *Record = cast<CXXRecordDecl>(DC);
John McCall5e1cdac2011-10-07 06:10:15 +0000689 if (!Record->isCompleteDefinition())
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000690 return Found;
691
Argyrios Kyrtzidis9d295432012-11-28 03:56:09 +0000692 for (CXXRecordDecl::conversion_iterator U = Record->conversion_begin(),
693 UEnd = Record->conversion_end(); U != UEnd; ++U) {
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000694 FunctionTemplateDecl *ConvTemplate = dyn_cast<FunctionTemplateDecl>(*U);
695 if (!ConvTemplate)
696 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000697
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000698 // When we're performing lookup for the purposes of redeclaration, just
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000699 // add the conversion function template. When we deduce template
700 // arguments for specializations, we'll end up unifying the return
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000701 // type of the new declaration with the type of the function template.
702 if (R.isForRedeclaration()) {
703 R.addDecl(ConvTemplate);
704 Found = true;
705 continue;
706 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000707
Douglas Gregor48026d22010-01-11 18:40:55 +0000708 // C++ [temp.mem]p6:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000709 // [...] For each such operator, if argument deduction succeeds
710 // (14.9.2.3), the resulting specialization is used as if found by
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000711 // name lookup.
712 //
713 // When referencing a conversion function for any purpose other than
714 // a redeclaration (such that we'll be building an expression with the
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000715 // result), perform template argument deduction and place the
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000716 // specialization into the result set. We do this to avoid forcing all
717 // callers to perform special deduction for conversion functions.
Craig Topper93e45992012-09-19 02:26:47 +0000718 TemplateDeductionInfo Info(R.getNameLoc());
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000719 FunctionDecl *Specialization = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000720
721 const FunctionProtoType *ConvProto
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000722 = ConvTemplate->getTemplatedDecl()->getType()->getAs<FunctionProtoType>();
723 assert(ConvProto && "Nonsensical conversion function template type");
Douglas Gregor3f477a12010-01-12 01:17:50 +0000724
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000725 // 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!
John McCalle23cf432010-12-14 08:05:40 +0000728 FunctionProtoType::ExtProtoInfo EPI = ConvProto->getExtProtoInfo();
729 EPI.ExtInfo = EPI.ExtInfo.withCallingConv(CC_Default);
Sebastian Redl8b5b4092011-03-06 10:52:04 +0000730 EPI.ExceptionSpecType = EST_None;
John McCalle23cf432010-12-14 08:05:40 +0000731 EPI.NumExceptions = 0;
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000732 QualType ExpectedType
733 = R.getSema().Context.getFunctionType(R.getLookupName().getCXXNameType(),
Jordan Rosebea522f2013-03-08 21:51:21 +0000734 ArrayRef<QualType>(), EPI);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000735
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000736 // 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);
742 Found = true;
Douglas Gregor48026d22010-01-11 18:40:55 +0000743 }
744 }
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000745
John McCallf36e02d2009-10-09 21:13:30 +0000746 return Found;
747}
748
John McCalld7be78a2009-11-10 07:01:13 +0000749// Performs C++ unqualified lookup into the given file context.
John McCallf36e02d2009-10-09 21:13:30 +0000750static bool
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000751CppNamespaceLookup(Sema &S, LookupResult &R, ASTContext &Context,
Douglas Gregor85910982010-02-12 05:48:04 +0000752 DeclContext *NS, UnqualUsingDirectiveSet &UDirs) {
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000753
754 assert(NS && NS->isFileContext() && "CppNamespaceLookup() requires namespace!");
755
John McCalld7be78a2009-11-10 07:01:13 +0000756 // Perform direct name lookup into the LookupCtx.
Douglas Gregor85910982010-02-12 05:48:04 +0000757 bool Found = LookupDirect(S, R, NS);
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000758
John McCalld7be78a2009-11-10 07:01:13 +0000759 // 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);
Mike Stump1eb44332009-09-09 15:08:12 +0000763
John McCalld7be78a2009-11-10 07:01:13 +0000764 for (; UI != UEnd; ++UI)
Douglas Gregor85910982010-02-12 05:48:04 +0000765 if (LookupDirect(S, R, UI->getNominatedNamespace()))
John McCalld7be78a2009-11-10 07:01:13 +0000766 Found = true;
John McCallf36e02d2009-10-09 21:13:30 +0000767
768 R.resolveKind();
769
770 return Found;
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000771}
772
773static bool isNamespaceOrTranslationUnitScope(Scope *S) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000774 if (DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity()))
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000775 return Ctx->isFileContext();
776 return false;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000777}
Douglas Gregor4c921ae2009-01-30 01:04:22 +0000778
Douglas Gregor711be1e2010-03-15 14:33:29 +0000779// 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.
786static std::pair<DeclContext *, bool> findOuterContext(Scope *S) {
787 DeclContext *DC = static_cast<DeclContext *>(S->getEntity());
788 DeclContext *Lexical = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000789 for (Scope *OuterS = S->getParent(); OuterS;
Douglas Gregor711be1e2010-03-15 14:33:29 +0000790 OuterS = OuterS->getParent()) {
791 if (OuterS->getEntity()) {
Douglas Gregordbdf5e72010-03-15 15:26:48 +0000792 Lexical = static_cast<DeclContext *>(OuterS->getEntity());
Douglas Gregor711be1e2010-03-15 14:33:29 +0000793 break;
794 }
795 }
796
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.
802 //
803 // Example:
804 //
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000805 // namespace N {
806 // class C { };
Douglas Gregor711be1e2010-03-15 14:33:29 +0000807 //
808 // template<class T> class B {
809 // void f(T);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000810 // };
Douglas Gregor711be1e2010-03-15 14:33:29 +0000811 // }
812 //
813 // template<class C> void N::B<C>::f(C) {
814 // C b; // C is the template parameter, not N::C
815 // }
816 //
817 // In this example, the lexical context we return is the
818 // TranslationUnit, while the semantic context is the namespace N.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000819 if (!Lexical || !DC || !S->getParent() ||
Douglas Gregor711be1e2010-03-15 14:33:29 +0000820 !S->getParent()->isTemplateParamScope())
821 return std::make_pair(Lexical, false);
822
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000823 // Find the outermost template parameter scope.
Douglas Gregor711be1e2010-03-15 14:33:29 +0000824 // 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();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000830
Douglas Gregor711be1e2010-03-15 14:33:29 +0000831 // 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();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000836
Douglas Gregor711be1e2010-03-15 14:33:29 +0000837 // 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);
844
845 return std::make_pair(Lexical, false);
Douglas Gregore942bbe2009-09-10 16:57:35 +0000846}
847
John McCalla24dc2e2009-11-17 02:14:36 +0000848bool Sema::CppLookupName(LookupResult &R, Scope *S) {
David Blaikie4e4d0842012-03-11 07:00:24 +0000849 assert(getLangOpts().CPlusPlus && "Can perform only C++ lookup");
John McCalla24dc2e2009-11-17 02:14:36 +0000850
851 DeclarationName Name = R.getLookupName();
852
Douglas Gregora376d102010-07-02 21:50:04 +0000853 // 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);
859 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000860
Douglas Gregora376d102010-07-02 21:50:04 +0000861 // Implicitly declare member functions with the name we're looking for, if in
862 // fact we are in a scope where it matters.
863
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000864 Scope *Initial = S;
Mike Stump1eb44332009-09-09 15:08:12 +0000865 IdentifierResolver::iterator
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000866 I = IdResolver.begin(Name),
867 IEnd = IdResolver.end();
Douglas Gregor4c921ae2009-01-30 01:04:22 +0000868
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000869 // First we lookup local scope.
Douglas Gregoraaba5e32009-02-04 19:02:06 +0000870 // We don't consider using-directives, as per 7.3.4.p1 [namespace.udir]
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000871 // ...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.
Eli Friedman33a31382009-08-05 19:21:58 +0000874 // [Note: in this context, "contains" means "contains directly or
Mike Stump1eb44332009-09-09 15:08:12 +0000875 // indirectly".
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000876 //
877 // For example:
878 // namespace A { int i; }
879 // void foo() {
880 // int i;
881 // {
882 // using namespace A;
883 // ++i; // finds local 'i', A::i appears at global scope
884 // }
885 // }
Douglas Gregor47b9a1c2009-02-04 17:27:36 +0000886 //
Douglas Gregor711be1e2010-03-15 14:33:29 +0000887 DeclContext *OutsideOfTemplateParamDC = 0;
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000888 for (; S && !isNamespaceOrTranslationUnitScope(S); S = S->getParent()) {
Douglas Gregord2235f62010-05-20 20:58:56 +0000889 DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity());
890
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000891 // Check whether the IdResolver has anything in this scope.
John McCallf36e02d2009-10-09 21:13:30 +0000892 bool Found = false;
John McCalld226f652010-08-21 09:40:31 +0000893 for (; I != IEnd && S->isDeclScope(*I); ++I) {
Douglas Gregor55368912011-12-14 16:03:29 +0000894 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
John McCallf36e02d2009-10-09 21:13:30 +0000895 Found = true;
Douglas Gregor55368912011-12-14 16:03:29 +0000896 R.addDecl(ND);
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000897 }
898 }
John McCallf36e02d2009-10-09 21:13:30 +0000899 if (Found) {
900 R.resolveKind();
Douglas Gregord2235f62010-05-20 20:58:56 +0000901 if (S->isClassScope())
902 if (CXXRecordDecl *Record = dyn_cast_or_null<CXXRecordDecl>(Ctx))
903 R.setNamingClass(Record);
John McCallf36e02d2009-10-09 21:13:30 +0000904 return true;
905 }
906
Douglas Gregor711be1e2010-03-15 14:33:29 +0000907 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
908 S->getParent() && !S->getParent()->isTemplateParamScope()) {
909 // We've just searched the last template parameter scope and
Sylvestre Ledrubed28ac2012-07-23 08:59:39 +0000910 // found nothing, so look into the contexts between the
Douglas Gregor711be1e2010-03-15 14:33:29 +0000911 // lexical and semantic declaration contexts returned by
912 // findOuterContext(). This implements the name lookup behavior
913 // of C++ [temp.local]p8.
914 Ctx = OutsideOfTemplateParamDC;
915 OutsideOfTemplateParamDC = 0;
916 }
917
918 if (Ctx) {
919 DeclContext *OuterCtx;
920 bool SearchAfterTemplateScope;
921 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
922 if (SearchAfterTemplateScope)
923 OutsideOfTemplateParamDC = OuterCtx;
924
Douglas Gregordbdf5e72010-03-15 15:26:48 +0000925 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
Douglas Gregor36262b82010-02-19 16:08:35 +0000926 // We do not directly look into transparent contexts, since
927 // those entities will be found in the nearest enclosing
928 // non-transparent context.
929 if (Ctx->isTransparentContext())
Douglas Gregore942bbe2009-09-10 16:57:35 +0000930 continue;
Douglas Gregor36262b82010-02-19 16:08:35 +0000931
932 // We do not look directly into function or method contexts,
933 // since all of the local variables and parameters of the
934 // function/method are present within the Scope.
935 if (Ctx->isFunctionOrMethod()) {
936 // If we have an Objective-C instance method, look for ivars
937 // in the corresponding interface.
938 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
939 if (Method->isInstanceMethod() && Name.getAsIdentifierInfo())
940 if (ObjCInterfaceDecl *Class = Method->getClassInterface()) {
941 ObjCInterfaceDecl *ClassDeclared;
942 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000943 Name.getAsIdentifierInfo(),
Douglas Gregor36262b82010-02-19 16:08:35 +0000944 ClassDeclared)) {
Douglas Gregor55368912011-12-14 16:03:29 +0000945 if (NamedDecl *ND = R.getAcceptableDecl(Ivar)) {
946 R.addDecl(ND);
Douglas Gregor36262b82010-02-19 16:08:35 +0000947 R.resolveKind();
948 return true;
949 }
950 }
951 }
952 }
953
954 continue;
955 }
956
Douglas Gregor6bed88e2013-03-27 12:51:49 +0000957 // If this is a file context, we need to perform unqualified name
958 // lookup considering using directives.
959 if (Ctx->isFileContext()) {
960 UnqualUsingDirectiveSet UDirs;
961 UDirs.visit(Ctx, Ctx);
962 UDirs.done();
963
964 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs)) {
965 R.resolveKind();
966 return true;
967 }
968
969 continue;
970 }
971
Douglas Gregore942bbe2009-09-10 16:57:35 +0000972 // Perform qualified name lookup into this context.
973 // FIXME: In some cases, we know that every name that could be found by
974 // this qualified name lookup will also be on the identifier chain. For
975 // example, inside a class without any base classes, we never need to
976 // perform qualified lookup because all of the members are on top of the
977 // identifier chain.
Douglas Gregor7d3f5762010-01-15 01:44:47 +0000978 if (LookupQualifiedName(R, Ctx, /*InUnqualifiedLookup=*/true))
John McCallf36e02d2009-10-09 21:13:30 +0000979 return true;
Douglas Gregor551f48c2009-03-27 04:21:56 +0000980 }
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000981 }
Douglas Gregor4c921ae2009-01-30 01:04:22 +0000982 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000983
John McCalld7be78a2009-11-10 07:01:13 +0000984 // Stop if we ran out of scopes.
985 // FIXME: This really, really shouldn't be happening.
986 if (!S) return false;
987
Argyrios Kyrtzidis78f59112010-10-29 16:12:50 +0000988 // If we are looking for members, no need to look into global/namespace scope.
989 if (R.getLookupKind() == LookupMemberName)
990 return false;
991
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000992 // Collect UsingDirectiveDecls in all scopes, and recursively all
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000993 // nominated namespaces by those using-directives.
John McCalld7be78a2009-11-10 07:01:13 +0000994 //
Mike Stump390b4cc2009-05-16 07:39:55 +0000995 // FIXME: Cache this sorted list in Scope structure, and DeclContext, so we
996 // don't build it for each lookup!
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000997
John McCalld7be78a2009-11-10 07:01:13 +0000998 UnqualUsingDirectiveSet UDirs;
999 UDirs.visitScopeChain(Initial, S);
1000 UDirs.done();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001001
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001002 // Lookup namespace scope, and global scope.
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001003 // Unqualified name lookup in C++ requires looking into scopes
1004 // that aren't strictly lexical, and therefore we walk through the
1005 // context as well as walking through the scopes.
1006 for (; S; S = S->getParent()) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001007 // Check whether the IdResolver has anything in this scope.
John McCallf36e02d2009-10-09 21:13:30 +00001008 bool Found = false;
John McCalld226f652010-08-21 09:40:31 +00001009 for (; I != IEnd && S->isDeclScope(*I); ++I) {
Douglas Gregor55368912011-12-14 16:03:29 +00001010 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001011 // We found something. Look for anything else in our scope
1012 // with this same name and in an acceptable identifier
1013 // namespace, so that we can construct an overload set if we
1014 // need to.
John McCallf36e02d2009-10-09 21:13:30 +00001015 Found = true;
Douglas Gregor55368912011-12-14 16:03:29 +00001016 R.addDecl(ND);
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001017 }
1018 }
1019
Douglas Gregor00b4b032010-05-14 04:53:42 +00001020 if (Found && S->isTemplateParamScope()) {
John McCallf36e02d2009-10-09 21:13:30 +00001021 R.resolveKind();
1022 return true;
1023 }
1024
Douglas Gregor00b4b032010-05-14 04:53:42 +00001025 DeclContext *Ctx = static_cast<DeclContext *>(S->getEntity());
1026 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
1027 S->getParent() && !S->getParent()->isTemplateParamScope()) {
1028 // We've just searched the last template parameter scope and
Sylvestre Ledrubed28ac2012-07-23 08:59:39 +00001029 // found nothing, so look into the contexts between the
Douglas Gregor00b4b032010-05-14 04:53:42 +00001030 // lexical and semantic declaration contexts returned by
1031 // findOuterContext(). This implements the name lookup behavior
1032 // of C++ [temp.local]p8.
1033 Ctx = OutsideOfTemplateParamDC;
1034 OutsideOfTemplateParamDC = 0;
1035 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001036
Douglas Gregor00b4b032010-05-14 04:53:42 +00001037 if (Ctx) {
1038 DeclContext *OuterCtx;
1039 bool SearchAfterTemplateScope;
1040 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
1041 if (SearchAfterTemplateScope)
1042 OutsideOfTemplateParamDC = OuterCtx;
1043
1044 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
1045 // We do not directly look into transparent contexts, since
1046 // those entities will be found in the nearest enclosing
1047 // non-transparent context.
1048 if (Ctx->isTransparentContext())
1049 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001050
Douglas Gregor00b4b032010-05-14 04:53:42 +00001051 // If we have a context, and it's not a context stashed in the
1052 // template parameter scope for an out-of-line definition, also
1053 // look into that context.
1054 if (!(Found && S && S->isTemplateParamScope())) {
1055 assert(Ctx->isFileContext() &&
1056 "We should have been looking only at file context here already.");
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001057
Douglas Gregor00b4b032010-05-14 04:53:42 +00001058 // Look into context considering using-directives.
1059 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs))
1060 Found = true;
1061 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001062
Douglas Gregor00b4b032010-05-14 04:53:42 +00001063 if (Found) {
1064 R.resolveKind();
1065 return true;
1066 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001067
Douglas Gregor00b4b032010-05-14 04:53:42 +00001068 if (R.isForRedeclaration() && !Ctx->isTransparentContext())
1069 return false;
1070 }
1071 }
1072
Douglas Gregor1df0ee92010-02-05 07:07:10 +00001073 if (R.isForRedeclaration() && Ctx && !Ctx->isTransparentContext())
John McCallf36e02d2009-10-09 21:13:30 +00001074 return false;
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001075 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001076
John McCallf36e02d2009-10-09 21:13:30 +00001077 return !R.empty();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001078}
1079
Douglas Gregor55368912011-12-14 16:03:29 +00001080/// \brief Retrieve the visible declaration corresponding to D, if any.
1081///
1082/// This routine determines whether the declaration D is visible in the current
1083/// module, with the current imports. If not, it checks whether any
1084/// redeclaration of D is visible, and if so, returns that declaration.
1085///
1086/// \returns D, or a visible previous declaration of D, whichever is more recent
1087/// and visible. If no declaration of D is visible, returns null.
1088static NamedDecl *getVisibleDecl(NamedDecl *D) {
1089 if (LookupResult::isVisible(D))
1090 return D;
1091
Douglas Gregor0782ef22012-01-06 22:05:37 +00001092 for (Decl::redecl_iterator RD = D->redecls_begin(), RDEnd = D->redecls_end();
1093 RD != RDEnd; ++RD) {
David Blaikie581deb32012-06-06 20:45:41 +00001094 if (NamedDecl *ND = dyn_cast<NamedDecl>(*RD)) {
Douglas Gregor0782ef22012-01-06 22:05:37 +00001095 if (LookupResult::isVisible(ND))
1096 return ND;
1097 }
Douglas Gregor55368912011-12-14 16:03:29 +00001098 }
1099
1100 return 0;
1101}
1102
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001103/// @brief Perform unqualified name lookup starting from a given
1104/// scope.
1105///
1106/// Unqualified name lookup (C++ [basic.lookup.unqual], C99 6.2.1) is
1107/// used to find names within the current scope. For example, 'x' in
1108/// @code
1109/// int x;
1110/// int f() {
1111/// return x; // unqualified name look finds 'x' in the global scope
1112/// }
1113/// @endcode
1114///
1115/// Different lookup criteria can find different names. For example, a
1116/// particular scope can have both a struct and a function of the same
1117/// name, and each can be found by certain lookup criteria. For more
1118/// information about lookup criteria, see the documentation for the
1119/// class LookupCriteria.
1120///
1121/// @param S The scope from which unqualified name lookup will
1122/// begin. If the lookup criteria permits, name lookup may also search
1123/// in the parent scopes.
1124///
James Dennett8da16872012-06-22 10:32:46 +00001125/// @param [in,out] R Specifies the lookup to perform (e.g., the name to
1126/// look up and the lookup kind), and is updated with the results of lookup
1127/// including zero or more declarations and possibly additional information
1128/// used to diagnose ambiguities.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001129///
James Dennett8da16872012-06-22 10:32:46 +00001130/// @returns \c true if lookup succeeded and false otherwise.
John McCalla24dc2e2009-11-17 02:14:36 +00001131bool Sema::LookupName(LookupResult &R, Scope *S, bool AllowBuiltinCreation) {
1132 DeclarationName Name = R.getLookupName();
John McCallf36e02d2009-10-09 21:13:30 +00001133 if (!Name) return false;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001134
John McCalla24dc2e2009-11-17 02:14:36 +00001135 LookupNameKind NameKind = R.getLookupKind();
1136
David Blaikie4e4d0842012-03-11 07:00:24 +00001137 if (!getLangOpts().CPlusPlus) {
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001138 // Unqualified name lookup in C/Objective-C is purely lexical, so
1139 // search in the declarations attached to the name.
John McCall1d7c5282009-12-18 10:40:03 +00001140 if (NameKind == Sema::LookupRedeclarationWithLinkage) {
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001141 // Find the nearest non-transparent declaration scope.
1142 while (!(S->getFlags() & Scope::DeclScope) ||
Mike Stump1eb44332009-09-09 15:08:12 +00001143 (S->getEntity() &&
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001144 static_cast<DeclContext *>(S->getEntity())
1145 ->isTransparentContext()))
1146 S = S->getParent();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001147 }
1148
John McCall1d7c5282009-12-18 10:40:03 +00001149 unsigned IDNS = R.getIdentifierNamespace();
1150
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001151 // Scan up the scope chain looking for a decl that matches this
1152 // identifier that is in the appropriate namespace. This search
1153 // should not take long, as shadowing of names is uncommon, and
1154 // deep shadowing is extremely uncommon.
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001155 bool LeftStartingScope = false;
1156
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001157 for (IdentifierResolver::iterator I = IdResolver.begin(Name),
Mike Stump1eb44332009-09-09 15:08:12 +00001158 IEnd = IdResolver.end();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001159 I != IEnd; ++I)
Douglas Gregorf9201e02009-02-11 23:02:49 +00001160 if ((*I)->isInIdentifierNamespace(IDNS)) {
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001161 if (NameKind == LookupRedeclarationWithLinkage) {
1162 // Determine whether this (or a previous) declaration is
1163 // out-of-scope.
John McCalld226f652010-08-21 09:40:31 +00001164 if (!LeftStartingScope && !S->isDeclScope(*I))
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001165 LeftStartingScope = true;
1166
1167 // If we found something outside of our starting scope that
1168 // does not have linkage, skip it.
1169 if (LeftStartingScope && !((*I)->hasLinkage()))
1170 continue;
1171 }
Fariborz Jahanian98a54032011-07-12 17:16:56 +00001172 else if (NameKind == LookupObjCImplicitSelfParam &&
1173 !isa<ImplicitParamDecl>(*I))
1174 continue;
1175
Douglas Gregor10ce9322011-12-02 20:08:44 +00001176 // If this declaration is module-private and it came from an AST
1177 // file, we can't see it.
Douglas Gregor447af242012-01-05 01:11:47 +00001178 NamedDecl *D = R.isHiddenDeclarationVisible()? *I : getVisibleDecl(*I);
Douglas Gregor55368912011-12-14 16:03:29 +00001179 if (!D)
Douglas Gregor10ce9322011-12-02 20:08:44 +00001180 continue;
Douglas Gregor55368912011-12-14 16:03:29 +00001181
1182 R.addDecl(D);
John McCallf36e02d2009-10-09 21:13:30 +00001183
Douglas Gregor7a537402012-01-03 23:26:26 +00001184 // Check whether there are any other declarations with the same name
1185 // and in the same scope.
Douglas Gregorda795b42012-01-04 16:44:10 +00001186 if (I != IEnd) {
Douglas Gregor117c4562012-01-13 23:06:53 +00001187 // Find the scope in which this declaration was declared (if it
1188 // actually exists in a Scope).
1189 while (S && !S->isDeclScope(D))
1190 S = S->getParent();
1191
1192 // If the scope containing the declaration is the translation unit,
1193 // then we'll need to perform our checks based on the matching
1194 // DeclContexts rather than matching scopes.
1195 if (S && isNamespaceOrTranslationUnitScope(S))
1196 S = 0;
1197
1198 // Compute the DeclContext, if we need it.
1199 DeclContext *DC = 0;
1200 if (!S)
1201 DC = (*I)->getDeclContext()->getRedeclContext();
1202
Douglas Gregorda795b42012-01-04 16:44:10 +00001203 IdentifierResolver::iterator LastI = I;
1204 for (++LastI; LastI != IEnd; ++LastI) {
Douglas Gregor117c4562012-01-13 23:06:53 +00001205 if (S) {
1206 // Match based on scope.
1207 if (!S->isDeclScope(*LastI))
1208 break;
1209 } else {
1210 // Match based on DeclContext.
1211 DeclContext *LastDC
1212 = (*LastI)->getDeclContext()->getRedeclContext();
1213 if (!LastDC->Equals(DC))
1214 break;
1215 }
1216
1217 // If the declaration isn't in the right namespace, skip it.
Douglas Gregorda795b42012-01-04 16:44:10 +00001218 if (!(*LastI)->isInIdentifierNamespace(IDNS))
1219 continue;
Douglas Gregor117c4562012-01-13 23:06:53 +00001220
Douglas Gregor447af242012-01-05 01:11:47 +00001221 D = R.isHiddenDeclarationVisible()? *LastI : getVisibleDecl(*LastI);
Douglas Gregorda795b42012-01-04 16:44:10 +00001222 if (D)
1223 R.addDecl(D);
1224 }
Douglas Gregorf9201e02009-02-11 23:02:49 +00001225
Douglas Gregorda795b42012-01-04 16:44:10 +00001226 R.resolveKind();
Douglas Gregorf9201e02009-02-11 23:02:49 +00001227 }
John McCallf36e02d2009-10-09 21:13:30 +00001228 return true;
Douglas Gregorf9201e02009-02-11 23:02:49 +00001229 }
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001230 } else {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001231 // Perform C++ unqualified name lookup.
John McCalla24dc2e2009-11-17 02:14:36 +00001232 if (CppLookupName(R, S))
John McCallf36e02d2009-10-09 21:13:30 +00001233 return true;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001234 }
1235
1236 // If we didn't find a use of this identifier, and if the identifier
1237 // corresponds to a compiler builtin, create the decl object for the builtin
1238 // now, injecting it into translation unit scope, and return it.
Axel Naumann42151d52011-04-13 13:19:46 +00001239 if (AllowBuiltinCreation && LookupBuiltin(*this, R))
1240 return true;
Douglas Gregor3e41d602009-02-13 23:20:09 +00001241
Axel Naumannf8291a12011-02-24 16:47:47 +00001242 // If we didn't find a use of this identifier, the ExternalSource
1243 // may be able to handle the situation.
1244 // Note: some lookup failures are expected!
1245 // See e.g. R.isForRedeclaration().
1246 return (ExternalSource && ExternalSource->LookupUnqualified(R, S));
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001247}
1248
John McCall6e247262009-10-10 05:48:19 +00001249/// @brief Perform qualified name lookup in the namespaces nominated by
1250/// using directives by the given context.
1251///
1252/// C++98 [namespace.qual]p2:
James Dennett7ba75922012-06-19 21:05:49 +00001253/// Given X::m (where X is a user-declared namespace), or given \::m
John McCall6e247262009-10-10 05:48:19 +00001254/// (where X is the global namespace), let S be the set of all
1255/// declarations of m in X and in the transitive closure of all
1256/// namespaces nominated by using-directives in X and its used
1257/// namespaces, except that using-directives are ignored in any
1258/// namespace, including X, directly containing one or more
1259/// declarations of m. No namespace is searched more than once in
1260/// the lookup of a name. If S is the empty set, the program is
1261/// ill-formed. Otherwise, if S has exactly one member, or if the
1262/// context of the reference is a using-declaration
1263/// (namespace.udecl), S is the required set of declarations of
1264/// m. Otherwise if the use of m is not one that allows a unique
1265/// declaration to be chosen from S, the program is ill-formed.
James Dennett7ba75922012-06-19 21:05:49 +00001266///
John McCall6e247262009-10-10 05:48:19 +00001267/// C++98 [namespace.qual]p5:
1268/// During the lookup of a qualified namespace member name, if the
1269/// lookup finds more than one declaration of the member, and if one
1270/// declaration introduces a class name or enumeration name and the
1271/// other declarations either introduce the same object, the same
1272/// enumerator or a set of functions, the non-type name hides the
1273/// class or enumeration name if and only if the declarations are
1274/// from the same namespace; otherwise (the declarations are from
1275/// different namespaces), the program is ill-formed.
Douglas Gregor85910982010-02-12 05:48:04 +00001276static bool LookupQualifiedNameInUsingDirectives(Sema &S, LookupResult &R,
John McCalla24dc2e2009-11-17 02:14:36 +00001277 DeclContext *StartDC) {
John McCall6e247262009-10-10 05:48:19 +00001278 assert(StartDC->isFileContext() && "start context is not a file context");
1279
1280 DeclContext::udir_iterator I = StartDC->using_directives_begin();
1281 DeclContext::udir_iterator E = StartDC->using_directives_end();
1282
1283 if (I == E) return false;
1284
1285 // We have at least added all these contexts to the queue.
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001286 llvm::SmallPtrSet<DeclContext*, 8> Visited;
John McCall6e247262009-10-10 05:48:19 +00001287 Visited.insert(StartDC);
1288
1289 // We have not yet looked into these namespaces, much less added
1290 // their "using-children" to the queue.
Chris Lattner5f9e2722011-07-23 10:55:15 +00001291 SmallVector<NamespaceDecl*, 8> Queue;
John McCall6e247262009-10-10 05:48:19 +00001292
1293 // We have already looked into the initial namespace; seed the queue
1294 // with its using-children.
1295 for (; I != E; ++I) {
John McCalld9f01d42009-11-10 09:25:37 +00001296 NamespaceDecl *ND = (*I)->getNominatedNamespace()->getOriginalNamespace();
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001297 if (Visited.insert(ND))
John McCall6e247262009-10-10 05:48:19 +00001298 Queue.push_back(ND);
1299 }
1300
1301 // The easiest way to implement the restriction in [namespace.qual]p5
1302 // is to check whether any of the individual results found a tag
1303 // and, if so, to declare an ambiguity if the final result is not
1304 // a tag.
1305 bool FoundTag = false;
1306 bool FoundNonTag = false;
1307
John McCall7d384dd2009-11-18 07:57:50 +00001308 LookupResult LocalR(LookupResult::Temporary, R);
John McCall6e247262009-10-10 05:48:19 +00001309
1310 bool Found = false;
1311 while (!Queue.empty()) {
1312 NamespaceDecl *ND = Queue.back();
1313 Queue.pop_back();
1314
1315 // We go through some convolutions here to avoid copying results
1316 // between LookupResults.
1317 bool UseLocal = !R.empty();
John McCall7d384dd2009-11-18 07:57:50 +00001318 LookupResult &DirectR = UseLocal ? LocalR : R;
Douglas Gregor85910982010-02-12 05:48:04 +00001319 bool FoundDirect = LookupDirect(S, DirectR, ND);
John McCall6e247262009-10-10 05:48:19 +00001320
1321 if (FoundDirect) {
1322 // First do any local hiding.
1323 DirectR.resolveKind();
1324
1325 // If the local result is a tag, remember that.
1326 if (DirectR.isSingleTagDecl())
1327 FoundTag = true;
1328 else
1329 FoundNonTag = true;
1330
1331 // Append the local results to the total results if necessary.
1332 if (UseLocal) {
1333 R.addAllDecls(LocalR);
1334 LocalR.clear();
1335 }
1336 }
1337
1338 // If we find names in this namespace, ignore its using directives.
1339 if (FoundDirect) {
1340 Found = true;
1341 continue;
1342 }
1343
1344 for (llvm::tie(I,E) = ND->getUsingDirectives(); I != E; ++I) {
1345 NamespaceDecl *Nom = (*I)->getNominatedNamespace();
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001346 if (Visited.insert(Nom))
John McCall6e247262009-10-10 05:48:19 +00001347 Queue.push_back(Nom);
1348 }
1349 }
1350
1351 if (Found) {
1352 if (FoundTag && FoundNonTag)
1353 R.setAmbiguousQualifiedTagHiding();
1354 else
1355 R.resolveKind();
1356 }
1357
1358 return Found;
1359}
1360
Douglas Gregor8071e422010-08-15 06:18:01 +00001361/// \brief Callback that looks for any member of a class with the given name.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001362static bool LookupAnyMember(const CXXBaseSpecifier *Specifier,
Douglas Gregor8071e422010-08-15 06:18:01 +00001363 CXXBasePath &Path,
1364 void *Name) {
1365 RecordDecl *BaseRecord = Specifier->getType()->getAs<RecordType>()->getDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001366
Douglas Gregor8071e422010-08-15 06:18:01 +00001367 DeclarationName N = DeclarationName::getFromOpaquePtr(Name);
1368 Path.Decls = BaseRecord->lookup(N);
David Blaikie3bc93e32012-12-19 00:45:41 +00001369 return !Path.Decls.empty();
Douglas Gregor8071e422010-08-15 06:18:01 +00001370}
1371
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001372/// \brief Determine whether the given set of member declarations contains only
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001373/// static members, nested types, and enumerators.
1374template<typename InputIterator>
1375static bool HasOnlyStaticMembers(InputIterator First, InputIterator Last) {
1376 Decl *D = (*First)->getUnderlyingDecl();
1377 if (isa<VarDecl>(D) || isa<TypeDecl>(D) || isa<EnumConstantDecl>(D))
1378 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001379
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001380 if (isa<CXXMethodDecl>(D)) {
1381 // Determine whether all of the methods are static.
1382 bool AllMethodsAreStatic = true;
1383 for(; First != Last; ++First) {
1384 D = (*First)->getUnderlyingDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001385
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001386 if (!isa<CXXMethodDecl>(D)) {
1387 assert(isa<TagDecl>(D) && "Non-function must be a tag decl");
1388 break;
1389 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001390
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001391 if (!cast<CXXMethodDecl>(D)->isStatic()) {
1392 AllMethodsAreStatic = false;
1393 break;
1394 }
1395 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001396
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001397 if (AllMethodsAreStatic)
1398 return true;
1399 }
1400
1401 return false;
1402}
1403
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001404/// \brief Perform qualified name lookup into a given context.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001405///
1406/// Qualified name lookup (C++ [basic.lookup.qual]) is used to find
1407/// names when the context of those names is explicit specified, e.g.,
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001408/// "std::vector" or "x->member", or as part of unqualified name lookup.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001409///
1410/// Different lookup criteria can find different names. For example, a
1411/// particular scope can have both a struct and a function of the same
1412/// name, and each can be found by certain lookup criteria. For more
1413/// information about lookup criteria, see the documentation for the
1414/// class LookupCriteria.
1415///
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001416/// \param R captures both the lookup criteria and any lookup results found.
1417///
1418/// \param LookupCtx The context in which qualified name lookup will
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001419/// search. If the lookup criteria permits, name lookup may also search
1420/// in the parent contexts or (for C++ classes) base classes.
1421///
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001422/// \param InUnqualifiedLookup true if this is qualified name lookup that
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001423/// occurs as part of unqualified name lookup.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001424///
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001425/// \returns true if lookup succeeded, false if it failed.
1426bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
1427 bool InUnqualifiedLookup) {
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001428 assert(LookupCtx && "Sema::LookupQualifiedName requires a lookup context");
Mike Stump1eb44332009-09-09 15:08:12 +00001429
John McCalla24dc2e2009-11-17 02:14:36 +00001430 if (!R.getLookupName())
John McCallf36e02d2009-10-09 21:13:30 +00001431 return false;
Mike Stump1eb44332009-09-09 15:08:12 +00001432
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001433 // Make sure that the declaration context is complete.
1434 assert((!isa<TagDecl>(LookupCtx) ||
1435 LookupCtx->isDependentContext() ||
John McCall5e1cdac2011-10-07 06:10:15 +00001436 cast<TagDecl>(LookupCtx)->isCompleteDefinition() ||
Richard Smith1af83c42012-03-23 03:33:32 +00001437 cast<TagDecl>(LookupCtx)->isBeingDefined()) &&
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001438 "Declaration context must already be complete!");
Mike Stump1eb44332009-09-09 15:08:12 +00001439
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001440 // Perform qualified name lookup into the LookupCtx.
Douglas Gregor85910982010-02-12 05:48:04 +00001441 if (LookupDirect(*this, R, LookupCtx)) {
John McCallf36e02d2009-10-09 21:13:30 +00001442 R.resolveKind();
John McCall92f88312010-01-23 00:46:32 +00001443 if (isa<CXXRecordDecl>(LookupCtx))
1444 R.setNamingClass(cast<CXXRecordDecl>(LookupCtx));
John McCallf36e02d2009-10-09 21:13:30 +00001445 return true;
1446 }
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001447
John McCall6e247262009-10-10 05:48:19 +00001448 // Don't descend into implied contexts for redeclarations.
1449 // C++98 [namespace.qual]p6:
1450 // In a declaration for a namespace member in which the
1451 // declarator-id is a qualified-id, given that the qualified-id
1452 // for the namespace member has the form
1453 // nested-name-specifier unqualified-id
1454 // the unqualified-id shall name a member of the namespace
1455 // designated by the nested-name-specifier.
1456 // See also [class.mfct]p5 and [class.static.data]p2.
John McCalla24dc2e2009-11-17 02:14:36 +00001457 if (R.isForRedeclaration())
John McCall6e247262009-10-10 05:48:19 +00001458 return false;
1459
John McCalla24dc2e2009-11-17 02:14:36 +00001460 // If this is a namespace, look it up in the implied namespaces.
John McCall6e247262009-10-10 05:48:19 +00001461 if (LookupCtx->isFileContext())
Douglas Gregor85910982010-02-12 05:48:04 +00001462 return LookupQualifiedNameInUsingDirectives(*this, R, LookupCtx);
John McCall6e247262009-10-10 05:48:19 +00001463
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001464 // If this isn't a C++ class, we aren't allowed to look into base
Douglas Gregor4719f4e2009-09-11 22:57:37 +00001465 // classes, we're done.
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001466 CXXRecordDecl *LookupRec = dyn_cast<CXXRecordDecl>(LookupCtx);
Douglas Gregor025291b2010-07-01 00:21:21 +00001467 if (!LookupRec || !LookupRec->getDefinition())
John McCallf36e02d2009-10-09 21:13:30 +00001468 return false;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001469
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001470 // If we're performing qualified name lookup into a dependent class,
1471 // then we are actually looking into a current instantiation. If we have any
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001472 // dependent base classes, then we either have to delay lookup until
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001473 // template instantiation time (at which point all bases will be available)
1474 // or we have to fail.
1475 if (!InUnqualifiedLookup && LookupRec->isDependentContext() &&
1476 LookupRec->hasAnyDependentBases()) {
1477 R.setNotFoundInCurrentInstantiation();
1478 return false;
1479 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001480
Douglas Gregor7176fff2009-01-15 00:26:24 +00001481 // Perform lookup into our base classes.
Douglas Gregora8f32e02009-10-06 17:59:45 +00001482 CXXBasePaths Paths;
1483 Paths.setOrigin(LookupRec);
Douglas Gregor7176fff2009-01-15 00:26:24 +00001484
1485 // Look for this member in our base classes
Douglas Gregora8f32e02009-10-06 17:59:45 +00001486 CXXRecordDecl::BaseMatchesCallback *BaseCallback = 0;
John McCalla24dc2e2009-11-17 02:14:36 +00001487 switch (R.getLookupKind()) {
Fariborz Jahanian98a54032011-07-12 17:16:56 +00001488 case LookupObjCImplicitSelfParam:
Douglas Gregora8f32e02009-10-06 17:59:45 +00001489 case LookupOrdinaryName:
1490 case LookupMemberName:
1491 case LookupRedeclarationWithLinkage:
1492 BaseCallback = &CXXRecordDecl::FindOrdinaryMember;
1493 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001494
Douglas Gregora8f32e02009-10-06 17:59:45 +00001495 case LookupTagName:
1496 BaseCallback = &CXXRecordDecl::FindTagMember;
1497 break;
John McCall9f54ad42009-12-10 09:41:52 +00001498
Douglas Gregor8071e422010-08-15 06:18:01 +00001499 case LookupAnyName:
1500 BaseCallback = &LookupAnyMember;
1501 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001502
John McCall9f54ad42009-12-10 09:41:52 +00001503 case LookupUsingDeclName:
1504 // This lookup is for redeclarations only.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001505
Douglas Gregora8f32e02009-10-06 17:59:45 +00001506 case LookupOperatorName:
1507 case LookupNamespaceName:
1508 case LookupObjCProtocolName:
Chris Lattner337e5502011-02-18 01:27:55 +00001509 case LookupLabel:
Douglas Gregora8f32e02009-10-06 17:59:45 +00001510 // These lookups will never find a member in a C++ class (or base class).
John McCallf36e02d2009-10-09 21:13:30 +00001511 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001512
Douglas Gregora8f32e02009-10-06 17:59:45 +00001513 case LookupNestedNameSpecifierName:
1514 BaseCallback = &CXXRecordDecl::FindNestedNameSpecifierMember;
1515 break;
1516 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001517
John McCalla24dc2e2009-11-17 02:14:36 +00001518 if (!LookupRec->lookupInBases(BaseCallback,
1519 R.getLookupName().getAsOpaquePtr(), Paths))
John McCallf36e02d2009-10-09 21:13:30 +00001520 return false;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001521
John McCall92f88312010-01-23 00:46:32 +00001522 R.setNamingClass(LookupRec);
1523
Douglas Gregor7176fff2009-01-15 00:26:24 +00001524 // C++ [class.member.lookup]p2:
1525 // [...] If the resulting set of declarations are not all from
1526 // sub-objects of the same type, or the set has a nonstatic member
1527 // and includes members from distinct sub-objects, there is an
1528 // ambiguity and the program is ill-formed. Otherwise that set is
1529 // the result of the lookup.
Douglas Gregor7176fff2009-01-15 00:26:24 +00001530 QualType SubobjectType;
Daniel Dunbarf1853192009-01-15 18:32:35 +00001531 int SubobjectNumber = 0;
John McCall7aceaf82010-03-18 23:49:19 +00001532 AccessSpecifier SubobjectAccess = AS_none;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001533
Douglas Gregora8f32e02009-10-06 17:59:45 +00001534 for (CXXBasePaths::paths_iterator Path = Paths.begin(), PathEnd = Paths.end();
Douglas Gregor7176fff2009-01-15 00:26:24 +00001535 Path != PathEnd; ++Path) {
Douglas Gregora8f32e02009-10-06 17:59:45 +00001536 const CXXBasePathElement &PathElement = Path->back();
Douglas Gregor7176fff2009-01-15 00:26:24 +00001537
John McCall46460a62010-01-20 21:53:11 +00001538 // Pick the best (i.e. most permissive i.e. numerically lowest) access
1539 // across all paths.
1540 SubobjectAccess = std::min(SubobjectAccess, Path->Access);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001541
Douglas Gregor7176fff2009-01-15 00:26:24 +00001542 // Determine whether we're looking at a distinct sub-object or not.
1543 if (SubobjectType.isNull()) {
John McCallf36e02d2009-10-09 21:13:30 +00001544 // This is the first subobject we've looked at. Record its type.
Douglas Gregor7176fff2009-01-15 00:26:24 +00001545 SubobjectType = Context.getCanonicalType(PathElement.Base->getType());
1546 SubobjectNumber = PathElement.SubobjectNumber;
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001547 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001548 }
1549
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001550 if (SubobjectType
Douglas Gregor7176fff2009-01-15 00:26:24 +00001551 != Context.getCanonicalType(PathElement.Base->getType())) {
1552 // We found members of the given name in two subobjects of
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001553 // different types. If the declaration sets aren't the same, this
1554 // this lookup is ambiguous.
David Blaikie3bc93e32012-12-19 00:45:41 +00001555 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end())) {
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001556 CXXBasePaths::paths_iterator FirstPath = Paths.begin();
David Blaikie3bc93e32012-12-19 00:45:41 +00001557 DeclContext::lookup_iterator FirstD = FirstPath->Decls.begin();
1558 DeclContext::lookup_iterator CurrentD = Path->Decls.begin();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001559
David Blaikie3bc93e32012-12-19 00:45:41 +00001560 while (FirstD != FirstPath->Decls.end() &&
1561 CurrentD != Path->Decls.end()) {
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001562 if ((*FirstD)->getUnderlyingDecl()->getCanonicalDecl() !=
1563 (*CurrentD)->getUnderlyingDecl()->getCanonicalDecl())
1564 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001565
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001566 ++FirstD;
1567 ++CurrentD;
1568 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001569
David Blaikie3bc93e32012-12-19 00:45:41 +00001570 if (FirstD == FirstPath->Decls.end() &&
1571 CurrentD == Path->Decls.end())
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001572 continue;
1573 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001574
John McCallf36e02d2009-10-09 21:13:30 +00001575 R.setAmbiguousBaseSubobjectTypes(Paths);
1576 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001577 }
1578
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001579 if (SubobjectNumber != PathElement.SubobjectNumber) {
Douglas Gregor7176fff2009-01-15 00:26:24 +00001580 // We have a different subobject of the same type.
1581
1582 // C++ [class.member.lookup]p5:
1583 // A static member, a nested type or an enumerator defined in
1584 // a base class T can unambiguously be found even if an object
Mike Stump1eb44332009-09-09 15:08:12 +00001585 // has more than one base class subobject of type T.
David Blaikie3bc93e32012-12-19 00:45:41 +00001586 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end()))
Douglas Gregor7176fff2009-01-15 00:26:24 +00001587 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001588
Douglas Gregor7176fff2009-01-15 00:26:24 +00001589 // We have found a nonstatic member name in multiple, distinct
1590 // subobjects. Name lookup is ambiguous.
John McCallf36e02d2009-10-09 21:13:30 +00001591 R.setAmbiguousBaseSubobjects(Paths);
1592 return true;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001593 }
1594 }
1595
1596 // Lookup in a base class succeeded; return these results.
1597
David Blaikie3bc93e32012-12-19 00:45:41 +00001598 DeclContext::lookup_result DR = Paths.front().Decls;
1599 for (DeclContext::lookup_iterator I = DR.begin(), E = DR.end(); I != E; ++I) {
John McCall92f88312010-01-23 00:46:32 +00001600 NamedDecl *D = *I;
1601 AccessSpecifier AS = CXXRecordDecl::MergeAccess(SubobjectAccess,
1602 D->getAccess());
1603 R.addDecl(D, AS);
1604 }
John McCallf36e02d2009-10-09 21:13:30 +00001605 R.resolveKind();
1606 return true;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001607}
1608
1609/// @brief Performs name lookup for a name that was parsed in the
1610/// source code, and may contain a C++ scope specifier.
1611///
1612/// This routine is a convenience routine meant to be called from
1613/// contexts that receive a name and an optional C++ scope specifier
1614/// (e.g., "N::M::x"). It will then perform either qualified or
1615/// unqualified name lookup (with LookupQualifiedName or LookupName,
1616/// respectively) on the given name and return those results.
1617///
1618/// @param S The scope from which unqualified name lookup will
1619/// begin.
Mike Stump1eb44332009-09-09 15:08:12 +00001620///
Douglas Gregor495c35d2009-08-25 22:51:20 +00001621/// @param SS An optional C++ scope-specifier, e.g., "::N::M".
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001622///
Douglas Gregor495c35d2009-08-25 22:51:20 +00001623/// @param EnteringContext Indicates whether we are going to enter the
1624/// context of the scope-specifier SS (if present).
1625///
John McCallf36e02d2009-10-09 21:13:30 +00001626/// @returns True if any decls were found (but possibly ambiguous)
Jeffrey Yasskin9ab14542010-04-08 16:38:48 +00001627bool Sema::LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
John McCalla24dc2e2009-11-17 02:14:36 +00001628 bool AllowBuiltinCreation, bool EnteringContext) {
Douglas Gregor495c35d2009-08-25 22:51:20 +00001629 if (SS && SS->isInvalid()) {
1630 // When the scope specifier is invalid, don't even look for
Douglas Gregor42af25f2009-05-11 19:58:34 +00001631 // anything.
John McCallf36e02d2009-10-09 21:13:30 +00001632 return false;
Douglas Gregor495c35d2009-08-25 22:51:20 +00001633 }
Mike Stump1eb44332009-09-09 15:08:12 +00001634
Douglas Gregor495c35d2009-08-25 22:51:20 +00001635 if (SS && SS->isSet()) {
1636 if (DeclContext *DC = computeDeclContext(*SS, EnteringContext)) {
Mike Stump1eb44332009-09-09 15:08:12 +00001637 // We have resolved the scope specifier to a particular declaration
Douglas Gregor495c35d2009-08-25 22:51:20 +00001638 // contex, and will perform name lookup in that context.
John McCall77bb1aa2010-05-01 00:40:08 +00001639 if (!DC->isDependentContext() && RequireCompleteDeclContext(*SS, DC))
John McCallf36e02d2009-10-09 21:13:30 +00001640 return false;
Mike Stump1eb44332009-09-09 15:08:12 +00001641
John McCalla24dc2e2009-11-17 02:14:36 +00001642 R.setContextRange(SS->getRange());
John McCalla24dc2e2009-11-17 02:14:36 +00001643 return LookupQualifiedName(R, DC);
Douglas Gregore4e5b052009-03-19 00:18:19 +00001644 }
Douglas Gregor42af25f2009-05-11 19:58:34 +00001645
Douglas Gregor495c35d2009-08-25 22:51:20 +00001646 // We could not resolve the scope specified to a specific declaration
Mike Stump1eb44332009-09-09 15:08:12 +00001647 // context, which means that SS refers to an unknown specialization.
Douglas Gregor495c35d2009-08-25 22:51:20 +00001648 // Name lookup can't find anything in this case.
Douglas Gregor3eafbb82011-10-24 22:24:50 +00001649 R.setNotFoundInCurrentInstantiation();
1650 R.setContextRange(SS->getRange());
John McCallf36e02d2009-10-09 21:13:30 +00001651 return false;
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001652 }
1653
Mike Stump1eb44332009-09-09 15:08:12 +00001654 // Perform unqualified name lookup starting in the given scope.
John McCalla24dc2e2009-11-17 02:14:36 +00001655 return LookupName(R, S, AllowBuiltinCreation);
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001656}
1657
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001658
James Dennett16ae9de2012-06-22 10:16:05 +00001659/// \brief Produce a diagnostic describing the ambiguity that resulted
Douglas Gregor7176fff2009-01-15 00:26:24 +00001660/// from name lookup.
1661///
James Dennett16ae9de2012-06-22 10:16:05 +00001662/// \param Result The result of the ambiguous lookup to be diagnosed.
Mike Stump1eb44332009-09-09 15:08:12 +00001663///
James Dennett16ae9de2012-06-22 10:16:05 +00001664/// \returns true
John McCalla24dc2e2009-11-17 02:14:36 +00001665bool Sema::DiagnoseAmbiguousLookup(LookupResult &Result) {
Douglas Gregor7176fff2009-01-15 00:26:24 +00001666 assert(Result.isAmbiguous() && "Lookup result must be ambiguous");
1667
John McCalla24dc2e2009-11-17 02:14:36 +00001668 DeclarationName Name = Result.getLookupName();
1669 SourceLocation NameLoc = Result.getNameLoc();
1670 SourceRange LookupRange = Result.getContextRange();
1671
John McCall6e247262009-10-10 05:48:19 +00001672 switch (Result.getAmbiguityKind()) {
1673 case LookupResult::AmbiguousBaseSubobjects: {
1674 CXXBasePaths *Paths = Result.getBasePaths();
1675 QualType SubobjectType = Paths->front().back().Base->getType();
1676 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobjects)
1677 << Name << SubobjectType << getAmbiguousPathsDisplayString(*Paths)
1678 << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001679
David Blaikie3bc93e32012-12-19 00:45:41 +00001680 DeclContext::lookup_iterator Found = Paths->front().Decls.begin();
John McCall6e247262009-10-10 05:48:19 +00001681 while (isa<CXXMethodDecl>(*Found) &&
1682 cast<CXXMethodDecl>(*Found)->isStatic())
1683 ++Found;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001684
John McCall6e247262009-10-10 05:48:19 +00001685 Diag((*Found)->getLocation(), diag::note_ambiguous_member_found);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001686
John McCall6e247262009-10-10 05:48:19 +00001687 return true;
1688 }
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001689
John McCall6e247262009-10-10 05:48:19 +00001690 case LookupResult::AmbiguousBaseSubobjectTypes: {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001691 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobject_types)
1692 << Name << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001693
John McCall6e247262009-10-10 05:48:19 +00001694 CXXBasePaths *Paths = Result.getBasePaths();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001695 std::set<Decl *> DeclsPrinted;
John McCall6e247262009-10-10 05:48:19 +00001696 for (CXXBasePaths::paths_iterator Path = Paths->begin(),
1697 PathEnd = Paths->end();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001698 Path != PathEnd; ++Path) {
David Blaikie3bc93e32012-12-19 00:45:41 +00001699 Decl *D = Path->Decls.front();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001700 if (DeclsPrinted.insert(D).second)
1701 Diag(D->getLocation(), diag::note_ambiguous_member_found);
1702 }
1703
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001704 return true;
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001705 }
1706
John McCall6e247262009-10-10 05:48:19 +00001707 case LookupResult::AmbiguousTagHiding: {
1708 Diag(NameLoc, diag::err_ambiguous_tag_hiding) << Name << LookupRange;
Douglas Gregor69d993a2009-01-17 01:13:24 +00001709
John McCall6e247262009-10-10 05:48:19 +00001710 llvm::SmallPtrSet<NamedDecl*,8> TagDecls;
1711
1712 LookupResult::iterator DI, DE = Result.end();
1713 for (DI = Result.begin(); DI != DE; ++DI)
1714 if (TagDecl *TD = dyn_cast<TagDecl>(*DI)) {
1715 TagDecls.insert(TD);
1716 Diag(TD->getLocation(), diag::note_hidden_tag);
1717 }
1718
1719 for (DI = Result.begin(); DI != DE; ++DI)
1720 if (!isa<TagDecl>(*DI))
1721 Diag((*DI)->getLocation(), diag::note_hiding_object);
1722
1723 // For recovery purposes, go ahead and implement the hiding.
John McCalleec51cf2010-01-20 00:46:10 +00001724 LookupResult::Filter F = Result.makeFilter();
1725 while (F.hasNext()) {
1726 if (TagDecls.count(F.next()))
1727 F.erase();
1728 }
1729 F.done();
John McCall6e247262009-10-10 05:48:19 +00001730
1731 return true;
1732 }
1733
1734 case LookupResult::AmbiguousReference: {
1735 Diag(NameLoc, diag::err_ambiguous_reference) << Name << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001736
John McCall6e247262009-10-10 05:48:19 +00001737 LookupResult::iterator DI = Result.begin(), DE = Result.end();
1738 for (; DI != DE; ++DI)
1739 Diag((*DI)->getLocation(), diag::note_ambiguous_candidate) << *DI;
John McCallf36e02d2009-10-09 21:13:30 +00001740
John McCall6e247262009-10-10 05:48:19 +00001741 return true;
1742 }
1743 }
1744
Jeffrey Yasskin9f61aa92009-12-12 05:05:38 +00001745 llvm_unreachable("unknown ambiguity kind");
Douglas Gregor7176fff2009-01-15 00:26:24 +00001746}
Douglas Gregorfa047642009-02-04 00:32:51 +00001747
John McCallc7e04da2010-05-28 18:45:08 +00001748namespace {
1749 struct AssociatedLookup {
John McCall42f48fb2012-08-24 20:38:34 +00001750 AssociatedLookup(Sema &S, SourceLocation InstantiationLoc,
John McCallc7e04da2010-05-28 18:45:08 +00001751 Sema::AssociatedNamespaceSet &Namespaces,
1752 Sema::AssociatedClassSet &Classes)
John McCall42f48fb2012-08-24 20:38:34 +00001753 : S(S), Namespaces(Namespaces), Classes(Classes),
1754 InstantiationLoc(InstantiationLoc) {
John McCallc7e04da2010-05-28 18:45:08 +00001755 }
1756
1757 Sema &S;
1758 Sema::AssociatedNamespaceSet &Namespaces;
1759 Sema::AssociatedClassSet &Classes;
John McCall42f48fb2012-08-24 20:38:34 +00001760 SourceLocation InstantiationLoc;
John McCallc7e04da2010-05-28 18:45:08 +00001761 };
1762}
1763
Mike Stump1eb44332009-09-09 15:08:12 +00001764static void
John McCallc7e04da2010-05-28 18:45:08 +00001765addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType T);
John McCall6ff07852009-08-07 22:18:02 +00001766
Douglas Gregor54022952010-04-30 07:08:38 +00001767static void CollectEnclosingNamespace(Sema::AssociatedNamespaceSet &Namespaces,
1768 DeclContext *Ctx) {
1769 // Add the associated namespace for this class.
1770
1771 // We don't use DeclContext::getEnclosingNamespaceContext() as this may
1772 // be a locally scoped record.
1773
Sebastian Redl410c4f22010-08-31 20:53:31 +00001774 // We skip out of inline namespaces. The innermost non-inline namespace
1775 // contains all names of all its nested inline namespaces anyway, so we can
1776 // replace the entire inline namespace tree with its root.
1777 while (Ctx->isRecord() || Ctx->isTransparentContext() ||
1778 Ctx->isInlineNamespace())
Douglas Gregor54022952010-04-30 07:08:38 +00001779 Ctx = Ctx->getParent();
1780
John McCall6ff07852009-08-07 22:18:02 +00001781 if (Ctx->isFileContext())
Douglas Gregor54022952010-04-30 07:08:38 +00001782 Namespaces.insert(Ctx->getPrimaryContext());
John McCall6ff07852009-08-07 22:18:02 +00001783}
Douglas Gregor69be8d62009-07-08 07:51:57 +00001784
Mike Stump1eb44332009-09-09 15:08:12 +00001785// \brief Add the associated classes and namespaces for argument-dependent
Douglas Gregor69be8d62009-07-08 07:51:57 +00001786// lookup that involves a template argument (C++ [basic.lookup.koenig]p2).
Mike Stump1eb44332009-09-09 15:08:12 +00001787static void
John McCallc7e04da2010-05-28 18:45:08 +00001788addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1789 const TemplateArgument &Arg) {
Douglas Gregor69be8d62009-07-08 07:51:57 +00001790 // C++ [basic.lookup.koenig]p2, last bullet:
Mike Stump1eb44332009-09-09 15:08:12 +00001791 // -- [...] ;
Douglas Gregor69be8d62009-07-08 07:51:57 +00001792 switch (Arg.getKind()) {
1793 case TemplateArgument::Null:
1794 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001795
Douglas Gregor69be8d62009-07-08 07:51:57 +00001796 case TemplateArgument::Type:
1797 // [...] the namespaces and classes associated with the types of the
1798 // template arguments provided for template type parameters (excluding
1799 // template template parameters)
John McCallc7e04da2010-05-28 18:45:08 +00001800 addAssociatedClassesAndNamespaces(Result, Arg.getAsType());
Douglas Gregor69be8d62009-07-08 07:51:57 +00001801 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001802
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001803 case TemplateArgument::Template:
Douglas Gregora7fc9012011-01-05 18:58:31 +00001804 case TemplateArgument::TemplateExpansion: {
Mike Stump1eb44332009-09-09 15:08:12 +00001805 // [...] the namespaces in which any template template arguments are
1806 // defined; and the classes in which any member templates used as
Douglas Gregor69be8d62009-07-08 07:51:57 +00001807 // template template arguments are defined.
Douglas Gregora7fc9012011-01-05 18:58:31 +00001808 TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
Mike Stump1eb44332009-09-09 15:08:12 +00001809 if (ClassTemplateDecl *ClassTemplate
Douglas Gregor788cd062009-11-11 01:00:40 +00001810 = dyn_cast<ClassTemplateDecl>(Template.getAsTemplateDecl())) {
Douglas Gregor69be8d62009-07-08 07:51:57 +00001811 DeclContext *Ctx = ClassTemplate->getDeclContext();
1812 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00001813 Result.Classes.insert(EnclosingClass);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001814 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00001815 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001816 }
1817 break;
Douglas Gregor788cd062009-11-11 01:00:40 +00001818 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001819
Douglas Gregor788cd062009-11-11 01:00:40 +00001820 case TemplateArgument::Declaration:
Douglas Gregor69be8d62009-07-08 07:51:57 +00001821 case TemplateArgument::Integral:
1822 case TemplateArgument::Expression:
Eli Friedmand7a6b162012-09-26 02:36:12 +00001823 case TemplateArgument::NullPtr:
Mike Stump1eb44332009-09-09 15:08:12 +00001824 // [Note: non-type template arguments do not contribute to the set of
Douglas Gregor69be8d62009-07-08 07:51:57 +00001825 // associated namespaces. ]
1826 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001827
Douglas Gregor69be8d62009-07-08 07:51:57 +00001828 case TemplateArgument::Pack:
1829 for (TemplateArgument::pack_iterator P = Arg.pack_begin(),
1830 PEnd = Arg.pack_end();
1831 P != PEnd; ++P)
John McCallc7e04da2010-05-28 18:45:08 +00001832 addAssociatedClassesAndNamespaces(Result, *P);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001833 break;
1834 }
1835}
1836
Douglas Gregorfa047642009-02-04 00:32:51 +00001837// \brief Add the associated classes and namespaces for
Mike Stump1eb44332009-09-09 15:08:12 +00001838// argument-dependent lookup with an argument of class type
1839// (C++ [basic.lookup.koenig]p2).
1840static void
John McCallc7e04da2010-05-28 18:45:08 +00001841addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1842 CXXRecordDecl *Class) {
1843
1844 // Just silently ignore anything whose name is __va_list_tag.
1845 if (Class->getDeclName() == Result.S.VAListTagName)
1846 return;
1847
Douglas Gregorfa047642009-02-04 00:32:51 +00001848 // C++ [basic.lookup.koenig]p2:
1849 // [...]
1850 // -- If T is a class type (including unions), its associated
1851 // classes are: the class itself; the class of which it is a
1852 // member, if any; and its direct and indirect base
1853 // classes. Its associated namespaces are the namespaces in
Mike Stump1eb44332009-09-09 15:08:12 +00001854 // which its associated classes are defined.
Douglas Gregorfa047642009-02-04 00:32:51 +00001855
1856 // Add the class of which it is a member, if any.
1857 DeclContext *Ctx = Class->getDeclContext();
1858 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00001859 Result.Classes.insert(EnclosingClass);
Douglas Gregorfa047642009-02-04 00:32:51 +00001860 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00001861 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Mike Stump1eb44332009-09-09 15:08:12 +00001862
Douglas Gregorfa047642009-02-04 00:32:51 +00001863 // Add the class itself. If we've already seen this class, we don't
1864 // need to visit base classes.
John McCallc7e04da2010-05-28 18:45:08 +00001865 if (!Result.Classes.insert(Class))
Douglas Gregorfa047642009-02-04 00:32:51 +00001866 return;
1867
Mike Stump1eb44332009-09-09 15:08:12 +00001868 // -- If T is a template-id, its associated namespaces and classes are
1869 // the namespace in which the template is defined; for member
NAKAMURA Takumi00995302011-01-27 07:09:49 +00001870 // templates, the member template's class; the namespaces and classes
Mike Stump1eb44332009-09-09 15:08:12 +00001871 // associated with the types of the template arguments provided for
Douglas Gregor69be8d62009-07-08 07:51:57 +00001872 // template type parameters (excluding template template parameters); the
Mike Stump1eb44332009-09-09 15:08:12 +00001873 // namespaces in which any template template arguments are defined; and
1874 // the classes in which any member templates used as template template
1875 // arguments are defined. [Note: non-type template arguments do not
Douglas Gregor69be8d62009-07-08 07:51:57 +00001876 // contribute to the set of associated namespaces. ]
Mike Stump1eb44332009-09-09 15:08:12 +00001877 if (ClassTemplateSpecializationDecl *Spec
Douglas Gregor69be8d62009-07-08 07:51:57 +00001878 = dyn_cast<ClassTemplateSpecializationDecl>(Class)) {
1879 DeclContext *Ctx = Spec->getSpecializedTemplate()->getDeclContext();
1880 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00001881 Result.Classes.insert(EnclosingClass);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001882 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00001883 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Mike Stump1eb44332009-09-09 15:08:12 +00001884
Douglas Gregor69be8d62009-07-08 07:51:57 +00001885 const TemplateArgumentList &TemplateArgs = Spec->getTemplateArgs();
1886 for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
John McCallc7e04da2010-05-28 18:45:08 +00001887 addAssociatedClassesAndNamespaces(Result, TemplateArgs[I]);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001888 }
Mike Stump1eb44332009-09-09 15:08:12 +00001889
John McCall86ff3082010-02-04 22:26:26 +00001890 // Only recurse into base classes for complete types.
1891 if (!Class->hasDefinition()) {
John McCall42f48fb2012-08-24 20:38:34 +00001892 QualType type = Result.S.Context.getTypeDeclType(Class);
1893 if (Result.S.RequireCompleteType(Result.InstantiationLoc, type,
1894 /*no diagnostic*/ 0))
1895 return;
John McCall86ff3082010-02-04 22:26:26 +00001896 }
1897
Douglas Gregorfa047642009-02-04 00:32:51 +00001898 // Add direct and indirect base classes along with their associated
1899 // namespaces.
Chris Lattner5f9e2722011-07-23 10:55:15 +00001900 SmallVector<CXXRecordDecl *, 32> Bases;
Douglas Gregorfa047642009-02-04 00:32:51 +00001901 Bases.push_back(Class);
1902 while (!Bases.empty()) {
1903 // Pop this class off the stack.
1904 Class = Bases.back();
1905 Bases.pop_back();
1906
1907 // Visit the base classes.
1908 for (CXXRecordDecl::base_class_iterator Base = Class->bases_begin(),
1909 BaseEnd = Class->bases_end();
1910 Base != BaseEnd; ++Base) {
Ted Kremenek6217b802009-07-29 21:53:49 +00001911 const RecordType *BaseType = Base->getType()->getAs<RecordType>();
Sebastian Redlbbc1cc52009-10-25 09:35:33 +00001912 // In dependent contexts, we do ADL twice, and the first time around,
1913 // the base type might be a dependent TemplateSpecializationType, or a
1914 // TemplateTypeParmType. If that happens, simply ignore it.
1915 // FIXME: If we want to support export, we probably need to add the
1916 // namespace of the template in a TemplateSpecializationType, or even
1917 // the classes and namespaces of known non-dependent arguments.
1918 if (!BaseType)
1919 continue;
Douglas Gregorfa047642009-02-04 00:32:51 +00001920 CXXRecordDecl *BaseDecl = cast<CXXRecordDecl>(BaseType->getDecl());
John McCallc7e04da2010-05-28 18:45:08 +00001921 if (Result.Classes.insert(BaseDecl)) {
Douglas Gregorfa047642009-02-04 00:32:51 +00001922 // Find the associated namespace for this base class.
1923 DeclContext *BaseCtx = BaseDecl->getDeclContext();
John McCallc7e04da2010-05-28 18:45:08 +00001924 CollectEnclosingNamespace(Result.Namespaces, BaseCtx);
Douglas Gregorfa047642009-02-04 00:32:51 +00001925
1926 // Make sure we visit the bases of this base class.
1927 if (BaseDecl->bases_begin() != BaseDecl->bases_end())
1928 Bases.push_back(BaseDecl);
1929 }
1930 }
1931 }
1932}
1933
1934// \brief Add the associated classes and namespaces for
1935// argument-dependent lookup with an argument of type T
Mike Stump1eb44332009-09-09 15:08:12 +00001936// (C++ [basic.lookup.koenig]p2).
1937static void
John McCallc7e04da2010-05-28 18:45:08 +00001938addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType Ty) {
Douglas Gregorfa047642009-02-04 00:32:51 +00001939 // C++ [basic.lookup.koenig]p2:
1940 //
1941 // For each argument type T in the function call, there is a set
1942 // of zero or more associated namespaces and a set of zero or more
1943 // associated classes to be considered. The sets of namespaces and
1944 // classes is determined entirely by the types of the function
1945 // arguments (and the namespace of any template template
1946 // argument). Typedef names and using-declarations used to specify
1947 // the types do not contribute to this set. The sets of namespaces
1948 // and classes are determined in the following way:
Douglas Gregorfa047642009-02-04 00:32:51 +00001949
Chris Lattner5f9e2722011-07-23 10:55:15 +00001950 SmallVector<const Type *, 16> Queue;
John McCallfa4edcf2010-05-28 06:08:54 +00001951 const Type *T = Ty->getCanonicalTypeInternal().getTypePtr();
1952
Douglas Gregorfa047642009-02-04 00:32:51 +00001953 while (true) {
John McCallfa4edcf2010-05-28 06:08:54 +00001954 switch (T->getTypeClass()) {
1955
1956#define TYPE(Class, Base)
1957#define DEPENDENT_TYPE(Class, Base) case Type::Class:
1958#define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
1959#define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) case Type::Class:
1960#define ABSTRACT_TYPE(Class, Base)
1961#include "clang/AST/TypeNodes.def"
1962 // T is canonical. We can also ignore dependent types because
1963 // we don't need to do ADL at the definition point, but if we
1964 // wanted to implement template export (or if we find some other
1965 // use for associated classes and namespaces...) this would be
1966 // wrong.
Douglas Gregorfa047642009-02-04 00:32:51 +00001967 break;
Douglas Gregorfa047642009-02-04 00:32:51 +00001968
John McCallfa4edcf2010-05-28 06:08:54 +00001969 // -- If T is a pointer to U or an array of U, its associated
1970 // namespaces and classes are those associated with U.
1971 case Type::Pointer:
1972 T = cast<PointerType>(T)->getPointeeType().getTypePtr();
1973 continue;
1974 case Type::ConstantArray:
1975 case Type::IncompleteArray:
1976 case Type::VariableArray:
1977 T = cast<ArrayType>(T)->getElementType().getTypePtr();
1978 continue;
Douglas Gregorfa047642009-02-04 00:32:51 +00001979
John McCallfa4edcf2010-05-28 06:08:54 +00001980 // -- If T is a fundamental type, its associated sets of
1981 // namespaces and classes are both empty.
1982 case Type::Builtin:
1983 break;
1984
1985 // -- If T is a class type (including unions), its associated
1986 // classes are: the class itself; the class of which it is a
1987 // member, if any; and its direct and indirect base
1988 // classes. Its associated namespaces are the namespaces in
1989 // which its associated classes are defined.
1990 case Type::Record: {
1991 CXXRecordDecl *Class
1992 = cast<CXXRecordDecl>(cast<RecordType>(T)->getDecl());
John McCallc7e04da2010-05-28 18:45:08 +00001993 addAssociatedClassesAndNamespaces(Result, Class);
John McCallfa4edcf2010-05-28 06:08:54 +00001994 break;
Douglas Gregorc1efaec2009-02-28 01:32:25 +00001995 }
Douglas Gregor4e58c252010-05-20 02:26:51 +00001996
John McCallfa4edcf2010-05-28 06:08:54 +00001997 // -- If T is an enumeration type, its associated namespace is
1998 // the namespace in which it is defined. If it is class
NAKAMURA Takumi00995302011-01-27 07:09:49 +00001999 // member, its associated class is the member's class; else
John McCallfa4edcf2010-05-28 06:08:54 +00002000 // it has no associated class.
2001 case Type::Enum: {
2002 EnumDecl *Enum = cast<EnumType>(T)->getDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002003
John McCallfa4edcf2010-05-28 06:08:54 +00002004 DeclContext *Ctx = Enum->getDeclContext();
2005 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00002006 Result.Classes.insert(EnclosingClass);
Douglas Gregorfa047642009-02-04 00:32:51 +00002007
John McCallfa4edcf2010-05-28 06:08:54 +00002008 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00002009 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Douglas Gregorfa047642009-02-04 00:32:51 +00002010
John McCallfa4edcf2010-05-28 06:08:54 +00002011 break;
2012 }
2013
2014 // -- If T is a function type, its associated namespaces and
2015 // classes are those associated with the function parameter
2016 // types and those associated with the return type.
2017 case Type::FunctionProto: {
2018 const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
2019 for (FunctionProtoType::arg_type_iterator Arg = Proto->arg_type_begin(),
2020 ArgEnd = Proto->arg_type_end();
2021 Arg != ArgEnd; ++Arg)
2022 Queue.push_back(Arg->getTypePtr());
2023 // fallthrough
2024 }
2025 case Type::FunctionNoProto: {
2026 const FunctionType *FnType = cast<FunctionType>(T);
2027 T = FnType->getResultType().getTypePtr();
2028 continue;
2029 }
2030
2031 // -- If T is a pointer to a member function of a class X, its
2032 // associated namespaces and classes are those associated
2033 // with the function parameter types and return type,
2034 // together with those associated with X.
2035 //
2036 // -- If T is a pointer to a data member of class X, its
2037 // associated namespaces and classes are those associated
2038 // with the member type together with those associated with
2039 // X.
2040 case Type::MemberPointer: {
2041 const MemberPointerType *MemberPtr = cast<MemberPointerType>(T);
2042
2043 // Queue up the class type into which this points.
2044 Queue.push_back(MemberPtr->getClass());
2045
2046 // And directly continue with the pointee type.
2047 T = MemberPtr->getPointeeType().getTypePtr();
2048 continue;
2049 }
2050
2051 // As an extension, treat this like a normal pointer.
2052 case Type::BlockPointer:
2053 T = cast<BlockPointerType>(T)->getPointeeType().getTypePtr();
2054 continue;
2055
2056 // References aren't covered by the standard, but that's such an
2057 // obvious defect that we cover them anyway.
2058 case Type::LValueReference:
2059 case Type::RValueReference:
2060 T = cast<ReferenceType>(T)->getPointeeType().getTypePtr();
2061 continue;
2062
2063 // These are fundamental types.
2064 case Type::Vector:
2065 case Type::ExtVector:
2066 case Type::Complex:
2067 break;
2068
Douglas Gregorf25760e2011-04-12 01:02:45 +00002069 // If T is an Objective-C object or interface type, or a pointer to an
2070 // object or interface type, the associated namespace is the global
2071 // namespace.
John McCallfa4edcf2010-05-28 06:08:54 +00002072 case Type::ObjCObject:
2073 case Type::ObjCInterface:
2074 case Type::ObjCObjectPointer:
Douglas Gregorf25760e2011-04-12 01:02:45 +00002075 Result.Namespaces.insert(Result.S.Context.getTranslationUnitDecl());
John McCallfa4edcf2010-05-28 06:08:54 +00002076 break;
Eli Friedmanb001de72011-10-06 23:00:33 +00002077
2078 // Atomic types are just wrappers; use the associations of the
2079 // contained type.
2080 case Type::Atomic:
2081 T = cast<AtomicType>(T)->getValueType().getTypePtr();
2082 continue;
John McCallfa4edcf2010-05-28 06:08:54 +00002083 }
2084
2085 if (Queue.empty()) break;
2086 T = Queue.back();
2087 Queue.pop_back();
Douglas Gregorfa047642009-02-04 00:32:51 +00002088 }
Douglas Gregorfa047642009-02-04 00:32:51 +00002089}
2090
2091/// \brief Find the associated classes and namespaces for
2092/// argument-dependent lookup for a call with the given set of
2093/// arguments.
2094///
2095/// This routine computes the sets of associated classes and associated
Mike Stump1eb44332009-09-09 15:08:12 +00002096/// namespaces searched by argument-dependent lookup
Douglas Gregorfa047642009-02-04 00:32:51 +00002097/// (C++ [basic.lookup.argdep]) for a given set of arguments.
Mike Stump1eb44332009-09-09 15:08:12 +00002098void
John McCall42f48fb2012-08-24 20:38:34 +00002099Sema::FindAssociatedClassesAndNamespaces(SourceLocation InstantiationLoc,
2100 llvm::ArrayRef<Expr *> Args,
Douglas Gregorfa047642009-02-04 00:32:51 +00002101 AssociatedNamespaceSet &AssociatedNamespaces,
John McCall6ff07852009-08-07 22:18:02 +00002102 AssociatedClassSet &AssociatedClasses) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002103 AssociatedNamespaces.clear();
2104 AssociatedClasses.clear();
2105
John McCall42f48fb2012-08-24 20:38:34 +00002106 AssociatedLookup Result(*this, InstantiationLoc,
2107 AssociatedNamespaces, AssociatedClasses);
John McCallc7e04da2010-05-28 18:45:08 +00002108
Douglas Gregorfa047642009-02-04 00:32:51 +00002109 // C++ [basic.lookup.koenig]p2:
2110 // For each argument type T in the function call, there is a set
2111 // of zero or more associated namespaces and a set of zero or more
2112 // associated classes to be considered. The sets of namespaces and
2113 // classes is determined entirely by the types of the function
2114 // arguments (and the namespace of any template template
Mike Stump1eb44332009-09-09 15:08:12 +00002115 // argument).
Ahmed Charles13a140c2012-02-25 11:00:22 +00002116 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002117 Expr *Arg = Args[ArgIdx];
2118
2119 if (Arg->getType() != Context.OverloadTy) {
John McCallc7e04da2010-05-28 18:45:08 +00002120 addAssociatedClassesAndNamespaces(Result, Arg->getType());
Douglas Gregorfa047642009-02-04 00:32:51 +00002121 continue;
2122 }
2123
2124 // [...] In addition, if the argument is the name or address of a
2125 // set of overloaded functions and/or function templates, its
2126 // associated classes and namespaces are the union of those
2127 // associated with each of the members of the set: the namespace
2128 // in which the function or function template is defined and the
2129 // classes and namespaces associated with its (non-dependent)
2130 // parameter types and return type.
Douglas Gregordaa439a2009-07-08 10:57:20 +00002131 Arg = Arg->IgnoreParens();
John McCallba135432009-11-21 08:51:07 +00002132 if (UnaryOperator *unaryOp = dyn_cast<UnaryOperator>(Arg))
John McCall2de56d12010-08-25 11:45:40 +00002133 if (unaryOp->getOpcode() == UO_AddrOf)
John McCallba135432009-11-21 08:51:07 +00002134 Arg = unaryOp->getSubExpr();
Mike Stump1eb44332009-09-09 15:08:12 +00002135
John McCallc7e04da2010-05-28 18:45:08 +00002136 UnresolvedLookupExpr *ULE = dyn_cast<UnresolvedLookupExpr>(Arg);
2137 if (!ULE) continue;
John McCallba135432009-11-21 08:51:07 +00002138
John McCallc7e04da2010-05-28 18:45:08 +00002139 for (UnresolvedSetIterator I = ULE->decls_begin(), E = ULE->decls_end();
2140 I != E; ++I) {
Chandler Carruthbd647292009-12-29 06:17:27 +00002141 // Look through any using declarations to find the underlying function.
2142 NamedDecl *Fn = (*I)->getUnderlyingDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002143
Chandler Carruthbd647292009-12-29 06:17:27 +00002144 FunctionDecl *FDecl = dyn_cast<FunctionDecl>(Fn);
2145 if (!FDecl)
2146 FDecl = cast<FunctionTemplateDecl>(Fn)->getTemplatedDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002147
2148 // Add the classes and namespaces associated with the parameter
2149 // types and return type of this function.
John McCallc7e04da2010-05-28 18:45:08 +00002150 addAssociatedClassesAndNamespaces(Result, FDecl->getType());
Douglas Gregorfa047642009-02-04 00:32:51 +00002151 }
2152 }
2153}
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002154
2155/// IsAcceptableNonMemberOperatorCandidate - Determine whether Fn is
2156/// an acceptable non-member overloaded operator for a call whose
2157/// arguments have types T1 (and, if non-empty, T2). This routine
2158/// implements the check in C++ [over.match.oper]p3b2 concerning
2159/// enumeration types.
Mike Stump1eb44332009-09-09 15:08:12 +00002160static bool
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002161IsAcceptableNonMemberOperatorCandidate(FunctionDecl *Fn,
2162 QualType T1, QualType T2,
2163 ASTContext &Context) {
Douglas Gregorba498172009-03-13 21:01:28 +00002164 if (T1->isDependentType() || (!T2.isNull() && T2->isDependentType()))
2165 return true;
2166
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002167 if (T1->isRecordType() || (!T2.isNull() && T2->isRecordType()))
2168 return true;
2169
John McCall183700f2009-09-21 23:43:11 +00002170 const FunctionProtoType *Proto = Fn->getType()->getAs<FunctionProtoType>();
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002171 if (Proto->getNumArgs() < 1)
2172 return false;
2173
2174 if (T1->isEnumeralType()) {
2175 QualType ArgType = Proto->getArgType(0).getNonReferenceType();
Douglas Gregora4923eb2009-11-16 21:35:15 +00002176 if (Context.hasSameUnqualifiedType(T1, ArgType))
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002177 return true;
2178 }
2179
2180 if (Proto->getNumArgs() < 2)
2181 return false;
2182
2183 if (!T2.isNull() && T2->isEnumeralType()) {
2184 QualType ArgType = Proto->getArgType(1).getNonReferenceType();
Douglas Gregora4923eb2009-11-16 21:35:15 +00002185 if (Context.hasSameUnqualifiedType(T2, ArgType))
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002186 return true;
2187 }
2188
2189 return false;
2190}
2191
John McCall7d384dd2009-11-18 07:57:50 +00002192NamedDecl *Sema::LookupSingleName(Scope *S, DeclarationName Name,
Douglas Gregorc83c6872010-04-15 22:33:43 +00002193 SourceLocation Loc,
John McCall7d384dd2009-11-18 07:57:50 +00002194 LookupNameKind NameKind,
2195 RedeclarationKind Redecl) {
Douglas Gregorc83c6872010-04-15 22:33:43 +00002196 LookupResult R(*this, Name, Loc, NameKind, Redecl);
John McCall7d384dd2009-11-18 07:57:50 +00002197 LookupName(R, S);
John McCall1bcee0a2009-12-02 08:25:40 +00002198 return R.getAsSingle<NamedDecl>();
John McCall7d384dd2009-11-18 07:57:50 +00002199}
2200
Douglas Gregor6e378de2009-04-23 23:18:26 +00002201/// \brief Find the protocol with the given name, if any.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002202ObjCProtocolDecl *Sema::LookupProtocol(IdentifierInfo *II,
Douglas Gregor27c6da22012-01-01 20:30:41 +00002203 SourceLocation IdLoc,
2204 RedeclarationKind Redecl) {
Douglas Gregorc83c6872010-04-15 22:33:43 +00002205 Decl *D = LookupSingleName(TUScope, II, IdLoc,
Douglas Gregor27c6da22012-01-01 20:30:41 +00002206 LookupObjCProtocolName, Redecl);
Douglas Gregor6e378de2009-04-23 23:18:26 +00002207 return cast_or_null<ObjCProtocolDecl>(D);
2208}
2209
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002210void Sema::LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
Mike Stump1eb44332009-09-09 15:08:12 +00002211 QualType T1, QualType T2,
John McCall6e266892010-01-26 03:27:55 +00002212 UnresolvedSetImpl &Functions) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002213 // C++ [over.match.oper]p3:
2214 // -- The set of non-member candidates is the result of the
2215 // unqualified lookup of operator@ in the context of the
2216 // expression according to the usual rules for name lookup in
2217 // unqualified function calls (3.4.2) except that all member
2218 // functions are ignored. However, if no operand has a class
2219 // type, only those non-member functions in the lookup set
Eli Friedman33a31382009-08-05 19:21:58 +00002220 // that have a first parameter of type T1 or "reference to
2221 // (possibly cv-qualified) T1", when T1 is an enumeration
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002222 // type, or (if there is a right operand) a second parameter
Eli Friedman33a31382009-08-05 19:21:58 +00002223 // of type T2 or "reference to (possibly cv-qualified) T2",
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002224 // when T2 is an enumeration type, are candidate functions.
2225 DeclarationName OpName = Context.DeclarationNames.getCXXOperatorName(Op);
John McCalla24dc2e2009-11-17 02:14:36 +00002226 LookupResult Operators(*this, OpName, SourceLocation(), LookupOperatorName);
2227 LookupName(Operators, S);
Mike Stump1eb44332009-09-09 15:08:12 +00002228
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002229 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
2230
John McCallf36e02d2009-10-09 21:13:30 +00002231 if (Operators.empty())
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002232 return;
2233
2234 for (LookupResult::iterator Op = Operators.begin(), OpEnd = Operators.end();
2235 Op != OpEnd; ++Op) {
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002236 NamedDecl *Found = (*Op)->getUnderlyingDecl();
2237 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Found)) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002238 if (IsAcceptableNonMemberOperatorCandidate(FD, T1, T2, Context))
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002239 Functions.addDecl(*Op, Op.getAccess()); // FIXME: canonical FD
Mike Stump1eb44332009-09-09 15:08:12 +00002240 } else if (FunctionTemplateDecl *FunTmpl
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002241 = dyn_cast<FunctionTemplateDecl>(Found)) {
Douglas Gregor364e0212009-06-27 21:05:07 +00002242 // FIXME: friend operators?
Mike Stump1eb44332009-09-09 15:08:12 +00002243 // FIXME: do we need to check IsAcceptableNonMemberOperatorCandidate,
Douglas Gregor364e0212009-06-27 21:05:07 +00002244 // later?
2245 if (!FunTmpl->getDeclContext()->isRecord())
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002246 Functions.addDecl(*Op, Op.getAccess());
Douglas Gregor364e0212009-06-27 21:05:07 +00002247 }
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002248 }
2249}
2250
Sean Huntc39b6bc2011-06-24 02:11:39 +00002251Sema::SpecialMemberOverloadResult *Sema::LookupSpecialMember(CXXRecordDecl *RD,
Sean Hunt308742c2011-06-04 04:32:43 +00002252 CXXSpecialMember SM,
2253 bool ConstArg,
2254 bool VolatileArg,
2255 bool RValueThis,
2256 bool ConstThis,
2257 bool VolatileThis) {
Richard Smithd0adeb62012-11-27 21:20:31 +00002258 assert(CanDeclareSpecialMemberFunction(RD) &&
Sean Hunt308742c2011-06-04 04:32:43 +00002259 "doing special member lookup into record that isn't fully complete");
Richard Smithd0adeb62012-11-27 21:20:31 +00002260 RD = RD->getDefinition();
Sean Hunt308742c2011-06-04 04:32:43 +00002261 if (RValueThis || ConstThis || VolatileThis)
2262 assert((SM == CXXCopyAssignment || SM == CXXMoveAssignment) &&
2263 "constructors and destructors always have unqualified lvalue this");
2264 if (ConstArg || VolatileArg)
2265 assert((SM != CXXDefaultConstructor && SM != CXXDestructor) &&
2266 "parameter-less special members can't have qualified arguments");
2267
2268 llvm::FoldingSetNodeID ID;
Sean Huntc39b6bc2011-06-24 02:11:39 +00002269 ID.AddPointer(RD);
Sean Hunt308742c2011-06-04 04:32:43 +00002270 ID.AddInteger(SM);
2271 ID.AddInteger(ConstArg);
2272 ID.AddInteger(VolatileArg);
2273 ID.AddInteger(RValueThis);
2274 ID.AddInteger(ConstThis);
2275 ID.AddInteger(VolatileThis);
2276
2277 void *InsertPoint;
2278 SpecialMemberOverloadResult *Result =
2279 SpecialMemberCache.FindNodeOrInsertPos(ID, InsertPoint);
2280
2281 // This was already cached
2282 if (Result)
2283 return Result;
2284
Sean Hunt30543582011-06-07 00:11:58 +00002285 Result = BumpAlloc.Allocate<SpecialMemberOverloadResult>();
2286 Result = new (Result) SpecialMemberOverloadResult(ID);
Sean Hunt308742c2011-06-04 04:32:43 +00002287 SpecialMemberCache.InsertNode(Result, InsertPoint);
2288
2289 if (SM == CXXDestructor) {
Richard Smithe5411b72012-12-01 02:35:44 +00002290 if (RD->needsImplicitDestructor())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002291 DeclareImplicitDestructor(RD);
2292 CXXDestructorDecl *DD = RD->getDestructor();
Sean Hunt308742c2011-06-04 04:32:43 +00002293 assert(DD && "record without a destructor");
2294 Result->setMethod(DD);
Richard Smith6c4c36c2012-03-30 20:53:28 +00002295 Result->setKind(DD->isDeleted() ?
2296 SpecialMemberOverloadResult::NoMemberOrDeleted :
Richard Smith704c8f72012-04-20 18:46:14 +00002297 SpecialMemberOverloadResult::Success);
Sean Hunt308742c2011-06-04 04:32:43 +00002298 return Result;
2299 }
2300
Sean Huntb320e0c2011-06-10 03:50:41 +00002301 // Prepare for overload resolution. Here we construct a synthetic argument
2302 // if necessary and make sure that implicit functions are declared.
Sean Huntc39b6bc2011-06-24 02:11:39 +00002303 CanQualType CanTy = Context.getCanonicalType(Context.getTagDeclType(RD));
Sean Huntb320e0c2011-06-10 03:50:41 +00002304 DeclarationName Name;
2305 Expr *Arg = 0;
2306 unsigned NumArgs;
2307
Richard Smith704c8f72012-04-20 18:46:14 +00002308 QualType ArgType = CanTy;
2309 ExprValueKind VK = VK_LValue;
2310
Sean Huntb320e0c2011-06-10 03:50:41 +00002311 if (SM == CXXDefaultConstructor) {
2312 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2313 NumArgs = 0;
Sean Huntc39b6bc2011-06-24 02:11:39 +00002314 if (RD->needsImplicitDefaultConstructor())
2315 DeclareImplicitDefaultConstructor(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002316 } else {
2317 if (SM == CXXCopyConstructor || SM == CXXMoveConstructor) {
2318 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
Richard Smithe5411b72012-12-01 02:35:44 +00002319 if (RD->needsImplicitCopyConstructor())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002320 DeclareImplicitCopyConstructor(RD);
Richard Smith80ad52f2013-01-02 11:42:31 +00002321 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002322 DeclareImplicitMoveConstructor(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002323 } else {
2324 Name = Context.DeclarationNames.getCXXOperatorName(OO_Equal);
Richard Smithe5411b72012-12-01 02:35:44 +00002325 if (RD->needsImplicitCopyAssignment())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002326 DeclareImplicitCopyAssignment(RD);
Richard Smith80ad52f2013-01-02 11:42:31 +00002327 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveAssignment())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002328 DeclareImplicitMoveAssignment(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002329 }
2330
Sean Huntb320e0c2011-06-10 03:50:41 +00002331 if (ConstArg)
2332 ArgType.addConst();
2333 if (VolatileArg)
2334 ArgType.addVolatile();
2335
2336 // This isn't /really/ specified by the standard, but it's implied
2337 // we should be working from an RValue in the case of move to ensure
2338 // that we prefer to bind to rvalue references, and an LValue in the
2339 // case of copy to ensure we don't bind to rvalue references.
2340 // Possibly an XValue is actually correct in the case of move, but
2341 // there is no semantic difference for class types in this restricted
2342 // case.
Sean Huntab183df2011-06-22 22:13:13 +00002343 if (SM == CXXCopyConstructor || SM == CXXCopyAssignment)
Sean Huntb320e0c2011-06-10 03:50:41 +00002344 VK = VK_LValue;
2345 else
2346 VK = VK_RValue;
Richard Smith704c8f72012-04-20 18:46:14 +00002347 }
Sean Huntb320e0c2011-06-10 03:50:41 +00002348
Richard Smith704c8f72012-04-20 18:46:14 +00002349 OpaqueValueExpr FakeArg(SourceLocation(), ArgType, VK);
2350
2351 if (SM != CXXDefaultConstructor) {
Sean Huntb320e0c2011-06-10 03:50:41 +00002352 NumArgs = 1;
Richard Smith704c8f72012-04-20 18:46:14 +00002353 Arg = &FakeArg;
Sean Huntb320e0c2011-06-10 03:50:41 +00002354 }
2355
2356 // Create the object argument
2357 QualType ThisTy = CanTy;
2358 if (ConstThis)
2359 ThisTy.addConst();
2360 if (VolatileThis)
2361 ThisTy.addVolatile();
Sean Hunt4cc12c62011-06-23 00:26:20 +00002362 Expr::Classification Classification =
Richard Smith704c8f72012-04-20 18:46:14 +00002363 OpaqueValueExpr(SourceLocation(), ThisTy,
2364 RValueThis ? VK_RValue : VK_LValue).Classify(Context);
Sean Huntb320e0c2011-06-10 03:50:41 +00002365
2366 // Now we perform lookup on the name we computed earlier and do overload
2367 // resolution. Lookup is only performed directly into the class since there
2368 // will always be a (possibly implicit) declaration to shadow any others.
2369 OverloadCandidateSet OCS((SourceLocation()));
David Blaikie3bc93e32012-12-19 00:45:41 +00002370 DeclContext::lookup_result R = RD->lookup(Name);
Sean Huntb320e0c2011-06-10 03:50:41 +00002371
David Blaikie3bc93e32012-12-19 00:45:41 +00002372 assert(!R.empty() &&
Sean Huntb320e0c2011-06-10 03:50:41 +00002373 "lookup for a constructor or assignment operator was empty");
David Blaikie3bc93e32012-12-19 00:45:41 +00002374 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E; ++I) {
Sean Huntc39b6bc2011-06-24 02:11:39 +00002375 Decl *Cand = *I;
Sean Hunt4cc12c62011-06-23 00:26:20 +00002376
Sean Huntc39b6bc2011-06-24 02:11:39 +00002377 if (Cand->isInvalidDecl())
Sean Huntb320e0c2011-06-10 03:50:41 +00002378 continue;
2379
Sean Huntc39b6bc2011-06-24 02:11:39 +00002380 if (UsingShadowDecl *U = dyn_cast<UsingShadowDecl>(Cand)) {
2381 // FIXME: [namespace.udecl]p15 says that we should only consider a
2382 // using declaration here if it does not match a declaration in the
2383 // derived class. We do not implement this correctly in other cases
2384 // either.
2385 Cand = U->getTargetDecl();
2386
2387 if (Cand->isInvalidDecl())
2388 continue;
2389 }
2390
2391 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand)) {
Sean Hunt4cc12c62011-06-23 00:26:20 +00002392 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
Sean Huntc39b6bc2011-06-24 02:11:39 +00002393 AddMethodCandidate(M, DeclAccessPair::make(M, AS_public), RD, ThisTy,
Ahmed Charles13a140c2012-02-25 11:00:22 +00002394 Classification, llvm::makeArrayRef(&Arg, NumArgs),
2395 OCS, true);
Sean Hunt4cc12c62011-06-23 00:26:20 +00002396 else
Ahmed Charles13a140c2012-02-25 11:00:22 +00002397 AddOverloadCandidate(M, DeclAccessPair::make(M, AS_public),
2398 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
Sean Hunt431a1cb2011-06-22 02:58:46 +00002399 } else if (FunctionTemplateDecl *Tmpl =
Sean Huntc39b6bc2011-06-24 02:11:39 +00002400 dyn_cast<FunctionTemplateDecl>(Cand)) {
Sean Hunt4cc12c62011-06-23 00:26:20 +00002401 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2402 AddMethodTemplateCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
Ahmed Charles13a140c2012-02-25 11:00:22 +00002403 RD, 0, ThisTy, Classification,
2404 llvm::makeArrayRef(&Arg, NumArgs),
Sean Hunt4cc12c62011-06-23 00:26:20 +00002405 OCS, true);
2406 else
2407 AddTemplateOverloadCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
Ahmed Charles13a140c2012-02-25 11:00:22 +00002408 0, llvm::makeArrayRef(&Arg, NumArgs),
2409 OCS, true);
Sean Huntc39b6bc2011-06-24 02:11:39 +00002410 } else {
2411 assert(isa<UsingDecl>(Cand) && "illegal Kind of operator = Decl");
Sean Huntb320e0c2011-06-10 03:50:41 +00002412 }
2413 }
2414
2415 OverloadCandidateSet::iterator Best;
2416 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2417 case OR_Success:
2418 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
Richard Smith704c8f72012-04-20 18:46:14 +00002419 Result->setKind(SpecialMemberOverloadResult::Success);
Sean Huntb320e0c2011-06-10 03:50:41 +00002420 break;
2421
2422 case OR_Deleted:
2423 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
Richard Smith6c4c36c2012-03-30 20:53:28 +00002424 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
Sean Huntb320e0c2011-06-10 03:50:41 +00002425 break;
2426
2427 case OR_Ambiguous:
Richard Smith6c4c36c2012-03-30 20:53:28 +00002428 Result->setMethod(0);
2429 Result->setKind(SpecialMemberOverloadResult::Ambiguous);
2430 break;
2431
Sean Huntb320e0c2011-06-10 03:50:41 +00002432 case OR_No_Viable_Function:
2433 Result->setMethod(0);
Richard Smith6c4c36c2012-03-30 20:53:28 +00002434 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
Sean Huntb320e0c2011-06-10 03:50:41 +00002435 break;
2436 }
2437
2438 return Result;
2439}
2440
2441/// \brief Look up the default constructor for the given class.
2442CXXConstructorDecl *Sema::LookupDefaultConstructor(CXXRecordDecl *Class) {
Sean Huntc530d172011-06-10 04:44:37 +00002443 SpecialMemberOverloadResult *Result =
Sean Huntb320e0c2011-06-10 03:50:41 +00002444 LookupSpecialMember(Class, CXXDefaultConstructor, false, false, false,
2445 false, false);
2446
2447 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
Sean Hunt308742c2011-06-04 04:32:43 +00002448}
2449
Sean Hunt661c67a2011-06-21 23:42:56 +00002450/// \brief Look up the copying constructor for the given class.
2451CXXConstructorDecl *Sema::LookupCopyingConstructor(CXXRecordDecl *Class,
Richard Smith704c8f72012-04-20 18:46:14 +00002452 unsigned Quals) {
Sean Huntc530d172011-06-10 04:44:37 +00002453 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2454 "non-const, non-volatile qualifiers for copy ctor arg");
2455 SpecialMemberOverloadResult *Result =
2456 LookupSpecialMember(Class, CXXCopyConstructor, Quals & Qualifiers::Const,
2457 Quals & Qualifiers::Volatile, false, false, false);
2458
Sean Huntc530d172011-06-10 04:44:37 +00002459 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2460}
2461
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002462/// \brief Look up the moving constructor for the given class.
Richard Smith6a06e5f2012-07-18 03:36:00 +00002463CXXConstructorDecl *Sema::LookupMovingConstructor(CXXRecordDecl *Class,
2464 unsigned Quals) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002465 SpecialMemberOverloadResult *Result =
Richard Smith6a06e5f2012-07-18 03:36:00 +00002466 LookupSpecialMember(Class, CXXMoveConstructor, Quals & Qualifiers::Const,
2467 Quals & Qualifiers::Volatile, false, false, false);
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002468
2469 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2470}
2471
Douglas Gregore5eee5a2010-07-02 23:12:18 +00002472/// \brief Look up the constructors for the given class.
2473DeclContext::lookup_result Sema::LookupConstructors(CXXRecordDecl *Class) {
Sean Huntb320e0c2011-06-10 03:50:41 +00002474 // If the implicit constructors have not yet been declared, do so now.
Richard Smithd0adeb62012-11-27 21:20:31 +00002475 if (CanDeclareSpecialMemberFunction(Class)) {
Sean Huntcdee3fe2011-05-11 22:34:38 +00002476 if (Class->needsImplicitDefaultConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +00002477 DeclareImplicitDefaultConstructor(Class);
Richard Smithe5411b72012-12-01 02:35:44 +00002478 if (Class->needsImplicitCopyConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +00002479 DeclareImplicitCopyConstructor(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +00002480 if (getLangOpts().CPlusPlus11 && Class->needsImplicitMoveConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002481 DeclareImplicitMoveConstructor(Class);
Douglas Gregor18274032010-07-03 00:47:00 +00002482 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002483
Douglas Gregore5eee5a2010-07-02 23:12:18 +00002484 CanQualType T = Context.getCanonicalType(Context.getTypeDeclType(Class));
2485 DeclarationName Name = Context.DeclarationNames.getCXXConstructorName(T);
2486 return Class->lookup(Name);
2487}
2488
Sean Hunt661c67a2011-06-21 23:42:56 +00002489/// \brief Look up the copying assignment operator for the given class.
2490CXXMethodDecl *Sema::LookupCopyingAssignment(CXXRecordDecl *Class,
2491 unsigned Quals, bool RValueThis,
Richard Smith704c8f72012-04-20 18:46:14 +00002492 unsigned ThisQuals) {
Sean Hunt661c67a2011-06-21 23:42:56 +00002493 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2494 "non-const, non-volatile qualifiers for copy assignment arg");
2495 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2496 "non-const, non-volatile qualifiers for copy assignment this");
2497 SpecialMemberOverloadResult *Result =
2498 LookupSpecialMember(Class, CXXCopyAssignment, Quals & Qualifiers::Const,
2499 Quals & Qualifiers::Volatile, RValueThis,
2500 ThisQuals & Qualifiers::Const,
2501 ThisQuals & Qualifiers::Volatile);
2502
Sean Hunt661c67a2011-06-21 23:42:56 +00002503 return Result->getMethod();
2504}
2505
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002506/// \brief Look up the moving assignment operator for the given class.
2507CXXMethodDecl *Sema::LookupMovingAssignment(CXXRecordDecl *Class,
Richard Smith6a06e5f2012-07-18 03:36:00 +00002508 unsigned Quals,
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002509 bool RValueThis,
2510 unsigned ThisQuals) {
2511 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2512 "non-const, non-volatile qualifiers for copy assignment this");
2513 SpecialMemberOverloadResult *Result =
Richard Smith6a06e5f2012-07-18 03:36:00 +00002514 LookupSpecialMember(Class, CXXMoveAssignment, Quals & Qualifiers::Const,
2515 Quals & Qualifiers::Volatile, RValueThis,
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002516 ThisQuals & Qualifiers::Const,
2517 ThisQuals & Qualifiers::Volatile);
2518
2519 return Result->getMethod();
2520}
2521
Douglas Gregordb89f282010-07-01 22:47:18 +00002522/// \brief Look for the destructor of the given class.
2523///
Sean Huntc5c9b532011-06-03 21:10:40 +00002524/// During semantic analysis, this routine should be used in lieu of
2525/// CXXRecordDecl::getDestructor().
Douglas Gregordb89f282010-07-01 22:47:18 +00002526///
2527/// \returns The destructor for this class.
2528CXXDestructorDecl *Sema::LookupDestructor(CXXRecordDecl *Class) {
Sean Hunt308742c2011-06-04 04:32:43 +00002529 return cast<CXXDestructorDecl>(LookupSpecialMember(Class, CXXDestructor,
2530 false, false, false,
2531 false, false)->getMethod());
Douglas Gregordb89f282010-07-01 22:47:18 +00002532}
2533
Richard Smith36f5cfe2012-03-09 08:00:36 +00002534/// LookupLiteralOperator - Determine which literal operator should be used for
2535/// a user-defined literal, per C++11 [lex.ext].
2536///
2537/// Normal overload resolution is not used to select which literal operator to
2538/// call for a user-defined literal. Look up the provided literal operator name,
2539/// and filter the results to the appropriate set for the given argument types.
2540Sema::LiteralOperatorLookupResult
2541Sema::LookupLiteralOperator(Scope *S, LookupResult &R,
2542 ArrayRef<QualType> ArgTys,
2543 bool AllowRawAndTemplate) {
2544 LookupName(R, S);
2545 assert(R.getResultKind() != LookupResult::Ambiguous &&
2546 "literal operator lookup can't be ambiguous");
2547
2548 // Filter the lookup results appropriately.
2549 LookupResult::Filter F = R.makeFilter();
2550
2551 bool FoundTemplate = false;
2552 bool FoundRaw = false;
2553 bool FoundExactMatch = false;
2554
2555 while (F.hasNext()) {
2556 Decl *D = F.next();
2557 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2558 D = USD->getTargetDecl();
2559
2560 bool IsTemplate = isa<FunctionTemplateDecl>(D);
2561 bool IsRaw = false;
2562 bool IsExactMatch = false;
2563
2564 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
2565 if (FD->getNumParams() == 1 &&
2566 FD->getParamDecl(0)->getType()->getAs<PointerType>())
2567 IsRaw = true;
Richard Smitha121eb32013-01-15 07:12:59 +00002568 else if (FD->getNumParams() == ArgTys.size()) {
Richard Smith36f5cfe2012-03-09 08:00:36 +00002569 IsExactMatch = true;
2570 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
2571 QualType ParamTy = FD->getParamDecl(ArgIdx)->getType();
2572 if (!Context.hasSameUnqualifiedType(ArgTys[ArgIdx], ParamTy)) {
2573 IsExactMatch = false;
2574 break;
2575 }
2576 }
2577 }
2578 }
2579
2580 if (IsExactMatch) {
2581 FoundExactMatch = true;
2582 AllowRawAndTemplate = false;
2583 if (FoundRaw || FoundTemplate) {
2584 // Go through again and remove the raw and template decls we've
2585 // already found.
2586 F.restart();
2587 FoundRaw = FoundTemplate = false;
2588 }
2589 } else if (AllowRawAndTemplate && (IsTemplate || IsRaw)) {
2590 FoundTemplate |= IsTemplate;
2591 FoundRaw |= IsRaw;
2592 } else {
2593 F.erase();
2594 }
2595 }
2596
2597 F.done();
2598
2599 // C++11 [lex.ext]p3, p4: If S contains a literal operator with a matching
2600 // parameter type, that is used in preference to a raw literal operator
2601 // or literal operator template.
2602 if (FoundExactMatch)
2603 return LOLR_Cooked;
2604
2605 // C++11 [lex.ext]p3, p4: S shall contain a raw literal operator or a literal
2606 // operator template, but not both.
2607 if (FoundRaw && FoundTemplate) {
2608 Diag(R.getNameLoc(), diag::err_ovl_ambiguous_call) << R.getLookupName();
2609 for (LookupResult::iterator I = R.begin(), E = R.end(); I != E; ++I) {
2610 Decl *D = *I;
2611 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2612 D = USD->getTargetDecl();
2613 if (FunctionTemplateDecl *FunTmpl = dyn_cast<FunctionTemplateDecl>(D))
2614 D = FunTmpl->getTemplatedDecl();
2615 NoteOverloadCandidate(cast<FunctionDecl>(D));
2616 }
2617 return LOLR_Error;
2618 }
2619
2620 if (FoundRaw)
2621 return LOLR_Raw;
2622
2623 if (FoundTemplate)
2624 return LOLR_Template;
2625
2626 // Didn't find anything we could use.
2627 Diag(R.getNameLoc(), diag::err_ovl_no_viable_literal_operator)
2628 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
2629 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRawAndTemplate;
2630 return LOLR_Error;
2631}
2632
John McCall7edb5fd2010-01-26 07:16:45 +00002633void ADLResult::insert(NamedDecl *New) {
2634 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
2635
2636 // If we haven't yet seen a decl for this key, or the last decl
2637 // was exactly this one, we're done.
2638 if (Old == 0 || Old == New) {
2639 Old = New;
2640 return;
2641 }
2642
2643 // Otherwise, decide which is a more recent redeclaration.
2644 FunctionDecl *OldFD, *NewFD;
2645 if (isa<FunctionTemplateDecl>(New)) {
2646 OldFD = cast<FunctionTemplateDecl>(Old)->getTemplatedDecl();
2647 NewFD = cast<FunctionTemplateDecl>(New)->getTemplatedDecl();
2648 } else {
2649 OldFD = cast<FunctionDecl>(Old);
2650 NewFD = cast<FunctionDecl>(New);
2651 }
2652
2653 FunctionDecl *Cursor = NewFD;
2654 while (true) {
Douglas Gregoref96ee02012-01-14 16:38:05 +00002655 Cursor = Cursor->getPreviousDecl();
John McCall7edb5fd2010-01-26 07:16:45 +00002656
2657 // If we got to the end without finding OldFD, OldFD is the newer
2658 // declaration; leave things as they are.
2659 if (!Cursor) return;
2660
2661 // If we do find OldFD, then NewFD is newer.
2662 if (Cursor == OldFD) break;
2663
2664 // Otherwise, keep looking.
2665 }
2666
2667 Old = New;
2668}
2669
Sebastian Redl644be852009-10-23 19:23:15 +00002670void Sema::ArgumentDependentLookup(DeclarationName Name, bool Operator,
Richard Smithf5cd5cc2012-02-25 06:24:24 +00002671 SourceLocation Loc,
Ahmed Charles13a140c2012-02-25 11:00:22 +00002672 llvm::ArrayRef<Expr *> Args,
Richard Smithb1502bc2012-10-18 17:56:02 +00002673 ADLResult &Result) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002674 // Find all of the associated namespaces and classes based on the
2675 // arguments we have.
2676 AssociatedNamespaceSet AssociatedNamespaces;
2677 AssociatedClassSet AssociatedClasses;
John McCall42f48fb2012-08-24 20:38:34 +00002678 FindAssociatedClassesAndNamespaces(Loc, Args,
John McCall6ff07852009-08-07 22:18:02 +00002679 AssociatedNamespaces,
2680 AssociatedClasses);
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002681
Sebastian Redl644be852009-10-23 19:23:15 +00002682 QualType T1, T2;
2683 if (Operator) {
2684 T1 = Args[0]->getType();
Ahmed Charles13a140c2012-02-25 11:00:22 +00002685 if (Args.size() >= 2)
Sebastian Redl644be852009-10-23 19:23:15 +00002686 T2 = Args[1]->getType();
2687 }
2688
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002689 // C++ [basic.lookup.argdep]p3:
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002690 // Let X be the lookup set produced by unqualified lookup (3.4.1)
2691 // and let Y be the lookup set produced by argument dependent
2692 // lookup (defined as follows). If X contains [...] then Y is
2693 // empty. Otherwise Y is the set of declarations found in the
2694 // namespaces associated with the argument types as described
2695 // below. The set of declarations found by the lookup of the name
2696 // is the union of X and Y.
2697 //
2698 // Here, we compute Y and add its members to the overloaded
2699 // candidate set.
2700 for (AssociatedNamespaceSet::iterator NS = AssociatedNamespaces.begin(),
Mike Stump1eb44332009-09-09 15:08:12 +00002701 NSEnd = AssociatedNamespaces.end();
2702 NS != NSEnd; ++NS) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002703 // When considering an associated namespace, the lookup is the
2704 // same as the lookup performed when the associated namespace is
2705 // used as a qualifier (3.4.3.2) except that:
2706 //
2707 // -- Any using-directives in the associated namespace are
2708 // ignored.
2709 //
John McCall6ff07852009-08-07 22:18:02 +00002710 // -- Any namespace-scope friend functions declared in
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002711 // associated classes are visible within their respective
2712 // namespaces even if they are not visible during an ordinary
2713 // lookup (11.4).
David Blaikie3bc93e32012-12-19 00:45:41 +00002714 DeclContext::lookup_result R = (*NS)->lookup(Name);
2715 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
2716 ++I) {
John McCall6e266892010-01-26 03:27:55 +00002717 NamedDecl *D = *I;
John McCall02cace72009-08-28 07:59:38 +00002718 // If the only declaration here is an ordinary friend, consider
2719 // it only if it was declared in an associated classes.
2720 if (D->getIdentifierNamespace() == Decl::IDNS_OrdinaryFriend) {
John McCall3f9a8a62009-08-11 06:59:38 +00002721 DeclContext *LexDC = D->getLexicalDeclContext();
2722 if (!AssociatedClasses.count(cast<CXXRecordDecl>(LexDC)))
2723 continue;
2724 }
Mike Stump1eb44332009-09-09 15:08:12 +00002725
John McCalla113e722010-01-26 06:04:06 +00002726 if (isa<UsingShadowDecl>(D))
2727 D = cast<UsingShadowDecl>(D)->getTargetDecl();
John McCall6e266892010-01-26 03:27:55 +00002728
John McCalla113e722010-01-26 06:04:06 +00002729 if (isa<FunctionDecl>(D)) {
2730 if (Operator &&
2731 !IsAcceptableNonMemberOperatorCandidate(cast<FunctionDecl>(D),
2732 T1, T2, Context))
2733 continue;
John McCall7edb5fd2010-01-26 07:16:45 +00002734 } else if (!isa<FunctionTemplateDecl>(D))
2735 continue;
2736
2737 Result.insert(D);
Douglas Gregor44bc2d52009-06-23 20:14:09 +00002738 }
2739 }
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002740}
Douglas Gregor546be3c2009-12-30 17:04:44 +00002741
2742//----------------------------------------------------------------------------
2743// Search for all visible declarations.
2744//----------------------------------------------------------------------------
2745VisibleDeclConsumer::~VisibleDeclConsumer() { }
2746
2747namespace {
2748
2749class ShadowContextRAII;
2750
2751class VisibleDeclsRecord {
2752public:
2753 /// \brief An entry in the shadow map, which is optimized to store a
2754 /// single declaration (the common case) but can also store a list
2755 /// of declarations.
Chris Lattnerb5f65472011-07-18 01:54:02 +00002756 typedef llvm::TinyPtrVector<NamedDecl*> ShadowMapEntry;
Douglas Gregor546be3c2009-12-30 17:04:44 +00002757
2758private:
2759 /// \brief A mapping from declaration names to the declarations that have
2760 /// this name within a particular scope.
2761 typedef llvm::DenseMap<DeclarationName, ShadowMapEntry> ShadowMap;
2762
2763 /// \brief A list of shadow maps, which is used to model name hiding.
2764 std::list<ShadowMap> ShadowMaps;
2765
2766 /// \brief The declaration contexts we have already visited.
2767 llvm::SmallPtrSet<DeclContext *, 8> VisitedContexts;
2768
2769 friend class ShadowContextRAII;
2770
2771public:
2772 /// \brief Determine whether we have already visited this context
2773 /// (and, if not, note that we are going to visit that context now).
2774 bool visitedContext(DeclContext *Ctx) {
2775 return !VisitedContexts.insert(Ctx);
2776 }
2777
Douglas Gregor8071e422010-08-15 06:18:01 +00002778 bool alreadyVisitedContext(DeclContext *Ctx) {
2779 return VisitedContexts.count(Ctx);
2780 }
2781
Douglas Gregor546be3c2009-12-30 17:04:44 +00002782 /// \brief Determine whether the given declaration is hidden in the
2783 /// current scope.
2784 ///
2785 /// \returns the declaration that hides the given declaration, or
2786 /// NULL if no such declaration exists.
2787 NamedDecl *checkHidden(NamedDecl *ND);
2788
2789 /// \brief Add a declaration to the current shadow map.
Chris Lattnerb5f65472011-07-18 01:54:02 +00002790 void add(NamedDecl *ND) {
2791 ShadowMaps.back()[ND->getDeclName()].push_back(ND);
2792 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00002793};
2794
2795/// \brief RAII object that records when we've entered a shadow context.
2796class ShadowContextRAII {
2797 VisibleDeclsRecord &Visible;
2798
2799 typedef VisibleDeclsRecord::ShadowMap ShadowMap;
2800
2801public:
2802 ShadowContextRAII(VisibleDeclsRecord &Visible) : Visible(Visible) {
2803 Visible.ShadowMaps.push_back(ShadowMap());
2804 }
2805
2806 ~ShadowContextRAII() {
Douglas Gregor546be3c2009-12-30 17:04:44 +00002807 Visible.ShadowMaps.pop_back();
2808 }
2809};
2810
2811} // end anonymous namespace
2812
Douglas Gregor546be3c2009-12-30 17:04:44 +00002813NamedDecl *VisibleDeclsRecord::checkHidden(NamedDecl *ND) {
Douglas Gregorefcf16d2010-01-14 00:06:47 +00002814 // Look through using declarations.
2815 ND = ND->getUnderlyingDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002816
Douglas Gregor546be3c2009-12-30 17:04:44 +00002817 unsigned IDNS = ND->getIdentifierNamespace();
2818 std::list<ShadowMap>::reverse_iterator SM = ShadowMaps.rbegin();
2819 for (std::list<ShadowMap>::reverse_iterator SMEnd = ShadowMaps.rend();
2820 SM != SMEnd; ++SM) {
2821 ShadowMap::iterator Pos = SM->find(ND->getDeclName());
2822 if (Pos == SM->end())
2823 continue;
2824
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002825 for (ShadowMapEntry::iterator I = Pos->second.begin(),
Douglas Gregor546be3c2009-12-30 17:04:44 +00002826 IEnd = Pos->second.end();
2827 I != IEnd; ++I) {
2828 // A tag declaration does not hide a non-tag declaration.
John McCall0d6b1642010-04-23 18:46:30 +00002829 if ((*I)->hasTagIdentifierNamespace() &&
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002830 (IDNS & (Decl::IDNS_Member | Decl::IDNS_Ordinary |
Douglas Gregor546be3c2009-12-30 17:04:44 +00002831 Decl::IDNS_ObjCProtocol)))
2832 continue;
2833
2834 // Protocols are in distinct namespaces from everything else.
2835 if ((((*I)->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol)
2836 || (IDNS & Decl::IDNS_ObjCProtocol)) &&
2837 (*I)->getIdentifierNamespace() != IDNS)
2838 continue;
2839
Douglas Gregor0cc84042010-01-14 15:47:35 +00002840 // Functions and function templates in the same scope overload
2841 // rather than hide. FIXME: Look for hiding based on function
2842 // signatures!
Douglas Gregordef91072010-01-14 03:35:48 +00002843 if ((*I)->isFunctionOrFunctionTemplate() &&
Douglas Gregor0cc84042010-01-14 15:47:35 +00002844 ND->isFunctionOrFunctionTemplate() &&
2845 SM == ShadowMaps.rbegin())
Douglas Gregordef91072010-01-14 03:35:48 +00002846 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002847
Douglas Gregor546be3c2009-12-30 17:04:44 +00002848 // We've found a declaration that hides this one.
2849 return *I;
2850 }
2851 }
2852
2853 return 0;
2854}
2855
2856static void LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result,
2857 bool QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002858 bool InBaseClass,
Douglas Gregor546be3c2009-12-30 17:04:44 +00002859 VisibleDeclConsumer &Consumer,
2860 VisibleDeclsRecord &Visited) {
Douglas Gregor62021192010-02-04 23:42:48 +00002861 if (!Ctx)
2862 return;
2863
Douglas Gregor546be3c2009-12-30 17:04:44 +00002864 // Make sure we don't visit the same context twice.
2865 if (Visited.visitedContext(Ctx->getPrimaryContext()))
2866 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002867
Douglas Gregor4923aa22010-07-02 20:37:36 +00002868 if (CXXRecordDecl *Class = dyn_cast<CXXRecordDecl>(Ctx))
2869 Result.getSema().ForceDeclarationOfImplicitMembers(Class);
2870
Douglas Gregor546be3c2009-12-30 17:04:44 +00002871 // Enumerate all of the results in this context.
Nick Lewycky173a37a2012-04-03 21:44:08 +00002872 for (DeclContext::all_lookups_iterator L = Ctx->lookups_begin(),
2873 LEnd = Ctx->lookups_end();
2874 L != LEnd; ++L) {
David Blaikie3bc93e32012-12-19 00:45:41 +00002875 DeclContext::lookup_result R = *L;
2876 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
2877 ++I) {
2878 if (NamedDecl *ND = dyn_cast<NamedDecl>(*I)) {
Douglas Gregor55368912011-12-14 16:03:29 +00002879 if ((ND = Result.getAcceptableDecl(ND))) {
Erik Verbruggend1205962011-10-06 07:27:49 +00002880 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
Douglas Gregor546be3c2009-12-30 17:04:44 +00002881 Visited.add(ND);
2882 }
Douglas Gregor70c23352010-12-09 21:44:02 +00002883 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00002884 }
2885 }
2886
2887 // Traverse using directives for qualified name lookup.
2888 if (QualifiedNameLookup) {
2889 ShadowContextRAII Shadow(Visited);
2890 DeclContext::udir_iterator I, E;
2891 for (llvm::tie(I, E) = Ctx->getUsingDirectives(); I != E; ++I) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002892 LookupVisibleDecls((*I)->getNominatedNamespace(), Result,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002893 QualifiedNameLookup, InBaseClass, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00002894 }
2895 }
2896
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002897 // Traverse the contexts of inherited C++ classes.
Douglas Gregor546be3c2009-12-30 17:04:44 +00002898 if (CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(Ctx)) {
John McCall86ff3082010-02-04 22:26:26 +00002899 if (!Record->hasDefinition())
2900 return;
2901
Douglas Gregor546be3c2009-12-30 17:04:44 +00002902 for (CXXRecordDecl::base_class_iterator B = Record->bases_begin(),
2903 BEnd = Record->bases_end();
2904 B != BEnd; ++B) {
2905 QualType BaseType = B->getType();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002906
Douglas Gregor546be3c2009-12-30 17:04:44 +00002907 // Don't look into dependent bases, because name lookup can't look
2908 // there anyway.
2909 if (BaseType->isDependentType())
2910 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002911
Douglas Gregor546be3c2009-12-30 17:04:44 +00002912 const RecordType *Record = BaseType->getAs<RecordType>();
2913 if (!Record)
2914 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002915
Douglas Gregor546be3c2009-12-30 17:04:44 +00002916 // FIXME: It would be nice to be able to determine whether referencing
2917 // a particular member would be ambiguous. For example, given
2918 //
2919 // struct A { int member; };
2920 // struct B { int member; };
2921 // struct C : A, B { };
2922 //
2923 // void f(C *c) { c->### }
2924 //
2925 // accessing 'member' would result in an ambiguity. However, we
2926 // could be smart enough to qualify the member with the base
2927 // class, e.g.,
2928 //
2929 // c->B::member
2930 //
2931 // or
2932 //
2933 // c->A::member
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002934
Douglas Gregor546be3c2009-12-30 17:04:44 +00002935 // Find results in this base class (and its bases).
2936 ShadowContextRAII Shadow(Visited);
2937 LookupVisibleDecls(Record->getDecl(), Result, QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002938 true, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00002939 }
2940 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002941
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002942 // Traverse the contexts of Objective-C classes.
2943 if (ObjCInterfaceDecl *IFace = dyn_cast<ObjCInterfaceDecl>(Ctx)) {
2944 // Traverse categories.
Douglas Gregord3297242013-01-16 23:00:23 +00002945 for (ObjCInterfaceDecl::visible_categories_iterator
2946 Cat = IFace->visible_categories_begin(),
2947 CatEnd = IFace->visible_categories_end();
2948 Cat != CatEnd; ++Cat) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002949 ShadowContextRAII Shadow(Visited);
Douglas Gregord3297242013-01-16 23:00:23 +00002950 LookupVisibleDecls(*Cat, Result, QualifiedNameLookup, false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002951 Consumer, Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002952 }
2953
2954 // Traverse protocols.
Ted Kremenek53b94412010-09-01 01:21:15 +00002955 for (ObjCInterfaceDecl::all_protocol_iterator
2956 I = IFace->all_referenced_protocol_begin(),
2957 E = IFace->all_referenced_protocol_end(); I != E; ++I) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002958 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002959 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002960 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002961 }
2962
2963 // Traverse the superclass.
2964 if (IFace->getSuperClass()) {
2965 ShadowContextRAII Shadow(Visited);
2966 LookupVisibleDecls(IFace->getSuperClass(), Result, QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002967 true, Consumer, Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002968 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002969
Douglas Gregorc220a182010-04-19 18:02:19 +00002970 // If there is an implementation, traverse it. We do this to find
2971 // synthesized ivars.
2972 if (IFace->getImplementation()) {
2973 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002974 LookupVisibleDecls(IFace->getImplementation(), Result,
Nick Lewycky893a6ea2012-04-03 20:26:45 +00002975 QualifiedNameLookup, InBaseClass, Consumer, Visited);
Douglas Gregorc220a182010-04-19 18:02:19 +00002976 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002977 } else if (ObjCProtocolDecl *Protocol = dyn_cast<ObjCProtocolDecl>(Ctx)) {
2978 for (ObjCProtocolDecl::protocol_iterator I = Protocol->protocol_begin(),
2979 E = Protocol->protocol_end(); I != E; ++I) {
2980 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002981 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002982 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002983 }
2984 } else if (ObjCCategoryDecl *Category = dyn_cast<ObjCCategoryDecl>(Ctx)) {
2985 for (ObjCCategoryDecl::protocol_iterator I = Category->protocol_begin(),
2986 E = Category->protocol_end(); I != E; ++I) {
2987 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002988 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00002989 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002990 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002991
Douglas Gregorc220a182010-04-19 18:02:19 +00002992 // If there is an implementation, traverse it.
2993 if (Category->getImplementation()) {
2994 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002995 LookupVisibleDecls(Category->getImplementation(), Result,
Douglas Gregorc220a182010-04-19 18:02:19 +00002996 QualifiedNameLookup, true, Consumer, Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002997 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00002998 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00002999}
3000
3001static void LookupVisibleDecls(Scope *S, LookupResult &Result,
3002 UnqualUsingDirectiveSet &UDirs,
3003 VisibleDeclConsumer &Consumer,
3004 VisibleDeclsRecord &Visited) {
3005 if (!S)
3006 return;
3007
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003008 if (!S->getEntity() ||
3009 (!S->getParent() &&
Douglas Gregor8071e422010-08-15 06:18:01 +00003010 !Visited.alreadyVisitedContext((DeclContext *)S->getEntity())) ||
Douglas Gregor539c5c32010-01-07 00:31:29 +00003011 ((DeclContext *)S->getEntity())->isFunctionOrMethod()) {
3012 // Walk through the declarations in this Scope.
3013 for (Scope::decl_iterator D = S->decl_begin(), DEnd = S->decl_end();
3014 D != DEnd; ++D) {
John McCalld226f652010-08-21 09:40:31 +00003015 if (NamedDecl *ND = dyn_cast<NamedDecl>(*D))
Douglas Gregor55368912011-12-14 16:03:29 +00003016 if ((ND = Result.getAcceptableDecl(ND))) {
Erik Verbruggend1205962011-10-06 07:27:49 +00003017 Consumer.FoundDecl(ND, Visited.checkHidden(ND), 0, false);
Douglas Gregor539c5c32010-01-07 00:31:29 +00003018 Visited.add(ND);
3019 }
3020 }
3021 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003022
Douglas Gregor711be1e2010-03-15 14:33:29 +00003023 // FIXME: C++ [temp.local]p8
Douglas Gregor546be3c2009-12-30 17:04:44 +00003024 DeclContext *Entity = 0;
Douglas Gregore3582012010-01-01 17:44:25 +00003025 if (S->getEntity()) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003026 // Look into this scope's declaration context, along with any of its
3027 // parent lookup contexts (e.g., enclosing classes), up to the point
3028 // where we hit the context stored in the next outer scope.
3029 Entity = (DeclContext *)S->getEntity();
Douglas Gregor711be1e2010-03-15 14:33:29 +00003030 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003031
Douglas Gregordbdf5e72010-03-15 15:26:48 +00003032 for (DeclContext *Ctx = Entity; Ctx && !Ctx->Equals(OuterCtx);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003033 Ctx = Ctx->getLookupParent()) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003034 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
3035 if (Method->isInstanceMethod()) {
3036 // For instance methods, look for ivars in the method's interface.
3037 LookupResult IvarResult(Result.getSema(), Result.getLookupName(),
3038 Result.getNameLoc(), Sema::LookupMemberName);
Douglas Gregorca45da02010-11-02 20:36:02 +00003039 if (ObjCInterfaceDecl *IFace = Method->getClassInterface()) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003040 LookupVisibleDecls(IFace, IvarResult, /*QualifiedNameLookup=*/false,
Fariborz Jahanian8697d302011-08-31 22:24:06 +00003041 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregorca45da02010-11-02 20:36:02 +00003042 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003043 }
3044
3045 // We've already performed all of the name lookup that we need
3046 // to for Objective-C methods; the next context will be the
3047 // outer scope.
3048 break;
3049 }
3050
Douglas Gregor546be3c2009-12-30 17:04:44 +00003051 if (Ctx->isFunctionOrMethod())
3052 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003053
3054 LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003055 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003056 }
3057 } else if (!S->getParent()) {
3058 // Look into the translation unit scope. We walk through the translation
3059 // unit's declaration context, because the Scope itself won't have all of
3060 // the declarations if we loaded a precompiled header.
3061 // FIXME: We would like the translation unit's Scope object to point to the
3062 // translation unit, so we don't need this special "if" branch. However,
3063 // doing so would force the normal C++ name-lookup code to look into the
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003064 // translation unit decl when the IdentifierInfo chains would suffice.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003065 // Once we fix that problem (which is part of a more general "don't look
Douglas Gregor539c5c32010-01-07 00:31:29 +00003066 // in DeclContexts unless we have to" optimization), we can eliminate this.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003067 Entity = Result.getSema().Context.getTranslationUnitDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003068 LookupVisibleDecls(Entity, Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003069 /*InBaseClass=*/false, Consumer, Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003070 }
3071
Douglas Gregor546be3c2009-12-30 17:04:44 +00003072 if (Entity) {
3073 // Lookup visible declarations in any namespaces found by using
3074 // directives.
3075 UnqualUsingDirectiveSet::const_iterator UI, UEnd;
3076 llvm::tie(UI, UEnd) = UDirs.getNamespacesFor(Entity);
3077 for (; UI != UEnd; ++UI)
3078 LookupVisibleDecls(const_cast<DeclContext *>(UI->getNominatedNamespace()),
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003079 Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003080 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003081 }
3082
3083 // Lookup names in the parent scope.
3084 ShadowContextRAII Shadow(Visited);
3085 LookupVisibleDecls(S->getParent(), Result, UDirs, Consumer, Visited);
3086}
3087
3088void Sema::LookupVisibleDecls(Scope *S, LookupNameKind Kind,
Douglas Gregor8071e422010-08-15 06:18:01 +00003089 VisibleDeclConsumer &Consumer,
3090 bool IncludeGlobalScope) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003091 // Determine the set of using directives available during
3092 // unqualified name lookup.
3093 Scope *Initial = S;
3094 UnqualUsingDirectiveSet UDirs;
David Blaikie4e4d0842012-03-11 07:00:24 +00003095 if (getLangOpts().CPlusPlus) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003096 // Find the first namespace or translation-unit scope.
3097 while (S && !isNamespaceOrTranslationUnitScope(S))
3098 S = S->getParent();
3099
3100 UDirs.visitScopeChain(Initial, S);
3101 }
3102 UDirs.done();
3103
3104 // Look for visible declarations.
3105 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3106 VisibleDeclsRecord Visited;
Douglas Gregor8071e422010-08-15 06:18:01 +00003107 if (!IncludeGlobalScope)
3108 Visited.visitedContext(Context.getTranslationUnitDecl());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003109 ShadowContextRAII Shadow(Visited);
3110 ::LookupVisibleDecls(Initial, Result, UDirs, Consumer, Visited);
3111}
3112
3113void Sema::LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
Douglas Gregor8071e422010-08-15 06:18:01 +00003114 VisibleDeclConsumer &Consumer,
3115 bool IncludeGlobalScope) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003116 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
3117 VisibleDeclsRecord Visited;
Douglas Gregor8071e422010-08-15 06:18:01 +00003118 if (!IncludeGlobalScope)
3119 Visited.visitedContext(Context.getTranslationUnitDecl());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003120 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003121 ::LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/true,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003122 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003123}
3124
Chris Lattner4ae493c2011-02-18 02:08:43 +00003125/// LookupOrCreateLabel - Do a name lookup of a label with the specified name.
Abramo Bagnara67843042011-03-05 18:21:20 +00003126/// If GnuLabelLoc is a valid source location, then this is a definition
3127/// of an __label__ label name, otherwise it is a normal label definition
3128/// or use.
Chris Lattner4ae493c2011-02-18 02:08:43 +00003129LabelDecl *Sema::LookupOrCreateLabel(IdentifierInfo *II, SourceLocation Loc,
Abramo Bagnara67843042011-03-05 18:21:20 +00003130 SourceLocation GnuLabelLoc) {
Chris Lattner337e5502011-02-18 01:27:55 +00003131 // Do a lookup to see if we have a label with this name already.
Chris Lattner4ae493c2011-02-18 02:08:43 +00003132 NamedDecl *Res = 0;
Abramo Bagnara67843042011-03-05 18:21:20 +00003133
3134 if (GnuLabelLoc.isValid()) {
3135 // Local label definitions always shadow existing labels.
3136 Res = LabelDecl::Create(Context, CurContext, Loc, II, GnuLabelLoc);
3137 Scope *S = CurScope;
3138 PushOnScopeChains(Res, S, true);
3139 return cast<LabelDecl>(Res);
3140 }
3141
3142 // Not a GNU local label.
3143 Res = LookupSingleName(CurScope, II, Loc, LookupLabel, NotForRedeclaration);
3144 // If we found a label, check to see if it is in the same context as us.
3145 // When in a Block, we don't want to reuse a label in an enclosing function.
Chris Lattner337e5502011-02-18 01:27:55 +00003146 if (Res && Res->getDeclContext() != CurContext)
3147 Res = 0;
Chris Lattner337e5502011-02-18 01:27:55 +00003148 if (Res == 0) {
3149 // If not forward referenced or defined already, create the backing decl.
Abramo Bagnara67843042011-03-05 18:21:20 +00003150 Res = LabelDecl::Create(Context, CurContext, Loc, II);
3151 Scope *S = CurScope->getFnParent();
Chris Lattnerfebb5b82011-02-18 21:16:39 +00003152 assert(S && "Not in a function?");
3153 PushOnScopeChains(Res, S, true);
Chris Lattner337e5502011-02-18 01:27:55 +00003154 }
Chris Lattner337e5502011-02-18 01:27:55 +00003155 return cast<LabelDecl>(Res);
3156}
3157
3158//===----------------------------------------------------------------------===//
Douglas Gregor546be3c2009-12-30 17:04:44 +00003159// Typo correction
Chris Lattner337e5502011-02-18 01:27:55 +00003160//===----------------------------------------------------------------------===//
Douglas Gregor546be3c2009-12-30 17:04:44 +00003161
3162namespace {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003163
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00003164typedef SmallVector<TypoCorrection, 1> TypoResultList;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003165typedef llvm::StringMap<TypoResultList, llvm::BumpPtrAllocator> TypoResultsMap;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003166typedef std::map<unsigned, TypoResultsMap> TypoEditDistanceMap;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003167
3168static const unsigned MaxTypoDistanceResultSets = 5;
3169
Douglas Gregor546be3c2009-12-30 17:04:44 +00003170class TypoCorrectionConsumer : public VisibleDeclConsumer {
3171 /// \brief The name written that is a typo in the source.
Chris Lattner5f9e2722011-07-23 10:55:15 +00003172 StringRef Typo;
Douglas Gregor546be3c2009-12-30 17:04:44 +00003173
3174 /// \brief The results found that have the smallest edit distance
3175 /// found (so far) with the typo name.
Douglas Gregore24b5752010-10-14 20:34:08 +00003176 ///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003177 /// The pointer value being set to the current DeclContext indicates
3178 /// whether there is a keyword with this name.
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003179 TypoEditDistanceMap CorrectionResults;
Douglas Gregor546be3c2009-12-30 17:04:44 +00003180
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003181 Sema &SemaRef;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003182
Douglas Gregor546be3c2009-12-30 17:04:44 +00003183public:
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003184 explicit TypoCorrectionConsumer(Sema &SemaRef, IdentifierInfo *Typo)
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003185 : Typo(Typo->getName()),
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003186 SemaRef(SemaRef) { }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003187
Erik Verbruggend1205962011-10-06 07:27:49 +00003188 virtual void FoundDecl(NamedDecl *ND, NamedDecl *Hiding, DeclContext *Ctx,
3189 bool InBaseClass);
Chris Lattner5f9e2722011-07-23 10:55:15 +00003190 void FoundName(StringRef Name);
3191 void addKeywordResult(StringRef Keyword);
3192 void addName(StringRef Name, NamedDecl *ND, unsigned Distance,
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003193 NestedNameSpecifier *NNS=NULL, bool isKeyword=false);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003194 void addCorrection(TypoCorrection Correction);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003195
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003196 typedef TypoResultsMap::iterator result_iterator;
3197 typedef TypoEditDistanceMap::iterator distance_iterator;
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003198 distance_iterator begin() { return CorrectionResults.begin(); }
3199 distance_iterator end() { return CorrectionResults.end(); }
3200 void erase(distance_iterator I) { CorrectionResults.erase(I); }
3201 unsigned size() const { return CorrectionResults.size(); }
3202 bool empty() const { return CorrectionResults.empty(); }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003203
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003204 TypoResultList &operator[](StringRef Name) {
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003205 return CorrectionResults.begin()->second[Name];
Douglas Gregor7b824e82010-10-15 13:35:25 +00003206 }
3207
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003208 unsigned getBestEditDistance(bool Normalized) {
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003209 if (CorrectionResults.empty())
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003210 return (std::numeric_limits<unsigned>::max)();
3211
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003212 unsigned BestED = CorrectionResults.begin()->first;
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003213 return Normalized ? TypoCorrection::NormalizeEditDistance(BestED) : BestED;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003214 }
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003215
3216 TypoResultsMap &getBestResults() {
3217 return CorrectionResults.begin()->second;
3218 }
3219
Douglas Gregor546be3c2009-12-30 17:04:44 +00003220};
3221
3222}
3223
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003224void TypoCorrectionConsumer::FoundDecl(NamedDecl *ND, NamedDecl *Hiding,
Erik Verbruggend1205962011-10-06 07:27:49 +00003225 DeclContext *Ctx, bool InBaseClass) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003226 // Don't consider hidden names for typo correction.
3227 if (Hiding)
3228 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003229
Douglas Gregor546be3c2009-12-30 17:04:44 +00003230 // Only consider entities with identifiers for names, ignoring
3231 // special names (constructors, overloaded operators, selectors,
3232 // etc.).
3233 IdentifierInfo *Name = ND->getIdentifier();
3234 if (!Name)
3235 return;
3236
Douglas Gregor95f42922010-10-14 22:11:03 +00003237 FoundName(Name->getName());
3238}
3239
Chris Lattner5f9e2722011-07-23 10:55:15 +00003240void TypoCorrectionConsumer::FoundName(StringRef Name) {
Douglas Gregor362a8f22010-10-19 19:39:10 +00003241 // Use a simple length-based heuristic to determine the minimum possible
3242 // edit distance. If the minimum isn't good enough, bail out early.
3243 unsigned MinED = abs((int)Name.size() - (int)Typo.size());
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003244 if (MinED && Typo.size() / MinED < 3)
Douglas Gregor362a8f22010-10-19 19:39:10 +00003245 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003246
Douglas Gregora1194772010-10-19 22:14:33 +00003247 // Compute an upper bound on the allowable edit distance, so that the
3248 // edit-distance algorithm can short-circuit.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003249 unsigned UpperBound = (Typo.size() + 2) / 3;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003250
Douglas Gregor546be3c2009-12-30 17:04:44 +00003251 // Compute the edit distance between the typo and the name of this
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003252 // entity, and add the identifier to the list of results.
3253 addName(Name, NULL, Typo.edit_distance(Name, true, UpperBound));
Douglas Gregor546be3c2009-12-30 17:04:44 +00003254}
3255
Chris Lattner5f9e2722011-07-23 10:55:15 +00003256void TypoCorrectionConsumer::addKeywordResult(StringRef Keyword) {
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003257 // Compute the edit distance between the typo and this keyword,
3258 // and add the keyword to the list of results.
3259 addName(Keyword, NULL, Typo.edit_distance(Keyword), NULL, true);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003260}
3261
Chris Lattner5f9e2722011-07-23 10:55:15 +00003262void TypoCorrectionConsumer::addName(StringRef Name,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003263 NamedDecl *ND,
3264 unsigned Distance,
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003265 NestedNameSpecifier *NNS,
3266 bool isKeyword) {
3267 TypoCorrection TC(&SemaRef.Context.Idents.get(Name), ND, NNS, Distance);
3268 if (isKeyword) TC.makeKeyword();
3269 addCorrection(TC);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003270}
3271
3272void TypoCorrectionConsumer::addCorrection(TypoCorrection Correction) {
Chris Lattner5f9e2722011-07-23 10:55:15 +00003273 StringRef Name = Correction.getCorrectionAsIdentifierInfo()->getName();
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003274 TypoResultList &CList =
3275 CorrectionResults[Correction.getEditDistance(false)][Name];
Chandler Carruth55620532011-06-28 22:48:40 +00003276
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003277 if (!CList.empty() && !CList.back().isResolved())
3278 CList.pop_back();
3279 if (NamedDecl *NewND = Correction.getCorrectionDecl()) {
3280 std::string CorrectionStr = Correction.getAsString(SemaRef.getLangOpts());
3281 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
3282 RI != RIEnd; ++RI) {
3283 // If the Correction refers to a decl already in the result list,
3284 // replace the existing result if the string representation of Correction
3285 // comes before the current result alphabetically, then stop as there is
3286 // nothing more to be done to add Correction to the candidate set.
3287 if (RI->getCorrectionDecl() == NewND) {
3288 if (CorrectionStr < RI->getAsString(SemaRef.getLangOpts()))
3289 *RI = Correction;
3290 return;
3291 }
3292 }
3293 }
3294 if (CList.empty() || Correction.isResolved())
3295 CList.push_back(Correction);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003296
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003297 while (CorrectionResults.size() > MaxTypoDistanceResultSets)
3298 erase(llvm::prior(CorrectionResults.end()));
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003299}
3300
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003301// Fill the supplied vector with the IdentifierInfo pointers for each piece of
3302// the given NestedNameSpecifier (i.e. given a NestedNameSpecifier "foo::bar::",
3303// fill the vector with the IdentifierInfo pointers for "foo" and "bar").
3304static void getNestedNameSpecifierIdentifiers(
3305 NestedNameSpecifier *NNS,
3306 SmallVectorImpl<const IdentifierInfo*> &Identifiers) {
3307 if (NestedNameSpecifier *Prefix = NNS->getPrefix())
3308 getNestedNameSpecifierIdentifiers(Prefix, Identifiers);
3309 else
3310 Identifiers.clear();
3311
3312 const IdentifierInfo *II = NULL;
3313
3314 switch (NNS->getKind()) {
3315 case NestedNameSpecifier::Identifier:
3316 II = NNS->getAsIdentifier();
3317 break;
3318
3319 case NestedNameSpecifier::Namespace:
3320 if (NNS->getAsNamespace()->isAnonymousNamespace())
3321 return;
3322 II = NNS->getAsNamespace()->getIdentifier();
3323 break;
3324
3325 case NestedNameSpecifier::NamespaceAlias:
3326 II = NNS->getAsNamespaceAlias()->getIdentifier();
3327 break;
3328
3329 case NestedNameSpecifier::TypeSpecWithTemplate:
3330 case NestedNameSpecifier::TypeSpec:
3331 II = QualType(NNS->getAsType(), 0).getBaseTypeIdentifier();
3332 break;
3333
3334 case NestedNameSpecifier::Global:
3335 return;
3336 }
3337
3338 if (II)
3339 Identifiers.push_back(II);
3340}
3341
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003342namespace {
3343
3344class SpecifierInfo {
3345 public:
3346 DeclContext* DeclCtx;
3347 NestedNameSpecifier* NameSpecifier;
3348 unsigned EditDistance;
3349
3350 SpecifierInfo(DeclContext *Ctx, NestedNameSpecifier *NNS, unsigned ED)
3351 : DeclCtx(Ctx), NameSpecifier(NNS), EditDistance(ED) {}
3352};
3353
Chris Lattner5f9e2722011-07-23 10:55:15 +00003354typedef SmallVector<DeclContext*, 4> DeclContextList;
3355typedef SmallVector<SpecifierInfo, 16> SpecifierInfoList;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003356
3357class NamespaceSpecifierSet {
3358 ASTContext &Context;
3359 DeclContextList CurContextChain;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003360 SmallVector<const IdentifierInfo*, 4> CurContextIdentifiers;
3361 SmallVector<const IdentifierInfo*, 4> CurNameSpecifierIdentifiers;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003362 bool isSorted;
3363
3364 SpecifierInfoList Specifiers;
3365 llvm::SmallSetVector<unsigned, 4> Distances;
3366 llvm::DenseMap<unsigned, SpecifierInfoList> DistanceMap;
3367
3368 /// \brief Helper for building the list of DeclContexts between the current
3369 /// context and the top of the translation unit
3370 static DeclContextList BuildContextChain(DeclContext *Start);
3371
3372 void SortNamespaces();
3373
3374 public:
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003375 NamespaceSpecifierSet(ASTContext &Context, DeclContext *CurContext,
3376 CXXScopeSpec *CurScopeSpec)
Benjamin Kramerc5bb9d42011-07-05 09:46:31 +00003377 : Context(Context), CurContextChain(BuildContextChain(CurContext)),
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003378 isSorted(true) {
3379 if (CurScopeSpec && CurScopeSpec->getScopeRep())
3380 getNestedNameSpecifierIdentifiers(CurScopeSpec->getScopeRep(),
3381 CurNameSpecifierIdentifiers);
3382 // Build the list of identifiers that would be used for an absolute
Benjamin Kramer48d798c2012-06-02 10:20:41 +00003383 // (from the global context) NestedNameSpecifier referring to the current
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003384 // context.
3385 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3386 CEnd = CurContextChain.rend();
3387 C != CEnd; ++C) {
3388 if (NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C))
3389 CurContextIdentifiers.push_back(ND->getIdentifier());
3390 }
3391 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003392
3393 /// \brief Add the namespace to the set, computing the corresponding
3394 /// NestedNameSpecifier and its distance in the process.
3395 void AddNamespace(NamespaceDecl *ND);
3396
3397 typedef SpecifierInfoList::iterator iterator;
3398 iterator begin() {
3399 if (!isSorted) SortNamespaces();
3400 return Specifiers.begin();
3401 }
3402 iterator end() { return Specifiers.end(); }
3403};
3404
3405}
3406
3407DeclContextList NamespaceSpecifierSet::BuildContextChain(DeclContext *Start) {
Nick Lewycky0db9d202013-04-08 21:55:21 +00003408 assert(Start && "Building a context chain from a null context");
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003409 DeclContextList Chain;
3410 for (DeclContext *DC = Start->getPrimaryContext(); DC != NULL;
3411 DC = DC->getLookupParent()) {
3412 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(DC);
3413 if (!DC->isInlineNamespace() && !DC->isTransparentContext() &&
3414 !(ND && ND->isAnonymousNamespace()))
3415 Chain.push_back(DC->getPrimaryContext());
3416 }
3417 return Chain;
3418}
3419
3420void NamespaceSpecifierSet::SortNamespaces() {
Chris Lattner5f9e2722011-07-23 10:55:15 +00003421 SmallVector<unsigned, 4> sortedDistances;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003422 sortedDistances.append(Distances.begin(), Distances.end());
3423
3424 if (sortedDistances.size() > 1)
3425 std::sort(sortedDistances.begin(), sortedDistances.end());
3426
3427 Specifiers.clear();
Chris Lattner5f9e2722011-07-23 10:55:15 +00003428 for (SmallVector<unsigned, 4>::iterator DI = sortedDistances.begin(),
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003429 DIEnd = sortedDistances.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003430 DI != DIEnd; ++DI) {
3431 SpecifierInfoList &SpecList = DistanceMap[*DI];
3432 Specifiers.append(SpecList.begin(), SpecList.end());
3433 }
3434
3435 isSorted = true;
3436}
3437
3438void NamespaceSpecifierSet::AddNamespace(NamespaceDecl *ND) {
Chandler Carruth9af7e8e2011-06-28 21:43:34 +00003439 DeclContext *Ctx = cast<DeclContext>(ND);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003440 NestedNameSpecifier *NNS = NULL;
3441 unsigned NumSpecifiers = 0;
3442 DeclContextList NamespaceDeclChain(BuildContextChain(Ctx));
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003443 DeclContextList FullNamespaceDeclChain(NamespaceDeclChain);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003444
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003445 // Eliminate common elements from the two DeclContext chains.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003446 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3447 CEnd = CurContextChain.rend();
Chandler Carruth9af7e8e2011-06-28 21:43:34 +00003448 C != CEnd && !NamespaceDeclChain.empty() &&
3449 NamespaceDeclChain.back() == *C; ++C) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003450 NamespaceDeclChain.pop_back();
3451 }
3452
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003453 // Add an explicit leading '::' specifier if needed.
3454 if (NamespaceDecl *ND =
Kaelyn Uhrain3ad02aa2012-02-15 22:59:03 +00003455 NamespaceDeclChain.empty() ? NULL :
3456 dyn_cast_or_null<NamespaceDecl>(NamespaceDeclChain.back())) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003457 IdentifierInfo *Name = ND->getIdentifier();
3458 if (std::find(CurContextIdentifiers.begin(), CurContextIdentifiers.end(),
3459 Name) != CurContextIdentifiers.end() ||
3460 std::find(CurNameSpecifierIdentifiers.begin(),
3461 CurNameSpecifierIdentifiers.end(),
3462 Name) != CurNameSpecifierIdentifiers.end()) {
3463 NamespaceDeclChain = FullNamespaceDeclChain;
3464 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
3465 }
3466 }
3467
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003468 // Build the NestedNameSpecifier from what is left of the NamespaceDeclChain
3469 for (DeclContextList::reverse_iterator C = NamespaceDeclChain.rbegin(),
3470 CEnd = NamespaceDeclChain.rend();
3471 C != CEnd; ++C) {
3472 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C);
3473 if (ND) {
3474 NNS = NestedNameSpecifier::Create(Context, NNS, ND);
3475 ++NumSpecifiers;
3476 }
3477 }
3478
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003479 // If the built NestedNameSpecifier would be replacing an existing
3480 // NestedNameSpecifier, use the number of component identifiers that
3481 // would need to be changed as the edit distance instead of the number
3482 // of components in the built NestedNameSpecifier.
3483 if (NNS && !CurNameSpecifierIdentifiers.empty()) {
3484 SmallVector<const IdentifierInfo*, 4> NewNameSpecifierIdentifiers;
3485 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
3486 NumSpecifiers = llvm::ComputeEditDistance(
3487 llvm::ArrayRef<const IdentifierInfo*>(CurNameSpecifierIdentifiers),
3488 llvm::ArrayRef<const IdentifierInfo*>(NewNameSpecifierIdentifiers));
3489 }
3490
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003491 isSorted = false;
3492 Distances.insert(NumSpecifiers);
3493 DistanceMap[NumSpecifiers].push_back(SpecifierInfo(Ctx, NNS, NumSpecifiers));
Douglas Gregoraaf87162010-04-14 20:04:41 +00003494}
3495
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003496/// \brief Perform name lookup for a possible result for typo correction.
3497static void LookupPotentialTypoResult(Sema &SemaRef,
3498 LookupResult &Res,
3499 IdentifierInfo *Name,
3500 Scope *S, CXXScopeSpec *SS,
3501 DeclContext *MemberContext,
3502 bool EnteringContext,
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003503 bool isObjCIvarLookup) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003504 Res.suppressDiagnostics();
3505 Res.clear();
3506 Res.setLookupName(Name);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003507 if (MemberContext) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003508 if (ObjCInterfaceDecl *Class = dyn_cast<ObjCInterfaceDecl>(MemberContext)) {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003509 if (isObjCIvarLookup) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003510 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(Name)) {
3511 Res.addDecl(Ivar);
3512 Res.resolveKind();
3513 return;
3514 }
3515 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003516
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003517 if (ObjCPropertyDecl *Prop = Class->FindPropertyDeclaration(Name)) {
3518 Res.addDecl(Prop);
3519 Res.resolveKind();
3520 return;
3521 }
3522 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003523
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003524 SemaRef.LookupQualifiedName(Res, MemberContext);
3525 return;
3526 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003527
3528 SemaRef.LookupParsedName(Res, S, SS, /*AllowBuiltinCreation=*/false,
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003529 EnteringContext);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003530
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003531 // Fake ivar lookup; this should really be part of
3532 // LookupParsedName.
3533 if (ObjCMethodDecl *Method = SemaRef.getCurMethodDecl()) {
3534 if (Method->isInstanceMethod() && Method->getClassInterface() &&
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003535 (Res.empty() ||
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003536 (Res.isSingleResult() &&
3537 Res.getFoundDecl()->isDefinedOutsideFunctionOrMethod()))) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003538 if (ObjCIvarDecl *IV
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003539 = Method->getClassInterface()->lookupInstanceVariable(Name)) {
3540 Res.addDecl(IV);
3541 Res.resolveKind();
3542 }
3543 }
3544 }
3545}
3546
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003547/// \brief Add keywords to the consumer as possible typo corrections.
3548static void AddKeywordsToConsumer(Sema &SemaRef,
3549 TypoCorrectionConsumer &Consumer,
Richard Smith0f4b5be2012-06-08 21:35:42 +00003550 Scope *S, CorrectionCandidateCallback &CCC,
3551 bool AfterNestedNameSpecifier) {
3552 if (AfterNestedNameSpecifier) {
3553 // For 'X::', we know exactly which keywords can appear next.
3554 Consumer.addKeywordResult("template");
3555 if (CCC.WantExpressionKeywords)
3556 Consumer.addKeywordResult("operator");
3557 return;
3558 }
3559
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003560 if (CCC.WantObjCSuper)
3561 Consumer.addKeywordResult("super");
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003562
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003563 if (CCC.WantTypeSpecifiers) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003564 // Add type-specifier keywords to the set of results.
3565 const char *CTypeSpecs[] = {
3566 "char", "const", "double", "enum", "float", "int", "long", "short",
Douglas Gregor07f4a062011-07-01 21:27:45 +00003567 "signed", "struct", "union", "unsigned", "void", "volatile",
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003568 "_Complex", "_Imaginary",
3569 // storage-specifiers as well
3570 "extern", "inline", "static", "typedef"
3571 };
3572
3573 const unsigned NumCTypeSpecs = sizeof(CTypeSpecs) / sizeof(CTypeSpecs[0]);
3574 for (unsigned I = 0; I != NumCTypeSpecs; ++I)
3575 Consumer.addKeywordResult(CTypeSpecs[I]);
3576
David Blaikie4e4d0842012-03-11 07:00:24 +00003577 if (SemaRef.getLangOpts().C99)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003578 Consumer.addKeywordResult("restrict");
David Blaikie4e4d0842012-03-11 07:00:24 +00003579 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003580 Consumer.addKeywordResult("bool");
David Blaikie4e4d0842012-03-11 07:00:24 +00003581 else if (SemaRef.getLangOpts().C99)
Douglas Gregor07f4a062011-07-01 21:27:45 +00003582 Consumer.addKeywordResult("_Bool");
3583
David Blaikie4e4d0842012-03-11 07:00:24 +00003584 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003585 Consumer.addKeywordResult("class");
3586 Consumer.addKeywordResult("typename");
3587 Consumer.addKeywordResult("wchar_t");
3588
Richard Smith80ad52f2013-01-02 11:42:31 +00003589 if (SemaRef.getLangOpts().CPlusPlus11) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003590 Consumer.addKeywordResult("char16_t");
3591 Consumer.addKeywordResult("char32_t");
3592 Consumer.addKeywordResult("constexpr");
3593 Consumer.addKeywordResult("decltype");
3594 Consumer.addKeywordResult("thread_local");
3595 }
3596 }
3597
David Blaikie4e4d0842012-03-11 07:00:24 +00003598 if (SemaRef.getLangOpts().GNUMode)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003599 Consumer.addKeywordResult("typeof");
3600 }
3601
David Blaikie4e4d0842012-03-11 07:00:24 +00003602 if (CCC.WantCXXNamedCasts && SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003603 Consumer.addKeywordResult("const_cast");
3604 Consumer.addKeywordResult("dynamic_cast");
3605 Consumer.addKeywordResult("reinterpret_cast");
3606 Consumer.addKeywordResult("static_cast");
3607 }
3608
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003609 if (CCC.WantExpressionKeywords) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003610 Consumer.addKeywordResult("sizeof");
David Blaikie4e4d0842012-03-11 07:00:24 +00003611 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003612 Consumer.addKeywordResult("false");
3613 Consumer.addKeywordResult("true");
3614 }
3615
David Blaikie4e4d0842012-03-11 07:00:24 +00003616 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003617 const char *CXXExprs[] = {
3618 "delete", "new", "operator", "throw", "typeid"
3619 };
3620 const unsigned NumCXXExprs = sizeof(CXXExprs) / sizeof(CXXExprs[0]);
3621 for (unsigned I = 0; I != NumCXXExprs; ++I)
3622 Consumer.addKeywordResult(CXXExprs[I]);
3623
3624 if (isa<CXXMethodDecl>(SemaRef.CurContext) &&
3625 cast<CXXMethodDecl>(SemaRef.CurContext)->isInstance())
3626 Consumer.addKeywordResult("this");
3627
Richard Smith80ad52f2013-01-02 11:42:31 +00003628 if (SemaRef.getLangOpts().CPlusPlus11) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003629 Consumer.addKeywordResult("alignof");
3630 Consumer.addKeywordResult("nullptr");
3631 }
3632 }
Jordan Rosef70a8862012-06-30 21:33:57 +00003633
3634 if (SemaRef.getLangOpts().C11) {
3635 // FIXME: We should not suggest _Alignof if the alignof macro
3636 // is present.
3637 Consumer.addKeywordResult("_Alignof");
3638 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003639 }
3640
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003641 if (CCC.WantRemainingKeywords) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003642 if (SemaRef.getCurFunctionOrMethodDecl() || SemaRef.getCurBlock()) {
3643 // Statements.
3644 const char *CStmts[] = {
3645 "do", "else", "for", "goto", "if", "return", "switch", "while" };
3646 const unsigned NumCStmts = sizeof(CStmts) / sizeof(CStmts[0]);
3647 for (unsigned I = 0; I != NumCStmts; ++I)
3648 Consumer.addKeywordResult(CStmts[I]);
3649
David Blaikie4e4d0842012-03-11 07:00:24 +00003650 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003651 Consumer.addKeywordResult("catch");
3652 Consumer.addKeywordResult("try");
3653 }
3654
3655 if (S && S->getBreakParent())
3656 Consumer.addKeywordResult("break");
3657
3658 if (S && S->getContinueParent())
3659 Consumer.addKeywordResult("continue");
3660
3661 if (!SemaRef.getCurFunction()->SwitchStack.empty()) {
3662 Consumer.addKeywordResult("case");
3663 Consumer.addKeywordResult("default");
3664 }
3665 } else {
David Blaikie4e4d0842012-03-11 07:00:24 +00003666 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003667 Consumer.addKeywordResult("namespace");
3668 Consumer.addKeywordResult("template");
3669 }
3670
3671 if (S && S->isClassScope()) {
3672 Consumer.addKeywordResult("explicit");
3673 Consumer.addKeywordResult("friend");
3674 Consumer.addKeywordResult("mutable");
3675 Consumer.addKeywordResult("private");
3676 Consumer.addKeywordResult("protected");
3677 Consumer.addKeywordResult("public");
3678 Consumer.addKeywordResult("virtual");
3679 }
3680 }
3681
David Blaikie4e4d0842012-03-11 07:00:24 +00003682 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003683 Consumer.addKeywordResult("using");
3684
Richard Smith80ad52f2013-01-02 11:42:31 +00003685 if (SemaRef.getLangOpts().CPlusPlus11)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003686 Consumer.addKeywordResult("static_assert");
3687 }
3688 }
3689}
3690
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003691static bool isCandidateViable(CorrectionCandidateCallback &CCC,
3692 TypoCorrection &Candidate) {
3693 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3694 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3695}
3696
Douglas Gregor546be3c2009-12-30 17:04:44 +00003697/// \brief Try to "correct" a typo in the source code by finding
3698/// visible declarations whose names are similar to the name that was
3699/// present in the source code.
3700///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003701/// \param TypoName the \c DeclarationNameInfo structure that contains
3702/// the name that was present in the source code along with its location.
3703///
3704/// \param LookupKind the name-lookup criteria used to search for the name.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003705///
3706/// \param S the scope in which name lookup occurs.
3707///
3708/// \param SS the nested-name-specifier that precedes the name we're
3709/// looking for, if present.
3710///
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003711/// \param CCC A CorrectionCandidateCallback object that provides further
3712/// validation of typo correction candidates. It also provides flags for
3713/// determining the set of keywords permitted.
3714///
Douglas Gregor2dcc0112009-12-31 07:42:17 +00003715/// \param MemberContext if non-NULL, the context in which to look for
3716/// a member access expression.
3717///
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003718/// \param EnteringContext whether we're entering the context described by
Douglas Gregorbb092ba2009-12-31 05:20:13 +00003719/// the nested-name-specifier SS.
3720///
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003721/// \param OPT when non-NULL, the search for visible declarations will
3722/// also walk the protocols in the qualified interfaces of \p OPT.
3723///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003724/// \returns a \c TypoCorrection containing the corrected name if the typo
3725/// along with information such as the \c NamedDecl where the corrected name
3726/// was declared, and any additional \c NestedNameSpecifier needed to access
3727/// it (C++ only). The \c TypoCorrection is empty if there is no correction.
3728TypoCorrection Sema::CorrectTypo(const DeclarationNameInfo &TypoName,
3729 Sema::LookupNameKind LookupKind,
3730 Scope *S, CXXScopeSpec *SS,
Kaelyn Uhrain16e46dd2012-01-31 23:49:25 +00003731 CorrectionCandidateCallback &CCC,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003732 DeclContext *MemberContext,
3733 bool EnteringContext,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003734 const ObjCObjectPointerType *OPT) {
David Blaikie4e4d0842012-03-11 07:00:24 +00003735 if (Diags.hasFatalErrorOccurred() || !getLangOpts().SpellChecking)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003736 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003737
Francois Pichet4d604d62011-12-03 15:55:29 +00003738 // In Microsoft mode, don't perform typo correction in a template member
3739 // function dependent context because it interferes with the "lookup into
3740 // dependent bases of class templates" feature.
David Blaikie4e4d0842012-03-11 07:00:24 +00003741 if (getLangOpts().MicrosoftMode && CurContext->isDependentContext() &&
Francois Pichet4d604d62011-12-03 15:55:29 +00003742 isa<CXXMethodDecl>(CurContext))
3743 return TypoCorrection();
3744
Douglas Gregor546be3c2009-12-30 17:04:44 +00003745 // We only attempt to correct typos for identifiers.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003746 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003747 if (!Typo)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003748 return TypoCorrection();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003749
3750 // If the scope specifier itself was invalid, don't try to correct
3751 // typos.
3752 if (SS && SS->isInvalid())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003753 return TypoCorrection();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003754
3755 // Never try to correct typos during template deduction or
3756 // instantiation.
3757 if (!ActiveTemplateInstantiations.empty())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003758 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003759
Argyrios Kyrtzidis57f8da52013-03-14 22:56:43 +00003760 // Don't try to correct 'super'.
3761 if (S && S->isInObjcMethodScope() && Typo == getSuperIdentifier())
3762 return TypoCorrection();
3763
Argyrios Kyrtzidis6aa240c2013-03-16 01:40:35 +00003764 // This is for testing.
3765 if (Diags.getWarnOnSpellCheck()) {
3766 unsigned DiagID = Diags.getCustomDiagID(DiagnosticsEngine::Warning,
3767 "spell-checking initiated for %0");
3768 Diag(TypoName.getLoc(), DiagID) << TypoName.getName();
3769 }
Argyrios Kyrtzidis57f8da52013-03-14 22:56:43 +00003770
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003771 NamespaceSpecifierSet Namespaces(Context, CurContext, SS);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003772
3773 TypoCorrectionConsumer Consumer(*this, Typo);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003774
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003775 // If a callback object considers an empty typo correction candidate to be
3776 // viable, assume it does not do any actual validation of the candidates.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003777 TypoCorrection EmptyCorrection;
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003778 bool ValidatingCallback = !isCandidateViable(CCC, EmptyCorrection);
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003779
Douglas Gregoraaf87162010-04-14 20:04:41 +00003780 // Perform name lookup to find visible, similarly-named entities.
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003781 bool IsUnqualifiedLookup = false;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003782 DeclContext *QualifiedDC = MemberContext;
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003783 if (MemberContext) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003784 LookupVisibleDecls(MemberContext, LookupKind, Consumer);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003785
3786 // Look in qualified interfaces.
3787 if (OPT) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003788 for (ObjCObjectPointerType::qual_iterator
3789 I = OPT->qual_begin(), E = OPT->qual_end();
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003790 I != E; ++I)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003791 LookupVisibleDecls(*I, LookupKind, Consumer);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003792 }
3793 } else if (SS && SS->isSet()) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003794 QualifiedDC = computeDeclContext(*SS, EnteringContext);
3795 if (!QualifiedDC)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003796 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003797
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003798 // Provide a stop gap for files that are just seriously broken. Trying
3799 // to correct all typos can turn into a HUGE performance penalty, causing
3800 // some files to take minutes to get rejected by the parser.
3801 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003802 return TypoCorrection();
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003803 ++TyposCorrected;
3804
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003805 LookupVisibleDecls(QualifiedDC, LookupKind, Consumer);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003806 } else {
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003807 IsUnqualifiedLookup = true;
3808 UnqualifiedTyposCorrectedMap::iterator Cached
3809 = UnqualifiedTyposCorrected.find(Typo);
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003810 if (Cached != UnqualifiedTyposCorrected.end()) {
3811 // Add the cached value, unless it's a keyword or fails validation. In the
3812 // keyword case, we'll end up adding the keyword below.
3813 if (Cached->second) {
3814 if (!Cached->second.isKeyword() &&
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003815 isCandidateViable(CCC, Cached->second))
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003816 Consumer.addCorrection(Cached->second);
3817 } else {
3818 // Only honor no-correction cache hits when a callback that will validate
3819 // correction candidates is not being used.
3820 if (!ValidatingCallback)
3821 return TypoCorrection();
3822 }
3823 }
3824 if (Cached == UnqualifiedTyposCorrected.end()) {
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003825 // Provide a stop gap for files that are just seriously broken. Trying
3826 // to correct all typos can turn into a HUGE performance penalty, causing
3827 // some files to take minutes to get rejected by the parser.
3828 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003829 return TypoCorrection();
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003830 }
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003831 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003832
Douglas Gregor01798682012-03-26 16:54:18 +00003833 // Determine whether we are going to search in the various namespaces for
3834 // corrections.
3835 bool SearchNamespaces
Kaelyn Uhrain6d858d92012-04-03 18:20:11 +00003836 = getLangOpts().CPlusPlus &&
Douglas Gregor01798682012-03-26 16:54:18 +00003837 (IsUnqualifiedLookup || (QualifiedDC && QualifiedDC->isNamespace()));
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00003838 // In a few cases we *only* want to search for corrections bases on just
3839 // adding or changing the nested name specifier.
3840 bool AllowOnlyNNSChanges = Typo->getName().size() < 3;
Douglas Gregor01798682012-03-26 16:54:18 +00003841
3842 if (IsUnqualifiedLookup || SearchNamespaces) {
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003843 // For unqualified lookup, look through all of the names that we have
3844 // seen in this translation unit.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003845 // FIXME: Re-add the ability to skip very unlikely potential corrections.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003846 for (IdentifierTable::iterator I = Context.Idents.begin(),
3847 IEnd = Context.Idents.end();
3848 I != IEnd; ++I)
3849 Consumer.FoundName(I->getKey());
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003850
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003851 // Walk through identifiers in external identifier sources.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003852 // FIXME: Re-add the ability to skip very unlikely potential corrections.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003853 if (IdentifierInfoLookup *External
3854 = Context.Idents.getExternalIdentifierLookup()) {
Dylan Noblesmith6f42b622012-02-05 02:12:40 +00003855 OwningPtr<IdentifierIterator> Iter(External->getIdentifiers());
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003856 do {
3857 StringRef Name = Iter->Next();
3858 if (Name.empty())
3859 break;
Douglas Gregor95f42922010-10-14 22:11:03 +00003860
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00003861 Consumer.FoundName(Name);
3862 } while (true);
Douglas Gregor95f42922010-10-14 22:11:03 +00003863 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003864 }
3865
Richard Smith0f4b5be2012-06-08 21:35:42 +00003866 AddKeywordsToConsumer(*this, Consumer, S, CCC, SS && SS->isNotEmpty());
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003867
Douglas Gregoraaf87162010-04-14 20:04:41 +00003868 // If we haven't found anything, we're done.
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003869 if (Consumer.empty()) {
3870 // If this was an unqualified lookup, note that no correction was found.
3871 if (IsUnqualifiedLookup)
3872 (void)UnqualifiedTyposCorrected[Typo];
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003873
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003874 return TypoCorrection();
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003875 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003876
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00003877 // Make sure the best edit distance (prior to adding any namespace qualifiers)
3878 // is not more that about a third of the length of the typo's identifier.
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003879 unsigned ED = Consumer.getBestEditDistance(true);
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003880 if (ED > 0 && Typo->getName().size() / ED < 3) {
3881 // If this was an unqualified lookup, note that no correction was found.
Douglas Gregor157a3ff2010-10-27 14:20:34 +00003882 if (IsUnqualifiedLookup)
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003883 (void)UnqualifiedTyposCorrected[Typo];
3884
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003885 return TypoCorrection();
3886 }
3887
Douglas Gregor01798682012-03-26 16:54:18 +00003888 // Build the NestedNameSpecifiers for the KnownNamespaces, if we're going
3889 // to search those namespaces.
3890 if (SearchNamespaces) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003891 // Load any externally-known namespaces.
3892 if (ExternalSource && !LoadedExternalKnownNamespaces) {
Chris Lattner5f9e2722011-07-23 10:55:15 +00003893 SmallVector<NamespaceDecl *, 4> ExternalKnownNamespaces;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003894 LoadedExternalKnownNamespaces = true;
3895 ExternalSource->ReadKnownNamespaces(ExternalKnownNamespaces);
3896 for (unsigned I = 0, N = ExternalKnownNamespaces.size(); I != N; ++I)
3897 KnownNamespaces[ExternalKnownNamespaces[I]] = true;
3898 }
3899
Nick Lewycky01a41142013-01-26 00:35:08 +00003900 for (llvm::MapVector<NamespaceDecl*, bool>::iterator
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003901 KNI = KnownNamespaces.begin(),
3902 KNIEnd = KnownNamespaces.end();
3903 KNI != KNIEnd; ++KNI)
3904 Namespaces.AddNamespace(KNI->first);
Douglas Gregor3eedbb02010-10-20 01:32:02 +00003905 }
Douglas Gregore24b5752010-10-14 20:34:08 +00003906
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003907 // Weed out any names that could not be found by name lookup or, if a
3908 // CorrectionCandidateCallback object was provided, failed validation.
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00003909 SmallVector<TypoCorrection, 16> QualifiedResults;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003910 LookupResult TmpRes(*this, TypoName, LookupKind);
3911 TmpRes.suppressDiagnostics();
3912 while (!Consumer.empty()) {
3913 TypoCorrectionConsumer::distance_iterator DI = Consumer.begin();
3914 unsigned ED = DI->first;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003915 for (TypoCorrectionConsumer::result_iterator I = DI->second.begin(),
3916 IEnd = DI->second.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003917 I != IEnd; /* Increment in loop. */) {
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00003918 // If we only want nested name specifier corrections, ignore potential
3919 // corrections that have a different base identifier from the typo.
3920 if (AllowOnlyNNSChanges &&
3921 I->second.front().getCorrectionAsIdentifierInfo() != Typo) {
3922 TypoCorrectionConsumer::result_iterator Prev = I;
3923 ++I;
3924 DI->second.erase(Prev);
3925 continue;
3926 }
3927
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003928 // If the item already has been looked up or is a keyword, keep it.
3929 // If a validator callback object was given, drop the correction
3930 // unless it passes validation.
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003931 bool Viable = false;
Benjamin Kramerb3996962012-07-27 10:21:08 +00003932 for (TypoResultList::iterator RI = I->second.begin();
3933 RI != I->second.end(); /* Increment in loop. */) {
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003934 TypoResultList::iterator Prev = RI;
3935 ++RI;
3936 if (Prev->isResolved()) {
3937 if (!isCandidateViable(CCC, *Prev))
Benjamin Kramerb3996962012-07-27 10:21:08 +00003938 RI = I->second.erase(Prev);
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003939 else
3940 Viable = true;
3941 }
3942 }
3943 if (Viable || I->second.empty()) {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003944 TypoCorrectionConsumer::result_iterator Prev = I;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003945 ++I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003946 if (!Viable)
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003947 DI->second.erase(Prev);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003948 continue;
Douglas Gregore24b5752010-10-14 20:34:08 +00003949 }
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003950 assert(I->second.size() == 1 && "Expected a single unresolved candidate");
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003951
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003952 // Perform name lookup on this name.
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003953 TypoCorrection &Candidate = I->second.front();
3954 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003955 LookupPotentialTypoResult(*this, TmpRes, Name, S, SS, MemberContext,
Kaelyn Uhrain16e46dd2012-01-31 23:49:25 +00003956 EnteringContext, CCC.IsObjCIvarLookup);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003957
3958 switch (TmpRes.getResultKind()) {
3959 case LookupResult::NotFound:
3960 case LookupResult::NotFoundInCurrentInstantiation:
Kaelyn Uhrain82340e82011-09-07 20:25:59 +00003961 case LookupResult::FoundUnresolvedValue:
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003962 QualifiedResults.push_back(Candidate);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003963 // We didn't find this name in our scope, or didn't like what we found;
3964 // ignore it.
3965 {
3966 TypoCorrectionConsumer::result_iterator Next = I;
3967 ++Next;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003968 DI->second.erase(I);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003969 I = Next;
3970 }
3971 break;
3972
3973 case LookupResult::Ambiguous:
3974 // We don't deal with ambiguities.
3975 return TypoCorrection();
3976
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003977 case LookupResult::FoundOverloaded: {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003978 TypoCorrectionConsumer::result_iterator Prev = I;
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003979 // Store all of the Decls for overloaded symbols
3980 for (LookupResult::iterator TRD = TmpRes.begin(),
3981 TRDEnd = TmpRes.end();
3982 TRD != TRDEnd; ++TRD)
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003983 Candidate.addCorrectionDecl(*TRD);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003984 ++I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003985 if (!isCandidateViable(CCC, Candidate))
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003986 DI->second.erase(Prev);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003987 break;
3988 }
3989
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003990 case LookupResult::Found: {
3991 TypoCorrectionConsumer::result_iterator Prev = I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003992 Candidate.setCorrectionDecl(TmpRes.getAsSingle<NamedDecl>());
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003993 ++I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003994 if (!isCandidateViable(CCC, Candidate))
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003995 DI->second.erase(Prev);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003996 break;
3997 }
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003998
3999 }
Douglas Gregore24b5752010-10-14 20:34:08 +00004000 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004001
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004002 if (DI->second.empty())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004003 Consumer.erase(DI);
David Blaikie4e4d0842012-03-11 07:00:24 +00004004 else if (!getLangOpts().CPlusPlus || QualifiedResults.empty() || !ED)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004005 // If there are results in the closest possible bucket, stop
4006 break;
4007
4008 // Only perform the qualified lookups for C++
Douglas Gregor01798682012-03-26 16:54:18 +00004009 if (SearchNamespaces) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004010 TmpRes.suppressDiagnostics();
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00004011 for (SmallVector<TypoCorrection,
4012 16>::iterator QRI = QualifiedResults.begin(),
4013 QRIEnd = QualifiedResults.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004014 QRI != QRIEnd; ++QRI) {
4015 for (NamespaceSpecifierSet::iterator NI = Namespaces.begin(),
4016 NIEnd = Namespaces.end();
4017 NI != NIEnd; ++NI) {
4018 DeclContext *Ctx = NI->DeclCtx;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004019
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004020 // FIXME: Stop searching once the namespaces are too far away to create
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004021 // acceptable corrections for this identifier (since the namespaces
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004022 // are sorted in ascending order by edit distance).
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004023
4024 TmpRes.clear();
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00004025 TmpRes.setLookupName(QRI->getCorrectionAsIdentifierInfo());
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004026 if (!LookupQualifiedName(TmpRes, Ctx)) continue;
4027
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004028 // Any corrections added below will be validated in subsequent
4029 // iterations of the main while() loop over the Consumer's contents.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004030 switch (TmpRes.getResultKind()) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004031 case LookupResult::Found: {
4032 TypoCorrection TC(*QRI);
4033 TC.setCorrectionDecl(TmpRes.getAsSingle<NamedDecl>());
4034 TC.setCorrectionSpecifier(NI->NameSpecifier);
4035 TC.setQualifierDistance(NI->EditDistance);
4036 Consumer.addCorrection(TC);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004037 break;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004038 }
4039 case LookupResult::FoundOverloaded: {
4040 TypoCorrection TC(*QRI);
4041 TC.setCorrectionSpecifier(NI->NameSpecifier);
4042 TC.setQualifierDistance(NI->EditDistance);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004043 for (LookupResult::iterator TRD = TmpRes.begin(),
4044 TRDEnd = TmpRes.end();
4045 TRD != TRDEnd; ++TRD)
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004046 TC.addCorrectionDecl(*TRD);
4047 Consumer.addCorrection(TC);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004048 break;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004049 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004050 case LookupResult::NotFound:
4051 case LookupResult::NotFoundInCurrentInstantiation:
4052 case LookupResult::Ambiguous:
Kaelyn Uhrain82340e82011-09-07 20:25:59 +00004053 case LookupResult::FoundUnresolvedValue:
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004054 break;
4055 }
4056 }
4057 }
4058 }
4059
4060 QualifiedResults.clear();
4061 }
4062
4063 // No corrections remain...
4064 if (Consumer.empty()) return TypoCorrection();
4065
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00004066 TypoResultsMap &BestResults = Consumer.getBestResults();
4067 ED = Consumer.getBestEditDistance(true);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004068
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00004069 if (!AllowOnlyNNSChanges && ED > 0 && Typo->getName().size() / ED < 3) {
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004070 // If this was an unqualified lookup and we believe the callback
4071 // object wouldn't have filtered out possible corrections, note
4072 // that no correction was found.
4073 if (IsUnqualifiedLookup && !ValidatingCallback)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004074 (void)UnqualifiedTyposCorrected[Typo];
4075
4076 return TypoCorrection();
4077 }
4078
Douglas Gregore24b5752010-10-14 20:34:08 +00004079 // If only a single name remains, return that result.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004080 if (BestResults.size() == 1) {
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004081 const TypoResultList &CorrectionList = BestResults.begin()->second;
4082 const TypoCorrection &Result = CorrectionList.front();
4083 if (CorrectionList.size() != 1) return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004084
Douglas Gregor53e4b552010-10-26 17:18:00 +00004085 // Don't correct to a keyword that's the same as the typo; the keyword
4086 // wasn't actually in scope.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004087 if (ED == 0 && Result.isKeyword()) return TypoCorrection();
4088
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004089 // Record the correction for unqualified lookup.
4090 if (IsUnqualifiedLookup)
4091 UnqualifiedTyposCorrected[Typo] = Result;
4092
David Blaikie6952c012012-10-12 20:00:44 +00004093 TypoCorrection TC = Result;
4094 TC.setCorrectionRange(SS, TypoName);
4095 return TC;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004096 }
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004097 else if (BestResults.size() > 1
4098 // Ugly hack equivalent to CTC == CTC_ObjCMessageReceiver;
4099 // WantObjCSuper is only true for CTC_ObjCMessageReceiver and for
4100 // some instances of CTC_Unknown, while WantRemainingKeywords is true
4101 // for CTC_Unknown but not for CTC_ObjCMessageReceiver.
Kaelyn Uhrain16e46dd2012-01-31 23:49:25 +00004102 && CCC.WantObjCSuper && !CCC.WantRemainingKeywords
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004103 && BestResults["super"].front().isKeyword()) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004104 // Prefer 'super' when we're completing in a message-receiver
4105 // context.
4106
4107 // Don't correct to a keyword that's the same as the typo; the keyword
4108 // wasn't actually in scope.
4109 if (ED == 0) return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004110
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004111 // Record the correction for unqualified lookup.
4112 if (IsUnqualifiedLookup)
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004113 UnqualifiedTyposCorrected[Typo] = BestResults["super"].front();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004114
David Blaikie6952c012012-10-12 20:00:44 +00004115 TypoCorrection TC = BestResults["super"].front();
4116 TC.setCorrectionRange(SS, TypoName);
4117 return TC;
Douglas Gregor7b824e82010-10-15 13:35:25 +00004118 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004119
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004120 // If this was an unqualified lookup and we believe the callback object did
4121 // not filter out possible corrections, note that no correction was found.
4122 if (IsUnqualifiedLookup && !ValidatingCallback)
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004123 (void)UnqualifiedTyposCorrected[Typo];
4124
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004125 return TypoCorrection();
4126}
4127
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004128void TypoCorrection::addCorrectionDecl(NamedDecl *CDecl) {
4129 if (!CDecl) return;
4130
4131 if (isKeyword())
4132 CorrectionDecls.clear();
4133
Kaelyn Uhrain728948f2012-11-19 18:49:53 +00004134 CorrectionDecls.push_back(CDecl->getUnderlyingDecl());
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004135
4136 if (!CorrectionName)
4137 CorrectionName = CDecl->getDeclName();
4138}
4139
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004140std::string TypoCorrection::getAsString(const LangOptions &LO) const {
4141 if (CorrectionNameSpec) {
4142 std::string tmpBuffer;
4143 llvm::raw_string_ostream PrefixOStream(tmpBuffer);
4144 CorrectionNameSpec->print(PrefixOStream, PrintingPolicy(LO));
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004145 CorrectionName.printName(PrefixOStream);
4146 return PrefixOStream.str();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004147 }
4148
4149 return CorrectionName.getAsString();
Douglas Gregor546be3c2009-12-30 17:04:44 +00004150}
Kaelyn Uhrain20a7cf42013-04-03 16:59:49 +00004151
4152bool CorrectionCandidateCallback::ValidateCandidate(const TypoCorrection &candidate) {
4153 if (!candidate.isResolved())
4154 return true;
4155
4156 if (candidate.isKeyword())
4157 return WantTypeSpecifiers || WantExpressionKeywords || WantCXXNamedCasts ||
4158 WantRemainingKeywords || WantObjCSuper;
4159
4160 for (TypoCorrection::const_decl_iterator CDecl = candidate.begin(),
4161 CDeclEnd = candidate.end();
4162 CDecl != CDeclEnd; ++CDecl) {
4163 if (!isa<TypeDecl>(*CDecl))
4164 return true;
4165 }
4166
4167 return WantTypeSpecifiers;
4168}