X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FVMCore%2FConstants.cpp;h=b5831ae26ea9e6a8f9dd45f6750f036532e195d0;hb=2e83ea5211ce7ce404b9cf8c625ec289c16ea1b5;hp=499452c4251551cfb2f8062320ada03187f0c439;hpb=9bc02a4debba3b279350235a198f651be5d2722e;p=oota-llvm.git diff --git a/lib/VMCore/Constants.cpp b/lib/VMCore/Constants.cpp index 499452c4251..b5831ae26ea 100644 --- a/lib/VMCore/Constants.cpp +++ b/lib/VMCore/Constants.cpp @@ -1,17 +1,27 @@ //===-- Constants.cpp - Implement Constant nodes --------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// // // This file implements the Constant* classes... // //===----------------------------------------------------------------------===// #include "llvm/Constants.h" -#include "llvm/ConstantHandling.h" +#include "ConstantFolding.h" #include "llvm/DerivedTypes.h" -#include "llvm/iMemory.h" +#include "llvm/GlobalValue.h" +#include "llvm/Instructions.h" #include "llvm/SymbolTable.h" #include "llvm/Module.h" -#include "Support/StringExtras.h" +#include "llvm/ADT/StringExtras.h" #include +#include +using namespace llvm; ConstantBool *ConstantBool::True = new ConstantBool(true); ConstantBool *ConstantBool::False = new ConstantBool(false); @@ -31,7 +41,7 @@ void Constant::setName(const std::string &Name, SymbolTable *ST) { void Constant::destroyConstantImpl() { // When a Constant is destroyed, there may be lingering // references to the constant by other constants in the constant pool. These - // constants are implicitly dependant on the module that is being deleted, + // constants are implicitly dependent on the module that is being deleted, // but they don't know that. Because we only find out when the CPV is // deleted, we must now notify all of our users (that should only be // Constants) that they are, in fact, invalid now and should be deleted. @@ -45,8 +55,8 @@ void Constant::destroyConstantImpl() { << *V << "\n\n"; #endif assert(isa(V) && "References remain to Constant being destroyed"); - Constant *CPV = cast(V); - CPV->destroyConstant(); + Constant *CV = cast(V); + CV->destroyConstant(); // The constant should remove itself from our use list... assert((use_empty() || use_back() != V) && "Constant not removed!"); @@ -58,49 +68,70 @@ void Constant::destroyConstantImpl() { // Static constructor to create a '0' constant of arbitrary type... Constant *Constant::getNullValue(const Type *Ty) { - switch (Ty->getPrimitiveID()) { - case Type::BoolTyID: return ConstantBool::get(false); - case Type::SByteTyID: - case Type::ShortTyID: - case Type::IntTyID: - case Type::LongTyID: return ConstantSInt::get(Ty, 0); - - case Type::UByteTyID: - case Type::UShortTyID: - case Type::UIntTyID: - case Type::ULongTyID: return ConstantUInt::get(Ty, 0); + switch (Ty->getTypeID()) { + case Type::BoolTyID: { + static Constant *NullBool = ConstantBool::get(false); + return NullBool; + } + case Type::SByteTyID: { + static Constant *NullSByte = ConstantSInt::get(Type::SByteTy, 0); + return NullSByte; + } + case Type::UByteTyID: { + static Constant *NullUByte = ConstantUInt::get(Type::UByteTy, 0); + return NullUByte; + } + case Type::ShortTyID: { + static Constant *NullShort = ConstantSInt::get(Type::ShortTy, 0); + return NullShort; + } + case Type::UShortTyID: { + static Constant *NullUShort = ConstantUInt::get(Type::UShortTy, 0); + return NullUShort; + } + case Type::IntTyID: { + static Constant *NullInt = ConstantSInt::get(Type::IntTy, 0); + return NullInt; + } + case Type::UIntTyID: { + static Constant *NullUInt = ConstantUInt::get(Type::UIntTy, 0); + return NullUInt; + } + case Type::LongTyID: { + static Constant *NullLong = ConstantSInt::get(Type::LongTy, 0); + return NullLong; + } + case Type::ULongTyID: { + static Constant *NullULong = ConstantUInt::get(Type::ULongTy, 0); + return NullULong; + } - case Type::FloatTyID: - case Type::DoubleTyID: return ConstantFP::get(Ty, 0); + case Type::FloatTyID: { + static Constant *NullFloat = ConstantFP::get(Type::FloatTy, 0); + return NullFloat; + } + case Type::DoubleTyID: { + static Constant *NullDouble = ConstantFP::get(Type::DoubleTy, 0); + return NullDouble; + } case Type::PointerTyID: return ConstantPointerNull::get(cast(Ty)); - case Type::StructTyID: { - const StructType *ST = cast(Ty); - - const StructType::ElementTypes &ETs = ST->getElementTypes(); - std::vector Elements; - Elements.resize(ETs.size()); - for (unsigned i = 0, e = ETs.size(); i != e; ++i) - Elements[i] = Constant::getNullValue(ETs[i]); - return ConstantStruct::get(ST, Elements); - } - case Type::ArrayTyID: { - const ArrayType *AT = cast(Ty); - Constant *El = Constant::getNullValue(AT->getElementType()); - unsigned NumElements = AT->getNumElements(); - return ConstantArray::get(AT, std::vector(NumElements, El)); - } + + case Type::StructTyID: + case Type::ArrayTyID: + case Type::PackedTyID: + return ConstantAggregateZero::get(Ty); default: - // Function, Type, Label, or Opaque type? - assert(0 && "Cannot create a null constant of that type!"); + // Function, Label, or Opaque type? + assert(!"Cannot create a null constant of that type!"); return 0; } } // Static constructor to create the maximum constant of an integral type... ConstantIntegral *ConstantIntegral::getMaxValue(const Type *Ty) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { case Type::BoolTyID: return ConstantBool::True; case Type::SByteTyID: case Type::ShortTyID: @@ -124,7 +155,7 @@ ConstantIntegral *ConstantIntegral::getMaxValue(const Type *Ty) { // Static constructor to create the minimum constant for an integral type... ConstantIntegral *ConstantIntegral::getMinValue(const Type *Ty) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { case Type::BoolTyID: return ConstantBool::False; case Type::SByteTyID: case Type::ShortTyID: @@ -148,7 +179,7 @@ ConstantIntegral *ConstantIntegral::getMinValue(const Type *Ty) { // Static constructor to create an integral constant with all bits set ConstantIntegral *ConstantIntegral::getAllOnesValue(const Type *Ty) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { case Type::BoolTyID: return ConstantBool::True; case Type::SByteTyID: case Type::ShortTyID: @@ -184,12 +215,15 @@ bool ConstantUInt::isAllOnesValue() const { //===----------------------------------------------------------------------===// // Normal Constructors -ConstantBool::ConstantBool(bool V) : ConstantIntegral(Type::BoolTy) { - Val = V; +ConstantIntegral::ConstantIntegral(const Type *Ty, uint64_t V) + : Constant(Ty) { + Val.Unsigned = V; +} + +ConstantBool::ConstantBool(bool V) : ConstantIntegral(Type::BoolTy, V) { } -ConstantInt::ConstantInt(const Type *Ty, uint64_t V) : ConstantIntegral(Ty) { - Val.Unsigned = V; +ConstantInt::ConstantInt(const Type *Ty, uint64_t V) : ConstantIntegral(Ty, V) { } ConstantSInt::ConstantSInt(const Type *Ty, int64_t V) : ConstantInt(Ty, V) { @@ -211,109 +245,181 @@ ConstantFP::ConstantFP(const Type *Ty, double V) : Constant(Ty) { ConstantArray::ConstantArray(const ArrayType *T, const std::vector &V) : Constant(T) { + assert(V.size() == T->getNumElements() && + "Invalid initializer vector for constant array"); Operands.reserve(V.size()); for (unsigned i = 0, e = V.size(); i != e; ++i) { - assert(V[i]->getType() == T->getElementType()); + assert((V[i]->getType() == T->getElementType() || + (T->isAbstract() && + V[i]->getType()->getTypeID() == T->getElementType()->getTypeID())) && + "Initializer for array element doesn't match array element type!"); Operands.push_back(Use(V[i], this)); } } ConstantStruct::ConstantStruct(const StructType *T, const std::vector &V) : Constant(T) { - const StructType::ElementTypes &ETypes = T->getElementTypes(); - assert(V.size() == ETypes.size() && + assert(V.size() == T->getNumElements() && "Invalid initializer vector for constant structure"); Operands.reserve(V.size()); for (unsigned i = 0, e = V.size(); i != e; ++i) { - assert(V[i]->getType() == ETypes[i]); + assert((V[i]->getType() == T->getElementType(i) || + ((T->getElementType(i)->isAbstract() || + V[i]->getType()->isAbstract()) && + T->getElementType(i)->getTypeID() == V[i]->getType()->getTypeID())) && + "Initializer for struct element doesn't match struct element type!"); Operands.push_back(Use(V[i], this)); } } -ConstantPointerRef::ConstantPointerRef(GlobalValue *GV) - : ConstantPointer(GV->getType()) { - Operands.push_back(Use(GV, this)); +ConstantPacked::ConstantPacked(const PackedType *T, + const std::vector &V) : Constant(T) { + Operands.reserve(V.size()); + for (unsigned i = 0, e = V.size(); i != e; ++i) { + assert((V[i]->getType() == T->getElementType() || + (T->isAbstract() && + V[i]->getType()->getTypeID() == T->getElementType()->getTypeID())) && + "Initializer for packed element doesn't match packed element type!"); + Operands.push_back(Use(V[i], this)); + } } ConstantExpr::ConstantExpr(unsigned Opcode, Constant *C, const Type *Ty) - : Constant(Ty), iType(Opcode) { + : Constant(Ty, ConstantExprVal), iType(Opcode) { + Operands.reserve(1); Operands.push_back(Use(C, this)); } +// Select instruction creation ctor +ConstantExpr::ConstantExpr(Constant *C, Constant *V1, Constant *V2) + : Constant(V1->getType(), ConstantExprVal), iType(Instruction::Select) { + Operands.reserve(3); + Operands.push_back(Use(C, this)); + Operands.push_back(Use(V1, this)); + Operands.push_back(Use(V2, this)); +} + + +static bool isSetCC(unsigned Opcode) { + return Opcode == Instruction::SetEQ || Opcode == Instruction::SetNE || + Opcode == Instruction::SetLT || Opcode == Instruction::SetGT || + Opcode == Instruction::SetLE || Opcode == Instruction::SetGE; +} + ConstantExpr::ConstantExpr(unsigned Opcode, Constant *C1, Constant *C2) - : Constant(C1->getType()), iType(Opcode) { + : Constant(isSetCC(Opcode) ? Type::BoolTy : C1->getType(), ConstantExprVal), + iType(Opcode) { + Operands.reserve(2); Operands.push_back(Use(C1, this)); Operands.push_back(Use(C2, this)); } ConstantExpr::ConstantExpr(Constant *C, const std::vector &IdxList, const Type *DestTy) - : Constant(DestTy), iType(Instruction::GetElementPtr) { + : Constant(DestTy, ConstantExprVal), iType(Instruction::GetElementPtr) { Operands.reserve(1+IdxList.size()); Operands.push_back(Use(C, this)); for (unsigned i = 0, E = IdxList.size(); i != E; ++i) Operands.push_back(Use(IdxList[i], this)); } - - -//===----------------------------------------------------------------------===// -// classof implementations - -bool ConstantIntegral::classof(const Constant *CPV) { - return CPV->getType()->isIntegral() && !isa(CPV); +/// ConstantExpr::get* - Return some common constants without having to +/// specify the full Instruction::OPCODE identifier. +/// +Constant *ConstantExpr::getNeg(Constant *C) { + if (!C->getType()->isFloatingPoint()) + return get(Instruction::Sub, getNullValue(C->getType()), C); + else + return get(Instruction::Sub, ConstantFP::get(C->getType(), -0.0), C); } - -bool ConstantInt::classof(const Constant *CPV) { - return CPV->getType()->isInteger() && !isa(CPV); +Constant *ConstantExpr::getNot(Constant *C) { + assert(isa(C) && "Cannot NOT a nonintegral type!"); + return get(Instruction::Xor, C, + ConstantIntegral::getAllOnesValue(C->getType())); +} +Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) { + return get(Instruction::Add, C1, C2); +} +Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) { + return get(Instruction::Sub, C1, C2); +} +Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) { + return get(Instruction::Mul, C1, C2); +} +Constant *ConstantExpr::getDiv(Constant *C1, Constant *C2) { + return get(Instruction::Div, C1, C2); +} +Constant *ConstantExpr::getRem(Constant *C1, Constant *C2) { + return get(Instruction::Rem, C1, C2); +} +Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) { + return get(Instruction::And, C1, C2); } -bool ConstantSInt::classof(const Constant *CPV) { - return CPV->getType()->isSigned() && !isa(CPV); +Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) { + return get(Instruction::Or, C1, C2); } -bool ConstantUInt::classof(const Constant *CPV) { - return CPV->getType()->isUnsigned() && !isa(CPV); +Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) { + return get(Instruction::Xor, C1, C2); } -bool ConstantFP::classof(const Constant *CPV) { - const Type *Ty = CPV->getType(); - return ((Ty == Type::FloatTy || Ty == Type::DoubleTy) && - !isa(CPV)); +Constant *ConstantExpr::getSetEQ(Constant *C1, Constant *C2) { + return get(Instruction::SetEQ, C1, C2); } -bool ConstantArray::classof(const Constant *CPV) { - return isa(CPV->getType()) && !isa(CPV); +Constant *ConstantExpr::getSetNE(Constant *C1, Constant *C2) { + return get(Instruction::SetNE, C1, C2); } -bool ConstantStruct::classof(const Constant *CPV) { - return isa(CPV->getType()) && !isa(CPV); +Constant *ConstantExpr::getSetLT(Constant *C1, Constant *C2) { + return get(Instruction::SetLT, C1, C2); } -bool ConstantPointer::classof(const Constant *CPV) { - return (isa(CPV->getType()) && !isa(CPV)); +Constant *ConstantExpr::getSetGT(Constant *C1, Constant *C2) { + return get(Instruction::SetGT, C1, C2); +} +Constant *ConstantExpr::getSetLE(Constant *C1, Constant *C2) { + return get(Instruction::SetLE, C1, C2); +} +Constant *ConstantExpr::getSetGE(Constant *C1, Constant *C2) { + return get(Instruction::SetGE, C1, C2); +} +Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) { + return get(Instruction::Shl, C1, C2); +} +Constant *ConstantExpr::getShr(Constant *C1, Constant *C2) { + return get(Instruction::Shr, C1, C2); } +Constant *ConstantExpr::getUShr(Constant *C1, Constant *C2) { + if (C1->getType()->isUnsigned()) return getShr(C1, C2); + return getCast(getShr(getCast(C1, + C1->getType()->getUnsignedVersion()), C2), C1->getType()); +} + +Constant *ConstantExpr::getSShr(Constant *C1, Constant *C2) { + if (C1->getType()->isSigned()) return getShr(C1, C2); + return getCast(getShr(getCast(C1, + C1->getType()->getSignedVersion()), C2), C1->getType()); +} //===----------------------------------------------------------------------===// // isValueValidForType implementations bool ConstantSInt::isValueValidForType(const Type *Ty, int64_t Val) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { default: return false; // These can't be represented as integers!!! - // Signed types... case Type::SByteTyID: return (Val <= INT8_MAX && Val >= INT8_MIN); case Type::ShortTyID: return (Val <= INT16_MAX && Val >= INT16_MIN); case Type::IntTyID: - return (Val <= INT32_MAX && Val >= INT32_MIN); + return (Val <= int(INT32_MAX) && Val >= int(INT32_MIN)); case Type::LongTyID: return true; // This is the largest type... } - assert(0 && "WTF?"); - return false; } bool ConstantUInt::isValueValidForType(const Type *Ty, uint64_t Val) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { default: return false; // These can't be represented as integers!!! @@ -327,20 +433,15 @@ bool ConstantUInt::isValueValidForType(const Type *Ty, uint64_t Val) { case Type::ULongTyID: return true; // This is the largest type... } - assert(0 && "WTF?"); - return false; } bool ConstantFP::isValueValidForType(const Type *Ty, double Val) { - switch (Ty->getPrimitiveID()) { + switch (Ty->getTypeID()) { default: return false; // These can't be represented as floating point! // TODO: Figure out how to test if a double can be cast to a float! case Type::FloatTyID: - /* - return (Val <= UINT8_MAX); - */ case Type::DoubleTyID: return true; // This is the largest type... } @@ -349,92 +450,115 @@ bool ConstantFP::isValueValidForType(const Type *Ty, double Val) { //===----------------------------------------------------------------------===// // replaceUsesOfWithOnConstant implementations -void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To) { +void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To, + bool DisableChecking) { assert(isa(To) && "Cannot make Constant refer to non-constant!"); std::vector Values; - Values.reserve(getValues().size()); // Build replacement array... - for (unsigned i = 0, e = getValues().size(); i != e; ++i) { - Constant *Val = cast(getValues()[i]); + Values.reserve(getNumOperands()); // Build replacement array... + for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { + Constant *Val = getOperand(i); if (Val == From) Val = cast(To); Values.push_back(Val); } - ConstantArray *Replacement = ConstantArray::get(getType(), Values); + Constant *Replacement = ConstantArray::get(getType(), Values); assert(Replacement != this && "I didn't contain From!"); // Everyone using this now uses the replacement... - replaceAllUsesWith(Replacement); + if (DisableChecking) + uncheckedReplaceAllUsesWith(Replacement); + else + replaceAllUsesWith(Replacement); // Delete the old constant! destroyConstant(); } -void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To) { +void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To, + bool DisableChecking) { assert(isa(To) && "Cannot make Constant refer to non-constant!"); std::vector Values; - Values.reserve(getValues().size()); - for (unsigned i = 0, e = getValues().size(); i != e; ++i) { - Constant *Val = cast(getValues()[i]); + Values.reserve(getNumOperands()); // Build replacement array... + for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { + Constant *Val = getOperand(i); if (Val == From) Val = cast(To); Values.push_back(Val); } - ConstantStruct *Replacement = ConstantStruct::get(getType(), Values); + Constant *Replacement = ConstantStruct::get(getType(), Values); assert(Replacement != this && "I didn't contain From!"); // Everyone using this now uses the replacement... - replaceAllUsesWith(Replacement); + if (DisableChecking) + uncheckedReplaceAllUsesWith(Replacement); + else + replaceAllUsesWith(Replacement); // Delete the old constant! destroyConstant(); } -void ConstantPointerRef::replaceUsesOfWithOnConstant(Value *From, Value *To) { - if (isa(To)) { - assert(From == getOperand(0) && "Doesn't contain from!"); - ConstantPointerRef *Replacement = - ConstantPointerRef::get(cast(To)); - - // Everyone using this now uses the replacement... +void ConstantPacked::replaceUsesOfWithOnConstant(Value *From, Value *To, + bool DisableChecking) { + assert(isa(To) && "Cannot make Constant refer to non-constant!"); + + std::vector Values; + Values.reserve(getNumOperands()); // Build replacement array... + for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { + Constant *Val = getOperand(i); + if (Val == From) Val = cast(To); + Values.push_back(Val); + } + + Constant *Replacement = ConstantPacked::get(getType(), Values); + assert(Replacement != this && "I didn't contain From!"); + + // Everyone using this now uses the replacement... + if (DisableChecking) + uncheckedReplaceAllUsesWith(Replacement); + else replaceAllUsesWith(Replacement); - - // Delete the old constant! - destroyConstant(); - } else { - // Just replace ourselves with the To value specified. - replaceAllUsesWith(To); - // Delete the old constant! - destroyConstant(); - } + // Delete the old constant! + destroyConstant(); } -void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *To) { - assert(isa(To) && "Cannot make Constant refer to non-constant!"); +void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV, + bool DisableChecking) { + assert(isa(ToV) && "Cannot make Constant refer to non-constant!"); + Constant *To = cast(ToV); Constant *Replacement = 0; if (getOpcode() == Instruction::GetElementPtr) { std::vector Indices; - Constant *Pointer = cast(getOperand(0)); + Constant *Pointer = getOperand(0); Indices.reserve(getNumOperands()-1); - if (Pointer == From) Pointer = cast(To); + if (Pointer == From) Pointer = To; for (unsigned i = 1, e = getNumOperands(); i != e; ++i) { - Constant *Val = cast(getOperand(i)); - if (Val == From) Val = cast(To); + Constant *Val = getOperand(i); + if (Val == From) Val = To; Indices.push_back(Val); } Replacement = ConstantExpr::getGetElementPtr(Pointer, Indices); } else if (getOpcode() == Instruction::Cast) { assert(getOperand(0) == From && "Cast only has one use!"); - Replacement = ConstantExpr::getCast(cast(To), getType()); + Replacement = ConstantExpr::getCast(To, getType()); + } else if (getOpcode() == Instruction::Select) { + Constant *C1 = getOperand(0); + Constant *C2 = getOperand(1); + Constant *C3 = getOperand(2); + if (C1 == From) C1 = To; + if (C2 == From) C2 = To; + if (C3 == From) C3 = To; + Replacement = ConstantExpr::getSelect(C1, C2, C3); } else if (getNumOperands() == 2) { - Constant *C1 = cast(getOperand(0)); - Constant *C2 = cast(getOperand(1)); - if (C1 == From) C1 = cast(To); - if (C2 == From) C2 = cast(To); + Constant *C1 = getOperand(0); + Constant *C2 = getOperand(1); + if (C1 == From) C1 = To; + if (C2 == From) C2 = To; Replacement = ConstantExpr::get(getOpcode(), C1, C2); } else { assert(0 && "Unknown ConstantExpr type!"); @@ -444,58 +568,181 @@ void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *To) { assert(Replacement != this && "I didn't contain From!"); // Everyone using this now uses the replacement... - replaceAllUsesWith(Replacement); + if (DisableChecking) + uncheckedReplaceAllUsesWith(Replacement); + else + replaceAllUsesWith(Replacement); // Delete the old constant! destroyConstant(); } - - //===----------------------------------------------------------------------===// // Factory Function Implementation -template -struct ValueMap { - typedef std::pair ConstHashKey; - std::map Map; - - inline ConstantClass *get(const Type *Ty, ValType V) { - typename std::map::iterator I = - Map.find(ConstHashKey(Ty, V)); - return (I != Map.end()) ? I->second : 0; - } +// ConstantCreator - A class that is used to create constants by +// ValueMap*. This class should be partially specialized if there is +// something strange that needs to be done to interface to the ctor for the +// constant. +// +namespace llvm { + template + struct ConstantCreator { + static ConstantClass *create(const TypeClass *Ty, const ValType &V) { + return new ConstantClass(Ty, V); + } + }; + + template + struct ConvertConstantType { + static void convert(ConstantClass *OldC, const TypeClass *NewTy) { + assert(0 && "This type cannot be converted!\n"); + abort(); + } + }; +} - inline void add(const Type *Ty, ValType V, ConstantClass *CP) { - Map.insert(std::make_pair(ConstHashKey(Ty, V), CP)); - } +namespace { + template + class ValueMap : public AbstractTypeUser { + typedef std::pair MapKey; + typedef std::map MapTy; + typedef typename MapTy::iterator MapIterator; + MapTy Map; + + typedef std::map AbstractTypeMapTy; + AbstractTypeMapTy AbstractTypeMap; + public: + // getOrCreate - Return the specified constant from the map, creating it if + // necessary. + ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) { + MapKey Lookup(Ty, V); + MapIterator I = Map.lower_bound(Lookup); + if (I != Map.end() && I->first == Lookup) + return I->second; // Is it in the map? + + // If no preexisting value, create one now... + ConstantClass *Result = + ConstantCreator::create(Ty, V); + + + /// FIXME: why does this assert fail when loading 176.gcc? + //assert(Result->getType() == Ty && "Type specified is not correct!"); + I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result)); + + // If the type of the constant is abstract, make sure that an entry exists + // for it in the AbstractTypeMap. + if (Ty->isAbstract()) { + typename AbstractTypeMapTy::iterator TI = + AbstractTypeMap.lower_bound(Ty); + + if (TI == AbstractTypeMap.end() || TI->first != Ty) { + // Add ourselves to the ATU list of the type. + cast(Ty)->addAbstractTypeUser(this); + + AbstractTypeMap.insert(TI, std::make_pair(Ty, I)); + } + } + return Result; + } + + void remove(ConstantClass *CP) { + MapIterator I = Map.find(MapKey((TypeClass*)CP->getRawType(), + getValType(CP))); + if (I == Map.end() || I->second != CP) { + // FIXME: This should not use a linear scan. If this gets to be a + // performance problem, someone should look at this. + for (I = Map.begin(); I != Map.end() && I->second != CP; ++I) + /* empty */; + } - inline void remove(ConstantClass *CP) { - for (typename std::map::iterator - I = Map.begin(), E = Map.end(); I != E; ++I) - if (I->second == CP) { - Map.erase(I); - return; + assert(I != Map.end() && "Constant not found in constant table!"); + assert(I->second == CP && "Didn't find correct element?"); + + // Now that we found the entry, make sure this isn't the entry that + // the AbstractTypeMap points to. + const TypeClass *Ty = I->first.first; + if (Ty->isAbstract()) { + assert(AbstractTypeMap.count(Ty) && + "Abstract type not in AbstractTypeMap?"); + MapIterator &ATMEntryIt = AbstractTypeMap[Ty]; + if (ATMEntryIt == I) { + // Yes, we are removing the representative entry for this type. + // See if there are any other entries of the same type. + MapIterator TmpIt = ATMEntryIt; + + // First check the entry before this one... + if (TmpIt != Map.begin()) { + --TmpIt; + if (TmpIt->first.first != Ty) // Not the same type, move back... + ++TmpIt; + } + + // If we didn't find the same type, try to move forward... + if (TmpIt == ATMEntryIt) { + ++TmpIt; + if (TmpIt == Map.end() || TmpIt->first.first != Ty) + --TmpIt; // No entry afterwards with the same type + } + + // If there is another entry in the map of the same abstract type, + // update the AbstractTypeMap entry now. + if (TmpIt != ATMEntryIt) { + ATMEntryIt = TmpIt; + } else { + // Otherwise, we are removing the last instance of this type + // from the table. Remove from the ATM, and from user list. + cast(Ty)->removeAbstractTypeUser(this); + AbstractTypeMap.erase(Ty); + } + } } - } -}; + + Map.erase(I); + } + + void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) { + typename AbstractTypeMapTy::iterator I = + AbstractTypeMap.find(cast(OldTy)); + + assert(I != AbstractTypeMap.end() && + "Abstract type not in AbstractTypeMap?"); + + // Convert a constant at a time until the last one is gone. The last one + // leaving will remove() itself, causing the AbstractTypeMapEntry to be + // eliminated eventually. + do { + ConvertConstantType::convert(I->second->second, + cast(NewTy)); + + I = AbstractTypeMap.find(cast(OldTy)); + } while (I != AbstractTypeMap.end()); + } + + // If the type became concrete without being refined to any other existing + // type, we just remove ourselves from the ATU list. + void typeBecameConcrete(const DerivedType *AbsTy) { + AbsTy->removeAbstractTypeUser(this); + } + + void dump() const { + std::cerr << "Constant.cpp: ValueMap\n"; + } + }; +} //---- ConstantUInt::get() and ConstantSInt::get() implementations... // -static ValueMap IntConstants; +static ValueMap< int64_t, Type, ConstantSInt> SIntConstants; +static ValueMap UIntConstants; ConstantSInt *ConstantSInt::get(const Type *Ty, int64_t V) { - ConstantSInt *Result = (ConstantSInt*)IntConstants.get(Ty, (uint64_t)V); - if (!Result) // If no preexisting value, create one now... - IntConstants.add(Ty, V, Result = new ConstantSInt(Ty, V)); - return Result; + return SIntConstants.getOrCreate(Ty, V); } ConstantUInt *ConstantUInt::get(const Type *Ty, uint64_t V) { - ConstantUInt *Result = (ConstantUInt*)IntConstants.get(Ty, V); - if (!Result) // If no preexisting value, create one now... - IntConstants.add(Ty, V, Result = new ConstantUInt(Ty, V)); - return Result; + return UIntConstants.getOrCreate(Ty, V); } ConstantInt *ConstantInt::get(const Type *Ty, unsigned char V) { @@ -506,32 +753,157 @@ ConstantInt *ConstantInt::get(const Type *Ty, unsigned char V) { //---- ConstantFP::get() implementation... // -static ValueMap FPConstants; +namespace llvm { + template<> + struct ConstantCreator { + static ConstantFP *create(const Type *Ty, uint64_t V) { + assert(Ty == Type::DoubleTy); + union { + double F; + uint64_t I; + } T; + T.I = V; + return new ConstantFP(Ty, T.F); + } + }; + template<> + struct ConstantCreator { + static ConstantFP *create(const Type *Ty, uint32_t V) { + assert(Ty == Type::FloatTy); + union { + float F; + uint32_t I; + } T; + T.I = V; + return new ConstantFP(Ty, T.F); + } + }; +} + +static ValueMap DoubleConstants; +static ValueMap FloatConstants; ConstantFP *ConstantFP::get(const Type *Ty, double V) { - ConstantFP *Result = FPConstants.get(Ty, V); - if (!Result) // If no preexisting value, create one now... - FPConstants.add(Ty, V, Result = new ConstantFP(Ty, V)); - return Result; + if (Ty == Type::FloatTy) { + // Force the value through memory to normalize it. + union { + float F; + uint32_t I; + } T; + T.F = (float)V; + return FloatConstants.getOrCreate(Ty, T.I); + } else { + assert(Ty == Type::DoubleTy); + union { + double F; + uint64_t I; + } T; + T.F = V; + return DoubleConstants.getOrCreate(Ty, T.I); + } +} + +//---- ConstantAggregateZero::get() implementation... +// +namespace llvm { + // ConstantAggregateZero does not take extra "value" argument... + template + struct ConstantCreator { + static ConstantAggregateZero *create(const Type *Ty, const ValType &V){ + return new ConstantAggregateZero(Ty); + } + }; + + template<> + struct ConvertConstantType { + static void convert(ConstantAggregateZero *OldC, const Type *NewTy) { + // Make everyone now use a constant of the new type... + Constant *New = ConstantAggregateZero::get(NewTy); + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; } +static ValueMap AggZeroConstants; + +static char getValType(ConstantAggregateZero *CPZ) { return 0; } + +Constant *ConstantAggregateZero::get(const Type *Ty) { + return AggZeroConstants.getOrCreate(Ty, 0); +} + +// destroyConstant - Remove the constant from the constant table... +// +void ConstantAggregateZero::destroyConstant() { + AggZeroConstants.remove(this); + destroyConstantImpl(); +} + +void ConstantAggregateZero::replaceUsesOfWithOnConstant(Value *From, Value *To, + bool DisableChecking) { + assert(0 && "No uses!"); + abort(); +} + + + //---- ConstantArray::get() implementation... // -static ValueMap, ConstantArray> ArrayConstants; +namespace llvm { + template<> + struct ConvertConstantType { + static void convert(ConstantArray *OldC, const ArrayType *NewTy) { + // Make everyone now use a constant of the new type... + std::vector C; + for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i) + C.push_back(cast(OldC->getOperand(i))); + Constant *New = ConstantArray::get(NewTy, C); + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; +} -ConstantArray *ConstantArray::get(const ArrayType *Ty, - const std::vector &V) { - ConstantArray *Result = ArrayConstants.get(Ty, V); - if (!Result) // If no preexisting value, create one now... - ArrayConstants.add(Ty, V, Result = new ConstantArray(Ty, V)); - return Result; +static std::vector getValType(ConstantArray *CA) { + std::vector Elements; + Elements.reserve(CA->getNumOperands()); + for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i) + Elements.push_back(cast(CA->getOperand(i))); + return Elements; +} + +static ValueMap, ArrayType, + ConstantArray> ArrayConstants; + +Constant *ConstantArray::get(const ArrayType *Ty, + const std::vector &V) { + // If this is an all-zero array, return a ConstantAggregateZero object + if (!V.empty()) { + Constant *C = V[0]; + if (!C->isNullValue()) + return ArrayConstants.getOrCreate(Ty, V); + for (unsigned i = 1, e = V.size(); i != e; ++i) + if (V[i] != C) + return ArrayConstants.getOrCreate(Ty, V); + } + return ConstantAggregateZero::get(Ty); +} + +// destroyConstant - Remove the constant from the constant table... +// +void ConstantArray::destroyConstant() { + ArrayConstants.remove(this); + destroyConstantImpl(); } // ConstantArray::get(const string&) - Return an array that is initialized to // contain the specified string. A null terminator is added to the specified // string so that it may be used in a natural way... // -ConstantArray *ConstantArray::get(const std::string &Str) { +Constant *ConstantArray::get(const std::string &Str) { std::vector ElementVals; for (unsigned i = 0; i < Str.length(); ++i) @@ -544,12 +916,19 @@ ConstantArray *ConstantArray::get(const std::string &Str) { return ConstantArray::get(ATy, ElementVals); } - -// destroyConstant - Remove the constant from the constant table... -// -void ConstantArray::destroyConstant() { - ArrayConstants.remove(this); - destroyConstantImpl(); +/// isString - This method returns true if the array is an array of sbyte or +/// ubyte, and if the elements of the array are all ConstantInt's. +bool ConstantArray::isString() const { + // Check the element type for sbyte or ubyte... + if (getType()->getElementType() != Type::UByteTy && + getType()->getElementType() != Type::SByteTy) + return false; + // Check the elements to make sure they are all integers, not constant + // expressions. + for (unsigned i = 0, e = getNumOperands(); i != e; ++i) + if (!isa(getOperand(i))) + return false; + return true; } // getAsString - If the sub-element type of this array is either sbyte or ubyte, @@ -557,29 +936,61 @@ void ConstantArray::destroyConstant() { // Otherwise, it asserts out. // std::string ConstantArray::getAsString() const { + assert(isString() && "Not a string!"); std::string Result; - if (getType()->getElementType() == Type::SByteTy) - for (unsigned i = 0, e = getNumOperands(); i != e; ++i) - Result += (char)cast(getOperand(i))->getValue(); - else { - assert(getType()->getElementType() == Type::UByteTy && "Not a string!"); - for (unsigned i = 0, e = getNumOperands(); i != e; ++i) - Result += (char)cast(getOperand(i))->getValue(); - } + for (unsigned i = 0, e = getNumOperands(); i != e; ++i) + Result += (char)cast(getOperand(i))->getRawValue(); return Result; } //---- ConstantStruct::get() implementation... // -static ValueMap, ConstantStruct> StructConstants; -ConstantStruct *ConstantStruct::get(const StructType *Ty, - const std::vector &V) { - ConstantStruct *Result = StructConstants.get(Ty, V); - if (!Result) // If no preexisting value, create one now... - StructConstants.add(Ty, V, Result = new ConstantStruct(Ty, V)); - return Result; +namespace llvm { + template<> + struct ConvertConstantType { + static void convert(ConstantStruct *OldC, const StructType *NewTy) { + // Make everyone now use a constant of the new type... + std::vector C; + for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i) + C.push_back(cast(OldC->getOperand(i))); + Constant *New = ConstantStruct::get(NewTy, C); + assert(New != OldC && "Didn't replace constant??"); + + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; +} + +static ValueMap, StructType, + ConstantStruct> StructConstants; + +static std::vector getValType(ConstantStruct *CS) { + std::vector Elements; + Elements.reserve(CS->getNumOperands()); + for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) + Elements.push_back(cast(CS->getOperand(i))); + return Elements; +} + +Constant *ConstantStruct::get(const StructType *Ty, + const std::vector &V) { + // Create a ConstantAggregateZero value if all elements are zeros... + for (unsigned i = 0, e = V.size(); i != e; ++i) + if (!V[i]->isNullValue()) + return StructConstants.getOrCreate(Ty, V); + + return ConstantAggregateZero::get(Ty); +} + +Constant *ConstantStruct::get(const std::vector &V) { + std::vector StructEls; + StructEls.reserve(V.size()); + for (unsigned i = 0, e = V.size(); i != e; ++i) + StructEls.push_back(V[i]->getType()); + return get(StructType::get(StructEls), V); } // destroyConstant - Remove the constant from the constant table... @@ -589,16 +1000,94 @@ void ConstantStruct::destroyConstant() { destroyConstantImpl(); } +//---- ConstantPacked::get() implementation... +// +namespace llvm { + template<> + struct ConvertConstantType { + static void convert(ConstantPacked *OldC, const PackedType *NewTy) { + // Make everyone now use a constant of the new type... + std::vector C; + for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i) + C.push_back(cast(OldC->getOperand(i))); + Constant *New = ConstantPacked::get(NewTy, C); + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; +} + +static std::vector getValType(ConstantPacked *CP) { + std::vector Elements; + Elements.reserve(CP->getNumOperands()); + for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i) + Elements.push_back(CP->getOperand(i)); + return Elements; +} + +static ValueMap, PackedType, + ConstantPacked> PackedConstants; + +Constant *ConstantPacked::get(const PackedType *Ty, + const std::vector &V) { + // If this is an all-zero packed, return a ConstantAggregateZero object + if (!V.empty()) { + Constant *C = V[0]; + if (!C->isNullValue()) + return PackedConstants.getOrCreate(Ty, V); + for (unsigned i = 1, e = V.size(); i != e; ++i) + if (V[i] != C) + return PackedConstants.getOrCreate(Ty, V); + } + return ConstantAggregateZero::get(Ty); +} + +Constant *ConstantPacked::get(const std::vector &V) { + assert(!V.empty() && "Cannot infer type if V is empty"); + return get(PackedType::get(V.front()->getType(),V.size()), V); +} + +// destroyConstant - Remove the constant from the constant table... +// +void ConstantPacked::destroyConstant() { + PackedConstants.remove(this); + destroyConstantImpl(); +} //---- ConstantPointerNull::get() implementation... // -static ValueMap NullPtrConstants; + +namespace llvm { + // ConstantPointerNull does not take extra "value" argument... + template + struct ConstantCreator { + static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){ + return new ConstantPointerNull(Ty); + } + }; + + template<> + struct ConvertConstantType { + static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) { + // Make everyone now use a constant of the new type... + Constant *New = ConstantPointerNull::get(NewTy); + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; +} + +static ValueMap NullPtrConstants; + +static char getValType(ConstantPointerNull *) { + return 0; +} + ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) { - ConstantPointerNull *Result = NullPtrConstants.get(Ty, 0); - if (!Result) // If no preexisting value, create one now... - NullPtrConstants.add(Ty, 0, Result = new ConstantPointerNull(Ty)); - return Result; + return NullPtrConstants.getOrCreate(Ty, 0); } // destroyConstant - Remove the constant from the constant table... @@ -609,99 +1098,298 @@ void ConstantPointerNull::destroyConstant() { } -//---- ConstantPointerRef::get() implementation... +//---- UndefValue::get() implementation... // -ConstantPointerRef *ConstantPointerRef::get(GlobalValue *GV) { - assert(GV->getParent() && "Global Value must be attached to a module!"); - - // The Module handles the pointer reference sharing... - return GV->getParent()->getConstantPointerRef(GV); + +namespace llvm { + // UndefValue does not take extra "value" argument... + template + struct ConstantCreator { + static UndefValue *create(const Type *Ty, const ValType &V) { + return new UndefValue(Ty); + } + }; + + template<> + struct ConvertConstantType { + static void convert(UndefValue *OldC, const Type *NewTy) { + // Make everyone now use a constant of the new type. + Constant *New = UndefValue::get(NewTy); + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; } -// destroyConstant - Remove the constant from the constant table... +static ValueMap UndefValueConstants; + +static char getValType(UndefValue *) { + return 0; +} + + +UndefValue *UndefValue::get(const Type *Ty) { + return UndefValueConstants.getOrCreate(Ty, 0); +} + +// destroyConstant - Remove the constant from the constant table. // -void ConstantPointerRef::destroyConstant() { - getValue()->getParent()->destroyConstantPointerRef(this); +void UndefValue::destroyConstant() { + UndefValueConstants.remove(this); destroyConstantImpl(); } + + //---- ConstantExpr::get() implementations... // typedef std::pair > ExprMapKeyType; -static ValueMap ExprConstants; + +namespace llvm { + template<> + struct ConstantCreator { + static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V) { + if (V.first == Instruction::Cast) + return new ConstantExpr(Instruction::Cast, V.second[0], Ty); + if ((V.first >= Instruction::BinaryOpsBegin && + V.first < Instruction::BinaryOpsEnd) || + V.first == Instruction::Shl || V.first == Instruction::Shr) + return new ConstantExpr(V.first, V.second[0], V.second[1]); + if (V.first == Instruction::Select) + return new ConstantExpr(V.second[0], V.second[1], V.second[2]); + + assert(V.first == Instruction::GetElementPtr && "Invalid ConstantExpr!"); + + std::vector IdxList(V.second.begin()+1, V.second.end()); + return new ConstantExpr(V.second[0], IdxList, Ty); + } + }; + + template<> + struct ConvertConstantType { + static void convert(ConstantExpr *OldC, const Type *NewTy) { + Constant *New; + switch (OldC->getOpcode()) { + case Instruction::Cast: + New = ConstantExpr::getCast(OldC->getOperand(0), NewTy); + break; + case Instruction::Select: + New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0), + OldC->getOperand(1), + OldC->getOperand(2)); + break; + case Instruction::Shl: + case Instruction::Shr: + New = ConstantExpr::getShiftTy(NewTy, OldC->getOpcode(), + OldC->getOperand(0), OldC->getOperand(1)); + break; + default: + assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin && + OldC->getOpcode() < Instruction::BinaryOpsEnd); + New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0), + OldC->getOperand(1)); + break; + case Instruction::GetElementPtr: + // Make everyone now use a constant of the new type... + std::vector Idx(OldC->op_begin()+1, OldC->op_end()); + New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0), Idx); + break; + } + + assert(New != OldC && "Didn't replace constant??"); + OldC->uncheckedReplaceAllUsesWith(New); + OldC->destroyConstant(); // This constant is now dead, destroy it. + } + }; +} // end namespace llvm + + +static ExprMapKeyType getValType(ConstantExpr *CE) { + std::vector Operands; + Operands.reserve(CE->getNumOperands()); + for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i) + Operands.push_back(cast(CE->getOperand(i))); + return ExprMapKeyType(CE->getOpcode(), Operands); +} + +static ValueMap ExprConstants; Constant *ConstantExpr::getCast(Constant *C, const Type *Ty) { + assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!"); + if (Constant *FC = ConstantFoldCastInstruction(C, Ty)) return FC; // Fold a few common cases... // Look up the constant in the table first to ensure uniqueness std::vector argVec(1, C); - const ExprMapKeyType &Key = std::make_pair(Instruction::Cast, argVec); - ConstantExpr *Result = ExprConstants.get(Ty, Key); - if (Result) return Result; - - // Its not in the table so create a new one and put it in the table. - Result = new ConstantExpr(Instruction::Cast, C, Ty); - ExprConstants.add(Ty, Key, Result); - return Result; + ExprMapKeyType Key = std::make_pair(Instruction::Cast, argVec); + return ExprConstants.getOrCreate(Ty, Key); } -Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) { - - if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2)) - return FC; // Fold a few common cases... +Constant *ConstantExpr::getSignExtend(Constant *C, const Type *Ty) { + assert(C->getType()->isInteger() && Ty->isInteger() && + C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() && + "This is an illegal sign extension!"); + C = ConstantExpr::getCast(C, C->getType()->getSignedVersion()); + return ConstantExpr::getCast(C, Ty); +} - // Look up the constant in the table first to ensure uniqueness - std::vector argVec(1, C1); argVec.push_back(C2); - const ExprMapKeyType &Key = std::make_pair(Opcode, argVec); - ConstantExpr *Result = ExprConstants.get(C1->getType(), Key); - if (Result) return Result; - - // Its not in the table so create a new one and put it in the table. +Constant *ConstantExpr::getZeroExtend(Constant *C, const Type *Ty) { + assert(C->getType()->isInteger() && Ty->isInteger() && + C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() && + "This is an illegal zero extension!"); + C = ConstantExpr::getCast(C, C->getType()->getUnsignedVersion()); + return ConstantExpr::getCast(C, Ty); +} + +Constant *ConstantExpr::getSizeOf(const Type *Ty) { + // sizeof is implemented as: (unsigned) gep (Ty*)null, 1 + return getCast( + getGetElementPtr( + getNullValue(PointerType::get(Ty)), + std::vector(1, ConstantInt::get(Type::UIntTy, 1))), + Type::UIntTy); +} + +Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode, + Constant *C1, Constant *C2) { + if (Opcode == Instruction::Shl || Opcode == Instruction::Shr) + return getShiftTy(ReqTy, Opcode, C1, C2); // Check the operands for consistency first assert((Opcode >= Instruction::BinaryOpsBegin && Opcode < Instruction::BinaryOpsEnd) && "Invalid opcode in binary constant expression"); - assert(C1->getType() == C2->getType() && "Operand types in binary constant expression should match"); - - Result = new ConstantExpr(Opcode, C1, C2); - ExprConstants.add(C1->getType(), Key, Result); - return Result; + + if (ReqTy == C1->getType() || (Instruction::isRelational(Opcode) && + ReqTy == Type::BoolTy)) + if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2)) + return FC; // Fold a few common cases... + + std::vector argVec(1, C1); argVec.push_back(C2); + ExprMapKeyType Key = std::make_pair(Opcode, argVec); + return ExprConstants.getOrCreate(ReqTy, Key); } -Constant *ConstantExpr::getGetElementPtr(Constant *C, - const std::vector &IdxList){ +Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) { +#ifndef NDEBUG + switch (Opcode) { + case Instruction::Add: case Instruction::Sub: + case Instruction::Mul: case Instruction::Div: + case Instruction::Rem: + assert(C1->getType() == C2->getType() && "Op types should be identical!"); + assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint()) && + "Tried to create an arithmetic operation on a non-arithmetic type!"); + break; + case Instruction::And: + case Instruction::Or: + case Instruction::Xor: + assert(C1->getType() == C2->getType() && "Op types should be identical!"); + assert(C1->getType()->isIntegral() && + "Tried to create an logical operation on a non-integral type!"); + break; + case Instruction::SetLT: case Instruction::SetGT: case Instruction::SetLE: + case Instruction::SetGE: case Instruction::SetEQ: case Instruction::SetNE: + assert(C1->getType() == C2->getType() && "Op types should be identical!"); + break; + case Instruction::Shl: + case Instruction::Shr: + assert(C2->getType() == Type::UByteTy && "Shift should be by ubyte!"); + assert(C1->getType()->isInteger() && + "Tried to create a shift operation on a non-integer type!"); + break; + default: + break; + } +#endif + + if (Instruction::isRelational(Opcode)) + return getTy(Type::BoolTy, Opcode, C1, C2); + else + return getTy(C1->getType(), Opcode, C1, C2); +} + +Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C, + Constant *V1, Constant *V2) { + assert(C->getType() == Type::BoolTy && "Select condition must be bool!"); + assert(V1->getType() == V2->getType() && "Select value types must match!"); + assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!"); + + if (ReqTy == V1->getType()) + if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2)) + return SC; // Fold common cases + + std::vector argVec(3, C); + argVec[1] = V1; + argVec[2] = V2; + ExprMapKeyType Key = std::make_pair(Instruction::Select, argVec); + return ExprConstants.getOrCreate(ReqTy, Key); +} + +/// getShiftTy - Return a shift left or shift right constant expr +Constant *ConstantExpr::getShiftTy(const Type *ReqTy, unsigned Opcode, + Constant *C1, Constant *C2) { + // Check the operands for consistency first + assert((Opcode == Instruction::Shl || + Opcode == Instruction::Shr) && + "Invalid opcode in binary constant expression"); + assert(C1->getType()->isIntegral() && C2->getType() == Type::UByteTy && + "Invalid operand types for Shift constant expr!"); + + if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2)) + return FC; // Fold a few common cases... + + // Look up the constant in the table first to ensure uniqueness + std::vector argVec(1, C1); argVec.push_back(C2); + ExprMapKeyType Key = std::make_pair(Opcode, argVec); + return ExprConstants.getOrCreate(ReqTy, Key); +} + + +Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C, + const std::vector &IdxList) { + assert(GetElementPtrInst::getIndexedType(C->getType(), IdxList, true) && + "GEP indices invalid!"); + if (Constant *FC = ConstantFoldGetElementPtr(C, IdxList)) return FC; // Fold a few common cases... - const Type *Ty = C->getType(); + assert(isa(C->getType()) && + "Non-pointer type for constant GetElementPtr expression"); // Look up the constant in the table first to ensure uniqueness - std::vector argVec(1, C); - argVec.insert(argVec.end(), IdxList.begin(), IdxList.end()); - - const ExprMapKeyType &Key = std::make_pair(Instruction::GetElementPtr,argVec); - ConstantExpr *Result = ExprConstants.get(Ty, Key); - if (Result) return Result; + std::vector ArgVec; + ArgVec.reserve(IdxList.size()+1); + ArgVec.push_back(C); + for (unsigned i = 0, e = IdxList.size(); i != e; ++i) + ArgVec.push_back(cast(IdxList[i])); + const ExprMapKeyType &Key = std::make_pair(Instruction::GetElementPtr,ArgVec); + return ExprConstants.getOrCreate(ReqTy, Key); +} - // Its not in the table so create a new one and put it in the table. - // Check the operands for consistency first - // - assert(isa(Ty) && - "Non-pointer type for constant GelElementPtr expression"); - - // Check that the indices list is valid... - std::vector ValIdxList(IdxList.begin(), IdxList.end()); - const Type *DestTy = GetElementPtrInst::getIndexedType(Ty, ValIdxList, true); - assert(DestTy && "Invalid index list for constant GelElementPtr expression"); - - Result = new ConstantExpr(C, IdxList, PointerType::get(DestTy)); - ExprConstants.add(Ty, Key, Result); - return Result; +Constant *ConstantExpr::getGetElementPtr(Constant *C, + const std::vector &IdxList){ + // Get the result type of the getelementptr! + std::vector VIdxList(IdxList.begin(), IdxList.end()); + + const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), VIdxList, + true); + assert(Ty && "GEP indices invalid!"); + return getGetElementPtrTy(PointerType::get(Ty), C, VIdxList); } +Constant *ConstantExpr::getGetElementPtr(Constant *C, + const std::vector &IdxList) { + // Get the result type of the getelementptr! + const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), IdxList, + true); + assert(Ty && "GEP indices invalid!"); + return getGetElementPtrTy(PointerType::get(Ty), C, IdxList); +} + + // destroyConstant - Remove the constant from the constant table... // void ConstantExpr::destroyConstant() { @@ -713,25 +1401,3 @@ const char *ConstantExpr::getOpcodeName() const { return Instruction::getOpcodeName(getOpcode()); } -unsigned Constant::mutateReferences(Value *OldV, Value *NewV) { - // Uses of constant pointer refs are global values, not constants! - if (ConstantPointerRef *CPR = dyn_cast(this)) { - GlobalValue *NewGV = cast(NewV); - GlobalValue *OldGV = CPR->getValue(); - - assert(OldGV == OldV && "Cannot mutate old value if I'm not using it!"); - - OldGV->getParent()->mutateConstantPointerRef(OldGV, NewGV); - Operands[0] = NewGV; - return 1; - } else { - Constant *NewC = cast(NewV); - unsigned NumReplaced = 0; - for (unsigned i = 0, N = getNumOperands(); i != N; ++i) - if (Operands[i] == OldV) { - ++NumReplaced; - Operands[i] = NewC; - } - return NumReplaced; - } -}