blob: 2d8274040d393c06c77cdf496867275bf4664c71 [file] [log] [blame]
Victor Hernandezf390e042009-10-27 20:05:49 +00001//===------ MemoryBuiltins.cpp - Identify calls to memory builtins --------===//
Evan Cheng1d9d4bd2009-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 Hernandezf390e042009-10-27 20:05:49 +000010// This family of functions identifies calls to builtin functions that allocate
Michael Ilsemand9745242013-03-08 21:03:09 +000011// or free memory.
Evan Cheng1d9d4bd2009-09-10 04:36:43 +000012//
13//===----------------------------------------------------------------------===//
14
Victor Hernandezf390e042009-10-27 20:05:49 +000015#include "llvm/Analysis/MemoryBuiltins.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000016#include "llvm/ADT/STLExtras.h"
17#include "llvm/ADT/Statistic.h"
Chandler Carruth62d42152015-01-15 02:16:27 +000018#include "llvm/Analysis/TargetLibraryInfo.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000019#include "llvm/Analysis/ValueTracking.h"
Chandler Carruth9fb823b2013-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 Lopes55fff832012-06-21 15:45:28 +000026#include "llvm/Support/Debug.h"
27#include "llvm/Support/MathExtras.h"
28#include "llvm/Support/raw_ostream.h"
Nuno Lopes55fff832012-06-21 15:45:28 +000029#include "llvm/Transforms/Utils/Local.h"
Evan Cheng1d9d4bd2009-09-10 04:36:43 +000030using namespace llvm;
31
Chandler Carruthf1221bd2014-04-22 02:48:03 +000032#define DEBUG_TYPE "memory-builtins"
33
George Burgess IV2ae15e02015-11-17 19:48:06 +000034enum AllocType : uint8_t {
Benjamin Kramer2939dd32013-09-24 17:34:29 +000035 OpNewLike = 1<<0, // allocates; never returns null
36 MallocLike = 1<<1 | OpNewLike, // allocates; may return null
37 CallocLike = 1<<2, // allocates + bzero
38 ReallocLike = 1<<3, // reallocates
39 StrDupLike = 1<<4,
40 AllocLike = MallocLike | CallocLike | StrDupLike,
Benjamin Kramer4d4df042013-09-24 17:15:14 +000041 AnyAlloc = AllocLike | ReallocLike
Nuno Lopes55fff832012-06-21 15:45:28 +000042};
Evan Cheng1d9d4bd2009-09-10 04:36:43 +000043
Nuno Lopes55fff832012-06-21 15:45:28 +000044struct AllocFnsTy {
Nuno Lopes55fff832012-06-21 15:45:28 +000045 AllocType AllocTy;
George Burgess IV278199f2016-04-12 01:05:35 +000046 unsigned NumParams;
Nuno Lopes55fff832012-06-21 15:45:28 +000047 // First and Second size parameters (or -1 if unused)
George Burgess IV278199f2016-04-12 01:05:35 +000048 int FstParam, SndParam;
Nuno Lopes55fff832012-06-21 15:45:28 +000049};
Evan Cheng1d9d4bd2009-09-10 04:36:43 +000050
Nuno Lopes181d67e2012-06-28 16:34:03 +000051// FIXME: certain users need more information. E.g., SimplifyLibCalls needs to
52// know which functions are nounwind, noalias, nocapture parameters, etc.
George Burgess IV278199f2016-04-12 01:05:35 +000053static const std::pair<LibFunc::Func, AllocFnsTy> AllocationFnData[] = {
54 {LibFunc::malloc, {MallocLike, 1, 0, -1}},
55 {LibFunc::valloc, {MallocLike, 1, 0, -1}},
56 {LibFunc::Znwj, {OpNewLike, 1, 0, -1}}, // new(unsigned int)
57 {LibFunc::ZnwjRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new(unsigned int, nothrow)
58 {LibFunc::Znwm, {OpNewLike, 1, 0, -1}}, // new(unsigned long)
59 {LibFunc::ZnwmRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new(unsigned long, nothrow)
60 {LibFunc::Znaj, {OpNewLike, 1, 0, -1}}, // new[](unsigned int)
61 {LibFunc::ZnajRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new[](unsigned int, nothrow)
62 {LibFunc::Znam, {OpNewLike, 1, 0, -1}}, // new[](unsigned long)
63 {LibFunc::ZnamRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new[](unsigned long, nothrow)
64 {LibFunc::msvc_new_int, {OpNewLike, 1, 0, -1}}, // new(unsigned int)
65 {LibFunc::msvc_new_int_nothrow, {MallocLike, 2, 0, -1}}, // new(unsigned int, nothrow)
66 {LibFunc::msvc_new_longlong, {OpNewLike, 1, 0, -1}}, // new(unsigned long long)
67 {LibFunc::msvc_new_longlong_nothrow, {MallocLike, 2, 0, -1}}, // new(unsigned long long, nothrow)
68 {LibFunc::msvc_new_array_int, {OpNewLike, 1, 0, -1}}, // new[](unsigned int)
69 {LibFunc::msvc_new_array_int_nothrow, {MallocLike, 2, 0, -1}}, // new[](unsigned int, nothrow)
70 {LibFunc::msvc_new_array_longlong, {OpNewLike, 1, 0, -1}}, // new[](unsigned long long)
71 {LibFunc::msvc_new_array_longlong_nothrow, {MallocLike, 2, 0, -1}}, // new[](unsigned long long, nothrow)
72 {LibFunc::calloc, {CallocLike, 2, 0, 1}},
73 {LibFunc::realloc, {ReallocLike, 2, 1, -1}},
74 {LibFunc::reallocf, {ReallocLike, 2, 1, -1}},
75 {LibFunc::strdup, {StrDupLike, 1, -1, -1}},
76 {LibFunc::strndup, {StrDupLike, 2, 1, -1}}
Benjamin Kramer01df8172013-09-24 17:49:08 +000077 // TODO: Handle "int posix_memalign(void **, size_t, size_t)"
Nuno Lopes55fff832012-06-21 15:45:28 +000078};
79
George Burgess IVed160242016-12-27 06:32:14 +000080static Function *getCalledFunction(const Value *V, bool LookThroughBitCast,
81 bool &IsNoBuiltin) {
George Burgess IVce044892016-12-27 06:10:50 +000082 // Don't care about intrinsics in this case.
83 if (isa<IntrinsicInst>(V))
84 return nullptr;
85
Nuno Lopes55fff832012-06-21 15:45:28 +000086 if (LookThroughBitCast)
87 V = V->stripPointerCasts();
Nuno Lopesdc6085e2012-06-21 21:25:05 +000088
Nuno Lopes15dbcb42012-06-22 15:50:53 +000089 CallSite CS(const_cast<Value*>(V));
90 if (!CS.getInstruction())
Craig Topper9f008862014-04-15 04:59:12 +000091 return nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +000092
George Burgess IVed160242016-12-27 06:32:14 +000093 IsNoBuiltin = CS.isNoBuiltin();
Richard Smithe04f0d32013-05-16 04:12:04 +000094
Nuno Lopesdc6085e2012-06-21 21:25:05 +000095 Function *Callee = CS.getCalledFunction();
Nuno Lopes55fff832012-06-21 15:45:28 +000096 if (!Callee || !Callee->isDeclaration())
Craig Topper9f008862014-04-15 04:59:12 +000097 return nullptr;
Nuno Lopes55fff832012-06-21 15:45:28 +000098 return Callee;
99}
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000100
George Burgess IV278199f2016-04-12 01:05:35 +0000101/// Returns the allocation data for the given value if it's either a call to a
102/// known allocation function, or a call to a function with the allocsize
103/// attribute.
George Burgess IVce044892016-12-27 06:10:50 +0000104static Optional<AllocFnsTy>
105getAllocationDataForFunction(const Function *Callee, AllocType AllocTy,
106 const TargetLibraryInfo *TLI) {
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000107 // Make sure that the function is available.
108 StringRef FnName = Callee->getName();
109 LibFunc::Func TLIFn;
110 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn))
George Burgess IV278199f2016-04-12 01:05:35 +0000111 return None;
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000112
George Burgess IV45a540f2016-12-20 18:46:27 +0000113 const auto *Iter = find_if(
114 AllocationFnData, [TLIFn](const std::pair<LibFunc::Func, AllocFnsTy> &P) {
115 return P.first == TLIFn;
116 });
Benjamin Kramer74b6d3b2015-10-24 19:03:15 +0000117
George Burgess IV278199f2016-04-12 01:05:35 +0000118 if (Iter == std::end(AllocationFnData))
119 return None;
Nuno Lopes55fff832012-06-21 15:45:28 +0000120
George Burgess IV278199f2016-04-12 01:05:35 +0000121 const AllocFnsTy *FnData = &Iter->second;
Benjamin Kramer2939dd32013-09-24 17:34:29 +0000122 if ((FnData->AllocTy & AllocTy) != FnData->AllocTy)
George Burgess IV278199f2016-04-12 01:05:35 +0000123 return None;
Nuno Lopes55fff832012-06-21 15:45:28 +0000124
125 // Check function prototype.
Nuno Lopesf06b7312012-06-21 18:38:26 +0000126 int FstParam = FnData->FstParam;
127 int SndParam = FnData->SndParam;
Chris Lattner229907c2011-07-18 04:54:35 +0000128 FunctionType *FTy = Callee->getFunctionType();
Nuno Lopes55fff832012-06-21 15:45:28 +0000129
130 if (FTy->getReturnType() == Type::getInt8PtrTy(FTy->getContext()) &&
131 FTy->getNumParams() == FnData->NumParams &&
Nuno Lopesf06b7312012-06-21 18:38:26 +0000132 (FstParam < 0 ||
Nuno Lopes55fff832012-06-21 15:45:28 +0000133 (FTy->getParamType(FstParam)->isIntegerTy(32) ||
134 FTy->getParamType(FstParam)->isIntegerTy(64))) &&
Nuno Lopesf06b7312012-06-21 18:38:26 +0000135 (SndParam < 0 ||
Nuno Lopes55fff832012-06-21 15:45:28 +0000136 FTy->getParamType(SndParam)->isIntegerTy(32) ||
137 FTy->getParamType(SndParam)->isIntegerTy(64)))
George Burgess IV278199f2016-04-12 01:05:35 +0000138 return *FnData;
139 return None;
Nuno Lopes55fff832012-06-21 15:45:28 +0000140}
141
George Burgess IVce044892016-12-27 06:10:50 +0000142static Optional<AllocFnsTy> getAllocationData(const Value *V, AllocType AllocTy,
143 const TargetLibraryInfo *TLI,
144 bool LookThroughBitCast = false) {
George Burgess IVed160242016-12-27 06:32:14 +0000145 bool IsNoBuiltinCall;
146 if (const Function *Callee =
147 getCalledFunction(V, LookThroughBitCast, IsNoBuiltinCall))
148 if (!IsNoBuiltinCall)
149 return getAllocationDataForFunction(Callee, AllocTy, TLI);
George Burgess IVce044892016-12-27 06:10:50 +0000150 return None;
151}
152
George Burgess IVccae43a2016-12-23 01:18:09 +0000153static Optional<AllocFnsTy> getAllocationSize(const Value *V,
154 const TargetLibraryInfo *TLI) {
George Burgess IVed160242016-12-27 06:32:14 +0000155 bool IsNoBuiltinCall;
156 const Function *Callee =
157 getCalledFunction(V, /*LookThroughBitCast=*/false, IsNoBuiltinCall);
George Burgess IVce044892016-12-27 06:10:50 +0000158 if (!Callee)
159 return None;
160
George Burgess IVccae43a2016-12-23 01:18:09 +0000161 // Prefer to use existing information over allocsize. This will give us an
162 // accurate AllocTy.
George Burgess IVed160242016-12-27 06:32:14 +0000163 if (!IsNoBuiltinCall)
164 if (Optional<AllocFnsTy> Data =
165 getAllocationDataForFunction(Callee, AnyAlloc, TLI))
166 return Data;
George Burgess IVccae43a2016-12-23 01:18:09 +0000167
George Burgess IVce044892016-12-27 06:10:50 +0000168 Attribute Attr = Callee->getFnAttribute(Attribute::AllocSize);
169 if (Attr == Attribute())
George Burgess IVccae43a2016-12-23 01:18:09 +0000170 return None;
171
George Burgess IVccae43a2016-12-23 01:18:09 +0000172 std::pair<unsigned, Optional<unsigned>> Args = Attr.getAllocSizeArgs();
173
174 AllocFnsTy Result;
175 // Because allocsize only tells us how many bytes are allocated, we're not
176 // really allowed to assume anything, so we use MallocLike.
177 Result.AllocTy = MallocLike;
178 Result.NumParams = Callee->getNumOperands();
179 Result.FstParam = Args.first;
180 Result.SndParam = Args.second.getValueOr(-1);
181 return Result;
182}
183
Nuno Lopes55fff832012-06-21 15:45:28 +0000184static bool hasNoAliasAttr(const Value *V, bool LookThroughBitCast) {
Nuno Lopes9ecc8762012-06-25 16:17:54 +0000185 ImmutableCallSite CS(LookThroughBitCast ? V->stripPointerCasts() : V);
Sanjoy Dasef8ed0c2016-02-09 21:54:18 +0000186 return CS && CS.paramHasAttr(AttributeSet::ReturnIndex, Attribute::NoAlias);
Nuno Lopes55fff832012-06-21 15:45:28 +0000187}
188
189
Nuno Lopesdc6085e2012-06-21 21:25:05 +0000190/// \brief Tests if a value is a call or invoke to a library function that
191/// allocates or reallocates memory (either malloc, calloc, realloc, or strdup
192/// like).
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000193bool llvm::isAllocationFn(const Value *V, const TargetLibraryInfo *TLI,
194 bool LookThroughBitCast) {
George Burgess IV278199f2016-04-12 01:05:35 +0000195 return getAllocationData(V, AnyAlloc, TLI, LookThroughBitCast).hasValue();
Nuno Lopes55fff832012-06-21 15:45:28 +0000196}
197
Nuno Lopesdc6085e2012-06-21 21:25:05 +0000198/// \brief Tests if a value is a call or invoke to a function that returns a
Nuno Lopes181d67e2012-06-28 16:34:03 +0000199/// NoAlias pointer (including malloc/calloc/realloc/strdup-like functions).
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000200bool llvm::isNoAliasFn(const Value *V, const TargetLibraryInfo *TLI,
201 bool LookThroughBitCast) {
Nuno Lopes181d67e2012-06-28 16:34:03 +0000202 // it's safe to consider realloc as noalias since accessing the original
203 // pointer is undefined behavior
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000204 return isAllocationFn(V, TLI, LookThroughBitCast) ||
Nuno Lopes55fff832012-06-21 15:45:28 +0000205 hasNoAliasAttr(V, LookThroughBitCast);
206}
207
Nuno Lopesdc6085e2012-06-21 21:25:05 +0000208/// \brief Tests if a value is a call or invoke to a library function that
209/// allocates uninitialized memory (such as malloc).
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000210bool llvm::isMallocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
211 bool LookThroughBitCast) {
George Burgess IV278199f2016-04-12 01:05:35 +0000212 return getAllocationData(V, MallocLike, TLI, LookThroughBitCast).hasValue();
Nuno Lopes55fff832012-06-21 15:45:28 +0000213}
214
Nuno Lopesdc6085e2012-06-21 21:25:05 +0000215/// \brief Tests if a value is a call or invoke to a library function that
216/// allocates zero-filled memory (such as calloc).
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000217bool llvm::isCallocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
218 bool LookThroughBitCast) {
George Burgess IV278199f2016-04-12 01:05:35 +0000219 return getAllocationData(V, CallocLike, TLI, LookThroughBitCast).hasValue();
Nuno Lopes55fff832012-06-21 15:45:28 +0000220}
221
Nuno Lopesdc6085e2012-06-21 21:25:05 +0000222/// \brief Tests if a value is a call or invoke to a library function that
223/// allocates memory (either malloc, calloc, or strdup like).
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000224bool llvm::isAllocLikeFn(const Value *V, const TargetLibraryInfo *TLI,
225 bool LookThroughBitCast) {
George Burgess IV278199f2016-04-12 01:05:35 +0000226 return getAllocationData(V, AllocLike, TLI, LookThroughBitCast).hasValue();
Nuno Lopes55fff832012-06-21 15:45:28 +0000227}
228
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000229/// extractMallocCall - Returns the corresponding CallInst if the instruction
230/// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we
231/// ignore InvokeInst here.
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000232const CallInst *llvm::extractMallocCall(const Value *I,
233 const TargetLibraryInfo *TLI) {
Craig Topper9f008862014-04-15 04:59:12 +0000234 return isMallocLikeFn(I, TLI) ? dyn_cast<CallInst>(I) : nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000235}
236
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000237static Value *computeArraySize(const CallInst *CI, const DataLayout &DL,
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000238 const TargetLibraryInfo *TLI,
Victor Hernandezfcc77b12009-11-10 08:32:25 +0000239 bool LookThroughSExt = false) {
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000240 if (!CI)
Craig Topper9f008862014-04-15 04:59:12 +0000241 return nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000242
Victor Hernandezf3db9152009-11-07 00:16:28 +0000243 // The size of the malloc's result type must be known to determine array size.
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000244 Type *T = getMallocAllocatedType(CI, TLI);
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000245 if (!T || !T->isSized())
Craig Topper9f008862014-04-15 04:59:12 +0000246 return nullptr;
Victor Hernandez788eaab2009-09-18 19:20:02 +0000247
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000248 unsigned ElementSize = DL.getTypeAllocSize(T);
Chris Lattner229907c2011-07-18 04:54:35 +0000249 if (StructType *ST = dyn_cast<StructType>(T))
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000250 ElementSize = DL.getStructLayout(ST)->getSizeInBytes();
Victor Hernandez788eaab2009-09-18 19:20:02 +0000251
Gabor Greifad7884a2010-06-23 21:41:47 +0000252 // If malloc call's arg can be determined to be a multiple of ElementSize,
Victor Hernandezfcc77b12009-11-10 08:32:25 +0000253 // return the multiple. Otherwise, return NULL.
Gabor Greifad7884a2010-06-23 21:41:47 +0000254 Value *MallocArg = CI->getArgOperand(0);
Craig Topper9f008862014-04-15 04:59:12 +0000255 Value *Multiple = nullptr;
Sanjay Patel490193d2016-07-07 16:19:09 +0000256 if (ComputeMultiple(MallocArg, ElementSize, Multiple, LookThroughSExt))
Victor Hernandezfcc77b12009-11-10 08:32:25 +0000257 return Multiple;
Victor Hernandez788eaab2009-09-18 19:20:02 +0000258
Craig Topper9f008862014-04-15 04:59:12 +0000259 return nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000260}
261
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000262/// getMallocType - Returns the PointerType resulting from the malloc call.
Victor Hernandezf3db9152009-11-07 00:16:28 +0000263/// The PointerType depends on the number of bitcast uses of the malloc call:
264/// 0: PointerType is the calls' return type.
265/// 1: PointerType is the bitcast's result type.
266/// >1: Unique PointerType cannot be determined, return NULL.
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000267PointerType *llvm::getMallocType(const CallInst *CI,
268 const TargetLibraryInfo *TLI) {
269 assert(isMallocLikeFn(CI, TLI) && "getMallocType and not malloc call");
Michael Ilsemand9745242013-03-08 21:03:09 +0000270
Craig Topper9f008862014-04-15 04:59:12 +0000271 PointerType *MallocType = nullptr;
Victor Hernandezf3db9152009-11-07 00:16:28 +0000272 unsigned NumOfBitCastUses = 0;
273
Victor Hernandez788eaab2009-09-18 19:20:02 +0000274 // Determine if CallInst has a bitcast use.
Chandler Carruthcdf47882014-03-09 03:16:01 +0000275 for (Value::const_user_iterator UI = CI->user_begin(), E = CI->user_end();
276 UI != E;)
Victor Hernandezf3db9152009-11-07 00:16:28 +0000277 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(*UI++)) {
278 MallocType = cast<PointerType>(BCI->getDestTy());
279 NumOfBitCastUses++;
280 }
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000281
Victor Hernandezf3db9152009-11-07 00:16:28 +0000282 // Malloc call has 1 bitcast use, so type is the bitcast's destination type.
283 if (NumOfBitCastUses == 1)
284 return MallocType;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000285
Victor Hernandezddc2ce42009-09-22 18:50:03 +0000286 // Malloc call was not bitcast, so type is the malloc function's return type.
Victor Hernandezf3db9152009-11-07 00:16:28 +0000287 if (NumOfBitCastUses == 0)
Victor Hernandez788eaab2009-09-18 19:20:02 +0000288 return cast<PointerType>(CI->getType());
289
290 // Type could not be determined.
Craig Topper9f008862014-04-15 04:59:12 +0000291 return nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000292}
293
Victor Hernandezf3db9152009-11-07 00:16:28 +0000294/// getMallocAllocatedType - Returns the Type allocated by malloc call.
295/// The Type depends on the number of bitcast uses of the malloc call:
296/// 0: PointerType is the malloc calls' return type.
297/// 1: PointerType is the bitcast's result type.
298/// >1: Unique PointerType cannot be determined, return NULL.
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000299Type *llvm::getMallocAllocatedType(const CallInst *CI,
300 const TargetLibraryInfo *TLI) {
301 PointerType *PT = getMallocType(CI, TLI);
Craig Topper9f008862014-04-15 04:59:12 +0000302 return PT ? PT->getElementType() : nullptr;
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000303}
304
Michael Ilsemand9745242013-03-08 21:03:09 +0000305/// getMallocArraySize - Returns the array size of a malloc call. If the
Victor Hernandez0d025422009-10-28 20:18:55 +0000306/// argument passed to malloc is a multiple of the size of the malloced type,
307/// then return that multiple. For non-array mallocs, the multiple is
308/// constant 1. Otherwise, return NULL for mallocs whose array size cannot be
Victor Hernandez13020b12009-10-15 20:14:52 +0000309/// determined.
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000310Value *llvm::getMallocArraySize(CallInst *CI, const DataLayout &DL,
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000311 const TargetLibraryInfo *TLI,
Victor Hernandezfcc77b12009-11-10 08:32:25 +0000312 bool LookThroughSExt) {
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000313 assert(isMallocLikeFn(CI, TLI) && "getMallocArraySize and not malloc call");
Matt Arsenault40dddd72013-10-03 19:50:01 +0000314 return computeArraySize(CI, DL, TLI, LookThroughSExt);
Evan Cheng1d9d4bd2009-09-10 04:36:43 +0000315}
Victor Hernandeze2971492009-10-24 04:23:03 +0000316
Nuno Lopesd2b71e72012-05-03 21:19:58 +0000317
Nuno Lopesd2b71e72012-05-03 21:19:58 +0000318/// extractCallocCall - Returns the corresponding CallInst if the instruction
319/// is a calloc call.
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000320const CallInst *llvm::extractCallocCall(const Value *I,
321 const TargetLibraryInfo *TLI) {
Craig Topper9f008862014-04-15 04:59:12 +0000322 return isCallocLikeFn(I, TLI) ? cast<CallInst>(I) : nullptr;
Nuno Lopesd2b71e72012-05-03 21:19:58 +0000323}
324
Victor Hernandezde5ad422009-10-26 23:43:48 +0000325
Gabor Greif5f5a8642010-06-23 21:51:12 +0000326/// isFreeCall - Returns non-null if the value is a call to the builtin free()
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000327const CallInst *llvm::isFreeCall(const Value *I, const TargetLibraryInfo *TLI) {
Victor Hernandeze2971492009-10-24 04:23:03 +0000328 const CallInst *CI = dyn_cast<CallInst>(I);
Michael Ilseman74ffc272013-03-08 21:15:00 +0000329 if (!CI || isa<IntrinsicInst>(CI))
Craig Topper9f008862014-04-15 04:59:12 +0000330 return nullptr;
Victor Hernandez33188582009-11-03 20:39:35 +0000331 Function *Callee = CI->getCalledFunction();
Richard Smithe78bb122015-01-15 01:00:33 +0000332 if (Callee == nullptr)
Craig Topper9f008862014-04-15 04:59:12 +0000333 return nullptr;
Nick Lewyckyc1f86582011-03-15 07:31:32 +0000334
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000335 StringRef FnName = Callee->getName();
336 LibFunc::Func TLIFn;
337 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn))
Craig Topper9f008862014-04-15 04:59:12 +0000338 return nullptr;
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000339
Richard Smith70523c72013-07-21 23:11:42 +0000340 unsigned ExpectedNumParams;
341 if (TLIFn == LibFunc::free ||
342 TLIFn == LibFunc::ZdlPv || // operator delete(void*)
David Majnemerf6665f62015-12-03 22:45:19 +0000343 TLIFn == LibFunc::ZdaPv || // operator delete[](void*)
344 TLIFn == LibFunc::msvc_delete_ptr32 || // operator delete(void*)
345 TLIFn == LibFunc::msvc_delete_ptr64 || // operator delete(void*)
346 TLIFn == LibFunc::msvc_delete_array_ptr32 || // operator delete[](void*)
347 TLIFn == LibFunc::msvc_delete_array_ptr64) // operator delete[](void*)
Richard Smith70523c72013-07-21 23:11:42 +0000348 ExpectedNumParams = 1;
Richard Smith1ed42292014-10-03 20:17:06 +0000349 else if (TLIFn == LibFunc::ZdlPvj || // delete(void*, uint)
350 TLIFn == LibFunc::ZdlPvm || // delete(void*, ulong)
351 TLIFn == LibFunc::ZdlPvRKSt9nothrow_t || // delete(void*, nothrow)
352 TLIFn == LibFunc::ZdaPvj || // delete[](void*, uint)
353 TLIFn == LibFunc::ZdaPvm || // delete[](void*, ulong)
David Majnemerf6665f62015-12-03 22:45:19 +0000354 TLIFn == LibFunc::ZdaPvRKSt9nothrow_t || // delete[](void*, nothrow)
355 TLIFn == LibFunc::msvc_delete_ptr32_int || // delete(void*, uint)
356 TLIFn == LibFunc::msvc_delete_ptr64_longlong || // delete(void*, ulonglong)
357 TLIFn == LibFunc::msvc_delete_ptr32_nothrow || // delete(void*, nothrow)
358 TLIFn == LibFunc::msvc_delete_ptr64_nothrow || // delete(void*, nothrow)
359 TLIFn == LibFunc::msvc_delete_array_ptr32_int || // delete[](void*, uint)
360 TLIFn == LibFunc::msvc_delete_array_ptr64_longlong || // delete[](void*, ulonglong)
361 TLIFn == LibFunc::msvc_delete_array_ptr32_nothrow || // delete[](void*, nothrow)
362 TLIFn == LibFunc::msvc_delete_array_ptr64_nothrow) // delete[](void*, nothrow)
Richard Smith70523c72013-07-21 23:11:42 +0000363 ExpectedNumParams = 2;
364 else
Craig Topper9f008862014-04-15 04:59:12 +0000365 return nullptr;
Victor Hernandeze2971492009-10-24 04:23:03 +0000366
367 // Check free prototype.
Michael Ilsemand9745242013-03-08 21:03:09 +0000368 // FIXME: workaround for PR5130, this will be obsolete when a nobuiltin
Victor Hernandeze2971492009-10-24 04:23:03 +0000369 // attribute will exist.
Chris Lattner229907c2011-07-18 04:54:35 +0000370 FunctionType *FTy = Callee->getFunctionType();
Victor Hernandez33188582009-11-03 20:39:35 +0000371 if (!FTy->getReturnType()->isVoidTy())
Craig Topper9f008862014-04-15 04:59:12 +0000372 return nullptr;
Richard Smith70523c72013-07-21 23:11:42 +0000373 if (FTy->getNumParams() != ExpectedNumParams)
Craig Topper9f008862014-04-15 04:59:12 +0000374 return nullptr;
Chris Lattner67733f62011-06-18 21:46:23 +0000375 if (FTy->getParamType(0) != Type::getInt8PtrTy(Callee->getContext()))
Craig Topper9f008862014-04-15 04:59:12 +0000376 return nullptr;
Victor Hernandeze2971492009-10-24 04:23:03 +0000377
Gabor Greif5f5a8642010-06-23 21:51:12 +0000378 return CI;
Victor Hernandeze2971492009-10-24 04:23:03 +0000379}
Nuno Lopes55fff832012-06-21 15:45:28 +0000380
381
382
383//===----------------------------------------------------------------------===//
384// Utility functions to compute size of objects.
385//
Petar Jovanovic644b8c12016-04-13 12:25:25 +0000386static APInt getSizeWithOverflow(const SizeOffsetType &Data) {
387 if (Data.second.isNegative() || Data.first.ult(Data.second))
388 return APInt(Data.first.getBitWidth(), 0);
389 return Data.first - Data.second;
390}
Nuno Lopes55fff832012-06-21 15:45:28 +0000391
392/// \brief Compute the size of the object pointed by Ptr. Returns true and the
393/// object size in Size if successful, and false otherwise.
394/// If RoundToAlign is true, then Size is rounded up to the aligment of allocas,
395/// byval arguments, and global variables.
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000396bool llvm::getObjectSize(const Value *Ptr, uint64_t &Size, const DataLayout &DL,
Petar Jovanovic644b8c12016-04-13 12:25:25 +0000397 const TargetLibraryInfo *TLI, bool RoundToAlign,
398 llvm::ObjSizeMode Mode) {
399 ObjectSizeOffsetVisitor Visitor(DL, TLI, Ptr->getContext(),
400 RoundToAlign, Mode);
Nuno Lopes55fff832012-06-21 15:45:28 +0000401 SizeOffsetType Data = Visitor.compute(const_cast<Value*>(Ptr));
402 if (!Visitor.bothKnown(Data))
403 return false;
404
Petar Jovanovic644b8c12016-04-13 12:25:25 +0000405 Size = getSizeWithOverflow(Data).getZExtValue();
Nuno Lopes55fff832012-06-21 15:45:28 +0000406 return true;
407}
408
George Burgess IV3f089142016-12-20 23:46:36 +0000409ConstantInt *llvm::lowerObjectSizeCall(IntrinsicInst *ObjectSize,
410 const DataLayout &DL,
411 const TargetLibraryInfo *TLI,
412 bool MustSucceed) {
413 assert(ObjectSize->getIntrinsicID() == Intrinsic::objectsize &&
414 "ObjectSize must be a call to llvm.objectsize!");
415
416 bool MaxVal = cast<ConstantInt>(ObjectSize->getArgOperand(1))->isZero();
417 ObjSizeMode Mode;
418 // Unless we have to fold this to something, try to be as accurate as
419 // possible.
420 if (MustSucceed)
421 Mode = MaxVal ? ObjSizeMode::Max : ObjSizeMode::Min;
422 else
423 Mode = ObjSizeMode::Exact;
424
425 // FIXME: Does it make sense to just return a failure value if the size won't
426 // fit in the output and `!MustSucceed`?
427 uint64_t Size;
428 auto *ResultType = cast<IntegerType>(ObjectSize->getType());
429 if (getObjectSize(ObjectSize->getArgOperand(0), Size, DL, TLI, false, Mode) &&
430 isUIntN(ResultType->getBitWidth(), Size))
431 return ConstantInt::get(ResultType, Size);
432
433 if (!MustSucceed)
434 return nullptr;
435
436 return ConstantInt::get(ResultType, MaxVal ? -1ULL : 0);
437}
438
Nuno Lopes55fff832012-06-21 15:45:28 +0000439STATISTIC(ObjectVisitorArgument,
440 "Number of arguments with unsolved size and offset");
441STATISTIC(ObjectVisitorLoad,
442 "Number of load instructions with unsolved size and offset");
443
444
445APInt ObjectSizeOffsetVisitor::align(APInt Size, uint64_t Align) {
446 if (RoundToAlign && Align)
Rui Ueyamada00f2f2016-01-14 21:06:47 +0000447 return APInt(IntTyBits, alignTo(Size.getZExtValue(), Align));
Nuno Lopes55fff832012-06-21 15:45:28 +0000448 return Size;
449}
450
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000451ObjectSizeOffsetVisitor::ObjectSizeOffsetVisitor(const DataLayout &DL,
Benjamin Kramer8bcc9712012-08-29 15:32:21 +0000452 const TargetLibraryInfo *TLI,
Nuno Lopes55fff832012-06-21 15:45:28 +0000453 LLVMContext &Context,
Petar Jovanovic644b8c12016-04-13 12:25:25 +0000454 bool RoundToAlign,
455 ObjSizeMode Mode)
456 : DL(DL), TLI(TLI), RoundToAlign(RoundToAlign), Mode(Mode) {
Matt Arsenaultd3ee7af2013-12-14 00:27:48 +0000457 // Pointer size must be rechecked for each object visited since it could have
458 // a different address space.
Nuno Lopes55fff832012-06-21 15:45:28 +0000459}
460
461SizeOffsetType ObjectSizeOffsetVisitor::compute(Value *V) {
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000462 IntTyBits = DL.getPointerTypeSizeInBits(V->getType());
Matt Arsenaultd3ee7af2013-12-14 00:27:48 +0000463 Zero = APInt::getNullValue(IntTyBits);
464
Nuno Lopes55fff832012-06-21 15:45:28 +0000465 V = V->stripPointerCasts();
Nadav Rotemabcc64f2013-04-09 18:16:05 +0000466 if (Instruction *I = dyn_cast<Instruction>(V)) {
467 // If we have already seen this instruction, bail out. Cycles can happen in
468 // unreachable code after constant propagation.
David Blaikie70573dc2014-11-19 07:49:26 +0000469 if (!SeenInsts.insert(I).second)
Nadav Rotemabcc64f2013-04-09 18:16:05 +0000470 return unknown();
Nuno Lopesd896a402012-12-31 20:45:10 +0000471
Benjamin Kramer34764fe2012-08-17 19:26:41 +0000472 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V))
Nadav Rotemabcc64f2013-04-09 18:16:05 +0000473 return visitGEPOperator(*GEP);
474 return visit(*I);
Benjamin Kramer34764fe2012-08-17 19:26:41 +0000475 }
Nuno Lopes55fff832012-06-21 15:45:28 +0000476 if (Argument *A = dyn_cast<Argument>(V))
477 return visitArgument(*A);
478 if (ConstantPointerNull *P = dyn_cast<ConstantPointerNull>(V))
479 return visitConstantPointerNull(*P);
Nuno Lopese9d6dbf2012-12-31 16:23:48 +0000480 if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V))
481 return visitGlobalAlias(*GA);
Nuno Lopes55fff832012-06-21 15:45:28 +0000482 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
483 return visitGlobalVariable(*GV);
484 if (UndefValue *UV = dyn_cast<UndefValue>(V))
485 return visitUndefValue(*UV);
Benjamin Kramer34764fe2012-08-17 19:26:41 +0000486 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
Nuno Lopes55fff832012-06-21 15:45:28 +0000487 if (CE->getOpcode() == Instruction::IntToPtr)
488 return unknown(); // clueless
Nadav Rotemabcc64f2013-04-09 18:16:05 +0000489 if (CE->getOpcode() == Instruction::GetElementPtr)
490 return visitGEPOperator(cast<GEPOperator>(*CE));
Benjamin Kramer34764fe2012-08-17 19:26:41 +0000491 }
Nuno Lopes55fff832012-06-21 15:45:28 +0000492
493 DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: " << *V
494 << '\n');
495 return unknown();
496}
497
498SizeOffsetType ObjectSizeOffsetVisitor::visitAllocaInst(AllocaInst &I) {
499 if (!I.getAllocatedType()->isSized())
500 return unknown();
501
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000502 APInt Size(IntTyBits, DL.getTypeAllocSize(I.getAllocatedType()));
Nuno Lopes55fff832012-06-21 15:45:28 +0000503 if (!I.isArrayAllocation())
504 return std::make_pair(align(Size, I.getAlignment()), Zero);
505
506 Value *ArraySize = I.getArraySize();
507 if (const ConstantInt *C = dyn_cast<ConstantInt>(ArraySize)) {
508 Size *= C->getValue().zextOrSelf(IntTyBits);
509 return std::make_pair(align(Size, I.getAlignment()), Zero);
510 }
511 return unknown();
512}
513
514SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) {
Sanjay Patel490193d2016-07-07 16:19:09 +0000515 // No interprocedural analysis is done at the moment.
Reid Kleckner26af2ca2014-01-28 02:38:36 +0000516 if (!A.hasByValOrInAllocaAttr()) {
Nuno Lopes55fff832012-06-21 15:45:28 +0000517 ++ObjectVisitorArgument;
518 return unknown();
519 }
520 PointerType *PT = cast<PointerType>(A.getType());
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000521 APInt Size(IntTyBits, DL.getTypeAllocSize(PT->getElementType()));
Nuno Lopes55fff832012-06-21 15:45:28 +0000522 return std::make_pair(align(Size, A.getParamAlignment()), Zero);
523}
524
525SizeOffsetType ObjectSizeOffsetVisitor::visitCallSite(CallSite CS) {
George Burgess IVccae43a2016-12-23 01:18:09 +0000526 Optional<AllocFnsTy> FnData = getAllocationSize(CS.getInstruction(), TLI);
Nuno Lopes55fff832012-06-21 15:45:28 +0000527 if (!FnData)
528 return unknown();
529
Sanjay Patel490193d2016-07-07 16:19:09 +0000530 // Handle strdup-like functions separately.
Nuno Lopes55fff832012-06-21 15:45:28 +0000531 if (FnData->AllocTy == StrDupLike) {
Nuno Lopes2a4b09c2012-07-24 16:28:13 +0000532 APInt Size(IntTyBits, GetStringLength(CS.getArgument(0)));
533 if (!Size)
534 return unknown();
535
Sanjay Patel490193d2016-07-07 16:19:09 +0000536 // Strndup limits strlen.
Nuno Lopes2a4b09c2012-07-24 16:28:13 +0000537 if (FnData->FstParam > 0) {
George Burgess IV278199f2016-04-12 01:05:35 +0000538 ConstantInt *Arg =
539 dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
Nuno Lopes2a4b09c2012-07-24 16:28:13 +0000540 if (!Arg)
541 return unknown();
542
543 APInt MaxSize = Arg->getValue().zextOrSelf(IntTyBits);
544 if (Size.ugt(MaxSize))
545 Size = MaxSize + 1;
546 }
547 return std::make_pair(Size, Zero);
Nuno Lopes55fff832012-06-21 15:45:28 +0000548 }
549
550 ConstantInt *Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam));
551 if (!Arg)
552 return unknown();
553
George Burgess IV278199f2016-04-12 01:05:35 +0000554 // When we're compiling N-bit code, and the user uses parameters that are
555 // greater than N bits (e.g. uint64_t on a 32-bit build), we can run into
556 // trouble with APInt size issues. This function handles resizing + overflow
557 // checks for us.
558 auto CheckedZextOrTrunc = [&](APInt &I) {
559 // More bits than we can handle. Checking the bit width isn't necessary, but
560 // it's faster than checking active bits, and should give `false` in the
561 // vast majority of cases.
562 if (I.getBitWidth() > IntTyBits && I.getActiveBits() > IntTyBits)
563 return false;
564 if (I.getBitWidth() != IntTyBits)
565 I = I.zextOrTrunc(IntTyBits);
566 return true;
567 };
568
569 APInt Size = Arg->getValue();
570 if (!CheckedZextOrTrunc(Size))
571 return unknown();
572
Sanjay Patel490193d2016-07-07 16:19:09 +0000573 // Size is determined by just 1 parameter.
Nuno Lopesf06b7312012-06-21 18:38:26 +0000574 if (FnData->SndParam < 0)
Nuno Lopes55fff832012-06-21 15:45:28 +0000575 return std::make_pair(Size, Zero);
576
577 Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->SndParam));
578 if (!Arg)
579 return unknown();
580
George Burgess IV278199f2016-04-12 01:05:35 +0000581 APInt NumElems = Arg->getValue();
582 if (!CheckedZextOrTrunc(NumElems))
583 return unknown();
584
585 bool Overflow;
586 Size = Size.umul_ov(NumElems, Overflow);
587 return Overflow ? unknown() : std::make_pair(Size, Zero);
Nuno Lopes55fff832012-06-21 15:45:28 +0000588
589 // TODO: handle more standard functions (+ wchar cousins):
Nuno Lopesf0626f22012-07-25 18:49:28 +0000590 // - strdup / strndup
Nuno Lopes55fff832012-06-21 15:45:28 +0000591 // - strcpy / strncpy
592 // - strcat / strncat
593 // - memcpy / memmove
Nuno Lopesf0626f22012-07-25 18:49:28 +0000594 // - strcat / strncat
Nuno Lopes55fff832012-06-21 15:45:28 +0000595 // - memset
596}
597
598SizeOffsetType
599ObjectSizeOffsetVisitor::visitConstantPointerNull(ConstantPointerNull&) {
600 return std::make_pair(Zero, Zero);
601}
602
603SizeOffsetType
Nuno Lopes181d67e2012-06-28 16:34:03 +0000604ObjectSizeOffsetVisitor::visitExtractElementInst(ExtractElementInst&) {
605 return unknown();
606}
607
608SizeOffsetType
Nuno Lopes55fff832012-06-21 15:45:28 +0000609ObjectSizeOffsetVisitor::visitExtractValueInst(ExtractValueInst&) {
610 // Easy cases were already folded by previous passes.
611 return unknown();
612}
613
614SizeOffsetType ObjectSizeOffsetVisitor::visitGEPOperator(GEPOperator &GEP) {
615 SizeOffsetType PtrData = compute(GEP.getPointerOperand());
Nuno Lopesb6ad9822012-12-30 16:25:48 +0000616 APInt Offset(IntTyBits, 0);
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000617 if (!bothKnown(PtrData) || !GEP.accumulateConstantOffset(DL, Offset))
Nuno Lopes55fff832012-06-21 15:45:28 +0000618 return unknown();
619
Nuno Lopes55fff832012-06-21 15:45:28 +0000620 return std::make_pair(PtrData.first, PtrData.second + Offset);
621}
622
Nuno Lopese9d6dbf2012-12-31 16:23:48 +0000623SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalAlias(GlobalAlias &GA) {
Sanjoy Das5ce32722016-04-08 00:48:30 +0000624 if (GA.isInterposable())
Nuno Lopese9d6dbf2012-12-31 16:23:48 +0000625 return unknown();
626 return compute(GA.getAliasee());
627}
628
Nuno Lopes55fff832012-06-21 15:45:28 +0000629SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalVariable(GlobalVariable &GV){
630 if (!GV.hasDefinitiveInitializer())
631 return unknown();
632
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000633 APInt Size(IntTyBits, DL.getTypeAllocSize(GV.getType()->getElementType()));
Nuno Lopes55fff832012-06-21 15:45:28 +0000634 return std::make_pair(align(Size, GV.getAlignment()), Zero);
635}
636
637SizeOffsetType ObjectSizeOffsetVisitor::visitIntToPtrInst(IntToPtrInst&) {
638 // clueless
639 return unknown();
640}
641
642SizeOffsetType ObjectSizeOffsetVisitor::visitLoadInst(LoadInst&) {
643 ++ObjectVisitorLoad;
644 return unknown();
645}
646
Nadav Rotemabcc64f2013-04-09 18:16:05 +0000647SizeOffsetType ObjectSizeOffsetVisitor::visitPHINode(PHINode&) {
648 // too complex to analyze statically.
649 return unknown();
Nuno Lopes55fff832012-06-21 15:45:28 +0000650}
651
652SizeOffsetType ObjectSizeOffsetVisitor::visitSelectInst(SelectInst &I) {
653 SizeOffsetType TrueSide = compute(I.getTrueValue());
654 SizeOffsetType FalseSide = compute(I.getFalseValue());
Petar Jovanovic644b8c12016-04-13 12:25:25 +0000655 if (bothKnown(TrueSide) && bothKnown(FalseSide)) {
656 if (TrueSide == FalseSide) {
657 return TrueSide;
658 }
659
660 APInt TrueResult = getSizeWithOverflow(TrueSide);
661 APInt FalseResult = getSizeWithOverflow(FalseSide);
662
663 if (TrueResult == FalseResult) {
664 return TrueSide;
665 }
666 if (Mode == ObjSizeMode::Min) {
667 if (TrueResult.slt(FalseResult))
668 return TrueSide;
669 return FalseSide;
670 }
671 if (Mode == ObjSizeMode::Max) {
672 if (TrueResult.sgt(FalseResult))
673 return TrueSide;
674 return FalseSide;
675 }
676 }
Nuno Lopes55fff832012-06-21 15:45:28 +0000677 return unknown();
678}
679
680SizeOffsetType ObjectSizeOffsetVisitor::visitUndefValue(UndefValue&) {
681 return std::make_pair(Zero, Zero);
682}
683
684SizeOffsetType ObjectSizeOffsetVisitor::visitInstruction(Instruction &I) {
685 DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I << '\n');
686 return unknown();
687}
688
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000689ObjectSizeOffsetEvaluator::ObjectSizeOffsetEvaluator(
690 const DataLayout &DL, const TargetLibraryInfo *TLI, LLVMContext &Context,
691 bool RoundToAlign)
692 : DL(DL), TLI(TLI), Context(Context), Builder(Context, TargetFolder(DL)),
693 RoundToAlign(RoundToAlign) {
Matt Arsenaultd3ee7af2013-12-14 00:27:48 +0000694 // IntTy and Zero must be set for each compute() since the address space may
695 // be different for later objects.
Nuno Lopes55fff832012-06-21 15:45:28 +0000696}
697
698SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute(Value *V) {
Matt Arsenaultd3ee7af2013-12-14 00:27:48 +0000699 // XXX - Are vectors of pointers possible here?
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000700 IntTy = cast<IntegerType>(DL.getIntPtrType(V->getType()));
Matt Arsenaultd3ee7af2013-12-14 00:27:48 +0000701 Zero = ConstantInt::get(IntTy, 0);
702
Nuno Lopes55fff832012-06-21 15:45:28 +0000703 SizeOffsetEvalType Result = compute_(V);
704
705 if (!bothKnown(Result)) {
Sanjay Patel490193d2016-07-07 16:19:09 +0000706 // Erase everything that was computed in this iteration from the cache, so
Nuno Lopes55fff832012-06-21 15:45:28 +0000707 // that no dangling references are left behind. We could be a bit smarter if
708 // we kept a dependency graph. It's probably not worth the complexity.
Benjamin Krameraa209152016-06-26 17:27:42 +0000709 for (const Value *SeenVal : SeenVals) {
710 CacheMapTy::iterator CacheIt = CacheMap.find(SeenVal);
Nuno Lopes55fff832012-06-21 15:45:28 +0000711 // non-computable results can be safely cached
712 if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second))
713 CacheMap.erase(CacheIt);
714 }
715 }
716
717 SeenVals.clear();
718 return Result;
719}
720
721SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute_(Value *V) {
Nuno Lopes340b0462013-10-24 09:17:24 +0000722 ObjectSizeOffsetVisitor Visitor(DL, TLI, Context, RoundToAlign);
Nuno Lopes55fff832012-06-21 15:45:28 +0000723 SizeOffsetType Const = Visitor.compute(V);
724 if (Visitor.bothKnown(Const))
725 return std::make_pair(ConstantInt::get(Context, Const.first),
726 ConstantInt::get(Context, Const.second));
727
728 V = V->stripPointerCasts();
729
Sanjay Patel490193d2016-07-07 16:19:09 +0000730 // Check cache.
Nuno Lopes55fff832012-06-21 15:45:28 +0000731 CacheMapTy::iterator CacheIt = CacheMap.find(V);
732 if (CacheIt != CacheMap.end())
733 return CacheIt->second;
734
Sanjay Patel490193d2016-07-07 16:19:09 +0000735 // Always generate code immediately before the instruction being
736 // processed, so that the generated code dominates the same BBs.
Duncan P. N. Exon Smith5a82c912015-10-10 00:53:03 +0000737 BuilderTy::InsertPointGuard Guard(Builder);
Nuno Lopes55fff832012-06-21 15:45:28 +0000738 if (Instruction *I = dyn_cast<Instruction>(V))
739 Builder.SetInsertPoint(I);
740
Sanjay Patel490193d2016-07-07 16:19:09 +0000741 // Now compute the size and offset.
Nuno Lopes55fff832012-06-21 15:45:28 +0000742 SizeOffsetEvalType Result;
Benjamin Kramer155c9d52013-09-29 19:39:13 +0000743
744 // Record the pointers that were handled in this run, so that they can be
745 // cleaned later if something fails. We also use this set to break cycles that
746 // can occur in dead code.
David Blaikie70573dc2014-11-19 07:49:26 +0000747 if (!SeenVals.insert(V).second) {
Benjamin Kramer155c9d52013-09-29 19:39:13 +0000748 Result = unknown();
749 } else if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
Nuno Lopes55fff832012-06-21 15:45:28 +0000750 Result = visitGEPOperator(*GEP);
751 } else if (Instruction *I = dyn_cast<Instruction>(V)) {
752 Result = visit(*I);
753 } else if (isa<Argument>(V) ||
754 (isa<ConstantExpr>(V) &&
755 cast<ConstantExpr>(V)->getOpcode() == Instruction::IntToPtr) ||
Nuno Lopese9d6dbf2012-12-31 16:23:48 +0000756 isa<GlobalAlias>(V) ||
Nuno Lopes55fff832012-06-21 15:45:28 +0000757 isa<GlobalVariable>(V)) {
Sanjay Patel490193d2016-07-07 16:19:09 +0000758 // Ignore values where we cannot do more than ObjectSizeVisitor.
Nuno Lopes55fff832012-06-21 15:45:28 +0000759 Result = unknown();
760 } else {
761 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: "
762 << *V << '\n');
763 Result = unknown();
764 }
765
Nuno Lopes55fff832012-06-21 15:45:28 +0000766 // Don't reuse CacheIt since it may be invalid at this point.
767 CacheMap[V] = Result;
768 return Result;
769}
770
771SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitAllocaInst(AllocaInst &I) {
772 if (!I.getAllocatedType()->isSized())
773 return unknown();
774
775 // must be a VLA
776 assert(I.isArrayAllocation());
777 Value *ArraySize = I.getArraySize();
778 Value *Size = ConstantInt::get(ArraySize->getType(),
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000779 DL.getTypeAllocSize(I.getAllocatedType()));
Nuno Lopes55fff832012-06-21 15:45:28 +0000780 Size = Builder.CreateMul(Size, ArraySize);
781 return std::make_pair(Size, Zero);
782}
783
784SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitCallSite(CallSite CS) {
George Burgess IVccae43a2016-12-23 01:18:09 +0000785 Optional<AllocFnsTy> FnData = getAllocationSize(CS.getInstruction(), TLI);
Nuno Lopes55fff832012-06-21 15:45:28 +0000786 if (!FnData)
787 return unknown();
788
Sanjay Patel490193d2016-07-07 16:19:09 +0000789 // Handle strdup-like functions separately.
Nuno Lopes55fff832012-06-21 15:45:28 +0000790 if (FnData->AllocTy == StrDupLike) {
Nuno Lopesf0626f22012-07-25 18:49:28 +0000791 // TODO
792 return unknown();
Nuno Lopes55fff832012-06-21 15:45:28 +0000793 }
794
Nuno Lopesa6aa3d32012-06-21 16:47:58 +0000795 Value *FirstArg = CS.getArgument(FnData->FstParam);
796 FirstArg = Builder.CreateZExt(FirstArg, IntTy);
Nuno Lopesf06b7312012-06-21 18:38:26 +0000797 if (FnData->SndParam < 0)
Nuno Lopes55fff832012-06-21 15:45:28 +0000798 return std::make_pair(FirstArg, Zero);
799
800 Value *SecondArg = CS.getArgument(FnData->SndParam);
Nuno Lopesa6aa3d32012-06-21 16:47:58 +0000801 SecondArg = Builder.CreateZExt(SecondArg, IntTy);
Nuno Lopes55fff832012-06-21 15:45:28 +0000802 Value *Size = Builder.CreateMul(FirstArg, SecondArg);
803 return std::make_pair(Size, Zero);
804
805 // TODO: handle more standard functions (+ wchar cousins):
Nuno Lopesf0626f22012-07-25 18:49:28 +0000806 // - strdup / strndup
Nuno Lopes55fff832012-06-21 15:45:28 +0000807 // - strcpy / strncpy
808 // - strcat / strncat
809 // - memcpy / memmove
Nuno Lopesf0626f22012-07-25 18:49:28 +0000810 // - strcat / strncat
Nuno Lopes55fff832012-06-21 15:45:28 +0000811 // - memset
812}
813
814SizeOffsetEvalType
Nuno Lopes181d67e2012-06-28 16:34:03 +0000815ObjectSizeOffsetEvaluator::visitExtractElementInst(ExtractElementInst&) {
816 return unknown();
817}
818
819SizeOffsetEvalType
820ObjectSizeOffsetEvaluator::visitExtractValueInst(ExtractValueInst&) {
821 return unknown();
822}
823
824SizeOffsetEvalType
Nuno Lopes55fff832012-06-21 15:45:28 +0000825ObjectSizeOffsetEvaluator::visitGEPOperator(GEPOperator &GEP) {
826 SizeOffsetEvalType PtrData = compute_(GEP.getPointerOperand());
827 if (!bothKnown(PtrData))
828 return unknown();
829
Mehdi Aminia28d91d2015-03-10 02:37:25 +0000830 Value *Offset = EmitGEPOffset(&Builder, DL, &GEP, /*NoAssumptions=*/true);
Nuno Lopes55fff832012-06-21 15:45:28 +0000831 Offset = Builder.CreateAdd(PtrData.second, Offset);
832 return std::make_pair(PtrData.first, Offset);
833}
834
835SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitIntToPtrInst(IntToPtrInst&) {
836 // clueless
837 return unknown();
838}
839
840SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitLoadInst(LoadInst&) {
841 return unknown();
842}
843
844SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) {
Sanjay Patel490193d2016-07-07 16:19:09 +0000845 // Create 2 PHIs: one for size and another for offset.
Nuno Lopes55fff832012-06-21 15:45:28 +0000846 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
847 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
848
Sanjay Patel490193d2016-07-07 16:19:09 +0000849 // Insert right away in the cache to handle recursive PHIs.
Nuno Lopes55fff832012-06-21 15:45:28 +0000850 CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI);
851
Sanjay Patel490193d2016-07-07 16:19:09 +0000852 // Compute offset/size for each PHI incoming pointer.
Nuno Lopes55fff832012-06-21 15:45:28 +0000853 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) {
Duncan P. N. Exon Smith5a82c912015-10-10 00:53:03 +0000854 Builder.SetInsertPoint(&*PHI.getIncomingBlock(i)->getFirstInsertionPt());
Nuno Lopes55fff832012-06-21 15:45:28 +0000855 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i));
856
857 if (!bothKnown(EdgeData)) {
858 OffsetPHI->replaceAllUsesWith(UndefValue::get(IntTy));
859 OffsetPHI->eraseFromParent();
860 SizePHI->replaceAllUsesWith(UndefValue::get(IntTy));
861 SizePHI->eraseFromParent();
862 return unknown();
863 }
864 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
865 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));
866 }
Nuno Lopes9291ff42012-07-03 17:13:25 +0000867
868 Value *Size = SizePHI, *Offset = OffsetPHI, *Tmp;
869 if ((Tmp = SizePHI->hasConstantValue())) {
870 Size = Tmp;
871 SizePHI->replaceAllUsesWith(Size);
872 SizePHI->eraseFromParent();
873 }
874 if ((Tmp = OffsetPHI->hasConstantValue())) {
875 Offset = Tmp;
876 OffsetPHI->replaceAllUsesWith(Offset);
877 OffsetPHI->eraseFromParent();
878 }
879 return std::make_pair(Size, Offset);
Nuno Lopes55fff832012-06-21 15:45:28 +0000880}
881
882SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitSelectInst(SelectInst &I) {
883 SizeOffsetEvalType TrueSide = compute_(I.getTrueValue());
884 SizeOffsetEvalType FalseSide = compute_(I.getFalseValue());
885
886 if (!bothKnown(TrueSide) || !bothKnown(FalseSide))
887 return unknown();
888 if (TrueSide == FalseSide)
889 return TrueSide;
890
891 Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first,
892 FalseSide.first);
893 Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second,
894 FalseSide.second);
895 return std::make_pair(Size, Offset);
896}
897
898SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitInstruction(Instruction &I) {
899 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I <<'\n');
900 return unknown();
901}