2003-09-05 02:21:39 +00:00
|
|
|
//===-- Type.cpp - Implement the Type class -------------------------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
// This file implements the Type class for the VMCore library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-08-04 23:33:01 +00:00
|
|
|
#include "LLVMContextImpl.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-04-28 19:55:58 +00:00
|
|
|
#include "llvm/Constants.h"
|
2009-02-28 23:01:57 +00:00
|
|
|
#include "llvm/Assembly/Writer.h"
|
2009-08-04 23:33:01 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
|
|
|
#include "llvm/Metadata.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/DepthFirstIterator.h"
|
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2004-10-07 19:20:48 +00:00
|
|
|
#include "llvm/ADT/SCCIterator.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2006-08-27 12:54:02 +00:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2006-12-08 18:06:16 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-08 18:01:40 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2009-02-28 23:01:57 +00:00
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
|
|
|
#include "llvm/Support/MathExtras.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-06-18 16:54:52 +00:00
|
|
|
#include "llvm/System/Threading.h"
|
2002-04-07 06:14:56 +00:00
|
|
|
#include <algorithm>
|
2008-03-19 05:06:05 +00:00
|
|
|
#include <cstdarg>
|
2003-11-19 06:14:38 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// DEBUG_MERGE_TYPES - Enable this #define to see how and when derived types are
|
|
|
|
// created and later destroyed, all in an effort to make sure that there is only
|
2003-09-10 05:29:43 +00:00
|
|
|
// a single canonical version of a type.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2006-12-08 18:06:16 +00:00
|
|
|
// #define DEBUG_MERGE_TYPES 1
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2004-02-26 07:24:18 +00:00
|
|
|
AbstractTypeUser::~AbstractTypeUser() {}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2009-09-15 15:58:07 +00:00
|
|
|
void AbstractTypeUser::setType(Value *V, const Type *NewTy) {
|
|
|
|
V->VTy = NewTy;
|
|
|
|
}
|
2006-07-25 23:22:00 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Type Class Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-04-06 02:02:20 +00:00
|
|
|
/// Because of the way Type subclasses are allocated, this function is necessary
|
|
|
|
/// to use the correct kind of "delete" operator to deallocate the Type object.
|
|
|
|
/// Some type objects (FunctionTy, StructTy) allocate additional space after
|
|
|
|
/// the space for their derived type to hold the contained types array of
|
|
|
|
/// PATypeHandles. Using this allocation scheme means all the PATypeHandles are
|
|
|
|
/// allocated with the type object, decreasing allocations and eliminating the
|
|
|
|
/// need for a std::vector to be used in the Type class itself.
|
|
|
|
/// @brief Type destruction function
|
|
|
|
void Type::destroy() const {
|
|
|
|
|
|
|
|
// Structures and Functions allocate their contained types past the end of
|
|
|
|
// the type object itself. These need to be destroyed differently than the
|
|
|
|
// other types.
|
|
|
|
if (isa<FunctionType>(this) || isa<StructType>(this)) {
|
|
|
|
// First, make sure we destruct any PATypeHandles allocated by these
|
|
|
|
// subclasses. They must be manually destructed.
|
|
|
|
for (unsigned i = 0; i < NumContainedTys; ++i)
|
|
|
|
ContainedTys[i].PATypeHandle::~PATypeHandle();
|
|
|
|
|
|
|
|
// Now call the destructor for the subclass directly because we're going
|
|
|
|
// to delete this as an array of char.
|
|
|
|
if (isa<FunctionType>(this))
|
2008-08-05 14:45:15 +00:00
|
|
|
static_cast<const FunctionType*>(this)->FunctionType::~FunctionType();
|
2007-04-06 02:02:20 +00:00
|
|
|
else
|
2008-08-05 14:45:15 +00:00
|
|
|
static_cast<const StructType*>(this)->StructType::~StructType();
|
2007-04-06 02:02:20 +00:00
|
|
|
|
|
|
|
// Finally, remove the memory as an array deallocation of the chars it was
|
|
|
|
// constructed from.
|
2008-07-03 00:53:09 +00:00
|
|
|
operator delete(const_cast<Type *>(this));
|
2007-04-06 02:02:20 +00:00
|
|
|
|
|
|
|
return;
|
2009-12-17 19:55:06 +00:00
|
|
|
} else if (const OpaqueType *opaque_this = dyn_cast<OpaqueType>(this)) {
|
|
|
|
LLVMContextImpl *pImpl = this->getContext().pImpl;
|
|
|
|
pImpl->OpaqueTypes.erase(opaque_this);
|
2007-04-06 02:02:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// For all the other type subclasses, there is either no contained types or
|
|
|
|
// just one (all Sequentials). For Sequentials, the PATypeHandle is not
|
|
|
|
// allocated past the type object, its included directly in the SequentialType
|
|
|
|
// class. This means we can safely just do "normal" delete of this object and
|
|
|
|
// all the destructors that need to run will be run.
|
|
|
|
delete this;
|
|
|
|
}
|
2005-11-13 03:14:09 +00:00
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
const Type *Type::getPrimitiveType(LLVMContext &C, TypeID IDNumber) {
|
2001-06-06 20:29:01 +00:00
|
|
|
switch (IDNumber) {
|
2009-08-13 21:58:54 +00:00
|
|
|
case VoidTyID : return getVoidTy(C);
|
|
|
|
case FloatTyID : return getFloatTy(C);
|
|
|
|
case DoubleTyID : return getDoubleTy(C);
|
|
|
|
case X86_FP80TyID : return getX86_FP80Ty(C);
|
|
|
|
case FP128TyID : return getFP128Ty(C);
|
|
|
|
case PPC_FP128TyID : return getPPC_FP128Ty(C);
|
|
|
|
case LabelTyID : return getLabelTy(C);
|
|
|
|
case MetadataTyID : return getMetadataTy(C);
|
2001-06-06 20:29:01 +00:00
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
const Type *Type::getVAArgsPromotedType(LLVMContext &C) const {
|
2007-01-19 21:13:56 +00:00
|
|
|
if (ID == IntegerTyID && getSubclassData() < 32)
|
2009-08-13 21:58:54 +00:00
|
|
|
return Type::getInt32Ty(C);
|
2007-01-19 21:13:56 +00:00
|
|
|
else if (ID == FloatTyID)
|
2009-08-13 21:58:54 +00:00
|
|
|
return Type::getDoubleTy(C);
|
2007-01-19 21:13:56 +00:00
|
|
|
else
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
2009-06-15 22:12:54 +00:00
|
|
|
/// getScalarType - If this is a vector type, return the element type,
|
|
|
|
/// otherwise return this.
|
|
|
|
const Type *Type::getScalarType() const {
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(this))
|
|
|
|
return VTy->getElementType();
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
2010-01-05 20:04:48 +00:00
|
|
|
/// isInteger - Return true if this is an IntegerType of the specified width.
|
|
|
|
bool Type::isInteger(unsigned Bitwidth) const {
|
|
|
|
return isInteger() && cast<IntegerType>(this)->getBitWidth() == Bitwidth;
|
|
|
|
}
|
|
|
|
|
2007-08-20 19:25:59 +00:00
|
|
|
/// isIntOrIntVector - Return true if this is an integer type or a vector of
|
|
|
|
/// integer types.
|
|
|
|
///
|
|
|
|
bool Type::isIntOrIntVector() const {
|
|
|
|
if (isInteger())
|
|
|
|
return true;
|
|
|
|
if (ID != Type::VectorTyID) return false;
|
|
|
|
|
|
|
|
return cast<VectorType>(this)->getElementType()->isInteger();
|
|
|
|
}
|
|
|
|
|
2006-10-26 18:22:45 +00:00
|
|
|
/// isFPOrFPVector - Return true if this is a FP type or a vector of FP types.
|
|
|
|
///
|
|
|
|
bool Type::isFPOrFPVector() const {
|
2007-08-03 01:03:46 +00:00
|
|
|
if (ID == Type::FloatTyID || ID == Type::DoubleTyID ||
|
|
|
|
ID == Type::FP128TyID || ID == Type::X86_FP80TyID ||
|
|
|
|
ID == Type::PPC_FP128TyID)
|
|
|
|
return true;
|
2007-02-15 02:26:10 +00:00
|
|
|
if (ID != Type::VectorTyID) return false;
|
2006-10-26 18:22:45 +00:00
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
return cast<VectorType>(this)->getElementType()->isFloatingPoint();
|
2006-10-26 18:22:45 +00:00
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
// canLosslesslyBitCastTo - Return true if this type can be converted to
|
|
|
|
// 'Ty' without any reinterpretation of bits. For example, i8* to i32*.
|
2001-11-26 17:01:47 +00:00
|
|
|
//
|
2006-11-27 01:05:10 +00:00
|
|
|
bool Type::canLosslesslyBitCastTo(const Type *Ty) const {
|
|
|
|
// Identity cast means no change so return true
|
|
|
|
if (this == Ty)
|
2006-04-02 05:40:28 +00:00
|
|
|
return true;
|
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
// They are not convertible unless they are at least first class types
|
|
|
|
if (!this->isFirstClassType() || !Ty->isFirstClassType())
|
|
|
|
return false;
|
|
|
|
|
2007-02-15 03:39:18 +00:00
|
|
|
// Vector -> Vector conversions are always lossless if the two vector types
|
2006-11-27 01:05:10 +00:00
|
|
|
// have the same size, otherwise not.
|
2007-02-15 02:26:10 +00:00
|
|
|
if (const VectorType *thisPTy = dyn_cast<VectorType>(this))
|
|
|
|
if (const VectorType *thatPTy = dyn_cast<VectorType>(Ty))
|
2006-11-27 01:05:10 +00:00
|
|
|
return thisPTy->getBitWidth() == thatPTy->getBitWidth();
|
|
|
|
|
|
|
|
// At this point we have only various mismatches of the first class types
|
|
|
|
// remaining and ptr->ptr. Just select the lossless conversions. Everything
|
|
|
|
// else is not lossless.
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
if (isa<PointerType>(this))
|
2006-12-31 05:25:34 +00:00
|
|
|
return isa<PointerType>(Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
return false; // Other types have no identity values
|
2001-11-26 17:01:47 +00:00
|
|
|
}
|
|
|
|
|
2005-04-23 22:00:09 +00:00
|
|
|
unsigned Type::getPrimitiveSizeInBits() const {
|
|
|
|
switch (getTypeID()) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
case Type::FloatTyID: return 32;
|
2005-04-23 22:01:39 +00:00
|
|
|
case Type::DoubleTyID: return 64;
|
2007-08-03 01:03:46 +00:00
|
|
|
case Type::X86_FP80TyID: return 80;
|
|
|
|
case Type::FP128TyID: return 128;
|
|
|
|
case Type::PPC_FP128TyID: return 128;
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
case Type::IntegerTyID: return cast<IntegerType>(this)->getBitWidth();
|
2007-02-15 02:26:10 +00:00
|
|
|
case Type::VectorTyID: return cast<VectorType>(this)->getBitWidth();
|
2002-05-06 16:14:39 +00:00
|
|
|
default: return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-15 22:12:54 +00:00
|
|
|
/// getScalarSizeInBits - If this is a vector type, return the
|
|
|
|
/// getPrimitiveSizeInBits value for the element type. Otherwise return the
|
|
|
|
/// getPrimitiveSizeInBits value for this type.
|
|
|
|
unsigned Type::getScalarSizeInBits() const {
|
|
|
|
return getScalarType()->getPrimitiveSizeInBits();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getFPMantissaWidth - Return the width of the mantissa of this type. This
|
|
|
|
/// is only valid on floating point types. If the FP type does not
|
|
|
|
/// have a stable mantissa (e.g. ppc long double), this method returns -1.
|
|
|
|
int Type::getFPMantissaWidth() const {
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(this))
|
|
|
|
return VTy->getElementType()->getFPMantissaWidth();
|
|
|
|
assert(isFloatingPoint() && "Not a floating point type!");
|
|
|
|
if (ID == FloatTyID) return 24;
|
|
|
|
if (ID == DoubleTyID) return 53;
|
|
|
|
if (ID == X86_FP80TyID) return 64;
|
|
|
|
if (ID == FP128TyID) return 113;
|
|
|
|
assert(ID == PPC_FP128TyID && "unknown fp type");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-07-02 23:20:17 +00:00
|
|
|
/// isSizedDerivedType - Derived types like structures and arrays are sized
|
|
|
|
/// iff all of the members of the type are sized as well. Since asking for
|
|
|
|
/// their size is relatively uncommon, move this operation out of line.
|
|
|
|
bool Type::isSizedDerivedType() const {
|
2007-01-26 07:51:36 +00:00
|
|
|
if (isa<IntegerType>(this))
|
|
|
|
return true;
|
|
|
|
|
2004-07-02 23:20:17 +00:00
|
|
|
if (const ArrayType *ATy = dyn_cast<ArrayType>(this))
|
|
|
|
return ATy->getElementType()->isSized();
|
2004-12-01 17:12:16 +00:00
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
if (const VectorType *PTy = dyn_cast<VectorType>(this))
|
2004-12-01 17:12:16 +00:00
|
|
|
return PTy->getElementType()->isSized();
|
2004-07-02 23:20:17 +00:00
|
|
|
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
if (!isa<StructType>(this))
|
|
|
|
return false;
|
2004-07-02 23:20:17 +00:00
|
|
|
|
|
|
|
// Okay, our struct is sized if all of the elements are...
|
|
|
|
for (subtype_iterator I = subtype_begin(), E = subtype_end(); I != E; ++I)
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
if (!(*I)->isSized())
|
|
|
|
return false;
|
2004-07-02 23:20:17 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
2001-11-26 17:01:47 +00:00
|
|
|
|
2003-10-02 23:35:57 +00:00
|
|
|
/// getForwardedTypeInternal - This method is used to implement the union-find
|
|
|
|
/// algorithm for when a type is being forwarded to another type.
|
|
|
|
const Type *Type::getForwardedTypeInternal() const {
|
|
|
|
assert(ForwardType && "This type is not being forwarded to another type!");
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-10-02 23:35:57 +00:00
|
|
|
// Check to see if the forwarded type has been forwarded on. If so, collapse
|
|
|
|
// the forwarding links.
|
|
|
|
const Type *RealForwardedType = ForwardType->getForwardedType();
|
|
|
|
if (!RealForwardedType)
|
|
|
|
return ForwardType; // No it's not forwarded again
|
|
|
|
|
|
|
|
// Yes, it is forwarded again. First thing, add the reference to the new
|
|
|
|
// forward type.
|
|
|
|
if (RealForwardedType->isAbstract())
|
|
|
|
cast<DerivedType>(RealForwardedType)->addRef();
|
|
|
|
|
|
|
|
// Now drop the old reference. This could cause ForwardType to get deleted.
|
|
|
|
cast<DerivedType>(ForwardType)->dropRef();
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-10-02 23:35:57 +00:00
|
|
|
// Return the updated type.
|
|
|
|
ForwardType = RealForwardedType;
|
|
|
|
return ForwardType;
|
|
|
|
}
|
|
|
|
|
2005-11-13 03:26:33 +00:00
|
|
|
void Type::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Attempting to refine a derived type!");
|
2005-11-13 03:26:33 +00:00
|
|
|
}
|
|
|
|
void Type::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("DerivedType is already a concrete type!");
|
2005-11-13 03:26:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-02-28 23:01:57 +00:00
|
|
|
std::string Type::getDescription() const {
|
2009-08-17 17:59:35 +00:00
|
|
|
LLVMContextImpl *pImpl = getContext().pImpl;
|
2009-02-28 23:01:57 +00:00
|
|
|
TypePrinting &Map =
|
2009-08-17 17:59:35 +00:00
|
|
|
isAbstract() ?
|
|
|
|
pImpl->AbstractTypeDescriptions :
|
|
|
|
pImpl->ConcreteTypeDescriptions;
|
2009-02-28 23:01:57 +00:00
|
|
|
|
|
|
|
std::string DescStr;
|
|
|
|
raw_string_ostream DescOS(DescStr);
|
|
|
|
Map.print(this, DescOS);
|
|
|
|
return DescOS.str();
|
Change the code to no longer compute the "type description" immediately when
the type is analyzed. Instead, only compute it when requested (with
getDescription), and cached for reuse later.
This dramatically speeds up LLVM in general because these descriptions almost
_never_ need to be constructed. The only time they are used is when a type is
<<'d. Printing of modules by themselves uses other code to print symbolic
types when possible, so these descriptions are really only used for debugging.
Also, this fixes the particularly bad case when lots of types get resolved to
each other, such as during linking of large programs. In these cases, the type
descriptions would be repeatedly recomputed and discarded even though: A. noone
reads the description before it gets resolved, and B. many many resolutions
happen at intermediate steps, causing a HUGE waste of time.
Overall, this makes the getTypeDesc function much more light-weight, and fixes
bug: Assembler/2002-07-08-HugePerformanceProblem.llx, which went from taking
1048.770u/19.150s (which is 17.5 MINUTES, on apoc), to taking 0.020u/0.000s,
which is a nice little speedup. :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8320 91177308-0d34-0410-b5e6-96231b3b80d8
2003-09-02 16:35:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-26 17:01:47 +00:00
|
|
|
bool StructType::indexValid(const Value *V) const {
|
2006-12-31 05:25:34 +00:00
|
|
|
// Structure indexes require 32-bit integer constants.
|
2010-01-05 20:07:06 +00:00
|
|
|
if (V->getType()->isInteger(32))
|
2006-10-20 07:07:24 +00:00
|
|
|
if (const ConstantInt *CU = dyn_cast<ConstantInt>(V))
|
2008-05-31 00:58:22 +00:00
|
|
|
return indexValid(CU->getZExtValue());
|
2003-11-25 21:21:46 +00:00
|
|
|
return false;
|
2001-11-26 17:01:47 +00:00
|
|
|
}
|
|
|
|
|
2008-05-31 00:58:22 +00:00
|
|
|
bool StructType::indexValid(unsigned V) const {
|
|
|
|
return V < NumContainedTys;
|
|
|
|
}
|
|
|
|
|
2001-11-26 17:01:47 +00:00
|
|
|
// getTypeAtIndex - Given an index value into the type, return the type of the
|
|
|
|
// element. For a structure type, this must be a constant value...
|
|
|
|
//
|
|
|
|
const Type *StructType::getTypeAtIndex(const Value *V) const {
|
2006-10-20 07:07:24 +00:00
|
|
|
unsigned Idx = (unsigned)cast<ConstantInt>(V)->getZExtValue();
|
2008-05-31 00:58:22 +00:00
|
|
|
return getTypeAtIndex(Idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
const Type *StructType::getTypeAtIndex(unsigned Idx) const {
|
|
|
|
assert(indexValid(Idx) && "Invalid structure index!");
|
2004-02-09 05:40:24 +00:00
|
|
|
return ContainedTys[Idx];
|
2001-11-26 17:01:47 +00:00
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-09-28 23:45:00 +00:00
|
|
|
// Primitive 'Type' data
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
const Type *Type::getVoidTy(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->VoidTy;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getLabelTy(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->LabelTy;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getFloatTy(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->FloatTy;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getDoubleTy(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->DoubleTy;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getMetadataTy(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->MetadataTy;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getX86_FP80Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->X86_FP80Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getFP128Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->FP128Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getPPC_FP128Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->PPC_FP128Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const IntegerType *Type::getInt1Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->Int1Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const IntegerType *Type::getInt8Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->Int8Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const IntegerType *Type::getInt16Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->Int16Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const IntegerType *Type::getInt32Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->Int32Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const IntegerType *Type::getInt64Ty(LLVMContext &C) {
|
2009-08-25 16:00:35 +00:00
|
|
|
return &C.pImpl->Int64Ty;
|
2009-08-13 21:58:54 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2009-10-06 15:40:36 +00:00
|
|
|
const PointerType *Type::getFloatPtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getFloatTy(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getDoublePtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getDoubleTy(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getX86_FP80PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getX86_FP80Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getFP128PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getFP128Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getPPC_FP128PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getPPC_FP128Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getInt1PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getInt1Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getInt8PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getInt8Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getInt16PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getInt16Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getInt32PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getInt32Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
|
|
|
const PointerType *Type::getInt64PtrTy(LLVMContext &C, unsigned AS) {
|
|
|
|
return getInt64Ty(C)->getPointerTo(AS);
|
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-09-07 16:56:42 +00:00
|
|
|
// Derived Type Constructors
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-04-23 05:36:34 +00:00
|
|
|
/// isValidReturnType - Return true if the specified type is valid as a return
|
|
|
|
/// type.
|
|
|
|
bool FunctionType::isValidReturnType(const Type *RetTy) {
|
2009-09-27 07:55:32 +00:00
|
|
|
return RetTy->getTypeID() != LabelTyID &&
|
|
|
|
RetTy->getTypeID() != MetadataTyID;
|
2008-04-23 05:36:34 +00:00
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
/// isValidArgumentType - Return true if the specified type is valid as an
|
|
|
|
/// argument type.
|
|
|
|
bool FunctionType::isValidArgumentType(const Type *ArgTy) {
|
2009-09-27 23:27:42 +00:00
|
|
|
return ArgTy->isFirstClassType() || isa<OpaqueType>(ArgTy);
|
2009-06-07 07:26:46 +00:00
|
|
|
}
|
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
FunctionType::FunctionType(const Type *Result,
|
2005-04-21 23:48:37 +00:00
|
|
|
const std::vector<const Type*> &Params,
|
2007-11-27 13:23:08 +00:00
|
|
|
bool IsVarArgs)
|
2009-08-13 23:27:32 +00:00
|
|
|
: DerivedType(Result->getContext(), FunctionTyID), isVarArgs(IsVarArgs) {
|
2007-04-06 02:02:20 +00:00
|
|
|
ContainedTys = reinterpret_cast<PATypeHandle*>(this+1);
|
|
|
|
NumContainedTys = Params.size() + 1; // + 1 for result type
|
2008-04-23 05:36:34 +00:00
|
|
|
assert(isValidReturnType(Result) && "invalid return type for function");
|
2009-05-25 21:28:11 +00:00
|
|
|
|
|
|
|
|
2003-09-03 14:44:53 +00:00
|
|
|
bool isAbstract = Result->isAbstract();
|
2007-04-06 02:02:20 +00:00
|
|
|
new (&ContainedTys[0]) PATypeHandle(Result, this);
|
2004-02-09 05:40:24 +00:00
|
|
|
|
|
|
|
for (unsigned i = 0; i != Params.size(); ++i) {
|
2009-06-07 07:26:46 +00:00
|
|
|
assert(isValidArgumentType(Params[i]) &&
|
|
|
|
"Not a valid type for function argument!");
|
2009-05-25 21:28:11 +00:00
|
|
|
new (&ContainedTys[i+1]) PATypeHandle(Params[i], this);
|
2003-09-03 14:44:53 +00:00
|
|
|
isAbstract |= Params[i]->isAbstract();
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-09-03 14:44:53 +00:00
|
|
|
// Calculate whether or not this type is abstract
|
|
|
|
setAbstract(isAbstract);
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2009-08-13 23:27:32 +00:00
|
|
|
StructType::StructType(LLVMContext &C,
|
|
|
|
const std::vector<const Type*> &Types, bool isPacked)
|
|
|
|
: CompositeType(C, StructTyID) {
|
2007-04-06 02:02:20 +00:00
|
|
|
ContainedTys = reinterpret_cast<PATypeHandle*>(this + 1);
|
|
|
|
NumContainedTys = Types.size();
|
2006-12-08 18:06:16 +00:00
|
|
|
setSubclassData(isPacked);
|
2003-09-03 14:44:53 +00:00
|
|
|
bool isAbstract = false;
|
2001-10-13 07:01:33 +00:00
|
|
|
for (unsigned i = 0; i < Types.size(); ++i) {
|
2009-05-25 21:28:11 +00:00
|
|
|
assert(Types[i] && "<null> type for structure field!");
|
2009-06-07 07:26:46 +00:00
|
|
|
assert(isValidElementType(Types[i]) &&
|
|
|
|
"Invalid type for structure element!");
|
2009-05-25 21:28:11 +00:00
|
|
|
new (&ContainedTys[i]) PATypeHandle(Types[i], this);
|
2003-09-03 14:44:53 +00:00
|
|
|
isAbstract |= Types[i]->isAbstract();
|
2001-10-13 07:01:33 +00:00
|
|
|
}
|
2003-09-03 14:44:53 +00:00
|
|
|
|
|
|
|
// Calculate whether or not this type is abstract
|
|
|
|
setAbstract(isAbstract);
|
2001-08-28 22:35:21 +00:00
|
|
|
}
|
|
|
|
|
2005-01-08 20:19:51 +00:00
|
|
|
ArrayType::ArrayType(const Type *ElType, uint64_t NumEl)
|
2001-12-14 16:41:56 +00:00
|
|
|
: SequentialType(ArrayTyID, ElType) {
|
|
|
|
NumElements = NumEl;
|
2003-09-03 14:44:53 +00:00
|
|
|
|
|
|
|
// Calculate whether or not this type is abstract
|
|
|
|
setAbstract(ElType->isAbstract());
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
VectorType::VectorType(const Type *ElType, unsigned NumEl)
|
|
|
|
: SequentialType(VectorTyID, ElType) {
|
2004-08-20 06:00:58 +00:00
|
|
|
NumElements = NumEl;
|
2007-02-10 19:03:01 +00:00
|
|
|
setAbstract(ElType->isAbstract());
|
2007-02-15 02:26:10 +00:00
|
|
|
assert(NumEl > 0 && "NumEl of a VectorType must be greater than 0");
|
2009-06-07 07:26:46 +00:00
|
|
|
assert(isValidElementType(ElType) &&
|
2007-02-15 02:26:10 +00:00
|
|
|
"Elements of a VectorType must be a primitive type");
|
2007-02-10 22:02:45 +00:00
|
|
|
|
2004-08-20 06:00:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-12-11 08:59:05 +00:00
|
|
|
PointerType::PointerType(const Type *E, unsigned AddrSpace)
|
|
|
|
: SequentialType(PointerTyID, E) {
|
|
|
|
AddressSpace = AddrSpace;
|
2003-09-03 14:44:53 +00:00
|
|
|
// Calculate whether or not this type is abstract
|
|
|
|
setAbstract(E->isAbstract());
|
2001-12-14 16:41:56 +00:00
|
|
|
}
|
|
|
|
|
2009-08-13 23:27:32 +00:00
|
|
|
OpaqueType::OpaqueType(LLVMContext &C) : DerivedType(C, OpaqueTyID) {
|
2001-09-07 16:56:42 +00:00
|
|
|
setAbstract(true);
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *this << "\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2009-04-07 17:23:02 +00:00
|
|
|
void PATypeHolder::destroy() {
|
|
|
|
Ty = 0;
|
|
|
|
}
|
|
|
|
|
2004-02-09 05:40:24 +00:00
|
|
|
// dropAllTypeUses - When this (abstract) type is resolved to be equal to
|
|
|
|
// another (more concrete) type, we must eliminate all references to other
|
|
|
|
// types, to avoid some circular reference problems.
|
|
|
|
void DerivedType::dropAllTypeUses() {
|
2007-04-06 02:02:20 +00:00
|
|
|
if (NumContainedTys != 0) {
|
2004-02-09 05:40:24 +00:00
|
|
|
// The type must stay abstract. To do this, we insert a pointer to a type
|
|
|
|
// that will never get resolved, thus will always be abstract.
|
2009-06-17 22:53:57 +00:00
|
|
|
static Type *AlwaysOpaqueTy = 0;
|
|
|
|
static PATypeHolder* Holder = 0;
|
2009-06-18 16:17:42 +00:00
|
|
|
Type *tmp = AlwaysOpaqueTy;
|
2009-06-19 17:45:12 +00:00
|
|
|
if (llvm_is_multithreaded()) {
|
|
|
|
sys::MemoryFence();
|
|
|
|
if (!tmp) {
|
2009-06-17 22:53:57 +00:00
|
|
|
llvm_acquire_global_lock();
|
2009-06-18 16:17:42 +00:00
|
|
|
tmp = AlwaysOpaqueTy;
|
|
|
|
if (!tmp) {
|
2009-08-13 23:27:32 +00:00
|
|
|
tmp = OpaqueType::get(getContext());
|
2009-09-02 12:23:05 +00:00
|
|
|
PATypeHolder* tmp2 = new PATypeHolder(tmp);
|
2009-06-17 22:53:57 +00:00
|
|
|
sys::MemoryFence();
|
|
|
|
AlwaysOpaqueTy = tmp;
|
|
|
|
Holder = tmp2;
|
|
|
|
}
|
|
|
|
|
|
|
|
llvm_release_global_lock();
|
2009-06-19 17:45:12 +00:00
|
|
|
}
|
2009-08-31 16:14:59 +00:00
|
|
|
} else if (!AlwaysOpaqueTy) {
|
2009-08-13 23:27:32 +00:00
|
|
|
AlwaysOpaqueTy = OpaqueType::get(getContext());
|
2009-06-19 17:45:12 +00:00
|
|
|
Holder = new PATypeHolder(AlwaysOpaqueTy);
|
|
|
|
}
|
|
|
|
|
2004-02-09 05:40:24 +00:00
|
|
|
ContainedTys[0] = AlwaysOpaqueTy;
|
2005-11-16 06:09:47 +00:00
|
|
|
|
2007-04-06 02:02:20 +00:00
|
|
|
// Change the rest of the types to be Int32Ty's. It doesn't matter what we
|
2005-11-16 06:09:47 +00:00
|
|
|
// pick so long as it doesn't point back to this type. We choose something
|
2009-09-14 02:25:34 +00:00
|
|
|
// concrete to avoid overhead for adding to AbstractTypeUser lists and
|
|
|
|
// stuff.
|
2009-09-27 15:32:21 +00:00
|
|
|
const Type *ConcreteTy = Type::getInt32Ty(getContext());
|
2007-04-06 02:02:20 +00:00
|
|
|
for (unsigned i = 1, e = NumContainedTys; i != e; ++i)
|
2009-09-27 15:32:21 +00:00
|
|
|
ContainedTys[i] = ConcreteTy;
|
2004-02-09 05:40:24 +00:00
|
|
|
}
|
2003-10-13 14:03:36 +00:00
|
|
|
}
|
|
|
|
|
2004-10-07 19:20:48 +00:00
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
namespace {
|
2004-10-07 19:20:48 +00:00
|
|
|
|
|
|
|
/// TypePromotionGraph and graph traits - this is designed to allow us to do
|
|
|
|
/// efficient SCC processing of type graphs. This is the exact same as
|
|
|
|
/// GraphTraits<Type*>, except that we pretend that concrete types have no
|
|
|
|
/// children to avoid processing them.
|
|
|
|
struct TypePromotionGraph {
|
|
|
|
Type *Ty;
|
|
|
|
TypePromotionGraph(Type *T) : Ty(T) {}
|
|
|
|
};
|
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
}
|
|
|
|
|
2004-10-07 19:20:48 +00:00
|
|
|
namespace llvm {
|
|
|
|
template <> struct GraphTraits<TypePromotionGraph> {
|
|
|
|
typedef Type NodeType;
|
|
|
|
typedef Type::subtype_iterator ChildIteratorType;
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-10-07 19:20:48 +00:00
|
|
|
static inline NodeType *getEntryNode(TypePromotionGraph G) { return G.Ty; }
|
2005-04-21 23:48:37 +00:00
|
|
|
static inline ChildIteratorType child_begin(NodeType *N) {
|
2004-10-07 19:20:48 +00:00
|
|
|
if (N->isAbstract())
|
2005-04-21 23:48:37 +00:00
|
|
|
return N->subtype_begin();
|
2004-10-07 19:20:48 +00:00
|
|
|
else // No need to process children of concrete types.
|
2005-04-21 23:48:37 +00:00
|
|
|
return N->subtype_end();
|
2004-10-07 19:20:48 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
static inline ChildIteratorType child_end(NodeType *N) {
|
2004-10-07 19:20:48 +00:00
|
|
|
return N->subtype_end();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-10-06 16:36:46 +00:00
|
|
|
// PromoteAbstractToConcrete - This is a recursive function that walks a type
|
|
|
|
// graph calculating whether or not a type is abstract.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2004-10-07 19:20:48 +00:00
|
|
|
void Type::PromoteAbstractToConcrete() {
|
|
|
|
if (!isAbstract()) return;
|
|
|
|
|
|
|
|
scc_iterator<TypePromotionGraph> SI = scc_begin(TypePromotionGraph(this));
|
|
|
|
scc_iterator<TypePromotionGraph> SE = scc_end (TypePromotionGraph(this));
|
|
|
|
|
|
|
|
for (; SI != SE; ++SI) {
|
|
|
|
std::vector<Type*> &SCC = *SI;
|
|
|
|
|
|
|
|
// Concrete types are leaves in the tree. Since an SCC will either be all
|
|
|
|
// abstract or all concrete, we only need to check one type.
|
|
|
|
if (SCC[0]->isAbstract()) {
|
|
|
|
if (isa<OpaqueType>(SCC[0]))
|
|
|
|
return; // Not going to be concrete, sorry.
|
|
|
|
|
|
|
|
// If all of the children of all of the types in this SCC are concrete,
|
|
|
|
// then this SCC is now concrete as well. If not, neither this SCC, nor
|
|
|
|
// any parent SCCs will be concrete, so we might as well just exit.
|
|
|
|
for (unsigned i = 0, e = SCC.size(); i != e; ++i)
|
|
|
|
for (Type::subtype_iterator CI = SCC[i]->subtype_begin(),
|
|
|
|
E = SCC[i]->subtype_end(); CI != E; ++CI)
|
|
|
|
if ((*CI)->isAbstract())
|
2005-03-09 17:34:27 +00:00
|
|
|
// If the child type is in our SCC, it doesn't make the entire SCC
|
|
|
|
// abstract unless there is a non-SCC abstract type.
|
|
|
|
if (std::find(SCC.begin(), SCC.end(), *CI) == SCC.end())
|
|
|
|
return; // Not going to be concrete, sorry.
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-10-07 19:20:48 +00:00
|
|
|
// Okay, we just discovered this whole SCC is now concrete, mark it as
|
|
|
|
// such!
|
|
|
|
for (unsigned i = 0, e = SCC.size(); i != e; ++i) {
|
|
|
|
assert(SCC[i]->isAbstract() && "Why are we processing concrete types?");
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-10-07 19:20:48 +00:00
|
|
|
SCC[i]->setAbstract(false);
|
2005-03-09 17:34:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = SCC.size(); i != e; ++i) {
|
|
|
|
assert(!SCC[i]->isAbstract() && "Concrete type became abstract?");
|
2004-10-07 19:20:48 +00:00
|
|
|
// The type just became concrete, notify all users!
|
|
|
|
cast<DerivedType>(SCC[i])->notifyUsesThatTypeBecameConcrete();
|
|
|
|
}
|
2003-09-02 21:56:34 +00:00
|
|
|
}
|
2004-10-07 19:20:48 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-09-07 16:56:42 +00:00
|
|
|
// Type Structural Equality Testing
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// TypesEqual - Two types are considered structurally equal if they have the
|
|
|
|
// same "shape": Every level and element of the types have identical primitive
|
|
|
|
// ID's, and the graphs have the same edges/nodes in them. Nodes do not have to
|
|
|
|
// be pointer equals to be equivalent though. This uses an optimistic algorithm
|
|
|
|
// that assumes that two graphs are the same until proven otherwise.
|
|
|
|
//
|
|
|
|
static bool TypesEqual(const Type *Ty, const Type *Ty2,
|
2004-07-04 12:14:17 +00:00
|
|
|
std::map<const Type *, const Type *> &EqTypes) {
|
2001-09-07 16:56:42 +00:00
|
|
|
if (Ty == Ty2) return true;
|
2004-06-17 18:19:28 +00:00
|
|
|
if (Ty->getTypeID() != Ty2->getTypeID()) return false;
|
2001-10-24 05:12:04 +00:00
|
|
|
if (isa<OpaqueType>(Ty))
|
2003-10-10 17:54:14 +00:00
|
|
|
return false; // Two unequal opaque types are never equal
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2008-07-11 20:58:19 +00:00
|
|
|
std::map<const Type*, const Type*>::iterator It = EqTypes.find(Ty);
|
|
|
|
if (It != EqTypes.end())
|
2001-11-02 07:51:31 +00:00
|
|
|
return It->second == Ty2; // Looping back on a type, check for equality
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2001-11-02 07:51:31 +00:00
|
|
|
// Otherwise, add the mapping to the table to make sure we don't get
|
|
|
|
// recursion on the types...
|
2003-10-13 14:55:56 +00:00
|
|
|
EqTypes.insert(It, std::make_pair(Ty, Ty2));
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2001-10-13 07:01:33 +00:00
|
|
|
// Two really annoying special cases that breaks an otherwise nice simple
|
2001-09-07 16:56:42 +00:00
|
|
|
// algorithm is the fact that arraytypes have sizes that differentiates types,
|
2003-09-05 02:21:39 +00:00
|
|
|
// and that function types can be varargs or not. Consider this now.
|
2003-10-13 14:55:56 +00:00
|
|
|
//
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty)) {
|
|
|
|
const IntegerType *ITy2 = cast<IntegerType>(Ty2);
|
|
|
|
return ITy->getBitWidth() == ITy2->getBitWidth();
|
|
|
|
} else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
|
2007-12-11 08:59:05 +00:00
|
|
|
const PointerType *PTy2 = cast<PointerType>(Ty2);
|
|
|
|
return PTy->getAddressSpace() == PTy2->getAddressSpace() &&
|
|
|
|
TypesEqual(PTy->getElementType(), PTy2->getElementType(), EqTypes);
|
2003-10-13 14:55:56 +00:00
|
|
|
} else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
|
2004-02-09 04:37:31 +00:00
|
|
|
const StructType *STy2 = cast<StructType>(Ty2);
|
|
|
|
if (STy->getNumElements() != STy2->getNumElements()) return false;
|
2006-12-08 18:06:16 +00:00
|
|
|
if (STy->isPacked() != STy2->isPacked()) return false;
|
2004-02-09 04:37:31 +00:00
|
|
|
for (unsigned i = 0, e = STy2->getNumElements(); i != e; ++i)
|
|
|
|
if (!TypesEqual(STy->getElementType(i), STy2->getElementType(i), EqTypes))
|
2003-10-13 14:55:56 +00:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
} else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
|
|
|
|
const ArrayType *ATy2 = cast<ArrayType>(Ty2);
|
|
|
|
return ATy->getNumElements() == ATy2->getNumElements() &&
|
|
|
|
TypesEqual(ATy->getElementType(), ATy2->getElementType(), EqTypes);
|
2007-02-15 02:26:10 +00:00
|
|
|
} else if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) {
|
|
|
|
const VectorType *PTy2 = cast<VectorType>(Ty2);
|
2004-08-20 06:00:58 +00:00
|
|
|
return PTy->getNumElements() == PTy2->getNumElements() &&
|
|
|
|
TypesEqual(PTy->getElementType(), PTy2->getElementType(), EqTypes);
|
Change the code to no longer compute the "type description" immediately when
the type is analyzed. Instead, only compute it when requested (with
getDescription), and cached for reuse later.
This dramatically speeds up LLVM in general because these descriptions almost
_never_ need to be constructed. The only time they are used is when a type is
<<'d. Printing of modules by themselves uses other code to print symbolic
types when possible, so these descriptions are really only used for debugging.
Also, this fixes the particularly bad case when lots of types get resolved to
each other, such as during linking of large programs. In these cases, the type
descriptions would be repeatedly recomputed and discarded even though: A. noone
reads the description before it gets resolved, and B. many many resolutions
happen at intermediate steps, causing a HUGE waste of time.
Overall, this makes the getTypeDesc function much more light-weight, and fixes
bug: Assembler/2002-07-08-HugePerformanceProblem.llx, which went from taking
1048.770u/19.150s (which is 17.5 MINUTES, on apoc), to taking 0.020u/0.000s,
which is a nice little speedup. :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8320 91177308-0d34-0410-b5e6-96231b3b80d8
2003-09-02 16:35:17 +00:00
|
|
|
} else if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) {
|
2003-10-13 14:55:56 +00:00
|
|
|
const FunctionType *FTy2 = cast<FunctionType>(Ty2);
|
|
|
|
if (FTy->isVarArg() != FTy2->isVarArg() ||
|
2004-02-09 04:14:01 +00:00
|
|
|
FTy->getNumParams() != FTy2->getNumParams() ||
|
2003-10-13 14:55:56 +00:00
|
|
|
!TypesEqual(FTy->getReturnType(), FTy2->getReturnType(), EqTypes))
|
2001-10-13 07:01:33 +00:00
|
|
|
return false;
|
2007-01-08 19:41:01 +00:00
|
|
|
for (unsigned i = 0, e = FTy2->getNumParams(); i != e; ++i) {
|
2004-02-09 04:14:01 +00:00
|
|
|
if (!TypesEqual(FTy->getParamType(i), FTy2->getParamType(i), EqTypes))
|
2003-10-13 14:55:56 +00:00
|
|
|
return false;
|
2007-01-08 19:41:01 +00:00
|
|
|
}
|
2003-10-13 14:55:56 +00:00
|
|
|
return true;
|
|
|
|
} else {
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unknown derived type!");
|
2003-10-13 14:55:56 +00:00
|
|
|
return false;
|
2001-10-13 07:01:33 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2009-12-19 00:51:42 +00:00
|
|
|
namespace llvm { // in namespace llvm so findable by ADL
|
2001-09-07 16:56:42 +00:00
|
|
|
static bool TypesEqual(const Type *Ty, const Type *Ty2) {
|
2003-05-22 21:21:43 +00:00
|
|
|
std::map<const Type *, const Type *> EqTypes;
|
2009-12-19 00:51:42 +00:00
|
|
|
return ::TypesEqual(Ty, Ty2, EqTypes);
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2004-11-16 20:30:53 +00:00
|
|
|
// AbstractTypeHasCycleThrough - Return true there is a path from CurTy to
|
|
|
|
// TargetTy in the type graph. We know that Ty is an abstract type, so if we
|
|
|
|
// ever reach a non-abstract type, we know that we don't need to search the
|
|
|
|
// subgraph.
|
|
|
|
static bool AbstractTypeHasCycleThrough(const Type *TargetTy, const Type *CurTy,
|
2008-06-16 21:20:58 +00:00
|
|
|
SmallPtrSet<const Type*, 128> &VisitedTypes) {
|
2004-02-09 20:23:44 +00:00
|
|
|
if (TargetTy == CurTy) return true;
|
|
|
|
if (!CurTy->isAbstract()) return false;
|
|
|
|
|
2008-06-16 21:20:58 +00:00
|
|
|
if (!VisitedTypes.insert(CurTy))
|
2004-11-16 20:30:53 +00:00
|
|
|
return false; // Already been here.
|
2004-02-09 20:23:44 +00:00
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
for (Type::subtype_iterator I = CurTy->subtype_begin(),
|
2004-07-04 12:14:17 +00:00
|
|
|
E = CurTy->subtype_end(); I != E; ++I)
|
2004-11-16 20:30:53 +00:00
|
|
|
if (AbstractTypeHasCycleThrough(TargetTy, *I, VisitedTypes))
|
2004-02-09 20:23:44 +00:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2004-11-16 20:30:53 +00:00
|
|
|
static bool ConcreteTypeHasCycleThrough(const Type *TargetTy, const Type *CurTy,
|
2008-06-16 21:20:58 +00:00
|
|
|
SmallPtrSet<const Type*, 128> &VisitedTypes) {
|
2004-11-16 20:30:53 +00:00
|
|
|
if (TargetTy == CurTy) return true;
|
|
|
|
|
2008-06-16 21:20:58 +00:00
|
|
|
if (!VisitedTypes.insert(CurTy))
|
2004-11-16 20:30:53 +00:00
|
|
|
return false; // Already been here.
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
for (Type::subtype_iterator I = CurTy->subtype_begin(),
|
2004-11-16 20:30:53 +00:00
|
|
|
E = CurTy->subtype_end(); I != E; ++I)
|
|
|
|
if (ConcreteTypeHasCycleThrough(TargetTy, *I, VisitedTypes))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
2004-02-09 20:23:44 +00:00
|
|
|
|
2009-12-19 00:51:42 +00:00
|
|
|
/// TypeHasCycleThroughItself - Return true if the specified type has
|
|
|
|
/// a cycle back to itself.
|
|
|
|
|
|
|
|
namespace llvm { // in namespace llvm so it's findable by ADL
|
2004-02-09 16:35:14 +00:00
|
|
|
static bool TypeHasCycleThroughItself(const Type *Ty) {
|
2008-06-16 21:20:58 +00:00
|
|
|
SmallPtrSet<const Type*, 128> VisitedTypes;
|
2004-11-16 20:30:53 +00:00
|
|
|
|
|
|
|
if (Ty->isAbstract()) { // Optimized case for abstract types.
|
2005-04-21 23:48:37 +00:00
|
|
|
for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end();
|
2004-11-16 20:30:53 +00:00
|
|
|
I != E; ++I)
|
|
|
|
if (AbstractTypeHasCycleThrough(Ty, *I, VisitedTypes))
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end();
|
|
|
|
I != E; ++I)
|
|
|
|
if (ConcreteTypeHasCycleThrough(Ty, *I, VisitedTypes))
|
|
|
|
return true;
|
|
|
|
}
|
2004-02-09 16:35:14 +00:00
|
|
|
return false;
|
|
|
|
}
|
2009-12-19 00:51:42 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-03-29 03:44:36 +00:00
|
|
|
// Function Type Factory and Value Class...
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2009-08-13 21:58:54 +00:00
|
|
|
const IntegerType *IntegerType::get(LLVMContext &C, unsigned NumBits) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
assert(NumBits >= MIN_INT_BITS && "bitwidth too small");
|
|
|
|
assert(NumBits <= MAX_INT_BITS && "bitwidth too large");
|
|
|
|
|
|
|
|
// Check for the built-in integer types
|
|
|
|
switch (NumBits) {
|
2009-08-13 21:58:54 +00:00
|
|
|
case 1: return cast<IntegerType>(Type::getInt1Ty(C));
|
|
|
|
case 8: return cast<IntegerType>(Type::getInt8Ty(C));
|
|
|
|
case 16: return cast<IntegerType>(Type::getInt16Ty(C));
|
|
|
|
case 32: return cast<IntegerType>(Type::getInt32Ty(C));
|
|
|
|
case 64: return cast<IntegerType>(Type::getInt64Ty(C));
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
2009-08-13 23:27:32 +00:00
|
|
|
|
|
|
|
LLVMContextImpl *pImpl = C.pImpl;
|
2009-06-16 22:51:18 +00:00
|
|
|
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
IntegerValType IVT(NumBits);
|
2009-06-16 22:51:18 +00:00
|
|
|
IntegerType *ITy = 0;
|
2009-06-18 20:15:26 +00:00
|
|
|
|
|
|
|
// First, see if the type is already in the table, for which
|
|
|
|
// a reader lock suffices.
|
2009-08-13 23:27:32 +00:00
|
|
|
ITy = pImpl->IntegerTypes.get(IVT);
|
2009-06-16 22:51:18 +00:00
|
|
|
|
2009-06-18 20:15:26 +00:00
|
|
|
if (!ITy) {
|
2009-07-01 17:22:27 +00:00
|
|
|
// Value not found. Derive a new type!
|
2009-08-13 23:27:32 +00:00
|
|
|
ITy = new IntegerType(C, NumBits);
|
|
|
|
pImpl->IntegerTypes.add(IVT, ITy);
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *ITy << "\n");
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
#endif
|
|
|
|
return ITy;
|
|
|
|
}
|
|
|
|
|
2007-01-18 02:59:54 +00:00
|
|
|
bool IntegerType::isPowerOf2ByteWidth() const {
|
|
|
|
unsigned BitWidth = getBitWidth();
|
2007-01-18 18:14:49 +00:00
|
|
|
return (BitWidth > 7) && isPowerOf2_32(BitWidth);
|
2007-01-18 02:59:54 +00:00
|
|
|
}
|
|
|
|
|
2007-03-01 04:02:06 +00:00
|
|
|
APInt IntegerType::getMask() const {
|
|
|
|
return APInt::getAllOnesValue(getBitWidth());
|
|
|
|
}
|
|
|
|
|
2003-09-05 02:21:39 +00:00
|
|
|
FunctionValType FunctionValType::get(const FunctionType *FT) {
|
|
|
|
// Build up a FunctionValType
|
|
|
|
std::vector<const Type *> ParamTypes;
|
2004-02-09 04:14:01 +00:00
|
|
|
ParamTypes.reserve(FT->getNumParams());
|
|
|
|
for (unsigned i = 0, e = FT->getNumParams(); i != e; ++i)
|
2003-09-05 02:21:39 +00:00
|
|
|
ParamTypes.push_back(FT->getParamType(i));
|
2007-11-27 13:23:08 +00:00
|
|
|
return FunctionValType(FT->getReturnType(), ParamTypes, FT->isVarArg());
|
2003-09-05 02:21:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
// FunctionType::get - The factory function for the FunctionType class...
|
2005-04-21 23:48:37 +00:00
|
|
|
FunctionType *FunctionType::get(const Type *ReturnType,
|
2003-05-22 21:21:43 +00:00
|
|
|
const std::vector<const Type*> &Params,
|
2007-11-27 13:23:08 +00:00
|
|
|
bool isVarArg) {
|
|
|
|
FunctionValType VT(ReturnType, Params, isVarArg);
|
2009-06-16 22:51:18 +00:00
|
|
|
FunctionType *FT = 0;
|
|
|
|
|
2009-08-05 18:13:27 +00:00
|
|
|
LLVMContextImpl *pImpl = ReturnType->getContext().pImpl;
|
|
|
|
|
|
|
|
FT = pImpl->FunctionTypes.get(VT);
|
2009-06-18 20:15:26 +00:00
|
|
|
|
|
|
|
if (!FT) {
|
2009-07-01 17:22:27 +00:00
|
|
|
FT = (FunctionType*) operator new(sizeof(FunctionType) +
|
|
|
|
sizeof(PATypeHandle)*(Params.size()+1));
|
|
|
|
new (FT) FunctionType(ReturnType, Params, isVarArg);
|
2009-08-05 18:13:27 +00:00
|
|
|
pImpl->FunctionTypes.add(VT, FT);
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
2009-06-18 20:15:26 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << FT << "\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2007-04-22 05:46:44 +00:00
|
|
|
return FT;
|
2006-12-31 05:25:34 +00:00
|
|
|
}
|
|
|
|
|
2005-01-08 20:19:51 +00:00
|
|
|
ArrayType *ArrayType::get(const Type *ElementType, uint64_t NumElements) {
|
2009-05-25 21:28:11 +00:00
|
|
|
assert(ElementType && "Can't get array of <null> types!");
|
2009-06-07 07:26:46 +00:00
|
|
|
assert(isValidElementType(ElementType) && "Invalid type for array element!");
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
ArrayValType AVT(ElementType, NumElements);
|
2009-06-16 22:51:18 +00:00
|
|
|
ArrayType *AT = 0;
|
2009-08-04 23:33:01 +00:00
|
|
|
|
|
|
|
LLVMContextImpl *pImpl = ElementType->getContext().pImpl;
|
2009-06-16 22:51:18 +00:00
|
|
|
|
2009-08-04 23:33:01 +00:00
|
|
|
AT = pImpl->ArrayTypes.get(AVT);
|
2009-07-01 17:22:27 +00:00
|
|
|
|
2009-06-18 20:15:26 +00:00
|
|
|
if (!AT) {
|
2009-07-01 17:22:27 +00:00
|
|
|
// Value not found. Derive a new type!
|
2009-08-04 23:33:01 +00:00
|
|
|
pImpl->ArrayTypes.add(AVT, AT = new ArrayType(ElementType, NumElements));
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *AT << "\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return AT;
|
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
bool ArrayType::isValidElementType(const Type *ElemTy) {
|
2009-09-27 23:27:42 +00:00
|
|
|
return ElemTy->getTypeID() != VoidTyID && ElemTy->getTypeID() != LabelTyID &&
|
|
|
|
ElemTy->getTypeID() != MetadataTyID && !isa<FunctionType>(ElemTy);
|
2009-06-07 07:26:46 +00:00
|
|
|
}
|
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
VectorType *VectorType::get(const Type *ElementType, unsigned NumElements) {
|
2009-05-25 21:28:11 +00:00
|
|
|
assert(ElementType && "Can't get vector of <null> types!");
|
2004-08-20 06:00:58 +00:00
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
VectorValType PVT(ElementType, NumElements);
|
2009-06-16 22:51:18 +00:00
|
|
|
VectorType *PT = 0;
|
|
|
|
|
2009-08-04 23:47:44 +00:00
|
|
|
LLVMContextImpl *pImpl = ElementType->getContext().pImpl;
|
|
|
|
|
|
|
|
PT = pImpl->VectorTypes.get(PVT);
|
2009-06-16 22:51:18 +00:00
|
|
|
|
2009-06-18 20:15:26 +00:00
|
|
|
if (!PT) {
|
2009-08-04 23:47:44 +00:00
|
|
|
pImpl->VectorTypes.add(PVT, PT = new VectorType(ElementType, NumElements));
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
2004-08-20 06:00:58 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *PT << "\n");
|
2004-08-20 06:00:58 +00:00
|
|
|
#endif
|
|
|
|
return PT;
|
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
bool VectorType::isValidElementType(const Type *ElemTy) {
|
2009-09-27 23:27:42 +00:00
|
|
|
return ElemTy->isInteger() || ElemTy->isFloatingPoint() ||
|
|
|
|
isa<OpaqueType>(ElemTy);
|
2009-06-07 07:26:46 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Struct Type Factory...
|
|
|
|
//
|
|
|
|
|
2009-08-05 23:16:16 +00:00
|
|
|
StructType *StructType::get(LLVMContext &Context,
|
|
|
|
const std::vector<const Type*> &ETypes,
|
2006-12-08 18:06:16 +00:00
|
|
|
bool isPacked) {
|
|
|
|
StructValType STV(ETypes, isPacked);
|
2009-06-16 22:51:18 +00:00
|
|
|
StructType *ST = 0;
|
|
|
|
|
2009-08-05 23:16:16 +00:00
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
|
|
|
|
|
|
|
ST = pImpl->StructTypes.get(STV);
|
2009-06-16 22:51:18 +00:00
|
|
|
|
2009-06-18 20:15:26 +00:00
|
|
|
if (!ST) {
|
2009-07-01 17:22:27 +00:00
|
|
|
// Value not found. Derive a new type!
|
|
|
|
ST = (StructType*) operator new(sizeof(StructType) +
|
|
|
|
sizeof(PATypeHandle) * ETypes.size());
|
2009-08-13 23:27:32 +00:00
|
|
|
new (ST) StructType(Context, ETypes, isPacked);
|
2009-08-05 23:16:16 +00:00
|
|
|
pImpl->StructTypes.add(STV, ST);
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *ST << "\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return ST;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2009-08-05 23:16:16 +00:00
|
|
|
StructType *StructType::get(LLVMContext &Context, const Type *type, ...) {
|
2008-03-19 05:06:05 +00:00
|
|
|
va_list ap;
|
|
|
|
std::vector<const llvm::Type*> StructFields;
|
|
|
|
va_start(ap, type);
|
2008-03-21 15:53:17 +00:00
|
|
|
while (type) {
|
2008-03-19 05:06:05 +00:00
|
|
|
StructFields.push_back(type);
|
2008-03-21 15:53:17 +00:00
|
|
|
type = va_arg(ap, llvm::Type*);
|
|
|
|
}
|
2009-08-05 23:16:16 +00:00
|
|
|
return llvm::StructType::get(Context, StructFields);
|
2008-03-19 05:06:05 +00:00
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
bool StructType::isValidElementType(const Type *ElemTy) {
|
2009-09-27 23:27:42 +00:00
|
|
|
return ElemTy->getTypeID() != VoidTyID && ElemTy->getTypeID() != LabelTyID &&
|
|
|
|
ElemTy->getTypeID() != MetadataTyID && !isa<FunctionType>(ElemTy);
|
2009-06-07 07:26:46 +00:00
|
|
|
}
|
2003-09-05 02:21:39 +00:00
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Pointer Type Factory...
|
|
|
|
//
|
|
|
|
|
2007-12-11 08:59:05 +00:00
|
|
|
PointerType *PointerType::get(const Type *ValueType, unsigned AddressSpace) {
|
2001-09-07 16:56:42 +00:00
|
|
|
assert(ValueType && "Can't get a pointer to <null> type!");
|
2009-09-15 06:28:26 +00:00
|
|
|
assert(ValueType->getTypeID() != VoidTyID &&
|
2009-05-22 00:40:35 +00:00
|
|
|
"Pointer to void is not valid, use i8* instead!");
|
2009-06-07 07:26:46 +00:00
|
|
|
assert(isValidElementType(ValueType) && "Invalid type for pointer element!");
|
2007-12-11 08:59:05 +00:00
|
|
|
PointerValType PVT(ValueType, AddressSpace);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2009-06-16 22:51:18 +00:00
|
|
|
PointerType *PT = 0;
|
|
|
|
|
2009-08-05 00:15:12 +00:00
|
|
|
LLVMContextImpl *pImpl = ValueType->getContext().pImpl;
|
|
|
|
|
|
|
|
PT = pImpl->PointerTypes.get(PVT);
|
2009-06-18 20:15:26 +00:00
|
|
|
|
|
|
|
if (!PT) {
|
2009-07-01 17:22:27 +00:00
|
|
|
// Value not found. Derive a new type!
|
2009-08-05 00:15:12 +00:00
|
|
|
pImpl->PointerTypes.add(PVT, PT = new PointerType(ValueType, AddressSpace));
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "Derived new type: " << *PT << "\n");
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2001-09-07 16:56:42 +00:00
|
|
|
return PT;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2009-10-07 07:35:19 +00:00
|
|
|
const PointerType *Type::getPointerTo(unsigned addrs) const {
|
2009-04-10 06:42:02 +00:00
|
|
|
return PointerType::get(this, addrs);
|
|
|
|
}
|
|
|
|
|
2009-06-07 07:26:46 +00:00
|
|
|
bool PointerType::isValidElementType(const Type *ElemTy) {
|
2009-09-27 23:27:42 +00:00
|
|
|
return ElemTy->getTypeID() != VoidTyID &&
|
|
|
|
ElemTy->getTypeID() != LabelTyID &&
|
|
|
|
ElemTy->getTypeID() != MetadataTyID;
|
2009-06-07 07:26:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-17 19:55:06 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Opaque Type Factory...
|
|
|
|
//
|
|
|
|
|
|
|
|
OpaqueType *OpaqueType::get(LLVMContext &C) {
|
|
|
|
OpaqueType *OT = new OpaqueType(C); // All opaque types are distinct
|
|
|
|
|
|
|
|
LLVMContextImpl *pImpl = C.pImpl;
|
|
|
|
pImpl->OpaqueTypes.insert(OT);
|
|
|
|
return OT;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Derived Type Refinement Functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-06-17 00:12:30 +00:00
|
|
|
// addAbstractTypeUser - Notify an abstract type that there is a new user of
|
|
|
|
// it. This function is called primarily by the PATypeHandle class.
|
|
|
|
void Type::addAbstractTypeUser(AbstractTypeUser *U) const {
|
|
|
|
assert(isAbstract() && "addAbstractTypeUser: Current type not abstract!");
|
2009-06-18 18:36:34 +00:00
|
|
|
AbstractTypeUsers.push_back(U);
|
2009-06-17 00:12:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// removeAbstractTypeUser - Notify an abstract type that a user of the class
|
|
|
|
// no longer has a handle to the type. This function is called primarily by
|
|
|
|
// the PATypeHandle class. When there are no users of the abstract type, it
|
2003-10-10 17:54:14 +00:00
|
|
|
// is annihilated, because there is no way to get a reference to it ever again.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2005-11-13 03:14:09 +00:00
|
|
|
void Type::removeAbstractTypeUser(AbstractTypeUser *U) const {
|
2009-06-17 00:12:30 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Search from back to front because we will notify users from back to
|
|
|
|
// front. Also, it is likely that there will be a stack like behavior to
|
|
|
|
// users that register and unregister users.
|
|
|
|
//
|
2002-04-05 19:44:07 +00:00
|
|
|
unsigned i;
|
|
|
|
for (i = AbstractTypeUsers.size(); AbstractTypeUsers[i-1] != U; --i)
|
|
|
|
assert(i != 0 && "AbstractTypeUser not in user list!");
|
|
|
|
|
|
|
|
--i; // Convert to be in range 0 <= i < size()
|
|
|
|
assert(i < AbstractTypeUsers.size() && "Index out of range!"); // Wraparound?
|
|
|
|
|
|
|
|
AbstractTypeUsers.erase(AbstractTypeUsers.begin()+i);
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << " remAbstractTypeUser[" << (void*)this << ", "
|
2009-08-23 04:44:11 +00:00
|
|
|
<< *this << "][" << i << "] User = " << U << "\n");
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-02-17 03:03:47 +00:00
|
|
|
if (AbstractTypeUsers.empty() && getRefCount() == 0 && isAbstract()) {
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "DELETEing unused abstract type: <" << *this
|
2009-08-23 04:44:11 +00:00
|
|
|
<< ">[" << (void*)this << "]" << "\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2009-06-17 00:12:30 +00:00
|
|
|
|
|
|
|
this->destroy();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2009-06-17 00:12:30 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2009-06-16 22:51:18 +00:00
|
|
|
// unlockedRefineAbstractTypeTo - This function is used when it is discovered
|
|
|
|
// that the 'this' abstract type is actually equivalent to the NewType
|
|
|
|
// specified. This causes all users of 'this' to switch to reference the more
|
|
|
|
// concrete type NewType and for 'this' to be deleted. Only used for internal
|
|
|
|
// callers.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2009-06-16 22:51:18 +00:00
|
|
|
void DerivedType::unlockedRefineAbstractTypeTo(const Type *NewType) {
|
2001-09-07 16:56:42 +00:00
|
|
|
assert(isAbstract() && "refineAbstractTypeTo: Current type is not abstract!");
|
|
|
|
assert(this != NewType && "Can't refine to myself!");
|
2003-10-03 18:46:24 +00:00
|
|
|
assert(ForwardType == 0 && "This type has already been refined!");
|
|
|
|
|
2009-08-17 17:59:35 +00:00
|
|
|
LLVMContextImpl *pImpl = getContext().pImpl;
|
|
|
|
|
Change the code to no longer compute the "type description" immediately when
the type is analyzed. Instead, only compute it when requested (with
getDescription), and cached for reuse later.
This dramatically speeds up LLVM in general because these descriptions almost
_never_ need to be constructed. The only time they are used is when a type is
<<'d. Printing of modules by themselves uses other code to print symbolic
types when possible, so these descriptions are really only used for debugging.
Also, this fixes the particularly bad case when lots of types get resolved to
each other, such as during linking of large programs. In these cases, the type
descriptions would be repeatedly recomputed and discarded even though: A. noone
reads the description before it gets resolved, and B. many many resolutions
happen at intermediate steps, causing a HUGE waste of time.
Overall, this makes the getTypeDesc function much more light-weight, and fixes
bug: Assembler/2002-07-08-HugePerformanceProblem.llx, which went from taking
1048.770u/19.150s (which is 17.5 MINUTES, on apoc), to taking 0.020u/0.000s,
which is a nice little speedup. :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8320 91177308-0d34-0410-b5e6-96231b3b80d8
2003-09-02 16:35:17 +00:00
|
|
|
// The descriptions may be out of date. Conservatively clear them all!
|
2009-08-17 17:59:35 +00:00
|
|
|
pImpl->AbstractTypeDescriptions.clear();
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "REFINING abstract type [" << (void*)this << " "
|
2009-08-23 04:44:11 +00:00
|
|
|
<< *this << "] to [" << (void*)NewType << " "
|
|
|
|
<< *NewType << "]!\n");
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Make sure to put the type to be refined to into a holder so that if IT gets
|
|
|
|
// refined, that we will not continue using a dead reference...
|
|
|
|
//
|
2002-04-04 19:26:02 +00:00
|
|
|
PATypeHolder NewTy(NewType);
|
2009-09-14 02:25:34 +00:00
|
|
|
// Any PATypeHolders referring to this type will now automatically forward to
|
2003-10-03 18:46:24 +00:00
|
|
|
// the type we are resolved to.
|
2003-10-02 23:35:57 +00:00
|
|
|
ForwardType = NewType;
|
|
|
|
if (NewType->isAbstract())
|
|
|
|
cast<DerivedType>(NewType)->addRef();
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Add a self use of the current type so that we don't delete ourself until
|
2003-10-03 04:48:21 +00:00
|
|
|
// after the function exits.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-10-03 04:48:21 +00:00
|
|
|
PATypeHolder CurrentTy(this);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-09-05 02:21:39 +00:00
|
|
|
// To make the situation simpler, we ask the subclass to remove this type from
|
|
|
|
// the type map, and to replace any type uses with uses of non-abstract types.
|
|
|
|
// This dramatically limits the amount of recursive type trouble we can find
|
|
|
|
// ourselves in.
|
2003-10-03 18:57:54 +00:00
|
|
|
dropAllTypeUses();
|
2003-09-05 02:21:39 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Iterate over all of the uses of this type, invoking callback. Each user
|
2002-04-05 19:44:07 +00:00
|
|
|
// should remove itself from our use list automatically. We have to check to
|
|
|
|
// make sure that NewTy doesn't _become_ 'this'. If it does, resolving types
|
|
|
|
// will not cause users to drop off of the use list. If we resolve to ourself
|
|
|
|
// we succeed!
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-10-03 04:48:21 +00:00
|
|
|
while (!AbstractTypeUsers.empty() && NewTy != this) {
|
2001-09-07 16:56:42 +00:00
|
|
|
AbstractTypeUser *User = AbstractTypeUsers.back();
|
|
|
|
|
2008-06-21 19:47:03 +00:00
|
|
|
unsigned OldSize = AbstractTypeUsers.size(); OldSize=OldSize;
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << " REFINING user " << OldSize-1 << "[" << (void*)User
|
2009-08-23 04:44:11 +00:00
|
|
|
<< "] of abstract type [" << (void*)this << " "
|
|
|
|
<< *this << "] to [" << (void*)NewTy.get() << " "
|
|
|
|
<< *NewTy << "]!\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2003-10-03 04:48:21 +00:00
|
|
|
User->refineAbstractType(this, NewTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-10-03 04:48:21 +00:00
|
|
|
assert(AbstractTypeUsers.size() != OldSize &&
|
|
|
|
"AbsTyUser did not remove self from user list!");
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2003-10-03 04:48:21 +00:00
|
|
|
// If we were successful removing all users from the type, 'this' will be
|
|
|
|
// deleted when the last PATypeHolder is destroyed or updated from this type.
|
|
|
|
// This may occur on exit of this function, as the CurrentTy object is
|
|
|
|
// destroyed.
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
2009-06-16 22:51:18 +00:00
|
|
|
// refineAbstractTypeTo - This function is used by external callers to notify
|
|
|
|
// us that this abstract type is equivalent to another type.
|
|
|
|
//
|
|
|
|
void DerivedType::refineAbstractTypeTo(const Type *NewType) {
|
2009-06-18 20:15:26 +00:00
|
|
|
// All recursive calls will go through unlockedRefineAbstractTypeTo,
|
|
|
|
// to avoid deadlock problems.
|
|
|
|
unlockedRefineAbstractTypeTo(NewType);
|
2009-06-16 22:51:18 +00:00
|
|
|
}
|
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
// notifyUsesThatTypeBecameConcrete - Notify AbstractTypeUsers of this type that
|
|
|
|
// the current type has transitioned from being abstract to being concrete.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-10-03 18:46:24 +00:00
|
|
|
void DerivedType::notifyUsesThatTypeBecameConcrete() {
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2010-01-05 01:29:55 +00:00
|
|
|
DEBUG(dbgs() << "typeIsREFINED type: " << (void*)this << " " << *this <<"\n");
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2002-04-07 06:14:56 +00:00
|
|
|
|
2008-06-21 19:47:03 +00:00
|
|
|
unsigned OldSize = AbstractTypeUsers.size(); OldSize=OldSize;
|
2003-10-03 18:46:24 +00:00
|
|
|
while (!AbstractTypeUsers.empty()) {
|
|
|
|
AbstractTypeUser *ATU = AbstractTypeUsers.back();
|
|
|
|
ATU->typeBecameConcrete(this);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
assert(AbstractTypeUsers.size() < OldSize-- &&
|
|
|
|
"AbstractTypeUser did not remove itself from the use list!");
|
2001-11-03 03:27:53 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// refineAbstractType - Called when a contained type is found to be more
|
|
|
|
// concrete - this could potentially change us from an abstract type to a
|
|
|
|
// concrete type.
|
|
|
|
//
|
2002-03-29 03:44:36 +00:00
|
|
|
void FunctionType::refineAbstractType(const DerivedType *OldType,
|
|
|
|
const Type *NewType) {
|
2009-08-05 18:13:27 +00:00
|
|
|
LLVMContextImpl *pImpl = OldType->getContext().pImpl;
|
|
|
|
pImpl->FunctionTypes.RefineAbstractType(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void FunctionType::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-08-05 18:13:27 +00:00
|
|
|
LLVMContextImpl *pImpl = AbsTy->getContext().pImpl;
|
|
|
|
pImpl->FunctionTypes.TypeBecameConcrete(this, AbsTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// refineAbstractType - Called when a contained type is found to be more
|
|
|
|
// concrete - this could potentially change us from an abstract type to a
|
|
|
|
// concrete type.
|
|
|
|
//
|
|
|
|
void ArrayType::refineAbstractType(const DerivedType *OldType,
|
2004-07-04 12:14:17 +00:00
|
|
|
const Type *NewType) {
|
2009-08-04 23:33:01 +00:00
|
|
|
LLVMContextImpl *pImpl = OldType->getContext().pImpl;
|
|
|
|
pImpl->ArrayTypes.RefineAbstractType(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ArrayType::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-08-04 23:33:01 +00:00
|
|
|
LLVMContextImpl *pImpl = AbsTy->getContext().pImpl;
|
|
|
|
pImpl->ArrayTypes.TypeBecameConcrete(this, AbsTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
2004-08-20 06:00:58 +00:00
|
|
|
// refineAbstractType - Called when a contained type is found to be more
|
|
|
|
// concrete - this could potentially change us from an abstract type to a
|
|
|
|
// concrete type.
|
|
|
|
//
|
2007-02-15 02:26:10 +00:00
|
|
|
void VectorType::refineAbstractType(const DerivedType *OldType,
|
2004-08-20 06:00:58 +00:00
|
|
|
const Type *NewType) {
|
2009-08-04 23:47:44 +00:00
|
|
|
LLVMContextImpl *pImpl = OldType->getContext().pImpl;
|
|
|
|
pImpl->VectorTypes.RefineAbstractType(this, OldType, NewType);
|
2004-08-20 06:00:58 +00:00
|
|
|
}
|
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
void VectorType::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-08-04 23:47:44 +00:00
|
|
|
LLVMContextImpl *pImpl = AbsTy->getContext().pImpl;
|
|
|
|
pImpl->VectorTypes.TypeBecameConcrete(this, AbsTy);
|
2004-08-20 06:00:58 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
// refineAbstractType - Called when a contained type is found to be more
|
|
|
|
// concrete - this could potentially change us from an abstract type to a
|
|
|
|
// concrete type.
|
|
|
|
//
|
|
|
|
void StructType::refineAbstractType(const DerivedType *OldType,
|
2004-07-04 12:14:17 +00:00
|
|
|
const Type *NewType) {
|
2009-08-05 23:16:16 +00:00
|
|
|
LLVMContextImpl *pImpl = OldType->getContext().pImpl;
|
|
|
|
pImpl->StructTypes.RefineAbstractType(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void StructType::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-08-05 23:16:16 +00:00
|
|
|
LLVMContextImpl *pImpl = AbsTy->getContext().pImpl;
|
|
|
|
pImpl->StructTypes.TypeBecameConcrete(this, AbsTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// refineAbstractType - Called when a contained type is found to be more
|
|
|
|
// concrete - this could potentially change us from an abstract type to a
|
|
|
|
// concrete type.
|
|
|
|
//
|
|
|
|
void PointerType::refineAbstractType(const DerivedType *OldType,
|
2004-07-04 12:14:17 +00:00
|
|
|
const Type *NewType) {
|
2009-08-05 00:15:12 +00:00
|
|
|
LLVMContextImpl *pImpl = OldType->getContext().pImpl;
|
|
|
|
pImpl->PointerTypes.RefineAbstractType(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void PointerType::typeBecameConcrete(const DerivedType *AbsTy) {
|
2009-08-05 00:15:12 +00:00
|
|
|
LLVMContextImpl *pImpl = AbsTy->getContext().pImpl;
|
|
|
|
pImpl->PointerTypes.TypeBecameConcrete(this, AbsTy);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2004-07-04 12:14:17 +00:00
|
|
|
|
|
|
|
bool SequentialType::indexValid(const Value *V) const {
|
2009-04-26 17:14:35 +00:00
|
|
|
if (isa<IntegerType>(V->getType()))
|
|
|
|
return true;
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
return false;
|
2004-07-04 12:14:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
namespace llvm {
|
2009-04-20 15:55:38 +00:00
|
|
|
raw_ostream &operator<<(raw_ostream &OS, const Type &T) {
|
|
|
|
T.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
2004-07-04 12:14:17 +00:00
|
|
|
}
|