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