ASTContext.cpp revision 495c35d291da48c4f5655bbb54d15128ddde0d4d
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 "clang/AST/DeclCXX.h" 16#include "clang/AST/DeclObjC.h" 17#include "clang/AST/DeclTemplate.h" 18#include "clang/AST/TypeLoc.h" 19#include "clang/AST/Expr.h" 20#include "clang/AST/ExternalASTSource.h" 21#include "clang/AST/RecordLayout.h" 22#include "clang/Basic/Builtins.h" 23#include "clang/Basic/SourceManager.h" 24#include "clang/Basic/TargetInfo.h" 25#include "llvm/ADT/StringExtras.h" 26#include "llvm/Support/MathExtras.h" 27#include "llvm/Support/MemoryBuffer.h" 28#include "RecordLayoutBuilder.h" 29 30using namespace clang; 31 32enum FloatingRank { 33 FloatRank, DoubleRank, LongDoubleRank 34}; 35 36ASTContext::ASTContext(const LangOptions& LOpts, SourceManager &SM, 37 TargetInfo &t, 38 IdentifierTable &idents, SelectorTable &sels, 39 Builtin::Context &builtins, 40 bool FreeMem, unsigned size_reserve) : 41 GlobalNestedNameSpecifier(0), CFConstantStringTypeDecl(0), 42 ObjCFastEnumerationStateTypeDecl(0), FILEDecl(0), jmp_bufDecl(0), 43 sigjmp_bufDecl(0), SourceMgr(SM), LangOpts(LOpts), 44 LoadedExternalComments(false), FreeMemory(FreeMem), Target(t), 45 Idents(idents), Selectors(sels), 46 BuiltinInfo(builtins), ExternalSource(0), PrintingPolicy(LOpts) { 47 ObjCIdRedefinitionType = QualType(); 48 ObjCClassRedefinitionType = QualType(); 49 if (size_reserve > 0) Types.reserve(size_reserve); 50 TUDecl = TranslationUnitDecl::Create(*this); 51 InitBuiltinTypes(); 52} 53 54ASTContext::~ASTContext() { 55 // Deallocate all the types. 56 while (!Types.empty()) { 57 Types.back()->Destroy(*this); 58 Types.pop_back(); 59 } 60 61 { 62 llvm::DenseMap<const RecordDecl*, const ASTRecordLayout*>::iterator 63 I = ASTRecordLayouts.begin(), E = ASTRecordLayouts.end(); 64 while (I != E) { 65 ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second); 66 delete R; 67 } 68 } 69 70 { 71 llvm::DenseMap<const ObjCContainerDecl*, const ASTRecordLayout*>::iterator 72 I = ObjCLayouts.begin(), E = ObjCLayouts.end(); 73 while (I != E) { 74 ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second); 75 delete R; 76 } 77 } 78 79 // Destroy nested-name-specifiers. 80 for (llvm::FoldingSet<NestedNameSpecifier>::iterator 81 NNS = NestedNameSpecifiers.begin(), 82 NNSEnd = NestedNameSpecifiers.end(); 83 NNS != NNSEnd; 84 /* Increment in loop */) 85 (*NNS++).Destroy(*this); 86 87 if (GlobalNestedNameSpecifier) 88 GlobalNestedNameSpecifier->Destroy(*this); 89 90 TUDecl->Destroy(*this); 91} 92 93void 94ASTContext::setExternalSource(llvm::OwningPtr<ExternalASTSource> &Source) { 95 ExternalSource.reset(Source.take()); 96} 97 98void ASTContext::PrintStats() const { 99 fprintf(stderr, "*** AST Context Stats:\n"); 100 fprintf(stderr, " %d types total.\n", (int)Types.size()); 101 102 unsigned counts[] = { 103#define TYPE(Name, Parent) 0, 104#define ABSTRACT_TYPE(Name, Parent) 105#include "clang/AST/TypeNodes.def" 106 0 // Extra 107 }; 108 109 for (unsigned i = 0, e = Types.size(); i != e; ++i) { 110 Type *T = Types[i]; 111 counts[(unsigned)T->getTypeClass()]++; 112 } 113 114 unsigned Idx = 0; 115 unsigned TotalBytes = 0; 116#define TYPE(Name, Parent) \ 117 if (counts[Idx]) \ 118 fprintf(stderr, " %d %s types\n", (int)counts[Idx], #Name); \ 119 TotalBytes += counts[Idx] * sizeof(Name##Type); \ 120 ++Idx; 121#define ABSTRACT_TYPE(Name, Parent) 122#include "clang/AST/TypeNodes.def" 123 124 fprintf(stderr, "Total bytes = %d\n", int(TotalBytes)); 125 126 if (ExternalSource.get()) { 127 fprintf(stderr, "\n"); 128 ExternalSource->PrintStats(); 129 } 130} 131 132 133void ASTContext::InitBuiltinType(QualType &R, BuiltinType::Kind K) { 134 Types.push_back((R = QualType(new (*this,8) BuiltinType(K),0)).getTypePtr()); 135} 136 137void ASTContext::InitBuiltinTypes() { 138 assert(VoidTy.isNull() && "Context reinitialized?"); 139 140 // C99 6.2.5p19. 141 InitBuiltinType(VoidTy, BuiltinType::Void); 142 143 // C99 6.2.5p2. 144 InitBuiltinType(BoolTy, BuiltinType::Bool); 145 // C99 6.2.5p3. 146 if (LangOpts.CharIsSigned) 147 InitBuiltinType(CharTy, BuiltinType::Char_S); 148 else 149 InitBuiltinType(CharTy, BuiltinType::Char_U); 150 // C99 6.2.5p4. 151 InitBuiltinType(SignedCharTy, BuiltinType::SChar); 152 InitBuiltinType(ShortTy, BuiltinType::Short); 153 InitBuiltinType(IntTy, BuiltinType::Int); 154 InitBuiltinType(LongTy, BuiltinType::Long); 155 InitBuiltinType(LongLongTy, BuiltinType::LongLong); 156 157 // C99 6.2.5p6. 158 InitBuiltinType(UnsignedCharTy, BuiltinType::UChar); 159 InitBuiltinType(UnsignedShortTy, BuiltinType::UShort); 160 InitBuiltinType(UnsignedIntTy, BuiltinType::UInt); 161 InitBuiltinType(UnsignedLongTy, BuiltinType::ULong); 162 InitBuiltinType(UnsignedLongLongTy, BuiltinType::ULongLong); 163 164 // C99 6.2.5p10. 165 InitBuiltinType(FloatTy, BuiltinType::Float); 166 InitBuiltinType(DoubleTy, BuiltinType::Double); 167 InitBuiltinType(LongDoubleTy, BuiltinType::LongDouble); 168 169 // GNU extension, 128-bit integers. 170 InitBuiltinType(Int128Ty, BuiltinType::Int128); 171 InitBuiltinType(UnsignedInt128Ty, BuiltinType::UInt128); 172 173 if (LangOpts.CPlusPlus) // C++ 3.9.1p5 174 InitBuiltinType(WCharTy, BuiltinType::WChar); 175 else // C99 176 WCharTy = getFromTargetType(Target.getWCharType()); 177 178 if (LangOpts.CPlusPlus) // C++0x 3.9.1p5, extension for C++ 179 InitBuiltinType(Char16Ty, BuiltinType::Char16); 180 else // C99 181 Char16Ty = getFromTargetType(Target.getChar16Type()); 182 183 if (LangOpts.CPlusPlus) // C++0x 3.9.1p5, extension for C++ 184 InitBuiltinType(Char32Ty, BuiltinType::Char32); 185 else // C99 186 Char32Ty = getFromTargetType(Target.getChar32Type()); 187 188 // Placeholder type for functions. 189 InitBuiltinType(OverloadTy, BuiltinType::Overload); 190 191 // Placeholder type for type-dependent expressions whose type is 192 // completely unknown. No code should ever check a type against 193 // DependentTy and users should never see it; however, it is here to 194 // help diagnose failures to properly check for type-dependent 195 // expressions. 196 InitBuiltinType(DependentTy, BuiltinType::Dependent); 197 198 // Placeholder type for C++0x auto declarations whose real type has 199 // not yet been deduced. 200 InitBuiltinType(UndeducedAutoTy, BuiltinType::UndeducedAuto); 201 202 // C99 6.2.5p11. 203 FloatComplexTy = getComplexType(FloatTy); 204 DoubleComplexTy = getComplexType(DoubleTy); 205 LongDoubleComplexTy = getComplexType(LongDoubleTy); 206 207 BuiltinVaListType = QualType(); 208 209 // "Builtin" typedefs set by Sema::ActOnTranslationUnitScope(). 210 ObjCIdTypedefType = QualType(); 211 ObjCClassTypedefType = QualType(); 212 213 // Builtin types for 'id' and 'Class'. 214 InitBuiltinType(ObjCBuiltinIdTy, BuiltinType::ObjCId); 215 InitBuiltinType(ObjCBuiltinClassTy, BuiltinType::ObjCClass); 216 217 ObjCConstantStringType = QualType(); 218 219 // void * type 220 VoidPtrTy = getPointerType(VoidTy); 221 222 // nullptr type (C++0x 2.14.7) 223 InitBuiltinType(NullPtrTy, BuiltinType::NullPtr); 224} 225 226VarDecl *ASTContext::getInstantiatedFromStaticDataMember(VarDecl *Var) { 227 assert(Var->isStaticDataMember() && "Not a static data member"); 228 llvm::DenseMap<VarDecl *, VarDecl *>::iterator Pos 229 = InstantiatedFromStaticDataMember.find(Var); 230 if (Pos == InstantiatedFromStaticDataMember.end()) 231 return 0; 232 233 return Pos->second; 234} 235 236void 237ASTContext::setInstantiatedFromStaticDataMember(VarDecl *Inst, VarDecl *Tmpl) { 238 assert(Inst->isStaticDataMember() && "Not a static data member"); 239 assert(Tmpl->isStaticDataMember() && "Not a static data member"); 240 assert(!InstantiatedFromStaticDataMember[Inst] && 241 "Already noted what static data member was instantiated from"); 242 InstantiatedFromStaticDataMember[Inst] = Tmpl; 243} 244 245namespace { 246 class BeforeInTranslationUnit 247 : std::binary_function<SourceRange, SourceRange, bool> { 248 SourceManager *SourceMgr; 249 250 public: 251 explicit BeforeInTranslationUnit(SourceManager *SM) : SourceMgr(SM) { } 252 253 bool operator()(SourceRange X, SourceRange Y) { 254 return SourceMgr->isBeforeInTranslationUnit(X.getBegin(), Y.getBegin()); 255 } 256 }; 257} 258 259/// \brief Determine whether the given comment is a Doxygen-style comment. 260/// 261/// \param Start the start of the comment text. 262/// 263/// \param End the end of the comment text. 264/// 265/// \param Member whether we want to check whether this is a member comment 266/// (which requires a < after the Doxygen-comment delimiter). Otherwise, 267/// we only return true when we find a non-member comment. 268static bool 269isDoxygenComment(SourceManager &SourceMgr, SourceRange Comment, 270 bool Member = false) { 271 const char *BufferStart 272 = SourceMgr.getBufferData(SourceMgr.getFileID(Comment.getBegin())).first; 273 const char *Start = BufferStart + SourceMgr.getFileOffset(Comment.getBegin()); 274 const char* End = BufferStart + SourceMgr.getFileOffset(Comment.getEnd()); 275 276 if (End - Start < 4) 277 return false; 278 279 assert(Start[0] == '/' && "Not a comment?"); 280 if (Start[1] == '*' && !(Start[2] == '!' || Start[2] == '*')) 281 return false; 282 if (Start[1] == '/' && !(Start[2] == '!' || Start[2] == '/')) 283 return false; 284 285 return (Start[3] == '<') == Member; 286} 287 288/// \brief Retrieve the comment associated with the given declaration, if 289/// it has one. 290const char *ASTContext::getCommentForDecl(const Decl *D) { 291 if (!D) 292 return 0; 293 294 // Check whether we have cached a comment string for this declaration 295 // already. 296 llvm::DenseMap<const Decl *, std::string>::iterator Pos 297 = DeclComments.find(D); 298 if (Pos != DeclComments.end()) 299 return Pos->second.c_str(); 300 301 // If we have an external AST source and have not yet loaded comments from 302 // that source, do so now. 303 if (ExternalSource && !LoadedExternalComments) { 304 std::vector<SourceRange> LoadedComments; 305 ExternalSource->ReadComments(LoadedComments); 306 307 if (!LoadedComments.empty()) 308 Comments.insert(Comments.begin(), LoadedComments.begin(), 309 LoadedComments.end()); 310 311 LoadedExternalComments = true; 312 } 313 314 // If there are no comments anywhere, we won't find anything. 315 if (Comments.empty()) 316 return 0; 317 318 // If the declaration doesn't map directly to a location in a file, we 319 // can't find the comment. 320 SourceLocation DeclStartLoc = D->getLocStart(); 321 if (DeclStartLoc.isInvalid() || !DeclStartLoc.isFileID()) 322 return 0; 323 324 // Find the comment that occurs just before this declaration. 325 std::vector<SourceRange>::iterator LastComment 326 = std::lower_bound(Comments.begin(), Comments.end(), 327 SourceRange(DeclStartLoc), 328 BeforeInTranslationUnit(&SourceMgr)); 329 330 // Decompose the location for the start of the declaration and find the 331 // beginning of the file buffer. 332 std::pair<FileID, unsigned> DeclStartDecomp 333 = SourceMgr.getDecomposedLoc(DeclStartLoc); 334 const char *FileBufferStart 335 = SourceMgr.getBufferData(DeclStartDecomp.first).first; 336 337 // First check whether we have a comment for a member. 338 if (LastComment != Comments.end() && 339 !isa<TagDecl>(D) && !isa<NamespaceDecl>(D) && 340 isDoxygenComment(SourceMgr, *LastComment, true)) { 341 std::pair<FileID, unsigned> LastCommentEndDecomp 342 = SourceMgr.getDecomposedLoc(LastComment->getEnd()); 343 if (DeclStartDecomp.first == LastCommentEndDecomp.first && 344 SourceMgr.getLineNumber(DeclStartDecomp.first, DeclStartDecomp.second) 345 == SourceMgr.getLineNumber(LastCommentEndDecomp.first, 346 LastCommentEndDecomp.second)) { 347 // The Doxygen member comment comes after the declaration starts and 348 // is on the same line and in the same file as the declaration. This 349 // is the comment we want. 350 std::string &Result = DeclComments[D]; 351 Result.append(FileBufferStart + 352 SourceMgr.getFileOffset(LastComment->getBegin()), 353 FileBufferStart + LastCommentEndDecomp.second + 1); 354 return Result.c_str(); 355 } 356 } 357 358 if (LastComment == Comments.begin()) 359 return 0; 360 --LastComment; 361 362 // Decompose the end of the comment. 363 std::pair<FileID, unsigned> LastCommentEndDecomp 364 = SourceMgr.getDecomposedLoc(LastComment->getEnd()); 365 366 // If the comment and the declaration aren't in the same file, then they 367 // aren't related. 368 if (DeclStartDecomp.first != LastCommentEndDecomp.first) 369 return 0; 370 371 // Check that we actually have a Doxygen comment. 372 if (!isDoxygenComment(SourceMgr, *LastComment)) 373 return 0; 374 375 // Compute the starting line for the declaration and for the end of the 376 // comment (this is expensive). 377 unsigned DeclStartLine 378 = SourceMgr.getLineNumber(DeclStartDecomp.first, DeclStartDecomp.second); 379 unsigned CommentEndLine 380 = SourceMgr.getLineNumber(LastCommentEndDecomp.first, 381 LastCommentEndDecomp.second); 382 383 // If the comment does not end on the line prior to the declaration, then 384 // the comment is not associated with the declaration at all. 385 if (CommentEndLine + 1 != DeclStartLine) 386 return 0; 387 388 // We have a comment, but there may be more comments on the previous lines. 389 // Keep looking so long as the comments are still Doxygen comments and are 390 // still adjacent. 391 unsigned ExpectedLine 392 = SourceMgr.getSpellingLineNumber(LastComment->getBegin()) - 1; 393 std::vector<SourceRange>::iterator FirstComment = LastComment; 394 while (FirstComment != Comments.begin()) { 395 // Look at the previous comment 396 --FirstComment; 397 std::pair<FileID, unsigned> Decomp 398 = SourceMgr.getDecomposedLoc(FirstComment->getEnd()); 399 400 // If this previous comment is in a different file, we're done. 401 if (Decomp.first != DeclStartDecomp.first) { 402 ++FirstComment; 403 break; 404 } 405 406 // If this comment is not a Doxygen comment, we're done. 407 if (!isDoxygenComment(SourceMgr, *FirstComment)) { 408 ++FirstComment; 409 break; 410 } 411 412 // If the line number is not what we expected, we're done. 413 unsigned Line = SourceMgr.getLineNumber(Decomp.first, Decomp.second); 414 if (Line != ExpectedLine) { 415 ++FirstComment; 416 break; 417 } 418 419 // Set the next expected line number. 420 ExpectedLine 421 = SourceMgr.getSpellingLineNumber(FirstComment->getBegin()) - 1; 422 } 423 424 // The iterator range [FirstComment, LastComment] contains all of the 425 // BCPL comments that, together, are associated with this declaration. 426 // Form a single comment block string for this declaration that concatenates 427 // all of these comments. 428 std::string &Result = DeclComments[D]; 429 while (FirstComment != LastComment) { 430 std::pair<FileID, unsigned> DecompStart 431 = SourceMgr.getDecomposedLoc(FirstComment->getBegin()); 432 std::pair<FileID, unsigned> DecompEnd 433 = SourceMgr.getDecomposedLoc(FirstComment->getEnd()); 434 Result.append(FileBufferStart + DecompStart.second, 435 FileBufferStart + DecompEnd.second + 1); 436 ++FirstComment; 437 } 438 439 // Append the last comment line. 440 Result.append(FileBufferStart + 441 SourceMgr.getFileOffset(LastComment->getBegin()), 442 FileBufferStart + LastCommentEndDecomp.second + 1); 443 return Result.c_str(); 444} 445 446//===----------------------------------------------------------------------===// 447// Type Sizing and Analysis 448//===----------------------------------------------------------------------===// 449 450/// getFloatTypeSemantics - Return the APFloat 'semantics' for the specified 451/// scalar floating point type. 452const llvm::fltSemantics &ASTContext::getFloatTypeSemantics(QualType T) const { 453 const BuiltinType *BT = T->getAsBuiltinType(); 454 assert(BT && "Not a floating point type!"); 455 switch (BT->getKind()) { 456 default: assert(0 && "Not a floating point type!"); 457 case BuiltinType::Float: return Target.getFloatFormat(); 458 case BuiltinType::Double: return Target.getDoubleFormat(); 459 case BuiltinType::LongDouble: return Target.getLongDoubleFormat(); 460 } 461} 462 463/// getDeclAlign - Return a conservative estimate of the alignment of the 464/// specified decl. Note that bitfields do not have a valid alignment, so 465/// this method will assert on them. 466unsigned ASTContext::getDeclAlignInBytes(const Decl *D) { 467 unsigned Align = Target.getCharWidth(); 468 469 if (const AlignedAttr* AA = D->getAttr<AlignedAttr>()) 470 Align = std::max(Align, AA->getAlignment()); 471 472 if (const ValueDecl *VD = dyn_cast<ValueDecl>(D)) { 473 QualType T = VD->getType(); 474 if (const ReferenceType* RT = T->getAs<ReferenceType>()) { 475 unsigned AS = RT->getPointeeType().getAddressSpace(); 476 Align = Target.getPointerAlign(AS); 477 } else if (!T->isIncompleteType() && !T->isFunctionType()) { 478 // Incomplete or function types default to 1. 479 while (isa<VariableArrayType>(T) || isa<IncompleteArrayType>(T)) 480 T = cast<ArrayType>(T)->getElementType(); 481 482 Align = std::max(Align, getPreferredTypeAlign(T.getTypePtr())); 483 } 484 } 485 486 return Align / Target.getCharWidth(); 487} 488 489/// getTypeSize - Return the size of the specified type, in bits. This method 490/// does not work on incomplete types. 491std::pair<uint64_t, unsigned> 492ASTContext::getTypeInfo(const Type *T) { 493 uint64_t Width=0; 494 unsigned Align=8; 495 switch (T->getTypeClass()) { 496#define TYPE(Class, Base) 497#define ABSTRACT_TYPE(Class, Base) 498#define NON_CANONICAL_TYPE(Class, Base) 499#define DEPENDENT_TYPE(Class, Base) case Type::Class: 500#include "clang/AST/TypeNodes.def" 501 assert(false && "Should not see dependent types"); 502 break; 503 504 case Type::FunctionNoProto: 505 case Type::FunctionProto: 506 // GCC extension: alignof(function) = 32 bits 507 Width = 0; 508 Align = 32; 509 break; 510 511 case Type::IncompleteArray: 512 case Type::VariableArray: 513 Width = 0; 514 Align = getTypeAlign(cast<ArrayType>(T)->getElementType()); 515 break; 516 517 case Type::ConstantArrayWithExpr: 518 case Type::ConstantArrayWithoutExpr: 519 case Type::ConstantArray: { 520 const ConstantArrayType *CAT = cast<ConstantArrayType>(T); 521 522 std::pair<uint64_t, unsigned> EltInfo = getTypeInfo(CAT->getElementType()); 523 Width = EltInfo.first*CAT->getSize().getZExtValue(); 524 Align = EltInfo.second; 525 break; 526 } 527 case Type::ExtVector: 528 case Type::Vector: { 529 std::pair<uint64_t, unsigned> EltInfo = 530 getTypeInfo(cast<VectorType>(T)->getElementType()); 531 Width = EltInfo.first*cast<VectorType>(T)->getNumElements(); 532 Align = Width; 533 // If the alignment is not a power of 2, round up to the next power of 2. 534 // This happens for non-power-of-2 length vectors. 535 // FIXME: this should probably be a target property. 536 Align = 1 << llvm::Log2_32_Ceil(Align); 537 break; 538 } 539 540 case Type::Builtin: 541 switch (cast<BuiltinType>(T)->getKind()) { 542 default: assert(0 && "Unknown builtin type!"); 543 case BuiltinType::Void: 544 // GCC extension: alignof(void) = 8 bits. 545 Width = 0; 546 Align = 8; 547 break; 548 549 case BuiltinType::Bool: 550 Width = Target.getBoolWidth(); 551 Align = Target.getBoolAlign(); 552 break; 553 case BuiltinType::Char_S: 554 case BuiltinType::Char_U: 555 case BuiltinType::UChar: 556 case BuiltinType::SChar: 557 Width = Target.getCharWidth(); 558 Align = Target.getCharAlign(); 559 break; 560 case BuiltinType::WChar: 561 Width = Target.getWCharWidth(); 562 Align = Target.getWCharAlign(); 563 break; 564 case BuiltinType::Char16: 565 Width = Target.getChar16Width(); 566 Align = Target.getChar16Align(); 567 break; 568 case BuiltinType::Char32: 569 Width = Target.getChar32Width(); 570 Align = Target.getChar32Align(); 571 break; 572 case BuiltinType::UShort: 573 case BuiltinType::Short: 574 Width = Target.getShortWidth(); 575 Align = Target.getShortAlign(); 576 break; 577 case BuiltinType::UInt: 578 case BuiltinType::Int: 579 Width = Target.getIntWidth(); 580 Align = Target.getIntAlign(); 581 break; 582 case BuiltinType::ULong: 583 case BuiltinType::Long: 584 Width = Target.getLongWidth(); 585 Align = Target.getLongAlign(); 586 break; 587 case BuiltinType::ULongLong: 588 case BuiltinType::LongLong: 589 Width = Target.getLongLongWidth(); 590 Align = Target.getLongLongAlign(); 591 break; 592 case BuiltinType::Int128: 593 case BuiltinType::UInt128: 594 Width = 128; 595 Align = 128; // int128_t is 128-bit aligned on all targets. 596 break; 597 case BuiltinType::Float: 598 Width = Target.getFloatWidth(); 599 Align = Target.getFloatAlign(); 600 break; 601 case BuiltinType::Double: 602 Width = Target.getDoubleWidth(); 603 Align = Target.getDoubleAlign(); 604 break; 605 case BuiltinType::LongDouble: 606 Width = Target.getLongDoubleWidth(); 607 Align = Target.getLongDoubleAlign(); 608 break; 609 case BuiltinType::NullPtr: 610 Width = Target.getPointerWidth(0); // C++ 3.9.1p11: sizeof(nullptr_t) 611 Align = Target.getPointerAlign(0); // == sizeof(void*) 612 break; 613 } 614 break; 615 case Type::FixedWidthInt: 616 // FIXME: This isn't precisely correct; the width/alignment should depend 617 // on the available types for the target 618 Width = cast<FixedWidthIntType>(T)->getWidth(); 619 Width = std::max(llvm::NextPowerOf2(Width - 1), (uint64_t)8); 620 Align = Width; 621 break; 622 case Type::ExtQual: 623 // FIXME: Pointers into different addr spaces could have different sizes and 624 // alignment requirements: getPointerInfo should take an AddrSpace. 625 return getTypeInfo(QualType(cast<ExtQualType>(T)->getBaseType(), 0)); 626 case Type::ObjCObjectPointer: 627 Width = Target.getPointerWidth(0); 628 Align = Target.getPointerAlign(0); 629 break; 630 case Type::BlockPointer: { 631 unsigned AS = cast<BlockPointerType>(T)->getPointeeType().getAddressSpace(); 632 Width = Target.getPointerWidth(AS); 633 Align = Target.getPointerAlign(AS); 634 break; 635 } 636 case Type::Pointer: { 637 unsigned AS = cast<PointerType>(T)->getPointeeType().getAddressSpace(); 638 Width = Target.getPointerWidth(AS); 639 Align = Target.getPointerAlign(AS); 640 break; 641 } 642 case Type::LValueReference: 643 case Type::RValueReference: 644 // "When applied to a reference or a reference type, the result is the size 645 // of the referenced type." C++98 5.3.3p2: expr.sizeof. 646 // FIXME: This is wrong for struct layout: a reference in a struct has 647 // pointer size. 648 return getTypeInfo(cast<ReferenceType>(T)->getPointeeType()); 649 case Type::MemberPointer: { 650 // FIXME: This is ABI dependent. We use the Itanium C++ ABI. 651 // http://www.codesourcery.com/public/cxx-abi/abi.html#member-pointers 652 // If we ever want to support other ABIs this needs to be abstracted. 653 654 QualType Pointee = cast<MemberPointerType>(T)->getPointeeType(); 655 std::pair<uint64_t, unsigned> PtrDiffInfo = 656 getTypeInfo(getPointerDiffType()); 657 Width = PtrDiffInfo.first; 658 if (Pointee->isFunctionType()) 659 Width *= 2; 660 Align = PtrDiffInfo.second; 661 break; 662 } 663 case Type::Complex: { 664 // Complex types have the same alignment as their elements, but twice the 665 // size. 666 std::pair<uint64_t, unsigned> EltInfo = 667 getTypeInfo(cast<ComplexType>(T)->getElementType()); 668 Width = EltInfo.first*2; 669 Align = EltInfo.second; 670 break; 671 } 672 case Type::ObjCInterface: { 673 const ObjCInterfaceType *ObjCI = cast<ObjCInterfaceType>(T); 674 const ASTRecordLayout &Layout = getASTObjCInterfaceLayout(ObjCI->getDecl()); 675 Width = Layout.getSize(); 676 Align = Layout.getAlignment(); 677 break; 678 } 679 case Type::Record: 680 case Type::Enum: { 681 const TagType *TT = cast<TagType>(T); 682 683 if (TT->getDecl()->isInvalidDecl()) { 684 Width = 1; 685 Align = 1; 686 break; 687 } 688 689 if (const EnumType *ET = dyn_cast<EnumType>(TT)) 690 return getTypeInfo(ET->getDecl()->getIntegerType()); 691 692 const RecordType *RT = cast<RecordType>(TT); 693 const ASTRecordLayout &Layout = getASTRecordLayout(RT->getDecl()); 694 Width = Layout.getSize(); 695 Align = Layout.getAlignment(); 696 break; 697 } 698 699 case Type::Typedef: { 700 const TypedefDecl *Typedef = cast<TypedefType>(T)->getDecl(); 701 if (const AlignedAttr *Aligned = Typedef->getAttr<AlignedAttr>()) { 702 Align = Aligned->getAlignment(); 703 Width = getTypeSize(Typedef->getUnderlyingType().getTypePtr()); 704 } else 705 return getTypeInfo(Typedef->getUnderlyingType().getTypePtr()); 706 break; 707 } 708 709 case Type::TypeOfExpr: 710 return getTypeInfo(cast<TypeOfExprType>(T)->getUnderlyingExpr()->getType() 711 .getTypePtr()); 712 713 case Type::TypeOf: 714 return getTypeInfo(cast<TypeOfType>(T)->getUnderlyingType().getTypePtr()); 715 716 case Type::Decltype: 717 return getTypeInfo(cast<DecltypeType>(T)->getUnderlyingExpr()->getType() 718 .getTypePtr()); 719 720 case Type::QualifiedName: 721 return getTypeInfo(cast<QualifiedNameType>(T)->getNamedType().getTypePtr()); 722 723 case Type::TemplateSpecialization: 724 assert(getCanonicalType(T) != T && 725 "Cannot request the size of a dependent type"); 726 // FIXME: this is likely to be wrong once we support template 727 // aliases, since a template alias could refer to a typedef that 728 // has an __aligned__ attribute on it. 729 return getTypeInfo(getCanonicalType(T)); 730 } 731 732 assert(Align && (Align & (Align-1)) == 0 && "Alignment must be power of 2"); 733 return std::make_pair(Width, Align); 734} 735 736/// getPreferredTypeAlign - Return the "preferred" alignment of the specified 737/// type for the current target in bits. This can be different than the ABI 738/// alignment in cases where it is beneficial for performance to overalign 739/// a data type. 740unsigned ASTContext::getPreferredTypeAlign(const Type *T) { 741 unsigned ABIAlign = getTypeAlign(T); 742 743 // Double and long long should be naturally aligned if possible. 744 if (const ComplexType* CT = T->getAsComplexType()) 745 T = CT->getElementType().getTypePtr(); 746 if (T->isSpecificBuiltinType(BuiltinType::Double) || 747 T->isSpecificBuiltinType(BuiltinType::LongLong)) 748 return std::max(ABIAlign, (unsigned)getTypeSize(T)); 749 750 return ABIAlign; 751} 752 753static void CollectLocalObjCIvars(ASTContext *Ctx, 754 const ObjCInterfaceDecl *OI, 755 llvm::SmallVectorImpl<FieldDecl*> &Fields) { 756 for (ObjCInterfaceDecl::ivar_iterator I = OI->ivar_begin(), 757 E = OI->ivar_end(); I != E; ++I) { 758 ObjCIvarDecl *IVDecl = *I; 759 if (!IVDecl->isInvalidDecl()) 760 Fields.push_back(cast<FieldDecl>(IVDecl)); 761 } 762} 763 764void ASTContext::CollectObjCIvars(const ObjCInterfaceDecl *OI, 765 llvm::SmallVectorImpl<FieldDecl*> &Fields) { 766 if (const ObjCInterfaceDecl *SuperClass = OI->getSuperClass()) 767 CollectObjCIvars(SuperClass, Fields); 768 CollectLocalObjCIvars(this, OI, Fields); 769} 770 771/// ShallowCollectObjCIvars - 772/// Collect all ivars, including those synthesized, in the current class. 773/// 774void ASTContext::ShallowCollectObjCIvars(const ObjCInterfaceDecl *OI, 775 llvm::SmallVectorImpl<ObjCIvarDecl*> &Ivars, 776 bool CollectSynthesized) { 777 for (ObjCInterfaceDecl::ivar_iterator I = OI->ivar_begin(), 778 E = OI->ivar_end(); I != E; ++I) { 779 Ivars.push_back(*I); 780 } 781 if (CollectSynthesized) 782 CollectSynthesizedIvars(OI, Ivars); 783} 784 785void ASTContext::CollectProtocolSynthesizedIvars(const ObjCProtocolDecl *PD, 786 llvm::SmallVectorImpl<ObjCIvarDecl*> &Ivars) { 787 for (ObjCContainerDecl::prop_iterator I = PD->prop_begin(), 788 E = PD->prop_end(); I != E; ++I) 789 if (ObjCIvarDecl *Ivar = (*I)->getPropertyIvarDecl()) 790 Ivars.push_back(Ivar); 791 792 // Also look into nested protocols. 793 for (ObjCProtocolDecl::protocol_iterator P = PD->protocol_begin(), 794 E = PD->protocol_end(); P != E; ++P) 795 CollectProtocolSynthesizedIvars(*P, Ivars); 796} 797 798/// CollectSynthesizedIvars - 799/// This routine collect synthesized ivars for the designated class. 800/// 801void ASTContext::CollectSynthesizedIvars(const ObjCInterfaceDecl *OI, 802 llvm::SmallVectorImpl<ObjCIvarDecl*> &Ivars) { 803 for (ObjCInterfaceDecl::prop_iterator I = OI->prop_begin(), 804 E = OI->prop_end(); I != E; ++I) { 805 if (ObjCIvarDecl *Ivar = (*I)->getPropertyIvarDecl()) 806 Ivars.push_back(Ivar); 807 } 808 // Also look into interface's protocol list for properties declared 809 // in the protocol and whose ivars are synthesized. 810 for (ObjCInterfaceDecl::protocol_iterator P = OI->protocol_begin(), 811 PE = OI->protocol_end(); P != PE; ++P) { 812 ObjCProtocolDecl *PD = (*P); 813 CollectProtocolSynthesizedIvars(PD, Ivars); 814 } 815} 816 817unsigned ASTContext::CountProtocolSynthesizedIvars(const ObjCProtocolDecl *PD) { 818 unsigned count = 0; 819 for (ObjCContainerDecl::prop_iterator I = PD->prop_begin(), 820 E = PD->prop_end(); I != E; ++I) 821 if ((*I)->getPropertyIvarDecl()) 822 ++count; 823 824 // Also look into nested protocols. 825 for (ObjCProtocolDecl::protocol_iterator P = PD->protocol_begin(), 826 E = PD->protocol_end(); P != E; ++P) 827 count += CountProtocolSynthesizedIvars(*P); 828 return count; 829} 830 831unsigned ASTContext::CountSynthesizedIvars(const ObjCInterfaceDecl *OI) 832{ 833 unsigned count = 0; 834 for (ObjCInterfaceDecl::prop_iterator I = OI->prop_begin(), 835 E = OI->prop_end(); I != E; ++I) { 836 if ((*I)->getPropertyIvarDecl()) 837 ++count; 838 } 839 // Also look into interface's protocol list for properties declared 840 // in the protocol and whose ivars are synthesized. 841 for (ObjCInterfaceDecl::protocol_iterator P = OI->protocol_begin(), 842 PE = OI->protocol_end(); P != PE; ++P) { 843 ObjCProtocolDecl *PD = (*P); 844 count += CountProtocolSynthesizedIvars(PD); 845 } 846 return count; 847} 848 849/// \brief Get the implementation of ObjCInterfaceDecl,or NULL if none exists. 850ObjCImplementationDecl *ASTContext::getObjCImplementation(ObjCInterfaceDecl *D) { 851 llvm::DenseMap<ObjCContainerDecl*, ObjCImplDecl*>::iterator 852 I = ObjCImpls.find(D); 853 if (I != ObjCImpls.end()) 854 return cast<ObjCImplementationDecl>(I->second); 855 return 0; 856} 857/// \brief Get the implementation of ObjCCategoryDecl, or NULL if none exists. 858ObjCCategoryImplDecl *ASTContext::getObjCImplementation(ObjCCategoryDecl *D) { 859 llvm::DenseMap<ObjCContainerDecl*, ObjCImplDecl*>::iterator 860 I = ObjCImpls.find(D); 861 if (I != ObjCImpls.end()) 862 return cast<ObjCCategoryImplDecl>(I->second); 863 return 0; 864} 865 866/// \brief Set the implementation of ObjCInterfaceDecl. 867void ASTContext::setObjCImplementation(ObjCInterfaceDecl *IFaceD, 868 ObjCImplementationDecl *ImplD) { 869 assert(IFaceD && ImplD && "Passed null params"); 870 ObjCImpls[IFaceD] = ImplD; 871} 872/// \brief Set the implementation of ObjCCategoryDecl. 873void ASTContext::setObjCImplementation(ObjCCategoryDecl *CatD, 874 ObjCCategoryImplDecl *ImplD) { 875 assert(CatD && ImplD && "Passed null params"); 876 ObjCImpls[CatD] = ImplD; 877} 878 879/// \brief Allocate an uninitialized DeclaratorInfo. 880/// 881/// The caller should initialize the memory held by DeclaratorInfo using 882/// the TypeLoc wrappers. 883/// 884/// \param T the type that will be the basis for type source info. This type 885/// should refer to how the declarator was written in source code, not to 886/// what type semantic analysis resolved the declarator to. 887DeclaratorInfo *ASTContext::CreateDeclaratorInfo(QualType T) { 888 unsigned DataSize = TypeLoc::getFullDataSizeForType(T); 889 DeclaratorInfo *DInfo = 890 (DeclaratorInfo*)BumpAlloc.Allocate(sizeof(DeclaratorInfo) + DataSize, 8); 891 new (DInfo) DeclaratorInfo(T); 892 return DInfo; 893} 894 895/// getInterfaceLayoutImpl - Get or compute information about the 896/// layout of the given interface. 897/// 898/// \param Impl - If given, also include the layout of the interface's 899/// implementation. This may differ by including synthesized ivars. 900const ASTRecordLayout & 901ASTContext::getObjCLayout(const ObjCInterfaceDecl *D, 902 const ObjCImplementationDecl *Impl) { 903 assert(!D->isForwardDecl() && "Invalid interface decl!"); 904 905 // Look up this layout, if already laid out, return what we have. 906 ObjCContainerDecl *Key = 907 Impl ? (ObjCContainerDecl*) Impl : (ObjCContainerDecl*) D; 908 if (const ASTRecordLayout *Entry = ObjCLayouts[Key]) 909 return *Entry; 910 911 // Add in synthesized ivar count if laying out an implementation. 912 if (Impl) { 913 unsigned FieldCount = D->ivar_size(); 914 unsigned SynthCount = CountSynthesizedIvars(D); 915 FieldCount += SynthCount; 916 // If there aren't any sythesized ivars then reuse the interface 917 // entry. Note we can't cache this because we simply free all 918 // entries later; however we shouldn't look up implementations 919 // frequently. 920 if (SynthCount == 0) 921 return getObjCLayout(D, 0); 922 } 923 924 const ASTRecordLayout *NewEntry = 925 ASTRecordLayoutBuilder::ComputeLayout(*this, D, Impl); 926 ObjCLayouts[Key] = NewEntry; 927 928 return *NewEntry; 929} 930 931const ASTRecordLayout & 932ASTContext::getASTObjCInterfaceLayout(const ObjCInterfaceDecl *D) { 933 return getObjCLayout(D, 0); 934} 935 936const ASTRecordLayout & 937ASTContext::getASTObjCImplementationLayout(const ObjCImplementationDecl *D) { 938 return getObjCLayout(D->getClassInterface(), D); 939} 940 941/// getASTRecordLayout - Get or compute information about the layout of the 942/// specified record (struct/union/class), which indicates its size and field 943/// position information. 944const ASTRecordLayout &ASTContext::getASTRecordLayout(const RecordDecl *D) { 945 D = D->getDefinition(*this); 946 assert(D && "Cannot get layout of forward declarations!"); 947 948 // Look up this layout, if already laid out, return what we have. 949 // Note that we can't save a reference to the entry because this function 950 // is recursive. 951 const ASTRecordLayout *Entry = ASTRecordLayouts[D]; 952 if (Entry) return *Entry; 953 954 const ASTRecordLayout *NewEntry = 955 ASTRecordLayoutBuilder::ComputeLayout(*this, D); 956 ASTRecordLayouts[D] = NewEntry; 957 958 return *NewEntry; 959} 960 961//===----------------------------------------------------------------------===// 962// Type creation/memoization methods 963//===----------------------------------------------------------------------===// 964 965QualType ASTContext::getAddrSpaceQualType(QualType T, unsigned AddressSpace) { 966 QualType CanT = getCanonicalType(T); 967 if (CanT.getAddressSpace() == AddressSpace) 968 return T; 969 970 // If we are composing extended qualifiers together, merge together into one 971 // ExtQualType node. 972 unsigned CVRQuals = T.getCVRQualifiers(); 973 QualType::GCAttrTypes GCAttr = QualType::GCNone; 974 Type *TypeNode = T.getTypePtr(); 975 976 if (ExtQualType *EQT = dyn_cast<ExtQualType>(TypeNode)) { 977 // If this type already has an address space specified, it cannot get 978 // another one. 979 assert(EQT->getAddressSpace() == 0 && 980 "Type cannot be in multiple addr spaces!"); 981 GCAttr = EQT->getObjCGCAttr(); 982 TypeNode = EQT->getBaseType(); 983 } 984 985 // Check if we've already instantiated this type. 986 llvm::FoldingSetNodeID ID; 987 ExtQualType::Profile(ID, TypeNode, AddressSpace, GCAttr); 988 void *InsertPos = 0; 989 if (ExtQualType *EXTQy = ExtQualTypes.FindNodeOrInsertPos(ID, InsertPos)) 990 return QualType(EXTQy, CVRQuals); 991 992 // If the base type isn't canonical, this won't be a canonical type either, 993 // so fill in the canonical type field. 994 QualType Canonical; 995 if (!TypeNode->isCanonical()) { 996 Canonical = getAddrSpaceQualType(CanT, AddressSpace); 997 998 // Update InsertPos, the previous call could have invalidated it. 999 ExtQualType *NewIP = ExtQualTypes.FindNodeOrInsertPos(ID, InsertPos); 1000 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1001 } 1002 ExtQualType *New = 1003 new (*this, 8) ExtQualType(TypeNode, Canonical, AddressSpace, GCAttr); 1004 ExtQualTypes.InsertNode(New, InsertPos); 1005 Types.push_back(New); 1006 return QualType(New, CVRQuals); 1007} 1008 1009QualType ASTContext::getObjCGCQualType(QualType T, 1010 QualType::GCAttrTypes GCAttr) { 1011 QualType CanT = getCanonicalType(T); 1012 if (CanT.getObjCGCAttr() == GCAttr) 1013 return T; 1014 1015 if (T->isPointerType()) { 1016 QualType Pointee = T->getAs<PointerType>()->getPointeeType(); 1017 if (Pointee->isAnyPointerType()) { 1018 QualType ResultType = getObjCGCQualType(Pointee, GCAttr); 1019 return getPointerType(ResultType); 1020 } 1021 } 1022 // If we are composing extended qualifiers together, merge together into one 1023 // ExtQualType node. 1024 unsigned CVRQuals = T.getCVRQualifiers(); 1025 Type *TypeNode = T.getTypePtr(); 1026 unsigned AddressSpace = 0; 1027 1028 if (ExtQualType *EQT = dyn_cast<ExtQualType>(TypeNode)) { 1029 // If this type already has an ObjCGC specified, it cannot get 1030 // another one. 1031 assert(EQT->getObjCGCAttr() == QualType::GCNone && 1032 "Type cannot have multiple ObjCGCs!"); 1033 AddressSpace = EQT->getAddressSpace(); 1034 TypeNode = EQT->getBaseType(); 1035 } 1036 1037 // Check if we've already instantiated an gc qual'd type of this type. 1038 llvm::FoldingSetNodeID ID; 1039 ExtQualType::Profile(ID, TypeNode, AddressSpace, GCAttr); 1040 void *InsertPos = 0; 1041 if (ExtQualType *EXTQy = ExtQualTypes.FindNodeOrInsertPos(ID, InsertPos)) 1042 return QualType(EXTQy, CVRQuals); 1043 1044 // If the base type isn't canonical, this won't be a canonical type either, 1045 // so fill in the canonical type field. 1046 // FIXME: Isn't this also not canonical if the base type is a array 1047 // or pointer type? I can't find any documentation for objc_gc, though... 1048 QualType Canonical; 1049 if (!T->isCanonical()) { 1050 Canonical = getObjCGCQualType(CanT, GCAttr); 1051 1052 // Update InsertPos, the previous call could have invalidated it. 1053 ExtQualType *NewIP = ExtQualTypes.FindNodeOrInsertPos(ID, InsertPos); 1054 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1055 } 1056 ExtQualType *New = 1057 new (*this, 8) ExtQualType(TypeNode, Canonical, AddressSpace, GCAttr); 1058 ExtQualTypes.InsertNode(New, InsertPos); 1059 Types.push_back(New); 1060 return QualType(New, CVRQuals); 1061} 1062 1063QualType ASTContext::getNoReturnType(QualType T) { 1064 QualifierSet qs; 1065 qs.strip(T); 1066 if (T->isPointerType()) { 1067 QualType Pointee = T->getAs<PointerType>()->getPointeeType(); 1068 QualType ResultType = getNoReturnType(Pointee); 1069 ResultType = getPointerType(ResultType); 1070 ResultType.setCVRQualifiers(T.getCVRQualifiers()); 1071 return qs.apply(ResultType, *this); 1072 } 1073 if (T->isBlockPointerType()) { 1074 QualType Pointee = T->getAs<BlockPointerType>()->getPointeeType(); 1075 QualType ResultType = getNoReturnType(Pointee); 1076 ResultType = getBlockPointerType(ResultType); 1077 ResultType.setCVRQualifiers(T.getCVRQualifiers()); 1078 return qs.apply(ResultType, *this); 1079 } 1080 if (!T->isFunctionType()) 1081 assert(0 && "can't noreturn qualify non-pointer to function or block type"); 1082 1083 if (const FunctionNoProtoType *F = T->getAsFunctionNoProtoType()) { 1084 return getFunctionNoProtoType(F->getResultType(), true); 1085 } 1086 const FunctionProtoType *F = T->getAsFunctionProtoType(); 1087 return getFunctionType(F->getResultType(), F->arg_type_begin(), 1088 F->getNumArgs(), F->isVariadic(), F->getTypeQuals(), 1089 F->hasExceptionSpec(), F->hasAnyExceptionSpec(), 1090 F->getNumExceptions(), F->exception_begin(), true); 1091} 1092 1093/// getComplexType - Return the uniqued reference to the type for a complex 1094/// number with the specified element type. 1095QualType ASTContext::getComplexType(QualType T) { 1096 // Unique pointers, to guarantee there is only one pointer of a particular 1097 // structure. 1098 llvm::FoldingSetNodeID ID; 1099 ComplexType::Profile(ID, T); 1100 1101 void *InsertPos = 0; 1102 if (ComplexType *CT = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos)) 1103 return QualType(CT, 0); 1104 1105 // If the pointee type isn't canonical, this won't be a canonical type either, 1106 // so fill in the canonical type field. 1107 QualType Canonical; 1108 if (!T->isCanonical()) { 1109 Canonical = getComplexType(getCanonicalType(T)); 1110 1111 // Get the new insert position for the node we care about. 1112 ComplexType *NewIP = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos); 1113 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1114 } 1115 ComplexType *New = new (*this,8) ComplexType(T, Canonical); 1116 Types.push_back(New); 1117 ComplexTypes.InsertNode(New, InsertPos); 1118 return QualType(New, 0); 1119} 1120 1121QualType ASTContext::getFixedWidthIntType(unsigned Width, bool Signed) { 1122 llvm::DenseMap<unsigned, FixedWidthIntType*> &Map = Signed ? 1123 SignedFixedWidthIntTypes : UnsignedFixedWidthIntTypes; 1124 FixedWidthIntType *&Entry = Map[Width]; 1125 if (!Entry) 1126 Entry = new FixedWidthIntType(Width, Signed); 1127 return QualType(Entry, 0); 1128} 1129 1130/// getPointerType - Return the uniqued reference to the type for a pointer to 1131/// the specified type. 1132QualType ASTContext::getPointerType(QualType T) { 1133 // Unique pointers, to guarantee there is only one pointer of a particular 1134 // structure. 1135 llvm::FoldingSetNodeID ID; 1136 PointerType::Profile(ID, T); 1137 1138 void *InsertPos = 0; 1139 if (PointerType *PT = PointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 1140 return QualType(PT, 0); 1141 1142 // If the pointee type isn't canonical, this won't be a canonical type either, 1143 // so fill in the canonical type field. 1144 QualType Canonical; 1145 if (!T->isCanonical()) { 1146 Canonical = getPointerType(getCanonicalType(T)); 1147 1148 // Get the new insert position for the node we care about. 1149 PointerType *NewIP = PointerTypes.FindNodeOrInsertPos(ID, InsertPos); 1150 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1151 } 1152 PointerType *New = new (*this,8) PointerType(T, Canonical); 1153 Types.push_back(New); 1154 PointerTypes.InsertNode(New, InsertPos); 1155 return QualType(New, 0); 1156} 1157 1158/// getBlockPointerType - Return the uniqued reference to the type for 1159/// a pointer to the specified block. 1160QualType ASTContext::getBlockPointerType(QualType T) { 1161 assert(T->isFunctionType() && "block of function types only"); 1162 // Unique pointers, to guarantee there is only one block of a particular 1163 // structure. 1164 llvm::FoldingSetNodeID ID; 1165 BlockPointerType::Profile(ID, T); 1166 1167 void *InsertPos = 0; 1168 if (BlockPointerType *PT = 1169 BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 1170 return QualType(PT, 0); 1171 1172 // If the block pointee type isn't canonical, this won't be a canonical 1173 // type either so fill in the canonical type field. 1174 QualType Canonical; 1175 if (!T->isCanonical()) { 1176 Canonical = getBlockPointerType(getCanonicalType(T)); 1177 1178 // Get the new insert position for the node we care about. 1179 BlockPointerType *NewIP = 1180 BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos); 1181 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1182 } 1183 BlockPointerType *New = new (*this,8) BlockPointerType(T, Canonical); 1184 Types.push_back(New); 1185 BlockPointerTypes.InsertNode(New, InsertPos); 1186 return QualType(New, 0); 1187} 1188 1189/// getLValueReferenceType - Return the uniqued reference to the type for an 1190/// lvalue reference to the specified type. 1191QualType ASTContext::getLValueReferenceType(QualType T) { 1192 // Unique pointers, to guarantee there is only one pointer of a particular 1193 // structure. 1194 llvm::FoldingSetNodeID ID; 1195 ReferenceType::Profile(ID, T); 1196 1197 void *InsertPos = 0; 1198 if (LValueReferenceType *RT = 1199 LValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos)) 1200 return QualType(RT, 0); 1201 1202 // If the referencee type isn't canonical, this won't be a canonical type 1203 // either, so fill in the canonical type field. 1204 QualType Canonical; 1205 if (!T->isCanonical()) { 1206 Canonical = getLValueReferenceType(getCanonicalType(T)); 1207 1208 // Get the new insert position for the node we care about. 1209 LValueReferenceType *NewIP = 1210 LValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos); 1211 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1212 } 1213 1214 LValueReferenceType *New = new (*this,8) LValueReferenceType(T, Canonical); 1215 Types.push_back(New); 1216 LValueReferenceTypes.InsertNode(New, InsertPos); 1217 return QualType(New, 0); 1218} 1219 1220/// getRValueReferenceType - Return the uniqued reference to the type for an 1221/// rvalue reference to the specified type. 1222QualType ASTContext::getRValueReferenceType(QualType T) { 1223 // Unique pointers, to guarantee there is only one pointer of a particular 1224 // structure. 1225 llvm::FoldingSetNodeID ID; 1226 ReferenceType::Profile(ID, T); 1227 1228 void *InsertPos = 0; 1229 if (RValueReferenceType *RT = 1230 RValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos)) 1231 return QualType(RT, 0); 1232 1233 // If the referencee type isn't canonical, this won't be a canonical type 1234 // either, so fill in the canonical type field. 1235 QualType Canonical; 1236 if (!T->isCanonical()) { 1237 Canonical = getRValueReferenceType(getCanonicalType(T)); 1238 1239 // Get the new insert position for the node we care about. 1240 RValueReferenceType *NewIP = 1241 RValueReferenceTypes.FindNodeOrInsertPos(ID, InsertPos); 1242 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1243 } 1244 1245 RValueReferenceType *New = new (*this,8) RValueReferenceType(T, Canonical); 1246 Types.push_back(New); 1247 RValueReferenceTypes.InsertNode(New, InsertPos); 1248 return QualType(New, 0); 1249} 1250 1251/// getMemberPointerType - Return the uniqued reference to the type for a 1252/// member pointer to the specified type, in the specified class. 1253QualType ASTContext::getMemberPointerType(QualType T, const Type *Cls) 1254{ 1255 // Unique pointers, to guarantee there is only one pointer of a particular 1256 // structure. 1257 llvm::FoldingSetNodeID ID; 1258 MemberPointerType::Profile(ID, T, Cls); 1259 1260 void *InsertPos = 0; 1261 if (MemberPointerType *PT = 1262 MemberPointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 1263 return QualType(PT, 0); 1264 1265 // If the pointee or class type isn't canonical, this won't be a canonical 1266 // type either, so fill in the canonical type field. 1267 QualType Canonical; 1268 if (!T->isCanonical()) { 1269 Canonical = getMemberPointerType(getCanonicalType(T),getCanonicalType(Cls)); 1270 1271 // Get the new insert position for the node we care about. 1272 MemberPointerType *NewIP = 1273 MemberPointerTypes.FindNodeOrInsertPos(ID, InsertPos); 1274 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1275 } 1276 MemberPointerType *New = new (*this,8) MemberPointerType(T, Cls, Canonical); 1277 Types.push_back(New); 1278 MemberPointerTypes.InsertNode(New, InsertPos); 1279 return QualType(New, 0); 1280} 1281 1282/// getConstantArrayType - Return the unique reference to the type for an 1283/// array of the specified element type. 1284QualType ASTContext::getConstantArrayType(QualType EltTy, 1285 const llvm::APInt &ArySizeIn, 1286 ArrayType::ArraySizeModifier ASM, 1287 unsigned EltTypeQuals) { 1288 assert((EltTy->isDependentType() || EltTy->isConstantSizeType()) && 1289 "Constant array of VLAs is illegal!"); 1290 1291 // Convert the array size into a canonical width matching the pointer size for 1292 // the target. 1293 llvm::APInt ArySize(ArySizeIn); 1294 ArySize.zextOrTrunc(Target.getPointerWidth(EltTy.getAddressSpace())); 1295 1296 llvm::FoldingSetNodeID ID; 1297 ConstantArrayType::Profile(ID, EltTy, ArySize, ASM, EltTypeQuals); 1298 1299 void *InsertPos = 0; 1300 if (ConstantArrayType *ATP = 1301 ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos)) 1302 return QualType(ATP, 0); 1303 1304 // If the element type isn't canonical, this won't be a canonical type either, 1305 // so fill in the canonical type field. 1306 QualType Canonical; 1307 if (!EltTy->isCanonical()) { 1308 Canonical = getConstantArrayType(getCanonicalType(EltTy), ArySize, 1309 ASM, EltTypeQuals); 1310 // Get the new insert position for the node we care about. 1311 ConstantArrayType *NewIP = 1312 ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos); 1313 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1314 } 1315 1316 ConstantArrayType *New = 1317 new(*this,8)ConstantArrayType(EltTy, Canonical, ArySize, ASM, EltTypeQuals); 1318 ConstantArrayTypes.InsertNode(New, InsertPos); 1319 Types.push_back(New); 1320 return QualType(New, 0); 1321} 1322 1323/// getConstantArrayWithExprType - Return a reference to the type for 1324/// an array of the specified element type. 1325QualType 1326ASTContext::getConstantArrayWithExprType(QualType EltTy, 1327 const llvm::APInt &ArySizeIn, 1328 Expr *ArySizeExpr, 1329 ArrayType::ArraySizeModifier ASM, 1330 unsigned EltTypeQuals, 1331 SourceRange Brackets) { 1332 // Convert the array size into a canonical width matching the pointer 1333 // size for the target. 1334 llvm::APInt ArySize(ArySizeIn); 1335 ArySize.zextOrTrunc(Target.getPointerWidth(EltTy.getAddressSpace())); 1336 1337 // Compute the canonical ConstantArrayType. 1338 QualType Canonical = getConstantArrayType(getCanonicalType(EltTy), 1339 ArySize, ASM, EltTypeQuals); 1340 // Since we don't unique expressions, it isn't possible to unique VLA's 1341 // that have an expression provided for their size. 1342 ConstantArrayWithExprType *New = 1343 new(*this,8)ConstantArrayWithExprType(EltTy, Canonical, 1344 ArySize, ArySizeExpr, 1345 ASM, EltTypeQuals, Brackets); 1346 Types.push_back(New); 1347 return QualType(New, 0); 1348} 1349 1350/// getConstantArrayWithoutExprType - Return a reference to the type for 1351/// an array of the specified element type. 1352QualType 1353ASTContext::getConstantArrayWithoutExprType(QualType EltTy, 1354 const llvm::APInt &ArySizeIn, 1355 ArrayType::ArraySizeModifier ASM, 1356 unsigned EltTypeQuals) { 1357 // Convert the array size into a canonical width matching the pointer 1358 // size for the target. 1359 llvm::APInt ArySize(ArySizeIn); 1360 ArySize.zextOrTrunc(Target.getPointerWidth(EltTy.getAddressSpace())); 1361 1362 // Compute the canonical ConstantArrayType. 1363 QualType Canonical = getConstantArrayType(getCanonicalType(EltTy), 1364 ArySize, ASM, EltTypeQuals); 1365 ConstantArrayWithoutExprType *New = 1366 new(*this,8)ConstantArrayWithoutExprType(EltTy, Canonical, 1367 ArySize, ASM, EltTypeQuals); 1368 Types.push_back(New); 1369 return QualType(New, 0); 1370} 1371 1372/// getVariableArrayType - Returns a non-unique reference to the type for a 1373/// variable array of the specified element type. 1374QualType ASTContext::getVariableArrayType(QualType EltTy, 1375 Expr *NumElts, 1376 ArrayType::ArraySizeModifier ASM, 1377 unsigned EltTypeQuals, 1378 SourceRange Brackets) { 1379 // Since we don't unique expressions, it isn't possible to unique VLA's 1380 // that have an expression provided for their size. 1381 1382 VariableArrayType *New = 1383 new(*this,8)VariableArrayType(EltTy, QualType(), 1384 NumElts, ASM, EltTypeQuals, Brackets); 1385 1386 VariableArrayTypes.push_back(New); 1387 Types.push_back(New); 1388 return QualType(New, 0); 1389} 1390 1391/// getDependentSizedArrayType - Returns a non-unique reference to 1392/// the type for a dependently-sized array of the specified element 1393/// type. 1394QualType ASTContext::getDependentSizedArrayType(QualType EltTy, 1395 Expr *NumElts, 1396 ArrayType::ArraySizeModifier ASM, 1397 unsigned EltTypeQuals, 1398 SourceRange Brackets) { 1399 assert((NumElts->isTypeDependent() || NumElts->isValueDependent()) && 1400 "Size must be type- or value-dependent!"); 1401 1402 llvm::FoldingSetNodeID ID; 1403 DependentSizedArrayType::Profile(ID, *this, getCanonicalType(EltTy), ASM, 1404 EltTypeQuals, NumElts); 1405 1406 void *InsertPos = 0; 1407 DependentSizedArrayType *Canon 1408 = DependentSizedArrayTypes.FindNodeOrInsertPos(ID, InsertPos); 1409 DependentSizedArrayType *New; 1410 if (Canon) { 1411 // We already have a canonical version of this array type; use it as 1412 // the canonical type for a newly-built type. 1413 New = new (*this,8) DependentSizedArrayType(*this, EltTy, 1414 QualType(Canon, 0), 1415 NumElts, ASM, EltTypeQuals, 1416 Brackets); 1417 } else { 1418 QualType CanonEltTy = getCanonicalType(EltTy); 1419 if (CanonEltTy == EltTy) { 1420 New = new (*this,8) DependentSizedArrayType(*this, EltTy, QualType(), 1421 NumElts, ASM, EltTypeQuals, 1422 Brackets); 1423 DependentSizedArrayTypes.InsertNode(New, InsertPos); 1424 } else { 1425 QualType Canon = getDependentSizedArrayType(CanonEltTy, NumElts, 1426 ASM, EltTypeQuals, 1427 SourceRange()); 1428 New = new (*this,8) DependentSizedArrayType(*this, EltTy, Canon, 1429 NumElts, ASM, EltTypeQuals, 1430 Brackets); 1431 } 1432 } 1433 1434 Types.push_back(New); 1435 return QualType(New, 0); 1436} 1437 1438QualType ASTContext::getIncompleteArrayType(QualType EltTy, 1439 ArrayType::ArraySizeModifier ASM, 1440 unsigned EltTypeQuals) { 1441 llvm::FoldingSetNodeID ID; 1442 IncompleteArrayType::Profile(ID, EltTy, ASM, EltTypeQuals); 1443 1444 void *InsertPos = 0; 1445 if (IncompleteArrayType *ATP = 1446 IncompleteArrayTypes.FindNodeOrInsertPos(ID, InsertPos)) 1447 return QualType(ATP, 0); 1448 1449 // If the element type isn't canonical, this won't be a canonical type 1450 // either, so fill in the canonical type field. 1451 QualType Canonical; 1452 1453 if (!EltTy->isCanonical()) { 1454 Canonical = getIncompleteArrayType(getCanonicalType(EltTy), 1455 ASM, EltTypeQuals); 1456 1457 // Get the new insert position for the node we care about. 1458 IncompleteArrayType *NewIP = 1459 IncompleteArrayTypes.FindNodeOrInsertPos(ID, InsertPos); 1460 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1461 } 1462 1463 IncompleteArrayType *New 1464 = new (*this,8) IncompleteArrayType(EltTy, Canonical, 1465 ASM, EltTypeQuals); 1466 1467 IncompleteArrayTypes.InsertNode(New, InsertPos); 1468 Types.push_back(New); 1469 return QualType(New, 0); 1470} 1471 1472/// getVectorType - Return the unique reference to a vector type of 1473/// the specified element type and size. VectorType must be a built-in type. 1474QualType ASTContext::getVectorType(QualType vecType, unsigned NumElts) { 1475 BuiltinType *baseType; 1476 1477 baseType = dyn_cast<BuiltinType>(getCanonicalType(vecType).getTypePtr()); 1478 assert(baseType != 0 && "getVectorType(): Expecting a built-in type"); 1479 1480 // Check if we've already instantiated a vector of this type. 1481 llvm::FoldingSetNodeID ID; 1482 VectorType::Profile(ID, vecType, NumElts, Type::Vector); 1483 void *InsertPos = 0; 1484 if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos)) 1485 return QualType(VTP, 0); 1486 1487 // If the element type isn't canonical, this won't be a canonical type either, 1488 // so fill in the canonical type field. 1489 QualType Canonical; 1490 if (!vecType->isCanonical()) { 1491 Canonical = getVectorType(getCanonicalType(vecType), NumElts); 1492 1493 // Get the new insert position for the node we care about. 1494 VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos); 1495 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1496 } 1497 VectorType *New = new (*this,8) VectorType(vecType, NumElts, Canonical); 1498 VectorTypes.InsertNode(New, InsertPos); 1499 Types.push_back(New); 1500 return QualType(New, 0); 1501} 1502 1503/// getExtVectorType - Return the unique reference to an extended vector type of 1504/// the specified element type and size. VectorType must be a built-in type. 1505QualType ASTContext::getExtVectorType(QualType vecType, unsigned NumElts) { 1506 BuiltinType *baseType; 1507 1508 baseType = dyn_cast<BuiltinType>(getCanonicalType(vecType).getTypePtr()); 1509 assert(baseType != 0 && "getExtVectorType(): Expecting a built-in type"); 1510 1511 // Check if we've already instantiated a vector of this type. 1512 llvm::FoldingSetNodeID ID; 1513 VectorType::Profile(ID, vecType, NumElts, Type::ExtVector); 1514 void *InsertPos = 0; 1515 if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos)) 1516 return QualType(VTP, 0); 1517 1518 // If the element type isn't canonical, this won't be a canonical type either, 1519 // so fill in the canonical type field. 1520 QualType Canonical; 1521 if (!vecType->isCanonical()) { 1522 Canonical = getExtVectorType(getCanonicalType(vecType), NumElts); 1523 1524 // Get the new insert position for the node we care about. 1525 VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos); 1526 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1527 } 1528 ExtVectorType *New = new (*this,8) ExtVectorType(vecType, NumElts, Canonical); 1529 VectorTypes.InsertNode(New, InsertPos); 1530 Types.push_back(New); 1531 return QualType(New, 0); 1532} 1533 1534QualType ASTContext::getDependentSizedExtVectorType(QualType vecType, 1535 Expr *SizeExpr, 1536 SourceLocation AttrLoc) { 1537 llvm::FoldingSetNodeID ID; 1538 DependentSizedExtVectorType::Profile(ID, *this, getCanonicalType(vecType), 1539 SizeExpr); 1540 1541 void *InsertPos = 0; 1542 DependentSizedExtVectorType *Canon 1543 = DependentSizedExtVectorTypes.FindNodeOrInsertPos(ID, InsertPos); 1544 DependentSizedExtVectorType *New; 1545 if (Canon) { 1546 // We already have a canonical version of this array type; use it as 1547 // the canonical type for a newly-built type. 1548 New = new (*this,8) DependentSizedExtVectorType(*this, vecType, 1549 QualType(Canon, 0), 1550 SizeExpr, AttrLoc); 1551 } else { 1552 QualType CanonVecTy = getCanonicalType(vecType); 1553 if (CanonVecTy == vecType) { 1554 New = new (*this,8) DependentSizedExtVectorType(*this, vecType, 1555 QualType(), SizeExpr, 1556 AttrLoc); 1557 DependentSizedExtVectorTypes.InsertNode(New, InsertPos); 1558 } else { 1559 QualType Canon = getDependentSizedExtVectorType(CanonVecTy, SizeExpr, 1560 SourceLocation()); 1561 New = new (*this,8) DependentSizedExtVectorType(*this, vecType, Canon, 1562 SizeExpr, AttrLoc); 1563 } 1564 } 1565 1566 Types.push_back(New); 1567 return QualType(New, 0); 1568} 1569 1570/// getFunctionNoProtoType - Return a K&R style C function type like 'int()'. 1571/// 1572QualType ASTContext::getFunctionNoProtoType(QualType ResultTy, bool NoReturn) { 1573 // Unique functions, to guarantee there is only one function of a particular 1574 // structure. 1575 llvm::FoldingSetNodeID ID; 1576 FunctionNoProtoType::Profile(ID, ResultTy, NoReturn); 1577 1578 void *InsertPos = 0; 1579 if (FunctionNoProtoType *FT = 1580 FunctionNoProtoTypes.FindNodeOrInsertPos(ID, InsertPos)) 1581 return QualType(FT, 0); 1582 1583 QualType Canonical; 1584 if (!ResultTy->isCanonical()) { 1585 Canonical = getFunctionNoProtoType(getCanonicalType(ResultTy), NoReturn); 1586 1587 // Get the new insert position for the node we care about. 1588 FunctionNoProtoType *NewIP = 1589 FunctionNoProtoTypes.FindNodeOrInsertPos(ID, InsertPos); 1590 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1591 } 1592 1593 FunctionNoProtoType *New 1594 = new (*this,8) FunctionNoProtoType(ResultTy, Canonical, NoReturn); 1595 Types.push_back(New); 1596 FunctionNoProtoTypes.InsertNode(New, InsertPos); 1597 return QualType(New, 0); 1598} 1599 1600/// getFunctionType - Return a normal function type with a typed argument 1601/// list. isVariadic indicates whether the argument list includes '...'. 1602QualType ASTContext::getFunctionType(QualType ResultTy,const QualType *ArgArray, 1603 unsigned NumArgs, bool isVariadic, 1604 unsigned TypeQuals, bool hasExceptionSpec, 1605 bool hasAnyExceptionSpec, unsigned NumExs, 1606 const QualType *ExArray, bool NoReturn) { 1607 // Unique functions, to guarantee there is only one function of a particular 1608 // structure. 1609 llvm::FoldingSetNodeID ID; 1610 FunctionProtoType::Profile(ID, ResultTy, ArgArray, NumArgs, isVariadic, 1611 TypeQuals, hasExceptionSpec, hasAnyExceptionSpec, 1612 NumExs, ExArray, NoReturn); 1613 1614 void *InsertPos = 0; 1615 if (FunctionProtoType *FTP = 1616 FunctionProtoTypes.FindNodeOrInsertPos(ID, InsertPos)) 1617 return QualType(FTP, 0); 1618 1619 // Determine whether the type being created is already canonical or not. 1620 bool isCanonical = ResultTy->isCanonical(); 1621 if (hasExceptionSpec) 1622 isCanonical = false; 1623 for (unsigned i = 0; i != NumArgs && isCanonical; ++i) 1624 if (!ArgArray[i]->isCanonical()) 1625 isCanonical = false; 1626 1627 // If this type isn't canonical, get the canonical version of it. 1628 // The exception spec is not part of the canonical type. 1629 QualType Canonical; 1630 if (!isCanonical) { 1631 llvm::SmallVector<QualType, 16> CanonicalArgs; 1632 CanonicalArgs.reserve(NumArgs); 1633 for (unsigned i = 0; i != NumArgs; ++i) 1634 CanonicalArgs.push_back(getCanonicalType(ArgArray[i])); 1635 1636 Canonical = getFunctionType(getCanonicalType(ResultTy), 1637 CanonicalArgs.data(), NumArgs, 1638 isVariadic, TypeQuals, false, 1639 false, 0, 0, NoReturn); 1640 1641 // Get the new insert position for the node we care about. 1642 FunctionProtoType *NewIP = 1643 FunctionProtoTypes.FindNodeOrInsertPos(ID, InsertPos); 1644 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1645 } 1646 1647 // FunctionProtoType objects are allocated with extra bytes after them 1648 // for two variable size arrays (for parameter and exception types) at the 1649 // end of them. 1650 FunctionProtoType *FTP = 1651 (FunctionProtoType*)Allocate(sizeof(FunctionProtoType) + 1652 NumArgs*sizeof(QualType) + 1653 NumExs*sizeof(QualType), 8); 1654 new (FTP) FunctionProtoType(ResultTy, ArgArray, NumArgs, isVariadic, 1655 TypeQuals, hasExceptionSpec, hasAnyExceptionSpec, 1656 ExArray, NumExs, Canonical, NoReturn); 1657 Types.push_back(FTP); 1658 FunctionProtoTypes.InsertNode(FTP, InsertPos); 1659 return QualType(FTP, 0); 1660} 1661 1662/// getTypeDeclType - Return the unique reference to the type for the 1663/// specified type declaration. 1664QualType ASTContext::getTypeDeclType(TypeDecl *Decl, TypeDecl* PrevDecl) { 1665 assert(Decl && "Passed null for Decl param"); 1666 if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0); 1667 1668 if (TypedefDecl *Typedef = dyn_cast<TypedefDecl>(Decl)) 1669 return getTypedefType(Typedef); 1670 else if (isa<TemplateTypeParmDecl>(Decl)) { 1671 assert(false && "Template type parameter types are always available."); 1672 } else if (ObjCInterfaceDecl *ObjCInterface 1673 = dyn_cast<ObjCInterfaceDecl>(Decl)) 1674 return getObjCInterfaceType(ObjCInterface); 1675 1676 if (RecordDecl *Record = dyn_cast<RecordDecl>(Decl)) { 1677 if (PrevDecl) 1678 Decl->TypeForDecl = PrevDecl->TypeForDecl; 1679 else 1680 Decl->TypeForDecl = new (*this,8) RecordType(Record); 1681 } else if (EnumDecl *Enum = dyn_cast<EnumDecl>(Decl)) { 1682 if (PrevDecl) 1683 Decl->TypeForDecl = PrevDecl->TypeForDecl; 1684 else 1685 Decl->TypeForDecl = new (*this,8) EnumType(Enum); 1686 } else 1687 assert(false && "TypeDecl without a type?"); 1688 1689 if (!PrevDecl) Types.push_back(Decl->TypeForDecl); 1690 return QualType(Decl->TypeForDecl, 0); 1691} 1692 1693/// getTypedefType - Return the unique reference to the type for the 1694/// specified typename decl. 1695QualType ASTContext::getTypedefType(TypedefDecl *Decl) { 1696 if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0); 1697 1698 QualType Canonical = getCanonicalType(Decl->getUnderlyingType()); 1699 Decl->TypeForDecl = new(*this,8) TypedefType(Type::Typedef, Decl, Canonical); 1700 Types.push_back(Decl->TypeForDecl); 1701 return QualType(Decl->TypeForDecl, 0); 1702} 1703 1704/// \brief Retrieve the template type parameter type for a template 1705/// parameter or parameter pack with the given depth, index, and (optionally) 1706/// name. 1707QualType ASTContext::getTemplateTypeParmType(unsigned Depth, unsigned Index, 1708 bool ParameterPack, 1709 IdentifierInfo *Name) { 1710 llvm::FoldingSetNodeID ID; 1711 TemplateTypeParmType::Profile(ID, Depth, Index, ParameterPack, Name); 1712 void *InsertPos = 0; 1713 TemplateTypeParmType *TypeParm 1714 = TemplateTypeParmTypes.FindNodeOrInsertPos(ID, InsertPos); 1715 1716 if (TypeParm) 1717 return QualType(TypeParm, 0); 1718 1719 if (Name) { 1720 QualType Canon = getTemplateTypeParmType(Depth, Index, ParameterPack); 1721 TypeParm = new (*this, 8) TemplateTypeParmType(Depth, Index, ParameterPack, 1722 Name, Canon); 1723 } else 1724 TypeParm = new (*this, 8) TemplateTypeParmType(Depth, Index, ParameterPack); 1725 1726 Types.push_back(TypeParm); 1727 TemplateTypeParmTypes.InsertNode(TypeParm, InsertPos); 1728 1729 return QualType(TypeParm, 0); 1730} 1731 1732QualType 1733ASTContext::getTemplateSpecializationType(TemplateName Template, 1734 const TemplateArgument *Args, 1735 unsigned NumArgs, 1736 QualType Canon) { 1737 if (!Canon.isNull()) 1738 Canon = getCanonicalType(Canon); 1739 else { 1740 // Build the canonical template specialization type. 1741 TemplateName CanonTemplate = getCanonicalTemplateName(Template); 1742 llvm::SmallVector<TemplateArgument, 4> CanonArgs; 1743 CanonArgs.reserve(NumArgs); 1744 for (unsigned I = 0; I != NumArgs; ++I) 1745 CanonArgs.push_back(getCanonicalTemplateArgument(Args[I])); 1746 1747 // Determine whether this canonical template specialization type already 1748 // exists. 1749 llvm::FoldingSetNodeID ID; 1750 TemplateSpecializationType::Profile(ID, CanonTemplate, 1751 CanonArgs.data(), NumArgs, *this); 1752 1753 void *InsertPos = 0; 1754 TemplateSpecializationType *Spec 1755 = TemplateSpecializationTypes.FindNodeOrInsertPos(ID, InsertPos); 1756 1757 if (!Spec) { 1758 // Allocate a new canonical template specialization type. 1759 void *Mem = Allocate((sizeof(TemplateSpecializationType) + 1760 sizeof(TemplateArgument) * NumArgs), 1761 8); 1762 Spec = new (Mem) TemplateSpecializationType(*this, CanonTemplate, 1763 CanonArgs.data(), NumArgs, 1764 Canon); 1765 Types.push_back(Spec); 1766 TemplateSpecializationTypes.InsertNode(Spec, InsertPos); 1767 } 1768 1769 if (Canon.isNull()) 1770 Canon = QualType(Spec, 0); 1771 assert(Canon->isDependentType() && 1772 "Non-dependent template-id type must have a canonical type"); 1773 } 1774 1775 // Allocate the (non-canonical) template specialization type, but don't 1776 // try to unique it: these types typically have location information that 1777 // we don't unique and don't want to lose. 1778 void *Mem = Allocate((sizeof(TemplateSpecializationType) + 1779 sizeof(TemplateArgument) * NumArgs), 1780 8); 1781 TemplateSpecializationType *Spec 1782 = new (Mem) TemplateSpecializationType(*this, Template, Args, NumArgs, 1783 Canon); 1784 1785 Types.push_back(Spec); 1786 return QualType(Spec, 0); 1787} 1788 1789QualType 1790ASTContext::getQualifiedNameType(NestedNameSpecifier *NNS, 1791 QualType NamedType) { 1792 llvm::FoldingSetNodeID ID; 1793 QualifiedNameType::Profile(ID, NNS, NamedType); 1794 1795 void *InsertPos = 0; 1796 QualifiedNameType *T 1797 = QualifiedNameTypes.FindNodeOrInsertPos(ID, InsertPos); 1798 if (T) 1799 return QualType(T, 0); 1800 1801 T = new (*this) QualifiedNameType(NNS, NamedType, 1802 getCanonicalType(NamedType)); 1803 Types.push_back(T); 1804 QualifiedNameTypes.InsertNode(T, InsertPos); 1805 return QualType(T, 0); 1806} 1807 1808QualType ASTContext::getTypenameType(NestedNameSpecifier *NNS, 1809 const IdentifierInfo *Name, 1810 QualType Canon) { 1811 assert(NNS->isDependent() && "nested-name-specifier must be dependent"); 1812 1813 if (Canon.isNull()) { 1814 NestedNameSpecifier *CanonNNS = getCanonicalNestedNameSpecifier(NNS); 1815 if (CanonNNS != NNS) 1816 Canon = getTypenameType(CanonNNS, Name); 1817 } 1818 1819 llvm::FoldingSetNodeID ID; 1820 TypenameType::Profile(ID, NNS, Name); 1821 1822 void *InsertPos = 0; 1823 TypenameType *T 1824 = TypenameTypes.FindNodeOrInsertPos(ID, InsertPos); 1825 if (T) 1826 return QualType(T, 0); 1827 1828 T = new (*this) TypenameType(NNS, Name, Canon); 1829 Types.push_back(T); 1830 TypenameTypes.InsertNode(T, InsertPos); 1831 return QualType(T, 0); 1832} 1833 1834QualType 1835ASTContext::getTypenameType(NestedNameSpecifier *NNS, 1836 const TemplateSpecializationType *TemplateId, 1837 QualType Canon) { 1838 assert(NNS->isDependent() && "nested-name-specifier must be dependent"); 1839 1840 if (Canon.isNull()) { 1841 NestedNameSpecifier *CanonNNS = getCanonicalNestedNameSpecifier(NNS); 1842 QualType CanonType = getCanonicalType(QualType(TemplateId, 0)); 1843 if (CanonNNS != NNS || CanonType != QualType(TemplateId, 0)) { 1844 const TemplateSpecializationType *CanonTemplateId 1845 = CanonType->getAsTemplateSpecializationType(); 1846 assert(CanonTemplateId && 1847 "Canonical type must also be a template specialization type"); 1848 Canon = getTypenameType(CanonNNS, CanonTemplateId); 1849 } 1850 } 1851 1852 llvm::FoldingSetNodeID ID; 1853 TypenameType::Profile(ID, NNS, TemplateId); 1854 1855 void *InsertPos = 0; 1856 TypenameType *T 1857 = TypenameTypes.FindNodeOrInsertPos(ID, InsertPos); 1858 if (T) 1859 return QualType(T, 0); 1860 1861 T = new (*this) TypenameType(NNS, TemplateId, Canon); 1862 Types.push_back(T); 1863 TypenameTypes.InsertNode(T, InsertPos); 1864 return QualType(T, 0); 1865} 1866 1867/// CmpProtocolNames - Comparison predicate for sorting protocols 1868/// alphabetically. 1869static bool CmpProtocolNames(const ObjCProtocolDecl *LHS, 1870 const ObjCProtocolDecl *RHS) { 1871 return LHS->getDeclName() < RHS->getDeclName(); 1872} 1873 1874static void SortAndUniqueProtocols(ObjCProtocolDecl **&Protocols, 1875 unsigned &NumProtocols) { 1876 ObjCProtocolDecl **ProtocolsEnd = Protocols+NumProtocols; 1877 1878 // Sort protocols, keyed by name. 1879 std::sort(Protocols, Protocols+NumProtocols, CmpProtocolNames); 1880 1881 // Remove duplicates. 1882 ProtocolsEnd = std::unique(Protocols, ProtocolsEnd); 1883 NumProtocols = ProtocolsEnd-Protocols; 1884} 1885 1886/// getObjCObjectPointerType - Return a ObjCObjectPointerType type for 1887/// the given interface decl and the conforming protocol list. 1888QualType ASTContext::getObjCObjectPointerType(QualType InterfaceT, 1889 ObjCProtocolDecl **Protocols, 1890 unsigned NumProtocols) { 1891 // Sort the protocol list alphabetically to canonicalize it. 1892 if (NumProtocols) 1893 SortAndUniqueProtocols(Protocols, NumProtocols); 1894 1895 llvm::FoldingSetNodeID ID; 1896 ObjCObjectPointerType::Profile(ID, InterfaceT, Protocols, NumProtocols); 1897 1898 void *InsertPos = 0; 1899 if (ObjCObjectPointerType *QT = 1900 ObjCObjectPointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 1901 return QualType(QT, 0); 1902 1903 // No Match; 1904 ObjCObjectPointerType *QType = 1905 new (*this,8) ObjCObjectPointerType(InterfaceT, Protocols, NumProtocols); 1906 1907 Types.push_back(QType); 1908 ObjCObjectPointerTypes.InsertNode(QType, InsertPos); 1909 return QualType(QType, 0); 1910} 1911 1912/// getObjCInterfaceType - Return the unique reference to the type for the 1913/// specified ObjC interface decl. The list of protocols is optional. 1914QualType ASTContext::getObjCInterfaceType(const ObjCInterfaceDecl *Decl, 1915 ObjCProtocolDecl **Protocols, unsigned NumProtocols) { 1916 if (NumProtocols) 1917 // Sort the protocol list alphabetically to canonicalize it. 1918 SortAndUniqueProtocols(Protocols, NumProtocols); 1919 1920 llvm::FoldingSetNodeID ID; 1921 ObjCInterfaceType::Profile(ID, Decl, Protocols, NumProtocols); 1922 1923 void *InsertPos = 0; 1924 if (ObjCInterfaceType *QT = 1925 ObjCInterfaceTypes.FindNodeOrInsertPos(ID, InsertPos)) 1926 return QualType(QT, 0); 1927 1928 // No Match; 1929 ObjCInterfaceType *QType = 1930 new (*this,8) ObjCInterfaceType(const_cast<ObjCInterfaceDecl*>(Decl), 1931 Protocols, NumProtocols); 1932 Types.push_back(QType); 1933 ObjCInterfaceTypes.InsertNode(QType, InsertPos); 1934 return QualType(QType, 0); 1935} 1936 1937/// getTypeOfExprType - Unlike many "get<Type>" functions, we can't unique 1938/// TypeOfExprType AST's (since expression's are never shared). For example, 1939/// multiple declarations that refer to "typeof(x)" all contain different 1940/// DeclRefExpr's. This doesn't effect the type checker, since it operates 1941/// on canonical type's (which are always unique). 1942QualType ASTContext::getTypeOfExprType(Expr *tofExpr) { 1943 TypeOfExprType *toe; 1944 if (tofExpr->isTypeDependent()) { 1945 llvm::FoldingSetNodeID ID; 1946 DependentTypeOfExprType::Profile(ID, *this, tofExpr); 1947 1948 void *InsertPos = 0; 1949 DependentTypeOfExprType *Canon 1950 = DependentTypeOfExprTypes.FindNodeOrInsertPos(ID, InsertPos); 1951 if (Canon) { 1952 // We already have a "canonical" version of an identical, dependent 1953 // typeof(expr) type. Use that as our canonical type. 1954 toe = new (*this, 8) TypeOfExprType(tofExpr, 1955 QualType((TypeOfExprType*)Canon, 0)); 1956 } 1957 else { 1958 // Build a new, canonical typeof(expr) type. 1959 Canon = new (*this, 8) DependentTypeOfExprType(*this, tofExpr); 1960 DependentTypeOfExprTypes.InsertNode(Canon, InsertPos); 1961 toe = Canon; 1962 } 1963 } else { 1964 QualType Canonical = getCanonicalType(tofExpr->getType()); 1965 toe = new (*this,8) TypeOfExprType(tofExpr, Canonical); 1966 } 1967 Types.push_back(toe); 1968 return QualType(toe, 0); 1969} 1970 1971/// getTypeOfType - Unlike many "get<Type>" functions, we don't unique 1972/// TypeOfType AST's. The only motivation to unique these nodes would be 1973/// memory savings. Since typeof(t) is fairly uncommon, space shouldn't be 1974/// an issue. This doesn't effect the type checker, since it operates 1975/// on canonical type's (which are always unique). 1976QualType ASTContext::getTypeOfType(QualType tofType) { 1977 QualType Canonical = getCanonicalType(tofType); 1978 TypeOfType *tot = new (*this,8) TypeOfType(tofType, Canonical); 1979 Types.push_back(tot); 1980 return QualType(tot, 0); 1981} 1982 1983/// getDecltypeForExpr - Given an expr, will return the decltype for that 1984/// expression, according to the rules in C++0x [dcl.type.simple]p4 1985static QualType getDecltypeForExpr(const Expr *e, ASTContext &Context) { 1986 if (e->isTypeDependent()) 1987 return Context.DependentTy; 1988 1989 // If e is an id expression or a class member access, decltype(e) is defined 1990 // as the type of the entity named by e. 1991 if (const DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(e)) { 1992 if (const ValueDecl *VD = dyn_cast<ValueDecl>(DRE->getDecl())) 1993 return VD->getType(); 1994 } 1995 if (const MemberExpr *ME = dyn_cast<MemberExpr>(e)) { 1996 if (const FieldDecl *FD = dyn_cast<FieldDecl>(ME->getMemberDecl())) 1997 return FD->getType(); 1998 } 1999 // If e is a function call or an invocation of an overloaded operator, 2000 // (parentheses around e are ignored), decltype(e) is defined as the 2001 // return type of that function. 2002 if (const CallExpr *CE = dyn_cast<CallExpr>(e->IgnoreParens())) 2003 return CE->getCallReturnType(); 2004 2005 QualType T = e->getType(); 2006 2007 // Otherwise, where T is the type of e, if e is an lvalue, decltype(e) is 2008 // defined as T&, otherwise decltype(e) is defined as T. 2009 if (e->isLvalue(Context) == Expr::LV_Valid) 2010 T = Context.getLValueReferenceType(T); 2011 2012 return T; 2013} 2014 2015/// getDecltypeType - Unlike many "get<Type>" functions, we don't unique 2016/// DecltypeType AST's. The only motivation to unique these nodes would be 2017/// memory savings. Since decltype(t) is fairly uncommon, space shouldn't be 2018/// an issue. This doesn't effect the type checker, since it operates 2019/// on canonical type's (which are always unique). 2020QualType ASTContext::getDecltypeType(Expr *e) { 2021 DecltypeType *dt; 2022 if (e->isTypeDependent()) { 2023 llvm::FoldingSetNodeID ID; 2024 DependentDecltypeType::Profile(ID, *this, e); 2025 2026 void *InsertPos = 0; 2027 DependentDecltypeType *Canon 2028 = DependentDecltypeTypes.FindNodeOrInsertPos(ID, InsertPos); 2029 if (Canon) { 2030 // We already have a "canonical" version of an equivalent, dependent 2031 // decltype type. Use that as our canonical type. 2032 dt = new (*this, 8) DecltypeType(e, DependentTy, 2033 QualType((DecltypeType*)Canon, 0)); 2034 } 2035 else { 2036 // Build a new, canonical typeof(expr) type. 2037 Canon = new (*this, 8) DependentDecltypeType(*this, e); 2038 DependentDecltypeTypes.InsertNode(Canon, InsertPos); 2039 dt = Canon; 2040 } 2041 } else { 2042 QualType T = getDecltypeForExpr(e, *this); 2043 dt = new (*this, 8) DecltypeType(e, T, getCanonicalType(T)); 2044 } 2045 Types.push_back(dt); 2046 return QualType(dt, 0); 2047} 2048 2049/// getTagDeclType - Return the unique reference to the type for the 2050/// specified TagDecl (struct/union/class/enum) decl. 2051QualType ASTContext::getTagDeclType(const TagDecl *Decl) { 2052 assert (Decl); 2053 // FIXME: What is the design on getTagDeclType when it requires casting 2054 // away const? mutable? 2055 return getTypeDeclType(const_cast<TagDecl*>(Decl)); 2056} 2057 2058/// getSizeType - Return the unique type for "size_t" (C99 7.17), the result 2059/// of the sizeof operator (C99 6.5.3.4p4). The value is target dependent and 2060/// needs to agree with the definition in <stddef.h>. 2061QualType ASTContext::getSizeType() const { 2062 return getFromTargetType(Target.getSizeType()); 2063} 2064 2065/// getSignedWCharType - Return the type of "signed wchar_t". 2066/// Used when in C++, as a GCC extension. 2067QualType ASTContext::getSignedWCharType() const { 2068 // FIXME: derive from "Target" ? 2069 return WCharTy; 2070} 2071 2072/// getUnsignedWCharType - Return the type of "unsigned wchar_t". 2073/// Used when in C++, as a GCC extension. 2074QualType ASTContext::getUnsignedWCharType() const { 2075 // FIXME: derive from "Target" ? 2076 return UnsignedIntTy; 2077} 2078 2079/// getPointerDiffType - Return the unique type for "ptrdiff_t" (ref?) 2080/// defined in <stddef.h>. Pointer - pointer requires this (C99 6.5.6p9). 2081QualType ASTContext::getPointerDiffType() const { 2082 return getFromTargetType(Target.getPtrDiffType(0)); 2083} 2084 2085//===----------------------------------------------------------------------===// 2086// Type Operators 2087//===----------------------------------------------------------------------===// 2088 2089/// getCanonicalType - Return the canonical (structural) type corresponding to 2090/// the specified potentially non-canonical type. The non-canonical version 2091/// of a type may have many "decorated" versions of types. Decorators can 2092/// include typedefs, 'typeof' operators, etc. The returned type is guaranteed 2093/// to be free of any of these, allowing two canonical types to be compared 2094/// for exact equality with a simple pointer comparison. 2095CanQualType ASTContext::getCanonicalType(QualType T) { 2096 QualType CanType = T.getTypePtr()->getCanonicalTypeInternal(); 2097 2098 // If the result has type qualifiers, make sure to canonicalize them as well. 2099 unsigned TypeQuals = T.getCVRQualifiers() | CanType.getCVRQualifiers(); 2100 if (TypeQuals == 0) 2101 return CanQualType::CreateUnsafe(CanType); 2102 2103 // If the type qualifiers are on an array type, get the canonical type of the 2104 // array with the qualifiers applied to the element type. 2105 ArrayType *AT = dyn_cast<ArrayType>(CanType); 2106 if (!AT) 2107 return CanQualType::CreateUnsafe(CanType.getQualifiedType(TypeQuals)); 2108 2109 // Get the canonical version of the element with the extra qualifiers on it. 2110 // This can recursively sink qualifiers through multiple levels of arrays. 2111 QualType NewEltTy=AT->getElementType().getWithAdditionalQualifiers(TypeQuals); 2112 NewEltTy = getCanonicalType(NewEltTy); 2113 2114 if (ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(AT)) 2115 return CanQualType::CreateUnsafe( 2116 getConstantArrayType(NewEltTy, CAT->getSize(), 2117 CAT->getSizeModifier(), 2118 CAT->getIndexTypeQualifier())); 2119 if (IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(AT)) 2120 return CanQualType::CreateUnsafe( 2121 getIncompleteArrayType(NewEltTy, IAT->getSizeModifier(), 2122 IAT->getIndexTypeQualifier())); 2123 2124 if (DependentSizedArrayType *DSAT = dyn_cast<DependentSizedArrayType>(AT)) 2125 return CanQualType::CreateUnsafe( 2126 getDependentSizedArrayType(NewEltTy, 2127 DSAT->getSizeExpr() ? 2128 DSAT->getSizeExpr()->Retain() : 0, 2129 DSAT->getSizeModifier(), 2130 DSAT->getIndexTypeQualifier(), 2131 DSAT->getBracketsRange())); 2132 2133 VariableArrayType *VAT = cast<VariableArrayType>(AT); 2134 return CanQualType::CreateUnsafe(getVariableArrayType(NewEltTy, 2135 VAT->getSizeExpr() ? 2136 VAT->getSizeExpr()->Retain() : 0, 2137 VAT->getSizeModifier(), 2138 VAT->getIndexTypeQualifier(), 2139 VAT->getBracketsRange())); 2140} 2141 2142TemplateName ASTContext::getCanonicalTemplateName(TemplateName Name) { 2143 // If this template name refers to a template, the canonical 2144 // template name merely stores the template itself. 2145 if (TemplateDecl *Template = Name.getAsTemplateDecl()) 2146 return TemplateName(cast<TemplateDecl>(Template->getCanonicalDecl())); 2147 2148 // If this template name refers to a set of overloaded function templates, 2149 /// the canonical template name merely stores the set of function templates. 2150 if (OverloadedFunctionDecl *Ovl = Name.getAsOverloadedFunctionDecl()) { 2151 OverloadedFunctionDecl *CanonOvl = 0; 2152 for (OverloadedFunctionDecl::function_iterator F = Ovl->function_begin(), 2153 FEnd = Ovl->function_end(); 2154 F != FEnd; ++F) { 2155 Decl *Canon = F->get()->getCanonicalDecl(); 2156 if (CanonOvl || Canon != F->get()) { 2157 if (!CanonOvl) 2158 CanonOvl = OverloadedFunctionDecl::Create(*this, 2159 Ovl->getDeclContext(), 2160 Ovl->getDeclName()); 2161 2162 CanonOvl->addOverload( 2163 AnyFunctionDecl::getFromNamedDecl(cast<NamedDecl>(Canon))); 2164 } 2165 } 2166 2167 return TemplateName(CanonOvl? CanonOvl : Ovl); 2168 } 2169 2170 DependentTemplateName *DTN = Name.getAsDependentTemplateName(); 2171 assert(DTN && "Non-dependent template names must refer to template decls."); 2172 return DTN->CanonicalTemplateName; 2173} 2174 2175TemplateArgument 2176ASTContext::getCanonicalTemplateArgument(const TemplateArgument &Arg) { 2177 switch (Arg.getKind()) { 2178 case TemplateArgument::Null: 2179 return Arg; 2180 2181 case TemplateArgument::Expression: 2182 // FIXME: Build canonical expression? 2183 return Arg; 2184 2185 case TemplateArgument::Declaration: 2186 return TemplateArgument(SourceLocation(), 2187 Arg.getAsDecl()->getCanonicalDecl()); 2188 2189 case TemplateArgument::Integral: 2190 return TemplateArgument(SourceLocation(), 2191 *Arg.getAsIntegral(), 2192 getCanonicalType(Arg.getIntegralType())); 2193 2194 case TemplateArgument::Type: 2195 return TemplateArgument(SourceLocation(), 2196 getCanonicalType(Arg.getAsType())); 2197 2198 case TemplateArgument::Pack: { 2199 // FIXME: Allocate in ASTContext 2200 TemplateArgument *CanonArgs = new TemplateArgument[Arg.pack_size()]; 2201 unsigned Idx = 0; 2202 for (TemplateArgument::pack_iterator A = Arg.pack_begin(), 2203 AEnd = Arg.pack_end(); 2204 A != AEnd; (void)++A, ++Idx) 2205 CanonArgs[Idx] = getCanonicalTemplateArgument(*A); 2206 2207 TemplateArgument Result; 2208 Result.setArgumentPack(CanonArgs, Arg.pack_size(), false); 2209 return Result; 2210 } 2211 } 2212 2213 // Silence GCC warning 2214 assert(false && "Unhandled template argument kind"); 2215 return TemplateArgument(); 2216} 2217 2218NestedNameSpecifier * 2219ASTContext::getCanonicalNestedNameSpecifier(NestedNameSpecifier *NNS) { 2220 if (!NNS) 2221 return 0; 2222 2223 switch (NNS->getKind()) { 2224 case NestedNameSpecifier::Identifier: 2225 // Canonicalize the prefix but keep the identifier the same. 2226 return NestedNameSpecifier::Create(*this, 2227 getCanonicalNestedNameSpecifier(NNS->getPrefix()), 2228 NNS->getAsIdentifier()); 2229 2230 case NestedNameSpecifier::Namespace: 2231 // A namespace is canonical; build a nested-name-specifier with 2232 // this namespace and no prefix. 2233 return NestedNameSpecifier::Create(*this, 0, NNS->getAsNamespace()); 2234 2235 case NestedNameSpecifier::TypeSpec: 2236 case NestedNameSpecifier::TypeSpecWithTemplate: { 2237 QualType T = getCanonicalType(QualType(NNS->getAsType(), 0)); 2238 return NestedNameSpecifier::Create(*this, 0, 2239 NNS->getKind() == NestedNameSpecifier::TypeSpecWithTemplate, 2240 T.getTypePtr()); 2241 } 2242 2243 case NestedNameSpecifier::Global: 2244 // The global specifier is canonical and unique. 2245 return NNS; 2246 } 2247 2248 // Required to silence a GCC warning 2249 return 0; 2250} 2251 2252 2253const ArrayType *ASTContext::getAsArrayType(QualType T) { 2254 // Handle the non-qualified case efficiently. 2255 if (T.getCVRQualifiers() == 0) { 2256 // Handle the common positive case fast. 2257 if (const ArrayType *AT = dyn_cast<ArrayType>(T)) 2258 return AT; 2259 } 2260 2261 // Handle the common negative case fast, ignoring CVR qualifiers. 2262 QualType CType = T->getCanonicalTypeInternal(); 2263 2264 // Make sure to look through type qualifiers (like ExtQuals) for the negative 2265 // test. 2266 if (!isa<ArrayType>(CType) && 2267 !isa<ArrayType>(CType.getUnqualifiedType())) 2268 return 0; 2269 2270 // Apply any CVR qualifiers from the array type to the element type. This 2271 // implements C99 6.7.3p8: "If the specification of an array type includes 2272 // any type qualifiers, the element type is so qualified, not the array type." 2273 2274 // If we get here, we either have type qualifiers on the type, or we have 2275 // sugar such as a typedef in the way. If we have type qualifiers on the type 2276 // we must propagate them down into the element type. 2277 unsigned CVRQuals = T.getCVRQualifiers(); 2278 unsigned AddrSpace = 0; 2279 Type *Ty = T.getTypePtr(); 2280 2281 // Rip through ExtQualType's and typedefs to get to a concrete type. 2282 while (1) { 2283 if (const ExtQualType *EXTQT = dyn_cast<ExtQualType>(Ty)) { 2284 AddrSpace = EXTQT->getAddressSpace(); 2285 Ty = EXTQT->getBaseType(); 2286 } else { 2287 T = Ty->getDesugaredType(); 2288 if (T.getTypePtr() == Ty && T.getCVRQualifiers() == 0) 2289 break; 2290 CVRQuals |= T.getCVRQualifiers(); 2291 Ty = T.getTypePtr(); 2292 } 2293 } 2294 2295 // If we have a simple case, just return now. 2296 const ArrayType *ATy = dyn_cast<ArrayType>(Ty); 2297 if (ATy == 0 || (AddrSpace == 0 && CVRQuals == 0)) 2298 return ATy; 2299 2300 // Otherwise, we have an array and we have qualifiers on it. Push the 2301 // qualifiers into the array element type and return a new array type. 2302 // Get the canonical version of the element with the extra qualifiers on it. 2303 // This can recursively sink qualifiers through multiple levels of arrays. 2304 QualType NewEltTy = ATy->getElementType(); 2305 if (AddrSpace) 2306 NewEltTy = getAddrSpaceQualType(NewEltTy, AddrSpace); 2307 NewEltTy = NewEltTy.getWithAdditionalQualifiers(CVRQuals); 2308 2309 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(ATy)) 2310 return cast<ArrayType>(getConstantArrayType(NewEltTy, CAT->getSize(), 2311 CAT->getSizeModifier(), 2312 CAT->getIndexTypeQualifier())); 2313 if (const IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(ATy)) 2314 return cast<ArrayType>(getIncompleteArrayType(NewEltTy, 2315 IAT->getSizeModifier(), 2316 IAT->getIndexTypeQualifier())); 2317 2318 if (const DependentSizedArrayType *DSAT 2319 = dyn_cast<DependentSizedArrayType>(ATy)) 2320 return cast<ArrayType>( 2321 getDependentSizedArrayType(NewEltTy, 2322 DSAT->getSizeExpr() ? 2323 DSAT->getSizeExpr()->Retain() : 0, 2324 DSAT->getSizeModifier(), 2325 DSAT->getIndexTypeQualifier(), 2326 DSAT->getBracketsRange())); 2327 2328 const VariableArrayType *VAT = cast<VariableArrayType>(ATy); 2329 return cast<ArrayType>(getVariableArrayType(NewEltTy, 2330 VAT->getSizeExpr() ? 2331 VAT->getSizeExpr()->Retain() : 0, 2332 VAT->getSizeModifier(), 2333 VAT->getIndexTypeQualifier(), 2334 VAT->getBracketsRange())); 2335} 2336 2337 2338/// getArrayDecayedType - Return the properly qualified result of decaying the 2339/// specified array type to a pointer. This operation is non-trivial when 2340/// handling typedefs etc. The canonical type of "T" must be an array type, 2341/// this returns a pointer to a properly qualified element of the array. 2342/// 2343/// See C99 6.7.5.3p7 and C99 6.3.2.1p3. 2344QualType ASTContext::getArrayDecayedType(QualType Ty) { 2345 // Get the element type with 'getAsArrayType' so that we don't lose any 2346 // typedefs in the element type of the array. This also handles propagation 2347 // of type qualifiers from the array type into the element type if present 2348 // (C99 6.7.3p8). 2349 const ArrayType *PrettyArrayType = getAsArrayType(Ty); 2350 assert(PrettyArrayType && "Not an array type!"); 2351 2352 QualType PtrTy = getPointerType(PrettyArrayType->getElementType()); 2353 2354 // int x[restrict 4] -> int *restrict 2355 return PtrTy.getQualifiedType(PrettyArrayType->getIndexTypeQualifier()); 2356} 2357 2358QualType ASTContext::getBaseElementType(QualType QT) { 2359 QualifierSet qualifiers; 2360 while (true) { 2361 const Type *UT = qualifiers.strip(QT); 2362 if (const ArrayType *AT = getAsArrayType(QualType(UT,0))) { 2363 QT = AT->getElementType(); 2364 } else { 2365 return qualifiers.apply(QT, *this); 2366 } 2367 } 2368} 2369 2370QualType ASTContext::getBaseElementType(const VariableArrayType *VAT) { 2371 QualType ElemTy = VAT->getElementType(); 2372 2373 if (const VariableArrayType *VAT = getAsVariableArrayType(ElemTy)) 2374 return getBaseElementType(VAT); 2375 2376 return ElemTy; 2377} 2378 2379/// getConstantArrayElementCount - Returns number of constant array elements. 2380uint64_t 2381ASTContext::getConstantArrayElementCount(const ConstantArrayType *CA) const { 2382 uint64_t ElementCount = 1; 2383 do { 2384 ElementCount *= CA->getSize().getZExtValue(); 2385 CA = dyn_cast<ConstantArrayType>(CA->getElementType()); 2386 } while (CA); 2387 return ElementCount; 2388} 2389 2390/// getFloatingRank - Return a relative rank for floating point types. 2391/// This routine will assert if passed a built-in type that isn't a float. 2392static FloatingRank getFloatingRank(QualType T) { 2393 if (const ComplexType *CT = T->getAsComplexType()) 2394 return getFloatingRank(CT->getElementType()); 2395 2396 assert(T->getAsBuiltinType() && "getFloatingRank(): not a floating type"); 2397 switch (T->getAsBuiltinType()->getKind()) { 2398 default: assert(0 && "getFloatingRank(): not a floating type"); 2399 case BuiltinType::Float: return FloatRank; 2400 case BuiltinType::Double: return DoubleRank; 2401 case BuiltinType::LongDouble: return LongDoubleRank; 2402 } 2403} 2404 2405/// getFloatingTypeOfSizeWithinDomain - Returns a real floating 2406/// point or a complex type (based on typeDomain/typeSize). 2407/// 'typeDomain' is a real floating point or complex type. 2408/// 'typeSize' is a real floating point or complex type. 2409QualType ASTContext::getFloatingTypeOfSizeWithinDomain(QualType Size, 2410 QualType Domain) const { 2411 FloatingRank EltRank = getFloatingRank(Size); 2412 if (Domain->isComplexType()) { 2413 switch (EltRank) { 2414 default: assert(0 && "getFloatingRank(): illegal value for rank"); 2415 case FloatRank: return FloatComplexTy; 2416 case DoubleRank: return DoubleComplexTy; 2417 case LongDoubleRank: return LongDoubleComplexTy; 2418 } 2419 } 2420 2421 assert(Domain->isRealFloatingType() && "Unknown domain!"); 2422 switch (EltRank) { 2423 default: assert(0 && "getFloatingRank(): illegal value for rank"); 2424 case FloatRank: return FloatTy; 2425 case DoubleRank: return DoubleTy; 2426 case LongDoubleRank: return LongDoubleTy; 2427 } 2428} 2429 2430/// getFloatingTypeOrder - Compare the rank of the two specified floating 2431/// point types, ignoring the domain of the type (i.e. 'double' == 2432/// '_Complex double'). If LHS > RHS, return 1. If LHS == RHS, return 0. If 2433/// LHS < RHS, return -1. 2434int ASTContext::getFloatingTypeOrder(QualType LHS, QualType RHS) { 2435 FloatingRank LHSR = getFloatingRank(LHS); 2436 FloatingRank RHSR = getFloatingRank(RHS); 2437 2438 if (LHSR == RHSR) 2439 return 0; 2440 if (LHSR > RHSR) 2441 return 1; 2442 return -1; 2443} 2444 2445/// getIntegerRank - Return an integer conversion rank (C99 6.3.1.1p1). This 2446/// routine will assert if passed a built-in type that isn't an integer or enum, 2447/// or if it is not canonicalized. 2448unsigned ASTContext::getIntegerRank(Type *T) { 2449 assert(T->isCanonical() && "T should be canonicalized"); 2450 if (EnumType* ET = dyn_cast<EnumType>(T)) 2451 T = ET->getDecl()->getIntegerType().getTypePtr(); 2452 2453 if (T->isSpecificBuiltinType(BuiltinType::WChar)) 2454 T = getFromTargetType(Target.getWCharType()).getTypePtr(); 2455 2456 if (T->isSpecificBuiltinType(BuiltinType::Char16)) 2457 T = getFromTargetType(Target.getChar16Type()).getTypePtr(); 2458 2459 if (T->isSpecificBuiltinType(BuiltinType::Char32)) 2460 T = getFromTargetType(Target.getChar32Type()).getTypePtr(); 2461 2462 // There are two things which impact the integer rank: the width, and 2463 // the ordering of builtins. The builtin ordering is encoded in the 2464 // bottom three bits; the width is encoded in the bits above that. 2465 if (FixedWidthIntType* FWIT = dyn_cast<FixedWidthIntType>(T)) 2466 return FWIT->getWidth() << 3; 2467 2468 switch (cast<BuiltinType>(T)->getKind()) { 2469 default: assert(0 && "getIntegerRank(): not a built-in integer"); 2470 case BuiltinType::Bool: 2471 return 1 + (getIntWidth(BoolTy) << 3); 2472 case BuiltinType::Char_S: 2473 case BuiltinType::Char_U: 2474 case BuiltinType::SChar: 2475 case BuiltinType::UChar: 2476 return 2 + (getIntWidth(CharTy) << 3); 2477 case BuiltinType::Short: 2478 case BuiltinType::UShort: 2479 return 3 + (getIntWidth(ShortTy) << 3); 2480 case BuiltinType::Int: 2481 case BuiltinType::UInt: 2482 return 4 + (getIntWidth(IntTy) << 3); 2483 case BuiltinType::Long: 2484 case BuiltinType::ULong: 2485 return 5 + (getIntWidth(LongTy) << 3); 2486 case BuiltinType::LongLong: 2487 case BuiltinType::ULongLong: 2488 return 6 + (getIntWidth(LongLongTy) << 3); 2489 case BuiltinType::Int128: 2490 case BuiltinType::UInt128: 2491 return 7 + (getIntWidth(Int128Ty) << 3); 2492 } 2493} 2494 2495/// \brief Whether this is a promotable bitfield reference according 2496/// to C99 6.3.1.1p2, bullet 2 (and GCC extensions). 2497/// 2498/// \returns the type this bit-field will promote to, or NULL if no 2499/// promotion occurs. 2500QualType ASTContext::isPromotableBitField(Expr *E) { 2501 FieldDecl *Field = E->getBitField(); 2502 if (!Field) 2503 return QualType(); 2504 2505 QualType FT = Field->getType(); 2506 2507 llvm::APSInt BitWidthAP = Field->getBitWidth()->EvaluateAsInt(*this); 2508 uint64_t BitWidth = BitWidthAP.getZExtValue(); 2509 uint64_t IntSize = getTypeSize(IntTy); 2510 // GCC extension compatibility: if the bit-field size is less than or equal 2511 // to the size of int, it gets promoted no matter what its type is. 2512 // For instance, unsigned long bf : 4 gets promoted to signed int. 2513 if (BitWidth < IntSize) 2514 return IntTy; 2515 2516 if (BitWidth == IntSize) 2517 return FT->isSignedIntegerType() ? IntTy : UnsignedIntTy; 2518 2519 // Types bigger than int are not subject to promotions, and therefore act 2520 // like the base type. 2521 // FIXME: This doesn't quite match what gcc does, but what gcc does here 2522 // is ridiculous. 2523 return QualType(); 2524} 2525 2526/// getPromotedIntegerType - Returns the type that Promotable will 2527/// promote to: C99 6.3.1.1p2, assuming that Promotable is a promotable 2528/// integer type. 2529QualType ASTContext::getPromotedIntegerType(QualType Promotable) { 2530 assert(!Promotable.isNull()); 2531 assert(Promotable->isPromotableIntegerType()); 2532 if (Promotable->isSignedIntegerType()) 2533 return IntTy; 2534 uint64_t PromotableSize = getTypeSize(Promotable); 2535 uint64_t IntSize = getTypeSize(IntTy); 2536 assert(Promotable->isUnsignedIntegerType() && PromotableSize <= IntSize); 2537 return (PromotableSize != IntSize) ? IntTy : UnsignedIntTy; 2538} 2539 2540/// getIntegerTypeOrder - Returns the highest ranked integer type: 2541/// C99 6.3.1.8p1. If LHS > RHS, return 1. If LHS == RHS, return 0. If 2542/// LHS < RHS, return -1. 2543int ASTContext::getIntegerTypeOrder(QualType LHS, QualType RHS) { 2544 Type *LHSC = getCanonicalType(LHS).getTypePtr(); 2545 Type *RHSC = getCanonicalType(RHS).getTypePtr(); 2546 if (LHSC == RHSC) return 0; 2547 2548 bool LHSUnsigned = LHSC->isUnsignedIntegerType(); 2549 bool RHSUnsigned = RHSC->isUnsignedIntegerType(); 2550 2551 unsigned LHSRank = getIntegerRank(LHSC); 2552 unsigned RHSRank = getIntegerRank(RHSC); 2553 2554 if (LHSUnsigned == RHSUnsigned) { // Both signed or both unsigned. 2555 if (LHSRank == RHSRank) return 0; 2556 return LHSRank > RHSRank ? 1 : -1; 2557 } 2558 2559 // Otherwise, the LHS is signed and the RHS is unsigned or visa versa. 2560 if (LHSUnsigned) { 2561 // If the unsigned [LHS] type is larger, return it. 2562 if (LHSRank >= RHSRank) 2563 return 1; 2564 2565 // If the signed type can represent all values of the unsigned type, it 2566 // wins. Because we are dealing with 2's complement and types that are 2567 // powers of two larger than each other, this is always safe. 2568 return -1; 2569 } 2570 2571 // If the unsigned [RHS] type is larger, return it. 2572 if (RHSRank >= LHSRank) 2573 return -1; 2574 2575 // If the signed type can represent all values of the unsigned type, it 2576 // wins. Because we are dealing with 2's complement and types that are 2577 // powers of two larger than each other, this is always safe. 2578 return 1; 2579} 2580 2581// getCFConstantStringType - Return the type used for constant CFStrings. 2582QualType ASTContext::getCFConstantStringType() { 2583 if (!CFConstantStringTypeDecl) { 2584 CFConstantStringTypeDecl = 2585 RecordDecl::Create(*this, TagDecl::TK_struct, TUDecl, SourceLocation(), 2586 &Idents.get("NSConstantString")); 2587 QualType FieldTypes[4]; 2588 2589 // const int *isa; 2590 FieldTypes[0] = getPointerType(IntTy.getQualifiedType(QualType::Const)); 2591 // int flags; 2592 FieldTypes[1] = IntTy; 2593 // const char *str; 2594 FieldTypes[2] = getPointerType(CharTy.getQualifiedType(QualType::Const)); 2595 // long length; 2596 FieldTypes[3] = LongTy; 2597 2598 // Create fields 2599 for (unsigned i = 0; i < 4; ++i) { 2600 FieldDecl *Field = FieldDecl::Create(*this, CFConstantStringTypeDecl, 2601 SourceLocation(), 0, 2602 FieldTypes[i], /*DInfo=*/0, 2603 /*BitWidth=*/0, 2604 /*Mutable=*/false); 2605 CFConstantStringTypeDecl->addDecl(Field); 2606 } 2607 2608 CFConstantStringTypeDecl->completeDefinition(*this); 2609 } 2610 2611 return getTagDeclType(CFConstantStringTypeDecl); 2612} 2613 2614void ASTContext::setCFConstantStringType(QualType T) { 2615 const RecordType *Rec = T->getAs<RecordType>(); 2616 assert(Rec && "Invalid CFConstantStringType"); 2617 CFConstantStringTypeDecl = Rec->getDecl(); 2618} 2619 2620QualType ASTContext::getObjCFastEnumerationStateType() 2621{ 2622 if (!ObjCFastEnumerationStateTypeDecl) { 2623 ObjCFastEnumerationStateTypeDecl = 2624 RecordDecl::Create(*this, TagDecl::TK_struct, TUDecl, SourceLocation(), 2625 &Idents.get("__objcFastEnumerationState")); 2626 2627 QualType FieldTypes[] = { 2628 UnsignedLongTy, 2629 getPointerType(ObjCIdTypedefType), 2630 getPointerType(UnsignedLongTy), 2631 getConstantArrayType(UnsignedLongTy, 2632 llvm::APInt(32, 5), ArrayType::Normal, 0) 2633 }; 2634 2635 for (size_t i = 0; i < 4; ++i) { 2636 FieldDecl *Field = FieldDecl::Create(*this, 2637 ObjCFastEnumerationStateTypeDecl, 2638 SourceLocation(), 0, 2639 FieldTypes[i], /*DInfo=*/0, 2640 /*BitWidth=*/0, 2641 /*Mutable=*/false); 2642 ObjCFastEnumerationStateTypeDecl->addDecl(Field); 2643 } 2644 2645 ObjCFastEnumerationStateTypeDecl->completeDefinition(*this); 2646 } 2647 2648 return getTagDeclType(ObjCFastEnumerationStateTypeDecl); 2649} 2650 2651void ASTContext::setObjCFastEnumerationStateType(QualType T) { 2652 const RecordType *Rec = T->getAs<RecordType>(); 2653 assert(Rec && "Invalid ObjCFAstEnumerationStateType"); 2654 ObjCFastEnumerationStateTypeDecl = Rec->getDecl(); 2655} 2656 2657// This returns true if a type has been typedefed to BOOL: 2658// typedef <type> BOOL; 2659static bool isTypeTypedefedAsBOOL(QualType T) { 2660 if (const TypedefType *TT = dyn_cast<TypedefType>(T)) 2661 if (IdentifierInfo *II = TT->getDecl()->getIdentifier()) 2662 return II->isStr("BOOL"); 2663 2664 return false; 2665} 2666 2667/// getObjCEncodingTypeSize returns size of type for objective-c encoding 2668/// purpose. 2669int ASTContext::getObjCEncodingTypeSize(QualType type) { 2670 uint64_t sz = getTypeSize(type); 2671 2672 // Make all integer and enum types at least as large as an int 2673 if (sz > 0 && type->isIntegralType()) 2674 sz = std::max(sz, getTypeSize(IntTy)); 2675 // Treat arrays as pointers, since that's how they're passed in. 2676 else if (type->isArrayType()) 2677 sz = getTypeSize(VoidPtrTy); 2678 return sz / getTypeSize(CharTy); 2679} 2680 2681/// getObjCEncodingForMethodDecl - Return the encoded type for this method 2682/// declaration. 2683void ASTContext::getObjCEncodingForMethodDecl(const ObjCMethodDecl *Decl, 2684 std::string& S) { 2685 // FIXME: This is not very efficient. 2686 // Encode type qualifer, 'in', 'inout', etc. for the return type. 2687 getObjCEncodingForTypeQualifier(Decl->getObjCDeclQualifier(), S); 2688 // Encode result type. 2689 getObjCEncodingForType(Decl->getResultType(), S); 2690 // Compute size of all parameters. 2691 // Start with computing size of a pointer in number of bytes. 2692 // FIXME: There might(should) be a better way of doing this computation! 2693 SourceLocation Loc; 2694 int PtrSize = getTypeSize(VoidPtrTy) / getTypeSize(CharTy); 2695 // The first two arguments (self and _cmd) are pointers; account for 2696 // their size. 2697 int ParmOffset = 2 * PtrSize; 2698 for (ObjCMethodDecl::param_iterator PI = Decl->param_begin(), 2699 E = Decl->param_end(); PI != E; ++PI) { 2700 QualType PType = (*PI)->getType(); 2701 int sz = getObjCEncodingTypeSize(PType); 2702 assert (sz > 0 && "getObjCEncodingForMethodDecl - Incomplete param type"); 2703 ParmOffset += sz; 2704 } 2705 S += llvm::utostr(ParmOffset); 2706 S += "@0:"; 2707 S += llvm::utostr(PtrSize); 2708 2709 // Argument types. 2710 ParmOffset = 2 * PtrSize; 2711 for (ObjCMethodDecl::param_iterator PI = Decl->param_begin(), 2712 E = Decl->param_end(); PI != E; ++PI) { 2713 ParmVarDecl *PVDecl = *PI; 2714 QualType PType = PVDecl->getOriginalType(); 2715 if (const ArrayType *AT = 2716 dyn_cast<ArrayType>(PType->getCanonicalTypeInternal())) { 2717 // Use array's original type only if it has known number of 2718 // elements. 2719 if (!isa<ConstantArrayType>(AT)) 2720 PType = PVDecl->getType(); 2721 } else if (PType->isFunctionType()) 2722 PType = PVDecl->getType(); 2723 // Process argument qualifiers for user supplied arguments; such as, 2724 // 'in', 'inout', etc. 2725 getObjCEncodingForTypeQualifier(PVDecl->getObjCDeclQualifier(), S); 2726 getObjCEncodingForType(PType, S); 2727 S += llvm::utostr(ParmOffset); 2728 ParmOffset += getObjCEncodingTypeSize(PType); 2729 } 2730} 2731 2732/// getObjCEncodingForPropertyDecl - Return the encoded type for this 2733/// property declaration. If non-NULL, Container must be either an 2734/// ObjCCategoryImplDecl or ObjCImplementationDecl; it should only be 2735/// NULL when getting encodings for protocol properties. 2736/// Property attributes are stored as a comma-delimited C string. The simple 2737/// attributes readonly and bycopy are encoded as single characters. The 2738/// parametrized attributes, getter=name, setter=name, and ivar=name, are 2739/// encoded as single characters, followed by an identifier. Property types 2740/// are also encoded as a parametrized attribute. The characters used to encode 2741/// these attributes are defined by the following enumeration: 2742/// @code 2743/// enum PropertyAttributes { 2744/// kPropertyReadOnly = 'R', // property is read-only. 2745/// kPropertyBycopy = 'C', // property is a copy of the value last assigned 2746/// kPropertyByref = '&', // property is a reference to the value last assigned 2747/// kPropertyDynamic = 'D', // property is dynamic 2748/// kPropertyGetter = 'G', // followed by getter selector name 2749/// kPropertySetter = 'S', // followed by setter selector name 2750/// kPropertyInstanceVariable = 'V' // followed by instance variable name 2751/// kPropertyType = 't' // followed by old-style type encoding. 2752/// kPropertyWeak = 'W' // 'weak' property 2753/// kPropertyStrong = 'P' // property GC'able 2754/// kPropertyNonAtomic = 'N' // property non-atomic 2755/// }; 2756/// @endcode 2757void ASTContext::getObjCEncodingForPropertyDecl(const ObjCPropertyDecl *PD, 2758 const Decl *Container, 2759 std::string& S) { 2760 // Collect information from the property implementation decl(s). 2761 bool Dynamic = false; 2762 ObjCPropertyImplDecl *SynthesizePID = 0; 2763 2764 // FIXME: Duplicated code due to poor abstraction. 2765 if (Container) { 2766 if (const ObjCCategoryImplDecl *CID = 2767 dyn_cast<ObjCCategoryImplDecl>(Container)) { 2768 for (ObjCCategoryImplDecl::propimpl_iterator 2769 i = CID->propimpl_begin(), e = CID->propimpl_end(); 2770 i != e; ++i) { 2771 ObjCPropertyImplDecl *PID = *i; 2772 if (PID->getPropertyDecl() == PD) { 2773 if (PID->getPropertyImplementation()==ObjCPropertyImplDecl::Dynamic) { 2774 Dynamic = true; 2775 } else { 2776 SynthesizePID = PID; 2777 } 2778 } 2779 } 2780 } else { 2781 const ObjCImplementationDecl *OID=cast<ObjCImplementationDecl>(Container); 2782 for (ObjCCategoryImplDecl::propimpl_iterator 2783 i = OID->propimpl_begin(), e = OID->propimpl_end(); 2784 i != e; ++i) { 2785 ObjCPropertyImplDecl *PID = *i; 2786 if (PID->getPropertyDecl() == PD) { 2787 if (PID->getPropertyImplementation()==ObjCPropertyImplDecl::Dynamic) { 2788 Dynamic = true; 2789 } else { 2790 SynthesizePID = PID; 2791 } 2792 } 2793 } 2794 } 2795 } 2796 2797 // FIXME: This is not very efficient. 2798 S = "T"; 2799 2800 // Encode result type. 2801 // GCC has some special rules regarding encoding of properties which 2802 // closely resembles encoding of ivars. 2803 getObjCEncodingForTypeImpl(PD->getType(), S, true, true, 0, 2804 true /* outermost type */, 2805 true /* encoding for property */); 2806 2807 if (PD->isReadOnly()) { 2808 S += ",R"; 2809 } else { 2810 switch (PD->getSetterKind()) { 2811 case ObjCPropertyDecl::Assign: break; 2812 case ObjCPropertyDecl::Copy: S += ",C"; break; 2813 case ObjCPropertyDecl::Retain: S += ",&"; break; 2814 } 2815 } 2816 2817 // It really isn't clear at all what this means, since properties 2818 // are "dynamic by default". 2819 if (Dynamic) 2820 S += ",D"; 2821 2822 if (PD->getPropertyAttributes() & ObjCPropertyDecl::OBJC_PR_nonatomic) 2823 S += ",N"; 2824 2825 if (PD->getPropertyAttributes() & ObjCPropertyDecl::OBJC_PR_getter) { 2826 S += ",G"; 2827 S += PD->getGetterName().getAsString(); 2828 } 2829 2830 if (PD->getPropertyAttributes() & ObjCPropertyDecl::OBJC_PR_setter) { 2831 S += ",S"; 2832 S += PD->getSetterName().getAsString(); 2833 } 2834 2835 if (SynthesizePID) { 2836 const ObjCIvarDecl *OID = SynthesizePID->getPropertyIvarDecl(); 2837 S += ",V"; 2838 S += OID->getNameAsString(); 2839 } 2840 2841 // FIXME: OBJCGC: weak & strong 2842} 2843 2844/// getLegacyIntegralTypeEncoding - 2845/// Another legacy compatibility encoding: 32-bit longs are encoded as 2846/// 'l' or 'L' , but not always. For typedefs, we need to use 2847/// 'i' or 'I' instead if encoding a struct field, or a pointer! 2848/// 2849void ASTContext::getLegacyIntegralTypeEncoding (QualType &PointeeTy) const { 2850 if (isa<TypedefType>(PointeeTy.getTypePtr())) { 2851 if (const BuiltinType *BT = PointeeTy->getAsBuiltinType()) { 2852 if (BT->getKind() == BuiltinType::ULong && 2853 ((const_cast<ASTContext *>(this))->getIntWidth(PointeeTy) == 32)) 2854 PointeeTy = UnsignedIntTy; 2855 else 2856 if (BT->getKind() == BuiltinType::Long && 2857 ((const_cast<ASTContext *>(this))->getIntWidth(PointeeTy) == 32)) 2858 PointeeTy = IntTy; 2859 } 2860 } 2861} 2862 2863void ASTContext::getObjCEncodingForType(QualType T, std::string& S, 2864 const FieldDecl *Field) { 2865 // We follow the behavior of gcc, expanding structures which are 2866 // directly pointed to, and expanding embedded structures. Note that 2867 // these rules are sufficient to prevent recursive encoding of the 2868 // same type. 2869 getObjCEncodingForTypeImpl(T, S, true, true, Field, 2870 true /* outermost type */); 2871} 2872 2873static void EncodeBitField(const ASTContext *Context, std::string& S, 2874 const FieldDecl *FD) { 2875 const Expr *E = FD->getBitWidth(); 2876 assert(E && "bitfield width not there - getObjCEncodingForTypeImpl"); 2877 ASTContext *Ctx = const_cast<ASTContext*>(Context); 2878 unsigned N = E->EvaluateAsInt(*Ctx).getZExtValue(); 2879 S += 'b'; 2880 S += llvm::utostr(N); 2881} 2882 2883void ASTContext::getObjCEncodingForTypeImpl(QualType T, std::string& S, 2884 bool ExpandPointedToStructures, 2885 bool ExpandStructures, 2886 const FieldDecl *FD, 2887 bool OutermostType, 2888 bool EncodingProperty) { 2889 if (const BuiltinType *BT = T->getAsBuiltinType()) { 2890 if (FD && FD->isBitField()) 2891 return EncodeBitField(this, S, FD); 2892 char encoding; 2893 switch (BT->getKind()) { 2894 default: assert(0 && "Unhandled builtin type kind"); 2895 case BuiltinType::Void: encoding = 'v'; break; 2896 case BuiltinType::Bool: encoding = 'B'; break; 2897 case BuiltinType::Char_U: 2898 case BuiltinType::UChar: encoding = 'C'; break; 2899 case BuiltinType::UShort: encoding = 'S'; break; 2900 case BuiltinType::UInt: encoding = 'I'; break; 2901 case BuiltinType::ULong: 2902 encoding = 2903 (const_cast<ASTContext *>(this))->getIntWidth(T) == 32 ? 'L' : 'Q'; 2904 break; 2905 case BuiltinType::UInt128: encoding = 'T'; break; 2906 case BuiltinType::ULongLong: encoding = 'Q'; break; 2907 case BuiltinType::Char_S: 2908 case BuiltinType::SChar: encoding = 'c'; break; 2909 case BuiltinType::Short: encoding = 's'; break; 2910 case BuiltinType::Int: encoding = 'i'; break; 2911 case BuiltinType::Long: 2912 encoding = 2913 (const_cast<ASTContext *>(this))->getIntWidth(T) == 32 ? 'l' : 'q'; 2914 break; 2915 case BuiltinType::LongLong: encoding = 'q'; break; 2916 case BuiltinType::Int128: encoding = 't'; break; 2917 case BuiltinType::Float: encoding = 'f'; break; 2918 case BuiltinType::Double: encoding = 'd'; break; 2919 case BuiltinType::LongDouble: encoding = 'd'; break; 2920 } 2921 2922 S += encoding; 2923 return; 2924 } 2925 2926 if (const ComplexType *CT = T->getAsComplexType()) { 2927 S += 'j'; 2928 getObjCEncodingForTypeImpl(CT->getElementType(), S, false, false, 0, false, 2929 false); 2930 return; 2931 } 2932 2933 if (const PointerType *PT = T->getAs<PointerType>()) { 2934 QualType PointeeTy = PT->getPointeeType(); 2935 bool isReadOnly = false; 2936 // For historical/compatibility reasons, the read-only qualifier of the 2937 // pointee gets emitted _before_ the '^'. The read-only qualifier of 2938 // the pointer itself gets ignored, _unless_ we are looking at a typedef! 2939 // Also, do not emit the 'r' for anything but the outermost type! 2940 if (isa<TypedefType>(T.getTypePtr())) { 2941 if (OutermostType && T.isConstQualified()) { 2942 isReadOnly = true; 2943 S += 'r'; 2944 } 2945 } else if (OutermostType) { 2946 QualType P = PointeeTy; 2947 while (P->getAs<PointerType>()) 2948 P = P->getAs<PointerType>()->getPointeeType(); 2949 if (P.isConstQualified()) { 2950 isReadOnly = true; 2951 S += 'r'; 2952 } 2953 } 2954 if (isReadOnly) { 2955 // Another legacy compatibility encoding. Some ObjC qualifier and type 2956 // combinations need to be rearranged. 2957 // Rewrite "in const" from "nr" to "rn" 2958 const char * s = S.c_str(); 2959 int len = S.length(); 2960 if (len >= 2 && s[len-2] == 'n' && s[len-1] == 'r') { 2961 std::string replace = "rn"; 2962 S.replace(S.end()-2, S.end(), replace); 2963 } 2964 } 2965 if (isObjCSelType(PointeeTy)) { 2966 S += ':'; 2967 return; 2968 } 2969 2970 if (PointeeTy->isCharType()) { 2971 // char pointer types should be encoded as '*' unless it is a 2972 // type that has been typedef'd to 'BOOL'. 2973 if (!isTypeTypedefedAsBOOL(PointeeTy)) { 2974 S += '*'; 2975 return; 2976 } 2977 } else if (const RecordType *RTy = PointeeTy->getAs<RecordType>()) { 2978 // GCC binary compat: Need to convert "struct objc_class *" to "#". 2979 if (RTy->getDecl()->getIdentifier() == &Idents.get("objc_class")) { 2980 S += '#'; 2981 return; 2982 } 2983 // GCC binary compat: Need to convert "struct objc_object *" to "@". 2984 if (RTy->getDecl()->getIdentifier() == &Idents.get("objc_object")) { 2985 S += '@'; 2986 return; 2987 } 2988 // fall through... 2989 } 2990 S += '^'; 2991 getLegacyIntegralTypeEncoding(PointeeTy); 2992 2993 getObjCEncodingForTypeImpl(PointeeTy, S, false, ExpandPointedToStructures, 2994 NULL); 2995 return; 2996 } 2997 2998 if (const ArrayType *AT = 2999 // Ignore type qualifiers etc. 3000 dyn_cast<ArrayType>(T->getCanonicalTypeInternal())) { 3001 if (isa<IncompleteArrayType>(AT)) { 3002 // Incomplete arrays are encoded as a pointer to the array element. 3003 S += '^'; 3004 3005 getObjCEncodingForTypeImpl(AT->getElementType(), S, 3006 false, ExpandStructures, FD); 3007 } else { 3008 S += '['; 3009 3010 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(AT)) 3011 S += llvm::utostr(CAT->getSize().getZExtValue()); 3012 else { 3013 //Variable length arrays are encoded as a regular array with 0 elements. 3014 assert(isa<VariableArrayType>(AT) && "Unknown array type!"); 3015 S += '0'; 3016 } 3017 3018 getObjCEncodingForTypeImpl(AT->getElementType(), S, 3019 false, ExpandStructures, FD); 3020 S += ']'; 3021 } 3022 return; 3023 } 3024 3025 if (T->getAsFunctionType()) { 3026 S += '?'; 3027 return; 3028 } 3029 3030 if (const RecordType *RTy = T->getAs<RecordType>()) { 3031 RecordDecl *RDecl = RTy->getDecl(); 3032 S += RDecl->isUnion() ? '(' : '{'; 3033 // Anonymous structures print as '?' 3034 if (const IdentifierInfo *II = RDecl->getIdentifier()) { 3035 S += II->getName(); 3036 } else { 3037 S += '?'; 3038 } 3039 if (ExpandStructures) { 3040 S += '='; 3041 for (RecordDecl::field_iterator Field = RDecl->field_begin(), 3042 FieldEnd = RDecl->field_end(); 3043 Field != FieldEnd; ++Field) { 3044 if (FD) { 3045 S += '"'; 3046 S += Field->getNameAsString(); 3047 S += '"'; 3048 } 3049 3050 // Special case bit-fields. 3051 if (Field->isBitField()) { 3052 getObjCEncodingForTypeImpl(Field->getType(), S, false, true, 3053 (*Field)); 3054 } else { 3055 QualType qt = Field->getType(); 3056 getLegacyIntegralTypeEncoding(qt); 3057 getObjCEncodingForTypeImpl(qt, S, false, true, 3058 FD); 3059 } 3060 } 3061 } 3062 S += RDecl->isUnion() ? ')' : '}'; 3063 return; 3064 } 3065 3066 if (T->isEnumeralType()) { 3067 if (FD && FD->isBitField()) 3068 EncodeBitField(this, S, FD); 3069 else 3070 S += 'i'; 3071 return; 3072 } 3073 3074 if (T->isBlockPointerType()) { 3075 S += "@?"; // Unlike a pointer-to-function, which is "^?". 3076 return; 3077 } 3078 3079 if (T->isObjCInterfaceType()) { 3080 // @encode(class_name) 3081 ObjCInterfaceDecl *OI = T->getAsObjCInterfaceType()->getDecl(); 3082 S += '{'; 3083 const IdentifierInfo *II = OI->getIdentifier(); 3084 S += II->getName(); 3085 S += '='; 3086 llvm::SmallVector<FieldDecl*, 32> RecFields; 3087 CollectObjCIvars(OI, RecFields); 3088 for (unsigned i = 0, e = RecFields.size(); i != e; ++i) { 3089 if (RecFields[i]->isBitField()) 3090 getObjCEncodingForTypeImpl(RecFields[i]->getType(), S, false, true, 3091 RecFields[i]); 3092 else 3093 getObjCEncodingForTypeImpl(RecFields[i]->getType(), S, false, true, 3094 FD); 3095 } 3096 S += '}'; 3097 return; 3098 } 3099 3100 if (const ObjCObjectPointerType *OPT = T->getAsObjCObjectPointerType()) { 3101 if (OPT->isObjCIdType()) { 3102 S += '@'; 3103 return; 3104 } 3105 3106 if (OPT->isObjCClassType()) { 3107 S += '#'; 3108 return; 3109 } 3110 3111 if (OPT->isObjCQualifiedIdType()) { 3112 getObjCEncodingForTypeImpl(getObjCIdType(), S, 3113 ExpandPointedToStructures, 3114 ExpandStructures, FD); 3115 if (FD || EncodingProperty) { 3116 // Note that we do extended encoding of protocol qualifer list 3117 // Only when doing ivar or property encoding. 3118 S += '"'; 3119 for (ObjCObjectPointerType::qual_iterator I = OPT->qual_begin(), 3120 E = OPT->qual_end(); I != E; ++I) { 3121 S += '<'; 3122 S += (*I)->getNameAsString(); 3123 S += '>'; 3124 } 3125 S += '"'; 3126 } 3127 return; 3128 } 3129 3130 QualType PointeeTy = OPT->getPointeeType(); 3131 if (!EncodingProperty && 3132 isa<TypedefType>(PointeeTy.getTypePtr())) { 3133 // Another historical/compatibility reason. 3134 // We encode the underlying type which comes out as 3135 // {...}; 3136 S += '^'; 3137 getObjCEncodingForTypeImpl(PointeeTy, S, 3138 false, ExpandPointedToStructures, 3139 NULL); 3140 return; 3141 } 3142 3143 S += '@'; 3144 if (FD || EncodingProperty) { 3145 S += '"'; 3146 S += OPT->getInterfaceDecl()->getNameAsCString(); 3147 for (ObjCObjectPointerType::qual_iterator I = OPT->qual_begin(), 3148 E = OPT->qual_end(); I != E; ++I) { 3149 S += '<'; 3150 S += (*I)->getNameAsString(); 3151 S += '>'; 3152 } 3153 S += '"'; 3154 } 3155 return; 3156 } 3157 3158 assert(0 && "@encode for type not implemented!"); 3159} 3160 3161void ASTContext::getObjCEncodingForTypeQualifier(Decl::ObjCDeclQualifier QT, 3162 std::string& S) const { 3163 if (QT & Decl::OBJC_TQ_In) 3164 S += 'n'; 3165 if (QT & Decl::OBJC_TQ_Inout) 3166 S += 'N'; 3167 if (QT & Decl::OBJC_TQ_Out) 3168 S += 'o'; 3169 if (QT & Decl::OBJC_TQ_Bycopy) 3170 S += 'O'; 3171 if (QT & Decl::OBJC_TQ_Byref) 3172 S += 'R'; 3173 if (QT & Decl::OBJC_TQ_Oneway) 3174 S += 'V'; 3175} 3176 3177void ASTContext::setBuiltinVaListType(QualType T) { 3178 assert(BuiltinVaListType.isNull() && "__builtin_va_list type already set!"); 3179 3180 BuiltinVaListType = T; 3181} 3182 3183void ASTContext::setObjCIdType(QualType T) { 3184 ObjCIdTypedefType = T; 3185} 3186 3187void ASTContext::setObjCSelType(QualType T) { 3188 ObjCSelType = T; 3189 3190 const TypedefType *TT = T->getAsTypedefType(); 3191 if (!TT) 3192 return; 3193 TypedefDecl *TD = TT->getDecl(); 3194 3195 // typedef struct objc_selector *SEL; 3196 const PointerType *ptr = TD->getUnderlyingType()->getAs<PointerType>(); 3197 if (!ptr) 3198 return; 3199 const RecordType *rec = ptr->getPointeeType()->getAsStructureType(); 3200 if (!rec) 3201 return; 3202 SelStructType = rec; 3203} 3204 3205void ASTContext::setObjCProtoType(QualType QT) { 3206 ObjCProtoType = QT; 3207} 3208 3209void ASTContext::setObjCClassType(QualType T) { 3210 ObjCClassTypedefType = T; 3211} 3212 3213void ASTContext::setObjCConstantStringInterface(ObjCInterfaceDecl *Decl) { 3214 assert(ObjCConstantStringType.isNull() && 3215 "'NSConstantString' type already set!"); 3216 3217 ObjCConstantStringType = getObjCInterfaceType(Decl); 3218} 3219 3220/// \brief Retrieve the template name that represents a qualified 3221/// template name such as \c std::vector. 3222TemplateName ASTContext::getQualifiedTemplateName(NestedNameSpecifier *NNS, 3223 bool TemplateKeyword, 3224 TemplateDecl *Template) { 3225 llvm::FoldingSetNodeID ID; 3226 QualifiedTemplateName::Profile(ID, NNS, TemplateKeyword, Template); 3227 3228 void *InsertPos = 0; 3229 QualifiedTemplateName *QTN = 3230 QualifiedTemplateNames.FindNodeOrInsertPos(ID, InsertPos); 3231 if (!QTN) { 3232 QTN = new (*this,4) QualifiedTemplateName(NNS, TemplateKeyword, Template); 3233 QualifiedTemplateNames.InsertNode(QTN, InsertPos); 3234 } 3235 3236 return TemplateName(QTN); 3237} 3238 3239/// \brief Retrieve the template name that represents a qualified 3240/// template name such as \c std::vector. 3241TemplateName ASTContext::getQualifiedTemplateName(NestedNameSpecifier *NNS, 3242 bool TemplateKeyword, 3243 OverloadedFunctionDecl *Template) { 3244 llvm::FoldingSetNodeID ID; 3245 QualifiedTemplateName::Profile(ID, NNS, TemplateKeyword, Template); 3246 3247 void *InsertPos = 0; 3248 QualifiedTemplateName *QTN = 3249 QualifiedTemplateNames.FindNodeOrInsertPos(ID, InsertPos); 3250 if (!QTN) { 3251 QTN = new (*this,4) QualifiedTemplateName(NNS, TemplateKeyword, Template); 3252 QualifiedTemplateNames.InsertNode(QTN, InsertPos); 3253 } 3254 3255 return TemplateName(QTN); 3256} 3257 3258/// \brief Retrieve the template name that represents a dependent 3259/// template name such as \c MetaFun::template apply. 3260TemplateName ASTContext::getDependentTemplateName(NestedNameSpecifier *NNS, 3261 const IdentifierInfo *Name) { 3262 assert(NNS->isDependent() && "Nested name specifier must be dependent"); 3263 3264 llvm::FoldingSetNodeID ID; 3265 DependentTemplateName::Profile(ID, NNS, Name); 3266 3267 void *InsertPos = 0; 3268 DependentTemplateName *QTN = 3269 DependentTemplateNames.FindNodeOrInsertPos(ID, InsertPos); 3270 3271 if (QTN) 3272 return TemplateName(QTN); 3273 3274 NestedNameSpecifier *CanonNNS = getCanonicalNestedNameSpecifier(NNS); 3275 if (CanonNNS == NNS) { 3276 QTN = new (*this,4) DependentTemplateName(NNS, Name); 3277 } else { 3278 TemplateName Canon = getDependentTemplateName(CanonNNS, Name); 3279 QTN = new (*this,4) DependentTemplateName(NNS, Name, Canon); 3280 } 3281 3282 DependentTemplateNames.InsertNode(QTN, InsertPos); 3283 return TemplateName(QTN); 3284} 3285 3286/// getFromTargetType - Given one of the integer types provided by 3287/// TargetInfo, produce the corresponding type. The unsigned @p Type 3288/// is actually a value of type @c TargetInfo::IntType. 3289QualType ASTContext::getFromTargetType(unsigned Type) const { 3290 switch (Type) { 3291 case TargetInfo::NoInt: return QualType(); 3292 case TargetInfo::SignedShort: return ShortTy; 3293 case TargetInfo::UnsignedShort: return UnsignedShortTy; 3294 case TargetInfo::SignedInt: return IntTy; 3295 case TargetInfo::UnsignedInt: return UnsignedIntTy; 3296 case TargetInfo::SignedLong: return LongTy; 3297 case TargetInfo::UnsignedLong: return UnsignedLongTy; 3298 case TargetInfo::SignedLongLong: return LongLongTy; 3299 case TargetInfo::UnsignedLongLong: return UnsignedLongLongTy; 3300 } 3301 3302 assert(false && "Unhandled TargetInfo::IntType value"); 3303 return QualType(); 3304} 3305 3306//===----------------------------------------------------------------------===// 3307// Type Predicates. 3308//===----------------------------------------------------------------------===// 3309 3310/// isObjCNSObjectType - Return true if this is an NSObject object using 3311/// NSObject attribute on a c-style pointer type. 3312/// FIXME - Make it work directly on types. 3313/// FIXME: Move to Type. 3314/// 3315bool ASTContext::isObjCNSObjectType(QualType Ty) const { 3316 if (TypedefType *TDT = dyn_cast<TypedefType>(Ty)) { 3317 if (TypedefDecl *TD = TDT->getDecl()) 3318 if (TD->getAttr<ObjCNSObjectAttr>()) 3319 return true; 3320 } 3321 return false; 3322} 3323 3324/// getObjCGCAttr - Returns one of GCNone, Weak or Strong objc's 3325/// garbage collection attribute. 3326/// 3327QualType::GCAttrTypes ASTContext::getObjCGCAttrKind(const QualType &Ty) const { 3328 QualType::GCAttrTypes GCAttrs = QualType::GCNone; 3329 if (getLangOptions().ObjC1 && 3330 getLangOptions().getGCMode() != LangOptions::NonGC) { 3331 GCAttrs = Ty.getObjCGCAttr(); 3332 // Default behavious under objective-c's gc is for objective-c pointers 3333 // (or pointers to them) be treated as though they were declared 3334 // as __strong. 3335 if (GCAttrs == QualType::GCNone) { 3336 if (Ty->isObjCObjectPointerType()) 3337 GCAttrs = QualType::Strong; 3338 else if (Ty->isPointerType()) 3339 return getObjCGCAttrKind(Ty->getAs<PointerType>()->getPointeeType()); 3340 } 3341 // Non-pointers have none gc'able attribute regardless of the attribute 3342 // set on them. 3343 else if (!Ty->isAnyPointerType() && !Ty->isBlockPointerType()) 3344 return QualType::GCNone; 3345 } 3346 return GCAttrs; 3347} 3348 3349//===----------------------------------------------------------------------===// 3350// Type Compatibility Testing 3351//===----------------------------------------------------------------------===// 3352 3353/// areCompatVectorTypes - Return true if the two specified vector types are 3354/// compatible. 3355static bool areCompatVectorTypes(const VectorType *LHS, 3356 const VectorType *RHS) { 3357 assert(LHS->isCanonical() && RHS->isCanonical()); 3358 return LHS->getElementType() == RHS->getElementType() && 3359 LHS->getNumElements() == RHS->getNumElements(); 3360} 3361 3362//===----------------------------------------------------------------------===// 3363// ObjCQualifiedIdTypesAreCompatible - Compatibility testing for qualified id's. 3364//===----------------------------------------------------------------------===// 3365 3366/// ProtocolCompatibleWithProtocol - return 'true' if 'lProto' is in the 3367/// inheritance hierarchy of 'rProto'. 3368bool ASTContext::ProtocolCompatibleWithProtocol(ObjCProtocolDecl *lProto, 3369 ObjCProtocolDecl *rProto) { 3370 if (lProto == rProto) 3371 return true; 3372 for (ObjCProtocolDecl::protocol_iterator PI = rProto->protocol_begin(), 3373 E = rProto->protocol_end(); PI != E; ++PI) 3374 if (ProtocolCompatibleWithProtocol(lProto, *PI)) 3375 return true; 3376 return false; 3377} 3378 3379/// QualifiedIdConformsQualifiedId - compare id<p,...> with id<p1,...> 3380/// return true if lhs's protocols conform to rhs's protocol; false 3381/// otherwise. 3382bool ASTContext::QualifiedIdConformsQualifiedId(QualType lhs, QualType rhs) { 3383 if (lhs->isObjCQualifiedIdType() && rhs->isObjCQualifiedIdType()) 3384 return ObjCQualifiedIdTypesAreCompatible(lhs, rhs, false); 3385 return false; 3386} 3387 3388/// ObjCQualifiedIdTypesAreCompatible - We know that one of lhs/rhs is an 3389/// ObjCQualifiedIDType. 3390bool ASTContext::ObjCQualifiedIdTypesAreCompatible(QualType lhs, QualType rhs, 3391 bool compare) { 3392 // Allow id<P..> and an 'id' or void* type in all cases. 3393 if (lhs->isVoidPointerType() || 3394 lhs->isObjCIdType() || lhs->isObjCClassType()) 3395 return true; 3396 else if (rhs->isVoidPointerType() || 3397 rhs->isObjCIdType() || rhs->isObjCClassType()) 3398 return true; 3399 3400 if (const ObjCObjectPointerType *lhsQID = lhs->getAsObjCQualifiedIdType()) { 3401 const ObjCObjectPointerType *rhsOPT = rhs->getAsObjCObjectPointerType(); 3402 3403 if (!rhsOPT) return false; 3404 3405 if (rhsOPT->qual_empty()) { 3406 // If the RHS is a unqualified interface pointer "NSString*", 3407 // make sure we check the class hierarchy. 3408 if (ObjCInterfaceDecl *rhsID = rhsOPT->getInterfaceDecl()) { 3409 for (ObjCObjectPointerType::qual_iterator I = lhsQID->qual_begin(), 3410 E = lhsQID->qual_end(); I != E; ++I) { 3411 // when comparing an id<P> on lhs with a static type on rhs, 3412 // see if static class implements all of id's protocols, directly or 3413 // through its super class and categories. 3414 if (!rhsID->ClassImplementsProtocol(*I, true)) 3415 return false; 3416 } 3417 } 3418 // If there are no qualifiers and no interface, we have an 'id'. 3419 return true; 3420 } 3421 // Both the right and left sides have qualifiers. 3422 for (ObjCObjectPointerType::qual_iterator I = lhsQID->qual_begin(), 3423 E = lhsQID->qual_end(); I != E; ++I) { 3424 ObjCProtocolDecl *lhsProto = *I; 3425 bool match = false; 3426 3427 // when comparing an id<P> on lhs with a static type on rhs, 3428 // see if static class implements all of id's protocols, directly or 3429 // through its super class and categories. 3430 for (ObjCObjectPointerType::qual_iterator J = rhsOPT->qual_begin(), 3431 E = rhsOPT->qual_end(); J != E; ++J) { 3432 ObjCProtocolDecl *rhsProto = *J; 3433 if (ProtocolCompatibleWithProtocol(lhsProto, rhsProto) || 3434 (compare && ProtocolCompatibleWithProtocol(rhsProto, lhsProto))) { 3435 match = true; 3436 break; 3437 } 3438 } 3439 // If the RHS is a qualified interface pointer "NSString<P>*", 3440 // make sure we check the class hierarchy. 3441 if (ObjCInterfaceDecl *rhsID = rhsOPT->getInterfaceDecl()) { 3442 for (ObjCObjectPointerType::qual_iterator I = lhsQID->qual_begin(), 3443 E = lhsQID->qual_end(); I != E; ++I) { 3444 // when comparing an id<P> on lhs with a static type on rhs, 3445 // see if static class implements all of id's protocols, directly or 3446 // through its super class and categories. 3447 if (rhsID->ClassImplementsProtocol(*I, true)) { 3448 match = true; 3449 break; 3450 } 3451 } 3452 } 3453 if (!match) 3454 return false; 3455 } 3456 3457 return true; 3458 } 3459 3460 const ObjCObjectPointerType *rhsQID = rhs->getAsObjCQualifiedIdType(); 3461 assert(rhsQID && "One of the LHS/RHS should be id<x>"); 3462 3463 if (const ObjCObjectPointerType *lhsOPT = 3464 lhs->getAsObjCInterfacePointerType()) { 3465 if (lhsOPT->qual_empty()) { 3466 bool match = false; 3467 if (ObjCInterfaceDecl *lhsID = lhsOPT->getInterfaceDecl()) { 3468 for (ObjCObjectPointerType::qual_iterator I = rhsQID->qual_begin(), 3469 E = rhsQID->qual_end(); I != E; ++I) { 3470 // when comparing an id<P> on lhs with a static type on rhs, 3471 // see if static class implements all of id's protocols, directly or 3472 // through its super class and categories. 3473 if (lhsID->ClassImplementsProtocol(*I, true)) { 3474 match = true; 3475 break; 3476 } 3477 } 3478 if (!match) 3479 return false; 3480 } 3481 return true; 3482 } 3483 // Both the right and left sides have qualifiers. 3484 for (ObjCObjectPointerType::qual_iterator I = lhsOPT->qual_begin(), 3485 E = lhsOPT->qual_end(); I != E; ++I) { 3486 ObjCProtocolDecl *lhsProto = *I; 3487 bool match = false; 3488 3489 // when comparing an id<P> on lhs with a static type on rhs, 3490 // see if static class implements all of id's protocols, directly or 3491 // through its super class and categories. 3492 for (ObjCObjectPointerType::qual_iterator J = rhsQID->qual_begin(), 3493 E = rhsQID->qual_end(); J != E; ++J) { 3494 ObjCProtocolDecl *rhsProto = *J; 3495 if (ProtocolCompatibleWithProtocol(lhsProto, rhsProto) || 3496 (compare && ProtocolCompatibleWithProtocol(rhsProto, lhsProto))) { 3497 match = true; 3498 break; 3499 } 3500 } 3501 if (!match) 3502 return false; 3503 } 3504 return true; 3505 } 3506 return false; 3507} 3508 3509/// canAssignObjCInterfaces - Return true if the two interface types are 3510/// compatible for assignment from RHS to LHS. This handles validation of any 3511/// protocol qualifiers on the LHS or RHS. 3512/// 3513bool ASTContext::canAssignObjCInterfaces(const ObjCObjectPointerType *LHSOPT, 3514 const ObjCObjectPointerType *RHSOPT) { 3515 // If either type represents the built-in 'id' or 'Class' types, return true. 3516 if (LHSOPT->isObjCBuiltinType() || RHSOPT->isObjCBuiltinType()) 3517 return true; 3518 3519 if (LHSOPT->isObjCQualifiedIdType() || RHSOPT->isObjCQualifiedIdType()) 3520 return ObjCQualifiedIdTypesAreCompatible(QualType(LHSOPT,0), 3521 QualType(RHSOPT,0), 3522 false); 3523 3524 const ObjCInterfaceType* LHS = LHSOPT->getInterfaceType(); 3525 const ObjCInterfaceType* RHS = RHSOPT->getInterfaceType(); 3526 if (LHS && RHS) // We have 2 user-defined types. 3527 return canAssignObjCInterfaces(LHS, RHS); 3528 3529 return false; 3530} 3531 3532bool ASTContext::canAssignObjCInterfaces(const ObjCInterfaceType *LHS, 3533 const ObjCInterfaceType *RHS) { 3534 // Verify that the base decls are compatible: the RHS must be a subclass of 3535 // the LHS. 3536 if (!LHS->getDecl()->isSuperClassOf(RHS->getDecl())) 3537 return false; 3538 3539 // RHS must have a superset of the protocols in the LHS. If the LHS is not 3540 // protocol qualified at all, then we are good. 3541 if (LHS->getNumProtocols() == 0) 3542 return true; 3543 3544 // Okay, we know the LHS has protocol qualifiers. If the RHS doesn't, then it 3545 // isn't a superset. 3546 if (RHS->getNumProtocols() == 0) 3547 return true; // FIXME: should return false! 3548 3549 for (ObjCInterfaceType::qual_iterator LHSPI = LHS->qual_begin(), 3550 LHSPE = LHS->qual_end(); 3551 LHSPI != LHSPE; LHSPI++) { 3552 bool RHSImplementsProtocol = false; 3553 3554 // If the RHS doesn't implement the protocol on the left, the types 3555 // are incompatible. 3556 for (ObjCInterfaceType::qual_iterator RHSPI = RHS->qual_begin(), 3557 RHSPE = RHS->qual_end(); 3558 RHSPI != RHSPE; RHSPI++) { 3559 if ((*RHSPI)->lookupProtocolNamed((*LHSPI)->getIdentifier())) { 3560 RHSImplementsProtocol = true; 3561 break; 3562 } 3563 } 3564 // FIXME: For better diagnostics, consider passing back the protocol name. 3565 if (!RHSImplementsProtocol) 3566 return false; 3567 } 3568 // The RHS implements all protocols listed on the LHS. 3569 return true; 3570} 3571 3572bool ASTContext::areComparableObjCPointerTypes(QualType LHS, QualType RHS) { 3573 // get the "pointed to" types 3574 const ObjCObjectPointerType *LHSOPT = LHS->getAsObjCObjectPointerType(); 3575 const ObjCObjectPointerType *RHSOPT = RHS->getAsObjCObjectPointerType(); 3576 3577 if (!LHSOPT || !RHSOPT) 3578 return false; 3579 3580 return canAssignObjCInterfaces(LHSOPT, RHSOPT) || 3581 canAssignObjCInterfaces(RHSOPT, LHSOPT); 3582} 3583 3584/// typesAreCompatible - C99 6.7.3p9: For two qualified types to be compatible, 3585/// both shall have the identically qualified version of a compatible type. 3586/// C99 6.2.7p1: Two types have compatible types if their types are the 3587/// same. See 6.7.[2,3,5] for additional rules. 3588bool ASTContext::typesAreCompatible(QualType LHS, QualType RHS) { 3589 return !mergeTypes(LHS, RHS).isNull(); 3590} 3591 3592QualType ASTContext::mergeFunctionTypes(QualType lhs, QualType rhs) { 3593 const FunctionType *lbase = lhs->getAsFunctionType(); 3594 const FunctionType *rbase = rhs->getAsFunctionType(); 3595 const FunctionProtoType *lproto = dyn_cast<FunctionProtoType>(lbase); 3596 const FunctionProtoType *rproto = dyn_cast<FunctionProtoType>(rbase); 3597 bool allLTypes = true; 3598 bool allRTypes = true; 3599 3600 // Check return type 3601 QualType retType = mergeTypes(lbase->getResultType(), rbase->getResultType()); 3602 if (retType.isNull()) return QualType(); 3603 if (getCanonicalType(retType) != getCanonicalType(lbase->getResultType())) 3604 allLTypes = false; 3605 if (getCanonicalType(retType) != getCanonicalType(rbase->getResultType())) 3606 allRTypes = false; 3607 // FIXME: double check this 3608 bool NoReturn = lbase->getNoReturnAttr() || rbase->getNoReturnAttr(); 3609 if (NoReturn != lbase->getNoReturnAttr()) 3610 allLTypes = false; 3611 if (NoReturn != rbase->getNoReturnAttr()) 3612 allRTypes = false; 3613 3614 if (lproto && rproto) { // two C99 style function prototypes 3615 assert(!lproto->hasExceptionSpec() && !rproto->hasExceptionSpec() && 3616 "C++ shouldn't be here"); 3617 unsigned lproto_nargs = lproto->getNumArgs(); 3618 unsigned rproto_nargs = rproto->getNumArgs(); 3619 3620 // Compatible functions must have the same number of arguments 3621 if (lproto_nargs != rproto_nargs) 3622 return QualType(); 3623 3624 // Variadic and non-variadic functions aren't compatible 3625 if (lproto->isVariadic() != rproto->isVariadic()) 3626 return QualType(); 3627 3628 if (lproto->getTypeQuals() != rproto->getTypeQuals()) 3629 return QualType(); 3630 3631 // Check argument compatibility 3632 llvm::SmallVector<QualType, 10> types; 3633 for (unsigned i = 0; i < lproto_nargs; i++) { 3634 QualType largtype = lproto->getArgType(i).getUnqualifiedType(); 3635 QualType rargtype = rproto->getArgType(i).getUnqualifiedType(); 3636 QualType argtype = mergeTypes(largtype, rargtype); 3637 if (argtype.isNull()) return QualType(); 3638 types.push_back(argtype); 3639 if (getCanonicalType(argtype) != getCanonicalType(largtype)) 3640 allLTypes = false; 3641 if (getCanonicalType(argtype) != getCanonicalType(rargtype)) 3642 allRTypes = false; 3643 } 3644 if (allLTypes) return lhs; 3645 if (allRTypes) return rhs; 3646 return getFunctionType(retType, types.begin(), types.size(), 3647 lproto->isVariadic(), lproto->getTypeQuals(), 3648 NoReturn); 3649 } 3650 3651 if (lproto) allRTypes = false; 3652 if (rproto) allLTypes = false; 3653 3654 const FunctionProtoType *proto = lproto ? lproto : rproto; 3655 if (proto) { 3656 assert(!proto->hasExceptionSpec() && "C++ shouldn't be here"); 3657 if (proto->isVariadic()) return QualType(); 3658 // Check that the types are compatible with the types that 3659 // would result from default argument promotions (C99 6.7.5.3p15). 3660 // The only types actually affected are promotable integer 3661 // types and floats, which would be passed as a different 3662 // type depending on whether the prototype is visible. 3663 unsigned proto_nargs = proto->getNumArgs(); 3664 for (unsigned i = 0; i < proto_nargs; ++i) { 3665 QualType argTy = proto->getArgType(i); 3666 if (argTy->isPromotableIntegerType() || 3667 getCanonicalType(argTy).getUnqualifiedType() == FloatTy) 3668 return QualType(); 3669 } 3670 3671 if (allLTypes) return lhs; 3672 if (allRTypes) return rhs; 3673 return getFunctionType(retType, proto->arg_type_begin(), 3674 proto->getNumArgs(), proto->isVariadic(), 3675 proto->getTypeQuals(), NoReturn); 3676 } 3677 3678 if (allLTypes) return lhs; 3679 if (allRTypes) return rhs; 3680 return getFunctionNoProtoType(retType, NoReturn); 3681} 3682 3683QualType ASTContext::mergeTypes(QualType LHS, QualType RHS) { 3684 // C++ [expr]: If an expression initially has the type "reference to T", the 3685 // type is adjusted to "T" prior to any further analysis, the expression 3686 // designates the object or function denoted by the reference, and the 3687 // expression is an lvalue unless the reference is an rvalue reference and 3688 // the expression is a function call (possibly inside parentheses). 3689 // FIXME: C++ shouldn't be going through here! The rules are different 3690 // enough that they should be handled separately. 3691 // FIXME: Merging of lvalue and rvalue references is incorrect. C++ *really* 3692 // shouldn't be going through here! 3693 if (const ReferenceType *RT = LHS->getAs<ReferenceType>()) 3694 LHS = RT->getPointeeType(); 3695 if (const ReferenceType *RT = RHS->getAs<ReferenceType>()) 3696 RHS = RT->getPointeeType(); 3697 3698 QualType LHSCan = getCanonicalType(LHS), 3699 RHSCan = getCanonicalType(RHS); 3700 3701 // If two types are identical, they are compatible. 3702 if (LHSCan == RHSCan) 3703 return LHS; 3704 3705 // If the qualifiers are different, the types aren't compatible 3706 // Note that we handle extended qualifiers later, in the 3707 // case for ExtQualType. 3708 if (LHSCan.getCVRQualifiers() != RHSCan.getCVRQualifiers()) 3709 return QualType(); 3710 3711 Type::TypeClass LHSClass = LHSCan->getTypeClass(); 3712 Type::TypeClass RHSClass = RHSCan->getTypeClass(); 3713 3714 // We want to consider the two function types to be the same for these 3715 // comparisons, just force one to the other. 3716 if (LHSClass == Type::FunctionProto) LHSClass = Type::FunctionNoProto; 3717 if (RHSClass == Type::FunctionProto) RHSClass = Type::FunctionNoProto; 3718 3719 // Strip off objc_gc attributes off the top level so they can be merged. 3720 // This is a complete mess, but the attribute itself doesn't make much sense. 3721 if (RHSClass == Type::ExtQual) { 3722 QualType::GCAttrTypes GCAttr = RHSCan.getObjCGCAttr(); 3723 if (GCAttr != QualType::GCNone) { 3724 QualType::GCAttrTypes GCLHSAttr = LHSCan.getObjCGCAttr(); 3725 // __weak attribute must appear on both declarations. 3726 // __strong attribue is redundant if other decl is an objective-c 3727 // object pointer (or decorated with __strong attribute); otherwise 3728 // issue error. 3729 if ((GCAttr == QualType::Weak && GCLHSAttr != GCAttr) || 3730 (GCAttr == QualType::Strong && GCLHSAttr != GCAttr && 3731 !LHSCan->isObjCObjectPointerType())) 3732 return QualType(); 3733 3734 RHS = QualType(cast<ExtQualType>(RHS.getDesugaredType())->getBaseType(), 3735 RHS.getCVRQualifiers()); 3736 QualType Result = mergeTypes(LHS, RHS); 3737 if (!Result.isNull()) { 3738 if (Result.getObjCGCAttr() == QualType::GCNone) 3739 Result = getObjCGCQualType(Result, GCAttr); 3740 else if (Result.getObjCGCAttr() != GCAttr) 3741 Result = QualType(); 3742 } 3743 return Result; 3744 } 3745 } 3746 if (LHSClass == Type::ExtQual) { 3747 QualType::GCAttrTypes GCAttr = LHSCan.getObjCGCAttr(); 3748 if (GCAttr != QualType::GCNone) { 3749 QualType::GCAttrTypes GCRHSAttr = RHSCan.getObjCGCAttr(); 3750 // __weak attribute must appear on both declarations. __strong 3751 // __strong attribue is redundant if other decl is an objective-c 3752 // object pointer (or decorated with __strong attribute); otherwise 3753 // issue error. 3754 if ((GCAttr == QualType::Weak && GCRHSAttr != GCAttr) || 3755 (GCAttr == QualType::Strong && GCRHSAttr != GCAttr && 3756 !RHSCan->isObjCObjectPointerType())) 3757 return QualType(); 3758 3759 LHS = QualType(cast<ExtQualType>(LHS.getDesugaredType())->getBaseType(), 3760 LHS.getCVRQualifiers()); 3761 QualType Result = mergeTypes(LHS, RHS); 3762 if (!Result.isNull()) { 3763 if (Result.getObjCGCAttr() == QualType::GCNone) 3764 Result = getObjCGCQualType(Result, GCAttr); 3765 else if (Result.getObjCGCAttr() != GCAttr) 3766 Result = QualType(); 3767 } 3768 return Result; 3769 } 3770 } 3771 3772 // Same as above for arrays 3773 if (LHSClass == Type::VariableArray || LHSClass == Type::IncompleteArray) 3774 LHSClass = Type::ConstantArray; 3775 if (RHSClass == Type::VariableArray || RHSClass == Type::IncompleteArray) 3776 RHSClass = Type::ConstantArray; 3777 3778 // Canonicalize ExtVector -> Vector. 3779 if (LHSClass == Type::ExtVector) LHSClass = Type::Vector; 3780 if (RHSClass == Type::ExtVector) RHSClass = Type::Vector; 3781 3782 // If the canonical type classes don't match. 3783 if (LHSClass != RHSClass) { 3784 // C99 6.7.2.2p4: Each enumerated type shall be compatible with char, 3785 // a signed integer type, or an unsigned integer type. 3786 if (const EnumType* ETy = LHS->getAsEnumType()) { 3787 if (ETy->getDecl()->getIntegerType() == RHSCan.getUnqualifiedType()) 3788 return RHS; 3789 } 3790 if (const EnumType* ETy = RHS->getAsEnumType()) { 3791 if (ETy->getDecl()->getIntegerType() == LHSCan.getUnqualifiedType()) 3792 return LHS; 3793 } 3794 3795 return QualType(); 3796 } 3797 3798 // The canonical type classes match. 3799 switch (LHSClass) { 3800#define TYPE(Class, Base) 3801#define ABSTRACT_TYPE(Class, Base) 3802#define NON_CANONICAL_TYPE(Class, Base) case Type::Class: 3803#define DEPENDENT_TYPE(Class, Base) case Type::Class: 3804#include "clang/AST/TypeNodes.def" 3805 assert(false && "Non-canonical and dependent types shouldn't get here"); 3806 return QualType(); 3807 3808 case Type::LValueReference: 3809 case Type::RValueReference: 3810 case Type::MemberPointer: 3811 assert(false && "C++ should never be in mergeTypes"); 3812 return QualType(); 3813 3814 case Type::IncompleteArray: 3815 case Type::VariableArray: 3816 case Type::FunctionProto: 3817 case Type::ExtVector: 3818 assert(false && "Types are eliminated above"); 3819 return QualType(); 3820 3821 case Type::Pointer: 3822 { 3823 // Merge two pointer types, while trying to preserve typedef info 3824 QualType LHSPointee = LHS->getAs<PointerType>()->getPointeeType(); 3825 QualType RHSPointee = RHS->getAs<PointerType>()->getPointeeType(); 3826 QualType ResultType = mergeTypes(LHSPointee, RHSPointee); 3827 if (ResultType.isNull()) return QualType(); 3828 if (getCanonicalType(LHSPointee) == getCanonicalType(ResultType)) 3829 return LHS; 3830 if (getCanonicalType(RHSPointee) == getCanonicalType(ResultType)) 3831 return RHS; 3832 return getPointerType(ResultType); 3833 } 3834 case Type::BlockPointer: 3835 { 3836 // Merge two block pointer types, while trying to preserve typedef info 3837 QualType LHSPointee = LHS->getAs<BlockPointerType>()->getPointeeType(); 3838 QualType RHSPointee = RHS->getAs<BlockPointerType>()->getPointeeType(); 3839 QualType ResultType = mergeTypes(LHSPointee, RHSPointee); 3840 if (ResultType.isNull()) return QualType(); 3841 if (getCanonicalType(LHSPointee) == getCanonicalType(ResultType)) 3842 return LHS; 3843 if (getCanonicalType(RHSPointee) == getCanonicalType(ResultType)) 3844 return RHS; 3845 return getBlockPointerType(ResultType); 3846 } 3847 case Type::ConstantArray: 3848 { 3849 const ConstantArrayType* LCAT = getAsConstantArrayType(LHS); 3850 const ConstantArrayType* RCAT = getAsConstantArrayType(RHS); 3851 if (LCAT && RCAT && RCAT->getSize() != LCAT->getSize()) 3852 return QualType(); 3853 3854 QualType LHSElem = getAsArrayType(LHS)->getElementType(); 3855 QualType RHSElem = getAsArrayType(RHS)->getElementType(); 3856 QualType ResultType = mergeTypes(LHSElem, RHSElem); 3857 if (ResultType.isNull()) return QualType(); 3858 if (LCAT && getCanonicalType(LHSElem) == getCanonicalType(ResultType)) 3859 return LHS; 3860 if (RCAT && getCanonicalType(RHSElem) == getCanonicalType(ResultType)) 3861 return RHS; 3862 if (LCAT) return getConstantArrayType(ResultType, LCAT->getSize(), 3863 ArrayType::ArraySizeModifier(), 0); 3864 if (RCAT) return getConstantArrayType(ResultType, RCAT->getSize(), 3865 ArrayType::ArraySizeModifier(), 0); 3866 const VariableArrayType* LVAT = getAsVariableArrayType(LHS); 3867 const VariableArrayType* RVAT = getAsVariableArrayType(RHS); 3868 if (LVAT && getCanonicalType(LHSElem) == getCanonicalType(ResultType)) 3869 return LHS; 3870 if (RVAT && getCanonicalType(RHSElem) == getCanonicalType(ResultType)) 3871 return RHS; 3872 if (LVAT) { 3873 // FIXME: This isn't correct! But tricky to implement because 3874 // the array's size has to be the size of LHS, but the type 3875 // has to be different. 3876 return LHS; 3877 } 3878 if (RVAT) { 3879 // FIXME: This isn't correct! But tricky to implement because 3880 // the array's size has to be the size of RHS, but the type 3881 // has to be different. 3882 return RHS; 3883 } 3884 if (getCanonicalType(LHSElem) == getCanonicalType(ResultType)) return LHS; 3885 if (getCanonicalType(RHSElem) == getCanonicalType(ResultType)) return RHS; 3886 return getIncompleteArrayType(ResultType, 3887 ArrayType::ArraySizeModifier(), 0); 3888 } 3889 case Type::FunctionNoProto: 3890 return mergeFunctionTypes(LHS, RHS); 3891 case Type::Record: 3892 case Type::Enum: 3893 return QualType(); 3894 case Type::Builtin: 3895 // Only exactly equal builtin types are compatible, which is tested above. 3896 return QualType(); 3897 case Type::Complex: 3898 // Distinct complex types are incompatible. 3899 return QualType(); 3900 case Type::Vector: 3901 // FIXME: The merged type should be an ExtVector! 3902 if (areCompatVectorTypes(LHS->getAsVectorType(), RHS->getAsVectorType())) 3903 return LHS; 3904 return QualType(); 3905 case Type::ObjCInterface: { 3906 // Check if the interfaces are assignment compatible. 3907 // FIXME: This should be type compatibility, e.g. whether 3908 // "LHS x; RHS x;" at global scope is legal. 3909 const ObjCInterfaceType* LHSIface = LHS->getAsObjCInterfaceType(); 3910 const ObjCInterfaceType* RHSIface = RHS->getAsObjCInterfaceType(); 3911 if (LHSIface && RHSIface && 3912 canAssignObjCInterfaces(LHSIface, RHSIface)) 3913 return LHS; 3914 3915 return QualType(); 3916 } 3917 case Type::ObjCObjectPointer: { 3918 if (canAssignObjCInterfaces(LHS->getAsObjCObjectPointerType(), 3919 RHS->getAsObjCObjectPointerType())) 3920 return LHS; 3921 3922 return QualType(); 3923 } 3924 case Type::FixedWidthInt: 3925 // Distinct fixed-width integers are not compatible. 3926 return QualType(); 3927 case Type::ExtQual: 3928 // FIXME: ExtQual types can be compatible even if they're not 3929 // identical! 3930 return QualType(); 3931 // First attempt at an implementation, but I'm not really sure it's 3932 // right... 3933#if 0 3934 ExtQualType* LQual = cast<ExtQualType>(LHSCan); 3935 ExtQualType* RQual = cast<ExtQualType>(RHSCan); 3936 if (LQual->getAddressSpace() != RQual->getAddressSpace() || 3937 LQual->getObjCGCAttr() != RQual->getObjCGCAttr()) 3938 return QualType(); 3939 QualType LHSBase, RHSBase, ResultType, ResCanUnqual; 3940 LHSBase = QualType(LQual->getBaseType(), 0); 3941 RHSBase = QualType(RQual->getBaseType(), 0); 3942 ResultType = mergeTypes(LHSBase, RHSBase); 3943 if (ResultType.isNull()) return QualType(); 3944 ResCanUnqual = getCanonicalType(ResultType).getUnqualifiedType(); 3945 if (LHSCan.getUnqualifiedType() == ResCanUnqual) 3946 return LHS; 3947 if (RHSCan.getUnqualifiedType() == ResCanUnqual) 3948 return RHS; 3949 ResultType = getAddrSpaceQualType(ResultType, LQual->getAddressSpace()); 3950 ResultType = getObjCGCQualType(ResultType, LQual->getObjCGCAttr()); 3951 ResultType.setCVRQualifiers(LHSCan.getCVRQualifiers()); 3952 return ResultType; 3953#endif 3954 3955 case Type::TemplateSpecialization: 3956 assert(false && "Dependent types have no size"); 3957 break; 3958 } 3959 3960 return QualType(); 3961} 3962 3963//===----------------------------------------------------------------------===// 3964// Integer Predicates 3965//===----------------------------------------------------------------------===// 3966 3967unsigned ASTContext::getIntWidth(QualType T) { 3968 if (T == BoolTy) 3969 return 1; 3970 if (FixedWidthIntType* FWIT = dyn_cast<FixedWidthIntType>(T)) { 3971 return FWIT->getWidth(); 3972 } 3973 // For builtin types, just use the standard type sizing method 3974 return (unsigned)getTypeSize(T); 3975} 3976 3977QualType ASTContext::getCorrespondingUnsignedType(QualType T) { 3978 assert(T->isSignedIntegerType() && "Unexpected type"); 3979 if (const EnumType* ETy = T->getAsEnumType()) 3980 T = ETy->getDecl()->getIntegerType(); 3981 const BuiltinType* BTy = T->getAsBuiltinType(); 3982 assert (BTy && "Unexpected signed integer type"); 3983 switch (BTy->getKind()) { 3984 case BuiltinType::Char_S: 3985 case BuiltinType::SChar: 3986 return UnsignedCharTy; 3987 case BuiltinType::Short: 3988 return UnsignedShortTy; 3989 case BuiltinType::Int: 3990 return UnsignedIntTy; 3991 case BuiltinType::Long: 3992 return UnsignedLongTy; 3993 case BuiltinType::LongLong: 3994 return UnsignedLongLongTy; 3995 case BuiltinType::Int128: 3996 return UnsignedInt128Ty; 3997 default: 3998 assert(0 && "Unexpected signed integer type"); 3999 return QualType(); 4000 } 4001} 4002 4003ExternalASTSource::~ExternalASTSource() { } 4004 4005void ExternalASTSource::PrintStats() { } 4006 4007 4008//===----------------------------------------------------------------------===// 4009// Builtin Type Computation 4010//===----------------------------------------------------------------------===// 4011 4012/// DecodeTypeFromStr - This decodes one type descriptor from Str, advancing the 4013/// pointer over the consumed characters. This returns the resultant type. 4014static QualType DecodeTypeFromStr(const char *&Str, ASTContext &Context, 4015 ASTContext::GetBuiltinTypeError &Error, 4016 bool AllowTypeModifiers = true) { 4017 // Modifiers. 4018 int HowLong = 0; 4019 bool Signed = false, Unsigned = false; 4020 4021 // Read the modifiers first. 4022 bool Done = false; 4023 while (!Done) { 4024 switch (*Str++) { 4025 default: Done = true; --Str; break; 4026 case 'S': 4027 assert(!Unsigned && "Can't use both 'S' and 'U' modifiers!"); 4028 assert(!Signed && "Can't use 'S' modifier multiple times!"); 4029 Signed = true; 4030 break; 4031 case 'U': 4032 assert(!Signed && "Can't use both 'S' and 'U' modifiers!"); 4033 assert(!Unsigned && "Can't use 'S' modifier multiple times!"); 4034 Unsigned = true; 4035 break; 4036 case 'L': 4037 assert(HowLong <= 2 && "Can't have LLLL modifier"); 4038 ++HowLong; 4039 break; 4040 } 4041 } 4042 4043 QualType Type; 4044 4045 // Read the base type. 4046 switch (*Str++) { 4047 default: assert(0 && "Unknown builtin type letter!"); 4048 case 'v': 4049 assert(HowLong == 0 && !Signed && !Unsigned && 4050 "Bad modifiers used with 'v'!"); 4051 Type = Context.VoidTy; 4052 break; 4053 case 'f': 4054 assert(HowLong == 0 && !Signed && !Unsigned && 4055 "Bad modifiers used with 'f'!"); 4056 Type = Context.FloatTy; 4057 break; 4058 case 'd': 4059 assert(HowLong < 2 && !Signed && !Unsigned && 4060 "Bad modifiers used with 'd'!"); 4061 if (HowLong) 4062 Type = Context.LongDoubleTy; 4063 else 4064 Type = Context.DoubleTy; 4065 break; 4066 case 's': 4067 assert(HowLong == 0 && "Bad modifiers used with 's'!"); 4068 if (Unsigned) 4069 Type = Context.UnsignedShortTy; 4070 else 4071 Type = Context.ShortTy; 4072 break; 4073 case 'i': 4074 if (HowLong == 3) 4075 Type = Unsigned ? Context.UnsignedInt128Ty : Context.Int128Ty; 4076 else if (HowLong == 2) 4077 Type = Unsigned ? Context.UnsignedLongLongTy : Context.LongLongTy; 4078 else if (HowLong == 1) 4079 Type = Unsigned ? Context.UnsignedLongTy : Context.LongTy; 4080 else 4081 Type = Unsigned ? Context.UnsignedIntTy : Context.IntTy; 4082 break; 4083 case 'c': 4084 assert(HowLong == 0 && "Bad modifiers used with 'c'!"); 4085 if (Signed) 4086 Type = Context.SignedCharTy; 4087 else if (Unsigned) 4088 Type = Context.UnsignedCharTy; 4089 else 4090 Type = Context.CharTy; 4091 break; 4092 case 'b': // boolean 4093 assert(HowLong == 0 && !Signed && !Unsigned && "Bad modifiers for 'b'!"); 4094 Type = Context.BoolTy; 4095 break; 4096 case 'z': // size_t. 4097 assert(HowLong == 0 && !Signed && !Unsigned && "Bad modifiers for 'z'!"); 4098 Type = Context.getSizeType(); 4099 break; 4100 case 'F': 4101 Type = Context.getCFConstantStringType(); 4102 break; 4103 case 'a': 4104 Type = Context.getBuiltinVaListType(); 4105 assert(!Type.isNull() && "builtin va list type not initialized!"); 4106 break; 4107 case 'A': 4108 // This is a "reference" to a va_list; however, what exactly 4109 // this means depends on how va_list is defined. There are two 4110 // different kinds of va_list: ones passed by value, and ones 4111 // passed by reference. An example of a by-value va_list is 4112 // x86, where va_list is a char*. An example of by-ref va_list 4113 // is x86-64, where va_list is a __va_list_tag[1]. For x86, 4114 // we want this argument to be a char*&; for x86-64, we want 4115 // it to be a __va_list_tag*. 4116 Type = Context.getBuiltinVaListType(); 4117 assert(!Type.isNull() && "builtin va list type not initialized!"); 4118 if (Type->isArrayType()) { 4119 Type = Context.getArrayDecayedType(Type); 4120 } else { 4121 Type = Context.getLValueReferenceType(Type); 4122 } 4123 break; 4124 case 'V': { 4125 char *End; 4126 unsigned NumElements = strtoul(Str, &End, 10); 4127 assert(End != Str && "Missing vector size"); 4128 4129 Str = End; 4130 4131 QualType ElementType = DecodeTypeFromStr(Str, Context, Error, false); 4132 Type = Context.getVectorType(ElementType, NumElements); 4133 break; 4134 } 4135 case 'P': 4136 Type = Context.getFILEType(); 4137 if (Type.isNull()) { 4138 Error = ASTContext::GE_Missing_stdio; 4139 return QualType(); 4140 } 4141 break; 4142 case 'J': 4143 if (Signed) 4144 Type = Context.getsigjmp_bufType(); 4145 else 4146 Type = Context.getjmp_bufType(); 4147 4148 if (Type.isNull()) { 4149 Error = ASTContext::GE_Missing_setjmp; 4150 return QualType(); 4151 } 4152 break; 4153 } 4154 4155 if (!AllowTypeModifiers) 4156 return Type; 4157 4158 Done = false; 4159 while (!Done) { 4160 switch (*Str++) { 4161 default: Done = true; --Str; break; 4162 case '*': 4163 Type = Context.getPointerType(Type); 4164 break; 4165 case '&': 4166 Type = Context.getLValueReferenceType(Type); 4167 break; 4168 // FIXME: There's no way to have a built-in with an rvalue ref arg. 4169 case 'C': 4170 Type = Type.getQualifiedType(QualType::Const); 4171 break; 4172 } 4173 } 4174 4175 return Type; 4176} 4177 4178/// GetBuiltinType - Return the type for the specified builtin. 4179QualType ASTContext::GetBuiltinType(unsigned id, 4180 GetBuiltinTypeError &Error) { 4181 const char *TypeStr = BuiltinInfo.GetTypeString(id); 4182 4183 llvm::SmallVector<QualType, 8> ArgTypes; 4184 4185 Error = GE_None; 4186 QualType ResType = DecodeTypeFromStr(TypeStr, *this, Error); 4187 if (Error != GE_None) 4188 return QualType(); 4189 while (TypeStr[0] && TypeStr[0] != '.') { 4190 QualType Ty = DecodeTypeFromStr(TypeStr, *this, Error); 4191 if (Error != GE_None) 4192 return QualType(); 4193 4194 // Do array -> pointer decay. The builtin should use the decayed type. 4195 if (Ty->isArrayType()) 4196 Ty = getArrayDecayedType(Ty); 4197 4198 ArgTypes.push_back(Ty); 4199 } 4200 4201 assert((TypeStr[0] != '.' || TypeStr[1] == 0) && 4202 "'.' should only occur at end of builtin type list!"); 4203 4204 // handle untyped/variadic arguments "T c99Style();" or "T cppStyle(...);". 4205 if (ArgTypes.size() == 0 && TypeStr[0] == '.') 4206 return getFunctionNoProtoType(ResType); 4207 return getFunctionType(ResType, ArgTypes.data(), ArgTypes.size(), 4208 TypeStr[0] == '.', 0); 4209} 4210 4211QualType 4212ASTContext::UsualArithmeticConversionsType(QualType lhs, QualType rhs) { 4213 // Perform the usual unary conversions. We do this early so that 4214 // integral promotions to "int" can allow us to exit early, in the 4215 // lhs == rhs check. Also, for conversion purposes, we ignore any 4216 // qualifiers. For example, "const float" and "float" are 4217 // equivalent. 4218 if (lhs->isPromotableIntegerType()) 4219 lhs = getPromotedIntegerType(lhs); 4220 else 4221 lhs = lhs.getUnqualifiedType(); 4222 if (rhs->isPromotableIntegerType()) 4223 rhs = getPromotedIntegerType(rhs); 4224 else 4225 rhs = rhs.getUnqualifiedType(); 4226 4227 // If both types are identical, no conversion is needed. 4228 if (lhs == rhs) 4229 return lhs; 4230 4231 // If either side is a non-arithmetic type (e.g. a pointer), we are done. 4232 // The caller can deal with this (e.g. pointer + int). 4233 if (!lhs->isArithmeticType() || !rhs->isArithmeticType()) 4234 return lhs; 4235 4236 // At this point, we have two different arithmetic types. 4237 4238 // Handle complex types first (C99 6.3.1.8p1). 4239 if (lhs->isComplexType() || rhs->isComplexType()) { 4240 // if we have an integer operand, the result is the complex type. 4241 if (rhs->isIntegerType() || rhs->isComplexIntegerType()) { 4242 // convert the rhs to the lhs complex type. 4243 return lhs; 4244 } 4245 if (lhs->isIntegerType() || lhs->isComplexIntegerType()) { 4246 // convert the lhs to the rhs complex type. 4247 return rhs; 4248 } 4249 // This handles complex/complex, complex/float, or float/complex. 4250 // When both operands are complex, the shorter operand is converted to the 4251 // type of the longer, and that is the type of the result. This corresponds 4252 // to what is done when combining two real floating-point operands. 4253 // The fun begins when size promotion occur across type domains. 4254 // From H&S 6.3.4: When one operand is complex and the other is a real 4255 // floating-point type, the less precise type is converted, within it's 4256 // real or complex domain, to the precision of the other type. For example, 4257 // when combining a "long double" with a "double _Complex", the 4258 // "double _Complex" is promoted to "long double _Complex". 4259 int result = getFloatingTypeOrder(lhs, rhs); 4260 4261 if (result > 0) { // The left side is bigger, convert rhs. 4262 rhs = getFloatingTypeOfSizeWithinDomain(lhs, rhs); 4263 } else if (result < 0) { // The right side is bigger, convert lhs. 4264 lhs = getFloatingTypeOfSizeWithinDomain(rhs, lhs); 4265 } 4266 // At this point, lhs and rhs have the same rank/size. Now, make sure the 4267 // domains match. This is a requirement for our implementation, C99 4268 // does not require this promotion. 4269 if (lhs != rhs) { // Domains don't match, we have complex/float mix. 4270 if (lhs->isRealFloatingType()) { // handle "double, _Complex double". 4271 return rhs; 4272 } else { // handle "_Complex double, double". 4273 return lhs; 4274 } 4275 } 4276 return lhs; // The domain/size match exactly. 4277 } 4278 // Now handle "real" floating types (i.e. float, double, long double). 4279 if (lhs->isRealFloatingType() || rhs->isRealFloatingType()) { 4280 // if we have an integer operand, the result is the real floating type. 4281 if (rhs->isIntegerType()) { 4282 // convert rhs to the lhs floating point type. 4283 return lhs; 4284 } 4285 if (rhs->isComplexIntegerType()) { 4286 // convert rhs to the complex floating point type. 4287 return getComplexType(lhs); 4288 } 4289 if (lhs->isIntegerType()) { 4290 // convert lhs to the rhs floating point type. 4291 return rhs; 4292 } 4293 if (lhs->isComplexIntegerType()) { 4294 // convert lhs to the complex floating point type. 4295 return getComplexType(rhs); 4296 } 4297 // We have two real floating types, float/complex combos were handled above. 4298 // Convert the smaller operand to the bigger result. 4299 int result = getFloatingTypeOrder(lhs, rhs); 4300 if (result > 0) // convert the rhs 4301 return lhs; 4302 assert(result < 0 && "illegal float comparison"); 4303 return rhs; // convert the lhs 4304 } 4305 if (lhs->isComplexIntegerType() || rhs->isComplexIntegerType()) { 4306 // Handle GCC complex int extension. 4307 const ComplexType *lhsComplexInt = lhs->getAsComplexIntegerType(); 4308 const ComplexType *rhsComplexInt = rhs->getAsComplexIntegerType(); 4309 4310 if (lhsComplexInt && rhsComplexInt) { 4311 if (getIntegerTypeOrder(lhsComplexInt->getElementType(), 4312 rhsComplexInt->getElementType()) >= 0) 4313 return lhs; // convert the rhs 4314 return rhs; 4315 } else if (lhsComplexInt && rhs->isIntegerType()) { 4316 // convert the rhs to the lhs complex type. 4317 return lhs; 4318 } else if (rhsComplexInt && lhs->isIntegerType()) { 4319 // convert the lhs to the rhs complex type. 4320 return rhs; 4321 } 4322 } 4323 // Finally, we have two differing integer types. 4324 // The rules for this case are in C99 6.3.1.8 4325 int compare = getIntegerTypeOrder(lhs, rhs); 4326 bool lhsSigned = lhs->isSignedIntegerType(), 4327 rhsSigned = rhs->isSignedIntegerType(); 4328 QualType destType; 4329 if (lhsSigned == rhsSigned) { 4330 // Same signedness; use the higher-ranked type 4331 destType = compare >= 0 ? lhs : rhs; 4332 } else if (compare != (lhsSigned ? 1 : -1)) { 4333 // The unsigned type has greater than or equal rank to the 4334 // signed type, so use the unsigned type 4335 destType = lhsSigned ? rhs : lhs; 4336 } else if (getIntWidth(lhs) != getIntWidth(rhs)) { 4337 // The two types are different widths; if we are here, that 4338 // means the signed type is larger than the unsigned type, so 4339 // use the signed type. 4340 destType = lhsSigned ? lhs : rhs; 4341 } else { 4342 // The signed type is higher-ranked than the unsigned type, 4343 // but isn't actually any bigger (like unsigned int and long 4344 // on most 32-bit systems). Use the unsigned type corresponding 4345 // to the signed type. 4346 destType = getCorrespondingUnsignedType(lhsSigned ? lhs : rhs); 4347 } 4348 return destType; 4349} 4350