2001-06-06 20:29:01 +00:00
|
|
|
//===-- Type.cpp - Implement the Type class ----------------------*- C++ -*--=//
|
|
|
|
//
|
|
|
|
// This file implements the Type class for the VMCore library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#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"
|
2001-11-27 00:03:19 +00:00
|
|
|
#include "Support/StringExtras.h"
|
|
|
|
#include "Support/STLExtras.h"
|
2002-04-07 06:14:56 +00:00
|
|
|
#include <algorithm>
|
2002-01-20 22:54:45 +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
|
|
|
|
// a single cannonical version of a type.
|
|
|
|
//
|
|
|
|
//#define DEBUG_MERGE_TYPES 1
|
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Type Class Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
static unsigned CurUID = 0;
|
2003-05-22 21:21:43 +00:00
|
|
|
static std::vector<const Type *> UIDMappings;
|
2001-06-06 20:29:01 +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
|
|
|
// 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;
|
|
|
|
|
2002-04-04 19:26:02 +00:00
|
|
|
void PATypeHolder::dump() const {
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "PATypeHolder(" << (void*)this << ")\n";
|
2002-04-04 19:26:02 +00:00
|
|
|
}
|
|
|
|
|
2002-04-05 22:25:26 +00:00
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
Type::Type(const std::string &name, PrimitiveID id)
|
2001-09-07 16:56:42 +00:00
|
|
|
: Value(Type::TypeTy, Value::TypeVal) {
|
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
|
|
|
UID = CurUID++; // Assign types UID's as they are created
|
|
|
|
UIDMappings.push_back(this);
|
|
|
|
}
|
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
void Type::setName(const std::string &Name, SymbolTable *ST) {
|
2001-09-07 16:56:42 +00:00
|
|
|
assert(ST && "Type::setName - Must provide symbol table argument!");
|
|
|
|
|
|
|
|
if (Name.size()) ST->insert(Name, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
const Type *Type::getUniqueIDType(unsigned UID) {
|
|
|
|
assert(UID < UIDMappings.size() &&
|
|
|
|
"Type::getPrimitiveType: UID out of range!");
|
|
|
|
return UIDMappings[UID];
|
|
|
|
}
|
|
|
|
|
|
|
|
const Type *Type::getPrimitiveType(PrimitiveID IDNumber) {
|
|
|
|
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 TypeTyID : return TypeTy;
|
|
|
|
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
|
|
|
|
|
|
|
if (getPrimitiveID() == Ty->getPrimitiveID())
|
|
|
|
return true; // Handles identity cast, and cast of differing pointer types
|
|
|
|
|
|
|
|
// Now we know that they are two differing primitive or pointer types
|
|
|
|
switch (getPrimitiveID()) {
|
|
|
|
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;
|
|
|
|
case Type::ULongTyID:
|
|
|
|
case Type::LongTyID:
|
|
|
|
case Type::PointerTyID:
|
2002-04-27 02:26:03 +00:00
|
|
|
return Ty == Type::ULongTy || Ty == Type::LongTy || isa<PointerType>(Ty);
|
2001-11-26 17:01:47 +00:00
|
|
|
default:
|
|
|
|
return false; // Other types have no identity values
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-05-06 16:14:39 +00:00
|
|
|
// getPrimitiveSize - Return the basic size of this type if it is a primative
|
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 {
|
|
|
|
switch (getPrimitiveID()) {
|
|
|
|
#define HANDLE_PRIM_TYPE(TY,SIZE) case TY##TyID: return SIZE;
|
|
|
|
#include "llvm/Type.def"
|
|
|
|
default: return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-11-26 17:01:47 +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
|
|
|
// 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;
|
|
|
|
std::string Desc = "opaque"+utostr(Ty->getUniqueID());
|
|
|
|
AbstractTypeDescriptions.insert(std::make_pair(Ty, Desc));
|
|
|
|
return Desc;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
// 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
|
|
|
|
|
|
|
|
// This is another base case for the recursion. In this case, we know
|
|
|
|
// that we have looped back to a type that we have previously visited.
|
|
|
|
// Generate the appropriate upreference to handle this.
|
|
|
|
//
|
|
|
|
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..
|
|
|
|
|
|
|
|
switch (Ty->getPrimitiveID()) {
|
|
|
|
case Type::FunctionTyID: {
|
|
|
|
const FunctionType *FTy = cast<FunctionType>(Ty);
|
|
|
|
Result = getTypeDescription(FTy->getReturnType(), TypeStack) + " (";
|
|
|
|
for (FunctionType::ParamTypes::const_iterator
|
|
|
|
I = FTy->getParamTypes().begin(),
|
|
|
|
E = FTy->getParamTypes().end(); I != E; ++I) {
|
|
|
|
if (I != FTy->getParamTypes().begin())
|
|
|
|
Result += ", ";
|
|
|
|
Result += getTypeDescription(*I, TypeStack);
|
|
|
|
}
|
|
|
|
if (FTy->isVarArg()) {
|
|
|
|
if (!FTy->getParamTypes().empty()) Result += ", ";
|
|
|
|
Result += "...";
|
|
|
|
}
|
|
|
|
Result += ")";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
|
|
|
const StructType *STy = cast<StructType>(Ty);
|
|
|
|
Result = "{ ";
|
|
|
|
for (StructType::ElementTypes::const_iterator
|
|
|
|
I = STy->getElementTypes().begin(),
|
|
|
|
E = STy->getElementTypes().end(); I != E; ++I) {
|
|
|
|
if (I != STy->getElementTypes().begin())
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
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;
|
|
|
|
|
|
|
|
std::vector<const Type *> TypeStack;
|
2003-09-04 23:41:03 +00:00
|
|
|
return Map[Ty] = getTypeDescription(Ty, TypeStack);
|
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 {
|
2001-12-03 22:26:30 +00:00
|
|
|
if (!isa<Constant>(V)) return false;
|
2001-11-26 17:01:47 +00:00
|
|
|
if (V->getType() != Type::UByteTy) return false;
|
2001-12-03 22:26:30 +00:00
|
|
|
unsigned Idx = cast<ConstantUInt>(V)->getValue();
|
2001-11-26 17:01:47 +00:00
|
|
|
return Idx < ETypes.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
// 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 {
|
2001-12-03 22:26:30 +00:00
|
|
|
assert(isa<Constant>(V) && "Structure index must be a constant!!");
|
2001-11-26 17:01:47 +00:00
|
|
|
assert(V->getType() == Type::UByteTy && "Structure index must be ubyte!");
|
2001-12-03 22:26:30 +00:00
|
|
|
unsigned Idx = cast<ConstantUInt>(V)->getValue();
|
2001-11-26 17:01:47 +00:00
|
|
|
assert(Idx < ETypes.size() && "Structure index out of range!");
|
|
|
|
assert(indexValid(V) && "Invalid structure index!"); // Duplicate check
|
|
|
|
|
|
|
|
return ETypes[Idx];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Auxilliary classes
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// These classes are used to implement specialized behavior for each different
|
|
|
|
// type.
|
|
|
|
//
|
2002-09-03 01:08:28 +00:00
|
|
|
struct SignedIntType : public Type {
|
2003-05-22 21:21:43 +00:00
|
|
|
SignedIntType(const std::string &Name, PrimitiveID id) : Type(Name, id) {}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// isSigned - Return whether a numeric type is signed.
|
|
|
|
virtual bool isSigned() const { return 1; }
|
2001-07-21 19:15:26 +00:00
|
|
|
|
2002-09-03 01:08:28 +00:00
|
|
|
// isInteger - Equivalent to isSigned() || isUnsigned, but with only a single
|
2001-07-21 19:15:26 +00:00
|
|
|
// virtual function invocation.
|
|
|
|
//
|
2002-09-03 01:08:28 +00:00
|
|
|
virtual bool isInteger() const { return 1; }
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
2002-09-03 01:08:28 +00:00
|
|
|
struct UnsignedIntType : public Type {
|
2003-05-22 21:21:43 +00:00
|
|
|
UnsignedIntType(const std::string &N, PrimitiveID id) : Type(N, id) {}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// isUnsigned - Return whether a numeric type is signed.
|
|
|
|
virtual bool isUnsigned() const { return 1; }
|
2001-07-21 19:15:26 +00:00
|
|
|
|
2002-09-03 01:08:28 +00:00
|
|
|
// isInteger - Equivalent to isSigned() || isUnsigned, but with only a single
|
2001-07-21 19:15:26 +00:00
|
|
|
// virtual function invocation.
|
|
|
|
//
|
2002-09-03 01:08:28 +00:00
|
|
|
virtual bool isInteger() const { return 1; }
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
2003-05-22 21:31:52 +00:00
|
|
|
struct OtherType : public Type {
|
|
|
|
OtherType(const std::string &N, PrimitiveID id) : Type(N, id) {}
|
|
|
|
};
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
static struct TypeType : public Type {
|
|
|
|
TypeType() : Type("type", TypeTyID) {}
|
2003-05-22 21:31:52 +00:00
|
|
|
} TheTypeTy; // Implement the type that is global.
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Static 'Type' data
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2003-05-22 21:31:52 +00:00
|
|
|
static OtherType TheVoidTy ("void" , Type::VoidTyID);
|
|
|
|
static OtherType TheBoolTy ("bool" , Type::BoolTyID);
|
|
|
|
static SignedIntType TheSByteTy ("sbyte" , Type::SByteTyID);
|
|
|
|
static UnsignedIntType TheUByteTy ("ubyte" , Type::UByteTyID);
|
|
|
|
static SignedIntType TheShortTy ("short" , Type::ShortTyID);
|
|
|
|
static UnsignedIntType TheUShortTy("ushort", Type::UShortTyID);
|
|
|
|
static SignedIntType TheIntTy ("int" , Type::IntTyID);
|
|
|
|
static UnsignedIntType TheUIntTy ("uint" , Type::UIntTyID);
|
|
|
|
static SignedIntType TheLongTy ("long" , Type::LongTyID);
|
|
|
|
static UnsignedIntType TheULongTy ("ulong" , Type::ULongTyID);
|
|
|
|
static OtherType TheFloatTy ("float" , Type::FloatTyID);
|
|
|
|
static OtherType TheDoubleTy("double", Type::DoubleTyID);
|
|
|
|
static OtherType TheLabelTy ("label" , Type::LabelTyID);
|
|
|
|
|
|
|
|
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::TypeTy = &TheTypeTy;
|
|
|
|
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,
|
2003-05-22 21:21:43 +00:00
|
|
|
const std::vector<const Type*> &Params,
|
2002-03-29 03:44:36 +00:00
|
|
|
bool IsVarArgs) : DerivedType(FunctionTyID),
|
2003-06-18 19:22:36 +00:00
|
|
|
ResultType(PATypeHandle(Result, this)),
|
2001-09-07 16:56:42 +00:00
|
|
|
isVarArgs(IsVarArgs) {
|
2003-09-03 14:44:53 +00:00
|
|
|
bool isAbstract = Result->isAbstract();
|
2001-09-07 16:56:42 +00:00
|
|
|
ParamTys.reserve(Params.size());
|
2003-09-03 14:44:53 +00:00
|
|
|
for (unsigned i = 0; i < Params.size(); ++i) {
|
2003-06-18 19:22:36 +00:00
|
|
|
ParamTys.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) {
|
2001-09-07 16:56:42 +00:00
|
|
|
ETypes.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) {
|
|
|
|
assert(Types[i] != Type::VoidTy && "Void type in method prototype!!");
|
2003-06-18 19:22:36 +00:00
|
|
|
ETypes.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
|
|
|
}
|
|
|
|
|
2001-12-14 16:41:56 +00:00
|
|
|
ArrayType::ArrayType(const Type *ElType, unsigned NumEl)
|
|
|
|
: 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
|
|
|
}
|
|
|
|
|
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-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Derived new type: " << getDescription() << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-09-02 21:56:34 +00:00
|
|
|
// isTypeAbstract - This is a recursive function that walks a type hierarchy
|
|
|
|
// calculating whether or not a type is abstract. Worst case it will have to do
|
|
|
|
// a lot of traversing if you have some whacko opaque types, but in most cases,
|
|
|
|
// it will do some simple stuff when it hits non-abstract types that aren't
|
|
|
|
// recursive.
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2003-09-02 21:56:34 +00:00
|
|
|
bool Type::isTypeAbstract() {
|
|
|
|
if (!isAbstract()) // Base case for the recursion
|
|
|
|
return false; // Primitive = leaf type
|
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
|
|
|
|
2003-09-02 21:56:34 +00:00
|
|
|
if (isa<OpaqueType>(this)) // Base case for the recursion
|
|
|
|
return true; // This whole type is abstract!
|
|
|
|
|
|
|
|
// We have to guard against recursion. To do this, we temporarily mark this
|
|
|
|
// type as concrete, so that if we get back to here recursively we will think
|
|
|
|
// it's not abstract, and thus not scan it again.
|
|
|
|
setAbstract(false);
|
|
|
|
|
|
|
|
// Scan all of the sub-types. If any of them are abstract, than so is this
|
|
|
|
// one!
|
|
|
|
for (Type::subtype_iterator I = subtype_begin(), E = subtype_end();
|
|
|
|
I != E; ++I)
|
|
|
|
if (const_cast<Type*>(*I)->isTypeAbstract()) {
|
2003-09-02 22:15:15 +00:00
|
|
|
setAbstract(true); // Restore the abstract bit.
|
|
|
|
return true; // This type is abstract if subtype is abstract!
|
2003-09-02 21:56:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Restore the abstract bit.
|
|
|
|
setAbstract(true);
|
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
|
|
|
|
2003-09-02 21:56:34 +00:00
|
|
|
// Nothing looks abstract here...
|
|
|
|
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
|
|
|
// 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,
|
2003-05-22 21:21:43 +00:00
|
|
|
std::map<const Type *, const Type *> &EqTypes) {
|
2001-09-07 16:56:42 +00:00
|
|
|
if (Ty == Ty2) return true;
|
|
|
|
if (Ty->getPrimitiveID() != Ty2->getPrimitiveID()) return false;
|
|
|
|
if (Ty->isPrimitiveType()) return true;
|
2001-10-24 05:12:04 +00:00
|
|
|
if (isa<OpaqueType>(Ty))
|
|
|
|
return false; // Two nonequal opaque types are never equal
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
std::map<const Type*, const Type*>::iterator It = EqTypes.find(Ty);
|
2001-11-02 07:51:31 +00:00
|
|
|
if (It != EqTypes.end())
|
|
|
|
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-05-22 21:21:43 +00:00
|
|
|
EqTypes.insert(std::make_pair(Ty, Ty2));
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Iterate over the types and make sure the the contents are equivalent...
|
2001-09-09 22:26:58 +00:00
|
|
|
Type::subtype_iterator I = Ty ->subtype_begin(), IE = Ty ->subtype_end();
|
|
|
|
Type::subtype_iterator I2 = Ty2->subtype_begin(), IE2 = Ty2->subtype_end();
|
2001-09-07 16:56:42 +00:00
|
|
|
for (; I != IE && I2 != IE2; ++I, ++I2)
|
|
|
|
if (!TypesEqual(*I, *I2, EqTypes)) return false;
|
|
|
|
|
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,
|
2001-10-13 07:01:33 +00:00
|
|
|
// and that method types can be varargs or not. Consider this now.
|
|
|
|
if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
|
2003-07-23 15:30:06 +00:00
|
|
|
if (ATy->getNumElements() != cast<ArrayType>(Ty2)->getNumElements())
|
2001-10-13 07:01:33 +00:00
|
|
|
return false;
|
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)) {
|
|
|
|
if (FTy->isVarArg() != cast<FunctionType>(Ty2)->isVarArg())
|
2001-10-13 07:01:33 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
return I == IE && I2 == IE2; // Types equal if both iterators are done
|
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
|
|
|
}
|
|
|
|
|
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
|
|
|
|
// our map if an abstract type gets refined somehow...
|
|
|
|
//
|
|
|
|
template<class ValType, class TypeClass>
|
|
|
|
class TypeMap : public AbstractTypeUser {
|
2003-06-18 19:22:36 +00:00
|
|
|
typedef std::map<ValType, PATypeHandle> MapTy;
|
2001-09-07 16:56:42 +00:00
|
|
|
MapTy Map;
|
|
|
|
public:
|
|
|
|
~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-06-18 19:22:36 +00:00
|
|
|
typename std::map<ValType, PATypeHandle>::iterator I
|
2003-05-22 21:21:43 +00:00
|
|
|
= Map.find(V);
|
2001-09-07 16:56:42 +00:00
|
|
|
// TODO: FIXME: When Types are not CONST.
|
|
|
|
return (I != Map.end()) ? (TypeClass*)I->second.get() : 0;
|
|
|
|
}
|
2001-07-25 22:47:55 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
inline void add(const ValType &V, TypeClass *T) {
|
2003-06-18 19:22:36 +00:00
|
|
|
Map.insert(std::make_pair(V, PATypeHandle(T, this)));
|
2001-09-07 16:56:42 +00:00
|
|
|
print("add");
|
|
|
|
}
|
|
|
|
|
|
|
|
// containsEquivalent - Return true if the typemap contains a type that is
|
|
|
|
// structurally equivalent to the specified type.
|
|
|
|
//
|
|
|
|
inline const TypeClass *containsEquivalent(const TypeClass *Ty) {
|
2002-07-24 22:08:53 +00:00
|
|
|
for (typename MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I)
|
2001-09-07 16:56:42 +00:00
|
|
|
if (I->second.get() != Ty && TypesEqual(Ty, I->second.get()))
|
|
|
|
return (TypeClass*)I->second.get(); // FIXME TODO when types not const
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// refineAbstractType - This is called when one of the contained abstract
|
|
|
|
// types gets refined... this simply removes the abstract type from our table.
|
|
|
|
// We expect that whoever refined the type will add it back to the table,
|
|
|
|
// corrected.
|
|
|
|
//
|
|
|
|
virtual void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Removing Old type from Tab: " << (void*)OldTy << ", "
|
|
|
|
<< OldTy->getDescription() << " replacement == " << (void*)NewTy
|
|
|
|
<< ", " << NewTy->getDescription() << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2002-07-24 22:08:53 +00:00
|
|
|
for (typename MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I)
|
2001-09-07 16:56:42 +00:00
|
|
|
if (I->second == OldTy) {
|
2002-04-07 06:14:56 +00:00
|
|
|
// Check to see if the type just became concrete. If so, remove self
|
|
|
|
// from user list.
|
|
|
|
I->second.removeUserFromConcrete();
|
|
|
|
I->second = cast<TypeClass>(NewTy);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void remove(const ValType &OldVal) {
|
2002-07-24 22:08:53 +00:00
|
|
|
typename MapTy::iterator I = Map.find(OldVal);
|
2001-09-07 16:56:42 +00:00
|
|
|
assert(I != Map.end() && "TypeMap::remove, element not found!");
|
|
|
|
Map.erase(I);
|
|
|
|
}
|
|
|
|
|
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;
|
2002-04-04 19:26:02 +00:00
|
|
|
for (MapTy::const_iterator I = Map.begin(), E = Map.end(); I != E; ++I)
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << " " << (++i) << ". " << I->second << " "
|
|
|
|
<< I->second->getDescription() << "\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
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// ValTypeBase - This is the base class that is used by the various
|
|
|
|
// instantiations of TypeMap. This class is an AbstractType user that notifies
|
|
|
|
// the underlying TypeMap when it gets modified.
|
|
|
|
//
|
|
|
|
template<class ValType, class TypeClass>
|
|
|
|
class ValTypeBase : public AbstractTypeUser {
|
|
|
|
TypeMap<ValType, TypeClass> &MyTable;
|
|
|
|
protected:
|
|
|
|
inline ValTypeBase(TypeMap<ValType, TypeClass> &tab) : MyTable(tab) {}
|
|
|
|
|
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
virtual void doRefinement(const DerivedType *OldTy, const Type *NewTy) = 0;
|
2001-11-03 03:27:53 +00:00
|
|
|
|
|
|
|
// typeBecameConcrete - This callback occurs when a contained type refines
|
|
|
|
// to itself, but becomes concrete in the process. Our subclass should remove
|
|
|
|
// itself from the ATU list of the specified type.
|
|
|
|
//
|
|
|
|
virtual void typeBecameConcrete(const DerivedType *Ty) = 0;
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
virtual void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
|
2002-04-05 22:25:26 +00:00
|
|
|
assert(OldTy == NewTy || OldTy->isAbstract());
|
2002-04-07 06:14:56 +00:00
|
|
|
|
|
|
|
if (!OldTy->isAbstract())
|
|
|
|
typeBecameConcrete(OldTy);
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
TypeMap<ValType, TypeClass> &Table = MyTable; // Copy MyTable reference
|
|
|
|
ValType Tmp(*(ValType*)this); // Copy this.
|
2003-06-18 19:22:36 +00:00
|
|
|
PATypeHandle OldType(Table.get(*(ValType*)this), this);
|
2001-09-07 16:56:42 +00:00
|
|
|
Table.remove(*(ValType*)this); // Destroy's this!
|
2002-04-07 06:14:56 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Refine temporary to new state...
|
2002-04-07 06:14:56 +00:00
|
|
|
if (OldTy != NewTy)
|
|
|
|
Tmp.doRefinement(OldTy, NewTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2002-04-07 06:14:56 +00:00
|
|
|
// FIXME: when types are not const!
|
2001-09-07 16:56:42 +00:00
|
|
|
Table.add((ValType&)Tmp, (TypeClass*)OldType.get());
|
|
|
|
}
|
2002-04-04 19:26:02 +00:00
|
|
|
|
|
|
|
void dump() const {
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "ValTypeBase instance!\n";
|
2002-04-04 19:26:02 +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
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
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
|
|
|
//
|
2002-03-29 03:44:36 +00:00
|
|
|
class FunctionValType : public ValTypeBase<FunctionValType, FunctionType> {
|
2003-06-18 19:22:36 +00:00
|
|
|
PATypeHandle RetTy;
|
|
|
|
std::vector<PATypeHandle> 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,
|
2002-03-29 03:44:36 +00:00
|
|
|
bool IVA, TypeMap<FunctionValType, FunctionType> &Tab)
|
|
|
|
: ValTypeBase<FunctionValType, FunctionType>(Tab), RetTy(ret, this),
|
2001-10-13 07:01:33 +00:00
|
|
|
isVarArg(IVA) {
|
2001-09-07 16:56:42 +00:00
|
|
|
for (unsigned i = 0; i < args.size(); ++i)
|
2003-06-18 19:22:36 +00:00
|
|
|
ArgTypes.push_back(PATypeHandle(args[i], this));
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
|
|
|
// We *MUST* have an explicit copy ctor so that the TypeHandles think that
|
2002-03-29 03:44:36 +00:00
|
|
|
// this FunctionValType owns them, not the old one!
|
2001-09-07 16:56:42 +00:00
|
|
|
//
|
2002-03-29 03:44:36 +00:00
|
|
|
FunctionValType(const FunctionValType &MVT)
|
|
|
|
: ValTypeBase<FunctionValType, FunctionType>(MVT), RetTy(MVT.RetTy, this),
|
2001-10-13 07:01:33 +00:00
|
|
|
isVarArg(MVT.isVarArg) {
|
2001-09-07 16:56:42 +00:00
|
|
|
ArgTypes.reserve(MVT.ArgTypes.size());
|
|
|
|
for (unsigned i = 0; i < MVT.ArgTypes.size(); ++i)
|
2003-06-18 19:22:36 +00:00
|
|
|
ArgTypes.push_back(PATypeHandle(MVT.ArgTypes[i], this));
|
2001-07-28 17:52:35 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
virtual void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
|
|
|
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
|
|
|
|
2001-11-03 03:27:53 +00:00
|
|
|
virtual void typeBecameConcrete(const DerivedType *Ty) {
|
|
|
|
if (RetTy == Ty) RetTy.removeUserFromConcrete();
|
|
|
|
|
|
|
|
for (unsigned i = 0; i < ArgTypes.size(); ++i)
|
|
|
|
if (ArgTypes[i] == Ty) ArgTypes[i].removeUserFromConcrete();
|
|
|
|
}
|
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
inline bool operator<(const FunctionValType &MTV) const {
|
2001-10-13 07:01:33 +00:00
|
|
|
if (RetTy.get() < MTV.RetTy.get()) return true;
|
|
|
|
if (RetTy.get() > MTV.RetTy.get()) return false;
|
|
|
|
|
|
|
|
if (ArgTypes < MTV.ArgTypes) return true;
|
|
|
|
return (ArgTypes == MTV.ArgTypes) && isVarArg < MTV.isVarArg;
|
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;
|
|
|
|
|
|
|
|
// FunctionType::get - The factory function for the FunctionType class...
|
|
|
|
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) {
|
|
|
|
FunctionValType VT(ReturnType, Params, isVarArg, FunctionTypes);
|
|
|
|
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...
|
|
|
|
//
|
|
|
|
class ArrayValType : public ValTypeBase<ArrayValType, ArrayType> {
|
2003-06-18 19:22:36 +00:00
|
|
|
PATypeHandle ValTy;
|
2001-12-14 16:41:56 +00:00
|
|
|
unsigned Size;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
|
|
|
ArrayValType(const Type *val, int sz, TypeMap<ArrayValType, ArrayType> &Tab)
|
|
|
|
: ValTypeBase<ArrayValType, ArrayType>(Tab), ValTy(val, this), Size(sz) {}
|
|
|
|
|
|
|
|
// We *MUST* have an explicit copy ctor so that the ValTy thinks that this
|
|
|
|
// ArrayValType owns it, not the old one!
|
|
|
|
//
|
|
|
|
ArrayValType(const ArrayValType &AVT)
|
|
|
|
: ValTypeBase<ArrayValType, ArrayType>(AVT), ValTy(AVT.ValTy, this),
|
|
|
|
Size(AVT.Size) {}
|
|
|
|
|
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
virtual 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
|
|
|
}
|
|
|
|
|
2001-11-03 03:27:53 +00:00
|
|
|
virtual void typeBecameConcrete(const DerivedType *Ty) {
|
|
|
|
assert(ValTy == Ty &&
|
|
|
|
"Contained type became concrete but we're not using it!");
|
|
|
|
ValTy.removeUserFromConcrete();
|
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
inline bool operator<(const ArrayValType &MTV) const {
|
|
|
|
if (Size < MTV.Size) return true;
|
|
|
|
return Size == MTV.Size && ValTy.get() < MTV.ValTy.get();
|
|
|
|
}
|
|
|
|
};
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
static TypeMap<ArrayValType, ArrayType> ArrayTypes;
|
|
|
|
|
2001-12-14 16:41:56 +00:00
|
|
|
ArrayType *ArrayType::get(const Type *ElementType, unsigned 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
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
ArrayValType AVT(ElementType, NumElements, ArrayTypes);
|
|
|
|
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-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Derived new type: " << AT->getDescription() << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return AT;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Struct Type Factory...
|
|
|
|
//
|
|
|
|
|
|
|
|
// StructValType - Define a class to hold the key that goes into the TypeMap
|
|
|
|
//
|
|
|
|
class StructValType : public ValTypeBase<StructValType, StructType> {
|
2003-06-18 19:22:36 +00:00
|
|
|
std::vector<PATypeHandle> ElTypes;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
2003-05-22 21:21:43 +00:00
|
|
|
StructValType(const std::vector<const Type*> &args,
|
2001-09-07 16:56:42 +00:00
|
|
|
TypeMap<StructValType, StructType> &Tab)
|
|
|
|
: ValTypeBase<StructValType, StructType>(Tab) {
|
2002-04-05 22:25:26 +00:00
|
|
|
ElTypes.reserve(args.size());
|
|
|
|
for (unsigned i = 0, e = args.size(); i != e; ++i)
|
2003-06-18 19:22:36 +00:00
|
|
|
ElTypes.push_back(PATypeHandle(args[i], this));
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// We *MUST* have an explicit copy ctor so that the TypeHandles think that
|
|
|
|
// this StructValType owns them, not the old one!
|
|
|
|
//
|
|
|
|
StructValType(const StructValType &SVT)
|
|
|
|
: ValTypeBase<StructValType, StructType>(SVT){
|
|
|
|
ElTypes.reserve(SVT.ElTypes.size());
|
2002-04-05 22:25:26 +00:00
|
|
|
for (unsigned i = 0, e = SVT.ElTypes.size(); i != e; ++i)
|
2003-06-18 19:22:36 +00:00
|
|
|
ElTypes.push_back(PATypeHandle(SVT.ElTypes[i], this));
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
virtual void doRefinement(const DerivedType *OldType, const Type *NewType) {
|
|
|
|
for (unsigned i = 0; i < ElTypes.size(); ++i)
|
|
|
|
if (ElTypes[i] == OldType) ElTypes[i] = NewType;
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-11-03 03:27:53 +00:00
|
|
|
virtual void typeBecameConcrete(const DerivedType *Ty) {
|
2002-04-07 06:14:56 +00:00
|
|
|
for (unsigned i = 0, e = ElTypes.size(); i != e; ++i)
|
|
|
|
if (ElTypes[i] == Ty)
|
|
|
|
ElTypes[i].removeUserFromConcrete();
|
2001-11-03 03:27:53 +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
|
|
|
};
|
|
|
|
|
|
|
|
static TypeMap<StructValType, StructType> StructTypes;
|
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
StructType *StructType::get(const std::vector<const Type*> &ETypes) {
|
2001-09-07 16:56:42 +00:00
|
|
|
StructValType STV(ETypes, StructTypes);
|
|
|
|
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-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Derived new type: " << ST->getDescription() << "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
return ST;
|
|
|
|
}
|
2001-06-06 20:29:01 +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
|
|
|
|
//
|
|
|
|
class PointerValType : public ValTypeBase<PointerValType, PointerType> {
|
2003-06-18 19:22:36 +00:00
|
|
|
PATypeHandle ValTy;
|
2001-09-07 16:56:42 +00:00
|
|
|
public:
|
|
|
|
PointerValType(const Type *val, TypeMap<PointerValType, PointerType> &Tab)
|
|
|
|
: ValTypeBase<PointerValType, PointerType>(Tab), ValTy(val, this) {}
|
|
|
|
|
|
|
|
// We *MUST* have an explicit copy ctor so that the ValTy thinks that this
|
|
|
|
// PointerValType owns it, not the old one!
|
|
|
|
//
|
|
|
|
PointerValType(const PointerValType &PVT)
|
|
|
|
: ValTypeBase<PointerValType, PointerType>(PVT), ValTy(PVT.ValTy, this) {}
|
|
|
|
|
|
|
|
// Subclass should override this... to update self as usual
|
|
|
|
virtual 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
|
|
|
}
|
|
|
|
|
2001-11-03 03:27:53 +00:00
|
|
|
virtual void typeBecameConcrete(const DerivedType *Ty) {
|
|
|
|
assert(ValTy == Ty &&
|
|
|
|
"Contained type became concrete but we're not using it!");
|
|
|
|
ValTy.removeUserFromConcrete();
|
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
inline bool operator<(const PointerValType &MTV) const {
|
|
|
|
return ValTy.get() < MTV.ValTy.get();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static TypeMap<PointerValType, PointerType> PointerTypes;
|
|
|
|
|
|
|
|
PointerType *PointerType::get(const Type *ValueType) {
|
|
|
|
assert(ValueType && "Can't get a pointer to <null> type!");
|
|
|
|
PointerValType PVT(ValueType, PointerTypes);
|
|
|
|
|
|
|
|
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-05-22 21:21:43 +00:00
|
|
|
std::cerr << "Derived new type: " << PT->getDescription() << "\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
|
|
|
}
|
|
|
|
|
2002-04-06 00:21:11 +00:00
|
|
|
void debug_type_tables() {
|
|
|
|
FunctionTypes.dump();
|
|
|
|
ArrayTypes.dump();
|
|
|
|
StructTypes.dump();
|
|
|
|
PointerTypes.dump();
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Derived Type Refinement Functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-04-05 22:25:26 +00:00
|
|
|
// addAbstractTypeUser - Notify an abstract type that there is a new user of
|
|
|
|
// it. This function is called primarily by the PATypeHandle class.
|
|
|
|
//
|
|
|
|
void DerivedType::addAbstractTypeUser(AbstractTypeUser *U) const {
|
|
|
|
assert(isAbstract() && "addAbstractTypeUser: Current type not abstract!");
|
|
|
|
|
|
|
|
#if DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << " addAbstractTypeUser[" << (void*)this << ", "
|
|
|
|
<< getDescription() << "][" << AbstractTypeUsers.size()
|
|
|
|
<< "] User = " << U << "\n";
|
2002-04-05 22:25:26 +00:00
|
|
|
#endif
|
|
|
|
AbstractTypeUsers.push_back(U);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// removeAbstractTypeUser - Notify an abstract type that a user of the class
|
|
|
|
// no longer has a handle to the type. This function is called primarily by
|
|
|
|
// the PATypeHandle class. When there are no users of the abstract type, it
|
|
|
|
// is anihilated, because there is no way to get a reference to it ever again.
|
|
|
|
//
|
|
|
|
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);
|
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 << ", "
|
|
|
|
<< getDescription() << "][" << i << "] User = " << U << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2002-04-05 19:44:07 +00:00
|
|
|
|
|
|
|
if (AbstractTypeUsers.empty() && isAbstract()) {
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "DELETEing unused abstract type: <" << getDescription()
|
|
|
|
<< ">[" << (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
|
|
|
|
|
|
|
// 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.
|
|
|
|
//
|
|
|
|
void DerivedType::refineAbstractTypeTo(const Type *NewType) {
|
|
|
|
assert(isAbstract() && "refineAbstractTypeTo: Current type is not abstract!");
|
|
|
|
assert(this != NewType && "Can't refine to myself!");
|
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 << " "
|
|
|
|
<< getDescription() << "] to [" << (void*)NewType << " "
|
|
|
|
<< NewType->getDescription() << "]!\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
|
|
|
|
|
|
|
// Add a self use of the current type so that we don't delete ourself until
|
|
|
|
// after this while loop. We are careful to never invoke refine on ourself,
|
|
|
|
// so this extra reference shouldn't be a problem. Note that we must only
|
|
|
|
// remove a single reference at the end, but we must tolerate multiple self
|
|
|
|
// references because we could be refineAbstractTypeTo'ing recursively on the
|
|
|
|
// same type.
|
|
|
|
//
|
|
|
|
addAbstractTypeUser(this);
|
|
|
|
|
|
|
|
// Count the number of self uses. Stop looping when sizeof(list) == NSU.
|
|
|
|
unsigned NumSelfUses = 0;
|
|
|
|
|
|
|
|
// 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
|
|
|
//
|
2002-04-05 19:44:07 +00:00
|
|
|
while (AbstractTypeUsers.size() > NumSelfUses && NewTy != this) {
|
2001-09-07 16:56:42 +00:00
|
|
|
AbstractTypeUser *User = AbstractTypeUsers.back();
|
|
|
|
|
|
|
|
if (User == this) {
|
|
|
|
// Move self use to the start of the list. Increment NSU.
|
2003-05-22 21:21:43 +00:00
|
|
|
std::swap(AbstractTypeUsers.back(), AbstractTypeUsers[NumSelfUses++]);
|
2001-09-07 16:56:42 +00:00
|
|
|
} else {
|
|
|
|
unsigned OldSize = AbstractTypeUsers.size();
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << " REFINING user " << OldSize-1 << "[" << (void*)User
|
|
|
|
<< "] of abstract type [" << (void*)this << " "
|
|
|
|
<< getDescription() << "] to [" << (void*)NewTy.get() << " "
|
|
|
|
<< NewTy->getDescription() << "]!\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2001-10-24 05:12:04 +00:00
|
|
|
User->refineAbstractType(this, NewTy);
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2002-04-05 19:53:06 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2002-04-05 19:44:07 +00:00
|
|
|
if (AbstractTypeUsers.size() == OldSize) {
|
2002-04-05 19:53:06 +00:00
|
|
|
User->refineAbstractType(this, NewTy);
|
2002-04-05 19:44:07 +00:00
|
|
|
if (AbstractTypeUsers.back() != User)
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "User changed!\n";
|
|
|
|
std::cerr << "Top of user list is:\n";
|
2002-04-05 19:44:07 +00:00
|
|
|
AbstractTypeUsers.back()->dump();
|
|
|
|
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr <<"\nOld User=\n";
|
2002-04-05 19:44:07 +00:00
|
|
|
User->dump();
|
|
|
|
}
|
2002-04-05 19:53:06 +00:00
|
|
|
#endif
|
2001-09-07 16:56:42 +00:00
|
|
|
assert(AbstractTypeUsers.size() != OldSize &&
|
|
|
|
"AbsTyUser did not remove self from user list!");
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
// Remove a single self use, even though there may be several here. This will
|
|
|
|
// probably 'delete this', so no instance variables may be used after this
|
|
|
|
// occurs...
|
2002-04-05 19:44:07 +00:00
|
|
|
//
|
|
|
|
assert((NewTy == this || AbstractTypeUsers.back() == this) &&
|
|
|
|
"Only self uses should be left!");
|
2001-09-07 16:56:42 +00:00
|
|
|
removeAbstractTypeUser(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
// typeIsRefined - Notify AbstractTypeUsers of this type that the current type
|
|
|
|
// has been refined a bit. The pointer is still valid and still should be
|
|
|
|
// used, but the subtypes have changed.
|
|
|
|
//
|
|
|
|
void DerivedType::typeIsRefined() {
|
|
|
|
assert(isRefining >= 0 && isRefining <= 2 && "isRefining out of bounds!");
|
2001-11-02 07:51:31 +00:00
|
|
|
if (isRefining == 1) return; // Kill recursion here...
|
2001-09-07 16:56:42 +00:00
|
|
|
++isRefining;
|
|
|
|
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "typeIsREFINED type: " << (void*)this <<" "<<getDescription()
|
|
|
|
<< "\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2002-04-07 06:14:56 +00:00
|
|
|
|
|
|
|
// In this loop we have to be very careful not to get into infinite loops and
|
|
|
|
// other problem cases. Specifically, we loop through all of the abstract
|
|
|
|
// type users in the user list, notifying them that the type has been refined.
|
|
|
|
// At their choice, they may or may not choose to remove themselves from the
|
|
|
|
// list of users. Regardless of whether they do or not, we have to be sure
|
|
|
|
// that we only notify each user exactly once. Because the refineAbstractType
|
|
|
|
// method can cause an arbitrary permutation to the user list, we cannot loop
|
|
|
|
// through it in any particular order and be guaranteed that we will be
|
|
|
|
// successful at this aim. Because of this, we keep track of all the users we
|
|
|
|
// have visited and only visit users we have not seen. Because this user list
|
|
|
|
// should be small, we use a vector instead of a full featured set to keep
|
|
|
|
// track of what users we have notified so far.
|
|
|
|
//
|
2003-05-22 21:21:43 +00:00
|
|
|
std::vector<AbstractTypeUser*> Refined;
|
2002-04-07 06:14:56 +00:00
|
|
|
while (1) {
|
|
|
|
unsigned i;
|
|
|
|
for (i = AbstractTypeUsers.size(); i != 0; --i)
|
|
|
|
if (find(Refined.begin(), Refined.end(), AbstractTypeUsers[i-1]) ==
|
|
|
|
Refined.end())
|
|
|
|
break; // Found an unrefined user?
|
|
|
|
|
|
|
|
if (i == 0) break; // Noone to refine left, break out of here!
|
|
|
|
|
|
|
|
AbstractTypeUser *ATU = AbstractTypeUsers[--i];
|
|
|
|
Refined.push_back(ATU); // Keep track of which users we have refined!
|
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << " typeIsREFINED user " << i << "[" << ATU
|
|
|
|
<< "] of abstract type [" << (void*)this << " "
|
|
|
|
<< getDescription() << "]\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|
2001-09-07 16:56:42 +00:00
|
|
|
ATU->refineAbstractType(this, this);
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2001-09-07 16:56:42 +00:00
|
|
|
--isRefining;
|
2001-11-03 03:27:53 +00:00
|
|
|
|
|
|
|
#ifndef _NDEBUG
|
|
|
|
if (!(isAbstract() || AbstractTypeUsers.empty()))
|
|
|
|
for (unsigned i = 0; i < AbstractTypeUsers.size(); ++i) {
|
|
|
|
if (AbstractTypeUsers[i] != this) {
|
|
|
|
// Debugging hook
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "FOUND FAILURE\nUser: ";
|
2002-04-05 19:53:06 +00:00
|
|
|
AbstractTypeUsers[i]->dump();
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "\nCatch:\n";
|
2001-11-03 03:27:53 +00:00
|
|
|
AbstractTypeUsers[i]->refineAbstractType(this, this);
|
|
|
|
assert(0 && "Type became concrete,"
|
|
|
|
" but it still has abstract type users hanging around!");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
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
|
|
|
// 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) {
|
2001-09-07 16:56:42 +00:00
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "FunctionTy::refineAbstractTy(" << (void*)OldType << "["
|
|
|
|
<< OldType->getDescription() << "], " << (void*)NewType << " ["
|
|
|
|
<< NewType->getDescription() << "])\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2002-04-05 22:25:26 +00:00
|
|
|
// Find the type element we are refining...
|
2002-04-07 06:14:56 +00:00
|
|
|
if (ResultType == OldType) {
|
|
|
|
ResultType.removeUserFromConcrete();
|
|
|
|
ResultType = NewType;
|
2001-11-03 03:27:53 +00:00
|
|
|
}
|
2002-04-07 06:14:56 +00:00
|
|
|
for (unsigned i = 0, e = ParamTys.size(); i != e; ++i)
|
|
|
|
if (ParamTys[i] == OldType) {
|
|
|
|
ParamTys[i].removeUserFromConcrete();
|
|
|
|
ParamTys[i] = NewType;
|
|
|
|
}
|
2001-11-03 03:27:53 +00:00
|
|
|
|
2002-03-29 03:44:36 +00:00
|
|
|
const FunctionType *MT = FunctionTypes.containsEquivalent(this);
|
2001-11-02 07:51:31 +00:00
|
|
|
if (MT && MT != this) {
|
2001-11-03 03:27:53 +00:00
|
|
|
refineAbstractTypeTo(MT); // Different type altogether...
|
2001-11-02 07:51:31 +00:00
|
|
|
} else {
|
2003-09-04 23:43:40 +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!
|
|
|
|
if (isAbstract()) setAbstract(isTypeAbstract());
|
2001-11-03 03:27:53 +00:00
|
|
|
typeIsRefined(); // Same type, different contents...
|
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,
|
|
|
|
const Type *NewType) {
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "ArrayTy::refineAbstractTy(" << (void*)OldType << "["
|
|
|
|
<< OldType->getDescription() << "], " << (void*)NewType << " ["
|
|
|
|
<< NewType->getDescription() << "])\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
|
2002-04-07 06:14:56 +00:00
|
|
|
assert(getElementType() == OldType);
|
|
|
|
ElementType.removeUserFromConcrete();
|
2001-11-02 07:51:31 +00:00
|
|
|
ElementType = NewType;
|
2002-04-07 06:14:56 +00:00
|
|
|
|
2001-11-02 07:51:31 +00:00
|
|
|
const ArrayType *AT = ArrayTypes.containsEquivalent(this);
|
|
|
|
if (AT && AT != this) {
|
|
|
|
refineAbstractTypeTo(AT); // Different type altogether...
|
|
|
|
} else {
|
2003-09-04 23:43:40 +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!
|
|
|
|
if (isAbstract()) setAbstract(isTypeAbstract());
|
2001-11-02 07:51:31 +00:00
|
|
|
typeIsRefined(); // Same type, different contents...
|
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,
|
|
|
|
const Type *NewType) {
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "StructTy::refineAbstractTy(" << (void*)OldType << "["
|
|
|
|
<< OldType->getDescription() << "], " << (void*)NewType << " ["
|
|
|
|
<< NewType->getDescription() << "])\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
2003-01-14 19:42:39 +00:00
|
|
|
for (int i = ETypes.size()-1; i >= 0; --i)
|
2002-04-07 06:14:56 +00:00
|
|
|
if (ETypes[i] == OldType) {
|
|
|
|
ETypes[i].removeUserFromConcrete();
|
2001-11-03 03:27:53 +00:00
|
|
|
|
2002-04-07 06:14:56 +00:00
|
|
|
// Update old type to new type in the array...
|
|
|
|
ETypes[i] = NewType;
|
|
|
|
}
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2001-11-02 07:51:31 +00:00
|
|
|
const StructType *ST = StructTypes.containsEquivalent(this);
|
|
|
|
if (ST && ST != this) {
|
|
|
|
refineAbstractTypeTo(ST); // Different type altogether...
|
|
|
|
} else {
|
2003-09-04 23:43:40 +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!
|
|
|
|
if (isAbstract()) setAbstract(isTypeAbstract());
|
2001-11-02 07:51:31 +00:00
|
|
|
typeIsRefined(); // Same type, different contents...
|
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,
|
|
|
|
const Type *NewType) {
|
|
|
|
#ifdef DEBUG_MERGE_TYPES
|
2003-05-22 21:21:43 +00:00
|
|
|
std::cerr << "PointerTy::refineAbstractTy(" << (void*)OldType << "["
|
|
|
|
<< OldType->getDescription() << "], " << (void*)NewType << " ["
|
|
|
|
<< NewType->getDescription() << "])\n";
|
2001-09-07 16:56:42 +00:00
|
|
|
#endif
|
|
|
|
|
2002-04-07 06:14:56 +00:00
|
|
|
assert(ElementType == OldType);
|
|
|
|
ElementType.removeUserFromConcrete();
|
2001-12-14 16:41:56 +00:00
|
|
|
ElementType = NewType;
|
2001-09-07 16:56:42 +00:00
|
|
|
|
2002-04-07 06:14:56 +00:00
|
|
|
const PointerType *PT = PointerTypes.containsEquivalent(this);
|
2001-11-02 07:51:31 +00:00
|
|
|
if (PT && PT != this) {
|
|
|
|
refineAbstractTypeTo(PT); // Different type altogether...
|
|
|
|
} else {
|
2003-09-04 23:43:40 +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!
|
|
|
|
if (isAbstract()) setAbstract(isTypeAbstract());
|
2001-11-02 07:51:31 +00:00
|
|
|
typeIsRefined(); // Same type, different contents...
|
2001-09-07 16:56:42 +00:00
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|