MemoryBuiltins.cpp revision 29eb2cc00ca0bc4d218c6d034f90becfed999bcb
1//===------ MemoryBuiltins.cpp - Identify calls to memory builtins --------===// 2// 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// 10// This family of functions identifies calls to builtin functions that allocate 11// or free memory. 12// 13//===----------------------------------------------------------------------===// 14 15#define DEBUG_TYPE "memory-builtins" 16#include "llvm/Analysis/MemoryBuiltins.h" 17#include "llvm/ADT/STLExtras.h" 18#include "llvm/ADT/Statistic.h" 19#include "llvm/Analysis/ValueTracking.h" 20#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" 26#include "llvm/Support/Debug.h" 27#include "llvm/Support/MathExtras.h" 28#include "llvm/Support/raw_ostream.h" 29#include "llvm/Target/TargetLibraryInfo.h" 30#include "llvm/Transforms/Utils/Local.h" 31using namespace llvm; 32 33enum 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}; 41 42struct AllocFnsTy { 43 LibFunc::Func Func; 44 AllocType AllocTy; 45 unsigned char NumParams; 46 // First and Second size parameters (or -1 if unused) 47 signed char FstParam, SndParam; 48}; 49 50// FIXME: certain users need more information. E.g., SimplifyLibCalls needs to 51// know which functions are nounwind, noalias, nocapture parameters, etc. 52static const AllocFnsTy AllocationFnData[] = { 53 {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} 69}; 70 71 72static Function *getCalledFunction(const Value *V, bool LookThroughBitCast) { 73 if (LookThroughBitCast) 74 V = V->stripPointerCasts(); 75 76 CallSite CS(const_cast<Value*>(V)); 77 if (!CS.getInstruction()) 78 return 0; 79 80 Function *Callee = CS.getCalledFunction(); 81 if (!Callee || !Callee->isDeclaration()) 82 return 0; 83 return Callee; 84} 85 86/// \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, 89 const TargetLibraryInfo *TLI, 90 bool LookThroughBitCast = false) { 91 Function *Callee = getCalledFunction(V, LookThroughBitCast); 92 if (!Callee) 93 return 0; 94 95 // 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 101 unsigned i = 0; 102 bool found = false; 103 for ( ; i < array_lengthof(AllocationFnData); ++i) { 104 if (AllocationFnData[i].Func == TLIFn) { 105 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. 117 int FstParam = FnData->FstParam; 118 int SndParam = FnData->SndParam; 119 FunctionType *FTy = Callee->getFunctionType(); 120 121 if (FTy->getReturnType() == Type::getInt8PtrTy(FTy->getContext()) && 122 FTy->getNumParams() == FnData->NumParams && 123 (FstParam < 0 || 124 (FTy->getParamType(FstParam)->isIntegerTy(32) || 125 FTy->getParamType(FstParam)->isIntegerTy(64))) && 126 (SndParam < 0 || 127 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) { 134 ImmutableCallSite CS(LookThroughBitCast ? V->stripPointerCasts() : V); 135 return CS && CS.hasFnAttr(Attribute::NoAlias); 136} 137 138 139/// \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). 142bool llvm::isAllocationFn(const Value *V, const TargetLibraryInfo *TLI, 143 bool LookThroughBitCast) { 144 return getAllocationData(V, AnyAlloc, TLI, LookThroughBitCast); 145} 146 147/// \brief Tests if a value is a call or invoke to a function that returns a 148/// NoAlias pointer (including malloc/calloc/realloc/strdup-like functions). 149bool llvm::isNoAliasFn(const Value *V, const TargetLibraryInfo *TLI, 150 bool LookThroughBitCast) { 151 // it's safe to consider realloc as noalias since accessing the original 152 // pointer is undefined behavior 153 return isAllocationFn(V, TLI, LookThroughBitCast) || 154 hasNoAliasAttr(V, LookThroughBitCast); 155} 156 157/// \brief Tests if a value is a call or invoke to a library function that 158/// allocates uninitialized memory (such as malloc). 159bool llvm::isMallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 160 bool LookThroughBitCast) { 161 return getAllocationData(V, MallocLike, TLI, LookThroughBitCast); 162} 163 164/// \brief Tests if a value is a call or invoke to a library function that 165/// allocates zero-filled memory (such as calloc). 166bool llvm::isCallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 167 bool LookThroughBitCast) { 168 return getAllocationData(V, CallocLike, TLI, LookThroughBitCast); 169} 170 171/// \brief Tests if a value is a call or invoke to a library function that 172/// allocates memory (either malloc, calloc, or strdup like). 173bool llvm::isAllocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 174 bool LookThroughBitCast) { 175 return getAllocationData(V, AllocLike, TLI, LookThroughBitCast); 176} 177 178/// \brief Tests if a value is a call or invoke to a library function that 179/// reallocates memory (such as realloc). 180bool llvm::isReallocLikeFn(const Value *V, const TargetLibraryInfo *TLI, 181 bool LookThroughBitCast) { 182 return getAllocationData(V, ReallocLike, TLI, LookThroughBitCast); 183} 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. 188const CallInst *llvm::extractMallocCall(const Value *I, 189 const TargetLibraryInfo *TLI) { 190 return isMallocLikeFn(I, TLI) ? dyn_cast<CallInst>(I) : 0; 191} 192 193static Value *computeArraySize(const CallInst *CI, const DataLayout *TD, 194 const TargetLibraryInfo *TLI, 195 bool LookThroughSExt = false) { 196 if (!CI) 197 return NULL; 198 199 // The size of the malloc's result type must be known to determine array size. 200 Type *T = getMallocAllocatedType(CI, TLI); 201 if (!T || !T->isSized() || !TD) 202 return NULL; 203 204 unsigned ElementSize = TD->getTypeAllocSize(T); 205 if (StructType *ST = dyn_cast<StructType>(T)) 206 ElementSize = TD->getStructLayout(ST)->getSizeInBytes(); 207 208 // If malloc call's arg can be determined to be a multiple of ElementSize, 209 // return the multiple. Otherwise, return NULL. 210 Value *MallocArg = CI->getArgOperand(0); 211 Value *Multiple = NULL; 212 if (ComputeMultiple(MallocArg, ElementSize, Multiple, 213 LookThroughSExt)) 214 return Multiple; 215 216 return NULL; 217} 218 219/// isArrayMalloc - Returns the corresponding CallInst if the instruction 220/// is a call to malloc whose array size can be determined and the array size 221/// is not constant 1. Otherwise, return NULL. 222const CallInst *llvm::isArrayMalloc(const Value *I, 223 const DataLayout *TD, 224 const TargetLibraryInfo *TLI) { 225 const CallInst *CI = extractMallocCall(I, TLI); 226 Value *ArraySize = computeArraySize(CI, TD, TLI); 227 228 if (ArraySize && 229 ArraySize != ConstantInt::get(CI->getArgOperand(0)->getType(), 1)) 230 return CI; 231 232 // CI is a non-array malloc or we can't figure out that it is an array malloc. 233 return NULL; 234} 235 236/// getMallocType - Returns the PointerType resulting from the malloc call. 237/// 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. 241PointerType *llvm::getMallocType(const CallInst *CI, 242 const TargetLibraryInfo *TLI) { 243 assert(isMallocLikeFn(CI, TLI) && "getMallocType and not malloc call"); 244 245 PointerType *MallocType = NULL; 246 unsigned NumOfBitCastUses = 0; 247 248 // Determine if CallInst has a bitcast use. 249 for (Value::const_use_iterator UI = CI->use_begin(), E = CI->use_end(); 250 UI != E; ) 251 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(*UI++)) { 252 MallocType = cast<PointerType>(BCI->getDestTy()); 253 NumOfBitCastUses++; 254 } 255 256 // Malloc call has 1 bitcast use, so type is the bitcast's destination type. 257 if (NumOfBitCastUses == 1) 258 return MallocType; 259 260 // Malloc call was not bitcast, so type is the malloc function's return type. 261 if (NumOfBitCastUses == 0) 262 return cast<PointerType>(CI->getType()); 263 264 // Type could not be determined. 265 return NULL; 266} 267 268/// 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. 273Type *llvm::getMallocAllocatedType(const CallInst *CI, 274 const TargetLibraryInfo *TLI) { 275 PointerType *PT = getMallocType(CI, TLI); 276 return PT ? PT->getElementType() : NULL; 277} 278 279/// 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 283/// determined. 284Value *llvm::getMallocArraySize(CallInst *CI, const DataLayout *TD, 285 const TargetLibraryInfo *TLI, 286 bool LookThroughSExt) { 287 assert(isMallocLikeFn(CI, TLI) && "getMallocArraySize and not malloc call"); 288 return computeArraySize(CI, TD, TLI, LookThroughSExt); 289} 290 291 292/// extractCallocCall - Returns the corresponding CallInst if the instruction 293/// is a calloc call. 294const CallInst *llvm::extractCallocCall(const Value *I, 295 const TargetLibraryInfo *TLI) { 296 return isCallocLikeFn(I, TLI) ? cast<CallInst>(I) : 0; 297} 298 299 300/// isFreeCall - Returns non-null if the value is a call to the builtin free() 301const CallInst *llvm::isFreeCall(const Value *I, const TargetLibraryInfo *TLI) { 302 const CallInst *CI = dyn_cast<CallInst>(I); 303 if (!CI) 304 return 0; 305 Function *Callee = CI->getCalledFunction(); 306 if (Callee == 0 || !Callee->isDeclaration()) 307 return 0; 308 309 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*) 317 return 0; 318 319 // Check free prototype. 320 // FIXME: workaround for PR5130, this will be obsolete when a nobuiltin 321 // attribute will exist. 322 FunctionType *FTy = Callee->getFunctionType(); 323 if (!FTy->getReturnType()->isVoidTy()) 324 return 0; 325 if (FTy->getNumParams() != 1) 326 return 0; 327 if (FTy->getParamType(0) != Type::getInt8PtrTy(Callee->getContext())) 328 return 0; 329 330 return CI; 331} 332 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. 344bool llvm::getObjectSize(const Value *Ptr, uint64_t &Size, const DataLayout *TD, 345 const TargetLibraryInfo *TLI, bool RoundToAlign) { 346 if (!TD) 347 return false; 348 349 ObjectSizeOffsetVisitor Visitor(TD, TLI, Ptr->getContext(), RoundToAlign); 350 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 363 364STATISTIC(ObjectVisitorArgument, 365 "Number of arguments with unsolved size and offset"); 366STATISTIC(ObjectVisitorLoad, 367 "Number of load instructions with unsolved size and offset"); 368 369 370APInt ObjectSizeOffsetVisitor::align(APInt Size, uint64_t Align) { 371 if (RoundToAlign && Align) 372 return APInt(IntTyBits, RoundUpToAlignment(Size.getZExtValue(), Align)); 373 return Size; 374} 375 376ObjectSizeOffsetVisitor::ObjectSizeOffsetVisitor(const DataLayout *TD, 377 const TargetLibraryInfo *TLI, 378 LLVMContext &Context, 379 bool RoundToAlign) 380: TD(TD), TLI(TLI), RoundToAlign(RoundToAlign) { 381 IntegerType *IntTy = TD->getIntPtrType(Context); 382 IntTyBits = IntTy->getBitWidth(); 383 Zero = APInt::getNullValue(IntTyBits); 384} 385 386SizeOffsetType ObjectSizeOffsetVisitor::compute(Value *V) { 387 V = V->stripPointerCasts(); 388 389 if (isa<Instruction>(V) || isa<GEPOperator>(V)) { 390 // return cached value or insert unknown in cache if size of V was not 391 // computed yet in order to avoid recursions in PHis 392 std::pair<CacheMapTy::iterator, bool> CacheVal = 393 CacheMap.insert(std::make_pair(V, unknown())); 394 if (!CacheVal.second) 395 return CacheVal.first->second; 396 397 SizeOffsetType Result; 398 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) 399 Result = visitGEPOperator(*GEP); 400 else 401 Result = visit(cast<Instruction>(*V)); 402 return CacheMap[V] = Result; 403 } 404 405 if (Argument *A = dyn_cast<Argument>(V)) 406 return visitArgument(*A); 407 if (ConstantPointerNull *P = dyn_cast<ConstantPointerNull>(V)) 408 return visitConstantPointerNull(*P); 409 if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) 410 return visitGlobalAlias(*GA); 411 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) 412 return visitGlobalVariable(*GV); 413 if (UndefValue *UV = dyn_cast<UndefValue>(V)) 414 return visitUndefValue(*UV); 415 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) { 416 if (CE->getOpcode() == Instruction::IntToPtr) 417 return unknown(); // clueless 418 } 419 420 DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: " << *V 421 << '\n'); 422 return unknown(); 423} 424 425SizeOffsetType ObjectSizeOffsetVisitor::visitAllocaInst(AllocaInst &I) { 426 if (!I.getAllocatedType()->isSized()) 427 return unknown(); 428 429 APInt Size(IntTyBits, TD->getTypeAllocSize(I.getAllocatedType())); 430 if (!I.isArrayAllocation()) 431 return std::make_pair(align(Size, I.getAlignment()), Zero); 432 433 Value *ArraySize = I.getArraySize(); 434 if (const ConstantInt *C = dyn_cast<ConstantInt>(ArraySize)) { 435 Size *= C->getValue().zextOrSelf(IntTyBits); 436 return std::make_pair(align(Size, I.getAlignment()), Zero); 437 } 438 return unknown(); 439} 440 441SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) { 442 // no interprocedural analysis is done at the moment 443 if (!A.hasByValAttr()) { 444 ++ObjectVisitorArgument; 445 return unknown(); 446 } 447 PointerType *PT = cast<PointerType>(A.getType()); 448 APInt Size(IntTyBits, TD->getTypeAllocSize(PT->getElementType())); 449 return std::make_pair(align(Size, A.getParamAlignment()), Zero); 450} 451 452SizeOffsetType ObjectSizeOffsetVisitor::visitCallSite(CallSite CS) { 453 const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc, 454 TLI); 455 if (!FnData) 456 return unknown(); 457 458 // handle strdup-like functions separately 459 if (FnData->AllocTy == StrDupLike) { 460 APInt Size(IntTyBits, GetStringLength(CS.getArgument(0))); 461 if (!Size) 462 return unknown(); 463 464 // strndup limits strlen 465 if (FnData->FstParam > 0) { 466 ConstantInt *Arg= dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam)); 467 if (!Arg) 468 return unknown(); 469 470 APInt MaxSize = Arg->getValue().zextOrSelf(IntTyBits); 471 if (Size.ugt(MaxSize)) 472 Size = MaxSize + 1; 473 } 474 return std::make_pair(Size, Zero); 475 } 476 477 ConstantInt *Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->FstParam)); 478 if (!Arg) 479 return unknown(); 480 481 APInt Size = Arg->getValue().zextOrSelf(IntTyBits); 482 // size determined by just 1 parameter 483 if (FnData->SndParam < 0) 484 return std::make_pair(Size, Zero); 485 486 Arg = dyn_cast<ConstantInt>(CS.getArgument(FnData->SndParam)); 487 if (!Arg) 488 return unknown(); 489 490 Size *= Arg->getValue().zextOrSelf(IntTyBits); 491 return std::make_pair(Size, Zero); 492 493 // TODO: handle more standard functions (+ wchar cousins): 494 // - strdup / strndup 495 // - strcpy / strncpy 496 // - strcat / strncat 497 // - memcpy / memmove 498 // - strcat / strncat 499 // - memset 500} 501 502SizeOffsetType 503ObjectSizeOffsetVisitor::visitConstantPointerNull(ConstantPointerNull&) { 504 return std::make_pair(Zero, Zero); 505} 506 507SizeOffsetType 508ObjectSizeOffsetVisitor::visitExtractElementInst(ExtractElementInst&) { 509 return unknown(); 510} 511 512SizeOffsetType 513ObjectSizeOffsetVisitor::visitExtractValueInst(ExtractValueInst&) { 514 // Easy cases were already folded by previous passes. 515 return unknown(); 516} 517 518SizeOffsetType ObjectSizeOffsetVisitor::visitGEPOperator(GEPOperator &GEP) { 519 SizeOffsetType PtrData = compute(GEP.getPointerOperand()); 520 APInt Offset(IntTyBits, 0); 521 if (!bothKnown(PtrData) || !GEP.accumulateConstantOffset(*TD, Offset)) 522 return unknown(); 523 524 return std::make_pair(PtrData.first, PtrData.second + Offset); 525} 526 527SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalAlias(GlobalAlias &GA) { 528 if (GA.mayBeOverridden()) 529 return unknown(); 530 return compute(GA.getAliasee()); 531} 532 533SizeOffsetType ObjectSizeOffsetVisitor::visitGlobalVariable(GlobalVariable &GV){ 534 if (!GV.hasDefinitiveInitializer()) 535 return unknown(); 536 537 APInt Size(IntTyBits, TD->getTypeAllocSize(GV.getType()->getElementType())); 538 return std::make_pair(align(Size, GV.getAlignment()), Zero); 539} 540 541SizeOffsetType ObjectSizeOffsetVisitor::visitIntToPtrInst(IntToPtrInst&) { 542 // clueless 543 return unknown(); 544} 545 546SizeOffsetType ObjectSizeOffsetVisitor::visitLoadInst(LoadInst&) { 547 ++ObjectVisitorLoad; 548 return unknown(); 549} 550 551SizeOffsetType ObjectSizeOffsetVisitor::visitPHINode(PHINode &PHI) { 552 if (PHI.getNumIncomingValues() == 0) 553 return unknown(); 554 555 SizeOffsetType Ret = compute(PHI.getIncomingValue(0)); 556 if (!bothKnown(Ret)) 557 return unknown(); 558 559 // verify that all PHI incoming pointers have the same size and offset 560 for (unsigned i = 1, e = PHI.getNumIncomingValues(); i != e; ++i) { 561 SizeOffsetType EdgeData = compute(PHI.getIncomingValue(i)); 562 if (!bothKnown(EdgeData) || EdgeData != Ret) 563 return unknown(); 564 } 565 return Ret; 566} 567 568SizeOffsetType ObjectSizeOffsetVisitor::visitSelectInst(SelectInst &I) { 569 SizeOffsetType TrueSide = compute(I.getTrueValue()); 570 SizeOffsetType FalseSide = compute(I.getFalseValue()); 571 if (bothKnown(TrueSide) && bothKnown(FalseSide) && TrueSide == FalseSide) 572 return TrueSide; 573 return unknown(); 574} 575 576SizeOffsetType ObjectSizeOffsetVisitor::visitUndefValue(UndefValue&) { 577 return std::make_pair(Zero, Zero); 578} 579 580SizeOffsetType ObjectSizeOffsetVisitor::visitInstruction(Instruction &I) { 581 DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I << '\n'); 582 return unknown(); 583} 584 585 586ObjectSizeOffsetEvaluator::ObjectSizeOffsetEvaluator(const DataLayout *TD, 587 const TargetLibraryInfo *TLI, 588 LLVMContext &Context) 589: TD(TD), TLI(TLI), Context(Context), Builder(Context, TargetFolder(TD)) { 590 IntTy = TD->getIntPtrType(Context); 591 Zero = ConstantInt::get(IntTy, 0); 592} 593 594SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute(Value *V) { 595 SizeOffsetEvalType Result = compute_(V); 596 597 if (!bothKnown(Result)) { 598 // erase everything that was computed in this iteration from the cache, so 599 // that no dangling references are left behind. We could be a bit smarter if 600 // we kept a dependency graph. It's probably not worth the complexity. 601 for (PtrSetTy::iterator I=SeenVals.begin(), E=SeenVals.end(); I != E; ++I) { 602 CacheMapTy::iterator CacheIt = CacheMap.find(*I); 603 // non-computable results can be safely cached 604 if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second)) 605 CacheMap.erase(CacheIt); 606 } 607 } 608 609 SeenVals.clear(); 610 return Result; 611} 612 613SizeOffsetEvalType ObjectSizeOffsetEvaluator::compute_(Value *V) { 614 ObjectSizeOffsetVisitor Visitor(TD, TLI, Context); 615 SizeOffsetType Const = Visitor.compute(V); 616 if (Visitor.bothKnown(Const)) 617 return std::make_pair(ConstantInt::get(Context, Const.first), 618 ConstantInt::get(Context, Const.second)); 619 620 V = V->stripPointerCasts(); 621 622 // check cache 623 CacheMapTy::iterator CacheIt = CacheMap.find(V); 624 if (CacheIt != CacheMap.end()) 625 return CacheIt->second; 626 627 // always generate code immediately before the instruction being 628 // processed, so that the generated code dominates the same BBs 629 Instruction *PrevInsertPoint = Builder.GetInsertPoint(); 630 if (Instruction *I = dyn_cast<Instruction>(V)) 631 Builder.SetInsertPoint(I); 632 633 // record the pointers that were handled in this run, so that they can be 634 // cleaned later if something fails 635 SeenVals.insert(V); 636 637 // now compute the size and offset 638 SizeOffsetEvalType Result; 639 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) { 640 Result = visitGEPOperator(*GEP); 641 } else if (Instruction *I = dyn_cast<Instruction>(V)) { 642 Result = visit(*I); 643 } else if (isa<Argument>(V) || 644 (isa<ConstantExpr>(V) && 645 cast<ConstantExpr>(V)->getOpcode() == Instruction::IntToPtr) || 646 isa<GlobalAlias>(V) || 647 isa<GlobalVariable>(V)) { 648 // ignore values where we cannot do more than what ObjectSizeVisitor can 649 Result = unknown(); 650 } else { 651 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: " 652 << *V << '\n'); 653 Result = unknown(); 654 } 655 656 if (PrevInsertPoint) 657 Builder.SetInsertPoint(PrevInsertPoint); 658 659 // Don't reuse CacheIt since it may be invalid at this point. 660 CacheMap[V] = Result; 661 return Result; 662} 663 664SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitAllocaInst(AllocaInst &I) { 665 if (!I.getAllocatedType()->isSized()) 666 return unknown(); 667 668 // must be a VLA 669 assert(I.isArrayAllocation()); 670 Value *ArraySize = I.getArraySize(); 671 Value *Size = ConstantInt::get(ArraySize->getType(), 672 TD->getTypeAllocSize(I.getAllocatedType())); 673 Size = Builder.CreateMul(Size, ArraySize); 674 return std::make_pair(Size, Zero); 675} 676 677SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitCallSite(CallSite CS) { 678 const AllocFnsTy *FnData = getAllocationData(CS.getInstruction(), AnyAlloc, 679 TLI); 680 if (!FnData) 681 return unknown(); 682 683 // handle strdup-like functions separately 684 if (FnData->AllocTy == StrDupLike) { 685 // TODO 686 return unknown(); 687 } 688 689 Value *FirstArg = CS.getArgument(FnData->FstParam); 690 FirstArg = Builder.CreateZExt(FirstArg, IntTy); 691 if (FnData->SndParam < 0) 692 return std::make_pair(FirstArg, Zero); 693 694 Value *SecondArg = CS.getArgument(FnData->SndParam); 695 SecondArg = Builder.CreateZExt(SecondArg, IntTy); 696 Value *Size = Builder.CreateMul(FirstArg, SecondArg); 697 return std::make_pair(Size, Zero); 698 699 // TODO: handle more standard functions (+ wchar cousins): 700 // - strdup / strndup 701 // - strcpy / strncpy 702 // - strcat / strncat 703 // - memcpy / memmove 704 // - strcat / strncat 705 // - memset 706} 707 708SizeOffsetEvalType 709ObjectSizeOffsetEvaluator::visitExtractElementInst(ExtractElementInst&) { 710 return unknown(); 711} 712 713SizeOffsetEvalType 714ObjectSizeOffsetEvaluator::visitExtractValueInst(ExtractValueInst&) { 715 return unknown(); 716} 717 718SizeOffsetEvalType 719ObjectSizeOffsetEvaluator::visitGEPOperator(GEPOperator &GEP) { 720 SizeOffsetEvalType PtrData = compute_(GEP.getPointerOperand()); 721 if (!bothKnown(PtrData)) 722 return unknown(); 723 724 Value *Offset = EmitGEPOffset(&Builder, *TD, &GEP, /*NoAssumptions=*/true); 725 Offset = Builder.CreateAdd(PtrData.second, Offset); 726 return std::make_pair(PtrData.first, Offset); 727} 728 729SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitIntToPtrInst(IntToPtrInst&) { 730 // clueless 731 return unknown(); 732} 733 734SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitLoadInst(LoadInst&) { 735 return unknown(); 736} 737 738SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) { 739 // create 2 PHIs: one for size and another for offset 740 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 741 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 742 743 // insert right away in the cache to handle recursive PHIs 744 CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI); 745 746 // compute offset/size for each PHI incoming pointer 747 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) { 748 Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt()); 749 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i)); 750 751 if (!bothKnown(EdgeData)) { 752 OffsetPHI->replaceAllUsesWith(UndefValue::get(IntTy)); 753 OffsetPHI->eraseFromParent(); 754 SizePHI->replaceAllUsesWith(UndefValue::get(IntTy)); 755 SizePHI->eraseFromParent(); 756 return unknown(); 757 } 758 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i)); 759 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i)); 760 } 761 762 Value *Size = SizePHI, *Offset = OffsetPHI, *Tmp; 763 if ((Tmp = SizePHI->hasConstantValue())) { 764 Size = Tmp; 765 SizePHI->replaceAllUsesWith(Size); 766 SizePHI->eraseFromParent(); 767 } 768 if ((Tmp = OffsetPHI->hasConstantValue())) { 769 Offset = Tmp; 770 OffsetPHI->replaceAllUsesWith(Offset); 771 OffsetPHI->eraseFromParent(); 772 } 773 return std::make_pair(Size, Offset); 774} 775 776SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitSelectInst(SelectInst &I) { 777 SizeOffsetEvalType TrueSide = compute_(I.getTrueValue()); 778 SizeOffsetEvalType FalseSide = compute_(I.getFalseValue()); 779 780 if (!bothKnown(TrueSide) || !bothKnown(FalseSide)) 781 return unknown(); 782 if (TrueSide == FalseSide) 783 return TrueSide; 784 785 Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first, 786 FalseSide.first); 787 Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second, 788 FalseSide.second); 789 return std::make_pair(Size, Offset); 790} 791 792SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitInstruction(Instruction &I) { 793 DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I <<'\n'); 794 return unknown(); 795} 796