Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 1 | //===--- DeclBase.cpp - Declaration AST Node Implementation ---------------===// |
| 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 the Decl and DeclContext classes. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "clang/AST/DeclBase.h" |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 15 | #include "clang/AST/Decl.h" |
Argyrios Kyrtzidis | d3bb44f | 2008-06-09 21:05:31 +0000 | [diff] [blame] | 16 | #include "clang/AST/DeclCXX.h" |
Douglas Gregor | aaba5e3 | 2009-02-04 19:02:06 +0000 | [diff] [blame] | 17 | #include "clang/AST/DeclObjC.h" |
| 18 | #include "clang/AST/DeclTemplate.h" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 19 | #include "clang/AST/ASTContext.h" |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 20 | #include "clang/AST/Type.h" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 21 | #include "llvm/ADT/DenseMap.h" |
Douglas Gregor | 6ed40e3 | 2008-12-23 21:05:05 +0000 | [diff] [blame] | 22 | #include <algorithm> |
| 23 | #include <functional> |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 24 | #include <vector> |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 25 | using namespace clang; |
| 26 | |
| 27 | //===----------------------------------------------------------------------===// |
| 28 | // Statistics |
| 29 | //===----------------------------------------------------------------------===// |
| 30 | |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 31 | #define DECL(Derived, Base) static int n##Derived##s = 0; |
| 32 | #include "clang/AST/DeclNodes.def" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 33 | |
| 34 | static bool StatSwitch = false; |
| 35 | |
| 36 | // This keeps track of all decl attributes. Since so few decls have attrs, we |
| 37 | // keep them in a hash map instead of wasting space in the Decl class. |
| 38 | typedef llvm::DenseMap<const Decl*, Attr*> DeclAttrMapTy; |
| 39 | |
| 40 | static DeclAttrMapTy *DeclAttrs = 0; |
| 41 | |
| 42 | const char *Decl::getDeclKindName() const { |
| 43 | switch (DeclKind) { |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 44 | default: assert(0 && "Declaration not in DeclNodes.def!"); |
| 45 | #define DECL(Derived, Base) case Derived: return #Derived; |
| 46 | #include "clang/AST/DeclNodes.def" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 47 | } |
| 48 | } |
| 49 | |
Steve Naroff | 0a47393 | 2009-01-20 19:53:53 +0000 | [diff] [blame] | 50 | const char *DeclContext::getDeclKindName() const { |
| 51 | switch (DeclKind) { |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 52 | default: assert(0 && "Declaration context not in DeclNodes.def!"); |
Argyrios Kyrtzidis | 1ad4dd7 | 2009-02-16 14:28:33 +0000 | [diff] [blame] | 53 | #define DECL(Derived, Base) case Decl::Derived: return #Derived; |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 54 | #include "clang/AST/DeclNodes.def" |
Steve Naroff | 0a47393 | 2009-01-20 19:53:53 +0000 | [diff] [blame] | 55 | } |
| 56 | } |
| 57 | |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 58 | bool Decl::CollectingStats(bool Enable) { |
| 59 | if (Enable) |
| 60 | StatSwitch = true; |
| 61 | return StatSwitch; |
| 62 | } |
| 63 | |
| 64 | void Decl::PrintStats() { |
| 65 | fprintf(stderr, "*** Decl Stats:\n"); |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 66 | |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 67 | int totalDecls = 0; |
| 68 | #define DECL(Derived, Base) totalDecls += n##Derived##s; |
| 69 | #include "clang/AST/DeclNodes.def" |
| 70 | fprintf(stderr, " %d decls total.\n", totalDecls); |
| 71 | |
| 72 | int totalBytes = 0; |
| 73 | #define DECL(Derived, Base) \ |
| 74 | if (n##Derived##s > 0) { \ |
| 75 | totalBytes += (int)(n##Derived##s * sizeof(Derived##Decl)); \ |
| 76 | fprintf(stderr, " %d " #Derived " decls, %d each (%d bytes)\n", \ |
| 77 | n##Derived##s, (int)sizeof(Derived##Decl), \ |
| 78 | (int)(n##Derived##s * sizeof(Derived##Decl))); \ |
| 79 | } |
| 80 | #include "clang/AST/DeclNodes.def" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 81 | |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 82 | fprintf(stderr, "Total bytes = %d\n", totalBytes); |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 83 | } |
| 84 | |
| 85 | void Decl::addDeclKind(Kind k) { |
| 86 | switch (k) { |
Douglas Gregor | 64650af | 2009-02-02 23:39:07 +0000 | [diff] [blame] | 87 | default: assert(0 && "Declaration not in DeclNodes.def!"); |
| 88 | #define DECL(Derived, Base) case Derived: ++n##Derived##s; break; |
| 89 | #include "clang/AST/DeclNodes.def" |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 90 | } |
| 91 | } |
| 92 | |
| 93 | //===----------------------------------------------------------------------===// |
| 94 | // Decl Implementation |
| 95 | //===----------------------------------------------------------------------===// |
| 96 | |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 97 | void Decl::setDeclContext(DeclContext *DC) { |
| 98 | if (isOutOfSemaDC()) |
| 99 | delete getMultipleDC(); |
| 100 | |
| 101 | DeclCtx = reinterpret_cast<uintptr_t>(DC); |
| 102 | } |
| 103 | |
| 104 | void Decl::setLexicalDeclContext(DeclContext *DC) { |
| 105 | if (DC == getLexicalDeclContext()) |
| 106 | return; |
| 107 | |
| 108 | if (isInSemaDC()) { |
| 109 | MultipleDC *MDC = new MultipleDC(); |
| 110 | MDC->SemanticDC = getDeclContext(); |
| 111 | MDC->LexicalDC = DC; |
| 112 | DeclCtx = reinterpret_cast<uintptr_t>(MDC) | 0x1; |
| 113 | } else { |
| 114 | getMultipleDC()->LexicalDC = DC; |
| 115 | } |
| 116 | } |
| 117 | |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 118 | // Out-of-line virtual method providing a home for Decl. |
| 119 | Decl::~Decl() { |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 120 | if (isOutOfSemaDC()) |
| 121 | delete getMultipleDC(); |
| 122 | |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 123 | if (!HasAttrs) |
| 124 | return; |
| 125 | |
| 126 | DeclAttrMapTy::iterator it = DeclAttrs->find(this); |
| 127 | assert(it != DeclAttrs->end() && "No attrs found but HasAttrs is true!"); |
| 128 | |
| 129 | // release attributes. |
| 130 | delete it->second; |
| 131 | invalidateAttrs(); |
| 132 | } |
| 133 | |
| 134 | void Decl::addAttr(Attr *NewAttr) { |
| 135 | if (!DeclAttrs) |
| 136 | DeclAttrs = new DeclAttrMapTy(); |
| 137 | |
| 138 | Attr *&ExistingAttr = (*DeclAttrs)[this]; |
| 139 | |
| 140 | NewAttr->setNext(ExistingAttr); |
| 141 | ExistingAttr = NewAttr; |
| 142 | |
| 143 | HasAttrs = true; |
| 144 | } |
| 145 | |
| 146 | void Decl::invalidateAttrs() { |
| 147 | if (!HasAttrs) return; |
| 148 | |
| 149 | HasAttrs = false; |
| 150 | (*DeclAttrs)[this] = 0; |
| 151 | DeclAttrs->erase(this); |
| 152 | |
| 153 | if (DeclAttrs->empty()) { |
| 154 | delete DeclAttrs; |
| 155 | DeclAttrs = 0; |
| 156 | } |
| 157 | } |
| 158 | |
| 159 | const Attr *Decl::getAttrs() const { |
| 160 | if (!HasAttrs) |
| 161 | return 0; |
| 162 | |
| 163 | return (*DeclAttrs)[this]; |
| 164 | } |
| 165 | |
| 166 | void Decl::swapAttrs(Decl *RHS) { |
| 167 | bool HasLHSAttr = this->HasAttrs; |
| 168 | bool HasRHSAttr = RHS->HasAttrs; |
| 169 | |
| 170 | // Usually, neither decl has attrs, nothing to do. |
| 171 | if (!HasLHSAttr && !HasRHSAttr) return; |
| 172 | |
| 173 | // If 'this' has no attrs, swap the other way. |
| 174 | if (!HasLHSAttr) |
| 175 | return RHS->swapAttrs(this); |
| 176 | |
| 177 | // Handle the case when both decls have attrs. |
| 178 | if (HasRHSAttr) { |
| 179 | std::swap((*DeclAttrs)[this], (*DeclAttrs)[RHS]); |
| 180 | return; |
| 181 | } |
| 182 | |
| 183 | // Otherwise, LHS has an attr and RHS doesn't. |
| 184 | (*DeclAttrs)[RHS] = (*DeclAttrs)[this]; |
| 185 | (*DeclAttrs).erase(this); |
| 186 | this->HasAttrs = false; |
| 187 | RHS->HasAttrs = true; |
| 188 | } |
| 189 | |
| 190 | |
| 191 | void Decl::Destroy(ASTContext& C) { |
Douglas Gregor | a0fc55f | 2009-01-13 19:47:12 +0000 | [diff] [blame] | 192 | #if 0 |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 193 | // FIXME: Once ownership is fully understood, we can enable this code |
| 194 | if (DeclContext *DC = dyn_cast<DeclContext>(this)) |
| 195 | DC->decls_begin()->Destroy(C); |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 196 | |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 197 | // Observe the unrolled recursion. By setting N->NextDeclInScope = 0x0 |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 198 | // within the loop, only the Destroy method for the first Decl |
| 199 | // will deallocate all of the Decls in a chain. |
| 200 | |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 201 | Decl* N = NextDeclInScope; |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 202 | |
| 203 | while (N) { |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 204 | Decl* Tmp = N->NextDeclInScope; |
| 205 | N->NextDeclInScope = 0; |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 206 | N->Destroy(C); |
| 207 | N = Tmp; |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 208 | } |
Douglas Gregor | a0fc55f | 2009-01-13 19:47:12 +0000 | [diff] [blame] | 209 | |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 210 | this->~Decl(); |
Steve Naroff | 3e97049 | 2009-01-27 21:25:57 +0000 | [diff] [blame] | 211 | C.Deallocate((void *)this); |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 212 | #endif |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 213 | } |
| 214 | |
Argyrios Kyrtzidis | 42220c5 | 2008-10-12 16:14:48 +0000 | [diff] [blame] | 215 | Decl *Decl::castFromDeclContext (const DeclContext *D) { |
Argyrios Kyrtzidis | 3d7641e | 2009-02-16 14:29:28 +0000 | [diff] [blame] | 216 | Decl::Kind DK = D->getDeclKind(); |
| 217 | switch(DK) { |
| 218 | #define DECL_CONTEXT(Name) \ |
| 219 | case Decl::Name: \ |
| 220 | return static_cast<Name##Decl*>(const_cast<DeclContext*>(D)); |
| 221 | #define DECL_CONTEXT_BASE(Name) |
| 222 | #include "clang/AST/DeclNodes.def" |
| 223 | default: |
| 224 | #define DECL_CONTEXT_BASE(Name) \ |
| 225 | if (DK >= Decl::Name##First && DK <= Decl::Name##Last) \ |
| 226 | return static_cast<Name##Decl*>(const_cast<DeclContext*>(D)); |
| 227 | #include "clang/AST/DeclNodes.def" |
| 228 | assert(false && "a decl that inherits DeclContext isn't handled"); |
| 229 | return 0; |
| 230 | } |
Argyrios Kyrtzidis | 42220c5 | 2008-10-12 16:14:48 +0000 | [diff] [blame] | 231 | } |
| 232 | |
| 233 | DeclContext *Decl::castToDeclContext(const Decl *D) { |
Argyrios Kyrtzidis | 3d7641e | 2009-02-16 14:29:28 +0000 | [diff] [blame] | 234 | Decl::Kind DK = D->getKind(); |
| 235 | switch(DK) { |
| 236 | #define DECL_CONTEXT(Name) \ |
| 237 | case Decl::Name: \ |
| 238 | return static_cast<Name##Decl*>(const_cast<Decl*>(D)); |
| 239 | #define DECL_CONTEXT_BASE(Name) |
| 240 | #include "clang/AST/DeclNodes.def" |
| 241 | default: |
| 242 | #define DECL_CONTEXT_BASE(Name) \ |
| 243 | if (DK >= Decl::Name##First && DK <= Decl::Name##Last) \ |
| 244 | return static_cast<Name##Decl*>(const_cast<Decl*>(D)); |
| 245 | #include "clang/AST/DeclNodes.def" |
| 246 | assert(false && "a decl that inherits DeclContext isn't handled"); |
| 247 | return 0; |
| 248 | } |
Argyrios Kyrtzidis | 42220c5 | 2008-10-12 16:14:48 +0000 | [diff] [blame] | 249 | } |
| 250 | |
Eli Friedman | 56d2937 | 2008-06-07 16:52:53 +0000 | [diff] [blame] | 251 | //===----------------------------------------------------------------------===// |
| 252 | // DeclContext Implementation |
| 253 | //===----------------------------------------------------------------------===// |
| 254 | |
Argyrios Kyrtzidis | 3d7641e | 2009-02-16 14:29:28 +0000 | [diff] [blame] | 255 | bool DeclContext::classof(const Decl *D) { |
| 256 | switch (D->getKind()) { |
| 257 | #define DECL_CONTEXT(Name) case Decl::Name: |
| 258 | #define DECL_CONTEXT_BASE(Name) |
| 259 | #include "clang/AST/DeclNodes.def" |
| 260 | return true; |
| 261 | default: |
| 262 | #define DECL_CONTEXT_BASE(Name) \ |
| 263 | if (D->getKind() >= Decl::Name##First && \ |
| 264 | D->getKind() <= Decl::Name##Last) \ |
| 265 | return true; |
| 266 | #include "clang/AST/DeclNodes.def" |
| 267 | return false; |
| 268 | } |
| 269 | } |
| 270 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 271 | // FIXME: We really want to use a DenseSet here to eliminate the |
| 272 | // redundant storage of the declaration names, but (1) it doesn't give |
| 273 | // us the ability to search based on DeclarationName, (2) we really |
| 274 | // need something more like a DenseMultiSet, and (3) it's |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 275 | // implemented in terms of DenseMap anyway. However, this data |
| 276 | // structure is really space-inefficient, so we'll have to do |
| 277 | // something. |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 278 | typedef llvm::DenseMap<DeclarationName, std::vector<NamedDecl*> > |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 279 | StoredDeclsMap; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 280 | |
| 281 | DeclContext::~DeclContext() { |
| 282 | unsigned Size = LookupPtr.getInt(); |
Chris Lattner | 9194250 | 2009-02-20 00:55:03 +0000 | [diff] [blame] | 283 | if (Size == LookupIsMap) |
| 284 | delete static_cast<StoredDeclsMap*>(LookupPtr.getPointer()); |
| 285 | else |
| 286 | delete [] static_cast<NamedDecl**>(LookupPtr.getPointer()); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 287 | } |
| 288 | |
| 289 | void DeclContext::DestroyDecls(ASTContext &C) { |
Douglas Gregor | 00ad0ef | 2009-01-20 04:25:11 +0000 | [diff] [blame] | 290 | for (decl_iterator D = decls_begin(); D != decls_end(); ) |
| 291 | (*D++)->Destroy(C); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 292 | } |
| 293 | |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 294 | bool DeclContext::isTransparentContext() const { |
| 295 | if (DeclKind == Decl::Enum) |
| 296 | return true; // FIXME: Check for C++0x scoped enums |
| 297 | else if (DeclKind == Decl::LinkageSpec) |
| 298 | return true; |
| 299 | else if (DeclKind == Decl::Record || DeclKind == Decl::CXXRecord) |
Douglas Gregor | bcbffc4 | 2009-01-07 00:43:41 +0000 | [diff] [blame] | 300 | return cast<RecordDecl>(this)->isAnonymousStructOrUnion(); |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 301 | else if (DeclKind == Decl::Namespace) |
| 302 | return false; // FIXME: Check for C++0x inline namespaces |
| 303 | |
| 304 | return false; |
| 305 | } |
| 306 | |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 307 | DeclContext *DeclContext::getPrimaryContext() { |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 308 | switch (DeclKind) { |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 309 | case Decl::TranslationUnit: |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 310 | case Decl::LinkageSpec: |
| 311 | case Decl::Block: |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 312 | // There is only one DeclContext for these entities. |
| 313 | return this; |
| 314 | |
| 315 | case Decl::Namespace: |
| 316 | // The original namespace is our primary context. |
| 317 | return static_cast<NamespaceDecl*>(this)->getOriginalNamespace(); |
| 318 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 319 | case Decl::ObjCMethod: |
| 320 | return this; |
| 321 | |
| 322 | case Decl::ObjCInterface: |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 323 | case Decl::ObjCProtocol: |
| 324 | case Decl::ObjCCategory: |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 325 | // FIXME: Can Objective-C interfaces be forward-declared? |
| 326 | return this; |
| 327 | |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 328 | case Decl::ObjCImplementation: |
| 329 | case Decl::ObjCCategoryImpl: |
| 330 | return this; |
| 331 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 332 | default: |
Douglas Gregor | cc63668 | 2009-02-17 23:15:12 +0000 | [diff] [blame] | 333 | if (DeclKind >= Decl::TagFirst && DeclKind <= Decl::TagLast) { |
| 334 | // If this is a tag type that has a definition or is currently |
| 335 | // being defined, that definition is our primary context. |
| 336 | if (TagType *TagT |
| 337 | = cast_or_null<TagType>(cast<TagDecl>(this)->TypeForDecl)) |
| 338 | if (TagT->isBeingDefined() || |
| 339 | (TagT->getDecl() && TagT->getDecl()->isDefinition())) |
| 340 | return TagT->getDecl(); |
| 341 | return this; |
| 342 | } |
| 343 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 344 | assert(DeclKind >= Decl::FunctionFirst && DeclKind <= Decl::FunctionLast && |
| 345 | "Unknown DeclContext kind"); |
| 346 | return this; |
| 347 | } |
| 348 | } |
| 349 | |
| 350 | DeclContext *DeclContext::getNextContext() { |
| 351 | switch (DeclKind) { |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 352 | case Decl::Namespace: |
| 353 | // Return the next namespace |
| 354 | return static_cast<NamespaceDecl*>(this)->getNextNamespace(); |
| 355 | |
| 356 | default: |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 357 | return 0; |
| 358 | } |
| 359 | } |
| 360 | |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 361 | void DeclContext::addDecl(Decl *D) { |
Chris Lattner | 7f0be13 | 2009-02-20 00:56:18 +0000 | [diff] [blame] | 362 | assert(D->getLexicalDeclContext() == this && |
| 363 | "Decl inserted into wrong lexical context"); |
Douglas Gregor | 6037fcb | 2009-01-09 19:42:16 +0000 | [diff] [blame] | 364 | assert(!D->NextDeclInScope && D != LastDecl && |
| 365 | "Decl already inserted into a DeclContext"); |
| 366 | |
| 367 | if (FirstDecl) { |
| 368 | LastDecl->NextDeclInScope = D; |
| 369 | LastDecl = D; |
| 370 | } else { |
| 371 | FirstDecl = LastDecl = D; |
| 372 | } |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 373 | |
| 374 | if (NamedDecl *ND = dyn_cast<NamedDecl>(D)) |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 375 | ND->getDeclContext()->makeDeclVisibleInContext(ND); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 376 | } |
| 377 | |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 378 | /// buildLookup - Build the lookup data structure with all of the |
| 379 | /// declarations in DCtx (and any other contexts linked to it or |
| 380 | /// transparent contexts nested within it). |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 381 | void DeclContext::buildLookup(DeclContext *DCtx) { |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 382 | for (; DCtx; DCtx = DCtx->getNextContext()) { |
Douglas Gregor | 4f3b8f8 | 2009-01-06 07:17:58 +0000 | [diff] [blame] | 383 | for (decl_iterator D = DCtx->decls_begin(), DEnd = DCtx->decls_end(); |
| 384 | D != DEnd; ++D) { |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 385 | // Insert this declaration into the lookup structure |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 386 | if (NamedDecl *ND = dyn_cast<NamedDecl>(*D)) |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 387 | makeDeclVisibleInContextImpl(ND); |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 388 | |
| 389 | // If this declaration is itself a transparent declaration context, |
| 390 | // add its members (recursively). |
| 391 | if (DeclContext *InnerCtx = dyn_cast<DeclContext>(*D)) |
| 392 | if (InnerCtx->isTransparentContext()) |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 393 | buildLookup(InnerCtx->getPrimaryContext()); |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 394 | } |
| 395 | } |
| 396 | } |
| 397 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 398 | DeclContext::lookup_result |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 399 | DeclContext::lookup(DeclarationName Name) { |
| 400 | DeclContext *PrimaryContext = getPrimaryContext(); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 401 | if (PrimaryContext != this) |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 402 | return PrimaryContext->lookup(Name); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 403 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 404 | /// If there is no lookup data structure, build one now by walking |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 405 | /// all of the linked DeclContexts (in declaration order!) and |
| 406 | /// inserting their values. |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 407 | if (LookupPtr.getPointer() == 0) |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 408 | buildLookup(this); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 409 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 410 | if (isLookupMap()) { |
| 411 | StoredDeclsMap *Map = static_cast<StoredDeclsMap*>(LookupPtr.getPointer()); |
| 412 | StoredDeclsMap::iterator Pos = Map->find(Name); |
Chris Lattner | 9194250 | 2009-02-20 00:55:03 +0000 | [diff] [blame] | 413 | if (Pos == Map->end()) |
| 414 | return lookup_result(0, 0); |
| 415 | |
| 416 | return lookup_result(&Pos->second.front(), |
| 417 | &Pos->second.front() + Pos->second.size()); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 418 | } |
| 419 | |
| 420 | // We have a small array. Look into it. |
| 421 | unsigned Size = LookupPtr.getInt(); |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 422 | NamedDecl **Array = static_cast<NamedDecl**>(LookupPtr.getPointer()); |
Douglas Gregor | e267ff3 | 2008-12-11 20:41:00 +0000 | [diff] [blame] | 423 | for (unsigned Idx = 0; Idx != Size; ++Idx) |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 424 | if (Array[Idx]->getDeclName() == Name) { |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 425 | unsigned Last = Idx + 1; |
| 426 | while (Last != Size && Array[Last]->getDeclName() == Name) |
| 427 | ++Last; |
| 428 | return lookup_result(&Array[Idx], &Array[Last]); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 429 | } |
| 430 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 431 | return lookup_result(0, 0); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 432 | } |
| 433 | |
| 434 | DeclContext::lookup_const_result |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 435 | DeclContext::lookup(DeclarationName Name) const { |
| 436 | return const_cast<DeclContext*>(this)->lookup(Name); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 437 | } |
| 438 | |
Douglas Gregor | 17a9b9e | 2009-01-07 02:48:43 +0000 | [diff] [blame] | 439 | const DeclContext *DeclContext::getLookupContext() const { |
| 440 | const DeclContext *Ctx = this; |
Douglas Gregor | 72de667 | 2009-01-08 20:45:30 +0000 | [diff] [blame] | 441 | // Skip through transparent contexts. |
Douglas Gregor | ce35607 | 2009-01-06 23:51:29 +0000 | [diff] [blame] | 442 | while (Ctx->isTransparentContext()) |
| 443 | Ctx = Ctx->getParent(); |
| 444 | return Ctx; |
| 445 | } |
| 446 | |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 447 | void DeclContext::makeDeclVisibleInContext(NamedDecl *D) { |
Douglas Gregor | cc63668 | 2009-02-17 23:15:12 +0000 | [diff] [blame] | 448 | // FIXME: This feels like a hack. Should DeclarationName support |
| 449 | // template-ids, or is there a better way to keep specializations |
| 450 | // from being visible? |
| 451 | if (isa<ClassTemplateSpecializationDecl>(D)) |
| 452 | return; |
| 453 | |
Steve Naroff | 0701bbb | 2009-01-08 17:28:14 +0000 | [diff] [blame] | 454 | DeclContext *PrimaryContext = getPrimaryContext(); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 455 | if (PrimaryContext != this) { |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 456 | PrimaryContext->makeDeclVisibleInContext(D); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 457 | return; |
| 458 | } |
| 459 | |
| 460 | // If we already have a lookup data structure, perform the insertion |
| 461 | // into it. Otherwise, be lazy and don't build that structure until |
| 462 | // someone asks for it. |
| 463 | if (LookupPtr.getPointer()) |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 464 | makeDeclVisibleInContextImpl(D); |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 465 | |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 466 | // If we are a transparent context, insert into our parent context, |
| 467 | // too. This operation is recursive. |
| 468 | if (isTransparentContext()) |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 469 | getParent()->makeDeclVisibleInContext(D); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 470 | } |
| 471 | |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 472 | void DeclContext::makeDeclVisibleInContextImpl(NamedDecl *D) { |
Douglas Gregor | 074149e | 2009-01-05 19:45:36 +0000 | [diff] [blame] | 473 | // Skip unnamed declarations. |
| 474 | if (!D->getDeclName()) |
| 475 | return; |
| 476 | |
Douglas Gregor | cc63668 | 2009-02-17 23:15:12 +0000 | [diff] [blame] | 477 | // FIXME: This feels like a hack. Should DeclarationName support |
| 478 | // template-ids, or is there a better way to keep specializations |
| 479 | // from being visible? |
| 480 | if (isa<ClassTemplateSpecializationDecl>(D)) |
| 481 | return; |
| 482 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 483 | bool MayBeRedeclaration = true; |
| 484 | |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 485 | if (!isLookupMap()) { |
| 486 | unsigned Size = LookupPtr.getInt(); |
| 487 | |
| 488 | // The lookup data is stored as an array. Search through the array |
| 489 | // to find the insertion location. |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 490 | NamedDecl **Array; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 491 | if (Size == 0) { |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 492 | Array = new NamedDecl*[LookupIsMap - 1]; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 493 | LookupPtr.setPointer(Array); |
| 494 | } else { |
Douglas Gregor | 4afa39d | 2009-01-20 01:17:11 +0000 | [diff] [blame] | 495 | Array = static_cast<NamedDecl **>(LookupPtr.getPointer()); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 496 | } |
| 497 | |
| 498 | // We always keep declarations of the same name next to each other |
| 499 | // in the array, so that it is easy to return multiple results |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 500 | // from lookup(). |
| 501 | unsigned FirstMatch; |
| 502 | for (FirstMatch = 0; FirstMatch != Size; ++FirstMatch) |
| 503 | if (Array[FirstMatch]->getDeclName() == D->getDeclName()) |
Douglas Gregor | e267ff3 | 2008-12-11 20:41:00 +0000 | [diff] [blame] | 504 | break; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 505 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 506 | unsigned InsertPos = FirstMatch; |
| 507 | if (FirstMatch != Size) { |
| 508 | // We found another declaration with the same name. First |
| 509 | // determine whether this is a redeclaration of an existing |
| 510 | // declaration in this scope, in which case we will replace the |
| 511 | // existing declaration. |
| 512 | unsigned LastMatch = FirstMatch; |
| 513 | for (; LastMatch != Size; ++LastMatch) { |
| 514 | if (Array[LastMatch]->getDeclName() != D->getDeclName()) |
| 515 | break; |
| 516 | |
Douglas Gregor | 6ed40e3 | 2008-12-23 21:05:05 +0000 | [diff] [blame] | 517 | if (D->declarationReplaces(Array[LastMatch])) { |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 518 | // D is a redeclaration of an existing element in the |
| 519 | // array. Replace that element with D. |
| 520 | Array[LastMatch] = D; |
| 521 | return; |
| 522 | } |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 523 | } |
| 524 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 525 | // [FirstMatch, LastMatch) contains the set of declarations that |
| 526 | // have the same name as this declaration. Determine where the |
Douglas Gregor | 2a3009a | 2009-02-03 19:21:40 +0000 | [diff] [blame] | 527 | // declaration D will be inserted into this range. |
| 528 | if (D->getKind() == Decl::UsingDirective || |
| 529 | D->getIdentifierNamespace() == Decl::IDNS_Tag) |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 530 | InsertPos = LastMatch; |
| 531 | else if (Array[LastMatch-1]->getIdentifierNamespace() == Decl::IDNS_Tag) |
| 532 | InsertPos = LastMatch - 1; |
| 533 | else |
| 534 | InsertPos = LastMatch; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 535 | } |
| 536 | |
| 537 | if (Size < LookupIsMap - 1) { |
| 538 | // The new declaration will fit in the array. Insert the new |
| 539 | // declaration at the position Match in the array. |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 540 | for (unsigned Idx = Size; Idx > InsertPos; --Idx) |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 541 | Array[Idx] = Array[Idx-1]; |
| 542 | |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 543 | Array[InsertPos] = D; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 544 | LookupPtr.setInt(Size + 1); |
| 545 | return; |
| 546 | } |
| 547 | |
| 548 | // We've reached capacity in this array. Create a map and copy in |
| 549 | // all of the declarations that were stored in the array. |
| 550 | StoredDeclsMap *Map = new StoredDeclsMap(16); |
| 551 | LookupPtr.setPointer(Map); |
| 552 | LookupPtr.setInt(LookupIsMap); |
Douglas Gregor | e267ff3 | 2008-12-11 20:41:00 +0000 | [diff] [blame] | 553 | for (unsigned Idx = 0; Idx != LookupIsMap - 1; ++Idx) |
Douglas Gregor | 40f4e69 | 2009-01-20 16:54:50 +0000 | [diff] [blame] | 554 | makeDeclVisibleInContextImpl(Array[Idx]); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 555 | delete [] Array; |
| 556 | |
| 557 | // Fall through to perform insertion into the map. |
Douglas Gregor | 3fc749d | 2008-12-23 00:26:44 +0000 | [diff] [blame] | 558 | MayBeRedeclaration = false; |
| 559 | } |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 560 | |
| 561 | // Insert this declaration into the map. |
| 562 | StoredDeclsMap *Map = static_cast<StoredDeclsMap*>(LookupPtr.getPointer()); |
Chris Lattner | f823288 | 2009-02-19 07:05:16 +0000 | [diff] [blame] | 563 | std::vector<NamedDecl *> &DeclNameEntries = (*Map)[D->getDeclName()]; |
| 564 | if (DeclNameEntries.empty()) { |
| 565 | DeclNameEntries.push_back(D); |
Chris Lattner | bd6c800 | 2009-02-19 07:00:44 +0000 | [diff] [blame] | 566 | return; |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 567 | } |
Chris Lattner | 9194250 | 2009-02-20 00:55:03 +0000 | [diff] [blame] | 568 | |
Chris Lattner | bdc3d00 | 2009-02-20 01:10:07 +0000 | [diff] [blame^] | 569 | // If it is possible that this is a redeclaration, check to see if there is |
| 570 | // already a decl for which declarationReplaces returns true. If there is |
| 571 | // one, just replace it and return. |
Chris Lattner | bd6c800 | 2009-02-19 07:00:44 +0000 | [diff] [blame] | 572 | if (MayBeRedeclaration) { |
Chris Lattner | bdc3d00 | 2009-02-20 01:10:07 +0000 | [diff] [blame^] | 573 | // Most decls only have one entry in their list, special case it. |
| 574 | if (DeclNameEntries.size() == 1) { |
| 575 | if (D->declarationReplaces(DeclNameEntries[0])) { |
| 576 | DeclNameEntries[0] = D; |
| 577 | return; |
| 578 | } |
| 579 | } else { |
| 580 | // Determine if this declaration is actually a redeclaration. |
| 581 | std::vector<NamedDecl *>::iterator Redecl |
| 582 | = std::find_if(DeclNameEntries.begin(), DeclNameEntries.end(), |
| 583 | std::bind1st(std::mem_fun(&NamedDecl::declarationReplaces), |
| 584 | D)); |
| 585 | if (Redecl != DeclNameEntries.end()) { |
| 586 | *Redecl = D; |
| 587 | return; |
| 588 | } |
Chris Lattner | bd6c800 | 2009-02-19 07:00:44 +0000 | [diff] [blame] | 589 | } |
| 590 | } |
Chris Lattner | 9194250 | 2009-02-20 00:55:03 +0000 | [diff] [blame] | 591 | |
Chris Lattner | bd6c800 | 2009-02-19 07:00:44 +0000 | [diff] [blame] | 592 | // Put this declaration into the appropriate slot. |
Chris Lattner | ba1bd5c | 2009-02-19 07:02:09 +0000 | [diff] [blame] | 593 | if (isa<UsingDirectiveDecl>(D) || |
Chris Lattner | 9194250 | 2009-02-20 00:55:03 +0000 | [diff] [blame] | 594 | D->getIdentifierNamespace() == Decl::IDNS_Tag) |
Chris Lattner | f823288 | 2009-02-19 07:05:16 +0000 | [diff] [blame] | 595 | DeclNameEntries.push_back(D); |
| 596 | else if (DeclNameEntries.back()->getIdentifierNamespace() == Decl::IDNS_Tag) { |
| 597 | NamedDecl *TagD = DeclNameEntries.back(); |
| 598 | DeclNameEntries.back() = D; |
| 599 | DeclNameEntries.push_back(TagD); |
Chris Lattner | bd6c800 | 2009-02-19 07:00:44 +0000 | [diff] [blame] | 600 | } else |
Chris Lattner | f823288 | 2009-02-19 07:05:16 +0000 | [diff] [blame] | 601 | DeclNameEntries.push_back(D); |
Douglas Gregor | 44b4321 | 2008-12-11 16:49:14 +0000 | [diff] [blame] | 602 | } |
Douglas Gregor | 2a3009a | 2009-02-03 19:21:40 +0000 | [diff] [blame] | 603 | |
| 604 | /// Returns iterator range [First, Last) of UsingDirectiveDecls stored within |
| 605 | /// this context. |
| 606 | DeclContext::udir_iterator_range DeclContext::getUsingDirectives() const { |
| 607 | lookup_const_result Result = lookup(UsingDirectiveDecl::getName()); |
| 608 | return udir_iterator_range(reinterpret_cast<udir_iterator>(Result.first), |
| 609 | reinterpret_cast<udir_iterator>(Result.second)); |
| 610 | } |
| 611 | |