1 //===- MemoryBuiltins.cpp - Identify calls to memory builtins -------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This family of functions identifies calls to builtin functions that allocate 10 // or free memory. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "llvm/Analysis/MemoryBuiltins.h" 15 #include "llvm/ADT/APInt.h" 16 #include "llvm/ADT/None.h" 17 #include "llvm/ADT/Optional.h" 18 #include "llvm/ADT/STLExtras.h" 19 #include "llvm/ADT/Statistic.h" 20 #include "llvm/ADT/StringRef.h" 21 #include "llvm/Analysis/TargetFolder.h" 22 #include "llvm/Analysis/TargetLibraryInfo.h" 23 #include "llvm/Analysis/Utils/Local.h" 24 #include "llvm/Analysis/ValueTracking.h" 25 #include "llvm/IR/Argument.h" 26 #include "llvm/IR/Attributes.h" 27 #include "llvm/IR/Constants.h" 28 #include "llvm/IR/DataLayout.h" 29 #include "llvm/IR/DerivedTypes.h" 30 #include "llvm/IR/Function.h" 31 #include "llvm/IR/GlobalAlias.h" 32 #include "llvm/IR/GlobalVariable.h" 33 #include "llvm/IR/Instruction.h" 34 #include "llvm/IR/Instructions.h" 35 #include "llvm/IR/IntrinsicInst.h" 36 #include "llvm/IR/Operator.h" 37 #include "llvm/IR/Type.h" 38 #include "llvm/IR/Value.h" 39 #include "llvm/Support/Casting.h" 40 #include "llvm/Support/Debug.h" 41 #include "llvm/Support/MathExtras.h" 42 #include "llvm/Support/raw_ostream.h" 43 #include <cassert> 44 #include <cstdint> 45 #include <iterator> 46 #include <utility> 47 48 using namespace llvm; 49 50 #define DEBUG_TYPE "memory-builtins" 51 52 enum AllocType : uint8_t { 53 OpNewLike = 1<<0, // allocates; never returns null 54 MallocLike = 1<<1 | OpNewLike, // allocates; may return null 55 CallocLike = 1<<2, // allocates + bzero 56 ReallocLike = 1<<3, // reallocates 57 StrDupLike = 1<<4, 58 MallocOrCallocLike = MallocLike | CallocLike, 59 AllocLike = MallocLike | CallocLike | StrDupLike, 60 AnyAlloc = AllocLike | ReallocLike 61 }; 62 63 struct AllocFnsTy { 64 AllocType AllocTy; 65 unsigned NumParams; 66 // First and Second size parameters (or -1 if unused) 67 int FstParam, SndParam; 68 }; 69 70 // FIXME: certain users need more information. E.g., SimplifyLibCalls needs to 71 // know which functions are nounwind, noalias, nocapture parameters, etc. 72 static const std::pair<LibFunc, AllocFnsTy> AllocationFnData[] = { 73 {LibFunc_malloc, {MallocLike, 1, 0, -1}}, 74 {LibFunc_valloc, {MallocLike, 1, 0, -1}}, 75 {LibFunc_Znwj, {OpNewLike, 1, 0, -1}}, // new(unsigned int) 76 {LibFunc_ZnwjRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new(unsigned int, nothrow) 77 {LibFunc_ZnwjSt11align_val_t, {OpNewLike, 2, 0, -1}}, // new(unsigned int, align_val_t) 78 {LibFunc_ZnwjSt11align_val_tRKSt9nothrow_t, // new(unsigned int, align_val_t, nothrow) 79 {MallocLike, 3, 0, -1}}, 80 {LibFunc_Znwm, {OpNewLike, 1, 0, -1}}, // new(unsigned long) 81 {LibFunc_ZnwmRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new(unsigned long, nothrow) 82 {LibFunc_ZnwmSt11align_val_t, {OpNewLike, 2, 0, -1}}, // new(unsigned long, align_val_t) 83 {LibFunc_ZnwmSt11align_val_tRKSt9nothrow_t, // new(unsigned long, align_val_t, nothrow) 84 {MallocLike, 3, 0, -1}}, 85 {LibFunc_Znaj, {OpNewLike, 1, 0, -1}}, // new[](unsigned int) 86 {LibFunc_ZnajRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new[](unsigned int, nothrow) 87 {LibFunc_ZnajSt11align_val_t, {OpNewLike, 2, 0, -1}}, // new[](unsigned int, align_val_t) 88 {LibFunc_ZnajSt11align_val_tRKSt9nothrow_t, // new[](unsigned int, align_val_t, nothrow) 89 {MallocLike, 3, 0, -1}}, 90 {LibFunc_Znam, {OpNewLike, 1, 0, -1}}, // new[](unsigned long) 91 {LibFunc_ZnamRKSt9nothrow_t, {MallocLike, 2, 0, -1}}, // new[](unsigned long, nothrow) 92 {LibFunc_ZnamSt11align_val_t, {OpNewLike, 2, 0, -1}}, // new[](unsigned long, align_val_t) 93 {LibFunc_ZnamSt11align_val_tRKSt9nothrow_t, // new[](unsigned long, align_val_t, nothrow) 94 {MallocLike, 3, 0, -1}}, 95 {LibFunc_msvc_new_int, {OpNewLike, 1, 0, -1}}, // new(unsigned int) 96 {LibFunc_msvc_new_int_nothrow, {MallocLike, 2, 0, -1}}, // new(unsigned int, nothrow) 97 {LibFunc_msvc_new_longlong, {OpNewLike, 1, 0, -1}}, // new(unsigned long long) 98 {LibFunc_msvc_new_longlong_nothrow, {MallocLike, 2, 0, -1}}, // new(unsigned long long, nothrow) 99 {LibFunc_msvc_new_array_int, {OpNewLike, 1, 0, -1}}, // new[](unsigned int) 100 {LibFunc_msvc_new_array_int_nothrow, {MallocLike, 2, 0, -1}}, // new[](unsigned int, nothrow) 101 {LibFunc_msvc_new_array_longlong, {OpNewLike, 1, 0, -1}}, // new[](unsigned long long) 102 {LibFunc_msvc_new_array_longlong_nothrow, {MallocLike, 2, 0, -1}}, // new[](unsigned long long, nothrow) 103 {LibFunc_calloc, {CallocLike, 2, 0, 1}}, 104 {LibFunc_realloc, {ReallocLike, 2, 1, -1}}, 105 {LibFunc_reallocf, {ReallocLike, 2, 1, -1}}, 106 {LibFunc_strdup, {StrDupLike, 1, -1, -1}}, 107 {LibFunc_strndup, {StrDupLike, 2, 1, -1}} 108 // TODO: Handle "int posix_memalign(void **, size_t, size_t)" 109 }; 110 111 static const Function *getCalledFunction(const Value *V, bool LookThroughBitCast, 112 bool &IsNoBuiltin) { 113 // Don't care about intrinsics in this case. 114 if (isa<IntrinsicInst>(V)) 115 return nullptr; 116 117 if (LookThroughBitCast) 118 V = V->stripPointerCasts(); 119 120 ImmutableCallSite CS(V); 121 if (!CS.getInstruction()) 122 return nullptr; 123 124 IsNoBuiltin = CS.isNoBuiltin(); 125 126 if (const Function *Callee = CS.getCalledFunction()) 127 return Callee; 128 return nullptr; 129 } 130 131 /// Returns the allocation data for the given value if it's either a call to a 132 /// known allocation function, or a call to a function with the allocsize 133 /// attribute. 134 static Optional<AllocFnsTy> 135 getAllocationDataForFunction(const Function *Callee, AllocType AllocTy, 136 const TargetLibraryInfo *TLI) { 137 // Make sure that the function is available. 138 StringRef FnName = Callee->getName(); 139 LibFunc TLIFn; 140 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn)) 141 return None; 142 143 const auto *Iter = find_if( 144 AllocationFnData, [TLIFn](const std::pair<LibFunc, AllocFnsTy> &P) { 145 return P.first == TLIFn; 146 }); 147 148 if (Iter == std::end(AllocationFnData)) 149 return None; 150 151 const AllocFnsTy *FnData = &Iter->second; 152 if ((FnData->AllocTy & AllocTy) != FnData->AllocTy) 153 return None; 154 155 // Check function prototype. 156 int FstParam = FnData->FstParam; 157 int SndParam = FnData->SndParam; 158 FunctionType *FTy = Callee->getFunctionType(); 159 160 if (FTy->getReturnType() == Type::getInt8PtrTy(FTy->getContext()) && 161 FTy->getNumParams() == FnData->NumParams && 162 (FstParam < 0 || 163 (FTy->getParamType(FstParam)->isIntegerTy(32) || 164 FTy->getParamType(FstParam)->isIntegerTy(64))) && 165 (SndParam < 0 || 166 FTy->getParamType(SndParam)->isIntegerTy(32) || 167 FTy->getParamType(SndParam)->isIntegerTy(64))) 168 return *FnData; 169 return None; 170 } 171 172 static Optional<AllocFnsTy> getAllocationData(const Value *V, AllocType AllocTy, 173 const TargetLibraryInfo *TLI, 174 bool LookThroughBitCast = false) { 175 bool IsNoBuiltinCall; 176 if (const Function *Callee = 177 getCalledFunction(V, LookThroughBitCast, IsNoBuiltinCall)) 178 if (!IsNoBuiltinCall) 179 return getAllocationDataForFunction(Callee, AllocTy, TLI); 180 return None; 181 } 182 183 static Optional<AllocFnsTy> getAllocationSize(const Value *V, 184 const TargetLibraryInfo *TLI) { 185 bool IsNoBuiltinCall; 186 const Function *Callee = 187 getCalledFunction(V, /*LookThroughBitCast=*/false, IsNoBuiltinCall); 188 if (!Callee) 189 return None; 190 191 // Prefer to use existing information over allocsize. This will give us an 192 // accurate AllocTy. 193 if (!IsNoBuiltinCall) 194 if (Optional<AllocFnsTy> Data = 195 getAllocationDataForFunction(Callee, AnyAlloc, TLI)) 196 return Data; 197 198 Attribute Attr = Callee->getFnAttribute(Attribute::AllocSize); 199 if (Attr == Attribute()) 200 return None; 201 202 std::pair<unsigned, Optional<unsigned>> Args = Attr.getAllocSizeArgs(); 203 204 AllocFnsTy Result; 205 // Because allocsize only tells us how many bytes are allocated, we're not 206 // really allowed to assume anything, so we use MallocLike. 207 Result.AllocTy = MallocLike; 208 Result.NumParams = Callee->getNumOperands(); 209 Result.FstParam = Args.first; 210 Result.SndParam = Args.second.getValueOr(-1); 211 return Result; 212 } 213 214 static bool hasNoAliasAttr(const Value *V, bool LookThroughBitCast) { 215 ImmutableCallSite CS(LookThroughBitCast ? V->stripPointerCasts() : V); 216 return CS && CS.hasRetAttr(Attribute::NoAlias); 217 } 218 219 /// Tests if a value is a call or invoke to a library function that 220 /// allocates or reallocates memory (either malloc, calloc, realloc, or strdup 221 /// like). 222 bool llvm::isAllocationFn(const Value *V, const TargetLibraryInfo *TLI, 223 bool LookThroughBitCast) { 224 return getAllocationData(V, AnyAlloc, TLI, LookThroughBitCast).hasValue(); 225 } 226 227 /// Tests if a value is a call or invoke to a function that returns a 228 /// NoAlias pointer (including malloc/calloc/realloc/strdup-like functions). 229 bool llvm::isNoAliasFn(const Value *V, const TargetLibraryInfo *TLI, 230 bool LookThroughBitCast) { 231 // it's safe to consider realloc as noalias since accessing the original 232 // pointer is undefined behavior 233 return isAllocationFn(V, TLI, LookThroughBitCast) || 234 hasNoAliasAttr(V, LookThroughBitCast); 235 } 236 237 /// Tests if a value is a call or invoke to a library function that 238 /// allocates uninitialized memory (such as malloc). 239 bool llvm::isMallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 240 bool LookThroughBitCast) { 241 return getAllocationData(V, MallocLike, TLI, LookThroughBitCast).hasValue(); 242 } 243 244 /// Tests if a value is a call or invoke to a library function that 245 /// allocates zero-filled memory (such as calloc). 246 bool llvm::isCallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 247 bool LookThroughBitCast) { 248 return getAllocationData(V, CallocLike, TLI, LookThroughBitCast).hasValue(); 249 } 250 251 /// Tests if a value is a call or invoke to a library function that 252 /// allocates memory similar to malloc or calloc. 253 bool llvm::isMallocOrCallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 254 bool LookThroughBitCast) { 255 return getAllocationData(V, MallocOrCallocLike, TLI, 256 LookThroughBitCast).hasValue(); 257 } 258 259 /// Tests if a value is a call or invoke to a library function that 260 /// allocates memory (either malloc, calloc, or strdup like). 261 bool llvm::isAllocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 262 bool LookThroughBitCast) { 263 return getAllocationData(V, AllocLike, TLI, LookThroughBitCast).hasValue(); 264 } 265 266 /// extractMallocCall - Returns the corresponding CallInst if the instruction 267 /// is a malloc call. Since CallInst::CreateMalloc() only creates calls, we 268 /// ignore InvokeInst here. 269 const CallInst *llvm::extractMallocCall(const Value *I, 270 const TargetLibraryInfo *TLI) { 271 return isMallocLikeFn(I, TLI) ? dyn_cast<CallInst>(I) : nullptr; 272 } 273 274 static Value *computeArraySize(const CallInst *CI, const DataLayout &DL, 275 const TargetLibraryInfo *TLI, 276 bool LookThroughSExt = false) { 277 if (!CI) 278 return nullptr; 279 280 // The size of the malloc's result type must be known to determine array size. 281 Type *T = getMallocAllocatedType(CI, TLI); 282 if (!T || !T->isSized()) 283 return nullptr; 284 285 unsigned ElementSize = DL.getTypeAllocSize(T); 286 if (StructType *ST = dyn_cast<StructType>(T)) 287 ElementSize = DL.getStructLayout(ST)->getSizeInBytes(); 288 289 // If malloc call's arg can be determined to be a multiple of ElementSize, 290 // return the multiple. Otherwise, return NULL. 291 Value *MallocArg = CI->getArgOperand(0); 292 Value *Multiple = nullptr; 293 if (ComputeMultiple(MallocArg, ElementSize, Multiple, LookThroughSExt)) 294 return Multiple; 295 296 return nullptr; 297 } 298 299 /// getMallocType - Returns the PointerType resulting from the malloc call. 300 /// The PointerType depends on the number of bitcast uses of the malloc call: 301 /// 0: PointerType is the calls' return type. 302 /// 1: PointerType is the bitcast's result type. 303 /// >1: Unique PointerType cannot be determined, return NULL. 304 PointerType *llvm::getMallocType(const CallInst *CI, 305 const TargetLibraryInfo *TLI) { 306 assert(isMallocLikeFn(CI, TLI) && "getMallocType and not malloc call"); 307 308 PointerType *MallocType = nullptr; 309 unsigned NumOfBitCastUses = 0; 310 311 // Determine if CallInst has a bitcast use. 312 for (Value::const_user_iterator UI = CI->user_begin(), E = CI->user_end(); 313 UI != E;) 314 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(*UI++)) { 315 MallocType = cast<PointerType>(BCI->getDestTy()); 316 NumOfBitCastUses++; 317 } 318 319 // Malloc call has 1 bitcast use, so type is the bitcast's destination type. 320 if (NumOfBitCastUses == 1) 321 return MallocType; 322 323 // Malloc call was not bitcast, so type is the malloc function's return type. 324 if (NumOfBitCastUses == 0) 325 return cast<PointerType>(CI->getType()); 326 327 // Type could not be determined. 328 return nullptr; 329 } 330 331 /// getMallocAllocatedType - Returns the Type allocated by malloc call. 332 /// The Type depends on the number of bitcast uses of the malloc call: 333 /// 0: PointerType is the malloc calls' return type. 334 /// 1: PointerType is the bitcast's result type. 335 /// >1: Unique PointerType cannot be determined, return NULL. 336 Type *llvm::getMallocAllocatedType(const CallInst *CI, 337 const TargetLibraryInfo *TLI) { 338 PointerType *PT = getMallocType(CI, TLI); 339 return PT ? PT->getElementType() : nullptr; 340 } 341 342 /// getMallocArraySize - Returns the array size of a malloc call. If the 343 /// argument passed to malloc is a multiple of the size of the malloced type, 344 /// then return that multiple. For non-array mallocs, the multiple is 345 /// constant 1. Otherwise, return NULL for mallocs whose array size cannot be 346 /// determined. 347 Value *llvm::getMallocArraySize(CallInst *CI, const DataLayout &DL, 348 const TargetLibraryInfo *TLI, 349 bool LookThroughSExt) { 350 assert(isMallocLikeFn(CI, TLI) && "getMallocArraySize and not malloc call"); 351 return computeArraySize(CI, DL, TLI, LookThroughSExt); 352 } 353 354 /// extractCallocCall - Returns the corresponding CallInst if the instruction 355 /// is a calloc call. 356 const CallInst *llvm::extractCallocCall(const Value *I, 357 const TargetLibraryInfo *TLI) { 358 return isCallocLikeFn(I, TLI) ? cast<CallInst>(I) : nullptr; 359 } 360 361 /// isFreeCall - Returns non-null if the value is a call to the builtin free() 362 const CallInst *llvm::isFreeCall(const Value *I, const TargetLibraryInfo *TLI) { 363 bool IsNoBuiltinCall; 364 const Function *Callee = 365 getCalledFunction(I, /*LookThroughBitCast=*/false, IsNoBuiltinCall); 366 if (Callee == nullptr || IsNoBuiltinCall) 367 return nullptr; 368 369 StringRef FnName = Callee->getName(); 370 LibFunc TLIFn; 371 if (!TLI || !TLI->getLibFunc(FnName, TLIFn) || !TLI->has(TLIFn)) 372 return nullptr; 373 374 unsigned ExpectedNumParams; 375 if (TLIFn == LibFunc_free || 376 TLIFn == LibFunc_ZdlPv || // operator delete(void*) 377 TLIFn == LibFunc_ZdaPv || // operator delete[](void*) 378 TLIFn == LibFunc_msvc_delete_ptr32 || // operator delete(void*) 379 TLIFn == LibFunc_msvc_delete_ptr64 || // operator delete(void*) 380 TLIFn == LibFunc_msvc_delete_array_ptr32 || // operator delete[](void*) 381 TLIFn == LibFunc_msvc_delete_array_ptr64) // operator delete[](void*) 382 ExpectedNumParams = 1; 383 else if (TLIFn == LibFunc_ZdlPvj || // delete(void*, uint) 384 TLIFn == LibFunc_ZdlPvm || // delete(void*, ulong) 385 TLIFn == LibFunc_ZdlPvRKSt9nothrow_t || // delete(void*, nothrow) 386 TLIFn == LibFunc_ZdlPvSt11align_val_t || // delete(void*, align_val_t) 387 TLIFn == LibFunc_ZdaPvj || // delete[](void*, uint) 388 TLIFn == LibFunc_ZdaPvm || // delete[](void*, ulong) 389 TLIFn == LibFunc_ZdaPvRKSt9nothrow_t || // delete[](void*, nothrow) 390 TLIFn == LibFunc_ZdaPvSt11align_val_t || // delete[](void*, align_val_t) 391 TLIFn == LibFunc_msvc_delete_ptr32_int || // delete(void*, uint) 392 TLIFn == LibFunc_msvc_delete_ptr64_longlong || // delete(void*, ulonglong) 393 TLIFn == LibFunc_msvc_delete_ptr32_nothrow || // delete(void*, nothrow) 394 TLIFn == LibFunc_msvc_delete_ptr64_nothrow || // delete(void*, nothrow) 395 TLIFn == LibFunc_msvc_delete_array_ptr32_int || // delete[](void*, uint) 396 TLIFn == LibFunc_msvc_delete_array_ptr64_longlong || // delete[](void*, ulonglong) 397 TLIFn == LibFunc_msvc_delete_array_ptr32_nothrow || // delete[](void*, nothrow) 398 TLIFn == LibFunc_msvc_delete_array_ptr64_nothrow) // delete[](void*, nothrow) 399 ExpectedNumParams = 2; 400 else if (TLIFn == LibFunc_ZdaPvSt11align_val_tRKSt9nothrow_t || // delete(void*, align_val_t, nothrow) 401 TLIFn == LibFunc_ZdlPvSt11align_val_tRKSt9nothrow_t) // delete[](void*, align_val_t, nothrow) 402 ExpectedNumParams = 3; 403 else 404 return nullptr; 405 406 // Check free prototype. 407 // FIXME: workaround for PR5130, this will be obsolete when a nobuiltin 408 // attribute will exist. 409 FunctionType *FTy = Callee->getFunctionType(); 410 if (!FTy->getReturnType()->isVoidTy()) 411 return nullptr; 412 if (FTy->getNumParams() != ExpectedNumParams) 413 return nullptr; 414 if (FTy->getParamType(0) != Type::getInt8PtrTy(Callee->getContext())) 415 return nullptr; 416 417 return dyn_cast<CallInst>(I); 418 } 419 420 //===----------------------------------------------------------------------===// 421 // Utility functions to compute size of objects. 422 // 423 static APInt getSizeWithOverflow(const SizeOffsetType &Data) { 424 if (Data.second.isNegative() || Data.first.ult(Data.second)) 425 return APInt(Data.first.getBitWidth(), 0); 426 return Data.first - Data.second; 427 } 428 429 /// Compute the size of the object pointed by Ptr. Returns true and the 430 /// object size in Size if successful, and false otherwise. 431 /// If RoundToAlign is true, then Size is rounded up to the alignment of 432 /// allocas, byval arguments, and global variables. 433 bool llvm::getObjectSize(const Value *Ptr, uint64_t &Size, const DataLayout &DL, 434 const TargetLibraryInfo *TLI, ObjectSizeOpts Opts) { 435 ObjectSizeOffsetVisitor Visitor(DL, TLI, Ptr->getContext(), Opts); 436 SizeOffsetType Data = Visitor.compute(const_cast<Value*>(Ptr)); 437 if (!Visitor.bothKnown(Data)) 438 return false; 439 440 Size = getSizeWithOverflow(Data).getZExtValue(); 441 return true; 442 } 443 444 ConstantInt *llvm::lowerObjectSizeCall(IntrinsicInst *ObjectSize, 445 const DataLayout &DL, 446 const TargetLibraryInfo *TLI, 447 bool MustSucceed) { 448 assert(ObjectSize->getIntrinsicID() == Intrinsic::objectsize && 449 "ObjectSize must be a call to llvm.objectsize!"); 450 451 bool MaxVal = cast<ConstantInt>(ObjectSize->getArgOperand(1))->isZero(); 452 ObjectSizeOpts EvalOptions; 453 // Unless we have to fold this to something, try to be as accurate as 454 // possible. 455 if (MustSucceed) 456 EvalOptions.EvalMode = 457 MaxVal ? ObjectSizeOpts::Mode::Max : ObjectSizeOpts::Mode::Min; 458 else 459 EvalOptions.EvalMode = ObjectSizeOpts::Mode::Exact; 460 461 EvalOptions.NullIsUnknownSize = 462 cast<ConstantInt>(ObjectSize->getArgOperand(2))->isOne(); 463 464 // FIXME: Does it make sense to just return a failure value if the size won't 465 // fit in the output and `!MustSucceed`? 466 uint64_t Size; 467 auto *ResultType = cast<IntegerType>(ObjectSize->getType()); 468 if (getObjectSize(ObjectSize->getArgOperand(0), Size, DL, TLI, EvalOptions) && 469 isUIntN(ResultType->getBitWidth(), Size)) 470 return ConstantInt::get(ResultType, Size); 471 472 if (!MustSucceed) 473 return nullptr; 474 475 return ConstantInt::get(ResultType, MaxVal ? -1ULL : 0); 476 } 477 478 STATISTIC(ObjectVisitorArgument, 479 "Number of arguments with unsolved size and offset"); 480 STATISTIC(ObjectVisitorLoad, 481 "Number of load instructions with unsolved size and offset"); 482 483 APInt ObjectSizeOffsetVisitor::align(APInt Size, uint64_t Align) { 484 if (Options.RoundToAlign && Align) 485 return APInt(IntTyBits, alignTo(Size.getZExtValue(), Align)); 486 return Size; 487 } 488 489 ObjectSizeOffsetVisitor::ObjectSizeOffsetVisitor(const DataLayout &DL, 490 const TargetLibraryInfo *TLI, 491 LLVMContext &Context, 492 ObjectSizeOpts Options) 493 : DL(DL), TLI(TLI), Options(Options) { 494 // Pointer size must be rechecked for each object visited since it could have 495 // a different address space. 496 } 497 498 SizeOffsetType ObjectSizeOffsetVisitor::compute(Value *V) { 499 IntTyBits = DL.getPointerTypeSizeInBits(V->getType()); 500 Zero = APInt::getNullValue(IntTyBits); 501 502 V = V->stripPointerCasts(); 503 if (Instruction *I = dyn_cast<Instruction>(V)) { 504 // If we have already seen this instruction, bail out. Cycles can happen in 505 // unreachable code after constant propagation. 506 if (!SeenInsts.insert(I).second) 507 return unknown(); 508 509 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) 510 return visitGEPOperator(*GEP); 511 return visit(*I); 512 } 513 if (Argument *A = dyn_cast<Argument>(V)) 514 return visitArgument(*A); 515 if (ConstantPointerNull *P = dyn_cast<ConstantPointerNull>(V)) 516 return visitConstantPointerNull(*P); 517 if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) 518 return visitGlobalAlias(*GA); 519 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) 520 return visitGlobalVariable(*GV); 521 if (UndefValue *UV = dyn_cast<UndefValue>(V)) 522 return visitUndefValue(*UV); 523 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) { 524 if (CE->getOpcode() == Instruction::IntToPtr) 525 return unknown(); // clueless 526 if (CE->getOpcode() == Instruction::GetElementPtr) 527 return visitGEPOperator(cast<GEPOperator>(*CE)); 528 } 529 530 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: " 531 << *V << '\n'); 532 return unknown(); 533 } 534 535 /// When we're compiling N-bit code, and the user uses parameters that are 536 /// greater than N bits (e.g. uint64_t on a 32-bit build), we can run into 537 /// trouble with APInt size issues. This function handles resizing + overflow 538 /// checks for us. Check and zext or trunc \p I depending on IntTyBits and 539 /// I's value. 540 bool ObjectSizeOffsetVisitor::CheckedZextOrTrunc(APInt &I) { 541 // More bits than we can handle. Checking the bit width isn't necessary, but 542 // it's faster than checking active bits, and should give `false` in the 543 // vast majority of cases. 544 if (I.getBitWidth() > IntTyBits && I.getActiveBits() > IntTyBits) 545 return false; 546 if (I.getBitWidth() != IntTyBits) 547 I = I.zextOrTrunc(IntTyBits); 548 return true; 549 } 550 551 SizeOffsetType ObjectSizeOffsetVisitor::visitAllocaInst(AllocaInst &I) { 552 if (!I.getAllocatedType()->isSized()) 553 return unknown(); 554 555 APInt Size(IntTyBits, DL.getTypeAllocSize(I.getAllocatedType())); 556 if (!I.isArrayAllocation()) 557 return std::make_pair(align(Size, I.getAlignment()), Zero); 558 559 Value *ArraySize = I.getArraySize(); 560 if (const ConstantInt *C = dyn_cast<ConstantInt>(ArraySize)) { 561 APInt NumElems = C->getValue(); 562 if (!CheckedZextOrTrunc(NumElems)) 563 return unknown(); 564 565 bool Overflow; 566 Size = Size.umul_ov(NumElems, Overflow); 567 return Overflow ? unknown() : std::make_pair(align(Size, I.getAlignment()), 568 Zero); 569 } 570 return unknown(); 571 } 572 573 SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) { 574 // No interprocedural analysis is done at the moment. 575 if (!A.hasByValOrInAllocaAttr()) { 576 ++ObjectVisitorArgument; 577 return unknown(); 578 } 579 PointerType *PT = cast<PointerType>(A.getType()); 580 APInt Size(IntTyBits, DL.getTypeAllocSize(PT->getElementType())); 581 return std::make_pair(align(Size, A.getParamAlignment()), Zero); 582 } 583 584 SizeOffsetType ObjectSizeOffsetVisitor::visitCallSite(CallSite CS) { 585 Optional<AllocFnsTy> FnData = getAllocationSize(CS.getInstruction(), TLI); 586 if (!FnData) 587 return unknown(); 588 589 // Handle strdup-like functions separately. 590 if (FnData->AllocTy == StrDupLike) { 591 APInt Size(IntTyBits, GetStringLength(CS.getArgument(0))); 592 if (!Size) 593 return unknown(); 594 595 // Strndup limits strlen. 596 if (FnData->FstParam > 0) { 597 ConstantInt *Arg = 598 dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam)); 599 if (!Arg) 600 return unknown(); 601 602 APInt MaxSize = Arg->getValue().zextOrSelf(IntTyBits); 603 if (Size.ugt(MaxSize)) 604 Size = MaxSize + 1; 605 } 606 return std::make_pair(Size, Zero); 607 } 608 609 ConstantInt *Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam)); 610 if (!Arg) 611 return unknown(); 612 613 APInt Size = Arg->getValue(); 614 if (!CheckedZextOrTrunc(Size)) 615 return unknown(); 616 617 // Size is determined by just 1 parameter. 618 if (FnData->SndParam < 0) 619 return std::make_pair(Size, Zero); 620 621 Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->SndParam)); 622 if (!Arg) 623 return unknown(); 624 625 APInt NumElems = Arg->getValue(); 626 if (!CheckedZextOrTrunc(NumElems)) 627 return unknown(); 628 629 bool Overflow; 630 Size = Size.umul_ov(NumElems, Overflow); 631 return Overflow ? unknown() : std::make_pair(Size, Zero); 632 633 // TODO: handle more standard functions (+ wchar cousins): 634 // - strdup / strndup 635 // - strcpy / strncpy 636 // - strcat / strncat 637 // - memcpy / memmove 638 // - strcat / strncat 639 // - memset 640 } 641 642 SizeOffsetType 643 ObjectSizeOffsetVisitor::visitConstantPointerNull(ConstantPointerNull& CPN) { 644 // If null is unknown, there's nothing we can do. Additionally, non-zero 645 // address spaces can make use of null, so we don't presume to know anything 646 // about that. 647 // 648 // TODO: How should this work with address space casts? We currently just drop 649 // them on the floor, but it's unclear what we should do when a NULL from 650 // addrspace(1) gets casted to addrspace(0) (or vice-versa). 651 if (Options.NullIsUnknownSize || CPN.getType()->getAddressSpace()) 652 return unknown(); 653 return std::make_pair(Zero, Zero); 654 } 655 656 SizeOffsetType 657 ObjectSizeOffsetVisitor::visitExtractElementInst(ExtractElementInst&) { 658 return unknown(); 659 } 660 661 SizeOffsetType 662 ObjectSizeOffsetVisitor::visitExtractValueInst(ExtractValueInst&) { 663 // Easy cases were already folded by previous passes. 664 return unknown(); 665 } 666 667 SizeOffsetType ObjectSizeOffsetVisitor::visitGEPOperator(GEPOperator &GEP) { 668 SizeOffsetType PtrData = compute(GEP.getPointerOperand()); 669 APInt Offset(IntTyBits, 0); 670 if (!bothKnown(PtrData) || !GEP.accumulateConstantOffset(DL, Offset)) 671 return unknown(); 672 673 return std::make_pair(PtrData.first, PtrData.second + Offset); 674 } 675 676 SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalAlias(GlobalAlias &GA) { 677 if (GA.isInterposable()) 678 return unknown(); 679 return compute(GA.getAliasee()); 680 } 681 682 SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalVariable(GlobalVariable &GV){ 683 if (!GV.hasDefinitiveInitializer()) 684 return unknown(); 685 686 APInt Size(IntTyBits, DL.getTypeAllocSize(GV.getType()->getElementType())); 687 return std::make_pair(align(Size, GV.getAlignment()), Zero); 688 } 689 690 SizeOffsetType ObjectSizeOffsetVisitor::visitIntToPtrInst(IntToPtrInst&) { 691 // clueless 692 return unknown(); 693 } 694 695 SizeOffsetType ObjectSizeOffsetVisitor::visitLoadInst(LoadInst&) { 696 ++ObjectVisitorLoad; 697 return unknown(); 698 } 699 700 SizeOffsetType ObjectSizeOffsetVisitor::visitPHINode(PHINode&) { 701 // too complex to analyze statically. 702 return unknown(); 703 } 704 705 SizeOffsetType ObjectSizeOffsetVisitor::visitSelectInst(SelectInst &I) { 706 SizeOffsetType TrueSide = compute(I.getTrueValue()); 707 SizeOffsetType FalseSide = compute(I.getFalseValue()); 708 if (bothKnown(TrueSide) && bothKnown(FalseSide)) { 709 if (TrueSide == FalseSide) { 710 return TrueSide; 711 } 712 713 APInt TrueResult = getSizeWithOverflow(TrueSide); 714 APInt FalseResult = getSizeWithOverflow(FalseSide); 715 716 if (TrueResult == FalseResult) { 717 return TrueSide; 718 } 719 if (Options.EvalMode == ObjectSizeOpts::Mode::Min) { 720 if (TrueResult.slt(FalseResult)) 721 return TrueSide; 722 return FalseSide; 723 } 724 if (Options.EvalMode == ObjectSizeOpts::Mode::Max) { 725 if (TrueResult.sgt(FalseResult)) 726 return TrueSide; 727 return FalseSide; 728 } 729 } 730 return unknown(); 731 } 732 733 SizeOffsetType ObjectSizeOffsetVisitor::visitUndefValue(UndefValue&) { 734 return std::make_pair(Zero, Zero); 735 } 736 737 SizeOffsetType ObjectSizeOffsetVisitor::visitInstruction(Instruction &I) { 738 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I 739 << '\n'); 740 return unknown(); 741 } 742 743 ObjectSizeOffsetEvaluator::ObjectSizeOffsetEvaluator( 744 const DataLayout &DL, const TargetLibraryInfo *TLI, LLVMContext &Context, 745 bool RoundToAlign) 746 : DL(DL), TLI(TLI), Context(Context), Builder(Context, TargetFolder(DL)), 747 RoundToAlign(RoundToAlign) { 748 // IntTy and Zero must be set for each compute() since the address space may 749 // be different for later objects. 750 } 751 752 SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute(Value *V) { 753 // XXX - Are vectors of pointers possible here? 754 IntTy = cast<IntegerType>(DL.getIntPtrType(V->getType())); 755 Zero = ConstantInt::get(IntTy, 0); 756 757 SizeOffsetEvalType Result = compute_(V); 758 759 if (!bothKnown(Result)) { 760 // Erase everything that was computed in this iteration from the cache, so 761 // that no dangling references are left behind. We could be a bit smarter if 762 // we kept a dependency graph. It's probably not worth the complexity. 763 for (const Value *SeenVal : SeenVals) { 764 CacheMapTy::iterator CacheIt = CacheMap.find(SeenVal); 765 // non-computable results can be safely cached 766 if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second)) 767 CacheMap.erase(CacheIt); 768 } 769 } 770 771 SeenVals.clear(); 772 return Result; 773 } 774 775 SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute_(Value *V) { 776 ObjectSizeOpts ObjSizeOptions; 777 ObjSizeOptions.RoundToAlign = RoundToAlign; 778 779 ObjectSizeOffsetVisitor Visitor(DL, TLI, Context, ObjSizeOptions); 780 SizeOffsetType Const = Visitor.compute(V); 781 if (Visitor.bothKnown(Const)) 782 return std::make_pair(ConstantInt::get(Context, Const.first), 783 ConstantInt::get(Context, Const.second)); 784 785 V = V->stripPointerCasts(); 786 787 // Check cache. 788 CacheMapTy::iterator CacheIt = CacheMap.find(V); 789 if (CacheIt != CacheMap.end()) 790 return CacheIt->second; 791 792 // Always generate code immediately before the instruction being 793 // processed, so that the generated code dominates the same BBs. 794 BuilderTy::InsertPointGuard Guard(Builder); 795 if (Instruction *I = dyn_cast<Instruction>(V)) 796 Builder.SetInsertPoint(I); 797 798 // Now compute the size and offset. 799 SizeOffsetEvalType Result; 800 801 // Record the pointers that were handled in this run, so that they can be 802 // cleaned later if something fails. We also use this set to break cycles that 803 // can occur in dead code. 804 if (!SeenVals.insert(V).second) { 805 Result = unknown(); 806 } else if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) { 807 Result = visitGEPOperator(*GEP); 808 } else if (Instruction *I = dyn_cast<Instruction>(V)) { 809 Result = visit(*I); 810 } else if (isa<Argument>(V) || 811 (isa<ConstantExpr>(V) && 812 cast<ConstantExpr>(V)->getOpcode() == Instruction::IntToPtr) || 813 isa<GlobalAlias>(V) || 814 isa<GlobalVariable>(V)) { 815 // Ignore values where we cannot do more than ObjectSizeVisitor. 816 Result = unknown(); 817 } else { 818 LLVM_DEBUG( 819 dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: " << *V 820 << '\n'); 821 Result = unknown(); 822 } 823 824 // Don't reuse CacheIt since it may be invalid at this point. 825 CacheMap[V] = Result; 826 return Result; 827 } 828 829 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitAllocaInst(AllocaInst &I) { 830 if (!I.getAllocatedType()->isSized()) 831 return unknown(); 832 833 // must be a VLA 834 assert(I.isArrayAllocation()); 835 Value *ArraySize = I.getArraySize(); 836 Value *Size = ConstantInt::get(ArraySize->getType(), 837 DL.getTypeAllocSize(I.getAllocatedType())); 838 Size = Builder.CreateMul(Size, ArraySize); 839 return std::make_pair(Size, Zero); 840 } 841 842 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitCallSite(CallSite CS) { 843 Optional<AllocFnsTy> FnData = getAllocationSize(CS.getInstruction(), TLI); 844 if (!FnData) 845 return unknown(); 846 847 // Handle strdup-like functions separately. 848 if (FnData->AllocTy == StrDupLike) { 849 // TODO 850 return unknown(); 851 } 852 853 Value *FirstArg = CS.getArgument(FnData->FstParam); 854 FirstArg = Builder.CreateZExt(FirstArg, IntTy); 855 if (FnData->SndParam < 0) 856 return std::make_pair(FirstArg, Zero); 857 858 Value *SecondArg = CS.getArgument(FnData->SndParam); 859 SecondArg = Builder.CreateZExt(SecondArg, IntTy); 860 Value *Size = Builder.CreateMul(FirstArg, SecondArg); 861 return std::make_pair(Size, Zero); 862 863 // TODO: handle more standard functions (+ wchar cousins): 864 // - strdup / strndup 865 // - strcpy / strncpy 866 // - strcat / strncat 867 // - memcpy / memmove 868 // - strcat / strncat 869 // - memset 870 } 871 872 SizeOffsetEvalType 873 ObjectSizeOffsetEvaluator::visitExtractElementInst(ExtractElementInst&) { 874 return unknown(); 875 } 876 877 SizeOffsetEvalType 878 ObjectSizeOffsetEvaluator::visitExtractValueInst(ExtractValueInst&) { 879 return unknown(); 880 } 881 882 SizeOffsetEvalType 883 ObjectSizeOffsetEvaluator::visitGEPOperator(GEPOperator &GEP) { 884 SizeOffsetEvalType PtrData = compute_(GEP.getPointerOperand()); 885 if (!bothKnown(PtrData)) 886 return unknown(); 887 888 Value *Offset = EmitGEPOffset(&Builder, DL, &GEP, /*NoAssumptions=*/true); 889 Offset = Builder.CreateAdd(PtrData.second, Offset); 890 return std::make_pair(PtrData.first, Offset); 891 } 892 893 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitIntToPtrInst(IntToPtrInst&) { 894 // clueless 895 return unknown(); 896 } 897 898 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitLoadInst(LoadInst&) { 899 return unknown(); 900 } 901 902 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) { 903 // Create 2 PHIs: one for size and another for offset. 904 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 905 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 906 907 // Insert right away in the cache to handle recursive PHIs. 908 CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI); 909 910 // Compute offset/size for each PHI incoming pointer. 911 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) { 912 Builder.SetInsertPoint(&*PHI.getIncomingBlock(i)->getFirstInsertionPt()); 913 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i)); 914 915 if (!bothKnown(EdgeData)) { 916 OffsetPHI->replaceAllUsesWith(UndefValue::get(IntTy)); 917 OffsetPHI->eraseFromParent(); 918 SizePHI->replaceAllUsesWith(UndefValue::get(IntTy)); 919 SizePHI->eraseFromParent(); 920 return unknown(); 921 } 922 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i)); 923 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i)); 924 } 925 926 Value *Size = SizePHI, *Offset = OffsetPHI, *Tmp; 927 if ((Tmp = SizePHI->hasConstantValue())) { 928 Size = Tmp; 929 SizePHI->replaceAllUsesWith(Size); 930 SizePHI->eraseFromParent(); 931 } 932 if ((Tmp = OffsetPHI->hasConstantValue())) { 933 Offset = Tmp; 934 OffsetPHI->replaceAllUsesWith(Offset); 935 OffsetPHI->eraseFromParent(); 936 } 937 return std::make_pair(Size, Offset); 938 } 939 940 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitSelectInst(SelectInst &I) { 941 SizeOffsetEvalType TrueSide = compute_(I.getTrueValue()); 942 SizeOffsetEvalType FalseSide = compute_(I.getFalseValue()); 943 944 if (!bothKnown(TrueSide) || !bothKnown(FalseSide)) 945 return unknown(); 946 if (TrueSide == FalseSide) 947 return TrueSide; 948 949 Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first, 950 FalseSide.first); 951 Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second, 952 FalseSide.second); 953 return std::make_pair(Size, Offset); 954 } 955 956 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitInstruction(Instruction &I) { 957 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I 958 << '\n'); 959 return unknown(); 960 } 961