blob: a17a903a5f4e28910446bbd93507c35472c1845a [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
Robert Wilhelm344472e2013-08-23 16:11:15 +0000170 DC = queue.pop_back_val();
John McCalld7be78a2009-11-10 07:01:13 +0000171 }
172 }
173
174 // Add a using directive as if it had been declared in the given
175 // context. This helps implement C++ [namespace.udir]p3:
176 // The using-directive is transitive: if a scope contains a
177 // using-directive that nominates a second namespace that itself
178 // contains using-directives, the effect is as if the
179 // using-directives from the second namespace also appeared in
180 // the first.
181 void addUsingDirective(UsingDirectiveDecl *UD, DeclContext *EffectiveDC) {
182 // Find the common ancestor between the effective context and
183 // the nominated namespace.
184 DeclContext *Common = UD->getNominatedNamespace();
185 while (!Common->Encloses(EffectiveDC))
186 Common = Common->getParent();
John McCall12ea5782009-11-10 09:20:04 +0000187 Common = Common->getPrimaryContext();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000188
John McCalld7be78a2009-11-10 07:01:13 +0000189 list.push_back(UnqualUsingEntry(UD->getNominatedNamespace(), Common));
190 }
191
192 void done() {
193 std::sort(list.begin(), list.end(), UnqualUsingEntry::Comparator());
194 }
195
John McCalld7be78a2009-11-10 07:01:13 +0000196 typedef ListTy::const_iterator const_iterator;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000197
John McCalld7be78a2009-11-10 07:01:13 +0000198 const_iterator begin() const { return list.begin(); }
199 const_iterator end() const { return list.end(); }
200
201 std::pair<const_iterator,const_iterator>
202 getNamespacesFor(DeclContext *DC) const {
John McCall12ea5782009-11-10 09:20:04 +0000203 return std::equal_range(begin(), end(), DC->getPrimaryContext(),
John McCalld7be78a2009-11-10 07:01:13 +0000204 UnqualUsingEntry::Comparator());
205 }
206 };
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000207}
208
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000209// Retrieve the set of identifier namespaces that correspond to a
210// specific kind of name lookup.
John McCall1d7c5282009-12-18 10:40:03 +0000211static inline unsigned getIDNS(Sema::LookupNameKind NameKind,
212 bool CPlusPlus,
213 bool Redeclaration) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000214 unsigned IDNS = 0;
215 switch (NameKind) {
Fariborz Jahanian98a54032011-07-12 17:16:56 +0000216 case Sema::LookupObjCImplicitSelfParam:
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000217 case Sema::LookupOrdinaryName:
Douglas Gregord6f7e9d2009-02-24 20:03:32 +0000218 case Sema::LookupRedeclarationWithLinkage:
Richard Smith4e9686b2013-08-09 04:35:01 +0000219 case Sema::LookupLocalFriendName:
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
John McCall7453ed42009-11-22 00:44:51 +0000339/// Resolves the result kind of this lookup.
John McCall7d384dd2009-11-18 07:57:50 +0000340void LookupResult::resolveKind() {
John McCallf36e02d2009-10-09 21:13:30 +0000341 unsigned N = Decls.size();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000342
John McCallf36e02d2009-10-09 21:13:30 +0000343 // Fast case: no possible ambiguity.
John McCall68263142009-11-18 22:49:29 +0000344 if (N == 0) {
John McCalldc5c7862010-01-15 21:27:01 +0000345 assert(ResultKind == NotFound || ResultKind == NotFoundInCurrentInstantiation);
John McCall68263142009-11-18 22:49:29 +0000346 return;
347 }
348
John McCall7453ed42009-11-22 00:44:51 +0000349 // If there's a single decl, we need to examine it to decide what
350 // kind of lookup this is.
John McCall7ba107a2009-11-18 02:36:19 +0000351 if (N == 1) {
Douglas Gregor2b147f02010-04-25 21:15:30 +0000352 NamedDecl *D = (*Decls.begin())->getUnderlyingDecl();
353 if (isa<FunctionTemplateDecl>(D))
John McCall7453ed42009-11-22 00:44:51 +0000354 ResultKind = FoundOverloaded;
Douglas Gregor2b147f02010-04-25 21:15:30 +0000355 else if (isa<UnresolvedUsingValueDecl>(D))
John McCall7ba107a2009-11-18 02:36:19 +0000356 ResultKind = FoundUnresolvedValue;
357 return;
358 }
John McCallf36e02d2009-10-09 21:13:30 +0000359
John McCall6e247262009-10-10 05:48:19 +0000360 // Don't do any extra resolution if we've already resolved as ambiguous.
John McCalla24dc2e2009-11-17 02:14:36 +0000361 if (ResultKind == Ambiguous) return;
John McCall6e247262009-10-10 05:48:19 +0000362
John McCallf36e02d2009-10-09 21:13:30 +0000363 llvm::SmallPtrSet<NamedDecl*, 16> Unique;
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000364 llvm::SmallPtrSet<QualType, 16> UniqueTypes;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000365
John McCallf36e02d2009-10-09 21:13:30 +0000366 bool Ambiguous = false;
367 bool HasTag = false, HasFunction = false, HasNonFunction = false;
John McCall7453ed42009-11-22 00:44:51 +0000368 bool HasFunctionTemplate = false, HasUnresolved = false;
John McCallf36e02d2009-10-09 21:13:30 +0000369
370 unsigned UniqueTagIndex = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000371
John McCallf36e02d2009-10-09 21:13:30 +0000372 unsigned I = 0;
373 while (I < N) {
John McCall314be4e2009-11-17 07:50:12 +0000374 NamedDecl *D = Decls[I]->getUnderlyingDecl();
375 D = cast<NamedDecl>(D->getCanonicalDecl());
John McCallf36e02d2009-10-09 21:13:30 +0000376
Argyrios Kyrtzidis745af1c2013-02-22 06:58:37 +0000377 // Ignore an invalid declaration unless it's the only one left.
378 if (D->isInvalidDecl() && I < N-1) {
379 Decls[I] = Decls[--N];
380 continue;
381 }
382
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000383 // Redeclarations of types via typedef can occur both within a scope
384 // and, through using declarations and directives, across scopes. There is
385 // no ambiguity if they all refer to the same type, so unique based on the
386 // canonical type.
387 if (TypeDecl *TD = dyn_cast<TypeDecl>(D)) {
388 if (!TD->getDeclContext()->isRecord()) {
389 QualType T = SemaRef.Context.getTypeDeclType(TD);
390 if (!UniqueTypes.insert(SemaRef.Context.getCanonicalType(T))) {
391 // The type is not unique; pull something off the back and continue
392 // at this index.
393 Decls[I] = Decls[--N];
394 continue;
395 }
396 }
397 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000398
John McCall314be4e2009-11-17 07:50:12 +0000399 if (!Unique.insert(D)) {
John McCallf36e02d2009-10-09 21:13:30 +0000400 // If it's not unique, pull something off the back (and
401 // continue at this index).
402 Decls[I] = Decls[--N];
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000403 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000404 }
405
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000406 // Otherwise, do some decl type analysis and then continue.
John McCall7ba107a2009-11-18 02:36:19 +0000407
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000408 if (isa<UnresolvedUsingValueDecl>(D)) {
409 HasUnresolved = true;
410 } else if (isa<TagDecl>(D)) {
411 if (HasTag)
412 Ambiguous = true;
413 UniqueTagIndex = I;
414 HasTag = true;
415 } else if (isa<FunctionTemplateDecl>(D)) {
416 HasFunction = true;
417 HasFunctionTemplate = true;
418 } else if (isa<FunctionDecl>(D)) {
419 HasFunction = true;
420 } else {
421 if (HasNonFunction)
422 Ambiguous = true;
423 HasNonFunction = true;
Douglas Gregor7176fff2009-01-15 00:26:24 +0000424 }
Douglas Gregor7f1c5472010-08-11 14:45:53 +0000425 I++;
Mike Stump1eb44332009-09-09 15:08:12 +0000426 }
Douglas Gregor516ff432009-04-24 02:57:34 +0000427
John McCallf36e02d2009-10-09 21:13:30 +0000428 // C++ [basic.scope.hiding]p2:
429 // A class name or enumeration name can be hidden by the name of
430 // an object, function, or enumerator declared in the same
431 // scope. If a class or enumeration name and an object, function,
432 // or enumerator are declared in the same scope (in any order)
433 // with the same name, the class or enumeration name is hidden
434 // wherever the object, function, or enumerator name is visible.
435 // But it's still an error if there are distinct tag types found,
436 // even if they're not visible. (ref?)
John McCallfda8e122009-12-03 00:58:24 +0000437 if (HideTags && HasTag && !Ambiguous &&
Douglas Gregor77a1a882010-10-23 16:06:17 +0000438 (HasFunction || HasNonFunction || HasUnresolved)) {
439 if (Decls[UniqueTagIndex]->getDeclContext()->getRedeclContext()->Equals(
440 Decls[UniqueTagIndex? 0 : N-1]->getDeclContext()->getRedeclContext()))
441 Decls[UniqueTagIndex] = Decls[--N];
442 else
443 Ambiguous = true;
444 }
Anders Carlsson8b50d012009-06-26 03:37:05 +0000445
John McCallf36e02d2009-10-09 21:13:30 +0000446 Decls.set_size(N);
Douglas Gregor7176fff2009-01-15 00:26:24 +0000447
John McCallfda8e122009-12-03 00:58:24 +0000448 if (HasNonFunction && (HasFunction || HasUnresolved))
John McCallf36e02d2009-10-09 21:13:30 +0000449 Ambiguous = true;
Douglas Gregor69d993a2009-01-17 01:13:24 +0000450
John McCallf36e02d2009-10-09 21:13:30 +0000451 if (Ambiguous)
John McCall6e247262009-10-10 05:48:19 +0000452 setAmbiguous(LookupResult::AmbiguousReference);
John McCall7ba107a2009-11-18 02:36:19 +0000453 else if (HasUnresolved)
454 ResultKind = LookupResult::FoundUnresolvedValue;
John McCall7453ed42009-11-22 00:44:51 +0000455 else if (N > 1 || HasFunctionTemplate)
John McCalla24dc2e2009-11-17 02:14:36 +0000456 ResultKind = LookupResult::FoundOverloaded;
John McCallf36e02d2009-10-09 21:13:30 +0000457 else
John McCalla24dc2e2009-11-17 02:14:36 +0000458 ResultKind = LookupResult::Found;
Douglas Gregoreb11cd02009-01-14 22:20:51 +0000459}
460
John McCall7d384dd2009-11-18 07:57:50 +0000461void LookupResult::addDeclsFromBasePaths(const CXXBasePaths &P) {
John McCall6b2accb2010-02-10 09:31:12 +0000462 CXXBasePaths::const_paths_iterator I, E;
John McCallf36e02d2009-10-09 21:13:30 +0000463 for (I = P.begin(), E = P.end(); I != E; ++I)
David Blaikie3bc93e32012-12-19 00:45:41 +0000464 for (DeclContext::lookup_iterator DI = I->Decls.begin(),
465 DE = I->Decls.end(); DI != DE; ++DI)
John McCallf36e02d2009-10-09 21:13:30 +0000466 addDecl(*DI);
Douglas Gregor31a19b62009-04-01 21:51:26 +0000467}
468
John McCall7d384dd2009-11-18 07:57:50 +0000469void LookupResult::setAmbiguousBaseSubobjects(CXXBasePaths &P) {
John McCallf36e02d2009-10-09 21:13:30 +0000470 Paths = new CXXBasePaths;
471 Paths->swap(P);
472 addDeclsFromBasePaths(*Paths);
473 resolveKind();
John McCall6e247262009-10-10 05:48:19 +0000474 setAmbiguous(AmbiguousBaseSubobjects);
Douglas Gregord8635172009-02-02 21:35:47 +0000475}
476
John McCall7d384dd2009-11-18 07:57:50 +0000477void LookupResult::setAmbiguousBaseSubobjectTypes(CXXBasePaths &P) {
John McCallf36e02d2009-10-09 21:13:30 +0000478 Paths = new CXXBasePaths;
479 Paths->swap(P);
480 addDeclsFromBasePaths(*Paths);
481 resolveKind();
John McCall6e247262009-10-10 05:48:19 +0000482 setAmbiguous(AmbiguousBaseSubobjectTypes);
John McCallf36e02d2009-10-09 21:13:30 +0000483}
484
Chris Lattner5f9e2722011-07-23 10:55:15 +0000485void LookupResult::print(raw_ostream &Out) {
John McCallf36e02d2009-10-09 21:13:30 +0000486 Out << Decls.size() << " result(s)";
487 if (isAmbiguous()) Out << ", ambiguous";
488 if (Paths) Out << ", base paths present";
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000489
John McCallf36e02d2009-10-09 21:13:30 +0000490 for (iterator I = begin(), E = end(); I != E; ++I) {
491 Out << "\n";
492 (*I)->print(Out, 2);
493 }
494}
495
Douglas Gregor85910982010-02-12 05:48:04 +0000496/// \brief Lookup a builtin function, when name lookup would otherwise
497/// fail.
498static bool LookupBuiltin(Sema &S, LookupResult &R) {
499 Sema::LookupNameKind NameKind = R.getLookupKind();
500
501 // If we didn't find a use of this identifier, and if the identifier
502 // corresponds to a compiler builtin, create the decl object for the builtin
503 // now, injecting it into translation unit scope, and return it.
504 if (NameKind == Sema::LookupOrdinaryName ||
505 NameKind == Sema::LookupRedeclarationWithLinkage) {
506 IdentifierInfo *II = R.getLookupName().getAsIdentifierInfo();
507 if (II) {
Nico Webercac18ad2013-06-20 21:44:55 +0000508 if (S.getLangOpts().CPlusPlus11 && S.getLangOpts().GNUMode &&
509 II == S.getFloat128Identifier()) {
510 // libstdc++4.7's type_traits expects type __float128 to exist, so
511 // insert a dummy type to make that header build in gnu++11 mode.
512 R.addDecl(S.getASTContext().getFloat128StubType());
513 return true;
514 }
515
Douglas Gregor85910982010-02-12 05:48:04 +0000516 // If this is a builtin on this (or all) targets, create the decl.
517 if (unsigned BuiltinID = II->getBuiltinID()) {
518 // In C++, we don't have any predefined library functions like
519 // 'malloc'. Instead, we'll just error.
David Blaikie4e4d0842012-03-11 07:00:24 +0000520 if (S.getLangOpts().CPlusPlus &&
Douglas Gregor85910982010-02-12 05:48:04 +0000521 S.Context.BuiltinInfo.isPredefinedLibFunction(BuiltinID))
522 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000523
524 if (NamedDecl *D = S.LazilyCreateBuiltin((IdentifierInfo *)II,
525 BuiltinID, S.TUScope,
Douglas Gregor6b9109e2011-01-03 09:37:44 +0000526 R.isForRedeclaration(),
527 R.getNameLoc())) {
Douglas Gregor85910982010-02-12 05:48:04 +0000528 R.addDecl(D);
Douglas Gregor6b9109e2011-01-03 09:37:44 +0000529 return true;
530 }
531
532 if (R.isForRedeclaration()) {
533 // If we're redeclaring this function anyway, forget that
534 // this was a builtin at all.
535 S.Context.BuiltinInfo.ForgetBuiltin(BuiltinID, S.Context.Idents);
536 }
537
538 return false;
Douglas Gregor85910982010-02-12 05:48:04 +0000539 }
540 }
541 }
542
543 return false;
544}
545
Douglas Gregor4923aa22010-07-02 20:37:36 +0000546/// \brief Determine whether we can declare a special member function within
547/// the class at this point.
Richard Smithd0adeb62012-11-27 21:20:31 +0000548static bool CanDeclareSpecialMemberFunction(const CXXRecordDecl *Class) {
Douglas Gregor4923aa22010-07-02 20:37:36 +0000549 // We need to have a definition for the class.
550 if (!Class->getDefinition() || Class->isDependentContext())
551 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000552
Douglas Gregor4923aa22010-07-02 20:37:36 +0000553 // We can't be in the middle of defining the class.
Richard Smithd0adeb62012-11-27 21:20:31 +0000554 return !Class->isBeingDefined();
Douglas Gregor4923aa22010-07-02 20:37:36 +0000555}
556
557void Sema::ForceDeclarationOfImplicitMembers(CXXRecordDecl *Class) {
Richard Smithd0adeb62012-11-27 21:20:31 +0000558 if (!CanDeclareSpecialMemberFunction(Class))
Douglas Gregor22584312010-07-02 23:41:54 +0000559 return;
Douglas Gregor18274032010-07-03 00:47:00 +0000560
561 // If the default constructor has not yet been declared, do so now.
Sean Huntcdee3fe2011-05-11 22:34:38 +0000562 if (Class->needsImplicitDefaultConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +0000563 DeclareImplicitDefaultConstructor(Class);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000564
Douglas Gregor22584312010-07-02 23:41:54 +0000565 // If the copy constructor has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000566 if (Class->needsImplicitCopyConstructor())
Douglas Gregor22584312010-07-02 23:41:54 +0000567 DeclareImplicitCopyConstructor(Class);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000568
Douglas Gregora376d102010-07-02 21:50:04 +0000569 // If the copy assignment operator has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000570 if (Class->needsImplicitCopyAssignment())
Douglas Gregora376d102010-07-02 21:50:04 +0000571 DeclareImplicitCopyAssignment(Class);
572
Richard Smith80ad52f2013-01-02 11:42:31 +0000573 if (getLangOpts().CPlusPlus11) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000574 // If the move constructor has not yet been declared, do so now.
575 if (Class->needsImplicitMoveConstructor())
576 DeclareImplicitMoveConstructor(Class); // might not actually do it
577
578 // If the move assignment operator has not yet been declared, do so now.
579 if (Class->needsImplicitMoveAssignment())
580 DeclareImplicitMoveAssignment(Class); // might not actually do it
581 }
582
Douglas Gregor4923aa22010-07-02 20:37:36 +0000583 // If the destructor has not yet been declared, do so now.
Richard Smithe5411b72012-12-01 02:35:44 +0000584 if (Class->needsImplicitDestructor())
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000585 DeclareImplicitDestructor(Class);
Douglas Gregor4923aa22010-07-02 20:37:36 +0000586}
587
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000588/// \brief Determine whether this is the name of an implicitly-declared
Douglas Gregora376d102010-07-02 21:50:04 +0000589/// special member function.
590static bool isImplicitlyDeclaredMemberFunctionName(DeclarationName Name) {
591 switch (Name.getNameKind()) {
Douglas Gregor22584312010-07-02 23:41:54 +0000592 case DeclarationName::CXXConstructorName:
Douglas Gregora376d102010-07-02 21:50:04 +0000593 case DeclarationName::CXXDestructorName:
594 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000595
Douglas Gregora376d102010-07-02 21:50:04 +0000596 case DeclarationName::CXXOperatorName:
597 return Name.getCXXOverloadedOperator() == OO_Equal;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000598
Douglas Gregora376d102010-07-02 21:50:04 +0000599 default:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000600 break;
Douglas Gregora376d102010-07-02 21:50:04 +0000601 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000602
Douglas Gregora376d102010-07-02 21:50:04 +0000603 return false;
604}
605
606/// \brief If there are any implicit member functions with the given name
607/// that need to be declared in the given declaration context, do so.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000608static void DeclareImplicitMemberFunctionsWithName(Sema &S,
Douglas Gregora376d102010-07-02 21:50:04 +0000609 DeclarationName Name,
610 const DeclContext *DC) {
611 if (!DC)
612 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000613
Douglas Gregora376d102010-07-02 21:50:04 +0000614 switch (Name.getNameKind()) {
Douglas Gregor22584312010-07-02 23:41:54 +0000615 case DeclarationName::CXXConstructorName:
616 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
Richard Smithd0adeb62012-11-27 21:20:31 +0000617 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000618 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
Sean Huntcdee3fe2011-05-11 22:34:38 +0000619 if (Record->needsImplicitDefaultConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000620 S.DeclareImplicitDefaultConstructor(Class);
Richard Smithe5411b72012-12-01 02:35:44 +0000621 if (Record->needsImplicitCopyConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000622 S.DeclareImplicitCopyConstructor(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +0000623 if (S.getLangOpts().CPlusPlus11 &&
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000624 Record->needsImplicitMoveConstructor())
625 S.DeclareImplicitMoveConstructor(Class);
Douglas Gregor18274032010-07-03 00:47:00 +0000626 }
Douglas Gregor22584312010-07-02 23:41:54 +0000627 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000628
Douglas Gregora376d102010-07-02 21:50:04 +0000629 case DeclarationName::CXXDestructorName:
630 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC))
Richard Smithe5411b72012-12-01 02:35:44 +0000631 if (Record->getDefinition() && Record->needsImplicitDestructor() &&
Richard Smithd0adeb62012-11-27 21:20:31 +0000632 CanDeclareSpecialMemberFunction(Record))
Douglas Gregora376d102010-07-02 21:50:04 +0000633 S.DeclareImplicitDestructor(const_cast<CXXRecordDecl *>(Record));
Douglas Gregora376d102010-07-02 21:50:04 +0000634 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000635
Douglas Gregora376d102010-07-02 21:50:04 +0000636 case DeclarationName::CXXOperatorName:
637 if (Name.getCXXOverloadedOperator() != OO_Equal)
638 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000639
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000640 if (const CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(DC)) {
Richard Smithd0adeb62012-11-27 21:20:31 +0000641 if (Record->getDefinition() && CanDeclareSpecialMemberFunction(Record)) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000642 CXXRecordDecl *Class = const_cast<CXXRecordDecl *>(Record);
Richard Smithe5411b72012-12-01 02:35:44 +0000643 if (Record->needsImplicitCopyAssignment())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000644 S.DeclareImplicitCopyAssignment(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +0000645 if (S.getLangOpts().CPlusPlus11 &&
Sebastian Redl85ea7aa2011-08-30 19:58:05 +0000646 Record->needsImplicitMoveAssignment())
647 S.DeclareImplicitMoveAssignment(Class);
648 }
649 }
Douglas Gregora376d102010-07-02 21:50:04 +0000650 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000651
Douglas Gregora376d102010-07-02 21:50:04 +0000652 default:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000653 break;
Douglas Gregora376d102010-07-02 21:50:04 +0000654 }
655}
Douglas Gregor4923aa22010-07-02 20:37:36 +0000656
John McCallf36e02d2009-10-09 21:13:30 +0000657// Adds all qualifying matches for a name within a decl context to the
658// given lookup result. Returns true if any matches were found.
Douglas Gregor85910982010-02-12 05:48:04 +0000659static bool LookupDirect(Sema &S, LookupResult &R, const DeclContext *DC) {
John McCallf36e02d2009-10-09 21:13:30 +0000660 bool Found = false;
661
Douglas Gregor4923aa22010-07-02 20:37:36 +0000662 // Lazily declare C++ special member functions.
David Blaikie4e4d0842012-03-11 07:00:24 +0000663 if (S.getLangOpts().CPlusPlus)
Douglas Gregora376d102010-07-02 21:50:04 +0000664 DeclareImplicitMemberFunctionsWithName(S, R.getLookupName(), DC);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000665
Douglas Gregor4923aa22010-07-02 20:37:36 +0000666 // Perform lookup into this declaration context.
David Blaikie3bc93e32012-12-19 00:45:41 +0000667 DeclContext::lookup_const_result DR = DC->lookup(R.getLookupName());
668 for (DeclContext::lookup_const_iterator I = DR.begin(), E = DR.end(); I != E;
669 ++I) {
John McCall46460a62010-01-20 21:53:11 +0000670 NamedDecl *D = *I;
Douglas Gregor55368912011-12-14 16:03:29 +0000671 if ((D = R.getAcceptableDecl(D))) {
John McCall46460a62010-01-20 21:53:11 +0000672 R.addDecl(D);
Douglas Gregor48026d22010-01-11 18:40:55 +0000673 Found = true;
674 }
675 }
John McCallf36e02d2009-10-09 21:13:30 +0000676
Douglas Gregor85910982010-02-12 05:48:04 +0000677 if (!Found && DC->isTranslationUnit() && LookupBuiltin(S, R))
678 return true;
679
Douglas Gregor48026d22010-01-11 18:40:55 +0000680 if (R.getLookupName().getNameKind()
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000681 != DeclarationName::CXXConversionFunctionName ||
682 R.getLookupName().getCXXNameType()->isDependentType() ||
683 !isa<CXXRecordDecl>(DC))
684 return Found;
685
686 // C++ [temp.mem]p6:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000687 // A specialization of a conversion function template is not found by
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000688 // name lookup. Instead, any conversion function templates visible in the
689 // context of the use are considered. [...]
690 const CXXRecordDecl *Record = cast<CXXRecordDecl>(DC);
John McCall5e1cdac2011-10-07 06:10:15 +0000691 if (!Record->isCompleteDefinition())
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000692 return Found;
693
Argyrios Kyrtzidis9d295432012-11-28 03:56:09 +0000694 for (CXXRecordDecl::conversion_iterator U = Record->conversion_begin(),
695 UEnd = Record->conversion_end(); U != UEnd; ++U) {
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000696 FunctionTemplateDecl *ConvTemplate = dyn_cast<FunctionTemplateDecl>(*U);
697 if (!ConvTemplate)
698 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000699
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000700 // When we're performing lookup for the purposes of redeclaration, just
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000701 // add the conversion function template. When we deduce template
702 // arguments for specializations, we'll end up unifying the return
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000703 // type of the new declaration with the type of the function template.
704 if (R.isForRedeclaration()) {
705 R.addDecl(ConvTemplate);
706 Found = true;
707 continue;
708 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000709
Douglas Gregor48026d22010-01-11 18:40:55 +0000710 // C++ [temp.mem]p6:
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000711 // [...] For each such operator, if argument deduction succeeds
712 // (14.9.2.3), the resulting specialization is used as if found by
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000713 // name lookup.
714 //
715 // When referencing a conversion function for any purpose other than
716 // a redeclaration (such that we'll be building an expression with the
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000717 // result), perform template argument deduction and place the
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000718 // specialization into the result set. We do this to avoid forcing all
719 // callers to perform special deduction for conversion functions.
Craig Topper93e45992012-09-19 02:26:47 +0000720 TemplateDeductionInfo Info(R.getNameLoc());
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000721 FunctionDecl *Specialization = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000722
723 const FunctionProtoType *ConvProto
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000724 = ConvTemplate->getTemplatedDecl()->getType()->getAs<FunctionProtoType>();
725 assert(ConvProto && "Nonsensical conversion function template type");
Douglas Gregor3f477a12010-01-12 01:17:50 +0000726
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000727 // Compute the type of the function that we would expect the conversion
728 // function to have, if it were to match the name given.
729 // FIXME: Calling convention!
John McCalle23cf432010-12-14 08:05:40 +0000730 FunctionProtoType::ExtProtoInfo EPI = ConvProto->getExtProtoInfo();
731 EPI.ExtInfo = EPI.ExtInfo.withCallingConv(CC_Default);
Sebastian Redl8b5b4092011-03-06 10:52:04 +0000732 EPI.ExceptionSpecType = EST_None;
John McCalle23cf432010-12-14 08:05:40 +0000733 EPI.NumExceptions = 0;
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000734 QualType ExpectedType
735 = R.getSema().Context.getFunctionType(R.getLookupName().getCXXNameType(),
Dmitri Gribenko55431692013-05-05 00:41:58 +0000736 None, EPI);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000737
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000738 // Perform template argument deduction against the type that we would
739 // expect the function to have.
740 if (R.getSema().DeduceTemplateArguments(ConvTemplate, 0, ExpectedType,
741 Specialization, Info)
742 == Sema::TDK_Success) {
743 R.addDecl(Specialization);
744 Found = true;
Douglas Gregor48026d22010-01-11 18:40:55 +0000745 }
746 }
Chandler Carruthaaa1a892010-01-31 11:44:02 +0000747
John McCallf36e02d2009-10-09 21:13:30 +0000748 return Found;
749}
750
John McCalld7be78a2009-11-10 07:01:13 +0000751// Performs C++ unqualified lookup into the given file context.
John McCallf36e02d2009-10-09 21:13:30 +0000752static bool
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000753CppNamespaceLookup(Sema &S, LookupResult &R, ASTContext &Context,
Douglas Gregor85910982010-02-12 05:48:04 +0000754 DeclContext *NS, UnqualUsingDirectiveSet &UDirs) {
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000755
756 assert(NS && NS->isFileContext() && "CppNamespaceLookup() requires namespace!");
757
John McCalld7be78a2009-11-10 07:01:13 +0000758 // Perform direct name lookup into the LookupCtx.
Douglas Gregor85910982010-02-12 05:48:04 +0000759 bool Found = LookupDirect(S, R, NS);
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000760
John McCalld7be78a2009-11-10 07:01:13 +0000761 // Perform direct name lookup into the namespaces nominated by the
762 // using directives whose common ancestor is this namespace.
763 UnqualUsingDirectiveSet::const_iterator UI, UEnd;
764 llvm::tie(UI, UEnd) = UDirs.getNamespacesFor(NS);
Mike Stump1eb44332009-09-09 15:08:12 +0000765
John McCalld7be78a2009-11-10 07:01:13 +0000766 for (; UI != UEnd; ++UI)
Douglas Gregor85910982010-02-12 05:48:04 +0000767 if (LookupDirect(S, R, UI->getNominatedNamespace()))
John McCalld7be78a2009-11-10 07:01:13 +0000768 Found = true;
John McCallf36e02d2009-10-09 21:13:30 +0000769
770 R.resolveKind();
771
772 return Found;
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000773}
774
775static bool isNamespaceOrTranslationUnitScope(Scope *S) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000776 if (DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity()))
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000777 return Ctx->isFileContext();
778 return false;
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000779}
Douglas Gregor4c921ae2009-01-30 01:04:22 +0000780
Douglas Gregor711be1e2010-03-15 14:33:29 +0000781// Find the next outer declaration context from this scope. This
782// routine actually returns the semantic outer context, which may
783// differ from the lexical context (encoded directly in the Scope
784// stack) when we are parsing a member of a class template. In this
785// case, the second element of the pair will be true, to indicate that
786// name lookup should continue searching in this semantic context when
787// it leaves the current template parameter scope.
788static std::pair<DeclContext *, bool> findOuterContext(Scope *S) {
789 DeclContext *DC = static_cast<DeclContext *>(S->getEntity());
790 DeclContext *Lexical = 0;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000791 for (Scope *OuterS = S->getParent(); OuterS;
Douglas Gregor711be1e2010-03-15 14:33:29 +0000792 OuterS = OuterS->getParent()) {
793 if (OuterS->getEntity()) {
Douglas Gregordbdf5e72010-03-15 15:26:48 +0000794 Lexical = static_cast<DeclContext *>(OuterS->getEntity());
Douglas Gregor711be1e2010-03-15 14:33:29 +0000795 break;
796 }
797 }
798
799 // C++ [temp.local]p8:
800 // In the definition of a member of a class template that appears
801 // outside of the namespace containing the class template
802 // definition, the name of a template-parameter hides the name of
803 // a member of this namespace.
804 //
805 // Example:
806 //
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000807 // namespace N {
808 // class C { };
Douglas Gregor711be1e2010-03-15 14:33:29 +0000809 //
810 // template<class T> class B {
811 // void f(T);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000812 // };
Douglas Gregor711be1e2010-03-15 14:33:29 +0000813 // }
814 //
815 // template<class C> void N::B<C>::f(C) {
816 // C b; // C is the template parameter, not N::C
817 // }
818 //
819 // In this example, the lexical context we return is the
820 // TranslationUnit, while the semantic context is the namespace N.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000821 if (!Lexical || !DC || !S->getParent() ||
Douglas Gregor711be1e2010-03-15 14:33:29 +0000822 !S->getParent()->isTemplateParamScope())
823 return std::make_pair(Lexical, false);
824
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000825 // Find the outermost template parameter scope.
Douglas Gregor711be1e2010-03-15 14:33:29 +0000826 // For the example, this is the scope for the template parameters of
827 // template<class C>.
828 Scope *OutermostTemplateScope = S->getParent();
829 while (OutermostTemplateScope->getParent() &&
830 OutermostTemplateScope->getParent()->isTemplateParamScope())
831 OutermostTemplateScope = OutermostTemplateScope->getParent();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000832
Douglas Gregor711be1e2010-03-15 14:33:29 +0000833 // Find the namespace context in which the original scope occurs. In
834 // the example, this is namespace N.
835 DeclContext *Semantic = DC;
836 while (!Semantic->isFileContext())
837 Semantic = Semantic->getParent();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000838
Douglas Gregor711be1e2010-03-15 14:33:29 +0000839 // Find the declaration context just outside of the template
840 // parameter scope. This is the context in which the template is
841 // being lexically declaration (a namespace context). In the
842 // example, this is the global scope.
843 if (Lexical->isFileContext() && !Lexical->Equals(Semantic) &&
844 Lexical->Encloses(Semantic))
845 return std::make_pair(Semantic, true);
846
847 return std::make_pair(Lexical, false);
Douglas Gregore942bbe2009-09-10 16:57:35 +0000848}
849
John McCalla24dc2e2009-11-17 02:14:36 +0000850bool Sema::CppLookupName(LookupResult &R, Scope *S) {
David Blaikie4e4d0842012-03-11 07:00:24 +0000851 assert(getLangOpts().CPlusPlus && "Can perform only C++ lookup");
John McCalla24dc2e2009-11-17 02:14:36 +0000852
853 DeclarationName Name = R.getLookupName();
Richard Smithdd9459f2013-08-13 18:18:50 +0000854 Sema::LookupNameKind NameKind = R.getLookupKind();
John McCalla24dc2e2009-11-17 02:14:36 +0000855
Douglas Gregora376d102010-07-02 21:50:04 +0000856 // If this is the name of an implicitly-declared special member function,
857 // go through the scope stack to implicitly declare
858 if (isImplicitlyDeclaredMemberFunctionName(Name)) {
859 for (Scope *PreS = S; PreS; PreS = PreS->getParent())
860 if (DeclContext *DC = static_cast<DeclContext *>(PreS->getEntity()))
861 DeclareImplicitMemberFunctionsWithName(*this, Name, DC);
862 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000863
Douglas Gregora376d102010-07-02 21:50:04 +0000864 // Implicitly declare member functions with the name we're looking for, if in
865 // fact we are in a scope where it matters.
866
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000867 Scope *Initial = S;
Mike Stump1eb44332009-09-09 15:08:12 +0000868 IdentifierResolver::iterator
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000869 I = IdResolver.begin(Name),
870 IEnd = IdResolver.end();
Douglas Gregor4c921ae2009-01-30 01:04:22 +0000871
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000872 // First we lookup local scope.
Douglas Gregoraaba5e32009-02-04 19:02:06 +0000873 // We don't consider using-directives, as per 7.3.4.p1 [namespace.udir]
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000874 // ...During unqualified name lookup (3.4.1), the names appear as if
875 // they were declared in the nearest enclosing namespace which contains
876 // both the using-directive and the nominated namespace.
Eli Friedman33a31382009-08-05 19:21:58 +0000877 // [Note: in this context, "contains" means "contains directly or
Mike Stump1eb44332009-09-09 15:08:12 +0000878 // indirectly".
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000879 //
880 // For example:
881 // namespace A { int i; }
882 // void foo() {
883 // int i;
884 // {
885 // using namespace A;
886 // ++i; // finds local 'i', A::i appears at global scope
887 // }
888 // }
Douglas Gregor47b9a1c2009-02-04 17:27:36 +0000889 //
Douglas Gregor44b2ea92013-04-08 23:11:25 +0000890 UnqualUsingDirectiveSet UDirs;
891 bool VisitedUsingDirectives = false;
Richard Smithdd9459f2013-08-13 18:18:50 +0000892 bool LeftStartingScope = false;
Douglas Gregor711be1e2010-03-15 14:33:29 +0000893 DeclContext *OutsideOfTemplateParamDC = 0;
Douglas Gregor7dda67d2009-02-05 19:25:20 +0000894 for (; S && !isNamespaceOrTranslationUnitScope(S); S = S->getParent()) {
Douglas Gregord2235f62010-05-20 20:58:56 +0000895 DeclContext *Ctx = static_cast<DeclContext*>(S->getEntity());
896
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000897 // Check whether the IdResolver has anything in this scope.
John McCallf36e02d2009-10-09 21:13:30 +0000898 bool Found = false;
John McCalld226f652010-08-21 09:40:31 +0000899 for (; I != IEnd && S->isDeclScope(*I); ++I) {
Douglas Gregor55368912011-12-14 16:03:29 +0000900 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
Richard Smithdd9459f2013-08-13 18:18:50 +0000901 if (NameKind == LookupRedeclarationWithLinkage) {
902 // Determine whether this (or a previous) declaration is
903 // out-of-scope.
904 if (!LeftStartingScope && !Initial->isDeclScope(*I))
905 LeftStartingScope = true;
906
907 // If we found something outside of our starting scope that
908 // does not have linkage, skip it.
909 if (LeftStartingScope && !((*I)->hasLinkage())) {
910 R.setShadowed();
911 continue;
912 }
913 }
914
John McCallf36e02d2009-10-09 21:13:30 +0000915 Found = true;
Douglas Gregor55368912011-12-14 16:03:29 +0000916 R.addDecl(ND);
Douglas Gregor2a3009a2009-02-03 19:21:40 +0000917 }
918 }
John McCallf36e02d2009-10-09 21:13:30 +0000919 if (Found) {
920 R.resolveKind();
Douglas Gregord2235f62010-05-20 20:58:56 +0000921 if (S->isClassScope())
922 if (CXXRecordDecl *Record = dyn_cast_or_null<CXXRecordDecl>(Ctx))
923 R.setNamingClass(Record);
John McCallf36e02d2009-10-09 21:13:30 +0000924 return true;
925 }
926
Richard Smithdd9459f2013-08-13 18:18:50 +0000927 if (NameKind == LookupLocalFriendName && !S->isClassScope()) {
Richard Smith4e9686b2013-08-09 04:35:01 +0000928 // C++11 [class.friend]p11:
929 // If a friend declaration appears in a local class and the name
930 // specified is an unqualified name, a prior declaration is
931 // looked up without considering scopes that are outside the
932 // innermost enclosing non-class scope.
933 return false;
934 }
935
Douglas Gregor711be1e2010-03-15 14:33:29 +0000936 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
937 S->getParent() && !S->getParent()->isTemplateParamScope()) {
938 // We've just searched the last template parameter scope and
Sylvestre Ledrubed28ac2012-07-23 08:59:39 +0000939 // found nothing, so look into the contexts between the
Douglas Gregor711be1e2010-03-15 14:33:29 +0000940 // lexical and semantic declaration contexts returned by
941 // findOuterContext(). This implements the name lookup behavior
942 // of C++ [temp.local]p8.
943 Ctx = OutsideOfTemplateParamDC;
944 OutsideOfTemplateParamDC = 0;
945 }
946
947 if (Ctx) {
948 DeclContext *OuterCtx;
949 bool SearchAfterTemplateScope;
950 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
951 if (SearchAfterTemplateScope)
952 OutsideOfTemplateParamDC = OuterCtx;
953
Douglas Gregordbdf5e72010-03-15 15:26:48 +0000954 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
Douglas Gregor36262b82010-02-19 16:08:35 +0000955 // We do not directly look into transparent contexts, since
956 // those entities will be found in the nearest enclosing
957 // non-transparent context.
958 if (Ctx->isTransparentContext())
Douglas Gregore942bbe2009-09-10 16:57:35 +0000959 continue;
Douglas Gregor36262b82010-02-19 16:08:35 +0000960
961 // We do not look directly into function or method contexts,
962 // since all of the local variables and parameters of the
963 // function/method are present within the Scope.
964 if (Ctx->isFunctionOrMethod()) {
965 // If we have an Objective-C instance method, look for ivars
966 // in the corresponding interface.
967 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
968 if (Method->isInstanceMethod() && Name.getAsIdentifierInfo())
969 if (ObjCInterfaceDecl *Class = Method->getClassInterface()) {
970 ObjCInterfaceDecl *ClassDeclared;
971 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +0000972 Name.getAsIdentifierInfo(),
Douglas Gregor36262b82010-02-19 16:08:35 +0000973 ClassDeclared)) {
Douglas Gregor55368912011-12-14 16:03:29 +0000974 if (NamedDecl *ND = R.getAcceptableDecl(Ivar)) {
975 R.addDecl(ND);
Douglas Gregor36262b82010-02-19 16:08:35 +0000976 R.resolveKind();
977 return true;
978 }
979 }
980 }
981 }
982
983 continue;
984 }
985
Douglas Gregor6bed88e2013-03-27 12:51:49 +0000986 // If this is a file context, we need to perform unqualified name
987 // lookup considering using directives.
988 if (Ctx->isFileContext()) {
Douglas Gregor44b2ea92013-04-08 23:11:25 +0000989 // If we haven't handled using directives yet, do so now.
990 if (!VisitedUsingDirectives) {
991 // Add using directives from this context up to the top level.
Douglas Gregor34366202013-04-09 01:49:26 +0000992 for (DeclContext *UCtx = Ctx; UCtx; UCtx = UCtx->getParent()) {
993 if (UCtx->isTransparentContext())
994 continue;
995
Douglas Gregor44b2ea92013-04-08 23:11:25 +0000996 UDirs.visit(UCtx, UCtx);
Douglas Gregor34366202013-04-09 01:49:26 +0000997 }
Douglas Gregor44b2ea92013-04-08 23:11:25 +0000998
999 // Find the innermost file scope, so we can add using directives
1000 // from local scopes.
1001 Scope *InnermostFileScope = S;
1002 while (InnermostFileScope &&
1003 !isNamespaceOrTranslationUnitScope(InnermostFileScope))
1004 InnermostFileScope = InnermostFileScope->getParent();
1005 UDirs.visitScopeChain(Initial, InnermostFileScope);
1006
1007 UDirs.done();
1008
1009 VisitedUsingDirectives = true;
1010 }
Douglas Gregor6bed88e2013-03-27 12:51:49 +00001011
1012 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs)) {
1013 R.resolveKind();
1014 return true;
1015 }
1016
1017 continue;
1018 }
1019
Douglas Gregore942bbe2009-09-10 16:57:35 +00001020 // Perform qualified name lookup into this context.
1021 // FIXME: In some cases, we know that every name that could be found by
1022 // this qualified name lookup will also be on the identifier chain. For
1023 // example, inside a class without any base classes, we never need to
1024 // perform qualified lookup because all of the members are on top of the
1025 // identifier chain.
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001026 if (LookupQualifiedName(R, Ctx, /*InUnqualifiedLookup=*/true))
John McCallf36e02d2009-10-09 21:13:30 +00001027 return true;
Douglas Gregor551f48c2009-03-27 04:21:56 +00001028 }
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001029 }
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001030 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001031
John McCalld7be78a2009-11-10 07:01:13 +00001032 // Stop if we ran out of scopes.
1033 // FIXME: This really, really shouldn't be happening.
1034 if (!S) return false;
1035
Argyrios Kyrtzidis78f59112010-10-29 16:12:50 +00001036 // If we are looking for members, no need to look into global/namespace scope.
Richard Smithdd9459f2013-08-13 18:18:50 +00001037 if (NameKind == LookupMemberName)
Argyrios Kyrtzidis78f59112010-10-29 16:12:50 +00001038 return false;
1039
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001040 // Collect UsingDirectiveDecls in all scopes, and recursively all
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001041 // nominated namespaces by those using-directives.
John McCalld7be78a2009-11-10 07:01:13 +00001042 //
Mike Stump390b4cc2009-05-16 07:39:55 +00001043 // FIXME: Cache this sorted list in Scope structure, and DeclContext, so we
1044 // don't build it for each lookup!
Douglas Gregor44b2ea92013-04-08 23:11:25 +00001045 if (!VisitedUsingDirectives) {
1046 UDirs.visitScopeChain(Initial, S);
1047 UDirs.done();
1048 }
1049
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001050 // Lookup namespace scope, and global scope.
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001051 // Unqualified name lookup in C++ requires looking into scopes
1052 // that aren't strictly lexical, and therefore we walk through the
1053 // context as well as walking through the scopes.
1054 for (; S; S = S->getParent()) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001055 // Check whether the IdResolver has anything in this scope.
John McCallf36e02d2009-10-09 21:13:30 +00001056 bool Found = false;
John McCalld226f652010-08-21 09:40:31 +00001057 for (; I != IEnd && S->isDeclScope(*I); ++I) {
Douglas Gregor55368912011-12-14 16:03:29 +00001058 if (NamedDecl *ND = R.getAcceptableDecl(*I)) {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001059 // We found something. Look for anything else in our scope
1060 // with this same name and in an acceptable identifier
1061 // namespace, so that we can construct an overload set if we
1062 // need to.
John McCallf36e02d2009-10-09 21:13:30 +00001063 Found = true;
Douglas Gregor55368912011-12-14 16:03:29 +00001064 R.addDecl(ND);
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001065 }
1066 }
1067
Douglas Gregor00b4b032010-05-14 04:53:42 +00001068 if (Found && S->isTemplateParamScope()) {
John McCallf36e02d2009-10-09 21:13:30 +00001069 R.resolveKind();
1070 return true;
1071 }
1072
Douglas Gregor00b4b032010-05-14 04:53:42 +00001073 DeclContext *Ctx = static_cast<DeclContext *>(S->getEntity());
1074 if (!Ctx && S->isTemplateParamScope() && OutsideOfTemplateParamDC &&
1075 S->getParent() && !S->getParent()->isTemplateParamScope()) {
1076 // We've just searched the last template parameter scope and
Sylvestre Ledrubed28ac2012-07-23 08:59:39 +00001077 // found nothing, so look into the contexts between the
Douglas Gregor00b4b032010-05-14 04:53:42 +00001078 // lexical and semantic declaration contexts returned by
1079 // findOuterContext(). This implements the name lookup behavior
1080 // of C++ [temp.local]p8.
1081 Ctx = OutsideOfTemplateParamDC;
1082 OutsideOfTemplateParamDC = 0;
1083 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001084
Douglas Gregor00b4b032010-05-14 04:53:42 +00001085 if (Ctx) {
1086 DeclContext *OuterCtx;
1087 bool SearchAfterTemplateScope;
1088 llvm::tie(OuterCtx, SearchAfterTemplateScope) = findOuterContext(S);
1089 if (SearchAfterTemplateScope)
1090 OutsideOfTemplateParamDC = OuterCtx;
1091
1092 for (; Ctx && !Ctx->Equals(OuterCtx); Ctx = Ctx->getLookupParent()) {
1093 // We do not directly look into transparent contexts, since
1094 // those entities will be found in the nearest enclosing
1095 // non-transparent context.
1096 if (Ctx->isTransparentContext())
1097 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001098
Douglas Gregor00b4b032010-05-14 04:53:42 +00001099 // If we have a context, and it's not a context stashed in the
1100 // template parameter scope for an out-of-line definition, also
1101 // look into that context.
1102 if (!(Found && S && S->isTemplateParamScope())) {
1103 assert(Ctx->isFileContext() &&
1104 "We should have been looking only at file context here already.");
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001105
Douglas Gregor00b4b032010-05-14 04:53:42 +00001106 // Look into context considering using-directives.
1107 if (CppNamespaceLookup(*this, R, Context, Ctx, UDirs))
1108 Found = true;
1109 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001110
Douglas Gregor00b4b032010-05-14 04:53:42 +00001111 if (Found) {
1112 R.resolveKind();
1113 return true;
1114 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001115
Douglas Gregor00b4b032010-05-14 04:53:42 +00001116 if (R.isForRedeclaration() && !Ctx->isTransparentContext())
1117 return false;
1118 }
1119 }
1120
Douglas Gregor1df0ee92010-02-05 07:07:10 +00001121 if (R.isForRedeclaration() && Ctx && !Ctx->isTransparentContext())
John McCallf36e02d2009-10-09 21:13:30 +00001122 return false;
Douglas Gregor7dda67d2009-02-05 19:25:20 +00001123 }
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001124
John McCallf36e02d2009-10-09 21:13:30 +00001125 return !R.empty();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001126}
1127
Richard Smithb7751002013-07-25 23:08:39 +00001128/// \brief Find the declaration that a class temploid member specialization was
1129/// instantiated from, or the member itself if it is an explicit specialization.
1130static Decl *getInstantiatedFrom(Decl *D, MemberSpecializationInfo *MSInfo) {
1131 return MSInfo->isExplicitSpecialization() ? D : MSInfo->getInstantiatedFrom();
1132}
1133
1134/// \brief Find the module in which the given declaration was defined.
1135static Module *getDefiningModule(Decl *Entity) {
1136 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Entity)) {
1137 // If this function was instantiated from a template, the defining module is
1138 // the module containing the pattern.
1139 if (FunctionDecl *Pattern = FD->getTemplateInstantiationPattern())
1140 Entity = Pattern;
1141 } else if (CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(Entity)) {
1142 // If it's a class template specialization, find the template or partial
1143 // specialization from which it was instantiated.
1144 if (ClassTemplateSpecializationDecl *SpecRD =
1145 dyn_cast<ClassTemplateSpecializationDecl>(RD)) {
1146 llvm::PointerUnion<ClassTemplateDecl*,
1147 ClassTemplatePartialSpecializationDecl*> From =
1148 SpecRD->getInstantiatedFrom();
1149 if (ClassTemplateDecl *FromTemplate = From.dyn_cast<ClassTemplateDecl*>())
1150 Entity = FromTemplate->getTemplatedDecl();
1151 else if (From)
1152 Entity = From.get<ClassTemplatePartialSpecializationDecl*>();
1153 // Otherwise, it's an explicit specialization.
1154 } else if (MemberSpecializationInfo *MSInfo =
1155 RD->getMemberSpecializationInfo())
1156 Entity = getInstantiatedFrom(RD, MSInfo);
1157 } else if (EnumDecl *ED = dyn_cast<EnumDecl>(Entity)) {
1158 if (MemberSpecializationInfo *MSInfo = ED->getMemberSpecializationInfo())
1159 Entity = getInstantiatedFrom(ED, MSInfo);
1160 } else if (VarDecl *VD = dyn_cast<VarDecl>(Entity)) {
1161 // FIXME: Map from variable template specializations back to the template.
1162 if (MemberSpecializationInfo *MSInfo = VD->getMemberSpecializationInfo())
1163 Entity = getInstantiatedFrom(VD, MSInfo);
1164 }
1165
1166 // Walk up to the containing context. That might also have been instantiated
1167 // from a template.
1168 DeclContext *Context = Entity->getDeclContext();
1169 if (Context->isFileContext())
1170 return Entity->getOwningModule();
1171 return getDefiningModule(cast<Decl>(Context));
1172}
1173
1174llvm::DenseSet<Module*> &Sema::getLookupModules() {
1175 unsigned N = ActiveTemplateInstantiations.size();
1176 for (unsigned I = ActiveTemplateInstantiationLookupModules.size();
1177 I != N; ++I) {
1178 Module *M = getDefiningModule(ActiveTemplateInstantiations[I].Entity);
1179 if (M && !LookupModulesCache.insert(M).second)
1180 M = 0;
1181 ActiveTemplateInstantiationLookupModules.push_back(M);
1182 }
1183 return LookupModulesCache;
1184}
1185
1186/// \brief Determine whether a declaration is visible to name lookup.
1187///
1188/// This routine determines whether the declaration D is visible in the current
1189/// lookup context, taking into account the current template instantiation
1190/// stack. During template instantiation, a declaration is visible if it is
1191/// visible from a module containing any entity on the template instantiation
1192/// path (by instantiating a template, you allow it to see the declarations that
1193/// your module can see, including those later on in your module).
1194bool LookupResult::isVisibleSlow(Sema &SemaRef, NamedDecl *D) {
1195 assert(D->isHidden() && !SemaRef.ActiveTemplateInstantiations.empty() &&
1196 "should not call this: not in slow case");
1197 Module *DeclModule = D->getOwningModule();
1198 assert(DeclModule && "hidden decl not from a module");
1199
1200 // Find the extra places where we need to look.
1201 llvm::DenseSet<Module*> &LookupModules = SemaRef.getLookupModules();
1202 if (LookupModules.empty())
1203 return false;
1204
1205 // If our lookup set contains the decl's module, it's visible.
1206 if (LookupModules.count(DeclModule))
1207 return true;
1208
1209 // If the declaration isn't exported, it's not visible in any other module.
1210 if (D->isModulePrivate())
1211 return false;
1212
1213 // Check whether DeclModule is transitively exported to an import of
1214 // the lookup set.
1215 for (llvm::DenseSet<Module *>::iterator I = LookupModules.begin(),
1216 E = LookupModules.end();
1217 I != E; ++I)
1218 if ((*I)->isModuleVisible(DeclModule))
1219 return true;
1220 return false;
1221}
1222
Douglas Gregor55368912011-12-14 16:03:29 +00001223/// \brief Retrieve the visible declaration corresponding to D, if any.
1224///
1225/// This routine determines whether the declaration D is visible in the current
1226/// module, with the current imports. If not, it checks whether any
1227/// redeclaration of D is visible, and if so, returns that declaration.
Richard Smithb7751002013-07-25 23:08:39 +00001228///
Douglas Gregor55368912011-12-14 16:03:29 +00001229/// \returns D, or a visible previous declaration of D, whichever is more recent
1230/// and visible. If no declaration of D is visible, returns null.
Richard Smithd67679d2013-08-20 20:35:18 +00001231static NamedDecl *findAcceptableDecl(Sema &SemaRef, NamedDecl *D) {
1232 assert(!LookupResult::isVisible(SemaRef, D) && "not in slow case");
Richard Smithb7751002013-07-25 23:08:39 +00001233
Douglas Gregor0782ef22012-01-06 22:05:37 +00001234 for (Decl::redecl_iterator RD = D->redecls_begin(), RDEnd = D->redecls_end();
1235 RD != RDEnd; ++RD) {
David Blaikie581deb32012-06-06 20:45:41 +00001236 if (NamedDecl *ND = dyn_cast<NamedDecl>(*RD)) {
Richard Smithd67679d2013-08-20 20:35:18 +00001237 if (LookupResult::isVisible(SemaRef, ND))
Douglas Gregor0782ef22012-01-06 22:05:37 +00001238 return ND;
1239 }
Douglas Gregor55368912011-12-14 16:03:29 +00001240 }
Richard Smithb7751002013-07-25 23:08:39 +00001241
Douglas Gregor55368912011-12-14 16:03:29 +00001242 return 0;
1243}
1244
Richard Smithd67679d2013-08-20 20:35:18 +00001245NamedDecl *LookupResult::getAcceptableDeclSlow(NamedDecl *D) const {
1246 return findAcceptableDecl(SemaRef, D);
1247}
1248
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001249/// @brief Perform unqualified name lookup starting from a given
1250/// scope.
1251///
1252/// Unqualified name lookup (C++ [basic.lookup.unqual], C99 6.2.1) is
1253/// used to find names within the current scope. For example, 'x' in
1254/// @code
1255/// int x;
1256/// int f() {
1257/// return x; // unqualified name look finds 'x' in the global scope
1258/// }
1259/// @endcode
1260///
1261/// Different lookup criteria can find different names. For example, a
1262/// particular scope can have both a struct and a function of the same
1263/// name, and each can be found by certain lookup criteria. For more
1264/// information about lookup criteria, see the documentation for the
1265/// class LookupCriteria.
1266///
1267/// @param S The scope from which unqualified name lookup will
1268/// begin. If the lookup criteria permits, name lookup may also search
1269/// in the parent scopes.
1270///
James Dennett8da16872012-06-22 10:32:46 +00001271/// @param [in,out] R Specifies the lookup to perform (e.g., the name to
1272/// look up and the lookup kind), and is updated with the results of lookup
1273/// including zero or more declarations and possibly additional information
1274/// used to diagnose ambiguities.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001275///
James Dennett8da16872012-06-22 10:32:46 +00001276/// @returns \c true if lookup succeeded and false otherwise.
John McCalla24dc2e2009-11-17 02:14:36 +00001277bool Sema::LookupName(LookupResult &R, Scope *S, bool AllowBuiltinCreation) {
1278 DeclarationName Name = R.getLookupName();
John McCallf36e02d2009-10-09 21:13:30 +00001279 if (!Name) return false;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001280
John McCalla24dc2e2009-11-17 02:14:36 +00001281 LookupNameKind NameKind = R.getLookupKind();
1282
David Blaikie4e4d0842012-03-11 07:00:24 +00001283 if (!getLangOpts().CPlusPlus) {
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001284 // Unqualified name lookup in C/Objective-C is purely lexical, so
1285 // search in the declarations attached to the name.
John McCall1d7c5282009-12-18 10:40:03 +00001286 if (NameKind == Sema::LookupRedeclarationWithLinkage) {
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001287 // Find the nearest non-transparent declaration scope.
1288 while (!(S->getFlags() & Scope::DeclScope) ||
Mike Stump1eb44332009-09-09 15:08:12 +00001289 (S->getEntity() &&
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001290 static_cast<DeclContext *>(S->getEntity())
1291 ->isTransparentContext()))
1292 S = S->getParent();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001293 }
1294
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001295 // Scan up the scope chain looking for a decl that matches this
1296 // identifier that is in the appropriate namespace. This search
1297 // should not take long, as shadowing of names is uncommon, and
1298 // deep shadowing is extremely uncommon.
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001299 bool LeftStartingScope = false;
1300
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001301 for (IdentifierResolver::iterator I = IdResolver.begin(Name),
Mike Stump1eb44332009-09-09 15:08:12 +00001302 IEnd = IdResolver.end();
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001303 I != IEnd; ++I)
Richard Smithb7751002013-07-25 23:08:39 +00001304 if (NamedDecl *D = R.getAcceptableDecl(*I)) {
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001305 if (NameKind == LookupRedeclarationWithLinkage) {
1306 // Determine whether this (or a previous) declaration is
1307 // out-of-scope.
John McCalld226f652010-08-21 09:40:31 +00001308 if (!LeftStartingScope && !S->isDeclScope(*I))
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001309 LeftStartingScope = true;
1310
1311 // If we found something outside of our starting scope that
1312 // does not have linkage, skip it.
Richard Smithdd9459f2013-08-13 18:18:50 +00001313 if (LeftStartingScope && !((*I)->hasLinkage())) {
1314 R.setShadowed();
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001315 continue;
Richard Smithdd9459f2013-08-13 18:18:50 +00001316 }
Douglas Gregord6f7e9d2009-02-24 20:03:32 +00001317 }
Fariborz Jahanian98a54032011-07-12 17:16:56 +00001318 else if (NameKind == LookupObjCImplicitSelfParam &&
1319 !isa<ImplicitParamDecl>(*I))
1320 continue;
Richard Smithb7751002013-07-25 23:08:39 +00001321
Douglas Gregor55368912011-12-14 16:03:29 +00001322 R.addDecl(D);
John McCallf36e02d2009-10-09 21:13:30 +00001323
Douglas Gregor7a537402012-01-03 23:26:26 +00001324 // Check whether there are any other declarations with the same name
1325 // and in the same scope.
Douglas Gregorda795b42012-01-04 16:44:10 +00001326 if (I != IEnd) {
Douglas Gregor117c4562012-01-13 23:06:53 +00001327 // Find the scope in which this declaration was declared (if it
1328 // actually exists in a Scope).
1329 while (S && !S->isDeclScope(D))
1330 S = S->getParent();
1331
1332 // If the scope containing the declaration is the translation unit,
1333 // then we'll need to perform our checks based on the matching
1334 // DeclContexts rather than matching scopes.
1335 if (S && isNamespaceOrTranslationUnitScope(S))
1336 S = 0;
1337
1338 // Compute the DeclContext, if we need it.
1339 DeclContext *DC = 0;
1340 if (!S)
1341 DC = (*I)->getDeclContext()->getRedeclContext();
1342
Douglas Gregorda795b42012-01-04 16:44:10 +00001343 IdentifierResolver::iterator LastI = I;
1344 for (++LastI; LastI != IEnd; ++LastI) {
Douglas Gregor117c4562012-01-13 23:06:53 +00001345 if (S) {
1346 // Match based on scope.
1347 if (!S->isDeclScope(*LastI))
1348 break;
1349 } else {
1350 // Match based on DeclContext.
1351 DeclContext *LastDC
1352 = (*LastI)->getDeclContext()->getRedeclContext();
1353 if (!LastDC->Equals(DC))
1354 break;
1355 }
Richard Smithb7751002013-07-25 23:08:39 +00001356
1357 // If the declaration is in the right namespace and visible, add it.
1358 if (NamedDecl *LastD = R.getAcceptableDecl(*LastI))
1359 R.addDecl(LastD);
Douglas Gregorda795b42012-01-04 16:44:10 +00001360 }
Douglas Gregorf9201e02009-02-11 23:02:49 +00001361
Douglas Gregorda795b42012-01-04 16:44:10 +00001362 R.resolveKind();
Douglas Gregorf9201e02009-02-11 23:02:49 +00001363 }
John McCallf36e02d2009-10-09 21:13:30 +00001364 return true;
Douglas Gregorf9201e02009-02-11 23:02:49 +00001365 }
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001366 } else {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001367 // Perform C++ unqualified name lookup.
John McCalla24dc2e2009-11-17 02:14:36 +00001368 if (CppLookupName(R, S))
John McCallf36e02d2009-10-09 21:13:30 +00001369 return true;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001370 }
1371
1372 // If we didn't find a use of this identifier, and if the identifier
1373 // corresponds to a compiler builtin, create the decl object for the builtin
1374 // now, injecting it into translation unit scope, and return it.
Axel Naumann42151d52011-04-13 13:19:46 +00001375 if (AllowBuiltinCreation && LookupBuiltin(*this, R))
1376 return true;
Douglas Gregor3e41d602009-02-13 23:20:09 +00001377
Axel Naumannf8291a12011-02-24 16:47:47 +00001378 // If we didn't find a use of this identifier, the ExternalSource
1379 // may be able to handle the situation.
1380 // Note: some lookup failures are expected!
1381 // See e.g. R.isForRedeclaration().
1382 return (ExternalSource && ExternalSource->LookupUnqualified(R, S));
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001383}
1384
John McCall6e247262009-10-10 05:48:19 +00001385/// @brief Perform qualified name lookup in the namespaces nominated by
1386/// using directives by the given context.
1387///
1388/// C++98 [namespace.qual]p2:
James Dennett7ba75922012-06-19 21:05:49 +00001389/// Given X::m (where X is a user-declared namespace), or given \::m
John McCall6e247262009-10-10 05:48:19 +00001390/// (where X is the global namespace), let S be the set of all
1391/// declarations of m in X and in the transitive closure of all
1392/// namespaces nominated by using-directives in X and its used
1393/// namespaces, except that using-directives are ignored in any
1394/// namespace, including X, directly containing one or more
1395/// declarations of m. No namespace is searched more than once in
1396/// the lookup of a name. If S is the empty set, the program is
1397/// ill-formed. Otherwise, if S has exactly one member, or if the
1398/// context of the reference is a using-declaration
1399/// (namespace.udecl), S is the required set of declarations of
1400/// m. Otherwise if the use of m is not one that allows a unique
1401/// declaration to be chosen from S, the program is ill-formed.
James Dennett7ba75922012-06-19 21:05:49 +00001402///
John McCall6e247262009-10-10 05:48:19 +00001403/// C++98 [namespace.qual]p5:
1404/// During the lookup of a qualified namespace member name, if the
1405/// lookup finds more than one declaration of the member, and if one
1406/// declaration introduces a class name or enumeration name and the
1407/// other declarations either introduce the same object, the same
1408/// enumerator or a set of functions, the non-type name hides the
1409/// class or enumeration name if and only if the declarations are
1410/// from the same namespace; otherwise (the declarations are from
1411/// different namespaces), the program is ill-formed.
Douglas Gregor85910982010-02-12 05:48:04 +00001412static bool LookupQualifiedNameInUsingDirectives(Sema &S, LookupResult &R,
John McCalla24dc2e2009-11-17 02:14:36 +00001413 DeclContext *StartDC) {
John McCall6e247262009-10-10 05:48:19 +00001414 assert(StartDC->isFileContext() && "start context is not a file context");
1415
1416 DeclContext::udir_iterator I = StartDC->using_directives_begin();
1417 DeclContext::udir_iterator E = StartDC->using_directives_end();
1418
1419 if (I == E) return false;
1420
1421 // We have at least added all these contexts to the queue.
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001422 llvm::SmallPtrSet<DeclContext*, 8> Visited;
John McCall6e247262009-10-10 05:48:19 +00001423 Visited.insert(StartDC);
1424
1425 // We have not yet looked into these namespaces, much less added
1426 // their "using-children" to the queue.
Chris Lattner5f9e2722011-07-23 10:55:15 +00001427 SmallVector<NamespaceDecl*, 8> Queue;
John McCall6e247262009-10-10 05:48:19 +00001428
1429 // We have already looked into the initial namespace; seed the queue
1430 // with its using-children.
1431 for (; I != E; ++I) {
John McCalld9f01d42009-11-10 09:25:37 +00001432 NamespaceDecl *ND = (*I)->getNominatedNamespace()->getOriginalNamespace();
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001433 if (Visited.insert(ND))
John McCall6e247262009-10-10 05:48:19 +00001434 Queue.push_back(ND);
1435 }
1436
1437 // The easiest way to implement the restriction in [namespace.qual]p5
1438 // is to check whether any of the individual results found a tag
1439 // and, if so, to declare an ambiguity if the final result is not
1440 // a tag.
1441 bool FoundTag = false;
1442 bool FoundNonTag = false;
1443
John McCall7d384dd2009-11-18 07:57:50 +00001444 LookupResult LocalR(LookupResult::Temporary, R);
John McCall6e247262009-10-10 05:48:19 +00001445
1446 bool Found = false;
1447 while (!Queue.empty()) {
Robert Wilhelm344472e2013-08-23 16:11:15 +00001448 NamespaceDecl *ND = Queue.pop_back_val();
John McCall6e247262009-10-10 05:48:19 +00001449
1450 // We go through some convolutions here to avoid copying results
1451 // between LookupResults.
1452 bool UseLocal = !R.empty();
John McCall7d384dd2009-11-18 07:57:50 +00001453 LookupResult &DirectR = UseLocal ? LocalR : R;
Douglas Gregor85910982010-02-12 05:48:04 +00001454 bool FoundDirect = LookupDirect(S, DirectR, ND);
John McCall6e247262009-10-10 05:48:19 +00001455
1456 if (FoundDirect) {
1457 // First do any local hiding.
1458 DirectR.resolveKind();
1459
1460 // If the local result is a tag, remember that.
1461 if (DirectR.isSingleTagDecl())
1462 FoundTag = true;
1463 else
1464 FoundNonTag = true;
1465
1466 // Append the local results to the total results if necessary.
1467 if (UseLocal) {
1468 R.addAllDecls(LocalR);
1469 LocalR.clear();
1470 }
1471 }
1472
1473 // If we find names in this namespace, ignore its using directives.
1474 if (FoundDirect) {
1475 Found = true;
1476 continue;
1477 }
1478
1479 for (llvm::tie(I,E) = ND->getUsingDirectives(); I != E; ++I) {
1480 NamespaceDecl *Nom = (*I)->getNominatedNamespace();
Benjamin Kramer8c43dcc2012-02-23 16:06:01 +00001481 if (Visited.insert(Nom))
John McCall6e247262009-10-10 05:48:19 +00001482 Queue.push_back(Nom);
1483 }
1484 }
1485
1486 if (Found) {
1487 if (FoundTag && FoundNonTag)
1488 R.setAmbiguousQualifiedTagHiding();
1489 else
1490 R.resolveKind();
1491 }
1492
1493 return Found;
1494}
1495
Douglas Gregor8071e422010-08-15 06:18:01 +00001496/// \brief Callback that looks for any member of a class with the given name.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001497static bool LookupAnyMember(const CXXBaseSpecifier *Specifier,
Douglas Gregor8071e422010-08-15 06:18:01 +00001498 CXXBasePath &Path,
1499 void *Name) {
1500 RecordDecl *BaseRecord = Specifier->getType()->getAs<RecordType>()->getDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001501
Douglas Gregor8071e422010-08-15 06:18:01 +00001502 DeclarationName N = DeclarationName::getFromOpaquePtr(Name);
1503 Path.Decls = BaseRecord->lookup(N);
David Blaikie3bc93e32012-12-19 00:45:41 +00001504 return !Path.Decls.empty();
Douglas Gregor8071e422010-08-15 06:18:01 +00001505}
1506
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001507/// \brief Determine whether the given set of member declarations contains only
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001508/// static members, nested types, and enumerators.
1509template<typename InputIterator>
1510static bool HasOnlyStaticMembers(InputIterator First, InputIterator Last) {
1511 Decl *D = (*First)->getUnderlyingDecl();
1512 if (isa<VarDecl>(D) || isa<TypeDecl>(D) || isa<EnumConstantDecl>(D))
1513 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001514
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001515 if (isa<CXXMethodDecl>(D)) {
1516 // Determine whether all of the methods are static.
1517 bool AllMethodsAreStatic = true;
1518 for(; First != Last; ++First) {
1519 D = (*First)->getUnderlyingDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001520
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001521 if (!isa<CXXMethodDecl>(D)) {
1522 assert(isa<TagDecl>(D) && "Non-function must be a tag decl");
1523 break;
1524 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001525
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001526 if (!cast<CXXMethodDecl>(D)->isStatic()) {
1527 AllMethodsAreStatic = false;
1528 break;
1529 }
1530 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001531
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001532 if (AllMethodsAreStatic)
1533 return true;
1534 }
1535
1536 return false;
1537}
1538
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001539/// \brief Perform qualified name lookup into a given context.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001540///
1541/// Qualified name lookup (C++ [basic.lookup.qual]) is used to find
1542/// names when the context of those names is explicit specified, e.g.,
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001543/// "std::vector" or "x->member", or as part of unqualified name lookup.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001544///
1545/// Different lookup criteria can find different names. For example, a
1546/// particular scope can have both a struct and a function of the same
1547/// name, and each can be found by certain lookup criteria. For more
1548/// information about lookup criteria, see the documentation for the
1549/// class LookupCriteria.
1550///
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001551/// \param R captures both the lookup criteria and any lookup results found.
1552///
1553/// \param LookupCtx The context in which qualified name lookup will
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001554/// search. If the lookup criteria permits, name lookup may also search
1555/// in the parent contexts or (for C++ classes) base classes.
1556///
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001557/// \param InUnqualifiedLookup true if this is qualified name lookup that
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001558/// occurs as part of unqualified name lookup.
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001559///
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001560/// \returns true if lookup succeeded, false if it failed.
1561bool Sema::LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
1562 bool InUnqualifiedLookup) {
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001563 assert(LookupCtx && "Sema::LookupQualifiedName requires a lookup context");
Mike Stump1eb44332009-09-09 15:08:12 +00001564
John McCalla24dc2e2009-11-17 02:14:36 +00001565 if (!R.getLookupName())
John McCallf36e02d2009-10-09 21:13:30 +00001566 return false;
Mike Stump1eb44332009-09-09 15:08:12 +00001567
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001568 // Make sure that the declaration context is complete.
1569 assert((!isa<TagDecl>(LookupCtx) ||
1570 LookupCtx->isDependentContext() ||
John McCall5e1cdac2011-10-07 06:10:15 +00001571 cast<TagDecl>(LookupCtx)->isCompleteDefinition() ||
Richard Smith1af83c42012-03-23 03:33:32 +00001572 cast<TagDecl>(LookupCtx)->isBeingDefined()) &&
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001573 "Declaration context must already be complete!");
Mike Stump1eb44332009-09-09 15:08:12 +00001574
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001575 // Perform qualified name lookup into the LookupCtx.
Douglas Gregor85910982010-02-12 05:48:04 +00001576 if (LookupDirect(*this, R, LookupCtx)) {
John McCallf36e02d2009-10-09 21:13:30 +00001577 R.resolveKind();
John McCall92f88312010-01-23 00:46:32 +00001578 if (isa<CXXRecordDecl>(LookupCtx))
1579 R.setNamingClass(cast<CXXRecordDecl>(LookupCtx));
John McCallf36e02d2009-10-09 21:13:30 +00001580 return true;
1581 }
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001582
John McCall6e247262009-10-10 05:48:19 +00001583 // Don't descend into implied contexts for redeclarations.
1584 // C++98 [namespace.qual]p6:
1585 // In a declaration for a namespace member in which the
1586 // declarator-id is a qualified-id, given that the qualified-id
1587 // for the namespace member has the form
1588 // nested-name-specifier unqualified-id
1589 // the unqualified-id shall name a member of the namespace
1590 // designated by the nested-name-specifier.
1591 // See also [class.mfct]p5 and [class.static.data]p2.
John McCalla24dc2e2009-11-17 02:14:36 +00001592 if (R.isForRedeclaration())
John McCall6e247262009-10-10 05:48:19 +00001593 return false;
1594
John McCalla24dc2e2009-11-17 02:14:36 +00001595 // If this is a namespace, look it up in the implied namespaces.
John McCall6e247262009-10-10 05:48:19 +00001596 if (LookupCtx->isFileContext())
Douglas Gregor85910982010-02-12 05:48:04 +00001597 return LookupQualifiedNameInUsingDirectives(*this, R, LookupCtx);
John McCall6e247262009-10-10 05:48:19 +00001598
Douglas Gregor2dd078a2009-09-02 22:59:36 +00001599 // If this isn't a C++ class, we aren't allowed to look into base
Douglas Gregor4719f4e2009-09-11 22:57:37 +00001600 // classes, we're done.
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001601 CXXRecordDecl *LookupRec = dyn_cast<CXXRecordDecl>(LookupCtx);
Douglas Gregor025291b2010-07-01 00:21:21 +00001602 if (!LookupRec || !LookupRec->getDefinition())
John McCallf36e02d2009-10-09 21:13:30 +00001603 return false;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001604
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001605 // If we're performing qualified name lookup into a dependent class,
1606 // then we are actually looking into a current instantiation. If we have any
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001607 // dependent base classes, then we either have to delay lookup until
Douglas Gregor7d3f5762010-01-15 01:44:47 +00001608 // template instantiation time (at which point all bases will be available)
1609 // or we have to fail.
1610 if (!InUnqualifiedLookup && LookupRec->isDependentContext() &&
1611 LookupRec->hasAnyDependentBases()) {
1612 R.setNotFoundInCurrentInstantiation();
1613 return false;
1614 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001615
Douglas Gregor7176fff2009-01-15 00:26:24 +00001616 // Perform lookup into our base classes.
Douglas Gregora8f32e02009-10-06 17:59:45 +00001617 CXXBasePaths Paths;
1618 Paths.setOrigin(LookupRec);
Douglas Gregor7176fff2009-01-15 00:26:24 +00001619
1620 // Look for this member in our base classes
Douglas Gregora8f32e02009-10-06 17:59:45 +00001621 CXXRecordDecl::BaseMatchesCallback *BaseCallback = 0;
John McCalla24dc2e2009-11-17 02:14:36 +00001622 switch (R.getLookupKind()) {
Fariborz Jahanian98a54032011-07-12 17:16:56 +00001623 case LookupObjCImplicitSelfParam:
Douglas Gregora8f32e02009-10-06 17:59:45 +00001624 case LookupOrdinaryName:
1625 case LookupMemberName:
1626 case LookupRedeclarationWithLinkage:
Richard Smith4e9686b2013-08-09 04:35:01 +00001627 case LookupLocalFriendName:
Douglas Gregora8f32e02009-10-06 17:59:45 +00001628 BaseCallback = &CXXRecordDecl::FindOrdinaryMember;
1629 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001630
Douglas Gregora8f32e02009-10-06 17:59:45 +00001631 case LookupTagName:
1632 BaseCallback = &CXXRecordDecl::FindTagMember;
1633 break;
John McCall9f54ad42009-12-10 09:41:52 +00001634
Douglas Gregor8071e422010-08-15 06:18:01 +00001635 case LookupAnyName:
1636 BaseCallback = &LookupAnyMember;
1637 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001638
John McCall9f54ad42009-12-10 09:41:52 +00001639 case LookupUsingDeclName:
1640 // This lookup is for redeclarations only.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001641
Douglas Gregora8f32e02009-10-06 17:59:45 +00001642 case LookupOperatorName:
1643 case LookupNamespaceName:
1644 case LookupObjCProtocolName:
Chris Lattner337e5502011-02-18 01:27:55 +00001645 case LookupLabel:
Douglas Gregora8f32e02009-10-06 17:59:45 +00001646 // These lookups will never find a member in a C++ class (or base class).
John McCallf36e02d2009-10-09 21:13:30 +00001647 return false;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001648
Douglas Gregora8f32e02009-10-06 17:59:45 +00001649 case LookupNestedNameSpecifierName:
1650 BaseCallback = &CXXRecordDecl::FindNestedNameSpecifierMember;
1651 break;
1652 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001653
John McCalla24dc2e2009-11-17 02:14:36 +00001654 if (!LookupRec->lookupInBases(BaseCallback,
1655 R.getLookupName().getAsOpaquePtr(), Paths))
John McCallf36e02d2009-10-09 21:13:30 +00001656 return false;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001657
John McCall92f88312010-01-23 00:46:32 +00001658 R.setNamingClass(LookupRec);
1659
Douglas Gregor7176fff2009-01-15 00:26:24 +00001660 // C++ [class.member.lookup]p2:
1661 // [...] If the resulting set of declarations are not all from
1662 // sub-objects of the same type, or the set has a nonstatic member
1663 // and includes members from distinct sub-objects, there is an
1664 // ambiguity and the program is ill-formed. Otherwise that set is
1665 // the result of the lookup.
Douglas Gregor7176fff2009-01-15 00:26:24 +00001666 QualType SubobjectType;
Daniel Dunbarf1853192009-01-15 18:32:35 +00001667 int SubobjectNumber = 0;
John McCall7aceaf82010-03-18 23:49:19 +00001668 AccessSpecifier SubobjectAccess = AS_none;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001669
Douglas Gregora8f32e02009-10-06 17:59:45 +00001670 for (CXXBasePaths::paths_iterator Path = Paths.begin(), PathEnd = Paths.end();
Douglas Gregor7176fff2009-01-15 00:26:24 +00001671 Path != PathEnd; ++Path) {
Douglas Gregora8f32e02009-10-06 17:59:45 +00001672 const CXXBasePathElement &PathElement = Path->back();
Douglas Gregor7176fff2009-01-15 00:26:24 +00001673
John McCall46460a62010-01-20 21:53:11 +00001674 // Pick the best (i.e. most permissive i.e. numerically lowest) access
1675 // across all paths.
1676 SubobjectAccess = std::min(SubobjectAccess, Path->Access);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001677
Douglas Gregor7176fff2009-01-15 00:26:24 +00001678 // Determine whether we're looking at a distinct sub-object or not.
1679 if (SubobjectType.isNull()) {
John McCallf36e02d2009-10-09 21:13:30 +00001680 // This is the first subobject we've looked at. Record its type.
Douglas Gregor7176fff2009-01-15 00:26:24 +00001681 SubobjectType = Context.getCanonicalType(PathElement.Base->getType());
1682 SubobjectNumber = PathElement.SubobjectNumber;
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001683 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001684 }
1685
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001686 if (SubobjectType
Douglas Gregor7176fff2009-01-15 00:26:24 +00001687 != Context.getCanonicalType(PathElement.Base->getType())) {
1688 // We found members of the given name in two subobjects of
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001689 // different types. If the declaration sets aren't the same, this
1690 // this lookup is ambiguous.
David Blaikie3bc93e32012-12-19 00:45:41 +00001691 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end())) {
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001692 CXXBasePaths::paths_iterator FirstPath = Paths.begin();
David Blaikie3bc93e32012-12-19 00:45:41 +00001693 DeclContext::lookup_iterator FirstD = FirstPath->Decls.begin();
1694 DeclContext::lookup_iterator CurrentD = Path->Decls.begin();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001695
David Blaikie3bc93e32012-12-19 00:45:41 +00001696 while (FirstD != FirstPath->Decls.end() &&
1697 CurrentD != Path->Decls.end()) {
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001698 if ((*FirstD)->getUnderlyingDecl()->getCanonicalDecl() !=
1699 (*CurrentD)->getUnderlyingDecl()->getCanonicalDecl())
1700 break;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001701
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001702 ++FirstD;
1703 ++CurrentD;
1704 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001705
David Blaikie3bc93e32012-12-19 00:45:41 +00001706 if (FirstD == FirstPath->Decls.end() &&
1707 CurrentD == Path->Decls.end())
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001708 continue;
1709 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001710
John McCallf36e02d2009-10-09 21:13:30 +00001711 R.setAmbiguousBaseSubobjectTypes(Paths);
1712 return true;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001713 }
1714
Douglas Gregorf17b58c2010-10-22 22:08:47 +00001715 if (SubobjectNumber != PathElement.SubobjectNumber) {
Douglas Gregor7176fff2009-01-15 00:26:24 +00001716 // We have a different subobject of the same type.
1717
1718 // C++ [class.member.lookup]p5:
1719 // A static member, a nested type or an enumerator defined in
1720 // a base class T can unambiguously be found even if an object
Mike Stump1eb44332009-09-09 15:08:12 +00001721 // has more than one base class subobject of type T.
David Blaikie3bc93e32012-12-19 00:45:41 +00001722 if (HasOnlyStaticMembers(Path->Decls.begin(), Path->Decls.end()))
Douglas Gregor7176fff2009-01-15 00:26:24 +00001723 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001724
Douglas Gregor7176fff2009-01-15 00:26:24 +00001725 // We have found a nonstatic member name in multiple, distinct
1726 // subobjects. Name lookup is ambiguous.
John McCallf36e02d2009-10-09 21:13:30 +00001727 R.setAmbiguousBaseSubobjects(Paths);
1728 return true;
Douglas Gregor7176fff2009-01-15 00:26:24 +00001729 }
1730 }
1731
1732 // Lookup in a base class succeeded; return these results.
1733
David Blaikie3bc93e32012-12-19 00:45:41 +00001734 DeclContext::lookup_result DR = Paths.front().Decls;
1735 for (DeclContext::lookup_iterator I = DR.begin(), E = DR.end(); I != E; ++I) {
John McCall92f88312010-01-23 00:46:32 +00001736 NamedDecl *D = *I;
1737 AccessSpecifier AS = CXXRecordDecl::MergeAccess(SubobjectAccess,
1738 D->getAccess());
1739 R.addDecl(D, AS);
1740 }
John McCallf36e02d2009-10-09 21:13:30 +00001741 R.resolveKind();
1742 return true;
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001743}
1744
1745/// @brief Performs name lookup for a name that was parsed in the
1746/// source code, and may contain a C++ scope specifier.
1747///
1748/// This routine is a convenience routine meant to be called from
1749/// contexts that receive a name and an optional C++ scope specifier
1750/// (e.g., "N::M::x"). It will then perform either qualified or
1751/// unqualified name lookup (with LookupQualifiedName or LookupName,
1752/// respectively) on the given name and return those results.
1753///
1754/// @param S The scope from which unqualified name lookup will
1755/// begin.
Mike Stump1eb44332009-09-09 15:08:12 +00001756///
Douglas Gregor495c35d2009-08-25 22:51:20 +00001757/// @param SS An optional C++ scope-specifier, e.g., "::N::M".
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001758///
Douglas Gregor495c35d2009-08-25 22:51:20 +00001759/// @param EnteringContext Indicates whether we are going to enter the
1760/// context of the scope-specifier SS (if present).
1761///
John McCallf36e02d2009-10-09 21:13:30 +00001762/// @returns True if any decls were found (but possibly ambiguous)
Jeffrey Yasskin9ab14542010-04-08 16:38:48 +00001763bool Sema::LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
John McCalla24dc2e2009-11-17 02:14:36 +00001764 bool AllowBuiltinCreation, bool EnteringContext) {
Douglas Gregor495c35d2009-08-25 22:51:20 +00001765 if (SS && SS->isInvalid()) {
1766 // When the scope specifier is invalid, don't even look for
Douglas Gregor42af25f2009-05-11 19:58:34 +00001767 // anything.
John McCallf36e02d2009-10-09 21:13:30 +00001768 return false;
Douglas Gregor495c35d2009-08-25 22:51:20 +00001769 }
Mike Stump1eb44332009-09-09 15:08:12 +00001770
Douglas Gregor495c35d2009-08-25 22:51:20 +00001771 if (SS && SS->isSet()) {
1772 if (DeclContext *DC = computeDeclContext(*SS, EnteringContext)) {
Mike Stump1eb44332009-09-09 15:08:12 +00001773 // We have resolved the scope specifier to a particular declaration
Douglas Gregor495c35d2009-08-25 22:51:20 +00001774 // contex, and will perform name lookup in that context.
John McCall77bb1aa2010-05-01 00:40:08 +00001775 if (!DC->isDependentContext() && RequireCompleteDeclContext(*SS, DC))
John McCallf36e02d2009-10-09 21:13:30 +00001776 return false;
Mike Stump1eb44332009-09-09 15:08:12 +00001777
John McCalla24dc2e2009-11-17 02:14:36 +00001778 R.setContextRange(SS->getRange());
John McCalla24dc2e2009-11-17 02:14:36 +00001779 return LookupQualifiedName(R, DC);
Douglas Gregore4e5b052009-03-19 00:18:19 +00001780 }
Douglas Gregor42af25f2009-05-11 19:58:34 +00001781
Douglas Gregor495c35d2009-08-25 22:51:20 +00001782 // We could not resolve the scope specified to a specific declaration
Mike Stump1eb44332009-09-09 15:08:12 +00001783 // context, which means that SS refers to an unknown specialization.
Douglas Gregor495c35d2009-08-25 22:51:20 +00001784 // Name lookup can't find anything in this case.
Douglas Gregor3eafbb82011-10-24 22:24:50 +00001785 R.setNotFoundInCurrentInstantiation();
1786 R.setContextRange(SS->getRange());
John McCallf36e02d2009-10-09 21:13:30 +00001787 return false;
Douglas Gregor4c921ae2009-01-30 01:04:22 +00001788 }
1789
Mike Stump1eb44332009-09-09 15:08:12 +00001790 // Perform unqualified name lookup starting in the given scope.
John McCalla24dc2e2009-11-17 02:14:36 +00001791 return LookupName(R, S, AllowBuiltinCreation);
Douglas Gregoreb11cd02009-01-14 22:20:51 +00001792}
1793
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001794
James Dennett16ae9de2012-06-22 10:16:05 +00001795/// \brief Produce a diagnostic describing the ambiguity that resulted
Douglas Gregor7176fff2009-01-15 00:26:24 +00001796/// from name lookup.
1797///
James Dennett16ae9de2012-06-22 10:16:05 +00001798/// \param Result The result of the ambiguous lookup to be diagnosed.
Mike Stump1eb44332009-09-09 15:08:12 +00001799///
James Dennett16ae9de2012-06-22 10:16:05 +00001800/// \returns true
John McCalla24dc2e2009-11-17 02:14:36 +00001801bool Sema::DiagnoseAmbiguousLookup(LookupResult &Result) {
Douglas Gregor7176fff2009-01-15 00:26:24 +00001802 assert(Result.isAmbiguous() && "Lookup result must be ambiguous");
1803
John McCalla24dc2e2009-11-17 02:14:36 +00001804 DeclarationName Name = Result.getLookupName();
1805 SourceLocation NameLoc = Result.getNameLoc();
1806 SourceRange LookupRange = Result.getContextRange();
1807
John McCall6e247262009-10-10 05:48:19 +00001808 switch (Result.getAmbiguityKind()) {
1809 case LookupResult::AmbiguousBaseSubobjects: {
1810 CXXBasePaths *Paths = Result.getBasePaths();
1811 QualType SubobjectType = Paths->front().back().Base->getType();
1812 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobjects)
1813 << Name << SubobjectType << getAmbiguousPathsDisplayString(*Paths)
1814 << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001815
David Blaikie3bc93e32012-12-19 00:45:41 +00001816 DeclContext::lookup_iterator Found = Paths->front().Decls.begin();
John McCall6e247262009-10-10 05:48:19 +00001817 while (isa<CXXMethodDecl>(*Found) &&
1818 cast<CXXMethodDecl>(*Found)->isStatic())
1819 ++Found;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001820
John McCall6e247262009-10-10 05:48:19 +00001821 Diag((*Found)->getLocation(), diag::note_ambiguous_member_found);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001822
John McCall6e247262009-10-10 05:48:19 +00001823 return true;
1824 }
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001825
John McCall6e247262009-10-10 05:48:19 +00001826 case LookupResult::AmbiguousBaseSubobjectTypes: {
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001827 Diag(NameLoc, diag::err_ambiguous_member_multiple_subobject_types)
1828 << Name << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001829
John McCall6e247262009-10-10 05:48:19 +00001830 CXXBasePaths *Paths = Result.getBasePaths();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001831 std::set<Decl *> DeclsPrinted;
John McCall6e247262009-10-10 05:48:19 +00001832 for (CXXBasePaths::paths_iterator Path = Paths->begin(),
1833 PathEnd = Paths->end();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001834 Path != PathEnd; ++Path) {
David Blaikie3bc93e32012-12-19 00:45:41 +00001835 Decl *D = Path->Decls.front();
Douglas Gregor2a3009a2009-02-03 19:21:40 +00001836 if (DeclsPrinted.insert(D).second)
1837 Diag(D->getLocation(), diag::note_ambiguous_member_found);
1838 }
1839
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001840 return true;
Douglas Gregor4dc6b1c2009-01-16 00:38:09 +00001841 }
1842
John McCall6e247262009-10-10 05:48:19 +00001843 case LookupResult::AmbiguousTagHiding: {
1844 Diag(NameLoc, diag::err_ambiguous_tag_hiding) << Name << LookupRange;
Douglas Gregor69d993a2009-01-17 01:13:24 +00001845
John McCall6e247262009-10-10 05:48:19 +00001846 llvm::SmallPtrSet<NamedDecl*,8> TagDecls;
1847
1848 LookupResult::iterator DI, DE = Result.end();
1849 for (DI = Result.begin(); DI != DE; ++DI)
1850 if (TagDecl *TD = dyn_cast<TagDecl>(*DI)) {
1851 TagDecls.insert(TD);
1852 Diag(TD->getLocation(), diag::note_hidden_tag);
1853 }
1854
1855 for (DI = Result.begin(); DI != DE; ++DI)
1856 if (!isa<TagDecl>(*DI))
1857 Diag((*DI)->getLocation(), diag::note_hiding_object);
1858
1859 // For recovery purposes, go ahead and implement the hiding.
John McCalleec51cf2010-01-20 00:46:10 +00001860 LookupResult::Filter F = Result.makeFilter();
1861 while (F.hasNext()) {
1862 if (TagDecls.count(F.next()))
1863 F.erase();
1864 }
1865 F.done();
John McCall6e247262009-10-10 05:48:19 +00001866
1867 return true;
1868 }
1869
1870 case LookupResult::AmbiguousReference: {
1871 Diag(NameLoc, diag::err_ambiguous_reference) << Name << LookupRange;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001872
John McCall6e247262009-10-10 05:48:19 +00001873 LookupResult::iterator DI = Result.begin(), DE = Result.end();
1874 for (; DI != DE; ++DI)
1875 Diag((*DI)->getLocation(), diag::note_ambiguous_candidate) << *DI;
John McCallf36e02d2009-10-09 21:13:30 +00001876
John McCall6e247262009-10-10 05:48:19 +00001877 return true;
1878 }
1879 }
1880
Jeffrey Yasskin9f61aa92009-12-12 05:05:38 +00001881 llvm_unreachable("unknown ambiguity kind");
Douglas Gregor7176fff2009-01-15 00:26:24 +00001882}
Douglas Gregorfa047642009-02-04 00:32:51 +00001883
John McCallc7e04da2010-05-28 18:45:08 +00001884namespace {
1885 struct AssociatedLookup {
John McCall42f48fb2012-08-24 20:38:34 +00001886 AssociatedLookup(Sema &S, SourceLocation InstantiationLoc,
John McCallc7e04da2010-05-28 18:45:08 +00001887 Sema::AssociatedNamespaceSet &Namespaces,
1888 Sema::AssociatedClassSet &Classes)
John McCall42f48fb2012-08-24 20:38:34 +00001889 : S(S), Namespaces(Namespaces), Classes(Classes),
1890 InstantiationLoc(InstantiationLoc) {
John McCallc7e04da2010-05-28 18:45:08 +00001891 }
1892
1893 Sema &S;
1894 Sema::AssociatedNamespaceSet &Namespaces;
1895 Sema::AssociatedClassSet &Classes;
John McCall42f48fb2012-08-24 20:38:34 +00001896 SourceLocation InstantiationLoc;
John McCallc7e04da2010-05-28 18:45:08 +00001897 };
1898}
1899
Mike Stump1eb44332009-09-09 15:08:12 +00001900static void
John McCallc7e04da2010-05-28 18:45:08 +00001901addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType T);
John McCall6ff07852009-08-07 22:18:02 +00001902
Douglas Gregor54022952010-04-30 07:08:38 +00001903static void CollectEnclosingNamespace(Sema::AssociatedNamespaceSet &Namespaces,
1904 DeclContext *Ctx) {
1905 // Add the associated namespace for this class.
1906
1907 // We don't use DeclContext::getEnclosingNamespaceContext() as this may
1908 // be a locally scoped record.
1909
Sebastian Redl410c4f22010-08-31 20:53:31 +00001910 // We skip out of inline namespaces. The innermost non-inline namespace
1911 // contains all names of all its nested inline namespaces anyway, so we can
1912 // replace the entire inline namespace tree with its root.
1913 while (Ctx->isRecord() || Ctx->isTransparentContext() ||
1914 Ctx->isInlineNamespace())
Douglas Gregor54022952010-04-30 07:08:38 +00001915 Ctx = Ctx->getParent();
1916
John McCall6ff07852009-08-07 22:18:02 +00001917 if (Ctx->isFileContext())
Douglas Gregor54022952010-04-30 07:08:38 +00001918 Namespaces.insert(Ctx->getPrimaryContext());
John McCall6ff07852009-08-07 22:18:02 +00001919}
Douglas Gregor69be8d62009-07-08 07:51:57 +00001920
Mike Stump1eb44332009-09-09 15:08:12 +00001921// \brief Add the associated classes and namespaces for argument-dependent
Douglas Gregor69be8d62009-07-08 07:51:57 +00001922// lookup that involves a template argument (C++ [basic.lookup.koenig]p2).
Mike Stump1eb44332009-09-09 15:08:12 +00001923static void
John McCallc7e04da2010-05-28 18:45:08 +00001924addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1925 const TemplateArgument &Arg) {
Douglas Gregor69be8d62009-07-08 07:51:57 +00001926 // C++ [basic.lookup.koenig]p2, last bullet:
Mike Stump1eb44332009-09-09 15:08:12 +00001927 // -- [...] ;
Douglas Gregor69be8d62009-07-08 07:51:57 +00001928 switch (Arg.getKind()) {
1929 case TemplateArgument::Null:
1930 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001931
Douglas Gregor69be8d62009-07-08 07:51:57 +00001932 case TemplateArgument::Type:
1933 // [...] the namespaces and classes associated with the types of the
1934 // template arguments provided for template type parameters (excluding
1935 // template template parameters)
John McCallc7e04da2010-05-28 18:45:08 +00001936 addAssociatedClassesAndNamespaces(Result, Arg.getAsType());
Douglas Gregor69be8d62009-07-08 07:51:57 +00001937 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001938
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001939 case TemplateArgument::Template:
Douglas Gregora7fc9012011-01-05 18:58:31 +00001940 case TemplateArgument::TemplateExpansion: {
Mike Stump1eb44332009-09-09 15:08:12 +00001941 // [...] the namespaces in which any template template arguments are
1942 // defined; and the classes in which any member templates used as
Douglas Gregor69be8d62009-07-08 07:51:57 +00001943 // template template arguments are defined.
Douglas Gregora7fc9012011-01-05 18:58:31 +00001944 TemplateName Template = Arg.getAsTemplateOrTemplatePattern();
Mike Stump1eb44332009-09-09 15:08:12 +00001945 if (ClassTemplateDecl *ClassTemplate
Douglas Gregor788cd062009-11-11 01:00:40 +00001946 = dyn_cast<ClassTemplateDecl>(Template.getAsTemplateDecl())) {
Douglas Gregor69be8d62009-07-08 07:51:57 +00001947 DeclContext *Ctx = ClassTemplate->getDeclContext();
1948 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00001949 Result.Classes.insert(EnclosingClass);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001950 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00001951 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001952 }
1953 break;
Douglas Gregor788cd062009-11-11 01:00:40 +00001954 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00001955
Douglas Gregor788cd062009-11-11 01:00:40 +00001956 case TemplateArgument::Declaration:
Douglas Gregor69be8d62009-07-08 07:51:57 +00001957 case TemplateArgument::Integral:
1958 case TemplateArgument::Expression:
Eli Friedmand7a6b162012-09-26 02:36:12 +00001959 case TemplateArgument::NullPtr:
Mike Stump1eb44332009-09-09 15:08:12 +00001960 // [Note: non-type template arguments do not contribute to the set of
Douglas Gregor69be8d62009-07-08 07:51:57 +00001961 // associated namespaces. ]
1962 break;
Mike Stump1eb44332009-09-09 15:08:12 +00001963
Douglas Gregor69be8d62009-07-08 07:51:57 +00001964 case TemplateArgument::Pack:
1965 for (TemplateArgument::pack_iterator P = Arg.pack_begin(),
1966 PEnd = Arg.pack_end();
1967 P != PEnd; ++P)
John McCallc7e04da2010-05-28 18:45:08 +00001968 addAssociatedClassesAndNamespaces(Result, *P);
Douglas Gregor69be8d62009-07-08 07:51:57 +00001969 break;
1970 }
1971}
1972
Douglas Gregorfa047642009-02-04 00:32:51 +00001973// \brief Add the associated classes and namespaces for
Mike Stump1eb44332009-09-09 15:08:12 +00001974// argument-dependent lookup with an argument of class type
1975// (C++ [basic.lookup.koenig]p2).
1976static void
John McCallc7e04da2010-05-28 18:45:08 +00001977addAssociatedClassesAndNamespaces(AssociatedLookup &Result,
1978 CXXRecordDecl *Class) {
1979
1980 // Just silently ignore anything whose name is __va_list_tag.
1981 if (Class->getDeclName() == Result.S.VAListTagName)
1982 return;
1983
Douglas Gregorfa047642009-02-04 00:32:51 +00001984 // C++ [basic.lookup.koenig]p2:
1985 // [...]
1986 // -- If T is a class type (including unions), its associated
1987 // classes are: the class itself; the class of which it is a
1988 // member, if any; and its direct and indirect base
1989 // classes. Its associated namespaces are the namespaces in
Mike Stump1eb44332009-09-09 15:08:12 +00001990 // which its associated classes are defined.
Douglas Gregorfa047642009-02-04 00:32:51 +00001991
1992 // Add the class of which it is a member, if any.
1993 DeclContext *Ctx = Class->getDeclContext();
1994 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00001995 Result.Classes.insert(EnclosingClass);
Douglas Gregorfa047642009-02-04 00:32:51 +00001996 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00001997 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Mike Stump1eb44332009-09-09 15:08:12 +00001998
Douglas Gregorfa047642009-02-04 00:32:51 +00001999 // Add the class itself. If we've already seen this class, we don't
2000 // need to visit base classes.
John McCallc7e04da2010-05-28 18:45:08 +00002001 if (!Result.Classes.insert(Class))
Douglas Gregorfa047642009-02-04 00:32:51 +00002002 return;
2003
Mike Stump1eb44332009-09-09 15:08:12 +00002004 // -- If T is a template-id, its associated namespaces and classes are
2005 // the namespace in which the template is defined; for member
NAKAMURA Takumi00995302011-01-27 07:09:49 +00002006 // templates, the member template's class; the namespaces and classes
Mike Stump1eb44332009-09-09 15:08:12 +00002007 // associated with the types of the template arguments provided for
Douglas Gregor69be8d62009-07-08 07:51:57 +00002008 // template type parameters (excluding template template parameters); the
Mike Stump1eb44332009-09-09 15:08:12 +00002009 // namespaces in which any template template arguments are defined; and
2010 // the classes in which any member templates used as template template
2011 // arguments are defined. [Note: non-type template arguments do not
Douglas Gregor69be8d62009-07-08 07:51:57 +00002012 // contribute to the set of associated namespaces. ]
Mike Stump1eb44332009-09-09 15:08:12 +00002013 if (ClassTemplateSpecializationDecl *Spec
Douglas Gregor69be8d62009-07-08 07:51:57 +00002014 = dyn_cast<ClassTemplateSpecializationDecl>(Class)) {
2015 DeclContext *Ctx = Spec->getSpecializedTemplate()->getDeclContext();
2016 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00002017 Result.Classes.insert(EnclosingClass);
Douglas Gregor69be8d62009-07-08 07:51:57 +00002018 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00002019 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Mike Stump1eb44332009-09-09 15:08:12 +00002020
Douglas Gregor69be8d62009-07-08 07:51:57 +00002021 const TemplateArgumentList &TemplateArgs = Spec->getTemplateArgs();
2022 for (unsigned I = 0, N = TemplateArgs.size(); I != N; ++I)
John McCallc7e04da2010-05-28 18:45:08 +00002023 addAssociatedClassesAndNamespaces(Result, TemplateArgs[I]);
Douglas Gregor69be8d62009-07-08 07:51:57 +00002024 }
Mike Stump1eb44332009-09-09 15:08:12 +00002025
John McCall86ff3082010-02-04 22:26:26 +00002026 // Only recurse into base classes for complete types.
2027 if (!Class->hasDefinition()) {
John McCall42f48fb2012-08-24 20:38:34 +00002028 QualType type = Result.S.Context.getTypeDeclType(Class);
2029 if (Result.S.RequireCompleteType(Result.InstantiationLoc, type,
2030 /*no diagnostic*/ 0))
2031 return;
John McCall86ff3082010-02-04 22:26:26 +00002032 }
2033
Douglas Gregorfa047642009-02-04 00:32:51 +00002034 // Add direct and indirect base classes along with their associated
2035 // namespaces.
Chris Lattner5f9e2722011-07-23 10:55:15 +00002036 SmallVector<CXXRecordDecl *, 32> Bases;
Douglas Gregorfa047642009-02-04 00:32:51 +00002037 Bases.push_back(Class);
2038 while (!Bases.empty()) {
2039 // Pop this class off the stack.
Robert Wilhelm344472e2013-08-23 16:11:15 +00002040 Class = Bases.pop_back_val();
Douglas Gregorfa047642009-02-04 00:32:51 +00002041
2042 // Visit the base classes.
2043 for (CXXRecordDecl::base_class_iterator Base = Class->bases_begin(),
2044 BaseEnd = Class->bases_end();
2045 Base != BaseEnd; ++Base) {
Ted Kremenek6217b802009-07-29 21:53:49 +00002046 const RecordType *BaseType = Base->getType()->getAs<RecordType>();
Sebastian Redlbbc1cc52009-10-25 09:35:33 +00002047 // In dependent contexts, we do ADL twice, and the first time around,
2048 // the base type might be a dependent TemplateSpecializationType, or a
2049 // TemplateTypeParmType. If that happens, simply ignore it.
2050 // FIXME: If we want to support export, we probably need to add the
2051 // namespace of the template in a TemplateSpecializationType, or even
2052 // the classes and namespaces of known non-dependent arguments.
2053 if (!BaseType)
2054 continue;
Douglas Gregorfa047642009-02-04 00:32:51 +00002055 CXXRecordDecl *BaseDecl = cast<CXXRecordDecl>(BaseType->getDecl());
John McCallc7e04da2010-05-28 18:45:08 +00002056 if (Result.Classes.insert(BaseDecl)) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002057 // Find the associated namespace for this base class.
2058 DeclContext *BaseCtx = BaseDecl->getDeclContext();
John McCallc7e04da2010-05-28 18:45:08 +00002059 CollectEnclosingNamespace(Result.Namespaces, BaseCtx);
Douglas Gregorfa047642009-02-04 00:32:51 +00002060
2061 // Make sure we visit the bases of this base class.
2062 if (BaseDecl->bases_begin() != BaseDecl->bases_end())
2063 Bases.push_back(BaseDecl);
2064 }
2065 }
2066 }
2067}
2068
2069// \brief Add the associated classes and namespaces for
2070// argument-dependent lookup with an argument of type T
Mike Stump1eb44332009-09-09 15:08:12 +00002071// (C++ [basic.lookup.koenig]p2).
2072static void
John McCallc7e04da2010-05-28 18:45:08 +00002073addAssociatedClassesAndNamespaces(AssociatedLookup &Result, QualType Ty) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002074 // C++ [basic.lookup.koenig]p2:
2075 //
2076 // For each argument type T in the function call, there is a set
2077 // of zero or more associated namespaces and a set of zero or more
2078 // associated classes to be considered. The sets of namespaces and
2079 // classes is determined entirely by the types of the function
2080 // arguments (and the namespace of any template template
2081 // argument). Typedef names and using-declarations used to specify
2082 // the types do not contribute to this set. The sets of namespaces
2083 // and classes are determined in the following way:
Douglas Gregorfa047642009-02-04 00:32:51 +00002084
Chris Lattner5f9e2722011-07-23 10:55:15 +00002085 SmallVector<const Type *, 16> Queue;
John McCallfa4edcf2010-05-28 06:08:54 +00002086 const Type *T = Ty->getCanonicalTypeInternal().getTypePtr();
2087
Douglas Gregorfa047642009-02-04 00:32:51 +00002088 while (true) {
John McCallfa4edcf2010-05-28 06:08:54 +00002089 switch (T->getTypeClass()) {
2090
2091#define TYPE(Class, Base)
2092#define DEPENDENT_TYPE(Class, Base) case Type::Class:
2093#define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
2094#define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) case Type::Class:
2095#define ABSTRACT_TYPE(Class, Base)
2096#include "clang/AST/TypeNodes.def"
2097 // T is canonical. We can also ignore dependent types because
2098 // we don't need to do ADL at the definition point, but if we
2099 // wanted to implement template export (or if we find some other
2100 // use for associated classes and namespaces...) this would be
2101 // wrong.
Douglas Gregorfa047642009-02-04 00:32:51 +00002102 break;
Douglas Gregorfa047642009-02-04 00:32:51 +00002103
John McCallfa4edcf2010-05-28 06:08:54 +00002104 // -- If T is a pointer to U or an array of U, its associated
2105 // namespaces and classes are those associated with U.
2106 case Type::Pointer:
2107 T = cast<PointerType>(T)->getPointeeType().getTypePtr();
2108 continue;
2109 case Type::ConstantArray:
2110 case Type::IncompleteArray:
2111 case Type::VariableArray:
2112 T = cast<ArrayType>(T)->getElementType().getTypePtr();
2113 continue;
Douglas Gregorfa047642009-02-04 00:32:51 +00002114
John McCallfa4edcf2010-05-28 06:08:54 +00002115 // -- If T is a fundamental type, its associated sets of
2116 // namespaces and classes are both empty.
2117 case Type::Builtin:
2118 break;
2119
2120 // -- If T is a class type (including unions), its associated
2121 // classes are: the class itself; the class of which it is a
2122 // member, if any; and its direct and indirect base
2123 // classes. Its associated namespaces are the namespaces in
2124 // which its associated classes are defined.
2125 case Type::Record: {
2126 CXXRecordDecl *Class
2127 = cast<CXXRecordDecl>(cast<RecordType>(T)->getDecl());
John McCallc7e04da2010-05-28 18:45:08 +00002128 addAssociatedClassesAndNamespaces(Result, Class);
John McCallfa4edcf2010-05-28 06:08:54 +00002129 break;
Douglas Gregorc1efaec2009-02-28 01:32:25 +00002130 }
Douglas Gregor4e58c252010-05-20 02:26:51 +00002131
John McCallfa4edcf2010-05-28 06:08:54 +00002132 // -- If T is an enumeration type, its associated namespace is
2133 // the namespace in which it is defined. If it is class
NAKAMURA Takumi00995302011-01-27 07:09:49 +00002134 // member, its associated class is the member's class; else
John McCallfa4edcf2010-05-28 06:08:54 +00002135 // it has no associated class.
2136 case Type::Enum: {
2137 EnumDecl *Enum = cast<EnumType>(T)->getDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002138
John McCallfa4edcf2010-05-28 06:08:54 +00002139 DeclContext *Ctx = Enum->getDeclContext();
2140 if (CXXRecordDecl *EnclosingClass = dyn_cast<CXXRecordDecl>(Ctx))
John McCallc7e04da2010-05-28 18:45:08 +00002141 Result.Classes.insert(EnclosingClass);
Douglas Gregorfa047642009-02-04 00:32:51 +00002142
John McCallfa4edcf2010-05-28 06:08:54 +00002143 // Add the associated namespace for this class.
John McCallc7e04da2010-05-28 18:45:08 +00002144 CollectEnclosingNamespace(Result.Namespaces, Ctx);
Douglas Gregorfa047642009-02-04 00:32:51 +00002145
John McCallfa4edcf2010-05-28 06:08:54 +00002146 break;
2147 }
2148
2149 // -- If T is a function type, its associated namespaces and
2150 // classes are those associated with the function parameter
2151 // types and those associated with the return type.
2152 case Type::FunctionProto: {
2153 const FunctionProtoType *Proto = cast<FunctionProtoType>(T);
2154 for (FunctionProtoType::arg_type_iterator Arg = Proto->arg_type_begin(),
2155 ArgEnd = Proto->arg_type_end();
2156 Arg != ArgEnd; ++Arg)
2157 Queue.push_back(Arg->getTypePtr());
2158 // fallthrough
2159 }
2160 case Type::FunctionNoProto: {
2161 const FunctionType *FnType = cast<FunctionType>(T);
2162 T = FnType->getResultType().getTypePtr();
2163 continue;
2164 }
2165
2166 // -- If T is a pointer to a member function of a class X, its
2167 // associated namespaces and classes are those associated
2168 // with the function parameter types and return type,
2169 // together with those associated with X.
2170 //
2171 // -- If T is a pointer to a data member of class X, its
2172 // associated namespaces and classes are those associated
2173 // with the member type together with those associated with
2174 // X.
2175 case Type::MemberPointer: {
2176 const MemberPointerType *MemberPtr = cast<MemberPointerType>(T);
2177
2178 // Queue up the class type into which this points.
2179 Queue.push_back(MemberPtr->getClass());
2180
2181 // And directly continue with the pointee type.
2182 T = MemberPtr->getPointeeType().getTypePtr();
2183 continue;
2184 }
2185
2186 // As an extension, treat this like a normal pointer.
2187 case Type::BlockPointer:
2188 T = cast<BlockPointerType>(T)->getPointeeType().getTypePtr();
2189 continue;
2190
2191 // References aren't covered by the standard, but that's such an
2192 // obvious defect that we cover them anyway.
2193 case Type::LValueReference:
2194 case Type::RValueReference:
2195 T = cast<ReferenceType>(T)->getPointeeType().getTypePtr();
2196 continue;
2197
2198 // These are fundamental types.
2199 case Type::Vector:
2200 case Type::ExtVector:
2201 case Type::Complex:
2202 break;
2203
Richard Smithdc7a4f52013-04-30 13:56:41 +00002204 // Non-deduced auto types only get here for error cases.
2205 case Type::Auto:
2206 break;
2207
Douglas Gregorf25760e2011-04-12 01:02:45 +00002208 // If T is an Objective-C object or interface type, or a pointer to an
2209 // object or interface type, the associated namespace is the global
2210 // namespace.
John McCallfa4edcf2010-05-28 06:08:54 +00002211 case Type::ObjCObject:
2212 case Type::ObjCInterface:
2213 case Type::ObjCObjectPointer:
Douglas Gregorf25760e2011-04-12 01:02:45 +00002214 Result.Namespaces.insert(Result.S.Context.getTranslationUnitDecl());
John McCallfa4edcf2010-05-28 06:08:54 +00002215 break;
Eli Friedmanb001de72011-10-06 23:00:33 +00002216
2217 // Atomic types are just wrappers; use the associations of the
2218 // contained type.
2219 case Type::Atomic:
2220 T = cast<AtomicType>(T)->getValueType().getTypePtr();
2221 continue;
John McCallfa4edcf2010-05-28 06:08:54 +00002222 }
2223
Robert Wilhelm344472e2013-08-23 16:11:15 +00002224 if (Queue.empty())
2225 break;
2226 T = Queue.pop_back_val();
Douglas Gregorfa047642009-02-04 00:32:51 +00002227 }
Douglas Gregorfa047642009-02-04 00:32:51 +00002228}
2229
2230/// \brief Find the associated classes and namespaces for
2231/// argument-dependent lookup for a call with the given set of
2232/// arguments.
2233///
2234/// This routine computes the sets of associated classes and associated
Mike Stump1eb44332009-09-09 15:08:12 +00002235/// namespaces searched by argument-dependent lookup
Douglas Gregorfa047642009-02-04 00:32:51 +00002236/// (C++ [basic.lookup.argdep]) for a given set of arguments.
Robert Wilhelm834c0582013-08-09 18:02:13 +00002237void Sema::FindAssociatedClassesAndNamespaces(
2238 SourceLocation InstantiationLoc, ArrayRef<Expr *> Args,
2239 AssociatedNamespaceSet &AssociatedNamespaces,
2240 AssociatedClassSet &AssociatedClasses) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002241 AssociatedNamespaces.clear();
2242 AssociatedClasses.clear();
2243
John McCall42f48fb2012-08-24 20:38:34 +00002244 AssociatedLookup Result(*this, InstantiationLoc,
2245 AssociatedNamespaces, AssociatedClasses);
John McCallc7e04da2010-05-28 18:45:08 +00002246
Douglas Gregorfa047642009-02-04 00:32:51 +00002247 // C++ [basic.lookup.koenig]p2:
2248 // For each argument type T in the function call, there is a set
2249 // of zero or more associated namespaces and a set of zero or more
2250 // associated classes to be considered. The sets of namespaces and
2251 // classes is determined entirely by the types of the function
2252 // arguments (and the namespace of any template template
Mike Stump1eb44332009-09-09 15:08:12 +00002253 // argument).
Ahmed Charles13a140c2012-02-25 11:00:22 +00002254 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
Douglas Gregorfa047642009-02-04 00:32:51 +00002255 Expr *Arg = Args[ArgIdx];
2256
2257 if (Arg->getType() != Context.OverloadTy) {
John McCallc7e04da2010-05-28 18:45:08 +00002258 addAssociatedClassesAndNamespaces(Result, Arg->getType());
Douglas Gregorfa047642009-02-04 00:32:51 +00002259 continue;
2260 }
2261
2262 // [...] In addition, if the argument is the name or address of a
2263 // set of overloaded functions and/or function templates, its
2264 // associated classes and namespaces are the union of those
2265 // associated with each of the members of the set: the namespace
2266 // in which the function or function template is defined and the
2267 // classes and namespaces associated with its (non-dependent)
2268 // parameter types and return type.
Douglas Gregordaa439a2009-07-08 10:57:20 +00002269 Arg = Arg->IgnoreParens();
John McCallba135432009-11-21 08:51:07 +00002270 if (UnaryOperator *unaryOp = dyn_cast<UnaryOperator>(Arg))
John McCall2de56d12010-08-25 11:45:40 +00002271 if (unaryOp->getOpcode() == UO_AddrOf)
John McCallba135432009-11-21 08:51:07 +00002272 Arg = unaryOp->getSubExpr();
Mike Stump1eb44332009-09-09 15:08:12 +00002273
John McCallc7e04da2010-05-28 18:45:08 +00002274 UnresolvedLookupExpr *ULE = dyn_cast<UnresolvedLookupExpr>(Arg);
2275 if (!ULE) continue;
John McCallba135432009-11-21 08:51:07 +00002276
John McCallc7e04da2010-05-28 18:45:08 +00002277 for (UnresolvedSetIterator I = ULE->decls_begin(), E = ULE->decls_end();
2278 I != E; ++I) {
Chandler Carruthbd647292009-12-29 06:17:27 +00002279 // Look through any using declarations to find the underlying function.
2280 NamedDecl *Fn = (*I)->getUnderlyingDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002281
Chandler Carruthbd647292009-12-29 06:17:27 +00002282 FunctionDecl *FDecl = dyn_cast<FunctionDecl>(Fn);
2283 if (!FDecl)
2284 FDecl = cast<FunctionTemplateDecl>(Fn)->getTemplatedDecl();
Douglas Gregorfa047642009-02-04 00:32:51 +00002285
2286 // Add the classes and namespaces associated with the parameter
2287 // types and return type of this function.
John McCallc7e04da2010-05-28 18:45:08 +00002288 addAssociatedClassesAndNamespaces(Result, FDecl->getType());
Douglas Gregorfa047642009-02-04 00:32:51 +00002289 }
2290 }
2291}
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002292
2293/// IsAcceptableNonMemberOperatorCandidate - Determine whether Fn is
2294/// an acceptable non-member overloaded operator for a call whose
2295/// arguments have types T1 (and, if non-empty, T2). This routine
2296/// implements the check in C++ [over.match.oper]p3b2 concerning
2297/// enumeration types.
Mike Stump1eb44332009-09-09 15:08:12 +00002298static bool
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002299IsAcceptableNonMemberOperatorCandidate(FunctionDecl *Fn,
2300 QualType T1, QualType T2,
2301 ASTContext &Context) {
Douglas Gregorba498172009-03-13 21:01:28 +00002302 if (T1->isDependentType() || (!T2.isNull() && T2->isDependentType()))
2303 return true;
2304
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002305 if (T1->isRecordType() || (!T2.isNull() && T2->isRecordType()))
2306 return true;
2307
John McCall183700f2009-09-21 23:43:11 +00002308 const FunctionProtoType *Proto = Fn->getType()->getAs<FunctionProtoType>();
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002309 if (Proto->getNumArgs() < 1)
2310 return false;
2311
2312 if (T1->isEnumeralType()) {
2313 QualType ArgType = Proto->getArgType(0).getNonReferenceType();
Douglas Gregora4923eb2009-11-16 21:35:15 +00002314 if (Context.hasSameUnqualifiedType(T1, ArgType))
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002315 return true;
2316 }
2317
2318 if (Proto->getNumArgs() < 2)
2319 return false;
2320
2321 if (!T2.isNull() && T2->isEnumeralType()) {
2322 QualType ArgType = Proto->getArgType(1).getNonReferenceType();
Douglas Gregora4923eb2009-11-16 21:35:15 +00002323 if (Context.hasSameUnqualifiedType(T2, ArgType))
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002324 return true;
2325 }
2326
2327 return false;
2328}
2329
John McCall7d384dd2009-11-18 07:57:50 +00002330NamedDecl *Sema::LookupSingleName(Scope *S, DeclarationName Name,
Douglas Gregorc83c6872010-04-15 22:33:43 +00002331 SourceLocation Loc,
John McCall7d384dd2009-11-18 07:57:50 +00002332 LookupNameKind NameKind,
2333 RedeclarationKind Redecl) {
Douglas Gregorc83c6872010-04-15 22:33:43 +00002334 LookupResult R(*this, Name, Loc, NameKind, Redecl);
John McCall7d384dd2009-11-18 07:57:50 +00002335 LookupName(R, S);
John McCall1bcee0a2009-12-02 08:25:40 +00002336 return R.getAsSingle<NamedDecl>();
John McCall7d384dd2009-11-18 07:57:50 +00002337}
2338
Douglas Gregor6e378de2009-04-23 23:18:26 +00002339/// \brief Find the protocol with the given name, if any.
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002340ObjCProtocolDecl *Sema::LookupProtocol(IdentifierInfo *II,
Douglas Gregor27c6da22012-01-01 20:30:41 +00002341 SourceLocation IdLoc,
2342 RedeclarationKind Redecl) {
Douglas Gregorc83c6872010-04-15 22:33:43 +00002343 Decl *D = LookupSingleName(TUScope, II, IdLoc,
Douglas Gregor27c6da22012-01-01 20:30:41 +00002344 LookupObjCProtocolName, Redecl);
Douglas Gregor6e378de2009-04-23 23:18:26 +00002345 return cast_or_null<ObjCProtocolDecl>(D);
2346}
2347
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002348void Sema::LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
Mike Stump1eb44332009-09-09 15:08:12 +00002349 QualType T1, QualType T2,
John McCall6e266892010-01-26 03:27:55 +00002350 UnresolvedSetImpl &Functions) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002351 // C++ [over.match.oper]p3:
2352 // -- The set of non-member candidates is the result of the
2353 // unqualified lookup of operator@ in the context of the
2354 // expression according to the usual rules for name lookup in
2355 // unqualified function calls (3.4.2) except that all member
2356 // functions are ignored. However, if no operand has a class
2357 // type, only those non-member functions in the lookup set
Eli Friedman33a31382009-08-05 19:21:58 +00002358 // that have a first parameter of type T1 or "reference to
2359 // (possibly cv-qualified) T1", when T1 is an enumeration
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002360 // type, or (if there is a right operand) a second parameter
Eli Friedman33a31382009-08-05 19:21:58 +00002361 // of type T2 or "reference to (possibly cv-qualified) T2",
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002362 // when T2 is an enumeration type, are candidate functions.
2363 DeclarationName OpName = Context.DeclarationNames.getCXXOperatorName(Op);
John McCalla24dc2e2009-11-17 02:14:36 +00002364 LookupResult Operators(*this, OpName, SourceLocation(), LookupOperatorName);
2365 LookupName(Operators, S);
Mike Stump1eb44332009-09-09 15:08:12 +00002366
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002367 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
2368
John McCallf36e02d2009-10-09 21:13:30 +00002369 if (Operators.empty())
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002370 return;
2371
2372 for (LookupResult::iterator Op = Operators.begin(), OpEnd = Operators.end();
2373 Op != OpEnd; ++Op) {
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002374 NamedDecl *Found = (*Op)->getUnderlyingDecl();
2375 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Found)) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002376 if (IsAcceptableNonMemberOperatorCandidate(FD, T1, T2, Context))
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002377 Functions.addDecl(*Op, Op.getAccess()); // FIXME: canonical FD
Mike Stump1eb44332009-09-09 15:08:12 +00002378 } else if (FunctionTemplateDecl *FunTmpl
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002379 = dyn_cast<FunctionTemplateDecl>(Found)) {
Douglas Gregor364e0212009-06-27 21:05:07 +00002380 // FIXME: friend operators?
Mike Stump1eb44332009-09-09 15:08:12 +00002381 // FIXME: do we need to check IsAcceptableNonMemberOperatorCandidate,
Douglas Gregor364e0212009-06-27 21:05:07 +00002382 // later?
2383 if (!FunTmpl->getDeclContext()->isRecord())
Douglas Gregor6bf356f2010-04-25 20:25:43 +00002384 Functions.addDecl(*Op, Op.getAccess());
Douglas Gregor364e0212009-06-27 21:05:07 +00002385 }
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002386 }
2387}
2388
Sean Huntc39b6bc2011-06-24 02:11:39 +00002389Sema::SpecialMemberOverloadResult *Sema::LookupSpecialMember(CXXRecordDecl *RD,
Sean Hunt308742c2011-06-04 04:32:43 +00002390 CXXSpecialMember SM,
2391 bool ConstArg,
2392 bool VolatileArg,
2393 bool RValueThis,
2394 bool ConstThis,
2395 bool VolatileThis) {
Richard Smithd0adeb62012-11-27 21:20:31 +00002396 assert(CanDeclareSpecialMemberFunction(RD) &&
Sean Hunt308742c2011-06-04 04:32:43 +00002397 "doing special member lookup into record that isn't fully complete");
Richard Smithd0adeb62012-11-27 21:20:31 +00002398 RD = RD->getDefinition();
Sean Hunt308742c2011-06-04 04:32:43 +00002399 if (RValueThis || ConstThis || VolatileThis)
2400 assert((SM == CXXCopyAssignment || SM == CXXMoveAssignment) &&
2401 "constructors and destructors always have unqualified lvalue this");
2402 if (ConstArg || VolatileArg)
2403 assert((SM != CXXDefaultConstructor && SM != CXXDestructor) &&
2404 "parameter-less special members can't have qualified arguments");
2405
2406 llvm::FoldingSetNodeID ID;
Sean Huntc39b6bc2011-06-24 02:11:39 +00002407 ID.AddPointer(RD);
Sean Hunt308742c2011-06-04 04:32:43 +00002408 ID.AddInteger(SM);
2409 ID.AddInteger(ConstArg);
2410 ID.AddInteger(VolatileArg);
2411 ID.AddInteger(RValueThis);
2412 ID.AddInteger(ConstThis);
2413 ID.AddInteger(VolatileThis);
2414
2415 void *InsertPoint;
2416 SpecialMemberOverloadResult *Result =
2417 SpecialMemberCache.FindNodeOrInsertPos(ID, InsertPoint);
2418
2419 // This was already cached
2420 if (Result)
2421 return Result;
2422
Sean Hunt30543582011-06-07 00:11:58 +00002423 Result = BumpAlloc.Allocate<SpecialMemberOverloadResult>();
2424 Result = new (Result) SpecialMemberOverloadResult(ID);
Sean Hunt308742c2011-06-04 04:32:43 +00002425 SpecialMemberCache.InsertNode(Result, InsertPoint);
2426
2427 if (SM == CXXDestructor) {
Richard Smithe5411b72012-12-01 02:35:44 +00002428 if (RD->needsImplicitDestructor())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002429 DeclareImplicitDestructor(RD);
2430 CXXDestructorDecl *DD = RD->getDestructor();
Sean Hunt308742c2011-06-04 04:32:43 +00002431 assert(DD && "record without a destructor");
2432 Result->setMethod(DD);
Richard Smith6c4c36c2012-03-30 20:53:28 +00002433 Result->setKind(DD->isDeleted() ?
2434 SpecialMemberOverloadResult::NoMemberOrDeleted :
Richard Smith704c8f72012-04-20 18:46:14 +00002435 SpecialMemberOverloadResult::Success);
Sean Hunt308742c2011-06-04 04:32:43 +00002436 return Result;
2437 }
2438
Sean Huntb320e0c2011-06-10 03:50:41 +00002439 // Prepare for overload resolution. Here we construct a synthetic argument
2440 // if necessary and make sure that implicit functions are declared.
Sean Huntc39b6bc2011-06-24 02:11:39 +00002441 CanQualType CanTy = Context.getCanonicalType(Context.getTagDeclType(RD));
Sean Huntb320e0c2011-06-10 03:50:41 +00002442 DeclarationName Name;
2443 Expr *Arg = 0;
2444 unsigned NumArgs;
2445
Richard Smith704c8f72012-04-20 18:46:14 +00002446 QualType ArgType = CanTy;
2447 ExprValueKind VK = VK_LValue;
2448
Sean Huntb320e0c2011-06-10 03:50:41 +00002449 if (SM == CXXDefaultConstructor) {
2450 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
2451 NumArgs = 0;
Sean Huntc39b6bc2011-06-24 02:11:39 +00002452 if (RD->needsImplicitDefaultConstructor())
2453 DeclareImplicitDefaultConstructor(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002454 } else {
2455 if (SM == CXXCopyConstructor || SM == CXXMoveConstructor) {
2456 Name = Context.DeclarationNames.getCXXConstructorName(CanTy);
Richard Smithe5411b72012-12-01 02:35:44 +00002457 if (RD->needsImplicitCopyConstructor())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002458 DeclareImplicitCopyConstructor(RD);
Richard Smith80ad52f2013-01-02 11:42:31 +00002459 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002460 DeclareImplicitMoveConstructor(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002461 } else {
2462 Name = Context.DeclarationNames.getCXXOperatorName(OO_Equal);
Richard Smithe5411b72012-12-01 02:35:44 +00002463 if (RD->needsImplicitCopyAssignment())
Sean Huntc39b6bc2011-06-24 02:11:39 +00002464 DeclareImplicitCopyAssignment(RD);
Richard Smith80ad52f2013-01-02 11:42:31 +00002465 if (getLangOpts().CPlusPlus11 && RD->needsImplicitMoveAssignment())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002466 DeclareImplicitMoveAssignment(RD);
Sean Huntb320e0c2011-06-10 03:50:41 +00002467 }
2468
Sean Huntb320e0c2011-06-10 03:50:41 +00002469 if (ConstArg)
2470 ArgType.addConst();
2471 if (VolatileArg)
2472 ArgType.addVolatile();
2473
2474 // This isn't /really/ specified by the standard, but it's implied
2475 // we should be working from an RValue in the case of move to ensure
2476 // that we prefer to bind to rvalue references, and an LValue in the
2477 // case of copy to ensure we don't bind to rvalue references.
2478 // Possibly an XValue is actually correct in the case of move, but
2479 // there is no semantic difference for class types in this restricted
2480 // case.
Sean Huntab183df2011-06-22 22:13:13 +00002481 if (SM == CXXCopyConstructor || SM == CXXCopyAssignment)
Sean Huntb320e0c2011-06-10 03:50:41 +00002482 VK = VK_LValue;
2483 else
2484 VK = VK_RValue;
Richard Smith704c8f72012-04-20 18:46:14 +00002485 }
Sean Huntb320e0c2011-06-10 03:50:41 +00002486
Richard Smith704c8f72012-04-20 18:46:14 +00002487 OpaqueValueExpr FakeArg(SourceLocation(), ArgType, VK);
2488
2489 if (SM != CXXDefaultConstructor) {
Sean Huntb320e0c2011-06-10 03:50:41 +00002490 NumArgs = 1;
Richard Smith704c8f72012-04-20 18:46:14 +00002491 Arg = &FakeArg;
Sean Huntb320e0c2011-06-10 03:50:41 +00002492 }
2493
2494 // Create the object argument
2495 QualType ThisTy = CanTy;
2496 if (ConstThis)
2497 ThisTy.addConst();
2498 if (VolatileThis)
2499 ThisTy.addVolatile();
Sean Hunt4cc12c62011-06-23 00:26:20 +00002500 Expr::Classification Classification =
Richard Smith704c8f72012-04-20 18:46:14 +00002501 OpaqueValueExpr(SourceLocation(), ThisTy,
2502 RValueThis ? VK_RValue : VK_LValue).Classify(Context);
Sean Huntb320e0c2011-06-10 03:50:41 +00002503
2504 // Now we perform lookup on the name we computed earlier and do overload
2505 // resolution. Lookup is only performed directly into the class since there
2506 // will always be a (possibly implicit) declaration to shadow any others.
2507 OverloadCandidateSet OCS((SourceLocation()));
David Blaikie3bc93e32012-12-19 00:45:41 +00002508 DeclContext::lookup_result R = RD->lookup(Name);
David Blaikie3bc93e32012-12-19 00:45:41 +00002509 assert(!R.empty() &&
Sean Huntb320e0c2011-06-10 03:50:41 +00002510 "lookup for a constructor or assignment operator was empty");
Chandler Carruthab4e0c02013-08-18 07:20:52 +00002511
2512 // Copy the candidates as our processing of them may load new declarations
2513 // from an external source and invalidate lookup_result.
2514 SmallVector<NamedDecl *, 8> Candidates(R.begin(), R.end());
2515
2516 for (SmallVectorImpl<NamedDecl *>::iterator I = Candidates.begin(),
2517 E = Candidates.end();
2518 I != E; ++I) {
2519 NamedDecl *Cand = *I;
Sean Hunt4cc12c62011-06-23 00:26:20 +00002520
Sean Huntc39b6bc2011-06-24 02:11:39 +00002521 if (Cand->isInvalidDecl())
Sean Huntb320e0c2011-06-10 03:50:41 +00002522 continue;
2523
Sean Huntc39b6bc2011-06-24 02:11:39 +00002524 if (UsingShadowDecl *U = dyn_cast<UsingShadowDecl>(Cand)) {
2525 // FIXME: [namespace.udecl]p15 says that we should only consider a
2526 // using declaration here if it does not match a declaration in the
2527 // derived class. We do not implement this correctly in other cases
2528 // either.
2529 Cand = U->getTargetDecl();
2530
2531 if (Cand->isInvalidDecl())
2532 continue;
2533 }
2534
2535 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand)) {
Sean Hunt4cc12c62011-06-23 00:26:20 +00002536 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
Sean Huntc39b6bc2011-06-24 02:11:39 +00002537 AddMethodCandidate(M, DeclAccessPair::make(M, AS_public), RD, ThisTy,
Ahmed Charles13a140c2012-02-25 11:00:22 +00002538 Classification, llvm::makeArrayRef(&Arg, NumArgs),
2539 OCS, true);
Sean Hunt4cc12c62011-06-23 00:26:20 +00002540 else
Ahmed Charles13a140c2012-02-25 11:00:22 +00002541 AddOverloadCandidate(M, DeclAccessPair::make(M, AS_public),
2542 llvm::makeArrayRef(&Arg, NumArgs), OCS, true);
Sean Hunt431a1cb2011-06-22 02:58:46 +00002543 } else if (FunctionTemplateDecl *Tmpl =
Sean Huntc39b6bc2011-06-24 02:11:39 +00002544 dyn_cast<FunctionTemplateDecl>(Cand)) {
Sean Hunt4cc12c62011-06-23 00:26:20 +00002545 if (SM == CXXCopyAssignment || SM == CXXMoveAssignment)
2546 AddMethodTemplateCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
Ahmed Charles13a140c2012-02-25 11:00:22 +00002547 RD, 0, ThisTy, Classification,
2548 llvm::makeArrayRef(&Arg, NumArgs),
Sean Hunt4cc12c62011-06-23 00:26:20 +00002549 OCS, true);
2550 else
2551 AddTemplateOverloadCandidate(Tmpl, DeclAccessPair::make(Tmpl, AS_public),
Ahmed Charles13a140c2012-02-25 11:00:22 +00002552 0, llvm::makeArrayRef(&Arg, NumArgs),
2553 OCS, true);
Sean Huntc39b6bc2011-06-24 02:11:39 +00002554 } else {
2555 assert(isa<UsingDecl>(Cand) && "illegal Kind of operator = Decl");
Sean Huntb320e0c2011-06-10 03:50:41 +00002556 }
2557 }
2558
2559 OverloadCandidateSet::iterator Best;
2560 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2561 case OR_Success:
2562 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
Richard Smith704c8f72012-04-20 18:46:14 +00002563 Result->setKind(SpecialMemberOverloadResult::Success);
Sean Huntb320e0c2011-06-10 03:50:41 +00002564 break;
2565
2566 case OR_Deleted:
2567 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
Richard Smith6c4c36c2012-03-30 20:53:28 +00002568 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
Sean Huntb320e0c2011-06-10 03:50:41 +00002569 break;
2570
2571 case OR_Ambiguous:
Richard Smith6c4c36c2012-03-30 20:53:28 +00002572 Result->setMethod(0);
2573 Result->setKind(SpecialMemberOverloadResult::Ambiguous);
2574 break;
2575
Sean Huntb320e0c2011-06-10 03:50:41 +00002576 case OR_No_Viable_Function:
2577 Result->setMethod(0);
Richard Smith6c4c36c2012-03-30 20:53:28 +00002578 Result->setKind(SpecialMemberOverloadResult::NoMemberOrDeleted);
Sean Huntb320e0c2011-06-10 03:50:41 +00002579 break;
2580 }
2581
2582 return Result;
2583}
2584
2585/// \brief Look up the default constructor for the given class.
2586CXXConstructorDecl *Sema::LookupDefaultConstructor(CXXRecordDecl *Class) {
Sean Huntc530d172011-06-10 04:44:37 +00002587 SpecialMemberOverloadResult *Result =
Sean Huntb320e0c2011-06-10 03:50:41 +00002588 LookupSpecialMember(Class, CXXDefaultConstructor, false, false, false,
2589 false, false);
2590
2591 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
Sean Hunt308742c2011-06-04 04:32:43 +00002592}
2593
Sean Hunt661c67a2011-06-21 23:42:56 +00002594/// \brief Look up the copying constructor for the given class.
2595CXXConstructorDecl *Sema::LookupCopyingConstructor(CXXRecordDecl *Class,
Richard Smith704c8f72012-04-20 18:46:14 +00002596 unsigned Quals) {
Sean Huntc530d172011-06-10 04:44:37 +00002597 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2598 "non-const, non-volatile qualifiers for copy ctor arg");
2599 SpecialMemberOverloadResult *Result =
2600 LookupSpecialMember(Class, CXXCopyConstructor, Quals & Qualifiers::Const,
2601 Quals & Qualifiers::Volatile, false, false, false);
2602
Sean Huntc530d172011-06-10 04:44:37 +00002603 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2604}
2605
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002606/// \brief Look up the moving constructor for the given class.
Richard Smith6a06e5f2012-07-18 03:36:00 +00002607CXXConstructorDecl *Sema::LookupMovingConstructor(CXXRecordDecl *Class,
2608 unsigned Quals) {
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002609 SpecialMemberOverloadResult *Result =
Richard Smith6a06e5f2012-07-18 03:36:00 +00002610 LookupSpecialMember(Class, CXXMoveConstructor, Quals & Qualifiers::Const,
2611 Quals & Qualifiers::Volatile, false, false, false);
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002612
2613 return cast_or_null<CXXConstructorDecl>(Result->getMethod());
2614}
2615
Douglas Gregore5eee5a2010-07-02 23:12:18 +00002616/// \brief Look up the constructors for the given class.
2617DeclContext::lookup_result Sema::LookupConstructors(CXXRecordDecl *Class) {
Sean Huntb320e0c2011-06-10 03:50:41 +00002618 // If the implicit constructors have not yet been declared, do so now.
Richard Smithd0adeb62012-11-27 21:20:31 +00002619 if (CanDeclareSpecialMemberFunction(Class)) {
Sean Huntcdee3fe2011-05-11 22:34:38 +00002620 if (Class->needsImplicitDefaultConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +00002621 DeclareImplicitDefaultConstructor(Class);
Richard Smithe5411b72012-12-01 02:35:44 +00002622 if (Class->needsImplicitCopyConstructor())
Douglas Gregor18274032010-07-03 00:47:00 +00002623 DeclareImplicitCopyConstructor(Class);
Richard Smith80ad52f2013-01-02 11:42:31 +00002624 if (getLangOpts().CPlusPlus11 && Class->needsImplicitMoveConstructor())
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002625 DeclareImplicitMoveConstructor(Class);
Douglas Gregor18274032010-07-03 00:47:00 +00002626 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002627
Douglas Gregore5eee5a2010-07-02 23:12:18 +00002628 CanQualType T = Context.getCanonicalType(Context.getTypeDeclType(Class));
2629 DeclarationName Name = Context.DeclarationNames.getCXXConstructorName(T);
2630 return Class->lookup(Name);
2631}
2632
Sean Hunt661c67a2011-06-21 23:42:56 +00002633/// \brief Look up the copying assignment operator for the given class.
2634CXXMethodDecl *Sema::LookupCopyingAssignment(CXXRecordDecl *Class,
2635 unsigned Quals, bool RValueThis,
Richard Smith704c8f72012-04-20 18:46:14 +00002636 unsigned ThisQuals) {
Sean Hunt661c67a2011-06-21 23:42:56 +00002637 assert(!(Quals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2638 "non-const, non-volatile qualifiers for copy assignment arg");
2639 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2640 "non-const, non-volatile qualifiers for copy assignment this");
2641 SpecialMemberOverloadResult *Result =
2642 LookupSpecialMember(Class, CXXCopyAssignment, Quals & Qualifiers::Const,
2643 Quals & Qualifiers::Volatile, RValueThis,
2644 ThisQuals & Qualifiers::Const,
2645 ThisQuals & Qualifiers::Volatile);
2646
Sean Hunt661c67a2011-06-21 23:42:56 +00002647 return Result->getMethod();
2648}
2649
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002650/// \brief Look up the moving assignment operator for the given class.
2651CXXMethodDecl *Sema::LookupMovingAssignment(CXXRecordDecl *Class,
Richard Smith6a06e5f2012-07-18 03:36:00 +00002652 unsigned Quals,
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002653 bool RValueThis,
2654 unsigned ThisQuals) {
2655 assert(!(ThisQuals & ~(Qualifiers::Const | Qualifiers::Volatile)) &&
2656 "non-const, non-volatile qualifiers for copy assignment this");
2657 SpecialMemberOverloadResult *Result =
Richard Smith6a06e5f2012-07-18 03:36:00 +00002658 LookupSpecialMember(Class, CXXMoveAssignment, Quals & Qualifiers::Const,
2659 Quals & Qualifiers::Volatile, RValueThis,
Sebastian Redl85ea7aa2011-08-30 19:58:05 +00002660 ThisQuals & Qualifiers::Const,
2661 ThisQuals & Qualifiers::Volatile);
2662
2663 return Result->getMethod();
2664}
2665
Douglas Gregordb89f282010-07-01 22:47:18 +00002666/// \brief Look for the destructor of the given class.
2667///
Sean Huntc5c9b532011-06-03 21:10:40 +00002668/// During semantic analysis, this routine should be used in lieu of
2669/// CXXRecordDecl::getDestructor().
Douglas Gregordb89f282010-07-01 22:47:18 +00002670///
2671/// \returns The destructor for this class.
2672CXXDestructorDecl *Sema::LookupDestructor(CXXRecordDecl *Class) {
Sean Hunt308742c2011-06-04 04:32:43 +00002673 return cast<CXXDestructorDecl>(LookupSpecialMember(Class, CXXDestructor,
2674 false, false, false,
2675 false, false)->getMethod());
Douglas Gregordb89f282010-07-01 22:47:18 +00002676}
2677
Richard Smith36f5cfe2012-03-09 08:00:36 +00002678/// LookupLiteralOperator - Determine which literal operator should be used for
2679/// a user-defined literal, per C++11 [lex.ext].
2680///
2681/// Normal overload resolution is not used to select which literal operator to
2682/// call for a user-defined literal. Look up the provided literal operator name,
2683/// and filter the results to the appropriate set for the given argument types.
2684Sema::LiteralOperatorLookupResult
2685Sema::LookupLiteralOperator(Scope *S, LookupResult &R,
2686 ArrayRef<QualType> ArgTys,
2687 bool AllowRawAndTemplate) {
2688 LookupName(R, S);
2689 assert(R.getResultKind() != LookupResult::Ambiguous &&
2690 "literal operator lookup can't be ambiguous");
2691
2692 // Filter the lookup results appropriately.
2693 LookupResult::Filter F = R.makeFilter();
2694
2695 bool FoundTemplate = false;
2696 bool FoundRaw = false;
2697 bool FoundExactMatch = false;
2698
2699 while (F.hasNext()) {
2700 Decl *D = F.next();
2701 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2702 D = USD->getTargetDecl();
2703
2704 bool IsTemplate = isa<FunctionTemplateDecl>(D);
2705 bool IsRaw = false;
2706 bool IsExactMatch = false;
2707
Douglas Gregor7e0c2272013-04-10 05:18:00 +00002708 // If the declaration we found is invalid, skip it.
2709 if (D->isInvalidDecl()) {
2710 F.erase();
2711 continue;
2712 }
2713
Richard Smith36f5cfe2012-03-09 08:00:36 +00002714 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
2715 if (FD->getNumParams() == 1 &&
2716 FD->getParamDecl(0)->getType()->getAs<PointerType>())
2717 IsRaw = true;
Richard Smitha121eb32013-01-15 07:12:59 +00002718 else if (FD->getNumParams() == ArgTys.size()) {
Richard Smith36f5cfe2012-03-09 08:00:36 +00002719 IsExactMatch = true;
2720 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
2721 QualType ParamTy = FD->getParamDecl(ArgIdx)->getType();
2722 if (!Context.hasSameUnqualifiedType(ArgTys[ArgIdx], ParamTy)) {
2723 IsExactMatch = false;
2724 break;
2725 }
2726 }
2727 }
2728 }
2729
2730 if (IsExactMatch) {
2731 FoundExactMatch = true;
2732 AllowRawAndTemplate = false;
2733 if (FoundRaw || FoundTemplate) {
2734 // Go through again and remove the raw and template decls we've
2735 // already found.
2736 F.restart();
2737 FoundRaw = FoundTemplate = false;
2738 }
2739 } else if (AllowRawAndTemplate && (IsTemplate || IsRaw)) {
2740 FoundTemplate |= IsTemplate;
2741 FoundRaw |= IsRaw;
2742 } else {
2743 F.erase();
2744 }
2745 }
2746
2747 F.done();
2748
2749 // C++11 [lex.ext]p3, p4: If S contains a literal operator with a matching
2750 // parameter type, that is used in preference to a raw literal operator
2751 // or literal operator template.
2752 if (FoundExactMatch)
2753 return LOLR_Cooked;
2754
2755 // C++11 [lex.ext]p3, p4: S shall contain a raw literal operator or a literal
2756 // operator template, but not both.
2757 if (FoundRaw && FoundTemplate) {
2758 Diag(R.getNameLoc(), diag::err_ovl_ambiguous_call) << R.getLookupName();
2759 for (LookupResult::iterator I = R.begin(), E = R.end(); I != E; ++I) {
2760 Decl *D = *I;
2761 if (UsingShadowDecl *USD = dyn_cast<UsingShadowDecl>(D))
2762 D = USD->getTargetDecl();
2763 if (FunctionTemplateDecl *FunTmpl = dyn_cast<FunctionTemplateDecl>(D))
2764 D = FunTmpl->getTemplatedDecl();
2765 NoteOverloadCandidate(cast<FunctionDecl>(D));
2766 }
2767 return LOLR_Error;
2768 }
2769
2770 if (FoundRaw)
2771 return LOLR_Raw;
2772
2773 if (FoundTemplate)
2774 return LOLR_Template;
2775
2776 // Didn't find anything we could use.
2777 Diag(R.getNameLoc(), diag::err_ovl_no_viable_literal_operator)
2778 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
2779 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRawAndTemplate;
2780 return LOLR_Error;
2781}
2782
John McCall7edb5fd2010-01-26 07:16:45 +00002783void ADLResult::insert(NamedDecl *New) {
2784 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
2785
2786 // If we haven't yet seen a decl for this key, or the last decl
2787 // was exactly this one, we're done.
2788 if (Old == 0 || Old == New) {
2789 Old = New;
2790 return;
2791 }
2792
2793 // Otherwise, decide which is a more recent redeclaration.
2794 FunctionDecl *OldFD, *NewFD;
2795 if (isa<FunctionTemplateDecl>(New)) {
2796 OldFD = cast<FunctionTemplateDecl>(Old)->getTemplatedDecl();
2797 NewFD = cast<FunctionTemplateDecl>(New)->getTemplatedDecl();
2798 } else {
2799 OldFD = cast<FunctionDecl>(Old);
2800 NewFD = cast<FunctionDecl>(New);
2801 }
2802
2803 FunctionDecl *Cursor = NewFD;
2804 while (true) {
Douglas Gregoref96ee02012-01-14 16:38:05 +00002805 Cursor = Cursor->getPreviousDecl();
John McCall7edb5fd2010-01-26 07:16:45 +00002806
2807 // If we got to the end without finding OldFD, OldFD is the newer
2808 // declaration; leave things as they are.
2809 if (!Cursor) return;
2810
2811 // If we do find OldFD, then NewFD is newer.
2812 if (Cursor == OldFD) break;
2813
2814 // Otherwise, keep looking.
2815 }
2816
2817 Old = New;
2818}
2819
Sebastian Redl644be852009-10-23 19:23:15 +00002820void Sema::ArgumentDependentLookup(DeclarationName Name, bool Operator,
Robert Wilhelm834c0582013-08-09 18:02:13 +00002821 SourceLocation Loc, ArrayRef<Expr *> Args,
Richard Smithb1502bc2012-10-18 17:56:02 +00002822 ADLResult &Result) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002823 // Find all of the associated namespaces and classes based on the
2824 // arguments we have.
2825 AssociatedNamespaceSet AssociatedNamespaces;
2826 AssociatedClassSet AssociatedClasses;
John McCall42f48fb2012-08-24 20:38:34 +00002827 FindAssociatedClassesAndNamespaces(Loc, Args,
John McCall6ff07852009-08-07 22:18:02 +00002828 AssociatedNamespaces,
2829 AssociatedClasses);
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002830
Sebastian Redl644be852009-10-23 19:23:15 +00002831 QualType T1, T2;
2832 if (Operator) {
2833 T1 = Args[0]->getType();
Ahmed Charles13a140c2012-02-25 11:00:22 +00002834 if (Args.size() >= 2)
Sebastian Redl644be852009-10-23 19:23:15 +00002835 T2 = Args[1]->getType();
2836 }
2837
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002838 // C++ [basic.lookup.argdep]p3:
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002839 // Let X be the lookup set produced by unqualified lookup (3.4.1)
2840 // and let Y be the lookup set produced by argument dependent
2841 // lookup (defined as follows). If X contains [...] then Y is
2842 // empty. Otherwise Y is the set of declarations found in the
2843 // namespaces associated with the argument types as described
2844 // below. The set of declarations found by the lookup of the name
2845 // is the union of X and Y.
2846 //
2847 // Here, we compute Y and add its members to the overloaded
2848 // candidate set.
2849 for (AssociatedNamespaceSet::iterator NS = AssociatedNamespaces.begin(),
Mike Stump1eb44332009-09-09 15:08:12 +00002850 NSEnd = AssociatedNamespaces.end();
2851 NS != NSEnd; ++NS) {
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002852 // When considering an associated namespace, the lookup is the
2853 // same as the lookup performed when the associated namespace is
2854 // used as a qualifier (3.4.3.2) except that:
2855 //
2856 // -- Any using-directives in the associated namespace are
2857 // ignored.
2858 //
John McCall6ff07852009-08-07 22:18:02 +00002859 // -- Any namespace-scope friend functions declared in
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002860 // associated classes are visible within their respective
2861 // namespaces even if they are not visible during an ordinary
2862 // lookup (11.4).
David Blaikie3bc93e32012-12-19 00:45:41 +00002863 DeclContext::lookup_result R = (*NS)->lookup(Name);
2864 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
2865 ++I) {
John McCall6e266892010-01-26 03:27:55 +00002866 NamedDecl *D = *I;
John McCall02cace72009-08-28 07:59:38 +00002867 // If the only declaration here is an ordinary friend, consider
2868 // it only if it was declared in an associated classes.
2869 if (D->getIdentifierNamespace() == Decl::IDNS_OrdinaryFriend) {
Richard Smith22050f22013-07-17 23:53:16 +00002870 bool DeclaredInAssociatedClass = false;
2871 for (Decl *DI = D; DI; DI = DI->getPreviousDecl()) {
2872 DeclContext *LexDC = DI->getLexicalDeclContext();
2873 if (isa<CXXRecordDecl>(LexDC) &&
2874 AssociatedClasses.count(cast<CXXRecordDecl>(LexDC))) {
2875 DeclaredInAssociatedClass = true;
2876 break;
2877 }
2878 }
2879 if (!DeclaredInAssociatedClass)
John McCall3f9a8a62009-08-11 06:59:38 +00002880 continue;
2881 }
Mike Stump1eb44332009-09-09 15:08:12 +00002882
John McCalla113e722010-01-26 06:04:06 +00002883 if (isa<UsingShadowDecl>(D))
2884 D = cast<UsingShadowDecl>(D)->getTargetDecl();
John McCall6e266892010-01-26 03:27:55 +00002885
John McCalla113e722010-01-26 06:04:06 +00002886 if (isa<FunctionDecl>(D)) {
2887 if (Operator &&
2888 !IsAcceptableNonMemberOperatorCandidate(cast<FunctionDecl>(D),
2889 T1, T2, Context))
2890 continue;
John McCall7edb5fd2010-01-26 07:16:45 +00002891 } else if (!isa<FunctionTemplateDecl>(D))
2892 continue;
2893
2894 Result.insert(D);
Douglas Gregor44bc2d52009-06-23 20:14:09 +00002895 }
2896 }
Douglas Gregor3fd95ce2009-03-13 00:33:25 +00002897}
Douglas Gregor546be3c2009-12-30 17:04:44 +00002898
2899//----------------------------------------------------------------------------
2900// Search for all visible declarations.
2901//----------------------------------------------------------------------------
2902VisibleDeclConsumer::~VisibleDeclConsumer() { }
2903
Richard Smithd67679d2013-08-20 20:35:18 +00002904bool VisibleDeclConsumer::includeHiddenDecls() const { return false; }
2905
Douglas Gregor546be3c2009-12-30 17:04:44 +00002906namespace {
2907
2908class ShadowContextRAII;
2909
2910class VisibleDeclsRecord {
2911public:
2912 /// \brief An entry in the shadow map, which is optimized to store a
2913 /// single declaration (the common case) but can also store a list
2914 /// of declarations.
Chris Lattnerb5f65472011-07-18 01:54:02 +00002915 typedef llvm::TinyPtrVector<NamedDecl*> ShadowMapEntry;
Douglas Gregor546be3c2009-12-30 17:04:44 +00002916
2917private:
2918 /// \brief A mapping from declaration names to the declarations that have
2919 /// this name within a particular scope.
2920 typedef llvm::DenseMap<DeclarationName, ShadowMapEntry> ShadowMap;
2921
2922 /// \brief A list of shadow maps, which is used to model name hiding.
2923 std::list<ShadowMap> ShadowMaps;
2924
2925 /// \brief The declaration contexts we have already visited.
2926 llvm::SmallPtrSet<DeclContext *, 8> VisitedContexts;
2927
2928 friend class ShadowContextRAII;
2929
2930public:
2931 /// \brief Determine whether we have already visited this context
2932 /// (and, if not, note that we are going to visit that context now).
2933 bool visitedContext(DeclContext *Ctx) {
2934 return !VisitedContexts.insert(Ctx);
2935 }
2936
Douglas Gregor8071e422010-08-15 06:18:01 +00002937 bool alreadyVisitedContext(DeclContext *Ctx) {
2938 return VisitedContexts.count(Ctx);
2939 }
2940
Douglas Gregor546be3c2009-12-30 17:04:44 +00002941 /// \brief Determine whether the given declaration is hidden in the
2942 /// current scope.
2943 ///
2944 /// \returns the declaration that hides the given declaration, or
2945 /// NULL if no such declaration exists.
2946 NamedDecl *checkHidden(NamedDecl *ND);
2947
2948 /// \brief Add a declaration to the current shadow map.
Chris Lattnerb5f65472011-07-18 01:54:02 +00002949 void add(NamedDecl *ND) {
2950 ShadowMaps.back()[ND->getDeclName()].push_back(ND);
2951 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00002952};
2953
2954/// \brief RAII object that records when we've entered a shadow context.
2955class ShadowContextRAII {
2956 VisibleDeclsRecord &Visible;
2957
2958 typedef VisibleDeclsRecord::ShadowMap ShadowMap;
2959
2960public:
2961 ShadowContextRAII(VisibleDeclsRecord &Visible) : Visible(Visible) {
2962 Visible.ShadowMaps.push_back(ShadowMap());
2963 }
2964
2965 ~ShadowContextRAII() {
Douglas Gregor546be3c2009-12-30 17:04:44 +00002966 Visible.ShadowMaps.pop_back();
2967 }
2968};
2969
2970} // end anonymous namespace
2971
Douglas Gregor546be3c2009-12-30 17:04:44 +00002972NamedDecl *VisibleDeclsRecord::checkHidden(NamedDecl *ND) {
Douglas Gregorefcf16d2010-01-14 00:06:47 +00002973 // Look through using declarations.
2974 ND = ND->getUnderlyingDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002975
Douglas Gregor546be3c2009-12-30 17:04:44 +00002976 unsigned IDNS = ND->getIdentifierNamespace();
2977 std::list<ShadowMap>::reverse_iterator SM = ShadowMaps.rbegin();
2978 for (std::list<ShadowMap>::reverse_iterator SMEnd = ShadowMaps.rend();
2979 SM != SMEnd; ++SM) {
2980 ShadowMap::iterator Pos = SM->find(ND->getDeclName());
2981 if (Pos == SM->end())
2982 continue;
2983
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002984 for (ShadowMapEntry::iterator I = Pos->second.begin(),
Douglas Gregor546be3c2009-12-30 17:04:44 +00002985 IEnd = Pos->second.end();
2986 I != IEnd; ++I) {
2987 // A tag declaration does not hide a non-tag declaration.
John McCall0d6b1642010-04-23 18:46:30 +00002988 if ((*I)->hasTagIdentifierNamespace() &&
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00002989 (IDNS & (Decl::IDNS_Member | Decl::IDNS_Ordinary |
Douglas Gregor546be3c2009-12-30 17:04:44 +00002990 Decl::IDNS_ObjCProtocol)))
2991 continue;
2992
2993 // Protocols are in distinct namespaces from everything else.
2994 if ((((*I)->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol)
2995 || (IDNS & Decl::IDNS_ObjCProtocol)) &&
2996 (*I)->getIdentifierNamespace() != IDNS)
2997 continue;
2998
Douglas Gregor0cc84042010-01-14 15:47:35 +00002999 // Functions and function templates in the same scope overload
3000 // rather than hide. FIXME: Look for hiding based on function
3001 // signatures!
Douglas Gregordef91072010-01-14 03:35:48 +00003002 if ((*I)->isFunctionOrFunctionTemplate() &&
Douglas Gregor0cc84042010-01-14 15:47:35 +00003003 ND->isFunctionOrFunctionTemplate() &&
3004 SM == ShadowMaps.rbegin())
Douglas Gregordef91072010-01-14 03:35:48 +00003005 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003006
Douglas Gregor546be3c2009-12-30 17:04:44 +00003007 // We've found a declaration that hides this one.
3008 return *I;
3009 }
3010 }
3011
3012 return 0;
3013}
3014
3015static void LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result,
3016 bool QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003017 bool InBaseClass,
Douglas Gregor546be3c2009-12-30 17:04:44 +00003018 VisibleDeclConsumer &Consumer,
3019 VisibleDeclsRecord &Visited) {
Douglas Gregor62021192010-02-04 23:42:48 +00003020 if (!Ctx)
3021 return;
3022
Douglas Gregor546be3c2009-12-30 17:04:44 +00003023 // Make sure we don't visit the same context twice.
3024 if (Visited.visitedContext(Ctx->getPrimaryContext()))
3025 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003026
Douglas Gregor4923aa22010-07-02 20:37:36 +00003027 if (CXXRecordDecl *Class = dyn_cast<CXXRecordDecl>(Ctx))
3028 Result.getSema().ForceDeclarationOfImplicitMembers(Class);
3029
Douglas Gregor546be3c2009-12-30 17:04:44 +00003030 // Enumerate all of the results in this context.
Nick Lewycky173a37a2012-04-03 21:44:08 +00003031 for (DeclContext::all_lookups_iterator L = Ctx->lookups_begin(),
3032 LEnd = Ctx->lookups_end();
3033 L != LEnd; ++L) {
David Blaikie3bc93e32012-12-19 00:45:41 +00003034 DeclContext::lookup_result R = *L;
3035 for (DeclContext::lookup_iterator I = R.begin(), E = R.end(); I != E;
3036 ++I) {
3037 if (NamedDecl *ND = dyn_cast<NamedDecl>(*I)) {
Douglas Gregor55368912011-12-14 16:03:29 +00003038 if ((ND = Result.getAcceptableDecl(ND))) {
Erik Verbruggend1205962011-10-06 07:27:49 +00003039 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003040 Visited.add(ND);
3041 }
Douglas Gregor70c23352010-12-09 21:44:02 +00003042 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003043 }
3044 }
3045
3046 // Traverse using directives for qualified name lookup.
3047 if (QualifiedNameLookup) {
3048 ShadowContextRAII Shadow(Visited);
3049 DeclContext::udir_iterator I, E;
3050 for (llvm::tie(I, E) = Ctx->getUsingDirectives(); I != E; ++I) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003051 LookupVisibleDecls((*I)->getNominatedNamespace(), Result,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003052 QualifiedNameLookup, InBaseClass, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003053 }
3054 }
3055
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003056 // Traverse the contexts of inherited C++ classes.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003057 if (CXXRecordDecl *Record = dyn_cast<CXXRecordDecl>(Ctx)) {
John McCall86ff3082010-02-04 22:26:26 +00003058 if (!Record->hasDefinition())
3059 return;
3060
Douglas Gregor546be3c2009-12-30 17:04:44 +00003061 for (CXXRecordDecl::base_class_iterator B = Record->bases_begin(),
3062 BEnd = Record->bases_end();
3063 B != BEnd; ++B) {
3064 QualType BaseType = B->getType();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003065
Douglas Gregor546be3c2009-12-30 17:04:44 +00003066 // Don't look into dependent bases, because name lookup can't look
3067 // there anyway.
3068 if (BaseType->isDependentType())
3069 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003070
Douglas Gregor546be3c2009-12-30 17:04:44 +00003071 const RecordType *Record = BaseType->getAs<RecordType>();
3072 if (!Record)
3073 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003074
Douglas Gregor546be3c2009-12-30 17:04:44 +00003075 // FIXME: It would be nice to be able to determine whether referencing
3076 // a particular member would be ambiguous. For example, given
3077 //
3078 // struct A { int member; };
3079 // struct B { int member; };
3080 // struct C : A, B { };
3081 //
3082 // void f(C *c) { c->### }
3083 //
3084 // accessing 'member' would result in an ambiguity. However, we
3085 // could be smart enough to qualify the member with the base
3086 // class, e.g.,
3087 //
3088 // c->B::member
3089 //
3090 // or
3091 //
3092 // c->A::member
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003093
Douglas Gregor546be3c2009-12-30 17:04:44 +00003094 // Find results in this base class (and its bases).
3095 ShadowContextRAII Shadow(Visited);
3096 LookupVisibleDecls(Record->getDecl(), Result, QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003097 true, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003098 }
3099 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003100
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003101 // Traverse the contexts of Objective-C classes.
3102 if (ObjCInterfaceDecl *IFace = dyn_cast<ObjCInterfaceDecl>(Ctx)) {
3103 // Traverse categories.
Douglas Gregord3297242013-01-16 23:00:23 +00003104 for (ObjCInterfaceDecl::visible_categories_iterator
3105 Cat = IFace->visible_categories_begin(),
3106 CatEnd = IFace->visible_categories_end();
3107 Cat != CatEnd; ++Cat) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003108 ShadowContextRAII Shadow(Visited);
Douglas Gregord3297242013-01-16 23:00:23 +00003109 LookupVisibleDecls(*Cat, Result, QualifiedNameLookup, false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003110 Consumer, Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003111 }
3112
3113 // Traverse protocols.
Ted Kremenek53b94412010-09-01 01:21:15 +00003114 for (ObjCInterfaceDecl::all_protocol_iterator
3115 I = IFace->all_referenced_protocol_begin(),
3116 E = IFace->all_referenced_protocol_end(); I != E; ++I) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003117 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003118 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003119 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003120 }
3121
3122 // Traverse the superclass.
3123 if (IFace->getSuperClass()) {
3124 ShadowContextRAII Shadow(Visited);
3125 LookupVisibleDecls(IFace->getSuperClass(), Result, QualifiedNameLookup,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003126 true, Consumer, Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003127 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003128
Douglas Gregorc220a182010-04-19 18:02:19 +00003129 // If there is an implementation, traverse it. We do this to find
3130 // synthesized ivars.
3131 if (IFace->getImplementation()) {
3132 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003133 LookupVisibleDecls(IFace->getImplementation(), Result,
Nick Lewycky893a6ea2012-04-03 20:26:45 +00003134 QualifiedNameLookup, InBaseClass, Consumer, Visited);
Douglas Gregorc220a182010-04-19 18:02:19 +00003135 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003136 } else if (ObjCProtocolDecl *Protocol = dyn_cast<ObjCProtocolDecl>(Ctx)) {
3137 for (ObjCProtocolDecl::protocol_iterator I = Protocol->protocol_begin(),
3138 E = Protocol->protocol_end(); I != E; ++I) {
3139 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003140 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003141 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003142 }
3143 } else if (ObjCCategoryDecl *Category = dyn_cast<ObjCCategoryDecl>(Ctx)) {
3144 for (ObjCCategoryDecl::protocol_iterator I = Category->protocol_begin(),
3145 E = Category->protocol_end(); I != E; ++I) {
3146 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003147 LookupVisibleDecls(*I, Result, QualifiedNameLookup, false, Consumer,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003148 Visited);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003149 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003150
Douglas Gregorc220a182010-04-19 18:02:19 +00003151 // If there is an implementation, traverse it.
3152 if (Category->getImplementation()) {
3153 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003154 LookupVisibleDecls(Category->getImplementation(), Result,
Douglas Gregorc220a182010-04-19 18:02:19 +00003155 QualifiedNameLookup, true, Consumer, Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003156 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003157 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003158}
3159
3160static void LookupVisibleDecls(Scope *S, LookupResult &Result,
3161 UnqualUsingDirectiveSet &UDirs,
3162 VisibleDeclConsumer &Consumer,
3163 VisibleDeclsRecord &Visited) {
3164 if (!S)
3165 return;
3166
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003167 if (!S->getEntity() ||
3168 (!S->getParent() &&
Douglas Gregor8071e422010-08-15 06:18:01 +00003169 !Visited.alreadyVisitedContext((DeclContext *)S->getEntity())) ||
Douglas Gregor539c5c32010-01-07 00:31:29 +00003170 ((DeclContext *)S->getEntity())->isFunctionOrMethod()) {
3171 // Walk through the declarations in this Scope.
3172 for (Scope::decl_iterator D = S->decl_begin(), DEnd = S->decl_end();
3173 D != DEnd; ++D) {
John McCalld226f652010-08-21 09:40:31 +00003174 if (NamedDecl *ND = dyn_cast<NamedDecl>(*D))
Douglas Gregor55368912011-12-14 16:03:29 +00003175 if ((ND = Result.getAcceptableDecl(ND))) {
Erik Verbruggend1205962011-10-06 07:27:49 +00003176 Consumer.FoundDecl(ND, Visited.checkHidden(ND), 0, false);
Douglas Gregor539c5c32010-01-07 00:31:29 +00003177 Visited.add(ND);
3178 }
3179 }
3180 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003181
Douglas Gregor711be1e2010-03-15 14:33:29 +00003182 // FIXME: C++ [temp.local]p8
Douglas Gregor546be3c2009-12-30 17:04:44 +00003183 DeclContext *Entity = 0;
Douglas Gregore3582012010-01-01 17:44:25 +00003184 if (S->getEntity()) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003185 // Look into this scope's declaration context, along with any of its
3186 // parent lookup contexts (e.g., enclosing classes), up to the point
3187 // where we hit the context stored in the next outer scope.
3188 Entity = (DeclContext *)S->getEntity();
Douglas Gregor711be1e2010-03-15 14:33:29 +00003189 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003190
Douglas Gregordbdf5e72010-03-15 15:26:48 +00003191 for (DeclContext *Ctx = Entity; Ctx && !Ctx->Equals(OuterCtx);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003192 Ctx = Ctx->getLookupParent()) {
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003193 if (ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(Ctx)) {
3194 if (Method->isInstanceMethod()) {
3195 // For instance methods, look for ivars in the method's interface.
3196 LookupResult IvarResult(Result.getSema(), Result.getLookupName(),
3197 Result.getNameLoc(), Sema::LookupMemberName);
Douglas Gregorca45da02010-11-02 20:36:02 +00003198 if (ObjCInterfaceDecl *IFace = Method->getClassInterface()) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003199 LookupVisibleDecls(IFace, IvarResult, /*QualifiedNameLookup=*/false,
Richard Smithd67679d2013-08-20 20:35:18 +00003200 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregorca45da02010-11-02 20:36:02 +00003201 }
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003202 }
3203
3204 // We've already performed all of the name lookup that we need
3205 // to for Objective-C methods; the next context will be the
3206 // outer scope.
3207 break;
3208 }
3209
Douglas Gregor546be3c2009-12-30 17:04:44 +00003210 if (Ctx->isFunctionOrMethod())
3211 continue;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003212
3213 LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003214 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003215 }
3216 } else if (!S->getParent()) {
3217 // Look into the translation unit scope. We walk through the translation
3218 // unit's declaration context, because the Scope itself won't have all of
3219 // the declarations if we loaded a precompiled header.
3220 // FIXME: We would like the translation unit's Scope object to point to the
3221 // translation unit, so we don't need this special "if" branch. However,
3222 // doing so would force the normal C++ name-lookup code to look into the
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003223 // translation unit decl when the IdentifierInfo chains would suffice.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003224 // Once we fix that problem (which is part of a more general "don't look
Douglas Gregor539c5c32010-01-07 00:31:29 +00003225 // in DeclContexts unless we have to" optimization), we can eliminate this.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003226 Entity = Result.getSema().Context.getTranslationUnitDecl();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003227 LookupVisibleDecls(Entity, Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003228 /*InBaseClass=*/false, Consumer, Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003229 }
3230
Douglas Gregor546be3c2009-12-30 17:04:44 +00003231 if (Entity) {
3232 // Lookup visible declarations in any namespaces found by using
3233 // directives.
3234 UnqualUsingDirectiveSet::const_iterator UI, UEnd;
3235 llvm::tie(UI, UEnd) = UDirs.getNamespacesFor(Entity);
3236 for (; UI != UEnd; ++UI)
3237 LookupVisibleDecls(const_cast<DeclContext *>(UI->getNominatedNamespace()),
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003238 Result, /*QualifiedNameLookup=*/false,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003239 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003240 }
3241
3242 // Lookup names in the parent scope.
3243 ShadowContextRAII Shadow(Visited);
3244 LookupVisibleDecls(S->getParent(), Result, UDirs, Consumer, Visited);
3245}
3246
3247void Sema::LookupVisibleDecls(Scope *S, LookupNameKind Kind,
Douglas Gregor8071e422010-08-15 06:18:01 +00003248 VisibleDeclConsumer &Consumer,
3249 bool IncludeGlobalScope) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003250 // Determine the set of using directives available during
3251 // unqualified name lookup.
3252 Scope *Initial = S;
3253 UnqualUsingDirectiveSet UDirs;
David Blaikie4e4d0842012-03-11 07:00:24 +00003254 if (getLangOpts().CPlusPlus) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003255 // Find the first namespace or translation-unit scope.
3256 while (S && !isNamespaceOrTranslationUnitScope(S))
3257 S = S->getParent();
3258
3259 UDirs.visitScopeChain(Initial, S);
3260 }
3261 UDirs.done();
3262
3263 // Look for visible declarations.
3264 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
Richard Smithd67679d2013-08-20 20:35:18 +00003265 Result.setAllowHidden(Consumer.includeHiddenDecls());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003266 VisibleDeclsRecord Visited;
Douglas Gregor8071e422010-08-15 06:18:01 +00003267 if (!IncludeGlobalScope)
3268 Visited.visitedContext(Context.getTranslationUnitDecl());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003269 ShadowContextRAII Shadow(Visited);
3270 ::LookupVisibleDecls(Initial, Result, UDirs, Consumer, Visited);
3271}
3272
3273void Sema::LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
Douglas Gregor8071e422010-08-15 06:18:01 +00003274 VisibleDeclConsumer &Consumer,
3275 bool IncludeGlobalScope) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003276 LookupResult Result(*this, DeclarationName(), SourceLocation(), Kind);
Richard Smithd67679d2013-08-20 20:35:18 +00003277 Result.setAllowHidden(Consumer.includeHiddenDecls());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003278 VisibleDeclsRecord Visited;
Douglas Gregor8071e422010-08-15 06:18:01 +00003279 if (!IncludeGlobalScope)
3280 Visited.visitedContext(Context.getTranslationUnitDecl());
Douglas Gregor546be3c2009-12-30 17:04:44 +00003281 ShadowContextRAII Shadow(Visited);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003282 ::LookupVisibleDecls(Ctx, Result, /*QualifiedNameLookup=*/true,
Douglas Gregor0cc84042010-01-14 15:47:35 +00003283 /*InBaseClass=*/false, Consumer, Visited);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003284}
3285
Chris Lattner4ae493c2011-02-18 02:08:43 +00003286/// LookupOrCreateLabel - Do a name lookup of a label with the specified name.
Abramo Bagnara67843042011-03-05 18:21:20 +00003287/// If GnuLabelLoc is a valid source location, then this is a definition
3288/// of an __label__ label name, otherwise it is a normal label definition
3289/// or use.
Chris Lattner4ae493c2011-02-18 02:08:43 +00003290LabelDecl *Sema::LookupOrCreateLabel(IdentifierInfo *II, SourceLocation Loc,
Abramo Bagnara67843042011-03-05 18:21:20 +00003291 SourceLocation GnuLabelLoc) {
Chris Lattner337e5502011-02-18 01:27:55 +00003292 // Do a lookup to see if we have a label with this name already.
Chris Lattner4ae493c2011-02-18 02:08:43 +00003293 NamedDecl *Res = 0;
Abramo Bagnara67843042011-03-05 18:21:20 +00003294
3295 if (GnuLabelLoc.isValid()) {
3296 // Local label definitions always shadow existing labels.
3297 Res = LabelDecl::Create(Context, CurContext, Loc, II, GnuLabelLoc);
3298 Scope *S = CurScope;
3299 PushOnScopeChains(Res, S, true);
3300 return cast<LabelDecl>(Res);
3301 }
3302
3303 // Not a GNU local label.
3304 Res = LookupSingleName(CurScope, II, Loc, LookupLabel, NotForRedeclaration);
3305 // If we found a label, check to see if it is in the same context as us.
3306 // When in a Block, we don't want to reuse a label in an enclosing function.
Chris Lattner337e5502011-02-18 01:27:55 +00003307 if (Res && Res->getDeclContext() != CurContext)
3308 Res = 0;
Chris Lattner337e5502011-02-18 01:27:55 +00003309 if (Res == 0) {
3310 // If not forward referenced or defined already, create the backing decl.
Abramo Bagnara67843042011-03-05 18:21:20 +00003311 Res = LabelDecl::Create(Context, CurContext, Loc, II);
3312 Scope *S = CurScope->getFnParent();
Chris Lattnerfebb5b82011-02-18 21:16:39 +00003313 assert(S && "Not in a function?");
3314 PushOnScopeChains(Res, S, true);
Chris Lattner337e5502011-02-18 01:27:55 +00003315 }
Chris Lattner337e5502011-02-18 01:27:55 +00003316 return cast<LabelDecl>(Res);
3317}
3318
3319//===----------------------------------------------------------------------===//
Douglas Gregor546be3c2009-12-30 17:04:44 +00003320// Typo correction
Chris Lattner337e5502011-02-18 01:27:55 +00003321//===----------------------------------------------------------------------===//
Douglas Gregor546be3c2009-12-30 17:04:44 +00003322
3323namespace {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003324
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00003325typedef SmallVector<TypoCorrection, 1> TypoResultList;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003326typedef llvm::StringMap<TypoResultList, llvm::BumpPtrAllocator> TypoResultsMap;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00003327typedef std::map<unsigned, TypoResultsMap> TypoEditDistanceMap;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003328
3329static const unsigned MaxTypoDistanceResultSets = 5;
3330
Douglas Gregor546be3c2009-12-30 17:04:44 +00003331class TypoCorrectionConsumer : public VisibleDeclConsumer {
3332 /// \brief The name written that is a typo in the source.
Chris Lattner5f9e2722011-07-23 10:55:15 +00003333 StringRef Typo;
Douglas Gregor546be3c2009-12-30 17:04:44 +00003334
3335 /// \brief The results found that have the smallest edit distance
3336 /// found (so far) with the typo name.
Douglas Gregore24b5752010-10-14 20:34:08 +00003337 ///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003338 /// The pointer value being set to the current DeclContext indicates
3339 /// whether there is a keyword with this name.
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003340 TypoEditDistanceMap CorrectionResults;
Douglas Gregor546be3c2009-12-30 17:04:44 +00003341
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003342 Sema &SemaRef;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003343
Douglas Gregor546be3c2009-12-30 17:04:44 +00003344public:
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003345 explicit TypoCorrectionConsumer(Sema &SemaRef, IdentifierInfo *Typo)
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003346 : Typo(Typo->getName()),
Richard Smithd67679d2013-08-20 20:35:18 +00003347 SemaRef(SemaRef) {}
3348
3349 bool includeHiddenDecls() const { return true; }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003350
Erik Verbruggend1205962011-10-06 07:27:49 +00003351 virtual void FoundDecl(NamedDecl *ND, NamedDecl *Hiding, DeclContext *Ctx,
3352 bool InBaseClass);
Chris Lattner5f9e2722011-07-23 10:55:15 +00003353 void FoundName(StringRef Name);
3354 void addKeywordResult(StringRef Keyword);
3355 void addName(StringRef Name, NamedDecl *ND, unsigned Distance,
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003356 NestedNameSpecifier *NNS=NULL, bool isKeyword=false);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003357 void addCorrection(TypoCorrection Correction);
Douglas Gregor546be3c2009-12-30 17:04:44 +00003358
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003359 typedef TypoResultsMap::iterator result_iterator;
3360 typedef TypoEditDistanceMap::iterator distance_iterator;
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003361 distance_iterator begin() { return CorrectionResults.begin(); }
3362 distance_iterator end() { return CorrectionResults.end(); }
3363 void erase(distance_iterator I) { CorrectionResults.erase(I); }
3364 unsigned size() const { return CorrectionResults.size(); }
3365 bool empty() const { return CorrectionResults.empty(); }
Douglas Gregor546be3c2009-12-30 17:04:44 +00003366
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003367 TypoResultList &operator[](StringRef Name) {
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003368 return CorrectionResults.begin()->second[Name];
Douglas Gregor7b824e82010-10-15 13:35:25 +00003369 }
3370
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003371 unsigned getBestEditDistance(bool Normalized) {
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003372 if (CorrectionResults.empty())
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003373 return (std::numeric_limits<unsigned>::max)();
3374
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003375 unsigned BestED = CorrectionResults.begin()->first;
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003376 return Normalized ? TypoCorrection::NormalizeEditDistance(BestED) : BestED;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003377 }
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003378
3379 TypoResultsMap &getBestResults() {
3380 return CorrectionResults.begin()->second;
3381 }
3382
Douglas Gregor546be3c2009-12-30 17:04:44 +00003383};
3384
3385}
3386
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003387void TypoCorrectionConsumer::FoundDecl(NamedDecl *ND, NamedDecl *Hiding,
Erik Verbruggend1205962011-10-06 07:27:49 +00003388 DeclContext *Ctx, bool InBaseClass) {
Douglas Gregor546be3c2009-12-30 17:04:44 +00003389 // Don't consider hidden names for typo correction.
3390 if (Hiding)
3391 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003392
Douglas Gregor546be3c2009-12-30 17:04:44 +00003393 // Only consider entities with identifiers for names, ignoring
3394 // special names (constructors, overloaded operators, selectors,
3395 // etc.).
3396 IdentifierInfo *Name = ND->getIdentifier();
3397 if (!Name)
3398 return;
3399
Richard Smithd67679d2013-08-20 20:35:18 +00003400 // Only consider visible declarations and declarations from modules with
3401 // names that exactly match.
3402 if (!LookupResult::isVisible(SemaRef, ND) && Name->getName() != Typo &&
3403 !findAcceptableDecl(SemaRef, ND))
3404 return;
3405
Douglas Gregor95f42922010-10-14 22:11:03 +00003406 FoundName(Name->getName());
3407}
3408
Chris Lattner5f9e2722011-07-23 10:55:15 +00003409void TypoCorrectionConsumer::FoundName(StringRef Name) {
Douglas Gregor362a8f22010-10-19 19:39:10 +00003410 // Use a simple length-based heuristic to determine the minimum possible
3411 // edit distance. If the minimum isn't good enough, bail out early.
3412 unsigned MinED = abs((int)Name.size() - (int)Typo.size());
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003413 if (MinED && Typo.size() / MinED < 3)
Douglas Gregor362a8f22010-10-19 19:39:10 +00003414 return;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003415
Douglas Gregora1194772010-10-19 22:14:33 +00003416 // Compute an upper bound on the allowable edit distance, so that the
3417 // edit-distance algorithm can short-circuit.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003418 unsigned UpperBound = (Typo.size() + 2) / 3;
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003419
Douglas Gregor546be3c2009-12-30 17:04:44 +00003420 // Compute the edit distance between the typo and the name of this
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003421 // entity, and add the identifier to the list of results.
3422 addName(Name, NULL, Typo.edit_distance(Name, true, UpperBound));
Douglas Gregor546be3c2009-12-30 17:04:44 +00003423}
3424
Chris Lattner5f9e2722011-07-23 10:55:15 +00003425void TypoCorrectionConsumer::addKeywordResult(StringRef Keyword) {
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00003426 // Compute the edit distance between the typo and this keyword,
3427 // and add the keyword to the list of results.
3428 addName(Keyword, NULL, Typo.edit_distance(Keyword), NULL, true);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003429}
3430
Chris Lattner5f9e2722011-07-23 10:55:15 +00003431void TypoCorrectionConsumer::addName(StringRef Name,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003432 NamedDecl *ND,
3433 unsigned Distance,
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00003434 NestedNameSpecifier *NNS,
3435 bool isKeyword) {
3436 TypoCorrection TC(&SemaRef.Context.Idents.get(Name), ND, NNS, Distance);
3437 if (isKeyword) TC.makeKeyword();
3438 addCorrection(TC);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003439}
3440
3441void TypoCorrectionConsumer::addCorrection(TypoCorrection Correction) {
Chris Lattner5f9e2722011-07-23 10:55:15 +00003442 StringRef Name = Correction.getCorrectionAsIdentifierInfo()->getName();
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003443 TypoResultList &CList =
3444 CorrectionResults[Correction.getEditDistance(false)][Name];
Chandler Carruth55620532011-06-28 22:48:40 +00003445
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00003446 if (!CList.empty() && !CList.back().isResolved())
3447 CList.pop_back();
3448 if (NamedDecl *NewND = Correction.getCorrectionDecl()) {
3449 std::string CorrectionStr = Correction.getAsString(SemaRef.getLangOpts());
3450 for (TypoResultList::iterator RI = CList.begin(), RIEnd = CList.end();
3451 RI != RIEnd; ++RI) {
3452 // If the Correction refers to a decl already in the result list,
3453 // replace the existing result if the string representation of Correction
3454 // comes before the current result alphabetically, then stop as there is
3455 // nothing more to be done to add Correction to the candidate set.
3456 if (RI->getCorrectionDecl() == NewND) {
3457 if (CorrectionStr < RI->getAsString(SemaRef.getLangOpts()))
3458 *RI = Correction;
3459 return;
3460 }
3461 }
3462 }
3463 if (CList.empty() || Correction.isResolved())
3464 CList.push_back(Correction);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003465
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00003466 while (CorrectionResults.size() > MaxTypoDistanceResultSets)
3467 erase(llvm::prior(CorrectionResults.end()));
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003468}
3469
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003470// Fill the supplied vector with the IdentifierInfo pointers for each piece of
3471// the given NestedNameSpecifier (i.e. given a NestedNameSpecifier "foo::bar::",
3472// fill the vector with the IdentifierInfo pointers for "foo" and "bar").
3473static void getNestedNameSpecifierIdentifiers(
3474 NestedNameSpecifier *NNS,
3475 SmallVectorImpl<const IdentifierInfo*> &Identifiers) {
3476 if (NestedNameSpecifier *Prefix = NNS->getPrefix())
3477 getNestedNameSpecifierIdentifiers(Prefix, Identifiers);
3478 else
3479 Identifiers.clear();
3480
3481 const IdentifierInfo *II = NULL;
3482
3483 switch (NNS->getKind()) {
3484 case NestedNameSpecifier::Identifier:
3485 II = NNS->getAsIdentifier();
3486 break;
3487
3488 case NestedNameSpecifier::Namespace:
3489 if (NNS->getAsNamespace()->isAnonymousNamespace())
3490 return;
3491 II = NNS->getAsNamespace()->getIdentifier();
3492 break;
3493
3494 case NestedNameSpecifier::NamespaceAlias:
3495 II = NNS->getAsNamespaceAlias()->getIdentifier();
3496 break;
3497
3498 case NestedNameSpecifier::TypeSpecWithTemplate:
3499 case NestedNameSpecifier::TypeSpec:
3500 II = QualType(NNS->getAsType(), 0).getBaseTypeIdentifier();
3501 break;
3502
3503 case NestedNameSpecifier::Global:
3504 return;
3505 }
3506
3507 if (II)
3508 Identifiers.push_back(II);
3509}
3510
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003511namespace {
3512
3513class SpecifierInfo {
3514 public:
3515 DeclContext* DeclCtx;
3516 NestedNameSpecifier* NameSpecifier;
3517 unsigned EditDistance;
3518
3519 SpecifierInfo(DeclContext *Ctx, NestedNameSpecifier *NNS, unsigned ED)
3520 : DeclCtx(Ctx), NameSpecifier(NNS), EditDistance(ED) {}
3521};
3522
Chris Lattner5f9e2722011-07-23 10:55:15 +00003523typedef SmallVector<DeclContext*, 4> DeclContextList;
3524typedef SmallVector<SpecifierInfo, 16> SpecifierInfoList;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003525
3526class NamespaceSpecifierSet {
3527 ASTContext &Context;
3528 DeclContextList CurContextChain;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003529 SmallVector<const IdentifierInfo*, 4> CurContextIdentifiers;
3530 SmallVector<const IdentifierInfo*, 4> CurNameSpecifierIdentifiers;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003531 bool isSorted;
3532
3533 SpecifierInfoList Specifiers;
3534 llvm::SmallSetVector<unsigned, 4> Distances;
3535 llvm::DenseMap<unsigned, SpecifierInfoList> DistanceMap;
3536
3537 /// \brief Helper for building the list of DeclContexts between the current
3538 /// context and the top of the translation unit
3539 static DeclContextList BuildContextChain(DeclContext *Start);
3540
3541 void SortNamespaces();
3542
3543 public:
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003544 NamespaceSpecifierSet(ASTContext &Context, DeclContext *CurContext,
3545 CXXScopeSpec *CurScopeSpec)
Benjamin Kramerc5bb9d42011-07-05 09:46:31 +00003546 : Context(Context), CurContextChain(BuildContextChain(CurContext)),
Kaelyn Uhrain8d90b4a2013-06-24 17:49:03 +00003547 isSorted(false) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003548 if (CurScopeSpec && CurScopeSpec->getScopeRep())
3549 getNestedNameSpecifierIdentifiers(CurScopeSpec->getScopeRep(),
3550 CurNameSpecifierIdentifiers);
3551 // Build the list of identifiers that would be used for an absolute
Benjamin Kramer48d798c2012-06-02 10:20:41 +00003552 // (from the global context) NestedNameSpecifier referring to the current
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003553 // context.
3554 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3555 CEnd = CurContextChain.rend();
3556 C != CEnd; ++C) {
3557 if (NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C))
3558 CurContextIdentifiers.push_back(ND->getIdentifier());
3559 }
Kaelyn Uhrain8d90b4a2013-06-24 17:49:03 +00003560
3561 // Add the global context as a NestedNameSpecifier
3562 Distances.insert(1);
3563 DistanceMap[1].push_back(
3564 SpecifierInfo(cast<DeclContext>(Context.getTranslationUnitDecl()),
3565 NestedNameSpecifier::GlobalSpecifier(Context), 1));
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003566 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003567
3568 /// \brief Add the namespace to the set, computing the corresponding
3569 /// NestedNameSpecifier and its distance in the process.
3570 void AddNamespace(NamespaceDecl *ND);
3571
3572 typedef SpecifierInfoList::iterator iterator;
3573 iterator begin() {
3574 if (!isSorted) SortNamespaces();
3575 return Specifiers.begin();
3576 }
3577 iterator end() { return Specifiers.end(); }
3578};
3579
3580}
3581
3582DeclContextList NamespaceSpecifierSet::BuildContextChain(DeclContext *Start) {
Nick Lewycky0db9d202013-04-08 21:55:21 +00003583 assert(Start && "Building a context chain from a null context");
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003584 DeclContextList Chain;
3585 for (DeclContext *DC = Start->getPrimaryContext(); DC != NULL;
3586 DC = DC->getLookupParent()) {
3587 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(DC);
3588 if (!DC->isInlineNamespace() && !DC->isTransparentContext() &&
3589 !(ND && ND->isAnonymousNamespace()))
3590 Chain.push_back(DC->getPrimaryContext());
3591 }
3592 return Chain;
3593}
3594
3595void NamespaceSpecifierSet::SortNamespaces() {
Chris Lattner5f9e2722011-07-23 10:55:15 +00003596 SmallVector<unsigned, 4> sortedDistances;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003597 sortedDistances.append(Distances.begin(), Distances.end());
3598
3599 if (sortedDistances.size() > 1)
3600 std::sort(sortedDistances.begin(), sortedDistances.end());
3601
3602 Specifiers.clear();
Craig Topper09d19ef2013-07-04 03:08:24 +00003603 for (SmallVectorImpl<unsigned>::iterator DI = sortedDistances.begin(),
3604 DIEnd = sortedDistances.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003605 DI != DIEnd; ++DI) {
3606 SpecifierInfoList &SpecList = DistanceMap[*DI];
3607 Specifiers.append(SpecList.begin(), SpecList.end());
3608 }
3609
3610 isSorted = true;
3611}
3612
3613void NamespaceSpecifierSet::AddNamespace(NamespaceDecl *ND) {
Chandler Carruth9af7e8e2011-06-28 21:43:34 +00003614 DeclContext *Ctx = cast<DeclContext>(ND);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003615 NestedNameSpecifier *NNS = NULL;
3616 unsigned NumSpecifiers = 0;
3617 DeclContextList NamespaceDeclChain(BuildContextChain(Ctx));
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003618 DeclContextList FullNamespaceDeclChain(NamespaceDeclChain);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003619
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003620 // Eliminate common elements from the two DeclContext chains.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003621 for (DeclContextList::reverse_iterator C = CurContextChain.rbegin(),
3622 CEnd = CurContextChain.rend();
Chandler Carruth9af7e8e2011-06-28 21:43:34 +00003623 C != CEnd && !NamespaceDeclChain.empty() &&
3624 NamespaceDeclChain.back() == *C; ++C) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003625 NamespaceDeclChain.pop_back();
3626 }
3627
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003628 // Add an explicit leading '::' specifier if needed.
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00003629 if (NamespaceDeclChain.empty()) {
3630 NamespaceDeclChain = FullNamespaceDeclChain;
3631 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
3632 } else if (NamespaceDecl *ND =
3633 dyn_cast_or_null<NamespaceDecl>(NamespaceDeclChain.back())) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003634 IdentifierInfo *Name = ND->getIdentifier();
3635 if (std::find(CurContextIdentifiers.begin(), CurContextIdentifiers.end(),
3636 Name) != CurContextIdentifiers.end() ||
3637 std::find(CurNameSpecifierIdentifiers.begin(),
3638 CurNameSpecifierIdentifiers.end(),
3639 Name) != CurNameSpecifierIdentifiers.end()) {
3640 NamespaceDeclChain = FullNamespaceDeclChain;
3641 NNS = NestedNameSpecifier::GlobalSpecifier(Context);
3642 }
3643 }
3644
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003645 // Build the NestedNameSpecifier from what is left of the NamespaceDeclChain
3646 for (DeclContextList::reverse_iterator C = NamespaceDeclChain.rbegin(),
3647 CEnd = NamespaceDeclChain.rend();
3648 C != CEnd; ++C) {
3649 NamespaceDecl *ND = dyn_cast_or_null<NamespaceDecl>(*C);
3650 if (ND) {
3651 NNS = NestedNameSpecifier::Create(Context, NNS, ND);
3652 ++NumSpecifiers;
3653 }
3654 }
3655
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003656 // If the built NestedNameSpecifier would be replacing an existing
3657 // NestedNameSpecifier, use the number of component identifiers that
3658 // would need to be changed as the edit distance instead of the number
3659 // of components in the built NestedNameSpecifier.
3660 if (NNS && !CurNameSpecifierIdentifiers.empty()) {
3661 SmallVector<const IdentifierInfo*, 4> NewNameSpecifierIdentifiers;
3662 getNestedNameSpecifierIdentifiers(NNS, NewNameSpecifierIdentifiers);
3663 NumSpecifiers = llvm::ComputeEditDistance(
Robert Wilhelm834c0582013-08-09 18:02:13 +00003664 ArrayRef<const IdentifierInfo *>(CurNameSpecifierIdentifiers),
3665 ArrayRef<const IdentifierInfo *>(NewNameSpecifierIdentifiers));
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003666 }
3667
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003668 isSorted = false;
3669 Distances.insert(NumSpecifiers);
3670 DistanceMap[NumSpecifiers].push_back(SpecifierInfo(Ctx, NNS, NumSpecifiers));
Douglas Gregoraaf87162010-04-14 20:04:41 +00003671}
3672
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003673/// \brief Perform name lookup for a possible result for typo correction.
3674static void LookupPotentialTypoResult(Sema &SemaRef,
3675 LookupResult &Res,
3676 IdentifierInfo *Name,
3677 Scope *S, CXXScopeSpec *SS,
3678 DeclContext *MemberContext,
3679 bool EnteringContext,
Richard Smithd67679d2013-08-20 20:35:18 +00003680 bool isObjCIvarLookup,
3681 bool FindHidden) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003682 Res.suppressDiagnostics();
3683 Res.clear();
3684 Res.setLookupName(Name);
Richard Smithd67679d2013-08-20 20:35:18 +00003685 Res.setAllowHidden(FindHidden);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003686 if (MemberContext) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003687 if (ObjCInterfaceDecl *Class = dyn_cast<ObjCInterfaceDecl>(MemberContext)) {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003688 if (isObjCIvarLookup) {
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003689 if (ObjCIvarDecl *Ivar = Class->lookupInstanceVariable(Name)) {
3690 Res.addDecl(Ivar);
3691 Res.resolveKind();
3692 return;
3693 }
3694 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003695
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003696 if (ObjCPropertyDecl *Prop = Class->FindPropertyDeclaration(Name)) {
3697 Res.addDecl(Prop);
3698 Res.resolveKind();
3699 return;
3700 }
3701 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003702
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003703 SemaRef.LookupQualifiedName(Res, MemberContext);
3704 return;
3705 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003706
3707 SemaRef.LookupParsedName(Res, S, SS, /*AllowBuiltinCreation=*/false,
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003708 EnteringContext);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003709
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003710 // Fake ivar lookup; this should really be part of
3711 // LookupParsedName.
3712 if (ObjCMethodDecl *Method = SemaRef.getCurMethodDecl()) {
3713 if (Method->isInstanceMethod() && Method->getClassInterface() &&
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003714 (Res.empty() ||
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003715 (Res.isSingleResult() &&
3716 Res.getFoundDecl()->isDefinedOutsideFunctionOrMethod()))) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003717 if (ObjCIvarDecl *IV
Douglas Gregor9a632ea2010-10-20 03:06:34 +00003718 = Method->getClassInterface()->lookupInstanceVariable(Name)) {
3719 Res.addDecl(IV);
3720 Res.resolveKind();
3721 }
3722 }
3723 }
3724}
3725
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003726/// \brief Add keywords to the consumer as possible typo corrections.
3727static void AddKeywordsToConsumer(Sema &SemaRef,
3728 TypoCorrectionConsumer &Consumer,
Richard Smith0f4b5be2012-06-08 21:35:42 +00003729 Scope *S, CorrectionCandidateCallback &CCC,
3730 bool AfterNestedNameSpecifier) {
3731 if (AfterNestedNameSpecifier) {
3732 // For 'X::', we know exactly which keywords can appear next.
3733 Consumer.addKeywordResult("template");
3734 if (CCC.WantExpressionKeywords)
3735 Consumer.addKeywordResult("operator");
3736 return;
3737 }
3738
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003739 if (CCC.WantObjCSuper)
3740 Consumer.addKeywordResult("super");
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003741
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003742 if (CCC.WantTypeSpecifiers) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003743 // Add type-specifier keywords to the set of results.
Craig Topper3aa29df2013-07-15 08:24:27 +00003744 static const char *const CTypeSpecs[] = {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003745 "char", "const", "double", "enum", "float", "int", "long", "short",
Douglas Gregor07f4a062011-07-01 21:27:45 +00003746 "signed", "struct", "union", "unsigned", "void", "volatile",
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003747 "_Complex", "_Imaginary",
3748 // storage-specifiers as well
3749 "extern", "inline", "static", "typedef"
3750 };
3751
Craig Topperb9602322013-07-15 03:38:40 +00003752 const unsigned NumCTypeSpecs = llvm::array_lengthof(CTypeSpecs);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003753 for (unsigned I = 0; I != NumCTypeSpecs; ++I)
3754 Consumer.addKeywordResult(CTypeSpecs[I]);
3755
David Blaikie4e4d0842012-03-11 07:00:24 +00003756 if (SemaRef.getLangOpts().C99)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003757 Consumer.addKeywordResult("restrict");
David Blaikie4e4d0842012-03-11 07:00:24 +00003758 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003759 Consumer.addKeywordResult("bool");
David Blaikie4e4d0842012-03-11 07:00:24 +00003760 else if (SemaRef.getLangOpts().C99)
Douglas Gregor07f4a062011-07-01 21:27:45 +00003761 Consumer.addKeywordResult("_Bool");
3762
David Blaikie4e4d0842012-03-11 07:00:24 +00003763 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003764 Consumer.addKeywordResult("class");
3765 Consumer.addKeywordResult("typename");
3766 Consumer.addKeywordResult("wchar_t");
3767
Richard Smith80ad52f2013-01-02 11:42:31 +00003768 if (SemaRef.getLangOpts().CPlusPlus11) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003769 Consumer.addKeywordResult("char16_t");
3770 Consumer.addKeywordResult("char32_t");
3771 Consumer.addKeywordResult("constexpr");
3772 Consumer.addKeywordResult("decltype");
3773 Consumer.addKeywordResult("thread_local");
3774 }
3775 }
3776
David Blaikie4e4d0842012-03-11 07:00:24 +00003777 if (SemaRef.getLangOpts().GNUMode)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003778 Consumer.addKeywordResult("typeof");
3779 }
3780
David Blaikie4e4d0842012-03-11 07:00:24 +00003781 if (CCC.WantCXXNamedCasts && SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003782 Consumer.addKeywordResult("const_cast");
3783 Consumer.addKeywordResult("dynamic_cast");
3784 Consumer.addKeywordResult("reinterpret_cast");
3785 Consumer.addKeywordResult("static_cast");
3786 }
3787
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003788 if (CCC.WantExpressionKeywords) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003789 Consumer.addKeywordResult("sizeof");
David Blaikie4e4d0842012-03-11 07:00:24 +00003790 if (SemaRef.getLangOpts().Bool || SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003791 Consumer.addKeywordResult("false");
3792 Consumer.addKeywordResult("true");
3793 }
3794
David Blaikie4e4d0842012-03-11 07:00:24 +00003795 if (SemaRef.getLangOpts().CPlusPlus) {
Craig Topper3aa29df2013-07-15 08:24:27 +00003796 static const char *const CXXExprs[] = {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003797 "delete", "new", "operator", "throw", "typeid"
3798 };
Craig Topperb9602322013-07-15 03:38:40 +00003799 const unsigned NumCXXExprs = llvm::array_lengthof(CXXExprs);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003800 for (unsigned I = 0; I != NumCXXExprs; ++I)
3801 Consumer.addKeywordResult(CXXExprs[I]);
3802
3803 if (isa<CXXMethodDecl>(SemaRef.CurContext) &&
3804 cast<CXXMethodDecl>(SemaRef.CurContext)->isInstance())
3805 Consumer.addKeywordResult("this");
3806
Richard Smith80ad52f2013-01-02 11:42:31 +00003807 if (SemaRef.getLangOpts().CPlusPlus11) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003808 Consumer.addKeywordResult("alignof");
3809 Consumer.addKeywordResult("nullptr");
3810 }
3811 }
Jordan Rosef70a8862012-06-30 21:33:57 +00003812
3813 if (SemaRef.getLangOpts().C11) {
3814 // FIXME: We should not suggest _Alignof if the alignof macro
3815 // is present.
3816 Consumer.addKeywordResult("_Alignof");
3817 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003818 }
3819
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003820 if (CCC.WantRemainingKeywords) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003821 if (SemaRef.getCurFunctionOrMethodDecl() || SemaRef.getCurBlock()) {
3822 // Statements.
Craig Topper3aa29df2013-07-15 08:24:27 +00003823 static const char *const CStmts[] = {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003824 "do", "else", "for", "goto", "if", "return", "switch", "while" };
Craig Topperb9602322013-07-15 03:38:40 +00003825 const unsigned NumCStmts = llvm::array_lengthof(CStmts);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003826 for (unsigned I = 0; I != NumCStmts; ++I)
3827 Consumer.addKeywordResult(CStmts[I]);
3828
David Blaikie4e4d0842012-03-11 07:00:24 +00003829 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003830 Consumer.addKeywordResult("catch");
3831 Consumer.addKeywordResult("try");
3832 }
3833
3834 if (S && S->getBreakParent())
3835 Consumer.addKeywordResult("break");
3836
3837 if (S && S->getContinueParent())
3838 Consumer.addKeywordResult("continue");
3839
3840 if (!SemaRef.getCurFunction()->SwitchStack.empty()) {
3841 Consumer.addKeywordResult("case");
3842 Consumer.addKeywordResult("default");
3843 }
3844 } else {
David Blaikie4e4d0842012-03-11 07:00:24 +00003845 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003846 Consumer.addKeywordResult("namespace");
3847 Consumer.addKeywordResult("template");
3848 }
3849
3850 if (S && S->isClassScope()) {
3851 Consumer.addKeywordResult("explicit");
3852 Consumer.addKeywordResult("friend");
3853 Consumer.addKeywordResult("mutable");
3854 Consumer.addKeywordResult("private");
3855 Consumer.addKeywordResult("protected");
3856 Consumer.addKeywordResult("public");
3857 Consumer.addKeywordResult("virtual");
3858 }
3859 }
3860
David Blaikie4e4d0842012-03-11 07:00:24 +00003861 if (SemaRef.getLangOpts().CPlusPlus) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003862 Consumer.addKeywordResult("using");
3863
Richard Smith80ad52f2013-01-02 11:42:31 +00003864 if (SemaRef.getLangOpts().CPlusPlus11)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003865 Consumer.addKeywordResult("static_assert");
3866 }
3867 }
3868}
3869
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003870static bool isCandidateViable(CorrectionCandidateCallback &CCC,
3871 TypoCorrection &Candidate) {
3872 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3873 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3874}
3875
Richard Smithd67679d2013-08-20 20:35:18 +00003876/// \brief Check whether the declarations found for a typo correction are
3877/// visible, and if none of them are, convert the correction to an 'import
3878/// a module' correction.
3879static void checkCorrectionVisibility(Sema &SemaRef, TypoCorrection &TC,
3880 DeclarationName TypoName) {
3881 if (TC.begin() == TC.end())
3882 return;
3883
3884 TypoCorrection::decl_iterator DI = TC.begin(), DE = TC.end();
3885
3886 for (/**/; DI != DE; ++DI)
3887 if (!LookupResult::isVisible(SemaRef, *DI))
3888 break;
3889 // Nothing to do if all decls are visible.
3890 if (DI == DE)
3891 return;
3892
3893 llvm::SmallVector<NamedDecl*, 4> NewDecls(TC.begin(), DI);
3894 bool AnyVisibleDecls = !NewDecls.empty();
3895
3896 for (/**/; DI != DE; ++DI) {
3897 NamedDecl *VisibleDecl = *DI;
3898 if (!LookupResult::isVisible(SemaRef, *DI))
3899 VisibleDecl = findAcceptableDecl(SemaRef, *DI);
3900
3901 if (VisibleDecl) {
3902 if (!AnyVisibleDecls) {
3903 // Found a visible decl, discard all hidden ones.
3904 AnyVisibleDecls = true;
3905 NewDecls.clear();
3906 }
3907 NewDecls.push_back(VisibleDecl);
3908 } else if (!AnyVisibleDecls && !(*DI)->isModulePrivate())
3909 NewDecls.push_back(*DI);
3910 }
3911
3912 if (NewDecls.empty())
3913 TC = TypoCorrection();
3914 else {
3915 TC.setCorrectionDecls(NewDecls);
3916 TC.setRequiresImport(!AnyVisibleDecls);
3917 }
3918}
3919
Douglas Gregor546be3c2009-12-30 17:04:44 +00003920/// \brief Try to "correct" a typo in the source code by finding
3921/// visible declarations whose names are similar to the name that was
3922/// present in the source code.
3923///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003924/// \param TypoName the \c DeclarationNameInfo structure that contains
3925/// the name that was present in the source code along with its location.
3926///
3927/// \param LookupKind the name-lookup criteria used to search for the name.
Douglas Gregor546be3c2009-12-30 17:04:44 +00003928///
3929/// \param S the scope in which name lookup occurs.
3930///
3931/// \param SS the nested-name-specifier that precedes the name we're
3932/// looking for, if present.
3933///
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00003934/// \param CCC A CorrectionCandidateCallback object that provides further
3935/// validation of typo correction candidates. It also provides flags for
3936/// determining the set of keywords permitted.
3937///
Douglas Gregor2dcc0112009-12-31 07:42:17 +00003938/// \param MemberContext if non-NULL, the context in which to look for
3939/// a member access expression.
3940///
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003941/// \param EnteringContext whether we're entering the context described by
Douglas Gregorbb092ba2009-12-31 05:20:13 +00003942/// the nested-name-specifier SS.
3943///
Douglas Gregorf06cdae2010-01-03 18:01:57 +00003944/// \param OPT when non-NULL, the search for visible declarations will
3945/// also walk the protocols in the qualified interfaces of \p OPT.
3946///
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003947/// \returns a \c TypoCorrection containing the corrected name if the typo
3948/// along with information such as the \c NamedDecl where the corrected name
3949/// was declared, and any additional \c NestedNameSpecifier needed to access
3950/// it (C++ only). The \c TypoCorrection is empty if there is no correction.
3951TypoCorrection Sema::CorrectTypo(const DeclarationNameInfo &TypoName,
3952 Sema::LookupNameKind LookupKind,
3953 Scope *S, CXXScopeSpec *SS,
Kaelyn Uhrain16e46dd2012-01-31 23:49:25 +00003954 CorrectionCandidateCallback &CCC,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003955 DeclContext *MemberContext,
3956 bool EnteringContext,
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003957 const ObjCObjectPointerType *OPT) {
Kaelyn Uhrain70571f42013-08-12 19:54:38 +00003958 // Always let the ExternalSource have the first chance at correction, even
3959 // if we would otherwise have given up.
3960 if (ExternalSource) {
3961 if (TypoCorrection Correction = ExternalSource->CorrectTypo(
3962 TypoName, LookupKind, S, SS, CCC, MemberContext, EnteringContext, OPT))
3963 return Correction;
3964 }
3965
David Blaikie4e4d0842012-03-11 07:00:24 +00003966 if (Diags.hasFatalErrorOccurred() || !getLangOpts().SpellChecking)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003967 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003968
Francois Pichet4d604d62011-12-03 15:55:29 +00003969 // In Microsoft mode, don't perform typo correction in a template member
3970 // function dependent context because it interferes with the "lookup into
3971 // dependent bases of class templates" feature.
David Blaikie4e4d0842012-03-11 07:00:24 +00003972 if (getLangOpts().MicrosoftMode && CurContext->isDependentContext() &&
Francois Pichet4d604d62011-12-03 15:55:29 +00003973 isa<CXXMethodDecl>(CurContext))
3974 return TypoCorrection();
3975
Douglas Gregor546be3c2009-12-30 17:04:44 +00003976 // We only attempt to correct typos for identifiers.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003977 IdentifierInfo *Typo = TypoName.getName().getAsIdentifierInfo();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003978 if (!Typo)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003979 return TypoCorrection();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003980
3981 // If the scope specifier itself was invalid, don't try to correct
3982 // typos.
3983 if (SS && SS->isInvalid())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003984 return TypoCorrection();
Douglas Gregor546be3c2009-12-30 17:04:44 +00003985
3986 // Never try to correct typos during template deduction or
3987 // instantiation.
3988 if (!ActiveTemplateInstantiations.empty())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003989 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003990
Argyrios Kyrtzidis57f8da52013-03-14 22:56:43 +00003991 // Don't try to correct 'super'.
3992 if (S && S->isInObjcMethodScope() && Typo == getSuperIdentifier())
3993 return TypoCorrection();
3994
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00003995 NamespaceSpecifierSet Namespaces(Context, CurContext, SS);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00003996
3997 TypoCorrectionConsumer Consumer(*this, Typo);
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00003998
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00003999 // If a callback object considers an empty typo correction candidate to be
4000 // viable, assume it does not do any actual validation of the candidates.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004001 TypoCorrection EmptyCorrection;
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00004002 bool ValidatingCallback = !isCandidateViable(CCC, EmptyCorrection);
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004003
Douglas Gregoraaf87162010-04-14 20:04:41 +00004004 // Perform name lookup to find visible, similarly-named entities.
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004005 bool IsUnqualifiedLookup = false;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004006 DeclContext *QualifiedDC = MemberContext;
Douglas Gregorf06cdae2010-01-03 18:01:57 +00004007 if (MemberContext) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004008 LookupVisibleDecls(MemberContext, LookupKind, Consumer);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00004009
4010 // Look in qualified interfaces.
4011 if (OPT) {
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004012 for (ObjCObjectPointerType::qual_iterator
4013 I = OPT->qual_begin(), E = OPT->qual_end();
Douglas Gregorf06cdae2010-01-03 18:01:57 +00004014 I != E; ++I)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004015 LookupVisibleDecls(*I, LookupKind, Consumer);
Douglas Gregorf06cdae2010-01-03 18:01:57 +00004016 }
4017 } else if (SS && SS->isSet()) {
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004018 QualifiedDC = computeDeclContext(*SS, EnteringContext);
4019 if (!QualifiedDC)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004020 return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004021
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004022 // Provide a stop gap for files that are just seriously broken. Trying
4023 // to correct all typos can turn into a HUGE performance penalty, causing
4024 // some files to take minutes to get rejected by the parser.
4025 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004026 return TypoCorrection();
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004027 ++TyposCorrected;
4028
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004029 LookupVisibleDecls(QualifiedDC, LookupKind, Consumer);
Douglas Gregor546be3c2009-12-30 17:04:44 +00004030 } else {
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004031 IsUnqualifiedLookup = true;
4032 UnqualifiedTyposCorrectedMap::iterator Cached
4033 = UnqualifiedTyposCorrected.find(Typo);
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004034 if (Cached != UnqualifiedTyposCorrected.end()) {
4035 // Add the cached value, unless it's a keyword or fails validation. In the
4036 // keyword case, we'll end up adding the keyword below.
4037 if (Cached->second) {
4038 if (!Cached->second.isKeyword() &&
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00004039 isCandidateViable(CCC, Cached->second))
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004040 Consumer.addCorrection(Cached->second);
4041 } else {
4042 // Only honor no-correction cache hits when a callback that will validate
4043 // correction candidates is not being used.
4044 if (!ValidatingCallback)
4045 return TypoCorrection();
4046 }
4047 }
4048 if (Cached == UnqualifiedTyposCorrected.end()) {
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004049 // Provide a stop gap for files that are just seriously broken. Trying
4050 // to correct all typos can turn into a HUGE performance penalty, causing
4051 // some files to take minutes to get rejected by the parser.
4052 if (TyposCorrected + UnqualifiedTyposCorrected.size() >= 20)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004053 return TypoCorrection();
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004054 }
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004055 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004056
Douglas Gregor01798682012-03-26 16:54:18 +00004057 // Determine whether we are going to search in the various namespaces for
4058 // corrections.
4059 bool SearchNamespaces
Kaelyn Uhrain6d858d92012-04-03 18:20:11 +00004060 = getLangOpts().CPlusPlus &&
Douglas Gregor01798682012-03-26 16:54:18 +00004061 (IsUnqualifiedLookup || (QualifiedDC && QualifiedDC->isNamespace()));
Richard Smithd67679d2013-08-20 20:35:18 +00004062 // In a few cases we *only* want to search for corrections based on just
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00004063 // adding or changing the nested name specifier.
4064 bool AllowOnlyNNSChanges = Typo->getName().size() < 3;
Douglas Gregor01798682012-03-26 16:54:18 +00004065
4066 if (IsUnqualifiedLookup || SearchNamespaces) {
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004067 // For unqualified lookup, look through all of the names that we have
4068 // seen in this translation unit.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004069 // FIXME: Re-add the ability to skip very unlikely potential corrections.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004070 for (IdentifierTable::iterator I = Context.Idents.begin(),
4071 IEnd = Context.Idents.end();
4072 I != IEnd; ++I)
4073 Consumer.FoundName(I->getKey());
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004074
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004075 // Walk through identifiers in external identifier sources.
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004076 // FIXME: Re-add the ability to skip very unlikely potential corrections.
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004077 if (IdentifierInfoLookup *External
4078 = Context.Idents.getExternalIdentifierLookup()) {
Dylan Noblesmith6f42b622012-02-05 02:12:40 +00004079 OwningPtr<IdentifierIterator> Iter(External->getIdentifiers());
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004080 do {
4081 StringRef Name = Iter->Next();
4082 if (Name.empty())
4083 break;
Douglas Gregor95f42922010-10-14 22:11:03 +00004084
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004085 Consumer.FoundName(Name);
4086 } while (true);
Douglas Gregor95f42922010-10-14 22:11:03 +00004087 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00004088 }
4089
Richard Smith0f4b5be2012-06-08 21:35:42 +00004090 AddKeywordsToConsumer(*this, Consumer, S, CCC, SS && SS->isNotEmpty());
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004091
Douglas Gregoraaf87162010-04-14 20:04:41 +00004092 // If we haven't found anything, we're done.
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004093 if (Consumer.empty()) {
4094 // If this was an unqualified lookup, note that no correction was found.
4095 if (IsUnqualifiedLookup)
4096 (void)UnqualifiedTyposCorrected[Typo];
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004097
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004098 return TypoCorrection();
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004099 }
Douglas Gregor546be3c2009-12-30 17:04:44 +00004100
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00004101 // Make sure the best edit distance (prior to adding any namespace qualifiers)
4102 // is not more that about a third of the length of the typo's identifier.
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00004103 unsigned ED = Consumer.getBestEditDistance(true);
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004104 if (ED > 0 && Typo->getName().size() / ED < 3) {
4105 // If this was an unqualified lookup, note that no correction was found.
Douglas Gregor157a3ff2010-10-27 14:20:34 +00004106 if (IsUnqualifiedLookup)
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004107 (void)UnqualifiedTyposCorrected[Typo];
4108
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004109 return TypoCorrection();
4110 }
4111
Douglas Gregor01798682012-03-26 16:54:18 +00004112 // Build the NestedNameSpecifiers for the KnownNamespaces, if we're going
4113 // to search those namespaces.
4114 if (SearchNamespaces) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004115 // Load any externally-known namespaces.
4116 if (ExternalSource && !LoadedExternalKnownNamespaces) {
Chris Lattner5f9e2722011-07-23 10:55:15 +00004117 SmallVector<NamespaceDecl *, 4> ExternalKnownNamespaces;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004118 LoadedExternalKnownNamespaces = true;
4119 ExternalSource->ReadKnownNamespaces(ExternalKnownNamespaces);
4120 for (unsigned I = 0, N = ExternalKnownNamespaces.size(); I != N; ++I)
4121 KnownNamespaces[ExternalKnownNamespaces[I]] = true;
4122 }
4123
Nick Lewycky01a41142013-01-26 00:35:08 +00004124 for (llvm::MapVector<NamespaceDecl*, bool>::iterator
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004125 KNI = KnownNamespaces.begin(),
4126 KNIEnd = KnownNamespaces.end();
4127 KNI != KNIEnd; ++KNI)
4128 Namespaces.AddNamespace(KNI->first);
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004129 }
Douglas Gregore24b5752010-10-14 20:34:08 +00004130
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004131 // Weed out any names that could not be found by name lookup or, if a
4132 // CorrectionCandidateCallback object was provided, failed validation.
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00004133 SmallVector<TypoCorrection, 16> QualifiedResults;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004134 LookupResult TmpRes(*this, TypoName, LookupKind);
4135 TmpRes.suppressDiagnostics();
4136 while (!Consumer.empty()) {
4137 TypoCorrectionConsumer::distance_iterator DI = Consumer.begin();
4138 unsigned ED = DI->first;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004139 for (TypoCorrectionConsumer::result_iterator I = DI->second.begin(),
4140 IEnd = DI->second.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004141 I != IEnd; /* Increment in loop. */) {
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00004142 // If we only want nested name specifier corrections, ignore potential
4143 // corrections that have a different base identifier from the typo.
4144 if (AllowOnlyNNSChanges &&
4145 I->second.front().getCorrectionAsIdentifierInfo() != Typo) {
4146 TypoCorrectionConsumer::result_iterator Prev = I;
4147 ++I;
4148 DI->second.erase(Prev);
4149 continue;
4150 }
4151
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004152 // If the item already has been looked up or is a keyword, keep it.
4153 // If a validator callback object was given, drop the correction
4154 // unless it passes validation.
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004155 bool Viable = false;
Benjamin Kramerb3996962012-07-27 10:21:08 +00004156 for (TypoResultList::iterator RI = I->second.begin();
4157 RI != I->second.end(); /* Increment in loop. */) {
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004158 TypoResultList::iterator Prev = RI;
4159 ++RI;
4160 if (Prev->isResolved()) {
4161 if (!isCandidateViable(CCC, *Prev))
Benjamin Kramerb3996962012-07-27 10:21:08 +00004162 RI = I->second.erase(Prev);
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004163 else
4164 Viable = true;
4165 }
4166 }
4167 if (Viable || I->second.empty()) {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004168 TypoCorrectionConsumer::result_iterator Prev = I;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004169 ++I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004170 if (!Viable)
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004171 DI->second.erase(Prev);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004172 continue;
Douglas Gregore24b5752010-10-14 20:34:08 +00004173 }
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004174 assert(I->second.size() == 1 && "Expected a single unresolved candidate");
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004175
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004176 // Perform name lookup on this name.
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004177 TypoCorrection &Candidate = I->second.front();
4178 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
Kaelyn Uhrainb2567dd2013-07-02 23:47:44 +00004179 DeclContext *TempMemberContext = MemberContext;
4180 CXXScopeSpec *TempSS = SS;
4181retry_lookup:
4182 LookupPotentialTypoResult(*this, TmpRes, Name, S, TempSS,
4183 TempMemberContext, EnteringContext,
Richard Smithd67679d2013-08-20 20:35:18 +00004184 CCC.IsObjCIvarLookup,
4185 Name == TypoName.getName() &&
4186 !Candidate.WillReplaceSpecifier());
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004187
4188 switch (TmpRes.getResultKind()) {
4189 case LookupResult::NotFound:
4190 case LookupResult::NotFoundInCurrentInstantiation:
Kaelyn Uhrain82340e82011-09-07 20:25:59 +00004191 case LookupResult::FoundUnresolvedValue:
Kaelyn Uhrainb2567dd2013-07-02 23:47:44 +00004192 if (TempSS) {
4193 // Immediately retry the lookup without the given CXXScopeSpec
4194 TempSS = NULL;
4195 Candidate.WillReplaceSpecifier(true);
4196 goto retry_lookup;
4197 }
4198 if (TempMemberContext) {
4199 if (SS && !TempSS)
4200 TempSS = SS;
4201 TempMemberContext = NULL;
4202 goto retry_lookup;
4203 }
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004204 QualifiedResults.push_back(Candidate);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004205 // We didn't find this name in our scope, or didn't like what we found;
4206 // ignore it.
4207 {
4208 TypoCorrectionConsumer::result_iterator Next = I;
4209 ++Next;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004210 DI->second.erase(I);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004211 I = Next;
4212 }
4213 break;
4214
4215 case LookupResult::Ambiguous:
4216 // We don't deal with ambiguities.
4217 return TypoCorrection();
4218
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004219 case LookupResult::FoundOverloaded: {
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004220 TypoCorrectionConsumer::result_iterator Prev = I;
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004221 // Store all of the Decls for overloaded symbols
4222 for (LookupResult::iterator TRD = TmpRes.begin(),
4223 TRDEnd = TmpRes.end();
4224 TRD != TRDEnd; ++TRD)
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004225 Candidate.addCorrectionDecl(*TRD);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004226 ++I;
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004227 if (!isCandidateViable(CCC, Candidate)) {
4228 QualifiedResults.push_back(Candidate);
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004229 DI->second.erase(Prev);
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004230 }
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004231 break;
4232 }
4233
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004234 case LookupResult::Found: {
4235 TypoCorrectionConsumer::result_iterator Prev = I;
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004236 Candidate.setCorrectionDecl(TmpRes.getAsSingle<NamedDecl>());
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004237 ++I;
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004238 if (!isCandidateViable(CCC, Candidate)) {
4239 QualifiedResults.push_back(Candidate);
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004240 DI->second.erase(Prev);
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004241 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004242 break;
4243 }
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004244
4245 }
Douglas Gregore24b5752010-10-14 20:34:08 +00004246 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004247
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004248 if (DI->second.empty())
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004249 Consumer.erase(DI);
David Blaikie4e4d0842012-03-11 07:00:24 +00004250 else if (!getLangOpts().CPlusPlus || QualifiedResults.empty() || !ED)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004251 // If there are results in the closest possible bucket, stop
4252 break;
4253
4254 // Only perform the qualified lookups for C++
Douglas Gregor01798682012-03-26 16:54:18 +00004255 if (SearchNamespaces) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004256 TmpRes.suppressDiagnostics();
Dmitri Gribenkocfa88f82013-01-12 19:30:44 +00004257 for (SmallVector<TypoCorrection,
4258 16>::iterator QRI = QualifiedResults.begin(),
4259 QRIEnd = QualifiedResults.end();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004260 QRI != QRIEnd; ++QRI) {
4261 for (NamespaceSpecifierSet::iterator NI = Namespaces.begin(),
4262 NIEnd = Namespaces.end();
4263 NI != NIEnd; ++NI) {
4264 DeclContext *Ctx = NI->DeclCtx;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004265
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004266 // FIXME: Stop searching once the namespaces are too far away to create
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004267 // acceptable corrections for this identifier (since the namespaces
Kaelyn Uhrainbb3d9972012-02-07 01:32:58 +00004268 // are sorted in ascending order by edit distance).
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004269
4270 TmpRes.clear();
Kaelyn Uhrain63aae822012-02-14 18:56:48 +00004271 TmpRes.setLookupName(QRI->getCorrectionAsIdentifierInfo());
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004272 if (!LookupQualifiedName(TmpRes, Ctx)) continue;
4273
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004274 // Any corrections added below will be validated in subsequent
4275 // iterations of the main while() loop over the Consumer's contents.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004276 switch (TmpRes.getResultKind()) {
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004277 case LookupResult::Found:
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004278 case LookupResult::FoundOverloaded: {
4279 TypoCorrection TC(*QRI);
4280 TC.setCorrectionSpecifier(NI->NameSpecifier);
4281 TC.setQualifierDistance(NI->EditDistance);
Kaelyn Uhraincaa16dd2013-07-02 23:47:35 +00004282 TC.setCallbackDistance(0); // Reset the callback distance
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004283 for (LookupResult::iterator TRD = TmpRes.begin(),
4284 TRDEnd = TmpRes.end();
4285 TRD != TRDEnd; ++TRD)
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004286 TC.addCorrectionDecl(*TRD);
4287 Consumer.addCorrection(TC);
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004288 break;
Kaelyn Uhrain2d4d7fd2012-02-15 22:14:18 +00004289 }
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004290 case LookupResult::NotFound:
4291 case LookupResult::NotFoundInCurrentInstantiation:
4292 case LookupResult::Ambiguous:
Kaelyn Uhrain82340e82011-09-07 20:25:59 +00004293 case LookupResult::FoundUnresolvedValue:
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004294 break;
4295 }
4296 }
4297 }
4298 }
4299
4300 QualifiedResults.clear();
4301 }
4302
4303 // No corrections remain...
4304 if (Consumer.empty()) return TypoCorrection();
4305
Kaelyn Uhrain396e0a82012-05-31 23:32:58 +00004306 TypoResultsMap &BestResults = Consumer.getBestResults();
4307 ED = Consumer.getBestEditDistance(true);
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004308
Kaelyn Uhrain8d3607b2012-06-06 20:54:51 +00004309 if (!AllowOnlyNNSChanges && ED > 0 && Typo->getName().size() / ED < 3) {
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004310 // If this was an unqualified lookup and we believe the callback
4311 // object wouldn't have filtered out possible corrections, note
4312 // that no correction was found.
4313 if (IsUnqualifiedLookup && !ValidatingCallback)
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004314 (void)UnqualifiedTyposCorrected[Typo];
4315
4316 return TypoCorrection();
4317 }
4318
Douglas Gregore24b5752010-10-14 20:34:08 +00004319 // If only a single name remains, return that result.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004320 if (BestResults.size() == 1) {
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004321 const TypoResultList &CorrectionList = BestResults.begin()->second;
4322 const TypoCorrection &Result = CorrectionList.front();
4323 if (CorrectionList.size() != 1) return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004324
Douglas Gregor53e4b552010-10-26 17:18:00 +00004325 // Don't correct to a keyword that's the same as the typo; the keyword
4326 // wasn't actually in scope.
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004327 if (ED == 0 && Result.isKeyword()) return TypoCorrection();
4328
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004329 // Record the correction for unqualified lookup.
4330 if (IsUnqualifiedLookup)
4331 UnqualifiedTyposCorrected[Typo] = Result;
4332
David Blaikie6952c012012-10-12 20:00:44 +00004333 TypoCorrection TC = Result;
4334 TC.setCorrectionRange(SS, TypoName);
Richard Smithd67679d2013-08-20 20:35:18 +00004335 checkCorrectionVisibility(*this, TC, TypoName.getName());
David Blaikie6952c012012-10-12 20:00:44 +00004336 return TC;
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004337 }
Kaelyn Uhrain7d5e6942012-01-11 19:37:46 +00004338 else if (BestResults.size() > 1
4339 // Ugly hack equivalent to CTC == CTC_ObjCMessageReceiver;
4340 // WantObjCSuper is only true for CTC_ObjCMessageReceiver and for
4341 // some instances of CTC_Unknown, while WantRemainingKeywords is true
4342 // for CTC_Unknown but not for CTC_ObjCMessageReceiver.
Kaelyn Uhrain16e46dd2012-01-31 23:49:25 +00004343 && CCC.WantObjCSuper && !CCC.WantRemainingKeywords
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004344 && BestResults["super"].front().isKeyword()) {
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004345 // Prefer 'super' when we're completing in a message-receiver
4346 // context.
4347
4348 // Don't correct to a keyword that's the same as the typo; the keyword
4349 // wasn't actually in scope.
4350 if (ED == 0) return TypoCorrection();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004351
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004352 // Record the correction for unqualified lookup.
4353 if (IsUnqualifiedLookup)
Kaelyn Uhrain784ae8e2012-06-01 18:11:16 +00004354 UnqualifiedTyposCorrected[Typo] = BestResults["super"].front();
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004355
David Blaikie6952c012012-10-12 20:00:44 +00004356 TypoCorrection TC = BestResults["super"].front();
4357 TC.setCorrectionRange(SS, TypoName);
4358 return TC;
Douglas Gregor7b824e82010-10-15 13:35:25 +00004359 }
NAKAMURA Takumidfbb02a2011-01-27 07:10:08 +00004360
Kaelyn Uhrain438ee1f2012-01-23 20:18:59 +00004361 // If this was an unqualified lookup and we believe the callback object did
4362 // not filter out possible corrections, note that no correction was found.
4363 if (IsUnqualifiedLookup && !ValidatingCallback)
Douglas Gregor3eedbb02010-10-20 01:32:02 +00004364 (void)UnqualifiedTyposCorrected[Typo];
4365
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004366 return TypoCorrection();
4367}
4368
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004369void TypoCorrection::addCorrectionDecl(NamedDecl *CDecl) {
4370 if (!CDecl) return;
4371
4372 if (isKeyword())
4373 CorrectionDecls.clear();
4374
Kaelyn Uhrain728948f2012-11-19 18:49:53 +00004375 CorrectionDecls.push_back(CDecl->getUnderlyingDecl());
Kaelyn Uhrainf0c1d8f2011-08-03 20:36:05 +00004376
4377 if (!CorrectionName)
4378 CorrectionName = CDecl->getDeclName();
4379}
4380
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004381std::string TypoCorrection::getAsString(const LangOptions &LO) const {
4382 if (CorrectionNameSpec) {
4383 std::string tmpBuffer;
4384 llvm::raw_string_ostream PrefixOStream(tmpBuffer);
4385 CorrectionNameSpec->print(PrefixOStream, PrintingPolicy(LO));
David Blaikie17828ca2013-05-14 21:04:00 +00004386 PrefixOStream << CorrectionName;
Benjamin Kramer34f9dc42012-04-14 08:26:28 +00004387 return PrefixOStream.str();
Douglas Gregord8bba9c2011-06-28 16:20:02 +00004388 }
4389
4390 return CorrectionName.getAsString();
Douglas Gregor546be3c2009-12-30 17:04:44 +00004391}
Kaelyn Uhrain20a7cf42013-04-03 16:59:49 +00004392
4393bool CorrectionCandidateCallback::ValidateCandidate(const TypoCorrection &candidate) {
4394 if (!candidate.isResolved())
4395 return true;
4396
4397 if (candidate.isKeyword())
4398 return WantTypeSpecifiers || WantExpressionKeywords || WantCXXNamedCasts ||
4399 WantRemainingKeywords || WantObjCSuper;
4400
4401 for (TypoCorrection::const_decl_iterator CDecl = candidate.begin(),
4402 CDeclEnd = candidate.end();
4403 CDecl != CDeclEnd; ++CDecl) {
4404 if (!isa<TypeDecl>(*CDecl))
4405 return true;
4406 }
4407
4408 return WantTypeSpecifiers;
4409}
Kaelyn Uhrain761695f2013-07-08 23:13:39 +00004410
4411FunctionCallFilterCCC::FunctionCallFilterCCC(Sema &SemaRef, unsigned NumArgs,
4412 bool HasExplicitTemplateArgs)
4413 : NumArgs(NumArgs), HasExplicitTemplateArgs(HasExplicitTemplateArgs) {
4414 WantTypeSpecifiers = SemaRef.getLangOpts().CPlusPlus;
4415 WantRemainingKeywords = false;
4416}
4417
4418bool FunctionCallFilterCCC::ValidateCandidate(const TypoCorrection &candidate) {
4419 if (!candidate.getCorrectionDecl())
4420 return candidate.isKeyword();
4421
4422 for (TypoCorrection::const_decl_iterator DI = candidate.begin(),
4423 DIEnd = candidate.end();
4424 DI != DIEnd; ++DI) {
4425 FunctionDecl *FD = 0;
4426 NamedDecl *ND = (*DI)->getUnderlyingDecl();
4427 if (FunctionTemplateDecl *FTD = dyn_cast<FunctionTemplateDecl>(ND))
4428 FD = FTD->getTemplatedDecl();
4429 if (!HasExplicitTemplateArgs && !FD) {
4430 if (!(FD = dyn_cast<FunctionDecl>(ND)) && isa<ValueDecl>(ND)) {
4431 // If the Decl is neither a function nor a template function,
4432 // determine if it is a pointer or reference to a function. If so,
4433 // check against the number of arguments expected for the pointee.
4434 QualType ValType = cast<ValueDecl>(ND)->getType();
4435 if (ValType->isAnyPointerType() || ValType->isReferenceType())
4436 ValType = ValType->getPointeeType();
4437 if (const FunctionProtoType *FPT = ValType->getAs<FunctionProtoType>())
4438 if (FPT->getNumArgs() == NumArgs)
4439 return true;
4440 }
4441 }
4442 if (FD && FD->getNumParams() >= NumArgs &&
4443 FD->getMinRequiredArguments() <= NumArgs)
4444 return true;
4445 }
4446 return false;
4447}
Richard Smith2d670972013-08-17 00:46:16 +00004448
4449void Sema::diagnoseTypo(const TypoCorrection &Correction,
4450 const PartialDiagnostic &TypoDiag,
4451 bool ErrorRecovery) {
4452 diagnoseTypo(Correction, TypoDiag, PDiag(diag::note_previous_decl),
4453 ErrorRecovery);
4454}
4455
Richard Smithd67679d2013-08-20 20:35:18 +00004456/// Find which declaration we should import to provide the definition of
4457/// the given declaration.
4458static const NamedDecl *getDefinitionToImport(const NamedDecl *D) {
4459 if (const VarDecl *VD = dyn_cast<VarDecl>(D))
4460 return VD->getDefinition();
4461 if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(D))
4462 return FD->isDefined(FD) ? FD : 0;
4463 if (const TagDecl *TD = dyn_cast<TagDecl>(D))
4464 return TD->getDefinition();
4465 if (const ObjCInterfaceDecl *ID = dyn_cast<ObjCInterfaceDecl>(D))
4466 return ID->getDefinition();
4467 if (const ObjCProtocolDecl *PD = dyn_cast<ObjCProtocolDecl>(D))
4468 return PD->getDefinition();
4469 if (const TemplateDecl *TD = dyn_cast<TemplateDecl>(D))
4470 return getDefinitionToImport(TD->getTemplatedDecl());
4471 return 0;
4472}
4473
Richard Smith2d670972013-08-17 00:46:16 +00004474/// \brief Diagnose a successfully-corrected typo. Separated from the correction
4475/// itself to allow external validation of the result, etc.
4476///
4477/// \param Correction The result of performing typo correction.
4478/// \param TypoDiag The diagnostic to produce. This will have the corrected
4479/// string added to it (and usually also a fixit).
4480/// \param PrevNote A note to use when indicating the location of the entity to
4481/// which we are correcting. Will have the correction string added to it.
4482/// \param ErrorRecovery If \c true (the default), the caller is going to
4483/// recover from the typo as if the corrected string had been typed.
4484/// In this case, \c PDiag must be an error, and we will attach a fixit
4485/// to it.
4486void Sema::diagnoseTypo(const TypoCorrection &Correction,
4487 const PartialDiagnostic &TypoDiag,
4488 const PartialDiagnostic &PrevNote,
4489 bool ErrorRecovery) {
4490 std::string CorrectedStr = Correction.getAsString(getLangOpts());
4491 std::string CorrectedQuotedStr = Correction.getQuoted(getLangOpts());
4492 FixItHint FixTypo = FixItHint::CreateReplacement(
4493 Correction.getCorrectionRange(), CorrectedStr);
4494
Richard Smithd67679d2013-08-20 20:35:18 +00004495 // Maybe we're just missing a module import.
4496 if (Correction.requiresImport()) {
4497 NamedDecl *Decl = Correction.getCorrectionDecl();
4498 assert(Decl && "import required but no declaration to import");
4499
4500 // Suggest importing a module providing the definition of this entity, if
4501 // possible.
4502 const NamedDecl *Def = getDefinitionToImport(Decl);
4503 if (!Def)
4504 Def = Decl;
4505 Module *Owner = Def->getOwningModule();
4506 assert(Owner && "definition of hidden declaration is not in a module");
4507
4508 Diag(Correction.getCorrectionRange().getBegin(),
4509 diag::err_module_private_declaration)
4510 << Def << Owner->getFullModuleName();
4511 Diag(Def->getLocation(), diag::note_previous_declaration);
4512
4513 // Recover by implicitly importing this module.
4514 if (!isSFINAEContext() && ErrorRecovery)
4515 createImplicitModuleImport(Correction.getCorrectionRange().getBegin(),
4516 Owner);
4517 return;
4518 }
4519
Richard Smith2d670972013-08-17 00:46:16 +00004520 Diag(Correction.getCorrectionRange().getBegin(), TypoDiag)
4521 << CorrectedQuotedStr << (ErrorRecovery ? FixTypo : FixItHint());
4522
4523 NamedDecl *ChosenDecl =
4524 Correction.isKeyword() ? 0 : Correction.getCorrectionDecl();
4525 if (PrevNote.getDiagID() && ChosenDecl)
4526 Diag(ChosenDecl->getLocation(), PrevNote)
4527 << CorrectedQuotedStr << (ErrorRecovery ? FixItHint() : FixTypo);
4528}