2009-10-28 04:05:49 +08:00
|
|
|
//===------ MemoryBuiltins.cpp - Identify calls to memory builtins --------===//
|
2009-09-10 12:36:43 +08:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2009-10-28 04:05:49 +08:00
|
|
|
// This family of functions identifies calls to builtin functions that allocate
|
|
|
|
// or free memory.
|
2009-09-10 12:36:43 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
#define DEBUG_TYPE "memory-builtins"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2009-10-28 04:05:49 +08:00
|
|
|
#include "llvm/Analysis/MemoryBuiltins.h"
|
2012-06-21 23:45:28 +08:00
|
|
|
#include "llvm/GlobalVariable.h"
|
2009-09-10 12:36:43 +08:00
|
|
|
#include "llvm/Instructions.h"
|
2012-06-21 23:45:28 +08:00
|
|
|
#include "llvm/Intrinsics.h"
|
|
|
|
#include "llvm/Metadata.h"
|
2009-09-10 12:36:43 +08:00
|
|
|
#include "llvm/Module.h"
|
2009-11-10 16:32:25 +08:00
|
|
|
#include "llvm/Analysis/ValueTracking.h"
|
2012-06-21 23:45:28 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/MathExtras.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-11-07 08:16:28 +08:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2012-07-26 01:29:22 +08:00
|
|
|
#include "llvm/Transforms/Utils/BuildLibCalls.h"
|
2012-06-21 23:45:28 +08:00
|
|
|
#include "llvm/Transforms/Utils/Local.h"
|
2009-09-10 12:36:43 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
enum AllocType {
|
|
|
|
MallocLike = 1<<0, // allocates
|
|
|
|
CallocLike = 1<<1, // allocates + bzero
|
|
|
|
ReallocLike = 1<<2, // reallocates
|
|
|
|
StrDupLike = 1<<3,
|
|
|
|
AllocLike = MallocLike | CallocLike | StrDupLike,
|
|
|
|
AnyAlloc = MallocLike | CallocLike | ReallocLike | StrDupLike
|
|
|
|
};
|
|
|
|
|
|
|
|
struct AllocFnsTy {
|
|
|
|
const char *Name;
|
|
|
|
AllocType AllocTy;
|
|
|
|
unsigned char NumParams;
|
|
|
|
// First and Second size parameters (or -1 if unused)
|
2012-06-22 02:38:26 +08:00
|
|
|
signed char FstParam, SndParam;
|
2012-06-21 23:45:28 +08:00
|
|
|
};
|
|
|
|
|
2012-06-29 00:34:03 +08:00
|
|
|
// FIXME: certain users need more information. E.g., SimplifyLibCalls needs to
|
|
|
|
// know which functions are nounwind, noalias, nocapture parameters, etc.
|
2012-06-21 23:45:28 +08:00
|
|
|
static const AllocFnsTy AllocationFnData[] = {
|
2012-06-29 00:34:03 +08:00
|
|
|
{"malloc", MallocLike, 1, 0, -1},
|
|
|
|
{"valloc", MallocLike, 1, 0, -1},
|
|
|
|
{"_Znwj", MallocLike, 1, 0, -1}, // new(unsigned int)
|
|
|
|
{"_ZnwjRKSt9nothrow_t", MallocLike, 2, 0, -1}, // new(unsigned int, nothrow)
|
|
|
|
{"_Znwm", MallocLike, 1, 0, -1}, // new(unsigned long)
|
|
|
|
{"_ZnwmRKSt9nothrow_t", MallocLike, 2, 0, -1}, // new(unsigned long, nothrow)
|
|
|
|
{"_Znaj", MallocLike, 1, 0, -1}, // new[](unsigned int)
|
|
|
|
{"_ZnajRKSt9nothrow_t", MallocLike, 2, 0, -1}, // new[](unsigned int, nothrow)
|
|
|
|
{"_Znam", MallocLike, 1, 0, -1}, // new[](unsigned long)
|
|
|
|
{"_ZnamRKSt9nothrow_t", MallocLike, 2, 0, -1}, // new[](unsigned long, nothrow)
|
|
|
|
{"posix_memalign", MallocLike, 3, 2, -1},
|
|
|
|
{"calloc", CallocLike, 2, 0, 1},
|
|
|
|
{"realloc", ReallocLike, 2, 1, -1},
|
|
|
|
{"reallocf", ReallocLike, 2, 1, -1},
|
|
|
|
{"strdup", StrDupLike, 1, -1, -1},
|
2012-07-25 00:28:13 +08:00
|
|
|
{"strndup", StrDupLike, 2, 1, -1}
|
2012-06-21 23:45:28 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static Function *getCalledFunction(const Value *V, bool LookThroughBitCast) {
|
|
|
|
if (LookThroughBitCast)
|
|
|
|
V = V->stripPointerCasts();
|
2012-06-22 05:25:05 +08:00
|
|
|
|
2012-06-22 23:50:53 +08:00
|
|
|
CallSite CS(const_cast<Value*>(V));
|
|
|
|
if (!CS.getInstruction())
|
2012-06-21 23:45:28 +08:00
|
|
|
return 0;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
Function *Callee = CS.getCalledFunction();
|
2012-06-21 23:45:28 +08:00
|
|
|
if (!Callee || !Callee->isDeclaration())
|
|
|
|
return 0;
|
|
|
|
return Callee;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
/// \brief Returns the allocation data for the given value if it is a call to a
|
|
|
|
/// known allocation function, and NULL otherwise.
|
|
|
|
static const AllocFnsTy *getAllocationData(const Value *V, AllocType AllocTy,
|
|
|
|
bool LookThroughBitCast = false) {
|
|
|
|
Function *Callee = getCalledFunction(V, LookThroughBitCast);
|
|
|
|
if (!Callee)
|
|
|
|
return 0;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
unsigned i = 0;
|
|
|
|
bool found = false;
|
|
|
|
for ( ; i < array_lengthof(AllocationFnData); ++i) {
|
|
|
|
if (Callee->getName() == AllocationFnData[i].Name) {
|
|
|
|
found = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!found)
|
|
|
|
return 0;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
const AllocFnsTy *FnData = &AllocationFnData[i];
|
|
|
|
if ((FnData->AllocTy & AllocTy) == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
// Check function prototype.
|
|
|
|
// FIXME: Check the nobuiltin metadata?? (PR5130)
|
2012-06-22 02:38:26 +08:00
|
|
|
int FstParam = FnData->FstParam;
|
|
|
|
int SndParam = FnData->SndParam;
|
2011-07-18 12:54:35 +08:00
|
|
|
FunctionType *FTy = Callee->getFunctionType();
|
2012-06-21 23:45:28 +08:00
|
|
|
|
|
|
|
if (FTy->getReturnType() == Type::getInt8PtrTy(FTy->getContext()) &&
|
|
|
|
FTy->getNumParams() == FnData->NumParams &&
|
2012-06-22 02:38:26 +08:00
|
|
|
(FstParam < 0 ||
|
2012-06-21 23:45:28 +08:00
|
|
|
(FTy->getParamType(FstParam)->isIntegerTy(32) ||
|
|
|
|
FTy->getParamType(FstParam)->isIntegerTy(64))) &&
|
2012-06-22 02:38:26 +08:00
|
|
|
(SndParam < 0 ||
|
2012-06-21 23:45:28 +08:00
|
|
|
FTy->getParamType(SndParam)->isIntegerTy(32) ||
|
|
|
|
FTy->getParamType(SndParam)->isIntegerTy(64)))
|
|
|
|
return FnData;
|
|
|
|
return 0;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
static bool hasNoAliasAttr(const Value *V, bool LookThroughBitCast) {
|
2012-06-26 00:17:54 +08:00
|
|
|
ImmutableCallSite CS(LookThroughBitCast ? V->stripPointerCasts() : V);
|
|
|
|
return CS && CS.hasFnAttr(Attribute::NoAlias);
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a library function that
|
|
|
|
/// allocates or reallocates memory (either malloc, calloc, realloc, or strdup
|
|
|
|
/// like).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isAllocationFn(const Value *V, bool LookThroughBitCast) {
|
|
|
|
return getAllocationData(V, AnyAlloc, LookThroughBitCast);
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a function that returns a
|
2012-06-29 00:34:03 +08:00
|
|
|
/// NoAlias pointer (including malloc/calloc/realloc/strdup-like functions).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isNoAliasFn(const Value *V, bool LookThroughBitCast) {
|
2012-06-29 00:34:03 +08:00
|
|
|
// it's safe to consider realloc as noalias since accessing the original
|
|
|
|
// pointer is undefined behavior
|
|
|
|
return isAllocationFn(V, LookThroughBitCast) ||
|
2012-06-21 23:45:28 +08:00
|
|
|
hasNoAliasAttr(V, LookThroughBitCast);
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a library function that
|
|
|
|
/// allocates uninitialized memory (such as malloc).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isMallocLikeFn(const Value *V, bool LookThroughBitCast) {
|
|
|
|
return getAllocationData(V, MallocLike, LookThroughBitCast);
|
|
|
|
}
|
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a library function that
|
|
|
|
/// allocates zero-filled memory (such as calloc).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isCallocLikeFn(const Value *V, bool LookThroughBitCast) {
|
|
|
|
return getAllocationData(V, CallocLike, LookThroughBitCast);
|
|
|
|
}
|
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a library function that
|
|
|
|
/// allocates memory (either malloc, calloc, or strdup like).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isAllocLikeFn(const Value *V, bool LookThroughBitCast) {
|
|
|
|
return getAllocationData(V, AllocLike, LookThroughBitCast);
|
|
|
|
}
|
|
|
|
|
2012-06-22 05:25:05 +08:00
|
|
|
/// \brief Tests if a value is a call or invoke to a library function that
|
|
|
|
/// reallocates memory (such as realloc).
|
2012-06-21 23:45:28 +08:00
|
|
|
bool llvm::isReallocLikeFn(const Value *V, bool LookThroughBitCast) {
|
|
|
|
return getAllocationData(V, ReallocLike, LookThroughBitCast);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// extractMallocCall - Returns the corresponding CallInst if the instruction
|
|
|
|
/// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we
|
|
|
|
/// ignore InvokeInst here.
|
|
|
|
const CallInst *llvm::extractMallocCall(const Value *I) {
|
2012-06-22 08:25:01 +08:00
|
|
|
return isMallocLikeFn(I) ? dyn_cast<CallInst>(I) : 0;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2009-11-10 16:32:25 +08:00
|
|
|
static Value *computeArraySize(const CallInst *CI, const TargetData *TD,
|
|
|
|
bool LookThroughSExt = false) {
|
2009-09-10 12:36:43 +08:00
|
|
|
if (!CI)
|
2009-10-29 04:18:55 +08:00
|
|
|
return NULL;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2009-11-07 08:16:28 +08:00
|
|
|
// The size of the malloc's result type must be known to determine array size.
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *T = getMallocAllocatedType(CI);
|
2009-11-07 08:16:28 +08:00
|
|
|
if (!T || !T->isSized() || !TD)
|
2009-10-29 04:18:55 +08:00
|
|
|
return NULL;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2009-11-10 16:32:25 +08:00
|
|
|
unsigned ElementSize = TD->getTypeAllocSize(T);
|
2011-07-18 12:54:35 +08:00
|
|
|
if (StructType *ST = dyn_cast<StructType>(T))
|
2009-11-10 16:32:25 +08:00
|
|
|
ElementSize = TD->getStructLayout(ST)->getSizeInBytes();
|
2009-11-07 08:16:28 +08:00
|
|
|
|
2010-06-24 05:41:47 +08:00
|
|
|
// If malloc call's arg can be determined to be a multiple of ElementSize,
|
2009-11-10 16:32:25 +08:00
|
|
|
// return the multiple. Otherwise, return NULL.
|
2010-06-24 05:41:47 +08:00
|
|
|
Value *MallocArg = CI->getArgOperand(0);
|
2009-11-10 16:32:25 +08:00
|
|
|
Value *Multiple = NULL;
|
|
|
|
if (ComputeMultiple(MallocArg, ElementSize, Multiple,
|
2009-11-18 08:58:27 +08:00
|
|
|
LookThroughSExt))
|
2009-11-10 16:32:25 +08:00
|
|
|
return Multiple;
|
2009-09-19 03:20:02 +08:00
|
|
|
|
2009-10-29 04:18:55 +08:00
|
|
|
return NULL;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// isArrayMalloc - Returns the corresponding CallInst if the instruction
|
2009-10-29 04:18:55 +08:00
|
|
|
/// is a call to malloc whose array size can be determined and the array size
|
|
|
|
/// is not constant 1. Otherwise, return NULL.
|
2009-11-06 12:27:31 +08:00
|
|
|
const CallInst *llvm::isArrayMalloc(const Value *I, const TargetData *TD) {
|
2009-09-10 12:36:43 +08:00
|
|
|
const CallInst *CI = extractMallocCall(I);
|
2009-11-10 16:32:25 +08:00
|
|
|
Value *ArraySize = computeArraySize(CI, TD);
|
2009-10-29 04:18:55 +08:00
|
|
|
|
|
|
|
if (ArraySize &&
|
2010-06-24 05:41:47 +08:00
|
|
|
ArraySize != ConstantInt::get(CI->getArgOperand(0)->getType(), 1))
|
2009-10-29 04:18:55 +08:00
|
|
|
return CI;
|
|
|
|
|
|
|
|
// CI is a non-array malloc or we can't figure out that it is an array malloc.
|
|
|
|
return NULL;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getMallocType - Returns the PointerType resulting from the malloc call.
|
2009-11-07 08:16:28 +08:00
|
|
|
/// The PointerType depends on the number of bitcast uses of the malloc call:
|
|
|
|
/// 0: PointerType is the calls' return type.
|
|
|
|
/// 1: PointerType is the bitcast's result type.
|
|
|
|
/// >1: Unique PointerType cannot be determined, return NULL.
|
2011-07-18 12:54:35 +08:00
|
|
|
PointerType *llvm::getMallocType(const CallInst *CI) {
|
2012-06-21 23:45:28 +08:00
|
|
|
assert(isMallocLikeFn(CI) && "getMallocType and not malloc call");
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
PointerType *MallocType = NULL;
|
2009-11-07 08:16:28 +08:00
|
|
|
unsigned NumOfBitCastUses = 0;
|
|
|
|
|
2009-09-19 03:20:02 +08:00
|
|
|
// Determine if CallInst has a bitcast use.
|
2010-03-26 07:06:16 +08:00
|
|
|
for (Value::const_use_iterator UI = CI->use_begin(), E = CI->use_end();
|
2009-09-19 03:20:02 +08:00
|
|
|
UI != E; )
|
2009-11-07 08:16:28 +08:00
|
|
|
if (const BitCastInst *BCI = dyn_cast<BitCastInst>(*UI++)) {
|
|
|
|
MallocType = cast<PointerType>(BCI->getDestTy());
|
|
|
|
NumOfBitCastUses++;
|
|
|
|
}
|
2009-09-19 03:20:02 +08:00
|
|
|
|
2009-11-07 08:16:28 +08:00
|
|
|
// Malloc call has 1 bitcast use, so type is the bitcast's destination type.
|
|
|
|
if (NumOfBitCastUses == 1)
|
|
|
|
return MallocType;
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2009-09-23 02:50:03 +08:00
|
|
|
// Malloc call was not bitcast, so type is the malloc function's return type.
|
2009-11-07 08:16:28 +08:00
|
|
|
if (NumOfBitCastUses == 0)
|
2009-09-19 03:20:02 +08:00
|
|
|
return cast<PointerType>(CI->getType());
|
2009-09-10 12:36:43 +08:00
|
|
|
|
2009-09-19 03:20:02 +08:00
|
|
|
// Type could not be determined.
|
|
|
|
return NULL;
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
|
|
|
|
2009-11-07 08:16:28 +08:00
|
|
|
/// getMallocAllocatedType - Returns the Type allocated by malloc call.
|
|
|
|
/// The Type depends on the number of bitcast uses of the malloc call:
|
|
|
|
/// 0: PointerType is the malloc calls' return type.
|
|
|
|
/// 1: PointerType is the bitcast's result type.
|
|
|
|
/// >1: Unique PointerType cannot be determined, return NULL.
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *llvm::getMallocAllocatedType(const CallInst *CI) {
|
|
|
|
PointerType *PT = getMallocType(CI);
|
2009-09-10 12:36:43 +08:00
|
|
|
return PT ? PT->getElementType() : NULL;
|
|
|
|
}
|
|
|
|
|
2009-10-29 04:18:55 +08:00
|
|
|
/// getMallocArraySize - Returns the array size of a malloc call. If the
|
|
|
|
/// argument passed to malloc is a multiple of the size of the malloced type,
|
|
|
|
/// then return that multiple. For non-array mallocs, the multiple is
|
|
|
|
/// constant 1. Otherwise, return NULL for mallocs whose array size cannot be
|
2009-10-16 04:14:52 +08:00
|
|
|
/// determined.
|
2009-11-10 16:32:25 +08:00
|
|
|
Value *llvm::getMallocArraySize(CallInst *CI, const TargetData *TD,
|
|
|
|
bool LookThroughSExt) {
|
2012-06-21 23:45:28 +08:00
|
|
|
assert(isMallocLikeFn(CI) && "getMallocArraySize and not malloc call");
|
2009-11-10 16:32:25 +08:00
|
|
|
return computeArraySize(CI, TD, LookThroughSExt);
|
2009-09-10 12:36:43 +08:00
|
|
|
}
|
2009-10-24 12:23:03 +08:00
|
|
|
|
2012-05-04 05:19:58 +08:00
|
|
|
|
|
|
|
/// extractCallocCall - Returns the corresponding CallInst if the instruction
|
|
|
|
/// is a calloc call.
|
|
|
|
const CallInst *llvm::extractCallocCall(const Value *I) {
|
2012-06-21 23:45:28 +08:00
|
|
|
return isCallocLikeFn(I) ? cast<CallInst>(I) : 0;
|
2012-05-04 05:19:58 +08:00
|
|
|
}
|
|
|
|
|
2009-10-27 07:43:48 +08:00
|
|
|
|
2010-06-24 05:51:12 +08:00
|
|
|
/// isFreeCall - Returns non-null if the value is a call to the builtin free()
|
|
|
|
const CallInst *llvm::isFreeCall(const Value *I) {
|
2009-10-24 12:23:03 +08:00
|
|
|
const CallInst *CI = dyn_cast<CallInst>(I);
|
|
|
|
if (!CI)
|
2010-06-24 05:51:12 +08:00
|
|
|
return 0;
|
2009-11-04 04:39:35 +08:00
|
|
|
Function *Callee = CI->getCalledFunction();
|
2011-03-15 15:31:32 +08:00
|
|
|
if (Callee == 0 || !Callee->isDeclaration())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (Callee->getName() != "free" &&
|
2011-03-17 13:20:12 +08:00
|
|
|
Callee->getName() != "_ZdlPv" && // operator delete(void*)
|
|
|
|
Callee->getName() != "_ZdaPv") // operator delete[](void*)
|
2010-06-24 05:51:12 +08:00
|
|
|
return 0;
|
2009-10-24 12:23:03 +08:00
|
|
|
|
|
|
|
// Check free prototype.
|
|
|
|
// FIXME: workaround for PR5130, this will be obsolete when a nobuiltin
|
|
|
|
// attribute will exist.
|
2011-07-18 12:54:35 +08:00
|
|
|
FunctionType *FTy = Callee->getFunctionType();
|
2009-11-04 04:39:35 +08:00
|
|
|
if (!FTy->getReturnType()->isVoidTy())
|
2010-06-24 05:51:12 +08:00
|
|
|
return 0;
|
2009-10-24 12:23:03 +08:00
|
|
|
if (FTy->getNumParams() != 1)
|
2010-06-24 05:51:12 +08:00
|
|
|
return 0;
|
2011-06-19 05:46:23 +08:00
|
|
|
if (FTy->getParamType(0) != Type::getInt8PtrTy(Callee->getContext()))
|
2010-06-24 05:51:12 +08:00
|
|
|
return 0;
|
2009-10-24 12:23:03 +08:00
|
|
|
|
2010-06-24 05:51:12 +08:00
|
|
|
return CI;
|
2009-10-24 12:23:03 +08:00
|
|
|
}
|
2012-06-21 23:45:28 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Utility functions to compute size of objects.
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
|
|
/// \brief Compute the size of the object pointed by Ptr. Returns true and the
|
|
|
|
/// object size in Size if successful, and false otherwise.
|
|
|
|
/// If RoundToAlign is true, then Size is rounded up to the aligment of allocas,
|
|
|
|
/// byval arguments, and global variables.
|
|
|
|
bool llvm::getObjectSize(const Value *Ptr, uint64_t &Size, const TargetData *TD,
|
|
|
|
bool RoundToAlign) {
|
|
|
|
if (!TD)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
ObjectSizeOffsetVisitor Visitor(TD, Ptr->getContext(), RoundToAlign);
|
|
|
|
SizeOffsetType Data = Visitor.compute(const_cast<Value*>(Ptr));
|
|
|
|
if (!Visitor.bothKnown(Data))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
APInt ObjSize = Data.first, Offset = Data.second;
|
|
|
|
// check for overflow
|
|
|
|
if (Offset.slt(0) || ObjSize.ult(Offset))
|
|
|
|
Size = 0;
|
|
|
|
else
|
|
|
|
Size = (ObjSize - Offset).getZExtValue();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
STATISTIC(ObjectVisitorArgument,
|
|
|
|
"Number of arguments with unsolved size and offset");
|
|
|
|
STATISTIC(ObjectVisitorLoad,
|
|
|
|
"Number of load instructions with unsolved size and offset");
|
|
|
|
|
|
|
|
|
|
|
|
APInt ObjectSizeOffsetVisitor::align(APInt Size, uint64_t Align) {
|
|
|
|
if (RoundToAlign && Align)
|
|
|
|
return APInt(IntTyBits, RoundUpToAlignment(Size.getZExtValue(), Align));
|
|
|
|
return Size;
|
|
|
|
}
|
|
|
|
|
|
|
|
ObjectSizeOffsetVisitor::ObjectSizeOffsetVisitor(const TargetData *TD,
|
|
|
|
LLVMContext &Context,
|
|
|
|
bool RoundToAlign)
|
|
|
|
: TD(TD), RoundToAlign(RoundToAlign) {
|
|
|
|
IntegerType *IntTy = TD->getIntPtrType(Context);
|
|
|
|
IntTyBits = IntTy->getBitWidth();
|
|
|
|
Zero = APInt::getNullValue(IntTyBits);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::compute(Value *V) {
|
|
|
|
V = V->stripPointerCasts();
|
|
|
|
|
|
|
|
if (GEPOperator *GEP = dyn_cast<GEPOperator>(V))
|
|
|
|
return visitGEPOperator(*GEP);
|
|
|
|
if (Instruction *I = dyn_cast<Instruction>(V))
|
|
|
|
return visit(*I);
|
|
|
|
if (Argument *A = dyn_cast<Argument>(V))
|
|
|
|
return visitArgument(*A);
|
|
|
|
if (ConstantPointerNull *P = dyn_cast<ConstantPointerNull>(V))
|
|
|
|
return visitConstantPointerNull(*P);
|
|
|
|
if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
|
|
|
|
return visitGlobalVariable(*GV);
|
|
|
|
if (UndefValue *UV = dyn_cast<UndefValue>(V))
|
|
|
|
return visitUndefValue(*UV);
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
|
|
|
|
if (CE->getOpcode() == Instruction::IntToPtr)
|
|
|
|
return unknown(); // clueless
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: " << *V
|
|
|
|
<< '\n');
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitAllocaInst(AllocaInst &I) {
|
|
|
|
if (!I.getAllocatedType()->isSized())
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
APInt Size(IntTyBits, TD->getTypeAllocSize(I.getAllocatedType()));
|
|
|
|
if (!I.isArrayAllocation())
|
|
|
|
return std::make_pair(align(Size, I.getAlignment()), Zero);
|
|
|
|
|
|
|
|
Value *ArraySize = I.getArraySize();
|
|
|
|
if (const ConstantInt *C = dyn_cast<ConstantInt>(ArraySize)) {
|
|
|
|
Size *= C->getValue().zextOrSelf(IntTyBits);
|
|
|
|
return std::make_pair(align(Size, I.getAlignment()), Zero);
|
|
|
|
}
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) {
|
|
|
|
// no interprocedural analysis is done at the moment
|
|
|
|
if (!A.hasByValAttr()) {
|
|
|
|
++ObjectVisitorArgument;
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
PointerType *PT = cast<PointerType>(A.getType());
|
|
|
|
APInt Size(IntTyBits, TD->getTypeAllocSize(PT->getElementType()));
|
|
|
|
return std::make_pair(align(Size, A.getParamAlignment()), Zero);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitCallSite(CallSite CS) {
|
|
|
|
const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc);
|
|
|
|
if (!FnData)
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
// handle strdup-like functions separately
|
|
|
|
if (FnData->AllocTy == StrDupLike) {
|
2012-07-25 00:28:13 +08:00
|
|
|
APInt Size(IntTyBits, GetStringLength(CS.getArgument(0)));
|
|
|
|
if (!Size)
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
// strndup limits strlen
|
|
|
|
if (FnData->FstParam > 0) {
|
|
|
|
ConstantInt *Arg= dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
|
|
|
|
if (!Arg)
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
APInt MaxSize = Arg->getValue().zextOrSelf(IntTyBits);
|
|
|
|
if (Size.ugt(MaxSize))
|
|
|
|
Size = MaxSize + 1;
|
|
|
|
}
|
|
|
|
return std::make_pair(Size, Zero);
|
2012-06-21 23:45:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantInt *Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
|
|
|
|
if (!Arg)
|
|
|
|
return unknown();
|
|
|
|
|
2012-06-22 00:47:58 +08:00
|
|
|
APInt Size = Arg->getValue().zextOrSelf(IntTyBits);
|
2012-06-21 23:45:28 +08:00
|
|
|
// size determined by just 1 parameter
|
2012-06-22 02:38:26 +08:00
|
|
|
if (FnData->SndParam < 0)
|
2012-06-21 23:45:28 +08:00
|
|
|
return std::make_pair(Size, Zero);
|
|
|
|
|
|
|
|
Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->SndParam));
|
|
|
|
if (!Arg)
|
|
|
|
return unknown();
|
|
|
|
|
2012-06-22 00:47:58 +08:00
|
|
|
Size *= Arg->getValue().zextOrSelf(IntTyBits);
|
2012-06-21 23:45:28 +08:00
|
|
|
return std::make_pair(Size, Zero);
|
|
|
|
|
|
|
|
// TODO: handle more standard functions (+ wchar cousins):
|
|
|
|
// - strcpy / strncpy
|
|
|
|
// - strcat / strncat
|
|
|
|
// - memcpy / memmove
|
|
|
|
// - memset
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType
|
|
|
|
ObjectSizeOffsetVisitor::visitConstantPointerNull(ConstantPointerNull&) {
|
|
|
|
return std::make_pair(Zero, Zero);
|
|
|
|
}
|
|
|
|
|
2012-06-29 00:34:03 +08:00
|
|
|
SizeOffsetType
|
|
|
|
ObjectSizeOffsetVisitor::visitExtractElementInst(ExtractElementInst&) {
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
SizeOffsetType
|
|
|
|
ObjectSizeOffsetVisitor::visitExtractValueInst(ExtractValueInst&) {
|
|
|
|
// Easy cases were already folded by previous passes.
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitGEPOperator(GEPOperator &GEP) {
|
|
|
|
SizeOffsetType PtrData = compute(GEP.getPointerOperand());
|
|
|
|
if (!bothKnown(PtrData) || !GEP.hasAllConstantIndices())
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
SmallVector<Value*, 8> Ops(GEP.idx_begin(), GEP.idx_end());
|
|
|
|
APInt Offset(IntTyBits,TD->getIndexedOffset(GEP.getPointerOperandType(),Ops));
|
|
|
|
return std::make_pair(PtrData.first, PtrData.second + Offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalVariable(GlobalVariable &GV){
|
|
|
|
if (!GV.hasDefinitiveInitializer())
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
APInt Size(IntTyBits, TD->getTypeAllocSize(GV.getType()->getElementType()));
|
|
|
|
return std::make_pair(align(Size, GV.getAlignment()), Zero);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitIntToPtrInst(IntToPtrInst&) {
|
|
|
|
// clueless
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitLoadInst(LoadInst&) {
|
|
|
|
++ObjectVisitorLoad;
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitPHINode(PHINode&) {
|
|
|
|
// too complex to analyze statically.
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitSelectInst(SelectInst &I) {
|
|
|
|
SizeOffsetType TrueSide = compute(I.getTrueValue());
|
|
|
|
SizeOffsetType FalseSide = compute(I.getFalseValue());
|
|
|
|
if (bothKnown(TrueSide) && bothKnown(FalseSide) && TrueSide == FalseSide)
|
|
|
|
return TrueSide;
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitUndefValue(UndefValue&) {
|
|
|
|
return std::make_pair(Zero, Zero);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetType ObjectSizeOffsetVisitor::visitInstruction(Instruction &I) {
|
|
|
|
DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I << '\n');
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ObjectSizeOffsetEvaluator::ObjectSizeOffsetEvaluator(const TargetData *TD,
|
2012-07-26 01:29:22 +08:00
|
|
|
const TargetLibraryInfo *TLI,
|
2012-06-21 23:45:28 +08:00
|
|
|
LLVMContext &Context)
|
2012-07-26 01:29:22 +08:00
|
|
|
: TD(TD), TLI(TLI), Context(Context), Builder(Context, TargetFolder(TD)),
|
2012-06-21 23:45:28 +08:00
|
|
|
Visitor(TD, Context) {
|
|
|
|
IntTy = TD->getIntPtrType(Context);
|
|
|
|
Zero = ConstantInt::get(IntTy, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute(Value *V) {
|
|
|
|
SizeOffsetEvalType Result = compute_(V);
|
|
|
|
|
|
|
|
if (!bothKnown(Result)) {
|
|
|
|
// erase everything that was computed in this iteration from the cache, so
|
|
|
|
// that no dangling references are left behind. We could be a bit smarter if
|
|
|
|
// we kept a dependency graph. It's probably not worth the complexity.
|
|
|
|
for (PtrSetTy::iterator I=SeenVals.begin(), E=SeenVals.end(); I != E; ++I) {
|
|
|
|
CacheMapTy::iterator CacheIt = CacheMap.find(*I);
|
|
|
|
// non-computable results can be safely cached
|
|
|
|
if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second))
|
|
|
|
CacheMap.erase(CacheIt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
SeenVals.clear();
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute_(Value *V) {
|
|
|
|
SizeOffsetType Const = Visitor.compute(V);
|
|
|
|
if (Visitor.bothKnown(Const))
|
|
|
|
return std::make_pair(ConstantInt::get(Context, Const.first),
|
|
|
|
ConstantInt::get(Context, Const.second));
|
|
|
|
|
|
|
|
V = V->stripPointerCasts();
|
|
|
|
|
|
|
|
// check cache
|
|
|
|
CacheMapTy::iterator CacheIt = CacheMap.find(V);
|
|
|
|
if (CacheIt != CacheMap.end())
|
|
|
|
return CacheIt->second;
|
|
|
|
|
|
|
|
// always generate code immediately before the instruction being
|
|
|
|
// processed, so that the generated code dominates the same BBs
|
|
|
|
Instruction *PrevInsertPoint = Builder.GetInsertPoint();
|
|
|
|
if (Instruction *I = dyn_cast<Instruction>(V))
|
|
|
|
Builder.SetInsertPoint(I);
|
|
|
|
|
|
|
|
// record the pointers that were handled in this run, so that they can be
|
|
|
|
// cleaned later if something fails
|
|
|
|
SeenVals.insert(V);
|
|
|
|
|
|
|
|
// now compute the size and offset
|
|
|
|
SizeOffsetEvalType Result;
|
|
|
|
if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
|
|
|
|
Result = visitGEPOperator(*GEP);
|
|
|
|
} else if (Instruction *I = dyn_cast<Instruction>(V)) {
|
|
|
|
Result = visit(*I);
|
|
|
|
} else if (isa<Argument>(V) ||
|
|
|
|
(isa<ConstantExpr>(V) &&
|
|
|
|
cast<ConstantExpr>(V)->getOpcode() == Instruction::IntToPtr) ||
|
|
|
|
isa<GlobalVariable>(V)) {
|
|
|
|
// ignore values where we cannot do more than what ObjectSizeVisitor can
|
|
|
|
Result = unknown();
|
|
|
|
} else {
|
|
|
|
DEBUG(dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: "
|
|
|
|
<< *V << '\n');
|
|
|
|
Result = unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (PrevInsertPoint)
|
|
|
|
Builder.SetInsertPoint(PrevInsertPoint);
|
|
|
|
|
|
|
|
// Don't reuse CacheIt since it may be invalid at this point.
|
|
|
|
CacheMap[V] = Result;
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitAllocaInst(AllocaInst &I) {
|
|
|
|
if (!I.getAllocatedType()->isSized())
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
// must be a VLA
|
|
|
|
assert(I.isArrayAllocation());
|
|
|
|
Value *ArraySize = I.getArraySize();
|
|
|
|
Value *Size = ConstantInt::get(ArraySize->getType(),
|
|
|
|
TD->getTypeAllocSize(I.getAllocatedType()));
|
|
|
|
Size = Builder.CreateMul(Size, ArraySize);
|
|
|
|
return std::make_pair(Size, Zero);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitCallSite(CallSite CS) {
|
|
|
|
const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc);
|
|
|
|
if (!FnData)
|
|
|
|
return unknown();
|
|
|
|
|
|
|
|
// handle strdup-like functions separately
|
|
|
|
if (FnData->AllocTy == StrDupLike) {
|
2012-07-26 01:29:22 +08:00
|
|
|
IRBuilder<> StdBuilder(Builder.GetInsertPoint());
|
|
|
|
Value *Size;
|
|
|
|
|
|
|
|
// strdup(str): size = strlen(str)+1
|
|
|
|
if (FnData->FstParam < 0)
|
|
|
|
Size = EmitStrLen(CS.getArgument(0), StdBuilder, TD, TLI);
|
|
|
|
else
|
|
|
|
// strndup(str, maxlen): size = strnlen(str, maxlen)+1
|
|
|
|
Size = EmitStrNLen(CS.getArgument(0), CS.getArgument(FnData->FstParam),
|
|
|
|
StdBuilder, TD, TLI);
|
|
|
|
if (!Size)
|
|
|
|
return unknown();
|
|
|
|
Builder.SetInsertPoint(StdBuilder.GetInsertPoint());
|
|
|
|
Size = Builder.CreateNUWAdd(Size, ConstantInt::get(IntTy, 1));
|
|
|
|
return std::make_pair(Size, Zero);
|
2012-06-21 23:45:28 +08:00
|
|
|
}
|
|
|
|
|
2012-06-22 00:47:58 +08:00
|
|
|
Value *FirstArg = CS.getArgument(FnData->FstParam);
|
|
|
|
FirstArg = Builder.CreateZExt(FirstArg, IntTy);
|
2012-06-22 02:38:26 +08:00
|
|
|
if (FnData->SndParam < 0)
|
2012-06-21 23:45:28 +08:00
|
|
|
return std::make_pair(FirstArg, Zero);
|
|
|
|
|
|
|
|
Value *SecondArg = CS.getArgument(FnData->SndParam);
|
2012-06-22 00:47:58 +08:00
|
|
|
SecondArg = Builder.CreateZExt(SecondArg, IntTy);
|
2012-06-21 23:45:28 +08:00
|
|
|
Value *Size = Builder.CreateMul(FirstArg, SecondArg);
|
|
|
|
return std::make_pair(Size, Zero);
|
|
|
|
|
|
|
|
// TODO: handle more standard functions (+ wchar cousins):
|
|
|
|
// - strcpy / strncpy
|
|
|
|
// - strcat / strncat
|
|
|
|
// - memcpy / memmove
|
|
|
|
// - memset
|
|
|
|
}
|
|
|
|
|
2012-06-29 00:34:03 +08:00
|
|
|
SizeOffsetEvalType
|
|
|
|
ObjectSizeOffsetEvaluator::visitExtractElementInst(ExtractElementInst&) {
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType
|
|
|
|
ObjectSizeOffsetEvaluator::visitExtractValueInst(ExtractValueInst&) {
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
2012-06-21 23:45:28 +08:00
|
|
|
SizeOffsetEvalType
|
|
|
|
ObjectSizeOffsetEvaluator::visitGEPOperator(GEPOperator &GEP) {
|
|
|
|
SizeOffsetEvalType PtrData = compute_(GEP.getPointerOperand());
|
|
|
|
if (!bothKnown(PtrData))
|
|
|
|
return unknown();
|
|
|
|
|
2012-07-21 07:07:40 +08:00
|
|
|
Value *Offset = EmitGEPOffset(&Builder, *TD, &GEP, /*NoAssumptions=*/true);
|
2012-06-21 23:45:28 +08:00
|
|
|
Offset = Builder.CreateAdd(PtrData.second, Offset);
|
|
|
|
return std::make_pair(PtrData.first, Offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitIntToPtrInst(IntToPtrInst&) {
|
|
|
|
// clueless
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitLoadInst(LoadInst&) {
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) {
|
|
|
|
// create 2 PHIs: one for size and another for offset
|
|
|
|
PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
|
|
|
|
PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
|
|
|
|
|
|
|
|
// insert right away in the cache to handle recursive PHIs
|
|
|
|
CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI);
|
|
|
|
|
|
|
|
// compute offset/size for each PHI incoming pointer
|
|
|
|
for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) {
|
|
|
|
Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt());
|
|
|
|
SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i));
|
|
|
|
|
|
|
|
if (!bothKnown(EdgeData)) {
|
|
|
|
OffsetPHI->replaceAllUsesWith(UndefValue::get(IntTy));
|
|
|
|
OffsetPHI->eraseFromParent();
|
|
|
|
SizePHI->replaceAllUsesWith(UndefValue::get(IntTy));
|
|
|
|
SizePHI->eraseFromParent();
|
|
|
|
return unknown();
|
|
|
|
}
|
|
|
|
SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
|
|
|
|
OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));
|
|
|
|
}
|
2012-07-04 01:13:25 +08:00
|
|
|
|
|
|
|
Value *Size = SizePHI, *Offset = OffsetPHI, *Tmp;
|
|
|
|
if ((Tmp = SizePHI->hasConstantValue())) {
|
|
|
|
Size = Tmp;
|
|
|
|
SizePHI->replaceAllUsesWith(Size);
|
|
|
|
SizePHI->eraseFromParent();
|
|
|
|
}
|
|
|
|
if ((Tmp = OffsetPHI->hasConstantValue())) {
|
|
|
|
Offset = Tmp;
|
|
|
|
OffsetPHI->replaceAllUsesWith(Offset);
|
|
|
|
OffsetPHI->eraseFromParent();
|
|
|
|
}
|
|
|
|
return std::make_pair(Size, Offset);
|
2012-06-21 23:45:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitSelectInst(SelectInst &I) {
|
|
|
|
SizeOffsetEvalType TrueSide = compute_(I.getTrueValue());
|
|
|
|
SizeOffsetEvalType FalseSide = compute_(I.getFalseValue());
|
|
|
|
|
|
|
|
if (!bothKnown(TrueSide) || !bothKnown(FalseSide))
|
|
|
|
return unknown();
|
|
|
|
if (TrueSide == FalseSide)
|
|
|
|
return TrueSide;
|
|
|
|
|
|
|
|
Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first,
|
|
|
|
FalseSide.first);
|
|
|
|
Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second,
|
|
|
|
FalseSide.second);
|
|
|
|
return std::make_pair(Size, Offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitInstruction(Instruction &I) {
|
|
|
|
DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I <<'\n');
|
|
|
|
return unknown();
|
|
|
|
}
|