DeclContextInternals.h revision 6bcf27bb9a4b5c3f79cb44c0e4654a6d7619ad89 
1//===-- DeclContextInternals.h - DeclContext Representation -----*- C++ -*-===//
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 defines the data structures used in the implementation
11//  of DeclContext.
12//
13//===----------------------------------------------------------------------===//
14#ifndef LLVM_CLANG_AST_DECLCONTEXTINTERNALS_H
15#define LLVM_CLANG_AST_DECLCONTEXTINTERNALS_H
16
17#include "clang/AST/Decl.h"
18#include "clang/AST/DeclCXX.h"
19#include "clang/AST/DeclarationName.h"
20#include "llvm/ADT/DenseMap.h"
21#include "llvm/ADT/PointerIntPair.h"
22#include "llvm/ADT/PointerUnion.h"
23#include "llvm/ADT/SmallVector.h"
24#include <algorithm>
25
26namespace clang {
27
28class DependentDiagnostic;
29
30/// \brief An array of decls optimized for the common case of only containing
31/// one entry.
32struct StoredDeclsList {
33
34  /// \brief When in vector form, this is what the Data pointer points to.
35  typedef SmallVector<NamedDecl *, 4> DeclsTy;
36
37  /// \brief A collection of declarations, with a flag to indicate if we have
38  /// further external declarations.
39  typedef llvm::PointerIntPair<DeclsTy *, 1, bool> DeclsAndHasExternalTy;
40
41  /// \brief The stored data, which will be either a pointer to a NamedDecl,
42  /// or a pointer to a vector with a flag to indicate if there are further
43  /// external declarations.
44  llvm::PointerUnion<NamedDecl*, DeclsAndHasExternalTy> Data;
45
46public:
47  StoredDeclsList() {}
48
49  StoredDeclsList(StoredDeclsList &&RHS) : Data(RHS.Data) {
50    RHS.Data = (NamedDecl *)nullptr;
51  }
52
53  ~StoredDeclsList() {
54    // If this is a vector-form, free the vector.
55    if (DeclsTy *Vector = getAsVector())
56      delete Vector;
57  }
58
59  StoredDeclsList &operator=(StoredDeclsList &&RHS) {
60    if (DeclsTy *Vector = getAsVector())
61      delete Vector;
62    Data = RHS.Data;
63    RHS.Data = (NamedDecl *)nullptr;
64    return *this;
65  }
66
67  bool isNull() const { return Data.isNull(); }
68
69  NamedDecl *getAsDecl() const {
70    return Data.dyn_cast<NamedDecl *>();
71  }
72
73  DeclsAndHasExternalTy getAsVectorAndHasExternal() const {
74    return Data.dyn_cast<DeclsAndHasExternalTy>();
75  }
76
77  DeclsTy *getAsVector() const {
78    return getAsVectorAndHasExternal().getPointer();
79  }
80
81  bool hasExternalDecls() const {
82    return getAsVectorAndHasExternal().getInt();
83  }
84
85  void setHasExternalDecls() {
86    if (DeclsTy *Vec = getAsVector())
87      Data = DeclsAndHasExternalTy(Vec, true);
88    else {
89      DeclsTy *VT = new DeclsTy();
90      if (NamedDecl *OldD = getAsDecl())
91        VT->push_back(OldD);
92      Data = DeclsAndHasExternalTy(VT, true);
93    }
94  }
95
96  void setOnlyValue(NamedDecl *ND) {
97    assert(!getAsVector() && "Not inline");
98    Data = ND;
99    // Make sure that Data is a plain NamedDecl* so we can use its address
100    // at getLookupResult.
101    assert(*(NamedDecl **)&Data == ND &&
102           "PointerUnion mangles the NamedDecl pointer!");
103  }
104
105  void remove(NamedDecl *D) {
106    assert(!isNull() && "removing from empty list");
107    if (NamedDecl *Singleton = getAsDecl()) {
108      assert(Singleton == D && "list is different singleton");
109      (void)Singleton;
110      Data = (NamedDecl *)nullptr;
111      return;
112    }
113
114    DeclsTy &Vec = *getAsVector();
115    DeclsTy::iterator I = std::find(Vec.begin(), Vec.end(), D);
116    assert(I != Vec.end() && "list does not contain decl");
117    Vec.erase(I);
118
119    assert(std::find(Vec.begin(), Vec.end(), D)
120             == Vec.end() && "list still contains decl");
121  }
122
123  /// \brief Remove any declarations which were imported from an external
124  /// AST source.
125  void removeExternalDecls() {
126    if (isNull()) {
127      // Nothing to do.
128    } else if (NamedDecl *Singleton = getAsDecl()) {
129      if (Singleton->isFromASTFile())
130        *this = StoredDeclsList();
131    } else {
132      DeclsTy &Vec = *getAsVector();
133      Vec.erase(std::remove_if(Vec.begin(), Vec.end(),
134                               std::mem_fun(&Decl::isFromASTFile)),
135                Vec.end());
136      // Don't have any external decls any more.
137      Data = DeclsAndHasExternalTy(&Vec, false);
138    }
139  }
140
141  /// getLookupResult - Return an array of all the decls that this list
142  /// represents.
143  DeclContext::lookup_result getLookupResult() {
144    if (isNull())
145      return DeclContext::lookup_result(DeclContext::lookup_iterator(nullptr),
146                                        DeclContext::lookup_iterator(nullptr));
147
148    // If we have a single NamedDecl, return it.
149    if (getAsDecl()) {
150      assert(!isNull() && "Empty list isn't allowed");
151
152      // Data is a raw pointer to a NamedDecl*, return it.
153      void *Ptr = &Data;
154      return DeclContext::lookup_result((NamedDecl**)Ptr, (NamedDecl**)Ptr+1);
155    }
156
157    assert(getAsVector() && "Must have a vector at this point");
158    DeclsTy &Vector = *getAsVector();
159
160    // Otherwise, we have a range result.
161    return DeclContext::lookup_result(Vector.begin(), Vector.end());
162  }
163
164  /// HandleRedeclaration - If this is a redeclaration of an existing decl,
165  /// replace the old one with D and return true.  Otherwise return false.
166  bool HandleRedeclaration(NamedDecl *D) {
167    // Most decls only have one entry in their list, special case it.
168    if (NamedDecl *OldD = getAsDecl()) {
169      if (!D->declarationReplaces(OldD))
170        return false;
171      setOnlyValue(D);
172      return true;
173    }
174
175    // Determine if this declaration is actually a redeclaration.
176    DeclsTy &Vec = *getAsVector();
177    for (DeclsTy::iterator OD = Vec.begin(), ODEnd = Vec.end();
178         OD != ODEnd; ++OD) {
179      NamedDecl *OldD = *OD;
180      if (D->declarationReplaces(OldD)) {
181        *OD = D;
182        return true;
183      }
184    }
185
186    return false;
187  }
188
189  /// AddSubsequentDecl - This is called on the second and later decl when it is
190  /// not a redeclaration to merge it into the appropriate place in our list.
191  ///
192  void AddSubsequentDecl(NamedDecl *D) {
193    assert(!isNull() && "don't AddSubsequentDecl when we have no decls");
194
195    // If this is the second decl added to the list, convert this to vector
196    // form.
197    if (NamedDecl *OldD = getAsDecl()) {
198      DeclsTy *VT = new DeclsTy();
199      VT->push_back(OldD);
200      Data = DeclsAndHasExternalTy(VT, false);
201    }
202
203    DeclsTy &Vec = *getAsVector();
204
205    // Using directives end up in a special entry which contains only
206    // other using directives, so all this logic is wasted for them.
207    // But avoiding the logic wastes time in the far-more-common case
208    // that we're *not* adding a new using directive.
209
210    // Tag declarations always go at the end of the list so that an
211    // iterator which points at the first tag will start a span of
212    // decls that only contains tags.
213    if (D->hasTagIdentifierNamespace())
214      Vec.push_back(D);
215
216    // Resolved using declarations go at the front of the list so that
217    // they won't show up in other lookup results.  Unresolved using
218    // declarations (which are always in IDNS_Using | IDNS_Ordinary)
219    // follow that so that the using declarations will be contiguous.
220    else if (D->getIdentifierNamespace() & Decl::IDNS_Using) {
221      DeclsTy::iterator I = Vec.begin();
222      if (D->getIdentifierNamespace() != Decl::IDNS_Using) {
223        while (I != Vec.end() &&
224               (*I)->getIdentifierNamespace() == Decl::IDNS_Using)
225          ++I;
226      }
227      Vec.insert(I, D);
228
229    // All other declarations go at the end of the list, but before any
230    // tag declarations.  But we can be clever about tag declarations
231    // because there can only ever be one in a scope.
232    } else if (!Vec.empty() && Vec.back()->hasTagIdentifierNamespace()) {
233      NamedDecl *TagD = Vec.back();
234      Vec.back() = D;
235      Vec.push_back(TagD);
236    } else
237      Vec.push_back(D);
238  }
239};
240
241class StoredDeclsMap
242  : public llvm::SmallDenseMap<DeclarationName, StoredDeclsList, 4> {
243
244public:
245  static void DestroyAll(StoredDeclsMap *Map, bool Dependent);
246
247private:
248  friend class ASTContext; // walks the chain deleting these
249  friend class DeclContext;
250  llvm::PointerIntPair<StoredDeclsMap*, 1> Previous;
251};
252
253class DependentStoredDeclsMap : public StoredDeclsMap {
254public:
255  DependentStoredDeclsMap() : FirstDiagnostic(nullptr) {}
256
257private:
258  friend class DependentDiagnostic;
259  friend class DeclContext; // iterates over diagnostics
260
261  DependentDiagnostic *FirstDiagnostic;
262};
263
264} // end namespace clang
265
266#endif
267