ASTContext.cpp revision 482b77d1cb4ca08391d1f749436f092a4cc24427
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/Expr.h" 18#include "clang/AST/RecordLayout.h" 19#include "clang/Basic/TargetInfo.h" 20#include "llvm/ADT/StringExtras.h" 21#include "llvm/Bitcode/Serialize.h" 22#include "llvm/Bitcode/Deserialize.h" 23 24using namespace clang; 25 26enum FloatingRank { 27 FloatRank, DoubleRank, LongDoubleRank 28}; 29 30ASTContext::ASTContext(const LangOptions& LOpts, SourceManager &SM, 31 TargetInfo &t, 32 IdentifierTable &idents, SelectorTable &sels, 33 unsigned size_reserve) : 34 CFConstantStringTypeDecl(0), ObjCFastEnumerationStateTypeDecl(0), 35 SourceMgr(SM), LangOpts(LOpts), Target(t), 36 Idents(idents), Selectors(sels) 37{ 38 if (size_reserve > 0) Types.reserve(size_reserve); 39 InitBuiltinTypes(); 40 BuiltinInfo.InitializeBuiltins(idents, Target); 41 TUDecl = TranslationUnitDecl::Create(*this); 42} 43 44ASTContext::~ASTContext() { 45 // Deallocate all the types. 46 while (!Types.empty()) { 47 Types.back()->Destroy(*this); 48 Types.pop_back(); 49 } 50 51 { 52 llvm::DenseMap<const RecordDecl*, const ASTRecordLayout*>::iterator 53 I = ASTRecordLayouts.begin(), E = ASTRecordLayouts.end(); 54 while (I != E) { 55 ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second); 56 delete R; 57 } 58 } 59 60 { 61 llvm::DenseMap<const ObjCInterfaceDecl*, const ASTRecordLayout*>::iterator 62 I = ASTObjCInterfaces.begin(), E = ASTObjCInterfaces.end(); 63 while (I != E) { 64 ASTRecordLayout *R = const_cast<ASTRecordLayout*>((I++)->second); 65 delete R; 66 } 67 } 68 69 { 70 llvm::DenseMap<const ObjCInterfaceDecl*, const RecordDecl*>::iterator 71 I = ASTRecordForInterface.begin(), E = ASTRecordForInterface.end(); 72 while (I != E) { 73 RecordDecl *R = const_cast<RecordDecl*>((I++)->second); 74 R->Destroy(*this); 75 } 76 } 77 78 TUDecl->Destroy(*this); 79} 80 81void ASTContext::PrintStats() const { 82 fprintf(stderr, "*** AST Context Stats:\n"); 83 fprintf(stderr, " %d types total.\n", (int)Types.size()); 84 unsigned NumBuiltin = 0, NumPointer = 0, NumArray = 0, NumFunctionP = 0; 85 unsigned NumVector = 0, NumComplex = 0, NumBlockPointer = 0; 86 unsigned NumFunctionNP = 0, NumTypeName = 0, NumTagged = 0, NumReference = 0; 87 88 unsigned NumTagStruct = 0, NumTagUnion = 0, NumTagEnum = 0, NumTagClass = 0; 89 unsigned NumObjCInterfaces = 0, NumObjCQualifiedInterfaces = 0; 90 unsigned NumObjCQualifiedIds = 0; 91 unsigned NumTypeOfTypes = 0, NumTypeOfExprs = 0; 92 93 for (unsigned i = 0, e = Types.size(); i != e; ++i) { 94 Type *T = Types[i]; 95 if (isa<BuiltinType>(T)) 96 ++NumBuiltin; 97 else if (isa<PointerType>(T)) 98 ++NumPointer; 99 else if (isa<BlockPointerType>(T)) 100 ++NumBlockPointer; 101 else if (isa<ReferenceType>(T)) 102 ++NumReference; 103 else if (isa<ComplexType>(T)) 104 ++NumComplex; 105 else if (isa<ArrayType>(T)) 106 ++NumArray; 107 else if (isa<VectorType>(T)) 108 ++NumVector; 109 else if (isa<FunctionTypeNoProto>(T)) 110 ++NumFunctionNP; 111 else if (isa<FunctionTypeProto>(T)) 112 ++NumFunctionP; 113 else if (isa<TypedefType>(T)) 114 ++NumTypeName; 115 else if (TagType *TT = dyn_cast<TagType>(T)) { 116 ++NumTagged; 117 switch (TT->getDecl()->getTagKind()) { 118 default: assert(0 && "Unknown tagged type!"); 119 case TagDecl::TK_struct: ++NumTagStruct; break; 120 case TagDecl::TK_union: ++NumTagUnion; break; 121 case TagDecl::TK_class: ++NumTagClass; break; 122 case TagDecl::TK_enum: ++NumTagEnum; break; 123 } 124 } else if (isa<ObjCInterfaceType>(T)) 125 ++NumObjCInterfaces; 126 else if (isa<ObjCQualifiedInterfaceType>(T)) 127 ++NumObjCQualifiedInterfaces; 128 else if (isa<ObjCQualifiedIdType>(T)) 129 ++NumObjCQualifiedIds; 130 else if (isa<TypeOfType>(T)) 131 ++NumTypeOfTypes; 132 else if (isa<TypeOfExpr>(T)) 133 ++NumTypeOfExprs; 134 else { 135 QualType(T, 0).dump(); 136 assert(0 && "Unknown type!"); 137 } 138 } 139 140 fprintf(stderr, " %d builtin types\n", NumBuiltin); 141 fprintf(stderr, " %d pointer types\n", NumPointer); 142 fprintf(stderr, " %d block pointer types\n", NumBlockPointer); 143 fprintf(stderr, " %d reference types\n", NumReference); 144 fprintf(stderr, " %d complex types\n", NumComplex); 145 fprintf(stderr, " %d array types\n", NumArray); 146 fprintf(stderr, " %d vector types\n", NumVector); 147 fprintf(stderr, " %d function types with proto\n", NumFunctionP); 148 fprintf(stderr, " %d function types with no proto\n", NumFunctionNP); 149 fprintf(stderr, " %d typename (typedef) types\n", NumTypeName); 150 fprintf(stderr, " %d tagged types\n", NumTagged); 151 fprintf(stderr, " %d struct types\n", NumTagStruct); 152 fprintf(stderr, " %d union types\n", NumTagUnion); 153 fprintf(stderr, " %d class types\n", NumTagClass); 154 fprintf(stderr, " %d enum types\n", NumTagEnum); 155 fprintf(stderr, " %d interface types\n", NumObjCInterfaces); 156 fprintf(stderr, " %d protocol qualified interface types\n", 157 NumObjCQualifiedInterfaces); 158 fprintf(stderr, " %d protocol qualified id types\n", 159 NumObjCQualifiedIds); 160 fprintf(stderr, " %d typeof types\n", NumTypeOfTypes); 161 fprintf(stderr, " %d typeof exprs\n", NumTypeOfExprs); 162 163 fprintf(stderr, "Total bytes = %d\n", int(NumBuiltin*sizeof(BuiltinType)+ 164 NumPointer*sizeof(PointerType)+NumArray*sizeof(ArrayType)+ 165 NumComplex*sizeof(ComplexType)+NumVector*sizeof(VectorType)+ 166 NumFunctionP*sizeof(FunctionTypeProto)+ 167 NumFunctionNP*sizeof(FunctionTypeNoProto)+ 168 NumTypeName*sizeof(TypedefType)+NumTagged*sizeof(TagType)+ 169 NumTypeOfTypes*sizeof(TypeOfType)+NumTypeOfExprs*sizeof(TypeOfExpr))); 170} 171 172 173void ASTContext::InitBuiltinType(QualType &R, BuiltinType::Kind K) { 174 Types.push_back((R = QualType(new BuiltinType(K),0)).getTypePtr()); 175} 176 177void ASTContext::InitBuiltinTypes() { 178 assert(VoidTy.isNull() && "Context reinitialized?"); 179 180 // C99 6.2.5p19. 181 InitBuiltinType(VoidTy, BuiltinType::Void); 182 183 // C99 6.2.5p2. 184 InitBuiltinType(BoolTy, BuiltinType::Bool); 185 // C99 6.2.5p3. 186 if (Target.isCharSigned()) 187 InitBuiltinType(CharTy, BuiltinType::Char_S); 188 else 189 InitBuiltinType(CharTy, BuiltinType::Char_U); 190 // C99 6.2.5p4. 191 InitBuiltinType(SignedCharTy, BuiltinType::SChar); 192 InitBuiltinType(ShortTy, BuiltinType::Short); 193 InitBuiltinType(IntTy, BuiltinType::Int); 194 InitBuiltinType(LongTy, BuiltinType::Long); 195 InitBuiltinType(LongLongTy, BuiltinType::LongLong); 196 197 // C99 6.2.5p6. 198 InitBuiltinType(UnsignedCharTy, BuiltinType::UChar); 199 InitBuiltinType(UnsignedShortTy, BuiltinType::UShort); 200 InitBuiltinType(UnsignedIntTy, BuiltinType::UInt); 201 InitBuiltinType(UnsignedLongTy, BuiltinType::ULong); 202 InitBuiltinType(UnsignedLongLongTy, BuiltinType::ULongLong); 203 204 // C99 6.2.5p10. 205 InitBuiltinType(FloatTy, BuiltinType::Float); 206 InitBuiltinType(DoubleTy, BuiltinType::Double); 207 InitBuiltinType(LongDoubleTy, BuiltinType::LongDouble); 208 209 // C++ 3.9.1p5 210 InitBuiltinType(WCharTy, BuiltinType::WChar); 211 212 // Placeholder type for functions. 213 InitBuiltinType(OverloadTy, BuiltinType::Overload); 214 215 // Placeholder type for type-dependent expressions whose type is 216 // completely unknown. No code should ever check a type against 217 // DependentTy and users should never see it; however, it is here to 218 // help diagnose failures to properly check for type-dependent 219 // expressions. 220 InitBuiltinType(DependentTy, BuiltinType::Dependent); 221 222 // C99 6.2.5p11. 223 FloatComplexTy = getComplexType(FloatTy); 224 DoubleComplexTy = getComplexType(DoubleTy); 225 LongDoubleComplexTy = getComplexType(LongDoubleTy); 226 227 BuiltinVaListType = QualType(); 228 ObjCIdType = QualType(); 229 IdStructType = 0; 230 ObjCClassType = QualType(); 231 ClassStructType = 0; 232 233 ObjCConstantStringType = QualType(); 234 235 // void * type 236 VoidPtrTy = getPointerType(VoidTy); 237} 238 239//===----------------------------------------------------------------------===// 240// Type Sizing and Analysis 241//===----------------------------------------------------------------------===// 242 243/// getFloatTypeSemantics - Return the APFloat 'semantics' for the specified 244/// scalar floating point type. 245const llvm::fltSemantics &ASTContext::getFloatTypeSemantics(QualType T) const { 246 const BuiltinType *BT = T->getAsBuiltinType(); 247 assert(BT && "Not a floating point type!"); 248 switch (BT->getKind()) { 249 default: assert(0 && "Not a floating point type!"); 250 case BuiltinType::Float: return Target.getFloatFormat(); 251 case BuiltinType::Double: return Target.getDoubleFormat(); 252 case BuiltinType::LongDouble: return Target.getLongDoubleFormat(); 253 } 254} 255 256 257/// getTypeSize - Return the size of the specified type, in bits. This method 258/// does not work on incomplete types. 259std::pair<uint64_t, unsigned> 260ASTContext::getTypeInfo(const Type *T) { 261 T = getCanonicalType(T); 262 uint64_t Width; 263 unsigned Align; 264 switch (T->getTypeClass()) { 265 case Type::TypeName: assert(0 && "Not a canonical type!"); 266 case Type::FunctionNoProto: 267 case Type::FunctionProto: 268 default: 269 assert(0 && "Incomplete types have no size!"); 270 case Type::VariableArray: 271 assert(0 && "VLAs not implemented yet!"); 272 case Type::DependentSizedArray: 273 assert(0 && "Dependently-sized arrays don't have a known size"); 274 case Type::ConstantArray: { 275 const ConstantArrayType *CAT = cast<ConstantArrayType>(T); 276 277 std::pair<uint64_t, unsigned> EltInfo = getTypeInfo(CAT->getElementType()); 278 Width = EltInfo.first*CAT->getSize().getZExtValue(); 279 Align = EltInfo.second; 280 break; 281 } 282 case Type::ExtVector: 283 case Type::Vector: { 284 std::pair<uint64_t, unsigned> EltInfo = 285 getTypeInfo(cast<VectorType>(T)->getElementType()); 286 Width = EltInfo.first*cast<VectorType>(T)->getNumElements(); 287 // FIXME: This isn't right for unusual vectors 288 Align = Width; 289 break; 290 } 291 292 case Type::Builtin: 293 switch (cast<BuiltinType>(T)->getKind()) { 294 default: assert(0 && "Unknown builtin type!"); 295 case BuiltinType::Void: 296 assert(0 && "Incomplete types have no size!"); 297 case BuiltinType::Bool: 298 Width = Target.getBoolWidth(); 299 Align = Target.getBoolAlign(); 300 break; 301 case BuiltinType::Char_S: 302 case BuiltinType::Char_U: 303 case BuiltinType::UChar: 304 case BuiltinType::SChar: 305 Width = Target.getCharWidth(); 306 Align = Target.getCharAlign(); 307 break; 308 case BuiltinType::WChar: 309 Width = Target.getWCharWidth(); 310 Align = Target.getWCharAlign(); 311 break; 312 case BuiltinType::UShort: 313 case BuiltinType::Short: 314 Width = Target.getShortWidth(); 315 Align = Target.getShortAlign(); 316 break; 317 case BuiltinType::UInt: 318 case BuiltinType::Int: 319 Width = Target.getIntWidth(); 320 Align = Target.getIntAlign(); 321 break; 322 case BuiltinType::ULong: 323 case BuiltinType::Long: 324 Width = Target.getLongWidth(); 325 Align = Target.getLongAlign(); 326 break; 327 case BuiltinType::ULongLong: 328 case BuiltinType::LongLong: 329 Width = Target.getLongLongWidth(); 330 Align = Target.getLongLongAlign(); 331 break; 332 case BuiltinType::Float: 333 Width = Target.getFloatWidth(); 334 Align = Target.getFloatAlign(); 335 break; 336 case BuiltinType::Double: 337 Width = Target.getDoubleWidth(); 338 Align = Target.getDoubleAlign(); 339 break; 340 case BuiltinType::LongDouble: 341 Width = Target.getLongDoubleWidth(); 342 Align = Target.getLongDoubleAlign(); 343 break; 344 } 345 break; 346 case Type::ASQual: 347 // FIXME: Pointers into different addr spaces could have different sizes and 348 // alignment requirements: getPointerInfo should take an AddrSpace. 349 return getTypeInfo(QualType(cast<ASQualType>(T)->getBaseType(), 0)); 350 case Type::ObjCQualifiedId: 351 Width = Target.getPointerWidth(0); 352 Align = Target.getPointerAlign(0); 353 break; 354 case Type::BlockPointer: { 355 unsigned AS = cast<BlockPointerType>(T)->getPointeeType().getAddressSpace(); 356 Width = Target.getPointerWidth(AS); 357 Align = Target.getPointerAlign(AS); 358 break; 359 } 360 case Type::Pointer: { 361 unsigned AS = cast<PointerType>(T)->getPointeeType().getAddressSpace(); 362 Width = Target.getPointerWidth(AS); 363 Align = Target.getPointerAlign(AS); 364 break; 365 } 366 case Type::Reference: 367 // "When applied to a reference or a reference type, the result is the size 368 // of the referenced type." C++98 5.3.3p2: expr.sizeof. 369 // FIXME: This is wrong for struct layout: a reference in a struct has 370 // pointer size. 371 return getTypeInfo(cast<ReferenceType>(T)->getPointeeType()); 372 373 case Type::Complex: { 374 // Complex types have the same alignment as their elements, but twice the 375 // size. 376 std::pair<uint64_t, unsigned> EltInfo = 377 getTypeInfo(cast<ComplexType>(T)->getElementType()); 378 Width = EltInfo.first*2; 379 Align = EltInfo.second; 380 break; 381 } 382 case Type::ObjCInterface: { 383 const ObjCInterfaceType *ObjCI = cast<ObjCInterfaceType>(T); 384 const ASTRecordLayout &Layout = getASTObjCInterfaceLayout(ObjCI->getDecl()); 385 Width = Layout.getSize(); 386 Align = Layout.getAlignment(); 387 break; 388 } 389 case Type::Tagged: { 390 const TagType *TT = cast<TagType>(T); 391 392 if (TT->getDecl()->isInvalidDecl()) { 393 Width = 1; 394 Align = 1; 395 break; 396 } 397 398 if (const EnumType *ET = dyn_cast<EnumType>(TT)) 399 return getTypeInfo(ET->getDecl()->getIntegerType()); 400 401 const RecordType *RT = cast<RecordType>(TT); 402 const ASTRecordLayout &Layout = getASTRecordLayout(RT->getDecl()); 403 Width = Layout.getSize(); 404 Align = Layout.getAlignment(); 405 break; 406 } 407 } 408 409 assert(Align && (Align & (Align-1)) == 0 && "Alignment must be power of 2"); 410 return std::make_pair(Width, Align); 411} 412 413/// LayoutField - Field layout. 414void ASTRecordLayout::LayoutField(const FieldDecl *FD, unsigned FieldNo, 415 bool IsUnion, unsigned StructPacking, 416 ASTContext &Context) { 417 unsigned FieldPacking = StructPacking; 418 uint64_t FieldOffset = IsUnion ? 0 : Size; 419 uint64_t FieldSize; 420 unsigned FieldAlign; 421 422 // FIXME: Should this override struct packing? Probably we want to 423 // take the minimum? 424 if (const PackedAttr *PA = FD->getAttr<PackedAttr>()) 425 FieldPacking = PA->getAlignment(); 426 427 if (const Expr *BitWidthExpr = FD->getBitWidth()) { 428 // TODO: Need to check this algorithm on other targets! 429 // (tested on Linux-X86) 430 FieldSize = 431 BitWidthExpr->getIntegerConstantExprValue(Context).getZExtValue(); 432 433 std::pair<uint64_t, unsigned> FieldInfo = 434 Context.getTypeInfo(FD->getType()); 435 uint64_t TypeSize = FieldInfo.first; 436 437 // Determine the alignment of this bitfield. The packing 438 // attributes define a maximum and the alignment attribute defines 439 // a minimum. 440 // FIXME: What is the right behavior when the specified alignment 441 // is smaller than the specified packing? 442 FieldAlign = FieldInfo.second; 443 if (FieldPacking) 444 FieldAlign = std::min(FieldAlign, FieldPacking); 445 if (const AlignedAttr *AA = FD->getAttr<AlignedAttr>()) 446 FieldAlign = std::max(FieldAlign, AA->getAlignment()); 447 448 // Check if we need to add padding to give the field the correct 449 // alignment. 450 if (FieldSize == 0 || (FieldOffset & (FieldAlign-1)) + FieldSize > TypeSize) 451 FieldOffset = (FieldOffset + (FieldAlign-1)) & ~(FieldAlign-1); 452 453 // Padding members don't affect overall alignment 454 if (!FD->getIdentifier()) 455 FieldAlign = 1; 456 } else { 457 if (FD->getType()->isIncompleteArrayType()) { 458 // This is a flexible array member; we can't directly 459 // query getTypeInfo about these, so we figure it out here. 460 // Flexible array members don't have any size, but they 461 // have to be aligned appropriately for their element type. 462 FieldSize = 0; 463 const ArrayType* ATy = Context.getAsArrayType(FD->getType()); 464 FieldAlign = Context.getTypeAlign(ATy->getElementType()); 465 } else { 466 std::pair<uint64_t, unsigned> FieldInfo = 467 Context.getTypeInfo(FD->getType()); 468 FieldSize = FieldInfo.first; 469 FieldAlign = FieldInfo.second; 470 } 471 472 // Determine the alignment of this bitfield. The packing 473 // attributes define a maximum and the alignment attribute defines 474 // a minimum. Additionally, the packing alignment must be at least 475 // a byte for non-bitfields. 476 // 477 // FIXME: What is the right behavior when the specified alignment 478 // is smaller than the specified packing? 479 if (FieldPacking) 480 FieldAlign = std::min(FieldAlign, std::max(8U, FieldPacking)); 481 if (const AlignedAttr *AA = FD->getAttr<AlignedAttr>()) 482 FieldAlign = std::max(FieldAlign, AA->getAlignment()); 483 484 // Round up the current record size to the field's alignment boundary. 485 FieldOffset = (FieldOffset + (FieldAlign-1)) & ~(FieldAlign-1); 486 } 487 488 // Place this field at the current location. 489 FieldOffsets[FieldNo] = FieldOffset; 490 491 // Reserve space for this field. 492 if (IsUnion) { 493 Size = std::max(Size, FieldSize); 494 } else { 495 Size = FieldOffset + FieldSize; 496 } 497 498 // Remember max struct/class alignment. 499 Alignment = std::max(Alignment, FieldAlign); 500} 501 502static void CollectObjCIvars(const ObjCInterfaceDecl *OI, 503 std::vector<FieldDecl*> &Fields) { 504 const ObjCInterfaceDecl *SuperClass = OI->getSuperClass(); 505 if (SuperClass) 506 CollectObjCIvars(SuperClass, Fields); 507 for (ObjCInterfaceDecl::ivar_iterator I = OI->ivar_begin(), 508 E = OI->ivar_end(); I != E; ++I) { 509 ObjCIvarDecl *IVDecl = (*I); 510 if (!IVDecl->isInvalidDecl()) 511 Fields.push_back(cast<FieldDecl>(IVDecl)); 512 } 513} 514 515/// addRecordToClass - produces record info. for the class for its 516/// ivars and all those inherited. 517/// 518const RecordDecl *ASTContext::addRecordToClass(const ObjCInterfaceDecl *D) 519{ 520 const RecordDecl *&RD = ASTRecordForInterface[D]; 521 if (RD) 522 return RD; 523 std::vector<FieldDecl*> RecFields; 524 CollectObjCIvars(D, RecFields); 525 RecordDecl *NewRD = RecordDecl::Create(*this, TagDecl::TK_struct, 0, 526 D->getLocation(), 527 D->getIdentifier()); 528 /// FIXME! Can do collection of ivars and adding to the record while 529 /// doing it. 530 for (unsigned int i = 0; i != RecFields.size(); i++) { 531 FieldDecl *Field = FieldDecl::Create(*this, NewRD, 532 RecFields[i]->getLocation(), 533 RecFields[i]->getIdentifier(), 534 RecFields[i]->getType(), 535 RecFields[i]->getBitWidth(), false, 0); 536 NewRD->addDecl(Field); 537 } 538 NewRD->completeDefinition(*this); 539 RD = NewRD; 540 return RD; 541} 542 543/// setFieldDecl - maps a field for the given Ivar reference node. 544// 545void ASTContext::setFieldDecl(const ObjCInterfaceDecl *OI, 546 const ObjCIvarDecl *Ivar, 547 const ObjCIvarRefExpr *MRef) { 548 FieldDecl *FD = (const_cast<ObjCInterfaceDecl *>(OI))-> 549 lookupFieldDeclForIvar(*this, Ivar); 550 ASTFieldForIvarRef[MRef] = FD; 551} 552 553/// getASTObjcInterfaceLayout - Get or compute information about the layout of 554/// the specified Objective C, which indicates its size and ivar 555/// position information. 556const ASTRecordLayout & 557ASTContext::getASTObjCInterfaceLayout(const ObjCInterfaceDecl *D) { 558 // Look up this layout, if already laid out, return what we have. 559 const ASTRecordLayout *&Entry = ASTObjCInterfaces[D]; 560 if (Entry) return *Entry; 561 562 // Allocate and assign into ASTRecordLayouts here. The "Entry" reference can 563 // be invalidated (dangle) if the ASTRecordLayouts hashtable is inserted into. 564 ASTRecordLayout *NewEntry = NULL; 565 unsigned FieldCount = D->ivar_size(); 566 if (ObjCInterfaceDecl *SD = D->getSuperClass()) { 567 FieldCount++; 568 const ASTRecordLayout &SL = getASTObjCInterfaceLayout(SD); 569 unsigned Alignment = SL.getAlignment(); 570 uint64_t Size = SL.getSize(); 571 NewEntry = new ASTRecordLayout(Size, Alignment); 572 NewEntry->InitializeLayout(FieldCount); 573 // Super class is at the beginning of the layout. 574 NewEntry->SetFieldOffset(0, 0); 575 } else { 576 NewEntry = new ASTRecordLayout(); 577 NewEntry->InitializeLayout(FieldCount); 578 } 579 Entry = NewEntry; 580 581 unsigned StructPacking = 0; 582 if (const PackedAttr *PA = D->getAttr<PackedAttr>()) 583 StructPacking = PA->getAlignment(); 584 585 if (const AlignedAttr *AA = D->getAttr<AlignedAttr>()) 586 NewEntry->SetAlignment(std::max(NewEntry->getAlignment(), 587 AA->getAlignment())); 588 589 // Layout each ivar sequentially. 590 unsigned i = 0; 591 for (ObjCInterfaceDecl::ivar_iterator IVI = D->ivar_begin(), 592 IVE = D->ivar_end(); IVI != IVE; ++IVI) { 593 const ObjCIvarDecl* Ivar = (*IVI); 594 NewEntry->LayoutField(Ivar, i++, false, StructPacking, *this); 595 } 596 597 // Finally, round the size of the total struct up to the alignment of the 598 // struct itself. 599 NewEntry->FinalizeLayout(); 600 return *NewEntry; 601} 602 603/// getASTRecordLayout - Get or compute information about the layout of the 604/// specified record (struct/union/class), which indicates its size and field 605/// position information. 606const ASTRecordLayout &ASTContext::getASTRecordLayout(const RecordDecl *D) { 607 D = D->getDefinition(*this); 608 assert(D && "Cannot get layout of forward declarations!"); 609 610 // Look up this layout, if already laid out, return what we have. 611 const ASTRecordLayout *&Entry = ASTRecordLayouts[D]; 612 if (Entry) return *Entry; 613 614 // Allocate and assign into ASTRecordLayouts here. The "Entry" reference can 615 // be invalidated (dangle) if the ASTRecordLayouts hashtable is inserted into. 616 ASTRecordLayout *NewEntry = new ASTRecordLayout(); 617 Entry = NewEntry; 618 619 // FIXME: Avoid linear walk through the fields, if possible. 620 NewEntry->InitializeLayout(std::distance(D->field_begin(), D->field_end())); 621 bool IsUnion = D->isUnion(); 622 623 unsigned StructPacking = 0; 624 if (const PackedAttr *PA = D->getAttr<PackedAttr>()) 625 StructPacking = PA->getAlignment(); 626 627 if (const AlignedAttr *AA = D->getAttr<AlignedAttr>()) 628 NewEntry->SetAlignment(std::max(NewEntry->getAlignment(), 629 AA->getAlignment())); 630 631 // Layout each field, for now, just sequentially, respecting alignment. In 632 // the future, this will need to be tweakable by targets. 633 unsigned FieldIdx = 0; 634 for (RecordDecl::field_iterator Field = D->field_begin(), 635 FieldEnd = D->field_end(); 636 Field != FieldEnd; (void)++Field, ++FieldIdx) 637 NewEntry->LayoutField(*Field, FieldIdx, IsUnion, StructPacking, *this); 638 639 // Finally, round the size of the total struct up to the alignment of the 640 // struct itself. 641 NewEntry->FinalizeLayout(); 642 return *NewEntry; 643} 644 645//===----------------------------------------------------------------------===// 646// Type creation/memoization methods 647//===----------------------------------------------------------------------===// 648 649QualType ASTContext::getASQualType(QualType T, unsigned AddressSpace) { 650 QualType CanT = getCanonicalType(T); 651 if (CanT.getAddressSpace() == AddressSpace) 652 return T; 653 654 // Type's cannot have multiple ASQuals, therefore we know we only have to deal 655 // with CVR qualifiers from here on out. 656 assert(CanT.getAddressSpace() == 0 && 657 "Type is already address space qualified"); 658 659 // Check if we've already instantiated an address space qual'd type of this 660 // type. 661 llvm::FoldingSetNodeID ID; 662 ASQualType::Profile(ID, T.getTypePtr(), AddressSpace); 663 void *InsertPos = 0; 664 if (ASQualType *ASQy = ASQualTypes.FindNodeOrInsertPos(ID, InsertPos)) 665 return QualType(ASQy, 0); 666 667 // If the base type isn't canonical, this won't be a canonical type either, 668 // so fill in the canonical type field. 669 QualType Canonical; 670 if (!T->isCanonical()) { 671 Canonical = getASQualType(CanT, AddressSpace); 672 673 // Get the new insert position for the node we care about. 674 ASQualType *NewIP = ASQualTypes.FindNodeOrInsertPos(ID, InsertPos); 675 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 676 } 677 ASQualType *New = new ASQualType(T.getTypePtr(), Canonical, AddressSpace); 678 ASQualTypes.InsertNode(New, InsertPos); 679 Types.push_back(New); 680 return QualType(New, T.getCVRQualifiers()); 681} 682 683 684/// getComplexType - Return the uniqued reference to the type for a complex 685/// number with the specified element type. 686QualType ASTContext::getComplexType(QualType T) { 687 // Unique pointers, to guarantee there is only one pointer of a particular 688 // structure. 689 llvm::FoldingSetNodeID ID; 690 ComplexType::Profile(ID, T); 691 692 void *InsertPos = 0; 693 if (ComplexType *CT = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos)) 694 return QualType(CT, 0); 695 696 // If the pointee type isn't canonical, this won't be a canonical type either, 697 // so fill in the canonical type field. 698 QualType Canonical; 699 if (!T->isCanonical()) { 700 Canonical = getComplexType(getCanonicalType(T)); 701 702 // Get the new insert position for the node we care about. 703 ComplexType *NewIP = ComplexTypes.FindNodeOrInsertPos(ID, InsertPos); 704 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 705 } 706 ComplexType *New = new ComplexType(T, Canonical); 707 Types.push_back(New); 708 ComplexTypes.InsertNode(New, InsertPos); 709 return QualType(New, 0); 710} 711 712 713/// getPointerType - Return the uniqued reference to the type for a pointer to 714/// the specified type. 715QualType ASTContext::getPointerType(QualType T) { 716 // Unique pointers, to guarantee there is only one pointer of a particular 717 // structure. 718 llvm::FoldingSetNodeID ID; 719 PointerType::Profile(ID, T); 720 721 void *InsertPos = 0; 722 if (PointerType *PT = PointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 723 return QualType(PT, 0); 724 725 // If the pointee type isn't canonical, this won't be a canonical type either, 726 // so fill in the canonical type field. 727 QualType Canonical; 728 if (!T->isCanonical()) { 729 Canonical = getPointerType(getCanonicalType(T)); 730 731 // Get the new insert position for the node we care about. 732 PointerType *NewIP = PointerTypes.FindNodeOrInsertPos(ID, InsertPos); 733 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 734 } 735 PointerType *New = new PointerType(T, Canonical); 736 Types.push_back(New); 737 PointerTypes.InsertNode(New, InsertPos); 738 return QualType(New, 0); 739} 740 741/// getBlockPointerType - Return the uniqued reference to the type for 742/// a pointer to the specified block. 743QualType ASTContext::getBlockPointerType(QualType T) { 744 assert(T->isFunctionType() && "block of function types only"); 745 // Unique pointers, to guarantee there is only one block of a particular 746 // structure. 747 llvm::FoldingSetNodeID ID; 748 BlockPointerType::Profile(ID, T); 749 750 void *InsertPos = 0; 751 if (BlockPointerType *PT = 752 BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos)) 753 return QualType(PT, 0); 754 755 // If the block pointee type isn't canonical, this won't be a canonical 756 // type either so fill in the canonical type field. 757 QualType Canonical; 758 if (!T->isCanonical()) { 759 Canonical = getBlockPointerType(getCanonicalType(T)); 760 761 // Get the new insert position for the node we care about. 762 BlockPointerType *NewIP = 763 BlockPointerTypes.FindNodeOrInsertPos(ID, InsertPos); 764 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 765 } 766 BlockPointerType *New = new BlockPointerType(T, Canonical); 767 Types.push_back(New); 768 BlockPointerTypes.InsertNode(New, InsertPos); 769 return QualType(New, 0); 770} 771 772/// getReferenceType - Return the uniqued reference to the type for a reference 773/// to the specified type. 774QualType ASTContext::getReferenceType(QualType T) { 775 // Unique pointers, to guarantee there is only one pointer of a particular 776 // structure. 777 llvm::FoldingSetNodeID ID; 778 ReferenceType::Profile(ID, T); 779 780 void *InsertPos = 0; 781 if (ReferenceType *RT = ReferenceTypes.FindNodeOrInsertPos(ID, InsertPos)) 782 return QualType(RT, 0); 783 784 // If the referencee type isn't canonical, this won't be a canonical type 785 // either, so fill in the canonical type field. 786 QualType Canonical; 787 if (!T->isCanonical()) { 788 Canonical = getReferenceType(getCanonicalType(T)); 789 790 // Get the new insert position for the node we care about. 791 ReferenceType *NewIP = ReferenceTypes.FindNodeOrInsertPos(ID, InsertPos); 792 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 793 } 794 795 ReferenceType *New = new ReferenceType(T, Canonical); 796 Types.push_back(New); 797 ReferenceTypes.InsertNode(New, InsertPos); 798 return QualType(New, 0); 799} 800 801/// getConstantArrayType - Return the unique reference to the type for an 802/// array of the specified element type. 803QualType ASTContext::getConstantArrayType(QualType EltTy, 804 const llvm::APInt &ArySize, 805 ArrayType::ArraySizeModifier ASM, 806 unsigned EltTypeQuals) { 807 llvm::FoldingSetNodeID ID; 808 ConstantArrayType::Profile(ID, EltTy, ArySize); 809 810 void *InsertPos = 0; 811 if (ConstantArrayType *ATP = 812 ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos)) 813 return QualType(ATP, 0); 814 815 // If the element type isn't canonical, this won't be a canonical type either, 816 // so fill in the canonical type field. 817 QualType Canonical; 818 if (!EltTy->isCanonical()) { 819 Canonical = getConstantArrayType(getCanonicalType(EltTy), ArySize, 820 ASM, EltTypeQuals); 821 // Get the new insert position for the node we care about. 822 ConstantArrayType *NewIP = 823 ConstantArrayTypes.FindNodeOrInsertPos(ID, InsertPos); 824 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 825 } 826 827 ConstantArrayType *New = new ConstantArrayType(EltTy, Canonical, ArySize, 828 ASM, EltTypeQuals); 829 ConstantArrayTypes.InsertNode(New, InsertPos); 830 Types.push_back(New); 831 return QualType(New, 0); 832} 833 834/// getVariableArrayType - Returns a non-unique reference to the type for a 835/// variable array of the specified element type. 836QualType ASTContext::getVariableArrayType(QualType EltTy, Expr *NumElts, 837 ArrayType::ArraySizeModifier ASM, 838 unsigned EltTypeQuals) { 839 // Since we don't unique expressions, it isn't possible to unique VLA's 840 // that have an expression provided for their size. 841 842 VariableArrayType *New = new VariableArrayType(EltTy, QualType(), NumElts, 843 ASM, EltTypeQuals); 844 845 VariableArrayTypes.push_back(New); 846 Types.push_back(New); 847 return QualType(New, 0); 848} 849 850/// getDependentSizedArrayType - Returns a non-unique reference to 851/// the type for a dependently-sized array of the specified element 852/// type. FIXME: We will need these to be uniqued, or at least 853/// comparable, at some point. 854QualType ASTContext::getDependentSizedArrayType(QualType EltTy, Expr *NumElts, 855 ArrayType::ArraySizeModifier ASM, 856 unsigned EltTypeQuals) { 857 assert((NumElts->isTypeDependent() || NumElts->isValueDependent()) && 858 "Size must be type- or value-dependent!"); 859 860 // Since we don't unique expressions, it isn't possible to unique 861 // dependently-sized array types. 862 863 DependentSizedArrayType *New 864 = new DependentSizedArrayType(EltTy, QualType(), NumElts, 865 ASM, EltTypeQuals); 866 867 DependentSizedArrayTypes.push_back(New); 868 Types.push_back(New); 869 return QualType(New, 0); 870} 871 872QualType ASTContext::getIncompleteArrayType(QualType EltTy, 873 ArrayType::ArraySizeModifier ASM, 874 unsigned EltTypeQuals) { 875 llvm::FoldingSetNodeID ID; 876 IncompleteArrayType::Profile(ID, EltTy); 877 878 void *InsertPos = 0; 879 if (IncompleteArrayType *ATP = 880 IncompleteArrayTypes.FindNodeOrInsertPos(ID, InsertPos)) 881 return QualType(ATP, 0); 882 883 // If the element type isn't canonical, this won't be a canonical type 884 // either, so fill in the canonical type field. 885 QualType Canonical; 886 887 if (!EltTy->isCanonical()) { 888 Canonical = getIncompleteArrayType(getCanonicalType(EltTy), 889 ASM, EltTypeQuals); 890 891 // Get the new insert position for the node we care about. 892 IncompleteArrayType *NewIP = 893 IncompleteArrayTypes.FindNodeOrInsertPos(ID, InsertPos); 894 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 895 } 896 897 IncompleteArrayType *New = new IncompleteArrayType(EltTy, Canonical, 898 ASM, EltTypeQuals); 899 900 IncompleteArrayTypes.InsertNode(New, InsertPos); 901 Types.push_back(New); 902 return QualType(New, 0); 903} 904 905/// getVectorType - Return the unique reference to a vector type of 906/// the specified element type and size. VectorType must be a built-in type. 907QualType ASTContext::getVectorType(QualType vecType, unsigned NumElts) { 908 BuiltinType *baseType; 909 910 baseType = dyn_cast<BuiltinType>(getCanonicalType(vecType).getTypePtr()); 911 assert(baseType != 0 && "getVectorType(): Expecting a built-in type"); 912 913 // Check if we've already instantiated a vector of this type. 914 llvm::FoldingSetNodeID ID; 915 VectorType::Profile(ID, vecType, NumElts, Type::Vector); 916 void *InsertPos = 0; 917 if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos)) 918 return QualType(VTP, 0); 919 920 // If the element type isn't canonical, this won't be a canonical type either, 921 // so fill in the canonical type field. 922 QualType Canonical; 923 if (!vecType->isCanonical()) { 924 Canonical = getVectorType(getCanonicalType(vecType), NumElts); 925 926 // Get the new insert position for the node we care about. 927 VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos); 928 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 929 } 930 VectorType *New = new VectorType(vecType, NumElts, Canonical); 931 VectorTypes.InsertNode(New, InsertPos); 932 Types.push_back(New); 933 return QualType(New, 0); 934} 935 936/// getExtVectorType - Return the unique reference to an extended vector type of 937/// the specified element type and size. VectorType must be a built-in type. 938QualType ASTContext::getExtVectorType(QualType vecType, unsigned NumElts) { 939 BuiltinType *baseType; 940 941 baseType = dyn_cast<BuiltinType>(getCanonicalType(vecType).getTypePtr()); 942 assert(baseType != 0 && "getExtVectorType(): Expecting a built-in type"); 943 944 // Check if we've already instantiated a vector of this type. 945 llvm::FoldingSetNodeID ID; 946 VectorType::Profile(ID, vecType, NumElts, Type::ExtVector); 947 void *InsertPos = 0; 948 if (VectorType *VTP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos)) 949 return QualType(VTP, 0); 950 951 // If the element type isn't canonical, this won't be a canonical type either, 952 // so fill in the canonical type field. 953 QualType Canonical; 954 if (!vecType->isCanonical()) { 955 Canonical = getExtVectorType(getCanonicalType(vecType), NumElts); 956 957 // Get the new insert position for the node we care about. 958 VectorType *NewIP = VectorTypes.FindNodeOrInsertPos(ID, InsertPos); 959 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 960 } 961 ExtVectorType *New = new ExtVectorType(vecType, NumElts, Canonical); 962 VectorTypes.InsertNode(New, InsertPos); 963 Types.push_back(New); 964 return QualType(New, 0); 965} 966 967/// getFunctionTypeNoProto - Return a K&R style C function type like 'int()'. 968/// 969QualType ASTContext::getFunctionTypeNoProto(QualType ResultTy) { 970 // Unique functions, to guarantee there is only one function of a particular 971 // structure. 972 llvm::FoldingSetNodeID ID; 973 FunctionTypeNoProto::Profile(ID, ResultTy); 974 975 void *InsertPos = 0; 976 if (FunctionTypeNoProto *FT = 977 FunctionTypeNoProtos.FindNodeOrInsertPos(ID, InsertPos)) 978 return QualType(FT, 0); 979 980 QualType Canonical; 981 if (!ResultTy->isCanonical()) { 982 Canonical = getFunctionTypeNoProto(getCanonicalType(ResultTy)); 983 984 // Get the new insert position for the node we care about. 985 FunctionTypeNoProto *NewIP = 986 FunctionTypeNoProtos.FindNodeOrInsertPos(ID, InsertPos); 987 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 988 } 989 990 FunctionTypeNoProto *New = new FunctionTypeNoProto(ResultTy, Canonical); 991 Types.push_back(New); 992 FunctionTypeNoProtos.InsertNode(New, InsertPos); 993 return QualType(New, 0); 994} 995 996/// getFunctionType - Return a normal function type with a typed argument 997/// list. isVariadic indicates whether the argument list includes '...'. 998QualType ASTContext::getFunctionType(QualType ResultTy,const QualType *ArgArray, 999 unsigned NumArgs, bool isVariadic, 1000 unsigned TypeQuals) { 1001 // Unique functions, to guarantee there is only one function of a particular 1002 // structure. 1003 llvm::FoldingSetNodeID ID; 1004 FunctionTypeProto::Profile(ID, ResultTy, ArgArray, NumArgs, isVariadic, 1005 TypeQuals); 1006 1007 void *InsertPos = 0; 1008 if (FunctionTypeProto *FTP = 1009 FunctionTypeProtos.FindNodeOrInsertPos(ID, InsertPos)) 1010 return QualType(FTP, 0); 1011 1012 // Determine whether the type being created is already canonical or not. 1013 bool isCanonical = ResultTy->isCanonical(); 1014 for (unsigned i = 0; i != NumArgs && isCanonical; ++i) 1015 if (!ArgArray[i]->isCanonical()) 1016 isCanonical = false; 1017 1018 // If this type isn't canonical, get the canonical version of it. 1019 QualType Canonical; 1020 if (!isCanonical) { 1021 llvm::SmallVector<QualType, 16> CanonicalArgs; 1022 CanonicalArgs.reserve(NumArgs); 1023 for (unsigned i = 0; i != NumArgs; ++i) 1024 CanonicalArgs.push_back(getCanonicalType(ArgArray[i])); 1025 1026 Canonical = getFunctionType(getCanonicalType(ResultTy), 1027 &CanonicalArgs[0], NumArgs, 1028 isVariadic, TypeQuals); 1029 1030 // Get the new insert position for the node we care about. 1031 FunctionTypeProto *NewIP = 1032 FunctionTypeProtos.FindNodeOrInsertPos(ID, InsertPos); 1033 assert(NewIP == 0 && "Shouldn't be in the map!"); NewIP = NewIP; 1034 } 1035 1036 // FunctionTypeProto objects are not allocated with new because they have a 1037 // variable size array (for parameter types) at the end of them. 1038 FunctionTypeProto *FTP = 1039 (FunctionTypeProto*)malloc(sizeof(FunctionTypeProto) + 1040 NumArgs*sizeof(QualType)); 1041 new (FTP) FunctionTypeProto(ResultTy, ArgArray, NumArgs, isVariadic, 1042 TypeQuals, Canonical); 1043 Types.push_back(FTP); 1044 FunctionTypeProtos.InsertNode(FTP, InsertPos); 1045 return QualType(FTP, 0); 1046} 1047 1048/// getTypeDeclType - Return the unique reference to the type for the 1049/// specified type declaration. 1050QualType ASTContext::getTypeDeclType(TypeDecl *Decl, TypeDecl* PrevDecl) { 1051 assert(Decl && "Passed null for Decl param"); 1052 if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0); 1053 1054 if (TypedefDecl *Typedef = dyn_cast<TypedefDecl>(Decl)) 1055 return getTypedefType(Typedef); 1056 else if (TemplateTypeParmDecl *TP = dyn_cast<TemplateTypeParmDecl>(Decl)) 1057 return getTemplateTypeParmType(TP); 1058 else if (ObjCInterfaceDecl *ObjCInterface = dyn_cast<ObjCInterfaceDecl>(Decl)) 1059 return getObjCInterfaceType(ObjCInterface); 1060 1061 if (CXXRecordDecl *CXXRecord = dyn_cast<CXXRecordDecl>(Decl)) { 1062 Decl->TypeForDecl = PrevDecl ? PrevDecl->TypeForDecl 1063 : new CXXRecordType(CXXRecord); 1064 } 1065 else if (RecordDecl *Record = dyn_cast<RecordDecl>(Decl)) { 1066 Decl->TypeForDecl = PrevDecl ? PrevDecl->TypeForDecl 1067 : new RecordType(Record); 1068 } 1069 else if (EnumDecl *Enum = dyn_cast<EnumDecl>(Decl)) 1070 Decl->TypeForDecl = PrevDecl ? PrevDecl->TypeForDecl 1071 : new EnumType(Enum); 1072 else 1073 assert(false && "TypeDecl without a type?"); 1074 1075 if (!PrevDecl) Types.push_back(Decl->TypeForDecl); 1076 return QualType(Decl->TypeForDecl, 0); 1077} 1078 1079void ASTContext::setTagDefinition(TagDecl* D) { 1080 assert (D->isDefinition()); 1081 cast<TagType>(D->TypeForDecl)->decl = D; 1082} 1083 1084/// getTypedefType - Return the unique reference to the type for the 1085/// specified typename decl. 1086QualType ASTContext::getTypedefType(TypedefDecl *Decl) { 1087 if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0); 1088 1089 QualType Canonical = getCanonicalType(Decl->getUnderlyingType()); 1090 Decl->TypeForDecl = new TypedefType(Type::TypeName, Decl, Canonical); 1091 Types.push_back(Decl->TypeForDecl); 1092 return QualType(Decl->TypeForDecl, 0); 1093} 1094 1095/// getTemplateTypeParmType - Return the unique reference to the type 1096/// for the specified template type parameter declaration. 1097QualType ASTContext::getTemplateTypeParmType(TemplateTypeParmDecl *Decl) { 1098 if (!Decl->TypeForDecl) { 1099 Decl->TypeForDecl = new TemplateTypeParmType(Decl); 1100 Types.push_back(Decl->TypeForDecl); 1101 } 1102 return QualType(Decl->TypeForDecl, 0); 1103} 1104 1105/// getObjCInterfaceType - Return the unique reference to the type for the 1106/// specified ObjC interface decl. 1107QualType ASTContext::getObjCInterfaceType(ObjCInterfaceDecl *Decl) { 1108 if (Decl->TypeForDecl) return QualType(Decl->TypeForDecl, 0); 1109 1110 Decl->TypeForDecl = new ObjCInterfaceType(Type::ObjCInterface, Decl); 1111 Types.push_back(Decl->TypeForDecl); 1112 return QualType(Decl->TypeForDecl, 0); 1113} 1114 1115/// CmpProtocolNames - Comparison predicate for sorting protocols 1116/// alphabetically. 1117static bool CmpProtocolNames(const ObjCProtocolDecl *LHS, 1118 const ObjCProtocolDecl *RHS) { 1119 return LHS->getDeclName() < RHS->getDeclName(); 1120} 1121 1122static void SortAndUniqueProtocols(ObjCProtocolDecl **&Protocols, 1123 unsigned &NumProtocols) { 1124 ObjCProtocolDecl **ProtocolsEnd = Protocols+NumProtocols; 1125 1126 // Sort protocols, keyed by name. 1127 std::sort(Protocols, Protocols+NumProtocols, CmpProtocolNames); 1128 1129 // Remove duplicates. 1130 ProtocolsEnd = std::unique(Protocols, ProtocolsEnd); 1131 NumProtocols = ProtocolsEnd-Protocols; 1132} 1133 1134 1135/// getObjCQualifiedInterfaceType - Return a ObjCQualifiedInterfaceType type for 1136/// the given interface decl and the conforming protocol list. 1137QualType ASTContext::getObjCQualifiedInterfaceType(ObjCInterfaceDecl *Decl, 1138 ObjCProtocolDecl **Protocols, unsigned NumProtocols) { 1139 // Sort the protocol list alphabetically to canonicalize it. 1140 SortAndUniqueProtocols(Protocols, NumProtocols); 1141 1142 llvm::FoldingSetNodeID ID; 1143 ObjCQualifiedInterfaceType::Profile(ID, Decl, Protocols, NumProtocols); 1144 1145 void *InsertPos = 0; 1146 if (ObjCQualifiedInterfaceType *QT = 1147 ObjCQualifiedInterfaceTypes.FindNodeOrInsertPos(ID, InsertPos)) 1148 return QualType(QT, 0); 1149 1150 // No Match; 1151 ObjCQualifiedInterfaceType *QType = 1152 new ObjCQualifiedInterfaceType(Decl, Protocols, NumProtocols); 1153 Types.push_back(QType); 1154 ObjCQualifiedInterfaceTypes.InsertNode(QType, InsertPos); 1155 return QualType(QType, 0); 1156} 1157 1158/// getObjCQualifiedIdType - Return an ObjCQualifiedIdType for the 'id' decl 1159/// and the conforming protocol list. 1160QualType ASTContext::getObjCQualifiedIdType(ObjCProtocolDecl **Protocols, 1161 unsigned NumProtocols) { 1162 // Sort the protocol list alphabetically to canonicalize it. 1163 SortAndUniqueProtocols(Protocols, NumProtocols); 1164 1165 llvm::FoldingSetNodeID ID; 1166 ObjCQualifiedIdType::Profile(ID, Protocols, NumProtocols); 1167 1168 void *InsertPos = 0; 1169 if (ObjCQualifiedIdType *QT = 1170 ObjCQualifiedIdTypes.FindNodeOrInsertPos(ID, InsertPos)) 1171 return QualType(QT, 0); 1172 1173 // No Match; 1174 ObjCQualifiedIdType *QType = new ObjCQualifiedIdType(Protocols, NumProtocols); 1175 Types.push_back(QType); 1176 ObjCQualifiedIdTypes.InsertNode(QType, InsertPos); 1177 return QualType(QType, 0); 1178} 1179 1180/// getTypeOfExpr - Unlike many "get<Type>" functions, we can't unique 1181/// TypeOfExpr AST's (since expression's are never shared). For example, 1182/// multiple declarations that refer to "typeof(x)" all contain different 1183/// DeclRefExpr's. This doesn't effect the type checker, since it operates 1184/// on canonical type's (which are always unique). 1185QualType ASTContext::getTypeOfExpr(Expr *tofExpr) { 1186 QualType Canonical = getCanonicalType(tofExpr->getType()); 1187 TypeOfExpr *toe = new TypeOfExpr(tofExpr, Canonical); 1188 Types.push_back(toe); 1189 return QualType(toe, 0); 1190} 1191 1192/// getTypeOfType - Unlike many "get<Type>" functions, we don't unique 1193/// TypeOfType AST's. The only motivation to unique these nodes would be 1194/// memory savings. Since typeof(t) is fairly uncommon, space shouldn't be 1195/// an issue. This doesn't effect the type checker, since it operates 1196/// on canonical type's (which are always unique). 1197QualType ASTContext::getTypeOfType(QualType tofType) { 1198 QualType Canonical = getCanonicalType(tofType); 1199 TypeOfType *tot = new TypeOfType(tofType, Canonical); 1200 Types.push_back(tot); 1201 return QualType(tot, 0); 1202} 1203 1204/// getTagDeclType - Return the unique reference to the type for the 1205/// specified TagDecl (struct/union/class/enum) decl. 1206QualType ASTContext::getTagDeclType(TagDecl *Decl) { 1207 assert (Decl); 1208 return getTypeDeclType(Decl); 1209} 1210 1211/// getSizeType - Return the unique type for "size_t" (C99 7.17), the result 1212/// of the sizeof operator (C99 6.5.3.4p4). The value is target dependent and 1213/// needs to agree with the definition in <stddef.h>. 1214QualType ASTContext::getSizeType() const { 1215 return getFromTargetType(Target.getSizeType()); 1216} 1217 1218/// getWCharType - Return the unique type for "wchar_t" (C99 7.17), the 1219/// width of characters in wide strings, The value is target dependent and 1220/// needs to agree with the definition in <stddef.h>. 1221QualType ASTContext::getWCharType() const { 1222 if (LangOpts.CPlusPlus) 1223 return WCharTy; 1224 1225 // FIXME: In C, shouldn't WCharTy just be a typedef of the target's 1226 // wide-character type? 1227 return getFromTargetType(Target.getWCharType()); 1228} 1229 1230/// getSignedWCharType - Return the type of "signed wchar_t". 1231/// Used when in C++, as a GCC extension. 1232QualType ASTContext::getSignedWCharType() const { 1233 // FIXME: derive from "Target" ? 1234 return WCharTy; 1235} 1236 1237/// getUnsignedWCharType - Return the type of "unsigned wchar_t". 1238/// Used when in C++, as a GCC extension. 1239QualType ASTContext::getUnsignedWCharType() const { 1240 // FIXME: derive from "Target" ? 1241 return UnsignedIntTy; 1242} 1243 1244/// getPointerDiffType - Return the unique type for "ptrdiff_t" (ref?) 1245/// defined in <stddef.h>. Pointer - pointer requires this (C99 6.5.6p9). 1246QualType ASTContext::getPointerDiffType() const { 1247 return getFromTargetType(Target.getPtrDiffType(0)); 1248} 1249 1250//===----------------------------------------------------------------------===// 1251// Type Operators 1252//===----------------------------------------------------------------------===// 1253 1254/// getCanonicalType - Return the canonical (structural) type corresponding to 1255/// the specified potentially non-canonical type. The non-canonical version 1256/// of a type may have many "decorated" versions of types. Decorators can 1257/// include typedefs, 'typeof' operators, etc. The returned type is guaranteed 1258/// to be free of any of these, allowing two canonical types to be compared 1259/// for exact equality with a simple pointer comparison. 1260QualType ASTContext::getCanonicalType(QualType T) { 1261 QualType CanType = T.getTypePtr()->getCanonicalTypeInternal(); 1262 1263 // If the result has type qualifiers, make sure to canonicalize them as well. 1264 unsigned TypeQuals = T.getCVRQualifiers() | CanType.getCVRQualifiers(); 1265 if (TypeQuals == 0) return CanType; 1266 1267 // If the type qualifiers are on an array type, get the canonical type of the 1268 // array with the qualifiers applied to the element type. 1269 ArrayType *AT = dyn_cast<ArrayType>(CanType); 1270 if (!AT) 1271 return CanType.getQualifiedType(TypeQuals); 1272 1273 // Get the canonical version of the element with the extra qualifiers on it. 1274 // This can recursively sink qualifiers through multiple levels of arrays. 1275 QualType NewEltTy=AT->getElementType().getWithAdditionalQualifiers(TypeQuals); 1276 NewEltTy = getCanonicalType(NewEltTy); 1277 1278 if (ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(AT)) 1279 return getConstantArrayType(NewEltTy, CAT->getSize(),CAT->getSizeModifier(), 1280 CAT->getIndexTypeQualifier()); 1281 if (IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(AT)) 1282 return getIncompleteArrayType(NewEltTy, IAT->getSizeModifier(), 1283 IAT->getIndexTypeQualifier()); 1284 1285 if (DependentSizedArrayType *DSAT = dyn_cast<DependentSizedArrayType>(AT)) 1286 return getDependentSizedArrayType(NewEltTy, DSAT->getSizeExpr(), 1287 DSAT->getSizeModifier(), 1288 DSAT->getIndexTypeQualifier()); 1289 1290 VariableArrayType *VAT = cast<VariableArrayType>(AT); 1291 return getVariableArrayType(NewEltTy, VAT->getSizeExpr(), 1292 VAT->getSizeModifier(), 1293 VAT->getIndexTypeQualifier()); 1294} 1295 1296 1297const ArrayType *ASTContext::getAsArrayType(QualType T) { 1298 // Handle the non-qualified case efficiently. 1299 if (T.getCVRQualifiers() == 0) { 1300 // Handle the common positive case fast. 1301 if (const ArrayType *AT = dyn_cast<ArrayType>(T)) 1302 return AT; 1303 } 1304 1305 // Handle the common negative case fast, ignoring CVR qualifiers. 1306 QualType CType = T->getCanonicalTypeInternal(); 1307 1308 // Make sure to look through type qualifiers (like ASQuals) for the negative 1309 // test. 1310 if (!isa<ArrayType>(CType) && 1311 !isa<ArrayType>(CType.getUnqualifiedType())) 1312 return 0; 1313 1314 // Apply any CVR qualifiers from the array type to the element type. This 1315 // implements C99 6.7.3p8: "If the specification of an array type includes 1316 // any type qualifiers, the element type is so qualified, not the array type." 1317 1318 // If we get here, we either have type qualifiers on the type, or we have 1319 // sugar such as a typedef in the way. If we have type qualifiers on the type 1320 // we must propagate them down into the elemeng type. 1321 unsigned CVRQuals = T.getCVRQualifiers(); 1322 unsigned AddrSpace = 0; 1323 Type *Ty = T.getTypePtr(); 1324 1325 // Rip through ASQualType's and typedefs to get to a concrete type. 1326 while (1) { 1327 if (const ASQualType *ASQT = dyn_cast<ASQualType>(Ty)) { 1328 AddrSpace = ASQT->getAddressSpace(); 1329 Ty = ASQT->getBaseType(); 1330 } else { 1331 T = Ty->getDesugaredType(); 1332 if (T.getTypePtr() == Ty && T.getCVRQualifiers() == 0) 1333 break; 1334 CVRQuals |= T.getCVRQualifiers(); 1335 Ty = T.getTypePtr(); 1336 } 1337 } 1338 1339 // If we have a simple case, just return now. 1340 const ArrayType *ATy = dyn_cast<ArrayType>(Ty); 1341 if (ATy == 0 || (AddrSpace == 0 && CVRQuals == 0)) 1342 return ATy; 1343 1344 // Otherwise, we have an array and we have qualifiers on it. Push the 1345 // qualifiers into the array element type and return a new array type. 1346 // Get the canonical version of the element with the extra qualifiers on it. 1347 // This can recursively sink qualifiers through multiple levels of arrays. 1348 QualType NewEltTy = ATy->getElementType(); 1349 if (AddrSpace) 1350 NewEltTy = getASQualType(NewEltTy, AddrSpace); 1351 NewEltTy = NewEltTy.getWithAdditionalQualifiers(CVRQuals); 1352 1353 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(ATy)) 1354 return cast<ArrayType>(getConstantArrayType(NewEltTy, CAT->getSize(), 1355 CAT->getSizeModifier(), 1356 CAT->getIndexTypeQualifier())); 1357 if (const IncompleteArrayType *IAT = dyn_cast<IncompleteArrayType>(ATy)) 1358 return cast<ArrayType>(getIncompleteArrayType(NewEltTy, 1359 IAT->getSizeModifier(), 1360 IAT->getIndexTypeQualifier())); 1361 1362 if (const DependentSizedArrayType *DSAT 1363 = dyn_cast<DependentSizedArrayType>(ATy)) 1364 return cast<ArrayType>( 1365 getDependentSizedArrayType(NewEltTy, 1366 DSAT->getSizeExpr(), 1367 DSAT->getSizeModifier(), 1368 DSAT->getIndexTypeQualifier())); 1369 1370 const VariableArrayType *VAT = cast<VariableArrayType>(ATy); 1371 return cast<ArrayType>(getVariableArrayType(NewEltTy, VAT->getSizeExpr(), 1372 VAT->getSizeModifier(), 1373 VAT->getIndexTypeQualifier())); 1374} 1375 1376 1377/// getArrayDecayedType - Return the properly qualified result of decaying the 1378/// specified array type to a pointer. This operation is non-trivial when 1379/// handling typedefs etc. The canonical type of "T" must be an array type, 1380/// this returns a pointer to a properly qualified element of the array. 1381/// 1382/// See C99 6.7.5.3p7 and C99 6.3.2.1p3. 1383QualType ASTContext::getArrayDecayedType(QualType Ty) { 1384 // Get the element type with 'getAsArrayType' so that we don't lose any 1385 // typedefs in the element type of the array. This also handles propagation 1386 // of type qualifiers from the array type into the element type if present 1387 // (C99 6.7.3p8). 1388 const ArrayType *PrettyArrayType = getAsArrayType(Ty); 1389 assert(PrettyArrayType && "Not an array type!"); 1390 1391 QualType PtrTy = getPointerType(PrettyArrayType->getElementType()); 1392 1393 // int x[restrict 4] -> int *restrict 1394 return PtrTy.getQualifiedType(PrettyArrayType->getIndexTypeQualifier()); 1395} 1396 1397QualType ASTContext::getBaseElementType(const VariableArrayType *VAT) { 1398 QualType ElemTy = VAT->getElementType(); 1399 1400 if (const VariableArrayType *VAT = getAsVariableArrayType(ElemTy)) 1401 return getBaseElementType(VAT); 1402 1403 return ElemTy; 1404} 1405 1406/// getFloatingRank - Return a relative rank for floating point types. 1407/// This routine will assert if passed a built-in type that isn't a float. 1408static FloatingRank getFloatingRank(QualType T) { 1409 if (const ComplexType *CT = T->getAsComplexType()) 1410 return getFloatingRank(CT->getElementType()); 1411 1412 assert(T->getAsBuiltinType() && "getFloatingRank(): not a floating type"); 1413 switch (T->getAsBuiltinType()->getKind()) { 1414 default: assert(0 && "getFloatingRank(): not a floating type"); 1415 case BuiltinType::Float: return FloatRank; 1416 case BuiltinType::Double: return DoubleRank; 1417 case BuiltinType::LongDouble: return LongDoubleRank; 1418 } 1419} 1420 1421/// getFloatingTypeOfSizeWithinDomain - Returns a real floating 1422/// point or a complex type (based on typeDomain/typeSize). 1423/// 'typeDomain' is a real floating point or complex type. 1424/// 'typeSize' is a real floating point or complex type. 1425QualType ASTContext::getFloatingTypeOfSizeWithinDomain(QualType Size, 1426 QualType Domain) const { 1427 FloatingRank EltRank = getFloatingRank(Size); 1428 if (Domain->isComplexType()) { 1429 switch (EltRank) { 1430 default: assert(0 && "getFloatingRank(): illegal value for rank"); 1431 case FloatRank: return FloatComplexTy; 1432 case DoubleRank: return DoubleComplexTy; 1433 case LongDoubleRank: return LongDoubleComplexTy; 1434 } 1435 } 1436 1437 assert(Domain->isRealFloatingType() && "Unknown domain!"); 1438 switch (EltRank) { 1439 default: assert(0 && "getFloatingRank(): illegal value for rank"); 1440 case FloatRank: return FloatTy; 1441 case DoubleRank: return DoubleTy; 1442 case LongDoubleRank: return LongDoubleTy; 1443 } 1444} 1445 1446/// getFloatingTypeOrder - Compare the rank of the two specified floating 1447/// point types, ignoring the domain of the type (i.e. 'double' == 1448/// '_Complex double'). If LHS > RHS, return 1. If LHS == RHS, return 0. If 1449/// LHS < RHS, return -1. 1450int ASTContext::getFloatingTypeOrder(QualType LHS, QualType RHS) { 1451 FloatingRank LHSR = getFloatingRank(LHS); 1452 FloatingRank RHSR = getFloatingRank(RHS); 1453 1454 if (LHSR == RHSR) 1455 return 0; 1456 if (LHSR > RHSR) 1457 return 1; 1458 return -1; 1459} 1460 1461/// getIntegerRank - Return an integer conversion rank (C99 6.3.1.1p1). This 1462/// routine will assert if passed a built-in type that isn't an integer or enum, 1463/// or if it is not canonicalized. 1464static unsigned getIntegerRank(Type *T) { 1465 assert(T->isCanonical() && "T should be canonicalized"); 1466 if (isa<EnumType>(T)) 1467 return 4; 1468 1469 switch (cast<BuiltinType>(T)->getKind()) { 1470 default: assert(0 && "getIntegerRank(): not a built-in integer"); 1471 case BuiltinType::Bool: 1472 return 1; 1473 case BuiltinType::Char_S: 1474 case BuiltinType::Char_U: 1475 case BuiltinType::SChar: 1476 case BuiltinType::UChar: 1477 return 2; 1478 case BuiltinType::Short: 1479 case BuiltinType::UShort: 1480 return 3; 1481 case BuiltinType::Int: 1482 case BuiltinType::UInt: 1483 return 4; 1484 case BuiltinType::Long: 1485 case BuiltinType::ULong: 1486 return 5; 1487 case BuiltinType::LongLong: 1488 case BuiltinType::ULongLong: 1489 return 6; 1490 } 1491} 1492 1493/// getIntegerTypeOrder - Returns the highest ranked integer type: 1494/// C99 6.3.1.8p1. If LHS > RHS, return 1. If LHS == RHS, return 0. If 1495/// LHS < RHS, return -1. 1496int ASTContext::getIntegerTypeOrder(QualType LHS, QualType RHS) { 1497 Type *LHSC = getCanonicalType(LHS).getTypePtr(); 1498 Type *RHSC = getCanonicalType(RHS).getTypePtr(); 1499 if (LHSC == RHSC) return 0; 1500 1501 bool LHSUnsigned = LHSC->isUnsignedIntegerType(); 1502 bool RHSUnsigned = RHSC->isUnsignedIntegerType(); 1503 1504 unsigned LHSRank = getIntegerRank(LHSC); 1505 unsigned RHSRank = getIntegerRank(RHSC); 1506 1507 if (LHSUnsigned == RHSUnsigned) { // Both signed or both unsigned. 1508 if (LHSRank == RHSRank) return 0; 1509 return LHSRank > RHSRank ? 1 : -1; 1510 } 1511 1512 // Otherwise, the LHS is signed and the RHS is unsigned or visa versa. 1513 if (LHSUnsigned) { 1514 // If the unsigned [LHS] type is larger, return it. 1515 if (LHSRank >= RHSRank) 1516 return 1; 1517 1518 // If the signed type can represent all values of the unsigned type, it 1519 // wins. Because we are dealing with 2's complement and types that are 1520 // powers of two larger than each other, this is always safe. 1521 return -1; 1522 } 1523 1524 // If the unsigned [RHS] type is larger, return it. 1525 if (RHSRank >= LHSRank) 1526 return -1; 1527 1528 // If the signed type can represent all values of the unsigned type, it 1529 // wins. Because we are dealing with 2's complement and types that are 1530 // powers of two larger than each other, this is always safe. 1531 return 1; 1532} 1533 1534// getCFConstantStringType - Return the type used for constant CFStrings. 1535QualType ASTContext::getCFConstantStringType() { 1536 if (!CFConstantStringTypeDecl) { 1537 CFConstantStringTypeDecl = 1538 RecordDecl::Create(*this, TagDecl::TK_struct, TUDecl, SourceLocation(), 1539 &Idents.get("NSConstantString")); 1540 QualType FieldTypes[4]; 1541 1542 // const int *isa; 1543 FieldTypes[0] = getPointerType(IntTy.getQualifiedType(QualType::Const)); 1544 // int flags; 1545 FieldTypes[1] = IntTy; 1546 // const char *str; 1547 FieldTypes[2] = getPointerType(CharTy.getQualifiedType(QualType::Const)); 1548 // long length; 1549 FieldTypes[3] = LongTy; 1550 1551 // Create fields 1552 for (unsigned i = 0; i < 4; ++i) { 1553 FieldDecl *Field = FieldDecl::Create(*this, CFConstantStringTypeDecl, 1554 SourceLocation(), 0, 1555 FieldTypes[i], /*BitWidth=*/0, 1556 /*Mutable=*/false, /*PrevDecl=*/0); 1557 CFConstantStringTypeDecl->addDecl(Field); 1558 } 1559 1560 CFConstantStringTypeDecl->completeDefinition(*this); 1561 } 1562 1563 return getTagDeclType(CFConstantStringTypeDecl); 1564} 1565 1566QualType ASTContext::getObjCFastEnumerationStateType() 1567{ 1568 if (!ObjCFastEnumerationStateTypeDecl) { 1569 ObjCFastEnumerationStateTypeDecl = 1570 RecordDecl::Create(*this, TagDecl::TK_struct, TUDecl, SourceLocation(), 1571 &Idents.get("__objcFastEnumerationState")); 1572 1573 QualType FieldTypes[] = { 1574 UnsignedLongTy, 1575 getPointerType(ObjCIdType), 1576 getPointerType(UnsignedLongTy), 1577 getConstantArrayType(UnsignedLongTy, 1578 llvm::APInt(32, 5), ArrayType::Normal, 0) 1579 }; 1580 1581 for (size_t i = 0; i < 4; ++i) { 1582 FieldDecl *Field = FieldDecl::Create(*this, 1583 ObjCFastEnumerationStateTypeDecl, 1584 SourceLocation(), 0, 1585 FieldTypes[i], /*BitWidth=*/0, 1586 /*Mutable=*/false, /*PrevDecl=*/0); 1587 ObjCFastEnumerationStateTypeDecl->addDecl(Field); 1588 } 1589 1590 ObjCFastEnumerationStateTypeDecl->completeDefinition(*this); 1591 } 1592 1593 return getTagDeclType(ObjCFastEnumerationStateTypeDecl); 1594} 1595 1596// This returns true if a type has been typedefed to BOOL: 1597// typedef <type> BOOL; 1598static bool isTypeTypedefedAsBOOL(QualType T) { 1599 if (const TypedefType *TT = dyn_cast<TypedefType>(T)) 1600 if (IdentifierInfo *II = TT->getDecl()->getIdentifier()) 1601 return II->isStr("BOOL"); 1602 1603 return false; 1604} 1605 1606/// getObjCEncodingTypeSize returns size of type for objective-c encoding 1607/// purpose. 1608int ASTContext::getObjCEncodingTypeSize(QualType type) { 1609 uint64_t sz = getTypeSize(type); 1610 1611 // Make all integer and enum types at least as large as an int 1612 if (sz > 0 && type->isIntegralType()) 1613 sz = std::max(sz, getTypeSize(IntTy)); 1614 // Treat arrays as pointers, since that's how they're passed in. 1615 else if (type->isArrayType()) 1616 sz = getTypeSize(VoidPtrTy); 1617 return sz / getTypeSize(CharTy); 1618} 1619 1620/// getObjCEncodingForMethodDecl - Return the encoded type for this method 1621/// declaration. 1622void ASTContext::getObjCEncodingForMethodDecl(const ObjCMethodDecl *Decl, 1623 std::string& S) { 1624 // FIXME: This is not very efficient. 1625 // Encode type qualifer, 'in', 'inout', etc. for the return type. 1626 getObjCEncodingForTypeQualifier(Decl->getObjCDeclQualifier(), S); 1627 // Encode result type. 1628 getObjCEncodingForType(Decl->getResultType(), S); 1629 // Compute size of all parameters. 1630 // Start with computing size of a pointer in number of bytes. 1631 // FIXME: There might(should) be a better way of doing this computation! 1632 SourceLocation Loc; 1633 int PtrSize = getTypeSize(VoidPtrTy) / getTypeSize(CharTy); 1634 // The first two arguments (self and _cmd) are pointers; account for 1635 // their size. 1636 int ParmOffset = 2 * PtrSize; 1637 int NumOfParams = Decl->getNumParams(); 1638 for (int i = 0; i < NumOfParams; i++) { 1639 QualType PType = Decl->getParamDecl(i)->getType(); 1640 int sz = getObjCEncodingTypeSize (PType); 1641 assert (sz > 0 && "getObjCEncodingForMethodDecl - Incomplete param type"); 1642 ParmOffset += sz; 1643 } 1644 S += llvm::utostr(ParmOffset); 1645 S += "@0:"; 1646 S += llvm::utostr(PtrSize); 1647 1648 // Argument types. 1649 ParmOffset = 2 * PtrSize; 1650 for (int i = 0; i < NumOfParams; i++) { 1651 ParmVarDecl *PVDecl = Decl->getParamDecl(i); 1652 QualType PType = PVDecl->getOriginalType(); 1653 if (const ArrayType *AT = 1654 dyn_cast<ArrayType>(PType->getCanonicalTypeInternal())) 1655 // Use array's original type only if it has known number of 1656 // elements. 1657 if (!dyn_cast<ConstantArrayType>(AT)) 1658 PType = PVDecl->getType(); 1659 // Process argument qualifiers for user supplied arguments; such as, 1660 // 'in', 'inout', etc. 1661 getObjCEncodingForTypeQualifier(PVDecl->getObjCDeclQualifier(), S); 1662 getObjCEncodingForType(PType, S); 1663 S += llvm::utostr(ParmOffset); 1664 ParmOffset += getObjCEncodingTypeSize(PType); 1665 } 1666} 1667 1668/// getObjCEncodingForPropertyDecl - Return the encoded type for this 1669/// method declaration. If non-NULL, Container must be either an 1670/// ObjCCategoryImplDecl or ObjCImplementationDecl; it should only be 1671/// NULL when getting encodings for protocol properties. 1672void ASTContext::getObjCEncodingForPropertyDecl(const ObjCPropertyDecl *PD, 1673 const Decl *Container, 1674 std::string& S) { 1675 // Collect information from the property implementation decl(s). 1676 bool Dynamic = false; 1677 ObjCPropertyImplDecl *SynthesizePID = 0; 1678 1679 // FIXME: Duplicated code due to poor abstraction. 1680 if (Container) { 1681 if (const ObjCCategoryImplDecl *CID = 1682 dyn_cast<ObjCCategoryImplDecl>(Container)) { 1683 for (ObjCCategoryImplDecl::propimpl_iterator 1684 i = CID->propimpl_begin(), e = CID->propimpl_end(); i != e; ++i) { 1685 ObjCPropertyImplDecl *PID = *i; 1686 if (PID->getPropertyDecl() == PD) { 1687 if (PID->getPropertyImplementation()==ObjCPropertyImplDecl::Dynamic) { 1688 Dynamic = true; 1689 } else { 1690 SynthesizePID = PID; 1691 } 1692 } 1693 } 1694 } else { 1695 const ObjCImplementationDecl *OID=cast<ObjCImplementationDecl>(Container); 1696 for (ObjCCategoryImplDecl::propimpl_iterator 1697 i = OID->propimpl_begin(), e = OID->propimpl_end(); i != e; ++i) { 1698 ObjCPropertyImplDecl *PID = *i; 1699 if (PID->getPropertyDecl() == PD) { 1700 if (PID->getPropertyImplementation()==ObjCPropertyImplDecl::Dynamic) { 1701 Dynamic = true; 1702 } else { 1703 SynthesizePID = PID; 1704 } 1705 } 1706 } 1707 } 1708 } 1709 1710 // FIXME: This is not very efficient. 1711 S = "T"; 1712 1713 // Encode result type. 1714 // FIXME: GCC uses a generating_property_type_encoding mode during 1715 // this part. Investigate. 1716 getObjCEncodingForType(PD->getType(), S); 1717 1718 if (PD->isReadOnly()) { 1719 S += ",R"; 1720 } else { 1721 switch (PD->getSetterKind()) { 1722 case ObjCPropertyDecl::Assign: break; 1723 case ObjCPropertyDecl::Copy: S += ",C"; break; 1724 case ObjCPropertyDecl::Retain: S += ",&"; break; 1725 } 1726 } 1727 1728 // It really isn't clear at all what this means, since properties 1729 // are "dynamic by default". 1730 if (Dynamic) 1731 S += ",D"; 1732 1733 if (PD->getPropertyAttributes() & ObjCPropertyDecl::OBJC_PR_getter) { 1734 S += ",G"; 1735 S += PD->getGetterName().getAsString(); 1736 } 1737 1738 if (PD->getPropertyAttributes() & ObjCPropertyDecl::OBJC_PR_setter) { 1739 S += ",S"; 1740 S += PD->getSetterName().getAsString(); 1741 } 1742 1743 if (SynthesizePID) { 1744 const ObjCIvarDecl *OID = SynthesizePID->getPropertyIvarDecl(); 1745 S += ",V"; 1746 S += OID->getNameAsString(); 1747 } 1748 1749 // FIXME: OBJCGC: weak & strong 1750} 1751 1752/// getLegacyIntegralTypeEncoding - 1753/// Another legacy compatibility encoding: 32-bit longs are encoded as 1754/// 'l' or 'L', but not always. For typedefs, we need to use 1755/// 'i' or 'I' instead if encoding a struct field, or a pointer! 1756/// 1757void ASTContext::getLegacyIntegralTypeEncoding (QualType &PointeeTy) const { 1758 if (dyn_cast<TypedefType>(PointeeTy.getTypePtr())) { 1759 if (const BuiltinType *BT = PointeeTy->getAsBuiltinType()) { 1760 if (BT->getKind() == BuiltinType::ULong) 1761 PointeeTy = UnsignedIntTy; 1762 else if (BT->getKind() == BuiltinType::Long) 1763 PointeeTy = IntTy; 1764 } 1765 } 1766} 1767 1768void ASTContext::getObjCEncodingForType(QualType T, std::string& S, 1769 FieldDecl *Field) const { 1770 // We follow the behavior of gcc, expanding structures which are 1771 // directly pointed to, and expanding embedded structures. Note that 1772 // these rules are sufficient to prevent recursive encoding of the 1773 // same type. 1774 getObjCEncodingForTypeImpl(T, S, true, true, Field, 1775 true /* outermost type */); 1776} 1777 1778void ASTContext::getObjCEncodingForTypeImpl(QualType T, std::string& S, 1779 bool ExpandPointedToStructures, 1780 bool ExpandStructures, 1781 FieldDecl *FD, 1782 bool OutermostType) const { 1783 if (const BuiltinType *BT = T->getAsBuiltinType()) { 1784 if (FD && FD->isBitField()) { 1785 const Expr *E = FD->getBitWidth(); 1786 assert(E && "bitfield width not there - getObjCEncodingForTypeImpl"); 1787 ASTContext *Ctx = const_cast<ASTContext*>(this); 1788 unsigned N = E->getIntegerConstantExprValue(*Ctx).getZExtValue(); 1789 S += 'b'; 1790 S += llvm::utostr(N); 1791 } 1792 else { 1793 char encoding; 1794 switch (BT->getKind()) { 1795 default: assert(0 && "Unhandled builtin type kind"); 1796 case BuiltinType::Void: encoding = 'v'; break; 1797 case BuiltinType::Bool: encoding = 'B'; break; 1798 case BuiltinType::Char_U: 1799 case BuiltinType::UChar: encoding = 'C'; break; 1800 case BuiltinType::UShort: encoding = 'S'; break; 1801 case BuiltinType::UInt: encoding = 'I'; break; 1802 case BuiltinType::ULong: encoding = 'L'; break; 1803 case BuiltinType::ULongLong: encoding = 'Q'; break; 1804 case BuiltinType::Char_S: 1805 case BuiltinType::SChar: encoding = 'c'; break; 1806 case BuiltinType::Short: encoding = 's'; break; 1807 case BuiltinType::Int: encoding = 'i'; break; 1808 case BuiltinType::Long: encoding = 'l'; break; 1809 case BuiltinType::LongLong: encoding = 'q'; break; 1810 case BuiltinType::Float: encoding = 'f'; break; 1811 case BuiltinType::Double: encoding = 'd'; break; 1812 case BuiltinType::LongDouble: encoding = 'd'; break; 1813 } 1814 1815 S += encoding; 1816 } 1817 } 1818 else if (T->isObjCQualifiedIdType()) { 1819 // Treat id<P...> same as 'id' for encoding purposes. 1820 return getObjCEncodingForTypeImpl(getObjCIdType(), S, 1821 ExpandPointedToStructures, 1822 ExpandStructures, FD); 1823 } 1824 else if (const PointerType *PT = T->getAsPointerType()) { 1825 QualType PointeeTy = PT->getPointeeType(); 1826 bool isReadOnly = false; 1827 // For historical/compatibility reasons, the read-only qualifier of the 1828 // pointee gets emitted _before_ the '^'. The read-only qualifier of 1829 // the pointer itself gets ignored, _unless_ we are looking at a typedef! 1830 // Also, do not emit the 'r' for anything but the outermost type! 1831 if (dyn_cast<TypedefType>(T.getTypePtr())) { 1832 if (OutermostType && T.isConstQualified()) { 1833 isReadOnly = true; 1834 S += 'r'; 1835 } 1836 } 1837 else if (OutermostType) { 1838 QualType P = PointeeTy; 1839 while (P->getAsPointerType()) 1840 P = P->getAsPointerType()->getPointeeType(); 1841 if (P.isConstQualified()) { 1842 isReadOnly = true; 1843 S += 'r'; 1844 } 1845 } 1846 if (isReadOnly) { 1847 // Another legacy compatibility encoding. Some ObjC qualifier and type 1848 // combinations need to be rearranged. 1849 // Rewrite "in const" from "nr" to "rn" 1850 const char * s = S.c_str(); 1851 int len = S.length(); 1852 if (len >= 2 && s[len-2] == 'n' && s[len-1] == 'r') { 1853 std::string replace = "rn"; 1854 S.replace(S.end()-2, S.end(), replace); 1855 } 1856 } 1857 if (isObjCIdType(PointeeTy)) { 1858 S += '@'; 1859 return; 1860 } 1861 else if (PointeeTy->isObjCInterfaceType()) { 1862 if (dyn_cast<TypedefType>(PointeeTy.getTypePtr())) { 1863 // Another historical/compatibility reason. 1864 // We encode the underlying type which comes out as 1865 // {...}; 1866 S += '^'; 1867 getObjCEncodingForTypeImpl(PointeeTy, S, 1868 false, ExpandPointedToStructures, 1869 NULL); 1870 return; 1871 } 1872 S += '@'; 1873 if (FD) { 1874 ObjCInterfaceDecl *OI = PointeeTy->getAsObjCInterfaceType()->getDecl(); 1875 S += '"'; 1876 S += OI->getNameAsCString(); 1877 S += '"'; 1878 } 1879 return; 1880 } else if (isObjCClassType(PointeeTy)) { 1881 S += '#'; 1882 return; 1883 } else if (isObjCSelType(PointeeTy)) { 1884 S += ':'; 1885 return; 1886 } 1887 1888 if (PointeeTy->isCharType()) { 1889 // char pointer types should be encoded as '*' unless it is a 1890 // type that has been typedef'd to 'BOOL'. 1891 if (!isTypeTypedefedAsBOOL(PointeeTy)) { 1892 S += '*'; 1893 return; 1894 } 1895 } 1896 1897 S += '^'; 1898 getLegacyIntegralTypeEncoding(PointeeTy); 1899 1900 getObjCEncodingForTypeImpl(PointeeTy, S, 1901 false, ExpandPointedToStructures, 1902 NULL); 1903 } else if (const ArrayType *AT = 1904 // Ignore type qualifiers etc. 1905 dyn_cast<ArrayType>(T->getCanonicalTypeInternal())) { 1906 S += '['; 1907 1908 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(AT)) 1909 S += llvm::utostr(CAT->getSize().getZExtValue()); 1910 else 1911 assert(0 && "Unhandled array type!"); 1912 1913 getObjCEncodingForTypeImpl(AT->getElementType(), S, 1914 false, ExpandStructures, FD); 1915 S += ']'; 1916 } else if (T->getAsFunctionType()) { 1917 S += '?'; 1918 } else if (const RecordType *RTy = T->getAsRecordType()) { 1919 RecordDecl *RDecl = RTy->getDecl(); 1920 S += RDecl->isUnion() ? '(' : '{'; 1921 // Anonymous structures print as '?' 1922 if (const IdentifierInfo *II = RDecl->getIdentifier()) { 1923 S += II->getName(); 1924 } else { 1925 S += '?'; 1926 } 1927 if (ExpandStructures) { 1928 S += '='; 1929 for (RecordDecl::field_iterator Field = RDecl->field_begin(), 1930 FieldEnd = RDecl->field_end(); 1931 Field != FieldEnd; ++Field) { 1932 if (FD) { 1933 S += '"'; 1934 S += Field->getNameAsString(); 1935 S += '"'; 1936 } 1937 1938 // Special case bit-fields. 1939 if (Field->isBitField()) { 1940 getObjCEncodingForTypeImpl(Field->getType(), S, false, true, 1941 (*Field)); 1942 } else { 1943 QualType qt = Field->getType(); 1944 getLegacyIntegralTypeEncoding(qt); 1945 getObjCEncodingForTypeImpl(qt, S, false, true, 1946 FD); 1947 } 1948 } 1949 } 1950 S += RDecl->isUnion() ? ')' : '}'; 1951 } else if (T->isEnumeralType()) { 1952 S += 'i'; 1953 } else if (T->isBlockPointerType()) { 1954 S += '^'; // This type string is the same as general pointers. 1955 } else if (T->isObjCInterfaceType()) { 1956 // @encode(class_name) 1957 ObjCInterfaceDecl *OI = T->getAsObjCInterfaceType()->getDecl(); 1958 S += '{'; 1959 const IdentifierInfo *II = OI->getIdentifier(); 1960 S += II->getName(); 1961 S += '='; 1962 std::vector<FieldDecl*> RecFields; 1963 CollectObjCIvars(OI, RecFields); 1964 for (unsigned int i = 0; i != RecFields.size(); i++) { 1965 if (RecFields[i]->isBitField()) 1966 getObjCEncodingForTypeImpl(RecFields[i]->getType(), S, false, true, 1967 RecFields[i]); 1968 else 1969 getObjCEncodingForTypeImpl(RecFields[i]->getType(), S, false, true, 1970 FD); 1971 } 1972 S += '}'; 1973 } 1974 else 1975 assert(0 && "@encode for type not implemented!"); 1976} 1977 1978void ASTContext::getObjCEncodingForTypeQualifier(Decl::ObjCDeclQualifier QT, 1979 std::string& S) const { 1980 if (QT & Decl::OBJC_TQ_In) 1981 S += 'n'; 1982 if (QT & Decl::OBJC_TQ_Inout) 1983 S += 'N'; 1984 if (QT & Decl::OBJC_TQ_Out) 1985 S += 'o'; 1986 if (QT & Decl::OBJC_TQ_Bycopy) 1987 S += 'O'; 1988 if (QT & Decl::OBJC_TQ_Byref) 1989 S += 'R'; 1990 if (QT & Decl::OBJC_TQ_Oneway) 1991 S += 'V'; 1992} 1993 1994void ASTContext::setBuiltinVaListType(QualType T) 1995{ 1996 assert(BuiltinVaListType.isNull() && "__builtin_va_list type already set!"); 1997 1998 BuiltinVaListType = T; 1999} 2000 2001void ASTContext::setObjCIdType(TypedefDecl *TD) 2002{ 2003 ObjCIdType = getTypedefType(TD); 2004 2005 // typedef struct objc_object *id; 2006 const PointerType *ptr = TD->getUnderlyingType()->getAsPointerType(); 2007 assert(ptr && "'id' incorrectly typed"); 2008 const RecordType *rec = ptr->getPointeeType()->getAsStructureType(); 2009 assert(rec && "'id' incorrectly typed"); 2010 IdStructType = rec; 2011} 2012 2013void ASTContext::setObjCSelType(TypedefDecl *TD) 2014{ 2015 ObjCSelType = getTypedefType(TD); 2016 2017 // typedef struct objc_selector *SEL; 2018 const PointerType *ptr = TD->getUnderlyingType()->getAsPointerType(); 2019 assert(ptr && "'SEL' incorrectly typed"); 2020 const RecordType *rec = ptr->getPointeeType()->getAsStructureType(); 2021 assert(rec && "'SEL' incorrectly typed"); 2022 SelStructType = rec; 2023} 2024 2025void ASTContext::setObjCProtoType(QualType QT) 2026{ 2027 ObjCProtoType = QT; 2028} 2029 2030void ASTContext::setObjCClassType(TypedefDecl *TD) 2031{ 2032 ObjCClassType = getTypedefType(TD); 2033 2034 // typedef struct objc_class *Class; 2035 const PointerType *ptr = TD->getUnderlyingType()->getAsPointerType(); 2036 assert(ptr && "'Class' incorrectly typed"); 2037 const RecordType *rec = ptr->getPointeeType()->getAsStructureType(); 2038 assert(rec && "'Class' incorrectly typed"); 2039 ClassStructType = rec; 2040} 2041 2042void ASTContext::setObjCConstantStringInterface(ObjCInterfaceDecl *Decl) { 2043 assert(ObjCConstantStringType.isNull() && 2044 "'NSConstantString' type already set!"); 2045 2046 ObjCConstantStringType = getObjCInterfaceType(Decl); 2047} 2048 2049/// getFromTargetType - Given one of the integer types provided by 2050/// TargetInfo, produce the corresponding type. The unsigned @p Type 2051/// is actually a value of type @c TargetInfo::IntType. 2052QualType ASTContext::getFromTargetType(unsigned Type) const { 2053 switch (Type) { 2054 case TargetInfo::NoInt: return QualType(); 2055 case TargetInfo::SignedShort: return ShortTy; 2056 case TargetInfo::UnsignedShort: return UnsignedShortTy; 2057 case TargetInfo::SignedInt: return IntTy; 2058 case TargetInfo::UnsignedInt: return UnsignedIntTy; 2059 case TargetInfo::SignedLong: return LongTy; 2060 case TargetInfo::UnsignedLong: return UnsignedLongTy; 2061 case TargetInfo::SignedLongLong: return LongLongTy; 2062 case TargetInfo::UnsignedLongLong: return UnsignedLongLongTy; 2063 } 2064 2065 assert(false && "Unhandled TargetInfo::IntType value"); 2066 return QualType(); 2067} 2068 2069//===----------------------------------------------------------------------===// 2070// Type Predicates. 2071//===----------------------------------------------------------------------===// 2072 2073/// isObjCObjectPointerType - Returns true if type is an Objective-C pointer 2074/// to an object type. This includes "id" and "Class" (two 'special' pointers 2075/// to struct), Interface* (pointer to ObjCInterfaceType) and id<P> (qualified 2076/// ID type). 2077bool ASTContext::isObjCObjectPointerType(QualType Ty) const { 2078 if (Ty->isObjCQualifiedIdType()) 2079 return true; 2080 2081 // Blocks are objects. 2082 if (Ty->isBlockPointerType()) 2083 return true; 2084 2085 // All other object types are pointers. 2086 if (!Ty->isPointerType()) 2087 return false; 2088 2089 // Check to see if this is 'id' or 'Class', both of which are typedefs for 2090 // pointer types. This looks for the typedef specifically, not for the 2091 // underlying type. 2092 if (Ty == getObjCIdType() || Ty == getObjCClassType()) 2093 return true; 2094 2095 // If this a pointer to an interface (e.g. NSString*), it is ok. 2096 return Ty->getAsPointerType()->getPointeeType()->isObjCInterfaceType(); 2097} 2098 2099//===----------------------------------------------------------------------===// 2100// Type Compatibility Testing 2101//===----------------------------------------------------------------------===// 2102 2103/// typesAreBlockCompatible - This routine is called when comparing two 2104/// block types. Types must be strictly compatible here. For example, 2105/// C unfortunately doesn't produce an error for the following: 2106/// 2107/// int (*emptyArgFunc)(); 2108/// int (*intArgList)(int) = emptyArgFunc; 2109/// 2110/// For blocks, we will produce an error for the following (similar to C++): 2111/// 2112/// int (^emptyArgBlock)(); 2113/// int (^intArgBlock)(int) = emptyArgBlock; 2114/// 2115/// FIXME: When the dust settles on this integration, fold this into mergeTypes. 2116/// 2117bool ASTContext::typesAreBlockCompatible(QualType lhs, QualType rhs) { 2118 const FunctionType *lbase = lhs->getAsFunctionType(); 2119 const FunctionType *rbase = rhs->getAsFunctionType(); 2120 const FunctionTypeProto *lproto = dyn_cast<FunctionTypeProto>(lbase); 2121 const FunctionTypeProto *rproto = dyn_cast<FunctionTypeProto>(rbase); 2122 if (lproto && rproto) 2123 return !mergeTypes(lhs, rhs).isNull(); 2124 return false; 2125} 2126 2127/// areCompatVectorTypes - Return true if the two specified vector types are 2128/// compatible. 2129static bool areCompatVectorTypes(const VectorType *LHS, 2130 const VectorType *RHS) { 2131 assert(LHS->isCanonical() && RHS->isCanonical()); 2132 return LHS->getElementType() == RHS->getElementType() && 2133 LHS->getNumElements() == RHS->getNumElements(); 2134} 2135 2136/// canAssignObjCInterfaces - Return true if the two interface types are 2137/// compatible for assignment from RHS to LHS. This handles validation of any 2138/// protocol qualifiers on the LHS or RHS. 2139/// 2140bool ASTContext::canAssignObjCInterfaces(const ObjCInterfaceType *LHS, 2141 const ObjCInterfaceType *RHS) { 2142 // Verify that the base decls are compatible: the RHS must be a subclass of 2143 // the LHS. 2144 if (!LHS->getDecl()->isSuperClassOf(RHS->getDecl())) 2145 return false; 2146 2147 // RHS must have a superset of the protocols in the LHS. If the LHS is not 2148 // protocol qualified at all, then we are good. 2149 if (!isa<ObjCQualifiedInterfaceType>(LHS)) 2150 return true; 2151 2152 // Okay, we know the LHS has protocol qualifiers. If the RHS doesn't, then it 2153 // isn't a superset. 2154 if (!isa<ObjCQualifiedInterfaceType>(RHS)) 2155 return true; // FIXME: should return false! 2156 2157 // Finally, we must have two protocol-qualified interfaces. 2158 const ObjCQualifiedInterfaceType *LHSP =cast<ObjCQualifiedInterfaceType>(LHS); 2159 const ObjCQualifiedInterfaceType *RHSP =cast<ObjCQualifiedInterfaceType>(RHS); 2160 ObjCQualifiedInterfaceType::qual_iterator LHSPI = LHSP->qual_begin(); 2161 ObjCQualifiedInterfaceType::qual_iterator LHSPE = LHSP->qual_end(); 2162 ObjCQualifiedInterfaceType::qual_iterator RHSPI = RHSP->qual_begin(); 2163 ObjCQualifiedInterfaceType::qual_iterator RHSPE = RHSP->qual_end(); 2164 2165 // All protocols in LHS must have a presence in RHS. Since the protocol lists 2166 // are both sorted alphabetically and have no duplicates, we can scan RHS and 2167 // LHS in a single parallel scan until we run out of elements in LHS. 2168 assert(LHSPI != LHSPE && "Empty LHS protocol list?"); 2169 ObjCProtocolDecl *LHSProto = *LHSPI; 2170 2171 while (RHSPI != RHSPE) { 2172 ObjCProtocolDecl *RHSProto = *RHSPI++; 2173 // If the RHS has a protocol that the LHS doesn't, ignore it. 2174 if (RHSProto != LHSProto) 2175 continue; 2176 2177 // Otherwise, the RHS does have this element. 2178 ++LHSPI; 2179 if (LHSPI == LHSPE) 2180 return true; // All protocols in LHS exist in RHS. 2181 2182 LHSProto = *LHSPI; 2183 } 2184 2185 // If we got here, we didn't find one of the LHS's protocols in the RHS list. 2186 return false; 2187} 2188 2189/// typesAreCompatible - C99 6.7.3p9: For two qualified types to be compatible, 2190/// both shall have the identically qualified version of a compatible type. 2191/// C99 6.2.7p1: Two types have compatible types if their types are the 2192/// same. See 6.7.[2,3,5] for additional rules. 2193bool ASTContext::typesAreCompatible(QualType LHS, QualType RHS) { 2194 return !mergeTypes(LHS, RHS).isNull(); 2195} 2196 2197QualType ASTContext::mergeFunctionTypes(QualType lhs, QualType rhs) { 2198 const FunctionType *lbase = lhs->getAsFunctionType(); 2199 const FunctionType *rbase = rhs->getAsFunctionType(); 2200 const FunctionTypeProto *lproto = dyn_cast<FunctionTypeProto>(lbase); 2201 const FunctionTypeProto *rproto = dyn_cast<FunctionTypeProto>(rbase); 2202 bool allLTypes = true; 2203 bool allRTypes = true; 2204 2205 // Check return type 2206 QualType retType = mergeTypes(lbase->getResultType(), rbase->getResultType()); 2207 if (retType.isNull()) return QualType(); 2208 if (getCanonicalType(retType) != getCanonicalType(lbase->getResultType())) 2209 allLTypes = false; 2210 if (getCanonicalType(retType) != getCanonicalType(rbase->getResultType())) 2211 allRTypes = false; 2212 2213 if (lproto && rproto) { // two C99 style function prototypes 2214 unsigned lproto_nargs = lproto->getNumArgs(); 2215 unsigned rproto_nargs = rproto->getNumArgs(); 2216 2217 // Compatible functions must have the same number of arguments 2218 if (lproto_nargs != rproto_nargs) 2219 return QualType(); 2220 2221 // Variadic and non-variadic functions aren't compatible 2222 if (lproto->isVariadic() != rproto->isVariadic()) 2223 return QualType(); 2224 2225 if (lproto->getTypeQuals() != rproto->getTypeQuals()) 2226 return QualType(); 2227 2228 // Check argument compatibility 2229 llvm::SmallVector<QualType, 10> types; 2230 for (unsigned i = 0; i < lproto_nargs; i++) { 2231 QualType largtype = lproto->getArgType(i).getUnqualifiedType(); 2232 QualType rargtype = rproto->getArgType(i).getUnqualifiedType(); 2233 QualType argtype = mergeTypes(largtype, rargtype); 2234 if (argtype.isNull()) return QualType(); 2235 types.push_back(argtype); 2236 if (getCanonicalType(argtype) != getCanonicalType(largtype)) 2237 allLTypes = false; 2238 if (getCanonicalType(argtype) != getCanonicalType(rargtype)) 2239 allRTypes = false; 2240 } 2241 if (allLTypes) return lhs; 2242 if (allRTypes) return rhs; 2243 return getFunctionType(retType, types.begin(), types.size(), 2244 lproto->isVariadic(), lproto->getTypeQuals()); 2245 } 2246 2247 if (lproto) allRTypes = false; 2248 if (rproto) allLTypes = false; 2249 2250 const FunctionTypeProto *proto = lproto ? lproto : rproto; 2251 if (proto) { 2252 if (proto->isVariadic()) return QualType(); 2253 // Check that the types are compatible with the types that 2254 // would result from default argument promotions (C99 6.7.5.3p15). 2255 // The only types actually affected are promotable integer 2256 // types and floats, which would be passed as a different 2257 // type depending on whether the prototype is visible. 2258 unsigned proto_nargs = proto->getNumArgs(); 2259 for (unsigned i = 0; i < proto_nargs; ++i) { 2260 QualType argTy = proto->getArgType(i); 2261 if (argTy->isPromotableIntegerType() || 2262 getCanonicalType(argTy).getUnqualifiedType() == FloatTy) 2263 return QualType(); 2264 } 2265 2266 if (allLTypes) return lhs; 2267 if (allRTypes) return rhs; 2268 return getFunctionType(retType, proto->arg_type_begin(), 2269 proto->getNumArgs(), lproto->isVariadic(), 2270 lproto->getTypeQuals()); 2271 } 2272 2273 if (allLTypes) return lhs; 2274 if (allRTypes) return rhs; 2275 return getFunctionTypeNoProto(retType); 2276} 2277 2278QualType ASTContext::mergeTypes(QualType LHS, QualType RHS) { 2279 // C++ [expr]: If an expression initially has the type "reference to T", the 2280 // type is adjusted to "T" prior to any further analysis, the expression 2281 // designates the object or function denoted by the reference, and the 2282 // expression is an lvalue. 2283 // FIXME: C++ shouldn't be going through here! The rules are different 2284 // enough that they should be handled separately. 2285 if (const ReferenceType *RT = LHS->getAsReferenceType()) 2286 LHS = RT->getPointeeType(); 2287 if (const ReferenceType *RT = RHS->getAsReferenceType()) 2288 RHS = RT->getPointeeType(); 2289 2290 QualType LHSCan = getCanonicalType(LHS), 2291 RHSCan = getCanonicalType(RHS); 2292 2293 // If two types are identical, they are compatible. 2294 if (LHSCan == RHSCan) 2295 return LHS; 2296 2297 // If the qualifiers are different, the types aren't compatible 2298 if (LHSCan.getCVRQualifiers() != RHSCan.getCVRQualifiers() || 2299 LHSCan.getAddressSpace() != RHSCan.getAddressSpace()) 2300 return QualType(); 2301 2302 Type::TypeClass LHSClass = LHSCan->getTypeClass(); 2303 Type::TypeClass RHSClass = RHSCan->getTypeClass(); 2304 2305 // We want to consider the two function types to be the same for these 2306 // comparisons, just force one to the other. 2307 if (LHSClass == Type::FunctionProto) LHSClass = Type::FunctionNoProto; 2308 if (RHSClass == Type::FunctionProto) RHSClass = Type::FunctionNoProto; 2309 2310 // Same as above for arrays 2311 if (LHSClass == Type::VariableArray || LHSClass == Type::IncompleteArray) 2312 LHSClass = Type::ConstantArray; 2313 if (RHSClass == Type::VariableArray || RHSClass == Type::IncompleteArray) 2314 RHSClass = Type::ConstantArray; 2315 2316 // Canonicalize ExtVector -> Vector. 2317 if (LHSClass == Type::ExtVector) LHSClass = Type::Vector; 2318 if (RHSClass == Type::ExtVector) RHSClass = Type::Vector; 2319 2320 // Consider qualified interfaces and interfaces the same. 2321 if (LHSClass == Type::ObjCQualifiedInterface) LHSClass = Type::ObjCInterface; 2322 if (RHSClass == Type::ObjCQualifiedInterface) RHSClass = Type::ObjCInterface; 2323 2324 // If the canonical type classes don't match. 2325 if (LHSClass != RHSClass) { 2326 // ID is compatible with all qualified id types. 2327 if (LHS->isObjCQualifiedIdType()) { 2328 if (const PointerType *PT = RHS->getAsPointerType()) { 2329 QualType pType = PT->getPointeeType(); 2330 if (isObjCIdType(pType)) 2331 return LHS; 2332 // FIXME: need to use ObjCQualifiedIdTypesAreCompatible(LHS, RHS, true). 2333 // Unfortunately, this API is part of Sema (which we don't have access 2334 // to. Need to refactor. The following check is insufficient, since we 2335 // need to make sure the class implements the protocol. 2336 if (pType->isObjCInterfaceType()) 2337 return LHS; 2338 } 2339 } 2340 if (RHS->isObjCQualifiedIdType()) { 2341 if (const PointerType *PT = LHS->getAsPointerType()) { 2342 QualType pType = PT->getPointeeType(); 2343 if (isObjCIdType(pType)) 2344 return RHS; 2345 // FIXME: need to use ObjCQualifiedIdTypesAreCompatible(LHS, RHS, true). 2346 // Unfortunately, this API is part of Sema (which we don't have access 2347 // to. Need to refactor. The following check is insufficient, since we 2348 // need to make sure the class implements the protocol. 2349 if (pType->isObjCInterfaceType()) 2350 return RHS; 2351 } 2352 } 2353 // C99 6.7.2.2p4: Each enumerated type shall be compatible with char, 2354 // a signed integer type, or an unsigned integer type. 2355 if (const EnumType* ETy = LHS->getAsEnumType()) { 2356 if (ETy->getDecl()->getIntegerType() == RHSCan.getUnqualifiedType()) 2357 return RHS; 2358 } 2359 if (const EnumType* ETy = RHS->getAsEnumType()) { 2360 if (ETy->getDecl()->getIntegerType() == LHSCan.getUnqualifiedType()) 2361 return LHS; 2362 } 2363 2364 return QualType(); 2365 } 2366 2367 // The canonical type classes match. 2368 switch (LHSClass) { 2369 case Type::Pointer: 2370 { 2371 // Merge two pointer types, while trying to preserve typedef info 2372 QualType LHSPointee = LHS->getAsPointerType()->getPointeeType(); 2373 QualType RHSPointee = RHS->getAsPointerType()->getPointeeType(); 2374 QualType ResultType = mergeTypes(LHSPointee, RHSPointee); 2375 if (ResultType.isNull()) return QualType(); 2376 if (getCanonicalType(LHSPointee) == getCanonicalType(ResultType)) 2377 return LHS; 2378 if (getCanonicalType(RHSPointee) == getCanonicalType(ResultType)) 2379 return RHS; 2380 return getPointerType(ResultType); 2381 } 2382 case Type::BlockPointer: 2383 { 2384 // Merge two block pointer types, while trying to preserve typedef info 2385 QualType LHSPointee = LHS->getAsBlockPointerType()->getPointeeType(); 2386 QualType RHSPointee = RHS->getAsBlockPointerType()->getPointeeType(); 2387 QualType ResultType = mergeTypes(LHSPointee, RHSPointee); 2388 if (ResultType.isNull()) return QualType(); 2389 if (getCanonicalType(LHSPointee) == getCanonicalType(ResultType)) 2390 return LHS; 2391 if (getCanonicalType(RHSPointee) == getCanonicalType(ResultType)) 2392 return RHS; 2393 return getBlockPointerType(ResultType); 2394 } 2395 case Type::ConstantArray: 2396 { 2397 const ConstantArrayType* LCAT = getAsConstantArrayType(LHS); 2398 const ConstantArrayType* RCAT = getAsConstantArrayType(RHS); 2399 if (LCAT && RCAT && RCAT->getSize() != LCAT->getSize()) 2400 return QualType(); 2401 2402 QualType LHSElem = getAsArrayType(LHS)->getElementType(); 2403 QualType RHSElem = getAsArrayType(RHS)->getElementType(); 2404 QualType ResultType = mergeTypes(LHSElem, RHSElem); 2405 if (ResultType.isNull()) return QualType(); 2406 if (LCAT && getCanonicalType(LHSElem) == getCanonicalType(ResultType)) 2407 return LHS; 2408 if (RCAT && getCanonicalType(RHSElem) == getCanonicalType(ResultType)) 2409 return RHS; 2410 if (LCAT) return getConstantArrayType(ResultType, LCAT->getSize(), 2411 ArrayType::ArraySizeModifier(), 0); 2412 if (RCAT) return getConstantArrayType(ResultType, RCAT->getSize(), 2413 ArrayType::ArraySizeModifier(), 0); 2414 const VariableArrayType* LVAT = getAsVariableArrayType(LHS); 2415 const VariableArrayType* RVAT = getAsVariableArrayType(RHS); 2416 if (LVAT && getCanonicalType(LHSElem) == getCanonicalType(ResultType)) 2417 return LHS; 2418 if (RVAT && getCanonicalType(RHSElem) == getCanonicalType(ResultType)) 2419 return RHS; 2420 if (LVAT) { 2421 // FIXME: This isn't correct! But tricky to implement because 2422 // the array's size has to be the size of LHS, but the type 2423 // has to be different. 2424 return LHS; 2425 } 2426 if (RVAT) { 2427 // FIXME: This isn't correct! But tricky to implement because 2428 // the array's size has to be the size of RHS, but the type 2429 // has to be different. 2430 return RHS; 2431 } 2432 if (getCanonicalType(LHSElem) == getCanonicalType(ResultType)) return LHS; 2433 if (getCanonicalType(RHSElem) == getCanonicalType(ResultType)) return RHS; 2434 return getIncompleteArrayType(ResultType, ArrayType::ArraySizeModifier(),0); 2435 } 2436 case Type::FunctionNoProto: 2437 return mergeFunctionTypes(LHS, RHS); 2438 case Type::Tagged: 2439 // FIXME: Why are these compatible? 2440 if (isObjCIdType(LHS) && isObjCClassType(RHS)) return LHS; 2441 if (isObjCClassType(LHS) && isObjCIdType(RHS)) return LHS; 2442 return QualType(); 2443 case Type::Builtin: 2444 // Only exactly equal builtin types are compatible, which is tested above. 2445 return QualType(); 2446 case Type::Vector: 2447 if (areCompatVectorTypes(LHS->getAsVectorType(), RHS->getAsVectorType())) 2448 return LHS; 2449 return QualType(); 2450 case Type::ObjCInterface: 2451 // Distinct ObjC interfaces are not compatible; see canAssignObjCInterfaces 2452 // for checking assignment/comparison safety 2453 return QualType(); 2454 case Type::ObjCQualifiedId: 2455 // Distinct qualified id's are not compatible. 2456 return QualType(); 2457 default: 2458 assert(0 && "unexpected type"); 2459 return QualType(); 2460 } 2461} 2462 2463//===----------------------------------------------------------------------===// 2464// Integer Predicates 2465//===----------------------------------------------------------------------===// 2466unsigned ASTContext::getIntWidth(QualType T) { 2467 if (T == BoolTy) 2468 return 1; 2469 // At the moment, only bool has padding bits 2470 return (unsigned)getTypeSize(T); 2471} 2472 2473QualType ASTContext::getCorrespondingUnsignedType(QualType T) { 2474 assert(T->isSignedIntegerType() && "Unexpected type"); 2475 if (const EnumType* ETy = T->getAsEnumType()) 2476 T = ETy->getDecl()->getIntegerType(); 2477 const BuiltinType* BTy = T->getAsBuiltinType(); 2478 assert (BTy && "Unexpected signed integer type"); 2479 switch (BTy->getKind()) { 2480 case BuiltinType::Char_S: 2481 case BuiltinType::SChar: 2482 return UnsignedCharTy; 2483 case BuiltinType::Short: 2484 return UnsignedShortTy; 2485 case BuiltinType::Int: 2486 return UnsignedIntTy; 2487 case BuiltinType::Long: 2488 return UnsignedLongTy; 2489 case BuiltinType::LongLong: 2490 return UnsignedLongLongTy; 2491 default: 2492 assert(0 && "Unexpected signed integer type"); 2493 return QualType(); 2494 } 2495} 2496 2497 2498//===----------------------------------------------------------------------===// 2499// Serialization Support 2500//===----------------------------------------------------------------------===// 2501 2502/// Emit - Serialize an ASTContext object to Bitcode. 2503void ASTContext::Emit(llvm::Serializer& S) const { 2504 S.Emit(LangOpts); 2505 S.EmitRef(SourceMgr); 2506 S.EmitRef(Target); 2507 S.EmitRef(Idents); 2508 S.EmitRef(Selectors); 2509 2510 // Emit the size of the type vector so that we can reserve that size 2511 // when we reconstitute the ASTContext object. 2512 S.EmitInt(Types.size()); 2513 2514 for (std::vector<Type*>::const_iterator I=Types.begin(), E=Types.end(); 2515 I!=E;++I) 2516 (*I)->Emit(S); 2517 2518 S.EmitOwnedPtr(TUDecl); 2519 2520 // FIXME: S.EmitOwnedPtr(CFConstantStringTypeDecl); 2521} 2522 2523ASTContext* ASTContext::Create(llvm::Deserializer& D) { 2524 2525 // Read the language options. 2526 LangOptions LOpts; 2527 LOpts.Read(D); 2528 2529 SourceManager &SM = D.ReadRef<SourceManager>(); 2530 TargetInfo &t = D.ReadRef<TargetInfo>(); 2531 IdentifierTable &idents = D.ReadRef<IdentifierTable>(); 2532 SelectorTable &sels = D.ReadRef<SelectorTable>(); 2533 2534 unsigned size_reserve = D.ReadInt(); 2535 2536 ASTContext* A = new ASTContext(LOpts, SM, t, idents, sels, 2537 size_reserve); 2538 2539 for (unsigned i = 0; i < size_reserve; ++i) 2540 Type::Create(*A,i,D); 2541 2542 A->TUDecl = cast<TranslationUnitDecl>(D.ReadOwnedPtr<Decl>(*A)); 2543 2544 // FIXME: A->CFConstantStringTypeDecl = D.ReadOwnedPtr<RecordDecl>(); 2545 2546 return A; 2547} 2548