2003-05-13 21:37:02 +00:00
|
|
|
//===-- Constants.cpp - Implement Constant nodes --------------------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
2001-12-03 22:26:30 +00:00
|
|
|
// This file implements the Constant* classes...
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-07-24 23:12:02 +00:00
|
|
|
#include "LLVMContextImpl.h"
|
2002-04-28 19:55:58 +00:00
|
|
|
#include "llvm/Constants.h"
|
2007-02-27 03:05:06 +00:00
|
|
|
#include "ConstantFold.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2004-07-17 23:48:33 +00:00
|
|
|
#include "llvm/GlobalValue.h"
|
2004-07-29 17:30:56 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2009-05-10 20:57:05 +00:00
|
|
|
#include "llvm/MDNode.h"
|
2001-10-13 06:57:33 +00:00
|
|
|
#include "llvm/Module.h"
|
2009-07-18 01:49:22 +00:00
|
|
|
#include "llvm/Operator.h"
|
2009-04-04 07:22:01 +00:00
|
|
|
#include "llvm/ADT/FoldingSet.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2009-04-04 07:22:01 +00:00
|
|
|
#include "llvm/ADT/StringMap.h"
|
2006-08-27 12:54:02 +00:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2006-11-17 08:03:48 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-11 13:10:19 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2006-09-28 00:35:06 +00:00
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
2006-11-17 08:03:48 +00:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2009-06-20 00:24:58 +00:00
|
|
|
#include "llvm/System/Mutex.h"
|
2009-06-17 18:40:29 +00:00
|
|
|
#include "llvm/System/RWMutex.h"
|
2009-06-18 16:54:52 +00:00
|
|
|
#include "llvm/System/Threading.h"
|
2007-02-20 06:39:57 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2007-02-19 20:01:23 +00:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include <algorithm>
|
2007-02-05 20:47:22 +00:00
|
|
|
#include <map>
|
2003-11-21 20:23:48 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-12-03 22:26:30 +00:00
|
|
|
// Constant Class
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-06-18 19:10:19 +00:00
|
|
|
// Becomes a no-op when multithreading is disabled.
|
|
|
|
ManagedStatic<sys::SmartRWMutex<true> > ConstantsLock;
|
2009-06-17 18:40:29 +00:00
|
|
|
|
2002-08-13 17:50:20 +00:00
|
|
|
void Constant::destroyConstantImpl() {
|
|
|
|
// When a Constant is destroyed, there may be lingering
|
|
|
|
// references to the constant by other constants in the constant pool. These
|
2003-08-21 22:14:26 +00:00
|
|
|
// constants are implicitly dependent on the module that is being deleted,
|
2002-08-13 17:50:20 +00:00
|
|
|
// 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.
|
|
|
|
//
|
|
|
|
while (!use_empty()) {
|
|
|
|
Value *V = use_back();
|
|
|
|
#ifndef NDEBUG // Only in -g mode...
|
|
|
|
if (!isa<Constant>(V))
|
2006-11-17 08:03:48 +00:00
|
|
|
DOUT << "While deleting: " << *this
|
|
|
|
<< "\n\nUse still stuck around after Def is destroyed: "
|
|
|
|
<< *V << "\n\n";
|
2002-08-13 17:50:20 +00:00
|
|
|
#endif
|
|
|
|
assert(isa<Constant>(V) && "References remain to Constant being destroyed");
|
2004-07-17 23:48:33 +00:00
|
|
|
Constant *CV = cast<Constant>(V);
|
|
|
|
CV->destroyConstant();
|
2002-08-13 17:50:20 +00:00
|
|
|
|
|
|
|
// The constant should remove itself from our use list...
|
|
|
|
assert((use_empty() || use_back() != V) && "Constant not removed!");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Value has no outstanding references it is safe to delete it now...
|
|
|
|
delete this;
|
|
|
|
}
|
|
|
|
|
2006-10-20 00:27:06 +00:00
|
|
|
/// canTrap - Return true if evaluation of this constant could trap. This is
|
|
|
|
/// true for things like constant expressions that could divide by zero.
|
|
|
|
bool Constant::canTrap() const {
|
|
|
|
assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
|
|
|
|
// The only thing that could possibly trap are constant exprs.
|
|
|
|
const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
|
|
|
|
if (!CE) return false;
|
|
|
|
|
|
|
|
// ConstantExpr traps if any operands can trap.
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
|
|
|
if (getOperand(i)->canTrap())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Otherwise, only specific operations can trap.
|
|
|
|
switch (CE->getOpcode()) {
|
|
|
|
default:
|
|
|
|
return false;
|
2006-10-26 06:15:43 +00:00
|
|
|
case Instruction::UDiv:
|
|
|
|
case Instruction::SDiv:
|
|
|
|
case Instruction::FDiv:
|
2006-11-02 01:53:59 +00:00
|
|
|
case Instruction::URem:
|
|
|
|
case Instruction::SRem:
|
|
|
|
case Instruction::FRem:
|
2006-10-20 00:27:06 +00:00
|
|
|
// Div and rem can trap if the RHS is not known to be non-zero.
|
|
|
|
if (!isa<ConstantInt>(getOperand(1)) || getOperand(1)->isNullValue())
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-03-30 15:28:21 +00:00
|
|
|
|
2009-07-22 00:05:44 +00:00
|
|
|
/// getRelocationInfo - This method classifies the entry according to
|
|
|
|
/// whether or not it may generate a relocation entry. This must be
|
|
|
|
/// conservative, so if it might codegen to a relocatable entry, it should say
|
|
|
|
/// so. The return values are:
|
|
|
|
///
|
2009-07-24 03:27:21 +00:00
|
|
|
/// NoRelocation: This constant pool entry is guaranteed to never have a
|
|
|
|
/// relocation applied to it (because it holds a simple constant like
|
|
|
|
/// '4').
|
|
|
|
/// LocalRelocation: This entry has relocations, but the entries are
|
|
|
|
/// guaranteed to be resolvable by the static linker, so the dynamic
|
|
|
|
/// linker will never see them.
|
|
|
|
/// GlobalRelocations: This entry may have arbitrary relocations.
|
2009-07-22 00:05:44 +00:00
|
|
|
///
|
|
|
|
/// FIXME: This really should not be in VMCore.
|
2009-07-24 03:27:21 +00:00
|
|
|
Constant::PossibleRelocationsTy Constant::getRelocationInfo() const {
|
|
|
|
if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
|
2009-07-22 00:05:44 +00:00
|
|
|
if (GV->hasLocalLinkage() || GV->hasHiddenVisibility())
|
2009-07-24 03:27:21 +00:00
|
|
|
return LocalRelocation; // Local to this file/library.
|
|
|
|
return GlobalRelocations; // Global reference.
|
2009-03-29 17:13:18 +00:00
|
|
|
}
|
2009-07-22 00:05:44 +00:00
|
|
|
|
2009-07-24 03:27:21 +00:00
|
|
|
PossibleRelocationsTy Result = NoRelocation;
|
2007-03-08 00:59:12 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
2009-07-22 00:05:44 +00:00
|
|
|
Result = std::max(Result, getOperand(i)->getRelocationInfo());
|
|
|
|
|
|
|
|
return Result;
|
2007-03-08 00:59:12 +00:00
|
|
|
}
|
|
|
|
|
2009-07-22 00:05:44 +00:00
|
|
|
|
2008-07-10 00:28:11 +00:00
|
|
|
/// getVectorElements - This method, which is only valid on constant of vector
|
|
|
|
/// type, returns the elements of the vector in the specified smallvector.
|
2008-07-14 05:10:41 +00:00
|
|
|
/// This handles breaking down a vector undef into undef elements, etc. For
|
|
|
|
/// constant exprs and other cases we can't handle, we return an empty vector.
|
2009-07-13 04:09:18 +00:00
|
|
|
void Constant::getVectorElements(LLVMContext &Context,
|
|
|
|
SmallVectorImpl<Constant*> &Elts) const {
|
2008-07-10 00:28:11 +00:00
|
|
|
assert(isa<VectorType>(getType()) && "Not a vector constant!");
|
|
|
|
|
|
|
|
if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) {
|
|
|
|
for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i)
|
|
|
|
Elts.push_back(CV->getOperand(i));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
const VectorType *VT = cast<VectorType>(getType());
|
|
|
|
if (isa<ConstantAggregateZero>(this)) {
|
|
|
|
Elts.assign(VT->getNumElements(),
|
2009-07-13 04:09:18 +00:00
|
|
|
Context.getNullValue(VT->getElementType()));
|
2008-07-10 00:28:11 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-07-14 05:10:41 +00:00
|
|
|
if (isa<UndefValue>(this)) {
|
2009-07-13 04:09:18 +00:00
|
|
|
Elts.assign(VT->getNumElements(), Context.getUndef(VT->getElementType()));
|
2008-07-14 05:10:41 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Unknown type, must be constant expr etc.
|
2008-07-10 00:28:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-02-20 06:39:57 +00:00
|
|
|
// ConstantInt
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-02-26 23:54:03 +00:00
|
|
|
ConstantInt::ConstantInt(const IntegerType *Ty, const APInt& V)
|
2007-02-20 05:55:46 +00:00
|
|
|
: Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
|
2007-02-26 23:54:03 +00:00
|
|
|
assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2009-07-24 23:12:02 +00:00
|
|
|
// Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
|
|
|
|
// as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
|
|
|
|
// operator== and operator!= to ensure that the DenseMap doesn't attempt to
|
|
|
|
// compare APInt's of different widths, which would violate an APInt class
|
|
|
|
// invariant which generates an assertion.
|
|
|
|
ConstantInt *ConstantInt::get(LLVMContext &Context, const APInt& V) {
|
|
|
|
// Get the corresponding integer type for the bit width of the value.
|
|
|
|
const IntegerType *ITy = Context.getIntegerType(V.getBitWidth());
|
|
|
|
// get an existing value or the insertion position
|
|
|
|
DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
|
|
|
|
|
|
|
|
Context.pImpl->ConstantsLock.reader_acquire();
|
|
|
|
ConstantInt *&Slot = Context.pImpl->IntConstants[Key];
|
|
|
|
Context.pImpl->ConstantsLock.reader_release();
|
|
|
|
|
|
|
|
if (!Slot) {
|
|
|
|
sys::SmartScopedWriter<true> Writer(Context.pImpl->ConstantsLock);
|
|
|
|
ConstantInt *&NewSlot = Context.pImpl->IntConstants[Key];
|
|
|
|
if (!Slot) {
|
|
|
|
NewSlot = new ConstantInt(ITy, V);
|
|
|
|
}
|
|
|
|
|
|
|
|
return NewSlot;
|
|
|
|
} else {
|
|
|
|
return Slot;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant* ConstantInt::get(const Type* Ty, uint64_t V, bool isSigned) {
|
|
|
|
Constant *C = get(cast<IntegerType>(Ty->getScalarType()),
|
|
|
|
V, isSigned);
|
|
|
|
|
|
|
|
// For vectors, broadcast the value.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return Ty->getContext().getConstantVector(
|
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstantInt* ConstantInt::get(const IntegerType* Ty, uint64_t V,
|
|
|
|
bool isSigned) {
|
|
|
|
return get(Ty->getContext(), APInt(Ty->getBitWidth(), V, isSigned));
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstantInt* ConstantInt::getSigned(const IntegerType* Ty, int64_t V) {
|
|
|
|
return get(Ty, V, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantInt::getSigned(const Type *Ty, int64_t V) {
|
|
|
|
return get(Ty, V, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant* ConstantInt::get(const Type* Ty, const APInt& V) {
|
|
|
|
ConstantInt *C = get(Ty->getContext(), V);
|
|
|
|
assert(C->getType() == Ty->getScalarType() &&
|
|
|
|
"ConstantInt type doesn't match the type implied by its value!");
|
|
|
|
|
|
|
|
// For vectors, broadcast the value.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return Ty->getContext().getConstantVector(
|
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
2007-02-20 06:39:57 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-02-20 07:17:17 +00:00
|
|
|
// ConstantFP
|
2007-02-20 06:39:57 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-07-17 18:33:52 +00:00
|
|
|
#ifndef NDEBUG
|
2009-07-15 17:40:42 +00:00
|
|
|
static const fltSemantics *TypeToFloatSemantics(const Type *Ty) {
|
|
|
|
if (Ty == Type::FloatTy)
|
|
|
|
return &APFloat::IEEEsingle;
|
|
|
|
if (Ty == Type::DoubleTy)
|
|
|
|
return &APFloat::IEEEdouble;
|
|
|
|
if (Ty == Type::X86_FP80Ty)
|
|
|
|
return &APFloat::x87DoubleExtended;
|
|
|
|
else if (Ty == Type::FP128Ty)
|
|
|
|
return &APFloat::IEEEquad;
|
|
|
|
|
|
|
|
assert(Ty == Type::PPC_FP128Ty && "Unknown FP format");
|
|
|
|
return &APFloat::PPCDoubleDouble;
|
|
|
|
}
|
2009-07-17 18:33:52 +00:00
|
|
|
#endif
|
2009-07-15 17:40:42 +00:00
|
|
|
|
2007-08-30 00:23:21 +00:00
|
|
|
ConstantFP::ConstantFP(const Type *Ty, const APFloat& V)
|
|
|
|
: Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
|
2008-04-09 06:38:30 +00:00
|
|
|
assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
|
|
|
|
"FP type Mismatch");
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-02-20 07:17:17 +00:00
|
|
|
bool ConstantFP::isNullValue() const {
|
2007-08-24 00:56:33 +00:00
|
|
|
return Val.isZero() && !Val.isNegative();
|
2007-02-20 07:17:17 +00:00
|
|
|
}
|
|
|
|
|
2007-08-30 00:23:21 +00:00
|
|
|
bool ConstantFP::isExactlyValue(const APFloat& V) const {
|
|
|
|
return Val.bitwiseIsEqual(V);
|
2007-02-20 07:17:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ConstantXXX Classes
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
|
2001-12-03 22:26:30 +00:00
|
|
|
ConstantArray::ConstantArray(const ArrayType *T,
|
2005-01-29 00:34:39 +00:00
|
|
|
const std::vector<Constant*> &V)
|
2008-05-10 08:32:32 +00:00
|
|
|
: Constant(T, ConstantArrayVal,
|
|
|
|
OperandTraits<ConstantArray>::op_end(this) - V.size(),
|
|
|
|
V.size()) {
|
2004-09-15 02:32:15 +00:00
|
|
|
assert(V.size() == T->getNumElements() &&
|
|
|
|
"Invalid initializer vector for constant array");
|
2005-01-29 00:34:39 +00:00
|
|
|
Use *OL = OperandList;
|
2005-10-03 21:56:24 +00:00
|
|
|
for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
|
|
|
|
I != E; ++I, ++OL) {
|
2005-10-07 05:23:36 +00:00
|
|
|
Constant *C = *I;
|
|
|
|
assert((C->getType() == T->getElementType() ||
|
2004-09-10 04:16:59 +00:00
|
|
|
(T->isAbstract() &&
|
2005-10-07 05:23:36 +00:00
|
|
|
C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
|
2004-09-10 04:16:59 +00:00
|
|
|
"Initializer for array element doesn't match array element type!");
|
2008-05-26 21:33:52 +00:00
|
|
|
*OL = C;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-29 00:34:39 +00:00
|
|
|
|
2001-12-03 22:26:30 +00:00
|
|
|
ConstantStruct::ConstantStruct(const StructType *T,
|
2005-01-29 00:34:39 +00:00
|
|
|
const std::vector<Constant*> &V)
|
2008-05-10 08:32:32 +00:00
|
|
|
: Constant(T, ConstantStructVal,
|
|
|
|
OperandTraits<ConstantStruct>::op_end(this) - V.size(),
|
|
|
|
V.size()) {
|
2004-02-09 04:37:31 +00:00
|
|
|
assert(V.size() == T->getNumElements() &&
|
2002-07-14 23:13:17 +00:00
|
|
|
"Invalid initializer vector for constant structure");
|
2005-01-29 00:34:39 +00:00
|
|
|
Use *OL = OperandList;
|
2005-10-03 21:56:24 +00:00
|
|
|
for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
|
|
|
|
I != E; ++I, ++OL) {
|
2005-10-07 05:23:36 +00:00
|
|
|
Constant *C = *I;
|
|
|
|
assert((C->getType() == T->getElementType(I-V.begin()) ||
|
2005-10-03 21:56:24 +00:00
|
|
|
((T->getElementType(I-V.begin())->isAbstract() ||
|
2005-10-07 05:23:36 +00:00
|
|
|
C->getType()->isAbstract()) &&
|
2005-10-03 21:56:24 +00:00
|
|
|
T->getElementType(I-V.begin())->getTypeID() ==
|
2005-10-07 05:23:36 +00:00
|
|
|
C->getType()->getTypeID())) &&
|
2003-06-02 17:42:47 +00:00
|
|
|
"Initializer for struct element doesn't match struct element type!");
|
2008-05-26 21:33:52 +00:00
|
|
|
*OL = C;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-29 00:34:39 +00:00
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
ConstantVector::ConstantVector(const VectorType *T,
|
2005-01-29 00:34:39 +00:00
|
|
|
const std::vector<Constant*> &V)
|
2008-05-10 08:32:32 +00:00
|
|
|
: Constant(T, ConstantVectorVal,
|
|
|
|
OperandTraits<ConstantVector>::op_end(this) - V.size(),
|
|
|
|
V.size()) {
|
2005-01-29 00:34:39 +00:00
|
|
|
Use *OL = OperandList;
|
2005-10-03 21:56:24 +00:00
|
|
|
for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
|
|
|
|
I != E; ++I, ++OL) {
|
2005-10-07 05:23:36 +00:00
|
|
|
Constant *C = *I;
|
|
|
|
assert((C->getType() == T->getElementType() ||
|
2004-09-10 04:16:59 +00:00
|
|
|
(T->isAbstract() &&
|
2005-10-07 05:23:36 +00:00
|
|
|
C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
|
2007-05-24 14:36:04 +00:00
|
|
|
"Initializer for vector element doesn't match vector element type!");
|
2008-05-26 21:33:52 +00:00
|
|
|
*OL = C;
|
2004-08-20 06:00:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-03-12 05:54:04 +00:00
|
|
|
|
2008-05-10 08:32:32 +00:00
|
|
|
namespace llvm {
|
2007-12-10 02:14:30 +00:00
|
|
|
// We declare several classes private to this file, so use an anonymous
|
|
|
|
// namespace
|
|
|
|
namespace {
|
2007-12-09 22:46:10 +00:00
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
/// UnaryConstantExpr - This class is private to Constants.cpp, and is used
|
|
|
|
/// behind the scenes to implement unary constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly one operand
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 1);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
|
2008-05-10 08:32:32 +00:00
|
|
|
: ConstantExpr(Ty, Opcode, &Op<0>(), 1) {
|
|
|
|
Op<0>() = C;
|
|
|
|
}
|
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// BinaryConstantExpr - This class is private to Constants.cpp, and is used
|
|
|
|
/// behind the scenes to implement binary constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly two operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 2);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
|
2008-05-10 08:32:32 +00:00
|
|
|
: ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = C1;
|
|
|
|
Op<1>() = C2;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// SelectConstantExpr - This class is private to Constants.cpp, and is used
|
|
|
|
/// behind the scenes to implement select constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly three operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 3);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
|
2008-05-10 08:32:32 +00:00
|
|
|
: ConstantExpr(C2->getType(), Instruction::Select, &Op<0>(), 3) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = C1;
|
|
|
|
Op<1>() = C2;
|
|
|
|
Op<2>() = C3;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// ExtractElementConstantExpr - This class is private to
|
|
|
|
/// Constants.cpp, and is used behind the scenes to implement
|
|
|
|
/// extractelement constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly two operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 2);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
ExtractElementConstantExpr(Constant *C1, Constant *C2)
|
|
|
|
: ConstantExpr(cast<VectorType>(C1->getType())->getElementType(),
|
2008-05-10 08:32:32 +00:00
|
|
|
Instruction::ExtractElement, &Op<0>(), 2) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = C1;
|
|
|
|
Op<1>() = C2;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// InsertElementConstantExpr - This class is private to
|
|
|
|
/// Constants.cpp, and is used behind the scenes to implement
|
|
|
|
/// insertelement constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly three operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 3);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
|
|
|
|
: ConstantExpr(C1->getType(), Instruction::InsertElement,
|
2008-05-10 08:32:32 +00:00
|
|
|
&Op<0>(), 3) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = C1;
|
|
|
|
Op<1>() = C2;
|
|
|
|
Op<2>() = C3;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// ShuffleVectorConstantExpr - This class is private to
|
|
|
|
/// Constants.cpp, and is used behind the scenes to implement
|
|
|
|
/// shufflevector constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2007-12-10 02:14:30 +00:00
|
|
|
public:
|
2008-04-06 20:25:17 +00:00
|
|
|
// allocate space for exactly three operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 3);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
|
2009-02-12 21:28:33 +00:00
|
|
|
: ConstantExpr(VectorType::get(
|
|
|
|
cast<VectorType>(C1->getType())->getElementType(),
|
|
|
|
cast<VectorType>(C3->getType())->getNumElements()),
|
|
|
|
Instruction::ShuffleVector,
|
2008-05-10 08:32:32 +00:00
|
|
|
&Op<0>(), 3) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = C1;
|
|
|
|
Op<1>() = C2;
|
|
|
|
Op<2>() = C3;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
2008-05-15 19:50:34 +00:00
|
|
|
/// ExtractValueConstantExpr - This class is private to
|
|
|
|
/// Constants.cpp, and is used behind the scenes to implement
|
|
|
|
/// extractvalue constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN ExtractValueConstantExpr : public ConstantExpr {
|
2008-05-31 00:58:22 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2008-05-15 19:50:34 +00:00
|
|
|
public:
|
2008-05-31 00:58:22 +00:00
|
|
|
// allocate space for exactly one operand
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 1);
|
2008-05-15 19:50:34 +00:00
|
|
|
}
|
2008-05-31 00:58:22 +00:00
|
|
|
ExtractValueConstantExpr(Constant *Agg,
|
|
|
|
const SmallVector<unsigned, 4> &IdxList,
|
|
|
|
const Type *DestTy)
|
|
|
|
: ConstantExpr(DestTy, Instruction::ExtractValue, &Op<0>(), 1),
|
|
|
|
Indices(IdxList) {
|
|
|
|
Op<0>() = Agg;
|
|
|
|
}
|
|
|
|
|
2008-05-31 19:09:08 +00:00
|
|
|
/// Indices - These identify which value to extract.
|
2008-05-31 00:58:22 +00:00
|
|
|
const SmallVector<unsigned, 4> Indices;
|
|
|
|
|
2008-05-15 19:50:34 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
|
|
|
};
|
|
|
|
|
|
|
|
/// InsertValueConstantExpr - This class is private to
|
|
|
|
/// Constants.cpp, and is used behind the scenes to implement
|
|
|
|
/// insertvalue constant exprs.
|
|
|
|
class VISIBILITY_HIDDEN InsertValueConstantExpr : public ConstantExpr {
|
2008-05-31 00:58:22 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
2008-05-15 19:50:34 +00:00
|
|
|
public:
|
2008-05-31 00:58:22 +00:00
|
|
|
// allocate space for exactly one operand
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 2);
|
|
|
|
}
|
|
|
|
InsertValueConstantExpr(Constant *Agg, Constant *Val,
|
|
|
|
const SmallVector<unsigned, 4> &IdxList,
|
|
|
|
const Type *DestTy)
|
|
|
|
: ConstantExpr(DestTy, Instruction::InsertValue, &Op<0>(), 2),
|
|
|
|
Indices(IdxList) {
|
|
|
|
Op<0>() = Agg;
|
|
|
|
Op<1>() = Val;
|
2008-05-15 19:50:34 +00:00
|
|
|
}
|
2008-05-31 00:58:22 +00:00
|
|
|
|
2008-05-31 19:09:08 +00:00
|
|
|
/// Indices - These identify the position for the insertion.
|
2008-05-31 00:58:22 +00:00
|
|
|
const SmallVector<unsigned, 4> Indices;
|
|
|
|
|
2008-05-15 19:50:34 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
/// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
|
|
|
|
/// used behind the scenes to implement getelementpr constant exprs.
|
2008-04-06 20:25:17 +00:00
|
|
|
class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
|
2007-12-10 02:14:30 +00:00
|
|
|
GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
|
2008-05-10 08:32:32 +00:00
|
|
|
const Type *DestTy);
|
2008-04-06 20:25:17 +00:00
|
|
|
public:
|
2008-05-15 10:04:30 +00:00
|
|
|
static GetElementPtrConstantExpr *Create(Constant *C,
|
|
|
|
const std::vector<Constant*>&IdxList,
|
2008-05-10 08:32:32 +00:00
|
|
|
const Type *DestTy) {
|
2009-07-20 17:43:30 +00:00
|
|
|
return
|
|
|
|
new(IdxList.size() + 1) GetElementPtrConstantExpr(C, IdxList, DestTy);
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// CompareConstantExpr - This class is private to Constants.cpp, and is used
|
|
|
|
// behind the scenes to implement ICmp and FCmp constant expressions. This is
|
|
|
|
// needed in order to store the predicate value for these instructions.
|
|
|
|
struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
|
2008-04-06 20:25:17 +00:00
|
|
|
void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
|
|
|
|
// allocate space for exactly two operands
|
|
|
|
void *operator new(size_t s) {
|
|
|
|
return User::operator new(s, 2);
|
|
|
|
}
|
2007-12-10 02:14:30 +00:00
|
|
|
unsigned short predicate;
|
2008-05-12 19:01:56 +00:00
|
|
|
CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
|
|
|
|
unsigned short pred, Constant* LHS, Constant* RHS)
|
|
|
|
: ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
|
2008-05-26 21:33:52 +00:00
|
|
|
Op<0>() = LHS;
|
|
|
|
Op<1>() = RHS;
|
2007-12-10 02:14:30 +00:00
|
|
|
}
|
2008-05-10 08:32:32 +00:00
|
|
|
/// Transparently provide more efficient getOperand methods.
|
|
|
|
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
|
2007-12-10 02:14:30 +00:00
|
|
|
};
|
2007-12-09 22:46:10 +00:00
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
} // end anonymous namespace
|
2007-12-09 22:46:10 +00:00
|
|
|
|
2008-05-10 08:32:32 +00:00
|
|
|
template <>
|
|
|
|
struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
|
|
|
|
|
2008-05-15 19:50:34 +00:00
|
|
|
template <>
|
2008-05-31 00:58:22 +00:00
|
|
|
struct OperandTraits<ExtractValueConstantExpr> : FixedNumOperandTraits<1> {
|
2008-05-15 19:50:34 +00:00
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractValueConstantExpr, Value)
|
|
|
|
|
|
|
|
template <>
|
2008-05-31 00:58:22 +00:00
|
|
|
struct OperandTraits<InsertValueConstantExpr> : FixedNumOperandTraits<2> {
|
2008-05-15 19:50:34 +00:00
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueConstantExpr, Value)
|
|
|
|
|
2008-05-10 08:32:32 +00:00
|
|
|
template <>
|
|
|
|
struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
|
|
|
|
};
|
|
|
|
|
|
|
|
GetElementPtrConstantExpr::GetElementPtrConstantExpr
|
|
|
|
(Constant *C,
|
|
|
|
const std::vector<Constant*> &IdxList,
|
|
|
|
const Type *DestTy)
|
|
|
|
: ConstantExpr(DestTy, Instruction::GetElementPtr,
|
|
|
|
OperandTraits<GetElementPtrConstantExpr>::op_end(this)
|
|
|
|
- (IdxList.size()+1),
|
|
|
|
IdxList.size()+1) {
|
2008-05-26 21:33:52 +00:00
|
|
|
OperandList[0] = C;
|
2008-05-10 08:32:32 +00:00
|
|
|
for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
|
2008-05-26 21:33:52 +00:00
|
|
|
OperandList[i+1] = IdxList[i];
|
2008-05-10 08:32:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
|
|
|
|
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
|
|
|
|
};
|
|
|
|
DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
|
|
|
|
|
|
|
|
|
|
|
|
} // End llvm namespace
|
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
|
|
|
|
// Utility function for determining if a ConstantExpr is a CastOp or not. This
|
|
|
|
// can't be inline because we don't want to #include Instruction.h into
|
|
|
|
// Constant.h
|
|
|
|
bool ConstantExpr::isCast() const {
|
|
|
|
return Instruction::isCast(getOpcode());
|
|
|
|
}
|
|
|
|
|
2006-12-04 05:19:50 +00:00
|
|
|
bool ConstantExpr::isCompare() const {
|
2009-07-08 03:04:38 +00:00
|
|
|
return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
2008-05-31 00:58:22 +00:00
|
|
|
bool ConstantExpr::hasIndices() const {
|
|
|
|
return getOpcode() == Instruction::ExtractValue ||
|
|
|
|
getOpcode() == Instruction::InsertValue;
|
|
|
|
}
|
|
|
|
|
|
|
|
const SmallVector<unsigned, 4> &ConstantExpr::getIndices() const {
|
|
|
|
if (const ExtractValueConstantExpr *EVCE =
|
|
|
|
dyn_cast<ExtractValueConstantExpr>(this))
|
|
|
|
return EVCE->Indices;
|
2008-06-23 16:39:44 +00:00
|
|
|
|
|
|
|
return cast<InsertValueConstantExpr>(this)->Indices;
|
2008-05-31 00:58:22 +00:00
|
|
|
}
|
|
|
|
|
2006-12-03 05:48:19 +00:00
|
|
|
unsigned ConstantExpr::getPredicate() const {
|
2008-05-12 19:01:56 +00:00
|
|
|
assert(getOpcode() == Instruction::FCmp ||
|
2009-07-08 03:04:38 +00:00
|
|
|
getOpcode() == Instruction::ICmp);
|
2007-10-18 16:26:24 +00:00
|
|
|
return ((const CompareConstantExpr*)this)->predicate;
|
2006-12-03 05:48:19 +00:00
|
|
|
}
|
2001-10-03 06:12:09 +00:00
|
|
|
|
2006-07-14 19:37:40 +00:00
|
|
|
/// getWithOperandReplaced - Return a constant expression identical to this
|
|
|
|
/// one, but with the specified operand set to the specified value.
|
2006-11-27 01:05:10 +00:00
|
|
|
Constant *
|
|
|
|
ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
|
2006-07-14 19:37:40 +00:00
|
|
|
assert(OpNo < getNumOperands() && "Operand num is out of range!");
|
|
|
|
assert(Op->getType() == getOperand(OpNo)->getType() &&
|
|
|
|
"Replacing operand with value of different type!");
|
2006-07-14 22:20:01 +00:00
|
|
|
if (getOperand(OpNo) == Op)
|
|
|
|
return const_cast<ConstantExpr*>(this);
|
2006-07-14 19:37:40 +00:00
|
|
|
|
2006-07-14 22:20:01 +00:00
|
|
|
Constant *Op0, *Op1, *Op2;
|
2006-07-14 19:37:40 +00:00
|
|
|
switch (getOpcode()) {
|
2006-11-27 01:05:10 +00:00
|
|
|
case Instruction::Trunc:
|
|
|
|
case Instruction::ZExt:
|
|
|
|
case Instruction::SExt:
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
case Instruction::FPExt:
|
|
|
|
case Instruction::UIToFP:
|
|
|
|
case Instruction::SIToFP:
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
case Instruction::BitCast:
|
|
|
|
return ConstantExpr::getCast(getOpcode(), Op, getType());
|
2006-07-14 22:20:01 +00:00
|
|
|
case Instruction::Select:
|
|
|
|
Op0 = (OpNo == 0) ? Op : getOperand(0);
|
|
|
|
Op1 = (OpNo == 1) ? Op : getOperand(1);
|
|
|
|
Op2 = (OpNo == 2) ? Op : getOperand(2);
|
|
|
|
return ConstantExpr::getSelect(Op0, Op1, Op2);
|
|
|
|
case Instruction::InsertElement:
|
|
|
|
Op0 = (OpNo == 0) ? Op : getOperand(0);
|
|
|
|
Op1 = (OpNo == 1) ? Op : getOperand(1);
|
|
|
|
Op2 = (OpNo == 2) ? Op : getOperand(2);
|
|
|
|
return ConstantExpr::getInsertElement(Op0, Op1, Op2);
|
|
|
|
case Instruction::ExtractElement:
|
|
|
|
Op0 = (OpNo == 0) ? Op : getOperand(0);
|
|
|
|
Op1 = (OpNo == 1) ? Op : getOperand(1);
|
|
|
|
return ConstantExpr::getExtractElement(Op0, Op1);
|
|
|
|
case Instruction::ShuffleVector:
|
|
|
|
Op0 = (OpNo == 0) ? Op : getOperand(0);
|
|
|
|
Op1 = (OpNo == 1) ? Op : getOperand(1);
|
|
|
|
Op2 = (OpNo == 2) ? Op : getOperand(2);
|
|
|
|
return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
|
2006-07-14 19:37:40 +00:00
|
|
|
case Instruction::GetElementPtr: {
|
2007-02-19 20:01:23 +00:00
|
|
|
SmallVector<Constant*, 8> Ops;
|
2008-05-15 19:50:34 +00:00
|
|
|
Ops.resize(getNumOperands()-1);
|
2006-07-14 19:37:40 +00:00
|
|
|
for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
|
2008-05-15 19:50:34 +00:00
|
|
|
Ops[i-1] = getOperand(i);
|
2006-07-14 19:37:40 +00:00
|
|
|
if (OpNo == 0)
|
2007-02-19 20:01:23 +00:00
|
|
|
return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
|
2006-07-14 19:37:40 +00:00
|
|
|
Ops[OpNo-1] = Op;
|
2007-02-19 20:01:23 +00:00
|
|
|
return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
|
2006-07-14 19:37:40 +00:00
|
|
|
}
|
2006-07-14 22:20:01 +00:00
|
|
|
default:
|
|
|
|
assert(getNumOperands() == 2 && "Must be binary operator?");
|
|
|
|
Op0 = (OpNo == 0) ? Op : getOperand(0);
|
|
|
|
Op1 = (OpNo == 1) ? Op : getOperand(1);
|
|
|
|
return ConstantExpr::get(getOpcode(), Op0, Op1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getWithOperands - This returns the current constant expression with the
|
|
|
|
/// operands replaced with the specified values. The specified operands must
|
|
|
|
/// match count and type with the existing ones.
|
|
|
|
Constant *ConstantExpr::
|
2008-08-20 22:27:40 +00:00
|
|
|
getWithOperands(Constant* const *Ops, unsigned NumOps) const {
|
|
|
|
assert(NumOps == getNumOperands() && "Operand count mismatch!");
|
2006-07-14 22:20:01 +00:00
|
|
|
bool AnyChange = false;
|
2008-08-20 22:27:40 +00:00
|
|
|
for (unsigned i = 0; i != NumOps; ++i) {
|
2006-07-14 22:20:01 +00:00
|
|
|
assert(Ops[i]->getType() == getOperand(i)->getType() &&
|
|
|
|
"Operand type mismatch!");
|
|
|
|
AnyChange |= Ops[i] != getOperand(i);
|
|
|
|
}
|
|
|
|
if (!AnyChange) // No operands changed, return self.
|
|
|
|
return const_cast<ConstantExpr*>(this);
|
|
|
|
|
|
|
|
switch (getOpcode()) {
|
2006-11-27 01:05:10 +00:00
|
|
|
case Instruction::Trunc:
|
|
|
|
case Instruction::ZExt:
|
|
|
|
case Instruction::SExt:
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
case Instruction::FPExt:
|
|
|
|
case Instruction::UIToFP:
|
|
|
|
case Instruction::SIToFP:
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
case Instruction::BitCast:
|
|
|
|
return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
|
2006-07-14 19:37:40 +00:00
|
|
|
case Instruction::Select:
|
2006-07-14 22:20:01 +00:00
|
|
|
return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
|
2006-07-14 19:37:40 +00:00
|
|
|
case Instruction::InsertElement:
|
2006-07-14 22:20:01 +00:00
|
|
|
return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
|
2006-07-14 19:37:40 +00:00
|
|
|
case Instruction::ExtractElement:
|
2006-07-14 22:20:01 +00:00
|
|
|
return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
|
2006-07-14 19:37:40 +00:00
|
|
|
case Instruction::ShuffleVector:
|
2006-07-14 22:20:01 +00:00
|
|
|
return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
|
2007-02-19 20:01:23 +00:00
|
|
|
case Instruction::GetElementPtr:
|
2008-08-20 22:27:40 +00:00
|
|
|
return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], NumOps-1);
|
2006-12-23 06:05:41 +00:00
|
|
|
case Instruction::ICmp:
|
|
|
|
case Instruction::FCmp:
|
|
|
|
return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
|
2006-07-14 19:37:40 +00:00
|
|
|
default:
|
|
|
|
assert(getNumOperands() == 2 && "Must be binary operator?");
|
2006-07-14 22:20:01 +00:00
|
|
|
return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
|
2006-07-14 19:37:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// isValueValidForType implementations
|
|
|
|
|
2006-12-19 01:28:19 +00:00
|
|
|
bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
|
|
|
|
if (Ty == Type::Int1Ty)
|
|
|
|
return Val == 0 || Val == 1;
|
2007-02-05 23:47:56 +00:00
|
|
|
if (NumBits >= 64)
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
return true; // always true, has to fit in largest type
|
|
|
|
uint64_t Max = (1ll << NumBits) - 1;
|
|
|
|
return Val <= Max;
|
2006-12-19 01:28:19 +00:00
|
|
|
}
|
|
|
|
|
2006-10-20 07:07:24 +00:00
|
|
|
bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
|
|
|
|
if (Ty == Type::Int1Ty)
|
2007-01-19 21:13:56 +00:00
|
|
|
return Val == 0 || Val == 1 || Val == -1;
|
2007-02-05 23:47:56 +00:00
|
|
|
if (NumBits >= 64)
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
return true; // always true, has to fit in largest type
|
|
|
|
int64_t Min = -(1ll << (NumBits-1));
|
|
|
|
int64_t Max = (1ll << (NumBits-1)) - 1;
|
|
|
|
return (Val >= Min && Val <= Max);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-08-30 00:23:21 +00:00
|
|
|
bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
|
|
|
|
// convert modifies in place, so make a copy.
|
|
|
|
APFloat Val2 = APFloat(Val);
|
2008-10-09 23:00:39 +00:00
|
|
|
bool losesInfo;
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
2001-06-06 20:29:01 +00:00
|
|
|
default:
|
|
|
|
return false; // These can't be represented as floating point!
|
|
|
|
|
2007-08-30 00:23:21 +00:00
|
|
|
// FIXME rounding mode needs to be more flexible
|
2008-10-09 23:00:39 +00:00
|
|
|
case Type::FloatTyID: {
|
|
|
|
if (&Val2.getSemantics() == &APFloat::IEEEsingle)
|
|
|
|
return true;
|
|
|
|
Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
|
|
|
|
return !losesInfo;
|
|
|
|
}
|
|
|
|
case Type::DoubleTyID: {
|
|
|
|
if (&Val2.getSemantics() == &APFloat::IEEEsingle ||
|
|
|
|
&Val2.getSemantics() == &APFloat::IEEEdouble)
|
|
|
|
return true;
|
|
|
|
Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
|
|
|
|
return !losesInfo;
|
|
|
|
}
|
2007-08-09 22:51:36 +00:00
|
|
|
case Type::X86_FP80TyID:
|
2007-09-12 03:30:33 +00:00
|
|
|
return &Val2.getSemantics() == &APFloat::IEEEsingle ||
|
|
|
|
&Val2.getSemantics() == &APFloat::IEEEdouble ||
|
|
|
|
&Val2.getSemantics() == &APFloat::x87DoubleExtended;
|
2007-08-09 22:51:36 +00:00
|
|
|
case Type::FP128TyID:
|
2007-09-12 03:30:33 +00:00
|
|
|
return &Val2.getSemantics() == &APFloat::IEEEsingle ||
|
|
|
|
&Val2.getSemantics() == &APFloat::IEEEdouble ||
|
|
|
|
&Val2.getSemantics() == &APFloat::IEEEquad;
|
2007-10-11 18:07:22 +00:00
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
return &Val2.getSemantics() == &APFloat::IEEEsingle ||
|
|
|
|
&Val2.getSemantics() == &APFloat::IEEEdouble ||
|
|
|
|
&Val2.getSemantics() == &APFloat::PPCDoubleDouble;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2006-05-24 17:04:05 +00:00
|
|
|
}
|
2001-07-20 19:16:02 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2001-09-07 16:46:31 +00:00
|
|
|
// Factory Function Implementation
|
|
|
|
|
2009-03-03 02:55:14 +00:00
|
|
|
/// destroyConstant - Remove the constant from the constant table...
|
|
|
|
///
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantAggregateZero::destroyConstant() {
|
2009-06-17 20:10:08 +00:00
|
|
|
// Implicitly locked.
|
2009-07-21 20:13:12 +00:00
|
|
|
getType()->getContext().erase(this);
|
2004-02-15 05:53:04 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2009-03-03 02:55:14 +00:00
|
|
|
/// destroyConstant - Remove the constant from the constant table...
|
|
|
|
///
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantArray::destroyConstant() {
|
2009-06-19 18:34:09 +00:00
|
|
|
// Implicitly locked.
|
2009-07-21 20:55:28 +00:00
|
|
|
getType()->getContext().erase(this);
|
2003-05-23 20:03:32 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2007-01-26 07:37:34 +00:00
|
|
|
/// isString - This method returns true if the array is an array of i8, and
|
|
|
|
/// if the elements of the array are all ConstantInt's.
|
2004-01-14 17:06:38 +00:00
|
|
|
bool ConstantArray::isString() const {
|
2007-01-26 07:37:34 +00:00
|
|
|
// Check the element type for i8...
|
2006-12-31 05:26:44 +00:00
|
|
|
if (getType()->getElementType() != Type::Int8Ty)
|
2004-01-14 17:06:38 +00:00
|
|
|
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<ConstantInt>(getOperand(i)))
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2006-10-26 19:15:05 +00:00
|
|
|
/// isCString - This method returns true if the array is a string (see
|
2009-03-03 02:55:14 +00:00
|
|
|
/// isString) and it ends in a null byte \\0 and does not contains any other
|
2006-10-26 19:15:05 +00:00
|
|
|
/// null bytes except its terminator.
|
2009-07-13 21:27:19 +00:00
|
|
|
bool ConstantArray::isCString() const {
|
2007-01-26 07:37:34 +00:00
|
|
|
// Check the element type for i8...
|
2006-12-31 05:26:44 +00:00
|
|
|
if (getType()->getElementType() != Type::Int8Ty)
|
2006-10-26 21:48:03 +00:00
|
|
|
return false;
|
2009-07-13 21:27:19 +00:00
|
|
|
|
2006-10-26 21:48:03 +00:00
|
|
|
// Last element must be a null.
|
2009-07-13 21:27:19 +00:00
|
|
|
if (!getOperand(getNumOperands()-1)->isNullValue())
|
2006-10-26 21:48:03 +00:00
|
|
|
return false;
|
|
|
|
// Other elements must be non-null integers.
|
|
|
|
for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
|
|
|
|
if (!isa<ConstantInt>(getOperand(i)))
|
2006-10-26 19:15:05 +00:00
|
|
|
return false;
|
2009-07-13 21:27:19 +00:00
|
|
|
if (getOperand(i)->isNullValue())
|
2006-10-26 21:48:03 +00:00
|
|
|
return false;
|
|
|
|
}
|
2006-10-26 19:15:05 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-03-03 02:55:14 +00:00
|
|
|
/// getAsString - If the sub-element type of this array is i8
|
|
|
|
/// then this method converts the array to an std::string and returns it.
|
|
|
|
/// Otherwise, it asserts out.
|
|
|
|
///
|
2002-08-26 17:53:56 +00:00
|
|
|
std::string ConstantArray::getAsString() const {
|
2004-01-14 17:06:38 +00:00
|
|
|
assert(isString() && "Not a string!");
|
2002-08-26 17:53:56 +00:00
|
|
|
std::string Result;
|
2008-06-24 21:58:29 +00:00
|
|
|
Result.reserve(getNumOperands());
|
2003-07-23 15:22:26 +00:00
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
2008-06-25 01:05:05 +00:00
|
|
|
Result.push_back((char)cast<ConstantInt>(getOperand(i))->getZExtValue());
|
2002-08-26 17:53:56 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-12-03 22:26:30 +00:00
|
|
|
//---- ConstantStruct::get() implementation...
|
2001-09-07 16:46:31 +00:00
|
|
|
//
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
namespace llvm {
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2001-09-07 16:46:31 +00:00
|
|
|
}
|
2001-10-03 15:39:36 +00:00
|
|
|
|
2001-10-13 06:57:33 +00:00
|
|
|
// destroyConstant - Remove the constant from the constant table...
|
|
|
|
//
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantStruct::destroyConstant() {
|
2009-06-19 18:34:09 +00:00
|
|
|
// Implicitly locked.
|
2009-07-23 23:25:33 +00:00
|
|
|
getType()->getContext().erase(this);
|
2001-10-13 06:57:33 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2004-08-20 06:00:58 +00:00
|
|
|
// destroyConstant - Remove the constant from the constant table...
|
|
|
|
//
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantVector::destroyConstant() {
|
2009-06-19 18:34:09 +00:00
|
|
|
// Implicitly locked.
|
2009-07-24 00:36:24 +00:00
|
|
|
getType()->getContext().erase(this);
|
2004-08-20 06:00:58 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2007-05-24 14:36:04 +00:00
|
|
|
/// This function will return true iff every element in this vector constant
|
2007-01-12 22:39:14 +00:00
|
|
|
/// is set to all ones.
|
|
|
|
/// @returns true iff this constant's emements are all set to all ones.
|
|
|
|
/// @brief Determine if the value is all ones.
|
2007-02-15 02:26:10 +00:00
|
|
|
bool ConstantVector::isAllOnesValue() const {
|
2007-01-12 22:39:14 +00:00
|
|
|
// Check out first element.
|
|
|
|
const Constant *Elt = getOperand(0);
|
|
|
|
const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
|
|
|
|
if (!CI || !CI->isAllOnesValue()) return false;
|
|
|
|
// Then make sure all remaining elements point to the same value.
|
|
|
|
for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
|
|
|
|
if (getOperand(I) != Elt) return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2007-10-17 17:51:30 +00:00
|
|
|
/// getSplatValue - If this is a splat constant, where all of the
|
|
|
|
/// elements have the same value, return that value. Otherwise return null.
|
|
|
|
Constant *ConstantVector::getSplatValue() {
|
|
|
|
// Check out first element.
|
|
|
|
Constant *Elt = getOperand(0);
|
|
|
|
// Then make sure all remaining elements point to the same value.
|
|
|
|
for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
|
|
|
|
if (getOperand(I) != Elt) return 0;
|
|
|
|
return Elt;
|
|
|
|
}
|
|
|
|
|
2001-12-03 22:26:30 +00:00
|
|
|
//---- ConstantPointerNull::get() implementation...
|
2001-10-03 15:39:36 +00:00
|
|
|
//
|
2003-05-23 20:03:32 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
namespace llvm {
|
|
|
|
// ConstantPointerNull does not take extra "value" argument...
|
|
|
|
template<class ValType>
|
|
|
|
struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
|
|
|
|
static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
|
|
|
|
return new ConstantPointerNull(Ty);
|
|
|
|
}
|
|
|
|
};
|
2003-05-23 20:03:32 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
template<>
|
|
|
|
struct ConvertConstantType<ConstantPointerNull, PointerType> {
|
|
|
|
static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
|
|
|
|
// Make everyone now use a constant of the new type...
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *New = ConstantPointerNull::get(NewTy);
|
2003-11-21 20:23:48 +00:00
|
|
|
assert(New != OldC && "Didn't replace constant??");
|
|
|
|
OldC->uncheckedReplaceAllUsesWith(New);
|
2009-06-20 00:24:58 +00:00
|
|
|
OldC->destroyConstant(); // This constant is now dead, destroy it.
|
2003-11-21 20:23:48 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2006-09-28 00:35:06 +00:00
|
|
|
static ManagedStatic<ValueMap<char, PointerType,
|
|
|
|
ConstantPointerNull> > NullPtrConstants;
|
2001-10-03 15:39:36 +00:00
|
|
|
|
2004-08-04 04:48:01 +00:00
|
|
|
static char getValType(ConstantPointerNull *) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
|
2009-06-17 20:10:08 +00:00
|
|
|
// Implicitly locked.
|
2009-06-20 00:24:58 +00:00
|
|
|
return NullPtrConstants->getOrCreate(Ty, 0);
|
2001-10-03 15:39:36 +00:00
|
|
|
}
|
|
|
|
|
2002-08-18 00:40:04 +00:00
|
|
|
// destroyConstant - Remove the constant from the constant table...
|
|
|
|
//
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantPointerNull::destroyConstant() {
|
2009-06-19 18:34:09 +00:00
|
|
|
// Implicitly locked.
|
2009-06-20 00:24:58 +00:00
|
|
|
NullPtrConstants->remove(this);
|
2002-08-18 00:40:04 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-10-16 18:07:16 +00:00
|
|
|
//---- UndefValue::get() implementation...
|
|
|
|
//
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
// UndefValue does not take extra "value" argument...
|
|
|
|
template<class ValType>
|
|
|
|
struct ConstantCreator<UndefValue, Type, ValType> {
|
|
|
|
static UndefValue *create(const Type *Ty, const ValType &V) {
|
|
|
|
return new UndefValue(Ty);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<>
|
|
|
|
struct ConvertConstantType<UndefValue, Type> {
|
|
|
|
static void convert(UndefValue *OldC, const Type *NewTy) {
|
|
|
|
// Make everyone now use a constant of the new type.
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *New = UndefValue::get(NewTy);
|
2004-10-16 18:07:16 +00:00
|
|
|
assert(New != OldC && "Didn't replace constant??");
|
|
|
|
OldC->uncheckedReplaceAllUsesWith(New);
|
2009-06-20 00:24:58 +00:00
|
|
|
OldC->destroyConstant(); // This constant is now dead, destroy it.
|
2004-10-16 18:07:16 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2006-09-28 00:35:06 +00:00
|
|
|
static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
|
2004-10-16 18:07:16 +00:00
|
|
|
|
|
|
|
static char getValType(UndefValue *) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
UndefValue *UndefValue::get(const Type *Ty) {
|
|
|
|
// Implicitly locked.
|
|
|
|
return UndefValueConstants->getOrCreate(Ty, 0);
|
2004-10-16 18:07:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// destroyConstant - Remove the constant from the constant table.
|
|
|
|
//
|
2009-06-20 00:24:58 +00:00
|
|
|
void UndefValue::destroyConstant() {
|
2009-06-17 20:10:08 +00:00
|
|
|
// Implicitly locked.
|
2009-06-20 00:24:58 +00:00
|
|
|
UndefValueConstants->remove(this);
|
2004-10-16 18:07:16 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2009-04-04 07:22:01 +00:00
|
|
|
//---- MDNode::get() implementation
|
|
|
|
//
|
|
|
|
|
2009-05-10 20:57:05 +00:00
|
|
|
MDNode::MDNode(Value*const* Vals, unsigned NumVals)
|
2009-07-23 01:07:34 +00:00
|
|
|
: MetadataBase(Type::MetadataTy, Value::MDNodeVal) {
|
2009-05-10 20:57:05 +00:00
|
|
|
for (unsigned i = 0; i != NumVals; ++i)
|
2009-07-23 01:07:34 +00:00
|
|
|
Node.push_back(WeakVH(Vals[i]));
|
2009-04-04 07:22:01 +00:00
|
|
|
}
|
|
|
|
|
2009-05-10 20:57:05 +00:00
|
|
|
void MDNode::Profile(FoldingSetNodeID &ID) const {
|
|
|
|
for (const_elem_iterator I = elem_begin(), E = elem_end(); I != E; ++I)
|
2009-04-04 07:22:01 +00:00
|
|
|
ID.AddPointer(*I);
|
|
|
|
}
|
|
|
|
|
2002-07-14 23:13:17 +00:00
|
|
|
//---- ConstantExpr::get() implementations...
|
|
|
|
//
|
2006-12-31 05:26:44 +00:00
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
namespace {
|
|
|
|
|
2006-12-04 05:19:50 +00:00
|
|
|
struct ExprMapKeyType {
|
2008-05-31 00:58:22 +00:00
|
|
|
typedef SmallVector<unsigned, 4> IndexList;
|
|
|
|
|
|
|
|
ExprMapKeyType(unsigned opc,
|
|
|
|
const std::vector<Constant*> &ops,
|
|
|
|
unsigned short pred = 0,
|
|
|
|
const IndexList &inds = IndexList())
|
|
|
|
: opcode(opc), predicate(pred), operands(ops), indices(inds) {}
|
2006-12-04 18:38:05 +00:00
|
|
|
uint16_t opcode;
|
|
|
|
uint16_t predicate;
|
2006-12-04 05:19:50 +00:00
|
|
|
std::vector<Constant*> operands;
|
2008-05-31 00:58:22 +00:00
|
|
|
IndexList indices;
|
2006-12-04 05:19:50 +00:00
|
|
|
bool operator==(const ExprMapKeyType& that) const {
|
|
|
|
return this->opcode == that.opcode &&
|
|
|
|
this->predicate == that.predicate &&
|
2008-10-26 00:19:56 +00:00
|
|
|
this->operands == that.operands &&
|
2008-05-31 00:58:22 +00:00
|
|
|
this->indices == that.indices;
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
bool operator<(const ExprMapKeyType & that) const {
|
|
|
|
return this->opcode < that.opcode ||
|
|
|
|
(this->opcode == that.opcode && this->predicate < that.predicate) ||
|
|
|
|
(this->opcode == that.opcode && this->predicate == that.predicate &&
|
2008-05-31 00:58:22 +00:00
|
|
|
this->operands < that.operands) ||
|
|
|
|
(this->opcode == that.opcode && this->predicate == that.predicate &&
|
|
|
|
this->operands == that.operands && this->indices < that.indices);
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const ExprMapKeyType& that) const {
|
|
|
|
return !(*this == that);
|
|
|
|
}
|
|
|
|
};
|
2003-05-23 20:03:32 +00:00
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
}
|
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
namespace llvm {
|
|
|
|
template<>
|
|
|
|
struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
|
2006-12-03 05:48:19 +00:00
|
|
|
static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
|
|
|
|
unsigned short pred = 0) {
|
2006-12-04 05:19:50 +00:00
|
|
|
if (Instruction::isCast(V.opcode))
|
|
|
|
return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
|
|
|
|
if ((V.opcode >= Instruction::BinaryOpsBegin &&
|
2007-02-02 02:16:23 +00:00
|
|
|
V.opcode < Instruction::BinaryOpsEnd))
|
2006-12-04 05:19:50 +00:00
|
|
|
return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
|
|
|
|
if (V.opcode == Instruction::Select)
|
|
|
|
return new SelectConstantExpr(V.operands[0], V.operands[1],
|
|
|
|
V.operands[2]);
|
|
|
|
if (V.opcode == Instruction::ExtractElement)
|
|
|
|
return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
|
|
|
|
if (V.opcode == Instruction::InsertElement)
|
|
|
|
return new InsertElementConstantExpr(V.operands[0], V.operands[1],
|
|
|
|
V.operands[2]);
|
|
|
|
if (V.opcode == Instruction::ShuffleVector)
|
|
|
|
return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
|
|
|
|
V.operands[2]);
|
2008-05-31 00:58:22 +00:00
|
|
|
if (V.opcode == Instruction::InsertValue)
|
|
|
|
return new InsertValueConstantExpr(V.operands[0], V.operands[1],
|
|
|
|
V.indices, Ty);
|
|
|
|
if (V.opcode == Instruction::ExtractValue)
|
|
|
|
return new ExtractValueConstantExpr(V.operands[0], V.indices, Ty);
|
2006-12-04 05:19:50 +00:00
|
|
|
if (V.opcode == Instruction::GetElementPtr) {
|
|
|
|
std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
|
2008-04-06 20:25:17 +00:00
|
|
|
return GetElementPtrConstantExpr::Create(V.operands[0], IdxList, Ty);
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// The compare instructions are weird. We have to encode the predicate
|
|
|
|
// value and it is combined with the instruction opcode by multiplying
|
|
|
|
// the opcode by one hundred. We must decode this to get the predicate.
|
|
|
|
if (V.opcode == Instruction::ICmp)
|
2008-05-12 19:01:56 +00:00
|
|
|
return new CompareConstantExpr(Ty, Instruction::ICmp, V.predicate,
|
2006-12-04 05:19:50 +00:00
|
|
|
V.operands[0], V.operands[1]);
|
|
|
|
if (V.opcode == Instruction::FCmp)
|
2008-05-12 19:01:56 +00:00
|
|
|
return new CompareConstantExpr(Ty, Instruction::FCmp, V.predicate,
|
|
|
|
V.operands[0], V.operands[1]);
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Invalid ConstantExpr!");
|
2006-12-15 21:47:01 +00:00
|
|
|
return 0;
|
2003-11-21 20:23:48 +00:00
|
|
|
}
|
|
|
|
};
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
template<>
|
|
|
|
struct ConvertConstantType<ConstantExpr, Type> {
|
|
|
|
static void convert(ConstantExpr *OldC, const Type *NewTy) {
|
|
|
|
Constant *New;
|
|
|
|
switch (OldC->getOpcode()) {
|
2006-11-27 01:05:10 +00:00
|
|
|
case Instruction::Trunc:
|
|
|
|
case Instruction::ZExt:
|
|
|
|
case Instruction::SExt:
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
case Instruction::FPExt:
|
|
|
|
case Instruction::UIToFP:
|
|
|
|
case Instruction::SIToFP:
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
case Instruction::BitCast:
|
2006-12-12 23:36:14 +00:00
|
|
|
New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
|
2009-06-20 00:24:58 +00:00
|
|
|
NewTy);
|
2003-11-21 20:23:48 +00:00
|
|
|
break;
|
2004-03-12 05:54:04 +00:00
|
|
|
case Instruction::Select:
|
|
|
|
New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
|
|
|
|
OldC->getOperand(1),
|
2009-06-20 00:24:58 +00:00
|
|
|
OldC->getOperand(2));
|
2004-03-12 05:54:04 +00:00
|
|
|
break;
|
2003-11-21 20:23:48 +00:00
|
|
|
default:
|
|
|
|
assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
|
2006-11-02 01:53:59 +00:00
|
|
|
OldC->getOpcode() < Instruction::BinaryOpsEnd);
|
2003-11-21 20:23:48 +00:00
|
|
|
New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
|
2009-06-20 00:24:58 +00:00
|
|
|
OldC->getOperand(1));
|
2003-11-21 20:23:48 +00:00
|
|
|
break;
|
|
|
|
case Instruction::GetElementPtr:
|
2005-04-21 23:48:37 +00:00
|
|
|
// Make everyone now use a constant of the new type...
|
2004-10-11 22:52:25 +00:00
|
|
|
std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
|
2007-01-31 04:40:28 +00:00
|
|
|
New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
|
2009-06-20 00:24:58 +00:00
|
|
|
&Idx[0], Idx.size());
|
2003-11-21 20:23:48 +00:00
|
|
|
break;
|
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-11-21 20:23:48 +00:00
|
|
|
assert(New != OldC && "Didn't replace constant??");
|
|
|
|
OldC->uncheckedReplaceAllUsesWith(New);
|
2009-06-20 00:24:58 +00:00
|
|
|
OldC->destroyConstant(); // This constant is now dead, destroy it.
|
2003-10-05 00:17:43 +00:00
|
|
|
}
|
2003-11-21 20:23:48 +00:00
|
|
|
};
|
|
|
|
} // end namespace llvm
|
2003-05-23 20:03:32 +00:00
|
|
|
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2004-08-04 04:48:01 +00:00
|
|
|
static ExprMapKeyType getValType(ConstantExpr *CE) {
|
|
|
|
std::vector<Constant*> Operands;
|
|
|
|
Operands.reserve(CE->getNumOperands());
|
|
|
|
for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
|
|
|
|
Operands.push_back(cast<Constant>(CE->getOperand(i)));
|
2006-12-04 05:19:50 +00:00
|
|
|
return ExprMapKeyType(CE->getOpcode(), Operands,
|
2008-05-31 00:58:22 +00:00
|
|
|
CE->isCompare() ? CE->getPredicate() : 0,
|
|
|
|
CE->hasIndices() ?
|
|
|
|
CE->getIndices() : SmallVector<unsigned, 4>());
|
2004-08-04 04:48:01 +00:00
|
|
|
}
|
|
|
|
|
2006-09-28 00:35:06 +00:00
|
|
|
static ManagedStatic<ValueMap<ExprMapKeyType, Type,
|
|
|
|
ConstantExpr> > ExprConstants;
|
2002-07-15 18:19:33 +00:00
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
/// This is a utility function to handle folding of casts and lookup of the
|
2008-03-30 19:38:55 +00:00
|
|
|
/// cast in the ExprConstants map. It is used by the various get* methods below.
|
2006-11-27 01:05:10 +00:00
|
|
|
static inline Constant *getFoldedCast(
|
2009-06-20 00:24:58 +00:00
|
|
|
Instruction::CastOps opc, Constant *C, const Type *Ty) {
|
2003-10-07 22:19:19 +00:00
|
|
|
assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
|
2006-11-27 01:05:10 +00:00
|
|
|
// Fold a few common cases
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC =
|
|
|
|
ConstantFoldCastInstruction(getGlobalContext(), opc, C, Ty))
|
2006-11-27 01:05:10 +00:00
|
|
|
return FC;
|
2003-04-17 19:24:48 +00:00
|
|
|
|
2002-07-15 18:19:33 +00:00
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
2003-05-13 21:37:02 +00:00
|
|
|
std::vector<Constant*> argVec(1, C);
|
2006-12-04 05:19:50 +00:00
|
|
|
ExprMapKeyType Key(opc, argVec);
|
2009-06-17 18:40:29 +00:00
|
|
|
|
2009-06-17 20:10:08 +00:00
|
|
|
// Implicitly locked.
|
2009-06-20 00:24:58 +00:00
|
|
|
return ExprConstants->getOrCreate(Ty, Key);
|
2002-07-14 23:13:17 +00:00
|
|
|
}
|
2006-12-05 19:14:13 +00:00
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
|
2006-11-27 01:05:10 +00:00
|
|
|
Instruction::CastOps opc = Instruction::CastOps(oc);
|
|
|
|
assert(Instruction::isCast(opc) && "opcode out of range");
|
|
|
|
assert(C && Ty && "Null arguments to getCast");
|
|
|
|
assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
|
|
|
|
|
|
|
|
switch (opc) {
|
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Invalid cast opcode");
|
2006-11-27 01:05:10 +00:00
|
|
|
break;
|
2009-06-20 00:24:58 +00:00
|
|
|
case Instruction::Trunc: return getTrunc(C, Ty);
|
|
|
|
case Instruction::ZExt: return getZExt(C, Ty);
|
|
|
|
case Instruction::SExt: return getSExt(C, Ty);
|
|
|
|
case Instruction::FPTrunc: return getFPTrunc(C, Ty);
|
|
|
|
case Instruction::FPExt: return getFPExtend(C, Ty);
|
|
|
|
case Instruction::UIToFP: return getUIToFP(C, Ty);
|
|
|
|
case Instruction::SIToFP: return getSIToFP(C, Ty);
|
|
|
|
case Instruction::FPToUI: return getFPToUI(C, Ty);
|
|
|
|
case Instruction::FPToSI: return getFPToSI(C, Ty);
|
|
|
|
case Instruction::PtrToInt: return getPtrToInt(C, Ty);
|
|
|
|
case Instruction::IntToPtr: return getIntToPtr(C, Ty);
|
|
|
|
case Instruction::BitCast: return getBitCast(C, Ty);
|
2005-01-01 15:59:57 +00:00
|
|
|
}
|
2006-11-27 01:05:10 +00:00
|
|
|
return 0;
|
2006-12-05 19:14:13 +00:00
|
|
|
}
|
|
|
|
|
2006-12-04 20:17:56 +00:00
|
|
|
Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
|
2006-12-04 20:17:56 +00:00
|
|
|
return getCast(Instruction::BitCast, C, Ty);
|
|
|
|
return getCast(Instruction::ZExt, C, Ty);
|
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
|
2009-06-20 00:24:58 +00:00
|
|
|
return getCast(Instruction::BitCast, C, Ty);
|
|
|
|
return getCast(Instruction::SExt, C, Ty);
|
2006-12-04 20:17:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
|
2006-12-04 20:17:56 +00:00
|
|
|
return getCast(Instruction::BitCast, C, Ty);
|
|
|
|
return getCast(Instruction::Trunc, C, Ty);
|
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
|
2006-12-05 03:25:26 +00:00
|
|
|
assert(isa<PointerType>(S->getType()) && "Invalid cast");
|
2007-01-15 02:27:26 +00:00
|
|
|
assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
|
2006-12-05 03:25:26 +00:00
|
|
|
|
2007-01-15 02:27:26 +00:00
|
|
|
if (Ty->isInteger())
|
2009-06-20 00:24:58 +00:00
|
|
|
return getCast(Instruction::PtrToInt, S, Ty);
|
|
|
|
return getCast(Instruction::BitCast, S, Ty);
|
2006-12-05 03:25:26 +00:00
|
|
|
}
|
|
|
|
|
2006-12-12 00:51:07 +00:00
|
|
|
Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
|
|
|
|
bool isSigned) {
|
2009-06-15 22:12:54 +00:00
|
|
|
assert(C->getType()->isIntOrIntVector() &&
|
|
|
|
Ty->isIntOrIntVector() && "Invalid cast");
|
|
|
|
unsigned SrcBits = C->getType()->getScalarSizeInBits();
|
|
|
|
unsigned DstBits = Ty->getScalarSizeInBits();
|
2006-12-12 00:51:07 +00:00
|
|
|
Instruction::CastOps opcode =
|
|
|
|
(SrcBits == DstBits ? Instruction::BitCast :
|
|
|
|
(SrcBits > DstBits ? Instruction::Trunc :
|
|
|
|
(isSigned ? Instruction::SExt : Instruction::ZExt)));
|
|
|
|
return getCast(opcode, C, Ty);
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
|
2006-12-12 00:51:07 +00:00
|
|
|
"Invalid cast");
|
2009-06-15 22:12:54 +00:00
|
|
|
unsigned SrcBits = C->getType()->getScalarSizeInBits();
|
|
|
|
unsigned DstBits = Ty->getScalarSizeInBits();
|
2006-12-12 05:38:50 +00:00
|
|
|
if (SrcBits == DstBits)
|
|
|
|
return C; // Avoid a useless cast
|
2006-12-12 00:51:07 +00:00
|
|
|
Instruction::CastOps opcode =
|
2006-12-12 05:38:50 +00:00
|
|
|
(SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
|
2006-12-12 00:51:07 +00:00
|
|
|
return getCast(opcode, C, Ty);
|
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
|
|
|
#endif
|
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isIntOrIntVector() && "Trunc operand must be integer");
|
|
|
|
assert(Ty->isIntOrIntVector() && "Trunc produces only integral");
|
|
|
|
assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
|
2006-11-27 01:05:10 +00:00
|
|
|
"SrcTy must be larger than DestTy for Trunc!");
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::Trunc, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
|
|
|
#endif
|
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isIntOrIntVector() && "SExt operand must be integral");
|
|
|
|
assert(Ty->isIntOrIntVector() && "SExt produces only integer");
|
|
|
|
assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
|
2006-11-27 01:05:10 +00:00
|
|
|
"SrcTy must be smaller than DestTy for SExt!");
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::SExt, C, Ty);
|
2004-04-04 23:20:30 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
|
|
|
#endif
|
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isIntOrIntVector() && "ZEXt operand must be integral");
|
|
|
|
assert(Ty->isIntOrIntVector() && "ZExt produces only integer");
|
|
|
|
assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
|
2006-11-27 01:05:10 +00:00
|
|
|
"SrcTy must be smaller than DestTy for ZExt!");
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::ZExt, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
|
|
|
#endif
|
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
|
|
|
|
C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
|
2006-11-27 01:05:10 +00:00
|
|
|
"This is an illegal floating point truncation!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::FPTrunc, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
|
2009-06-15 22:12:54 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
|
|
|
#endif
|
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
|
|
|
|
C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
|
2006-11-27 01:05:10 +00:00
|
|
|
"This is an illegal floating point extension!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::FPExt, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2007-11-17 03:58:34 +00:00
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2007-11-17 03:58:34 +00:00
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
|
|
|
|
"This is an illegal uint to floating point cast!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::UIToFP, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2007-11-17 03:58:34 +00:00
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2007-11-17 03:58:34 +00:00
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
|
2006-11-27 01:05:10 +00:00
|
|
|
"This is an illegal sint to floating point cast!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::SIToFP, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2007-11-17 03:58:34 +00:00
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2007-11-17 03:58:34 +00:00
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
|
|
|
|
"This is an illegal floating point to uint cast!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::FPToUI, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2007-11-17 03:58:34 +00:00
|
|
|
bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
|
|
|
|
bool toVec = Ty->getTypeID() == Type::VectorTyID;
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2007-11-17 03:58:34 +00:00
|
|
|
assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
|
|
|
|
assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
|
|
|
|
"This is an illegal floating point to sint cast!");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::FPToSI, C, Ty);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
|
2006-11-27 01:05:10 +00:00
|
|
|
assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
|
2007-01-15 02:27:26 +00:00
|
|
|
assert(DstTy->isInteger() && "PtrToInt destination must be integral");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::PtrToInt, C, DstTy);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
|
2007-01-15 02:27:26 +00:00
|
|
|
assert(C->getType()->isInteger() && "IntToPtr source must be integral");
|
2006-11-27 01:05:10 +00:00
|
|
|
assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::IntToPtr, C, DstTy);
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
|
2006-11-27 01:05:10 +00:00
|
|
|
// BitCast implies a no-op cast of type only. No bits change. However, you
|
|
|
|
// can't cast pointers to anything but pointers.
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2006-11-27 01:05:10 +00:00
|
|
|
const Type *SrcTy = C->getType();
|
|
|
|
assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
|
2006-12-04 20:17:56 +00:00
|
|
|
"BitCast cannot cast pointer to non-pointer and vice versa");
|
2006-11-27 01:05:10 +00:00
|
|
|
|
|
|
|
// Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
|
|
|
|
// or nonptr->ptr). For all the other types, the cast is okay if source and
|
|
|
|
// destination bit widths are identical.
|
|
|
|
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2009-03-08 04:06:26 +00:00
|
|
|
assert(SrcBitSize == DstBitSize && "BitCast requires types of same width");
|
2009-03-21 06:55:54 +00:00
|
|
|
|
|
|
|
// It is common to ask for a bitcast of a value to its own type, handle this
|
|
|
|
// speedily.
|
|
|
|
if (C->getType() == DstTy) return C;
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
return getFoldedCast(Instruction::BitCast, C, DstTy);
|
2004-04-04 23:20:30 +00:00
|
|
|
}
|
|
|
|
|
2003-10-05 00:17:43 +00:00
|
|
|
Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *C1, Constant *C2) {
|
2003-05-21 17:49:25 +00:00
|
|
|
// Check the operands for consistency first
|
2006-11-02 01:53:59 +00:00
|
|
|
assert(Opcode >= Instruction::BinaryOpsBegin &&
|
|
|
|
Opcode < Instruction::BinaryOpsEnd &&
|
2003-05-21 17:49:25 +00:00
|
|
|
"Invalid opcode in binary constant expression");
|
|
|
|
assert(C1->getType() == C2->getType() &&
|
|
|
|
"Operand types in binary constant expression should match");
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2007-01-11 18:21:29 +00:00
|
|
|
if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldBinaryInstruction(
|
|
|
|
getGlobalContext(), Opcode, C1, C2))
|
2003-10-05 00:17:43 +00:00
|
|
|
return FC; // Fold a few common cases...
|
2003-04-17 19:24:48 +00:00
|
|
|
|
2003-05-13 21:37:02 +00:00
|
|
|
std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
|
2006-12-04 21:35:24 +00:00
|
|
|
ExprMapKeyType Key(Opcode, argVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2003-05-21 17:49:25 +00:00
|
|
|
}
|
|
|
|
|
2006-12-23 06:05:41 +00:00
|
|
|
Constant *ConstantExpr::getCompareTy(unsigned short predicate,
|
2008-07-25 17:56:27 +00:00
|
|
|
Constant *C1, Constant *C2) {
|
2006-12-23 06:05:41 +00:00
|
|
|
switch (predicate) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid CmpInst predicate");
|
2008-07-25 17:35:37 +00:00
|
|
|
case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
|
|
|
|
case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
|
|
|
|
case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
|
|
|
|
case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
|
|
|
|
case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
|
|
|
|
case CmpInst::FCMP_TRUE:
|
2009-07-08 03:04:38 +00:00
|
|
|
return getFCmp(predicate, C1, C2);
|
|
|
|
|
2008-07-25 17:35:37 +00:00
|
|
|
case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
|
|
|
|
case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
|
|
|
|
case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
|
|
|
|
case CmpInst::ICMP_SLE:
|
2009-07-08 03:04:38 +00:00
|
|
|
return getICmp(predicate, C1, C2);
|
2006-12-23 06:05:41 +00:00
|
|
|
}
|
2006-12-04 21:35:24 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
|
2009-06-04 22:49:04 +00:00
|
|
|
// API compatibility: Adjust integer opcodes to floating-point opcodes.
|
|
|
|
if (C1->getType()->isFPOrFPVector()) {
|
|
|
|
if (Opcode == Instruction::Add) Opcode = Instruction::FAdd;
|
|
|
|
else if (Opcode == Instruction::Sub) Opcode = Instruction::FSub;
|
|
|
|
else if (Opcode == Instruction::Mul) Opcode = Instruction::FMul;
|
|
|
|
}
|
2004-08-17 17:28:46 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
switch (Opcode) {
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::Add:
|
2006-11-02 01:53:59 +00:00
|
|
|
case Instruction::Sub:
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::Mul:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
|
|
|
assert(C1->getType()->isIntOrIntVector() &&
|
|
|
|
"Tried to create an integer operation on a non-integer type!");
|
|
|
|
break;
|
|
|
|
case Instruction::FAdd:
|
|
|
|
case Instruction::FSub:
|
|
|
|
case Instruction::FMul:
|
2004-08-17 17:28:46 +00:00
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-04 22:49:04 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVector() &&
|
|
|
|
"Tried to create a floating-point operation on a "
|
|
|
|
"non-floating-point type!");
|
2004-08-17 17:28:46 +00:00
|
|
|
break;
|
2006-10-26 06:15:43 +00:00
|
|
|
case Instruction::UDiv:
|
|
|
|
case Instruction::SDiv:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-15 22:25:12 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVector() &&
|
2006-10-26 06:15:43 +00:00
|
|
|
"Tried to create an arithmetic operation on a non-arithmetic type!");
|
|
|
|
break;
|
|
|
|
case Instruction::FDiv:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-15 22:25:12 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVector() &&
|
|
|
|
"Tried to create an arithmetic operation on a non-arithmetic type!");
|
2006-10-26 06:15:43 +00:00
|
|
|
break;
|
2006-11-02 01:53:59 +00:00
|
|
|
case Instruction::URem:
|
|
|
|
case Instruction::SRem:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-15 22:25:12 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVector() &&
|
2006-11-02 01:53:59 +00:00
|
|
|
"Tried to create an arithmetic operation on a non-arithmetic type!");
|
|
|
|
break;
|
|
|
|
case Instruction::FRem:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-15 22:25:12 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVector() &&
|
|
|
|
"Tried to create an arithmetic operation on a non-arithmetic type!");
|
2006-11-02 01:53:59 +00:00
|
|
|
break;
|
2004-08-17 17:28:46 +00:00
|
|
|
case Instruction::And:
|
|
|
|
case Instruction::Or:
|
|
|
|
case Instruction::Xor:
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-06-15 22:25:12 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVector() &&
|
2005-01-27 06:46:38 +00:00
|
|
|
"Tried to create a logical operation on a non-integral type!");
|
2004-08-17 17:28:46 +00:00
|
|
|
break;
|
|
|
|
case Instruction::Shl:
|
2006-11-08 06:47:33 +00:00
|
|
|
case Instruction::LShr:
|
|
|
|
case Instruction::AShr:
|
2007-02-02 02:16:23 +00:00
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2009-03-14 17:09:17 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVector() &&
|
2004-08-17 17:28:46 +00:00
|
|
|
"Tried to create a shift operation on a non-integer type!");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
return getTy(C1->getType(), Opcode, C1, C2);
|
2006-12-04 21:35:24 +00:00
|
|
|
}
|
|
|
|
|
2006-12-23 06:05:41 +00:00
|
|
|
Constant *ConstantExpr::getCompare(unsigned short pred,
|
2006-12-04 21:35:24 +00:00
|
|
|
Constant *C1, Constant *C2) {
|
|
|
|
assert(C1->getType() == C2->getType() && "Op types should be identical!");
|
2006-12-23 06:05:41 +00:00
|
|
|
return getCompareTy(pred, C1, C2);
|
2004-08-04 18:50:09 +00:00
|
|
|
}
|
|
|
|
|
2004-03-12 05:54:04 +00:00
|
|
|
Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *V1, Constant *V2) {
|
2008-12-29 00:16:12 +00:00
|
|
|
assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
|
2004-03-12 05:54:04 +00:00
|
|
|
|
|
|
|
if (ReqTy == V1->getType())
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *SC = ConstantFoldSelectInstruction(
|
|
|
|
getGlobalContext(), C, V1, V2))
|
2004-03-12 05:54:04 +00:00
|
|
|
return SC; // Fold common cases
|
|
|
|
|
|
|
|
std::vector<Constant*> argVec(3, C);
|
|
|
|
argVec[1] = V1;
|
|
|
|
argVec[2] = V2;
|
2006-12-04 05:19:50 +00:00
|
|
|
ExprMapKeyType Key(Instruction::Select, argVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2004-03-12 05:54:04 +00:00
|
|
|
}
|
|
|
|
|
2003-10-05 00:17:43 +00:00
|
|
|
Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
|
2007-01-31 04:40:28 +00:00
|
|
|
Value* const *Idxs,
|
2009-06-20 00:24:58 +00:00
|
|
|
unsigned NumIdx) {
|
2008-05-15 19:50:34 +00:00
|
|
|
assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs,
|
|
|
|
Idxs+NumIdx) ==
|
|
|
|
cast<PointerType>(ReqTy)->getElementType() &&
|
|
|
|
"GEP indices invalid!");
|
2004-02-16 20:46:13 +00:00
|
|
|
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldGetElementPtr(
|
|
|
|
getGlobalContext(), C, (Constant**)Idxs, NumIdx))
|
2003-04-17 19:24:48 +00:00
|
|
|
return FC; // Fold a few common cases...
|
2004-02-16 20:46:13 +00:00
|
|
|
|
2003-10-05 00:17:43 +00:00
|
|
|
assert(isa<PointerType>(C->getType()) &&
|
2003-05-23 20:03:32 +00:00
|
|
|
"Non-pointer type for constant GetElementPtr expression");
|
2002-07-15 18:19:33 +00:00
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
2004-10-11 22:52:25 +00:00
|
|
|
std::vector<Constant*> ArgVec;
|
2007-01-31 04:40:28 +00:00
|
|
|
ArgVec.reserve(NumIdx+1);
|
2004-10-11 22:52:25 +00:00
|
|
|
ArgVec.push_back(C);
|
2007-01-31 04:40:28 +00:00
|
|
|
for (unsigned i = 0; i != NumIdx; ++i)
|
|
|
|
ArgVec.push_back(cast<Constant>(Idxs[i]));
|
|
|
|
const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
2009-06-20 00:24:58 +00:00
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2003-10-05 00:17:43 +00:00
|
|
|
}
|
|
|
|
|
2007-01-31 04:40:28 +00:00
|
|
|
Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
|
2009-06-20 00:24:58 +00:00
|
|
|
unsigned NumIdx) {
|
2003-10-05 00:17:43 +00:00
|
|
|
// Get the result type of the getelementptr!
|
2007-01-31 04:40:28 +00:00
|
|
|
const Type *Ty =
|
2008-05-15 19:50:34 +00:00
|
|
|
GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
|
2003-10-05 00:17:43 +00:00
|
|
|
assert(Ty && "GEP indices invalid!");
|
2007-12-11 08:59:05 +00:00
|
|
|
unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
|
2009-06-20 00:24:58 +00:00
|
|
|
return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
|
2004-10-11 22:52:25 +00:00
|
|
|
}
|
|
|
|
|
2007-01-31 04:40:28 +00:00
|
|
|
Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
|
2009-06-20 00:24:58 +00:00
|
|
|
unsigned NumIdx) {
|
|
|
|
return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
|
2002-07-15 18:19:33 +00:00
|
|
|
}
|
|
|
|
|
2007-01-31 04:40:28 +00:00
|
|
|
|
2006-12-04 05:19:50 +00:00
|
|
|
Constant *
|
|
|
|
ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
|
|
|
|
assert(LHS->getType() == RHS->getType());
|
|
|
|
assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
|
|
|
|
pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
|
|
|
|
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldCompareInstruction(
|
|
|
|
getGlobalContext(),pred, LHS, RHS))
|
2006-12-04 05:19:50 +00:00
|
|
|
return FC; // Fold a few common cases...
|
|
|
|
|
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec;
|
|
|
|
ArgVec.push_back(LHS);
|
|
|
|
ArgVec.push_back(RHS);
|
2006-12-24 18:42:29 +00:00
|
|
|
// Get the key type with both the opcode and predicate
|
2006-12-04 05:19:50 +00:00
|
|
|
const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(Type::Int1Ty, Key);
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *
|
|
|
|
ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
|
|
|
|
assert(LHS->getType() == RHS->getType());
|
|
|
|
assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
|
|
|
|
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldCompareInstruction(
|
|
|
|
getGlobalContext(), pred, LHS, RHS))
|
2006-12-04 05:19:50 +00:00
|
|
|
return FC; // Fold a few common cases...
|
|
|
|
|
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec;
|
|
|
|
ArgVec.push_back(LHS);
|
|
|
|
ArgVec.push_back(RHS);
|
2006-12-24 18:42:29 +00:00
|
|
|
// Get the key type with both the opcode and predicate
|
2006-12-04 05:19:50 +00:00
|
|
|
const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(Type::Int1Ty, Key);
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
2006-01-10 19:05:34 +00:00
|
|
|
Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
|
|
|
|
Constant *Idx) {
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldExtractElementInstruction(
|
|
|
|
getGlobalContext(), Val, Idx))
|
2006-01-10 20:03:46 +00:00
|
|
|
return FC; // Fold a few common cases...
|
2006-01-10 19:05:34 +00:00
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec(1, Val);
|
|
|
|
ArgVec.push_back(Idx);
|
2006-12-04 05:19:50 +00:00
|
|
|
const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2006-01-10 19:05:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
|
2007-02-15 02:26:10 +00:00
|
|
|
assert(isa<VectorType>(Val->getType()) &&
|
2007-02-15 03:39:18 +00:00
|
|
|
"Tried to create extractelement operation on non-vector type!");
|
2006-12-31 05:26:44 +00:00
|
|
|
assert(Idx->getType() == Type::Int32Ty &&
|
2007-01-26 07:37:34 +00:00
|
|
|
"Extractelement index must be i32 type!");
|
2007-02-15 02:26:10 +00:00
|
|
|
return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
|
2006-01-10 19:05:34 +00:00
|
|
|
Val, Idx);
|
|
|
|
}
|
2003-10-05 00:17:43 +00:00
|
|
|
|
2006-01-17 20:07:22 +00:00
|
|
|
Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
|
|
|
|
Constant *Elt, Constant *Idx) {
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldInsertElementInstruction(
|
|
|
|
getGlobalContext(), Val, Elt, Idx))
|
2006-01-17 20:07:22 +00:00
|
|
|
return FC; // Fold a few common cases...
|
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec(1, Val);
|
|
|
|
ArgVec.push_back(Elt);
|
|
|
|
ArgVec.push_back(Idx);
|
2006-12-04 05:19:50 +00:00
|
|
|
const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2006-01-17 20:07:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
|
|
|
|
Constant *Idx) {
|
2007-02-15 02:26:10 +00:00
|
|
|
assert(isa<VectorType>(Val->getType()) &&
|
2007-02-15 03:39:18 +00:00
|
|
|
"Tried to create insertelement operation on non-vector type!");
|
2007-02-15 02:26:10 +00:00
|
|
|
assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
|
2006-01-17 20:07:22 +00:00
|
|
|
&& "Insertelement types must match!");
|
2006-12-31 05:26:44 +00:00
|
|
|
assert(Idx->getType() == Type::Int32Ty &&
|
2007-01-26 07:37:34 +00:00
|
|
|
"Insertelement index must be i32 type!");
|
2008-08-30 15:41:51 +00:00
|
|
|
return getInsertElementTy(Val->getType(), Val, Elt, Idx);
|
2006-01-17 20:07:22 +00:00
|
|
|
}
|
|
|
|
|
2006-04-08 01:18:18 +00:00
|
|
|
Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
|
|
|
|
Constant *V2, Constant *Mask) {
|
2009-07-13 04:09:18 +00:00
|
|
|
if (Constant *FC = ConstantFoldShuffleVectorInstruction(
|
|
|
|
getGlobalContext(), V1, V2, Mask))
|
2006-04-08 01:18:18 +00:00
|
|
|
return FC; // Fold a few common cases...
|
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec(1, V1);
|
|
|
|
ArgVec.push_back(V2);
|
|
|
|
ArgVec.push_back(Mask);
|
2006-12-04 05:19:50 +00:00
|
|
|
const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
|
|
|
// Implicitly locked.
|
|
|
|
return ExprConstants->getOrCreate(ReqTy, Key);
|
2006-04-08 01:18:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
|
|
|
|
Constant *Mask) {
|
|
|
|
assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
|
|
|
|
"Invalid shuffle vector constant expr operands!");
|
2009-02-12 21:28:33 +00:00
|
|
|
|
|
|
|
unsigned NElts = cast<VectorType>(Mask->getType())->getNumElements();
|
|
|
|
const Type *EltTy = cast<VectorType>(V1->getType())->getElementType();
|
|
|
|
const Type *ShufTy = VectorType::get(EltTy, NElts);
|
|
|
|
return getShuffleVectorTy(ShufTy, V1, V2, Mask);
|
2006-04-08 01:18:18 +00:00
|
|
|
}
|
|
|
|
|
2008-05-15 19:50:34 +00:00
|
|
|
Constant *ConstantExpr::getInsertValueTy(const Type *ReqTy, Constant *Agg,
|
|
|
|
Constant *Val,
|
2008-05-31 00:58:22 +00:00
|
|
|
const unsigned *Idxs, unsigned NumIdx) {
|
2008-05-15 19:50:34 +00:00
|
|
|
assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
|
|
|
|
Idxs+NumIdx) == Val->getType() &&
|
|
|
|
"insertvalue indices invalid!");
|
|
|
|
assert(Agg->getType() == ReqTy &&
|
|
|
|
"insertvalue type invalid!");
|
2008-05-23 00:36:11 +00:00
|
|
|
assert(Agg->getType()->isFirstClassType() &&
|
|
|
|
"Non-first-class type for constant InsertValue expression");
|
2009-07-13 04:09:18 +00:00
|
|
|
Constant *FC = ConstantFoldInsertValueInstruction(
|
|
|
|
getGlobalContext(), Agg, Val, Idxs, NumIdx);
|
2008-07-21 23:30:30 +00:00
|
|
|
assert(FC && "InsertValue constant expr couldn't be folded!");
|
|
|
|
return FC;
|
2008-05-15 19:50:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
|
2008-05-31 00:58:22 +00:00
|
|
|
const unsigned *IdxList, unsigned NumIdx) {
|
2008-05-23 00:36:11 +00:00
|
|
|
assert(Agg->getType()->isFirstClassType() &&
|
|
|
|
"Tried to create insertelement operation on non-first-class type!");
|
2008-05-15 19:50:34 +00:00
|
|
|
|
2008-05-23 00:36:11 +00:00
|
|
|
const Type *ReqTy = Agg->getType();
|
2008-11-03 23:20:04 +00:00
|
|
|
#ifndef NDEBUG
|
2008-05-23 00:36:11 +00:00
|
|
|
const Type *ValTy =
|
2008-05-15 19:50:34 +00:00
|
|
|
ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
|
2008-11-03 23:20:04 +00:00
|
|
|
#endif
|
2008-05-23 00:36:11 +00:00
|
|
|
assert(ValTy == Val->getType() && "insertvalue indices invalid!");
|
2008-05-15 19:50:34 +00:00
|
|
|
return getInsertValueTy(ReqTy, Agg, Val, IdxList, NumIdx);
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getExtractValueTy(const Type *ReqTy, Constant *Agg,
|
2008-05-31 00:58:22 +00:00
|
|
|
const unsigned *Idxs, unsigned NumIdx) {
|
2008-05-15 19:50:34 +00:00
|
|
|
assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
|
|
|
|
Idxs+NumIdx) == ReqTy &&
|
|
|
|
"extractvalue indices invalid!");
|
2008-05-23 00:36:11 +00:00
|
|
|
assert(Agg->getType()->isFirstClassType() &&
|
|
|
|
"Non-first-class type for constant extractvalue expression");
|
2009-07-13 04:09:18 +00:00
|
|
|
Constant *FC = ConstantFoldExtractValueInstruction(
|
|
|
|
getGlobalContext(), Agg, Idxs, NumIdx);
|
2008-07-21 23:30:30 +00:00
|
|
|
assert(FC && "ExtractValue constant expr couldn't be folded!");
|
|
|
|
return FC;
|
2008-05-15 19:50:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getExtractValue(Constant *Agg,
|
2008-05-31 00:58:22 +00:00
|
|
|
const unsigned *IdxList, unsigned NumIdx) {
|
2008-05-23 00:36:11 +00:00
|
|
|
assert(Agg->getType()->isFirstClassType() &&
|
|
|
|
"Tried to create extractelement operation on non-first-class type!");
|
2008-05-15 19:50:34 +00:00
|
|
|
|
|
|
|
const Type *ReqTy =
|
|
|
|
ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
|
|
|
|
assert(ReqTy && "extractvalue indices invalid!");
|
|
|
|
return getExtractValueTy(ReqTy, Agg, IdxList, NumIdx);
|
|
|
|
}
|
|
|
|
|
2002-07-15 18:19:33 +00:00
|
|
|
// destroyConstant - Remove the constant from the constant table...
|
|
|
|
//
|
2009-06-20 00:24:58 +00:00
|
|
|
void ConstantExpr::destroyConstant() {
|
|
|
|
// Implicitly locked.
|
|
|
|
ExprConstants->remove(this);
|
2002-07-15 18:19:33 +00:00
|
|
|
destroyConstantImpl();
|
2002-07-14 23:13:17 +00:00
|
|
|
}
|
|
|
|
|
2002-07-30 18:54:25 +00:00
|
|
|
const char *ConstantExpr::getOpcodeName() const {
|
|
|
|
return Instruction::getOpcodeName(getOpcode());
|
2002-07-14 23:13:17 +00:00
|
|
|
}
|
2004-07-17 23:48:33 +00:00
|
|
|
|
2005-10-03 21:58:36 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// replaceUsesOfWithOnConstant implementations
|
|
|
|
|
2007-08-21 00:55:23 +00:00
|
|
|
/// replaceUsesOfWithOnConstant - Update this constant array to change uses of
|
|
|
|
/// 'From' to be uses of 'To'. This must update the uniquing data structures
|
|
|
|
/// etc.
|
|
|
|
///
|
|
|
|
/// Note that we intentionally replace all uses of From with To here. Consider
|
|
|
|
/// a large array that uses 'From' 1000 times. By handling this case all here,
|
|
|
|
/// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
|
|
|
|
/// single invocation handles all 1000 uses. Handling them one at a time would
|
|
|
|
/// work, but would be really slow because it would have to unique each updated
|
|
|
|
/// array instance.
|
2005-10-03 21:58:36 +00:00
|
|
|
void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
|
2005-10-04 18:13:04 +00:00
|
|
|
Use *U) {
|
2009-07-21 20:55:28 +00:00
|
|
|
Constant *Replacement =
|
|
|
|
getType()->getContext().replaceUsesOfWithOnConstant(this, From, To, U);
|
|
|
|
|
|
|
|
if (!Replacement) return;
|
2005-10-03 22:51:37 +00:00
|
|
|
|
|
|
|
// Otherwise, I do need to replace this with an existing value.
|
2005-10-03 21:58:36 +00:00
|
|
|
assert(Replacement != this && "I didn't contain From!");
|
|
|
|
|
2005-10-04 18:13:04 +00:00
|
|
|
// Everyone using this now uses the replacement.
|
|
|
|
uncheckedReplaceAllUsesWith(Replacement);
|
2005-10-03 21:58:36 +00:00
|
|
|
|
|
|
|
// Delete the old constant!
|
|
|
|
destroyConstant();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
|
2005-10-04 18:13:04 +00:00
|
|
|
Use *U) {
|
2009-07-23 23:25:33 +00:00
|
|
|
Constant* Replacement =
|
|
|
|
getType()->getContext().replaceUsesOfWithOnConstant(this, From, To, U);
|
|
|
|
if (!Replacement) return;
|
2005-10-03 21:58:36 +00:00
|
|
|
|
2005-10-04 18:13:04 +00:00
|
|
|
// Everyone using this now uses the replacement.
|
|
|
|
uncheckedReplaceAllUsesWith(Replacement);
|
2005-10-03 21:58:36 +00:00
|
|
|
|
|
|
|
// Delete the old constant!
|
|
|
|
destroyConstant();
|
|
|
|
}
|
|
|
|
|
2007-02-15 02:26:10 +00:00
|
|
|
void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
|
2005-10-04 18:13:04 +00:00
|
|
|
Use *U) {
|
2005-10-03 21:58:36 +00:00
|
|
|
assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
|
|
|
|
|
|
|
|
std::vector<Constant*> 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<Constant>(To);
|
|
|
|
Values.push_back(Val);
|
|
|
|
}
|
|
|
|
|
2009-07-24 00:36:24 +00:00
|
|
|
Constant *Replacement =
|
|
|
|
getType()->getContext().getConstantVector(getType(), Values);
|
2005-10-03 21:58:36 +00:00
|
|
|
assert(Replacement != this && "I didn't contain From!");
|
|
|
|
|
2005-10-04 18:13:04 +00:00
|
|
|
// Everyone using this now uses the replacement.
|
|
|
|
uncheckedReplaceAllUsesWith(Replacement);
|
2005-10-03 21:58:36 +00:00
|
|
|
|
|
|
|
// Delete the old constant!
|
|
|
|
destroyConstant();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
|
2005-10-04 18:13:04 +00:00
|
|
|
Use *U) {
|
2005-10-03 21:58:36 +00:00
|
|
|
assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
|
|
|
|
Constant *To = cast<Constant>(ToV);
|
|
|
|
|
|
|
|
Constant *Replacement = 0;
|
|
|
|
if (getOpcode() == Instruction::GetElementPtr) {
|
2007-02-19 20:01:23 +00:00
|
|
|
SmallVector<Constant*, 8> Indices;
|
2005-10-03 21:58:36 +00:00
|
|
|
Constant *Pointer = getOperand(0);
|
|
|
|
Indices.reserve(getNumOperands()-1);
|
|
|
|
if (Pointer == From) Pointer = To;
|
|
|
|
|
|
|
|
for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
|
|
|
|
Constant *Val = getOperand(i);
|
|
|
|
if (Val == From) Val = To;
|
|
|
|
Indices.push_back(Val);
|
|
|
|
}
|
2007-02-19 20:01:23 +00:00
|
|
|
Replacement = ConstantExpr::getGetElementPtr(Pointer,
|
|
|
|
&Indices[0], Indices.size());
|
2008-05-15 19:50:34 +00:00
|
|
|
} else if (getOpcode() == Instruction::ExtractValue) {
|
|
|
|
Constant *Agg = getOperand(0);
|
|
|
|
if (Agg == From) Agg = To;
|
|
|
|
|
2008-05-31 00:58:22 +00:00
|
|
|
const SmallVector<unsigned, 4> &Indices = getIndices();
|
2008-05-15 19:50:34 +00:00
|
|
|
Replacement = ConstantExpr::getExtractValue(Agg,
|
|
|
|
&Indices[0], Indices.size());
|
|
|
|
} else if (getOpcode() == Instruction::InsertValue) {
|
|
|
|
Constant *Agg = getOperand(0);
|
|
|
|
Constant *Val = getOperand(1);
|
|
|
|
if (Agg == From) Agg = To;
|
|
|
|
if (Val == From) Val = To;
|
|
|
|
|
2008-05-31 00:58:22 +00:00
|
|
|
const SmallVector<unsigned, 4> &Indices = getIndices();
|
2008-05-15 19:50:34 +00:00
|
|
|
Replacement = ConstantExpr::getInsertValue(Agg, Val,
|
|
|
|
&Indices[0], Indices.size());
|
2006-11-27 01:05:10 +00:00
|
|
|
} else if (isCast()) {
|
2005-10-03 21:58:36 +00:00
|
|
|
assert(getOperand(0) == From && "Cast only has one use!");
|
2006-11-27 01:05:10 +00:00
|
|
|
Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
|
2005-10-03 21:58:36 +00:00
|
|
|
} 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);
|
2006-01-10 19:05:34 +00:00
|
|
|
} else if (getOpcode() == Instruction::ExtractElement) {
|
|
|
|
Constant *C1 = getOperand(0);
|
|
|
|
Constant *C2 = getOperand(1);
|
|
|
|
if (C1 == From) C1 = To;
|
|
|
|
if (C2 == From) C2 = To;
|
|
|
|
Replacement = ConstantExpr::getExtractElement(C1, C2);
|
2006-04-08 05:09:48 +00:00
|
|
|
} else if (getOpcode() == Instruction::InsertElement) {
|
|
|
|
Constant *C1 = getOperand(0);
|
|
|
|
Constant *C2 = getOperand(1);
|
|
|
|
Constant *C3 = getOperand(1);
|
|
|
|
if (C1 == From) C1 = To;
|
|
|
|
if (C2 == From) C2 = To;
|
|
|
|
if (C3 == From) C3 = To;
|
|
|
|
Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
|
|
|
|
} else if (getOpcode() == Instruction::ShuffleVector) {
|
|
|
|
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::getShuffleVector(C1, C2, C3);
|
2006-12-04 05:19:50 +00:00
|
|
|
} else if (isCompare()) {
|
|
|
|
Constant *C1 = getOperand(0);
|
|
|
|
Constant *C2 = getOperand(1);
|
|
|
|
if (C1 == From) C1 = To;
|
|
|
|
if (C2 == From) C2 = To;
|
|
|
|
if (getOpcode() == Instruction::ICmp)
|
|
|
|
Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
|
2008-07-14 05:17:31 +00:00
|
|
|
else {
|
2009-07-08 03:04:38 +00:00
|
|
|
assert(getOpcode() == Instruction::FCmp);
|
|
|
|
Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
|
2008-07-14 05:17:31 +00:00
|
|
|
}
|
2005-10-03 21:58:36 +00:00
|
|
|
} else if (getNumOperands() == 2) {
|
|
|
|
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 {
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unknown ConstantExpr type!");
|
2005-10-03 21:58:36 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(Replacement != this && "I didn't contain From!");
|
|
|
|
|
2005-10-04 18:13:04 +00:00
|
|
|
// Everyone using this now uses the replacement.
|
|
|
|
uncheckedReplaceAllUsesWith(Replacement);
|
2005-10-03 21:58:36 +00:00
|
|
|
|
|
|
|
// Delete the old constant!
|
|
|
|
destroyConstant();
|
2008-07-03 07:46:41 +00:00
|
|
|
}
|
2009-04-04 07:22:01 +00:00
|
|
|
|
2009-05-10 20:57:05 +00:00
|
|
|
void MDNode::replaceElement(Value *From, Value *To) {
|
|
|
|
SmallVector<Value*, 4> Values;
|
|
|
|
Values.reserve(getNumElements()); // Build replacement array...
|
|
|
|
for (unsigned i = 0, e = getNumElements(); i != e; ++i) {
|
|
|
|
Value *Val = getElement(i);
|
|
|
|
if (Val == From) Val = To;
|
2009-04-04 07:22:01 +00:00
|
|
|
Values.push_back(Val);
|
|
|
|
}
|
2009-05-10 20:57:05 +00:00
|
|
|
|
2009-07-16 23:44:30 +00:00
|
|
|
MDNode *Replacement =
|
|
|
|
getType()->getContext().getMDNode(&Values[0], Values.size());
|
2009-04-04 07:22:01 +00:00
|
|
|
assert(Replacement != this && "I didn't contain From!");
|
2009-05-10 20:57:05 +00:00
|
|
|
|
2009-04-04 07:22:01 +00:00
|
|
|
uncheckedReplaceAllUsesWith(Replacement);
|
|
|
|
}
|