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
|
|
|
//
|
2011-02-07 20:03:14 +00:00
|
|
|
// This file implements the Constant* classes.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-04-28 19:55:58 +00:00
|
|
|
#include "llvm/Constants.h"
|
2009-08-23 04:02:03 +00:00
|
|
|
#include "LLVMContextImpl.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"
|
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-08-23 04:02:03 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-09-10 23:37:55 +00:00
|
|
|
#include "llvm/Support/GetElementPtrTypeIterator.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-07-31 20:28:14 +00:00
|
|
|
// Constructor to create a '0' constant of arbitrary type...
|
2009-10-30 22:33:29 +00:00
|
|
|
Constant *Constant::getNullValue(const Type *Ty) {
|
2009-07-31 20:28:14 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
case Type::IntegerTyID:
|
|
|
|
return ConstantInt::get(Ty, 0);
|
|
|
|
case Type::FloatTyID:
|
2010-12-04 14:22:24 +00:00
|
|
|
return ConstantFP::get(Ty->getContext(),
|
|
|
|
APFloat::getZero(APFloat::IEEEsingle));
|
2009-07-31 20:28:14 +00:00
|
|
|
case Type::DoubleTyID:
|
2010-12-04 14:22:24 +00:00
|
|
|
return ConstantFP::get(Ty->getContext(),
|
|
|
|
APFloat::getZero(APFloat::IEEEdouble));
|
2009-07-31 20:28:14 +00:00
|
|
|
case Type::X86_FP80TyID:
|
2010-12-04 14:22:24 +00:00
|
|
|
return ConstantFP::get(Ty->getContext(),
|
|
|
|
APFloat::getZero(APFloat::x87DoubleExtended));
|
2009-07-31 20:28:14 +00:00
|
|
|
case Type::FP128TyID:
|
|
|
|
return ConstantFP::get(Ty->getContext(),
|
2010-12-04 14:22:24 +00:00
|
|
|
APFloat::getZero(APFloat::IEEEquad));
|
2009-07-31 20:28:14 +00:00
|
|
|
case Type::PPC_FP128TyID:
|
2010-12-04 14:22:24 +00:00
|
|
|
return ConstantFP::get(Ty->getContext(),
|
2010-12-04 14:43:08 +00:00
|
|
|
APFloat(APInt::getNullValue(128)));
|
2009-07-31 20:28:14 +00:00
|
|
|
case Type::PointerTyID:
|
|
|
|
return ConstantPointerNull::get(cast<PointerType>(Ty));
|
|
|
|
case Type::StructTyID:
|
|
|
|
case Type::ArrayTyID:
|
|
|
|
case Type::VectorTyID:
|
|
|
|
return ConstantAggregateZero::get(Ty);
|
|
|
|
default:
|
|
|
|
// Function, Label, or Opaque type?
|
|
|
|
assert(!"Cannot create a null constant of that type!");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *Constant::getIntegerValue(const Type *Ty, const APInt &V) {
|
2009-08-03 22:07:33 +00:00
|
|
|
const Type *ScalarTy = Ty->getScalarType();
|
|
|
|
|
|
|
|
// Create the base integer constant.
|
|
|
|
Constant *C = ConstantInt::get(Ty->getContext(), V);
|
|
|
|
|
|
|
|
// Convert an integer to a pointer, if necessary.
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(ScalarTy))
|
|
|
|
C = ConstantExpr::getIntToPtr(C, PTy);
|
|
|
|
|
|
|
|
// Broadcast a scalar to a vector, if necessary.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
C = ConstantVector::get(std::vector<Constant *>(VTy->getNumElements(), C));
|
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *Constant::getAllOnesValue(const Type *Ty) {
|
2009-10-30 22:33:29 +00:00
|
|
|
if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty))
|
2009-07-31 20:28:14 +00:00
|
|
|
return ConstantInt::get(Ty->getContext(),
|
|
|
|
APInt::getAllOnesValue(ITy->getBitWidth()));
|
|
|
|
|
2011-02-14 18:15:46 +00:00
|
|
|
std::vector<Constant*> Elts;
|
2009-10-30 22:33:29 +00:00
|
|
|
const VectorType *VTy = cast<VectorType>(Ty);
|
2009-07-31 20:28:14 +00:00
|
|
|
Elts.resize(VTy->getNumElements(), getAllOnesValue(VTy->getElementType()));
|
|
|
|
assert(Elts[0] && "Not a vector integer type!");
|
|
|
|
return cast<ConstantVector>(ConstantVector::get(Elts));
|
|
|
|
}
|
|
|
|
|
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...
|
2009-08-23 04:02:03 +00:00
|
|
|
if (!isa<Constant>(V)) {
|
2010-01-05 01:29:19 +00:00
|
|
|
dbgs() << "While deleting: " << *this
|
2009-08-23 04:02:03 +00:00
|
|
|
<< "\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)
|
2009-10-28 05:14:34 +00:00
|
|
|
if (CE->getOperand(i)->canTrap())
|
2006-10-20 00:27:06 +00:00
|
|
|
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.
|
2009-10-28 05:14:34 +00:00
|
|
|
if (!isa<ConstantInt>(CE->getOperand(1)) ||CE->getOperand(1)->isNullValue())
|
2006-10-20 00:27:06 +00:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-01 18:11:50 +00:00
|
|
|
/// isConstantUsed - Return true if the constant has users other than constant
|
|
|
|
/// exprs and other dangling things.
|
|
|
|
bool Constant::isConstantUsed() const {
|
2010-03-25 23:06:16 +00:00
|
|
|
for (const_use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
|
2009-11-01 18:11:50 +00:00
|
|
|
const Constant *UC = dyn_cast<Constant>(*UI);
|
|
|
|
if (UC == 0 || isa<GlobalValue>(UC))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (UC->isConstantUsed())
|
|
|
|
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-10-28 04:12:16 +00:00
|
|
|
if (const BlockAddress *BA = dyn_cast<BlockAddress>(this))
|
|
|
|
return BA->getFunction()->getRelocationInfo();
|
|
|
|
|
2010-01-03 18:09:40 +00:00
|
|
|
// While raw uses of blockaddress need to be relocated, differences between
|
|
|
|
// two of them don't when they are for labels in the same function. This is a
|
|
|
|
// common idiom when creating a table for the indirect goto extension, so we
|
|
|
|
// handle it efficiently here.
|
|
|
|
if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(this))
|
|
|
|
if (CE->getOpcode() == Instruction::Sub) {
|
|
|
|
ConstantExpr *LHS = dyn_cast<ConstantExpr>(CE->getOperand(0));
|
|
|
|
ConstantExpr *RHS = dyn_cast<ConstantExpr>(CE->getOperand(1));
|
|
|
|
if (LHS && RHS &&
|
|
|
|
LHS->getOpcode() == Instruction::PtrToInt &&
|
|
|
|
RHS->getOpcode() == Instruction::PtrToInt &&
|
|
|
|
isa<BlockAddress>(LHS->getOperand(0)) &&
|
|
|
|
isa<BlockAddress>(RHS->getOperand(0)) &&
|
|
|
|
cast<BlockAddress>(LHS->getOperand(0))->getFunction() ==
|
|
|
|
cast<BlockAddress>(RHS->getOperand(0))->getFunction())
|
|
|
|
return NoRelocation;
|
|
|
|
}
|
|
|
|
|
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-10-28 05:14:34 +00:00
|
|
|
Result = std::max(Result,
|
|
|
|
cast<Constant>(getOperand(i))->getRelocationInfo());
|
2009-07-22 00:05:44 +00:00
|
|
|
|
|
|
|
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.
|
2010-02-01 20:48:08 +00:00
|
|
|
void Constant::getVectorElements(SmallVectorImpl<Constant*> &Elts) const {
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(getType()->isVectorTy() && "Not a vector constant!");
|
2008-07-10 00:28:11 +00:00
|
|
|
|
|
|
|
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-31 20:28:14 +00:00
|
|
|
Constant::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-30 23:03:37 +00:00
|
|
|
Elts.assign(VT->getNumElements(), UndefValue::get(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-31 17:39:07 +00:00
|
|
|
ConstantInt* ConstantInt::getTrue(LLVMContext &Context) {
|
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
2010-11-20 18:43:35 +00:00
|
|
|
if (!pImpl->TheTrueVal)
|
|
|
|
pImpl->TheTrueVal = ConstantInt::get(Type::getInt1Ty(Context), 1);
|
|
|
|
return pImpl->TheTrueVal;
|
2009-07-31 17:39:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantInt* ConstantInt::getFalse(LLVMContext &Context) {
|
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
2010-11-20 18:43:35 +00:00
|
|
|
if (!pImpl->TheFalseVal)
|
|
|
|
pImpl->TheFalseVal = ConstantInt::get(Type::getInt1Ty(Context), 0);
|
|
|
|
return pImpl->TheFalseVal;
|
2009-07-31 17:39:07 +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.
|
2009-08-13 21:58:54 +00:00
|
|
|
const IntegerType *ITy = IntegerType::get(Context, V.getBitWidth());
|
2009-07-24 23:12:02 +00:00
|
|
|
// get an existing value or the insertion position
|
|
|
|
DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
|
|
|
|
ConstantInt *&Slot = Context.pImpl->IntConstants[Key];
|
2009-10-19 20:11:52 +00:00
|
|
|
if (!Slot) Slot = new ConstantInt(ITy, V);
|
|
|
|
return Slot;
|
2009-07-24 23:12:02 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantInt::get(const Type* Ty, uint64_t V, bool isSigned) {
|
2009-07-24 23:12:02 +00:00
|
|
|
Constant *C = get(cast<IntegerType>(Ty->getScalarType()),
|
|
|
|
V, isSigned);
|
|
|
|
|
|
|
|
// For vectors, broadcast the value.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
2011-02-14 18:15:46 +00:00
|
|
|
return ConstantVector::get(
|
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
2009-07-24 23:12:02 +00:00
|
|
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantInt::get(const Type* Ty, const APInt& V) {
|
2009-07-24 23:12:02 +00:00
|
|
|
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))
|
2009-07-28 21:19:26 +00:00
|
|
|
return ConstantVector::get(
|
2011-02-14 18:15:46 +00:00
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
2009-07-24 23:12:02 +00:00
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
2009-11-06 10:58:06 +00:00
|
|
|
ConstantInt* ConstantInt::get(const IntegerType* Ty, StringRef Str,
|
2009-08-16 23:36:33 +00:00
|
|
|
uint8_t radix) {
|
|
|
|
return get(Ty->getContext(), APInt(Ty->getBitWidth(), Str, radix));
|
|
|
|
}
|
|
|
|
|
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-15 17:40:42 +00:00
|
|
|
static const fltSemantics *TypeToFloatSemantics(const Type *Ty) {
|
2009-10-05 05:54:46 +00:00
|
|
|
if (Ty->isFloatTy())
|
2009-07-15 17:40:42 +00:00
|
|
|
return &APFloat::IEEEsingle;
|
2009-10-05 05:54:46 +00:00
|
|
|
if (Ty->isDoubleTy())
|
2009-07-15 17:40:42 +00:00
|
|
|
return &APFloat::IEEEdouble;
|
2009-10-05 05:54:46 +00:00
|
|
|
if (Ty->isX86_FP80Ty())
|
2009-07-15 17:40:42 +00:00
|
|
|
return &APFloat::x87DoubleExtended;
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (Ty->isFP128Ty())
|
2009-07-15 17:40:42 +00:00
|
|
|
return &APFloat::IEEEquad;
|
|
|
|
|
2009-10-05 05:54:46 +00:00
|
|
|
assert(Ty->isPPC_FP128Ty() && "Unknown FP format");
|
2009-07-15 17:40:42 +00:00
|
|
|
return &APFloat::PPCDoubleDouble;
|
|
|
|
}
|
|
|
|
|
2009-07-27 20:59:43 +00:00
|
|
|
/// get() - This returns a constant fp for the specified value in the
|
|
|
|
/// specified type. This should only be used for simple constant values like
|
|
|
|
/// 2.0/1.0 etc, that are known-valid both as double and as the target format.
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantFP::get(const Type* Ty, double V) {
|
2009-07-27 20:59:43 +00:00
|
|
|
LLVMContext &Context = Ty->getContext();
|
|
|
|
|
|
|
|
APFloat FV(V);
|
|
|
|
bool ignored;
|
|
|
|
FV.convert(*TypeToFloatSemantics(Ty->getScalarType()),
|
|
|
|
APFloat::rmNearestTiesToEven, &ignored);
|
|
|
|
Constant *C = get(Context, FV);
|
|
|
|
|
|
|
|
// For vectors, broadcast the value.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
2009-07-28 21:19:26 +00:00
|
|
|
return ConstantVector::get(
|
2011-02-14 18:15:46 +00:00
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
2009-07-27 20:59:43 +00:00
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
2009-08-16 23:36:33 +00:00
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantFP::get(const Type* Ty, StringRef Str) {
|
2009-08-16 23:36:33 +00:00
|
|
|
LLVMContext &Context = Ty->getContext();
|
|
|
|
|
|
|
|
APFloat FV(*TypeToFloatSemantics(Ty->getScalarType()), Str);
|
|
|
|
Constant *C = get(Context, FV);
|
|
|
|
|
|
|
|
// For vectors, broadcast the value.
|
|
|
|
if (const VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return ConstantVector::get(
|
2011-02-14 18:15:46 +00:00
|
|
|
std::vector<Constant *>(VTy->getNumElements(), C));
|
2009-08-16 23:36:33 +00:00
|
|
|
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-07-27 20:59:43 +00:00
|
|
|
ConstantFP* ConstantFP::getNegativeZero(const Type* Ty) {
|
|
|
|
LLVMContext &Context = Ty->getContext();
|
2009-07-31 20:28:14 +00:00
|
|
|
APFloat apf = cast <ConstantFP>(Constant::getNullValue(Ty))->getValueAPF();
|
2009-07-27 20:59:43 +00:00
|
|
|
apf.changeSign();
|
|
|
|
return get(Context, apf);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantFP::getZeroValueForNegation(const Type* Ty) {
|
2009-07-27 20:59:43 +00:00
|
|
|
if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
|
2010-02-15 16:12:20 +00:00
|
|
|
if (PTy->getElementType()->isFloatingPointTy()) {
|
2011-02-14 18:15:46 +00:00
|
|
|
std::vector<Constant*> zeros(PTy->getNumElements(),
|
2009-07-27 20:59:43 +00:00
|
|
|
getNegativeZero(PTy->getElementType()));
|
2011-02-14 18:15:46 +00:00
|
|
|
return ConstantVector::get(PTy, zeros);
|
2009-07-27 20:59:43 +00:00
|
|
|
}
|
|
|
|
|
2010-02-15 16:12:20 +00:00
|
|
|
if (Ty->isFloatingPointTy())
|
2009-07-27 20:59:43 +00:00
|
|
|
return getNegativeZero(Ty);
|
|
|
|
|
2009-07-31 20:28:14 +00:00
|
|
|
return Constant::getNullValue(Ty);
|
2009-07-27 20:59:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ConstantFP accessors.
|
|
|
|
ConstantFP* ConstantFP::get(LLVMContext &Context, const APFloat& V) {
|
|
|
|
DenseMapAPFloatKeyInfo::KeyTy Key(V);
|
|
|
|
|
|
|
|
LLVMContextImpl* pImpl = Context.pImpl;
|
|
|
|
|
|
|
|
ConstantFP *&Slot = pImpl->FPConstants[Key];
|
|
|
|
|
|
|
|
if (!Slot) {
|
2009-10-19 20:11:52 +00:00
|
|
|
const Type *Ty;
|
|
|
|
if (&V.getSemantics() == &APFloat::IEEEsingle)
|
|
|
|
Ty = Type::getFloatTy(Context);
|
|
|
|
else if (&V.getSemantics() == &APFloat::IEEEdouble)
|
|
|
|
Ty = Type::getDoubleTy(Context);
|
|
|
|
else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
|
|
|
|
Ty = Type::getX86_FP80Ty(Context);
|
|
|
|
else if (&V.getSemantics() == &APFloat::IEEEquad)
|
|
|
|
Ty = Type::getFP128Ty(Context);
|
|
|
|
else {
|
|
|
|
assert(&V.getSemantics() == &APFloat::PPCDoubleDouble &&
|
|
|
|
"Unknown FP format");
|
|
|
|
Ty = Type::getPPC_FP128Ty(Context);
|
2009-07-27 20:59:43 +00:00
|
|
|
}
|
2009-10-19 20:11:52 +00:00
|
|
|
Slot = new ConstantFP(Ty, V);
|
2009-07-27 20:59:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return Slot;
|
|
|
|
}
|
|
|
|
|
2009-09-25 23:40:21 +00:00
|
|
|
ConstantFP *ConstantFP::getInfinity(const Type *Ty, bool Negative) {
|
2009-09-25 23:00:48 +00:00
|
|
|
const fltSemantics &Semantics = *TypeToFloatSemantics(Ty);
|
|
|
|
return ConstantFP::get(Ty->getContext(),
|
|
|
|
APFloat::getInf(Semantics, Negative));
|
|
|
|
}
|
|
|
|
|
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;
|
2009-10-03 19:30:43 +00:00
|
|
|
assert(C->getType() == T->getElementType() &&
|
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
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-28 18:32:17 +00:00
|
|
|
Constant *ConstantArray::get(const ArrayType *Ty,
|
|
|
|
const std::vector<Constant*> &V) {
|
2009-09-30 21:08:08 +00:00
|
|
|
for (unsigned i = 0, e = V.size(); i != e; ++i) {
|
|
|
|
assert(V[i]->getType() == Ty->getElementType() &&
|
|
|
|
"Wrong type in array element initializer");
|
|
|
|
}
|
2009-07-28 18:32:17 +00:00
|
|
|
LLVMContextImpl *pImpl = Ty->getContext().pImpl;
|
|
|
|
// If this is an all-zero array, return a ConstantAggregateZero object
|
|
|
|
if (!V.empty()) {
|
|
|
|
Constant *C = V[0];
|
2009-12-30 20:25:09 +00:00
|
|
|
if (!C->isNullValue())
|
2009-07-28 18:32:17 +00:00
|
|
|
return pImpl->ArrayConstants.getOrCreate(Ty, V);
|
2009-12-30 20:25:09 +00:00
|
|
|
|
2009-07-28 18:32:17 +00:00
|
|
|
for (unsigned i = 1, e = V.size(); i != e; ++i)
|
2009-12-30 20:25:09 +00:00
|
|
|
if (V[i] != C)
|
2009-07-28 18:32:17 +00:00
|
|
|
return pImpl->ArrayConstants.getOrCreate(Ty, V);
|
|
|
|
}
|
|
|
|
|
2009-07-30 23:03:37 +00:00
|
|
|
return ConstantAggregateZero::get(Ty);
|
2009-07-28 18:32:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantArray::get(const ArrayType* T, Constant *const* Vals,
|
2009-07-28 18:32:17 +00:00
|
|
|
unsigned NumVals) {
|
|
|
|
// FIXME: make this the primary ctor method.
|
|
|
|
return get(T, std::vector<Constant*>(Vals, Vals+NumVals));
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ConstantArray::get(const string&) - Return an array that is initialized to
|
|
|
|
/// contain the specified string. If length is zero then a null terminator is
|
|
|
|
/// added to the specified string so that it may be used in a natural way.
|
|
|
|
/// Otherwise, the length parameter specifies how much of the string to use
|
|
|
|
/// and it won't be null terminated.
|
|
|
|
///
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantArray::get(LLVMContext &Context, StringRef Str,
|
2009-08-13 21:58:54 +00:00
|
|
|
bool AddNull) {
|
2009-07-28 18:32:17 +00:00
|
|
|
std::vector<Constant*> ElementVals;
|
2010-08-01 11:43:26 +00:00
|
|
|
ElementVals.reserve(Str.size() + size_t(AddNull));
|
2009-07-28 18:32:17 +00:00
|
|
|
for (unsigned i = 0; i < Str.size(); ++i)
|
2009-08-13 21:58:54 +00:00
|
|
|
ElementVals.push_back(ConstantInt::get(Type::getInt8Ty(Context), Str[i]));
|
2009-07-28 18:32:17 +00:00
|
|
|
|
|
|
|
// Add a null terminator to the string...
|
|
|
|
if (AddNull) {
|
2009-08-13 21:58:54 +00:00
|
|
|
ElementVals.push_back(ConstantInt::get(Type::getInt8Ty(Context), 0));
|
2009-07-28 18:32:17 +00:00
|
|
|
}
|
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
ArrayType *ATy = ArrayType::get(Type::getInt8Ty(Context), ElementVals.size());
|
2009-07-28 18:32:17 +00:00
|
|
|
return get(ATy, ElementVals);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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;
|
2009-10-03 19:30:43 +00:00
|
|
|
assert(C->getType() == T->getElementType(I-V.begin()) &&
|
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
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-27 22:29:26 +00:00
|
|
|
// ConstantStruct accessors.
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantStruct::get(const StructType* T,
|
2009-07-27 22:29:26 +00:00
|
|
|
const std::vector<Constant*>& V) {
|
|
|
|
LLVMContextImpl* pImpl = T->getContext().pImpl;
|
|
|
|
|
|
|
|
// Create a ConstantAggregateZero value if all elements are zeros...
|
|
|
|
for (unsigned i = 0, e = V.size(); i != e; ++i)
|
|
|
|
if (!V[i]->isNullValue())
|
|
|
|
return pImpl->StructConstants.getOrCreate(T, V);
|
|
|
|
|
2009-07-30 23:03:37 +00:00
|
|
|
return ConstantAggregateZero::get(T);
|
2009-07-27 22:29:26 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantStruct::get(LLVMContext &Context,
|
2009-08-05 23:16:16 +00:00
|
|
|
const std::vector<Constant*>& V, bool packed) {
|
2009-07-27 22:29:26 +00:00
|
|
|
std::vector<const Type*> StructEls;
|
|
|
|
StructEls.reserve(V.size());
|
|
|
|
for (unsigned i = 0, e = V.size(); i != e; ++i)
|
|
|
|
StructEls.push_back(V[i]->getType());
|
2009-08-05 23:16:16 +00:00
|
|
|
return get(StructType::get(Context, StructEls, packed), V);
|
2009-07-27 22:29:26 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantStruct::get(LLVMContext &Context,
|
|
|
|
Constant *const *Vals, unsigned NumVals,
|
2009-07-27 22:29:26 +00:00
|
|
|
bool Packed) {
|
|
|
|
// FIXME: make this the primary ctor method.
|
2009-08-05 23:16:16 +00:00
|
|
|
return get(Context, std::vector<Constant*>(Vals, Vals+NumVals), Packed);
|
2009-07-27 22:29:26 +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;
|
2011-01-27 14:44:55 +00:00
|
|
|
for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
|
|
|
|
I != E; ++I, ++OL) {
|
|
|
|
Constant *C = *I;
|
|
|
|
assert(C->getType() == T->getElementType() &&
|
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
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-28 21:19:26 +00:00
|
|
|
// ConstantVector accessors.
|
2011-02-14 18:15:46 +00:00
|
|
|
Constant *ConstantVector::get(const VectorType* T,
|
|
|
|
const std::vector<Constant*>& V) {
|
2011-01-27 14:44:55 +00:00
|
|
|
assert(!V.empty() && "Vectors can't be empty");
|
2011-02-14 18:15:46 +00:00
|
|
|
LLVMContext &Context = T->getContext();
|
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
2011-01-27 14:44:55 +00:00
|
|
|
|
2011-02-14 18:15:46 +00:00
|
|
|
// If this is an all-undef or alll-zero vector, return a
|
2009-07-28 21:19:26 +00:00
|
|
|
// ConstantAggregateZero or UndefValue.
|
|
|
|
Constant *C = V[0];
|
|
|
|
bool isZero = C->isNullValue();
|
|
|
|
bool isUndef = isa<UndefValue>(C);
|
|
|
|
|
|
|
|
if (isZero || isUndef) {
|
|
|
|
for (unsigned i = 1, e = V.size(); i != e; ++i)
|
|
|
|
if (V[i] != C) {
|
|
|
|
isZero = isUndef = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (isZero)
|
2009-07-30 23:03:37 +00:00
|
|
|
return ConstantAggregateZero::get(T);
|
2009-07-28 21:19:26 +00:00
|
|
|
if (isUndef)
|
2009-07-30 23:03:37 +00:00
|
|
|
return UndefValue::get(T);
|
2009-07-28 21:19:26 +00:00
|
|
|
|
|
|
|
return pImpl->VectorConstants.getOrCreate(T, V);
|
|
|
|
}
|
|
|
|
|
2011-02-14 18:15:46 +00:00
|
|
|
Constant *ConstantVector::get(const std::vector<Constant*>& V) {
|
|
|
|
assert(!V.empty() && "Cannot infer type if V is empty");
|
|
|
|
return get(VectorType::get(V.front()->getType(),V.size()), V);
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantVector::get(Constant *const* Vals, unsigned NumVals) {
|
2009-07-28 21:19:26 +00:00
|
|
|
// FIXME: make this the primary ctor method.
|
2011-02-14 18:15:46 +00:00
|
|
|
return get(std::vector<Constant*>(Vals, Vals+NumVals));
|
2009-07-28 21:19:26 +00:00
|
|
|
}
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
2009-09-10 23:37:55 +00:00
|
|
|
bool ConstantExpr::isGEPWithNoNotionalOverIndexing() const {
|
|
|
|
if (getOpcode() != Instruction::GetElementPtr) return false;
|
|
|
|
|
|
|
|
gep_type_iterator GEPI = gep_type_begin(this), E = gep_type_end(this);
|
2010-08-02 06:00:15 +00:00
|
|
|
User::const_op_iterator OI = llvm::next(this->op_begin());
|
2009-09-10 23:37:55 +00:00
|
|
|
|
|
|
|
// Skip the first index, as it has no static limit.
|
|
|
|
++GEPI;
|
|
|
|
++OI;
|
|
|
|
|
|
|
|
// The remaining indices must be compile-time known integers within the
|
|
|
|
// bounds of the corresponding notional static array types.
|
|
|
|
for (; GEPI != E; ++GEPI, ++OI) {
|
|
|
|
ConstantInt *CI = dyn_cast<ConstantInt>(*OI);
|
|
|
|
if (!CI) return false;
|
|
|
|
if (const ArrayType *ATy = dyn_cast<ArrayType>(*GEPI))
|
|
|
|
if (CI->getValue().getActiveBits() > 64 ||
|
|
|
|
CI->getZExtValue() >= ATy->getNumElements())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// All the indices checked out.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
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)
|
2009-09-07 23:54:19 +00:00
|
|
|
return cast<GEPOperator>(this)->isInBounds() ?
|
|
|
|
ConstantExpr::getInBoundsGetElementPtr(Op, &Ops[0], Ops.size()) :
|
|
|
|
ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
|
2006-07-14 19:37:40 +00:00
|
|
|
Ops[OpNo-1] = Op;
|
2009-09-07 23:54:19 +00:00
|
|
|
return cast<GEPOperator>(this)->isInBounds() ?
|
2009-12-29 02:14:09 +00:00
|
|
|
ConstantExpr::getInBoundsGetElementPtr(getOperand(0), &Ops[0],Ops.size()):
|
2009-09-07 23:54:19 +00:00
|
|
|
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);
|
2009-12-29 02:14:09 +00:00
|
|
|
return ConstantExpr::get(getOpcode(), Op0, Op1, SubclassOptionalData);
|
2006-07-14 22:20:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// 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::
|
2011-02-07 16:40:21 +00:00
|
|
|
getWithOperands(Constant *const *Ops, unsigned NumOps) const {
|
2008-08-20 22:27:40 +00:00
|
|
|
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:
|
2009-09-07 23:54:19 +00:00
|
|
|
return cast<GEPOperator>(this)->isInBounds() ?
|
|
|
|
ConstantExpr::getInBoundsGetElementPtr(Ops[0], &Ops[1], NumOps-1) :
|
|
|
|
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?");
|
2009-12-29 02:14:09 +00:00
|
|
|
return ConstantExpr::get(getOpcode(), Ops[0], Ops[1], SubclassOptionalData);
|
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
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getInt1Ty(Ty->getContext()))
|
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 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
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getInt1Ty(Ty->getContext()))
|
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-07-30 23:03:37 +00:00
|
|
|
ConstantAggregateZero* ConstantAggregateZero::get(const Type* Ty) {
|
2010-08-28 04:09:24 +00:00
|
|
|
assert((Ty->isStructTy() || Ty->isArrayTy() || Ty->isVectorTy()) &&
|
2009-07-30 23:03:37 +00:00
|
|
|
"Cannot create an aggregate zero of non-aggregate type!");
|
|
|
|
|
|
|
|
LLVMContextImpl *pImpl = Ty->getContext().pImpl;
|
|
|
|
return pImpl->AggZeroConstants.getOrCreate(Ty, 0);
|
|
|
|
}
|
|
|
|
|
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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->AggZeroConstants.remove(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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->ArrayConstants.remove(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...
|
2010-02-15 16:12:20 +00:00
|
|
|
if (!getType()->getElementType()->isIntegerTy(8))
|
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...
|
2010-02-15 16:12:20 +00:00
|
|
|
if (!getType()->getElementType()->isIntegerTy(8))
|
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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->StructConstants.remove(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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->VectorConstants.remove(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.
|
2011-02-01 08:39:12 +00:00
|
|
|
Constant *ConstantVector::getSplatValue() const {
|
2007-10-17 17:51:30 +00:00
|
|
|
// 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;
|
|
|
|
}
|
|
|
|
|
2009-10-28 00:01:44 +00:00
|
|
|
//---- ConstantPointerNull::get() implementation.
|
2001-10-03 15:39:36 +00:00
|
|
|
//
|
2003-05-23 20:03:32 +00:00
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
|
2009-07-31 22:45:43 +00:00
|
|
|
return Ty->getContext().pImpl->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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->NullPtrConstants.remove(this);
|
2002-08-18 00:40:04 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-28 00:01:44 +00:00
|
|
|
//---- UndefValue::get() implementation.
|
2004-10-16 18:07:16 +00:00
|
|
|
//
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
UndefValue *UndefValue::get(const Type *Ty) {
|
2009-07-31 22:45:43 +00:00
|
|
|
return Ty->getContext().pImpl->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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->UndefValueConstants.remove(this);
|
2004-10-16 18:07:16 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
2009-10-28 00:01:44 +00:00
|
|
|
//---- BlockAddress::get() implementation.
|
|
|
|
//
|
|
|
|
|
|
|
|
BlockAddress *BlockAddress::get(BasicBlock *BB) {
|
|
|
|
assert(BB->getParent() != 0 && "Block must have a parent");
|
|
|
|
return get(BB->getParent(), BB);
|
|
|
|
}
|
|
|
|
|
|
|
|
BlockAddress *BlockAddress::get(Function *F, BasicBlock *BB) {
|
|
|
|
BlockAddress *&BA =
|
|
|
|
F->getContext().pImpl->BlockAddresses[std::make_pair(F, BB)];
|
|
|
|
if (BA == 0)
|
|
|
|
BA = new BlockAddress(F, BB);
|
|
|
|
|
|
|
|
assert(BA->getFunction() == F && "Basic block moved between functions");
|
|
|
|
return BA;
|
|
|
|
}
|
|
|
|
|
|
|
|
BlockAddress::BlockAddress(Function *F, BasicBlock *BB)
|
|
|
|
: Constant(Type::getInt8PtrTy(F->getContext()), Value::BlockAddressVal,
|
|
|
|
&Op<0>(), 2) {
|
2009-11-01 03:03:03 +00:00
|
|
|
setOperand(0, F);
|
|
|
|
setOperand(1, BB);
|
2009-11-01 01:27:45 +00:00
|
|
|
BB->AdjustBlockAddressRefCount(1);
|
2009-10-28 00:01:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// destroyConstant - Remove the constant from the constant table.
|
|
|
|
//
|
|
|
|
void BlockAddress::destroyConstant() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getFunction()->getRawType()->getContext().pImpl
|
2009-10-28 00:01:44 +00:00
|
|
|
->BlockAddresses.erase(std::make_pair(getFunction(), getBasicBlock()));
|
2009-11-01 01:27:45 +00:00
|
|
|
getBasicBlock()->AdjustBlockAddressRefCount(-1);
|
2009-10-28 00:01:44 +00:00
|
|
|
destroyConstantImpl();
|
|
|
|
}
|
|
|
|
|
|
|
|
void BlockAddress::replaceUsesOfWithOnConstant(Value *From, Value *To, Use *U) {
|
|
|
|
// This could be replacing either the Basic Block or the Function. In either
|
|
|
|
// case, we have to remove the map entry.
|
|
|
|
Function *NewF = getFunction();
|
|
|
|
BasicBlock *NewBB = getBasicBlock();
|
|
|
|
|
|
|
|
if (U == &Op<0>())
|
|
|
|
NewF = cast<Function>(To);
|
|
|
|
else
|
|
|
|
NewBB = cast<BasicBlock>(To);
|
|
|
|
|
|
|
|
// See if the 'new' entry already exists, if not, just update this in place
|
|
|
|
// and return early.
|
|
|
|
BlockAddress *&NewBA =
|
|
|
|
getContext().pImpl->BlockAddresses[std::make_pair(NewF, NewBB)];
|
|
|
|
if (NewBA == 0) {
|
2009-11-01 03:03:03 +00:00
|
|
|
getBasicBlock()->AdjustBlockAddressRefCount(-1);
|
|
|
|
|
2009-10-28 00:01:44 +00:00
|
|
|
// Remove the old entry, this can't cause the map to rehash (just a
|
|
|
|
// tombstone will get added).
|
|
|
|
getContext().pImpl->BlockAddresses.erase(std::make_pair(getFunction(),
|
|
|
|
getBasicBlock()));
|
|
|
|
NewBA = this;
|
2009-11-01 03:03:03 +00:00
|
|
|
setOperand(0, NewF);
|
|
|
|
setOperand(1, NewBB);
|
|
|
|
getBasicBlock()->AdjustBlockAddressRefCount(1);
|
2009-10-28 00:01:44 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, I do need to replace this with an existing value.
|
|
|
|
assert(NewBA != this && "I didn't contain From!");
|
|
|
|
|
|
|
|
// Everyone using this now uses the replacement.
|
|
|
|
uncheckedReplaceAllUsesWith(NewBA);
|
|
|
|
|
|
|
|
destroyConstant();
|
|
|
|
}
|
|
|
|
|
|
|
|
//---- ConstantExpr::get() implementations.
|
2002-07-14 23:13:17 +00:00
|
|
|
//
|
2006-12-31 05:26:44 +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
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
|
2006-11-27 01:05:10 +00:00
|
|
|
return FC;
|
2003-04-17 19:24:48 +00:00
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = Ty->getContext().pImpl;
|
|
|
|
|
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-08-04 20:25:11 +00:00
|
|
|
return pImpl->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");
|
2010-01-26 21:51:43 +00:00
|
|
|
assert(CastInst::castIsValid(opc, C, Ty) && "Invalid constantexpr cast!");
|
2006-11-27 01:05:10 +00:00
|
|
|
|
|
|
|
switch (opc) {
|
2010-01-26 21:51:43 +00:00
|
|
|
default:
|
|
|
|
llvm_unreachable("Invalid cast opcode");
|
|
|
|
break;
|
|
|
|
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())
|
2010-04-12 22:12:29 +00:00
|
|
|
return getBitCast(C, Ty);
|
|
|
|
return getZExt(C, Ty);
|
2006-12-04 20:17:56 +00:00
|
|
|
}
|
|
|
|
|
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())
|
2010-04-12 22:12:29 +00:00
|
|
|
return getBitCast(C, Ty);
|
|
|
|
return getSExt(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())
|
2010-04-12 22:12:29 +00:00
|
|
|
return getBitCast(C, Ty);
|
|
|
|
return getTrunc(C, Ty);
|
2006-12-04 20:17:56 +00:00
|
|
|
}
|
|
|
|
|
2009-06-20 00:24:58 +00:00
|
|
|
Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(S->getType()->isPointerTy() && "Invalid cast");
|
|
|
|
assert((Ty->isIntegerTy() || Ty->isPointerTy()) && "Invalid cast");
|
2006-12-05 03:25:26 +00:00
|
|
|
|
2010-02-15 16:12:20 +00:00
|
|
|
if (Ty->isIntegerTy())
|
2010-04-12 22:12:29 +00:00
|
|
|
return getPtrToInt(S, Ty);
|
|
|
|
return getBitCast(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) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() &&
|
|
|
|
Ty->isIntOrIntVectorTy() && "Invalid cast");
|
2009-06-15 22:12:54 +00:00
|
|
|
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) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
|
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 =
|
2011-01-27 14:44:55 +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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() && "Trunc operand must be integer");
|
|
|
|
assert(Ty->isIntOrIntVectorTy() && "Trunc produces only integral");
|
2009-06-15 22:12:54 +00:00
|
|
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() && "SExt operand must be integral");
|
|
|
|
assert(Ty->isIntOrIntVectorTy() && "SExt produces only integer");
|
2009-06-15 22:12:54 +00:00
|
|
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() && "ZEXt operand must be integral");
|
|
|
|
assert(Ty->isIntOrIntVectorTy() && "ZExt produces only integer");
|
2009-06-15 22:12:54 +00:00
|
|
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
|
2009-06-15 22:12:54 +00:00
|
|
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
|
2009-06-15 22:12:54 +00:00
|
|
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
|
2007-11-17 03:58:34 +00:00
|
|
|
"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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
|
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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
|
2007-11-17 03:58:34 +00:00
|
|
|
"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");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
|
2007-11-17 03:58:34 +00:00
|
|
|
"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) {
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(C->getType()->isPointerTy() && "PtrToInt source must be pointer");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(DstTy->isIntegerTy() && "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) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntegerTy() && "IntToPtr source must be integral");
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(DstTy->isPointerTy() && "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) {
|
2010-01-26 21:51:43 +00:00
|
|
|
assert(CastInst::castIsValid(Instruction::BitCast, C, DstTy) &&
|
|
|
|
"Invalid constantexpr bitcast!");
|
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-09-07 23:54:19 +00:00
|
|
|
Constant *C1, Constant *C2,
|
|
|
|
unsigned Flags) {
|
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
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
if (ReqTy == C1->getType() || ReqTy == Type::getInt1Ty(ReqTy->getContext()))
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldBinaryInstruction(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);
|
2009-09-07 23:54:19 +00:00
|
|
|
ExprMapKeyType Key(Opcode, argVec, 0, Flags);
|
2009-06-17 20:10:08 +00:00
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->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-09-07 23:54:19 +00:00
|
|
|
Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2,
|
|
|
|
unsigned Flags) {
|
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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVectorTy() &&
|
2009-06-04 22:49:04 +00:00
|
|
|
"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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVectorTy() &&
|
2009-06-04 22:49:04 +00:00
|
|
|
"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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVectorTy() &&
|
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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVectorTy() &&
|
2009-06-15 22:25:12 +00:00
|
|
|
"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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVectorTy() &&
|
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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isFPOrFPVectorTy() &&
|
2009-06-15 22:25:12 +00:00
|
|
|
"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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVectorTy() &&
|
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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C1->getType()->isIntOrIntVectorTy() &&
|
2004-08-17 17:28:46 +00:00
|
|
|
"Tried to create a shift operation on a non-integer type!");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2009-09-07 23:54:19 +00:00
|
|
|
return getTy(C1->getType(), Opcode, C1, C2, Flags);
|
2006-12-04 21:35:24 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getSizeOf(const Type* Ty) {
|
2009-07-29 18:55:55 +00:00
|
|
|
// sizeof is implemented as: (i64) gep (Ty*)null, 1
|
|
|
|
// Note that a non-inbounds gep is used, as null isn't within any object.
|
2009-08-13 21:58:54 +00:00
|
|
|
Constant *GEPIdx = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *GEP = getGetElementPtr(
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant::getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
|
2010-04-12 22:12:29 +00:00
|
|
|
return getPtrToInt(GEP,
|
|
|
|
Type::getInt64Ty(Ty->getContext()));
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getAlignOf(const Type* Ty) {
|
2010-01-28 02:15:55 +00:00
|
|
|
// alignof is implemented as: (i64) gep ({i1,Ty}*)null, 0, 1
|
2009-08-11 17:57:01 +00:00
|
|
|
// Note that a non-inbounds gep is used, as null isn't within any object.
|
2009-08-05 23:16:16 +00:00
|
|
|
const Type *AligningTy = StructType::get(Ty->getContext(),
|
2010-01-28 02:15:55 +00:00
|
|
|
Type::getInt1Ty(Ty->getContext()), Ty, NULL);
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant *NullPtr = Constant::getNullValue(AligningTy->getPointerTo());
|
2010-01-28 02:43:22 +00:00
|
|
|
Constant *Zero = ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0);
|
2009-08-13 21:58:54 +00:00
|
|
|
Constant *One = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *Indices[2] = { Zero, One };
|
|
|
|
Constant *GEP = getGetElementPtr(NullPtr, Indices, 2);
|
2010-04-12 22:12:29 +00:00
|
|
|
return getPtrToInt(GEP,
|
|
|
|
Type::getInt64Ty(Ty->getContext()));
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getOffsetOf(const StructType* STy, unsigned FieldNo) {
|
2010-02-01 16:37:38 +00:00
|
|
|
return getOffsetOf(STy, ConstantInt::get(Type::getInt32Ty(STy->getContext()),
|
|
|
|
FieldNo));
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getOffsetOf(const Type* Ty, Constant *FieldNo) {
|
2009-08-16 21:26:11 +00:00
|
|
|
// offsetof is implemented as: (i64) gep (Ty*)null, 0, FieldNo
|
|
|
|
// Note that a non-inbounds gep is used, as null isn't within any object.
|
|
|
|
Constant *GEPIdx[] = {
|
2010-02-01 16:37:38 +00:00
|
|
|
ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0),
|
|
|
|
FieldNo
|
2009-08-16 21:26:11 +00:00
|
|
|
};
|
|
|
|
Constant *GEP = getGetElementPtr(
|
2010-02-01 16:37:38 +00:00
|
|
|
Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx, 2);
|
2010-04-12 22:12:29 +00:00
|
|
|
return getPtrToInt(GEP,
|
|
|
|
Type::getInt64Ty(Ty->getContext()));
|
2009-08-16 21:26:11 +00:00
|
|
|
}
|
2009-07-29 18:55:55 +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())
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *SC = ConstantFoldSelectInstruction(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-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
|
2004-03-12 05:54:04 +00:00
|
|
|
}
|
|
|
|
|
2011-01-14 08:07:43 +00:00
|
|
|
template<typename IndexTy>
|
2003-10-05 00:17:43 +00:00
|
|
|
Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
|
2011-01-14 08:07:43 +00:00
|
|
|
IndexTy const *Idxs,
|
2011-02-11 05:34:33 +00:00
|
|
|
unsigned NumIdx, bool InBounds) {
|
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
|
|
|
|
2011-02-11 05:34:33 +00:00
|
|
|
if (Constant *FC = ConstantFoldGetElementPtr(C, InBounds, Idxs, NumIdx))
|
|
|
|
return FC; // Fold a few common cases.
|
2009-09-07 23:54:19 +00:00
|
|
|
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(C->getType()->isPointerTy() &&
|
2009-09-07 23:54:19 +00:00
|
|
|
"Non-pointer type for constant GetElementPtr expression");
|
|
|
|
// Look up the constant in the table first to ensure uniqueness
|
|
|
|
std::vector<Constant*> ArgVec;
|
|
|
|
ArgVec.reserve(NumIdx+1);
|
|
|
|
ArgVec.push_back(C);
|
|
|
|
for (unsigned i = 0; i != NumIdx; ++i)
|
|
|
|
ArgVec.push_back(cast<Constant>(Idxs[i]));
|
|
|
|
const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec, 0,
|
2011-02-11 05:34:33 +00:00
|
|
|
InBounds ? GEPOperator::IsInBounds : 0);
|
2009-09-07 23:54:19 +00:00
|
|
|
|
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
|
|
|
|
}
|
|
|
|
|
2011-01-14 08:07:43 +00:00
|
|
|
template<typename IndexTy>
|
|
|
|
Constant *ConstantExpr::getGetElementPtrImpl(Constant *C, IndexTy const *Idxs,
|
2011-02-11 05:34:33 +00:00
|
|
|
unsigned NumIdx, bool InBounds) {
|
2009-09-07 23:54:19 +00:00
|
|
|
// Get the result type of the getelementptr!
|
|
|
|
const Type *Ty =
|
|
|
|
GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
|
|
|
|
assert(Ty && "GEP indices invalid!");
|
|
|
|
unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
|
2011-02-11 05:34:33 +00:00
|
|
|
return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx,InBounds);
|
2009-09-03 23:34:49 +00:00
|
|
|
}
|
|
|
|
|
2011-01-14 08:07:43 +00:00
|
|
|
Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
|
2011-02-11 05:34:33 +00:00
|
|
|
unsigned NumIdx, bool InBounds) {
|
|
|
|
return getGetElementPtrImpl(C, Idxs, NumIdx, InBounds);
|
2011-01-14 08:07:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant *const *Idxs,
|
2011-02-11 05:34:33 +00:00
|
|
|
unsigned NumIdx, bool InBounds) {
|
|
|
|
return getGetElementPtrImpl(C, Idxs, NumIdx, InBounds);
|
2009-09-03 23:34:49 +00:00
|
|
|
}
|
|
|
|
|
2006-12-04 05:19:50 +00:00
|
|
|
Constant *
|
2010-01-21 07:03:21 +00:00
|
|
|
ConstantExpr::getICmp(unsigned short pred, Constant *LHS, Constant *RHS) {
|
2006-12-04 05:19:50 +00:00
|
|
|
assert(LHS->getType() == RHS->getType());
|
|
|
|
assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
|
|
|
|
pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
|
|
|
|
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldCompareInstruction(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
|
|
|
|
2010-01-21 07:03:21 +00:00
|
|
|
const Type *ResultTy = Type::getInt1Ty(LHS->getContext());
|
|
|
|
if (const VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
|
|
|
|
ResultTy = VectorType::get(ResultTy, VT->getNumElements());
|
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
|
2010-01-21 07:03:21 +00:00
|
|
|
return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
|
2006-12-04 05:19:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *
|
2010-01-21 07:03:21 +00:00
|
|
|
ConstantExpr::getFCmp(unsigned short pred, Constant *LHS, Constant *RHS) {
|
2006-12-04 05:19:50 +00:00
|
|
|
assert(LHS->getType() == RHS->getType());
|
|
|
|
assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
|
|
|
|
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldCompareInstruction(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);
|
2010-01-21 07:03:21 +00:00
|
|
|
|
|
|
|
const Type *ResultTy = Type::getInt1Ty(LHS->getContext());
|
|
|
|
if (const VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
|
|
|
|
ResultTy = VectorType::get(ResultTy, VT->getNumElements());
|
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
|
2010-01-21 07:03:21 +00:00
|
|
|
return pImpl->ExprConstants.getOrCreate(ResultTy, 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) {
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
|
2009-12-30 20:25:09 +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
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
|
2006-01-10 19:05:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(Val->getType()->isVectorTy() &&
|
2007-02-15 03:39:18 +00:00
|
|
|
"Tried to create extractelement operation on non-vector type!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(Idx->getType()->isIntegerTy(32) &&
|
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) {
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
|
2009-12-30 20:25:09 +00:00
|
|
|
return FC; // Fold a few common cases.
|
2006-01-17 20:07:22 +00:00
|
|
|
// 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
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
|
2006-01-17 20:07:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
|
|
|
|
Constant *Idx) {
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(Val->getType()->isVectorTy() &&
|
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!");
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(Idx->getType()->isIntegerTy(32) &&
|
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) {
|
2010-02-01 20:48:08 +00:00
|
|
|
if (Constant *FC = ConstantFoldShuffleVectorInstruction(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
|
|
|
|
2009-08-04 20:25:11 +00:00
|
|
|
LLVMContextImpl *pImpl = ReqTy->getContext().pImpl;
|
|
|
|
return pImpl->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");
|
2010-02-01 20:48:08 +00:00
|
|
|
Constant *FC = ConstantFoldInsertValueInstruction(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");
|
2010-02-01 20:48:08 +00:00
|
|
|
Constant *FC = ConstantFoldExtractValueInstruction(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);
|
|
|
|
}
|
|
|
|
|
2011-02-10 07:01:55 +00:00
|
|
|
Constant *ConstantExpr::getNeg(Constant *C, bool HasNUW, bool HasNSW) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() &&
|
2009-07-29 18:55:55 +00:00
|
|
|
"Cannot NEG a nonintegral value!");
|
2011-02-10 07:01:55 +00:00
|
|
|
return getSub(ConstantFP::getZeroValueForNegation(C->getType()),
|
|
|
|
C, HasNUW, HasNSW);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFNeg(Constant *C) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isFPOrFPVectorTy() &&
|
2009-07-29 18:55:55 +00:00
|
|
|
"Cannot FNEG a non-floating-point value!");
|
2011-02-10 07:01:55 +00:00
|
|
|
return getFSub(ConstantFP::getZeroValueForNegation(C->getType()), C);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getNot(Constant *C) {
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(C->getType()->isIntOrIntVectorTy() &&
|
2009-07-29 18:55:55 +00:00
|
|
|
"Cannot NOT a nonintegral value!");
|
2009-07-31 20:28:14 +00:00
|
|
|
return get(Instruction::Xor, C, Constant::getAllOnesValue(C->getType()));
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-10 07:01:55 +00:00
|
|
|
Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2,
|
|
|
|
bool HasNUW, bool HasNSW) {
|
|
|
|
unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
|
|
|
|
(HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
|
|
|
|
return get(Instruction::Add, C1, C2, Flags);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFAdd(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::FAdd, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-10 07:01:55 +00:00
|
|
|
Constant *ConstantExpr::getSub(Constant *C1, Constant *C2,
|
|
|
|
bool HasNUW, bool HasNSW) {
|
|
|
|
unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
|
|
|
|
(HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
|
|
|
|
return get(Instruction::Sub, C1, C2, Flags);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFSub(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::FSub, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-10 07:01:55 +00:00
|
|
|
Constant *ConstantExpr::getMul(Constant *C1, Constant *C2,
|
|
|
|
bool HasNUW, bool HasNSW) {
|
|
|
|
unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
|
|
|
|
(HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
|
|
|
|
return get(Instruction::Mul, C1, C2, Flags);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFMul(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::FMul, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-09 16:43:07 +00:00
|
|
|
Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2, bool isExact) {
|
|
|
|
return get(Instruction::UDiv, C1, C2,
|
|
|
|
isExact ? PossiblyExactOperator::IsExact : 0);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-09 16:43:07 +00:00
|
|
|
Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2, bool isExact) {
|
|
|
|
return get(Instruction::SDiv, C1, C2,
|
|
|
|
isExact ? PossiblyExactOperator::IsExact : 0);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::FDiv, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::URem, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::SRem, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::FRem, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::And, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::Or, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-07 16:40:21 +00:00
|
|
|
Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
|
2009-07-29 18:55:55 +00:00
|
|
|
return get(Instruction::Xor, C1, C2);
|
|
|
|
}
|
|
|
|
|
2011-02-10 07:01:55 +00:00
|
|
|
Constant *ConstantExpr::getShl(Constant *C1, Constant *C2,
|
|
|
|
bool HasNUW, bool HasNSW) {
|
|
|
|
unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
|
|
|
|
(HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
|
|
|
|
return get(Instruction::Shl, C1, C2, Flags);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-09 16:43:07 +00:00
|
|
|
Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2, bool isExact) {
|
|
|
|
return get(Instruction::LShr, C1, C2,
|
|
|
|
isExact ? PossiblyExactOperator::IsExact : 0);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
2011-02-09 16:43:07 +00:00
|
|
|
Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2, bool isExact) {
|
|
|
|
return get(Instruction::AShr, C1, C2,
|
|
|
|
isExact ? PossiblyExactOperator::IsExact : 0);
|
2009-07-29 18:55:55 +00:00
|
|
|
}
|
|
|
|
|
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() {
|
2010-07-17 06:13:52 +00:00
|
|
|
getRawType()->getContext().pImpl->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
|
|
|
|
2010-03-30 20:48:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
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) {
|
|
|
|
OperandList[0] = C;
|
|
|
|
for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
|
|
|
|
OperandList[i+1] = IdxList[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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.
|
2009-10-28 00:01:44 +00:00
|
|
|
///
|
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-28 18:32:17 +00:00
|
|
|
assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
|
|
|
|
Constant *ToC = cast<Constant>(To);
|
|
|
|
|
2010-07-17 06:13:52 +00:00
|
|
|
LLVMContextImpl *pImpl = getRawType()->getContext().pImpl;
|
2009-07-28 18:32:17 +00:00
|
|
|
|
2009-09-15 15:58:07 +00:00
|
|
|
std::pair<LLVMContextImpl::ArrayConstantsTy::MapKey, ConstantArray*> Lookup;
|
2010-07-17 06:13:52 +00:00
|
|
|
Lookup.first.first = cast<ArrayType>(getRawType());
|
2009-07-28 18:32:17 +00:00
|
|
|
Lookup.second = this;
|
|
|
|
|
|
|
|
std::vector<Constant*> &Values = Lookup.first.second;
|
|
|
|
Values.reserve(getNumOperands()); // Build replacement array.
|
|
|
|
|
|
|
|
// Fill values with the modified operands of the constant array. Also,
|
|
|
|
// compute whether this turns into an all-zeros array.
|
|
|
|
bool isAllZeros = false;
|
|
|
|
unsigned NumUpdated = 0;
|
|
|
|
if (!ToC->isNullValue()) {
|
|
|
|
for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
|
|
|
|
Constant *Val = cast<Constant>(O->get());
|
|
|
|
if (Val == From) {
|
|
|
|
Val = ToC;
|
|
|
|
++NumUpdated;
|
|
|
|
}
|
|
|
|
Values.push_back(Val);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
isAllZeros = true;
|
|
|
|
for (Use *O = OperandList, *E = OperandList+getNumOperands();O != E; ++O) {
|
|
|
|
Constant *Val = cast<Constant>(O->get());
|
|
|
|
if (Val == From) {
|
|
|
|
Val = ToC;
|
|
|
|
++NumUpdated;
|
|
|
|
}
|
|
|
|
Values.push_back(Val);
|
|
|
|
if (isAllZeros) isAllZeros = Val->isNullValue();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Constant *Replacement = 0;
|
|
|
|
if (isAllZeros) {
|
2010-07-17 06:13:52 +00:00
|
|
|
Replacement = ConstantAggregateZero::get(getRawType());
|
2009-07-28 18:32:17 +00:00
|
|
|
} else {
|
|
|
|
// Check to see if we have this array type already.
|
|
|
|
bool Exists;
|
|
|
|
LLVMContextImpl::ArrayConstantsTy::MapTy::iterator I =
|
|
|
|
pImpl->ArrayConstants.InsertOrGetItem(Lookup, Exists);
|
|
|
|
|
|
|
|
if (Exists) {
|
2009-09-03 01:39:20 +00:00
|
|
|
Replacement = I->second;
|
2009-07-28 18:32:17 +00:00
|
|
|
} else {
|
|
|
|
// Okay, the new shape doesn't exist in the system yet. Instead of
|
|
|
|
// creating a new constant array, inserting it, replaceallusesof'ing the
|
|
|
|
// old with the new, then deleting the old... just update the current one
|
|
|
|
// in place!
|
|
|
|
pImpl->ArrayConstants.MoveConstantToNewSlot(this, I);
|
|
|
|
|
|
|
|
// Update to the new value. Optimize for the case when we have a single
|
|
|
|
// operand that we're changing, but handle bulk updates efficiently.
|
|
|
|
if (NumUpdated == 1) {
|
|
|
|
unsigned OperandToUpdate = U - OperandList;
|
|
|
|
assert(getOperand(OperandToUpdate) == From &&
|
|
|
|
"ReplaceAllUsesWith broken!");
|
|
|
|
setOperand(OperandToUpdate, ToC);
|
|
|
|
} else {
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
|
|
|
|
if (getOperand(i) == From)
|
|
|
|
setOperand(i, ToC);
|
|
|
|
}
|
|
|
|
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-27 22:29:26 +00:00
|
|
|
assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
|
|
|
|
Constant *ToC = cast<Constant>(To);
|
|
|
|
|
|
|
|
unsigned OperandToUpdate = U-OperandList;
|
|
|
|
assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
|
|
|
|
|
2009-09-15 15:58:07 +00:00
|
|
|
std::pair<LLVMContextImpl::StructConstantsTy::MapKey, ConstantStruct*> Lookup;
|
2010-07-17 06:13:52 +00:00
|
|
|
Lookup.first.first = cast<StructType>(getRawType());
|
2009-07-27 22:29:26 +00:00
|
|
|
Lookup.second = this;
|
|
|
|
std::vector<Constant*> &Values = Lookup.first.second;
|
|
|
|
Values.reserve(getNumOperands()); // Build replacement struct.
|
|
|
|
|
|
|
|
|
|
|
|
// Fill values with the modified operands of the constant struct. Also,
|
|
|
|
// compute whether this turns into an all-zeros struct.
|
|
|
|
bool isAllZeros = false;
|
|
|
|
if (!ToC->isNullValue()) {
|
|
|
|
for (Use *O = OperandList, *E = OperandList + getNumOperands(); O != E; ++O)
|
|
|
|
Values.push_back(cast<Constant>(O->get()));
|
|
|
|
} else {
|
|
|
|
isAllZeros = true;
|
|
|
|
for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
|
|
|
|
Constant *Val = cast<Constant>(O->get());
|
|
|
|
Values.push_back(Val);
|
|
|
|
if (isAllZeros) isAllZeros = Val->isNullValue();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Values[OperandToUpdate] = ToC;
|
|
|
|
|
2010-07-17 06:13:52 +00:00
|
|
|
LLVMContextImpl *pImpl = getRawType()->getContext().pImpl;
|
2009-07-27 22:29:26 +00:00
|
|
|
|
|
|
|
Constant *Replacement = 0;
|
|
|
|
if (isAllZeros) {
|
2010-07-17 06:13:52 +00:00
|
|
|
Replacement = ConstantAggregateZero::get(getRawType());
|
2009-07-27 22:29:26 +00:00
|
|
|
} else {
|
2010-07-17 06:13:52 +00:00
|
|
|
// Check to see if we have this struct type already.
|
2009-07-27 22:29:26 +00:00
|
|
|
bool Exists;
|
|
|
|
LLVMContextImpl::StructConstantsTy::MapTy::iterator I =
|
|
|
|
pImpl->StructConstants.InsertOrGetItem(Lookup, Exists);
|
|
|
|
|
|
|
|
if (Exists) {
|
2009-09-03 01:39:20 +00:00
|
|
|
Replacement = I->second;
|
2009-07-27 22:29:26 +00:00
|
|
|
} else {
|
|
|
|
// Okay, the new shape doesn't exist in the system yet. Instead of
|
|
|
|
// creating a new constant struct, inserting it, replaceallusesof'ing the
|
|
|
|
// old with the new, then deleting the old... just update the current one
|
|
|
|
// in place!
|
|
|
|
pImpl->StructConstants.MoveConstantToNewSlot(this, I);
|
|
|
|
|
|
|
|
// Update to the new value.
|
|
|
|
setOperand(OperandToUpdate, ToC);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(Replacement != this && "I didn't contain From!");
|
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);
|
|
|
|
}
|
|
|
|
|
2010-07-17 06:13:52 +00:00
|
|
|
Constant *Replacement = get(cast<VectorType>(getRawType()), 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,
|
2011-02-11 05:37:21 +00:00
|
|
|
&Indices[0], Indices.size(),
|
|
|
|
cast<GEPOperator>(this)->isInBounds());
|
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!");
|
2010-07-17 06:13:52 +00:00
|
|
|
Replacement = ConstantExpr::getCast(getOpcode(), To, getRawType());
|
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;
|
2009-12-29 02:14:09 +00:00
|
|
|
Replacement = ConstantExpr::get(getOpcode(), C1, C2, SubclassOptionalData);
|
2005-10-03 21:58:36 +00:00
|
|
|
} 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
|
|
|
}
|