1 //===- BasicAliasAnalysis.cpp - Stateless Alias Analysis Impl -------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the primary stateless implementation of the
11 // Alias Analysis interface that implements identities (two different
12 // globals cannot alias, etc), but does no stateful analysis.
14 //===----------------------------------------------------------------------===//
16 #include "llvm/Analysis/AliasAnalysis.h"
17 #include "llvm/Analysis/Passes.h"
18 #include "llvm/Constants.h"
19 #include "llvm/DerivedTypes.h"
20 #include "llvm/Function.h"
21 #include "llvm/GlobalAlias.h"
22 #include "llvm/GlobalVariable.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/IntrinsicInst.h"
25 #include "llvm/LLVMContext.h"
26 #include "llvm/Operator.h"
27 #include "llvm/Pass.h"
28 #include "llvm/Analysis/CaptureTracking.h"
29 #include "llvm/Analysis/MemoryBuiltins.h"
30 #include "llvm/Analysis/InstructionSimplify.h"
31 #include "llvm/Analysis/ValueTracking.h"
32 #include "llvm/Target/TargetData.h"
33 #include "llvm/ADT/SmallPtrSet.h"
34 #include "llvm/ADT/SmallVector.h"
35 #include "llvm/Support/ErrorHandling.h"
36 #include "llvm/Support/GetElementPtrTypeIterator.h"
40 //===----------------------------------------------------------------------===//
42 //===----------------------------------------------------------------------===//
44 /// isKnownNonNull - Return true if we know that the specified value is never
46 static bool isKnownNonNull(const Value *V) {
47 // Alloca never returns null, malloc might.
48 if (isa<AllocaInst>(V)) return true;
50 // A byval argument is never null.
51 if (const Argument *A = dyn_cast<Argument>(V))
52 return A->hasByValAttr();
54 // Global values are not null unless extern weak.
55 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
56 return !GV->hasExternalWeakLinkage();
60 /// isNonEscapingLocalObject - Return true if the pointer is to a function-local
61 /// object that never escapes from the function.
62 static bool isNonEscapingLocalObject(const Value *V) {
63 // If this is a local allocation, check to see if it escapes.
64 if (isa<AllocaInst>(V) || isNoAliasCall(V))
65 // Set StoreCaptures to True so that we can assume in our callers that the
66 // pointer is not the result of a load instruction. Currently
67 // PointerMayBeCaptured doesn't have any special analysis for the
68 // StoreCaptures=false case; if it did, our callers could be refined to be
70 return !PointerMayBeCaptured(V, false, /*StoreCaptures=*/true);
72 // If this is an argument that corresponds to a byval or noalias argument,
73 // then it has not escaped before entering the function. Check if it escapes
74 // inside the function.
75 if (const Argument *A = dyn_cast<Argument>(V))
76 if (A->hasByValAttr() || A->hasNoAliasAttr()) {
77 // Don't bother analyzing arguments already known not to escape.
78 if (A->hasNoCaptureAttr())
80 return !PointerMayBeCaptured(V, false, /*StoreCaptures=*/true);
85 /// isEscapeSource - Return true if the pointer is one which would have
86 /// been considered an escape by isNonEscapingLocalObject.
87 static bool isEscapeSource(const Value *V) {
88 if (isa<CallInst>(V) || isa<InvokeInst>(V) || isa<Argument>(V))
91 // The load case works because isNonEscapingLocalObject considers all
92 // stores to be escapes (it passes true for the StoreCaptures argument
93 // to PointerMayBeCaptured).
100 /// getObjectSize - Return the size of the object specified by V, or
101 /// UnknownSize if unknown.
102 static uint64_t getObjectSize(const Value *V, const TargetData &TD) {
103 const Type *AccessTy;
104 if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
105 if (!GV->hasDefinitiveInitializer())
106 return AliasAnalysis::UnknownSize;
107 AccessTy = GV->getType()->getElementType();
108 } else if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
109 if (!AI->isArrayAllocation())
110 AccessTy = AI->getType()->getElementType();
112 return AliasAnalysis::UnknownSize;
113 } else if (const CallInst* CI = extractMallocCall(V)) {
114 if (!isArrayMalloc(V, &TD))
115 // The size is the argument to the malloc call.
116 if (const ConstantInt* C = dyn_cast<ConstantInt>(CI->getArgOperand(0)))
117 return C->getZExtValue();
118 return AliasAnalysis::UnknownSize;
119 } else if (const Argument *A = dyn_cast<Argument>(V)) {
120 if (A->hasByValAttr())
121 AccessTy = cast<PointerType>(A->getType())->getElementType();
123 return AliasAnalysis::UnknownSize;
125 return AliasAnalysis::UnknownSize;
128 if (AccessTy->isSized())
129 return TD.getTypeAllocSize(AccessTy);
130 return AliasAnalysis::UnknownSize;
133 /// isObjectSmallerThan - Return true if we can prove that the object specified
134 /// by V is smaller than Size.
135 static bool isObjectSmallerThan(const Value *V, uint64_t Size,
136 const TargetData &TD) {
137 uint64_t ObjectSize = getObjectSize(V, TD);
138 return ObjectSize != AliasAnalysis::UnknownSize && ObjectSize < Size;
141 /// isObjectSize - Return true if we can prove that the object specified
142 /// by V has size Size.
143 static bool isObjectSize(const Value *V, uint64_t Size,
144 const TargetData &TD) {
145 uint64_t ObjectSize = getObjectSize(V, TD);
146 return ObjectSize != AliasAnalysis::UnknownSize && ObjectSize == Size;
149 //===----------------------------------------------------------------------===//
150 // GetElementPtr Instruction Decomposition and Analysis
151 //===----------------------------------------------------------------------===//
160 struct VariableGEPIndex {
162 ExtensionKind Extension;
168 /// GetLinearExpression - Analyze the specified value as a linear expression:
169 /// "A*V + B", where A and B are constant integers. Return the scale and offset
170 /// values as APInts and return V as a Value*, and return whether we looked
171 /// through any sign or zero extends. The incoming Value is known to have
172 /// IntegerType and it may already be sign or zero extended.
174 /// Note that this looks through extends, so the high bits may not be
175 /// represented in the result.
176 static Value *GetLinearExpression(Value *V, APInt &Scale, APInt &Offset,
177 ExtensionKind &Extension,
178 const TargetData &TD, unsigned Depth) {
179 assert(V->getType()->isIntegerTy() && "Not an integer value");
181 // Limit our recursion depth.
188 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(V)) {
189 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(BOp->getOperand(1))) {
190 switch (BOp->getOpcode()) {
192 case Instruction::Or:
193 // X|C == X+C if all the bits in C are unset in X. Otherwise we can't
195 if (!MaskedValueIsZero(BOp->getOperand(0), RHSC->getValue(), &TD))
198 case Instruction::Add:
199 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
201 Offset += RHSC->getValue();
203 case Instruction::Mul:
204 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
206 Offset *= RHSC->getValue();
207 Scale *= RHSC->getValue();
209 case Instruction::Shl:
210 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
212 Offset <<= RHSC->getValue().getLimitedValue();
213 Scale <<= RHSC->getValue().getLimitedValue();
219 // Since GEP indices are sign extended anyway, we don't care about the high
220 // bits of a sign or zero extended value - just scales and offsets. The
221 // extensions have to be consistent though.
222 if ((isa<SExtInst>(V) && Extension != EK_ZeroExt) ||
223 (isa<ZExtInst>(V) && Extension != EK_SignExt)) {
224 Value *CastOp = cast<CastInst>(V)->getOperand(0);
225 unsigned OldWidth = Scale.getBitWidth();
226 unsigned SmallWidth = CastOp->getType()->getPrimitiveSizeInBits();
227 Scale = Scale.trunc(SmallWidth);
228 Offset = Offset.trunc(SmallWidth);
229 Extension = isa<SExtInst>(V) ? EK_SignExt : EK_ZeroExt;
231 Value *Result = GetLinearExpression(CastOp, Scale, Offset, Extension,
233 Scale = Scale.zext(OldWidth);
234 Offset = Offset.zext(OldWidth);
244 /// DecomposeGEPExpression - If V is a symbolic pointer expression, decompose it
245 /// into a base pointer with a constant offset and a number of scaled symbolic
248 /// The scaled symbolic offsets (represented by pairs of a Value* and a scale in
249 /// the VarIndices vector) are Value*'s that are known to be scaled by the
250 /// specified amount, but which may have other unrepresented high bits. As such,
251 /// the gep cannot necessarily be reconstructed from its decomposed form.
253 /// When TargetData is around, this function is capable of analyzing everything
254 /// that GetUnderlyingObject can look through. When not, it just looks
255 /// through pointer casts.
258 DecomposeGEPExpression(const Value *V, int64_t &BaseOffs,
259 SmallVectorImpl<VariableGEPIndex> &VarIndices,
260 const TargetData *TD) {
261 // Limit recursion depth to limit compile time in crazy cases.
262 unsigned MaxLookup = 6;
266 // See if this is a bitcast or GEP.
267 const Operator *Op = dyn_cast<Operator>(V);
269 // The only non-operator case we can handle are GlobalAliases.
270 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
271 if (!GA->mayBeOverridden()) {
272 V = GA->getAliasee();
279 if (Op->getOpcode() == Instruction::BitCast) {
280 V = Op->getOperand(0);
284 const GEPOperator *GEPOp = dyn_cast<GEPOperator>(Op);
286 // If it's not a GEP, hand it off to SimplifyInstruction to see if it
287 // can come up with something. This matches what GetUnderlyingObject does.
288 if (const Instruction *I = dyn_cast<Instruction>(V))
289 // TODO: Get a DominatorTree and use it here.
290 if (const Value *Simplified =
291 SimplifyInstruction(const_cast<Instruction *>(I), TD)) {
299 // Don't attempt to analyze GEPs over unsized objects.
300 if (!cast<PointerType>(GEPOp->getOperand(0)->getType())
301 ->getElementType()->isSized())
304 // If we are lacking TargetData information, we can't compute the offets of
305 // elements computed by GEPs. However, we can handle bitcast equivalent
308 if (!GEPOp->hasAllZeroIndices())
310 V = GEPOp->getOperand(0);
314 // Walk the indices of the GEP, accumulating them into BaseOff/VarIndices.
315 gep_type_iterator GTI = gep_type_begin(GEPOp);
316 for (User::const_op_iterator I = GEPOp->op_begin()+1,
317 E = GEPOp->op_end(); I != E; ++I) {
319 // Compute the (potentially symbolic) offset in bytes for this index.
320 if (const StructType *STy = dyn_cast<StructType>(*GTI++)) {
321 // For a struct, add the member offset.
322 unsigned FieldNo = cast<ConstantInt>(Index)->getZExtValue();
323 if (FieldNo == 0) continue;
325 BaseOffs += TD->getStructLayout(STy)->getElementOffset(FieldNo);
329 // For an array/pointer, add the element offset, explicitly scaled.
330 if (ConstantInt *CIdx = dyn_cast<ConstantInt>(Index)) {
331 if (CIdx->isZero()) continue;
332 BaseOffs += TD->getTypeAllocSize(*GTI)*CIdx->getSExtValue();
336 uint64_t Scale = TD->getTypeAllocSize(*GTI);
337 ExtensionKind Extension = EK_NotExtended;
339 // If the integer type is smaller than the pointer size, it is implicitly
340 // sign extended to pointer size.
341 unsigned Width = cast<IntegerType>(Index->getType())->getBitWidth();
342 if (TD->getPointerSizeInBits() > Width)
343 Extension = EK_SignExt;
345 // Use GetLinearExpression to decompose the index into a C1*V+C2 form.
346 APInt IndexScale(Width, 0), IndexOffset(Width, 0);
347 Index = GetLinearExpression(Index, IndexScale, IndexOffset, Extension,
350 // The GEP index scale ("Scale") scales C1*V+C2, yielding (C1*V+C2)*Scale.
351 // This gives us an aggregate computation of (C1*Scale)*V + C2*Scale.
352 BaseOffs += IndexOffset.getSExtValue()*Scale;
353 Scale *= IndexScale.getSExtValue();
356 // If we already had an occurrence of this index variable, merge this
357 // scale into it. For example, we want to handle:
358 // A[x][x] -> x*16 + x*4 -> x*20
359 // This also ensures that 'x' only appears in the index list once.
360 for (unsigned i = 0, e = VarIndices.size(); i != e; ++i) {
361 if (VarIndices[i].V == Index &&
362 VarIndices[i].Extension == Extension) {
363 Scale += VarIndices[i].Scale;
364 VarIndices.erase(VarIndices.begin()+i);
369 // Make sure that we have a scale that makes sense for this target's
371 if (unsigned ShiftBits = 64-TD->getPointerSizeInBits()) {
373 Scale = (int64_t)Scale >> ShiftBits;
377 VariableGEPIndex Entry = {Index, Extension, Scale};
378 VarIndices.push_back(Entry);
382 // Analyze the base pointer next.
383 V = GEPOp->getOperand(0);
384 } while (--MaxLookup);
386 // If the chain of expressions is too deep, just return early.
390 /// GetIndexDifference - Dest and Src are the variable indices from two
391 /// decomposed GetElementPtr instructions GEP1 and GEP2 which have common base
392 /// pointers. Subtract the GEP2 indices from GEP1 to find the symbolic
393 /// difference between the two pointers.
394 static void GetIndexDifference(SmallVectorImpl<VariableGEPIndex> &Dest,
395 const SmallVectorImpl<VariableGEPIndex> &Src) {
396 if (Src.empty()) return;
398 for (unsigned i = 0, e = Src.size(); i != e; ++i) {
399 const Value *V = Src[i].V;
400 ExtensionKind Extension = Src[i].Extension;
401 int64_t Scale = Src[i].Scale;
403 // Find V in Dest. This is N^2, but pointer indices almost never have more
404 // than a few variable indexes.
405 for (unsigned j = 0, e = Dest.size(); j != e; ++j) {
406 if (Dest[j].V != V || Dest[j].Extension != Extension) continue;
408 // If we found it, subtract off Scale V's from the entry in Dest. If it
409 // goes to zero, remove the entry.
410 if (Dest[j].Scale != Scale)
411 Dest[j].Scale -= Scale;
413 Dest.erase(Dest.begin()+j);
418 // If we didn't consume this entry, add it to the end of the Dest list.
420 VariableGEPIndex Entry = { V, Extension, -Scale };
421 Dest.push_back(Entry);
426 //===----------------------------------------------------------------------===//
427 // BasicAliasAnalysis Pass
428 //===----------------------------------------------------------------------===//
431 static const Function *getParent(const Value *V) {
432 if (const Instruction *inst = dyn_cast<Instruction>(V))
433 return inst->getParent()->getParent();
435 if (const Argument *arg = dyn_cast<Argument>(V))
436 return arg->getParent();
441 static bool notDifferentParent(const Value *O1, const Value *O2) {
443 const Function *F1 = getParent(O1);
444 const Function *F2 = getParent(O2);
446 return !F1 || !F2 || F1 == F2;
451 /// BasicAliasAnalysis - This is the primary alias analysis implementation.
452 struct BasicAliasAnalysis : public ImmutablePass, public AliasAnalysis {
453 static char ID; // Class identification, replacement for typeinfo
454 BasicAliasAnalysis() : ImmutablePass(ID) {
455 initializeBasicAliasAnalysisPass(*PassRegistry::getPassRegistry());
458 virtual void initializePass() {
459 InitializeAliasAnalysis(this);
462 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
463 AU.addRequired<AliasAnalysis>();
466 virtual AliasResult alias(const Location &LocA,
467 const Location &LocB) {
468 assert(Visited.empty() && "Visited must be cleared after use!");
469 assert(notDifferentParent(LocA.Ptr, LocB.Ptr) &&
470 "BasicAliasAnalysis doesn't support interprocedural queries.");
471 AliasResult Alias = aliasCheck(LocA.Ptr, LocA.Size, LocA.TBAATag,
472 LocB.Ptr, LocB.Size, LocB.TBAATag);
477 virtual ModRefResult getModRefInfo(ImmutableCallSite CS,
478 const Location &Loc);
480 virtual ModRefResult getModRefInfo(ImmutableCallSite CS1,
481 ImmutableCallSite CS2) {
482 // The AliasAnalysis base class has some smarts, lets use them.
483 return AliasAnalysis::getModRefInfo(CS1, CS2);
486 /// pointsToConstantMemory - Chase pointers until we find a (constant
488 virtual bool pointsToConstantMemory(const Location &Loc, bool OrLocal);
490 /// getModRefBehavior - Return the behavior when calling the given
492 virtual ModRefBehavior getModRefBehavior(ImmutableCallSite CS);
494 /// getModRefBehavior - Return the behavior when calling the given function.
495 /// For use when the call site is not known.
496 virtual ModRefBehavior getModRefBehavior(const Function *F);
498 /// getAdjustedAnalysisPointer - This method is used when a pass implements
499 /// an analysis interface through multiple inheritance. If needed, it
500 /// should override this to adjust the this pointer as needed for the
501 /// specified pass info.
502 virtual void *getAdjustedAnalysisPointer(const void *ID) {
503 if (ID == &AliasAnalysis::ID)
504 return (AliasAnalysis*)this;
509 // Visited - Track instructions visited by a aliasPHI, aliasSelect(), and aliasGEP().
510 SmallPtrSet<const Value*, 16> Visited;
512 // aliasGEP - Provide a bunch of ad-hoc rules to disambiguate a GEP
513 // instruction against another.
514 AliasResult aliasGEP(const GEPOperator *V1, uint64_t V1Size,
515 const Value *V2, uint64_t V2Size,
516 const MDNode *V2TBAAInfo,
517 const Value *UnderlyingV1, const Value *UnderlyingV2);
519 // aliasPHI - Provide a bunch of ad-hoc rules to disambiguate a PHI
520 // instruction against another.
521 AliasResult aliasPHI(const PHINode *PN, uint64_t PNSize,
522 const MDNode *PNTBAAInfo,
523 const Value *V2, uint64_t V2Size,
524 const MDNode *V2TBAAInfo);
526 /// aliasSelect - Disambiguate a Select instruction against another value.
527 AliasResult aliasSelect(const SelectInst *SI, uint64_t SISize,
528 const MDNode *SITBAAInfo,
529 const Value *V2, uint64_t V2Size,
530 const MDNode *V2TBAAInfo);
532 AliasResult aliasCheck(const Value *V1, uint64_t V1Size,
533 const MDNode *V1TBAATag,
534 const Value *V2, uint64_t V2Size,
535 const MDNode *V2TBAATag);
537 } // End of anonymous namespace
539 // Register this pass...
540 char BasicAliasAnalysis::ID = 0;
541 INITIALIZE_AG_PASS(BasicAliasAnalysis, AliasAnalysis, "basicaa",
542 "Basic Alias Analysis (stateless AA impl)",
545 ImmutablePass *llvm::createBasicAliasAnalysisPass() {
546 return new BasicAliasAnalysis();
549 /// pointsToConstantMemory - Returns whether the given pointer value
550 /// points to memory that is local to the function, with global constants being
551 /// considered local to all functions.
553 BasicAliasAnalysis::pointsToConstantMemory(const Location &Loc, bool OrLocal) {
554 assert(Visited.empty() && "Visited must be cleared after use!");
556 unsigned MaxLookup = 8;
557 SmallVector<const Value *, 16> Worklist;
558 Worklist.push_back(Loc.Ptr);
560 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD);
561 if (!Visited.insert(V)) {
563 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
566 // An alloca instruction defines local memory.
567 if (OrLocal && isa<AllocaInst>(V))
570 // A global constant counts as local memory for our purposes.
571 if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
572 // Note: this doesn't require GV to be "ODR" because it isn't legal for a
573 // global to be marked constant in some modules and non-constant in
574 // others. GV may even be a declaration, not a definition.
575 if (!GV->isConstant()) {
577 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
582 // If both select values point to local memory, then so does the select.
583 if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
584 Worklist.push_back(SI->getTrueValue());
585 Worklist.push_back(SI->getFalseValue());
589 // If all values incoming to a phi node point to local memory, then so does
591 if (const PHINode *PN = dyn_cast<PHINode>(V)) {
592 // Don't bother inspecting phi nodes with many operands.
593 if (PN->getNumIncomingValues() > MaxLookup) {
595 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
597 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
598 Worklist.push_back(PN->getIncomingValue(i));
602 // Otherwise be conservative.
604 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
606 } while (!Worklist.empty() && --MaxLookup);
609 return Worklist.empty();
612 /// getModRefBehavior - Return the behavior when calling the given call site.
613 AliasAnalysis::ModRefBehavior
614 BasicAliasAnalysis::getModRefBehavior(ImmutableCallSite CS) {
615 if (CS.doesNotAccessMemory())
616 // Can't do better than this.
617 return DoesNotAccessMemory;
619 ModRefBehavior Min = UnknownModRefBehavior;
621 // If the callsite knows it only reads memory, don't return worse
623 if (CS.onlyReadsMemory())
624 Min = OnlyReadsMemory;
626 // The AliasAnalysis base class has some smarts, lets use them.
627 return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min);
630 /// getModRefBehavior - Return the behavior when calling the given function.
631 /// For use when the call site is not known.
632 AliasAnalysis::ModRefBehavior
633 BasicAliasAnalysis::getModRefBehavior(const Function *F) {
634 // If the function declares it doesn't access memory, we can't do better.
635 if (F->doesNotAccessMemory())
636 return DoesNotAccessMemory;
638 // For intrinsics, we can check the table.
639 if (unsigned iid = F->getIntrinsicID()) {
640 #define GET_INTRINSIC_MODREF_BEHAVIOR
641 #include "llvm/Intrinsics.gen"
642 #undef GET_INTRINSIC_MODREF_BEHAVIOR
645 ModRefBehavior Min = UnknownModRefBehavior;
647 // If the function declares it only reads memory, go with that.
648 if (F->onlyReadsMemory())
649 Min = OnlyReadsMemory;
651 // Otherwise be conservative.
652 return ModRefBehavior(AliasAnalysis::getModRefBehavior(F) & Min);
655 /// getModRefInfo - Check to see if the specified callsite can clobber the
656 /// specified memory object. Since we only look at local properties of this
657 /// function, we really can't say much about this query. We do, however, use
658 /// simple "address taken" analysis on local objects.
659 AliasAnalysis::ModRefResult
660 BasicAliasAnalysis::getModRefInfo(ImmutableCallSite CS,
661 const Location &Loc) {
662 assert(notDifferentParent(CS.getInstruction(), Loc.Ptr) &&
663 "AliasAnalysis query involving multiple functions!");
665 const Value *Object = GetUnderlyingObject(Loc.Ptr, TD);
667 // If this is a tail call and Loc.Ptr points to a stack location, we know that
668 // the tail call cannot access or modify the local stack.
669 // We cannot exclude byval arguments here; these belong to the caller of
670 // the current function not to the current function, and a tail callee
671 // may reference them.
672 if (isa<AllocaInst>(Object))
673 if (const CallInst *CI = dyn_cast<CallInst>(CS.getInstruction()))
674 if (CI->isTailCall())
677 // If the pointer is to a locally allocated object that does not escape,
678 // then the call can not mod/ref the pointer unless the call takes the pointer
679 // as an argument, and itself doesn't capture it.
680 if (!isa<Constant>(Object) && CS.getInstruction() != Object &&
681 isNonEscapingLocalObject(Object)) {
682 bool PassedAsArg = false;
684 for (ImmutableCallSite::arg_iterator CI = CS.arg_begin(), CE = CS.arg_end();
685 CI != CE; ++CI, ++ArgNo) {
686 // Only look at the no-capture or byval pointer arguments. If this
687 // pointer were passed to arguments that were neither of these, then it
688 // couldn't be no-capture.
689 if (!(*CI)->getType()->isPointerTy() ||
690 (!CS.paramHasAttr(ArgNo+1, Attribute::NoCapture) &&
691 !CS.paramHasAttr(ArgNo+1, Attribute::ByVal)))
694 // If this is a no-capture pointer argument, see if we can tell that it
695 // is impossible to alias the pointer we're checking. If not, we have to
696 // assume that the call could touch the pointer, even though it doesn't
698 if (!isNoAlias(Location(cast<Value>(CI)), Loc)) {
708 ModRefResult Min = ModRef;
710 // Finally, handle specific knowledge of intrinsics.
711 const IntrinsicInst *II = dyn_cast<IntrinsicInst>(CS.getInstruction());
713 switch (II->getIntrinsicID()) {
715 case Intrinsic::memcpy:
716 case Intrinsic::memmove: {
717 uint64_t Len = UnknownSize;
718 if (ConstantInt *LenCI = dyn_cast<ConstantInt>(II->getArgOperand(2)))
719 Len = LenCI->getZExtValue();
720 Value *Dest = II->getArgOperand(0);
721 Value *Src = II->getArgOperand(1);
722 // If it can't overlap the source dest, then it doesn't modref the loc.
723 if (isNoAlias(Location(Dest, Len), Loc)) {
724 if (isNoAlias(Location(Src, Len), Loc))
726 // If it can't overlap the dest, then worst case it reads the loc.
728 } else if (isNoAlias(Location(Src, Len), Loc)) {
729 // If it can't overlap the source, then worst case it mutates the loc.
734 case Intrinsic::memset:
735 // Since memset is 'accesses arguments' only, the AliasAnalysis base class
736 // will handle it for the variable length case.
737 if (ConstantInt *LenCI = dyn_cast<ConstantInt>(II->getArgOperand(2))) {
738 uint64_t Len = LenCI->getZExtValue();
739 Value *Dest = II->getArgOperand(0);
740 if (isNoAlias(Location(Dest, Len), Loc))
743 // We know that memset doesn't load anything.
746 case Intrinsic::atomic_cmp_swap:
747 case Intrinsic::atomic_swap:
748 case Intrinsic::atomic_load_add:
749 case Intrinsic::atomic_load_sub:
750 case Intrinsic::atomic_load_and:
751 case Intrinsic::atomic_load_nand:
752 case Intrinsic::atomic_load_or:
753 case Intrinsic::atomic_load_xor:
754 case Intrinsic::atomic_load_max:
755 case Intrinsic::atomic_load_min:
756 case Intrinsic::atomic_load_umax:
757 case Intrinsic::atomic_load_umin:
759 Value *Op1 = II->getArgOperand(0);
760 uint64_t Op1Size = TD->getTypeStoreSize(Op1->getType());
761 MDNode *Tag = II->getMetadata(LLVMContext::MD_tbaa);
762 if (isNoAlias(Location(Op1, Op1Size, Tag), Loc))
766 case Intrinsic::lifetime_start:
767 case Intrinsic::lifetime_end:
768 case Intrinsic::invariant_start: {
770 cast<ConstantInt>(II->getArgOperand(0))->getZExtValue();
771 if (isNoAlias(Location(II->getArgOperand(1),
773 II->getMetadata(LLVMContext::MD_tbaa)),
778 case Intrinsic::invariant_end: {
780 cast<ConstantInt>(II->getArgOperand(1))->getZExtValue();
781 if (isNoAlias(Location(II->getArgOperand(2),
783 II->getMetadata(LLVMContext::MD_tbaa)),
788 case Intrinsic::arm_neon_vld1: {
789 // LLVM's vld1 and vst1 intrinsics currently only support a single
792 TD ? TD->getTypeStoreSize(II->getType()) : UnknownSize;
793 if (isNoAlias(Location(II->getArgOperand(0), Size,
794 II->getMetadata(LLVMContext::MD_tbaa)),
799 case Intrinsic::arm_neon_vst1: {
801 TD ? TD->getTypeStoreSize(II->getArgOperand(1)->getType()) : UnknownSize;
802 if (isNoAlias(Location(II->getArgOperand(0), Size,
803 II->getMetadata(LLVMContext::MD_tbaa)),
810 // The AliasAnalysis base class has some smarts, lets use them.
811 return ModRefResult(AliasAnalysis::getModRefInfo(CS, Loc) & Min);
814 /// aliasGEP - Provide a bunch of ad-hoc rules to disambiguate a GEP instruction
815 /// against another pointer. We know that V1 is a GEP, but we don't know
816 /// anything about V2. UnderlyingV1 is GetUnderlyingObject(GEP1, TD),
817 /// UnderlyingV2 is the same for V2.
819 AliasAnalysis::AliasResult
820 BasicAliasAnalysis::aliasGEP(const GEPOperator *GEP1, uint64_t V1Size,
821 const Value *V2, uint64_t V2Size,
822 const MDNode *V2TBAAInfo,
823 const Value *UnderlyingV1,
824 const Value *UnderlyingV2) {
825 // If this GEP has been visited before, we're on a use-def cycle.
826 // Such cycles are only valid when PHI nodes are involved or in unreachable
827 // code. The visitPHI function catches cycles containing PHIs, but there
828 // could still be a cycle without PHIs in unreachable code.
829 if (!Visited.insert(GEP1))
832 int64_t GEP1BaseOffset;
833 SmallVector<VariableGEPIndex, 4> GEP1VariableIndices;
835 // If we have two gep instructions with must-alias'ing base pointers, figure
836 // out if the indexes to the GEP tell us anything about the derived pointer.
837 if (const GEPOperator *GEP2 = dyn_cast<GEPOperator>(V2)) {
838 // Do the base pointers alias?
839 AliasResult BaseAlias = aliasCheck(UnderlyingV1, UnknownSize, 0,
840 UnderlyingV2, UnknownSize, 0);
842 // If we get a No or May, then return it immediately, no amount of analysis
843 // will improve this situation.
844 if (BaseAlias != MustAlias) return BaseAlias;
846 // Otherwise, we have a MustAlias. Since the base pointers alias each other
847 // exactly, see if the computed offset from the common pointer tells us
848 // about the relation of the resulting pointer.
849 const Value *GEP1BasePtr =
850 DecomposeGEPExpression(GEP1, GEP1BaseOffset, GEP1VariableIndices, TD);
852 int64_t GEP2BaseOffset;
853 SmallVector<VariableGEPIndex, 4> GEP2VariableIndices;
854 const Value *GEP2BasePtr =
855 DecomposeGEPExpression(GEP2, GEP2BaseOffset, GEP2VariableIndices, TD);
857 // If DecomposeGEPExpression isn't able to look all the way through the
858 // addressing operation, we must not have TD and this is too complex for us
859 // to handle without it.
860 if (GEP1BasePtr != UnderlyingV1 || GEP2BasePtr != UnderlyingV2) {
862 "DecomposeGEPExpression and GetUnderlyingObject disagree!");
866 // Subtract the GEP2 pointer from the GEP1 pointer to find out their
867 // symbolic difference.
868 GEP1BaseOffset -= GEP2BaseOffset;
869 GetIndexDifference(GEP1VariableIndices, GEP2VariableIndices);
872 // Check to see if these two pointers are related by the getelementptr
873 // instruction. If one pointer is a GEP with a non-zero index of the other
874 // pointer, we know they cannot alias.
876 // If both accesses are unknown size, we can't do anything useful here.
877 if (V1Size == UnknownSize && V2Size == UnknownSize)
880 AliasResult R = aliasCheck(UnderlyingV1, UnknownSize, 0,
881 V2, V2Size, V2TBAAInfo);
883 // If V2 may alias GEP base pointer, conservatively returns MayAlias.
884 // If V2 is known not to alias GEP base pointer, then the two values
885 // cannot alias per GEP semantics: "A pointer value formed from a
886 // getelementptr instruction is associated with the addresses associated
887 // with the first operand of the getelementptr".
890 const Value *GEP1BasePtr =
891 DecomposeGEPExpression(GEP1, GEP1BaseOffset, GEP1VariableIndices, TD);
893 // If DecomposeGEPExpression isn't able to look all the way through the
894 // addressing operation, we must not have TD and this is too complex for us
895 // to handle without it.
896 if (GEP1BasePtr != UnderlyingV1) {
898 "DecomposeGEPExpression and GetUnderlyingObject disagree!");
903 // In the two GEP Case, if there is no difference in the offsets of the
904 // computed pointers, the resultant pointers are a must alias. This
905 // hapens when we have two lexically identical GEP's (for example).
907 // In the other case, if we have getelementptr <ptr>, 0, 0, 0, 0, ... and V2
908 // must aliases the GEP, the end result is a must alias also.
909 if (GEP1BaseOffset == 0 && GEP1VariableIndices.empty())
912 // If there is a difference between the pointers, but the difference is
913 // less than the size of the associated memory object, then we know
914 // that the objects are partially overlapping.
915 if (GEP1BaseOffset != 0 && GEP1VariableIndices.empty()) {
916 if (GEP1BaseOffset >= 0 ?
917 (V2Size != UnknownSize && (uint64_t)GEP1BaseOffset < V2Size) :
918 (V1Size != UnknownSize && -(uint64_t)GEP1BaseOffset < V1Size &&
919 GEP1BaseOffset != INT64_MIN))
923 // If we have a known constant offset, see if this offset is larger than the
924 // access size being queried. If so, and if no variable indices can remove
925 // pieces of this constant, then we know we have a no-alias. For example,
928 // In order to handle cases like &A[100][i] where i is an out of range
929 // subscript, we have to ignore all constant offset pieces that are a multiple
930 // of a scaled index. Do this by removing constant offsets that are a
931 // multiple of any of our variable indices. This allows us to transform
932 // things like &A[i][1] because i has a stride of (e.g.) 8 bytes but the 1
933 // provides an offset of 4 bytes (assuming a <= 4 byte access).
934 for (unsigned i = 0, e = GEP1VariableIndices.size();
935 i != e && GEP1BaseOffset;++i)
936 if (int64_t RemovedOffset = GEP1BaseOffset/GEP1VariableIndices[i].Scale)
937 GEP1BaseOffset -= RemovedOffset*GEP1VariableIndices[i].Scale;
939 // If our known offset is bigger than the access size, we know we don't have
941 if (GEP1BaseOffset) {
942 if (GEP1BaseOffset >= 0 ?
943 (V2Size != UnknownSize && (uint64_t)GEP1BaseOffset >= V2Size) :
944 (V1Size != UnknownSize && -(uint64_t)GEP1BaseOffset >= V1Size &&
945 GEP1BaseOffset != INT64_MIN))
952 static AliasAnalysis::AliasResult
953 MergeAliasResults(AliasAnalysis::AliasResult A, AliasAnalysis::AliasResult B) {
954 // If the results agree, take it.
957 // A mix of PartialAlias and MustAlias is PartialAlias.
958 if ((A == AliasAnalysis::PartialAlias && B == AliasAnalysis::MustAlias) ||
959 (B == AliasAnalysis::PartialAlias && A == AliasAnalysis::MustAlias))
960 return AliasAnalysis::PartialAlias;
961 // Otherwise, we don't know anything.
962 return AliasAnalysis::MayAlias;
965 /// aliasSelect - Provide a bunch of ad-hoc rules to disambiguate a Select
966 /// instruction against another.
967 AliasAnalysis::AliasResult
968 BasicAliasAnalysis::aliasSelect(const SelectInst *SI, uint64_t SISize,
969 const MDNode *SITBAAInfo,
970 const Value *V2, uint64_t V2Size,
971 const MDNode *V2TBAAInfo) {
972 // If this select has been visited before, we're on a use-def cycle.
973 // Such cycles are only valid when PHI nodes are involved or in unreachable
974 // code. The visitPHI function catches cycles containing PHIs, but there
975 // could still be a cycle without PHIs in unreachable code.
976 if (!Visited.insert(SI))
979 // If the values are Selects with the same condition, we can do a more precise
980 // check: just check for aliases between the values on corresponding arms.
981 if (const SelectInst *SI2 = dyn_cast<SelectInst>(V2))
982 if (SI->getCondition() == SI2->getCondition()) {
984 aliasCheck(SI->getTrueValue(), SISize, SITBAAInfo,
985 SI2->getTrueValue(), V2Size, V2TBAAInfo);
986 if (Alias == MayAlias)
988 AliasResult ThisAlias =
989 aliasCheck(SI->getFalseValue(), SISize, SITBAAInfo,
990 SI2->getFalseValue(), V2Size, V2TBAAInfo);
991 return MergeAliasResults(ThisAlias, Alias);
994 // If both arms of the Select node NoAlias or MustAlias V2, then returns
995 // NoAlias / MustAlias. Otherwise, returns MayAlias.
997 aliasCheck(V2, V2Size, V2TBAAInfo, SI->getTrueValue(), SISize, SITBAAInfo);
998 if (Alias == MayAlias)
1001 // If V2 is visited, the recursive case will have been caught in the
1002 // above aliasCheck call, so these subsequent calls to aliasCheck
1003 // don't need to assume that V2 is being visited recursively.
1006 AliasResult ThisAlias =
1007 aliasCheck(V2, V2Size, V2TBAAInfo, SI->getFalseValue(), SISize, SITBAAInfo);
1008 return MergeAliasResults(ThisAlias, Alias);
1011 // aliasPHI - Provide a bunch of ad-hoc rules to disambiguate a PHI instruction
1013 AliasAnalysis::AliasResult
1014 BasicAliasAnalysis::aliasPHI(const PHINode *PN, uint64_t PNSize,
1015 const MDNode *PNTBAAInfo,
1016 const Value *V2, uint64_t V2Size,
1017 const MDNode *V2TBAAInfo) {
1018 // The PHI node has already been visited, avoid recursion any further.
1019 if (!Visited.insert(PN))
1022 // If the values are PHIs in the same block, we can do a more precise
1023 // as well as efficient check: just check for aliases between the values
1024 // on corresponding edges.
1025 if (const PHINode *PN2 = dyn_cast<PHINode>(V2))
1026 if (PN2->getParent() == PN->getParent()) {
1028 aliasCheck(PN->getIncomingValue(0), PNSize, PNTBAAInfo,
1029 PN2->getIncomingValueForBlock(PN->getIncomingBlock(0)),
1030 V2Size, V2TBAAInfo);
1031 if (Alias == MayAlias)
1033 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i) {
1034 AliasResult ThisAlias =
1035 aliasCheck(PN->getIncomingValue(i), PNSize, PNTBAAInfo,
1036 PN2->getIncomingValueForBlock(PN->getIncomingBlock(i)),
1037 V2Size, V2TBAAInfo);
1038 Alias = MergeAliasResults(ThisAlias, Alias);
1039 if (Alias == MayAlias)
1045 SmallPtrSet<Value*, 4> UniqueSrc;
1046 SmallVector<Value*, 4> V1Srcs;
1047 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1048 Value *PV1 = PN->getIncomingValue(i);
1049 if (isa<PHINode>(PV1))
1050 // If any of the source itself is a PHI, return MayAlias conservatively
1051 // to avoid compile time explosion. The worst possible case is if both
1052 // sides are PHI nodes. In which case, this is O(m x n) time where 'm'
1053 // and 'n' are the number of PHI sources.
1055 if (UniqueSrc.insert(PV1))
1056 V1Srcs.push_back(PV1);
1059 AliasResult Alias = aliasCheck(V2, V2Size, V2TBAAInfo,
1060 V1Srcs[0], PNSize, PNTBAAInfo);
1061 // Early exit if the check of the first PHI source against V2 is MayAlias.
1062 // Other results are not possible.
1063 if (Alias == MayAlias)
1066 // If all sources of the PHI node NoAlias or MustAlias V2, then returns
1067 // NoAlias / MustAlias. Otherwise, returns MayAlias.
1068 for (unsigned i = 1, e = V1Srcs.size(); i != e; ++i) {
1069 Value *V = V1Srcs[i];
1071 // If V2 is visited, the recursive case will have been caught in the
1072 // above aliasCheck call, so these subsequent calls to aliasCheck
1073 // don't need to assume that V2 is being visited recursively.
1076 AliasResult ThisAlias = aliasCheck(V2, V2Size, V2TBAAInfo,
1077 V, PNSize, PNTBAAInfo);
1078 Alias = MergeAliasResults(ThisAlias, Alias);
1079 if (Alias == MayAlias)
1086 // aliasCheck - Provide a bunch of ad-hoc rules to disambiguate in common cases,
1087 // such as array references.
1089 AliasAnalysis::AliasResult
1090 BasicAliasAnalysis::aliasCheck(const Value *V1, uint64_t V1Size,
1091 const MDNode *V1TBAAInfo,
1092 const Value *V2, uint64_t V2Size,
1093 const MDNode *V2TBAAInfo) {
1094 // If either of the memory references is empty, it doesn't matter what the
1095 // pointer values are.
1096 if (V1Size == 0 || V2Size == 0)
1099 // Strip off any casts if they exist.
1100 V1 = V1->stripPointerCasts();
1101 V2 = V2->stripPointerCasts();
1103 // Are we checking for alias of the same value?
1104 if (V1 == V2) return MustAlias;
1106 if (!V1->getType()->isPointerTy() || !V2->getType()->isPointerTy())
1107 return NoAlias; // Scalars cannot alias each other
1109 // Figure out what objects these things are pointing to if we can.
1110 const Value *O1 = GetUnderlyingObject(V1, TD);
1111 const Value *O2 = GetUnderlyingObject(V2, TD);
1113 // Null values in the default address space don't point to any object, so they
1114 // don't alias any other pointer.
1115 if (const ConstantPointerNull *CPN = dyn_cast<ConstantPointerNull>(O1))
1116 if (CPN->getType()->getAddressSpace() == 0)
1118 if (const ConstantPointerNull *CPN = dyn_cast<ConstantPointerNull>(O2))
1119 if (CPN->getType()->getAddressSpace() == 0)
1123 // If V1/V2 point to two different objects we know that we have no alias.
1124 if (isIdentifiedObject(O1) && isIdentifiedObject(O2))
1127 // Constant pointers can't alias with non-const isIdentifiedObject objects.
1128 if ((isa<Constant>(O1) && isIdentifiedObject(O2) && !isa<Constant>(O2)) ||
1129 (isa<Constant>(O2) && isIdentifiedObject(O1) && !isa<Constant>(O1)))
1132 // Arguments can't alias with local allocations or noalias calls
1133 // in the same function.
1134 if (((isa<Argument>(O1) && (isa<AllocaInst>(O2) || isNoAliasCall(O2))) ||
1135 (isa<Argument>(O2) && (isa<AllocaInst>(O1) || isNoAliasCall(O1)))))
1138 // Most objects can't alias null.
1139 if ((isa<ConstantPointerNull>(O2) && isKnownNonNull(O1)) ||
1140 (isa<ConstantPointerNull>(O1) && isKnownNonNull(O2)))
1143 // If one pointer is the result of a call/invoke or load and the other is a
1144 // non-escaping local object within the same function, then we know the
1145 // object couldn't escape to a point where the call could return it.
1147 // Note that if the pointers are in different functions, there are a
1148 // variety of complications. A call with a nocapture argument may still
1149 // temporary store the nocapture argument's value in a temporary memory
1150 // location if that memory location doesn't escape. Or it may pass a
1151 // nocapture value to other functions as long as they don't capture it.
1152 if (isEscapeSource(O1) && isNonEscapingLocalObject(O2))
1154 if (isEscapeSource(O2) && isNonEscapingLocalObject(O1))
1158 // If the size of one access is larger than the entire object on the other
1159 // side, then we know such behavior is undefined and can assume no alias.
1161 if ((V1Size != UnknownSize && isObjectSmallerThan(O2, V1Size, *TD)) ||
1162 (V2Size != UnknownSize && isObjectSmallerThan(O1, V2Size, *TD)))
1165 // FIXME: This isn't aggressively handling alias(GEP, PHI) for example: if the
1166 // GEP can't simplify, we don't even look at the PHI cases.
1167 if (!isa<GEPOperator>(V1) && isa<GEPOperator>(V2)) {
1169 std::swap(V1Size, V2Size);
1172 if (const GEPOperator *GV1 = dyn_cast<GEPOperator>(V1)) {
1173 AliasResult Result = aliasGEP(GV1, V1Size, V2, V2Size, V2TBAAInfo, O1, O2);
1174 if (Result != MayAlias) return Result;
1177 if (isa<PHINode>(V2) && !isa<PHINode>(V1)) {
1179 std::swap(V1Size, V2Size);
1181 if (const PHINode *PN = dyn_cast<PHINode>(V1)) {
1182 AliasResult Result = aliasPHI(PN, V1Size, V1TBAAInfo,
1183 V2, V2Size, V2TBAAInfo);
1184 if (Result != MayAlias) return Result;
1187 if (isa<SelectInst>(V2) && !isa<SelectInst>(V1)) {
1189 std::swap(V1Size, V2Size);
1191 if (const SelectInst *S1 = dyn_cast<SelectInst>(V1)) {
1192 AliasResult Result = aliasSelect(S1, V1Size, V1TBAAInfo,
1193 V2, V2Size, V2TBAAInfo);
1194 if (Result != MayAlias) return Result;
1197 // If both pointers are pointing into the same object and one of them
1198 // accesses is accessing the entire object, then the accesses must
1199 // overlap in some way.
1201 if ((V1Size != UnknownSize && isObjectSize(O1, V1Size, *TD)) ||
1202 (V2Size != UnknownSize && isObjectSize(O2, V2Size, *TD)))
1203 return PartialAlias;
1205 return AliasAnalysis::alias(Location(V1, V1Size, V1TBAAInfo),
1206 Location(V2, V2Size, V2TBAAInfo));