Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1 | //===-- Type.cpp - Implement the Type class -------------------------------===// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 2007-12-29 20:36:04 +0000 | [diff] [blame^] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
| 10 | // This file implements the Type class for the VMCore library. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "llvm/DerivedTypes.h" |
Chris Lattner | 31bcdb8 | 2002-04-28 19:55:58 +0000 | [diff] [blame] | 15 | #include "llvm/Constants.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 16 | #include "llvm/ADT/DepthFirstIterator.h" |
| 17 | #include "llvm/ADT/StringExtras.h" |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 18 | #include "llvm/ADT/SCCIterator.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 19 | #include "llvm/ADT/STLExtras.h" |
Chris Lattner | d115ef8 | 2005-11-10 01:40:59 +0000 | [diff] [blame] | 20 | #include "llvm/Support/MathExtras.h" |
Chris Lattner | a4f0b3a | 2006-08-27 12:54:02 +0000 | [diff] [blame] | 21 | #include "llvm/Support/Compiler.h" |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 22 | #include "llvm/Support/ManagedStatic.h" |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 23 | #include "llvm/Support/Debug.h" |
Chris Lattner | 417081c | 2002-04-07 06:14:56 +0000 | [diff] [blame] | 24 | #include <algorithm> |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 25 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 26 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 27 | // DEBUG_MERGE_TYPES - Enable this #define to see how and when derived types are |
| 28 | // created and later destroyed, all in an effort to make sure that there is only |
Chris Lattner | 065a616 | 2003-09-10 05:29:43 +0000 | [diff] [blame] | 29 | // a single canonical version of a type. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 30 | // |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 31 | // #define DEBUG_MERGE_TYPES 1 |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 32 | |
Chris Lattner | 1cd4c72 | 2004-02-26 07:24:18 +0000 | [diff] [blame] | 33 | AbstractTypeUser::~AbstractTypeUser() {} |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 34 | |
Jim Laskey | a25dfd2 | 2006-07-25 23:22:00 +0000 | [diff] [blame] | 35 | |
| 36 | //===----------------------------------------------------------------------===// |
| 37 | // Type PATypeHolder Implementation |
| 38 | //===----------------------------------------------------------------------===// |
| 39 | |
Jim Laskey | a25dfd2 | 2006-07-25 23:22:00 +0000 | [diff] [blame] | 40 | /// get - This implements the forwarding part of the union-find algorithm for |
| 41 | /// abstract types. Before every access to the Type*, we check to see if the |
| 42 | /// type we are pointing to is forwarding to a new type. If so, we drop our |
| 43 | /// reference to the type. |
| 44 | /// |
| 45 | Type* PATypeHolder::get() const { |
| 46 | const Type *NewTy = Ty->getForwardedType(); |
| 47 | if (!NewTy) return const_cast<Type*>(Ty); |
| 48 | return *const_cast<PATypeHolder*>(this) = NewTy; |
| 49 | } |
| 50 | |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 51 | //===----------------------------------------------------------------------===// |
| 52 | // Type Class Implementation |
| 53 | //===----------------------------------------------------------------------===// |
| 54 | |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 55 | // Concrete/Abstract TypeDescriptions - We lazily calculate type descriptions |
| 56 | // for types as they are needed. Because resolution of types must invalidate |
| 57 | // all of the abstract type descriptions, we keep them in a seperate map to make |
| 58 | // this easy. |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 59 | static ManagedStatic<std::map<const Type*, |
| 60 | std::string> > ConcreteTypeDescriptions; |
| 61 | static ManagedStatic<std::map<const Type*, |
| 62 | std::string> > AbstractTypeDescriptions; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 63 | |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 64 | /// Because of the way Type subclasses are allocated, this function is necessary |
| 65 | /// to use the correct kind of "delete" operator to deallocate the Type object. |
| 66 | /// Some type objects (FunctionTy, StructTy) allocate additional space after |
| 67 | /// the space for their derived type to hold the contained types array of |
| 68 | /// PATypeHandles. Using this allocation scheme means all the PATypeHandles are |
| 69 | /// allocated with the type object, decreasing allocations and eliminating the |
| 70 | /// need for a std::vector to be used in the Type class itself. |
| 71 | /// @brief Type destruction function |
| 72 | void Type::destroy() const { |
| 73 | |
| 74 | // Structures and Functions allocate their contained types past the end of |
| 75 | // the type object itself. These need to be destroyed differently than the |
| 76 | // other types. |
| 77 | if (isa<FunctionType>(this) || isa<StructType>(this)) { |
| 78 | // First, make sure we destruct any PATypeHandles allocated by these |
| 79 | // subclasses. They must be manually destructed. |
| 80 | for (unsigned i = 0; i < NumContainedTys; ++i) |
| 81 | ContainedTys[i].PATypeHandle::~PATypeHandle(); |
| 82 | |
| 83 | // Now call the destructor for the subclass directly because we're going |
| 84 | // to delete this as an array of char. |
| 85 | if (isa<FunctionType>(this)) |
| 86 | ((FunctionType*)this)->FunctionType::~FunctionType(); |
| 87 | else |
| 88 | ((StructType*)this)->StructType::~StructType(); |
| 89 | |
| 90 | // Finally, remove the memory as an array deallocation of the chars it was |
| 91 | // constructed from. |
| 92 | delete [] reinterpret_cast<const char*>(this); |
| 93 | |
| 94 | return; |
| 95 | } |
| 96 | |
| 97 | // For all the other type subclasses, there is either no contained types or |
| 98 | // just one (all Sequentials). For Sequentials, the PATypeHandle is not |
| 99 | // allocated past the type object, its included directly in the SequentialType |
| 100 | // class. This means we can safely just do "normal" delete of this object and |
| 101 | // all the destructors that need to run will be run. |
| 102 | delete this; |
| 103 | } |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 104 | |
Chris Lattner | f70c22b | 2004-06-17 18:19:28 +0000 | [diff] [blame] | 105 | const Type *Type::getPrimitiveType(TypeID IDNumber) { |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 106 | switch (IDNumber) { |
Dale Johannesen | 320fc8a | 2007-08-03 01:03:46 +0000 | [diff] [blame] | 107 | case VoidTyID : return VoidTy; |
| 108 | case FloatTyID : return FloatTy; |
| 109 | case DoubleTyID : return DoubleTy; |
| 110 | case X86_FP80TyID : return X86_FP80Ty; |
| 111 | case FP128TyID : return FP128Ty; |
| 112 | case PPC_FP128TyID : return PPC_FP128Ty; |
| 113 | case LabelTyID : return LabelTy; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 114 | default: |
| 115 | return 0; |
| 116 | } |
| 117 | } |
| 118 | |
Reid Spencer | c103057 | 2007-01-19 21:13:56 +0000 | [diff] [blame] | 119 | const Type *Type::getVAArgsPromotedType() const { |
| 120 | if (ID == IntegerTyID && getSubclassData() < 32) |
| 121 | return Type::Int32Ty; |
| 122 | else if (ID == FloatTyID) |
| 123 | return Type::DoubleTy; |
| 124 | else |
| 125 | return this; |
| 126 | } |
| 127 | |
Dan Gohman | ef1af7d | 2007-08-20 19:25:59 +0000 | [diff] [blame] | 128 | /// isIntOrIntVector - Return true if this is an integer type or a vector of |
| 129 | /// integer types. |
| 130 | /// |
| 131 | bool Type::isIntOrIntVector() const { |
| 132 | if (isInteger()) |
| 133 | return true; |
| 134 | if (ID != Type::VectorTyID) return false; |
| 135 | |
| 136 | return cast<VectorType>(this)->getElementType()->isInteger(); |
| 137 | } |
| 138 | |
Chris Lattner | 2e1c196 | 2006-10-26 18:22:45 +0000 | [diff] [blame] | 139 | /// isFPOrFPVector - Return true if this is a FP type or a vector of FP types. |
| 140 | /// |
| 141 | bool Type::isFPOrFPVector() const { |
Dale Johannesen | 320fc8a | 2007-08-03 01:03:46 +0000 | [diff] [blame] | 142 | if (ID == Type::FloatTyID || ID == Type::DoubleTyID || |
| 143 | ID == Type::FP128TyID || ID == Type::X86_FP80TyID || |
| 144 | ID == Type::PPC_FP128TyID) |
| 145 | return true; |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 146 | if (ID != Type::VectorTyID) return false; |
Chris Lattner | 2e1c196 | 2006-10-26 18:22:45 +0000 | [diff] [blame] | 147 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 148 | return cast<VectorType>(this)->getElementType()->isFloatingPoint(); |
Chris Lattner | 2e1c196 | 2006-10-26 18:22:45 +0000 | [diff] [blame] | 149 | } |
| 150 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 151 | // canLosslesllyBitCastTo - Return true if this type can be converted to |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 152 | // 'Ty' without any reinterpretation of bits. For example, uint to int. |
| 153 | // |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 154 | bool Type::canLosslesslyBitCastTo(const Type *Ty) const { |
| 155 | // Identity cast means no change so return true |
| 156 | if (this == Ty) |
Chris Lattner | a3124a3 | 2006-04-02 05:40:28 +0000 | [diff] [blame] | 157 | return true; |
| 158 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 159 | // They are not convertible unless they are at least first class types |
| 160 | if (!this->isFirstClassType() || !Ty->isFirstClassType()) |
| 161 | return false; |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 162 | |
Reid Spencer | ac9dcb9 | 2007-02-15 03:39:18 +0000 | [diff] [blame] | 163 | // Vector -> Vector conversions are always lossless if the two vector types |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 164 | // have the same size, otherwise not. |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 165 | if (const VectorType *thisPTy = dyn_cast<VectorType>(this)) |
| 166 | if (const VectorType *thatPTy = dyn_cast<VectorType>(Ty)) |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 167 | return thisPTy->getBitWidth() == thatPTy->getBitWidth(); |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 168 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 169 | // At this point we have only various mismatches of the first class types |
| 170 | // remaining and ptr->ptr. Just select the lossless conversions. Everything |
| 171 | // else is not lossless. |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 172 | if (isa<PointerType>(this)) |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 173 | return isa<PointerType>(Ty); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 174 | return false; // Other types have no identity values |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 175 | } |
| 176 | |
Chris Lattner | 4f0247c | 2005-04-23 22:00:09 +0000 | [diff] [blame] | 177 | unsigned Type::getPrimitiveSizeInBits() const { |
| 178 | switch (getTypeID()) { |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 179 | case Type::FloatTyID: return 32; |
Chris Lattner | ea10491 | 2005-04-23 22:01:39 +0000 | [diff] [blame] | 180 | case Type::DoubleTyID: return 64; |
Dale Johannesen | 320fc8a | 2007-08-03 01:03:46 +0000 | [diff] [blame] | 181 | case Type::X86_FP80TyID: return 80; |
| 182 | case Type::FP128TyID: return 128; |
| 183 | case Type::PPC_FP128TyID: return 128; |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 184 | case Type::IntegerTyID: return cast<IntegerType>(this)->getBitWidth(); |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 185 | case Type::VectorTyID: return cast<VectorType>(this)->getBitWidth(); |
Chris Lattner | d44023e | 2002-05-06 16:14:39 +0000 | [diff] [blame] | 186 | default: return 0; |
| 187 | } |
| 188 | } |
| 189 | |
Chris Lattner | c5f143b | 2004-07-02 23:20:17 +0000 | [diff] [blame] | 190 | /// isSizedDerivedType - Derived types like structures and arrays are sized |
| 191 | /// iff all of the members of the type are sized as well. Since asking for |
| 192 | /// their size is relatively uncommon, move this operation out of line. |
| 193 | bool Type::isSizedDerivedType() const { |
Reid Spencer | 43276ee | 2007-01-26 07:51:36 +0000 | [diff] [blame] | 194 | if (isa<IntegerType>(this)) |
| 195 | return true; |
| 196 | |
Chris Lattner | c5f143b | 2004-07-02 23:20:17 +0000 | [diff] [blame] | 197 | if (const ArrayType *ATy = dyn_cast<ArrayType>(this)) |
| 198 | return ATy->getElementType()->isSized(); |
| 199 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 200 | if (const VectorType *PTy = dyn_cast<VectorType>(this)) |
Chris Lattner | f022805 | 2004-12-01 17:12:16 +0000 | [diff] [blame] | 201 | return PTy->getElementType()->isSized(); |
| 202 | |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 203 | if (!isa<StructType>(this)) |
| 204 | return false; |
Chris Lattner | c5f143b | 2004-07-02 23:20:17 +0000 | [diff] [blame] | 205 | |
| 206 | // Okay, our struct is sized if all of the elements are... |
| 207 | for (subtype_iterator I = subtype_begin(), E = subtype_end(); I != E; ++I) |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 208 | if (!(*I)->isSized()) |
| 209 | return false; |
Chris Lattner | c5f143b | 2004-07-02 23:20:17 +0000 | [diff] [blame] | 210 | |
| 211 | return true; |
| 212 | } |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 213 | |
Chris Lattner | 1c5164e | 2003-10-02 23:35:57 +0000 | [diff] [blame] | 214 | /// getForwardedTypeInternal - This method is used to implement the union-find |
| 215 | /// algorithm for when a type is being forwarded to another type. |
| 216 | const Type *Type::getForwardedTypeInternal() const { |
| 217 | assert(ForwardType && "This type is not being forwarded to another type!"); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 218 | |
Chris Lattner | 1c5164e | 2003-10-02 23:35:57 +0000 | [diff] [blame] | 219 | // Check to see if the forwarded type has been forwarded on. If so, collapse |
| 220 | // the forwarding links. |
| 221 | const Type *RealForwardedType = ForwardType->getForwardedType(); |
| 222 | if (!RealForwardedType) |
| 223 | return ForwardType; // No it's not forwarded again |
| 224 | |
| 225 | // Yes, it is forwarded again. First thing, add the reference to the new |
| 226 | // forward type. |
| 227 | if (RealForwardedType->isAbstract()) |
| 228 | cast<DerivedType>(RealForwardedType)->addRef(); |
| 229 | |
| 230 | // Now drop the old reference. This could cause ForwardType to get deleted. |
| 231 | cast<DerivedType>(ForwardType)->dropRef(); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 232 | |
Chris Lattner | 1c5164e | 2003-10-02 23:35:57 +0000 | [diff] [blame] | 233 | // Return the updated type. |
| 234 | ForwardType = RealForwardedType; |
| 235 | return ForwardType; |
| 236 | } |
| 237 | |
Chris Lattner | c35abc2 | 2005-11-13 03:26:33 +0000 | [diff] [blame] | 238 | void Type::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) { |
| 239 | abort(); |
| 240 | } |
| 241 | void Type::typeBecameConcrete(const DerivedType *AbsTy) { |
| 242 | abort(); |
| 243 | } |
| 244 | |
| 245 | |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 246 | // getTypeDescription - This is a recursive function that walks a type hierarchy |
| 247 | // calculating the description for a type. |
| 248 | // |
| 249 | static std::string getTypeDescription(const Type *Ty, |
| 250 | std::vector<const Type *> &TypeStack) { |
| 251 | if (isa<OpaqueType>(Ty)) { // Base case for the recursion |
| 252 | std::map<const Type*, std::string>::iterator I = |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 253 | AbstractTypeDescriptions->lower_bound(Ty); |
| 254 | if (I != AbstractTypeDescriptions->end() && I->first == Ty) |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 255 | return I->second; |
Chris Lattner | 51662c7 | 2004-07-08 22:31:09 +0000 | [diff] [blame] | 256 | std::string Desc = "opaque"; |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 257 | AbstractTypeDescriptions->insert(std::make_pair(Ty, Desc)); |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 258 | return Desc; |
| 259 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 260 | |
Chris Lattner | 87ca5fa | 2003-09-02 21:41:05 +0000 | [diff] [blame] | 261 | if (!Ty->isAbstract()) { // Base case for the recursion |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 262 | std::map<const Type*, std::string>::iterator I = |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 263 | ConcreteTypeDescriptions->find(Ty); |
Chris Lattner | a5f5a9c | 2007-04-20 22:33:47 +0000 | [diff] [blame] | 264 | if (I != ConcreteTypeDescriptions->end()) |
| 265 | return I->second; |
| 266 | |
| 267 | if (Ty->isPrimitiveType()) { |
| 268 | switch (Ty->getTypeID()) { |
| 269 | default: assert(0 && "Unknown prim type!"); |
| 270 | case Type::VoidTyID: return (*ConcreteTypeDescriptions)[Ty] = "void"; |
| 271 | case Type::FloatTyID: return (*ConcreteTypeDescriptions)[Ty] = "float"; |
| 272 | case Type::DoubleTyID: return (*ConcreteTypeDescriptions)[Ty] = "double"; |
Dale Johannesen | 320fc8a | 2007-08-03 01:03:46 +0000 | [diff] [blame] | 273 | case Type::X86_FP80TyID: |
| 274 | return (*ConcreteTypeDescriptions)[Ty] = "x86_fp80"; |
| 275 | case Type::FP128TyID: return (*ConcreteTypeDescriptions)[Ty] = "fp128"; |
| 276 | case Type::PPC_FP128TyID: |
| 277 | return (*ConcreteTypeDescriptions)[Ty] = "ppc_fp128"; |
Chris Lattner | a5f5a9c | 2007-04-20 22:33:47 +0000 | [diff] [blame] | 278 | case Type::LabelTyID: return (*ConcreteTypeDescriptions)[Ty] = "label"; |
| 279 | } |
| 280 | } |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 281 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 282 | |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 283 | // Check to see if the Type is already on the stack... |
| 284 | unsigned Slot = 0, CurSize = TypeStack.size(); |
| 285 | while (Slot < CurSize && TypeStack[Slot] != Ty) ++Slot; // Scan for type |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 286 | |
| 287 | // This is another base case for the recursion. In this case, we know |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 288 | // that we have looped back to a type that we have previously visited. |
| 289 | // Generate the appropriate upreference to handle this. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 290 | // |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 291 | if (Slot < CurSize) |
| 292 | return "\\" + utostr(CurSize-Slot); // Here's the upreference |
| 293 | |
| 294 | // Recursive case: derived types... |
| 295 | std::string Result; |
| 296 | TypeStack.push_back(Ty); // Add us to the stack.. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 297 | |
Chris Lattner | f70c22b | 2004-06-17 18:19:28 +0000 | [diff] [blame] | 298 | switch (Ty->getTypeID()) { |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 299 | case Type::IntegerTyID: { |
| 300 | const IntegerType *ITy = cast<IntegerType>(Ty); |
Reid Spencer | a1fed2d | 2007-01-13 01:09:33 +0000 | [diff] [blame] | 301 | Result = "i" + utostr(ITy->getBitWidth()); |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 302 | break; |
| 303 | } |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 304 | case Type::FunctionTyID: { |
| 305 | const FunctionType *FTy = cast<FunctionType>(Ty); |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 306 | if (!Result.empty()) |
| 307 | Result += " "; |
| 308 | Result += getTypeDescription(FTy->getReturnType(), TypeStack) + " ("; |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 309 | for (FunctionType::param_iterator I = FTy->param_begin(), |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 310 | E = FTy->param_end(); I != E; ++I) { |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 311 | if (I != FTy->param_begin()) |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 312 | Result += ", "; |
| 313 | Result += getTypeDescription(*I, TypeStack); |
| 314 | } |
| 315 | if (FTy->isVarArg()) { |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 316 | if (FTy->getNumParams()) Result += ", "; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 317 | Result += "..."; |
| 318 | } |
| 319 | Result += ")"; |
| 320 | break; |
| 321 | } |
| 322 | case Type::StructTyID: { |
| 323 | const StructType *STy = cast<StructType>(Ty); |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 324 | if (STy->isPacked()) |
| 325 | Result = "<{ "; |
| 326 | else |
| 327 | Result = "{ "; |
Chris Lattner | d21cd80 | 2004-02-09 04:37:31 +0000 | [diff] [blame] | 328 | for (StructType::element_iterator I = STy->element_begin(), |
| 329 | E = STy->element_end(); I != E; ++I) { |
| 330 | if (I != STy->element_begin()) |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 331 | Result += ", "; |
| 332 | Result += getTypeDescription(*I, TypeStack); |
| 333 | } |
| 334 | Result += " }"; |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 335 | if (STy->isPacked()) |
| 336 | Result += ">"; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 337 | break; |
| 338 | } |
| 339 | case Type::PointerTyID: { |
| 340 | const PointerType *PTy = cast<PointerType>(Ty); |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 341 | Result = getTypeDescription(PTy->getElementType(), TypeStack); |
| 342 | if (unsigned AddressSpace = PTy->getAddressSpace()) |
| 343 | Result += " addrspace(" + utostr(AddressSpace) + ")"; |
| 344 | Result += " *"; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 345 | break; |
| 346 | } |
| 347 | case Type::ArrayTyID: { |
| 348 | const ArrayType *ATy = cast<ArrayType>(Ty); |
| 349 | unsigned NumElements = ATy->getNumElements(); |
| 350 | Result = "["; |
| 351 | Result += utostr(NumElements) + " x "; |
| 352 | Result += getTypeDescription(ATy->getElementType(), TypeStack) + "]"; |
| 353 | break; |
| 354 | } |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 355 | case Type::VectorTyID: { |
| 356 | const VectorType *PTy = cast<VectorType>(Ty); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 357 | unsigned NumElements = PTy->getNumElements(); |
| 358 | Result = "<"; |
| 359 | Result += utostr(NumElements) + " x "; |
| 360 | Result += getTypeDescription(PTy->getElementType(), TypeStack) + ">"; |
| 361 | break; |
| 362 | } |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 363 | default: |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 364 | Result = "<error>"; |
Chris Lattner | d8d6c76 | 2003-09-02 22:50:02 +0000 | [diff] [blame] | 365 | assert(0 && "Unhandled type in getTypeDescription!"); |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 366 | } |
| 367 | |
| 368 | TypeStack.pop_back(); // Remove self from stack... |
| 369 | |
Chris Lattner | a3057e8 | 2003-09-04 23:41:03 +0000 | [diff] [blame] | 370 | return Result; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 371 | } |
| 372 | |
| 373 | |
| 374 | |
| 375 | static const std::string &getOrCreateDesc(std::map<const Type*,std::string>&Map, |
| 376 | const Type *Ty) { |
| 377 | std::map<const Type*, std::string>::iterator I = Map.find(Ty); |
| 378 | if (I != Map.end()) return I->second; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 379 | |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 380 | std::vector<const Type *> TypeStack; |
Chris Lattner | ded3613 | 2005-03-02 03:54:43 +0000 | [diff] [blame] | 381 | std::string Result = getTypeDescription(Ty, TypeStack); |
| 382 | return Map[Ty] = Result; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 383 | } |
| 384 | |
| 385 | |
| 386 | const std::string &Type::getDescription() const { |
| 387 | if (isAbstract()) |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 388 | return getOrCreateDesc(*AbstractTypeDescriptions, this); |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 389 | else |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 390 | return getOrCreateDesc(*ConcreteTypeDescriptions, this); |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 391 | } |
| 392 | |
| 393 | |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 394 | bool StructType::indexValid(const Value *V) const { |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 395 | // Structure indexes require 32-bit integer constants. |
| 396 | if (V->getType() == Type::Int32Ty) |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 397 | if (const ConstantInt *CU = dyn_cast<ConstantInt>(V)) |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 398 | return CU->getZExtValue() < NumContainedTys; |
Chris Lattner | b9da9c1 | 2003-11-25 21:21:46 +0000 | [diff] [blame] | 399 | return false; |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 400 | } |
| 401 | |
| 402 | // getTypeAtIndex - Given an index value into the type, return the type of the |
| 403 | // element. For a structure type, this must be a constant value... |
| 404 | // |
| 405 | const Type *StructType::getTypeAtIndex(const Value *V) const { |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 406 | assert(indexValid(V) && "Invalid structure index!"); |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 407 | unsigned Idx = (unsigned)cast<ConstantInt>(V)->getZExtValue(); |
Chris Lattner | f32f568 | 2004-02-09 05:40:24 +0000 | [diff] [blame] | 408 | return ContainedTys[Idx]; |
Chris Lattner | 58716b9 | 2001-11-26 17:01:47 +0000 | [diff] [blame] | 409 | } |
| 410 | |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 411 | //===----------------------------------------------------------------------===// |
Chris Lattner | ab4fa4f | 2006-09-28 23:45:00 +0000 | [diff] [blame] | 412 | // Primitive 'Type' data |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 413 | //===----------------------------------------------------------------------===// |
| 414 | |
Dale Johannesen | 320fc8a | 2007-08-03 01:03:46 +0000 | [diff] [blame] | 415 | const Type *Type::VoidTy = new Type(Type::VoidTyID); |
| 416 | const Type *Type::FloatTy = new Type(Type::FloatTyID); |
| 417 | const Type *Type::DoubleTy = new Type(Type::DoubleTyID); |
| 418 | const Type *Type::X86_FP80Ty = new Type(Type::X86_FP80TyID); |
| 419 | const Type *Type::FP128Ty = new Type(Type::FP128TyID); |
| 420 | const Type *Type::PPC_FP128Ty = new Type(Type::PPC_FP128TyID); |
| 421 | const Type *Type::LabelTy = new Type(Type::LabelTyID); |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 422 | |
Chris Lattner | d1f711f | 2007-02-09 22:24:04 +0000 | [diff] [blame] | 423 | namespace { |
| 424 | struct BuiltinIntegerType : public IntegerType { |
| 425 | BuiltinIntegerType(unsigned W) : IntegerType(W) {} |
| 426 | }; |
| 427 | } |
| 428 | const IntegerType *Type::Int1Ty = new BuiltinIntegerType(1); |
| 429 | const IntegerType *Type::Int8Ty = new BuiltinIntegerType(8); |
| 430 | const IntegerType *Type::Int16Ty = new BuiltinIntegerType(16); |
| 431 | const IntegerType *Type::Int32Ty = new BuiltinIntegerType(32); |
| 432 | const IntegerType *Type::Int64Ty = new BuiltinIntegerType(64); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 433 | |
| 434 | |
| 435 | //===----------------------------------------------------------------------===// |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 436 | // Derived Type Constructors |
| 437 | //===----------------------------------------------------------------------===// |
| 438 | |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 439 | FunctionType::FunctionType(const Type *Result, |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 440 | const std::vector<const Type*> &Params, |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 441 | bool IsVarArgs) |
| 442 | : DerivedType(FunctionTyID), isVarArgs(IsVarArgs) { |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 443 | ContainedTys = reinterpret_cast<PATypeHandle*>(this+1); |
| 444 | NumContainedTys = Params.size() + 1; // + 1 for result type |
Chris Lattner | c964715 | 2004-07-07 06:48:27 +0000 | [diff] [blame] | 445 | assert((Result->isFirstClassType() || Result == Type::VoidTy || |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 446 | isa<OpaqueType>(Result)) && |
Chris Lattner | edfc49d | 2004-07-06 23:25:19 +0000 | [diff] [blame] | 447 | "LLVM functions cannot return aggregates"); |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 448 | bool isAbstract = Result->isAbstract(); |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 449 | new (&ContainedTys[0]) PATypeHandle(Result, this); |
Chris Lattner | f32f568 | 2004-02-09 05:40:24 +0000 | [diff] [blame] | 450 | |
| 451 | for (unsigned i = 0; i != Params.size(); ++i) { |
Chris Lattner | b4091e5 | 2004-07-13 20:09:51 +0000 | [diff] [blame] | 452 | assert((Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])) && |
| 453 | "Function arguments must be value types!"); |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 454 | new (&ContainedTys[i+1]) PATypeHandle(Params[i],this); |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 455 | isAbstract |= Params[i]->isAbstract(); |
| 456 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 457 | |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 458 | // Calculate whether or not this type is abstract |
| 459 | setAbstract(isAbstract); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 460 | } |
| 461 | |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 462 | StructType::StructType(const std::vector<const Type*> &Types, bool isPacked) |
Chris Lattner | 6c42c31 | 2001-12-14 16:41:56 +0000 | [diff] [blame] | 463 | : CompositeType(StructTyID) { |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 464 | ContainedTys = reinterpret_cast<PATypeHandle*>(this + 1); |
| 465 | NumContainedTys = Types.size(); |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 466 | setSubclassData(isPacked); |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 467 | bool isAbstract = false; |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 468 | for (unsigned i = 0; i < Types.size(); ++i) { |
Chris Lattner | e83593b | 2004-03-29 00:17:20 +0000 | [diff] [blame] | 469 | assert(Types[i] != Type::VoidTy && "Void type for structure field!!"); |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 470 | new (&ContainedTys[i]) PATypeHandle(Types[i], this); |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 471 | isAbstract |= Types[i]->isAbstract(); |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 472 | } |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 473 | |
| 474 | // Calculate whether or not this type is abstract |
| 475 | setAbstract(isAbstract); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 476 | } |
| 477 | |
Chris Lattner | 7d7a0ed | 2005-01-08 20:19:51 +0000 | [diff] [blame] | 478 | ArrayType::ArrayType(const Type *ElType, uint64_t NumEl) |
Chris Lattner | 6c42c31 | 2001-12-14 16:41:56 +0000 | [diff] [blame] | 479 | : SequentialType(ArrayTyID, ElType) { |
| 480 | NumElements = NumEl; |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 481 | |
| 482 | // Calculate whether or not this type is abstract |
| 483 | setAbstract(ElType->isAbstract()); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 484 | } |
| 485 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 486 | VectorType::VectorType(const Type *ElType, unsigned NumEl) |
| 487 | : SequentialType(VectorTyID, ElType) { |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 488 | NumElements = NumEl; |
Reid Spencer | e463fc8 | 2007-02-10 19:03:01 +0000 | [diff] [blame] | 489 | setAbstract(ElType->isAbstract()); |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 490 | assert(NumEl > 0 && "NumEl of a VectorType must be greater than 0"); |
Reid Spencer | cc5dc2e | 2007-02-10 22:02:45 +0000 | [diff] [blame] | 491 | assert((ElType->isInteger() || ElType->isFloatingPoint() || |
| 492 | isa<OpaqueType>(ElType)) && |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 493 | "Elements of a VectorType must be a primitive type"); |
Reid Spencer | cc5dc2e | 2007-02-10 22:02:45 +0000 | [diff] [blame] | 494 | |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 495 | } |
| 496 | |
| 497 | |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 498 | PointerType::PointerType(const Type *E, unsigned AddrSpace) |
| 499 | : SequentialType(PointerTyID, E) { |
| 500 | AddressSpace = AddrSpace; |
Chris Lattner | a3ad5b2 | 2003-09-03 14:44:53 +0000 | [diff] [blame] | 501 | // Calculate whether or not this type is abstract |
| 502 | setAbstract(E->isAbstract()); |
Chris Lattner | 6c42c31 | 2001-12-14 16:41:56 +0000 | [diff] [blame] | 503 | } |
| 504 | |
| 505 | OpaqueType::OpaqueType() : DerivedType(OpaqueTyID) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 506 | setAbstract(true); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 507 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 508 | DOUT << "Derived new type: " << *this << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 509 | #endif |
| 510 | } |
| 511 | |
Chris Lattner | f32f568 | 2004-02-09 05:40:24 +0000 | [diff] [blame] | 512 | // dropAllTypeUses - When this (abstract) type is resolved to be equal to |
| 513 | // another (more concrete) type, we must eliminate all references to other |
| 514 | // types, to avoid some circular reference problems. |
| 515 | void DerivedType::dropAllTypeUses() { |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 516 | if (NumContainedTys != 0) { |
Chris Lattner | f32f568 | 2004-02-09 05:40:24 +0000 | [diff] [blame] | 517 | // The type must stay abstract. To do this, we insert a pointer to a type |
| 518 | // that will never get resolved, thus will always be abstract. |
| 519 | static Type *AlwaysOpaqueTy = OpaqueType::get(); |
| 520 | static PATypeHolder Holder(AlwaysOpaqueTy); |
| 521 | ContainedTys[0] = AlwaysOpaqueTy; |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 522 | |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 523 | // Change the rest of the types to be Int32Ty's. It doesn't matter what we |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 524 | // pick so long as it doesn't point back to this type. We choose something |
| 525 | // concrete to avoid overhead for adding to AbstracTypeUser lists and stuff. |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 526 | for (unsigned i = 1, e = NumContainedTys; i != e; ++i) |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 527 | ContainedTys[i] = Type::Int32Ty; |
Chris Lattner | f32f568 | 2004-02-09 05:40:24 +0000 | [diff] [blame] | 528 | } |
Chris Lattner | 1825009 | 2003-10-13 14:03:36 +0000 | [diff] [blame] | 529 | } |
| 530 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 531 | |
| 532 | |
| 533 | /// TypePromotionGraph and graph traits - this is designed to allow us to do |
| 534 | /// efficient SCC processing of type graphs. This is the exact same as |
| 535 | /// GraphTraits<Type*>, except that we pretend that concrete types have no |
| 536 | /// children to avoid processing them. |
| 537 | struct TypePromotionGraph { |
| 538 | Type *Ty; |
| 539 | TypePromotionGraph(Type *T) : Ty(T) {} |
| 540 | }; |
| 541 | |
| 542 | namespace llvm { |
| 543 | template <> struct GraphTraits<TypePromotionGraph> { |
| 544 | typedef Type NodeType; |
| 545 | typedef Type::subtype_iterator ChildIteratorType; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 546 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 547 | static inline NodeType *getEntryNode(TypePromotionGraph G) { return G.Ty; } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 548 | static inline ChildIteratorType child_begin(NodeType *N) { |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 549 | if (N->isAbstract()) |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 550 | return N->subtype_begin(); |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 551 | else // No need to process children of concrete types. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 552 | return N->subtype_end(); |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 553 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 554 | static inline ChildIteratorType child_end(NodeType *N) { |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 555 | return N->subtype_end(); |
| 556 | } |
| 557 | }; |
| 558 | } |
| 559 | |
| 560 | |
Chris Lattner | b5c1670 | 2004-10-06 16:36:46 +0000 | [diff] [blame] | 561 | // PromoteAbstractToConcrete - This is a recursive function that walks a type |
| 562 | // graph calculating whether or not a type is abstract. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 563 | // |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 564 | void Type::PromoteAbstractToConcrete() { |
| 565 | if (!isAbstract()) return; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 566 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 567 | scc_iterator<TypePromotionGraph> SI = scc_begin(TypePromotionGraph(this)); |
| 568 | scc_iterator<TypePromotionGraph> SE = scc_end (TypePromotionGraph(this)); |
Chris Lattner | b5c1670 | 2004-10-06 16:36:46 +0000 | [diff] [blame] | 569 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 570 | for (; SI != SE; ++SI) { |
| 571 | std::vector<Type*> &SCC = *SI; |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 572 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 573 | // Concrete types are leaves in the tree. Since an SCC will either be all |
| 574 | // abstract or all concrete, we only need to check one type. |
| 575 | if (SCC[0]->isAbstract()) { |
| 576 | if (isa<OpaqueType>(SCC[0])) |
| 577 | return; // Not going to be concrete, sorry. |
| 578 | |
| 579 | // If all of the children of all of the types in this SCC are concrete, |
| 580 | // then this SCC is now concrete as well. If not, neither this SCC, nor |
| 581 | // any parent SCCs will be concrete, so we might as well just exit. |
| 582 | for (unsigned i = 0, e = SCC.size(); i != e; ++i) |
| 583 | for (Type::subtype_iterator CI = SCC[i]->subtype_begin(), |
| 584 | E = SCC[i]->subtype_end(); CI != E; ++CI) |
| 585 | if ((*CI)->isAbstract()) |
Chris Lattner | 76da616 | 2005-03-09 17:34:27 +0000 | [diff] [blame] | 586 | // If the child type is in our SCC, it doesn't make the entire SCC |
| 587 | // abstract unless there is a non-SCC abstract type. |
| 588 | if (std::find(SCC.begin(), SCC.end(), *CI) == SCC.end()) |
| 589 | return; // Not going to be concrete, sorry. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 590 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 591 | // Okay, we just discovered this whole SCC is now concrete, mark it as |
| 592 | // such! |
| 593 | for (unsigned i = 0, e = SCC.size(); i != e; ++i) { |
| 594 | assert(SCC[i]->isAbstract() && "Why are we processing concrete types?"); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 595 | |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 596 | SCC[i]->setAbstract(false); |
Chris Lattner | 76da616 | 2005-03-09 17:34:27 +0000 | [diff] [blame] | 597 | } |
| 598 | |
| 599 | for (unsigned i = 0, e = SCC.size(); i != e; ++i) { |
| 600 | assert(!SCC[i]->isAbstract() && "Concrete type became abstract?"); |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 601 | // The type just became concrete, notify all users! |
| 602 | cast<DerivedType>(SCC[i])->notifyUsesThatTypeBecameConcrete(); |
| 603 | } |
Chris Lattner | bc4846d | 2003-09-02 21:56:34 +0000 | [diff] [blame] | 604 | } |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 605 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 606 | } |
| 607 | |
| 608 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 609 | //===----------------------------------------------------------------------===// |
| 610 | // Type Structural Equality Testing |
| 611 | //===----------------------------------------------------------------------===// |
| 612 | |
| 613 | // TypesEqual - Two types are considered structurally equal if they have the |
| 614 | // same "shape": Every level and element of the types have identical primitive |
| 615 | // ID's, and the graphs have the same edges/nodes in them. Nodes do not have to |
| 616 | // be pointer equals to be equivalent though. This uses an optimistic algorithm |
| 617 | // that assumes that two graphs are the same until proven otherwise. |
| 618 | // |
| 619 | static bool TypesEqual(const Type *Ty, const Type *Ty2, |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 620 | std::map<const Type *, const Type *> &EqTypes) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 621 | if (Ty == Ty2) return true; |
Chris Lattner | f70c22b | 2004-06-17 18:19:28 +0000 | [diff] [blame] | 622 | if (Ty->getTypeID() != Ty2->getTypeID()) return false; |
Chris Lattner | 008f906 | 2001-10-24 05:12:04 +0000 | [diff] [blame] | 623 | if (isa<OpaqueType>(Ty)) |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 624 | return false; // Two unequal opaque types are never equal |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 625 | |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 626 | std::map<const Type*, const Type*>::iterator It = EqTypes.lower_bound(Ty); |
| 627 | if (It != EqTypes.end() && It->first == Ty) |
Chris Lattner | 3b1e3f4 | 2001-11-02 07:51:31 +0000 | [diff] [blame] | 628 | return It->second == Ty2; // Looping back on a type, check for equality |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 629 | |
Chris Lattner | 3b1e3f4 | 2001-11-02 07:51:31 +0000 | [diff] [blame] | 630 | // Otherwise, add the mapping to the table to make sure we don't get |
| 631 | // recursion on the types... |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 632 | EqTypes.insert(It, std::make_pair(Ty, Ty2)); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 633 | |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 634 | // Two really annoying special cases that breaks an otherwise nice simple |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 635 | // algorithm is the fact that arraytypes have sizes that differentiates types, |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 636 | // and that function types can be varargs or not. Consider this now. |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 637 | // |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 638 | if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty)) { |
| 639 | const IntegerType *ITy2 = cast<IntegerType>(Ty2); |
| 640 | return ITy->getBitWidth() == ITy2->getBitWidth(); |
| 641 | } else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) { |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 642 | const PointerType *PTy2 = cast<PointerType>(Ty2); |
| 643 | return PTy->getAddressSpace() == PTy2->getAddressSpace() && |
| 644 | TypesEqual(PTy->getElementType(), PTy2->getElementType(), EqTypes); |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 645 | } else if (const StructType *STy = dyn_cast<StructType>(Ty)) { |
Chris Lattner | d21cd80 | 2004-02-09 04:37:31 +0000 | [diff] [blame] | 646 | const StructType *STy2 = cast<StructType>(Ty2); |
| 647 | if (STy->getNumElements() != STy2->getNumElements()) return false; |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 648 | if (STy->isPacked() != STy2->isPacked()) return false; |
Chris Lattner | d21cd80 | 2004-02-09 04:37:31 +0000 | [diff] [blame] | 649 | for (unsigned i = 0, e = STy2->getNumElements(); i != e; ++i) |
| 650 | if (!TypesEqual(STy->getElementType(i), STy2->getElementType(i), EqTypes)) |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 651 | return false; |
| 652 | return true; |
| 653 | } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { |
| 654 | const ArrayType *ATy2 = cast<ArrayType>(Ty2); |
| 655 | return ATy->getNumElements() == ATy2->getNumElements() && |
| 656 | TypesEqual(ATy->getElementType(), ATy2->getElementType(), EqTypes); |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 657 | } else if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) { |
| 658 | const VectorType *PTy2 = cast<VectorType>(Ty2); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 659 | return PTy->getNumElements() == PTy2->getNumElements() && |
| 660 | TypesEqual(PTy->getElementType(), PTy2->getElementType(), EqTypes); |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 661 | } else if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) { |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 662 | const FunctionType *FTy2 = cast<FunctionType>(Ty2); |
| 663 | if (FTy->isVarArg() != FTy2->isVarArg() || |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 664 | FTy->getNumParams() != FTy2->getNumParams() || |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 665 | !TypesEqual(FTy->getReturnType(), FTy2->getReturnType(), EqTypes)) |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 666 | return false; |
Reid Spencer | 877e7ce | 2007-01-08 19:41:01 +0000 | [diff] [blame] | 667 | for (unsigned i = 0, e = FTy2->getNumParams(); i != e; ++i) { |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 668 | if (!TypesEqual(FTy->getParamType(i), FTy2->getParamType(i), EqTypes)) |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 669 | return false; |
Reid Spencer | 877e7ce | 2007-01-08 19:41:01 +0000 | [diff] [blame] | 670 | } |
Chris Lattner | 5af4197 | 2003-10-13 14:55:56 +0000 | [diff] [blame] | 671 | return true; |
| 672 | } else { |
| 673 | assert(0 && "Unknown derived type!"); |
| 674 | return false; |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 675 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 676 | } |
| 677 | |
| 678 | static bool TypesEqual(const Type *Ty, const Type *Ty2) { |
Chris Lattner | 47697a1 | 2003-05-22 21:21:43 +0000 | [diff] [blame] | 679 | std::map<const Type *, const Type *> EqTypes; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 680 | return TypesEqual(Ty, Ty2, EqTypes); |
| 681 | } |
| 682 | |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 683 | // AbstractTypeHasCycleThrough - Return true there is a path from CurTy to |
| 684 | // TargetTy in the type graph. We know that Ty is an abstract type, so if we |
| 685 | // ever reach a non-abstract type, we know that we don't need to search the |
| 686 | // subgraph. |
| 687 | static bool AbstractTypeHasCycleThrough(const Type *TargetTy, const Type *CurTy, |
Chris Lattner | c3b5849 | 2004-02-09 20:23:44 +0000 | [diff] [blame] | 688 | std::set<const Type*> &VisitedTypes) { |
| 689 | if (TargetTy == CurTy) return true; |
| 690 | if (!CurTy->isAbstract()) return false; |
| 691 | |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 692 | if (!VisitedTypes.insert(CurTy).second) |
| 693 | return false; // Already been here. |
Chris Lattner | c3b5849 | 2004-02-09 20:23:44 +0000 | [diff] [blame] | 694 | |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 695 | for (Type::subtype_iterator I = CurTy->subtype_begin(), |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 696 | E = CurTy->subtype_end(); I != E; ++I) |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 697 | if (AbstractTypeHasCycleThrough(TargetTy, *I, VisitedTypes)) |
Chris Lattner | c3b5849 | 2004-02-09 20:23:44 +0000 | [diff] [blame] | 698 | return true; |
| 699 | return false; |
| 700 | } |
| 701 | |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 702 | static bool ConcreteTypeHasCycleThrough(const Type *TargetTy, const Type *CurTy, |
| 703 | std::set<const Type*> &VisitedTypes) { |
| 704 | if (TargetTy == CurTy) return true; |
| 705 | |
| 706 | if (!VisitedTypes.insert(CurTy).second) |
| 707 | return false; // Already been here. |
| 708 | |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 709 | for (Type::subtype_iterator I = CurTy->subtype_begin(), |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 710 | E = CurTy->subtype_end(); I != E; ++I) |
| 711 | if (ConcreteTypeHasCycleThrough(TargetTy, *I, VisitedTypes)) |
| 712 | return true; |
| 713 | return false; |
| 714 | } |
Chris Lattner | c3b5849 | 2004-02-09 20:23:44 +0000 | [diff] [blame] | 715 | |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 716 | /// TypeHasCycleThroughItself - Return true if the specified type has a cycle |
| 717 | /// back to itself. |
| 718 | static bool TypeHasCycleThroughItself(const Type *Ty) { |
| 719 | std::set<const Type*> VisitedTypes; |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 720 | |
| 721 | if (Ty->isAbstract()) { // Optimized case for abstract types. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 722 | for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); |
Chris Lattner | 8511c35 | 2004-11-16 20:30:53 +0000 | [diff] [blame] | 723 | I != E; ++I) |
| 724 | if (AbstractTypeHasCycleThrough(Ty, *I, VisitedTypes)) |
| 725 | return true; |
| 726 | } else { |
| 727 | for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); |
| 728 | I != E; ++I) |
| 729 | if (ConcreteTypeHasCycleThrough(Ty, *I, VisitedTypes)) |
| 730 | return true; |
| 731 | } |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 732 | return false; |
| 733 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 734 | |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 735 | /// getSubElementHash - Generate a hash value for all of the SubType's of this |
| 736 | /// type. The hash value is guaranteed to be zero if any of the subtypes are |
| 737 | /// an opaque type. Otherwise we try to mix them in as well as possible, but do |
| 738 | /// not look at the subtype's subtype's. |
| 739 | static unsigned getSubElementHash(const Type *Ty) { |
| 740 | unsigned HashVal = 0; |
| 741 | for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); |
| 742 | I != E; ++I) { |
| 743 | HashVal *= 32; |
| 744 | const Type *SubTy = I->get(); |
| 745 | HashVal += SubTy->getTypeID(); |
| 746 | switch (SubTy->getTypeID()) { |
| 747 | default: break; |
| 748 | case Type::OpaqueTyID: return 0; // Opaque -> hash = 0 no matter what. |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 749 | case Type::IntegerTyID: |
| 750 | HashVal ^= (cast<IntegerType>(SubTy)->getBitWidth() << 3); |
| 751 | break; |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 752 | case Type::FunctionTyID: |
| 753 | HashVal ^= cast<FunctionType>(SubTy)->getNumParams()*2 + |
| 754 | cast<FunctionType>(SubTy)->isVarArg(); |
| 755 | break; |
| 756 | case Type::ArrayTyID: |
| 757 | HashVal ^= cast<ArrayType>(SubTy)->getNumElements(); |
| 758 | break; |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 759 | case Type::VectorTyID: |
| 760 | HashVal ^= cast<VectorType>(SubTy)->getNumElements(); |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 761 | break; |
| 762 | case Type::StructTyID: |
| 763 | HashVal ^= cast<StructType>(SubTy)->getNumElements(); |
| 764 | break; |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 765 | case Type::PointerTyID: |
| 766 | HashVal ^= cast<PointerType>(SubTy)->getAddressSpace(); |
| 767 | break; |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 768 | } |
| 769 | } |
| 770 | return HashVal ? HashVal : 1; // Do not return zero unless opaque subty. |
| 771 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 772 | |
| 773 | //===----------------------------------------------------------------------===// |
| 774 | // Derived Type Factory Functions |
| 775 | //===----------------------------------------------------------------------===// |
| 776 | |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 777 | namespace llvm { |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 778 | class TypeMapBase { |
| 779 | protected: |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 780 | /// TypesByHash - Keep track of types by their structure hash value. Note |
| 781 | /// that we only keep track of types that have cycles through themselves in |
| 782 | /// this map. |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 783 | /// |
| 784 | std::multimap<unsigned, PATypeHolder> TypesByHash; |
Chris Lattner | 8a7ad2d | 2004-11-19 16:39:44 +0000 | [diff] [blame] | 785 | |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 786 | public: |
| 787 | void RemoveFromTypesByHash(unsigned Hash, const Type *Ty) { |
| 788 | std::multimap<unsigned, PATypeHolder>::iterator I = |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 789 | TypesByHash.lower_bound(Hash); |
| 790 | for (; I != TypesByHash.end() && I->first == Hash; ++I) { |
| 791 | if (I->second == Ty) { |
| 792 | TypesByHash.erase(I); |
| 793 | return; |
| 794 | } |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 795 | } |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 796 | |
| 797 | // This must be do to an opaque type that was resolved. Switch down to hash |
| 798 | // code of zero. |
| 799 | assert(Hash && "Didn't find type entry!"); |
| 800 | RemoveFromTypesByHash(0, Ty); |
Chris Lattner | 8a7ad2d | 2004-11-19 16:39:44 +0000 | [diff] [blame] | 801 | } |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 802 | |
| 803 | /// TypeBecameConcrete - When Ty gets a notification that TheType just became |
| 804 | /// concrete, drop uses and make Ty non-abstract if we should. |
| 805 | void TypeBecameConcrete(DerivedType *Ty, const DerivedType *TheType) { |
| 806 | // If the element just became concrete, remove 'ty' from the abstract |
| 807 | // type user list for the type. Do this for as many times as Ty uses |
| 808 | // OldType. |
| 809 | for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); |
| 810 | I != E; ++I) |
| 811 | if (I->get() == TheType) |
| 812 | TheType->removeAbstractTypeUser(Ty); |
| 813 | |
| 814 | // If the type is currently thought to be abstract, rescan all of our |
| 815 | // subtypes to see if the type has just become concrete! Note that this |
| 816 | // may send out notifications to AbstractTypeUsers that types become |
| 817 | // concrete. |
| 818 | if (Ty->isAbstract()) |
| 819 | Ty->PromoteAbstractToConcrete(); |
| 820 | } |
| 821 | }; |
| 822 | } |
| 823 | |
| 824 | |
| 825 | // TypeMap - Make sure that only one instance of a particular type may be |
| 826 | // created on any given run of the compiler... note that this involves updating |
| 827 | // our map if an abstract type gets refined somehow. |
| 828 | // |
| 829 | namespace llvm { |
| 830 | template<class ValType, class TypeClass> |
| 831 | class TypeMap : public TypeMapBase { |
| 832 | std::map<ValType, PATypeHolder> Map; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 833 | public: |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 834 | typedef typename std::map<ValType, PATypeHolder>::iterator iterator; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 835 | ~TypeMap() { print("ON EXIT"); } |
| 836 | |
| 837 | inline TypeClass *get(const ValType &V) { |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 838 | iterator I = Map.find(V); |
Chris Lattner | 3b41e0e | 2003-12-31 03:19:37 +0000 | [diff] [blame] | 839 | return I != Map.end() ? cast<TypeClass>((Type*)I->second.get()) : 0; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 840 | } |
| 841 | |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 842 | inline void add(const ValType &V, TypeClass *Ty) { |
| 843 | Map.insert(std::make_pair(V, Ty)); |
| 844 | |
| 845 | // If this type has a cycle, remember it. |
| 846 | TypesByHash.insert(std::make_pair(ValType::hashTypeStructure(Ty), Ty)); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 847 | print("add"); |
| 848 | } |
Chris Lattner | bcf6bc2 | 2005-11-13 01:58:06 +0000 | [diff] [blame] | 849 | |
Chris Lattner | f00c6ad | 2007-02-20 05:29:47 +0000 | [diff] [blame] | 850 | /// RefineAbstractType - This method is called after we have merged a type |
Chris Lattner | bcf6bc2 | 2005-11-13 01:58:06 +0000 | [diff] [blame] | 851 | /// with another one. We must now either merge the type away with |
Chris Lattner | 4b1be10 | 2003-12-31 02:50:02 +0000 | [diff] [blame] | 852 | /// some other type or reinstall it in the map with it's new configuration. |
Chris Lattner | bcf6bc2 | 2005-11-13 01:58:06 +0000 | [diff] [blame] | 853 | void RefineAbstractType(TypeClass *Ty, const DerivedType *OldType, |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 854 | const Type *NewType) { |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 855 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 856 | DOUT << "RefineAbstractType(" << (void*)OldType << "[" << *OldType |
| 857 | << "], " << (void*)NewType << " [" << *NewType << "])\n"; |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 858 | #endif |
Chris Lattner | 66cafb3 | 2005-11-13 01:27:50 +0000 | [diff] [blame] | 859 | |
| 860 | // Otherwise, we are changing one subelement type into another. Clearly the |
| 861 | // OldType must have been abstract, making us abstract. |
| 862 | assert(Ty->isAbstract() && "Refining a non-abstract type!"); |
Chris Lattner | bcf6bc2 | 2005-11-13 01:58:06 +0000 | [diff] [blame] | 863 | assert(OldType != NewType); |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 864 | |
Chris Lattner | 3b41e0e | 2003-12-31 03:19:37 +0000 | [diff] [blame] | 865 | // Make a temporary type holder for the type so that it doesn't disappear on |
| 866 | // us when we erase the entry from the map. |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 867 | PATypeHolder TyHolder = Ty; |
| 868 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 869 | // The old record is now out-of-date, because one of the children has been |
| 870 | // updated. Remove the obsolete entry from the map. |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 871 | unsigned NumErased = Map.erase(ValType::get(Ty)); |
| 872 | assert(NumErased && "Element not found!"); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 873 | |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 874 | // Remember the structural hash for the type before we start hacking on it, |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 875 | // in case we need it later. |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 876 | unsigned OldTypeHash = ValType::hashTypeStructure(Ty); |
| 877 | |
| 878 | // Find the type element we are refining... and change it now! |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 879 | for (unsigned i = 0, e = Ty->getNumContainedTypes(); i != e; ++i) |
Chris Lattner | 66cafb3 | 2005-11-13 01:27:50 +0000 | [diff] [blame] | 880 | if (Ty->ContainedTys[i] == OldType) |
| 881 | Ty->ContainedTys[i] = NewType; |
Chris Lattner | 7548590 | 2005-11-12 08:39:48 +0000 | [diff] [blame] | 882 | unsigned NewTypeHash = ValType::hashTypeStructure(Ty); |
| 883 | |
Chris Lattner | 542d991 | 2003-11-19 19:10:23 +0000 | [diff] [blame] | 884 | // If there are no cycles going through this node, we can do a simple, |
| 885 | // efficient lookup in the map, instead of an inefficient nasty linear |
| 886 | // lookup. |
Chris Lattner | 66cafb3 | 2005-11-13 01:27:50 +0000 | [diff] [blame] | 887 | if (!TypeHasCycleThroughItself(Ty)) { |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 888 | typename std::map<ValType, PATypeHolder>::iterator I; |
| 889 | bool Inserted; |
| 890 | |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 891 | tie(I, Inserted) = Map.insert(std::make_pair(ValType::get(Ty), Ty)); |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 892 | if (!Inserted) { |
Chris Lattner | 8df956c | 2003-09-05 02:39:52 +0000 | [diff] [blame] | 893 | // Refined to a different type altogether? |
Chris Lattner | 66cafb3 | 2005-11-13 01:27:50 +0000 | [diff] [blame] | 894 | RemoveFromTypesByHash(OldTypeHash, Ty); |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 895 | |
| 896 | // We already have this type in the table. Get rid of the newly refined |
| 897 | // type. |
| 898 | TypeClass *NewTy = cast<TypeClass>((Type*)I->second.get()); |
Chris Lattner | af6f93c | 2003-10-03 18:57:54 +0000 | [diff] [blame] | 899 | Ty->refineAbstractTypeTo(NewTy); |
Chris Lattner | 8df956c | 2003-09-05 02:39:52 +0000 | [diff] [blame] | 900 | return; |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 901 | } |
Chris Lattner | 542d991 | 2003-11-19 19:10:23 +0000 | [diff] [blame] | 902 | } else { |
| 903 | // Now we check to see if there is an existing entry in the table which is |
| 904 | // structurally identical to the newly refined type. If so, this type |
| 905 | // gets refined to the pre-existing type. |
| 906 | // |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 907 | std::multimap<unsigned, PATypeHolder>::iterator I, E, Entry; |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 908 | tie(I, E) = TypesByHash.equal_range(NewTypeHash); |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 909 | Entry = E; |
| 910 | for (; I != E; ++I) { |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 911 | if (I->second == Ty) { |
| 912 | // Remember the position of the old type if we see it in our scan. |
| 913 | Entry = I; |
| 914 | } else { |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 915 | if (TypesEqual(Ty, I->second)) { |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 916 | TypeClass *NewTy = cast<TypeClass>((Type*)I->second.get()); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 917 | |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 918 | // Remove the old entry form TypesByHash. If the hash values differ |
| 919 | // now, remove it from the old place. Otherwise, continue scanning |
| 920 | // withing this hashcode to reduce work. |
| 921 | if (NewTypeHash != OldTypeHash) { |
| 922 | RemoveFromTypesByHash(OldTypeHash, Ty); |
| 923 | } else { |
| 924 | if (Entry == E) { |
| 925 | // Find the location of Ty in the TypesByHash structure if we |
| 926 | // haven't seen it already. |
| 927 | while (I->second != Ty) { |
| 928 | ++I; |
| 929 | assert(I != E && "Structure doesn't contain type??"); |
| 930 | } |
| 931 | Entry = I; |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 932 | } |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 933 | TypesByHash.erase(Entry); |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 934 | } |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 935 | Ty->refineAbstractTypeTo(NewTy); |
| 936 | return; |
| 937 | } |
Chris Lattner | 542d991 | 2003-11-19 19:10:23 +0000 | [diff] [blame] | 938 | } |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 939 | } |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 940 | |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 941 | // If there is no existing type of the same structure, we reinsert an |
| 942 | // updated record into the map. |
| 943 | Map.insert(std::make_pair(ValType::get(Ty), Ty)); |
Chris Lattner | 542d991 | 2003-11-19 19:10:23 +0000 | [diff] [blame] | 944 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 945 | |
Chris Lattner | bcb31d6 | 2004-11-16 20:39:04 +0000 | [diff] [blame] | 946 | // If the hash codes differ, update TypesByHash |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 947 | if (NewTypeHash != OldTypeHash) { |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 948 | RemoveFromTypesByHash(OldTypeHash, Ty); |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 949 | TypesByHash.insert(std::make_pair(NewTypeHash, Ty)); |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 950 | } |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 951 | |
Chris Lattner | 8df956c | 2003-09-05 02:39:52 +0000 | [diff] [blame] | 952 | // If the type is currently thought to be abstract, rescan all of our |
Chris Lattner | d4f328e | 2005-11-12 08:22:41 +0000 | [diff] [blame] | 953 | // subtypes to see if the type has just become concrete! Note that this |
| 954 | // may send out notifications to AbstractTypeUsers that types become |
| 955 | // concrete. |
Chris Lattner | a6b10b6 | 2004-10-07 19:20:48 +0000 | [diff] [blame] | 956 | if (Ty->isAbstract()) |
| 957 | Ty->PromoteAbstractToConcrete(); |
Chris Lattner | 266caa2 | 2003-09-05 02:30:47 +0000 | [diff] [blame] | 958 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 959 | |
Chris Lattner | aa06d2c | 2002-04-04 19:26:02 +0000 | [diff] [blame] | 960 | void print(const char *Arg) const { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 961 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 962 | DOUT << "TypeMap<>::" << Arg << " table contents:\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 963 | unsigned i = 0; |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 964 | for (typename std::map<ValType, PATypeHolder>::const_iterator I |
| 965 | = Map.begin(), E = Map.end(); I != E; ++I) |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 966 | DOUT << " " << (++i) << ". " << (void*)I->second.get() << " " |
| 967 | << *I->second.get() << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 968 | #endif |
| 969 | } |
Chris Lattner | aa06d2c | 2002-04-04 19:26:02 +0000 | [diff] [blame] | 970 | |
| 971 | void dump() const { print("dump output"); } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 972 | }; |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 973 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 974 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 975 | |
| 976 | //===----------------------------------------------------------------------===// |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 977 | // Function Type Factory and Value Class... |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 978 | // |
| 979 | |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 980 | //===----------------------------------------------------------------------===// |
| 981 | // Integer Type Factory... |
| 982 | // |
| 983 | namespace llvm { |
| 984 | class IntegerValType { |
Reid Spencer | 062f036 | 2007-01-13 00:12:29 +0000 | [diff] [blame] | 985 | uint32_t bits; |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 986 | public: |
| 987 | IntegerValType(uint16_t numbits) : bits(numbits) {} |
| 988 | |
| 989 | static IntegerValType get(const IntegerType *Ty) { |
| 990 | return IntegerValType(Ty->getBitWidth()); |
| 991 | } |
| 992 | |
| 993 | static unsigned hashTypeStructure(const IntegerType *Ty) { |
| 994 | return (unsigned)Ty->getBitWidth(); |
| 995 | } |
| 996 | |
| 997 | inline bool operator<(const IntegerValType &IVT) const { |
| 998 | return bits < IVT.bits; |
| 999 | } |
| 1000 | }; |
| 1001 | } |
| 1002 | |
| 1003 | static ManagedStatic<TypeMap<IntegerValType, IntegerType> > IntegerTypes; |
| 1004 | |
| 1005 | const IntegerType *IntegerType::get(unsigned NumBits) { |
| 1006 | assert(NumBits >= MIN_INT_BITS && "bitwidth too small"); |
| 1007 | assert(NumBits <= MAX_INT_BITS && "bitwidth too large"); |
| 1008 | |
| 1009 | // Check for the built-in integer types |
| 1010 | switch (NumBits) { |
| 1011 | case 1: return cast<IntegerType>(Type::Int1Ty); |
| 1012 | case 8: return cast<IntegerType>(Type::Int8Ty); |
| 1013 | case 16: return cast<IntegerType>(Type::Int16Ty); |
| 1014 | case 32: return cast<IntegerType>(Type::Int32Ty); |
| 1015 | case 64: return cast<IntegerType>(Type::Int64Ty); |
| 1016 | default: |
| 1017 | break; |
| 1018 | } |
| 1019 | |
| 1020 | IntegerValType IVT(NumBits); |
| 1021 | IntegerType *ITy = IntegerTypes->get(IVT); |
| 1022 | if (ITy) return ITy; // Found a match, return it! |
| 1023 | |
| 1024 | // Value not found. Derive a new type! |
| 1025 | ITy = new IntegerType(NumBits); |
| 1026 | IntegerTypes->add(IVT, ITy); |
| 1027 | |
| 1028 | #ifdef DEBUG_MERGE_TYPES |
| 1029 | DOUT << "Derived new type: " << *ITy << "\n"; |
| 1030 | #endif |
| 1031 | return ITy; |
| 1032 | } |
| 1033 | |
Reid Spencer | 7808dcb | 2007-01-18 02:59:54 +0000 | [diff] [blame] | 1034 | bool IntegerType::isPowerOf2ByteWidth() const { |
| 1035 | unsigned BitWidth = getBitWidth(); |
Reid Spencer | b5f378e | 2007-01-18 18:14:49 +0000 | [diff] [blame] | 1036 | return (BitWidth > 7) && isPowerOf2_32(BitWidth); |
Reid Spencer | 7808dcb | 2007-01-18 02:59:54 +0000 | [diff] [blame] | 1037 | } |
| 1038 | |
Reid Spencer | 9e57414 | 2007-03-01 04:02:06 +0000 | [diff] [blame] | 1039 | APInt IntegerType::getMask() const { |
| 1040 | return APInt::getAllOnesValue(getBitWidth()); |
| 1041 | } |
| 1042 | |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 1043 | // FunctionValType - Define a class to hold the key that goes into the TypeMap |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1044 | // |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1045 | namespace llvm { |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1046 | class FunctionValType { |
| 1047 | const Type *RetTy; |
| 1048 | std::vector<const Type*> ArgTypes; |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 1049 | bool isVarArg; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1050 | public: |
Chris Lattner | 47697a1 | 2003-05-22 21:21:43 +0000 | [diff] [blame] | 1051 | FunctionValType(const Type *ret, const std::vector<const Type*> &args, |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 1052 | bool isVA) : RetTy(ret), isVarArg(isVA) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1053 | for (unsigned i = 0; i < args.size(); ++i) |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1054 | ArgTypes.push_back(args[i]); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1055 | } |
| 1056 | |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1057 | static FunctionValType get(const FunctionType *FT); |
| 1058 | |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1059 | static unsigned hashTypeStructure(const FunctionType *FT) { |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 1060 | unsigned Result = FT->getNumParams()*2 + FT->isVarArg(); |
Reid Spencer | 89b1f46 | 2007-04-09 06:07:52 +0000 | [diff] [blame] | 1061 | return Result; |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1062 | } |
| 1063 | |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 1064 | inline bool operator<(const FunctionValType &MTV) const { |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1065 | if (RetTy < MTV.RetTy) return true; |
| 1066 | if (RetTy > MTV.RetTy) return false; |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 1067 | if (isVarArg < MTV.isVarArg) return true; |
| 1068 | if (isVarArg > MTV.isVarArg) return false; |
Chris Lattner | 56c5acb | 2001-10-13 07:01:33 +0000 | [diff] [blame] | 1069 | if (ArgTypes < MTV.ArgTypes) return true; |
Reid Spencer | 89b1f46 | 2007-04-09 06:07:52 +0000 | [diff] [blame] | 1070 | if (ArgTypes > MTV.ArgTypes) return false; |
Reid Spencer | 89b1f46 | 2007-04-09 06:07:52 +0000 | [diff] [blame] | 1071 | return false; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1072 | } |
| 1073 | }; |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1074 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1075 | |
| 1076 | // Define the actual map itself now... |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1077 | static ManagedStatic<TypeMap<FunctionValType, FunctionType> > FunctionTypes; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1078 | |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1079 | FunctionValType FunctionValType::get(const FunctionType *FT) { |
| 1080 | // Build up a FunctionValType |
| 1081 | std::vector<const Type *> ParamTypes; |
Chris Lattner | d5d8996 | 2004-02-09 04:14:01 +0000 | [diff] [blame] | 1082 | ParamTypes.reserve(FT->getNumParams()); |
| 1083 | for (unsigned i = 0, e = FT->getNumParams(); i != e; ++i) |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1084 | ParamTypes.push_back(FT->getParamType(i)); |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 1085 | return FunctionValType(FT->getReturnType(), ParamTypes, FT->isVarArg()); |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1086 | } |
| 1087 | |
| 1088 | |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 1089 | // FunctionType::get - The factory function for the FunctionType class... |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1090 | FunctionType *FunctionType::get(const Type *ReturnType, |
Chris Lattner | 47697a1 | 2003-05-22 21:21:43 +0000 | [diff] [blame] | 1091 | const std::vector<const Type*> &Params, |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 1092 | bool isVarArg) { |
| 1093 | FunctionValType VT(ReturnType, Params, isVarArg); |
Reid Spencer | 4f859aa | 2007-04-22 05:46:44 +0000 | [diff] [blame] | 1094 | FunctionType *FT = FunctionTypes->get(VT); |
| 1095 | if (FT) { |
| 1096 | return FT; |
Reid Spencer | 3aad26e | 2007-04-09 17:20:18 +0000 | [diff] [blame] | 1097 | } |
| 1098 | |
Reid Spencer | 4f859aa | 2007-04-22 05:46:44 +0000 | [diff] [blame] | 1099 | FT = (FunctionType*) new char[sizeof(FunctionType) + |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 1100 | sizeof(PATypeHandle)*(Params.size()+1)]; |
Duncan Sands | dc02467 | 2007-11-27 13:23:08 +0000 | [diff] [blame] | 1101 | new (FT) FunctionType(ReturnType, Params, isVarArg); |
Reid Spencer | 4f859aa | 2007-04-22 05:46:44 +0000 | [diff] [blame] | 1102 | FunctionTypes->add(VT, FT); |
Chris Lattner | e5a57ee | 2001-07-25 22:47:55 +0000 | [diff] [blame] | 1103 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1104 | #ifdef DEBUG_MERGE_TYPES |
Reid Spencer | 4f859aa | 2007-04-22 05:46:44 +0000 | [diff] [blame] | 1105 | DOUT << "Derived new type: " << FT << "\n"; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1106 | #endif |
Reid Spencer | 4f859aa | 2007-04-22 05:46:44 +0000 | [diff] [blame] | 1107 | return FT; |
Reid Spencer | 9c2e86a | 2006-12-31 05:25:34 +0000 | [diff] [blame] | 1108 | } |
| 1109 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1110 | //===----------------------------------------------------------------------===// |
| 1111 | // Array Type Factory... |
| 1112 | // |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1113 | namespace llvm { |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1114 | class ArrayValType { |
| 1115 | const Type *ValTy; |
Chris Lattner | 7d7a0ed | 2005-01-08 20:19:51 +0000 | [diff] [blame] | 1116 | uint64_t Size; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1117 | public: |
Chris Lattner | 7d7a0ed | 2005-01-08 20:19:51 +0000 | [diff] [blame] | 1118 | ArrayValType(const Type *val, uint64_t sz) : ValTy(val), Size(sz) {} |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1119 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1120 | static ArrayValType get(const ArrayType *AT) { |
| 1121 | return ArrayValType(AT->getElementType(), AT->getNumElements()); |
| 1122 | } |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1123 | |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1124 | static unsigned hashTypeStructure(const ArrayType *AT) { |
Chris Lattner | 7d7a0ed | 2005-01-08 20:19:51 +0000 | [diff] [blame] | 1125 | return (unsigned)AT->getNumElements(); |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1126 | } |
| 1127 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1128 | inline bool operator<(const ArrayValType &MTV) const { |
| 1129 | if (Size < MTV.Size) return true; |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1130 | return Size == MTV.Size && ValTy < MTV.ValTy; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1131 | } |
| 1132 | }; |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1133 | } |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1134 | static ManagedStatic<TypeMap<ArrayValType, ArrayType> > ArrayTypes; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1135 | |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1136 | |
Chris Lattner | 7d7a0ed | 2005-01-08 20:19:51 +0000 | [diff] [blame] | 1137 | ArrayType *ArrayType::get(const Type *ElementType, uint64_t NumElements) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1138 | assert(ElementType && "Can't get array of null types!"); |
| 1139 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1140 | ArrayValType AVT(ElementType, NumElements); |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1141 | ArrayType *AT = ArrayTypes->get(AVT); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1142 | if (AT) return AT; // Found a match, return it! |
| 1143 | |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1144 | // Value not found. Derive a new type! |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1145 | ArrayTypes->add(AVT, AT = new ArrayType(ElementType, NumElements)); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1146 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1147 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1148 | DOUT << "Derived new type: " << *AT << "\n"; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1149 | #endif |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1150 | return AT; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1151 | } |
| 1152 | |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1153 | |
| 1154 | //===----------------------------------------------------------------------===// |
Reid Spencer | a85210a | 2007-02-15 03:11:50 +0000 | [diff] [blame] | 1155 | // Vector Type Factory... |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1156 | // |
| 1157 | namespace llvm { |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1158 | class VectorValType { |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1159 | const Type *ValTy; |
| 1160 | unsigned Size; |
| 1161 | public: |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1162 | VectorValType(const Type *val, int sz) : ValTy(val), Size(sz) {} |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1163 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1164 | static VectorValType get(const VectorType *PT) { |
| 1165 | return VectorValType(PT->getElementType(), PT->getNumElements()); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1166 | } |
| 1167 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1168 | static unsigned hashTypeStructure(const VectorType *PT) { |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1169 | return PT->getNumElements(); |
| 1170 | } |
| 1171 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1172 | inline bool operator<(const VectorValType &MTV) const { |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1173 | if (Size < MTV.Size) return true; |
| 1174 | return Size == MTV.Size && ValTy < MTV.ValTy; |
| 1175 | } |
| 1176 | }; |
| 1177 | } |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1178 | static ManagedStatic<TypeMap<VectorValType, VectorType> > VectorTypes; |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1179 | |
| 1180 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1181 | VectorType *VectorType::get(const Type *ElementType, unsigned NumElements) { |
Dan Gohman | fa73ea2 | 2007-05-24 14:36:04 +0000 | [diff] [blame] | 1182 | assert(ElementType && "Can't get vector of null types!"); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1183 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1184 | VectorValType PVT(ElementType, NumElements); |
| 1185 | VectorType *PT = VectorTypes->get(PVT); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1186 | if (PT) return PT; // Found a match, return it! |
| 1187 | |
| 1188 | // Value not found. Derive a new type! |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1189 | VectorTypes->add(PVT, PT = new VectorType(ElementType, NumElements)); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1190 | |
| 1191 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1192 | DOUT << "Derived new type: " << *PT << "\n"; |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1193 | #endif |
| 1194 | return PT; |
| 1195 | } |
| 1196 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1197 | //===----------------------------------------------------------------------===// |
| 1198 | // Struct Type Factory... |
| 1199 | // |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1200 | |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1201 | namespace llvm { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1202 | // StructValType - Define a class to hold the key that goes into the TypeMap |
| 1203 | // |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1204 | class StructValType { |
| 1205 | std::vector<const Type*> ElTypes; |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 1206 | bool packed; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1207 | public: |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 1208 | StructValType(const std::vector<const Type*> &args, bool isPacked) |
| 1209 | : ElTypes(args), packed(isPacked) {} |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1210 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1211 | static StructValType get(const StructType *ST) { |
| 1212 | std::vector<const Type *> ElTypes; |
Chris Lattner | d21cd80 | 2004-02-09 04:37:31 +0000 | [diff] [blame] | 1213 | ElTypes.reserve(ST->getNumElements()); |
| 1214 | for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i) |
| 1215 | ElTypes.push_back(ST->getElementType(i)); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1216 | |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 1217 | return StructValType(ElTypes, ST->isPacked()); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1218 | } |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1219 | |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1220 | static unsigned hashTypeStructure(const StructType *ST) { |
Chris Lattner | 0cdaf94 | 2004-02-09 18:32:40 +0000 | [diff] [blame] | 1221 | return ST->getNumElements(); |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1222 | } |
| 1223 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1224 | inline bool operator<(const StructValType &STV) const { |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 1225 | if (ElTypes < STV.ElTypes) return true; |
| 1226 | else if (ElTypes > STV.ElTypes) return false; |
| 1227 | else return (int)packed < (int)STV.packed; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1228 | } |
| 1229 | }; |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1230 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1231 | |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1232 | static ManagedStatic<TypeMap<StructValType, StructType> > StructTypes; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1233 | |
Andrew Lenharth | 38ecbf1 | 2006-12-08 18:06:16 +0000 | [diff] [blame] | 1234 | StructType *StructType::get(const std::vector<const Type*> &ETypes, |
| 1235 | bool isPacked) { |
| 1236 | StructValType STV(ETypes, isPacked); |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1237 | StructType *ST = StructTypes->get(STV); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1238 | if (ST) return ST; |
| 1239 | |
| 1240 | // Value not found. Derive a new type! |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 1241 | ST = (StructType*) new char[sizeof(StructType) + |
| 1242 | sizeof(PATypeHandle) * ETypes.size()]; |
| 1243 | new (ST) StructType(ETypes, isPacked); |
| 1244 | StructTypes->add(STV, ST); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1245 | |
| 1246 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1247 | DOUT << "Derived new type: " << *ST << "\n"; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1248 | #endif |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1249 | return ST; |
| 1250 | } |
| 1251 | |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1252 | |
| 1253 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1254 | //===----------------------------------------------------------------------===// |
| 1255 | // Pointer Type Factory... |
| 1256 | // |
| 1257 | |
| 1258 | // PointerValType - Define a class to hold the key that goes into the TypeMap |
| 1259 | // |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1260 | namespace llvm { |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1261 | class PointerValType { |
| 1262 | const Type *ValTy; |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1263 | unsigned AddressSpace; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1264 | public: |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1265 | PointerValType(const Type *val, unsigned as) : ValTy(val), AddressSpace(as) {} |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1266 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1267 | static PointerValType get(const PointerType *PT) { |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1268 | return PointerValType(PT->getElementType(), PT->getAddressSpace()); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1269 | } |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1270 | |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1271 | static unsigned hashTypeStructure(const PointerType *PT) { |
Chris Lattner | 3787c95 | 2005-11-16 06:09:47 +0000 | [diff] [blame] | 1272 | return getSubElementHash(PT); |
Chris Lattner | 2729540 | 2004-02-09 16:35:14 +0000 | [diff] [blame] | 1273 | } |
| 1274 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1275 | bool operator<(const PointerValType &MTV) const { |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1276 | if (AddressSpace < MTV.AddressSpace) return true; |
| 1277 | return AddressSpace == MTV.AddressSpace && ValTy < MTV.ValTy; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1278 | } |
| 1279 | }; |
Chris Lattner | f2586d1 | 2003-11-19 06:14:38 +0000 | [diff] [blame] | 1280 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1281 | |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1282 | static ManagedStatic<TypeMap<PointerValType, PointerType> > PointerTypes; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1283 | |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1284 | PointerType *PointerType::get(const Type *ValueType, unsigned AddressSpace) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1285 | assert(ValueType && "Can't get a pointer to <null> type!"); |
Chris Lattner | a5d824e | 2006-04-21 15:33:35 +0000 | [diff] [blame] | 1286 | assert(ValueType != Type::VoidTy && |
| 1287 | "Pointer to void is not valid, use sbyte* instead!"); |
Chris Lattner | f531040 | 2006-10-15 23:21:12 +0000 | [diff] [blame] | 1288 | assert(ValueType != Type::LabelTy && "Pointer to label is not valid!"); |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1289 | PointerValType PVT(ValueType, AddressSpace); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1290 | |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1291 | PointerType *PT = PointerTypes->get(PVT); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1292 | if (PT) return PT; |
| 1293 | |
| 1294 | // Value not found. Derive a new type! |
Christopher Lamb | fe63fb9 | 2007-12-11 08:59:05 +0000 | [diff] [blame] | 1295 | PointerTypes->add(PVT, PT = new PointerType(ValueType, AddressSpace)); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1296 | |
| 1297 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1298 | DOUT << "Derived new type: " << *PT << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1299 | #endif |
| 1300 | return PT; |
| 1301 | } |
| 1302 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1303 | //===----------------------------------------------------------------------===// |
| 1304 | // Derived Type Refinement Functions |
| 1305 | //===----------------------------------------------------------------------===// |
| 1306 | |
| 1307 | // removeAbstractTypeUser - Notify an abstract type that a user of the class |
| 1308 | // no longer has a handle to the type. This function is called primarily by |
| 1309 | // the PATypeHandle class. When there are no users of the abstract type, it |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 1310 | // is annihilated, because there is no way to get a reference to it ever again. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1311 | // |
Chris Lattner | cfe8227 | 2005-11-13 03:14:09 +0000 | [diff] [blame] | 1312 | void Type::removeAbstractTypeUser(AbstractTypeUser *U) const { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1313 | // Search from back to front because we will notify users from back to |
| 1314 | // front. Also, it is likely that there will be a stack like behavior to |
| 1315 | // users that register and unregister users. |
| 1316 | // |
Chris Lattner | 3f59b7e | 2002-04-05 19:44:07 +0000 | [diff] [blame] | 1317 | unsigned i; |
| 1318 | for (i = AbstractTypeUsers.size(); AbstractTypeUsers[i-1] != U; --i) |
| 1319 | assert(i != 0 && "AbstractTypeUser not in user list!"); |
| 1320 | |
| 1321 | --i; // Convert to be in range 0 <= i < size() |
| 1322 | assert(i < AbstractTypeUsers.size() && "Index out of range!"); // Wraparound? |
| 1323 | |
| 1324 | AbstractTypeUsers.erase(AbstractTypeUsers.begin()+i); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1325 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1326 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1327 | DOUT << " remAbstractTypeUser[" << (void*)this << ", " |
| 1328 | << *this << "][" << i << "] User = " << U << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1329 | #endif |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1330 | |
Chris Lattner | ac89164 | 2004-02-17 03:03:47 +0000 | [diff] [blame] | 1331 | if (AbstractTypeUsers.empty() && getRefCount() == 0 && isAbstract()) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1332 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1333 | DOUT << "DELETEing unused abstract type: <" << *this |
| 1334 | << ">[" << (void*)this << "]" << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1335 | #endif |
Reid Spencer | 5a1ebb3 | 2007-04-06 02:02:20 +0000 | [diff] [blame] | 1336 | this->destroy(); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1337 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1338 | } |
| 1339 | |
Reid Spencer | fd20c0a | 2006-05-29 02:34:34 +0000 | [diff] [blame] | 1340 | // refineAbstractTypeTo - This function is used when it is discovered that |
Chris Lattner | af6f93c | 2003-10-03 18:57:54 +0000 | [diff] [blame] | 1341 | // the 'this' abstract type is actually equivalent to the NewType specified. |
| 1342 | // This causes all users of 'this' to switch to reference the more concrete type |
| 1343 | // NewType and for 'this' to be deleted. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1344 | // |
Chris Lattner | af6f93c | 2003-10-03 18:57:54 +0000 | [diff] [blame] | 1345 | void DerivedType::refineAbstractTypeTo(const Type *NewType) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1346 | assert(isAbstract() && "refineAbstractTypeTo: Current type is not abstract!"); |
| 1347 | assert(this != NewType && "Can't refine to myself!"); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1348 | assert(ForwardType == 0 && "This type has already been refined!"); |
| 1349 | |
Chris Lattner | dd4b421 | 2003-09-02 16:35:17 +0000 | [diff] [blame] | 1350 | // The descriptions may be out of date. Conservatively clear them all! |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1351 | AbstractTypeDescriptions->clear(); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1352 | |
| 1353 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1354 | DOUT << "REFINING abstract type [" << (void*)this << " " |
| 1355 | << *this << "] to [" << (void*)NewType << " " |
| 1356 | << *NewType << "]!\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1357 | #endif |
| 1358 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1359 | // Make sure to put the type to be refined to into a holder so that if IT gets |
| 1360 | // refined, that we will not continue using a dead reference... |
| 1361 | // |
Chris Lattner | aa06d2c | 2002-04-04 19:26:02 +0000 | [diff] [blame] | 1362 | PATypeHolder NewTy(NewType); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1363 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1364 | // Any PATypeHolders referring to this type will now automatically forward to |
| 1365 | // the type we are resolved to. |
Chris Lattner | 1c5164e | 2003-10-02 23:35:57 +0000 | [diff] [blame] | 1366 | ForwardType = NewType; |
| 1367 | if (NewType->isAbstract()) |
| 1368 | cast<DerivedType>(NewType)->addRef(); |
| 1369 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1370 | // Add a self use of the current type so that we don't delete ourself until |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1371 | // after the function exits. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1372 | // |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1373 | PATypeHolder CurrentTy(this); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1374 | |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1375 | // To make the situation simpler, we ask the subclass to remove this type from |
| 1376 | // the type map, and to replace any type uses with uses of non-abstract types. |
| 1377 | // This dramatically limits the amount of recursive type trouble we can find |
| 1378 | // ourselves in. |
Chris Lattner | af6f93c | 2003-10-03 18:57:54 +0000 | [diff] [blame] | 1379 | dropAllTypeUses(); |
Chris Lattner | 169726b | 2003-09-05 02:21:39 +0000 | [diff] [blame] | 1380 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1381 | // Iterate over all of the uses of this type, invoking callback. Each user |
Chris Lattner | 3f59b7e | 2002-04-05 19:44:07 +0000 | [diff] [blame] | 1382 | // should remove itself from our use list automatically. We have to check to |
| 1383 | // make sure that NewTy doesn't _become_ 'this'. If it does, resolving types |
| 1384 | // will not cause users to drop off of the use list. If we resolve to ourself |
| 1385 | // we succeed! |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1386 | // |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1387 | while (!AbstractTypeUsers.empty() && NewTy != this) { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1388 | AbstractTypeUser *User = AbstractTypeUsers.back(); |
| 1389 | |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1390 | unsigned OldSize = AbstractTypeUsers.size(); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1391 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1392 | DOUT << " REFINING user " << OldSize-1 << "[" << (void*)User |
| 1393 | << "] of abstract type [" << (void*)this << " " |
| 1394 | << *this << "] to [" << (void*)NewTy.get() << " " |
| 1395 | << *NewTy << "]!\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1396 | #endif |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1397 | User->refineAbstractType(this, NewTy); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1398 | |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1399 | assert(AbstractTypeUsers.size() != OldSize && |
| 1400 | "AbsTyUser did not remove self from user list!"); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1401 | } |
| 1402 | |
Chris Lattner | 8ef852f | 2003-10-03 04:48:21 +0000 | [diff] [blame] | 1403 | // If we were successful removing all users from the type, 'this' will be |
| 1404 | // deleted when the last PATypeHolder is destroyed or updated from this type. |
| 1405 | // This may occur on exit of this function, as the CurrentTy object is |
| 1406 | // destroyed. |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1407 | } |
| 1408 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1409 | // notifyUsesThatTypeBecameConcrete - Notify AbstractTypeUsers of this type that |
| 1410 | // the current type has transitioned from being abstract to being concrete. |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1411 | // |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1412 | void DerivedType::notifyUsesThatTypeBecameConcrete() { |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1413 | #ifdef DEBUG_MERGE_TYPES |
Bill Wendling | 2e3def1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 1414 | DOUT << "typeIsREFINED type: " << (void*)this << " " << *this << "\n"; |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1415 | #endif |
Chris Lattner | 417081c | 2002-04-07 06:14:56 +0000 | [diff] [blame] | 1416 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1417 | unsigned OldSize = AbstractTypeUsers.size(); |
| 1418 | while (!AbstractTypeUsers.empty()) { |
| 1419 | AbstractTypeUser *ATU = AbstractTypeUsers.back(); |
| 1420 | ATU->typeBecameConcrete(this); |
Chris Lattner | 417081c | 2002-04-07 06:14:56 +0000 | [diff] [blame] | 1421 | |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1422 | assert(AbstractTypeUsers.size() < OldSize-- && |
| 1423 | "AbstractTypeUser did not remove itself from the use list!"); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1424 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1425 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1426 | |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1427 | // refineAbstractType - Called when a contained type is found to be more |
| 1428 | // concrete - this could potentially change us from an abstract type to a |
| 1429 | // concrete type. |
| 1430 | // |
Chris Lattner | 6bfd6a5 | 2002-03-29 03:44:36 +0000 | [diff] [blame] | 1431 | void FunctionType::refineAbstractType(const DerivedType *OldType, |
| 1432 | const Type *NewType) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1433 | FunctionTypes->RefineAbstractType(this, OldType, NewType); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1434 | } |
| 1435 | |
| 1436 | void FunctionType::typeBecameConcrete(const DerivedType *AbsTy) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1437 | FunctionTypes->TypeBecameConcrete(this, AbsTy); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1438 | } |
| 1439 | |
| 1440 | |
| 1441 | // refineAbstractType - Called when a contained type is found to be more |
| 1442 | // concrete - this could potentially change us from an abstract type to a |
| 1443 | // concrete type. |
| 1444 | // |
| 1445 | void ArrayType::refineAbstractType(const DerivedType *OldType, |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 1446 | const Type *NewType) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1447 | ArrayTypes->RefineAbstractType(this, OldType, NewType); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1448 | } |
| 1449 | |
| 1450 | void ArrayType::typeBecameConcrete(const DerivedType *AbsTy) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1451 | ArrayTypes->TypeBecameConcrete(this, AbsTy); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1452 | } |
| 1453 | |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1454 | // refineAbstractType - Called when a contained type is found to be more |
| 1455 | // concrete - this could potentially change us from an abstract type to a |
| 1456 | // concrete type. |
| 1457 | // |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1458 | void VectorType::refineAbstractType(const DerivedType *OldType, |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1459 | const Type *NewType) { |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1460 | VectorTypes->RefineAbstractType(this, OldType, NewType); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1461 | } |
| 1462 | |
Reid Spencer | 9d6565a | 2007-02-15 02:26:10 +0000 | [diff] [blame] | 1463 | void VectorType::typeBecameConcrete(const DerivedType *AbsTy) { |
| 1464 | VectorTypes->TypeBecameConcrete(this, AbsTy); |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 1465 | } |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1466 | |
| 1467 | // refineAbstractType - Called when a contained type is found to be more |
| 1468 | // concrete - this could potentially change us from an abstract type to a |
| 1469 | // concrete type. |
| 1470 | // |
| 1471 | void StructType::refineAbstractType(const DerivedType *OldType, |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 1472 | const Type *NewType) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1473 | StructTypes->RefineAbstractType(this, OldType, NewType); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1474 | } |
| 1475 | |
| 1476 | void StructType::typeBecameConcrete(const DerivedType *AbsTy) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1477 | StructTypes->TypeBecameConcrete(this, AbsTy); |
Chris Lattner | c038a2f | 2001-09-07 16:56:42 +0000 | [diff] [blame] | 1478 | } |
| 1479 | |
| 1480 | // refineAbstractType - Called when a contained type is found to be more |
| 1481 | // concrete - this could potentially change us from an abstract type to a |
| 1482 | // concrete type. |
| 1483 | // |
| 1484 | void PointerType::refineAbstractType(const DerivedType *OldType, |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 1485 | const Type *NewType) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1486 | PointerTypes->RefineAbstractType(this, OldType, NewType); |
Chris Lattner | 7685ac8 | 2003-10-03 18:46:24 +0000 | [diff] [blame] | 1487 | } |
| 1488 | |
| 1489 | void PointerType::typeBecameConcrete(const DerivedType *AbsTy) { |
Chris Lattner | de65fb3 | 2006-09-28 23:38:07 +0000 | [diff] [blame] | 1490 | PointerTypes->TypeBecameConcrete(this, AbsTy); |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1491 | } |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 1492 | |
| 1493 | bool SequentialType::indexValid(const Value *V) const { |
Reid Spencer | a54b7cb | 2007-01-12 07:05:14 +0000 | [diff] [blame] | 1494 | if (const IntegerType *IT = dyn_cast<IntegerType>(V->getType())) |
| 1495 | return IT->getBitWidth() == 32 || IT->getBitWidth() == 64; |
| 1496 | return false; |
Reid Spencer | 6e885d0 | 2004-07-04 12:14:17 +0000 | [diff] [blame] | 1497 | } |
| 1498 | |
| 1499 | namespace llvm { |
| 1500 | std::ostream &operator<<(std::ostream &OS, const Type *T) { |
| 1501 | if (T == 0) |
| 1502 | OS << "<null> value!\n"; |
| 1503 | else |
| 1504 | T->print(OS); |
| 1505 | return OS; |
| 1506 | } |
| 1507 | |
| 1508 | std::ostream &operator<<(std::ostream &OS, const Type &T) { |
| 1509 | T.print(OS); |
| 1510 | return OS; |
| 1511 | } |
| 1512 | } |