CodeGenTypes.cpp revision 09dc6660487fc2f4a4bb2032e30123d3e0da7230
15f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer//===--- CodeGenTypes.cpp - Type translation for LLVM CodeGen -------------===// 25f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// 35f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// The LLVM Compiler Infrastructure 45f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// 50bc735ffcfb223c0186419547abaa5c84482663eChris Lattner// This file is distributed under the University of Illinois Open Source 60bc735ffcfb223c0186419547abaa5c84482663eChris Lattner// License. See LICENSE.TXT for details. 75f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// 85f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer//===----------------------------------------------------------------------===// 95f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// 105f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// This is the code that handles AST -> LLVM type lowering. 115f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer// 125f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer//===----------------------------------------------------------------------===// 135f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 145f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer#include "CodeGenTypes.h" 15de7fb8413b13651fd85b7125d08b3c9ac2816d9dDaniel Dunbar#include "clang/AST/ASTContext.h" 16c4a1dea2dc56bd1357ec91b829a0b9e68229a13eDaniel Dunbar#include "clang/AST/DeclObjC.h" 17de7fb8413b13651fd85b7125d08b3c9ac2816d9dDaniel Dunbar#include "clang/AST/Expr.h" 18e91593ef084479340582b2ba177b44be50a717b7Daniel Dunbar#include "clang/AST/RecordLayout.h" 195f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer#include "llvm/DerivedTypes.h" 204e533287e6a9adac78c9ac370612581aad9b8c5eAnders Carlsson#include "llvm/Module.h" 21d9e9ede6b1703849da739629904dad197306e527Devang Patel#include "llvm/Target/TargetData.h" 225f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 2345c25ba11cbf8c9a461def5b03f6ee9481e06769Daniel Dunbar#include "CGCall.h" 2445c25ba11cbf8c9a461def5b03f6ee9481e06769Daniel Dunbar 255f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencerusing namespace clang; 265f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencerusing namespace CodeGen; 275f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 28057afddf0fab91d979d6a750667d56a345225c96Devang Patelnamespace { 2988a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel /// RecordOrganizer - This helper class, used by CGRecordLayout, layouts 30057afddf0fab91d979d6a750667d56a345225c96Devang Patel /// structs and unions. It manages transient information used during layout. 314c4635c6cd8114bfa3ee20628fa1f03e67ac1e55Devang Patel /// FIXME : Handle field aligments. Handle packed structs. 32057afddf0fab91d979d6a750667d56a345225c96Devang Patel class RecordOrganizer { 33057afddf0fab91d979d6a750667d56a345225c96Devang Patel public: 34cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman explicit RecordOrganizer(CodeGenTypes &Types, const RecordDecl& Record) : 35cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman CGT(Types), RD(Record), STy(NULL) {} 360bd41f2cea0639395e8ab7ef8fd6df2c1999b6aeDevang Patel 3786522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel /// layoutStructFields - Do the actual work and lay out all fields. Create 38057afddf0fab91d979d6a750667d56a345225c96Devang Patel /// corresponding llvm struct type. This should be invoked only after 39057afddf0fab91d979d6a750667d56a345225c96Devang Patel /// all fields are added. 4088a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel void layoutStructFields(const ASTRecordLayout &RL); 4186522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel 4286522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel /// layoutUnionFields - Do the actual work and lay out all fields. Create 4386522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel /// corresponding llvm struct type. This should be invoked only after 4486522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel /// all fields are added. 45cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman void layoutUnionFields(const ASTRecordLayout &RL); 46057afddf0fab91d979d6a750667d56a345225c96Devang Patel 47057afddf0fab91d979d6a750667d56a345225c96Devang Patel /// getLLVMType - Return associated llvm struct type. This may be NULL 48057afddf0fab91d979d6a750667d56a345225c96Devang Patel /// if fields are not laid out. 49057afddf0fab91d979d6a750667d56a345225c96Devang Patel llvm::Type *getLLVMType() const { 50057afddf0fab91d979d6a750667d56a345225c96Devang Patel return STy; 51057afddf0fab91d979d6a750667d56a345225c96Devang Patel } 52057afddf0fab91d979d6a750667d56a345225c96Devang Patel 53eae1560d4fb99b9df814bc12c0419825996156cdDevang Patel llvm::SmallSet<unsigned, 8> &getPaddingFields() { 545bfc1a7ecb853cf87d10e720a07b9fbcd2a223eeDevang Patel return PaddingFields; 555bfc1a7ecb853cf87d10e720a07b9fbcd2a223eeDevang Patel } 565bfc1a7ecb853cf87d10e720a07b9fbcd2a223eeDevang Patel 57057afddf0fab91d979d6a750667d56a345225c96Devang Patel private: 58f9fef925644a6c40b344a43ab9ebdb08a707de53Devang Patel CodeGenTypes &CGT; 59cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman const RecordDecl& RD; 60057afddf0fab91d979d6a750667d56a345225c96Devang Patel llvm::Type *STy; 61eae1560d4fb99b9df814bc12c0419825996156cdDevang Patel llvm::SmallSet<unsigned, 8> PaddingFields; 62057afddf0fab91d979d6a750667d56a345225c96Devang Patel }; 63057afddf0fab91d979d6a750667d56a345225c96Devang Patel} 64057afddf0fab91d979d6a750667d56a345225c96Devang Patel 657a4718e813e5e99d478567a482217c7eef8572c5Devang PatelCodeGenTypes::CodeGenTypes(ASTContext &Ctx, llvm::Module& M, 667a4718e813e5e99d478567a482217c7eef8572c5Devang Patel const llvm::TargetData &TD) 676b1da0ea19c12346192f5ea4d70872c13bfcc82aDaniel Dunbar : Context(Ctx), Target(Ctx.Target), TheModule(M), TheTargetData(TD), 686b1da0ea19c12346192f5ea4d70872c13bfcc82aDaniel Dunbar TheABIInfo(0) { 69d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner} 705f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 71b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang PatelCodeGenTypes::~CodeGenTypes() { 72efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar for(llvm::DenseMap<const Type *, CGRecordLayout *>::iterator 7388a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel I = CGRecordLayouts.begin(), E = CGRecordLayouts.end(); 74b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel I != E; ++I) 75b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel delete I->second; 7688a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel CGRecordLayouts.clear(); 77b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel} 78b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel 795f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer/// ConvertType - Convert the specified type to its LLVM form. 805f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencerconst llvm::Type *CodeGenTypes::ConvertType(QualType T) { 81fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner llvm::PATypeHolder Result = ConvertTypeRecursive(T); 82fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner 83fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // Any pointers that were converted defered evaluation of their pointee type, 84fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // creating an opaque type instead. This is in order to avoid problems with 85fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // circular types. Loop through all these defered pointees, if any, and 86fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // resolve them now. 87fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner while (!PointersToResolve.empty()) { 886aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar std::pair<QualType, llvm::OpaqueType*> P = 89fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner PointersToResolve.back(); 90fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner PointersToResolve.pop_back(); 91fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // We can handle bare pointers here because we know that the only pointers 92fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // to the Opaque type are P.second and from other types. Refining the 93fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner // opqaue type away will invalidate P.second, but we don't mind :). 9457a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman const llvm::Type *NT = ConvertTypeForMemRecursive(P.first); 95fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner P.second->refineAbstractTypeTo(NT); 96fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner } 97fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner 98fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner return Result; 99fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner} 100fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner 101fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattnerconst llvm::Type *CodeGenTypes::ConvertTypeRecursive(QualType T) { 10209dc6660487fc2f4a4bb2032e30123d3e0da7230Chris Lattner T = Context.getCanonicalType(T); 1039619662a1d42e2008b865d3459c0677e149dad1bChris Lattner 10430ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel // See if type is already cached. 1050ffe89ab1e4890899e0e11a6f68223567a69b38aDevang Patel llvm::DenseMap<Type *, llvm::PATypeHolder>::iterator 1069619662a1d42e2008b865d3459c0677e149dad1bChris Lattner I = TypeCache.find(T.getTypePtr()); 1073c40085b373d8e6e4523812e06f73a0cb9d5142cDevang Patel // If type is found in map and this is not a definition for a opaque 108fae6e2994a51d8ec1e61b6eb68765247c83b1ccfChris Lattner // place holder type then use it. Otherwise, convert type T. 1094581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner if (I != TypeCache.end()) 11047c87b4b160d45285b24b1b7f4e3cbaaed3dc464Devang Patel return I->second.get(); 11130ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel 11230ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel const llvm::Type *ResultType = ConvertNewType(T); 1139619662a1d42e2008b865d3459c0677e149dad1bChris Lattner TypeCache.insert(std::make_pair(T.getTypePtr(), 1144581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner llvm::PATypeHolder(ResultType))); 11530ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel return ResultType; 11630ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel} 11730ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patel 11857a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedmanconst llvm::Type *CodeGenTypes::ConvertTypeForMemRecursive(QualType T) { 11957a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman const llvm::Type *ResultType = ConvertTypeRecursive(T); 12057a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman if (ResultType == llvm::Type::Int1Ty) 12157a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman return llvm::IntegerType::get((unsigned)Context.getTypeSize(T)); 12257a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman return ResultType; 12357a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman} 12457a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman 1254581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner/// ConvertTypeForMem - Convert type T into a llvm::Type. This differs from 1264581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner/// ConvertType in that it is used to convert to the memory representation for 1274581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner/// a type. For example, the scalar representation for _Bool is i1, but the 1284581fff8af09a156a9dcc4de62587385c5da9574Chris Lattner/// memory representation is usually i8 or i32, depending on the target. 12919009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattnerconst llvm::Type *CodeGenTypes::ConvertTypeForMem(QualType T) { 13019009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner const llvm::Type *R = ConvertType(T); 13119009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner 13219009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner // If this is a non-bool type, don't map it. 13319009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner if (R != llvm::Type::Int1Ty) 13419009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner return R; 13519009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner 13619009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner // Otherwise, return an integer of the target-specified size. 13798be4943e8dc4f3905629a7102668960873cf863Chris Lattner return llvm::IntegerType::get((unsigned)Context.getTypeSize(T)); 13819009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner 13919009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner} 14019009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner 141b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman// Code to verify a given function type is complete, i.e. the return type 142b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman// and all of the argument types are complete. 143b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedmanstatic const TagType *VerifyFuncTypeComplete(const Type* T) { 144b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman const FunctionType *FT = cast<FunctionType>(T); 145b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (const TagType* TT = FT->getResultType()->getAsTagType()) 146b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (!TT->getDecl()->isDefinition()) 147b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman return TT; 148b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (const FunctionProtoType *FPT = dyn_cast<FunctionProtoType>(T)) 149b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman for (unsigned i = 0; i < FPT->getNumArgs(); i++) 150b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (const TagType* TT = FPT->getArgType(i)->getAsTagType()) 151b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (!TT->getDecl()->isDefinition()) 152b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman return TT; 153b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman return 0; 154b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman} 155b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman 156c5b8806cda286cf41866176ef98011fdaa68da01Chris Lattner/// UpdateCompletedType - When we find the full definition for a TagDecl, 157c5b8806cda286cf41866176ef98011fdaa68da01Chris Lattner/// replace the 'opaque' type we previously made for it if applicable. 158c5b8806cda286cf41866176ef98011fdaa68da01Chris Lattnervoid CodeGenTypes::UpdateCompletedType(const TagDecl *TD) { 159efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar const Type *Key = 160efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar Context.getTagDeclType(const_cast<TagDecl*>(TD)).getTypePtr(); 161efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar llvm::DenseMap<const Type*, llvm::PATypeHolder>::iterator TDTI = 162efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar TagDeclTypes.find(Key); 1636ef58e36bbbfa232fe8b50309361e841985abfc6Chris Lattner if (TDTI == TagDeclTypes.end()) return; 1646ef58e36bbbfa232fe8b50309361e841985abfc6Chris Lattner 1656ef58e36bbbfa232fe8b50309361e841985abfc6Chris Lattner // Remember the opaque LLVM type for this tagdecl. 166d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner llvm::PATypeHolder OpaqueHolder = TDTI->second; 167d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner assert(isa<llvm::OpaqueType>(OpaqueHolder.get()) && 1686ef58e36bbbfa232fe8b50309361e841985abfc6Chris Lattner "Updating compilation of an already non-opaque type?"); 169d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner 170d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner // Remove it from TagDeclTypes so that it will be regenerated. 171d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner TagDeclTypes.erase(TDTI); 172d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner 1738fb1dd005f4cb530bca11d622362d39727294420Chris Lattner // Generate the new type. 1748fb1dd005f4cb530bca11d622362d39727294420Chris Lattner const llvm::Type *NT = ConvertTagDeclType(TD); 175d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner 1768fb1dd005f4cb530bca11d622362d39727294420Chris Lattner // Refine the old opaque type to its new definition. 1778fb1dd005f4cb530bca11d622362d39727294420Chris Lattner cast<llvm::OpaqueType>(OpaqueHolder.get())->refineAbstractTypeTo(NT); 178b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman 179b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // Since we just completed a tag type, check to see if any function types 180b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // were completed along with the tag type. 181b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // FIXME: This is very inefficient; if we track which function types depend 182b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // on which tag types, though, it should be reasonably efficient. 183b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman llvm::DenseMap<const Type*, llvm::PATypeHolder>::iterator i; 184b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman for (i = FunctionTypes.begin(); i != FunctionTypes.end(); ++i) { 185b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (const TagType* TT = VerifyFuncTypeComplete(i->first)) { 186b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // This function type still depends on an incomplete tag type; make sure 187b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // that tag type has an associated opaque type. 188b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman ConvertTagDeclType(TT->getDecl()); 189b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman } else { 190b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // This function no longer depends on an incomplete tag type; create the 191b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // function type, and refine the opaque type to the new function type. 192b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman llvm::PATypeHolder OpaqueHolder = i->second; 193b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman const llvm::Type *NFT = ConvertNewType(QualType(i->first, 0)); 194b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman cast<llvm::OpaqueType>(OpaqueHolder.get())->refineAbstractTypeTo(NFT); 195b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman FunctionTypes.erase(i); 196b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman } 197b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman } 198d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner} 199d86e6bc7ab4388a578daf46e7c76be9122a25072Chris Lattner 200b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattnerstatic const llvm::Type* getTypeForFormat(const llvm::fltSemantics &format) { 201b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner if (&format == &llvm::APFloat::IEEEsingle) 202f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return llvm::Type::FloatTy; 203b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner if (&format == &llvm::APFloat::IEEEdouble) 204f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return llvm::Type::DoubleTy; 205b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner if (&format == &llvm::APFloat::IEEEquad) 206f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return llvm::Type::FP128Ty; 207b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner if (&format == &llvm::APFloat::PPCDoubleDouble) 208f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return llvm::Type::PPC_FP128Ty; 209b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner if (&format == &llvm::APFloat::x87DoubleExtended) 210f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return llvm::Type::X86_FP80Ty; 211b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner assert(0 && "Unknown float format!"); 212f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman return 0; 213f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman} 214f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman 21530ec9972be5a5af1f7a2277360dfa3aa1540b4faDevang Patelconst llvm::Type *CodeGenTypes::ConvertNewType(QualType T) { 2169619662a1d42e2008b865d3459c0677e149dad1bChris Lattner const clang::Type &Ty = *Context.getCanonicalType(T); 2175f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 2185f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer switch (Ty.getTypeClass()) { 21972564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor#define TYPE(Class, Base) 22072564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor#define ABSTRACT_TYPE(Class, Base) 22172564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor#define NON_CANONICAL_TYPE(Class, Base) case Type::Class: 22272564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor#define DEPENDENT_TYPE(Class, Base) case Type::Class: 22372564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor#include "clang/AST/TypeNodes.def" 22472564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor assert(false && "Non-canonical or dependent types aren't possible."); 22572564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor break; 22672564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor 2275f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case Type::Builtin: { 2285f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer switch (cast<BuiltinType>(Ty).getKind()) { 229afef76e43a30380b3c612a674738f2f574c8f166Argyrios Kyrtzidis default: assert(0 && "Unknown builtin type!"); 2305f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::Void: 2315f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer // LLVM void type can only be used as the result of a function call. Just 2325f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer // map to the same as char. 233d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner return llvm::IntegerType::get(8); 2345f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 2355f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::Bool: 23619009e6fe7e0f51d2e49f4c94928a048c11c5281Chris Lattner // Note that we always return bool as i1 for use as a scalar type. 2375f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer return llvm::Type::Int1Ty; 2385f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 239d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner case BuiltinType::Char_S: 240d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner case BuiltinType::Char_U: 241d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner case BuiltinType::SChar: 242d2d2a11a91d7ddf468bfb70f66362d24806ed601Chris Lattner case BuiltinType::UChar: 2435f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::Short: 2445f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::UShort: 2455f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::Int: 2465f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::UInt: 2475f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::Long: 2485f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::ULong: 2495f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::LongLong: 2505f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::ULongLong: 251afef76e43a30380b3c612a674738f2f574c8f166Argyrios Kyrtzidis case BuiltinType::WChar: 25247f7dbf7c0b25505ad093a317983a9b39efe0610Chris Lattner return llvm::IntegerType::get( 25398be4943e8dc4f3905629a7102668960873cf863Chris Lattner static_cast<unsigned>(Context.getTypeSize(T))); 2545f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 255f6a943e047f541619a2202f9e43b20b3d7c0a96dEli Friedman case BuiltinType::Float: 256c8b1227fa8c17d9881815e40c04e19334be536f8Nate Begeman case BuiltinType::Double: 2575f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case BuiltinType::LongDouble: 258b7cfe88e88cb4f46308de89cf3f0c81bfe624128Chris Lattner return getTypeForFormat(Context.getFloatTypeSemantics(T)); 2595f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 2605f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer break; 2615f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 262f98aba35e6c3da5aae61843fc01334939e4e12ecEli Friedman case Type::FixedWidthInt: 263f98aba35e6c3da5aae61843fc01334939e4e12ecEli Friedman return llvm::IntegerType::get(cast<FixedWidthIntType>(T)->getWidth()); 2645f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case Type::Complex: { 265572cf09ae8a78af1c56d40b016ec4cf1837163acChris Lattner const llvm::Type *EltTy = 266fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner ConvertTypeRecursive(cast<ComplexType>(Ty).getElementType()); 267572cf09ae8a78af1c56d40b016ec4cf1837163acChris Lattner return llvm::StructType::get(EltTy, EltTy, NULL); 2685f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 2697c80bd64032e610c0dbd74fc0ef6ea334447f2fdSebastian Redl case Type::LValueReference: 2707c80bd64032e610c0dbd74fc0ef6ea334447f2fdSebastian Redl case Type::RValueReference: { 2716aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar const ReferenceType &RTy = cast<ReferenceType>(Ty); 2726aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar QualType ETy = RTy.getPointeeType(); 2736aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar llvm::OpaqueType *PointeeType = llvm::OpaqueType::get(); 2746aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar PointersToResolve.push_back(std::make_pair(ETy, PointeeType)); 2756aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar return llvm::PointerType::get(PointeeType, ETy.getAddressSpace()); 2766aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar } 2775f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case Type::Pointer: { 2786aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar const PointerType &PTy = cast<PointerType>(Ty); 279fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner QualType ETy = PTy.getPointeeType(); 280fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner llvm::OpaqueType *PointeeType = llvm::OpaqueType::get(); 2816aeae7fa9cfaacba3a4077d62c01c2531d88a63eDaniel Dunbar PointersToResolve.push_back(std::make_pair(ETy, PointeeType)); 282fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner return llvm::PointerType::get(PointeeType, ETy.getAddressSpace()); 2835f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 2845f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 285fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff case Type::VariableArray: { 286fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff const VariableArrayType &A = cast<VariableArrayType>(Ty); 287c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman assert(A.getIndexTypeQualifier() == 0 && 2885f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer "FIXME: We only handle trivial array types so far!"); 289c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman // VLAs resolve to the innermost element type; this matches 290c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman // the return of alloca, and there isn't any obviously better choice. 29157a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman return ConvertTypeForMemRecursive(A.getElementType()); 292c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman } 293c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman case Type::IncompleteArray: { 294c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman const IncompleteArrayType &A = cast<IncompleteArrayType>(Ty); 295c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman assert(A.getIndexTypeQualifier() == 0 && 296c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman "FIXME: We only handle trivial array types so far!"); 297c5773c4b8ce1ed6ed5c7112c9020c954a47dce96Eli Friedman // int X[] -> [0 x int] 29857a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman return llvm::ArrayType::get(ConvertTypeForMemRecursive(A.getElementType()), 0); 2995f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 300fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff case Type::ConstantArray: { 301fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff const ConstantArrayType &A = cast<ConstantArrayType>(Ty); 30257a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman const llvm::Type *EltTy = ConvertTypeForMemRecursive(A.getElementType()); 303fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff return llvm::ArrayType::get(EltTy, A.getSize().getZExtValue()); 304fb22d96692c5240fb8d611290dbf7eeed3759c73Steve Naroff } 305213541a68a3e137d11d2cefb612c6cdb410d7e8eNate Begeman case Type::ExtVector: 3065f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case Type::Vector: { 3075f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer const VectorType &VT = cast<VectorType>(Ty); 308fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner return llvm::VectorType::get(ConvertTypeRecursive(VT.getElementType()), 3095f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer VT.getNumElements()); 3105f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 3115f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer case Type::FunctionNoProto: 312bb36d331f439f49859efcfb4435c61762fbba6f9Daniel Dunbar case Type::FunctionProto: { 313b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // First, check whether we can build the full function type. 314b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman if (const TagType* TT = VerifyFuncTypeComplete(&Ty)) { 315b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // This function's type depends on an incomplete tag type; make sure 316b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // we have an opaque type corresponding to the tag type. 317b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman ConvertTagDeclType(TT->getDecl()); 318b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // Create an opaque type for this function type, save it, and return it. 319b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman llvm::Type *ResultType = llvm::OpaqueType::get(); 320b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman FunctionTypes.insert(std::make_pair(&Ty, ResultType)); 321b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman return ResultType; 322b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman } 323b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // The function type can be built; call the appropriate routines to 324b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman // build it. 3259a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner if (const FunctionProtoType *FPT = dyn_cast<FunctionProtoType>(&Ty)) 326b3b6b9b27ab8bdb2a435a5a92ce62e74e3399377Eli Friedman return GetFunctionType(getFunctionInfo(FPT), FPT->isVariadic()); 3279a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner 3289a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner const FunctionNoProtoType *FNPT = cast<FunctionNoProtoType>(&Ty); 3299a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner return GetFunctionType(getFunctionInfo(FNPT), true); 330bb36d331f439f49859efcfb4435c61762fbba6f9Daniel Dunbar } 331ebb97e98c03f8d7034bd3748a10e35f39a95c289Christopher Lamb 332f11284ac87daa613bc7b30db9f54bd716d123222Fariborz Jahanian case Type::ExtQual: 333fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner return 334f11284ac87daa613bc7b30db9f54bd716d123222Fariborz Jahanian ConvertTypeRecursive(QualType(cast<ExtQualType>(Ty).getBaseType(), 0)); 335b1776cb8d35dfa80bfd8606e58b8ade30dcd2438Chris Lattner 336636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner case Type::ObjCQualifiedInterface: { 337636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner // Lower foo<P1,P2> just like foo. 338636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner ObjCInterfaceDecl *ID = cast<ObjCQualifiedInterfaceType>(Ty).getDecl(); 339636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner return ConvertTypeRecursive(Context.getObjCInterfaceType(ID)); 340636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner } 341636efb6ee4382e6fc16724014e9cf70dbeb37c31Chris Lattner 342391d77a26382dddf25da73e29fc1fa5aaaea4c6fChris Lattner case Type::ObjCInterface: { 3439a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner ObjCInterfaceDecl *ID = cast<ObjCInterfaceType>(Ty).getDecl(); 3449a1a9c41cf7e2735f059bb0c1d85f3207f637b22Chris Lattner return ConvertTagDeclType(Context.addRecordToClass(ID)); 345391d77a26382dddf25da73e29fc1fa5aaaea4c6fChris Lattner } 346e37882ad335896dedf345102bb425383e6221c37Fariborz Jahanian 347a526c5c67e5a0473c340903ee542ce570119665fTed Kremenek case Type::ObjCQualifiedId: 348f7f52e7bf5a4dc36d45b98531e0b21e343fc19deSteve Naroff case Type::ObjCQualifiedClass: 34998c5ead87d720d8b68b6f236c3c3579a388fc882Daniel Dunbar // Protocols don't influence the LLVM type. 35098c5ead87d720d8b68b6f236c3c3579a388fc882Daniel Dunbar return ConvertTypeRecursive(Context.getObjCIdType()); 351c569249ca0ab755ac79d8cbbfcb2bcae19743624Fariborz Jahanian 35272564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor case Type::Record: 35372564e73277e29f6db3305d1f27ba408abb7ed88Douglas Gregor case Type::Enum: { 354de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner const TagDecl *TD = cast<TagType>(Ty).getDecl(); 3558fb1dd005f4cb530bca11d622362d39727294420Chris Lattner const llvm::Type *Res = ConvertTagDeclType(TD); 356de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner 357de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner std::string TypeName(TD->getKindName()); 358de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner TypeName += '.'; 359de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner 360de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner // Name the codegen type after the typedef name 361de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner // if there is no tag type name available 362de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner if (TD->getIdentifier()) 363d9d22dd9c94618490dbffb0e2caf222530ca39d3Chris Lattner TypeName += TD->getNameAsString(); 364de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner else if (const TypedefType *TdT = dyn_cast<TypedefType>(T)) 365d9d22dd9c94618490dbffb0e2caf222530ca39d3Chris Lattner TypeName += TdT->getDecl()->getNameAsString(); 366de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner else 367de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner TypeName += "anon"; 368de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner 369de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner TheModule.addTypeName(TypeName, Res); 370de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner return Res; 371de0efb3b6eac36bdeae0e60f753a974cc4118a31Chris Lattner } 3729048891ff983d0681c116c6e8f1073aa31bdd6e8Daniel Dunbar 3739048891ff983d0681c116c6e8f1073aa31bdd6e8Daniel Dunbar case Type::BlockPointer: { 3744e174f1b1e95faacc21da2eac70f7853807f3ea3Daniel Dunbar const QualType FTy = cast<BlockPointerType>(Ty).getPointeeType(); 375209bb438042ef7652b2b046e43d4ffb5a00d9725Fariborz Jahanian llvm::OpaqueType *PointeeType = llvm::OpaqueType::get(); 376209bb438042ef7652b2b046e43d4ffb5a00d9725Fariborz Jahanian PointersToResolve.push_back(std::make_pair(FTy, PointeeType)); 377209bb438042ef7652b2b046e43d4ffb5a00d9725Fariborz Jahanian return llvm::PointerType::get(PointeeType, FTy.getAddressSpace()); 3789048891ff983d0681c116c6e8f1073aa31bdd6e8Daniel Dunbar } 379424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl 380424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl case Type::MemberPointer: 381424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl // FIXME: Implement C++ pointer-to-member. The GCC representation is 382424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl // documented here: 383424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl // http://gcc.gnu.org/onlinedocs/gccint/Type-Layout.html#Type-Layout 384424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl assert(0 && "FIXME: We can't handle member pointers yet."); 385424c51d3d4bea87291919b75e73ca59386702ad5Sebastian Redl return llvm::OpaqueType::get(); 3867532dc66648cfe7432c9fe66dec5225f0ab301c6Douglas Gregor 3877532dc66648cfe7432c9fe66dec5225f0ab301c6Douglas Gregor case Type::TemplateSpecialization: 3887532dc66648cfe7432c9fe66dec5225f0ab301c6Douglas Gregor assert(false && "Dependent types can't get here"); 3895f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer } 3905f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 3915f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer // FIXME: implement. 3925f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer return llvm::OpaqueType::get(); 3935f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer} 3945f016e2cb5d11daeb237544de1c5d59f20fe1a6eReid Spencer 395fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner/// ConvertTagDeclType - Lay out a tagged decl type like struct or union or 396fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner/// enum. 3978fb1dd005f4cb530bca11d622362d39727294420Chris Lattnerconst llvm::Type *CodeGenTypes::ConvertTagDeclType(const TagDecl *TD) { 398efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar // TagDecl's are not necessarily unique, instead use the (clang) 399efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar // type connected to the decl. 400efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar const Type *Key = 401efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar Context.getTagDeclType(const_cast<TagDecl*>(TD)).getTypePtr(); 402efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar llvm::DenseMap<const Type*, llvm::PATypeHolder>::iterator TDTI = 403efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar TagDeclTypes.find(Key); 404fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 4055de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // If we've already compiled this tag type, use the previous definition. 4065de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner if (TDTI != TagDeclTypes.end()) 407fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner return TDTI->second; 408fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 4095de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // If this is still a forward definition, just define an opaque type to use 4105de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // for this tagged decl. 411fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner if (!TD->isDefinition()) { 4125de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner llvm::Type *ResultType = llvm::OpaqueType::get(); 413efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar TagDeclTypes.insert(std::make_pair(Key, ResultType)); 4145de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner return ResultType; 4155de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner } 4165de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4175de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // Okay, this is a definition of a type. Compile the implementation now. 4185de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 41939ba4aeca296b1c9f04bde7d9d3cbbf129f1abd3Argyrios Kyrtzidis if (TD->isEnum()) { 420fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner // Don't bother storing enums in TagDeclTypes. 421fce71b8ea53b6eb9c1630da24659289bc848f837Chris Lattner return ConvertTypeRecursive(cast<EnumDecl>(TD)->getIntegerType()); 4225de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner } 4235de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4245de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // This decl could well be recursive. In this case, insert an opaque 4255de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // definition of this type, which the recursive uses will get. We will then 4265de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // refine this opaque version later. 4275de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4285de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // Create new OpaqueType now for later use in case this is a recursive 4295de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // type. This will later be refined to the actual type. 4305de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner llvm::PATypeHolder ResultHolder = llvm::OpaqueType::get(); 431efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar TagDeclTypes.insert(std::make_pair(Key, ResultHolder)); 4325de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4335de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner const llvm::Type *ResultType; 4345de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner const RecordDecl *RD = cast<const RecordDecl>(TD); 43539ba4aeca296b1c9f04bde7d9d3cbbf129f1abd3Argyrios Kyrtzidis if (TD->isStruct() || TD->isClass()) { 436fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner // Layout fields. 437cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman RecordOrganizer RO(*this, *RD); 438fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 43998be4943e8dc4f3905629a7102668960873cf863Chris Lattner RO.layoutStructFields(Context.getASTRecordLayout(RD)); 440fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 4415de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // Get llvm::StructType. 442efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar const Type *Key = 443efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar Context.getTagDeclType(const_cast<TagDecl*>(TD)).getTypePtr(); 444efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar CGRecordLayouts[Key] = new CGRecordLayout(RO.getLLVMType(), 445efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar RO.getPaddingFields()); 4465de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner ResultType = RO.getLLVMType(); 447fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 44839ba4aeca296b1c9f04bde7d9d3cbbf129f1abd3Argyrios Kyrtzidis } else if (TD->isUnion()) { 449fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner // Just use the largest element of the union, breaking ties with the 450fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner // highest aligned member. 451e267ff35b2f4e9d2b0d8bf24109d41cc7398b61bDouglas Gregor if (!RD->field_empty()) { 452cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman RecordOrganizer RO(*this, *RD); 4535de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 454cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman RO.layoutUnionFields(Context.getASTRecordLayout(RD)); 4555de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4565de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // Get llvm::StructType. 457efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar const Type *Key = 458efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar Context.getTagDeclType(const_cast<TagDecl*>(TD)).getTypePtr(); 459efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar CGRecordLayouts[Key] = new CGRecordLayout(RO.getLLVMType(), 460efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar RO.getPaddingFields()); 4615de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner ResultType = RO.getLLVMType(); 462fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner } else { 4635de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner ResultType = llvm::StructType::get(std::vector<const llvm::Type*>()); 464fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner } 465fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner } else { 466fae6e2994a51d8ec1e61b6eb68765247c83b1ccfChris Lattner assert(0 && "FIXME: Unknown tag decl kind!"); 4673304e55f613ce34d9a14c3aaf06f5949408b3092Chris Lattner abort(); 468fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner } 469fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 4705de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // Refine our Opaque type to ResultType. This can invalidate ResultType, so 4715de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner // make sure to read the result out of the holder. 4725de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner cast<llvm::OpaqueType>(ResultHolder.get()) 4735de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner ->refineAbstractTypeTo(ResultType); 4745de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner 4755de00fcf7c923a14bb79bdbaabb2faeb5633d85aChris Lattner return ResultHolder.get(); 476fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner} 477fc3b8e9c1381d5e6ec361591d649c56a870ff971Chris Lattner 478b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel/// getLLVMFieldNo - Return llvm::StructType element number 479b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel/// that corresponds to the field FD. 480b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patelunsigned CodeGenTypes::getLLVMFieldNo(const FieldDecl *FD) { 481ce5605ecf76d8cde6372138f830bb144d174ced9Chris Lattner llvm::DenseMap<const FieldDecl*, unsigned>::iterator I = FieldInfo.find(FD); 48221fdf416723e8c475812a0324a1f9fafc949c25fHartmut Kaiser assert (I != FieldInfo.end() && "Unable to find field info"); 483391d77a26382dddf25da73e29fc1fa5aaaea4c6fChris Lattner return I->second; 484391d77a26382dddf25da73e29fc1fa5aaaea4c6fChris Lattner} 485391d77a26382dddf25da73e29fc1fa5aaaea4c6fChris Lattner 486c4c429a1a5947ba9be64d3070741d98362872265Devang Patel/// addFieldInfo - Assign field number to field FD. 4872c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venanciovoid CodeGenTypes::addFieldInfo(const FieldDecl *FD, unsigned No) { 4882c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio FieldInfo[FD] = No; 4892c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio} 4902c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio 4912c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio/// getBitFieldInfo - Return the BitFieldInfo that corresponds to the field FD. 4922c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos VenancioCodeGenTypes::BitFieldInfo CodeGenTypes::getBitFieldInfo(const FieldDecl *FD) { 4932c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio llvm::DenseMap<const FieldDecl *, BitFieldInfo>::iterator 4942c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio I = BitFields.find(FD); 4952c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio assert (I != BitFields.end() && "Unable to find bitfield info"); 4962c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio return I->second; 4972c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio} 4982c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio 4992c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio/// addBitFieldInfo - Assign a start bit and a size to field FD. 5002c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venanciovoid CodeGenTypes::addBitFieldInfo(const FieldDecl *FD, unsigned Begin, 5011abc7f654df795549d4f6f3a018ddb3a8fff013aNate Begeman unsigned Size) { 5022c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio BitFields.insert(std::make_pair(FD, BitFieldInfo(Begin, Size))); 503b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel} 504b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel 50588a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel/// getCGRecordLayout - Return record layout info for the given llvm::Type. 50688a981b47c7face1b1fdaa9074256245107b9ca9Devang Patelconst CGRecordLayout * 507af31913e48c96fddb45a0fd33f25617546502cbbChris LattnerCodeGenTypes::getCGRecordLayout(const TagDecl *TD) const { 508efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar const Type *Key = 509efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar Context.getTagDeclType(const_cast<TagDecl*>(TD)).getTypePtr(); 510efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar llvm::DenseMap<const Type*, CGRecordLayout *>::iterator I 511efb6d0dc3eafbcf4f8cd053138bd1abed1dda8d4Daniel Dunbar = CGRecordLayouts.find(Key); 51288a981b47c7face1b1fdaa9074256245107b9ca9Devang Patel assert (I != CGRecordLayouts.end() 513b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel && "Unable to find record layout information for type"); 514b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel return I->second; 515b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel} 516b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel 51786522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel/// layoutStructFields - Do the actual work and lay out all fields. Create 518cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman/// corresponding llvm struct type. 519cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman/// Note that this doesn't actually try to do struct layout; it depends on 520cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman/// the layout built by the AST. (We have to do struct layout to do Sema, 521cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman/// and there's no point to duplicating the work.) 52288a981b47c7face1b1fdaa9074256245107b9ca9Devang Patelvoid RecordOrganizer::layoutStructFields(const ASTRecordLayout &RL) { 523e36a3c8b5c7db4916342e4381caa2fdc93eb5745Eli Friedman // FIXME: This code currently always generates packed structures. 524e36a3c8b5c7db4916342e4381caa2fdc93eb5745Eli Friedman // Unpacked structures are more readable, and sometimes more efficient! 525e36a3c8b5c7db4916342e4381caa2fdc93eb5745Eli Friedman // (But note that any changes here are likely to impact CGExprConstant, 526e36a3c8b5c7db4916342e4381caa2fdc93eb5745Eli Friedman // which makes some messy assumptions.) 527cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman uint64_t llvmSize = 0; 528e36a3c8b5c7db4916342e4381caa2fdc93eb5745Eli Friedman // FIXME: Make this a SmallVector 529cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman std::vector<const llvm::Type*> LLVMFields; 530cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman 53144b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor unsigned curField = 0; 532f8d49f64ef6ab7e632717a31631fc289aab69428Douglas Gregor for (RecordDecl::field_iterator Field = RD.field_begin(), 533f8d49f64ef6ab7e632717a31631fc289aab69428Douglas Gregor FieldEnd = RD.field_end(); 53444b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor Field != FieldEnd; ++Field) { 535cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman uint64_t offset = RL.getFieldOffset(curField); 53657a84fb51de4f3de50debcf12dd194af8c6aaa58Eli Friedman const llvm::Type *Ty = CGT.ConvertTypeForMemRecursive(Field->getType()); 537491c7b77cd8ec8570f646d43b937a5aec688bcbfDaniel Dunbar uint64_t size = CGT.getTargetData().getTypePaddedSizeInBits(Ty); 538cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman 53944b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor if (Field->isBitField()) { 54044b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor Expr *BitWidth = Field->getBitWidth(); 541cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman llvm::APSInt FieldSize(32); 542cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman bool isBitField = 543cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman BitWidth->isIntegerConstantExpr(FieldSize, CGT.getContext()); 5443304e55f613ce34d9a14c3aaf06f5949408b3092Chris Lattner assert(isBitField && "Invalid BitField size expression"); 5453304e55f613ce34d9a14c3aaf06f5949408b3092Chris Lattner isBitField=isBitField; // silence warning. 5463304e55f613ce34d9a14c3aaf06f5949408b3092Chris Lattner uint64_t BitFieldSize = FieldSize.getZExtValue(); 547cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman 548cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // Bitfield field info is different from other field info; 549cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // it actually ignores the underlying LLVM struct because 550cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // there isn't any convenient mapping. 55144b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addFieldInfo(*Field, offset / size); 55244b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addBitFieldInfo(*Field, offset % size, BitFieldSize); 553cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman } else { 554cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // Put the element into the struct. This would be simpler 555cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // if we didn't bother, but it seems a bit too strange to 556cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // allocate all structs as i8 arrays. 557cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman while (llvmSize < offset) { 558cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman LLVMFields.push_back(llvm::Type::Int8Ty); 559cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman llvmSize += 8; 560d8ecd3c8f7716124e1efb278a46b6747c697668dDevang Patel } 5616e8df736939325bc2355eeb1e138ecf8b2605616Devang Patel 562cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman llvmSize += size; 56344b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addFieldInfo(*Field, LLVMFields.size()); 564cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman LLVMFields.push_back(Ty); 565cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman } 56644b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor ++curField; 567cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman } 568f9fef925644a6c40b344a43ab9ebdb08a707de53Devang Patel 569cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman while (llvmSize < RL.getSize()) { 570cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman LLVMFields.push_back(llvm::Type::Int8Ty); 571cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman llvmSize += 8; 5722c46ce8de96787aa8e040690a80896f1148c29b0Lauro Ramos Venancio } 573159e3300f938ae05c0bf249508714e621cc89de5Devang Patel 5740408f6805c164f317937e97d7bc222781164bfebEli Friedman STy = llvm::StructType::get(LLVMFields, true); 575491c7b77cd8ec8570f646d43b937a5aec688bcbfDaniel Dunbar assert(CGT.getTargetData().getTypePaddedSizeInBits(STy) == RL.getSize()); 576b84a06e68ffd71da22e3c75b6e4bbdba37816413Devang Patel} 577c4c429a1a5947ba9be64d3070741d98362872265Devang Patel 57886522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel/// layoutUnionFields - Do the actual work and lay out all fields. Create 57986522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel/// corresponding llvm struct type. This should be invoked only after 58086522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel/// all fields are added. 581cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedmanvoid RecordOrganizer::layoutUnionFields(const ASTRecordLayout &RL) { 58244b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor unsigned curField = 0; 583f8d49f64ef6ab7e632717a31631fc289aab69428Douglas Gregor for (RecordDecl::field_iterator Field = RD.field_begin(), 584f8d49f64ef6ab7e632717a31631fc289aab69428Douglas Gregor FieldEnd = RD.field_end(); 58544b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor Field != FieldEnd; ++Field) { 586cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // The offset should usually be zero, but bitfields could be strange 587cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman uint64_t offset = RL.getFieldOffset(curField); 58834e7946831a63f96d3ba3478c74ca8e25ee52d7eDouglas Gregor CGT.ConvertTypeRecursive(Field->getType()); 589cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman 59044b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor if (Field->isBitField()) { 59144b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor Expr *BitWidth = Field->getBitWidth(); 59232442bbc98bafa512fa42d46fedf60ed7d79f574Daniel Dunbar uint64_t BitFieldSize = 59332442bbc98bafa512fa42d46fedf60ed7d79f574Daniel Dunbar BitWidth->getIntegerConstantExprValue(CGT.getContext()).getZExtValue(); 59486522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel 59544b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addFieldInfo(*Field, 0); 59644b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addBitFieldInfo(*Field, offset, BitFieldSize); 597cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman } else { 59844b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor CGT.addFieldInfo(*Field, 0); 599cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman } 60044b4321feab46299d3f5cfd404680884752a0fcfDouglas Gregor ++curField; 60186522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel } 60286522b9e84d0c39f09b54e888538ad64e89788c4Devang Patel 603cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // This looks stupid, but it is correct in the sense that 604cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // it works no matter how complicated the sizes and alignments 605cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // of the union elements are. The natural alignment 606cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // of the result doesn't matter because anyone allocating 607cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // structures should be aligning them appropriately anyway. 608cbadaf6ced6d664015ee409f62ab1bc20ae0bf73Eli Friedman // FIXME: We can be a bit more intuitive in a lot of cases. 609fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman // FIXME: Make this a struct type to work around PR2399; the 610fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman // C backend doesn't like structs using array types. 611fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman std::vector<const llvm::Type*> LLVMFields; 612fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman LLVMFields.push_back(llvm::ArrayType::get(llvm::Type::Int8Ty, 613fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman RL.getSize() / 8)); 614fd6f08525f9292255249b2434af4c6b2bc02ee93Eli Friedman STy = llvm::StructType::get(LLVMFields, true); 615491c7b77cd8ec8570f646d43b937a5aec688bcbfDaniel Dunbar assert(CGT.getTargetData().getTypePaddedSizeInBits(STy) == RL.getSize()); 616382c64365247fa01e2711da27ef4bef0653afca4Devang Patel} 617