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
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and 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.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-07-04 12:14:17 +00:00
|
|
|
#include "llvm/AbstractTypeUser.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2001-09-07 16:56:42 +00:00
|
|
|
#include "llvm/SymbolTable.h"
|
2002-04-28 19:55:58 +00:00
|
|
|
#include "llvm/Constants.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"
|
2002-04-07 06:14:56 +00:00
|
|
|
#include <algorithm>
|
2004-07-04 12:14:17 +00:00
|
|
|
#include <iostream>
|
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
|
|
|
//
|
|
|
|
//#define DEBUG_MERGE_TYPES 1
|
|
|
|
|
2004-02-26 07:24:18 +00:00
|
|
|
AbstractTypeUser::~AbstractTypeUser() {}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Type Class Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
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
|
|
|
// Concrete/Abstract TypeDescriptions - We lazily calculate type descriptions
|
|
|
|
// for types as they are needed. Because resolution of types must invalidate
|
|
|
|
// all of the abstract type descriptions, we keep them in a seperate map to make
|
|
|
|
// this easy.
|
|
|
|
static std::map<const Type*, std::string> ConcreteTypeDescriptions;
|
|
|
|
static std::map<const Type*, std::string> AbstractTypeDescriptions;
|
|
|
|
|
2004-07-04 12:14:17 +00:00
|
|
|
Type::Type( const std::string& name, TypeID id )
|
|
|
|
: RefCount(0), ForwardType(0) {
|
2003-09-02 22:50:02 +00:00
|
|
|
if (!name.empty())
|
|
|
|
ConcreteTypeDescriptions[this] = name;
|
2001-06-06 20:29:01 +00:00
|
|
|
ID = id;
|
2003-09-02 21:41:05 +00:00
|
|
|
Abstract = false;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2004-06-17 18:19:28 +00:00
|
|
|
const Type *Type::getPrimitiveType(TypeID IDNumber) {
|
2001-06-06 20:29:01 +00:00
|
|
|
switch (IDNumber) {
|
|
|
|
case VoidTyID : return VoidTy;
|
|
|
|
case BoolTyID : return BoolTy;
|
|
|
|
case UByteTyID : return UByteTy;
|
|
|
|
case SByteTyID : return SByteTy;
|
|
|
|
case UShortTyID: return UShortTy;
|
|
|
|
case ShortTyID : return ShortTy;
|
|
|
|
case UIntTyID : return UIntTy;
|
|
|
|
case IntTyID : return IntTy;
|
|
|
|
case ULongTyID : return ULongTy;
|
|
|
|
case LongTyID : return LongTy;
|
|
|
|
case FloatTyID : return FloatTy;
|
|
|
|
case DoubleTyID: return DoubleTy;
|
|
|
|
case LabelTyID : return LabelTy;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-05-20 18:45:36 +00:00
|
|
|
// isLosslesslyConvertibleTo - Return true if this type can be converted to
|
2001-11-26 17:01:47 +00:00
|
|
|
// 'Ty' without any reinterpretation of bits. For example, uint to int.
|
|
|
|
//
|
2003-05-20 18:45:36 +00:00
|
|
|
bool Type::isLosslesslyConvertibleTo(const Type *Ty) const {
|
2001-11-26 17:01:47 +00:00
|
|
|
if (this == Ty) return true;
|
2002-05-06 16:14:39 +00:00
|
|
|
if ((!isPrimitiveType() && !isa<PointerType>(this)) ||
|
|
|
|
(!isa<PointerType>(Ty) && !Ty->isPrimitiveType())) return false;
|
2001-11-26 17:01:47 +00:00
|
|
|
|
2004-06-17 18:19:28 +00:00
|
|
|
if (getTypeID() == Ty->getTypeID())
|
2001-11-26 17:01:47 +00:00
|
|
|
return true; // Handles identity cast, and cast of differing pointer types
|
|
|
|
|
|
|
|
// Now we know that they are two differing primitive or pointer types
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (getTypeID()) {
|
2001-11-26 17:01:47 +00:00
|
|
|
case Type::UByteTyID: return Ty == Type::SByteTy;
|
|
|
|
case Type::SByteTyID: return Ty == Type::UByteTy;
|
|
|
|
case Type::UShortTyID: return Ty == Type::ShortTy;
|
|
|
|
case Type::ShortTyID: return Ty == Type::UShortTy;
|
|
|
|
case Type::UIntTyID: return Ty == Type::IntTy;
|
|
|
|
case Type::IntTyID: return Ty == Type::UIntTy;
|
2003-11-03 18:44:58 +00:00
|
|
|
case Type::ULongTyID: return Ty == Type::LongTy;
|
|
|
|
case Type::LongTyID: return Ty == Type::ULongTy;
|
|
|
|
case Type::PointerTyID: return isa<PointerType>(Ty);
|
2001-11-26 17:01:47 +00:00
|
|
|
default:
|
|
|
|
return false; // Other types have no identity values
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-03-26 21:43:22 +00:00
|
|
|
/// getUnsignedVersion - If this is an integer type, return the unsigned
|
|
|
|
/// variant of this type. For example int -> uint.
|
|
|
|
const Type *Type::getUnsignedVersion() const {
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (getTypeID()) {
|
2004-03-26 21:43:22 +00:00
|
|
|
default:
|
|
|
|
assert(isInteger()&&"Type::getUnsignedVersion is only valid for integers!");
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UByteTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::SByteTyID: return Type::UByteTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UShortTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::ShortTyID: return Type::UShortTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UIntTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::IntTyID: return Type::UIntTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::ULongTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::LongTyID: return Type::ULongTy;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getSignedVersion - If this is an integer type, return the signed variant
|
|
|
|
/// of this type. For example uint -> int.
|
|
|
|
const Type *Type::getSignedVersion() const {
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (getTypeID()) {
|
2004-03-26 21:43:22 +00:00
|
|
|
default:
|
|
|
|
assert(isInteger() && "Type::getSignedVersion is only valid for integers!");
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UByteTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::SByteTyID: return Type::SByteTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UShortTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::ShortTyID: return Type::ShortTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::UIntTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::IntTyID: return Type::IntTy;
|
2005-04-21 23:48:37 +00:00
|
|
|
case Type::ULongTyID:
|
2004-03-26 21:43:22 +00:00
|
|
|
case Type::LongTyID: return Type::LongTy;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-10-10 17:54:14 +00:00
|
|
|
// getPrimitiveSize - Return the basic size of this type if it is a primitive
|
2003-08-21 22:14:26 +00:00
|
|
|
// type. These are fixed by LLVM and are not target dependent. This will
|
2002-05-06 16:14:39 +00:00
|
|
|
// return zero if the type does not have a size or is not a primitive type.
|
|
|
|
//
|
|
|
|
unsigned Type::getPrimitiveSize() const {
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (getTypeID()) {
|
2005-04-23 22:01:39 +00:00
|
|
|
case Type::BoolTyID:
|
|
|
|
case Type::SByteTyID:
|
|
|
|
case Type::UByteTyID: return 1;
|
|
|
|
case Type::UShortTyID:
|
|
|
|
case Type::ShortTyID: return 2;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
case Type::IntTyID:
|
|
|
|
case Type::UIntTyID: return 4;
|
|
|
|
case Type::LongTyID:
|
|
|
|
case Type::ULongTyID:
|
|
|
|
case Type::DoubleTyID: return 8;
|
2005-04-23 22:00:09 +00:00
|
|
|
default: return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned Type::getPrimitiveSizeInBits() const {
|
|
|
|
switch (getTypeID()) {
|
2005-04-23 22:01:39 +00:00
|
|
|
case Type::BoolTyID: return 1;
|
|
|
|
case Type::SByteTyID:
|
|
|
|
case Type::UByteTyID: return 8;
|
|
|
|
case Type::UShortTyID:
|
|
|
|
case Type::ShortTyID: return 16;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
case Type::IntTyID:
|
|
|
|
case Type::UIntTyID: return 32;
|
|
|
|
case Type::LongTyID:
|
|
|
|
case Type::ULongTyID:
|
|
|
|
case Type::DoubleTyID: return 64;
|
2002-05-06 16:14:39 +00:00
|
|
|
default: return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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 {
|
|
|
|
if (const ArrayType *ATy = dyn_cast<ArrayType>(this))
|
|
|
|
return ATy->getElementType()->isSized();
|
2004-12-01 17:12:16 +00:00
|
|
|
|
|
|
|
if (const PackedType *PTy = dyn_cast<PackedType>(this))
|
|
|
|
return PTy->getElementType()->isSized();
|
2004-07-02 23:20:17 +00:00
|
|
|
|
|
|
|
if (!isa<StructType>(this)) return false;
|
|
|
|
|
|
|
|
// Okay, our struct is sized if all of the elements are...
|
|
|
|
for (subtype_iterator I = subtype_begin(), E = subtype_end(); I != E; ++I)
|
|
|
|
if (!(*I)->isSized()) return false;
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
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
|
|
|
// getTypeDescription - This is a recursive function that walks a type hierarchy
|
|
|
|
// calculating the description for a type.
|
|
|
|
//
|
|
|
|
static std::string getTypeDescription(const Type *Ty,
|
|
|
|
std::vector<const Type *> &TypeStack) {
|
|
|
|
if (isa<OpaqueType>(Ty)) { // Base case for the recursion
|
|
|
|
std::map<const Type*, std::string>::iterator I =
|
|
|
|
AbstractTypeDescriptions.lower_bound(Ty);
|
|
|
|
if (I != AbstractTypeDescriptions.end() && I->first == Ty)
|
|
|
|
return I->second;
|
2004-07-08 22:31:09 +00:00
|
|
|
std::string Desc = "opaque";
|
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
|
|
|
AbstractTypeDescriptions.insert(std::make_pair(Ty, Desc));
|
|
|
|
return Desc;
|
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-09-02 21:41:05 +00:00
|
|
|
if (!Ty->isAbstract()) { // Base case for the recursion
|
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
|
|
|
std::map<const Type*, std::string>::iterator I =
|
|
|
|
ConcreteTypeDescriptions.find(Ty);
|
|
|
|
if (I != ConcreteTypeDescriptions.end()) return I->second;
|
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
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
|
|
|
// Check to see if the Type is already on the stack...
|
|
|
|
unsigned Slot = 0, CurSize = TypeStack.size();
|
|
|
|
while (Slot < CurSize && TypeStack[Slot] != Ty) ++Slot; // Scan for type
|
2005-04-21 23:48:37 +00:00
|
|
|
|
|
|
|
// This is another base case for the recursion. In this case, we know
|
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
|
|
|
// that we have looped back to a type that we have previously visited.
|
|
|
|
// Generate the appropriate upreference to handle this.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
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
|
|
|
if (Slot < CurSize)
|
|
|
|
return "\\" + utostr(CurSize-Slot); // Here's the upreference
|
|
|
|
|
|
|
|
// Recursive case: derived types...
|
|
|
|
std::string Result;
|
|
|
|
TypeStack.push_back(Ty); // Add us to the stack..
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
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
|
|
|
case Type::FunctionTyID: {
|
|
|
|
const FunctionType *FTy = cast<FunctionType>(Ty);
|
|
|
|
Result = getTypeDescription(FTy->getReturnType(), TypeStack) + " (";
|
2004-02-09 04:14:01 +00:00
|
|
|
for (FunctionType::param_iterator I = FTy->param_begin(),
|
|
|
|
E = FTy->param_end(); I != E; ++I) {
|
|
|
|
if (I != FTy->param_begin())
|
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
|
|
|
Result += ", ";
|
|
|
|
Result += getTypeDescription(*I, TypeStack);
|
|
|
|
}
|
|
|
|
if (FTy->isVarArg()) {
|
2004-02-09 04:14:01 +00:00
|
|
|
if (FTy->getNumParams()) Result += ", ";
|
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
|
|
|
Result += "...";
|
|
|
|
}
|
|
|
|
Result += ")";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
|
|
|
const StructType *STy = cast<StructType>(Ty);
|
|
|
|
Result = "{ ";
|
2004-02-09 04:37:31 +00:00
|
|
|
for (StructType::element_iterator I = STy->element_begin(),
|
|
|
|
E = STy->element_end(); I != E; ++I) {
|
|
|
|
if (I != STy->element_begin())
|
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
|
|
|
Result += ", ";
|
|
|
|
Result += getTypeDescription(*I, TypeStack);
|
|
|
|
}
|
|
|
|
Result += " }";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::PointerTyID: {
|
|
|
|
const PointerType *PTy = cast<PointerType>(Ty);
|
|
|
|
Result = getTypeDescription(PTy->getElementType(), TypeStack) + " *";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
|
|
|
unsigned NumElements = ATy->getNumElements();
|
|
|
|
Result = "[";
|
|
|
|
Result += utostr(NumElements) + " x ";
|
|
|
|
Result += getTypeDescription(ATy->getElementType(), TypeStack) + "]";
|
|
|
|
break;
|
|
|
|
}
|
2004-08-20 06:00:58 +00:00
|
|
|
case Type::PackedTyID: {
|
|
|
|
const PackedType *PTy = cast<PackedType>(Ty);
|
|
|
|
unsigned NumElements = PTy->getNumElements();
|
|
|
|
Result = "<";
|
|
|
|
Result += utostr(NumElements) + " x ";
|
|
|
|
Result += getTypeDescription(PTy->getElementType(), TypeStack) + ">";
|
|
|
|
break;
|
|
|
|
}
|
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
|
|
|
default:
|
|
|
|
Result = "<error>";
|
2003-09-02 22:50:02 +00:00
|
|
|
assert(0 && "Unhandled type in getTypeDescription!");
|
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
|
|
|
}
|
|
|
|
|
|
|
|
TypeStack.pop_back(); // Remove self from stack...
|
|
|
|
|
2003-09-04 23:41:03 +00:00
|
|
|
return Result;
|
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
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static const std::string &getOrCreateDesc(std::map<const Type*,std::string>&Map,
|
|
|
|
const Type *Ty) {
|
|
|
|
std::map<const Type*, std::string>::iterator I = Map.find(Ty);
|
|
|
|
if (I != Map.end()) return I->second;
|
2005-04-21 23:48:37 +00:00
|
|
|
|
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
|
|
|
std::vector<const Type *> TypeStack;
|
2005-03-02 03:54:43 +00:00
|
|
|
std::string Result = getTypeDescription(Ty, TypeStack);
|
|
|
|
return Map[Ty] = Result;
|
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
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const std::string &Type::getDescription() const {
|
|
|
|
if (isAbstract())
|
|
|
|
return getOrCreateDesc(AbstractTypeDescriptions, this);
|
|
|
|
else
|
|
|
|
return getOrCreateDesc(ConcreteTypeDescriptions, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-26 17:01:47 +00:00
|
|
|
bool StructType::indexValid(const Value *V) const {
|
2003-11-25 21:21:46 +00:00
|
|
|
// Structure indexes require unsigned integer constants.
|
2004-04-05 01:30:19 +00:00
|
|
|
if (V->getType() == Type::UIntTy)
|
|
|
|
if (const ConstantUInt *CU = dyn_cast<ConstantUInt>(V))
|
|
|
|
return CU->getValue() < ContainedTys.size();
|
2003-11-25 21:21:46 +00:00
|
|
|
return false;
|
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 {
|
2004-04-05 01:30:19 +00:00
|
|
|
assert(indexValid(V) && "Invalid structure index!");
|
2004-06-04 20:14:29 +00:00
|
|
|
unsigned Idx = (unsigned)cast<ConstantUInt>(V)->getValue();
|
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
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Static 'Type' data
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-07-08 17:30:07 +00:00
|
|
|
namespace {
|
|
|
|
struct PrimType : public Type {
|
|
|
|
PrimType(const char *S, TypeID ID) : Type(S, ID) {}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
static PrimType TheVoidTy ("void" , Type::VoidTyID);
|
|
|
|
static PrimType TheBoolTy ("bool" , Type::BoolTyID);
|
|
|
|
static PrimType TheSByteTy ("sbyte" , Type::SByteTyID);
|
|
|
|
static PrimType TheUByteTy ("ubyte" , Type::UByteTyID);
|
|
|
|
static PrimType TheShortTy ("short" , Type::ShortTyID);
|
|
|
|
static PrimType TheUShortTy("ushort", Type::UShortTyID);
|
|
|
|
static PrimType TheIntTy ("int" , Type::IntTyID);
|
|
|
|
static PrimType TheUIntTy ("uint" , Type::UIntTyID);
|
|
|
|
static PrimType TheLongTy ("long" , Type::LongTyID);
|
|
|
|
static PrimType TheULongTy ("ulong" , Type::ULongTyID);
|
|
|
|
static PrimType TheFloatTy ("float" , Type::FloatTyID);
|
|
|
|
static PrimType TheDoubleTy("double", Type::DoubleTyID);
|
|
|
|
static PrimType TheLabelTy ("label" , Type::LabelTyID);
|
2003-05-22 21:31:52 +00:00
|
|
|
|
|
|
|
Type *Type::VoidTy = &TheVoidTy;
|
|
|
|
Type *Type::BoolTy = &TheBoolTy;
|
|
|
|
Type *Type::SByteTy = &TheSByteTy;
|
|
|
|
Type *Type::UByteTy = &TheUByteTy;
|
|
|
|
Type *Type::ShortTy = &TheShortTy;
|
|
|
|
Type *Type::UShortTy = &TheUShortTy;
|
|
|
|
Type *Type::IntTy = &TheIntTy;
|
|
|
|
Type *Type::UIntTy = &TheUIntTy;
|
|
|
|
Type *Type::LongTy = &TheLongTy;
|
|
|
|
Type *Type::ULongTy = &TheULongTy;
|
|
|
|
Type *Type::FloatTy = &TheFloatTy;
|
|
|
|
Type *Type::DoubleTy = &TheDoubleTy;
|
|
|
|
Type *Type::LabelTy = &TheLabelTy;
|
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
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
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,
|
|
|
|
bool IsVarArgs) : DerivedType(FunctionTyID),
|
2004-02-09 05:40:24 +00:00
|
|
|
isVarArgs(IsVarArgs) {
|
2004-07-07 06:48:27 +00:00
|
|
|
assert((Result->isFirstClassType() || Result == Type::VoidTy ||
|
2005-04-21 23:48:37 +00:00
|
|
|
isa<OpaqueType>(Result)) &&
|
2004-07-06 23:25:19 +00:00
|
|
|
"LLVM functions cannot return aggregates");
|
2003-09-03 14:44:53 +00:00
|
|
|
bool isAbstract = Result->isAbstract();
|
2004-02-09 05:40:24 +00:00
|
|
|
ContainedTys.reserve(Params.size()+1);
|
|
|
|
ContainedTys.push_back(PATypeHandle(Result, this));
|
|
|
|
|
|
|
|
for (unsigned i = 0; i != Params.size(); ++i) {
|
2004-07-13 20:09:51 +00:00
|
|
|
assert((Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])) &&
|
|
|
|
"Function arguments must be value types!");
|
|
|
|
|
2004-02-09 05:40:24 +00:00
|
|
|
ContainedTys.push_back(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
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
StructType::StructType(const std::vector<const Type*> &Types)
|
2001-12-14 16:41:56 +00:00
|
|
|
: CompositeType(StructTyID) {
|
2004-02-09 05:40:24 +00:00
|
|
|
ContainedTys.reserve(Types.size());
|
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) {
|
2004-03-29 00:17:20 +00:00
|
|
|
assert(Types[i] != Type::VoidTy && "Void type for structure field!!");
|
2004-02-09 05:40:24 +00:00
|
|
|
ContainedTys.push_back(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
|
|
|
}
|
|
|
|
|
2004-08-20 06:00:58 +00:00
|
|
|
PackedType::PackedType(const Type *ElType, unsigned NumEl)
|
|
|
|
: SequentialType(PackedTyID, ElType) {
|
|
|
|
NumElements = NumEl;
|
|
|
|
|
|
|
|
assert(NumEl > 0 && "NumEl of a PackedType must be greater than 0");
|
2005-04-21 23:48:37 +00:00
|
|
|
assert((ElType->isIntegral() || ElType->isFloatingPoint()) &&
|
2004-08-20 06:00:58 +00:00
|
|
|
"Elements of a PackedType must be a primitive type");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-12-14 16:41:56 +00:00
|
|
|
PointerType::PointerType(const Type *E) : SequentialType(PointerTyID, E) {
|
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
|
|
|
}
|
|
|
|
|
|
|
|
OpaqueType::OpaqueType() : DerivedType(OpaqueTyID) {
|
2001-09-07 16:56:42 +00:00
|
|
|
setAbstract(true);
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "Derived new type: " << *this << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
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() {
|
|
|
|
if (!ContainedTys.empty()) {
|
|
|
|
while (ContainedTys.size() > 1)
|
|
|
|
ContainedTys.pop_back();
|
2005-04-21 23:48:37 +00:00
|
|
|
|
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.
|
|
|
|
static Type *AlwaysOpaqueTy = OpaqueType::get();
|
|
|
|
static PATypeHolder Holder(AlwaysOpaqueTy);
|
|
|
|
ContainedTys[0] = AlwaysOpaqueTy;
|
|
|
|
}
|
2003-10-13 14:03:36 +00:00
|
|
|
}
|
|
|
|
|
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) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
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
|
|
|
|
2003-10-13 14:55:56 +00:00
|
|
|
std::map<const Type*, const Type*>::iterator It = EqTypes.lower_bound(Ty);
|
|
|
|
if (It != EqTypes.end() && It->first == Ty)
|
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
|
|
|
//
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
|
|
|
|
return TypesEqual(PTy->getElementType(),
|
|
|
|
cast<PointerType>(Ty2)->getElementType(), EqTypes);
|
|
|
|
} 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;
|
|
|
|
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);
|
2004-08-20 06:00:58 +00:00
|
|
|
} else if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) {
|
|
|
|
const PackedType *PTy2 = cast<PackedType>(Ty2);
|
|
|
|
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;
|
2004-02-09 04:14:01 +00:00
|
|
|
for (unsigned i = 0, e = FTy2->getNumParams(); i != e; ++i)
|
|
|
|
if (!TypesEqual(FTy->getParamType(i), FTy2->getParamType(i), EqTypes))
|
2003-10-13 14:55:56 +00:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
assert(0 && "Unknown derived type!");
|
|
|
|
return false;
|
2001-10-13 07:01:33 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
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;
|
2001-09-07 16:56: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,
|
2004-02-09 20:23:44 +00:00
|
|
|
std::set<const Type*> &VisitedTypes) {
|
|
|
|
if (TargetTy == CurTy) return true;
|
|
|
|
if (!CurTy->isAbstract()) return false;
|
|
|
|
|
2004-11-16 20:30:53 +00:00
|
|
|
if (!VisitedTypes.insert(CurTy).second)
|
|
|
|
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,
|
|
|
|
std::set<const Type*> &VisitedTypes) {
|
|
|
|
if (TargetTy == CurTy) return true;
|
|
|
|
|
|
|
|
if (!VisitedTypes.insert(CurTy).second)
|
|
|
|
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
|
|
|
|
2004-02-09 16:35:14 +00:00
|
|
|
/// TypeHasCycleThroughItself - Return true if the specified type has a cycle
|
|
|
|
/// back to itself.
|
|
|
|
static bool TypeHasCycleThroughItself(const Type *Ty) {
|
|
|
|
std::set<const Type*> 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;
|
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-09-07 16:56:42 +00:00
|
|
|
// Derived Type Factory Functions
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// TypeMap - Make sure that only one instance of a particular type may be
|
|
|
|
// created on any given run of the compiler... note that this involves updating
|
2004-02-09 16:35:14 +00:00
|
|
|
// our map if an abstract type gets refined somehow.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-11-19 06:14:38 +00:00
|
|
|
namespace llvm {
|
2001-09-07 16:56:42 +00:00
|
|
|
template<class ValType, class TypeClass>
|
2003-10-03 18:46:24 +00:00
|
|
|
class TypeMap {
|
2004-02-09 16:35:14 +00:00
|
|
|
std::map<ValType, PATypeHolder> Map;
|
|
|
|
|
2004-11-16 20:39:04 +00:00
|
|
|
/// TypesByHash - Keep track of types by their structure hash value. Note
|
|
|
|
/// that we only keep track of types that have cycles through themselves in
|
|
|
|
/// this map.
|
2004-02-09 18:32:40 +00:00
|
|
|
///
|
|
|
|
std::multimap<unsigned, PATypeHolder> TypesByHash;
|
2004-11-19 16:39:44 +00:00
|
|
|
|
|
|
|
friend void Type::clearAllTypeMaps();
|
|
|
|
|
|
|
|
private:
|
|
|
|
void clear(std::vector<Type *> &DerivedTypes) {
|
2005-04-21 23:48:37 +00:00
|
|
|
for (typename std::map<ValType, PATypeHolder>::iterator I = Map.begin(),
|
2004-11-19 16:39:44 +00:00
|
|
|
E = Map.end(); I != E; ++I)
|
|
|
|
DerivedTypes.push_back(I->second.get());
|
|
|
|
TypesByHash.clear();
|
|
|
|
Map.clear();
|
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2004-02-09 16:35:14 +00:00
|
|
|
typedef typename std::map<ValType, PATypeHolder>::iterator iterator;
|
2001-09-07 16:56:42 +00:00
|
|
|
~TypeMap() { print("ON EXIT"); }
|
2001-07-25 22:47:55 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
inline TypeClass *get(const ValType &V) {
|
2003-09-05 02:21:39 +00:00
|
|
|
iterator I = Map.find(V);
|
2003-12-31 03:19:37 +00:00
|
|
|
return I != Map.end() ? cast<TypeClass>((Type*)I->second.get()) : 0;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2001-07-25 22:47:55 +00:00
|
|
|
|
2004-02-09 18:32:40 +00:00
|
|
|
inline void add(const ValType &V, TypeClass *Ty) {
|
|
|
|
Map.insert(std::make_pair(V, Ty));
|
|
|
|
|
|
|
|
// If this type has a cycle, remember it.
|
|
|
|
TypesByHash.insert(std::make_pair(ValType::hashTypeStructure(Ty), Ty));
|
2001-09-07 16:56:42 +00:00
|
|
|
print("add");
|
|
|
|
}
|
|
|
|
|
2004-02-09 18:32:40 +00:00
|
|
|
void RemoveFromTypesByHash(unsigned Hash, const Type *Ty) {
|
2005-04-21 23:48:37 +00:00
|
|
|
std::multimap<unsigned, PATypeHolder>::iterator I =
|
2004-02-09 18:32:40 +00:00
|
|
|
TypesByHash.lower_bound(Hash);
|
|
|
|
while (I->second != Ty) {
|
|
|
|
++I;
|
|
|
|
assert(I != TypesByHash.end() && I->first == Hash);
|
|
|
|
}
|
|
|
|
TypesByHash.erase(I);
|
2003-09-05 02:21:39 +00:00
|
|
|
}
|
|
|
|
|
2003-12-31 02:50:02 +00:00
|
|
|
/// finishRefinement - This method is called after we have updated an existing
|
|
|
|
/// type with its new components. We must now either merge the type away with
|
|
|
|
/// some other type or reinstall it in the map with it's new configuration.
|
|
|
|
/// The specified iterator tells us what the type USED to look like.
|
2004-02-09 16:35:14 +00:00
|
|
|
void finishRefinement(TypeClass *Ty, const DerivedType *OldType,
|
|
|
|
const Type *NewType) {
|
|
|
|
assert((Ty->isAbstract() || !OldType->isAbstract()) &&
|
|
|
|
"Refining a non-abstract type!");
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
|
|
|
std::cerr << "refineAbstractTy(" << (void*)OldType << "[" << *OldType
|
|
|
|
<< "], " << (void*)NewType << " [" << *NewType << "])\n";
|
|
|
|
#endif
|
|
|
|
|
2003-12-31 03:19:37 +00:00
|
|
|
// Make a temporary type holder for the type so that it doesn't disappear on
|
|
|
|
// us when we erase the entry from the map.
|
2004-02-09 16:35:14 +00:00
|
|
|
PATypeHolder TyHolder = Ty;
|
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
// The old record is now out-of-date, because one of the children has been
|
|
|
|
// updated. Remove the obsolete entry from the map.
|
2004-02-09 18:32:40 +00:00
|
|
|
Map.erase(ValType::get(Ty));
|
2003-10-03 18:46:24 +00:00
|
|
|
|
2004-02-09 18:32:40 +00:00
|
|
|
// Remember the structural hash for the type before we start hacking on it,
|
2004-11-16 20:39:04 +00:00
|
|
|
// in case we need it later.
|
2004-02-09 18:32:40 +00:00
|
|
|
unsigned OldTypeHash = ValType::hashTypeStructure(Ty);
|
|
|
|
|
|
|
|
// Find the type element we are refining... and change it now!
|
2004-02-09 16:35:14 +00:00
|
|
|
for (unsigned i = 0, e = Ty->ContainedTys.size(); i != e; ++i)
|
|
|
|
if (Ty->ContainedTys[i] == OldType) {
|
|
|
|
Ty->ContainedTys[i].removeUserFromConcrete();
|
|
|
|
Ty->ContainedTys[i] = NewType;
|
2003-11-19 19:10:23 +00:00
|
|
|
}
|
2004-02-09 18:32:40 +00:00
|
|
|
|
|
|
|
unsigned TypeHash = ValType::hashTypeStructure(Ty);
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-11-19 19:10:23 +00:00
|
|
|
// If there are no cycles going through this node, we can do a simple,
|
|
|
|
// efficient lookup in the map, instead of an inefficient nasty linear
|
|
|
|
// lookup.
|
2004-11-16 20:39:04 +00:00
|
|
|
if (!Ty->isAbstract() || !TypeHasCycleThroughItself(Ty)) {
|
|
|
|
typename std::map<ValType, PATypeHolder>::iterator I;
|
|
|
|
bool Inserted;
|
|
|
|
|
|
|
|
ValType V = ValType::get(Ty);
|
|
|
|
tie(I, Inserted) = Map.insert(std::make_pair(V, Ty));
|
|
|
|
if (!Inserted) {
|
|
|
|
// Refined to a different type altogether?
|
|
|
|
RemoveFromTypesByHash(TypeHash, Ty);
|
|
|
|
|
2003-11-19 19:10:23 +00:00
|
|
|
// We already have this type in the table. Get rid of the newly refined
|
|
|
|
// type.
|
2003-12-31 03:19:37 +00:00
|
|
|
TypeClass *NewTy = cast<TypeClass>((Type*)I->second.get());
|
2003-10-03 18:57:54 +00:00
|
|
|
Ty->refineAbstractTypeTo(NewTy);
|
2003-09-05 02:39:52 +00:00
|
|
|
return;
|
2003-09-05 02:21:39 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-11-19 19:10:23 +00:00
|
|
|
} else {
|
|
|
|
// Now we check to see if there is an existing entry in the table which is
|
|
|
|
// structurally identical to the newly refined type. If so, this type
|
|
|
|
// gets refined to the pre-existing type.
|
|
|
|
//
|
2004-11-16 20:39:04 +00:00
|
|
|
std::multimap<unsigned, PATypeHolder>::iterator I, E, Entry;
|
|
|
|
tie(I, E) = TypesByHash.equal_range(OldTypeHash);
|
2004-02-09 18:32:40 +00:00
|
|
|
Entry = E;
|
|
|
|
for (; I != E; ++I) {
|
|
|
|
if (I->second != Ty) {
|
|
|
|
if (TypesEqual(Ty, I->second)) {
|
|
|
|
assert(Ty->isAbstract() && "Replacing a non-abstract type?");
|
|
|
|
TypeClass *NewTy = cast<TypeClass>((Type*)I->second.get());
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2004-02-09 18:32:40 +00:00
|
|
|
if (Entry == E) {
|
|
|
|
// Find the location of Ty in the TypesByHash structure.
|
|
|
|
while (I->second != Ty) {
|
|
|
|
++I;
|
|
|
|
assert(I != E && "Structure doesn't contain type??");
|
|
|
|
}
|
|
|
|
Entry = I;
|
|
|
|
}
|
|
|
|
|
|
|
|
TypesByHash.erase(Entry);
|
|
|
|
Ty->refineAbstractTypeTo(NewTy);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else {
|
2005-04-21 23:48:37 +00:00
|
|
|
// Remember the position of
|
2004-02-09 18:32:40 +00:00
|
|
|
Entry = I;
|
2003-11-19 19:10:23 +00:00
|
|
|
}
|
2004-02-09 16:35:14 +00:00
|
|
|
}
|
2004-11-16 20:39:04 +00:00
|
|
|
|
|
|
|
|
|
|
|
// If there is no existing type of the same structure, we reinsert an
|
|
|
|
// updated record into the map.
|
|
|
|
Map.insert(std::make_pair(ValType::get(Ty), Ty));
|
2003-11-19 19:10:23 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2004-11-16 20:39:04 +00:00
|
|
|
// If the hash codes differ, update TypesByHash
|
2004-02-09 18:32:40 +00:00
|
|
|
if (TypeHash != OldTypeHash) {
|
|
|
|
RemoveFromTypesByHash(OldTypeHash, Ty);
|
|
|
|
TypesByHash.insert(std::make_pair(TypeHash, Ty));
|
|
|
|
}
|
|
|
|
|
2003-09-05 02:39:52 +00:00
|
|
|
// If the type is currently thought to be abstract, rescan all of our
|
|
|
|
// subtypes to see if the type has just become concrete!
|
2004-10-07 19:20:48 +00:00
|
|
|
if (Ty->isAbstract())
|
|
|
|
Ty->PromoteAbstractToConcrete();
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2002-04-04 19:26:02 +00:00
|
|
|
void print(const char *Arg) const {
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "TypeMap<>::" << Arg << " table contents:\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
unsigned i = 0;
|
2004-02-09 16:35:14 +00:00
|
|
|
for (typename std::map<ValType, PATypeHolder>::const_iterator I
|
|
|
|
= Map.begin(), E = Map.end(); I != E; ++I)
|
2005-04-21 23:48:37 +00:00
|
|
|
std::cerr << " " << (++i) << ". " << (void*)I->second.get() << " "
|
2003-12-31 03:19:37 +00:00
|
|
|
<< *I->second.get() << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2002-04-04 19:26:02 +00:00
|
|
|
|
|
|
|
void dump() const { print("dump output"); }
|
2001-09-07 16:56:42 +00:00
|
|
|
};
|
2003-11-19 06:14:38 +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
|
|
|
//
|
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
// FunctionValType - Define a class to hold the key that goes into the TypeMap
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-11-19 06:14:38 +00:00
|
|
|
namespace llvm {
|
2003-10-03 18:46:24 +00:00
|
|
|
class FunctionValType {
|
|
|
|
const Type *RetTy;
|
|
|
|
std::vector<const Type*> ArgTypes;
|
2001-10-13 07:01:33 +00:00
|
|
|
bool isVarArg;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2003-05-22 21:21:43 +00:00
|
|
|
FunctionValType(const Type *ret, const std::vector<const Type*> &args,
|
2003-10-03 18:46:24 +00:00
|
|
|
bool IVA) : RetTy(ret), isVarArg(IVA) {
|
2001-09-07 16:56:42 +00:00
|
|
|
for (unsigned i = 0; i < args.size(); ++i)
|
2003-10-03 18:46:24 +00:00
|
|
|
ArgTypes.push_back(args[i]);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-09-05 02:21:39 +00:00
|
|
|
static FunctionValType get(const FunctionType *FT);
|
|
|
|
|
2004-02-09 16:35:14 +00:00
|
|
|
static unsigned hashTypeStructure(const FunctionType *FT) {
|
2004-02-09 18:32:40 +00:00
|
|
|
return FT->getNumParams()*2+FT->isVarArg();
|
2004-02-09 16:35:14 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Subclass should override this... to update self as usual
|
2003-10-03 18:46:24 +00:00
|
|
|
void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
2001-09-07 16:56:42 +00:00
|
|
|
if (RetTy == OldType) RetTy = NewType;
|
2002-04-07 06:14:56 +00:00
|
|
|
for (unsigned i = 0, e = ArgTypes.size(); i != e; ++i)
|
2001-09-07 16:56:42 +00:00
|
|
|
if (ArgTypes[i] == OldType) ArgTypes[i] = NewType;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
inline bool operator<(const FunctionValType &MTV) const {
|
2003-10-03 18:46:24 +00:00
|
|
|
if (RetTy < MTV.RetTy) return true;
|
|
|
|
if (RetTy > MTV.RetTy) return false;
|
2001-10-13 07:01:33 +00:00
|
|
|
|
|
|
|
if (ArgTypes < MTV.ArgTypes) return true;
|
2003-10-03 18:46:24 +00:00
|
|
|
return ArgTypes == MTV.ArgTypes && isVarArg < MTV.isVarArg;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
};
|
2003-11-19 06:14:38 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
// Define the actual map itself now...
|
2002-03-29 03:44:36 +00:00
|
|
|
static TypeMap<FunctionValType, FunctionType> FunctionTypes;
|
|
|
|
|
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));
|
2003-10-03 18:46:24 +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,
|
2002-03-29 03:44:36 +00:00
|
|
|
bool isVarArg) {
|
2003-10-03 18:46:24 +00:00
|
|
|
FunctionValType VT(ReturnType, Params, isVarArg);
|
2002-03-29 03:44:36 +00:00
|
|
|
FunctionType *MT = FunctionTypes.get(VT);
|
2001-09-07 16:56:42 +00:00
|
|
|
if (MT) return MT;
|
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
FunctionTypes.add(VT, MT = new FunctionType(ReturnType, Params, isVarArg));
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Derived new type: " << MT << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return MT;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Array Type Factory...
|
|
|
|
//
|
2003-11-19 06:14:38 +00:00
|
|
|
namespace llvm {
|
2003-10-03 18:46:24 +00:00
|
|
|
class ArrayValType {
|
|
|
|
const Type *ValTy;
|
2005-01-08 20:19:51 +00:00
|
|
|
uint64_t Size;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2005-01-08 20:19:51 +00:00
|
|
|
ArrayValType(const Type *val, uint64_t sz) : ValTy(val), Size(sz) {}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
static ArrayValType get(const ArrayType *AT) {
|
|
|
|
return ArrayValType(AT->getElementType(), AT->getNumElements());
|
|
|
|
}
|
2003-09-05 02:21:39 +00:00
|
|
|
|
2004-02-09 16:35:14 +00:00
|
|
|
static unsigned hashTypeStructure(const ArrayType *AT) {
|
2005-01-08 20:19:51 +00:00
|
|
|
return (unsigned)AT->getNumElements();
|
2004-02-09 16:35:14 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Subclass should override this... to update self as usual
|
2003-10-03 18:46:24 +00:00
|
|
|
void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
2002-04-07 06:14:56 +00:00
|
|
|
assert(ValTy == OldType);
|
|
|
|
ValTy = NewType;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
inline bool operator<(const ArrayValType &MTV) const {
|
|
|
|
if (Size < MTV.Size) return true;
|
2003-10-03 18:46:24 +00:00
|
|
|
return Size == MTV.Size && ValTy < MTV.ValTy;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
};
|
2003-11-19 06:14:38 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
static TypeMap<ArrayValType, ArrayType> ArrayTypes;
|
|
|
|
|
2003-09-05 02:21:39 +00:00
|
|
|
|
2005-01-08 20:19:51 +00:00
|
|
|
ArrayType *ArrayType::get(const Type *ElementType, uint64_t NumElements) {
|
2001-07-08 23:22:50 +00:00
|
|
|
assert(ElementType && "Can't get array of null types!");
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
ArrayValType AVT(ElementType, NumElements);
|
2001-09-07 16:56:42 +00:00
|
|
|
ArrayType *AT = ArrayTypes.get(AVT);
|
|
|
|
if (AT) return AT; // Found a match, return it!
|
|
|
|
|
|
|
|
// Value not found. Derive a new type!
|
|
|
|
ArrayTypes.add(AVT, AT = new ArrayType(ElementType, NumElements));
|
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "Derived new type: " << *AT << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return AT;
|
|
|
|
}
|
|
|
|
|
2004-08-20 06:00:58 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Packed Type Factory...
|
|
|
|
//
|
|
|
|
namespace llvm {
|
|
|
|
class PackedValType {
|
|
|
|
const Type *ValTy;
|
|
|
|
unsigned Size;
|
|
|
|
public:
|
|
|
|
PackedValType(const Type *val, int sz) : ValTy(val), Size(sz) {}
|
|
|
|
|
|
|
|
static PackedValType get(const PackedType *PT) {
|
|
|
|
return PackedValType(PT->getElementType(), PT->getNumElements());
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned hashTypeStructure(const PackedType *PT) {
|
|
|
|
return PT->getNumElements();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
|
|
|
assert(ValTy == OldType);
|
|
|
|
ValTy = NewType;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool operator<(const PackedValType &MTV) const {
|
|
|
|
if (Size < MTV.Size) return true;
|
|
|
|
return Size == MTV.Size && ValTy < MTV.ValTy;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
static TypeMap<PackedValType, PackedType> PackedTypes;
|
|
|
|
|
|
|
|
|
|
|
|
PackedType *PackedType::get(const Type *ElementType, unsigned NumElements) {
|
|
|
|
assert(ElementType && "Can't get packed of null types!");
|
|
|
|
|
|
|
|
PackedValType PVT(ElementType, NumElements);
|
|
|
|
PackedType *PT = PackedTypes.get(PVT);
|
|
|
|
if (PT) return PT; // Found a match, return it!
|
|
|
|
|
|
|
|
// Value not found. Derive a new type!
|
|
|
|
PackedTypes.add(PVT, PT = new PackedType(ElementType, NumElements));
|
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
|
|
|
std::cerr << "Derived new type: " << *PT << "\n";
|
|
|
|
#endif
|
|
|
|
return PT;
|
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Struct Type Factory...
|
|
|
|
//
|
|
|
|
|
2003-11-19 06:14:38 +00:00
|
|
|
namespace llvm {
|
2001-09-07 16:56:42 +00:00
|
|
|
// StructValType - Define a class to hold the key that goes into the TypeMap
|
|
|
|
//
|
2003-10-03 18:46:24 +00:00
|
|
|
class StructValType {
|
|
|
|
std::vector<const Type*> ElTypes;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2003-10-03 18:46:24 +00:00
|
|
|
StructValType(const std::vector<const Type*> &args) : ElTypes(args) {}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
static StructValType get(const StructType *ST) {
|
|
|
|
std::vector<const Type *> ElTypes;
|
2004-02-09 04:37:31 +00:00
|
|
|
ElTypes.reserve(ST->getNumElements());
|
|
|
|
for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
|
|
|
|
ElTypes.push_back(ST->getElementType(i));
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
return StructValType(ElTypes);
|
|
|
|
}
|
2003-09-05 02:21:39 +00:00
|
|
|
|
2004-02-09 16:35:14 +00:00
|
|
|
static unsigned hashTypeStructure(const StructType *ST) {
|
2004-02-09 18:32:40 +00:00
|
|
|
return ST->getNumElements();
|
2004-02-09 16:35:14 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Subclass should override this... to update self as usual
|
2003-10-03 18:46:24 +00:00
|
|
|
void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
2001-09-07 16:56:42 +00:00
|
|
|
for (unsigned i = 0; i < ElTypes.size(); ++i)
|
|
|
|
if (ElTypes[i] == OldType) ElTypes[i] = NewType;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
inline bool operator<(const StructValType &STV) const {
|
|
|
|
return ElTypes < STV.ElTypes;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
};
|
2003-11-19 06:14:38 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
static TypeMap<StructValType, StructType> StructTypes;
|
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
StructType *StructType::get(const std::vector<const Type*> &ETypes) {
|
2003-10-03 18:46:24 +00:00
|
|
|
StructValType STV(ETypes);
|
2001-09-07 16:56:42 +00:00
|
|
|
StructType *ST = StructTypes.get(STV);
|
|
|
|
if (ST) return ST;
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// Value not found. Derive a new type!
|
2001-09-07 16:56:42 +00:00
|
|
|
StructTypes.add(STV, ST = new StructType(ETypes));
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "Derived new type: " << *ST << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return ST;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-09-05 02:21:39 +00:00
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Pointer Type Factory...
|
|
|
|
//
|
|
|
|
|
|
|
|
// PointerValType - Define a class to hold the key that goes into the TypeMap
|
|
|
|
//
|
2003-11-19 06:14:38 +00:00
|
|
|
namespace llvm {
|
2003-10-03 18:46:24 +00:00
|
|
|
class PointerValType {
|
|
|
|
const Type *ValTy;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2003-10-03 18:46:24 +00:00
|
|
|
PointerValType(const Type *val) : ValTy(val) {}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
static PointerValType get(const PointerType *PT) {
|
|
|
|
return PointerValType(PT->getElementType());
|
|
|
|
}
|
2003-09-05 02:21:39 +00:00
|
|
|
|
2004-02-09 16:35:14 +00:00
|
|
|
static unsigned hashTypeStructure(const PointerType *PT) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Subclass should override this... to update self as usual
|
2003-10-03 18:46:24 +00:00
|
|
|
void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
2002-04-07 06:14:56 +00:00
|
|
|
assert(ValTy == OldType);
|
|
|
|
ValTy = NewType;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
bool operator<(const PointerValType &MTV) const {
|
|
|
|
return ValTy < MTV.ValTy;
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
};
|
2003-11-19 06:14:38 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
static TypeMap<PointerValType, PointerType> PointerTypes;
|
|
|
|
|
|
|
|
PointerType *PointerType::get(const Type *ValueType) {
|
|
|
|
assert(ValueType && "Can't get a pointer to <null> type!");
|
2005-04-27 18:57:15 +00:00
|
|
|
// FIXME: The sparc backend makes void pointers, which is horribly broken.
|
|
|
|
// "Fix" it, then reenable this assertion.
|
|
|
|
//assert(ValueType != Type::VoidTy &&
|
|
|
|
// "Pointer to void is not valid, use sbyte* instead!");
|
2003-10-03 18:46:24 +00:00
|
|
|
PointerValType PVT(ValueType);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
PointerType *PT = PointerTypes.get(PVT);
|
|
|
|
if (PT) return PT;
|
|
|
|
|
|
|
|
// Value not found. Derive a new type!
|
|
|
|
PointerTypes.add(PVT, PT = new PointerType(ValueType));
|
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "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
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Derived Type Refinement Functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// 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
|
|
|
//
|
|
|
|
void DerivedType::removeAbstractTypeUser(AbstractTypeUser *U) const {
|
|
|
|
// 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
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << " remAbstractTypeUser[" << (void*)this << ", "
|
2003-09-04 23:46:03 +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
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "DELETEing unused abstract type: <" << *this
|
2003-05-22 21:21:43 +00:00
|
|
|
<< ">[" << (void*)this << "]" << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2002-04-05 19:44:07 +00:00
|
|
|
delete this; // No users of this abstract type!
|
2001-06-06 20:29:01 +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
|
|
|
|
2003-10-03 18:57:54 +00:00
|
|
|
// refineAbstractTypeTo - This function is used to 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.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-10-03 18:57:54 +00:00
|
|
|
void DerivedType::refineAbstractTypeTo(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!");
|
|
|
|
|
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!
|
|
|
|
AbstractTypeDescriptions.clear();
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "REFINING abstract type [" << (void*)this << " "
|
2003-09-04 23:46:03 +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);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
// Any PATypeHolders referring to this type will now automatically forward to
|
|
|
|
// 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();
|
|
|
|
|
2003-10-03 04:48:21 +00:00
|
|
|
unsigned OldSize = AbstractTypeUsers.size();
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-10-03 04:48:21 +00:00
|
|
|
std::cerr << " REFINING user " << OldSize-1 << "[" << (void*)User
|
|
|
|
<< "] 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
|
|
|
}
|
|
|
|
|
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
|
2003-09-04 23:46:03 +00:00
|
|
|
std::cerr << "typeIsREFINED type: " << (void*)this << " " << *this << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2002-04-07 06:14:56 +00:00
|
|
|
|
2003-10-03 18:46:24 +00:00
|
|
|
unsigned OldSize = AbstractTypeUsers.size();
|
|
|
|
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-06-06 20:29:01 +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) {
|
2004-02-09 16:35:14 +00:00
|
|
|
FunctionTypes.finishRefinement(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void FunctionType::typeBecameConcrete(const DerivedType *AbsTy) {
|
|
|
|
refineAbstractType(AbsTy, 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) {
|
2004-02-09 16:35:14 +00:00
|
|
|
ArrayTypes.finishRefinement(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ArrayType::typeBecameConcrete(const DerivedType *AbsTy) {
|
|
|
|
refineAbstractType(AbsTy, 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.
|
|
|
|
//
|
|
|
|
void PackedType::refineAbstractType(const DerivedType *OldType,
|
|
|
|
const Type *NewType) {
|
|
|
|
PackedTypes.finishRefinement(this, OldType, NewType);
|
|
|
|
}
|
|
|
|
|
|
|
|
void PackedType::typeBecameConcrete(const DerivedType *AbsTy) {
|
|
|
|
refineAbstractType(AbsTy, 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 StructType::refineAbstractType(const DerivedType *OldType,
|
2004-07-04 12:14:17 +00:00
|
|
|
const Type *NewType) {
|
2004-02-09 16:35:14 +00:00
|
|
|
StructTypes.finishRefinement(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void StructType::typeBecameConcrete(const DerivedType *AbsTy) {
|
|
|
|
refineAbstractType(AbsTy, 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) {
|
2004-02-09 16:35:14 +00:00
|
|
|
PointerTypes.finishRefinement(this, OldType, NewType);
|
2003-10-03 18:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void PointerType::typeBecameConcrete(const DerivedType *AbsTy) {
|
|
|
|
refineAbstractType(AbsTy, AbsTy);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2004-07-04 12:14:17 +00:00
|
|
|
|
|
|
|
bool SequentialType::indexValid(const Value *V) const {
|
|
|
|
const Type *Ty = V->getType();
|
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
case Type::IntTyID:
|
|
|
|
case Type::UIntTyID:
|
|
|
|
case Type::LongTyID:
|
|
|
|
case Type::ULongTyID:
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
std::ostream &operator<<(std::ostream &OS, const Type *T) {
|
|
|
|
if (T == 0)
|
|
|
|
OS << "<null> value!\n";
|
|
|
|
else
|
|
|
|
T->print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::ostream &operator<<(std::ostream &OS, const Type &T) {
|
|
|
|
T.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-11-19 16:39:44 +00:00
|
|
|
/// clearAllTypeMaps - This method frees all internal memory used by the
|
|
|
|
/// type subsystem, which can be used in environments where this memory is
|
|
|
|
/// otherwise reported as a leak.
|
|
|
|
void Type::clearAllTypeMaps() {
|
|
|
|
std::vector<Type *> DerivedTypes;
|
|
|
|
|
|
|
|
FunctionTypes.clear(DerivedTypes);
|
|
|
|
PointerTypes.clear(DerivedTypes);
|
|
|
|
StructTypes.clear(DerivedTypes);
|
|
|
|
ArrayTypes.clear(DerivedTypes);
|
|
|
|
PackedTypes.clear(DerivedTypes);
|
|
|
|
|
2005-04-21 23:48:37 +00:00
|
|
|
for(std::vector<Type *>::iterator I = DerivedTypes.begin(),
|
2004-11-19 16:39:44 +00:00
|
|
|
E = DerivedTypes.end(); I != E; ++I)
|
|
|
|
(*I)->ContainedTys.clear();
|
|
|
|
for(std::vector<Type *>::iterator I = DerivedTypes.begin(),
|
|
|
|
E = DerivedTypes.end(); I != E; ++I)
|
|
|
|
delete *I;
|
|
|
|
DerivedTypes.clear();
|
|
|
|
}
|
|
|
|
|
2004-07-04 12:14:17 +00:00
|
|
|
// vim: sw=2
|