2009-09-10 23:07:18 +00:00
|
|
|
//===-- ConstantFolding.cpp - Fold instructions into constants ------------===//
|
2005-10-27 16:00:10 +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-10-27 16:00:10 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2009-09-10 23:07:18 +00:00
|
|
|
// This file defines routines for folding instructions into constants.
|
|
|
|
//
|
|
|
|
// Also, to supplement the basic VMCore ConstantExpr simplifications,
|
|
|
|
// this file defines some additional folding routines that can make use of
|
|
|
|
// TargetData information. These functions cannot go in VMCore due to library
|
|
|
|
// dependency issues.
|
2005-10-27 16:00:10 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Analysis/ConstantFolding.h"
|
|
|
|
#include "llvm/Constants.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
2007-01-30 23:45:45 +00:00
|
|
|
#include "llvm/Function.h"
|
2009-05-07 19:46:24 +00:00
|
|
|
#include "llvm/GlobalVariable.h"
|
2005-10-27 16:00:10 +00:00
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/Intrinsics.h"
|
2009-07-06 18:42:36 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
2007-01-30 23:45:45 +00:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2007-08-08 06:55:43 +00:00
|
|
|
#include "llvm/ADT/StringMap.h"
|
2007-01-31 00:51:48 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2009-07-11 20:10:48 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2005-10-27 16:00:10 +00:00
|
|
|
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
|
|
|
#include "llvm/Support/MathExtras.h"
|
|
|
|
#include <cerrno>
|
2006-12-02 02:22:01 +00:00
|
|
|
#include <cmath>
|
2005-10-27 16:00:10 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2007-01-31 00:51:48 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Constant Folding internal helper functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// IsConstantOffsetFromGlobal - If this constant is actually a constant offset
|
|
|
|
/// from a global, return the global and the constant. Because of
|
|
|
|
/// constantexprs, this function is recursive.
|
|
|
|
static bool IsConstantOffsetFromGlobal(Constant *C, GlobalValue *&GV,
|
|
|
|
int64_t &Offset, const TargetData &TD) {
|
|
|
|
// Trivial case, constant is the global.
|
|
|
|
if ((GV = dyn_cast<GlobalValue>(C))) {
|
|
|
|
Offset = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, if this isn't a constant expr, bail out.
|
|
|
|
ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
|
|
|
|
if (!CE) return false;
|
|
|
|
|
|
|
|
// Look through ptr->int and ptr->ptr casts.
|
|
|
|
if (CE->getOpcode() == Instruction::PtrToInt ||
|
|
|
|
CE->getOpcode() == Instruction::BitCast)
|
|
|
|
return IsConstantOffsetFromGlobal(CE->getOperand(0), GV, Offset, TD);
|
|
|
|
|
|
|
|
// i32* getelementptr ([5 x i32]* @a, i32 0, i32 5)
|
|
|
|
if (CE->getOpcode() == Instruction::GetElementPtr) {
|
|
|
|
// Cannot compute this if the element type of the pointer is missing size
|
|
|
|
// info.
|
2007-12-10 22:53:04 +00:00
|
|
|
if (!cast<PointerType>(CE->getOperand(0)->getType())
|
|
|
|
->getElementType()->isSized())
|
2007-01-31 00:51:48 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// If the base isn't a global+constant, we aren't either.
|
|
|
|
if (!IsConstantOffsetFromGlobal(CE->getOperand(0), GV, Offset, TD))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Otherwise, add any offset that our operands provide.
|
|
|
|
gep_type_iterator GTI = gep_type_begin(CE);
|
2008-05-22 06:43:33 +00:00
|
|
|
for (User::const_op_iterator i = CE->op_begin() + 1, e = CE->op_end();
|
2008-05-22 19:24:54 +00:00
|
|
|
i != e; ++i, ++GTI) {
|
2008-05-22 06:43:33 +00:00
|
|
|
ConstantInt *CI = dyn_cast<ConstantInt>(*i);
|
2007-01-31 00:51:48 +00:00
|
|
|
if (!CI) return false; // Index isn't a simple constant?
|
|
|
|
if (CI->getZExtValue() == 0) continue; // Not adding anything.
|
|
|
|
|
|
|
|
if (const StructType *ST = dyn_cast<StructType>(*GTI)) {
|
|
|
|
// N = N + Offset
|
2007-02-10 19:55:17 +00:00
|
|
|
Offset += TD.getStructLayout(ST)->getElementOffset(CI->getZExtValue());
|
2007-01-31 00:51:48 +00:00
|
|
|
} else {
|
2007-03-05 00:00:42 +00:00
|
|
|
const SequentialType *SQT = cast<SequentialType>(*GTI);
|
2009-05-09 07:06:46 +00:00
|
|
|
Offset += TD.getTypeAllocSize(SQT->getElementType())*CI->getSExtValue();
|
2007-01-31 00:51:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// SymbolicallyEvaluateBinop - One of Op0/Op1 is a constant expression.
|
2008-12-15 01:35:36 +00:00
|
|
|
/// Attempt to symbolically evaluate the result of a binary operator merging
|
2007-01-31 00:51:48 +00:00
|
|
|
/// these together. If target data info is available, it is provided as TD,
|
|
|
|
/// otherwise TD is null.
|
|
|
|
static Constant *SymbolicallyEvaluateBinop(unsigned Opc, Constant *Op0,
|
2009-07-06 18:42:36 +00:00
|
|
|
Constant *Op1, const TargetData *TD,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context){
|
2007-01-31 00:51:48 +00:00
|
|
|
// SROA
|
|
|
|
|
|
|
|
// Fold (and 0xffffffff00000000, (shl x, 32)) -> shl.
|
|
|
|
// Fold (lshr (or X, Y), 32) -> (lshr [X/Y], 32) if one doesn't contribute
|
|
|
|
// bits.
|
|
|
|
|
|
|
|
|
|
|
|
// If the constant expr is something like &A[123] - &A[4].f, fold this into a
|
|
|
|
// constant. This happens frequently when iterating over a global array.
|
|
|
|
if (Opc == Instruction::Sub && TD) {
|
|
|
|
GlobalValue *GV1, *GV2;
|
|
|
|
int64_t Offs1, Offs2;
|
|
|
|
|
|
|
|
if (IsConstantOffsetFromGlobal(Op0, GV1, Offs1, *TD))
|
|
|
|
if (IsConstantOffsetFromGlobal(Op1, GV2, Offs2, *TD) &&
|
|
|
|
GV1 == GV2) {
|
|
|
|
// (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow.
|
2009-07-24 23:12:02 +00:00
|
|
|
return ConstantInt::get(Op0->getType(), Offs1-Offs2);
|
2007-01-31 00:51:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// SymbolicallyEvaluateGEP - If we can symbolically evaluate the specified GEP
|
|
|
|
/// constant expression, do so.
|
2007-12-10 22:53:04 +00:00
|
|
|
static Constant *SymbolicallyEvaluateGEP(Constant* const* Ops, unsigned NumOps,
|
2007-01-31 00:51:48 +00:00
|
|
|
const Type *ResultTy,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context,
|
2007-01-31 00:51:48 +00:00
|
|
|
const TargetData *TD) {
|
|
|
|
Constant *Ptr = Ops[0];
|
2008-05-08 04:54:43 +00:00
|
|
|
if (!TD || !cast<PointerType>(Ptr->getType())->getElementType()->isSized())
|
2007-01-31 00:51:48 +00:00
|
|
|
return 0;
|
2009-08-21 16:52:54 +00:00
|
|
|
|
|
|
|
unsigned BitWidth = TD->getTypeSizeInBits(TD->getIntPtrType(Context));
|
|
|
|
APInt BasePtr(BitWidth, 0);
|
2009-08-19 18:18:36 +00:00
|
|
|
bool BaseIsInt = true;
|
2008-05-08 04:54:43 +00:00
|
|
|
if (!Ptr->isNullValue()) {
|
|
|
|
// If this is a inttoptr from a constant int, we can fold this as the base,
|
|
|
|
// otherwise we can't.
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
|
|
|
|
if (CE->getOpcode() == Instruction::IntToPtr)
|
2009-08-21 18:27:26 +00:00
|
|
|
if (ConstantInt *Base = dyn_cast<ConstantInt>(CE->getOperand(0))) {
|
2009-08-21 16:52:54 +00:00
|
|
|
BasePtr = Base->getValue();
|
2009-08-21 18:27:26 +00:00
|
|
|
BasePtr.zextOrTrunc(BitWidth);
|
|
|
|
}
|
2008-05-08 04:54:43 +00:00
|
|
|
|
|
|
|
if (BasePtr == 0)
|
2009-08-19 18:18:36 +00:00
|
|
|
BaseIsInt = false;
|
2007-01-31 00:51:48 +00:00
|
|
|
}
|
2008-05-08 04:54:43 +00:00
|
|
|
|
|
|
|
// If this is a constant expr gep that is effectively computing an
|
|
|
|
// "offsetof", fold it into 'cast int Size to T*' instead of 'gep 0, 0, 12'
|
|
|
|
for (unsigned i = 1; i != NumOps; ++i)
|
|
|
|
if (!isa<ConstantInt>(Ops[i]))
|
2009-08-19 18:18:36 +00:00
|
|
|
return 0;
|
2008-05-08 04:54:43 +00:00
|
|
|
|
2009-08-21 16:52:54 +00:00
|
|
|
APInt Offset = APInt(BitWidth,
|
|
|
|
TD->getIndexedOffset(Ptr->getType(),
|
|
|
|
(Value**)Ops+1, NumOps-1));
|
2009-08-19 18:18:36 +00:00
|
|
|
// If the base value for this address is a literal integer value, fold the
|
|
|
|
// getelementptr to the resulting integer value casted to the pointer type.
|
|
|
|
if (BaseIsInt) {
|
2009-08-21 16:52:54 +00:00
|
|
|
Constant *C = ConstantInt::get(Context, Offset+BasePtr);
|
2009-08-19 18:18:36 +00:00
|
|
|
return ConstantExpr::getIntToPtr(C, ResultTy);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise form a regular getelementptr. Recompute the indices so that
|
|
|
|
// we eliminate over-indexing of the notional static type array bounds.
|
|
|
|
// This makes it easy to determine if the getelementptr is "inbounds".
|
|
|
|
// Also, this helps GlobalOpt do SROA on GlobalVariables.
|
|
|
|
const Type *Ty = Ptr->getType();
|
|
|
|
SmallVector<Constant*, 32> NewIdxs;
|
2009-08-19 22:46:59 +00:00
|
|
|
do {
|
2009-08-19 18:18:36 +00:00
|
|
|
if (const SequentialType *ATy = dyn_cast<SequentialType>(Ty)) {
|
2009-08-19 22:46:59 +00:00
|
|
|
// The only pointer indexing we'll do is on the first index of the GEP.
|
2009-09-02 05:35:45 +00:00
|
|
|
if (isa<PointerType>(ATy) && !NewIdxs.empty())
|
2009-08-19 22:46:59 +00:00
|
|
|
break;
|
2009-08-19 18:18:36 +00:00
|
|
|
// Determine which element of the array the offset points into.
|
2009-08-21 16:52:54 +00:00
|
|
|
APInt ElemSize(BitWidth, TD->getTypeAllocSize(ATy->getElementType()));
|
2009-08-19 18:18:36 +00:00
|
|
|
if (ElemSize == 0)
|
|
|
|
return 0;
|
2009-08-21 16:52:54 +00:00
|
|
|
APInt NewIdx = Offset.udiv(ElemSize);
|
2009-08-19 18:18:36 +00:00
|
|
|
Offset -= NewIdx * ElemSize;
|
|
|
|
NewIdxs.push_back(ConstantInt::get(TD->getIntPtrType(Context), NewIdx));
|
|
|
|
Ty = ATy->getElementType();
|
|
|
|
} else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
|
2009-08-21 16:52:54 +00:00
|
|
|
// Determine which field of the struct the offset points into. The
|
|
|
|
// getZExtValue is at least as safe as the StructLayout API because we
|
|
|
|
// know the offset is within the struct at this point.
|
2009-08-19 18:18:36 +00:00
|
|
|
const StructLayout &SL = *TD->getStructLayout(STy);
|
2009-08-21 16:52:54 +00:00
|
|
|
unsigned ElIdx = SL.getElementContainingOffset(Offset.getZExtValue());
|
2009-08-19 18:18:36 +00:00
|
|
|
NewIdxs.push_back(ConstantInt::get(Type::getInt32Ty(Context), ElIdx));
|
2009-08-21 16:52:54 +00:00
|
|
|
Offset -= APInt(BitWidth, SL.getElementOffset(ElIdx));
|
2009-08-19 18:18:36 +00:00
|
|
|
Ty = STy->getTypeAtIndex(ElIdx);
|
|
|
|
} else {
|
2009-08-19 22:46:59 +00:00
|
|
|
// We've reached some non-indexable type.
|
|
|
|
break;
|
2009-08-19 18:18:36 +00:00
|
|
|
}
|
2009-08-19 22:46:59 +00:00
|
|
|
} while (Ty != cast<PointerType>(ResultTy)->getElementType());
|
|
|
|
|
|
|
|
// If we haven't used up the entire offset by descending the static
|
|
|
|
// type, then the offset is pointing into the middle of an indivisible
|
|
|
|
// member, so we can't simplify it.
|
|
|
|
if (Offset != 0)
|
|
|
|
return 0;
|
2009-08-19 18:18:36 +00:00
|
|
|
|
2009-09-11 00:04:14 +00:00
|
|
|
// Create a GEP.
|
|
|
|
Constant *C =
|
2009-09-03 23:34:49 +00:00
|
|
|
ConstantExpr::getGetElementPtr(Ptr, &NewIdxs[0], NewIdxs.size());
|
|
|
|
assert(cast<PointerType>(C->getType())->getElementType() == Ty &&
|
|
|
|
"Computed GetElementPtr has unexpected type!");
|
2009-08-19 22:46:59 +00:00
|
|
|
|
|
|
|
// If we ended up indexing a member with a type that doesn't match
|
2009-08-20 16:42:55 +00:00
|
|
|
// the type of what the original indices indexed, add a cast.
|
2009-08-19 22:46:59 +00:00
|
|
|
if (Ty != cast<PointerType>(ResultTy)->getElementType())
|
|
|
|
C = ConstantExpr::getBitCast(C, ResultTy);
|
2009-08-19 18:18:36 +00:00
|
|
|
|
2009-08-19 22:46:59 +00:00
|
|
|
return C;
|
2007-01-31 00:51:48 +00:00
|
|
|
}
|
|
|
|
|
2007-12-11 07:29:44 +00:00
|
|
|
/// FoldBitCast - Constant fold bitcast, symbolically evaluating it with
|
|
|
|
/// targetdata. Return 0 if unfoldable.
|
|
|
|
static Constant *FoldBitCast(Constant *C, const Type *DestTy,
|
2009-07-22 00:24:57 +00:00
|
|
|
const TargetData &TD, LLVMContext &Context) {
|
2007-12-11 07:29:44 +00:00
|
|
|
// If this is a bitcast from constant vector -> vector, fold it.
|
|
|
|
if (ConstantVector *CV = dyn_cast<ConstantVector>(C)) {
|
|
|
|
if (const VectorType *DestVTy = dyn_cast<VectorType>(DestTy)) {
|
|
|
|
// If the element types match, VMCore can fold it.
|
|
|
|
unsigned NumDstElt = DestVTy->getNumElements();
|
|
|
|
unsigned NumSrcElt = CV->getNumOperands();
|
|
|
|
if (NumDstElt == NumSrcElt)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
const Type *SrcEltTy = CV->getType()->getElementType();
|
|
|
|
const Type *DstEltTy = DestVTy->getElementType();
|
|
|
|
|
|
|
|
// Otherwise, we're changing the number of elements in a vector, which
|
|
|
|
// requires endianness information to do the right thing. For example,
|
|
|
|
// bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
|
|
|
|
// folds to (little endian):
|
|
|
|
// <4 x i32> <i32 0, i32 0, i32 1, i32 0>
|
|
|
|
// and to (big endian):
|
|
|
|
// <4 x i32> <i32 0, i32 0, i32 0, i32 1>
|
|
|
|
|
|
|
|
// First thing is first. We only want to think about integer here, so if
|
|
|
|
// we have something in FP form, recast it as integer.
|
|
|
|
if (DstEltTy->isFloatingPoint()) {
|
|
|
|
// Fold to an vector of integers with same size as our FP type.
|
|
|
|
unsigned FPWidth = DstEltTy->getPrimitiveSizeInBits();
|
2009-07-29 22:17:13 +00:00
|
|
|
const Type *DestIVTy = VectorType::get(
|
2009-08-13 21:58:54 +00:00
|
|
|
IntegerType::get(Context, FPWidth), NumDstElt);
|
2007-12-11 07:29:44 +00:00
|
|
|
// Recursively handle this integer conversion, if possible.
|
2009-07-06 18:42:36 +00:00
|
|
|
C = FoldBitCast(C, DestIVTy, TD, Context);
|
2007-12-11 07:29:44 +00:00
|
|
|
if (!C) return 0;
|
|
|
|
|
|
|
|
// Finally, VMCore can handle this now that #elts line up.
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getBitCast(C, DestTy);
|
2007-12-11 07:29:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, we know the destination is integer, if the input is FP, convert
|
|
|
|
// it to integer first.
|
|
|
|
if (SrcEltTy->isFloatingPoint()) {
|
|
|
|
unsigned FPWidth = SrcEltTy->getPrimitiveSizeInBits();
|
2009-07-29 22:17:13 +00:00
|
|
|
const Type *SrcIVTy = VectorType::get(
|
2009-08-13 21:58:54 +00:00
|
|
|
IntegerType::get(Context, FPWidth), NumSrcElt);
|
2007-12-11 07:29:44 +00:00
|
|
|
// Ask VMCore to do the conversion now that #elts line up.
|
2009-07-29 18:55:55 +00:00
|
|
|
C = ConstantExpr::getBitCast(C, SrcIVTy);
|
2007-12-11 07:29:44 +00:00
|
|
|
CV = dyn_cast<ConstantVector>(C);
|
|
|
|
if (!CV) return 0; // If VMCore wasn't able to fold it, bail out.
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now we know that the input and output vectors are both integer vectors
|
|
|
|
// of the same size, and that their #elements is not the same. Do the
|
|
|
|
// conversion here, which depends on whether the input or output has
|
|
|
|
// more elements.
|
|
|
|
bool isLittleEndian = TD.isLittleEndian();
|
|
|
|
|
|
|
|
SmallVector<Constant*, 32> Result;
|
|
|
|
if (NumDstElt < NumSrcElt) {
|
|
|
|
// Handle: bitcast (<4 x i32> <i32 0, i32 1, i32 2, i32 3> to <2 x i64>)
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant *Zero = Constant::getNullValue(DstEltTy);
|
2007-12-11 07:29:44 +00:00
|
|
|
unsigned Ratio = NumSrcElt/NumDstElt;
|
|
|
|
unsigned SrcBitSize = SrcEltTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned SrcElt = 0;
|
|
|
|
for (unsigned i = 0; i != NumDstElt; ++i) {
|
|
|
|
// Build each element of the result.
|
|
|
|
Constant *Elt = Zero;
|
|
|
|
unsigned ShiftAmt = isLittleEndian ? 0 : SrcBitSize*(Ratio-1);
|
|
|
|
for (unsigned j = 0; j != Ratio; ++j) {
|
|
|
|
Constant *Src = dyn_cast<ConstantInt>(CV->getOperand(SrcElt++));
|
|
|
|
if (!Src) return 0; // Reject constantexpr elements.
|
|
|
|
|
|
|
|
// Zero extend the element to the right size.
|
2009-07-29 18:55:55 +00:00
|
|
|
Src = ConstantExpr::getZExt(Src, Elt->getType());
|
2007-12-11 07:29:44 +00:00
|
|
|
|
|
|
|
// Shift it to the right place, depending on endianness.
|
2009-07-29 18:55:55 +00:00
|
|
|
Src = ConstantExpr::getShl(Src,
|
2009-07-24 23:12:02 +00:00
|
|
|
ConstantInt::get(Src->getType(), ShiftAmt));
|
2007-12-11 07:29:44 +00:00
|
|
|
ShiftAmt += isLittleEndian ? SrcBitSize : -SrcBitSize;
|
|
|
|
|
|
|
|
// Mix it in.
|
2009-07-29 18:55:55 +00:00
|
|
|
Elt = ConstantExpr::getOr(Elt, Src);
|
2007-12-11 07:29:44 +00:00
|
|
|
}
|
|
|
|
Result.push_back(Elt);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Handle: bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
|
|
|
|
unsigned Ratio = NumDstElt/NumSrcElt;
|
|
|
|
unsigned DstBitSize = DstEltTy->getPrimitiveSizeInBits();
|
|
|
|
|
|
|
|
// Loop over each source value, expanding into multiple results.
|
|
|
|
for (unsigned i = 0; i != NumSrcElt; ++i) {
|
|
|
|
Constant *Src = dyn_cast<ConstantInt>(CV->getOperand(i));
|
|
|
|
if (!Src) return 0; // Reject constantexpr elements.
|
|
|
|
|
|
|
|
unsigned ShiftAmt = isLittleEndian ? 0 : DstBitSize*(Ratio-1);
|
|
|
|
for (unsigned j = 0; j != Ratio; ++j) {
|
|
|
|
// Shift the piece of the value into the right place, depending on
|
|
|
|
// endianness.
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *Elt = ConstantExpr::getLShr(Src,
|
2009-07-24 23:12:02 +00:00
|
|
|
ConstantInt::get(Src->getType(), ShiftAmt));
|
2007-12-11 07:29:44 +00:00
|
|
|
ShiftAmt += isLittleEndian ? DstBitSize : -DstBitSize;
|
|
|
|
|
|
|
|
// Truncate and remember this piece.
|
2009-07-29 18:55:55 +00:00
|
|
|
Result.push_back(ConstantExpr::getTrunc(Elt, DstEltTy));
|
2007-12-11 07:29:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-28 21:19:26 +00:00
|
|
|
return ConstantVector::get(Result.data(), Result.size());
|
2007-12-11 07:29:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-01-31 00:51:48 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Constant Folding public APIs
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
|
2007-01-30 23:45:45 +00:00
|
|
|
/// ConstantFoldInstruction - Attempt to constant fold the specified
|
|
|
|
/// instruction. If successful, the constant result is returned, if not, null
|
|
|
|
/// is returned. Note that this function can only fail when attempting to fold
|
|
|
|
/// instructions like loads and stores, which have no constant expression form.
|
|
|
|
///
|
2009-07-22 00:24:57 +00:00
|
|
|
Constant *llvm::ConstantFoldInstruction(Instruction *I, LLVMContext &Context,
|
2009-07-06 18:42:36 +00:00
|
|
|
const TargetData *TD) {
|
2007-01-30 23:45:45 +00:00
|
|
|
if (PHINode *PN = dyn_cast<PHINode>(I)) {
|
|
|
|
if (PN->getNumIncomingValues() == 0)
|
2009-07-30 23:03:37 +00:00
|
|
|
return UndefValue::get(PN->getType());
|
2007-01-30 23:45:45 +00:00
|
|
|
|
|
|
|
Constant *Result = dyn_cast<Constant>(PN->getIncomingValue(0));
|
|
|
|
if (Result == 0) return 0;
|
|
|
|
|
|
|
|
// Handle PHI nodes specially here...
|
|
|
|
for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i)
|
|
|
|
if (PN->getIncomingValue(i) != Result && PN->getIncomingValue(i) != PN)
|
|
|
|
return 0; // Not all the same incoming constants...
|
|
|
|
|
|
|
|
// If we reach here, all incoming values are the same constant.
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scan the operand list, checking to see if they are all constants, if so,
|
|
|
|
// hand off to ConstantFoldInstOperands.
|
|
|
|
SmallVector<Constant*, 8> Ops;
|
2008-05-22 06:43:33 +00:00
|
|
|
for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i)
|
|
|
|
if (Constant *Op = dyn_cast<Constant>(*i))
|
2007-01-30 23:45:45 +00:00
|
|
|
Ops.push_back(Op);
|
|
|
|
else
|
|
|
|
return 0; // All operands not constant!
|
|
|
|
|
2007-12-10 22:53:04 +00:00
|
|
|
if (const CmpInst *CI = dyn_cast<CmpInst>(I))
|
|
|
|
return ConstantFoldCompareInstOperands(CI->getPredicate(),
|
2009-07-06 18:42:36 +00:00
|
|
|
Ops.data(), Ops.size(),
|
|
|
|
Context, TD);
|
2009-09-16 00:08:07 +00:00
|
|
|
|
|
|
|
return ConstantFoldInstOperands(I->getOpcode(), I->getType(),
|
|
|
|
Ops.data(), Ops.size(), Context, TD);
|
2007-01-30 23:45:45 +00:00
|
|
|
}
|
|
|
|
|
2008-05-25 20:56:15 +00:00
|
|
|
/// ConstantFoldConstantExpression - Attempt to fold the constant expression
|
|
|
|
/// using the specified TargetData. If successful, the constant result is
|
|
|
|
/// result is returned, if not, null is returned.
|
|
|
|
Constant *llvm::ConstantFoldConstantExpression(ConstantExpr *CE,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context,
|
2008-05-25 20:56:15 +00:00
|
|
|
const TargetData *TD) {
|
|
|
|
SmallVector<Constant*, 8> Ops;
|
|
|
|
for (User::op_iterator i = CE->op_begin(), e = CE->op_end(); i != e; ++i)
|
|
|
|
Ops.push_back(cast<Constant>(*i));
|
|
|
|
|
|
|
|
if (CE->isCompare())
|
|
|
|
return ConstantFoldCompareInstOperands(CE->getPredicate(),
|
2009-07-06 18:42:36 +00:00
|
|
|
Ops.data(), Ops.size(),
|
|
|
|
Context, TD);
|
2009-09-16 00:08:07 +00:00
|
|
|
return ConstantFoldInstOperands(CE->getOpcode(), CE->getType(),
|
|
|
|
Ops.data(), Ops.size(), Context, TD);
|
2008-05-25 20:56:15 +00:00
|
|
|
}
|
|
|
|
|
2007-01-30 23:45:45 +00:00
|
|
|
/// ConstantFoldInstOperands - Attempt to constant fold an instruction with the
|
|
|
|
/// specified opcode and operands. If successful, the constant result is
|
|
|
|
/// returned, if not, null is returned. Note that this function can fail when
|
|
|
|
/// attempting to fold instructions like loads and stores, which have no
|
|
|
|
/// constant expression form.
|
|
|
|
///
|
2007-12-10 22:53:04 +00:00
|
|
|
Constant *llvm::ConstantFoldInstOperands(unsigned Opcode, const Type *DestTy,
|
|
|
|
Constant* const* Ops, unsigned NumOps,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context,
|
2007-01-30 23:45:45 +00:00
|
|
|
const TargetData *TD) {
|
2007-01-31 00:51:48 +00:00
|
|
|
// Handle easy binops first.
|
2007-12-10 22:53:04 +00:00
|
|
|
if (Instruction::isBinaryOp(Opcode)) {
|
2007-01-31 00:51:48 +00:00
|
|
|
if (isa<ConstantExpr>(Ops[0]) || isa<ConstantExpr>(Ops[1]))
|
2009-07-06 18:42:36 +00:00
|
|
|
if (Constant *C = SymbolicallyEvaluateBinop(Opcode, Ops[0], Ops[1], TD,
|
|
|
|
Context))
|
2007-01-31 00:51:48 +00:00
|
|
|
return C;
|
|
|
|
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::get(Opcode, Ops[0], Ops[1]);
|
2007-01-31 00:51:48 +00:00
|
|
|
}
|
2007-01-30 23:45:45 +00:00
|
|
|
|
2007-12-10 22:53:04 +00:00
|
|
|
switch (Opcode) {
|
2007-01-30 23:45:45 +00:00
|
|
|
default: return 0;
|
|
|
|
case Instruction::Call:
|
|
|
|
if (Function *F = dyn_cast<Function>(Ops[0]))
|
|
|
|
if (canConstantFoldCallTo(F))
|
2007-01-31 18:04:55 +00:00
|
|
|
return ConstantFoldCall(F, Ops+1, NumOps-1);
|
2007-01-30 23:45:45 +00:00
|
|
|
return 0;
|
|
|
|
case Instruction::ICmp:
|
|
|
|
case Instruction::FCmp:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("This function is invalid for compares: no predicate specified");
|
2007-08-11 23:49:01 +00:00
|
|
|
case Instruction::PtrToInt:
|
|
|
|
// If the input is a inttoptr, eliminate the pair. This requires knowing
|
|
|
|
// the width of a pointer, so it can't be done in ConstantExpr::getCast.
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ops[0])) {
|
|
|
|
if (TD && CE->getOpcode() == Instruction::IntToPtr) {
|
|
|
|
Constant *Input = CE->getOperand(0);
|
2009-06-15 22:12:54 +00:00
|
|
|
unsigned InWidth = Input->getType()->getScalarSizeInBits();
|
2008-10-24 06:14:27 +00:00
|
|
|
if (TD->getPointerSizeInBits() < InWidth) {
|
|
|
|
Constant *Mask =
|
2009-07-24 23:12:02 +00:00
|
|
|
ConstantInt::get(Context, APInt::getLowBitsSet(InWidth,
|
2008-10-24 06:14:27 +00:00
|
|
|
TD->getPointerSizeInBits()));
|
2009-07-29 18:55:55 +00:00
|
|
|
Input = ConstantExpr::getAnd(Input, Mask);
|
2008-10-24 06:14:27 +00:00
|
|
|
}
|
2007-08-11 23:49:01 +00:00
|
|
|
// Do a zext or trunc to get to the dest size.
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getIntegerCast(Input, DestTy, false);
|
2007-08-11 23:49:01 +00:00
|
|
|
}
|
|
|
|
}
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getCast(Opcode, Ops[0], DestTy);
|
2007-08-11 23:49:01 +00:00
|
|
|
case Instruction::IntToPtr:
|
2008-08-13 20:20:35 +00:00
|
|
|
// If the input is a ptrtoint, turn the pair into a ptr to ptr bitcast if
|
|
|
|
// the int size is >= the ptr size. This requires knowing the width of a
|
|
|
|
// pointer, so it can't be done in ConstantExpr::getCast.
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ops[0])) {
|
2009-05-07 19:46:24 +00:00
|
|
|
if (TD &&
|
2008-08-13 20:20:35 +00:00
|
|
|
TD->getPointerSizeInBits() <=
|
2009-06-15 22:12:54 +00:00
|
|
|
CE->getType()->getScalarSizeInBits()) {
|
2009-05-07 19:46:24 +00:00
|
|
|
if (CE->getOpcode() == Instruction::PtrToInt) {
|
|
|
|
Constant *Input = CE->getOperand(0);
|
2009-07-06 18:42:36 +00:00
|
|
|
Constant *C = FoldBitCast(Input, DestTy, *TD, Context);
|
2009-07-29 18:55:55 +00:00
|
|
|
return C ? C : ConstantExpr::getBitCast(Input, DestTy);
|
2009-05-07 19:46:24 +00:00
|
|
|
}
|
|
|
|
// If there's a constant offset added to the integer value before
|
|
|
|
// it is casted back to a pointer, see if the expression can be
|
|
|
|
// converted into a GEP.
|
|
|
|
if (CE->getOpcode() == Instruction::Add)
|
|
|
|
if (ConstantInt *L = dyn_cast<ConstantInt>(CE->getOperand(0)))
|
|
|
|
if (ConstantExpr *R = dyn_cast<ConstantExpr>(CE->getOperand(1)))
|
|
|
|
if (R->getOpcode() == Instruction::PtrToInt)
|
|
|
|
if (GlobalVariable *GV =
|
|
|
|
dyn_cast<GlobalVariable>(R->getOperand(0))) {
|
|
|
|
const PointerType *GVTy = cast<PointerType>(GV->getType());
|
|
|
|
if (const ArrayType *AT =
|
|
|
|
dyn_cast<ArrayType>(GVTy->getElementType())) {
|
|
|
|
const Type *ElTy = AT->getElementType();
|
2009-05-09 07:06:46 +00:00
|
|
|
uint64_t AllocSize = TD->getTypeAllocSize(ElTy);
|
|
|
|
APInt PSA(L->getValue().getBitWidth(), AllocSize);
|
2009-05-07 19:46:24 +00:00
|
|
|
if (ElTy == cast<PointerType>(DestTy)->getElementType() &&
|
|
|
|
L->getValue().urem(PSA) == 0) {
|
|
|
|
APInt ElemIdx = L->getValue().udiv(PSA);
|
|
|
|
if (ElemIdx.ult(APInt(ElemIdx.getBitWidth(),
|
|
|
|
AT->getNumElements()))) {
|
|
|
|
Constant *Index[] = {
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant::getNullValue(CE->getType()),
|
2009-07-24 23:12:02 +00:00
|
|
|
ConstantInt::get(Context, ElemIdx)
|
2009-05-07 19:46:24 +00:00
|
|
|
};
|
2009-07-06 18:42:36 +00:00
|
|
|
return
|
2009-07-29 18:55:55 +00:00
|
|
|
ConstantExpr::getGetElementPtr(GV, &Index[0], 2);
|
2009-05-07 19:46:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2008-08-13 20:20:35 +00:00
|
|
|
}
|
|
|
|
}
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getCast(Opcode, Ops[0], DestTy);
|
2007-01-30 23:45:45 +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:
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getCast(Opcode, Ops[0], DestTy);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::BitCast:
|
2007-12-11 07:29:44 +00:00
|
|
|
if (TD)
|
2009-07-06 18:42:36 +00:00
|
|
|
if (Constant *C = FoldBitCast(Ops[0], DestTy, *TD, Context))
|
2007-12-11 07:29:44 +00:00
|
|
|
return C;
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getBitCast(Ops[0], DestTy);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::Select:
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::ExtractElement:
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::InsertElement:
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::ShuffleVector:
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
|
2007-01-30 23:45:45 +00:00
|
|
|
case Instruction::GetElementPtr:
|
2009-07-06 18:42:36 +00:00
|
|
|
if (Constant *C = SymbolicallyEvaluateGEP(Ops, NumOps, DestTy, Context, TD))
|
2007-01-31 00:51:48 +00:00
|
|
|
return C;
|
|
|
|
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getGetElementPtr(Ops[0], Ops+1, NumOps-1);
|
2007-01-30 23:45:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-12-10 22:53:04 +00:00
|
|
|
/// ConstantFoldCompareInstOperands - Attempt to constant fold a compare
|
|
|
|
/// instruction (icmp/fcmp) with the specified operands. If it fails, it
|
|
|
|
/// returns a constant expression of the specified operands.
|
|
|
|
///
|
|
|
|
Constant *llvm::ConstantFoldCompareInstOperands(unsigned Predicate,
|
|
|
|
Constant*const * Ops,
|
|
|
|
unsigned NumOps,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context,
|
2007-12-10 22:53:04 +00:00
|
|
|
const TargetData *TD) {
|
|
|
|
// fold: icmp (inttoptr x), null -> icmp x, 0
|
|
|
|
// fold: icmp (ptrtoint x), 0 -> icmp x, null
|
2008-05-25 20:56:15 +00:00
|
|
|
// fold: icmp (inttoptr x), (inttoptr y) -> icmp trunc/zext x, trunc/zext y
|
2007-12-10 22:53:04 +00:00
|
|
|
// fold: icmp (ptrtoint x), (ptrtoint y) -> icmp x, y
|
|
|
|
//
|
|
|
|
// ConstantExpr::getCompare cannot do this, because it doesn't have TD
|
|
|
|
// around to know if bit truncation is happening.
|
|
|
|
if (ConstantExpr *CE0 = dyn_cast<ConstantExpr>(Ops[0])) {
|
|
|
|
if (TD && Ops[1]->isNullValue()) {
|
2009-08-13 21:58:54 +00:00
|
|
|
const Type *IntPtrTy = TD->getIntPtrType(Context);
|
2007-12-10 22:53:04 +00:00
|
|
|
if (CE0->getOpcode() == Instruction::IntToPtr) {
|
|
|
|
// Convert the integer value to the right size to ensure we get the
|
|
|
|
// proper extension or truncation.
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *C = ConstantExpr::getIntegerCast(CE0->getOperand(0),
|
2007-12-10 22:53:04 +00:00
|
|
|
IntPtrTy, false);
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant *NewOps[] = { C, Constant::getNullValue(C->getType()) };
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldCompareInstOperands(Predicate, NewOps, 2,
|
|
|
|
Context, TD);
|
2007-12-10 22:53:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Only do this transformation if the int is intptrty in size, otherwise
|
|
|
|
// there is a truncation or extension that we aren't modeling.
|
|
|
|
if (CE0->getOpcode() == Instruction::PtrToInt &&
|
|
|
|
CE0->getType() == IntPtrTy) {
|
|
|
|
Constant *C = CE0->getOperand(0);
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant *NewOps[] = { C, Constant::getNullValue(C->getType()) };
|
2007-12-10 22:53:04 +00:00
|
|
|
// FIXME!
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldCompareInstOperands(Predicate, NewOps, 2,
|
|
|
|
Context, TD);
|
2007-12-10 22:53:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-05-25 20:56:15 +00:00
|
|
|
if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(Ops[1])) {
|
|
|
|
if (TD && CE0->getOpcode() == CE1->getOpcode()) {
|
2009-08-13 21:58:54 +00:00
|
|
|
const Type *IntPtrTy = TD->getIntPtrType(Context);
|
2008-05-25 20:56:15 +00:00
|
|
|
|
|
|
|
if (CE0->getOpcode() == Instruction::IntToPtr) {
|
|
|
|
// Convert the integer value to the right size to ensure we get the
|
|
|
|
// proper extension or truncation.
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *C0 = ConstantExpr::getIntegerCast(CE0->getOperand(0),
|
2008-05-25 20:56:15 +00:00
|
|
|
IntPtrTy, false);
|
2009-07-29 18:55:55 +00:00
|
|
|
Constant *C1 = ConstantExpr::getIntegerCast(CE1->getOperand(0),
|
2008-05-25 20:56:15 +00:00
|
|
|
IntPtrTy, false);
|
|
|
|
Constant *NewOps[] = { C0, C1 };
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldCompareInstOperands(Predicate, NewOps, 2,
|
|
|
|
Context, TD);
|
2008-05-25 20:56:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Only do this transformation if the int is intptrty in size, otherwise
|
|
|
|
// there is a truncation or extension that we aren't modeling.
|
|
|
|
if ((CE0->getOpcode() == Instruction::PtrToInt &&
|
|
|
|
CE0->getType() == IntPtrTy &&
|
|
|
|
CE0->getOperand(0)->getType() == CE1->getOperand(0)->getType())) {
|
|
|
|
Constant *NewOps[] = {
|
|
|
|
CE0->getOperand(0), CE1->getOperand(0)
|
|
|
|
};
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldCompareInstOperands(Predicate, NewOps, 2,
|
|
|
|
Context, TD);
|
2008-05-25 20:56:15 +00:00
|
|
|
}
|
2007-12-10 22:53:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-07-29 18:55:55 +00:00
|
|
|
return ConstantExpr::getCompare(Predicate, Ops[0], Ops[1]);
|
2007-12-10 22:53:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-01-30 23:45:45 +00:00
|
|
|
/// ConstantFoldLoadThroughGEPConstantExpr - Given a constant and a
|
|
|
|
/// getelementptr constantexpr, return the constant value being addressed by the
|
|
|
|
/// constant expression, or null if something is funny and we can't decide.
|
|
|
|
Constant *llvm::ConstantFoldLoadThroughGEPConstantExpr(Constant *C,
|
2009-07-06 18:42:36 +00:00
|
|
|
ConstantExpr *CE,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context) {
|
2009-07-31 20:28:14 +00:00
|
|
|
if (CE->getOperand(1) != Constant::getNullValue(CE->getOperand(1)->getType()))
|
2007-01-30 23:45:45 +00:00
|
|
|
return 0; // Do not allow stepping over the value!
|
|
|
|
|
|
|
|
// Loop over all of the operands, tracking down which value we are
|
|
|
|
// addressing...
|
|
|
|
gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE);
|
|
|
|
for (++I; I != E; ++I)
|
|
|
|
if (const StructType *STy = dyn_cast<StructType>(*I)) {
|
|
|
|
ConstantInt *CU = cast<ConstantInt>(I.getOperand());
|
|
|
|
assert(CU->getZExtValue() < STy->getNumElements() &&
|
|
|
|
"Struct index out of range!");
|
|
|
|
unsigned El = (unsigned)CU->getZExtValue();
|
|
|
|
if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) {
|
|
|
|
C = CS->getOperand(El);
|
|
|
|
} else if (isa<ConstantAggregateZero>(C)) {
|
2009-07-31 20:28:14 +00:00
|
|
|
C = Constant::getNullValue(STy->getElementType(El));
|
2007-01-30 23:45:45 +00:00
|
|
|
} else if (isa<UndefValue>(C)) {
|
2009-07-30 23:03:37 +00:00
|
|
|
C = UndefValue::get(STy->getElementType(El));
|
2007-01-30 23:45:45 +00:00
|
|
|
} else {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
} else if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand())) {
|
|
|
|
if (const ArrayType *ATy = dyn_cast<ArrayType>(*I)) {
|
|
|
|
if (CI->getZExtValue() >= ATy->getNumElements())
|
|
|
|
return 0;
|
|
|
|
if (ConstantArray *CA = dyn_cast<ConstantArray>(C))
|
|
|
|
C = CA->getOperand(CI->getZExtValue());
|
|
|
|
else if (isa<ConstantAggregateZero>(C))
|
2009-07-31 20:28:14 +00:00
|
|
|
C = Constant::getNullValue(ATy->getElementType());
|
2007-01-30 23:45:45 +00:00
|
|
|
else if (isa<UndefValue>(C))
|
2009-07-30 23:03:37 +00:00
|
|
|
C = UndefValue::get(ATy->getElementType());
|
2007-01-30 23:45:45 +00:00
|
|
|
else
|
|
|
|
return 0;
|
2007-02-15 02:26:10 +00:00
|
|
|
} else if (const VectorType *PTy = dyn_cast<VectorType>(*I)) {
|
2007-01-30 23:45:45 +00:00
|
|
|
if (CI->getZExtValue() >= PTy->getNumElements())
|
|
|
|
return 0;
|
2007-02-15 02:26:10 +00:00
|
|
|
if (ConstantVector *CP = dyn_cast<ConstantVector>(C))
|
2007-01-30 23:45:45 +00:00
|
|
|
C = CP->getOperand(CI->getZExtValue());
|
|
|
|
else if (isa<ConstantAggregateZero>(C))
|
2009-07-31 20:28:14 +00:00
|
|
|
C = Constant::getNullValue(PTy->getElementType());
|
2007-01-30 23:45:45 +00:00
|
|
|
else if (isa<UndefValue>(C))
|
2009-07-30 23:03:37 +00:00
|
|
|
C = UndefValue::get(PTy->getElementType());
|
2007-01-30 23:45:45 +00:00
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return C;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-10-27 16:00:10 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-01-30 23:45:45 +00:00
|
|
|
// Constant Folding for Calls
|
2005-10-27 16:00:10 +00:00
|
|
|
//
|
|
|
|
|
|
|
|
/// canConstantFoldCallTo - Return true if its even possible to fold a call to
|
|
|
|
/// the specified function.
|
|
|
|
bool
|
2008-01-31 01:05:10 +00:00
|
|
|
llvm::canConstantFoldCallTo(const Function *F) {
|
2005-10-27 16:00:10 +00:00
|
|
|
switch (F->getIntrinsicID()) {
|
2007-10-02 17:43:59 +00:00
|
|
|
case Intrinsic::sqrt:
|
|
|
|
case Intrinsic::powi:
|
2007-04-01 07:35:23 +00:00
|
|
|
case Intrinsic::bswap:
|
|
|
|
case Intrinsic::ctpop:
|
|
|
|
case Intrinsic::ctlz:
|
|
|
|
case Intrinsic::cttz:
|
2005-10-27 16:00:10 +00:00
|
|
|
return true;
|
2009-10-05 05:00:35 +00:00
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
case 0: break;
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
|
|
|
|
2009-04-03 00:02:39 +00:00
|
|
|
if (!F->hasName()) return false;
|
2009-07-26 08:34:35 +00:00
|
|
|
StringRef Name = F->getName();
|
2007-08-08 06:55:43 +00:00
|
|
|
|
|
|
|
// In these cases, the check of the length is required. We don't want to
|
|
|
|
// return true for a name like "cos\0blah" which strcmp would return equal to
|
|
|
|
// "cos", but has length 8.
|
2009-07-26 08:34:35 +00:00
|
|
|
switch (Name[0]) {
|
2007-08-08 06:55:43 +00:00
|
|
|
default: return false;
|
|
|
|
case 'a':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "acos" || Name == "asin" ||
|
|
|
|
Name == "atan" || Name == "atan2";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'c':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "cos" || Name == "ceil" || Name == "cosf" || Name == "cosh";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'e':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "exp";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'f':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "fabs" || Name == "fmod" || Name == "floor";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'l':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "log" || Name == "log10";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'p':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "pow";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 's':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "sin" || Name == "sinh" || Name == "sqrt" ||
|
|
|
|
Name == "sinf" || Name == "sqrtf";
|
2007-08-08 06:55:43 +00:00
|
|
|
case 't':
|
2009-07-26 08:34:35 +00:00
|
|
|
return Name == "tan" || Name == "tanh";
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-01-30 23:15:43 +00:00
|
|
|
static Constant *ConstantFoldFP(double (*NativeFP)(double), double V,
|
2009-07-22 00:24:57 +00:00
|
|
|
const Type *Ty, LLVMContext &Context) {
|
2005-10-27 16:00:10 +00:00
|
|
|
errno = 0;
|
|
|
|
V = NativeFP(V);
|
2008-03-30 18:02:00 +00:00
|
|
|
if (errno != 0) {
|
|
|
|
errno = 0;
|
|
|
|
return 0;
|
2007-09-06 18:13:44 +00:00
|
|
|
}
|
2008-03-30 18:02:00 +00:00
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getFloatTy(Context))
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat((float)V));
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getDoubleTy(Context))
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat(V));
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Can only constant fold float/double");
|
2008-05-21 14:07:30 +00:00
|
|
|
return 0; // dummy return to suppress warning
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
|
|
|
|
2007-07-16 15:26:22 +00:00
|
|
|
static Constant *ConstantFoldBinaryFP(double (*NativeFP)(double, double),
|
|
|
|
double V, double W,
|
2009-07-06 18:42:36 +00:00
|
|
|
const Type *Ty,
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context) {
|
2007-07-16 15:26:22 +00:00
|
|
|
errno = 0;
|
|
|
|
V = NativeFP(V, W);
|
2008-03-30 18:02:00 +00:00
|
|
|
if (errno != 0) {
|
|
|
|
errno = 0;
|
|
|
|
return 0;
|
2007-09-06 18:13:44 +00:00
|
|
|
}
|
2008-03-30 18:02:00 +00:00
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getFloatTy(Context))
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat((float)V));
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty == Type::getDoubleTy(Context))
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat(V));
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Can only constant fold float/double");
|
2008-05-21 14:07:30 +00:00
|
|
|
return 0; // dummy return to suppress warning
|
2007-07-16 15:26:22 +00:00
|
|
|
}
|
|
|
|
|
2005-10-27 16:00:10 +00:00
|
|
|
/// ConstantFoldCall - Attempt to constant fold a call to the specified function
|
|
|
|
/// with the specified arguments, returning null if unsuccessful.
|
|
|
|
Constant *
|
2007-12-10 22:53:04 +00:00
|
|
|
llvm::ConstantFoldCall(Function *F,
|
2009-10-05 05:00:35 +00:00
|
|
|
Constant *const *Operands, unsigned NumOperands) {
|
2009-04-03 00:02:39 +00:00
|
|
|
if (!F->hasName()) return 0;
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context = F->getContext();
|
2009-07-26 08:34:35 +00:00
|
|
|
StringRef Name = F->getName();
|
2009-10-05 05:00:35 +00:00
|
|
|
|
2005-10-27 16:00:10 +00:00
|
|
|
const Type *Ty = F->getReturnType();
|
2007-01-30 23:15:43 +00:00
|
|
|
if (NumOperands == 1) {
|
2005-10-27 16:00:10 +00:00
|
|
|
if (ConstantFP *Op = dyn_cast<ConstantFP>(Operands[0])) {
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Ty != Type::getFloatTy(F->getContext()) &&
|
|
|
|
Ty != Type::getDoubleTy(Context))
|
2007-09-06 18:13:44 +00:00
|
|
|
return 0;
|
|
|
|
/// Currently APFloat versions of these functions do not exist, so we use
|
|
|
|
/// the host native double versions. Float versions are not called
|
|
|
|
/// directly but for all these it is true (float)(f((double)arg)) ==
|
|
|
|
/// f(arg). Long double not supported yet.
|
2009-10-05 05:00:35 +00:00
|
|
|
double V = Ty == Type::getFloatTy(Context) ?
|
2009-08-13 21:58:54 +00:00
|
|
|
(double)Op->getValueAPF().convertToFloat():
|
2007-09-06 18:13:44 +00:00
|
|
|
Op->getValueAPF().convertToDouble();
|
2009-07-26 08:34:35 +00:00
|
|
|
switch (Name[0]) {
|
2007-08-08 06:55:43 +00:00
|
|
|
case 'a':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "acos")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(acos, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "asin")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(asin, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "atan")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(atan, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
case 'c':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "ceil")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(ceil, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "cos")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(cos, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "cosh")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(cosh, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "cosf")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(cos, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
case 'e':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "exp")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(exp, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
case 'f':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "fabs")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(fabs, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "floor")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(floor, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
case 'l':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "log" && V > 0)
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(log, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "log10" && V > 0)
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(log10, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "llvm.sqrt.f32" ||
|
|
|
|
Name == "llvm.sqrt.f64") {
|
2007-08-08 06:55:43 +00:00
|
|
|
if (V >= -0.0)
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sqrt, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
else // Undefined
|
2009-07-31 20:28:14 +00:00
|
|
|
return Constant::getNullValue(Ty);
|
2007-08-08 06:55:43 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 's':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "sin")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sin, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "sinh")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sinh, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "sqrt" && V >= 0)
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sqrt, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "sqrtf" && V >= 0)
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sqrt, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "sinf")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(sin, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
case 't':
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name == "tan")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(tan, V, Ty, Context);
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name == "tanh")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldFP(tanh, V, Ty, Context);
|
2007-08-08 06:55:43 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
2009-10-05 05:00:35 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (ConstantInt *Op = dyn_cast<ConstantInt>(Operands[0])) {
|
2009-07-26 08:34:35 +00:00
|
|
|
if (Name.startswith("llvm.bswap"))
|
2009-07-24 23:12:02 +00:00
|
|
|
return ConstantInt::get(Context, Op->getValue().byteSwap());
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name.startswith("llvm.ctpop"))
|
2009-07-24 23:12:02 +00:00
|
|
|
return ConstantInt::get(Ty, Op->getValue().countPopulation());
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name.startswith("llvm.cttz"))
|
2009-07-24 23:12:02 +00:00
|
|
|
return ConstantInt::get(Ty, Op->getValue().countTrailingZeros());
|
2009-07-26 08:34:35 +00:00
|
|
|
else if (Name.startswith("llvm.ctlz"))
|
2009-07-24 23:12:02 +00:00
|
|
|
return ConstantInt::get(Ty, Op->getValue().countLeadingZeros());
|
2009-10-05 05:00:35 +00:00
|
|
|
return 0;
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
2009-10-05 05:00:35 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NumOperands == 2) {
|
2005-10-27 16:00:10 +00:00
|
|
|
if (ConstantFP *Op1 = dyn_cast<ConstantFP>(Operands[0])) {
|
2009-08-13 21:58:54 +00:00
|
|
|
if (Ty!=Type::getFloatTy(F->getContext()) &&
|
|
|
|
Ty!=Type::getDoubleTy(Context))
|
2007-10-02 17:43:59 +00:00
|
|
|
return 0;
|
2009-08-13 21:58:54 +00:00
|
|
|
double Op1V = Ty==Type::getFloatTy(F->getContext()) ?
|
2007-09-06 18:13:44 +00:00
|
|
|
(double)Op1->getValueAPF().convertToFloat():
|
|
|
|
Op1->getValueAPF().convertToDouble();
|
2005-10-27 16:00:10 +00:00
|
|
|
if (ConstantFP *Op2 = dyn_cast<ConstantFP>(Operands[1])) {
|
2009-08-13 21:58:54 +00:00
|
|
|
double Op2V = Ty==Type::getFloatTy(F->getContext()) ?
|
2007-09-06 18:13:44 +00:00
|
|
|
(double)Op2->getValueAPF().convertToFloat():
|
|
|
|
Op2->getValueAPF().convertToDouble();
|
2005-10-27 16:00:10 +00:00
|
|
|
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Name == "pow")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldBinaryFP(pow, Op1V, Op2V, Ty, Context);
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Name == "fmod")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldBinaryFP(fmod, Op1V, Op2V, Ty, Context);
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Name == "atan2")
|
2009-07-06 18:42:36 +00:00
|
|
|
return ConstantFoldBinaryFP(atan2, Op1V, Op2V, Ty, Context);
|
2007-01-15 06:27:37 +00:00
|
|
|
} else if (ConstantInt *Op2C = dyn_cast<ConstantInt>(Operands[1])) {
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Name == "llvm.powi.f32")
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat((float)std::pow((float)Op1V,
|
2008-04-20 00:41:09 +00:00
|
|
|
(int)Op2C->getZExtValue())));
|
2009-10-05 05:00:35 +00:00
|
|
|
if (Name == "llvm.powi.f64")
|
2009-07-27 20:59:43 +00:00
|
|
|
return ConstantFP::get(Context, APFloat((double)std::pow((double)Op1V,
|
2008-04-20 00:41:09 +00:00
|
|
|
(int)Op2C->getZExtValue())));
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
2009-10-05 05:00:35 +00:00
|
|
|
return 0;
|
2005-10-27 16:00:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|