clang  6.0.0svn
ASTContext.cpp
Go to the documentation of this file.
1 //===- ASTContext.cpp - Context to hold long-lived AST nodes --------------===//
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 ASTContext interface.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #include "clang/AST/ASTContext.h"
15 #include "CXXABI.h"
16 #include "clang/AST/APValue.h"
19 #include "clang/AST/Attr.h"
20 #include "clang/AST/AttrIterator.h"
21 #include "clang/AST/CharUnits.h"
22 #include "clang/AST/Comment.h"
23 #include "clang/AST/Decl.h"
24 #include "clang/AST/DeclBase.h"
25 #include "clang/AST/DeclCXX.h"
27 #include "clang/AST/DeclObjC.h"
28 #include "clang/AST/DeclOpenMP.h"
29 #include "clang/AST/DeclTemplate.h"
31 #include "clang/AST/Expr.h"
32 #include "clang/AST/ExprCXX.h"
34 #include "clang/AST/Mangle.h"
38 #include "clang/AST/RecordLayout.h"
40 #include "clang/AST/Stmt.h"
41 #include "clang/AST/TemplateBase.h"
42 #include "clang/AST/TemplateName.h"
43 #include "clang/AST/Type.h"
44 #include "clang/AST/TypeLoc.h"
48 #include "clang/Basic/Builtins.h"
51 #include "clang/Basic/LLVM.h"
53 #include "clang/Basic/Linkage.h"
58 #include "clang/Basic/Specifiers.h"
60 #include "clang/Basic/TargetInfo.h"
61 #include "clang/Basic/XRayLists.h"
62 #include "llvm/ADT/APInt.h"
63 #include "llvm/ADT/APSInt.h"
64 #include "llvm/ADT/ArrayRef.h"
65 #include "llvm/ADT/DenseMap.h"
66 #include "llvm/ADT/DenseSet.h"
67 #include "llvm/ADT/FoldingSet.h"
68 #include "llvm/ADT/None.h"
69 #include "llvm/ADT/Optional.h"
70 #include "llvm/ADT/PointerUnion.h"
71 #include "llvm/ADT/STLExtras.h"
72 #include "llvm/ADT/SmallPtrSet.h"
73 #include "llvm/ADT/SmallVector.h"
74 #include "llvm/ADT/StringExtras.h"
75 #include "llvm/ADT/StringRef.h"
76 #include "llvm/ADT/Triple.h"
77 #include "llvm/Support/Capacity.h"
78 #include "llvm/Support/Casting.h"
79 #include "llvm/Support/Compiler.h"
80 #include "llvm/Support/ErrorHandling.h"
81 #include "llvm/Support/MathExtras.h"
82 #include "llvm/Support/raw_ostream.h"
83 #include <algorithm>
84 #include <cassert>
85 #include <cstddef>
86 #include <cstdint>
87 #include <cstdlib>
88 #include <map>
89 #include <memory>
90 #include <string>
91 #include <tuple>
92 #include <utility>
93 
94 using namespace clang;
95 
108 
111 };
112 
114  if (!CommentsLoaded && ExternalSource) {
115  ExternalSource->ReadComments();
116 
117 #ifndef NDEBUG
119  assert(std::is_sorted(RawComments.begin(), RawComments.end(),
120  BeforeThanCompare<RawComment>(SourceMgr)));
121 #endif
122 
123  CommentsLoaded = true;
124  }
125 
126  assert(D);
127 
128  // User can not attach documentation to implicit declarations.
129  if (D->isImplicit())
130  return nullptr;
131 
132  // User can not attach documentation to implicit instantiations.
133  if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
134  if (FD->getTemplateSpecializationKind() == TSK_ImplicitInstantiation)
135  return nullptr;
136  }
137 
138  if (const VarDecl *VD = dyn_cast<VarDecl>(D)) {
139  if (VD->isStaticDataMember() &&
140  VD->getTemplateSpecializationKind() == TSK_ImplicitInstantiation)
141  return nullptr;
142  }
143 
144  if (const CXXRecordDecl *CRD = dyn_cast<CXXRecordDecl>(D)) {
145  if (CRD->getTemplateSpecializationKind() == TSK_ImplicitInstantiation)
146  return nullptr;
147  }
148 
149  if (const ClassTemplateSpecializationDecl *CTSD =
150  dyn_cast<ClassTemplateSpecializationDecl>(D)) {
151  TemplateSpecializationKind TSK = CTSD->getSpecializationKind();
152  if (TSK == TSK_ImplicitInstantiation ||
153  TSK == TSK_Undeclared)
154  return nullptr;
155  }
156 
157  if (const EnumDecl *ED = dyn_cast<EnumDecl>(D)) {
158  if (ED->getTemplateSpecializationKind() == TSK_ImplicitInstantiation)
159  return nullptr;
160  }
161  if (const TagDecl *TD = dyn_cast<TagDecl>(D)) {
162  // When tag declaration (but not definition!) is part of the
163  // decl-specifier-seq of some other declaration, it doesn't get comment
164  if (TD->isEmbeddedInDeclarator() && !TD->isCompleteDefinition())
165  return nullptr;
166  }
167  // TODO: handle comments for function parameters properly.
168  if (isa<ParmVarDecl>(D))
169  return nullptr;
170 
171  // TODO: we could look up template parameter documentation in the template
172  // documentation.
173  if (isa<TemplateTypeParmDecl>(D) ||
174  isa<NonTypeTemplateParmDecl>(D) ||
175  isa<TemplateTemplateParmDecl>(D))
176  return nullptr;
177 
179 
180  // If there are no comments anywhere, we won't find anything.
181  if (RawComments.empty())
182  return nullptr;
183 
184  // Find declaration location.
185  // For Objective-C declarations we generally don't expect to have multiple
186  // declarators, thus use declaration starting location as the "declaration
187  // location".
188  // For all other declarations multiple declarators are used quite frequently,
189  // so we use the location of the identifier as the "declaration location".
190  SourceLocation DeclLoc;
191  if (isa<ObjCMethodDecl>(D) || isa<ObjCContainerDecl>(D) ||
192  isa<ObjCPropertyDecl>(D) ||
193  isa<RedeclarableTemplateDecl>(D) ||
194  isa<ClassTemplateSpecializationDecl>(D))
195  DeclLoc = D->getLocStart();
196  else {
197  DeclLoc = D->getLocation();
198  if (DeclLoc.isMacroID()) {
199  if (isa<TypedefDecl>(D)) {
200  // If location of the typedef name is in a macro, it is because being
201  // declared via a macro. Try using declaration's starting location as
202  // the "declaration location".
203  DeclLoc = D->getLocStart();
204  } else if (const TagDecl *TD = dyn_cast<TagDecl>(D)) {
205  // If location of the tag decl is inside a macro, but the spelling of
206  // the tag name comes from a macro argument, it looks like a special
207  // macro like NS_ENUM is being used to define the tag decl. In that
208  // case, adjust the source location to the expansion loc so that we can
209  // attach the comment to the tag decl.
210  if (SourceMgr.isMacroArgExpansion(DeclLoc) &&
211  TD->isCompleteDefinition())
212  DeclLoc = SourceMgr.getExpansionLoc(DeclLoc);
213  }
214  }
215  }
216 
217  // If the declaration doesn't map directly to a location in a file, we
218  // can't find the comment.
219  if (DeclLoc.isInvalid() || !DeclLoc.isFileID())
220  return nullptr;
221 
222  // Find the comment that occurs just after this declaration.
224  {
225  // When searching for comments during parsing, the comment we are looking
226  // for is usually among the last two comments we parsed -- check them
227  // first.
228  RawComment CommentAtDeclLoc(
229  SourceMgr, SourceRange(DeclLoc), false,
230  LangOpts.CommentOpts.ParseAllComments);
231  BeforeThanCompare<RawComment> Compare(SourceMgr);
232  ArrayRef<RawComment *>::iterator MaybeBeforeDecl = RawComments.end() - 1;
233  bool Found = Compare(*MaybeBeforeDecl, &CommentAtDeclLoc);
234  if (!Found && RawComments.size() >= 2) {
235  MaybeBeforeDecl--;
236  Found = Compare(*MaybeBeforeDecl, &CommentAtDeclLoc);
237  }
238 
239  if (Found) {
240  Comment = MaybeBeforeDecl + 1;
241  assert(Comment == std::lower_bound(RawComments.begin(), RawComments.end(),
242  &CommentAtDeclLoc, Compare));
243  } else {
244  // Slow path.
245  Comment = std::lower_bound(RawComments.begin(), RawComments.end(),
246  &CommentAtDeclLoc, Compare);
247  }
248  }
249 
250  // Decompose the location for the declaration and find the beginning of the
251  // file buffer.
252  std::pair<FileID, unsigned> DeclLocDecomp = SourceMgr.getDecomposedLoc(DeclLoc);
253 
254  // First check whether we have a trailing comment.
255  if (Comment != RawComments.end() &&
256  (*Comment)->isDocumentation() && (*Comment)->isTrailingComment() &&
257  (isa<FieldDecl>(D) || isa<EnumConstantDecl>(D) || isa<VarDecl>(D) ||
258  isa<ObjCMethodDecl>(D) || isa<ObjCPropertyDecl>(D))) {
259  std::pair<FileID, unsigned> CommentBeginDecomp
260  = SourceMgr.getDecomposedLoc((*Comment)->getSourceRange().getBegin());
261  // Check that Doxygen trailing comment comes after the declaration, starts
262  // on the same line and in the same file as the declaration.
263  if (DeclLocDecomp.first == CommentBeginDecomp.first &&
264  SourceMgr.getLineNumber(DeclLocDecomp.first, DeclLocDecomp.second)
265  == SourceMgr.getLineNumber(CommentBeginDecomp.first,
266  CommentBeginDecomp.second)) {
267  return *Comment;
268  }
269  }
270 
271  // The comment just after the declaration was not a trailing comment.
272  // Let's look at the previous comment.
273  if (Comment == RawComments.begin())
274  return nullptr;
275  --Comment;
276 
277  // Check that we actually have a non-member Doxygen comment.
278  if (!(*Comment)->isDocumentation() || (*Comment)->isTrailingComment())
279  return nullptr;
280 
281  // Decompose the end of the comment.
282  std::pair<FileID, unsigned> CommentEndDecomp
283  = SourceMgr.getDecomposedLoc((*Comment)->getSourceRange().getEnd());
284 
285  // If the comment and the declaration aren't in the same file, then they
286  // aren't related.
287  if (DeclLocDecomp.first != CommentEndDecomp.first)
288  return nullptr;
289 
290  // Get the corresponding buffer.
291  bool Invalid = false;
292  const char *Buffer = SourceMgr.getBufferData(DeclLocDecomp.first,
293  &Invalid).data();
294  if (Invalid)
295  return nullptr;
296 
297  // Extract text between the comment and declaration.
298  StringRef Text(Buffer + CommentEndDecomp.second,
299  DeclLocDecomp.second - CommentEndDecomp.second);
300 
301  // There should be no other declarations or preprocessor directives between
302  // comment and declaration.
303  if (Text.find_first_of(";{}#@") != StringRef::npos)
304  return nullptr;
305 
306  return *Comment;
307 }
308 
309 /// If we have a 'templated' declaration for a template, adjust 'D' to
310 /// refer to the actual template.
311 /// If we have an implicit instantiation, adjust 'D' to refer to template.
312 static const Decl *adjustDeclToTemplate(const Decl *D) {
313  if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
314  // Is this function declaration part of a function template?
315  if (const FunctionTemplateDecl *FTD = FD->getDescribedFunctionTemplate())
316  return FTD;
317 
318  // Nothing to do if function is not an implicit instantiation.
319  if (FD->getTemplateSpecializationKind() != TSK_ImplicitInstantiation)
320  return D;
321 
322  // Function is an implicit instantiation of a function template?
323  if (const FunctionTemplateDecl *FTD = FD->getPrimaryTemplate())
324  return FTD;
325 
326  // Function is instantiated from a member definition of a class template?
327  if (const FunctionDecl *MemberDecl =
329  return MemberDecl;
330 
331  return D;
332  }
333  if (const VarDecl *VD = dyn_cast<VarDecl>(D)) {
334  // Static data member is instantiated from a member definition of a class
335  // template?
336  if (VD->isStaticDataMember())
337  if (const VarDecl *MemberDecl = VD->getInstantiatedFromStaticDataMember())
338  return MemberDecl;
339 
340  return D;
341  }
342  if (const CXXRecordDecl *CRD = dyn_cast<CXXRecordDecl>(D)) {
343  // Is this class declaration part of a class template?
344  if (const ClassTemplateDecl *CTD = CRD->getDescribedClassTemplate())
345  return CTD;
346 
347  // Class is an implicit instantiation of a class template or partial
348  // specialization?
349  if (const ClassTemplateSpecializationDecl *CTSD =
350  dyn_cast<ClassTemplateSpecializationDecl>(CRD)) {
351  if (CTSD->getSpecializationKind() != TSK_ImplicitInstantiation)
352  return D;
353  llvm::PointerUnion<ClassTemplateDecl *,
355  PU = CTSD->getSpecializedTemplateOrPartial();
356  return PU.is<ClassTemplateDecl*>() ?
357  static_cast<const Decl*>(PU.get<ClassTemplateDecl *>()) :
358  static_cast<const Decl*>(
360  }
361 
362  // Class is instantiated from a member definition of a class template?
363  if (const MemberSpecializationInfo *Info =
364  CRD->getMemberSpecializationInfo())
365  return Info->getInstantiatedFrom();
366 
367  return D;
368  }
369  if (const EnumDecl *ED = dyn_cast<EnumDecl>(D)) {
370  // Enum is instantiated from a member definition of a class template?
371  if (const EnumDecl *MemberDecl = ED->getInstantiatedFromMemberEnum())
372  return MemberDecl;
373 
374  return D;
375  }
376  // FIXME: Adjust alias templates?
377  return D;
378 }
379 
381  const Decl *D,
382  const Decl **OriginalDecl) const {
383  D = adjustDeclToTemplate(D);
384 
385  // Check whether we have cached a comment for this declaration already.
386  {
387  llvm::DenseMap<const Decl *, RawCommentAndCacheFlags>::iterator Pos =
388  RedeclComments.find(D);
389  if (Pos != RedeclComments.end()) {
390  const RawCommentAndCacheFlags &Raw = Pos->second;
392  if (OriginalDecl)
393  *OriginalDecl = Raw.getOriginalDecl();
394  return Raw.getRaw();
395  }
396  }
397  }
398 
399  // Search for comments attached to declarations in the redeclaration chain.
400  const RawComment *RC = nullptr;
401  const Decl *OriginalDeclForRC = nullptr;
402  for (auto I : D->redecls()) {
403  llvm::DenseMap<const Decl *, RawCommentAndCacheFlags>::iterator Pos =
404  RedeclComments.find(I);
405  if (Pos != RedeclComments.end()) {
406  const RawCommentAndCacheFlags &Raw = Pos->second;
408  RC = Raw.getRaw();
409  OriginalDeclForRC = Raw.getOriginalDecl();
410  break;
411  }
412  } else {
414  OriginalDeclForRC = I;
416  if (RC) {
417  // Call order swapped to work around ICE in VS2015 RTM (Release Win32)
418  // https://connect.microsoft.com/VisualStudio/feedback/details/1741530
420  Raw.setRaw(RC);
421  } else
423  Raw.setOriginalDecl(I);
424  RedeclComments[I] = Raw;
425  if (RC)
426  break;
427  }
428  }
429 
430  // If we found a comment, it should be a documentation comment.
431  assert(!RC || RC->isDocumentation());
432 
433  if (OriginalDecl)
434  *OriginalDecl = OriginalDeclForRC;
435 
436  // Update cache for every declaration in the redeclaration chain.
438  Raw.setRaw(RC);
440  Raw.setOriginalDecl(OriginalDeclForRC);
441 
442  for (auto I : D->redecls()) {
445  R = Raw;
446  }
447 
448  return RC;
449 }
450 
451 static void addRedeclaredMethods(const ObjCMethodDecl *ObjCMethod,
453  const DeclContext *DC = ObjCMethod->getDeclContext();
454  if (const ObjCImplDecl *IMD = dyn_cast<ObjCImplDecl>(DC)) {
455  const ObjCInterfaceDecl *ID = IMD->getClassInterface();
456  if (!ID)
457  return;
458  // Add redeclared method here.
459  for (const auto *Ext : ID->known_extensions()) {
460  if (ObjCMethodDecl *RedeclaredMethod =
461  Ext->getMethod(ObjCMethod->getSelector(),
462  ObjCMethod->isInstanceMethod()))
463  Redeclared.push_back(RedeclaredMethod);
464  }
465  }
466 }
467 
469  const Decl *D) const {
470  comments::DeclInfo *ThisDeclInfo = new (*this) comments::DeclInfo;
471  ThisDeclInfo->CommentDecl = D;
472  ThisDeclInfo->IsFilled = false;
473  ThisDeclInfo->fill();
474  ThisDeclInfo->CommentDecl = FC->getDecl();
475  if (!ThisDeclInfo->TemplateParameters)
476  ThisDeclInfo->TemplateParameters = FC->getDeclInfo()->TemplateParameters;
477  comments::FullComment *CFC =
478  new (*this) comments::FullComment(FC->getBlocks(),
479  ThisDeclInfo);
480  return CFC;
481 }
482 
485  return RC ? RC->parse(*this, nullptr, D) : nullptr;
486 }
487 
489  const Decl *D,
490  const Preprocessor *PP) const {
491  if (D->isInvalidDecl())
492  return nullptr;
493  D = adjustDeclToTemplate(D);
494 
495  const Decl *Canonical = D->getCanonicalDecl();
496  llvm::DenseMap<const Decl *, comments::FullComment *>::iterator Pos =
497  ParsedComments.find(Canonical);
498 
499  if (Pos != ParsedComments.end()) {
500  if (Canonical != D) {
501  comments::FullComment *FC = Pos->second;
503  return CFC;
504  }
505  return Pos->second;
506  }
507 
508  const Decl *OriginalDecl;
509 
510  const RawComment *RC = getRawCommentForAnyRedecl(D, &OriginalDecl);
511  if (!RC) {
512  if (isa<ObjCMethodDecl>(D) || isa<FunctionDecl>(D)) {
514  const ObjCMethodDecl *OMD = dyn_cast<ObjCMethodDecl>(D);
515  if (OMD && OMD->isPropertyAccessor())
516  if (const ObjCPropertyDecl *PDecl = OMD->findPropertyDecl())
517  if (comments::FullComment *FC = getCommentForDecl(PDecl, PP))
518  return cloneFullComment(FC, D);
519  if (OMD)
520  addRedeclaredMethods(OMD, Overridden);
521  getOverriddenMethods(dyn_cast<NamedDecl>(D), Overridden);
522  for (unsigned i = 0, e = Overridden.size(); i < e; i++)
523  if (comments::FullComment *FC = getCommentForDecl(Overridden[i], PP))
524  return cloneFullComment(FC, D);
525  }
526  else if (const TypedefNameDecl *TD = dyn_cast<TypedefNameDecl>(D)) {
527  // Attach any tag type's documentation to its typedef if latter
528  // does not have one of its own.
529  QualType QT = TD->getUnderlyingType();
530  if (const TagType *TT = QT->getAs<TagType>())
531  if (const Decl *TD = TT->getDecl())
532  if (comments::FullComment *FC = getCommentForDecl(TD, PP))
533  return cloneFullComment(FC, D);
534  }
535  else if (const ObjCInterfaceDecl *IC = dyn_cast<ObjCInterfaceDecl>(D)) {
536  while (IC->getSuperClass()) {
537  IC = IC->getSuperClass();
538  if (comments::FullComment *FC = getCommentForDecl(IC, PP))
539  return cloneFullComment(FC, D);
540  }
541  }
542  else if (const ObjCCategoryDecl *CD = dyn_cast<ObjCCategoryDecl>(D)) {
543  if (const ObjCInterfaceDecl *IC = CD->getClassInterface())
544  if (comments::FullComment *FC = getCommentForDecl(IC, PP))
545  return cloneFullComment(FC, D);
546  }
547  else if (const CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(D)) {
548  if (!(RD = RD->getDefinition()))
549  return nullptr;
550  // Check non-virtual bases.
551  for (const auto &I : RD->bases()) {
552  if (I.isVirtual() || (I.getAccessSpecifier() != AS_public))
553  continue;
554  QualType Ty = I.getType();
555  if (Ty.isNull())
556  continue;
557  if (const CXXRecordDecl *NonVirtualBase = Ty->getAsCXXRecordDecl()) {
558  if (!(NonVirtualBase= NonVirtualBase->getDefinition()))
559  continue;
560 
561  if (comments::FullComment *FC = getCommentForDecl((NonVirtualBase), PP))
562  return cloneFullComment(FC, D);
563  }
564  }
565  // Check virtual bases.
566  for (const auto &I : RD->vbases()) {
567  if (I.getAccessSpecifier() != AS_public)
568  continue;
569  QualType Ty = I.getType();
570  if (Ty.isNull())
571  continue;
572  if (const CXXRecordDecl *VirtualBase = Ty->getAsCXXRecordDecl()) {
573  if (!(VirtualBase= VirtualBase->getDefinition()))
574  continue;
575  if (comments::FullComment *FC = getCommentForDecl((VirtualBase), PP))
576  return cloneFullComment(FC, D);
577  }
578  }
579  }
580  return nullptr;
581  }
582 
583  // If the RawComment was attached to other redeclaration of this Decl, we
584  // should parse the comment in context of that other Decl. This is important
585  // because comments can contain references to parameter names which can be
586  // different across redeclarations.
587  if (D != OriginalDecl)
588  return getCommentForDecl(OriginalDecl, PP);
589 
590  comments::FullComment *FC = RC->parse(*this, PP, D);
591  ParsedComments[Canonical] = FC;
592  return FC;
593 }
594 
595 void
596 ASTContext::CanonicalTemplateTemplateParm::Profile(llvm::FoldingSetNodeID &ID,
597  TemplateTemplateParmDecl *Parm) {
598  ID.AddInteger(Parm->getDepth());
599  ID.AddInteger(Parm->getPosition());
600  ID.AddBoolean(Parm->isParameterPack());
601 
603  ID.AddInteger(Params->size());
605  PEnd = Params->end();
606  P != PEnd; ++P) {
607  if (TemplateTypeParmDecl *TTP = dyn_cast<TemplateTypeParmDecl>(*P)) {
608  ID.AddInteger(0);
609  ID.AddBoolean(TTP->isParameterPack());
610  continue;
611  }
612 
613  if (NonTypeTemplateParmDecl *NTTP = dyn_cast<NonTypeTemplateParmDecl>(*P)) {
614  ID.AddInteger(1);
615  ID.AddBoolean(NTTP->isParameterPack());
616  ID.AddPointer(NTTP->getType().getCanonicalType().getAsOpaquePtr());
617  if (NTTP->isExpandedParameterPack()) {
618  ID.AddBoolean(true);
619  ID.AddInteger(NTTP->getNumExpansionTypes());
620  for (unsigned I = 0, N = NTTP->getNumExpansionTypes(); I != N; ++I) {
621  QualType T = NTTP->getExpansionType(I);
622  ID.AddPointer(T.getCanonicalType().getAsOpaquePtr());
623  }
624  } else
625  ID.AddBoolean(false);
626  continue;
627  }
628 
629  TemplateTemplateParmDecl *TTP = cast<TemplateTemplateParmDecl>(*P);
630  ID.AddInteger(2);
631  Profile(ID, TTP);
632  }
633 }
634 
636 ASTContext::getCanonicalTemplateTemplateParmDecl(
637  TemplateTemplateParmDecl *TTP) const {
638  // Check if we already have a canonical template template parameter.
639  llvm::FoldingSetNodeID ID;
640  CanonicalTemplateTemplateParm::Profile(ID, TTP);
641  void *InsertPos = nullptr;
642  CanonicalTemplateTemplateParm *Canonical
643  = CanonTemplateTemplateParms.FindNodeOrInsertPos(ID, InsertPos);
644  if (Canonical)
645  return Canonical->getParam();
646 
647  // Build a canonical template parameter list.
649  SmallVector<NamedDecl *, 4> CanonParams;
650  CanonParams.reserve(Params->size());
652  PEnd = Params->end();
653  P != PEnd; ++P) {
654  if (TemplateTypeParmDecl *TTP = dyn_cast<TemplateTypeParmDecl>(*P))
655  CanonParams.push_back(
657  SourceLocation(),
658  SourceLocation(),
659  TTP->getDepth(),
660  TTP->getIndex(), nullptr, false,
661  TTP->isParameterPack()));
662  else if (NonTypeTemplateParmDecl *NTTP
663  = dyn_cast<NonTypeTemplateParmDecl>(*P)) {
664  QualType T = getCanonicalType(NTTP->getType());
667  if (NTTP->isExpandedParameterPack()) {
668  SmallVector<QualType, 2> ExpandedTypes;
669  SmallVector<TypeSourceInfo *, 2> ExpandedTInfos;
670  for (unsigned I = 0, N = NTTP->getNumExpansionTypes(); I != N; ++I) {
671  ExpandedTypes.push_back(getCanonicalType(NTTP->getExpansionType(I)));
672  ExpandedTInfos.push_back(
673  getTrivialTypeSourceInfo(ExpandedTypes.back()));
674  }
675 
677  SourceLocation(),
678  SourceLocation(),
679  NTTP->getDepth(),
680  NTTP->getPosition(), nullptr,
681  T,
682  TInfo,
683  ExpandedTypes,
684  ExpandedTInfos);
685  } else {
687  SourceLocation(),
688  SourceLocation(),
689  NTTP->getDepth(),
690  NTTP->getPosition(), nullptr,
691  T,
692  NTTP->isParameterPack(),
693  TInfo);
694  }
695  CanonParams.push_back(Param);
696 
697  } else
698  CanonParams.push_back(getCanonicalTemplateTemplateParmDecl(
699  cast<TemplateTemplateParmDecl>(*P)));
700  }
701 
702  assert(!TTP->getRequiresClause() &&
703  "Unexpected requires-clause on template template-parameter");
704  Expr *const CanonRequiresClause = nullptr;
705 
706  TemplateTemplateParmDecl *CanonTTP
708  SourceLocation(), TTP->getDepth(),
709  TTP->getPosition(),
710  TTP->isParameterPack(),
711  nullptr,
713  SourceLocation(),
714  CanonParams,
715  SourceLocation(),
716  CanonRequiresClause));
717 
718  // Get the new insert position for the node we care about.
719  Canonical = CanonTemplateTemplateParms.FindNodeOrInsertPos(ID, InsertPos);
720  assert(!Canonical && "Shouldn't be in the map!");
721  (void)Canonical;
722 
723  // Create the canonical template template parameter entry.
724  Canonical = new (*this) CanonicalTemplateTemplateParm(CanonTTP);
725  CanonTemplateTemplateParms.InsertNode(Canonical, InsertPos);
726  return CanonTTP;
727 }
728 
729 CXXABI *ASTContext::createCXXABI(const TargetInfo &T) {
730  if (!LangOpts.CPlusPlus) return nullptr;
731 
732  switch (T.getCXXABI().getKind()) {
733  case TargetCXXABI::GenericARM: // Same as Itanium at this level
734  case TargetCXXABI::iOS:
735  case TargetCXXABI::iOS64:
741  return CreateItaniumCXXABI(*this);
743  return CreateMicrosoftCXXABI(*this);
744  }
745  llvm_unreachable("Invalid CXXABI type!");
746 }
747 
748 static const LangASMap *getAddressSpaceMap(const TargetInfo &T,
749  const LangOptions &LOpts) {
750  if (LOpts.FakeAddressSpaceMap) {
751  // The fake address space map must have a distinct entry for each
752  // language-specific address space.
753  static const unsigned FakeAddrSpaceMap[] = {
754  0, // Default
755  1, // opencl_global
756  3, // opencl_local
757  2, // opencl_constant
758  0, // opencl_private
759  4, // opencl_generic
760  5, // cuda_device
761  6, // cuda_constant
762  7 // cuda_shared
763  };
764  return &FakeAddrSpaceMap;
765  } else {
766  return &T.getAddressSpaceMap();
767  }
768 }
769 
771  const LangOptions &LangOpts) {
772  switch (LangOpts.getAddressSpaceMapMangling()) {
774  return TI.useAddressSpaceMapMangling();
776  return true;
778  return false;
779  }
780  llvm_unreachable("getAddressSpaceMapMangling() doesn't cover anything.");
781 }
782 
784  IdentifierTable &idents, SelectorTable &sels,
785  Builtin::Context &builtins)
786  : FunctionProtoTypes(this_()), TemplateSpecializationTypes(this_()),
787  DependentTemplateSpecializationTypes(this_()),
788  SubstTemplateTemplateParmPacks(this_()), SourceMgr(SM), LangOpts(LOpts),
789  SanitizerBL(new SanitizerBlacklist(LangOpts.SanitizerBlacklistFiles, SM)),
790  XRayFilter(new XRayFunctionFilter(LangOpts.XRayAlwaysInstrumentFiles,
791  LangOpts.XRayNeverInstrumentFiles, SM)),
792  PrintingPolicy(LOpts), Idents(idents), Selectors(sels),
793  BuiltinInfo(builtins), DeclarationNames(*this), Comments(SM),
794  CommentCommandTraits(BumpAlloc, LOpts.CommentOpts), LastSDM(nullptr, 0) {
795  TUDecl = TranslationUnitDecl::Create(*this);
796 }
797 
799  ReleaseParentMapEntries();
800 
801  // Release the DenseMaps associated with DeclContext objects.
802  // FIXME: Is this the ideal solution?
803  ReleaseDeclContextMaps();
804 
805  // Call all of the deallocation functions on all of their targets.
806  for (auto &Pair : Deallocations)
807  (Pair.first)(Pair.second);
808 
809  // ASTRecordLayout objects in ASTRecordLayouts must always be destroyed
810  // because they can contain DenseMaps.
811  for (llvm::DenseMap<const ObjCContainerDecl*,
812  const ASTRecordLayout*>::iterator
813  I = ObjCLayouts.begin(), E = ObjCLayouts.end(); I != E; )
814  // Increment in loop to prevent using deallocated memory.
815  if (ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second))
816  R->Destroy(*this);
817 
818  for (llvm::DenseMap<const RecordDecl*, const ASTRecordLayout*>::iterator
819  I = ASTRecordLayouts.begin(), E = ASTRecordLayouts.end(); I != E; ) {
820  // Increment in loop to prevent using deallocated memory.
821  if (ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second))
822  R->Destroy(*this);
823  }
824 
825  for (llvm::DenseMap<const Decl*, AttrVec*>::iterator A = DeclAttrs.begin(),
826  AEnd = DeclAttrs.end();
827  A != AEnd; ++A)
828  A->second->~AttrVec();
829 
830  for (std::pair<const MaterializeTemporaryExpr *, APValue *> &MTVPair :
831  MaterializedTemporaryValues)
832  MTVPair.second->~APValue();
833 
834  for (const auto &Value : ModuleInitializers)
835  Value.second->~PerModuleInitializers();
836 }
837 
838 void ASTContext::ReleaseParentMapEntries() {
839  if (!PointerParents) return;
840  for (const auto &Entry : *PointerParents) {
841  if (Entry.second.is<ast_type_traits::DynTypedNode *>()) {
842  delete Entry.second.get<ast_type_traits::DynTypedNode *>();
843  } else if (Entry.second.is<ParentVector *>()) {
844  delete Entry.second.get<ParentVector *>();
845  }
846  }
847  for (const auto &Entry : *OtherParents) {
848  if (Entry.second.is<ast_type_traits::DynTypedNode *>()) {
849  delete Entry.second.get<ast_type_traits::DynTypedNode *>();
850  } else if (Entry.second.is<ParentVector *>()) {
851  delete Entry.second.get<ParentVector *>();
852  }
853  }
854 }
855 
856 void ASTContext::AddDeallocation(void (*Callback)(void*), void *Data) {
857  Deallocations.push_back({Callback, Data});
858 }
859 
860 void
862  ExternalSource = std::move(Source);
863 }
864 
866  llvm::errs() << "\n*** AST Context Stats:\n";
867  llvm::errs() << " " << Types.size() << " types total.\n";
868 
869  unsigned counts[] = {
870 #define TYPE(Name, Parent) 0,
871 #define ABSTRACT_TYPE(Name, Parent)
872 #include "clang/AST/TypeNodes.def"
873  0 // Extra
874  };
875 
876  for (unsigned i = 0, e = Types.size(); i != e; ++i) {
877  Type *T = Types[i];
878  counts[(unsigned)T->getTypeClass()]++;
879  }
880 
881  unsigned Idx = 0;
882  unsigned TotalBytes = 0;
883 #define TYPE(Name, Parent) \
884  if (counts[Idx]) \
885  llvm::errs() << " " << counts[Idx] << " " << #Name \
886  << " types\n"; \
887  TotalBytes += counts[Idx] * sizeof(Name##Type); \
888  ++Idx;
889 #define ABSTRACT_TYPE(Name, Parent)
890 #include "clang/AST/TypeNodes.def"
891 
892  llvm::errs() << "Total bytes = " << TotalBytes << "\n";
893 
894  // Implicit special member functions.
895  llvm::errs() << NumImplicitDefaultConstructorsDeclared << "/"
897  << " implicit default constructors created\n";
898  llvm::errs() << NumImplicitCopyConstructorsDeclared << "/"
900  << " implicit copy constructors created\n";
901  if (getLangOpts().CPlusPlus)
902  llvm::errs() << NumImplicitMoveConstructorsDeclared << "/"
904  << " implicit move constructors created\n";
905  llvm::errs() << NumImplicitCopyAssignmentOperatorsDeclared << "/"
907  << " implicit copy assignment operators created\n";
908  if (getLangOpts().CPlusPlus)
909  llvm::errs() << NumImplicitMoveAssignmentOperatorsDeclared << "/"
911  << " implicit move assignment operators created\n";
912  llvm::errs() << NumImplicitDestructorsDeclared << "/"
914  << " implicit destructors created\n";
915 
916  if (ExternalSource) {
917  llvm::errs() << "\n";
918  ExternalSource->PrintStats();
919  }
920 
921  BumpAlloc.PrintStats();
922 }
923 
925  bool NotifyListeners) {
926  if (NotifyListeners)
927  if (auto *Listener = getASTMutationListener())
929 
930  if (getLangOpts().ModulesLocalVisibility)
931  MergedDefModules[ND].push_back(M);
932  else
934 }
935 
937  auto It = MergedDefModules.find(ND);
938  if (It == MergedDefModules.end())
939  return;
940 
941  auto &Merged = It->second;
943  for (Module *&M : Merged)
944  if (!Found.insert(M).second)
945  M = nullptr;
946  Merged.erase(std::remove(Merged.begin(), Merged.end(), nullptr), Merged.end());
947 }
948 
949 void ASTContext::PerModuleInitializers::resolve(ASTContext &Ctx) {
950  if (LazyInitializers.empty())
951  return;
952 
953  auto *Source = Ctx.getExternalSource();
954  assert(Source && "lazy initializers but no external source");
955 
956  auto LazyInits = std::move(LazyInitializers);
957  LazyInitializers.clear();
958 
959  for (auto ID : LazyInits)
960  Initializers.push_back(Source->GetExternalDecl(ID));
961 
962  assert(LazyInitializers.empty() &&
963  "GetExternalDecl for lazy module initializer added more inits");
964 }
965 
967  // One special case: if we add a module initializer that imports another
968  // module, and that module's only initializer is an ImportDecl, simplify.
969  if (auto *ID = dyn_cast<ImportDecl>(D)) {
970  auto It = ModuleInitializers.find(ID->getImportedModule());
971 
972  // Maybe the ImportDecl does nothing at all. (Common case.)
973  if (It == ModuleInitializers.end())
974  return;
975 
976  // Maybe the ImportDecl only imports another ImportDecl.
977  auto &Imported = *It->second;
978  if (Imported.Initializers.size() + Imported.LazyInitializers.size() == 1) {
979  Imported.resolve(*this);
980  auto *OnlyDecl = Imported.Initializers.front();
981  if (isa<ImportDecl>(OnlyDecl))
982  D = OnlyDecl;
983  }
984  }
985 
986  auto *&Inits = ModuleInitializers[M];
987  if (!Inits)
988  Inits = new (*this) PerModuleInitializers;
989  Inits->Initializers.push_back(D);
990 }
991 
993  auto *&Inits = ModuleInitializers[M];
994  if (!Inits)
995  Inits = new (*this) PerModuleInitializers;
996  Inits->LazyInitializers.insert(Inits->LazyInitializers.end(),
997  IDs.begin(), IDs.end());
998 }
999 
1001  auto It = ModuleInitializers.find(M);
1002  if (It == ModuleInitializers.end())
1003  return None;
1004 
1005  auto *Inits = It->second;
1006  Inits->resolve(*this);
1007  return Inits->Initializers;
1008 }
1009 
1011  if (!ExternCContext)
1012  ExternCContext = ExternCContextDecl::Create(*this, getTranslationUnitDecl());
1013 
1014  return ExternCContext;
1015 }
1016 
1019  const IdentifierInfo *II) const {
1020  auto *BuiltinTemplate = BuiltinTemplateDecl::Create(*this, TUDecl, II, BTK);
1021  BuiltinTemplate->setImplicit();
1022  TUDecl->addDecl(BuiltinTemplate);
1023 
1024  return BuiltinTemplate;
1025 }
1026 
1029  if (!MakeIntegerSeqDecl)
1030  MakeIntegerSeqDecl = buildBuiltinTemplateDecl(BTK__make_integer_seq,
1032  return MakeIntegerSeqDecl;
1033 }
1034 
1037  if (!TypePackElementDecl)
1038  TypePackElementDecl = buildBuiltinTemplateDecl(BTK__type_pack_element,
1040  return TypePackElementDecl;
1041 }
1042 
1044  RecordDecl::TagKind TK) const {
1045  SourceLocation Loc;
1046  RecordDecl *NewDecl;
1047  if (getLangOpts().CPlusPlus)
1048  NewDecl = CXXRecordDecl::Create(*this, TK, getTranslationUnitDecl(), Loc,
1049  Loc, &Idents.get(Name));
1050  else
1051  NewDecl = RecordDecl::Create(*this, TK, getTranslationUnitDecl(), Loc, Loc,
1052  &Idents.get(Name));
1053  NewDecl->setImplicit();
1054  NewDecl->addAttr(TypeVisibilityAttr::CreateImplicit(
1055  const_cast<ASTContext &>(*this), TypeVisibilityAttr::Default));
1056  return NewDecl;
1057 }
1058 
1060  StringRef Name) const {
1062  TypedefDecl *NewDecl = TypedefDecl::Create(
1063  const_cast<ASTContext &>(*this), getTranslationUnitDecl(),
1064  SourceLocation(), SourceLocation(), &Idents.get(Name), TInfo);
1065  NewDecl->setImplicit();
1066  return NewDecl;
1067 }
1068 
1070  if (!Int128Decl)
1071  Int128Decl = buildImplicitTypedef(Int128Ty, "__int128_t");
1072  return Int128Decl;
1073 }
1074 
1076  if (!UInt128Decl)
1077  UInt128Decl = buildImplicitTypedef(UnsignedInt128Ty, "__uint128_t");
1078  return UInt128Decl;
1079 }
1080 
1081 void ASTContext::InitBuiltinType(CanQualType &R, BuiltinType::Kind K) {
1082  BuiltinType *Ty = new (*this, TypeAlignment) BuiltinType(K);
1083  R = CanQualType::CreateUnsafe(QualType(Ty, 0));
1084  Types.push_back(Ty);
1085 }
1086 
1088  const TargetInfo *AuxTarget) {
1089  assert((!this->Target || this->Target == &Target) &&
1090  "Incorrect target reinitialization");
1091  assert(VoidTy.isNull() && "Context reinitialized?");
1092 
1093  this->Target = &Target;
1094  this->AuxTarget = AuxTarget;
1095 
1096  ABI.reset(createCXXABI(Target));
1097  AddrSpaceMap = getAddressSpaceMap(Target, LangOpts);
1098  AddrSpaceMapMangling = isAddrSpaceMapManglingEnabled(Target, LangOpts);
1099 
1100  // C99 6.2.5p19.
1101  InitBuiltinType(VoidTy, BuiltinType::Void);
1102 
1103  // C99 6.2.5p2.
1104  InitBuiltinType(BoolTy, BuiltinType::Bool);
1105  // C99 6.2.5p3.
1106  if (LangOpts.CharIsSigned)
1107  InitBuiltinType(CharTy, BuiltinType::Char_S);
1108  else
1109  InitBuiltinType(CharTy, BuiltinType::Char_U);
1110  // C99 6.2.5p4.
1111  InitBuiltinType(SignedCharTy, BuiltinType::SChar);
1112  InitBuiltinType(ShortTy, BuiltinType::Short);
1113  InitBuiltinType(IntTy, BuiltinType::Int);
1114  InitBuiltinType(LongTy, BuiltinType::Long);
1115  InitBuiltinType(LongLongTy, BuiltinType::LongLong);
1116 
1117  // C99 6.2.5p6.
1118  InitBuiltinType(UnsignedCharTy, BuiltinType::UChar);
1119  InitBuiltinType(UnsignedShortTy, BuiltinType::UShort);
1120  InitBuiltinType(UnsignedIntTy, BuiltinType::UInt);
1121  InitBuiltinType(UnsignedLongTy, BuiltinType::ULong);
1122  InitBuiltinType(UnsignedLongLongTy, BuiltinType::ULongLong);
1123 
1124  // C99 6.2.5p10.
1125  InitBuiltinType(FloatTy, BuiltinType::Float);
1126  InitBuiltinType(DoubleTy, BuiltinType::Double);
1127  InitBuiltinType(LongDoubleTy, BuiltinType::LongDouble);
1128 
1129  // GNU extension, __float128 for IEEE quadruple precision
1130  InitBuiltinType(Float128Ty, BuiltinType::Float128);
1131 
1132  // C11 extension ISO/IEC TS 18661-3
1133  InitBuiltinType(Float16Ty, BuiltinType::Float16);
1134 
1135  // GNU extension, 128-bit integers.
1136  InitBuiltinType(Int128Ty, BuiltinType::Int128);
1137  InitBuiltinType(UnsignedInt128Ty, BuiltinType::UInt128);
1138 
1139  // C++ 3.9.1p5
1140  if (TargetInfo::isTypeSigned(Target.getWCharType()))
1141  InitBuiltinType(WCharTy, BuiltinType::WChar_S);
1142  else // -fshort-wchar makes wchar_t be unsigned.
1143  InitBuiltinType(WCharTy, BuiltinType::WChar_U);
1144  if (LangOpts.CPlusPlus && LangOpts.WChar)
1145  WideCharTy = WCharTy;
1146  else {
1147  // C99 (or C++ using -fno-wchar).
1148  WideCharTy = getFromTargetType(Target.getWCharType());
1149  }
1150 
1151  WIntTy = getFromTargetType(Target.getWIntType());
1152 
1153  if (LangOpts.CPlusPlus) // C++0x 3.9.1p5, extension for C++
1154  InitBuiltinType(Char16Ty, BuiltinType::Char16);
1155  else // C99
1156  Char16Ty = getFromTargetType(Target.getChar16Type());
1157 
1158  if (LangOpts.CPlusPlus) // C++0x 3.9.1p5, extension for C++
1159  InitBuiltinType(Char32Ty, BuiltinType::Char32);
1160  else // C99
1161  Char32Ty = getFromTargetType(Target.getChar32Type());
1162 
1163  // Placeholder type for type-dependent expressions whose type is
1164  // completely unknown. No code should ever check a type against
1165  // DependentTy and users should never see it; however, it is here to
1166  // help diagnose failures to properly check for type-dependent
1167  // expressions.
1168  InitBuiltinType(DependentTy, BuiltinType::Dependent);
1169 
1170  // Placeholder type for functions.
1171  InitBuiltinType(OverloadTy, BuiltinType::Overload);
1172 
1173  // Placeholder type for bound members.
1174  InitBuiltinType(BoundMemberTy, BuiltinType::BoundMember);
1175 
1176  // Placeholder type for pseudo-objects.
1177  InitBuiltinType(PseudoObjectTy, BuiltinType::PseudoObject);
1178 
1179  // "any" type; useful for debugger-like clients.
1180  InitBuiltinType(UnknownAnyTy, BuiltinType::UnknownAny);
1181 
1182  // Placeholder type for unbridged ARC casts.
1183  InitBuiltinType(ARCUnbridgedCastTy, BuiltinType::ARCUnbridgedCast);
1184 
1185  // Placeholder type for builtin functions.
1186  InitBuiltinType(BuiltinFnTy, BuiltinType::BuiltinFn);
1187 
1188  // Placeholder type for OMP array sections.
1189  if (LangOpts.OpenMP)
1190  InitBuiltinType(OMPArraySectionTy, BuiltinType::OMPArraySection);
1191 
1192  // C99 6.2.5p11.
1197 
1198  // Builtin types for 'id', 'Class', and 'SEL'.
1199  InitBuiltinType(ObjCBuiltinIdTy, BuiltinType::ObjCId);
1200  InitBuiltinType(ObjCBuiltinClassTy, BuiltinType::ObjCClass);
1201  InitBuiltinType(ObjCBuiltinSelTy, BuiltinType::ObjCSel);
1202 
1203  if (LangOpts.OpenCL) {
1204 #define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
1205  InitBuiltinType(SingletonId, BuiltinType::Id);
1206 #include "clang/Basic/OpenCLImageTypes.def"
1207 
1208  InitBuiltinType(OCLSamplerTy, BuiltinType::OCLSampler);
1209  InitBuiltinType(OCLEventTy, BuiltinType::OCLEvent);
1210  InitBuiltinType(OCLClkEventTy, BuiltinType::OCLClkEvent);
1211  InitBuiltinType(OCLQueueTy, BuiltinType::OCLQueue);
1212  InitBuiltinType(OCLReserveIDTy, BuiltinType::OCLReserveID);
1213  }
1214 
1215  // Builtin type for __objc_yes and __objc_no
1216  ObjCBuiltinBoolTy = (Target.useSignedCharForObjCBool() ?
1217  SignedCharTy : BoolTy);
1218 
1219  ObjCConstantStringType = QualType();
1220 
1221  ObjCSuperType = QualType();
1222 
1223  // void * type
1224  if (LangOpts.OpenCLVersion >= 200) {
1225  auto Q = VoidTy.getQualifiers();
1229  } else {
1231  }
1232 
1233  // nullptr type (C++0x 2.14.7)
1234  InitBuiltinType(NullPtrTy, BuiltinType::NullPtr);
1235 
1236  // half type (OpenCL 6.1.1.1) / ARM NEON __fp16
1237  InitBuiltinType(HalfTy, BuiltinType::Half);
1238 
1239  // Builtin type used to help define __builtin_va_list.
1240  VaListTagDecl = nullptr;
1241 }
1242 
1244  return SourceMgr.getDiagnostics();
1245 }
1246 
1248  AttrVec *&Result = DeclAttrs[D];
1249  if (!Result) {
1250  void *Mem = Allocate(sizeof(AttrVec));
1251  Result = new (Mem) AttrVec;
1252  }
1253 
1254  return *Result;
1255 }
1256 
1257 /// \brief Erase the attributes corresponding to the given declaration.
1259  llvm::DenseMap<const Decl*, AttrVec*>::iterator Pos = DeclAttrs.find(D);
1260  if (Pos != DeclAttrs.end()) {
1261  Pos->second->~AttrVec();
1262  DeclAttrs.erase(Pos);
1263  }
1264 }
1265 
1266 // FIXME: Remove ?
1269  assert(Var->isStaticDataMember() && "Not a static data member");
1271  .dyn_cast<MemberSpecializationInfo *>();
1272 }
1273 
1276  llvm::DenseMap<const VarDecl *, TemplateOrSpecializationInfo>::iterator Pos =
1277  TemplateOrInstantiation.find(Var);
1278  if (Pos == TemplateOrInstantiation.end())
1280 
1281  return Pos->second;
1282 }
1283 
1284 void
1287  SourceLocation PointOfInstantiation) {
1288  assert(Inst->isStaticDataMember() && "Not a static data member");
1289  assert(Tmpl->isStaticDataMember() && "Not a static data member");
1291  Tmpl, TSK, PointOfInstantiation));
1292 }
1293 
1294 void
1297  assert(!TemplateOrInstantiation[Inst] &&
1298  "Already noted what the variable was instantiated from");
1299  TemplateOrInstantiation[Inst] = TSI;
1300 }
1301 
1303  const FunctionDecl *FD){
1304  assert(FD && "Specialization is 0");
1305  llvm::DenseMap<const FunctionDecl*, FunctionDecl *>::const_iterator Pos
1306  = ClassScopeSpecializationPattern.find(FD);
1307  if (Pos == ClassScopeSpecializationPattern.end())
1308  return nullptr;
1309 
1310  return Pos->second;
1311 }
1312 
1314  FunctionDecl *Pattern) {
1315  assert(FD && "Specialization is 0");
1316  assert(Pattern && "Class scope specialization pattern is 0");
1317  ClassScopeSpecializationPattern[FD] = Pattern;
1318 }
1319 
1320 NamedDecl *
1322  auto Pos = InstantiatedFromUsingDecl.find(UUD);
1323  if (Pos == InstantiatedFromUsingDecl.end())
1324  return nullptr;
1325 
1326  return Pos->second;
1327 }
1328 
1329 void
1331  assert((isa<UsingDecl>(Pattern) ||
1332  isa<UnresolvedUsingValueDecl>(Pattern) ||
1333  isa<UnresolvedUsingTypenameDecl>(Pattern)) &&
1334  "pattern decl is not a using decl");
1335  assert((isa<UsingDecl>(Inst) ||
1336  isa<UnresolvedUsingValueDecl>(Inst) ||
1337  isa<UnresolvedUsingTypenameDecl>(Inst)) &&
1338  "instantiation did not produce a using decl");
1339  assert(!InstantiatedFromUsingDecl[Inst] && "pattern already exists");
1340  InstantiatedFromUsingDecl[Inst] = Pattern;
1341 }
1342 
1345  llvm::DenseMap<UsingShadowDecl*, UsingShadowDecl*>::const_iterator Pos
1346  = InstantiatedFromUsingShadowDecl.find(Inst);
1347  if (Pos == InstantiatedFromUsingShadowDecl.end())
1348  return nullptr;
1349 
1350  return Pos->second;
1351 }
1352 
1353 void
1355  UsingShadowDecl *Pattern) {
1356  assert(!InstantiatedFromUsingShadowDecl[Inst] && "pattern already exists");
1357  InstantiatedFromUsingShadowDecl[Inst] = Pattern;
1358 }
1359 
1361  llvm::DenseMap<FieldDecl *, FieldDecl *>::iterator Pos
1362  = InstantiatedFromUnnamedFieldDecl.find(Field);
1363  if (Pos == InstantiatedFromUnnamedFieldDecl.end())
1364  return nullptr;
1365 
1366  return Pos->second;
1367 }
1368 
1370  FieldDecl *Tmpl) {
1371  assert(!Inst->getDeclName() && "Instantiated field decl is not unnamed");
1372  assert(!Tmpl->getDeclName() && "Template field decl is not unnamed");
1373  assert(!InstantiatedFromUnnamedFieldDecl[Inst] &&
1374  "Already noted what unnamed field was instantiated from");
1375 
1376  InstantiatedFromUnnamedFieldDecl[Inst] = Tmpl;
1377 }
1378 
1381  llvm::DenseMap<const CXXMethodDecl *, CXXMethodVector>::const_iterator Pos =
1382  OverriddenMethods.find(Method->getCanonicalDecl());
1383  if (Pos == OverriddenMethods.end())
1384  return nullptr;
1385  return Pos->second.begin();
1386 }
1387 
1390  llvm::DenseMap<const CXXMethodDecl *, CXXMethodVector>::const_iterator Pos =
1391  OverriddenMethods.find(Method->getCanonicalDecl());
1392  if (Pos == OverriddenMethods.end())
1393  return nullptr;
1394  return Pos->second.end();
1395 }
1396 
1397 unsigned
1399  llvm::DenseMap<const CXXMethodDecl *, CXXMethodVector>::const_iterator Pos =
1400  OverriddenMethods.find(Method->getCanonicalDecl());
1401  if (Pos == OverriddenMethods.end())
1402  return 0;
1403  return Pos->second.size();
1404 }
1405 
1409  overridden_methods_end(Method));
1410 }
1411 
1413  const CXXMethodDecl *Overridden) {
1414  assert(Method->isCanonicalDecl() && Overridden->isCanonicalDecl());
1415  OverriddenMethods[Method].push_back(Overridden);
1416 }
1417 
1419  const NamedDecl *D,
1420  SmallVectorImpl<const NamedDecl *> &Overridden) const {
1421  assert(D);
1422 
1423  if (const CXXMethodDecl *CXXMethod = dyn_cast<CXXMethodDecl>(D)) {
1424  Overridden.append(overridden_methods_begin(CXXMethod),
1425  overridden_methods_end(CXXMethod));
1426  return;
1427  }
1428 
1429  const ObjCMethodDecl *Method = dyn_cast<ObjCMethodDecl>(D);
1430  if (!Method)
1431  return;
1432 
1434  Method->getOverriddenMethods(OverDecls);
1435  Overridden.append(OverDecls.begin(), OverDecls.end());
1436 }
1437 
1439  assert(!Import->NextLocalImport && "Import declaration already in the chain");
1440  assert(!Import->isFromASTFile() && "Non-local import declaration");
1441  if (!FirstLocalImport) {
1442  FirstLocalImport = Import;
1443  LastLocalImport = Import;
1444  return;
1445  }
1446 
1447  LastLocalImport->NextLocalImport = Import;
1448  LastLocalImport = Import;
1449 }
1450 
1451 //===----------------------------------------------------------------------===//
1452 // Type Sizing and Analysis
1453 //===----------------------------------------------------------------------===//
1454 
1455 /// getFloatTypeSemantics - Return the APFloat 'semantics' for the specified
1456 /// scalar floating point type.
1457 const llvm::fltSemantics &ASTContext::getFloatTypeSemantics(QualType T) const {
1458  const BuiltinType *BT = T->getAs<BuiltinType>();
1459  assert(BT && "Not a floating point type!");
1460  switch (BT->getKind()) {
1461  default: llvm_unreachable("Not a floating point type!");
1462  case BuiltinType::Float16:
1463  case BuiltinType::Half:
1464  return Target->getHalfFormat();
1465  case BuiltinType::Float: return Target->getFloatFormat();
1466  case BuiltinType::Double: return Target->getDoubleFormat();
1467  case BuiltinType::LongDouble: return Target->getLongDoubleFormat();
1468  case BuiltinType::Float128: return Target->getFloat128Format();
1469  }
1470 }
1471 
1472 CharUnits ASTContext::getDeclAlign(const Decl *D, bool ForAlignof) const {
1473  unsigned Align = Target->getCharWidth();
1474 
1475  bool UseAlignAttrOnly = false;
1476  if (unsigned AlignFromAttr = D->getMaxAlignment()) {
1477  Align = AlignFromAttr;
1478 
1479  // __attribute__((aligned)) can increase or decrease alignment
1480  // *except* on a struct or struct member, where it only increases
1481  // alignment unless 'packed' is also specified.
1482  //
1483  // It is an error for alignas to decrease alignment, so we can
1484  // ignore that possibility; Sema should diagnose it.
1485  if (isa<FieldDecl>(D)) {
1486  UseAlignAttrOnly = D->hasAttr<PackedAttr>() ||
1487  cast<FieldDecl>(D)->getParent()->hasAttr<PackedAttr>();
1488  } else {
1489  UseAlignAttrOnly = true;
1490  }
1491  }
1492  else if (isa<FieldDecl>(D))
1493  UseAlignAttrOnly =
1494  D->hasAttr<PackedAttr>() ||
1495  cast<FieldDecl>(D)->getParent()->hasAttr<PackedAttr>();
1496 
1497  // If we're using the align attribute only, just ignore everything
1498  // else about the declaration and its type.
1499  if (UseAlignAttrOnly) {
1500  // do nothing
1501  } else if (const ValueDecl *VD = dyn_cast<ValueDecl>(D)) {
1502  QualType T = VD->getType();
1503  if (const ReferenceType *RT = T->getAs<ReferenceType>()) {
1504  if (ForAlignof)
1505  T = RT->getPointeeType();
1506  else
1507  T = getPointerType(RT->getPointeeType());
1508  }
1509  QualType BaseT = getBaseElementType(T);
1510  if (T->isFunctionType())
1511  Align = getTypeInfoImpl(T.getTypePtr()).Align;
1512  else if (!BaseT->isIncompleteType()) {
1513  // Adjust alignments of declarations with array type by the
1514  // large-array alignment on the target.
1515  if (const ArrayType *arrayType = getAsArrayType(T)) {
1516  unsigned MinWidth = Target->getLargeArrayMinWidth();
1517  if (!ForAlignof && MinWidth) {
1518  if (isa<VariableArrayType>(arrayType))
1519  Align = std::max(Align, Target->getLargeArrayAlign());
1520  else if (isa<ConstantArrayType>(arrayType) &&
1521  MinWidth <= getTypeSize(cast<ConstantArrayType>(arrayType)))
1522  Align = std::max(Align, Target->getLargeArrayAlign());
1523  }
1524  }
1525  Align = std::max(Align, getPreferredTypeAlign(T.getTypePtr()));
1526  if (BaseT.getQualifiers().hasUnaligned())
1527  Align = Target->getCharWidth();
1528  if (const VarDecl *VD = dyn_cast<VarDecl>(D)) {
1529  if (VD->hasGlobalStorage() && !ForAlignof)
1530  Align = std::max(Align, getTargetInfo().getMinGlobalAlign());
1531  }
1532  }
1533 
1534  // Fields can be subject to extra alignment constraints, like if
1535  // the field is packed, the struct is packed, or the struct has a
1536  // a max-field-alignment constraint (#pragma pack). So calculate
1537  // the actual alignment of the field within the struct, and then
1538  // (as we're expected to) constrain that by the alignment of the type.
1539  if (const FieldDecl *Field = dyn_cast<FieldDecl>(VD)) {
1540  const RecordDecl *Parent = Field->getParent();
1541  // We can only produce a sensible answer if the record is valid.
1542  if (!Parent->isInvalidDecl()) {
1543  const ASTRecordLayout &Layout = getASTRecordLayout(Parent);
1544 
1545  // Start with the record's overall alignment.
1546  unsigned FieldAlign = toBits(Layout.getAlignment());
1547 
1548  // Use the GCD of that and the offset within the record.
1549  uint64_t Offset = Layout.getFieldOffset(Field->getFieldIndex());
1550  if (Offset > 0) {
1551  // Alignment is always a power of 2, so the GCD will be a power of 2,
1552  // which means we get to do this crazy thing instead of Euclid's.
1553  uint64_t LowBitOfOffset = Offset & (~Offset + 1);
1554  if (LowBitOfOffset < FieldAlign)
1555  FieldAlign = static_cast<unsigned>(LowBitOfOffset);
1556  }
1557 
1558  Align = std::min(Align, FieldAlign);
1559  }
1560  }
1561  }
1562 
1563  return toCharUnitsFromBits(Align);
1564 }
1565 
1566 // getTypeInfoDataSizeInChars - Return the size of a type, in
1567 // chars. If the type is a record, its data size is returned. This is
1568 // the size of the memcpy that's performed when assigning this type
1569 // using a trivial copy/move assignment operator.
1570 std::pair<CharUnits, CharUnits>
1572  std::pair<CharUnits, CharUnits> sizeAndAlign = getTypeInfoInChars(T);
1573 
1574  // In C++, objects can sometimes be allocated into the tail padding
1575  // of a base-class subobject. We decide whether that's possible
1576  // during class layout, so here we can just trust the layout results.
1577  if (getLangOpts().CPlusPlus) {
1578  if (const RecordType *RT = T->getAs<RecordType>()) {
1579  const ASTRecordLayout &layout = getASTRecordLayout(RT->getDecl());
1580  sizeAndAlign.first = layout.getDataSize();
1581  }
1582  }
1583 
1584  return sizeAndAlign;
1585 }
1586 
1587 /// getConstantArrayInfoInChars - Performing the computation in CharUnits
1588 /// instead of in bits prevents overflowing the uint64_t for some large arrays.
1589 std::pair<CharUnits, CharUnits>
1591  const ConstantArrayType *CAT) {
1592  std::pair<CharUnits, CharUnits> EltInfo =
1593  Context.getTypeInfoInChars(CAT->getElementType());
1594  uint64_t Size = CAT->getSize().getZExtValue();
1595  assert((Size == 0 || static_cast<uint64_t>(EltInfo.first.getQuantity()) <=
1596  (uint64_t)(-1)/Size) &&
1597  "Overflow in array type char size evaluation");
1598  uint64_t Width = EltInfo.first.getQuantity() * Size;
1599  unsigned Align = EltInfo.second.getQuantity();
1600  if (!Context.getTargetInfo().getCXXABI().isMicrosoft() ||
1601  Context.getTargetInfo().getPointerWidth(0) == 64)
1602  Width = llvm::alignTo(Width, Align);
1603  return std::make_pair(CharUnits::fromQuantity(Width),
1604  CharUnits::fromQuantity(Align));
1605 }
1606 
1607 std::pair<CharUnits, CharUnits>
1609  if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(T))
1610  return getConstantArrayInfoInChars(*this, CAT);
1611  TypeInfo Info = getTypeInfo(T);
1612  return std::make_pair(toCharUnitsFromBits(Info.Width),
1613  toCharUnitsFromBits(Info.Align));
1614 }
1615 
1616 std::pair<CharUnits, CharUnits>
1618  return getTypeInfoInChars(T.getTypePtr());
1619 }
1620 
1622  return getTypeInfo(T).AlignIsRequired;
1623 }
1624 
1626  return isAlignmentRequired(T.getTypePtr());
1627 }
1628 
1630  // An alignment on a typedef overrides anything else.
1631  if (auto *TT = T->getAs<TypedefType>())
1632  if (unsigned Align = TT->getDecl()->getMaxAlignment())
1633  return Align;
1634 
1635  // If we have an (array of) complete type, we're done.
1636  T = getBaseElementType(T);
1637  if (!T->isIncompleteType())
1638  return getTypeAlign(T);
1639 
1640  // If we had an array type, its element type might be a typedef
1641  // type with an alignment attribute.
1642  if (auto *TT = T->getAs<TypedefType>())
1643  if (unsigned Align = TT->getDecl()->getMaxAlignment())
1644  return Align;
1645 
1646  // Otherwise, see if the declaration of the type had an attribute.
1647  if (auto *TT = T->getAs<TagType>())
1648  return TT->getDecl()->getMaxAlignment();
1649 
1650  return 0;
1651 }
1652 
1654  TypeInfoMap::iterator I = MemoizedTypeInfo.find(T);
1655  if (I != MemoizedTypeInfo.end())
1656  return I->second;
1657 
1658  // This call can invalidate MemoizedTypeInfo[T], so we need a second lookup.
1659  TypeInfo TI = getTypeInfoImpl(T);
1660  MemoizedTypeInfo[T] = TI;
1661  return TI;
1662 }
1663 
1664 /// getTypeInfoImpl - Return the size of the specified type, in bits. This
1665 /// method does not work on incomplete types.
1666 ///
1667 /// FIXME: Pointers into different addr spaces could have different sizes and
1668 /// alignment requirements: getPointerInfo should take an AddrSpace, this
1669 /// should take a QualType, &c.
1670 TypeInfo ASTContext::getTypeInfoImpl(const Type *T) const {
1671  uint64_t Width = 0;
1672  unsigned Align = 8;
1673  bool AlignIsRequired = false;
1674  unsigned AS = 0;
1675  switch (T->getTypeClass()) {
1676 #define TYPE(Class, Base)
1677 #define ABSTRACT_TYPE(Class, Base)
1678 #define NON_CANONICAL_TYPE(Class, Base)
1679 #define DEPENDENT_TYPE(Class, Base) case Type::Class:
1680 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base) \
1681  case Type::Class: \
1682  assert(!T->isDependentType() && "should not see dependent types here"); \
1683  return getTypeInfo(cast<Class##Type>(T)->desugar().getTypePtr());
1684 #include "clang/AST/TypeNodes.def"
1685  llvm_unreachable("Should not see dependent types");
1686 
1687  case Type::FunctionNoProto:
1688  case Type::FunctionProto:
1689  // GCC extension: alignof(function) = 32 bits
1690  Width = 0;
1691  Align = 32;
1692  break;
1693 
1694  case Type::IncompleteArray:
1695  case Type::VariableArray:
1696  Width = 0;
1697  Align = getTypeAlign(cast<ArrayType>(T)->getElementType());
1698  break;
1699 
1700  case Type::ConstantArray: {
1701  const ConstantArrayType *CAT = cast<ConstantArrayType>(T);
1702 
1703  TypeInfo EltInfo = getTypeInfo(CAT->getElementType());
1704  uint64_t Size = CAT->getSize().getZExtValue();
1705  assert((Size == 0 || EltInfo.Width <= (uint64_t)(-1) / Size) &&
1706  "Overflow in array type bit size evaluation");
1707  Width = EltInfo.Width * Size;
1708  Align = EltInfo.Align;
1709  if (!getTargetInfo().getCXXABI().isMicrosoft() ||
1710  getTargetInfo().getPointerWidth(0) == 64)
1711  Width = llvm::alignTo(Width, Align);
1712  break;
1713  }
1714  case Type::ExtVector:
1715  case Type::Vector: {
1716  const VectorType *VT = cast<VectorType>(T);
1717  TypeInfo EltInfo = getTypeInfo(VT->getElementType());
1718  Width = EltInfo.Width * VT->getNumElements();
1719  Align = Width;
1720  // If the alignment is not a power of 2, round up to the next power of 2.
1721  // This happens for non-power-of-2 length vectors.
1722  if (Align & (Align-1)) {
1723  Align = llvm::NextPowerOf2(Align);
1724  Width = llvm::alignTo(Width, Align);
1725  }
1726  // Adjust the alignment based on the target max.
1727  uint64_t TargetVectorAlign = Target->getMaxVectorAlign();
1728  if (TargetVectorAlign && TargetVectorAlign < Align)
1729  Align = TargetVectorAlign;
1730  break;
1731  }
1732 
1733  case Type::Builtin:
1734  switch (cast<BuiltinType>(T)->getKind()) {
1735  default: llvm_unreachable("Unknown builtin type!");
1736  case BuiltinType::Void:
1737  // GCC extension: alignof(void) = 8 bits.
1738  Width = 0;
1739  Align = 8;
1740  break;
1741  case BuiltinType::Bool:
1742  Width = Target->getBoolWidth();
1743  Align = Target->getBoolAlign();
1744  break;
1745  case BuiltinType::Char_S:
1746  case BuiltinType::Char_U:
1747  case BuiltinType::UChar:
1748  case BuiltinType::SChar:
1749  Width = Target->getCharWidth();
1750  Align = Target->getCharAlign();
1751  break;
1752  case BuiltinType::WChar_S:
1753  case BuiltinType::WChar_U:
1754  Width = Target->getWCharWidth();
1755  Align = Target->getWCharAlign();
1756  break;
1757  case BuiltinType::Char16:
1758  Width = Target->getChar16Width();
1759  Align = Target->getChar16Align();
1760  break;
1761  case BuiltinType::Char32:
1762  Width = Target->getChar32Width();
1763  Align = Target->getChar32Align();
1764  break;
1765  case BuiltinType::UShort:
1766  case BuiltinType::Short:
1767  Width = Target->getShortWidth();
1768  Align = Target->getShortAlign();
1769  break;
1770  case BuiltinType::UInt:
1771  case BuiltinType::Int:
1772  Width = Target->getIntWidth();
1773  Align = Target->getIntAlign();
1774  break;
1775  case BuiltinType::ULong:
1776  case BuiltinType::Long:
1777  Width = Target->getLongWidth();
1778  Align = Target->getLongAlign();
1779  break;
1780  case BuiltinType::ULongLong:
1781  case BuiltinType::LongLong:
1782  Width = Target->getLongLongWidth();
1783  Align = Target->getLongLongAlign();
1784  break;
1785  case BuiltinType::Int128:
1786  case BuiltinType::UInt128:
1787  Width = 128;
1788  Align = 128; // int128_t is 128-bit aligned on all targets.
1789  break;
1790  case BuiltinType::Float16:
1791  case BuiltinType::Half:
1792  Width = Target->getHalfWidth();
1793  Align = Target->getHalfAlign();
1794  break;
1795  case BuiltinType::Float:
1796  Width = Target->getFloatWidth();
1797  Align = Target->getFloatAlign();
1798  break;
1799  case BuiltinType::Double:
1800  Width = Target->getDoubleWidth();
1801  Align = Target->getDoubleAlign();
1802  break;
1803  case BuiltinType::LongDouble:
1804  Width = Target->getLongDoubleWidth();
1805  Align = Target->getLongDoubleAlign();
1806  break;
1807  case BuiltinType::Float128:
1808  Width = Target->getFloat128Width();
1809  Align = Target->getFloat128Align();
1810  break;
1811  case BuiltinType::NullPtr:
1812  Width = Target->getPointerWidth(0); // C++ 3.9.1p11: sizeof(nullptr_t)
1813  Align = Target->getPointerAlign(0); // == sizeof(void*)
1814  break;
1815  case BuiltinType::ObjCId:
1816  case BuiltinType::ObjCClass:
1817  case BuiltinType::ObjCSel:
1818  Width = Target->getPointerWidth(0);
1819  Align = Target->getPointerAlign(0);
1820  break;
1821  case BuiltinType::OCLSampler:
1822  case BuiltinType::OCLEvent:
1823  case BuiltinType::OCLClkEvent:
1824  case BuiltinType::OCLQueue:
1825  case BuiltinType::OCLReserveID:
1826 #define IMAGE_TYPE(ImgType, Id, SingletonId, Access, Suffix) \
1827  case BuiltinType::Id:
1828 #include "clang/Basic/OpenCLImageTypes.def"
1829  AS = getTargetAddressSpace(
1831  Width = Target->getPointerWidth(AS);
1832  Align = Target->getPointerAlign(AS);
1833  break;
1834  }
1835  break;
1836  case Type::ObjCObjectPointer:
1837  Width = Target->getPointerWidth(0);
1838  Align = Target->getPointerAlign(0);
1839  break;
1840  case Type::BlockPointer:
1841  AS = getTargetAddressSpace(cast<BlockPointerType>(T)->getPointeeType());
1842  Width = Target->getPointerWidth(AS);
1843  Align = Target->getPointerAlign(AS);
1844  break;
1845  case Type::LValueReference:
1846  case Type::RValueReference:
1847  // alignof and sizeof should never enter this code path here, so we go
1848  // the pointer route.
1849  AS = getTargetAddressSpace(cast<ReferenceType>(T)->getPointeeType());
1850  Width = Target->getPointerWidth(AS);
1851  Align = Target->getPointerAlign(AS);
1852  break;
1853  case Type::Pointer:
1854  AS = getTargetAddressSpace(cast<PointerType>(T)->getPointeeType());
1855  Width = Target->getPointerWidth(AS);
1856  Align = Target->getPointerAlign(AS);
1857  break;
1858  case Type::MemberPointer: {
1859  const MemberPointerType *MPT = cast<MemberPointerType>(T);
1860  CXXABI::MemberPointerInfo MPI = ABI->getMemberPointerInfo(MPT);
1861  Width = MPI.Width;
1862  Align = MPI.Align;
1863  break;
1864  }
1865  case Type::Complex: {
1866  // Complex types have the same alignment as their elements, but twice the
1867  // size.
1868  TypeInfo EltInfo = getTypeInfo(cast<ComplexType>(T)->getElementType());
1869  Width = EltInfo.Width * 2;
1870  Align = EltInfo.Align;
1871  break;
1872  }
1873  case Type::ObjCObject:
1874  return getTypeInfo(cast<ObjCObjectType>(T)->getBaseType().getTypePtr());
1875  case Type::Adjusted:
1876  case Type::Decayed:
1877  return getTypeInfo(cast<AdjustedType>(T)->getAdjustedType().getTypePtr());
1878  case Type::ObjCInterface: {
1879  const ObjCInterfaceType *ObjCI = cast<ObjCInterfaceType>(T);
1880  const ASTRecordLayout &Layout = getASTObjCInterfaceLayout(ObjCI->getDecl());
1881  Width = toBits(Layout.getSize());
1882  Align = toBits(Layout.getAlignment());
1883  break;
1884  }
1885  case Type::Record:
1886  case Type::Enum: {
1887  const TagType *TT = cast<TagType>(T);
1888 
1889  if (TT->getDecl()->isInvalidDecl()) {
1890  Width = 8;
1891  Align = 8;
1892  break;
1893  }
1894 
1895  if (const EnumType *ET = dyn_cast<EnumType>(TT)) {
1896  const EnumDecl *ED = ET->getDecl();
1897  TypeInfo Info =
1899  if (unsigned AttrAlign = ED->getMaxAlignment()) {
1900  Info.Align = AttrAlign;
1901  Info.AlignIsRequired = true;
1902  }
1903  return Info;
1904  }
1905 
1906  const RecordType *RT = cast<RecordType>(TT);
1907  const RecordDecl *RD = RT->getDecl();
1908  const ASTRecordLayout &Layout = getASTRecordLayout(RD);
1909  Width = toBits(Layout.getSize());
1910  Align = toBits(Layout.getAlignment());
1911  AlignIsRequired = RD->hasAttr<AlignedAttr>();
1912  break;
1913  }
1914 
1915  case Type::SubstTemplateTypeParm:
1916  return getTypeInfo(cast<SubstTemplateTypeParmType>(T)->
1917  getReplacementType().getTypePtr());
1918 
1919  case Type::Auto:
1920  case Type::DeducedTemplateSpecialization: {
1921  const DeducedType *A = cast<DeducedType>(T);
1922  assert(!A->getDeducedType().isNull() &&
1923  "cannot request the size of an undeduced or dependent auto type");
1924  return getTypeInfo(A->getDeducedType().getTypePtr());
1925  }
1926 
1927  case Type::Paren:
1928  return getTypeInfo(cast<ParenType>(T)->getInnerType().getTypePtr());
1929 
1930  case Type::ObjCTypeParam:
1931  return getTypeInfo(cast<ObjCTypeParamType>(T)->desugar().getTypePtr());
1932 
1933  case Type::Typedef: {
1934  const TypedefNameDecl *Typedef = cast<TypedefType>(T)->getDecl();
1935  TypeInfo Info = getTypeInfo(Typedef->getUnderlyingType().getTypePtr());
1936  // If the typedef has an aligned attribute on it, it overrides any computed
1937  // alignment we have. This violates the GCC documentation (which says that
1938  // attribute(aligned) can only round up) but matches its implementation.
1939  if (unsigned AttrAlign = Typedef->getMaxAlignment()) {
1940  Align = AttrAlign;
1941  AlignIsRequired = true;
1942  } else {
1943  Align = Info.Align;
1944  AlignIsRequired = Info.AlignIsRequired;
1945  }
1946  Width = Info.Width;
1947  break;
1948  }
1949 
1950  case Type::Elaborated:
1951  return getTypeInfo(cast<ElaboratedType>(T)->getNamedType().getTypePtr());
1952 
1953  case Type::Attributed:
1954  return getTypeInfo(
1955  cast<AttributedType>(T)->getEquivalentType().getTypePtr());
1956 
1957  case Type::Atomic: {
1958  // Start with the base type information.
1959  TypeInfo Info = getTypeInfo(cast<AtomicType>(T)->getValueType());
1960  Width = Info.Width;
1961  Align = Info.Align;
1962 
1963  // If the size of the type doesn't exceed the platform's max
1964  // atomic promotion width, make the size and alignment more
1965  // favorable to atomic operations:
1966  if (Width != 0 && Width <= Target->getMaxAtomicPromoteWidth()) {
1967  // Round the size up to a power of 2.
1968  if (!llvm::isPowerOf2_64(Width))
1969  Width = llvm::NextPowerOf2(Width);
1970 
1971  // Set the alignment equal to the size.
1972  Align = static_cast<unsigned>(Width);
1973  }
1974  }
1975  break;
1976 
1977  case Type::Pipe:
1980  break;
1981  }
1982 
1983  assert(llvm::isPowerOf2_32(Align) && "Alignment must be power of 2");
1984  return TypeInfo(Width, Align, AlignIsRequired);
1985 }
1986 
1988  unsigned SimdAlign = getTargetInfo().getSimdDefaultAlign();
1989  // Target ppc64 with QPX: simd default alignment for pointer to double is 32.
1990  if ((getTargetInfo().getTriple().getArch() == llvm::Triple::ppc64 ||
1991  getTargetInfo().getTriple().getArch() == llvm::Triple::ppc64le) &&
1992  getTargetInfo().getABI() == "elfv1-qpx" &&
1993  T->isSpecificBuiltinType(BuiltinType::Double))
1994  SimdAlign = 256;
1995  return SimdAlign;
1996 }
1997 
1998 /// toCharUnitsFromBits - Convert a size in bits to a size in characters.
2000  return CharUnits::fromQuantity(BitSize / getCharWidth());
2001 }
2002 
2003 /// toBits - Convert a size in characters to a size in characters.
2004 int64_t ASTContext::toBits(CharUnits CharSize) const {
2005  return CharSize.getQuantity() * getCharWidth();
2006 }
2007 
2008 /// getTypeSizeInChars - Return the size of the specified type, in characters.
2009 /// This method does not work on incomplete types.
2011  return getTypeInfoInChars(T).first;
2012 }
2014  return getTypeInfoInChars(T).first;
2015 }
2016 
2017 /// getTypeAlignInChars - Return the ABI-specified alignment of a type, in
2018 /// characters. This method does not work on incomplete types.
2020  return toCharUnitsFromBits(getTypeAlign(T));
2021 }
2023  return toCharUnitsFromBits(getTypeAlign(T));
2024 }
2025 
2026 /// getPreferredTypeAlign - Return the "preferred" alignment of the specified
2027 /// type for the current target in bits. This can be different than the ABI
2028 /// alignment in cases where it is beneficial for performance to overalign
2029 /// a data type.
2030 unsigned ASTContext::getPreferredTypeAlign(const Type *T) const {
2031  TypeInfo TI = getTypeInfo(T);
2032  unsigned ABIAlign = TI.Align;
2033 
2034  T = T->getBaseElementTypeUnsafe();
2035 
2036  // The preferred alignment of member pointers is that of a pointer.
2037  if (T->isMemberPointerType())
2039 
2040  if (!Target->allowsLargerPreferedTypeAlignment())
2041  return ABIAlign;
2042 
2043  // Double and long long should be naturally aligned if possible.
2044  if (const ComplexType *CT = T->getAs<ComplexType>())
2045  T = CT->getElementType().getTypePtr();
2046  if (const EnumType *ET = T->getAs<EnumType>())
2047  T = ET->getDecl()->getIntegerType().getTypePtr();
2048  if (T->isSpecificBuiltinType(BuiltinType::Double) ||
2049  T->isSpecificBuiltinType(BuiltinType::LongLong) ||
2050  T->isSpecificBuiltinType(BuiltinType::ULongLong))
2051  // Don't increase the alignment if an alignment attribute was specified on a
2052  // typedef declaration.
2053  if (!TI.AlignIsRequired)
2054  return std::max(ABIAlign, (unsigned)getTypeSize(T));
2055 
2056  return ABIAlign;
2057 }
2058 
2059 /// getTargetDefaultAlignForAttributeAligned - Return the default alignment
2060 /// for __attribute__((aligned)) on this target, to be used if no alignment
2061 /// value is specified.
2064 }
2065 
2066 /// getAlignOfGlobalVar - Return the alignment in bits that should be given
2067 /// to a global variable of the specified type.
2069  return std::max(getTypeAlign(T), getTargetInfo().getMinGlobalAlign());
2070 }
2071 
2072 /// getAlignOfGlobalVarInChars - Return the alignment in characters that
2073 /// should be given to a global variable of the specified type.
2076 }
2077 
2080  const ASTRecordLayout *Layout = &getASTRecordLayout(RD);
2081  while (const CXXRecordDecl *Base = Layout->getBaseSharingVBPtr()) {
2082  Offset += Layout->getBaseClassOffset(Base);
2083  Layout = &getASTRecordLayout(Base);
2084  }
2085  return Offset;
2086 }
2087 
2088 /// DeepCollectObjCIvars -
2089 /// This routine first collects all declared, but not synthesized, ivars in
2090 /// super class and then collects all ivars, including those synthesized for
2091 /// current class. This routine is used for implementation of current class
2092 /// when all ivars, declared and synthesized are known.
2094  bool leafClass,
2095  SmallVectorImpl<const ObjCIvarDecl*> &Ivars) const {
2096  if (const ObjCInterfaceDecl *SuperClass = OI->getSuperClass())
2097  DeepCollectObjCIvars(SuperClass, false, Ivars);
2098  if (!leafClass) {
2099  for (const auto *I : OI->ivars())
2100  Ivars.push_back(I);
2101  } else {
2102  ObjCInterfaceDecl *IDecl = const_cast<ObjCInterfaceDecl *>(OI);
2103  for (const ObjCIvarDecl *Iv = IDecl->all_declared_ivar_begin(); Iv;
2104  Iv= Iv->getNextIvar())
2105  Ivars.push_back(Iv);
2106  }
2107 }
2108 
2109 /// CollectInheritedProtocols - Collect all protocols in current class and
2110 /// those inherited by it.
2112  llvm::SmallPtrSet<ObjCProtocolDecl*, 8> &Protocols) {
2113  if (const ObjCInterfaceDecl *OI = dyn_cast<ObjCInterfaceDecl>(CDecl)) {
2114  // We can use protocol_iterator here instead of
2115  // all_referenced_protocol_iterator since we are walking all categories.
2116  for (auto *Proto : OI->all_referenced_protocols()) {
2117  CollectInheritedProtocols(Proto, Protocols);
2118  }
2119 
2120  // Categories of this Interface.
2121  for (const auto *Cat : OI->visible_categories())
2122  CollectInheritedProtocols(Cat, Protocols);
2123 
2124  if (ObjCInterfaceDecl *SD = OI->getSuperClass())
2125  while (SD) {
2126  CollectInheritedProtocols(SD, Protocols);
2127  SD = SD->getSuperClass();
2128  }
2129  } else if (const ObjCCategoryDecl *OC = dyn_cast<ObjCCategoryDecl>(CDecl)) {
2130  for (auto *Proto : OC->protocols()) {
2131  CollectInheritedProtocols(Proto, Protocols);
2132  }
2133  } else if (const ObjCProtocolDecl *OP = dyn_cast<ObjCProtocolDecl>(CDecl)) {
2134  // Insert the protocol.
2135  if (!Protocols.insert(
2136  const_cast<ObjCProtocolDecl *>(OP->getCanonicalDecl())).second)
2137  return;
2138 
2139  for (auto *Proto : OP->protocols())
2140  CollectInheritedProtocols(Proto, Protocols);
2141  }
2142 }
2143 
2145  const RecordDecl *RD) {
2146  assert(RD->isUnion() && "Must be union type");
2147  CharUnits UnionSize = Context.getTypeSizeInChars(RD->getTypeForDecl());
2148 
2149  for (const auto *Field : RD->fields()) {
2150  if (!Context.hasUniqueObjectRepresentations(Field->getType()))
2151  return false;
2152  CharUnits FieldSize = Context.getTypeSizeInChars(Field->getType());
2153  if (FieldSize != UnionSize)
2154  return false;
2155  }
2156  return true;
2157 }
2158 
2160  const RecordDecl *RD = Ty->castAs<RecordType>()->getDecl();
2161 
2162  if (!RD->field_empty())
2163  return false;
2164 
2165  if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RD))
2166  return ClassDecl->isEmpty();
2167 
2168  return true;
2169 }
2170 
2173  const RecordDecl *RD) {
2174  assert(!RD->isUnion() && "Must be struct/class type");
2175  const auto &Layout = Context.getASTRecordLayout(RD);
2176 
2177  int64_t CurOffsetInBits = 0;
2178  if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RD)) {
2179  if (ClassDecl->isDynamicClass())
2180  return llvm::None;
2181 
2183  for (const auto Base : ClassDecl->bases()) {
2184  // Empty types can be inherited from, and non-empty types can potentially
2185  // have tail padding, so just make sure there isn't an error.
2186  if (!isStructEmpty(Base.getType())) {
2188  Context, Base.getType()->getAs<RecordType>()->getDecl());
2189  if (!Size)
2190  return llvm::None;
2191  Bases.emplace_back(Base.getType(), Size.getValue());
2192  }
2193  }
2194 
2195  std::sort(
2196  Bases.begin(), Bases.end(), [&](const std::pair<QualType, int64_t> &L,
2197  const std::pair<QualType, int64_t> &R) {
2198  return Layout.getBaseClassOffset(L.first->getAsCXXRecordDecl()) <
2199  Layout.getBaseClassOffset(R.first->getAsCXXRecordDecl());
2200  });
2201 
2202  for (const auto Base : Bases) {
2203  int64_t BaseOffset = Context.toBits(
2204  Layout.getBaseClassOffset(Base.first->getAsCXXRecordDecl()));
2205  int64_t BaseSize = Base.second;
2206  if (BaseOffset != CurOffsetInBits)
2207  return llvm::None;
2208  CurOffsetInBits = BaseOffset + BaseSize;
2209  }
2210  }
2211 
2212  for (const auto *Field : RD->fields()) {
2213  if (!Field->getType()->isReferenceType() &&
2214  !Context.hasUniqueObjectRepresentations(Field->getType()))
2215  return llvm::None;
2216 
2217  int64_t FieldSizeInBits =
2218  Context.toBits(Context.getTypeSizeInChars(Field->getType()));
2219  if (Field->isBitField()) {
2220  int64_t BitfieldSize = Field->getBitWidthValue(Context);
2221 
2222  if (BitfieldSize > FieldSizeInBits)
2223  return llvm::None;
2224  FieldSizeInBits = BitfieldSize;
2225  }
2226 
2227  int64_t FieldOffsetInBits = Context.getFieldOffset(Field);
2228 
2229  if (FieldOffsetInBits != CurOffsetInBits)
2230  return llvm::None;
2231 
2232  CurOffsetInBits = FieldSizeInBits + FieldOffsetInBits;
2233  }
2234 
2235  return CurOffsetInBits;
2236 }
2237 
2239  // C++17 [meta.unary.prop]:
2240  // The predicate condition for a template specialization
2241  // has_unique_object_representations<T> shall be
2242  // satisfied if and only if:
2243  // (9.1) - T is trivially copyable, and
2244  // (9.2) - any two objects of type T with the same value have the same
2245  // object representation, where two objects
2246  // of array or non-union class type are considered to have the same value
2247  // if their respective sequences of
2248  // direct subobjects have the same values, and two objects of union type
2249  // are considered to have the same
2250  // value if they have the same active member and the corresponding members
2251  // have the same value.
2252  // The set of scalar types for which this condition holds is
2253  // implementation-defined. [ Note: If a type has padding
2254  // bits, the condition does not hold; otherwise, the condition holds true
2255  // for unsigned integral types. -- end note ]
2256  assert(!Ty.isNull() && "Null QualType sent to unique object rep check");
2257 
2258  // Arrays are unique only if their element type is unique.
2259  if (Ty->isArrayType())
2261 
2262  // (9.1) - T is trivially copyable...
2263  if (!Ty.isTriviallyCopyableType(*this))
2264  return false;
2265 
2266  // All integrals and enums are unique.
2267  if (Ty->isIntegralOrEnumerationType())
2268  return true;
2269 
2270  // All other pointers are unique.
2271  if (Ty->isPointerType())
2272  return true;
2273 
2274  if (Ty->isMemberPointerType()) {
2275  const MemberPointerType *MPT = Ty->getAs<MemberPointerType>();
2276  return !ABI->getMemberPointerInfo(MPT).HasPadding;
2277  }
2278 
2279  if (Ty->isRecordType()) {
2280  const RecordDecl *Record = Ty->getAs<RecordType>()->getDecl();
2281 
2282  if (Record->isInvalidDecl())
2283  return false;
2284 
2285  if (Record->isUnion())
2286  return unionHasUniqueObjectRepresentations(*this, Record);
2287 
2288  Optional<int64_t> StructSize =
2289  structHasUniqueObjectRepresentations(*this, Record);
2290 
2291  return StructSize &&
2292  StructSize.getValue() == static_cast<int64_t>(getTypeSize(Ty));
2293  }
2294 
2295  // FIXME: More cases to handle here (list by rsmith):
2296  // vectors (careful about, eg, vector of 3 foo)
2297  // _Complex int and friends
2298  // _Atomic T
2299  // Obj-C block pointers
2300  // Obj-C object pointers
2301  // and perhaps OpenCL's various builtin types (pipe, sampler_t, event_t,
2302  // clk_event_t, queue_t, reserve_id_t)
2303  // There're also Obj-C class types and the Obj-C selector type, but I think it
2304  // makes sense for those to return false here.
2305 
2306  return false;
2307 }
2308 
2310  unsigned count = 0;
2311  // Count ivars declared in class extension.
2312  for (const auto *Ext : OI->known_extensions())
2313  count += Ext->ivar_size();
2314 
2315  // Count ivar defined in this class's implementation. This
2316  // includes synthesized ivars.
2317  if (ObjCImplementationDecl *ImplDecl = OI->getImplementation())
2318  count += ImplDecl->ivar_size();
2319 
2320  return count;
2321 }
2322 
2324  if (!E)
2325  return false;
2326 
2327  // nullptr_t is always treated as null.
2328  if (E->getType()->isNullPtrType()) return true;
2329 
2330  if (E->getType()->isAnyPointerType() &&
2333  return true;
2334 
2335  // Unfortunately, __null has type 'int'.
2336  if (isa<GNUNullExpr>(E)) return true;
2337 
2338  return false;
2339 }
2340 
2341 /// \brief Get the implementation of ObjCInterfaceDecl, or nullptr if none
2342 /// exists.
2344  llvm::DenseMap<ObjCContainerDecl*, ObjCImplDecl*>::iterator
2345  I = ObjCImpls.find(D);
2346  if (I != ObjCImpls.end())
2347  return cast<ObjCImplementationDecl>(I->second);
2348  return nullptr;
2349 }
2350 
2351 /// \brief Get the implementation of ObjCCategoryDecl, or nullptr if none
2352 /// exists.
2354  llvm::DenseMap<ObjCContainerDecl*, ObjCImplDecl*>::iterator
2355  I = ObjCImpls.find(D);
2356  if (I != ObjCImpls.end())
2357  return cast<ObjCCategoryImplDecl>(I->second);
2358  return nullptr;
2359 }
2360 
2361 /// \brief Set the implementation of ObjCInterfaceDecl.
2363  ObjCImplementationDecl *ImplD) {
2364  assert(IFaceD && ImplD && "Passed null params");
2365  ObjCImpls[IFaceD] = ImplD;
2366 }
2367 
2368 /// \brief Set the implementation of ObjCCategoryDecl.
2370  ObjCCategoryImplDecl *ImplD) {
2371  assert(CatD && ImplD && "Passed null params");
2372  ObjCImpls[CatD] = ImplD;
2373 }
2374 
2375 const ObjCMethodDecl *
2377  return ObjCMethodRedecls.lookup(MD);
2378 }
2379 
2381  const ObjCMethodDecl *Redecl) {
2382  assert(!getObjCMethodRedeclaration(MD) && "MD already has a redeclaration");
2383  ObjCMethodRedecls[MD] = Redecl;
2384 }
2385 
2387  const NamedDecl *ND) const {
2388  if (const ObjCInterfaceDecl *ID =
2389  dyn_cast<ObjCInterfaceDecl>(ND->getDeclContext()))
2390  return ID;
2391  if (const ObjCCategoryDecl *CD =
2392  dyn_cast<ObjCCategoryDecl>(ND->getDeclContext()))
2393  return CD->getClassInterface();
2394  if (const ObjCImplDecl *IMD =
2395  dyn_cast<ObjCImplDecl>(ND->getDeclContext()))
2396  return IMD->getClassInterface();
2397 
2398  return nullptr;
2399 }
2400 
2401 /// \brief Get the copy initialization expression of VarDecl, or nullptr if
2402 /// none exists.
2404  assert(VD && "Passed null params");
2405  assert(VD->hasAttr<BlocksAttr>() &&
2406  "getBlockVarCopyInits - not __block var");
2407  llvm::DenseMap<const VarDecl*, Expr*>::iterator
2408  I = BlockVarCopyInits.find(VD);
2409  return (I != BlockVarCopyInits.end()) ? cast<Expr>(I->second) : nullptr;
2410 }
2411 
2412 /// \brief Set the copy inialization expression of a block var decl.
2414  assert(VD && Init && "Passed null params");
2415  assert(VD->hasAttr<BlocksAttr>() &&
2416  "setBlockVarCopyInits - not __block var");
2417  BlockVarCopyInits[VD] = Init;
2418 }
2419 
2421  unsigned DataSize) const {
2422  if (!DataSize)
2423  DataSize = TypeLoc::getFullDataSizeForType(T);
2424  else
2425  assert(DataSize == TypeLoc::getFullDataSizeForType(T) &&
2426  "incorrect data size provided to CreateTypeSourceInfo!");
2427 
2428  TypeSourceInfo *TInfo =
2429  (TypeSourceInfo*)BumpAlloc.Allocate(sizeof(TypeSourceInfo) + DataSize, 8);
2430  new (TInfo) TypeSourceInfo(T);
2431  return TInfo;
2432 }
2433 
2435  SourceLocation L) const {
2437  DI->getTypeLoc().initialize(const_cast<ASTContext &>(*this), L);
2438  return DI;
2439 }
2440 
2441 const ASTRecordLayout &
2443  return getObjCLayout(D, nullptr);
2444 }
2445 
2446 const ASTRecordLayout &
2448  const ObjCImplementationDecl *D) const {
2449  return getObjCLayout(D->getClassInterface(), D);
2450 }
2451 
2452 //===----------------------------------------------------------------------===//
2453 // Type creation/memoization methods
2454 //===----------------------------------------------------------------------===//
2455 
2456 QualType
2457 ASTContext::getExtQualType(const Type *baseType, Qualifiers quals) const {
2458  unsigned fastQuals = quals.getFastQualifiers();
2459  quals.removeFastQualifiers();
2460 
2461  // Check if we've already instantiated this type.
2462  llvm::FoldingSetNodeID ID;
2463  ExtQuals::Profile(ID, baseType, quals);
2464  void *insertPos = nullptr;
2465  if (ExtQuals *eq = ExtQualNodes.FindNodeOrInsertPos(ID, insertPos)) {
2466  assert(eq->getQualifiers() == quals);
2467  return QualType(eq, fastQuals);
2468  }
2469 
2470  // If the base type is not canonical, make the appropriate canonical type.
2471  QualType canon;
2472  if (!baseType->isCanonicalUnqualified()) {
2473  SplitQualType canonSplit = baseType->getCanonicalTypeInternal().split();
2474  canonSplit.Quals.addConsistentQualifiers(quals);
2475  canon = getExtQualType(canonSplit.Ty, canonSplit.Quals);
2476 
2477  // Re-find the insert position.
2478  (void) ExtQualNodes.FindNodeOrInsertPos(ID, insertPos);
2479  }
2480 
2481  ExtQuals *eq = new (*this, TypeAlignment) ExtQuals(baseType, canon, quals);
2482  ExtQualNodes.InsertNode(eq, insertPos);
2483  return QualType(eq, fastQuals);
2484 }
2485 
2487  LangAS AddressSpace) const {
2488  QualType CanT = getCanonicalType(T);
2489  if (CanT.getAddressSpace() == AddressSpace)
2490  return T;
2491 
2492  // If we are composing extended qualifiers together, merge together
2493  // into one ExtQuals node.
2494  QualifierCollector Quals;
2495  const Type *TypeNode = Quals.strip(T);
2496 
2497  // If this type already has an address space specified, it cannot get
2498  // another one.
2499  assert(!Quals.hasAddressSpace() &&
2500  "Type cannot be in multiple addr spaces!");
2501  Quals.addAddressSpace(AddressSpace);
2502 
2503  return getExtQualType(TypeNode, Quals);
2504 }
2505 
2507  // If we are composing extended qualifiers together, merge together
2508  // into one ExtQuals node.
2509  QualifierCollector Quals;
2510  const Type *TypeNode = Quals.strip(T);
2511 
2512  // If the qualifier doesn't have an address space just return it.
2513  if (!Quals.hasAddressSpace())
2514  return T;
2515 
2516  Quals.removeAddressSpace();
2517 
2518  // Removal of the address space can mean there are no longer any
2519  // non-fast qualifiers, so creating an ExtQualType isn't possible (asserts)
2520  // or required.
2521  if (Quals.hasNonFastQualifiers())
2522  return getExtQualType(TypeNode, Quals);
2523  else
2524  return QualType(TypeNode, Quals.getFastQualifiers());
2525 }
2526 
2528  Qualifiers::GC GCAttr) const {
2529  QualType CanT = getCanonicalType(T);
2530  if (CanT.getObjCGCAttr() == GCAttr)
2531  return T;
2532 
2533  if (const PointerType *ptr = T->getAs<PointerType>()) {
2534  QualType Pointee = ptr->getPointeeType();
2535  if (Pointee->isAnyPointerType()) {
2536  QualType ResultType = getObjCGCQualType(Pointee, GCAttr);
2537  return getPointerType(ResultType);
2538  }
2539  }
2540 
2541  // If we are composing extended qualifiers together, merge together
2542  // into one ExtQuals node.
2543  QualifierCollector Quals;
2544  const Type *TypeNode = Quals.strip(T);
2545 
2546  // If this type already has an ObjCGC specified, it cannot get
2547  // another one.
2548  assert(!Quals.hasObjCGCAttr() &&
2549  "Type cannot have multiple ObjCGCs!");
2550  Quals.addObjCGCAttr(GCAttr);
2551 
2552  return getExtQualType(TypeNode, Quals);
2553 }
2554 
2556  FunctionType::ExtInfo Info) {
2557  if (T->getExtInfo() == Info)
2558  return T;
2559 
2560  QualType Result;
2561  if (const FunctionNoProtoType *FNPT = dyn_cast<FunctionNoProtoType>(T)) {
2562  Result = getFunctionNoProtoType(FNPT->getReturnType(), Info);
2563  } else {
2564  const FunctionProtoType *FPT = cast<FunctionProtoType>(T);
2566  EPI.ExtInfo = Info;
2567  Result = getFunctionType(FPT->getReturnType(), FPT->getParamTypes(), EPI);
2568  }
2569 
2570  return cast<FunctionType>(Result.getTypePtr());
2571 }
2572 
2574  QualType ResultType) {
2575  FD = FD->getMostRecentDecl();
2576  while (true) {
2577  const FunctionProtoType *FPT = FD->getType()->castAs<FunctionProtoType>();
2579  FD->setType(getFunctionType(ResultType, FPT->getParamTypes(), EPI));
2580  if (FunctionDecl *Next = FD->getPreviousDecl())
2581  FD = Next;
2582  else
2583  break;
2584  }
2586  L->DeducedReturnType(FD, ResultType);
2587 }
2588 
2589 /// Get a function type and produce the equivalent function type with the
2590 /// specified exception specification. Type sugar that can be present on a
2591 /// declaration of a function with an exception specification is permitted
2592 /// and preserved. Other type sugar (for instance, typedefs) is not.
2594  ASTContext &Context, QualType Orig,
2596  // Might have some parens.
2597  if (auto *PT = dyn_cast<ParenType>(Orig))
2598  return Context.getParenType(
2599  getFunctionTypeWithExceptionSpec(Context, PT->getInnerType(), ESI));
2600 
2601  // Might have a calling-convention attribute.
2602  if (auto *AT = dyn_cast<AttributedType>(Orig))
2603  return Context.getAttributedType(
2604  AT->getAttrKind(),
2605  getFunctionTypeWithExceptionSpec(Context, AT->getModifiedType(), ESI),
2606  getFunctionTypeWithExceptionSpec(Context, AT->getEquivalentType(),
2607  ESI));
2608 
2609  // Anything else must be a function type. Rebuild it with the new exception
2610  // specification.
2611  const FunctionProtoType *Proto = cast<FunctionProtoType>(Orig);
2612  return Context.getFunctionType(
2613  Proto->getReturnType(), Proto->getParamTypes(),
2614  Proto->getExtProtoInfo().withExceptionSpec(ESI));
2615 }
2616 
2618  QualType U) {
2619  return hasSameType(T, U) ||
2620  (getLangOpts().CPlusPlus17 &&
2623 }
2624 
2627  bool AsWritten) {
2628  // Update the type.
2629  QualType Updated =
2630  getFunctionTypeWithExceptionSpec(*this, FD->getType(), ESI);
2631  FD->setType(Updated);
2632 
2633  if (!AsWritten)
2634  return;
2635 
2636  // Update the type in the type source information too.
2637  if (TypeSourceInfo *TSInfo = FD->getTypeSourceInfo()) {
2638  // If the type and the type-as-written differ, we may need to update
2639  // the type-as-written too.
2640  if (TSInfo->getType() != FD->getType())
2641  Updated = getFunctionTypeWithExceptionSpec(*this, TSInfo->getType(), ESI);
2642 
2643  // FIXME: When we get proper type location information for exceptions,
2644  // we'll also have to rebuild the TypeSourceInfo. For now, we just patch
2645  // up the TypeSourceInfo;
2646  assert(TypeLoc::getFullDataSizeForType(Updated) ==
2647  TypeLoc::getFullDataSizeForType(TSInfo->getType()) &&
2648  "TypeLoc size mismatch from updating exception specification");
2649  TSInfo->overrideType(Updated);
2650  }
2651 }
2652 
2653 /// getComplexType - Return the uniqued reference to the type for a complex
2654 /// number with the specified element type.
2656  // Unique pointers, to guarantee there is only one pointer of a particular
2657  // structure.
2658  llvm::FoldingSetNodeID ID;
2659  ComplexType::Profile(ID, T);
2660 
2661  void *InsertPos = nullptr;
2662  if (ComplexType *CT = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos))
2663  return QualType(CT, 0);
2664 
2665  // If the pointee type isn't canonical, this won't be a canonical type either,
2666  // so fill in the canonical type field.
2667  QualType Canonical;
2668  if (!T.isCanonical()) {
2669  Canonical = getComplexType(getCanonicalType(T));
2670 
2671  // Get the new insert position for the node we care about.
2672  ComplexType *NewIP = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos);
2673  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2674  }
2675  ComplexType *New = new (*this, TypeAlignment) ComplexType(T, Canonical);
2676  Types.push_back(New);
2677  ComplexTypes.InsertNode(New, InsertPos);
2678  return QualType(New, 0);
2679 }
2680 
2681 /// getPointerType - Return the uniqued reference to the type for a pointer to
2682 /// the specified type.
2684  // Unique pointers, to guarantee there is only one pointer of a particular
2685  // structure.
2686  llvm::FoldingSetNodeID ID;
2687  PointerType::Profile(ID, T);
2688 
2689  void *InsertPos = nullptr;
2690  if (PointerType *PT = PointerTypes.FindNodeOrInsertPos(ID, InsertPos))
2691  return QualType(PT, 0);
2692 
2693  // If the pointee type isn't canonical, this won't be a canonical type either,
2694  // so fill in the canonical type field.
2695  QualType Canonical;
2696  if (!T.isCanonical()) {
2697  Canonical = getPointerType(getCanonicalType(T));
2698 
2699  // Get the new insert position for the node we care about.
2700  PointerType *NewIP = PointerTypes.FindNodeOrInsertPos(ID, InsertPos);
2701  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2702  }
2703  PointerType *New = new (*this, TypeAlignment) PointerType(T, Canonical);
2704  Types.push_back(New);
2705  PointerTypes.InsertNode(New, InsertPos);
2706  return QualType(New, 0);
2707 }
2708 
2710  llvm::FoldingSetNodeID ID;
2711  AdjustedType::Profile(ID, Orig, New);
2712  void *InsertPos = nullptr;
2713  AdjustedType *AT = AdjustedTypes.FindNodeOrInsertPos(ID, InsertPos);
2714  if (AT)
2715  return QualType(AT, 0);
2716 
2717  QualType Canonical = getCanonicalType(New);
2718 
2719  // Get the new insert position for the node we care about.
2720  AT = AdjustedTypes.FindNodeOrInsertPos(ID, InsertPos);
2721  assert(!AT && "Shouldn't be in the map!");
2722 
2723  AT = new (*this, TypeAlignment)
2724  AdjustedType(Type::Adjusted, Orig, New, Canonical);
2725  Types.push_back(AT);
2726  AdjustedTypes.InsertNode(AT, InsertPos);
2727  return QualType(AT, 0);
2728 }
2729 
2731  assert((T->isArrayType() || T->isFunctionType()) && "T does not decay");
2732 
2733  QualType Decayed;
2734 
2735  // C99 6.7.5.3p7:
2736  // A declaration of a parameter as "array of type" shall be
2737  // adjusted to "qualified pointer to type", where the type
2738  // qualifiers (if any) are those specified within the [ and ] of
2739  // the array type derivation.
2740  if (T->isArrayType())
2741  Decayed = getArrayDecayedType(T);
2742 
2743  // C99 6.7.5.3p8:
2744  // A declaration of a parameter as "function returning type"
2745  // shall be adjusted to "pointer to function returning type", as
2746  // in 6.3.2.1.
2747  if (T->isFunctionType())
2748  Decayed = getPointerType(T);
2749 
2750  llvm::FoldingSetNodeID ID;
2751  AdjustedType::Profile(ID, T, Decayed);
2752  void *InsertPos = nullptr;
2753  AdjustedType *AT = AdjustedTypes.FindNodeOrInsertPos(ID, InsertPos);
2754  if (AT)
2755  return QualType(AT, 0);
2756 
2757  QualType Canonical = getCanonicalType(Decayed);
2758 
2759  // Get the new insert position for the node we care about.
2760  AT = AdjustedTypes.FindNodeOrInsertPos(ID, InsertPos);
2761  assert(!AT && "Shouldn't be in the map!");
2762 
2763  AT = new (*this, TypeAlignment) DecayedType(T, Decayed, Canonical);
2764  Types.push_back(AT);
2765  AdjustedTypes.InsertNode(AT, InsertPos);
2766  return QualType(AT, 0);
2767 }
2768 
2769 /// getBlockPointerType - Return the uniqued reference to the type for
2770 /// a pointer to the specified block.
2772  assert(T->isFunctionType() && "block of function types only");
2773  // Unique pointers, to guarantee there is only one block of a particular
2774  // structure.
2775  llvm::FoldingSetNodeID ID;
2777 
2778  void *InsertPos = nullptr;
2779  if (BlockPointerType *PT =
2780  BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos))
2781  return QualType(PT, 0);
2782 
2783  // If the block pointee type isn't canonical, this won't be a canonical
2784  // type either so fill in the canonical type field.
2785  QualType Canonical;
2786  if (!T.isCanonical()) {
2787  Canonical = getBlockPointerType(getCanonicalType(T));
2788 
2789  // Get the new insert position for the node we care about.
2790  BlockPointerType *NewIP =
2791  BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos);
2792  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2793  }
2794  BlockPointerType *New
2795  = new (*this, TypeAlignment) BlockPointerType(T, Canonical);
2796  Types.push_back(New);
2797  BlockPointerTypes.InsertNode(New, InsertPos);
2798  return QualType(New, 0);
2799 }
2800 
2801 /// getLValueReferenceType - Return the uniqued reference to the type for an
2802 /// lvalue reference to the specified type.
2803 QualType
2804 ASTContext::getLValueReferenceType(QualType T, bool SpelledAsLValue) const {
2805  assert(getCanonicalType(T) != OverloadTy &&
2806  "Unresolved overloaded function type");
2807 
2808  // Unique pointers, to guarantee there is only one pointer of a particular
2809  // structure.
2810  llvm::FoldingSetNodeID ID;
2811  ReferenceType::Profile(ID, T, SpelledAsLValue);
2812 
2813  void *InsertPos = nullptr;
2814  if (LValueReferenceType *RT =
2815  LValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos))
2816  return QualType(RT, 0);
2817 
2818  const ReferenceType *InnerRef = T->getAs<ReferenceType>();
2819 
2820  // If the referencee type isn't canonical, this won't be a canonical type
2821  // either, so fill in the canonical type field.
2822  QualType Canonical;
2823  if (!SpelledAsLValue || InnerRef || !T.isCanonical()) {
2824  QualType PointeeType = (InnerRef ? InnerRef->getPointeeType() : T);
2825  Canonical = getLValueReferenceType(getCanonicalType(PointeeType));
2826 
2827  // Get the new insert position for the node we care about.
2828  LValueReferenceType *NewIP =
2829  LValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos);
2830  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2831  }
2832 
2833  LValueReferenceType *New
2834  = new (*this, TypeAlignment) LValueReferenceType(T, Canonical,
2835  SpelledAsLValue);
2836  Types.push_back(New);
2837  LValueReferenceTypes.InsertNode(New, InsertPos);
2838 
2839  return QualType(New, 0);
2840 }
2841 
2842 /// getRValueReferenceType - Return the uniqued reference to the type for an
2843 /// rvalue reference to the specified type.
2845  // Unique pointers, to guarantee there is only one pointer of a particular
2846  // structure.
2847  llvm::FoldingSetNodeID ID;
2848  ReferenceType::Profile(ID, T, false);
2849 
2850  void *InsertPos = nullptr;
2851  if (RValueReferenceType *RT =
2852  RValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos))
2853  return QualType(RT, 0);
2854 
2855  const ReferenceType *InnerRef = T->getAs<ReferenceType>();
2856 
2857  // If the referencee type isn't canonical, this won't be a canonical type
2858  // either, so fill in the canonical type field.
2859  QualType Canonical;
2860  if (InnerRef || !T.isCanonical()) {
2861  QualType PointeeType = (InnerRef ? InnerRef->getPointeeType() : T);
2862  Canonical = getRValueReferenceType(getCanonicalType(PointeeType));
2863 
2864  // Get the new insert position for the node we care about.
2865  RValueReferenceType *NewIP =
2866  RValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos);
2867  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2868  }
2869 
2870  RValueReferenceType *New
2871  = new (*this, TypeAlignment) RValueReferenceType(T, Canonical);
2872  Types.push_back(New);
2873  RValueReferenceTypes.InsertNode(New, InsertPos);
2874  return QualType(New, 0);
2875 }
2876 
2877 /// getMemberPointerType - Return the uniqued reference to the type for a
2878 /// member pointer to the specified type, in the specified class.
2880  // Unique pointers, to guarantee there is only one pointer of a particular
2881  // structure.
2882  llvm::FoldingSetNodeID ID;
2883  MemberPointerType::Profile(ID, T, Cls);
2884 
2885  void *InsertPos = nullptr;
2886  if (MemberPointerType *PT =
2887  MemberPointerTypes.FindNodeOrInsertPos(ID, InsertPos))
2888  return QualType(PT, 0);
2889 
2890  // If the pointee or class type isn't canonical, this won't be a canonical
2891  // type either, so fill in the canonical type field.
2892  QualType Canonical;
2893  if (!T.isCanonical() || !Cls->isCanonicalUnqualified()) {
2895 
2896  // Get the new insert position for the node we care about.
2897  MemberPointerType *NewIP =
2898  MemberPointerTypes.FindNodeOrInsertPos(ID, InsertPos);
2899  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2900  }
2901  MemberPointerType *New
2902  = new (*this, TypeAlignment) MemberPointerType(T, Cls, Canonical);
2903  Types.push_back(New);
2904  MemberPointerTypes.InsertNode(New, InsertPos);
2905  return QualType(New, 0);
2906 }
2907 
2908 /// getConstantArrayType - Return the unique reference to the type for an
2909 /// array of the specified element type.
2911  const llvm::APInt &ArySizeIn,
2913  unsigned IndexTypeQuals) const {
2914  assert((EltTy->isDependentType() ||
2915  EltTy->isIncompleteType() || EltTy->isConstantSizeType()) &&
2916  "Constant array of VLAs is illegal!");
2917 
2918  // Convert the array size into a canonical width matching the pointer size for
2919  // the target.
2920  llvm::APInt ArySize(ArySizeIn);
2921  ArySize = ArySize.zextOrTrunc(Target->getMaxPointerWidth());
2922 
2923  llvm::FoldingSetNodeID ID;
2924  ConstantArrayType::Profile(ID, EltTy, ArySize, ASM, IndexTypeQuals);
2925 
2926  void *InsertPos = nullptr;
2927  if (ConstantArrayType *ATP =
2928  ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos))
2929  return QualType(ATP, 0);
2930 
2931  // If the element type isn't canonical or has qualifiers, this won't
2932  // be a canonical type either, so fill in the canonical type field.
2933  QualType Canon;
2934  if (!EltTy.isCanonical() || EltTy.hasLocalQualifiers()) {
2935  SplitQualType canonSplit = getCanonicalType(EltTy).split();
2936  Canon = getConstantArrayType(QualType(canonSplit.Ty, 0), ArySize,
2937  ASM, IndexTypeQuals);
2938  Canon = getQualifiedType(Canon, canonSplit.Quals);
2939 
2940  // Get the new insert position for the node we care about.
2941  ConstantArrayType *NewIP =
2942  ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos);
2943  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
2944  }
2945 
2946  ConstantArrayType *New = new(*this,TypeAlignment)
2947  ConstantArrayType(EltTy, Canon, ArySize, ASM, IndexTypeQuals);
2948  ConstantArrayTypes.InsertNode(New, InsertPos);
2949  Types.push_back(New);
2950  return QualType(New, 0);
2951 }
2952 
2953 /// getVariableArrayDecayedType - Turns the given type, which may be
2954 /// variably-modified, into the corresponding type with all the known
2955 /// sizes replaced with [*].
2957  // Vastly most common case.
2958  if (!type->isVariablyModifiedType()) return type;
2959 
2960  QualType result;
2961 
2962  SplitQualType split = type.getSplitDesugaredType();
2963  const Type *ty = split.Ty;
2964  switch (ty->getTypeClass()) {
2965 #define TYPE(Class, Base)
2966 #define ABSTRACT_TYPE(Class, Base)
2967 #define NON_CANONICAL_TYPE(Class, Base) case Type::Class:
2968 #include "clang/AST/TypeNodes.def"
2969  llvm_unreachable("didn't desugar past all non-canonical types?");
2970 
2971  // These types should never be variably-modified.
2972  case Type::Builtin:
2973  case Type::Complex:
2974  case Type::Vector:
2975  case Type::ExtVector:
2976  case Type::DependentSizedExtVector:
2977  case Type::DependentAddressSpace:
2978  case Type::ObjCObject:
2979  case Type::ObjCInterface:
2980  case Type::ObjCObjectPointer:
2981  case Type::Record:
2982  case Type::Enum:
2983  case Type::UnresolvedUsing:
2984  case Type::TypeOfExpr:
2985  case Type::TypeOf:
2986  case Type::Decltype:
2987  case Type::UnaryTransform:
2988  case Type::DependentName:
2989  case Type::InjectedClassName:
2990  case Type::TemplateSpecialization:
2991  case Type::DependentTemplateSpecialization:
2992  case Type::TemplateTypeParm:
2993  case Type::SubstTemplateTypeParmPack:
2994  case Type::Auto:
2995  case Type::DeducedTemplateSpecialization:
2996  case Type::PackExpansion:
2997  llvm_unreachable("type should never be variably-modified");
2998 
2999  // These types can be variably-modified but should never need to
3000  // further decay.
3001  case Type::FunctionNoProto:
3002  case Type::FunctionProto:
3003  case Type::BlockPointer:
3004  case Type::MemberPointer:
3005  case Type::Pipe:
3006  return type;
3007 
3008  // These types can be variably-modified. All these modifications
3009  // preserve structure except as noted by comments.
3010  // TODO: if we ever care about optimizing VLAs, there are no-op
3011  // optimizations available here.
3012  case Type::Pointer:
3014  cast<PointerType>(ty)->getPointeeType()));
3015  break;
3016 
3017  case Type::LValueReference: {
3018  const LValueReferenceType *lv = cast<LValueReferenceType>(ty);
3019  result = getLValueReferenceType(
3021  lv->isSpelledAsLValue());
3022  break;
3023  }
3024 
3025  case Type::RValueReference: {
3026  const RValueReferenceType *lv = cast<RValueReferenceType>(ty);
3027  result = getRValueReferenceType(
3029  break;
3030  }
3031 
3032  case Type::Atomic: {
3033  const AtomicType *at = cast<AtomicType>(ty);
3035  break;
3036  }
3037 
3038  case Type::ConstantArray: {
3039  const ConstantArrayType *cat = cast<ConstantArrayType>(ty);
3040  result = getConstantArrayType(
3042  cat->getSize(),
3043  cat->getSizeModifier(),
3044  cat->getIndexTypeCVRQualifiers());
3045  break;
3046  }
3047 
3048  case Type::DependentSizedArray: {
3049  const DependentSizedArrayType *dat = cast<DependentSizedArrayType>(ty);
3050  result = getDependentSizedArrayType(
3052  dat->getSizeExpr(),
3053  dat->getSizeModifier(),
3055  dat->getBracketsRange());
3056  break;
3057  }
3058 
3059  // Turn incomplete types into [*] types.
3060  case Type::IncompleteArray: {
3061  const IncompleteArrayType *iat = cast<IncompleteArrayType>(ty);
3062  result = getVariableArrayType(
3064  /*size*/ nullptr,
3067  SourceRange());
3068  break;
3069  }
3070 
3071  // Turn VLA types into [*] types.
3072  case Type::VariableArray: {
3073  const VariableArrayType *vat = cast<VariableArrayType>(ty);
3074  result = getVariableArrayType(
3076  /*size*/ nullptr,
3079  vat->getBracketsRange());
3080  break;
3081  }
3082  }
3083 
3084  // Apply the top-level qualifiers from the original.
3085  return getQualifiedType(result, split.Quals);
3086 }
3087 
3088 /// getVariableArrayType - Returns a non-unique reference to the type for a
3089 /// variable array of the specified element type.
3091  Expr *NumElts,
3093  unsigned IndexTypeQuals,
3094  SourceRange Brackets) const {
3095  // Since we don't unique expressions, it isn't possible to unique VLA's
3096  // that have an expression provided for their size.
3097  QualType Canon;
3098 
3099  // Be sure to pull qualifiers off the element type.
3100  if (!EltTy.isCanonical() || EltTy.hasLocalQualifiers()) {
3101  SplitQualType canonSplit = getCanonicalType(EltTy).split();
3102  Canon = getVariableArrayType(QualType(canonSplit.Ty, 0), NumElts, ASM,
3103  IndexTypeQuals, Brackets);
3104  Canon = getQualifiedType(Canon, canonSplit.Quals);
3105  }
3106 
3107  VariableArrayType *New = new(*this, TypeAlignment)
3108  VariableArrayType(EltTy, Canon, NumElts, ASM, IndexTypeQuals, Brackets);
3109 
3110  VariableArrayTypes.push_back(New);
3111  Types.push_back(New);
3112  return QualType(New, 0);
3113 }
3114 
3115 /// getDependentSizedArrayType - Returns a non-unique reference to
3116 /// the type for a dependently-sized array of the specified element
3117 /// type.
3119  Expr *numElements,
3121  unsigned elementTypeQuals,
3122  SourceRange brackets) const {
3123  assert((!numElements || numElements->isTypeDependent() ||
3124  numElements->isValueDependent()) &&
3125  "Size must be type- or value-dependent!");
3126 
3127  // Dependently-sized array types that do not have a specified number
3128  // of elements will have their sizes deduced from a dependent
3129  // initializer. We do no canonicalization here at all, which is okay
3130  // because they can't be used in most locations.
3131  if (!numElements) {
3132  DependentSizedArrayType *newType
3133  = new (*this, TypeAlignment)
3134  DependentSizedArrayType(*this, elementType, QualType(),
3135  numElements, ASM, elementTypeQuals,
3136  brackets);
3137  Types.push_back(newType);
3138  return QualType(newType, 0);
3139  }
3140 
3141  // Otherwise, we actually build a new type every time, but we
3142  // also build a canonical type.
3143 
3144  SplitQualType canonElementType = getCanonicalType(elementType).split();
3145 
3146  void *insertPos = nullptr;
3147  llvm::FoldingSetNodeID ID;
3149  QualType(canonElementType.Ty, 0),
3150  ASM, elementTypeQuals, numElements);
3151 
3152  // Look for an existing type with these properties.
3153  DependentSizedArrayType *canonTy =
3154  DependentSizedArrayTypes.FindNodeOrInsertPos(ID, insertPos);
3155 
3156  // If we don't have one, build one.
3157  if (!canonTy) {
3158  canonTy = new (*this, TypeAlignment)
3159  DependentSizedArrayType(*this, QualType(canonElementType.Ty, 0),
3160  QualType(), numElements, ASM, elementTypeQuals,
3161  brackets);
3162  DependentSizedArrayTypes.InsertNode(canonTy, insertPos);
3163  Types.push_back(canonTy);
3164  }
3165 
3166  // Apply qualifiers from the element type to the array.
3167  QualType canon = getQualifiedType(QualType(canonTy,0),
3168  canonElementType.Quals);
3169 
3170  // If we didn't need extra canonicalization for the element type or the size
3171  // expression, then just use that as our result.
3172  if (QualType(canonElementType.Ty, 0) == elementType &&
3173  canonTy->getSizeExpr() == numElements)
3174  return canon;
3175 
3176  // Otherwise, we need to build a type which follows the spelling
3177  // of the element type.
3178  DependentSizedArrayType *sugaredType
3179  = new (*this, TypeAlignment)
3180  DependentSizedArrayType(*this, elementType, canon, numElements,
3181  ASM, elementTypeQuals, brackets);
3182  Types.push_back(sugaredType);
3183  return QualType(sugaredType, 0);
3184 }
3185 
3188  unsigned elementTypeQuals) const {
3189  llvm::FoldingSetNodeID ID;
3190  IncompleteArrayType::Profile(ID, elementType, ASM, elementTypeQuals);
3191 
3192  void *insertPos = nullptr;
3193  if (IncompleteArrayType *iat =
3194  IncompleteArrayTypes.FindNodeOrInsertPos(ID, insertPos))
3195  return QualType(iat, 0);
3196 
3197  // If the element type isn't canonical, this won't be a canonical type
3198  // either, so fill in the canonical type field. We also have to pull
3199  // qualifiers off the element type.
3200  QualType canon;
3201 
3202  if (!elementType.isCanonical() || elementType.hasLocalQualifiers()) {
3203  SplitQualType canonSplit = getCanonicalType(elementType).split();
3204  canon = getIncompleteArrayType(QualType(canonSplit.Ty, 0),
3205  ASM, elementTypeQuals);
3206  canon = getQualifiedType(canon, canonSplit.Quals);
3207 
3208  // Get the new insert position for the node we care about.
3209  IncompleteArrayType *existing =
3210  IncompleteArrayTypes.FindNodeOrInsertPos(ID, insertPos);
3211  assert(!existing && "Shouldn't be in the map!"); (void) existing;
3212  }
3213 
3214  IncompleteArrayType *newType = new (*this, TypeAlignment)
3215  IncompleteArrayType(elementType, canon, ASM, elementTypeQuals);
3216 
3217  IncompleteArrayTypes.InsertNode(newType, insertPos);
3218  Types.push_back(newType);
3219  return QualType(newType, 0);
3220 }
3221 
3222 /// getVectorType - Return the unique reference to a vector type of
3223 /// the specified element type and size. VectorType must be a built-in type.
3224 QualType ASTContext::getVectorType(QualType vecType, unsigned NumElts,
3225  VectorType::VectorKind VecKind) const {
3226  assert(vecType->isBuiltinType());
3227 
3228  // Check if we've already instantiated a vector of this type.
3229  llvm::FoldingSetNodeID ID;
3230  VectorType::Profile(ID, vecType, NumElts, Type::Vector, VecKind);
3231 
3232  void *InsertPos = nullptr;
3233  if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos))
3234  return QualType(VTP, 0);
3235 
3236  // If the element type isn't canonical, this won't be a canonical type either,
3237  // so fill in the canonical type field.
3238  QualType Canonical;
3239  if (!vecType.isCanonical()) {
3240  Canonical = getVectorType(getCanonicalType(vecType), NumElts, VecKind);
3241 
3242  // Get the new insert position for the node we care about.
3243  VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos);
3244  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
3245  }
3246  VectorType *New = new (*this, TypeAlignment)
3247  VectorType(vecType, NumElts, Canonical, VecKind);
3248  VectorTypes.InsertNode(New, InsertPos);
3249  Types.push_back(New);
3250  return QualType(New, 0);
3251 }
3252 
3253 /// getExtVectorType - Return the unique reference to an extended vector type of
3254 /// the specified element type and size. VectorType must be a built-in type.
3255 QualType
3256 ASTContext::getExtVectorType(QualType vecType, unsigned NumElts) const {
3257  assert(vecType->isBuiltinType() || vecType->isDependentType());
3258 
3259  // Check if we've already instantiated a vector of this type.
3260  llvm::FoldingSetNodeID ID;
3261  VectorType::Profile(ID, vecType, NumElts, Type::ExtVector,
3263  void *InsertPos = nullptr;
3264  if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos))
3265  return QualType(VTP, 0);
3266 
3267  // If the element type isn't canonical, this won't be a canonical type either,
3268  // so fill in the canonical type field.
3269  QualType Canonical;
3270  if (!vecType.isCanonical()) {
3271  Canonical = getExtVectorType(getCanonicalType(vecType), NumElts);
3272 
3273  // Get the new insert position for the node we care about.
3274  VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos);
3275  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
3276  }
3277  ExtVectorType *New = new (*this, TypeAlignment)
3278  ExtVectorType(vecType, NumElts, Canonical);
3279  VectorTypes.InsertNode(New, InsertPos);
3280  Types.push_back(New);
3281  return QualType(New, 0);
3282 }
3283 
3284 QualType
3286  Expr *SizeExpr,
3287  SourceLocation AttrLoc) const {
3288  llvm::FoldingSetNodeID ID;
3290  SizeExpr);
3291 
3292  void *InsertPos = nullptr;
3294  = DependentSizedExtVectorTypes.FindNodeOrInsertPos(ID, InsertPos);
3296  if (Canon) {
3297  // We already have a canonical version of this array type; use it as
3298  // the canonical type for a newly-built type.
3299  New = new (*this, TypeAlignment)
3300  DependentSizedExtVectorType(*this, vecType, QualType(Canon, 0),
3301  SizeExpr, AttrLoc);
3302  } else {
3303  QualType CanonVecTy = getCanonicalType(vecType);
3304  if (CanonVecTy == vecType) {
3305  New = new (*this, TypeAlignment)
3306  DependentSizedExtVectorType(*this, vecType, QualType(), SizeExpr,
3307  AttrLoc);
3308 
3309  DependentSizedExtVectorType *CanonCheck
3310  = DependentSizedExtVectorTypes.FindNodeOrInsertPos(ID, InsertPos);
3311  assert(!CanonCheck && "Dependent-sized ext_vector canonical type broken");
3312  (void)CanonCheck;
3313  DependentSizedExtVectorTypes.InsertNode(New, InsertPos);
3314  } else {
3315  QualType Canon = getDependentSizedExtVectorType(CanonVecTy, SizeExpr,
3316  SourceLocation());
3317  New = new (*this, TypeAlignment)
3318  DependentSizedExtVectorType(*this, vecType, Canon, SizeExpr, AttrLoc);
3319  }
3320  }
3321 
3322  Types.push_back(New);
3323  return QualType(New, 0);
3324 }
3325 
3327  Expr *AddrSpaceExpr,
3328  SourceLocation AttrLoc) const {
3329  assert(AddrSpaceExpr->isInstantiationDependent());
3330 
3331  QualType canonPointeeType = getCanonicalType(PointeeType);
3332 
3333  void *insertPos = nullptr;
3334  llvm::FoldingSetNodeID ID;
3335  DependentAddressSpaceType::Profile(ID, *this, canonPointeeType,
3336  AddrSpaceExpr);
3337 
3338  DependentAddressSpaceType *canonTy =
3339  DependentAddressSpaceTypes.FindNodeOrInsertPos(ID, insertPos);
3340 
3341  if (!canonTy) {
3342  canonTy = new (*this, TypeAlignment)
3343  DependentAddressSpaceType(*this, canonPointeeType,
3344  QualType(), AddrSpaceExpr, AttrLoc);
3345  DependentAddressSpaceTypes.InsertNode(canonTy, insertPos);
3346  Types.push_back(canonTy);
3347  }
3348 
3349  if (canonPointeeType == PointeeType &&
3350  canonTy->getAddrSpaceExpr() == AddrSpaceExpr)
3351  return QualType(canonTy, 0);
3352 
3353  DependentAddressSpaceType *sugaredType
3354  = new (*this, TypeAlignment)
3355  DependentAddressSpaceType(*this, PointeeType, QualType(canonTy, 0),
3356  AddrSpaceExpr, AttrLoc);
3357  Types.push_back(sugaredType);
3358  return QualType(sugaredType, 0);
3359 }
3360 
3361 /// \brief Determine whether \p T is canonical as the result type of a function.
3363  return T.isCanonical() &&
3366 }
3367 
3368 /// getFunctionNoProtoType - Return a K&R style C function type like 'int()'.
3369 QualType
3371  const FunctionType::ExtInfo &Info) const {
3372  // Unique functions, to guarantee there is only one function of a particular
3373  // structure.
3374  llvm::FoldingSetNodeID ID;
3375  FunctionNoProtoType::Profile(ID, ResultTy, Info);
3376 
3377  void *InsertPos = nullptr;
3378  if (FunctionNoProtoType *FT =
3379  FunctionNoProtoTypes.FindNodeOrInsertPos(ID, InsertPos))
3380  return QualType(FT, 0);
3381 
3382  QualType Canonical;
3383  if (!isCanonicalResultType(ResultTy)) {
3384  Canonical =
3386 
3387  // Get the new insert position for the node we care about.
3388  FunctionNoProtoType *NewIP =
3389  FunctionNoProtoTypes.FindNodeOrInsertPos(ID, InsertPos);
3390  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
3391  }
3392 
3393  FunctionNoProtoType *New = new (*this, TypeAlignment)
3394  FunctionNoProtoType(ResultTy, Canonical, Info);
3395  Types.push_back(New);
3396  FunctionNoProtoTypes.InsertNode(New, InsertPos);
3397  return QualType(New, 0);
3398 }
3399 
3402  CanQualType CanResultType = getCanonicalType(ResultType);
3403 
3404  // Canonical result types do not have ARC lifetime qualifiers.
3405  if (CanResultType.getQualifiers().hasObjCLifetime()) {
3406  Qualifiers Qs = CanResultType.getQualifiers();
3407  Qs.removeObjCLifetime();
3409  getQualifiedType(CanResultType.getUnqualifiedType(), Qs));
3410  }
3411 
3412  return CanResultType;
3413 }
3414 
3416  const FunctionProtoType::ExceptionSpecInfo &ESI, bool NoexceptInType) {
3417  if (ESI.Type == EST_None)
3418  return true;
3419  if (!NoexceptInType)
3420  return false;
3421 
3422  // C++17 onwards: exception specification is part of the type, as a simple
3423  // boolean "can this function type throw".
3424  if (ESI.Type == EST_BasicNoexcept)
3425  return true;
3426 
3427  // A dynamic exception specification is canonical if it only contains pack
3428  // expansions (so we can't tell whether it's non-throwing) and all its
3429  // contained types are canonical.
3430  if (ESI.Type == EST_Dynamic) {
3431  bool AnyPackExpansions = false;
3432  for (QualType ET : ESI.Exceptions) {
3433  if (!ET.isCanonical())
3434  return false;
3435  if (ET->getAs<PackExpansionType>())
3436  AnyPackExpansions = true;
3437  }
3438  return AnyPackExpansions;
3439  }
3440 
3441  // A noexcept(expr) specification is (possibly) canonical if expr is
3442  // value-dependent.
3443  if (ESI.Type == EST_ComputedNoexcept)
3444  return ESI.NoexceptExpr && ESI.NoexceptExpr->isValueDependent();
3445 
3446  return false;
3447 }
3448 
3449 QualType ASTContext::getFunctionTypeInternal(
3450  QualType ResultTy, ArrayRef<QualType> ArgArray,
3451  const FunctionProtoType::ExtProtoInfo &EPI, bool OnlyWantCanonical) const {
3452  size_t NumArgs = ArgArray.size();
3453 
3454  // Unique functions, to guarantee there is only one function of a particular
3455  // structure.
3456  llvm::FoldingSetNodeID ID;
3457  FunctionProtoType::Profile(ID, ResultTy, ArgArray.begin(), NumArgs, EPI,
3458  *this, true);
3459 
3460  QualType Canonical;
3461  bool Unique = false;
3462 
3463  void *InsertPos = nullptr;
3464  if (FunctionProtoType *FPT =
3465  FunctionProtoTypes.FindNodeOrInsertPos(ID, InsertPos)) {
3466  QualType Existing = QualType(FPT, 0);
3467 
3468  // If we find a pre-existing equivalent FunctionProtoType, we can just reuse
3469  // it so long as our exception specification doesn't contain a dependent
3470  // noexcept expression, or we're just looking for a canonical type.
3471  // Otherwise, we're going to need to create a type
3472  // sugar node to hold the concrete expression.
3473  if (OnlyWantCanonical || EPI.ExceptionSpec.Type != EST_ComputedNoexcept ||
3474  EPI.ExceptionSpec.NoexceptExpr == FPT->getNoexceptExpr())
3475  return Existing;
3476 
3477  // We need a new type sugar node for this one, to hold the new noexcept
3478  // expression. We do no canonicalization here, but that's OK since we don't
3479  // expect to see the same noexcept expression much more than once.
3480  Canonical = getCanonicalType(Existing);
3481  Unique = true;
3482  }
3483 
3484  bool NoexceptInType = getLangOpts().CPlusPlus17;
3485  bool IsCanonicalExceptionSpec =
3486  isCanonicalExceptionSpecification(EPI.ExceptionSpec, NoexceptInType);
3487 
3488  // Determine whether the type being created is already canonical or not.
3489  bool isCanonical = !Unique && IsCanonicalExceptionSpec &&
3490  isCanonicalResultType(ResultTy) && !EPI.HasTrailingReturn;
3491  for (unsigned i = 0; i != NumArgs && isCanonical; ++i)
3492  if (!ArgArray[i].isCanonicalAsParam())
3493  isCanonical = false;
3494 
3495  if (OnlyWantCanonical)
3496  assert(isCanonical &&
3497  "given non-canonical parameters constructing canonical type");
3498 
3499  // If this type isn't canonical, get the canonical version of it if we don't
3500  // already have it. The exception spec is only partially part of the
3501  // canonical type, and only in C++17 onwards.
3502  if (!isCanonical && Canonical.isNull()) {
3503  SmallVector<QualType, 16> CanonicalArgs;
3504  CanonicalArgs.reserve(NumArgs);
3505  for (unsigned i = 0; i != NumArgs; ++i)
3506  CanonicalArgs.push_back(getCanonicalParamType(ArgArray[i]));
3507 
3508  llvm::SmallVector<QualType, 8> ExceptionTypeStorage;
3509  FunctionProtoType::ExtProtoInfo CanonicalEPI = EPI;
3510  CanonicalEPI.HasTrailingReturn = false;
3511 
3512  if (IsCanonicalExceptionSpec) {
3513  // Exception spec is already OK.
3514  } else if (NoexceptInType) {
3515  switch (EPI.ExceptionSpec.Type) {
3517  // We don't know yet. It shouldn't matter what we pick here; no-one
3518  // should ever look at this.
3519  LLVM_FALLTHROUGH;
3520  case EST_None: case EST_MSAny:
3521  CanonicalEPI.ExceptionSpec.Type = EST_None;
3522  break;
3523 
3524  // A dynamic exception specification is almost always "not noexcept",
3525  // with the exception that a pack expansion might expand to no types.
3526  case EST_Dynamic: {
3527  bool AnyPacks = false;
3528  for (QualType ET : EPI.ExceptionSpec.Exceptions) {
3529  if (ET->getAs<PackExpansionType>())
3530  AnyPacks = true;
3531  ExceptionTypeStorage.push_back(getCanonicalType(ET));
3532  }
3533  if (!AnyPacks)
3534  CanonicalEPI.ExceptionSpec.Type = EST_None;
3535  else {
3536  CanonicalEPI.ExceptionSpec.Type = EST_Dynamic;
3537  CanonicalEPI.ExceptionSpec.Exceptions = ExceptionTypeStorage;
3538  }
3539  break;
3540  }
3541 
3543  CanonicalEPI.ExceptionSpec.Type = EST_BasicNoexcept;
3544  break;
3545 
3546  case EST_ComputedNoexcept:
3547  llvm::APSInt Value(1);
3548  auto *E = CanonicalEPI.ExceptionSpec.NoexceptExpr;
3549  if (!E || !E->isIntegerConstantExpr(Value, *this, nullptr,
3550  /*IsEvaluated*/false)) {
3551  // This noexcept specification is invalid.
3552  // FIXME: Should this be able to happen?
3553  CanonicalEPI.ExceptionSpec.Type = EST_None;
3554  break;
3555  }
3556 
3557  CanonicalEPI.ExceptionSpec.Type =
3558  Value.getBoolValue() ? EST_BasicNoexcept : EST_None;
3559  break;
3560  }
3561  } else {
3563  }
3564 
3565  // Adjust the canonical function result type.
3566  CanQualType CanResultTy = getCanonicalFunctionResultType(ResultTy);
3567  Canonical =
3568  getFunctionTypeInternal(CanResultTy, CanonicalArgs, CanonicalEPI, true);
3569 
3570  // Get the new insert position for the node we care about.
3571  FunctionProtoType *NewIP =
3572  FunctionProtoTypes.FindNodeOrInsertPos(ID, InsertPos);
3573  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
3574  }
3575 
3576  // FunctionProtoType objects are allocated with extra bytes after
3577  // them for three variable size arrays at the end:
3578  // - parameter types
3579  // - exception types
3580  // - extended parameter information
3581  // Instead of the exception types, there could be a noexcept
3582  // expression, or information used to resolve the exception
3583  // specification.
3584  size_t Size = sizeof(FunctionProtoType) +
3585  NumArgs * sizeof(QualType);
3586 
3587  if (EPI.ExceptionSpec.Type == EST_Dynamic) {
3588  Size += EPI.ExceptionSpec.Exceptions.size() * sizeof(QualType);
3589  } else if (EPI.ExceptionSpec.Type == EST_ComputedNoexcept) {
3590  Size += sizeof(Expr*);
3591  } else if (EPI.ExceptionSpec.Type == EST_Uninstantiated) {
3592  Size += 2 * sizeof(FunctionDecl*);
3593  } else if (EPI.ExceptionSpec.Type == EST_Unevaluated) {
3594  Size += sizeof(FunctionDecl*);
3595  }
3596 
3597  // Put the ExtParameterInfos last. If all were equal, it would make
3598  // more sense to put these before the exception specification, because
3599  // it's much easier to skip past them compared to the elaborate switch
3600  // required to skip the exception specification. However, all is not
3601  // equal; ExtParameterInfos are used to model very uncommon features,
3602  // and it's better not to burden the more common paths.
3603  if (EPI.ExtParameterInfos) {
3604  Size += NumArgs * sizeof(FunctionProtoType::ExtParameterInfo);
3605  }
3606 
3608  FunctionProtoType::ExtProtoInfo newEPI = EPI;
3609  new (FTP) FunctionProtoType(ResultTy, ArgArray, Canonical, newEPI);
3610  Types.push_back(FTP);
3611  if (!Unique)
3612  FunctionProtoTypes.InsertNode(FTP, InsertPos);
3613  return QualType(FTP, 0);
3614 }
3615 
3616 QualType ASTContext::getPipeType(QualType T, bool ReadOnly) const {
3617  llvm::FoldingSetNodeID ID;
3618  PipeType::Profile(ID, T, ReadOnly);
3619 
3620  void *InsertPos = nullptr;
3621  if (PipeType *PT = PipeTypes.FindNodeOrInsertPos(ID, InsertPos))
3622  return QualType(PT, 0);
3623 
3624  // If the pipe element type isn't canonical, this won't be a canonical type
3625  // either, so fill in the canonical type field.
3626  QualType Canonical;
3627  if (!T.isCanonical()) {
3628  Canonical = getPipeType(getCanonicalType(T), ReadOnly);
3629 
3630  // Get the new insert position for the node we care about.
3631  PipeType *NewIP = PipeTypes.FindNodeOrInsertPos(ID, InsertPos);
3632  assert(!NewIP && "Shouldn't be in the map!");
3633  (void)NewIP;
3634  }
3635  PipeType *New = new (*this, TypeAlignment) PipeType(T, Canonical, ReadOnly);
3636  Types.push_back(New);
3637  PipeTypes.InsertNode(New, InsertPos);
3638  return QualType(New, 0);
3639 }
3640 
3642  return getPipeType(T, true);
3643 }
3644 
3646  return getPipeType(T, false);
3647 }
3648 
3649 #ifndef NDEBUG
3651  if (!isa<CXXRecordDecl>(D)) return false;
3652  const CXXRecordDecl *RD = cast<CXXRecordDecl>(D);
3653  if (isa<ClassTemplatePartialSpecializationDecl>(RD))
3654  return true;
3655  if (RD->getDescribedClassTemplate() &&
3656  !isa<ClassTemplateSpecializationDecl>(RD))
3657  return true;
3658  return false;
3659 }
3660 #endif
3661 
3662 /// getInjectedClassNameType - Return the unique reference to the
3663 /// injected class name type for the specified templated declaration.
3665  QualType TST) const {
3666  assert(NeedsInjectedClassNameType(Decl));
3667  if (Decl->TypeForDecl) {
3668  assert(isa<InjectedClassNameType>(Decl->TypeForDecl));
3669  } else if (CXXRecordDecl *PrevDecl = Decl->getPreviousDecl()) {
3670  assert(PrevDecl->TypeForDecl && "previous declaration has no type");
3671  Decl->TypeForDecl = PrevDecl->TypeForDecl;
3672  assert(isa<InjectedClassNameType>(Decl->TypeForDecl));
3673  } else {
3674  Type *newType =
3675  new (*this, TypeAlignment) InjectedClassNameType(Decl, TST);
3676  Decl->TypeForDecl = newType;
3677  Types.push_back(newType);
3678  }
3679  return QualType(Decl->TypeForDecl, 0);
3680 }
3681 
3682 /// getTypeDeclType - Return the unique reference to the type for the
3683 /// specified type declaration.
3684 QualType ASTContext::getTypeDeclTypeSlow(const TypeDecl *Decl) const {
3685  assert(Decl && "Passed null for Decl param");
3686  assert(!Decl->TypeForDecl && "TypeForDecl present in slow case");
3687 
3688  if (const TypedefNameDecl *Typedef = dyn_cast<TypedefNameDecl>(Decl))
3689  return getTypedefType(Typedef);
3690 
3691  assert(!isa<TemplateTypeParmDecl>(Decl) &&
3692  "Template type parameter types are always available.");
3693 
3694  if (const RecordDecl *Record = dyn_cast<RecordDecl>(Decl)) {
3695  assert(Record->isFirstDecl() && "struct/union has previous declaration");
3696  assert(!NeedsInjectedClassNameType(Record));
3697  return getRecordType(Record);
3698  } else if (const EnumDecl *Enum = dyn_cast<EnumDecl>(Decl)) {
3699  assert(Enum->isFirstDecl() && "enum has previous declaration");
3700  return getEnumType(Enum);
3701  } else if (const UnresolvedUsingTypenameDecl *Using =
3702  dyn_cast<UnresolvedUsingTypenameDecl>(Decl)) {
3703  Type *newType = new (*this, TypeAlignment) UnresolvedUsingType(Using);
3704  Decl->TypeForDecl = newType;
3705  Types.push_back(newType);
3706  } else
3707  llvm_unreachable("TypeDecl without a type?");
3708 
3709  return QualType(Decl->TypeForDecl, 0);
3710 }
3711 
3712 /// getTypedefType - Return the unique reference to the type for the
3713 /// specified typedef name decl.
3714 QualType
3716  QualType Canonical) const {
3717  if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0);
3718 
3719  if (Canonical.isNull())
3720  Canonical = getCanonicalType(Decl->getUnderlyingType());
3721  TypedefType *newType = new(*this, TypeAlignment)
3722  TypedefType(Type::Typedef, Decl, Canonical);
3723  Decl->TypeForDecl = newType;
3724  Types.push_back(newType);
3725  return QualType(newType, 0);
3726 }
3727 
3729  if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0);
3730 
3731  if (const RecordDecl *PrevDecl = Decl->getPreviousDecl())
3732  if (PrevDecl->TypeForDecl)
3733  return QualType(Decl->TypeForDecl = PrevDecl->TypeForDecl, 0);
3734 
3735  RecordType *newType = new (*this, TypeAlignment) RecordType(Decl);
3736  Decl->TypeForDecl = newType;
3737  Types.push_back(newType);
3738  return QualType(newType, 0);
3739 }
3740 
3742  if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0);
3743 
3744  if (const EnumDecl *PrevDecl = Decl->getPreviousDecl())
3745  if (PrevDecl->TypeForDecl)
3746  return QualType(Decl->TypeForDecl = PrevDecl->TypeForDecl, 0);
3747 
3748  EnumType *newType = new (*this, TypeAlignment) EnumType(Decl);
3749  Decl->TypeForDecl = newType;
3750  Types.push_back(newType);
3751  return QualType(newType, 0);
3752 }
3753 
3755  QualType modifiedType,
3756  QualType equivalentType) {
3757  llvm::FoldingSetNodeID id;
3758  AttributedType::Profile(id, attrKind, modifiedType, equivalentType);
3759 
3760  void *insertPos = nullptr;
3761  AttributedType *type = AttributedTypes.FindNodeOrInsertPos(id, insertPos);
3762  if (type) return QualType(type, 0);
3763 
3764  QualType canon = getCanonicalType(equivalentType);
3765  type = new (*this, TypeAlignment)
3766  AttributedType(canon, attrKind, modifiedType, equivalentType);
3767 
3768  Types.push_back(type);
3769  AttributedTypes.InsertNode(type, insertPos);
3770 
3771  return QualType(type, 0);
3772 }
3773 
3774 /// \brief Retrieve a substitution-result type.
3775 QualType
3777  QualType Replacement) const {
3778  assert(Replacement.isCanonical()
3779  && "replacement types must always be canonical");
3780 
3781  llvm::FoldingSetNodeID ID;
3782  SubstTemplateTypeParmType::Profile(ID, Parm, Replacement);
3783  void *InsertPos = nullptr;
3784  SubstTemplateTypeParmType *SubstParm
3785  = SubstTemplateTypeParmTypes.FindNodeOrInsertPos(ID, InsertPos);
3786 
3787  if (!SubstParm) {
3788  SubstParm = new (*this, TypeAlignment)
3789  SubstTemplateTypeParmType(Parm, Replacement);
3790  Types.push_back(SubstParm);
3791  SubstTemplateTypeParmTypes.InsertNode(SubstParm, InsertPos);
3792  }
3793 
3794  return QualType(SubstParm, 0);
3795 }
3796 
3797 /// \brief Retrieve a
3799  const TemplateTypeParmType *Parm,
3800  const TemplateArgument &ArgPack) {
3801 #ifndef NDEBUG
3802  for (const auto &P : ArgPack.pack_elements()) {
3803  assert(P.getKind() == TemplateArgument::Type &&"Pack contains a non-type");
3804  assert(P.getAsType().isCanonical() && "Pack contains non-canonical type");
3805  }
3806 #endif
3807 
3808  llvm::FoldingSetNodeID ID;
3809  SubstTemplateTypeParmPackType::Profile(ID, Parm, ArgPack);
3810  void *InsertPos = nullptr;
3811  if (SubstTemplateTypeParmPackType *SubstParm
3812  = SubstTemplateTypeParmPackTypes.FindNodeOrInsertPos(ID, InsertPos))
3813  return QualType(SubstParm, 0);
3814 
3815  QualType Canon;
3816  if (!Parm->isCanonicalUnqualified()) {
3817  Canon = getCanonicalType(QualType(Parm, 0));
3818  Canon = getSubstTemplateTypeParmPackType(cast<TemplateTypeParmType>(Canon),
3819  ArgPack);
3820  SubstTemplateTypeParmPackTypes.FindNodeOrInsertPos(ID, InsertPos);
3821  }
3822 
3824  = new (*this, TypeAlignment) SubstTemplateTypeParmPackType(Parm, Canon,
3825  ArgPack);
3826  Types.push_back(SubstParm);
3827  SubstTemplateTypeParmPackTypes.InsertNode(SubstParm, InsertPos);
3828  return QualType(SubstParm, 0);
3829 }
3830 
3831 /// \brief Retrieve the template type parameter type for a template
3832 /// parameter or parameter pack with the given depth, index, and (optionally)
3833 /// name.
3835  bool ParameterPack,
3836  TemplateTypeParmDecl *TTPDecl) const {
3837  llvm::FoldingSetNodeID ID;
3838  TemplateTypeParmType::Profile(ID, Depth, Index, ParameterPack, TTPDecl);
3839  void *InsertPos = nullptr;
3840  TemplateTypeParmType *TypeParm
3841  = TemplateTypeParmTypes.FindNodeOrInsertPos(ID, InsertPos);
3842 
3843  if (TypeParm)
3844  return QualType(TypeParm, 0);
3845 
3846  if (TTPDecl) {
3847  QualType Canon = getTemplateTypeParmType(Depth, Index, ParameterPack);
3848  TypeParm = new (*this, TypeAlignment) TemplateTypeParmType(TTPDecl, Canon);
3849 
3850  TemplateTypeParmType *TypeCheck
3851  = TemplateTypeParmTypes.FindNodeOrInsertPos(ID, InsertPos);
3852  assert(!TypeCheck && "Template type parameter canonical type broken");
3853  (void)TypeCheck;
3854  } else
3855  TypeParm = new (*this, TypeAlignment)
3856  TemplateTypeParmType(Depth, Index, ParameterPack);
3857 
3858  Types.push_back(TypeParm);
3859  TemplateTypeParmTypes.InsertNode(TypeParm, InsertPos);
3860 
3861  return QualType(TypeParm, 0);
3862 }
3863 
3866  SourceLocation NameLoc,
3867  const TemplateArgumentListInfo &Args,
3868  QualType Underlying) const {
3869  assert(!Name.getAsDependentTemplateName() &&
3870  "No dependent template names here!");
3871  QualType TST = getTemplateSpecializationType(Name, Args, Underlying);
3872 
3877  TL.setTemplateNameLoc(NameLoc);
3878  TL.setLAngleLoc(Args.getLAngleLoc());
3879  TL.setRAngleLoc(Args.getRAngleLoc());
3880  for (unsigned i = 0, e = TL.getNumArgs(); i != e; ++i)
3881  TL.setArgLocInfo(i, Args[i].getLocInfo());
3882  return DI;
3883 }
3884 
3885 QualType
3887  const TemplateArgumentListInfo &Args,
3888  QualType Underlying) const {
3889  assert(!Template.getAsDependentTemplateName() &&
3890  "No dependent template names here!");
3891 
3893  ArgVec.reserve(Args.size());
3894  for (const TemplateArgumentLoc &Arg : Args.arguments())
3895  ArgVec.push_back(Arg.getArgument());
3896 
3897  return getTemplateSpecializationType(Template, ArgVec, Underlying);
3898 }
3899 
3900 #ifndef NDEBUG
3902  for (const TemplateArgument &Arg : Args)
3903  if (Arg.isPackExpansion())
3904  return true;
3905 
3906  return true;
3907 }
3908 #endif
3909 
3910 QualType
3913  QualType Underlying) const {
3914  assert(!Template.getAsDependentTemplateName() &&
3915  "No dependent template names here!");
3916  // Look through qualified template names.
3917  if (QualifiedTemplateName *QTN = Template.getAsQualifiedTemplateName())
3918  Template = TemplateName(QTN->getTemplateDecl());
3919 
3920  bool IsTypeAlias =
3921  Template.getAsTemplateDecl() &&
3922  isa<TypeAliasTemplateDecl>(Template.getAsTemplateDecl());
3923  QualType CanonType;
3924  if (!Underlying.isNull())
3925  CanonType = getCanonicalType(Underlying);
3926  else {
3927  // We can get here with an alias template when the specialization contains
3928  // a pack expansion that does not match up with a parameter pack.
3929  assert((!IsTypeAlias || hasAnyPackExpansions(Args)) &&
3930  "Caller must compute aliased type");
3931  IsTypeAlias = false;
3932  CanonType = getCanonicalTemplateSpecializationType(Template, Args);
3933  }
3934 
3935  // Allocate the (non-canonical) template specialization type, but don't
3936  // try to unique it: these types typically have location information that
3937  // we don't unique and don't want to lose.
3938  void *Mem = Allocate(sizeof(TemplateSpecializationType) +
3939  sizeof(TemplateArgument) * Args.size() +
3940  (IsTypeAlias? sizeof(QualType) : 0),
3941  TypeAlignment);
3943  = new (Mem) TemplateSpecializationType(Template, Args, CanonType,
3944  IsTypeAlias ? Underlying : QualType());
3945 
3946  Types.push_back(Spec);
3947  return QualType(Spec, 0);
3948 }
3949 
3951  TemplateName Template, ArrayRef<TemplateArgument> Args) const {
3952  assert(!Template.getAsDependentTemplateName() &&
3953  "No dependent template names here!");
3954 
3955  // Look through qualified template names.
3956  if (QualifiedTemplateName *QTN = Template.getAsQualifiedTemplateName())
3957  Template = TemplateName(QTN->getTemplateDecl());
3958 
3959  // Build the canonical template specialization type.
3960  TemplateName CanonTemplate = getCanonicalTemplateName(Template);
3962  unsigned NumArgs = Args.size();
3963  CanonArgs.reserve(NumArgs);
3964  for (const TemplateArgument &Arg : Args)
3965  CanonArgs.push_back(getCanonicalTemplateArgument(Arg));
3966 
3967  // Determine whether this canonical template specialization type already
3968  // exists.
3969  llvm::FoldingSetNodeID ID;
3970  TemplateSpecializationType::Profile(ID, CanonTemplate,
3971  CanonArgs, *this);
3972 
3973  void *InsertPos = nullptr;
3975  = TemplateSpecializationTypes.FindNodeOrInsertPos(ID, InsertPos);
3976 
3977  if (!Spec) {
3978  // Allocate a new canonical template specialization type.
3979  void *Mem = Allocate((sizeof(TemplateSpecializationType) +
3980  sizeof(TemplateArgument) * NumArgs),
3981  TypeAlignment);
3982  Spec = new (Mem) TemplateSpecializationType(CanonTemplate,
3983  CanonArgs,
3984  QualType(), QualType());
3985  Types.push_back(Spec);
3986  TemplateSpecializationTypes.InsertNode(Spec, InsertPos);
3987  }
3988 
3989  assert(Spec->isDependentType() &&
3990  "Non-dependent template-id type must have a canonical type");
3991  return QualType(Spec, 0);
3992 }
3993 
3994 QualType
3996  NestedNameSpecifier *NNS,
3997  QualType NamedType) const {
3998  llvm::FoldingSetNodeID ID;
3999  ElaboratedType::Profile(ID, Keyword, NNS, NamedType);
4000 
4001  void *InsertPos = nullptr;
4002  ElaboratedType *T = ElaboratedTypes.FindNodeOrInsertPos(ID, InsertPos);
4003  if (T)
4004  return QualType(T, 0);
4005 
4006  QualType Canon = NamedType;
4007  if (!Canon.isCanonical()) {
4008  Canon = getCanonicalType(NamedType);
4009  ElaboratedType *CheckT = ElaboratedTypes.FindNodeOrInsertPos(ID, InsertPos);
4010  assert(!CheckT && "Elaborated canonical type broken");
4011  (void)CheckT;
4012  }
4013 
4014  T = new (*this, TypeAlignment) ElaboratedType(Keyword, NNS, NamedType, Canon);
4015  Types.push_back(T);
4016  ElaboratedTypes.InsertNode(T, InsertPos);
4017  return QualType(T, 0);
4018 }
4019 
4020 QualType
4022  llvm::FoldingSetNodeID ID;
4023  ParenType::Profile(ID, InnerType);
4024 
4025  void *InsertPos = nullptr;
4026  ParenType *T = ParenTypes.FindNodeOrInsertPos(ID, InsertPos);
4027  if (T)
4028  return QualType(T, 0);
4029 
4030  QualType Canon = InnerType;
4031  if (!Canon.isCanonical()) {
4032  Canon = getCanonicalType(InnerType);
4033  ParenType *CheckT = ParenTypes.FindNodeOrInsertPos(ID, InsertPos);
4034  assert(!CheckT && "Paren canonical type broken");
4035  (void)CheckT;
4036  }
4037 
4038  T = new (*this, TypeAlignment) ParenType(InnerType, Canon);
4039  Types.push_back(T);
4040  ParenTypes.InsertNode(T, InsertPos);
4041  return QualType(T, 0);
4042 }
4043 
4045  NestedNameSpecifier *NNS,
4046  const IdentifierInfo *Name,
4047  QualType Canon) const {
4048  if (Canon.isNull()) {
4050  if (CanonNNS != NNS)
4051  Canon = getDependentNameType(Keyword, CanonNNS, Name);
4052  }
4053 
4054  llvm::FoldingSetNodeID ID;
4055  DependentNameType::Profile(ID, Keyword, NNS, Name);
4056 
4057  void *InsertPos = nullptr;
4059  = DependentNameTypes.FindNodeOrInsertPos(ID, InsertPos);
4060  if (T)
4061  return QualType(T, 0);
4062 
4063  T = new (*this, TypeAlignment) DependentNameType(Keyword, NNS, Name, Canon);
4064  Types.push_back(T);
4065  DependentNameTypes.InsertNode(T, InsertPos);
4066  return QualType(T, 0);
4067 }
4068 
4069 QualType
4071  ElaboratedTypeKeyword Keyword,
4072  NestedNameSpecifier *NNS,
4073  const IdentifierInfo *Name,
4074  const TemplateArgumentListInfo &Args) const {
4075  // TODO: avoid this copy
4077  for (unsigned I = 0, E = Args.size(); I != E; ++I)
4078  ArgCopy.push_back(Args[I].getArgument());
4079  return getDependentTemplateSpecializationType(Keyword, NNS, Name, ArgCopy);
4080 }
4081 
4082 QualType
4084  ElaboratedTypeKeyword Keyword,
4085  NestedNameSpecifier *NNS,
4086  const IdentifierInfo *Name,
4087  ArrayRef<TemplateArgument> Args) const {
4088  assert((!NNS || NNS->isDependent()) &&
4089  "nested-name-specifier must be dependent");
4090 
4091  llvm::FoldingSetNodeID ID;
4092  DependentTemplateSpecializationType::Profile(ID, *this, Keyword, NNS,
4093  Name, Args);
4094 
4095  void *InsertPos = nullptr;
4097  = DependentTemplateSpecializationTypes.FindNodeOrInsertPos(ID, InsertPos);
4098  if (T)
4099  return QualType(T, 0);
4100 
4102 
4103  ElaboratedTypeKeyword CanonKeyword = Keyword;
4104  if (Keyword == ETK_None) CanonKeyword = ETK_Typename;
4105 
4106  bool AnyNonCanonArgs = false;
4107  unsigned NumArgs = Args.size();
4108  SmallVector<TemplateArgument, 16> CanonArgs(NumArgs);
4109  for (unsigned I = 0; I != NumArgs; ++I) {
4110  CanonArgs[I] = getCanonicalTemplateArgument(Args[I]);
4111  if (!CanonArgs[I].structurallyEquals(Args[I]))
4112  AnyNonCanonArgs = true;
4113  }
4114 
4115  QualType Canon;
4116  if (AnyNonCanonArgs || CanonNNS != NNS || CanonKeyword != Keyword) {
4117  Canon = getDependentTemplateSpecializationType(CanonKeyword, CanonNNS,
4118  Name,
4119  CanonArgs);
4120 
4121  // Find the insert position again.
4122  DependentTemplateSpecializationTypes.FindNodeOrInsertPos(ID, InsertPos);
4123  }
4124 
4125  void *Mem = Allocate((sizeof(DependentTemplateSpecializationType) +
4126  sizeof(TemplateArgument) * NumArgs),
4127  TypeAlignment);
4128  T = new (Mem) DependentTemplateSpecializationType(Keyword, NNS,
4129  Name, Args, Canon);
4130  Types.push_back(T);
4131  DependentTemplateSpecializationTypes.InsertNode(T, InsertPos);
4132  return QualType(T, 0);
4133 }
4134 
4136  TemplateArgument Arg;
4137  if (auto *TTP = dyn_cast<TemplateTypeParmDecl>(Param)) {
4138  QualType ArgType = getTypeDeclType(TTP);
4139  if (TTP->isParameterPack())
4140  ArgType = getPackExpansionType(ArgType, None);
4141 
4142  Arg = TemplateArgument(ArgType);
4143  } else if (auto *NTTP = dyn_cast<NonTypeTemplateParmDecl>(Param)) {
4144  Expr *E = new (*this) DeclRefExpr(
4145  NTTP, /*enclosing*/false,
4146  NTTP->getType().getNonLValueExprType(*this),
4147  Expr::getValueKindForType(NTTP->getType()), NTTP->getLocation());
4148 
4149  if (NTTP->isParameterPack())
4150  E = new (*this) PackExpansionExpr(DependentTy, E, NTTP->getLocation(),
4151  None);
4152  Arg = TemplateArgument(E);
4153  } else {
4154  auto *TTP = cast<TemplateTemplateParmDecl>(Param);
4155  if (TTP->isParameterPack())
4157  else
4158  Arg = TemplateArgument(TemplateName(TTP));
4159  }
4160 
4161  if (Param->isTemplateParameterPack())
4162  Arg = TemplateArgument::CreatePackCopy(*this, Arg);
4163 
4164  return Arg;
4165 }
4166 
4167 void
4170  Args.reserve(Args.size() + Params->size());
4171 
4172  for (NamedDecl *Param : *Params)
4173  Args.push_back(getInjectedTemplateArg(Param));
4174 }
4175 
4177  Optional<unsigned> NumExpansions) {
4178  llvm::FoldingSetNodeID ID;
4179  PackExpansionType::Profile(ID, Pattern, NumExpansions);
4180 
4181  assert(Pattern->containsUnexpandedParameterPack() &&
4182  "Pack expansions must expand one or more parameter packs");
4183  void *InsertPos = nullptr;
4185  = PackExpansionTypes.FindNodeOrInsertPos(ID, InsertPos);
4186  if (T)
4187  return QualType(T, 0);
4188 
4189  QualType Canon;
4190  if (!Pattern.isCanonical()) {
4191  Canon = getCanonicalType(Pattern);
4192  // The canonical type might not contain an unexpanded parameter pack, if it
4193  // contains an alias template specialization which ignores one of its
4194  // parameters.
4195  if (Canon->containsUnexpandedParameterPack()) {
4196  Canon = getPackExpansionType(Canon, NumExpansions);
4197 
4198  // Find the insert position again, in case we inserted an element into
4199  // PackExpansionTypes and invalidated our insert position.
4200  PackExpansionTypes.FindNodeOrInsertPos(ID, InsertPos);
4201  }
4202  }
4203 
4204  T = new (*this, TypeAlignment)
4205  PackExpansionType(Pattern, Canon, NumExpansions);
4206  Types.push_back(T);
4207  PackExpansionTypes.InsertNode(T, InsertPos);
4208  return QualType(T, 0);
4209 }
4210 
4211 /// CmpProtocolNames - Comparison predicate for sorting protocols
4212 /// alphabetically.
4213 static int CmpProtocolNames(ObjCProtocolDecl *const *LHS,
4214  ObjCProtocolDecl *const *RHS) {
4215  return DeclarationName::compare((*LHS)->getDeclName(), (*RHS)->getDeclName());
4216 }
4217 
4219  if (Protocols.empty()) return true;
4220 
4221  if (Protocols[0]->getCanonicalDecl() != Protocols[0])
4222  return false;
4223 
4224  for (unsigned i = 1; i != Protocols.size(); ++i)
4225  if (CmpProtocolNames(&Protocols[i - 1], &Protocols[i]) >= 0 ||
4226  Protocols[i]->getCanonicalDecl() != Protocols[i])
4227  return false;
4228  return true;
4229 }
4230 
4231 static void
4233  // Sort protocols, keyed by name.
4234  llvm::array_pod_sort(Protocols.begin(), Protocols.end(), CmpProtocolNames);
4235 
4236  // Canonicalize.
4237  for (ObjCProtocolDecl *&P : Protocols)
4238  P = P->getCanonicalDecl();
4239 
4240  // Remove duplicates.
4241  auto ProtocolsEnd = std::unique(Protocols.begin(), Protocols.end());
4242  Protocols.erase(ProtocolsEnd, Protocols.end());
4243 }
4244 
4246  ObjCProtocolDecl * const *Protocols,
4247  unsigned NumProtocols) const {
4248  return getObjCObjectType(BaseType, {},
4249  llvm::makeArrayRef(Protocols, NumProtocols),
4250  /*isKindOf=*/false);
4251 }
4252 
4254  QualType baseType,
4255  ArrayRef<QualType> typeArgs,
4256  ArrayRef<ObjCProtocolDecl *> protocols,
4257  bool isKindOf) const {
4258  // If the base type is an interface and there aren't any protocols or
4259  // type arguments to add, then the interface type will do just fine.
4260  if (typeArgs.empty() && protocols.empty() && !isKindOf &&
4261  isa<ObjCInterfaceType>(baseType))
4262  return baseType;
4263 
4264  // Look in the folding set for an existing type.
4265  llvm::FoldingSetNodeID ID;
4266  ObjCObjectTypeImpl::Profile(ID, baseType, typeArgs, protocols, isKindOf);
4267  void *InsertPos = nullptr;
4268  if (ObjCObjectType *QT = ObjCObjectTypes.FindNodeOrInsertPos(ID, InsertPos))
4269  return QualType(QT, 0);
4270 
4271  // Determine the type arguments to be used for canonicalization,
4272  // which may be explicitly specified here or written on the base
4273  // type.
4274  ArrayRef<QualType> effectiveTypeArgs = typeArgs;
4275  if (effectiveTypeArgs.empty()) {
4276  if (auto baseObject = baseType->getAs<ObjCObjectType>())
4277  effectiveTypeArgs = baseObject->getTypeArgs();
4278  }
4279 
4280  // Build the canonical type, which has the canonical base type and a
4281  // sorted-and-uniqued list of protocols and the type arguments
4282  // canonicalized.
4283  QualType canonical;
4284  bool typeArgsAreCanonical = std::all_of(effectiveTypeArgs.begin(),
4285  effectiveTypeArgs.end(),
4286  [&](QualType type) {
4287  return type.isCanonical();
4288  });
4289  bool protocolsSorted = areSortedAndUniqued(protocols);
4290  if (!typeArgsAreCanonical || !protocolsSorted || !baseType.isCanonical()) {
4291  // Determine the canonical type arguments.
4292  ArrayRef<QualType> canonTypeArgs;
4293  SmallVector<QualType, 4> canonTypeArgsVec;
4294  if (!typeArgsAreCanonical) {
4295  canonTypeArgsVec.reserve(effectiveTypeArgs.size());
4296  for (auto typeArg : effectiveTypeArgs)
4297  canonTypeArgsVec.push_back(getCanonicalType(typeArg));
4298  canonTypeArgs = canonTypeArgsVec;
4299  } else {
4300  canonTypeArgs = effectiveTypeArgs;
4301  }
4302 
4303  ArrayRef<ObjCProtocolDecl *> canonProtocols;
4304  SmallVector<ObjCProtocolDecl*, 8> canonProtocolsVec;
4305  if (!protocolsSorted) {
4306  canonProtocolsVec.append(protocols.begin(), protocols.end());
4307  SortAndUniqueProtocols(canonProtocolsVec);
4308  canonProtocols = canonProtocolsVec;
4309  } else {
4310  canonProtocols = protocols;
4311  }
4312 
4313  canonical = getObjCObjectType(getCanonicalType(baseType), canonTypeArgs,
4314  canonProtocols, isKindOf);
4315 
4316  // Regenerate InsertPos.
4317  ObjCObjectTypes.FindNodeOrInsertPos(ID, InsertPos);
4318  }
4319 
4320  unsigned size = sizeof(ObjCObjectTypeImpl);
4321  size += typeArgs.size() * sizeof(QualType);
4322  size += protocols.size() * sizeof(ObjCProtocolDecl *);
4323  void *mem = Allocate(size, TypeAlignment);
4324  ObjCObjectTypeImpl *T =
4325  new (mem) ObjCObjectTypeImpl(canonical, baseType, typeArgs, protocols,
4326  isKindOf);
4327 
4328  Types.push_back(T);
4329  ObjCObjectTypes.InsertNode(T, InsertPos);
4330  return QualType(T, 0);
4331 }
4332 
4333 /// Apply Objective-C protocol qualifiers to the given type.
4334 /// If this is for the canonical type of a type parameter, we can apply
4335 /// protocol qualifiers on the ObjCObjectPointerType.
4336 QualType
4338  ArrayRef<ObjCProtocolDecl *> protocols, bool &hasError,
4339  bool allowOnPointerType) const {
4340  hasError = false;
4341 
4342  if (const ObjCTypeParamType *objT =
4343  dyn_cast<ObjCTypeParamType>(type.getTypePtr())) {
4344  return getObjCTypeParamType(objT->getDecl(), protocols);
4345  }
4346 
4347  // Apply protocol qualifiers to ObjCObjectPointerType.
4348  if (allowOnPointerType) {
4349  if (const ObjCObjectPointerType *objPtr =
4350  dyn_cast<ObjCObjectPointerType>(type.getTypePtr())) {
4351  const ObjCObjectType *objT = objPtr->getObjectType();
4352  // Merge protocol lists and construct ObjCObjectType.
4353  SmallVector<ObjCProtocolDecl*, 8> protocolsVec;
4354  protocolsVec.append(objT->qual_begin(),
4355  objT->qual_end());
4356  protocolsVec.append(protocols.begin(), protocols.end());
4357  ArrayRef<ObjCProtocolDecl *> protocols = protocolsVec;
4358  type = getObjCObjectType(
4359  objT->getBaseType(),
4360  objT->getTypeArgsAsWritten(),
4361  protocols,
4362  objT->isKindOfTypeAsWritten());
4363  return getObjCObjectPointerType(type);
4364  }
4365  }
4366 
4367  // Apply protocol qualifiers to ObjCObjectType.
4368  if (const ObjCObjectType *objT = dyn_cast<ObjCObjectType>(type.getTypePtr())){
4369  // FIXME: Check for protocols to which the class type is already
4370  // known to conform.
4371 
4372  return getObjCObjectType(objT->getBaseType(),
4373  objT->getTypeArgsAsWritten(),
4374  protocols,
4375  objT->isKindOfTypeAsWritten());
4376  }
4377 
4378  // If the canonical type is ObjCObjectType, ...
4379  if (type->isObjCObjectType()) {
4380  // Silently overwrite any existing protocol qualifiers.
4381  // TODO: determine whether that's the right thing to do.
4382 
4383  // FIXME: Check for protocols to which the class type is already
4384  // known to conform.
4385  return getObjCObjectType(type, {}, protocols, false);
4386  }
4387 
4388  // id<protocol-list>
4389  if (type->isObjCIdType()) {
4390  const ObjCObjectPointerType *objPtr = type->castAs<ObjCObjectPointerType>();
4391  type = getObjCObjectType(ObjCBuiltinIdTy, {}, protocols,
4392  objPtr->isKindOfType());
4393  return getObjCObjectPointerType(type);
4394  }
4395 
4396  // Class<protocol-list>
4397  if (type->isObjCClassType()) {
4398  const ObjCObjectPointerType *objPtr = type->castAs<ObjCObjectPointerType>();
4399  type = getObjCObjectType(ObjCBuiltinClassTy, {}, protocols,
4400  objPtr->isKindOfType());
4401  return getObjCObjectPointerType(type);
4402  }
4403 
4404  hasError = true;
4405  return type;
4406 }
4407 
4408 QualType
4410  ArrayRef<ObjCProtocolDecl *> protocols,
4411  QualType Canonical) const {
4412  // Look in the folding set for an existing type.
4413  llvm::FoldingSetNodeID ID;
4414  ObjCTypeParamType::Profile(ID, Decl, protocols);
4415  void *InsertPos = nullptr;
4416  if (ObjCTypeParamType *TypeParam =
4417  ObjCTypeParamTypes.FindNodeOrInsertPos(ID, InsertPos))
4418  return QualType(TypeParam, 0);
4419 
4420  if (Canonical.isNull()) {
4421  // We canonicalize to the underlying type.
4422  Canonical = getCanonicalType(Decl->getUnderlyingType());
4423  if (!protocols.empty()) {
4424  // Apply the protocol qualifers.
4425  bool hasError;
4426  Canonical = applyObjCProtocolQualifiers(Canonical, protocols, hasError,
4427  true/*allowOnPointerType*/);
4428  assert(!hasError && "Error when apply protocol qualifier to bound type");
4429  }
4430  }
4431 
4432  unsigned size = sizeof(ObjCTypeParamType);
4433  size += protocols.size() * sizeof(ObjCProtocolDecl *);
4434  void *mem = Allocate(size, TypeAlignment);
4435  ObjCTypeParamType *newType = new (mem)
4436  ObjCTypeParamType(Decl, Canonical, protocols);
4437 
4438  Types.push_back(newType);
4439  ObjCTypeParamTypes.InsertNode(newType, InsertPos);
4440  return QualType(newType, 0);
4441 }
4442 
4443 /// ObjCObjectAdoptsQTypeProtocols - Checks that protocols in IC's
4444 /// protocol list adopt all protocols in QT's qualified-id protocol
4445 /// list.
4447  ObjCInterfaceDecl *IC) {
4448  if (!QT->isObjCQualifiedIdType())
4449  return false;
4450 
4451  if (const ObjCObjectPointerType *OPT = QT->getAs<ObjCObjectPointerType>()) {
4452  // If both the right and left sides have qualifiers.
4453  for (auto *Proto : OPT->quals()) {
4454  if (!IC->ClassImplementsProtocol(Proto, false))
4455  return false;
4456  }
4457  return true;
4458  }
4459  return false;
4460 }
4461 
4462 /// QIdProtocolsAdoptObjCObjectProtocols - Checks that protocols in
4463 /// QT's qualified-id protocol list adopt all protocols in IDecl's list
4464 /// of protocols.
4466  ObjCInterfaceDecl *IDecl) {
4467  if (!QT->isObjCQualifiedIdType())
4468  return false;
4470  if (!OPT)
4471  return false;
4472  if (!IDecl->hasDefinition())
4473  return false;
4474  llvm::SmallPtrSet<ObjCProtocolDecl *, 8> InheritedProtocols;
4475  CollectInheritedProtocols(IDecl, InheritedProtocols);
4476  if (InheritedProtocols.empty())
4477  return false;
4478  // Check that if every protocol in list of id<plist> conforms to a protcol
4479  // of IDecl's, then bridge casting is ok.
4480  bool Conforms = false;
4481  for (auto *Proto : OPT->quals()) {
4482  Conforms = false;
4483  for (auto *PI : InheritedProtocols) {
4484  if (ProtocolCompatibleWithProtocol(Proto, PI)) {
4485  Conforms = true;
4486  break;
4487  }
4488  }
4489  if (!Conforms)
4490  break;
4491  }
4492  if (Conforms)
4493  return true;
4494 
4495  for (auto *PI : InheritedProtocols) {
4496  // If both the right and left sides have qualifiers.
4497  bool Adopts = false;
4498  for (auto *Proto : OPT->quals()) {
4499  // return 'true' if 'PI' is in the inheritance hierarchy of Proto
4500  if ((Adopts = ProtocolCompatibleWithProtocol(PI, Proto)))
4501  break;
4502  }
4503  if (!Adopts)
4504  return false;
4505  }
4506  return true;
4507 }
4508 
4509 /// getObjCObjectPointerType - Return a ObjCObjectPointerType type for
4510 /// the given object type.
4512  llvm::FoldingSetNodeID ID;
4513  ObjCObjectPointerType::Profile(ID, ObjectT);
4514 
4515  void *InsertPos = nullptr;
4516  if (ObjCObjectPointerType *QT =
4517  ObjCObjectPointerTypes.FindNodeOrInsertPos(ID, InsertPos))
4518  return QualType(QT, 0);
4519 
4520  // Find the canonical object type.
4521  QualType Canonical;
4522  if (!ObjectT.isCanonical()) {
4523  Canonical = getObjCObjectPointerType(getCanonicalType(ObjectT));
4524 
4525  // Regenerate InsertPos.
4526  ObjCObjectPointerTypes.FindNodeOrInsertPos(ID, InsertPos);
4527  }
4528 
4529  // No match.
4530  void *Mem = Allocate(sizeof(ObjCObjectPointerType), TypeAlignment);
4531  ObjCObjectPointerType *QType =
4532  new (Mem) ObjCObjectPointerType(Canonical, ObjectT);
4533 
4534  Types.push_back(QType);
4535  ObjCObjectPointerTypes.InsertNode(QType, InsertPos);
4536  return QualType(QType, 0);
4537 }
4538 
4539 /// getObjCInterfaceType - Return the unique reference to the type for the
4540 /// specified ObjC interface decl. The list of protocols is optional.
4542  ObjCInterfaceDecl *PrevDecl) const {
4543  if (Decl->TypeForDecl)
4544  return QualType(Decl->TypeForDecl, 0);
4545 
4546  if (PrevDecl) {
4547  assert(PrevDecl->TypeForDecl && "previous decl has no TypeForDecl");
4548  Decl->TypeForDecl = PrevDecl->TypeForDecl;
4549  return QualType(PrevDecl->TypeForDecl, 0);
4550  }
4551 
4552  // Prefer the definition, if there is one.
4553  if (const ObjCInterfaceDecl *Def = Decl->getDefinition())
4554  Decl = Def;
4555 
4556  void *Mem = Allocate(sizeof(ObjCInterfaceType), TypeAlignment);
4557  ObjCInterfaceType *T = new (Mem) ObjCInterfaceType(Decl);
4558  Decl->TypeForDecl = T;
4559  Types.push_back(T);
4560  return QualType(T, 0);
4561 }
4562 
4563 /// getTypeOfExprType - Unlike many "get<Type>" functions, we can't unique
4564 /// TypeOfExprType AST's (since expression's are never shared). For example,
4565 /// multiple declarations that refer to "typeof(x)" all contain different
4566 /// DeclRefExpr's. This doesn't effect the type checker, since it operates
4567 /// on canonical type's (which are always unique).
4569  TypeOfExprType *toe;
4570  if (tofExpr->isTypeDependent()) {
4571  llvm::FoldingSetNodeID ID;
4572  DependentTypeOfExprType::Profile(ID, *this, tofExpr);
4573 
4574  void *InsertPos = nullptr;
4576  = DependentTypeOfExprTypes.FindNodeOrInsertPos(ID, InsertPos);
4577  if (Canon) {
4578  // We already have a "canonical" version of an identical, dependent
4579  // typeof(expr) type. Use that as our canonical type.
4580  toe = new (*this, TypeAlignment) TypeOfExprType(tofExpr,
4581  QualType((TypeOfExprType*)Canon, 0));
4582  } else {
4583  // Build a new, canonical typeof(expr) type.
4584  Canon
4585  = new (*this, TypeAlignment) DependentTypeOfExprType(*this, tofExpr);
4586  DependentTypeOfExprTypes.InsertNode(Canon, InsertPos);
4587  toe = Canon;
4588  }
4589  } else {
4590  QualType Canonical = getCanonicalType(tofExpr->getType());
4591  toe = new (*this, TypeAlignment) TypeOfExprType(tofExpr, Canonical);
4592  }
4593  Types.push_back(toe);
4594  return QualType(toe, 0);
4595 }
4596 
4597 /// getTypeOfType - Unlike many "get<Type>" functions, we don't unique
4598 /// TypeOfType nodes. The only motivation to unique these nodes would be
4599 /// memory savings. Since typeof(t) is fairly uncommon, space shouldn't be
4600 /// an issue. This doesn't affect the type checker, since it operates
4601 /// on canonical types (which are always unique).
4603  QualType Canonical = getCanonicalType(tofType);
4604  TypeOfType *tot = new (*this, TypeAlignment) TypeOfType(tofType, Canonical);
4605  Types.push_back(tot);
4606  return QualType(tot, 0);
4607 }
4608 
4609 /// \brief Unlike many "get<Type>" functions, we don't unique DecltypeType
4610 /// nodes. This would never be helpful, since each such type has its own
4611 /// expression, and would not give a significant memory saving, since there
4612 /// is an Expr tree under each such type.
4614  DecltypeType *dt;
4615 
4616  // C++11 [temp.type]p2:
4617  // If an expression e involves a template parameter, decltype(e) denotes a
4618  // unique dependent type. Two such decltype-specifiers refer to the same
4619  // type only if their expressions are equivalent (14.5.6.1).
4620  if (e->isInstantiationDependent()) {
4621  llvm::FoldingSetNodeID ID;
4622  DependentDecltypeType::Profile(ID, *this, e);
4623 
4624  void *InsertPos = nullptr;
4625  DependentDecltypeType *Canon
4626  = DependentDecltypeTypes.FindNodeOrInsertPos(ID, InsertPos);
4627  if (!Canon) {
4628  // Build a new, canonical decltype(expr) type.
4629  Canon = new (*this, TypeAlignment) DependentDecltypeType(*this, e);
4630  DependentDecltypeTypes.InsertNode(Canon, InsertPos);
4631  }
4632  dt = new (*this, TypeAlignment)
4633  DecltypeType(e, UnderlyingType, QualType((DecltypeType *)Canon, 0));
4634  } else {
4635  dt = new (*this, TypeAlignment)
4636  DecltypeType(e, UnderlyingType, getCanonicalType(UnderlyingType));
4637  }
4638  Types.push_back(dt);
4639  return QualType(dt, 0);
4640 }
4641 
4642 /// getUnaryTransformationType - We don't unique these, since the memory
4643 /// savings are minimal and these are rare.
4645  QualType UnderlyingType,
4647  const {
4648  UnaryTransformType *ut = nullptr;
4649 
4650  if (BaseType->isDependentType()) {
4651  // Look in the folding set for an existing type.
4652  llvm::FoldingSetNodeID ID;
4654 
4655  void *InsertPos = nullptr;
4657  = DependentUnaryTransformTypes.FindNodeOrInsertPos(ID, InsertPos);
4658 
4659  if (!Canon) {
4660  // Build a new, canonical __underlying_type(type) type.
4661  Canon = new (*this, TypeAlignment)
4663  Kind);
4664  DependentUnaryTransformTypes.InsertNode(Canon, InsertPos);
4665  }
4666  ut = new (*this, TypeAlignment) UnaryTransformType (BaseType,
4667  QualType(), Kind,
4668  QualType(Canon, 0));
4669  } else {
4670  QualType CanonType = getCanonicalType(UnderlyingType);
4671  ut = new (*this, TypeAlignment) UnaryTransformType (BaseType,
4672  UnderlyingType, Kind,
4673  CanonType);
4674  }
4675  Types.push_back(ut);
4676  return QualType(ut, 0);
4677 }
4678 
4679 /// getAutoType - Return the uniqued reference to the 'auto' type which has been
4680 /// deduced to the given type, or to the canonical undeduced 'auto' type, or the
4681 /// canonical deduced-but-dependent 'auto' type.
4683  bool IsDependent) const {
4684  if (DeducedType.isNull() && Keyword == AutoTypeKeyword::Auto && !IsDependent)
4685  return getAutoDeductType();
4686 
4687  // Look in the folding set for an existing type.
4688  void *InsertPos = nullptr;
4689  llvm::FoldingSetNodeID ID;
4690  AutoType::Profile(ID, DeducedType, Keyword, IsDependent);
4691  if (AutoType *AT = AutoTypes.FindNodeOrInsertPos(ID, InsertPos))
4692  return QualType(AT, 0);
4693 
4694  AutoType *AT = new (*this, TypeAlignment) AutoType(DeducedType,
4695  Keyword,
4696  IsDependent);
4697  Types.push_back(AT);
4698  if (InsertPos)
4699  AutoTypes.InsertNode(AT, InsertPos);
4700  return QualType(AT, 0);
4701 }
4702 
4703 /// Return the uniqued reference to the deduced template specialization type
4704 /// which has been deduced to the given type, or to the canonical undeduced
4705 /// such type, or the canonical deduced-but-dependent such type.
4707  TemplateName Template, QualType DeducedType, bool IsDependent) const {
4708  // Look in the folding set for an existing type.
4709  void *InsertPos = nullptr;
4710  llvm::FoldingSetNodeID ID;
4711  DeducedTemplateSpecializationType::Profile(ID, Template, DeducedType,
4712  IsDependent);
4714  DeducedTemplateSpecializationTypes.FindNodeOrInsertPos(ID, InsertPos))
4715  return QualType(DTST, 0);
4716 
4718  DeducedTemplateSpecializationType(Template, DeducedType, IsDependent);
4719  Types.push_back(DTST);
4720  if (InsertPos)
4721  DeducedTemplateSpecializationTypes.InsertNode(DTST, InsertPos);
4722  return QualType(DTST, 0);
4723 }
4724 
4725 /// getAtomicType - Return the uniqued reference to the atomic type for
4726 /// the given value type.
4728  // Unique pointers, to guarantee there is only one pointer of a particular
4729  // structure.
4730  llvm::FoldingSetNodeID ID;
4731  AtomicType::Profile(ID, T);
4732 
4733  void *InsertPos = nullptr;
4734  if (AtomicType *AT = AtomicTypes.FindNodeOrInsertPos(ID, InsertPos))
4735  return QualType(AT, 0);
4736 
4737  // If the atomic value type isn't canonical, this won't be a canonical type
4738  // either, so fill in the canonical type field.
4739  QualType Canonical;
4740  if (!T.isCanonical()) {
4741  Canonical = getAtomicType(getCanonicalType(T));
4742 
4743  // Get the new insert position for the node we care about.
4744  AtomicType *NewIP = AtomicTypes.FindNodeOrInsertPos(ID, InsertPos);
4745  assert(!NewIP && "Shouldn't be in the map!"); (void)NewIP;
4746  }
4747  AtomicType *New = new (*this, TypeAlignment) AtomicType(T, Canonical);
4748  Types.push_back(New);
4749  AtomicTypes.InsertNode(New, InsertPos);
4750  return QualType(New, 0);
4751 }
4752 
4753 /// getAutoDeductType - Get type pattern for deducing against 'auto'.
4755  if (AutoDeductTy.isNull())
4758  /*dependent*/false),
4759  0);
4760  return AutoDeductTy;
4761 }
4762 
4763 /// getAutoRRefDeductType - Get type pattern for deducing against 'auto &&'.
4765  if (AutoRRefDeductTy.isNull())
4767  assert(!AutoRRefDeductTy.isNull() && "can't build 'auto &&' pattern");
4768  return AutoRRefDeductTy;
4769 }
4770 
4771 /// getTagDeclType - Return the unique reference to the type for the
4772 /// specified TagDecl (struct/union/class/enum) decl.
4774  assert(Decl);
4775  // FIXME: What is the design on getTagDeclType when it requires casting
4776  // away const? mutable?
4777  return getTypeDeclType(const_cast<TagDecl*>(Decl));
4778 }
4779 
4780 /// getSizeType - Return the unique type for "size_t" (C99 7.17), the result
4781 /// of the sizeof operator (C99 6.5.3.4p4). The value is target dependent and
4782 /// needs to agree with the definition in <stddef.h>.
4784  return getFromTargetType(Target->getSizeType());
4785 }
4786 
4787 /// Return the unique signed counterpart of the integer type
4788 /// corresponding to size_t.
4790  return getFromTargetType(Target->getSignedSizeType());
4791 }
4792 
4793 /// getIntMaxType - Return the unique type for "intmax_t" (C99 7.18.1.5).
4795  return getFromTargetType(Target->getIntMaxType());
4796 }
4797 
4798 /// getUIntMaxType - Return the unique type for "uintmax_t" (C99 7.18.1.5).
4800  return getFromTargetType(Target->getUIntMaxType());
4801 }
4802 
4803 /// getSignedWCharType - Return the type of "signed wchar_t".
4804 /// Used when in C++, as a GCC extension.
4806  // FIXME: derive from "Target" ?
4807  return WCharTy;
4808 }
4809 
4810 /// getUnsignedWCharType - Return the type of "unsigned wchar_t".
4811 /// Used when in C++, as a GCC extension.
4813  // FIXME: derive from "Target" ?
4814  return UnsignedIntTy;
4815 }
4816 
4818  return getFromTargetType(Target->getIntPtrType());
4819 }
4820 
4823 }
4824 
4825 /// getPointerDiffType - Return the unique type for "ptrdiff_t" (C99 7.17)
4826 /// defined in <stddef.h>. Pointer - pointer requires this (C99 6.5.6p9).
4828  return getFromTargetType(Target->getPtrDiffType(0));
4829 }
4830 
4831 /// \brief Return the unique unsigned counterpart of "ptrdiff_t"
4832 /// integer type. The standard (C11 7.21.6.1p7) refers to this type
4833 /// in the definition of %tu format specifier.
4835  return getFromTargetType(Target->getUnsignedPtrDiffType(0));
4836 }
4837 
4838 /// \brief Return the unique type for "pid_t" defined in
4839 /// <sys/types.h>. We need this to compute the correct type for vfork().
4841  return getFromTargetType(Target->getProcessIDType());
4842 }
4843 
4844 //===----------------------------------------------------------------------===//
4845 // Type Operators
4846 //===----------------------------------------------------------------------===//
4847 
4849  // Push qualifiers into arrays, and then discard any remaining
4850  // qualifiers.
4851  T = getCanonicalType(T);
4853  const Type *Ty = T.getTypePtr();
4854  QualType Result;
4855  if (isa<ArrayType>(Ty)) {
4856  Result = getArrayDecayedType(QualType(Ty,0));
4857  } else if (isa<FunctionType>(Ty)) {
4858  Result = getPointerType(QualType(Ty, 0));
4859  } else {
4860  Result = QualType(Ty, 0);
4861  }
4862 
4863  return CanQualType::CreateUnsafe(Result);
4864 }
4865 
4867  Qualifiers &quals) {
4868  SplitQualType splitType = type.getSplitUnqualifiedType();
4869 
4870  // FIXME: getSplitUnqualifiedType() actually walks all the way to
4871  // the unqualified desugared type and then drops it on the floor.
4872  // We then have to strip that sugar back off with
4873  // getUnqualifiedDesugaredType(), which is silly.
4874  const ArrayType *AT =
4875  dyn_cast<ArrayType>(splitType.Ty->getUnqualifiedDesugaredType());
4876 
4877  // If we don't have an array, just use the results in splitType.
4878  if (!AT) {
4879  quals = splitType.Quals;
4880  return QualType(splitType.Ty, 0);
4881  }
4882 
4883  // Otherwise, recurse on the array's element type.
4884  QualType elementType = AT->getElementType();
4885  QualType unqualElementType = getUnqualifiedArrayType(elementType, quals);
4886 
4887  // If that didn't change the element type, AT has no qualifiers, so we
4888  // can just use the results in splitType.
4889  if (elementType == unqualElementType) {
4890  assert(quals.empty()); // from the recursive call
4891  quals = splitType.Quals;
4892  return QualType(splitType.Ty, 0);
4893  }
4894 
4895  // Otherwise, add in the qualifiers from the outermost type, then
4896  // build the type back up.
4897  quals.addConsistentQualifiers(splitType.Quals);
4898 
4899  if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(AT)) {
4900  return getConstantArrayType(unqualElementType, CAT->getSize(),
4901  CAT->getSizeModifier(), 0);
4902  }
4903 
4904  if (const IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(AT)) {
4905  return getIncompleteArrayType(unqualElementType, IAT->getSizeModifier(), 0);
4906  }
4907 
4908  if (const VariableArrayType *VAT = dyn_cast<VariableArrayType>(AT)) {
4909  return getVariableArrayType(unqualElementType,
4910  VAT->getSizeExpr(),
4911  VAT->getSizeModifier(),
4912  VAT->getIndexTypeCVRQualifiers(),
4913  VAT->getBracketsRange());
4914  }
4915 
4916  const DependentSizedArrayType *DSAT = cast<DependentSizedArrayType>(AT);
4917  return getDependentSizedArrayType(unqualElementType, DSAT->getSizeExpr(),
4918  DSAT->getSizeModifier(), 0,
4919  SourceRange());
4920 }
4921 
4922 /// UnwrapSimilarPointerTypes - If T1 and T2 are pointer types that
4923 /// may be similar (C++ 4.4), replaces T1 and T2 with the type that
4924 /// they point to and return true. If T1 and T2 aren't pointer types
4925 /// or pointer-to-member types, or if they are not similar at this
4926 /// level, returns false and leaves T1 and T2 unchanged. Top-level
4927 /// qualifiers on T1 and T2 are ignored. This function will typically
4928 /// be called in a loop that successively "unwraps" pointer and
4929 /// pointer-to-member types to compare them at each level.
4931  const PointerType *T1PtrType = T1->getAs<PointerType>(),
4932  *T2PtrType = T2->getAs<PointerType>();
4933  if (T1PtrType && T2PtrType) {
4934  T1 = T1PtrType->getPointeeType();
4935  T2 = T2PtrType->getPointeeType();
4936  return true;
4937  }
4938 
4939  const MemberPointerType *T1MPType = T1->getAs<MemberPointerType>(),
4940  *T2MPType = T2->getAs<MemberPointerType>();
4941  if (T1MPType && T2MPType &&
4942  hasSameUnqualifiedType(QualType(T1MPType->getClass(), 0),
4943  QualType(T2MPType->getClass(), 0))) {
4944  T1 = T1MPType->getPointeeType();
4945  T2 = T2MPType->getPointeeType();
4946  return true;
4947  }
4948 
4949  if (getLangOpts().ObjC1) {
4950  const ObjCObjectPointerType *T1OPType = T1->getAs<ObjCObjectPointerType>(),
4951  *T2OPType = T2->getAs<ObjCObjectPointerType>();
4952  if (T1OPType && T2OPType) {
4953  T1 = T1OPType->getPointeeType();
4954  T2 = T2OPType->getPointeeType();
4955  return true;
4956  }
4957  }
4958 
4959  // FIXME: Block pointers, too?
4960 
4961  return false;
4962 }
4963 
4966  SourceLocation NameLoc) const {
4967  switch (Name.getKind()) {
4970  // DNInfo work in progress: CHECKME: what about DNLoc?
4972  NameLoc);
4973 
4976  // DNInfo work in progress: CHECKME: what about DNLoc?
4977  return DeclarationNameInfo((*Storage->begin())->getDeclName(), NameLoc);
4978  }
4979 
4982  DeclarationName DName;
4983  if (DTN->isIdentifier()) {
4985  return DeclarationNameInfo(DName, NameLoc);
4986  } else {
4988  // DNInfo work in progress: FIXME: source locations?
4989  DeclarationNameLoc DNLoc;
4992  return DeclarationNameInfo(DName, NameLoc, DNLoc);
4993  }
4994  }
4995 
4999  return DeclarationNameInfo(subst->getParameter()->getDeclName(),
5000  NameLoc);
5001  }
5002 
5007  NameLoc);
5008  }
5009  }
5010 
5011  llvm_unreachable("bad template name kind!");
5012 }
5013 
5015  switch (Name.getKind()) {
5017  case TemplateName::Template: {
5018  TemplateDecl *Template = Name.getAsTemplateDecl();
5019  if (TemplateTemplateParmDecl *TTP
5020  = dyn_cast<TemplateTemplateParmDecl>(Template))
5021  Template = getCanonicalTemplateTemplateParmDecl(TTP);
5022 
5023  // The canonical template name is the canonical template declaration.
5024  return TemplateName(cast<TemplateDecl>(Template->getCanonicalDecl()));
5025  }
5026 
5028  llvm_unreachable("cannot canonicalize overloaded template");
5029 
5032  assert(DTN && "Non-dependent template names must refer to template decls.");
5033  return DTN->CanonicalTemplateName;
5034  }
5035 
5039  return getCanonicalTemplateName(subst->getReplacement());
5040  }
5041 
5045  TemplateTemplateParmDecl *canonParameter
5046  = getCanonicalTemplateTemplateParmDecl(subst->getParameterPack());
5047  TemplateArgument canonArgPack
5049  return getSubstTemplateTemplateParmPack(canonParameter, canonArgPack);
5050  }
5051  }
5052 
5053  llvm_unreachable("bad template name!");
5054 }
5055 
5057  X = getCanonicalTemplateName(X);
5058  Y = getCanonicalTemplateName(Y);
5059  return X.getAsVoidPointer() == Y.getAsVoidPointer();
5060 }
5061 
5064  switch (Arg.getKind()) {
5066  return Arg;
5067 
5069  return Arg;
5070 
5072  ValueDecl *D = cast<ValueDecl>(Arg.getAsDecl()->getCanonicalDecl());
5073  return TemplateArgument(D, Arg.getParamTypeForDecl());
5074  }
5075 
5078  /*isNullPtr*/true);
5079 
5082 
5086  Arg.getNumTemplateExpansions());
5087 
5090 
5093 
5094  case TemplateArgument::Pack: {
5095  if (Arg.pack_size() == 0)
5096  return Arg;
5097 
5098  TemplateArgument *CanonArgs
5099  = new (*this) TemplateArgument[Arg.pack_size()];
5100  unsigned Idx = 0;
5102  AEnd = Arg.pack_end();
5103  A != AEnd; (void)++A, ++Idx)
5104  CanonArgs[Idx] = getCanonicalTemplateArgument(*A);
5105 
5106  return TemplateArgument(llvm::makeArrayRef(CanonArgs, Arg.pack_size()));
5107  }
5108  }
5109 
5110  // Silence GCC warning
5111  llvm_unreachable("Unhandled template argument kind");
5112 }
5113 
5116  if (!NNS)
5117  return nullptr;
5118 
5119  switch (NNS->getKind()) {
5121  // Canonicalize the prefix but keep the identifier the same.
5122  return NestedNameSpecifier::Create(*this,
5124  NNS->getAsIdentifier());
5125 
5127  // A namespace is canonical; build a nested-name-specifier with
5128  // this namespace and no prefix.
5129  return NestedNameSpecifier::Create(*this, nullptr,
5131 
5133  // A namespace is canonical; build a nested-name-specifier with
5134  // this namespace and no prefix.
5135  return NestedNameSpecifier::Create(*this, nullptr,
5137  ->getOriginalNamespace());
5138 
5141  QualType T = getCanonicalType(QualType(NNS->getAsType(), 0));
5142 
5143  // If we have some kind of dependent-named type (e.g., "typename T::type"),
5144  // break it apart into its prefix and identifier, then reconsititute those
5145  // as the canonical nested-name-specifier. This is required to canonicalize
5146  // a dependent nested-name-specifier involving typedefs of dependent-name
5147  // types, e.g.,
5148  // typedef typename T::type T1;
5149  // typedef typename T1::type T2;
5150  if (const DependentNameType *DNT = T->getAs<DependentNameType>())
5151  return NestedNameSpecifier::Create(*this, DNT->getQualifier(),
5152  const_cast<IdentifierInfo *>(DNT->getIdentifier()));
5153 
5154  // Otherwise, just canonicalize the type, and force it to be a TypeSpec.
5155  // FIXME: Why are TypeSpec and TypeSpecWithTemplate distinct in the
5156  // first place?
5157  return NestedNameSpecifier::Create(*this, nullptr, false,
5158  const_cast<Type *>(T.getTypePtr()));
5159  }
5160 
5163  // The global specifier and __super specifer are canonical and unique.
5164  return NNS;
5165  }
5166 
5167  llvm_unreachable("Invalid NestedNameSpecifier::Kind!");
5168 }
5169 
5171  // Handle the non-qualified case efficiently.
5172  if (!T.hasLocalQualifiers()) {
5173  // Handle the common positive case fast.
5174  if (const ArrayType *AT = dyn_cast<ArrayType>(T))
5175  return AT;
5176  }
5177 
5178  // Handle the common negative case fast.
5179  if (!isa<ArrayType>(T.getCanonicalType()))
5180  return nullptr;
5181 
5182  // Apply any qualifiers from the array type to the element type. This
5183  // implements C99 6.7.3p8: "If the specification of an array type includes
5184  // any type qualifiers, the element type is so qualified, not the array type."
5185 
5186  // If we get here, we either have type qualifiers on the type, or we have
5187  // sugar such as a typedef in the way. If we have type qualifiers on the type
5188  // we must propagate them down into the element type.
5189 
5191  Qualifiers qs = split.Quals;
5192 
5193  // If we have a simple case, just return now.
5194  const ArrayType *ATy = dyn_cast<ArrayType>(split.Ty);
5195  if (!ATy || qs.empty())
5196  return ATy;
5197 
5198  // Otherwise, we have an array and we have qualifiers on it. Push the
5199  // qualifiers into the array element type and return a new array type.
5200  QualType NewEltTy = getQualifiedType(ATy->getElementType(), qs);
5201 
5202  if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(ATy))
5203  return cast<ArrayType>(getConstantArrayType(NewEltTy, CAT->getSize(),
5204  CAT->getSizeModifier(),
5205  CAT->getIndexTypeCVRQualifiers()));
5206  if (const IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(ATy))
5207  return cast<ArrayType>(getIncompleteArrayType(NewEltTy,
5208  IAT->getSizeModifier(),
5209  IAT->getIndexTypeCVRQualifiers()));
5210 
5211  if (const DependentSizedArrayType *DSAT
5212  = dyn_cast<DependentSizedArrayType>(ATy))
5213  return cast<ArrayType>(
5214  getDependentSizedArrayType(NewEltTy,
5215  DSAT->getSizeExpr(),
5216  DSAT->getSizeModifier(),
5217  DSAT->getIndexTypeCVRQualifiers(),
5218  DSAT->getBracketsRange()));
5219 
5220  const VariableArrayType *VAT = cast<VariableArrayType>(ATy);
5221  return cast<ArrayType>(getVariableArrayType(NewEltTy,
5222  VAT->getSizeExpr(),
5223  VAT->getSizeModifier(),
5225  VAT->getBracketsRange()));
5226 }
5227 
5229  if (T->isArrayType() || T->isFunctionType())
5230  return getDecayedType(T);
5231  return T;
5232 }
5233 
5236  T = getAdjustedParameterType(T);
5237  return T.getUnqualifiedType();
5238 }
5239 
5241  // C++ [except.throw]p3:
5242  // A throw-expression initializes a temporary object, called the exception
5243  // object, the type of which is determined by removing any top-level
5244  // cv-qualifiers from the static type of the operand of throw and adjusting
5245  // the type from "array of T" or "function returning T" to "pointer to T"
5246  // or "pointer to function returning T", [...]
5248  if (T->isArrayType() || T->isFunctionType())
5249  T = getDecayedType(T);
5250  return T.getUnqualifiedType();
5251 }
5252 
5253 /// getArrayDecayedType - Return the properly qualified result of decaying the
5254 /// specified array type to a pointer. This operation is non-trivial when
5255 /// handling typedefs etc. The canonical type of "T" must be an array type,
5256 /// this returns a pointer to a properly qualified element of the array.
5257 ///
5258 /// See C99 6.7.5.3p7 and C99 6.3.2.1p3.
5260  // Get the element type with 'getAsArrayType' so that we don't lose any
5261  // typedefs in the element type of the array. This also handles propagation
5262  // of type qualifiers from the array type into the element type if present
5263  // (C99 6.7.3p8).
5264  const ArrayType *PrettyArrayType = getAsArrayType(Ty);
5265  assert(PrettyArrayType && "Not an array type!");
5266 
5267  QualType PtrTy = getPointerType(PrettyArrayType->getElementType());
5268 
5269  // int x[restrict 4] -> int *restrict
5271  PrettyArrayType->getIndexTypeQualifiers());
5272 
5273  // int x[_Nullable] -> int * _Nullable
5274  if (auto Nullability = Ty->getNullability(*this)) {
5275  Result = const_cast<ASTContext *>(this)->getAttributedType(
5277  }
5278  return Result;
5279 }
5280 
5282  return getBaseElementType(array->getElementType());
5283 }
5284 
5286  Qualifiers qs;
5287  while (true) {
5288  SplitQualType split = type.getSplitDesugaredType();
5289  const ArrayType *array = split.Ty->getAsArrayTypeUnsafe();
5290  if (!array) break;
5291 
5292  type = array->getElementType();
5293  qs.addConsistentQualifiers(split.Quals);
5294  }
5295 
5296  return getQualifiedType(type, qs);
5297 }
5298 
5299 /// getConstantArrayElementCount - Returns number of constant array elements.
5300 uint64_t
5302  uint64_t ElementCount = 1;
5303  do {
5304  ElementCount *= CA->getSize().getZExtValue();
5305  CA = dyn_cast_or_null<ConstantArrayType>(
5307  } while (CA);
5308  return ElementCount;
5309 }
5310 
5311 /// getFloatingRank - Return a relative rank for floating point types.
5312 /// This routine will assert if passed a built-in type that isn't a float.
5314  if (const ComplexType *CT = T->getAs<ComplexType>())
5315  return getFloatingRank(CT->getElementType());
5316 
5317  assert(T->getAs<BuiltinType>() && "getFloatingRank(): not a floating type");
5318  switch (T->getAs<BuiltinType>()->getKind()) {
5319  default: llvm_unreachable("getFloatingRank(): not a floating type");
5320  case BuiltinType::Float16: return Float16Rank;
5321  case BuiltinType::Half: return HalfRank;
5322  case BuiltinType::Float: return FloatRank;
5323  case BuiltinType::Double: return DoubleRank;
5324  case BuiltinType::LongDouble: return LongDoubleRank;
5325  case BuiltinType::Float128: return Float128Rank;
5326  }
5327 }
5328 
5329 /// getFloatingTypeOfSizeWithinDomain - Returns a real floating
5330 /// point or a complex type (based on typeDomain/typeSize).
5331 /// 'typeDomain' is a real floating point or complex type.
5332 /// 'typeSize' is a real floating point or complex type.
5334  QualType Domain) const {
5335  FloatingRank EltRank = getFloatingRank(Size);
5336  if (Domain->isComplexType()) {
5337  switch (EltRank) {
5338  case Float16Rank:
5339  case HalfRank: llvm_unreachable("Complex half is not supported");
5340  case FloatRank: return FloatComplexTy;
5341  case DoubleRank: return DoubleComplexTy;
5342  case LongDoubleRank: return LongDoubleComplexTy;
5343  case Float128Rank: return Float128ComplexTy;
5344  }
5345  }
5346 
5347  assert(Domain->isRealFloatingType() && "Unknown domain!");
5348  switch (EltRank) {
5349  case Float16Rank: return HalfTy;
5350  case HalfRank: return HalfTy;
5351  case FloatRank: return FloatTy;
5352  case DoubleRank: return DoubleTy;
5353  case LongDoubleRank: return LongDoubleTy;
5354  case Float128Rank: return Float128Ty;
5355  }
5356  llvm_unreachable("getFloatingRank(): illegal value for rank");
5357 }
5358 
5359 /// getFloatingTypeOrder - Compare the rank of the two specified floating
5360 /// point types, ignoring the domain of the type (i.e. 'double' ==
5361 /// '_Complex double'). If LHS > RHS, return 1. If LHS == RHS, return 0. If
5362 /// LHS < RHS, return -1.
5364  FloatingRank LHSR = getFloatingRank(LHS);
5365  FloatingRank RHSR = getFloatingRank(RHS);
5366 
5367  if (LHSR == RHSR)
5368  return 0;
5369  if (LHSR > RHSR)
5370  return 1;
5371  return -1;
5372 }
5373 
5374 /// getIntegerRank - Return an integer conversion rank (C99 6.3.1.1p1). This
5375 /// routine will assert if passed a built-in type that isn't an integer or enum,
5376 /// or if it is not canonicalized.
5377 unsigned ASTContext::getIntegerRank(const Type *T) const {
5378  assert(T->isCanonicalUnqualified() && "T should be canonicalized");
5379 
5380  switch (cast<BuiltinType>(T)->getKind()) {
5381  default: llvm_unreachable("getIntegerRank(): not a built-in integer");
5382  case BuiltinType::Bool:
5383  return 1 + (getIntWidth(BoolTy) << 3);
5384  case BuiltinType::Char_S:
5385  case BuiltinType::Char_U:
5386  case BuiltinType::SChar:
5387  case BuiltinType::UChar:
5388  return 2 + (getIntWidth(CharTy) << 3);
5389  case BuiltinType::Short:
5390  case BuiltinType::UShort:
5391  return 3 + (getIntWidth(ShortTy) << 3);
5392  case BuiltinType::Int:
5393  case BuiltinType::UInt:
5394  return 4 + (getIntWidth(IntTy) << 3);
5395  case BuiltinType::Long:
5396  case BuiltinType::ULong:
5397  return 5 + (getIntWidth(LongTy) << 3);
5398  case BuiltinType::LongLong:
5399  case BuiltinType::ULongLong:
5400  return 6 + (getIntWidth(LongLongTy) << 3);
5401  case BuiltinType::Int128:
5402  case BuiltinType::UInt128:
5403  return 7 + (getIntWidth(Int128Ty) << 3);
5404  }
5405 }
5406 
5407 /// \brief Whether this is a promotable bitfield reference according
5408 /// to C99 6.3.1.1p2, bullet 2 (and GCC extensions).
5409 ///
5410 /// \returns the type this bit-field will promote to, or NULL if no
5411 /// promotion occurs.
5413  if (E->isTypeDependent() || E->isValueDependent())
5414  return QualType();
5415 
5416  // FIXME: We should not do this unless E->refersToBitField() is true. This
5417  // matters in C where getSourceBitField() will find bit-fields for various
5418  // cases where the source expression is not a bit-field designator.
5419 
5420  FieldDecl *Field = E->getSourceBitField(); // FIXME: conditional bit-fields?
5421  if (!Field)
5422  return QualType();
5423 
5424  QualType FT = Field->getType();
5425 
5426  uint64_t BitWidth = Field->getBitWidthValue(*this);
5427  uint64_t IntSize = getTypeSize(IntTy);
5428  // C++ [conv.prom]p5:
5429  // A prvalue for an integral bit-field can be converted to a prvalue of type
5430  // int if int can represent all the values of the bit-field; otherwise, it
5431  // can be converted to unsigned int if unsigned int can represent all the
5432  // values of the bit-field. If the bit-field is larger yet, no integral
5433  // promotion applies to it.
5434  // C11 6.3.1.1/2:
5435  // [For a bit-field of type _Bool, int, signed int, or unsigned int:]
5436  // If an int can represent all values of the original type (as restricted by
5437  // the width, for a bit-field), the value is converted to an int; otherwise,
5438  // it is converted to an unsigned int.
5439  //
5440  // FIXME: C does not permit promotion of a 'long : 3' bitfield to int.
5441  // We perform that promotion here to match GCC and C++.
5442  if (BitWidth < IntSize)
5443  return IntTy;
5444 
5445  if (BitWidth == IntSize)
5446  return FT->isSignedIntegerType() ? IntTy : UnsignedIntTy;
5447 
5448  // Types bigger than int are not subject to promotions, and therefore act
5449  // like the base type. GCC has some weird bugs in this area that we
5450  // deliberately do not follow (GCC follows a pre-standard resolution to
5451  // C's DR315 which treats bit-width as being part of the type, and this leaks
5452  // into their semantics in some cases).
5453  return QualType();
5454 }
5455 
5456 /// getPromotedIntegerType - Returns the type that Promotable will
5457 /// promote to: C99 6.3.1.1p2, assuming that Promotable is a promotable
5458 /// integer type.
5460  assert(!Promotable.isNull());