blob: a1eea1c8509b8771c5b1907eb68a9973a52eb462 [file] [log] [blame]
Victor Hernandezf006b182009-10-27 20:05:49 +00001//===------ MemoryBuiltins.cpp - Identify calls to memory builtins --------===//
Evan Chengfabcb912009-09-10 04:36:43 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
Victor Hernandezf006b182009-10-27 20:05:49 +000010// This family of functions identifies calls to builtin functions that allocate
11// or free memory.
Evan Chengfabcb912009-09-10 04:36:43 +000012//
13//===----------------------------------------------------------------------===//
14
Nuno Lopes9e72a792012-06-21 15:45:28 +000015#define DEBUG_TYPE "memory-builtins"
Victor Hernandezf006b182009-10-27 20:05:49 +000016#include "llvm/Analysis/MemoryBuiltins.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +000017#include "llvm/ADT/STLExtras.h"
18#include "llvm/ADT/Statistic.h"
19#include "llvm/Analysis/ValueTracking.h"
Chandler Carruth0b8c9a82013-01-02 11:36:10 +000020#include "llvm/IR/DataLayout.h"
21#include "llvm/IR/GlobalVariable.h"
22#include "llvm/IR/Instructions.h"
23#include "llvm/IR/Intrinsics.h"
24#include "llvm/IR/Metadata.h"
25#include "llvm/IR/Module.h"
Nuno Lopes9e72a792012-06-21 15:45:28 +000026#include "llvm/Support/Debug.h"
27#include "llvm/Support/MathExtras.h"
28#include "llvm/Support/raw_ostream.h"
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +000029#include "llvm/Target/TargetLibraryInfo.h"
Nuno Lopes9e72a792012-06-21 15:45:28 +000030#include "llvm/Transforms/Utils/Local.h"
Evan Chengfabcb912009-09-10 04:36:43 +000031using namespace llvm;
32
Nuno Lopes9e72a792012-06-21 15:45:28 +000033enum AllocType {
34 MallocLike = 1<<0, // allocates
35 CallocLike = 1<<1, // allocates + bzero
36 ReallocLike = 1<<2, // reallocates
37 StrDupLike = 1<<3,
38 AllocLike = MallocLike | CallocLike | StrDupLike,
39 AnyAlloc = MallocLike | CallocLike | ReallocLike | StrDupLike
40};
Evan Chengfabcb912009-09-10 04:36:43 +000041
Nuno Lopes9e72a792012-06-21 15:45:28 +000042struct AllocFnsTy {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +000043 LibFunc::Func Func;
Nuno Lopes9e72a792012-06-21 15:45:28 +000044 AllocType AllocTy;
45 unsigned char NumParams;
46 // First and Second size parameters (or -1 if unused)
Nuno Lopesef22f042012-06-21 18:38:26 +000047 signed char FstParam, SndParam;
Nuno Lopes9e72a792012-06-21 15:45:28 +000048};
Evan Chengfabcb912009-09-10 04:36:43 +000049
Nuno Lopes41a3f252012-06-28 16:34:03 +000050// FIXME: certain users need more information. E.g., SimplifyLibCalls needs to
51// know which functions are nounwind, noalias, nocapture parameters, etc.
Nuno Lopes9e72a792012-06-21 15:45:28 +000052static const AllocFnsTy AllocationFnData[] = {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +000053 {LibFunc::malloc, MallocLike, 1, 0, -1},
54 {LibFunc::valloc, MallocLike, 1, 0, -1},
55 {LibFunc::Znwj, MallocLike, 1, 0, -1}, // new(unsigned int)
56 {LibFunc::ZnwjRKSt9nothrow_t, MallocLike, 2, 0, -1}, // new(unsigned int, nothrow)
57 {LibFunc::Znwm, MallocLike, 1, 0, -1}, // new(unsigned long)
58 {LibFunc::ZnwmRKSt9nothrow_t, MallocLike, 2, 0, -1}, // new(unsigned long, nothrow)
59 {LibFunc::Znaj, MallocLike, 1, 0, -1}, // new[](unsigned int)
60 {LibFunc::ZnajRKSt9nothrow_t, MallocLike, 2, 0, -1}, // new[](unsigned int, nothrow)
61 {LibFunc::Znam, MallocLike, 1, 0, -1}, // new[](unsigned long)
62 {LibFunc::ZnamRKSt9nothrow_t, MallocLike, 2, 0, -1}, // new[](unsigned long, nothrow)
63 {LibFunc::posix_memalign, MallocLike, 3, 2, -1},
64 {LibFunc::calloc, CallocLike, 2, 0, 1},
65 {LibFunc::realloc, ReallocLike, 2, 1, -1},
66 {LibFunc::reallocf, ReallocLike, 2, 1, -1},
67 {LibFunc::strdup, StrDupLike, 1, -1, -1},
68 {LibFunc::strndup, StrDupLike, 2, 1, -1}
Nuno Lopes9e72a792012-06-21 15:45:28 +000069};
70
71
72static Function *getCalledFunction(const Value *V, bool LookThroughBitCast) {
73 if (LookThroughBitCast)
74 V = V->stripPointerCasts();
Nuno Lopes2b3e9582012-06-21 21:25:05 +000075
Nuno Lopesd845c342012-06-22 15:50:53 +000076 CallSite CS(const_cast<Value*>(V));
77 if (!CS.getInstruction())
Nuno Lopes9e72a792012-06-21 15:45:28 +000078 return 0;
Evan Chengfabcb912009-09-10 04:36:43 +000079
Nuno Lopes2b3e9582012-06-21 21:25:05 +000080 Function *Callee = CS.getCalledFunction();
Nuno Lopes9e72a792012-06-21 15:45:28 +000081 if (!Callee || !Callee->isDeclaration())
82 return 0;
83 return Callee;
84}
Evan Chengfabcb912009-09-10 04:36:43 +000085
Nuno Lopes9e72a792012-06-21 15:45:28 +000086/// \brief Returns the allocation data for the given value if it is a call to a
87/// known allocation function, and NULL otherwise.
88static const AllocFnsTy *getAllocationData(const Value *V, AllocType AllocTy,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +000089 const TargetLibraryInfo *TLI,
Nuno Lopes9e72a792012-06-21 15:45:28 +000090 bool LookThroughBitCast = false) {
91 Function *Callee = getCalledFunction(V, LookThroughBitCast);
92 if (!Callee)
93 return 0;
94
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +000095 // Make sure that the function is available.
96 StringRef FnName = Callee->getName();
97 LibFunc::Func TLIFn;
98 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn))
99 return 0;
100
Nuno Lopes9e72a792012-06-21 15:45:28 +0000101 unsigned i = 0;
102 bool found = false;
103 for ( ; i < array_lengthof(AllocationFnData); ++i) {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000104 if (AllocationFnData[i].Func == TLIFn) {
Nuno Lopes9e72a792012-06-21 15:45:28 +0000105 found = true;
106 break;
107 }
108 }
109 if (!found)
110 return 0;
111
112 const AllocFnsTy *FnData = &AllocationFnData[i];
113 if ((FnData->AllocTy & AllocTy) == 0)
114 return 0;
115
116 // Check function prototype.
Nuno Lopesef22f042012-06-21 18:38:26 +0000117 int FstParam = FnData->FstParam;
118 int SndParam = FnData->SndParam;
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000119 FunctionType *FTy = Callee->getFunctionType();
Nuno Lopes9e72a792012-06-21 15:45:28 +0000120
121 if (FTy->getReturnType() == Type::getInt8PtrTy(FTy->getContext()) &&
122 FTy->getNumParams() == FnData->NumParams &&
Nuno Lopesef22f042012-06-21 18:38:26 +0000123 (FstParam < 0 ||
Nuno Lopes9e72a792012-06-21 15:45:28 +0000124 (FTy->getParamType(FstParam)->isIntegerTy(32) ||
125 FTy->getParamType(FstParam)->isIntegerTy(64))) &&
Nuno Lopesef22f042012-06-21 18:38:26 +0000126 (SndParam < 0 ||
Nuno Lopes9e72a792012-06-21 15:45:28 +0000127 FTy->getParamType(SndParam)->isIntegerTy(32) ||
128 FTy->getParamType(SndParam)->isIntegerTy(64)))
129 return FnData;
130 return 0;
131}
132
133static bool hasNoAliasAttr(const Value *V, bool LookThroughBitCast) {
Nuno Lopese8742d02012-06-25 16:17:54 +0000134 ImmutableCallSite CS(LookThroughBitCast ? V->stripPointerCasts() : V);
Bill Wendling034b94b2012-12-19 07:18:57 +0000135 return CS && CS.hasFnAttr(Attribute::NoAlias);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000136}
137
138
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000139/// \brief Tests if a value is a call or invoke to a library function that
140/// allocates or reallocates memory (either malloc, calloc, realloc, or strdup
141/// like).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000142bool llvm::isAllocationFn(const Value *V, const TargetLibraryInfo *TLI,
143 bool LookThroughBitCast) {
144 return getAllocationData(V, AnyAlloc, TLI, LookThroughBitCast);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000145}
146
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000147/// \brief Tests if a value is a call or invoke to a function that returns a
Nuno Lopes41a3f252012-06-28 16:34:03 +0000148/// NoAlias pointer (including malloc/calloc/realloc/strdup-like functions).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000149bool llvm::isNoAliasFn(const Value *V, const TargetLibraryInfo *TLI,
150 bool LookThroughBitCast) {
Nuno Lopes41a3f252012-06-28 16:34:03 +0000151 // it's safe to consider realloc as noalias since accessing the original
152 // pointer is undefined behavior
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000153 return isAllocationFn(V, TLI, LookThroughBitCast) ||
Nuno Lopes9e72a792012-06-21 15:45:28 +0000154 hasNoAliasAttr(V, LookThroughBitCast);
155}
156
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000157/// \brief Tests if a value is a call or invoke to a library function that
158/// allocates uninitialized memory (such as malloc).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000159bool llvm::isMallocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
160 bool LookThroughBitCast) {
161 return getAllocationData(V, MallocLike, TLI, LookThroughBitCast);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000162}
163
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000164/// \brief Tests if a value is a call or invoke to a library function that
165/// allocates zero-filled memory (such as calloc).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000166bool llvm::isCallocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
167 bool LookThroughBitCast) {
168 return getAllocationData(V, CallocLike, TLI, LookThroughBitCast);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000169}
170
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000171/// \brief Tests if a value is a call or invoke to a library function that
172/// allocates memory (either malloc, calloc, or strdup like).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000173bool llvm::isAllocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
174 bool LookThroughBitCast) {
175 return getAllocationData(V, AllocLike, TLI, LookThroughBitCast);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000176}
177
Nuno Lopes2b3e9582012-06-21 21:25:05 +0000178/// \brief Tests if a value is a call or invoke to a library function that
179/// reallocates memory (such as realloc).
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000180bool llvm::isReallocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
181 bool LookThroughBitCast) {
182 return getAllocationData(V, ReallocLike, TLI, LookThroughBitCast);
Evan Chengfabcb912009-09-10 04:36:43 +0000183}
184
185/// extractMallocCall - Returns the corresponding CallInst if the instruction
186/// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we
187/// ignore InvokeInst here.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000188const CallInst *llvm::extractMallocCall(const Value *I,
189 const TargetLibraryInfo *TLI) {
190 return isMallocLikeFn(I, TLI) ? dyn_cast<CallInst>(I) : 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000191}
192
Micah Villmow3574eca2012-10-08 16:38:25 +0000193static Value *computeArraySize(const CallInst *CI, const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000194 const TargetLibraryInfo *TLI,
Victor Hernandez8e345a12009-11-10 08:32:25 +0000195 bool LookThroughSExt = false) {
Evan Chengfabcb912009-09-10 04:36:43 +0000196 if (!CI)
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000197 return 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000198
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000199 // The size of the malloc's result type must be known to determine array size.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000200 Type *T = getMallocAllocatedType(CI, TLI);
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000201 if (!T || !T->isSized() || !TD)
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000202 return 0;
Victor Hernandez88d98392009-09-18 19:20:02 +0000203
Victor Hernandez8e345a12009-11-10 08:32:25 +0000204 unsigned ElementSize = TD->getTypeAllocSize(T);
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000205 if (StructType *ST = dyn_cast<StructType>(T))
Victor Hernandez8e345a12009-11-10 08:32:25 +0000206 ElementSize = TD->getStructLayout(ST)->getSizeInBytes();
Victor Hernandez88d98392009-09-18 19:20:02 +0000207
Gabor Greife3401c42010-06-23 21:41:47 +0000208 // If malloc call's arg can be determined to be a multiple of ElementSize,
Victor Hernandez8e345a12009-11-10 08:32:25 +0000209 // return the multiple. Otherwise, return NULL.
Gabor Greife3401c42010-06-23 21:41:47 +0000210 Value *MallocArg = CI->getArgOperand(0);
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000211 Value *Multiple = 0;
Victor Hernandez8e345a12009-11-10 08:32:25 +0000212 if (ComputeMultiple(MallocArg, ElementSize, Multiple,
Dan Gohman3dbb9e62009-11-18 00:58:27 +0000213 LookThroughSExt))
Victor Hernandez8e345a12009-11-10 08:32:25 +0000214 return Multiple;
Victor Hernandez88d98392009-09-18 19:20:02 +0000215
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000216 return 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000217}
218
219/// isArrayMalloc - Returns the corresponding CallInst if the instruction
Victor Hernandez90f48e72009-10-28 20:18:55 +0000220/// is a call to malloc whose array size can be determined and the array size
221/// is not constant 1. Otherwise, return NULL.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000222const CallInst *llvm::isArrayMalloc(const Value *I,
Micah Villmow3574eca2012-10-08 16:38:25 +0000223 const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000224 const TargetLibraryInfo *TLI) {
225 const CallInst *CI = extractMallocCall(I, TLI);
226 Value *ArraySize = computeArraySize(CI, TD, TLI);
Victor Hernandez90f48e72009-10-28 20:18:55 +0000227
Jakub Staszakb1b6c172013-03-07 20:22:39 +0000228 if (ConstantInt *ConstSize = dyn_cast_or_null<ConstantInt>(ArraySize))
229 if (ConstSize->isOne())
230 return CI;
Victor Hernandez90f48e72009-10-28 20:18:55 +0000231
232 // CI is a non-array malloc or we can't figure out that it is an array malloc.
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000233 return 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000234}
235
236/// getMallocType - Returns the PointerType resulting from the malloc call.
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000237/// The PointerType depends on the number of bitcast uses of the malloc call:
238/// 0: PointerType is the calls' return type.
239/// 1: PointerType is the bitcast's result type.
240/// >1: Unique PointerType cannot be determined, return NULL.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000241PointerType *llvm::getMallocType(const CallInst *CI,
242 const TargetLibraryInfo *TLI) {
243 assert(isMallocLikeFn(CI, TLI) && "getMallocType and not malloc call");
Evan Chengfabcb912009-09-10 04:36:43 +0000244
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000245 PointerType *MallocType = 0;
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000246 unsigned NumOfBitCastUses = 0;
247
Victor Hernandez88d98392009-09-18 19:20:02 +0000248 // Determine if CallInst has a bitcast use.
Gabor Greif60ad7812010-03-25 23:06:16 +0000249 for (Value::const_use_iterator UI = CI->use_begin(), E = CI->use_end();
Victor Hernandez88d98392009-09-18 19:20:02 +0000250 UI != E; )
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000251 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(*UI++)) {
252 MallocType = cast<PointerType>(BCI->getDestTy());
253 NumOfBitCastUses++;
254 }
Evan Chengfabcb912009-09-10 04:36:43 +0000255
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000256 // Malloc call has 1 bitcast use, so type is the bitcast's destination type.
257 if (NumOfBitCastUses == 1)
258 return MallocType;
Evan Chengfabcb912009-09-10 04:36:43 +0000259
Victor Hernandez60cfc032009-09-22 18:50:03 +0000260 // Malloc call was not bitcast, so type is the malloc function's return type.
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000261 if (NumOfBitCastUses == 0)
Victor Hernandez88d98392009-09-18 19:20:02 +0000262 return cast<PointerType>(CI->getType());
263
264 // Type could not be determined.
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000265 return 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000266}
267
Victor Hernandez9d0b7042009-11-07 00:16:28 +0000268/// getMallocAllocatedType - Returns the Type allocated by malloc call.
269/// The Type depends on the number of bitcast uses of the malloc call:
270/// 0: PointerType is the malloc calls' return type.
271/// 1: PointerType is the bitcast's result type.
272/// >1: Unique PointerType cannot be determined, return NULL.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000273Type *llvm::getMallocAllocatedType(const CallInst *CI,
274 const TargetLibraryInfo *TLI) {
275 PointerType *PT = getMallocType(CI, TLI);
Jakub Staszaka9cd5162013-03-07 20:01:47 +0000276 return PT ? PT->getElementType() : 0;
Evan Chengfabcb912009-09-10 04:36:43 +0000277}
278
Victor Hernandez90f48e72009-10-28 20:18:55 +0000279/// getMallocArraySize - Returns the array size of a malloc call. If the
280/// argument passed to malloc is a multiple of the size of the malloced type,
281/// then return that multiple. For non-array mallocs, the multiple is
282/// constant 1. Otherwise, return NULL for mallocs whose array size cannot be
Victor Hernandez2491ce02009-10-15 20:14:52 +0000283/// determined.
Micah Villmow3574eca2012-10-08 16:38:25 +0000284Value *llvm::getMallocArraySize(CallInst *CI, const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000285 const TargetLibraryInfo *TLI,
Victor Hernandez8e345a12009-11-10 08:32:25 +0000286 bool LookThroughSExt) {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000287 assert(isMallocLikeFn(CI, TLI) && "getMallocArraySize and not malloc call");
288 return computeArraySize(CI, TD, TLI, LookThroughSExt);
Evan Chengfabcb912009-09-10 04:36:43 +0000289}
Victor Hernandez66284e02009-10-24 04:23:03 +0000290
Nuno Lopes252ef562012-05-03 21:19:58 +0000291
Nuno Lopes252ef562012-05-03 21:19:58 +0000292/// extractCallocCall - Returns the corresponding CallInst if the instruction
293/// is a calloc call.
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000294const CallInst *llvm::extractCallocCall(const Value *I,
295 const TargetLibraryInfo *TLI) {
296 return isCallocLikeFn(I, TLI) ? cast<CallInst>(I) : 0;
Nuno Lopes252ef562012-05-03 21:19:58 +0000297}
298
Victor Hernandez046e78c2009-10-26 23:43:48 +0000299
Gabor Greif02680f92010-06-23 21:51:12 +0000300/// isFreeCall - Returns non-null if the value is a call to the builtin free()
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000301const CallInst *llvm::isFreeCall(const Value *I, const TargetLibraryInfo *TLI) {
Victor Hernandez66284e02009-10-24 04:23:03 +0000302 const CallInst *CI = dyn_cast<CallInst>(I);
303 if (!CI)
Gabor Greif02680f92010-06-23 21:51:12 +0000304 return 0;
Victor Hernandez3ad70d52009-11-03 20:39:35 +0000305 Function *Callee = CI->getCalledFunction();
Nick Lewycky42e72ca2011-03-15 07:31:32 +0000306 if (Callee == 0 || !Callee->isDeclaration())
307 return 0;
308
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000309 StringRef FnName = Callee->getName();
310 LibFunc::Func TLIFn;
311 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn))
312 return 0;
313
314 if (TLIFn != LibFunc::free &&
315 TLIFn != LibFunc::ZdlPv && // operator delete(void*)
316 TLIFn != LibFunc::ZdaPv) // operator delete[](void*)
Gabor Greif02680f92010-06-23 21:51:12 +0000317 return 0;
Victor Hernandez66284e02009-10-24 04:23:03 +0000318
319 // Check free prototype.
320 // FIXME: workaround for PR5130, this will be obsolete when a nobuiltin
321 // attribute will exist.
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000322 FunctionType *FTy = Callee->getFunctionType();
Victor Hernandez3ad70d52009-11-03 20:39:35 +0000323 if (!FTy->getReturnType()->isVoidTy())
Gabor Greif02680f92010-06-23 21:51:12 +0000324 return 0;
Victor Hernandez66284e02009-10-24 04:23:03 +0000325 if (FTy->getNumParams() != 1)
Gabor Greif02680f92010-06-23 21:51:12 +0000326 return 0;
Chris Lattnerebb21892011-06-18 21:46:23 +0000327 if (FTy->getParamType(0) != Type::getInt8PtrTy(Callee->getContext()))
Gabor Greif02680f92010-06-23 21:51:12 +0000328 return 0;
Victor Hernandez66284e02009-10-24 04:23:03 +0000329
Gabor Greif02680f92010-06-23 21:51:12 +0000330 return CI;
Victor Hernandez66284e02009-10-24 04:23:03 +0000331}
Nuno Lopes9e72a792012-06-21 15:45:28 +0000332
333
334
335//===----------------------------------------------------------------------===//
336// Utility functions to compute size of objects.
337//
338
339
340/// \brief Compute the size of the object pointed by Ptr. Returns true and the
341/// object size in Size if successful, and false otherwise.
342/// If RoundToAlign is true, then Size is rounded up to the aligment of allocas,
343/// byval arguments, and global variables.
Micah Villmow3574eca2012-10-08 16:38:25 +0000344bool llvm::getObjectSize(const Value *Ptr, uint64_t &Size, const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000345 const TargetLibraryInfo *TLI, bool RoundToAlign) {
Nuno Lopes9e72a792012-06-21 15:45:28 +0000346 if (!TD)
347 return false;
348
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000349 ObjectSizeOffsetVisitor Visitor(TD, TLI, Ptr->getContext(), RoundToAlign);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000350 SizeOffsetType Data = Visitor.compute(const_cast<Value*>(Ptr));
351 if (!Visitor.bothKnown(Data))
352 return false;
353
354 APInt ObjSize = Data.first, Offset = Data.second;
355 // check for overflow
356 if (Offset.slt(0) || ObjSize.ult(Offset))
357 Size = 0;
358 else
359 Size = (ObjSize - Offset).getZExtValue();
360 return true;
361}
362
Nuno Lopes2bc689c2013-03-02 11:23:34 +0000363/// \brief Compute the size of the underlying object pointed by Ptr. Returns
364/// true and the object size in Size if successful, and false otherwise.
365/// If RoundToAlign is true, then Size is rounded up to the aligment of allocas,
366/// byval arguments, and global variables.
367bool llvm::getUnderlyingObjectSize(const Value *Ptr, uint64_t &Size,
368 const DataLayout *TD,
369 const TargetLibraryInfo *TLI,
370 bool RoundToAlign) {
371 if (!TD)
372 return false;
373
374 ObjectSizeOffsetVisitor Visitor(TD, TLI, Ptr->getContext(), RoundToAlign);
375 SizeOffsetType Data = Visitor.compute(const_cast<Value*>(Ptr));
376 if (!Visitor.knownSize(Data))
377 return false;
378
379 Size = Data.first.getZExtValue();
380 return true;
381}
382
Nuno Lopes9e72a792012-06-21 15:45:28 +0000383
384STATISTIC(ObjectVisitorArgument,
385 "Number of arguments with unsolved size and offset");
386STATISTIC(ObjectVisitorLoad,
387 "Number of load instructions with unsolved size and offset");
388
389
390APInt ObjectSizeOffsetVisitor::align(APInt Size, uint64_t Align) {
391 if (RoundToAlign && Align)
392 return APInt(IntTyBits, RoundUpToAlignment(Size.getZExtValue(), Align));
393 return Size;
394}
395
Micah Villmow3574eca2012-10-08 16:38:25 +0000396ObjectSizeOffsetVisitor::ObjectSizeOffsetVisitor(const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000397 const TargetLibraryInfo *TLI,
Nuno Lopes9e72a792012-06-21 15:45:28 +0000398 LLVMContext &Context,
Chandler Carruthece6c6b2012-11-01 08:07:29 +0000399 bool RoundToAlign)
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000400: TD(TD), TLI(TLI), RoundToAlign(RoundToAlign) {
Chandler Carruthece6c6b2012-11-01 08:07:29 +0000401 IntegerType *IntTy = TD->getIntPtrType(Context);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000402 IntTyBits = IntTy->getBitWidth();
403 Zero = APInt::getNullValue(IntTyBits);
404}
405
406SizeOffsetType ObjectSizeOffsetVisitor::compute(Value *V) {
407 V = V->stripPointerCasts();
Nuno Lopes0a9ff4c2012-12-31 20:45:10 +0000408
Nuno Lopesb443a0a2013-03-02 11:36:24 +0000409 if (isa<Instruction>(V) || isa<GEPOperator>(V)) {
410 // Return cached value or insert unknown in cache if size of V was not
411 // computed yet in order to avoid recursions in PHis.
412 std::pair<CacheMapTy::iterator, bool> CacheVal =
413 CacheMap.insert(std::make_pair(V, unknown()));
414 if (!CacheVal.second)
415 return CacheVal.first->second;
416
417 SizeOffsetType Result;
Benjamin Kramer168843c2012-08-17 19:26:41 +0000418 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V))
Nuno Lopesb443a0a2013-03-02 11:36:24 +0000419 Result = visitGEPOperator(*GEP);
420 else
421 Result = visit(cast<Instruction>(*V));
422 return CacheMap[V] = Result;
Benjamin Kramer168843c2012-08-17 19:26:41 +0000423 }
Nuno Lopesb443a0a2013-03-02 11:36:24 +0000424
Nuno Lopes9e72a792012-06-21 15:45:28 +0000425 if (Argument *A = dyn_cast<Argument>(V))
426 return visitArgument(*A);
427 if (ConstantPointerNull *P = dyn_cast<ConstantPointerNull>(V))
428 return visitConstantPointerNull(*P);
Nuno Lopes41be2fb2012-12-31 16:23:48 +0000429 if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V))
430 return visitGlobalAlias(*GA);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000431 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
432 return visitGlobalVariable(*GV);
433 if (UndefValue *UV = dyn_cast<UndefValue>(V))
434 return visitUndefValue(*UV);
Benjamin Kramer168843c2012-08-17 19:26:41 +0000435 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
Nuno Lopes9e72a792012-06-21 15:45:28 +0000436 if (CE->getOpcode() == Instruction::IntToPtr)
437 return unknown(); // clueless
Benjamin Kramer168843c2012-08-17 19:26:41 +0000438 }
Nuno Lopes9e72a792012-06-21 15:45:28 +0000439
440 DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: " << *V
441 << '\n');
442 return unknown();
443}
444
445SizeOffsetType ObjectSizeOffsetVisitor::visitAllocaInst(AllocaInst &I) {
446 if (!I.getAllocatedType()->isSized())
447 return unknown();
448
449 APInt Size(IntTyBits, TD->getTypeAllocSize(I.getAllocatedType()));
450 if (!I.isArrayAllocation())
451 return std::make_pair(align(Size, I.getAlignment()), Zero);
452
453 Value *ArraySize = I.getArraySize();
454 if (const ConstantInt *C = dyn_cast<ConstantInt>(ArraySize)) {
455 Size *= C->getValue().zextOrSelf(IntTyBits);
456 return std::make_pair(align(Size, I.getAlignment()), Zero);
457 }
458 return unknown();
459}
460
461SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) {
462 // no interprocedural analysis is done at the moment
463 if (!A.hasByValAttr()) {
464 ++ObjectVisitorArgument;
465 return unknown();
466 }
467 PointerType *PT = cast<PointerType>(A.getType());
468 APInt Size(IntTyBits, TD->getTypeAllocSize(PT->getElementType()));
469 return std::make_pair(align(Size, A.getParamAlignment()), Zero);
470}
471
472SizeOffsetType ObjectSizeOffsetVisitor::visitCallSite(CallSite CS) {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000473 const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc,
474 TLI);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000475 if (!FnData)
476 return unknown();
477
478 // handle strdup-like functions separately
479 if (FnData->AllocTy == StrDupLike) {
Nuno Lopes9827c8e2012-07-24 16:28:13 +0000480 APInt Size(IntTyBits, GetStringLength(CS.getArgument(0)));
481 if (!Size)
482 return unknown();
483
484 // strndup limits strlen
485 if (FnData->FstParam > 0) {
486 ConstantInt *Arg= dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
487 if (!Arg)
488 return unknown();
489
490 APInt MaxSize = Arg->getValue().zextOrSelf(IntTyBits);
491 if (Size.ugt(MaxSize))
492 Size = MaxSize + 1;
493 }
494 return std::make_pair(Size, Zero);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000495 }
496
497 ConstantInt *Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
498 if (!Arg)
499 return unknown();
500
Nuno Lopes034dd6c2012-06-21 16:47:58 +0000501 APInt Size = Arg->getValue().zextOrSelf(IntTyBits);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000502 // size determined by just 1 parameter
Nuno Lopesef22f042012-06-21 18:38:26 +0000503 if (FnData->SndParam < 0)
Nuno Lopes9e72a792012-06-21 15:45:28 +0000504 return std::make_pair(Size, Zero);
505
506 Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->SndParam));
507 if (!Arg)
508 return unknown();
509
Nuno Lopes034dd6c2012-06-21 16:47:58 +0000510 Size *= Arg->getValue().zextOrSelf(IntTyBits);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000511 return std::make_pair(Size, Zero);
512
513 // TODO: handle more standard functions (+ wchar cousins):
Nuno Lopes6e699bf2012-07-25 18:49:28 +0000514 // - strdup / strndup
Nuno Lopes9e72a792012-06-21 15:45:28 +0000515 // - strcpy / strncpy
516 // - strcat / strncat
517 // - memcpy / memmove
Nuno Lopes6e699bf2012-07-25 18:49:28 +0000518 // - strcat / strncat
Nuno Lopes9e72a792012-06-21 15:45:28 +0000519 // - memset
520}
521
522SizeOffsetType
523ObjectSizeOffsetVisitor::visitConstantPointerNull(ConstantPointerNull&) {
524 return std::make_pair(Zero, Zero);
525}
526
527SizeOffsetType
Nuno Lopes41a3f252012-06-28 16:34:03 +0000528ObjectSizeOffsetVisitor::visitExtractElementInst(ExtractElementInst&) {
529 return unknown();
530}
531
532SizeOffsetType
Nuno Lopes9e72a792012-06-21 15:45:28 +0000533ObjectSizeOffsetVisitor::visitExtractValueInst(ExtractValueInst&) {
534 // Easy cases were already folded by previous passes.
535 return unknown();
536}
537
538SizeOffsetType ObjectSizeOffsetVisitor::visitGEPOperator(GEPOperator &GEP) {
539 SizeOffsetType PtrData = compute(GEP.getPointerOperand());
Nuno Lopes98281a22012-12-30 16:25:48 +0000540 APInt Offset(IntTyBits, 0);
541 if (!bothKnown(PtrData) || !GEP.accumulateConstantOffset(*TD, Offset))
Nuno Lopes9e72a792012-06-21 15:45:28 +0000542 return unknown();
543
Nuno Lopes9e72a792012-06-21 15:45:28 +0000544 return std::make_pair(PtrData.first, PtrData.second + Offset);
545}
546
Nuno Lopes41be2fb2012-12-31 16:23:48 +0000547SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalAlias(GlobalAlias &GA) {
548 if (GA.mayBeOverridden())
549 return unknown();
550 return compute(GA.getAliasee());
551}
552
Nuno Lopes9e72a792012-06-21 15:45:28 +0000553SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalVariable(GlobalVariable &GV){
554 if (!GV.hasDefinitiveInitializer())
555 return unknown();
556
557 APInt Size(IntTyBits, TD->getTypeAllocSize(GV.getType()->getElementType()));
558 return std::make_pair(align(Size, GV.getAlignment()), Zero);
559}
560
561SizeOffsetType ObjectSizeOffsetVisitor::visitIntToPtrInst(IntToPtrInst&) {
562 // clueless
563 return unknown();
564}
565
566SizeOffsetType ObjectSizeOffsetVisitor::visitLoadInst(LoadInst&) {
567 ++ObjectVisitorLoad;
568 return unknown();
569}
570
Nuno Lopesb443a0a2013-03-02 11:36:24 +0000571SizeOffsetType ObjectSizeOffsetVisitor::visitPHINode(PHINode &PHI) {
572 if (PHI.getNumIncomingValues() == 0)
573 return unknown();
574
575 SizeOffsetType Ret = compute(PHI.getIncomingValue(0));
576 if (!bothKnown(Ret))
577 return unknown();
578
579 // Verify that all PHI incoming pointers have the same size and offset.
580 for (unsigned i = 1, e = PHI.getNumIncomingValues(); i != e; ++i) {
581 SizeOffsetType EdgeData = compute(PHI.getIncomingValue(i));
582 if (!bothKnown(EdgeData) || EdgeData != Ret)
583 return unknown();
584 }
585 return Ret;
Nuno Lopes9e72a792012-06-21 15:45:28 +0000586}
587
588SizeOffsetType ObjectSizeOffsetVisitor::visitSelectInst(SelectInst &I) {
589 SizeOffsetType TrueSide = compute(I.getTrueValue());
590 SizeOffsetType FalseSide = compute(I.getFalseValue());
Nuno Lopes2e594fa2012-12-31 18:01:36 +0000591 if (bothKnown(TrueSide) && bothKnown(FalseSide) && TrueSide == FalseSide)
Nuno Lopes9e72a792012-06-21 15:45:28 +0000592 return TrueSide;
593 return unknown();
594}
595
596SizeOffsetType ObjectSizeOffsetVisitor::visitUndefValue(UndefValue&) {
597 return std::make_pair(Zero, Zero);
598}
599
600SizeOffsetType ObjectSizeOffsetVisitor::visitInstruction(Instruction &I) {
601 DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I << '\n');
602 return unknown();
603}
604
605
Micah Villmow3574eca2012-10-08 16:38:25 +0000606ObjectSizeOffsetEvaluator::ObjectSizeOffsetEvaluator(const DataLayout *TD,
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000607 const TargetLibraryInfo *TLI,
Chandler Carruthece6c6b2012-11-01 08:07:29 +0000608 LLVMContext &Context)
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000609: TD(TD), TLI(TLI), Context(Context), Builder(Context, TargetFolder(TD)) {
Chandler Carruthece6c6b2012-11-01 08:07:29 +0000610 IntTy = TD->getIntPtrType(Context);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000611 Zero = ConstantInt::get(IntTy, 0);
612}
613
614SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute(Value *V) {
615 SizeOffsetEvalType Result = compute_(V);
616
617 if (!bothKnown(Result)) {
618 // erase everything that was computed in this iteration from the cache, so
619 // that no dangling references are left behind. We could be a bit smarter if
620 // we kept a dependency graph. It's probably not worth the complexity.
621 for (PtrSetTy::iterator I=SeenVals.begin(), E=SeenVals.end(); I != E; ++I) {
622 CacheMapTy::iterator CacheIt = CacheMap.find(*I);
623 // non-computable results can be safely cached
624 if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second))
625 CacheMap.erase(CacheIt);
626 }
627 }
628
629 SeenVals.clear();
630 return Result;
631}
632
633SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute_(Value *V) {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000634 ObjectSizeOffsetVisitor Visitor(TD, TLI, Context);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000635 SizeOffsetType Const = Visitor.compute(V);
636 if (Visitor.bothKnown(Const))
637 return std::make_pair(ConstantInt::get(Context, Const.first),
638 ConstantInt::get(Context, Const.second));
639
640 V = V->stripPointerCasts();
641
642 // check cache
643 CacheMapTy::iterator CacheIt = CacheMap.find(V);
644 if (CacheIt != CacheMap.end())
645 return CacheIt->second;
646
647 // always generate code immediately before the instruction being
648 // processed, so that the generated code dominates the same BBs
649 Instruction *PrevInsertPoint = Builder.GetInsertPoint();
650 if (Instruction *I = dyn_cast<Instruction>(V))
651 Builder.SetInsertPoint(I);
652
653 // record the pointers that were handled in this run, so that they can be
654 // cleaned later if something fails
655 SeenVals.insert(V);
656
657 // now compute the size and offset
658 SizeOffsetEvalType Result;
659 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
660 Result = visitGEPOperator(*GEP);
661 } else if (Instruction *I = dyn_cast<Instruction>(V)) {
662 Result = visit(*I);
663 } else if (isa<Argument>(V) ||
664 (isa<ConstantExpr>(V) &&
665 cast<ConstantExpr>(V)->getOpcode() == Instruction::IntToPtr) ||
Nuno Lopes41be2fb2012-12-31 16:23:48 +0000666 isa<GlobalAlias>(V) ||
Nuno Lopes9e72a792012-06-21 15:45:28 +0000667 isa<GlobalVariable>(V)) {
668 // ignore values where we cannot do more than what ObjectSizeVisitor can
669 Result = unknown();
670 } else {
671 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: "
672 << *V << '\n');
673 Result = unknown();
674 }
675
676 if (PrevInsertPoint)
677 Builder.SetInsertPoint(PrevInsertPoint);
678
679 // Don't reuse CacheIt since it may be invalid at this point.
680 CacheMap[V] = Result;
681 return Result;
682}
683
684SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitAllocaInst(AllocaInst &I) {
685 if (!I.getAllocatedType()->isSized())
686 return unknown();
687
688 // must be a VLA
689 assert(I.isArrayAllocation());
690 Value *ArraySize = I.getArraySize();
691 Value *Size = ConstantInt::get(ArraySize->getType(),
692 TD->getTypeAllocSize(I.getAllocatedType()));
693 Size = Builder.CreateMul(Size, ArraySize);
694 return std::make_pair(Size, Zero);
695}
696
697SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitCallSite(CallSite CS) {
Benjamin Kramer8e0d1c02012-08-29 15:32:21 +0000698 const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc,
699 TLI);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000700 if (!FnData)
701 return unknown();
702
703 // handle strdup-like functions separately
704 if (FnData->AllocTy == StrDupLike) {
Nuno Lopes6e699bf2012-07-25 18:49:28 +0000705 // TODO
706 return unknown();
Nuno Lopes9e72a792012-06-21 15:45:28 +0000707 }
708
Nuno Lopes034dd6c2012-06-21 16:47:58 +0000709 Value *FirstArg = CS.getArgument(FnData->FstParam);
710 FirstArg = Builder.CreateZExt(FirstArg, IntTy);
Nuno Lopesef22f042012-06-21 18:38:26 +0000711 if (FnData->SndParam < 0)
Nuno Lopes9e72a792012-06-21 15:45:28 +0000712 return std::make_pair(FirstArg, Zero);
713
714 Value *SecondArg = CS.getArgument(FnData->SndParam);
Nuno Lopes034dd6c2012-06-21 16:47:58 +0000715 SecondArg = Builder.CreateZExt(SecondArg, IntTy);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000716 Value *Size = Builder.CreateMul(FirstArg, SecondArg);
717 return std::make_pair(Size, Zero);
718
719 // TODO: handle more standard functions (+ wchar cousins):
Nuno Lopes6e699bf2012-07-25 18:49:28 +0000720 // - strdup / strndup
Nuno Lopes9e72a792012-06-21 15:45:28 +0000721 // - strcpy / strncpy
722 // - strcat / strncat
723 // - memcpy / memmove
Nuno Lopes6e699bf2012-07-25 18:49:28 +0000724 // - strcat / strncat
Nuno Lopes9e72a792012-06-21 15:45:28 +0000725 // - memset
726}
727
728SizeOffsetEvalType
Nuno Lopes41a3f252012-06-28 16:34:03 +0000729ObjectSizeOffsetEvaluator::visitExtractElementInst(ExtractElementInst&) {
730 return unknown();
731}
732
733SizeOffsetEvalType
734ObjectSizeOffsetEvaluator::visitExtractValueInst(ExtractValueInst&) {
735 return unknown();
736}
737
738SizeOffsetEvalType
Nuno Lopes9e72a792012-06-21 15:45:28 +0000739ObjectSizeOffsetEvaluator::visitGEPOperator(GEPOperator &GEP) {
740 SizeOffsetEvalType PtrData = compute_(GEP.getPointerOperand());
741 if (!bothKnown(PtrData))
742 return unknown();
743
Nuno Lopesc606c3f2012-07-20 23:07:40 +0000744 Value *Offset = EmitGEPOffset(&Builder, *TD, &GEP, /*NoAssumptions=*/true);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000745 Offset = Builder.CreateAdd(PtrData.second, Offset);
746 return std::make_pair(PtrData.first, Offset);
747}
748
749SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitIntToPtrInst(IntToPtrInst&) {
750 // clueless
751 return unknown();
752}
753
754SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitLoadInst(LoadInst&) {
755 return unknown();
756}
757
758SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) {
759 // create 2 PHIs: one for size and another for offset
760 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
761 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
762
763 // insert right away in the cache to handle recursive PHIs
764 CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI);
765
766 // compute offset/size for each PHI incoming pointer
767 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) {
768 Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt());
769 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i));
770
771 if (!bothKnown(EdgeData)) {
772 OffsetPHI->replaceAllUsesWith(UndefValue::get(IntTy));
773 OffsetPHI->eraseFromParent();
774 SizePHI->replaceAllUsesWith(UndefValue::get(IntTy));
775 SizePHI->eraseFromParent();
776 return unknown();
777 }
778 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
779 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));
780 }
Nuno Lopes0dff5322012-07-03 17:13:25 +0000781
782 Value *Size = SizePHI, *Offset = OffsetPHI, *Tmp;
783 if ((Tmp = SizePHI->hasConstantValue())) {
784 Size = Tmp;
785 SizePHI->replaceAllUsesWith(Size);
786 SizePHI->eraseFromParent();
787 }
788 if ((Tmp = OffsetPHI->hasConstantValue())) {
789 Offset = Tmp;
790 OffsetPHI->replaceAllUsesWith(Offset);
791 OffsetPHI->eraseFromParent();
792 }
793 return std::make_pair(Size, Offset);
Nuno Lopes9e72a792012-06-21 15:45:28 +0000794}
795
796SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitSelectInst(SelectInst &I) {
797 SizeOffsetEvalType TrueSide = compute_(I.getTrueValue());
798 SizeOffsetEvalType FalseSide = compute_(I.getFalseValue());
799
800 if (!bothKnown(TrueSide) || !bothKnown(FalseSide))
801 return unknown();
802 if (TrueSide == FalseSide)
803 return TrueSide;
804
805 Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first,
806 FalseSide.first);
807 Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second,
808 FalseSide.second);
809 return std::make_pair(Size, Offset);
810}
811
812SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitInstruction(Instruction &I) {
813 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I <<'\n');
814 return unknown();
815}