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