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