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/BasicAliasAnalysis.h"
17 #include "llvm/ADT/SmallVector.h"
18 #include "llvm/ADT/Statistic.h"
19 #include "llvm/Analysis/AliasAnalysis.h"
20 #include "llvm/Analysis/CFG.h"
21 #include "llvm/Analysis/CaptureTracking.h"
22 #include "llvm/Analysis/InstructionSimplify.h"
23 #include "llvm/Analysis/LoopInfo.h"
24 #include "llvm/Analysis/MemoryBuiltins.h"
25 #include "llvm/Analysis/ValueTracking.h"
26 #include "llvm/IR/Constants.h"
27 #include "llvm/IR/DataLayout.h"
28 #include "llvm/IR/DerivedTypes.h"
29 #include "llvm/IR/Dominators.h"
30 #include "llvm/IR/GlobalAlias.h"
31 #include "llvm/IR/GlobalVariable.h"
32 #include "llvm/IR/Instructions.h"
33 #include "llvm/IR/IntrinsicInst.h"
34 #include "llvm/IR/LLVMContext.h"
35 #include "llvm/IR/Operator.h"
36 #include "llvm/Pass.h"
37 #include "llvm/Support/ErrorHandling.h"
41 /// Enable analysis of recursive PHI nodes.
42 static cl::opt<bool> EnableRecPhiAnalysis("basicaa-recphi",
43 cl::Hidden, cl::init(false));
45 /// SearchLimitReached / SearchTimes shows how often the limit of
46 /// to decompose GEPs is reached. It will affect the precision
47 /// of basic alias analysis.
48 #define DEBUG_TYPE "basicaa"
49 STATISTIC(SearchLimitReached, "Number of times the limit to "
50 "decompose GEPs is reached");
51 STATISTIC(SearchTimes, "Number of times a GEP is decomposed");
53 /// Cutoff after which to stop analysing a set of phi nodes potentially involved
54 /// in a cycle. Because we are analysing 'through' phi nodes we need to be
55 /// careful with value equivalence. We use reachability to make sure a value
56 /// cannot be involved in a cycle.
57 const unsigned MaxNumPhiBBsValueReachabilityCheck = 20;
59 // The max limit of the search depth in DecomposeGEPExpression() and
60 // GetUnderlyingObject(), both functions need to use the same search
61 // depth otherwise the algorithm in aliasGEP will assert.
62 static const unsigned MaxLookupSearchDepth = 6;
64 //===----------------------------------------------------------------------===//
66 //===----------------------------------------------------------------------===//
68 /// isNonEscapingLocalObject - Return true if the pointer is to a function-local
69 /// object that never escapes from the function.
70 static bool isNonEscapingLocalObject(const Value *V) {
71 // If this is a local allocation, check to see if it escapes.
72 if (isa<AllocaInst>(V) || isNoAliasCall(V))
73 // Set StoreCaptures to True so that we can assume in our callers that the
74 // pointer is not the result of a load instruction. Currently
75 // PointerMayBeCaptured doesn't have any special analysis for the
76 // StoreCaptures=false case; if it did, our callers could be refined to be
78 return !PointerMayBeCaptured(V, false, /*StoreCaptures=*/true);
80 // If this is an argument that corresponds to a byval or noalias argument,
81 // then it has not escaped before entering the function. Check if it escapes
82 // inside the function.
83 if (const Argument *A = dyn_cast<Argument>(V))
84 if (A->hasByValAttr() || A->hasNoAliasAttr())
85 // Note even if the argument is marked nocapture we still need to check
86 // for copies made inside the function. The nocapture attribute only
87 // specifies that there are no copies made that outlive the function.
88 return !PointerMayBeCaptured(V, false, /*StoreCaptures=*/true);
93 /// isEscapeSource - Return true if the pointer is one which would have
94 /// been considered an escape by isNonEscapingLocalObject.
95 static bool isEscapeSource(const Value *V) {
96 if (isa<CallInst>(V) || isa<InvokeInst>(V) || isa<Argument>(V))
99 // The load case works because isNonEscapingLocalObject considers all
100 // stores to be escapes (it passes true for the StoreCaptures argument
101 // to PointerMayBeCaptured).
102 if (isa<LoadInst>(V))
108 /// getObjectSize - Return the size of the object specified by V, or
109 /// UnknownSize if unknown.
110 static uint64_t getObjectSize(const Value *V, const DataLayout &DL,
111 const TargetLibraryInfo &TLI,
112 bool RoundToAlign = false) {
114 if (getObjectSize(V, Size, DL, &TLI, RoundToAlign))
116 return MemoryLocation::UnknownSize;
119 /// isObjectSmallerThan - Return true if we can prove that the object specified
120 /// by V is smaller than Size.
121 static bool isObjectSmallerThan(const Value *V, uint64_t Size,
122 const DataLayout &DL,
123 const TargetLibraryInfo &TLI) {
124 // Note that the meanings of the "object" are slightly different in the
125 // following contexts:
126 // c1: llvm::getObjectSize()
127 // c2: llvm.objectsize() intrinsic
128 // c3: isObjectSmallerThan()
129 // c1 and c2 share the same meaning; however, the meaning of "object" in c3
130 // refers to the "entire object".
132 // Consider this example:
133 // char *p = (char*)malloc(100)
136 // In the context of c1 and c2, the "object" pointed by q refers to the
137 // stretch of memory of q[0:19]. So, getObjectSize(q) should return 20.
139 // However, in the context of c3, the "object" refers to the chunk of memory
140 // being allocated. So, the "object" has 100 bytes, and q points to the middle
141 // the "object". In case q is passed to isObjectSmallerThan() as the 1st
142 // parameter, before the llvm::getObjectSize() is called to get the size of
143 // entire object, we should:
144 // - either rewind the pointer q to the base-address of the object in
145 // question (in this case rewind to p), or
146 // - just give up. It is up to caller to make sure the pointer is pointing
147 // to the base address the object.
149 // We go for 2nd option for simplicity.
150 if (!isIdentifiedObject(V))
153 // This function needs to use the aligned object size because we allow
154 // reads a bit past the end given sufficient alignment.
155 uint64_t ObjectSize = getObjectSize(V, DL, TLI, /*RoundToAlign*/true);
157 return ObjectSize != MemoryLocation::UnknownSize && ObjectSize < Size;
160 /// isObjectSize - Return true if we can prove that the object specified
161 /// by V has size Size.
162 static bool isObjectSize(const Value *V, uint64_t Size,
163 const DataLayout &DL, const TargetLibraryInfo &TLI) {
164 uint64_t ObjectSize = getObjectSize(V, DL, TLI);
165 return ObjectSize != MemoryLocation::UnknownSize && ObjectSize == Size;
168 //===----------------------------------------------------------------------===//
169 // GetElementPtr Instruction Decomposition and Analysis
170 //===----------------------------------------------------------------------===//
172 /// GetLinearExpression - Analyze the specified value as a linear expression:
173 /// "A*V + B", where A and B are constant integers. Return the scale and offset
174 /// values as APInts and return V as a Value*, and return whether we looked
175 /// through any sign or zero extends. The incoming Value is known to have
176 /// IntegerType and it may already be sign or zero extended.
178 /// Note that this looks through extends, so the high bits may not be
179 /// represented in the result.
180 /*static*/ Value *BasicAliasAnalysis::GetLinearExpression(
181 Value *V, APInt &Scale, APInt &Offset, ExtensionKind &Extension,
182 const DataLayout &DL, unsigned Depth, AssumptionCache *AC,
184 assert(V->getType()->isIntegerTy() && "Not an integer value");
186 // Limit our recursion depth.
193 if (ConstantInt *Const = dyn_cast<ConstantInt>(V)) {
194 // if it's a constant, just convert it to an offset
195 // and remove the variable.
196 Offset += Const->getValue();
197 assert(Scale == 0 && "Constant values don't have a scale");
201 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(V)) {
202 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(BOp->getOperand(1))) {
203 switch (BOp->getOpcode()) {
205 case Instruction::Or:
206 // X|C == X+C if all the bits in C are unset in X. Otherwise we can't
208 if (!MaskedValueIsZero(BOp->getOperand(0), RHSC->getValue(), DL, 0, AC,
212 case Instruction::Add:
213 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
214 DL, Depth + 1, AC, DT);
215 Offset += RHSC->getValue();
217 case Instruction::Mul:
218 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
219 DL, Depth + 1, AC, DT);
220 Offset *= RHSC->getValue();
221 Scale *= RHSC->getValue();
223 case Instruction::Shl:
224 V = GetLinearExpression(BOp->getOperand(0), Scale, Offset, Extension,
225 DL, Depth + 1, AC, DT);
226 Offset <<= RHSC->getValue().getLimitedValue();
227 Scale <<= RHSC->getValue().getLimitedValue();
233 // Since GEP indices are sign extended anyway, we don't care about the high
234 // bits of a sign or zero extended value - just scales and offsets. The
235 // extensions have to be consistent though.
236 if ((isa<SExtInst>(V) && Extension != EK_ZeroExt) ||
237 (isa<ZExtInst>(V) && Extension != EK_SignExt)) {
238 Value *CastOp = cast<CastInst>(V)->getOperand(0);
239 unsigned OldWidth = Scale.getBitWidth();
240 unsigned SmallWidth = CastOp->getType()->getPrimitiveSizeInBits();
241 Scale = Scale.trunc(SmallWidth);
242 Offset = Offset.trunc(SmallWidth);
243 Extension = isa<SExtInst>(V) ? EK_SignExt : EK_ZeroExt;
245 Value *Result = GetLinearExpression(CastOp, Scale, Offset, Extension, DL,
247 Scale = Scale.zext(OldWidth);
249 // We have to sign-extend even if Extension == EK_ZeroExt as we can't
250 // decompose a sign extension (i.e. zext(x - 1) != zext(x) - zext(-1)).
251 Offset = Offset.sext(OldWidth);
261 /// DecomposeGEPExpression - If V is a symbolic pointer expression, decompose it
262 /// into a base pointer with a constant offset and a number of scaled symbolic
265 /// The scaled symbolic offsets (represented by pairs of a Value* and a scale in
266 /// the VarIndices vector) are Value*'s that are known to be scaled by the
267 /// specified amount, but which may have other unrepresented high bits. As such,
268 /// the gep cannot necessarily be reconstructed from its decomposed form.
270 /// When DataLayout is around, this function is capable of analyzing everything
271 /// that GetUnderlyingObject can look through. To be able to do that
272 /// GetUnderlyingObject and DecomposeGEPExpression must use the same search
273 /// depth (MaxLookupSearchDepth).
274 /// When DataLayout not is around, it just looks through pointer casts.
276 /*static*/ const Value *BasicAliasAnalysis::DecomposeGEPExpression(
277 const Value *V, int64_t &BaseOffs,
278 SmallVectorImpl<VariableGEPIndex> &VarIndices, bool &MaxLookupReached,
279 const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) {
280 // Limit recursion depth to limit compile time in crazy cases.
281 unsigned MaxLookup = MaxLookupSearchDepth;
282 MaxLookupReached = false;
287 // See if this is a bitcast or GEP.
288 const Operator *Op = dyn_cast<Operator>(V);
290 // The only non-operator case we can handle are GlobalAliases.
291 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
292 if (!GA->mayBeOverridden()) {
293 V = GA->getAliasee();
300 if (Op->getOpcode() == Instruction::BitCast ||
301 Op->getOpcode() == Instruction::AddrSpaceCast) {
302 V = Op->getOperand(0);
306 const GEPOperator *GEPOp = dyn_cast<GEPOperator>(Op);
308 // If it's not a GEP, hand it off to SimplifyInstruction to see if it
309 // can come up with something. This matches what GetUnderlyingObject does.
310 if (const Instruction *I = dyn_cast<Instruction>(V))
311 // TODO: Get a DominatorTree and AssumptionCache and use them here
312 // (these are both now available in this function, but this should be
313 // updated when GetUnderlyingObject is updated). TLI should be
315 if (const Value *Simplified =
316 SimplifyInstruction(const_cast<Instruction *>(I), DL)) {
324 // Don't attempt to analyze GEPs over unsized objects.
325 if (!GEPOp->getOperand(0)->getType()->getPointerElementType()->isSized())
328 unsigned AS = GEPOp->getPointerAddressSpace();
329 // Walk the indices of the GEP, accumulating them into BaseOff/VarIndices.
330 gep_type_iterator GTI = gep_type_begin(GEPOp);
331 for (User::const_op_iterator I = GEPOp->op_begin()+1,
332 E = GEPOp->op_end(); I != E; ++I) {
334 // Compute the (potentially symbolic) offset in bytes for this index.
335 if (StructType *STy = dyn_cast<StructType>(*GTI++)) {
336 // For a struct, add the member offset.
337 unsigned FieldNo = cast<ConstantInt>(Index)->getZExtValue();
338 if (FieldNo == 0) continue;
340 BaseOffs += DL.getStructLayout(STy)->getElementOffset(FieldNo);
344 // For an array/pointer, add the element offset, explicitly scaled.
345 if (ConstantInt *CIdx = dyn_cast<ConstantInt>(Index)) {
346 if (CIdx->isZero()) continue;
347 BaseOffs += DL.getTypeAllocSize(*GTI) * CIdx->getSExtValue();
351 uint64_t Scale = DL.getTypeAllocSize(*GTI);
352 ExtensionKind Extension = EK_NotExtended;
354 // If the integer type is smaller than the pointer size, it is implicitly
355 // sign extended to pointer size.
356 unsigned Width = Index->getType()->getIntegerBitWidth();
357 if (DL.getPointerSizeInBits(AS) > Width)
358 Extension = EK_SignExt;
360 // Use GetLinearExpression to decompose the index into a C1*V+C2 form.
361 APInt IndexScale(Width, 0), IndexOffset(Width, 0);
362 Index = GetLinearExpression(Index, IndexScale, IndexOffset, Extension, DL,
365 // The GEP index scale ("Scale") scales C1*V+C2, yielding (C1*V+C2)*Scale.
366 // This gives us an aggregate computation of (C1*Scale)*V + C2*Scale.
367 BaseOffs += IndexOffset.getSExtValue()*Scale;
368 Scale *= IndexScale.getSExtValue();
370 // If we already had an occurrence of this index variable, merge this
371 // scale into it. For example, we want to handle:
372 // A[x][x] -> x*16 + x*4 -> x*20
373 // This also ensures that 'x' only appears in the index list once.
374 for (unsigned i = 0, e = VarIndices.size(); i != e; ++i) {
375 if (VarIndices[i].V == Index &&
376 VarIndices[i].Extension == Extension) {
377 Scale += VarIndices[i].Scale;
378 VarIndices.erase(VarIndices.begin()+i);
383 // Make sure that we have a scale that makes sense for this target's
385 if (unsigned ShiftBits = 64 - DL.getPointerSizeInBits(AS)) {
387 Scale = (int64_t)Scale >> ShiftBits;
391 VariableGEPIndex Entry = {Index, Extension,
392 static_cast<int64_t>(Scale)};
393 VarIndices.push_back(Entry);
397 // Analyze the base pointer next.
398 V = GEPOp->getOperand(0);
399 } while (--MaxLookup);
401 // If the chain of expressions is too deep, just return early.
402 MaxLookupReached = true;
403 SearchLimitReached++;
407 //===----------------------------------------------------------------------===//
408 // BasicAliasAnalysis Pass
409 //===----------------------------------------------------------------------===//
411 // Register the pass...
412 char BasicAliasAnalysis::ID = 0;
413 INITIALIZE_AG_PASS_BEGIN(BasicAliasAnalysis, AliasAnalysis, "basicaa",
414 "Basic Alias Analysis (stateless AA impl)",
416 INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
417 INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
418 INITIALIZE_AG_PASS_END(BasicAliasAnalysis, AliasAnalysis, "basicaa",
419 "Basic Alias Analysis (stateless AA impl)",
422 ImmutablePass *llvm::createBasicAliasAnalysisPass() {
423 return new BasicAliasAnalysis();
426 /// pointsToConstantMemory - Returns whether the given pointer value
427 /// points to memory that is local to the function, with global constants being
428 /// considered local to all functions.
429 bool BasicAliasAnalysis::pointsToConstantMemory(const MemoryLocation &Loc,
431 assert(Visited.empty() && "Visited must be cleared after use!");
433 unsigned MaxLookup = 8;
434 SmallVector<const Value *, 16> Worklist;
435 Worklist.push_back(Loc.Ptr);
437 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), *DL);
438 if (!Visited.insert(V).second) {
440 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
443 // An alloca instruction defines local memory.
444 if (OrLocal && isa<AllocaInst>(V))
447 // A global constant counts as local memory for our purposes.
448 if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
449 // Note: this doesn't require GV to be "ODR" because it isn't legal for a
450 // global to be marked constant in some modules and non-constant in
451 // others. GV may even be a declaration, not a definition.
452 if (!GV->isConstant()) {
454 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
459 // If both select values point to local memory, then so does the select.
460 if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
461 Worklist.push_back(SI->getTrueValue());
462 Worklist.push_back(SI->getFalseValue());
466 // If all values incoming to a phi node point to local memory, then so does
468 if (const PHINode *PN = dyn_cast<PHINode>(V)) {
469 // Don't bother inspecting phi nodes with many operands.
470 if (PN->getNumIncomingValues() > MaxLookup) {
472 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
474 for (Value *IncValue : PN->incoming_values())
475 Worklist.push_back(IncValue);
479 // Otherwise be conservative.
481 return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
483 } while (!Worklist.empty() && --MaxLookup);
486 return Worklist.empty();
489 // FIXME: This code is duplicated with MemoryLocation and should be hoisted to
490 // some common utility location.
491 static bool isMemsetPattern16(const Function *MS,
492 const TargetLibraryInfo &TLI) {
493 if (TLI.has(LibFunc::memset_pattern16) &&
494 MS->getName() == "memset_pattern16") {
495 FunctionType *MemsetType = MS->getFunctionType();
496 if (!MemsetType->isVarArg() && MemsetType->getNumParams() == 3 &&
497 isa<PointerType>(MemsetType->getParamType(0)) &&
498 isa<PointerType>(MemsetType->getParamType(1)) &&
499 isa<IntegerType>(MemsetType->getParamType(2)))
506 /// getModRefBehavior - Return the behavior when calling the given call site.
507 FunctionModRefBehavior
508 BasicAliasAnalysis::getModRefBehavior(ImmutableCallSite CS) {
509 if (CS.doesNotAccessMemory())
510 // Can't do better than this.
511 return FMRB_DoesNotAccessMemory;
513 FunctionModRefBehavior Min = FMRB_UnknownModRefBehavior;
515 // If the callsite knows it only reads memory, don't return worse
517 if (CS.onlyReadsMemory())
518 Min = FMRB_OnlyReadsMemory;
520 if (CS.onlyAccessesArgMemory())
521 Min = FunctionModRefBehavior(Min & FMRB_OnlyAccessesArgumentPointees);
523 // The AliasAnalysis base class has some smarts, lets use them.
524 return FunctionModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min);
527 /// getModRefBehavior - Return the behavior when calling the given function.
528 /// For use when the call site is not known.
529 FunctionModRefBehavior
530 BasicAliasAnalysis::getModRefBehavior(const Function *F) {
531 // If the function declares it doesn't access memory, we can't do better.
532 if (F->doesNotAccessMemory())
533 return FMRB_DoesNotAccessMemory;
535 // For intrinsics, we can check the table.
536 if (Intrinsic::ID iid = F->getIntrinsicID()) {
537 #define GET_INTRINSIC_MODREF_BEHAVIOR
538 #include "llvm/IR/Intrinsics.gen"
539 #undef GET_INTRINSIC_MODREF_BEHAVIOR
542 FunctionModRefBehavior Min = FMRB_UnknownModRefBehavior;
544 // If the function declares it only reads memory, go with that.
545 if (F->onlyReadsMemory())
546 Min = FMRB_OnlyReadsMemory;
548 if (F->onlyAccessesArgMemory())
549 Min = FunctionModRefBehavior(Min & FMRB_OnlyAccessesArgumentPointees);
551 const TargetLibraryInfo &TLI =
552 getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
553 if (isMemsetPattern16(F, TLI))
554 Min = FMRB_OnlyAccessesArgumentPointees;
556 // Otherwise be conservative.
557 return FunctionModRefBehavior(AliasAnalysis::getModRefBehavior(F) & Min);
560 ModRefInfo BasicAliasAnalysis::getArgModRefInfo(ImmutableCallSite CS,
562 if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(CS.getInstruction()))
563 switch (II->getIntrinsicID()) {
566 case Intrinsic::memset:
567 case Intrinsic::memcpy:
568 case Intrinsic::memmove:
569 assert((ArgIdx == 0 || ArgIdx == 1) &&
570 "Invalid argument index for memory intrinsic");
571 return ArgIdx ? MRI_Ref : MRI_Mod;
574 // We can bound the aliasing properties of memset_pattern16 just as we can
575 // for memcpy/memset. This is particularly important because the
576 // LoopIdiomRecognizer likes to turn loops into calls to memset_pattern16
577 // whenever possible.
578 if (CS.getCalledFunction() &&
579 isMemsetPattern16(CS.getCalledFunction(), *TLI)) {
580 assert((ArgIdx == 0 || ArgIdx == 1) &&
581 "Invalid argument index for memset_pattern16");
582 return ArgIdx ? MRI_Ref : MRI_Mod;
584 // FIXME: Handle memset_pattern4 and memset_pattern8 also.
586 return AliasAnalysis::getArgModRefInfo(CS, ArgIdx);
589 static bool isAssumeIntrinsic(ImmutableCallSite CS) {
590 const IntrinsicInst *II = dyn_cast<IntrinsicInst>(CS.getInstruction());
591 if (II && II->getIntrinsicID() == Intrinsic::assume)
597 bool BasicAliasAnalysis::doInitialization(Module &M) {
598 InitializeAliasAnalysis(this, &M.getDataLayout());
602 /// getModRefInfo - Check to see if the specified callsite can clobber the
603 /// specified memory object. Since we only look at local properties of this
604 /// function, we really can't say much about this query. We do, however, use
605 /// simple "address taken" analysis on local objects.
606 ModRefInfo BasicAliasAnalysis::getModRefInfo(ImmutableCallSite CS,
607 const MemoryLocation &Loc) {
608 assert(notDifferentParent(CS.getInstruction(), Loc.Ptr) &&
609 "AliasAnalysis query involving multiple functions!");
611 const Value *Object = GetUnderlyingObject(Loc.Ptr, *DL);
613 // If this is a tail call and Loc.Ptr points to a stack location, we know that
614 // the tail call cannot access or modify the local stack.
615 // We cannot exclude byval arguments here; these belong to the caller of
616 // the current function not to the current function, and a tail callee
617 // may reference them.
618 if (isa<AllocaInst>(Object))
619 if (const CallInst *CI = dyn_cast<CallInst>(CS.getInstruction()))
620 if (CI->isTailCall())
623 // If the pointer is to a locally allocated object that does not escape,
624 // then the call can not mod/ref the pointer unless the call takes the pointer
625 // as an argument, and itself doesn't capture it.
626 if (!isa<Constant>(Object) && CS.getInstruction() != Object &&
627 isNonEscapingLocalObject(Object)) {
628 bool PassedAsArg = false;
630 for (ImmutableCallSite::arg_iterator CI = CS.arg_begin(), CE = CS.arg_end();
631 CI != CE; ++CI, ++ArgNo) {
632 // Only look at the no-capture or byval pointer arguments. If this
633 // pointer were passed to arguments that were neither of these, then it
634 // couldn't be no-capture.
635 if (!(*CI)->getType()->isPointerTy() ||
636 (!CS.doesNotCapture(ArgNo) && !CS.isByValArgument(ArgNo)))
639 // If this is a no-capture pointer argument, see if we can tell that it
640 // is impossible to alias the pointer we're checking. If not, we have to
641 // assume that the call could touch the pointer, even though it doesn't
643 if (!isNoAlias(MemoryLocation(*CI), MemoryLocation(Object))) {
653 // While the assume intrinsic is marked as arbitrarily writing so that
654 // proper control dependencies will be maintained, it never aliases any
655 // particular memory location.
656 if (isAssumeIntrinsic(CS))
659 // The AliasAnalysis base class has some smarts, lets use them.
660 return AliasAnalysis::getModRefInfo(CS, Loc);
663 ModRefInfo BasicAliasAnalysis::getModRefInfo(ImmutableCallSite CS1,
664 ImmutableCallSite CS2) {
665 // While the assume intrinsic is marked as arbitrarily writing so that
666 // proper control dependencies will be maintained, it never aliases any
667 // particular memory location.
668 if (isAssumeIntrinsic(CS1) || isAssumeIntrinsic(CS2))
671 // The AliasAnalysis base class has some smarts, lets use them.
672 return AliasAnalysis::getModRefInfo(CS1, CS2);
675 /// \brief Provide ad-hoc rules to disambiguate accesses through two GEP
676 /// operators, both having the exact same pointer operand.
677 static AliasResult aliasSameBasePointerGEPs(const GEPOperator *GEP1,
679 const GEPOperator *GEP2,
681 const DataLayout &DL) {
683 assert(GEP1->getPointerOperand() == GEP2->getPointerOperand() &&
684 "Expected GEPs with the same pointer operand");
686 // Try to determine whether GEP1 and GEP2 index through arrays, into structs,
687 // such that the struct field accesses provably cannot alias.
688 // We also need at least two indices (the pointer, and the struct field).
689 if (GEP1->getNumIndices() != GEP2->getNumIndices() ||
690 GEP1->getNumIndices() < 2)
693 // If we don't know the size of the accesses through both GEPs, we can't
694 // determine whether the struct fields accessed can't alias.
695 if (V1Size == MemoryLocation::UnknownSize ||
696 V2Size == MemoryLocation::UnknownSize)
700 dyn_cast<ConstantInt>(GEP1->getOperand(GEP1->getNumOperands() - 1));
702 dyn_cast<ConstantInt>(GEP2->getOperand(GEP2->getNumOperands() - 1));
704 // If the last (struct) indices aren't constants, we can't say anything.
705 // If they're identical, the other indices might be also be dynamically
706 // equal, so the GEPs can alias.
707 if (!C1 || !C2 || C1 == C2)
710 // Find the last-indexed type of the GEP, i.e., the type you'd get if
711 // you stripped the last index.
712 // On the way, look at each indexed type. If there's something other
713 // than an array, different indices can lead to different final types.
714 SmallVector<Value *, 8> IntermediateIndices;
716 // Insert the first index; we don't need to check the type indexed
717 // through it as it only drops the pointer indirection.
718 assert(GEP1->getNumIndices() > 1 && "Not enough GEP indices to examine");
719 IntermediateIndices.push_back(GEP1->getOperand(1));
721 // Insert all the remaining indices but the last one.
722 // Also, check that they all index through arrays.
723 for (unsigned i = 1, e = GEP1->getNumIndices() - 1; i != e; ++i) {
724 if (!isa<ArrayType>(GetElementPtrInst::getIndexedType(
725 GEP1->getSourceElementType(), IntermediateIndices)))
727 IntermediateIndices.push_back(GEP1->getOperand(i + 1));
730 StructType *LastIndexedStruct =
731 dyn_cast<StructType>(GetElementPtrInst::getIndexedType(
732 GEP1->getSourceElementType(), IntermediateIndices));
734 if (!LastIndexedStruct)
738 // - both GEPs begin indexing from the exact same pointer;
739 // - the last indices in both GEPs are constants, indexing into a struct;
740 // - said indices are different, hence, the pointed-to fields are different;
741 // - both GEPs only index through arrays prior to that.
743 // This lets us determine that the struct that GEP1 indexes into and the
744 // struct that GEP2 indexes into must either precisely overlap or be
745 // completely disjoint. Because they cannot partially overlap, indexing into
746 // different non-overlapping fields of the struct will never alias.
748 // Therefore, the only remaining thing needed to show that both GEPs can't
749 // alias is that the fields are not overlapping.
750 const StructLayout *SL = DL.getStructLayout(LastIndexedStruct);
751 const uint64_t StructSize = SL->getSizeInBytes();
752 const uint64_t V1Off = SL->getElementOffset(C1->getZExtValue());
753 const uint64_t V2Off = SL->getElementOffset(C2->getZExtValue());
755 auto EltsDontOverlap = [StructSize](uint64_t V1Off, uint64_t V1Size,
756 uint64_t V2Off, uint64_t V2Size) {
757 return V1Off < V2Off && V1Off + V1Size <= V2Off &&
758 ((V2Off + V2Size <= StructSize) ||
759 (V2Off + V2Size - StructSize <= V1Off));
762 if (EltsDontOverlap(V1Off, V1Size, V2Off, V2Size) ||
763 EltsDontOverlap(V2Off, V2Size, V1Off, V1Size))
769 /// aliasGEP - Provide a bunch of ad-hoc rules to disambiguate a GEP instruction
770 /// against another pointer. We know that V1 is a GEP, but we don't know
771 /// anything about V2. UnderlyingV1 is GetUnderlyingObject(GEP1, DL),
772 /// UnderlyingV2 is the same for V2.
774 AliasResult BasicAliasAnalysis::aliasGEP(
775 const GEPOperator *GEP1, uint64_t V1Size, const AAMDNodes &V1AAInfo,
776 const Value *V2, uint64_t V2Size, const AAMDNodes &V2AAInfo,
777 const Value *UnderlyingV1, const Value *UnderlyingV2) {
778 int64_t GEP1BaseOffset;
779 bool GEP1MaxLookupReached;
780 SmallVector<VariableGEPIndex, 4> GEP1VariableIndices;
782 // We have to get two AssumptionCaches here because GEP1 and V2 may be from
783 // different functions.
784 // FIXME: This really doesn't make any sense. We get a dominator tree below
785 // that can only refer to a single function. But this function (aliasGEP) is
786 // a method on an immutable pass that can be called when there *isn't*
787 // a single function. The old pass management layer makes this "work", but
788 // this isn't really a clean solution.
789 AssumptionCacheTracker &ACT = getAnalysis<AssumptionCacheTracker>();
790 AssumptionCache *AC1 = nullptr, *AC2 = nullptr;
791 if (auto *GEP1I = dyn_cast<Instruction>(GEP1))
792 AC1 = &ACT.getAssumptionCache(
793 const_cast<Function &>(*GEP1I->getParent()->getParent()));
794 if (auto *I2 = dyn_cast<Instruction>(V2))
795 AC2 = &ACT.getAssumptionCache(
796 const_cast<Function &>(*I2->getParent()->getParent()));
798 DominatorTreeWrapperPass *DTWP =
799 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
800 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
802 // If we have two gep instructions with must-alias or not-alias'ing base
803 // pointers, figure out if the indexes to the GEP tell us anything about the
805 if (const GEPOperator *GEP2 = dyn_cast<GEPOperator>(V2)) {
806 // Do the base pointers alias?
807 AliasResult BaseAlias =
808 aliasCheck(UnderlyingV1, MemoryLocation::UnknownSize, AAMDNodes(),
809 UnderlyingV2, MemoryLocation::UnknownSize, AAMDNodes());
811 // Check for geps of non-aliasing underlying pointers where the offsets are
813 if ((BaseAlias == MayAlias) && V1Size == V2Size) {
814 // Do the base pointers alias assuming type and size.
815 AliasResult PreciseBaseAlias = aliasCheck(UnderlyingV1, V1Size,
816 V1AAInfo, UnderlyingV2,
818 if (PreciseBaseAlias == NoAlias) {
819 // See if the computed offset from the common pointer tells us about the
820 // relation of the resulting pointer.
821 int64_t GEP2BaseOffset;
822 bool GEP2MaxLookupReached;
823 SmallVector<VariableGEPIndex, 4> GEP2VariableIndices;
824 const Value *GEP2BasePtr =
825 DecomposeGEPExpression(GEP2, GEP2BaseOffset, GEP2VariableIndices,
826 GEP2MaxLookupReached, *DL, AC2, DT);
827 const Value *GEP1BasePtr =
828 DecomposeGEPExpression(GEP1, GEP1BaseOffset, GEP1VariableIndices,
829 GEP1MaxLookupReached, *DL, AC1, DT);
830 // DecomposeGEPExpression and GetUnderlyingObject should return the
831 // same result except when DecomposeGEPExpression has no DataLayout.
832 if (GEP1BasePtr != UnderlyingV1 || GEP2BasePtr != UnderlyingV2) {
834 "DecomposeGEPExpression and GetUnderlyingObject disagree!");
837 // If the max search depth is reached the result is undefined
838 if (GEP2MaxLookupReached || GEP1MaxLookupReached)
842 if (GEP1BaseOffset == GEP2BaseOffset &&
843 GEP1VariableIndices == GEP2VariableIndices)
845 GEP1VariableIndices.clear();
849 // If we get a No or May, then return it immediately, no amount of analysis
850 // will improve this situation.
851 if (BaseAlias != MustAlias) return BaseAlias;
853 // Otherwise, we have a MustAlias. Since the base pointers alias each other
854 // exactly, see if the computed offset from the common pointer tells us
855 // about the relation of the resulting pointer.
856 const Value *GEP1BasePtr =
857 DecomposeGEPExpression(GEP1, GEP1BaseOffset, GEP1VariableIndices,
858 GEP1MaxLookupReached, *DL, AC1, DT);
860 int64_t GEP2BaseOffset;
861 bool GEP2MaxLookupReached;
862 SmallVector<VariableGEPIndex, 4> GEP2VariableIndices;
863 const Value *GEP2BasePtr =
864 DecomposeGEPExpression(GEP2, GEP2BaseOffset, GEP2VariableIndices,
865 GEP2MaxLookupReached, *DL, AC2, DT);
867 // DecomposeGEPExpression and GetUnderlyingObject should return the
868 // same result except when DecomposeGEPExpression has no DataLayout.
869 if (GEP1BasePtr != UnderlyingV1 || GEP2BasePtr != UnderlyingV2) {
871 "DecomposeGEPExpression and GetUnderlyingObject disagree!");
875 // If we know the two GEPs are based off of the exact same pointer (and not
876 // just the same underlying object), see if that tells us anything about
877 // the resulting pointers.
878 if (DL && GEP1->getPointerOperand() == GEP2->getPointerOperand()) {
879 AliasResult R = aliasSameBasePointerGEPs(GEP1, V1Size, GEP2, V2Size, *DL);
880 // If we couldn't find anything interesting, don't abandon just yet.
885 // If the max search depth is reached the result is undefined
886 if (GEP2MaxLookupReached || GEP1MaxLookupReached)
889 // Subtract the GEP2 pointer from the GEP1 pointer to find out their
890 // symbolic difference.
891 GEP1BaseOffset -= GEP2BaseOffset;
892 GetIndexDifference(GEP1VariableIndices, GEP2VariableIndices);
895 // Check to see if these two pointers are related by the getelementptr
896 // instruction. If one pointer is a GEP with a non-zero index of the other
897 // pointer, we know they cannot alias.
899 // If both accesses are unknown size, we can't do anything useful here.
900 if (V1Size == MemoryLocation::UnknownSize &&
901 V2Size == MemoryLocation::UnknownSize)
904 AliasResult R = aliasCheck(UnderlyingV1, MemoryLocation::UnknownSize,
905 AAMDNodes(), V2, V2Size, V2AAInfo);
907 // If V2 may alias GEP base pointer, conservatively returns MayAlias.
908 // If V2 is known not to alias GEP base pointer, then the two values
909 // cannot alias per GEP semantics: "A pointer value formed from a
910 // getelementptr instruction is associated with the addresses associated
911 // with the first operand of the getelementptr".
914 const Value *GEP1BasePtr =
915 DecomposeGEPExpression(GEP1, GEP1BaseOffset, GEP1VariableIndices,
916 GEP1MaxLookupReached, *DL, AC1, DT);
918 // DecomposeGEPExpression and GetUnderlyingObject should return the
919 // same result except when DecomposeGEPExpression has no DataLayout.
920 if (GEP1BasePtr != UnderlyingV1) {
922 "DecomposeGEPExpression and GetUnderlyingObject disagree!");
925 // If the max search depth is reached the result is undefined
926 if (GEP1MaxLookupReached)
930 // In the two GEP Case, if there is no difference in the offsets of the
931 // computed pointers, the resultant pointers are a must alias. This
932 // hapens when we have two lexically identical GEP's (for example).
934 // In the other case, if we have getelementptr <ptr>, 0, 0, 0, 0, ... and V2
935 // must aliases the GEP, the end result is a must alias also.
936 if (GEP1BaseOffset == 0 && GEP1VariableIndices.empty())
939 // If there is a constant difference between the pointers, but the difference
940 // is less than the size of the associated memory object, then we know
941 // that the objects are partially overlapping. If the difference is
942 // greater, we know they do not overlap.
943 if (GEP1BaseOffset != 0 && GEP1VariableIndices.empty()) {
944 if (GEP1BaseOffset >= 0) {
945 if (V2Size != MemoryLocation::UnknownSize) {
946 if ((uint64_t)GEP1BaseOffset < V2Size)
951 // We have the situation where:
954 // ---------------->|
955 // |-->V1Size |-------> V2Size
957 // We need to know that V2Size is not unknown, otherwise we might have
958 // stripped a gep with negative index ('gep <ptr>, -1, ...).
959 if (V1Size != MemoryLocation::UnknownSize &&
960 V2Size != MemoryLocation::UnknownSize) {
961 if (-(uint64_t)GEP1BaseOffset < V1Size)
968 if (!GEP1VariableIndices.empty()) {
970 bool AllPositive = true;
971 for (unsigned i = 0, e = GEP1VariableIndices.size(); i != e; ++i) {
973 // Try to distinguish something like &A[i][1] against &A[42][0].
974 // Grab the least significant bit set in any of the scales. We
975 // don't need std::abs here (even if the scale's negative) as we'll
976 // be ^'ing Modulo with itself later.
977 Modulo |= (uint64_t) GEP1VariableIndices[i].Scale;
980 // If the Value could change between cycles, then any reasoning about
981 // the Value this cycle may not hold in the next cycle. We'll just
982 // give up if we can't determine conditions that hold for every cycle:
983 const Value *V = GEP1VariableIndices[i].V;
985 bool SignKnownZero, SignKnownOne;
986 ComputeSignBit(const_cast<Value *>(V), SignKnownZero, SignKnownOne, *DL,
987 0, AC1, nullptr, DT);
989 // Zero-extension widens the variable, and so forces the sign
991 bool IsZExt = GEP1VariableIndices[i].Extension == EK_ZeroExt;
992 SignKnownZero |= IsZExt;
993 SignKnownOne &= !IsZExt;
995 // If the variable begins with a zero then we know it's
996 // positive, regardless of whether the value is signed or
998 int64_t Scale = GEP1VariableIndices[i].Scale;
1000 (SignKnownZero && Scale >= 0) ||
1001 (SignKnownOne && Scale < 0);
1005 Modulo = Modulo ^ (Modulo & (Modulo - 1));
1007 // We can compute the difference between the two addresses
1008 // mod Modulo. Check whether that difference guarantees that the
1009 // two locations do not alias.
1010 uint64_t ModOffset = (uint64_t)GEP1BaseOffset & (Modulo - 1);
1011 if (V1Size != MemoryLocation::UnknownSize &&
1012 V2Size != MemoryLocation::UnknownSize && ModOffset >= V2Size &&
1013 V1Size <= Modulo - ModOffset)
1016 // If we know all the variables are positive, then GEP1 >= GEP1BasePtr.
1017 // If GEP1BasePtr > V2 (GEP1BaseOffset > 0) then we know the pointers
1018 // don't alias if V2Size can fit in the gap between V2 and GEP1BasePtr.
1019 if (AllPositive && GEP1BaseOffset > 0 && V2Size <= (uint64_t) GEP1BaseOffset)
1023 // Statically, we can see that the base objects are the same, but the
1024 // pointers have dynamic offsets which we can't resolve. And none of our
1025 // little tricks above worked.
1027 // TODO: Returning PartialAlias instead of MayAlias is a mild hack; the
1028 // practical effect of this is protecting TBAA in the case of dynamic
1029 // indices into arrays of unions or malloc'd memory.
1030 return PartialAlias;
1033 static AliasResult MergeAliasResults(AliasResult A, AliasResult B) {
1034 // If the results agree, take it.
1037 // A mix of PartialAlias and MustAlias is PartialAlias.
1038 if ((A == PartialAlias && B == MustAlias) ||
1039 (B == PartialAlias && A == MustAlias))
1040 return PartialAlias;
1041 // Otherwise, we don't know anything.
1045 /// aliasSelect - Provide a bunch of ad-hoc rules to disambiguate a Select
1046 /// instruction against another.
1047 AliasResult BasicAliasAnalysis::aliasSelect(const SelectInst *SI,
1049 const AAMDNodes &SIAAInfo,
1050 const Value *V2, uint64_t V2Size,
1051 const AAMDNodes &V2AAInfo) {
1052 // If the values are Selects with the same condition, we can do a more precise
1053 // check: just check for aliases between the values on corresponding arms.
1054 if (const SelectInst *SI2 = dyn_cast<SelectInst>(V2))
1055 if (SI->getCondition() == SI2->getCondition()) {
1057 aliasCheck(SI->getTrueValue(), SISize, SIAAInfo,
1058 SI2->getTrueValue(), V2Size, V2AAInfo);
1059 if (Alias == MayAlias)
1061 AliasResult ThisAlias =
1062 aliasCheck(SI->getFalseValue(), SISize, SIAAInfo,
1063 SI2->getFalseValue(), V2Size, V2AAInfo);
1064 return MergeAliasResults(ThisAlias, Alias);
1067 // If both arms of the Select node NoAlias or MustAlias V2, then returns
1068 // NoAlias / MustAlias. Otherwise, returns MayAlias.
1070 aliasCheck(V2, V2Size, V2AAInfo, SI->getTrueValue(), SISize, SIAAInfo);
1071 if (Alias == MayAlias)
1074 AliasResult ThisAlias =
1075 aliasCheck(V2, V2Size, V2AAInfo, SI->getFalseValue(), SISize, SIAAInfo);
1076 return MergeAliasResults(ThisAlias, Alias);
1079 // aliasPHI - Provide a bunch of ad-hoc rules to disambiguate a PHI instruction
1081 AliasResult BasicAliasAnalysis::aliasPHI(const PHINode *PN, uint64_t PNSize,
1082 const AAMDNodes &PNAAInfo,
1083 const Value *V2, uint64_t V2Size,
1084 const AAMDNodes &V2AAInfo) {
1085 // Track phi nodes we have visited. We use this information when we determine
1086 // value equivalence.
1087 VisitedPhiBBs.insert(PN->getParent());
1089 // If the values are PHIs in the same block, we can do a more precise
1090 // as well as efficient check: just check for aliases between the values
1091 // on corresponding edges.
1092 if (const PHINode *PN2 = dyn_cast<PHINode>(V2))
1093 if (PN2->getParent() == PN->getParent()) {
1094 LocPair Locs(MemoryLocation(PN, PNSize, PNAAInfo),
1095 MemoryLocation(V2, V2Size, V2AAInfo));
1097 std::swap(Locs.first, Locs.second);
1098 // Analyse the PHIs' inputs under the assumption that the PHIs are
1100 // If the PHIs are May/MustAlias there must be (recursively) an input
1101 // operand from outside the PHIs' cycle that is MayAlias/MustAlias or
1102 // there must be an operation on the PHIs within the PHIs' value cycle
1103 // that causes a MayAlias.
1104 // Pretend the phis do not alias.
1105 AliasResult Alias = NoAlias;
1106 assert(AliasCache.count(Locs) &&
1107 "There must exist an entry for the phi node");
1108 AliasResult OrigAliasResult = AliasCache[Locs];
1109 AliasCache[Locs] = NoAlias;
1111 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1112 AliasResult ThisAlias =
1113 aliasCheck(PN->getIncomingValue(i), PNSize, PNAAInfo,
1114 PN2->getIncomingValueForBlock(PN->getIncomingBlock(i)),
1116 Alias = MergeAliasResults(ThisAlias, Alias);
1117 if (Alias == MayAlias)
1121 // Reset if speculation failed.
1122 if (Alias != NoAlias)
1123 AliasCache[Locs] = OrigAliasResult;
1128 SmallPtrSet<Value*, 4> UniqueSrc;
1129 SmallVector<Value*, 4> V1Srcs;
1130 bool isRecursive = false;
1131 for (Value *PV1 : PN->incoming_values()) {
1132 if (isa<PHINode>(PV1))
1133 // If any of the source itself is a PHI, return MayAlias conservatively
1134 // to avoid compile time explosion. The worst possible case is if both
1135 // sides are PHI nodes. In which case, this is O(m x n) time where 'm'
1136 // and 'n' are the number of PHI sources.
1139 if (EnableRecPhiAnalysis)
1140 if (GEPOperator *PV1GEP = dyn_cast<GEPOperator>(PV1)) {
1141 // Check whether the incoming value is a GEP that advances the pointer
1142 // result of this PHI node (e.g. in a loop). If this is the case, we
1143 // would recurse and always get a MayAlias. Handle this case specially
1145 if (PV1GEP->getPointerOperand() == PN && PV1GEP->getNumIndices() == 1 &&
1146 isa<ConstantInt>(PV1GEP->idx_begin())) {
1152 if (UniqueSrc.insert(PV1).second)
1153 V1Srcs.push_back(PV1);
1156 // If this PHI node is recursive, set the size of the accessed memory to
1157 // unknown to represent all the possible values the GEP could advance the
1160 PNSize = MemoryLocation::UnknownSize;
1162 AliasResult Alias = aliasCheck(V2, V2Size, V2AAInfo,
1163 V1Srcs[0], PNSize, PNAAInfo);
1165 // Early exit if the check of the first PHI source against V2 is MayAlias.
1166 // Other results are not possible.
1167 if (Alias == MayAlias)
1170 // If all sources of the PHI node NoAlias or MustAlias V2, then returns
1171 // NoAlias / MustAlias. Otherwise, returns MayAlias.
1172 for (unsigned i = 1, e = V1Srcs.size(); i != e; ++i) {
1173 Value *V = V1Srcs[i];
1175 AliasResult ThisAlias = aliasCheck(V2, V2Size, V2AAInfo,
1176 V, PNSize, PNAAInfo);
1177 Alias = MergeAliasResults(ThisAlias, Alias);
1178 if (Alias == MayAlias)
1185 // aliasCheck - Provide a bunch of ad-hoc rules to disambiguate in common cases,
1186 // such as array references.
1188 AliasResult BasicAliasAnalysis::aliasCheck(const Value *V1, uint64_t V1Size,
1189 AAMDNodes V1AAInfo, const Value *V2,
1191 AAMDNodes V2AAInfo) {
1192 // If either of the memory references is empty, it doesn't matter what the
1193 // pointer values are.
1194 if (V1Size == 0 || V2Size == 0)
1197 // Strip off any casts if they exist.
1198 V1 = V1->stripPointerCasts();
1199 V2 = V2->stripPointerCasts();
1201 // If V1 or V2 is undef, the result is NoAlias because we can always pick a
1202 // value for undef that aliases nothing in the program.
1203 if (isa<UndefValue>(V1) || isa<UndefValue>(V2))
1206 // Are we checking for alias of the same value?
1207 // Because we look 'through' phi nodes we could look at "Value" pointers from
1208 // different iterations. We must therefore make sure that this is not the
1209 // case. The function isValueEqualInPotentialCycles ensures that this cannot
1210 // happen by looking at the visited phi nodes and making sure they cannot
1212 if (isValueEqualInPotentialCycles(V1, V2))
1215 if (!V1->getType()->isPointerTy() || !V2->getType()->isPointerTy())
1216 return NoAlias; // Scalars cannot alias each other
1218 // Figure out what objects these things are pointing to if we can.
1219 const Value *O1 = GetUnderlyingObject(V1, *DL, MaxLookupSearchDepth);
1220 const Value *O2 = GetUnderlyingObject(V2, *DL, MaxLookupSearchDepth);
1222 // Null values in the default address space don't point to any object, so they
1223 // don't alias any other pointer.
1224 if (const ConstantPointerNull *CPN = dyn_cast<ConstantPointerNull>(O1))
1225 if (CPN->getType()->getAddressSpace() == 0)
1227 if (const ConstantPointerNull *CPN = dyn_cast<ConstantPointerNull>(O2))
1228 if (CPN->getType()->getAddressSpace() == 0)
1232 // If V1/V2 point to two different objects we know that we have no alias.
1233 if (isIdentifiedObject(O1) && isIdentifiedObject(O2))
1236 // Constant pointers can't alias with non-const isIdentifiedObject objects.
1237 if ((isa<Constant>(O1) && isIdentifiedObject(O2) && !isa<Constant>(O2)) ||
1238 (isa<Constant>(O2) && isIdentifiedObject(O1) && !isa<Constant>(O1)))
1241 // Function arguments can't alias with things that are known to be
1242 // unambigously identified at the function level.
1243 if ((isa<Argument>(O1) && isIdentifiedFunctionLocal(O2)) ||
1244 (isa<Argument>(O2) && isIdentifiedFunctionLocal(O1)))
1247 // Most objects can't alias null.
1248 if ((isa<ConstantPointerNull>(O2) && isKnownNonNull(O1)) ||
1249 (isa<ConstantPointerNull>(O1) && isKnownNonNull(O2)))
1252 // If one pointer is the result of a call/invoke or load and the other is a
1253 // non-escaping local object within the same function, then we know the
1254 // object couldn't escape to a point where the call could return it.
1256 // Note that if the pointers are in different functions, there are a
1257 // variety of complications. A call with a nocapture argument may still
1258 // temporary store the nocapture argument's value in a temporary memory
1259 // location if that memory location doesn't escape. Or it may pass a
1260 // nocapture value to other functions as long as they don't capture it.
1261 if (isEscapeSource(O1) && isNonEscapingLocalObject(O2))
1263 if (isEscapeSource(O2) && isNonEscapingLocalObject(O1))
1267 // If the size of one access is larger than the entire object on the other
1268 // side, then we know such behavior is undefined and can assume no alias.
1270 if ((V1Size != MemoryLocation::UnknownSize &&
1271 isObjectSmallerThan(O2, V1Size, *DL, *TLI)) ||
1272 (V2Size != MemoryLocation::UnknownSize &&
1273 isObjectSmallerThan(O1, V2Size, *DL, *TLI)))
1276 // Check the cache before climbing up use-def chains. This also terminates
1277 // otherwise infinitely recursive queries.
1278 LocPair Locs(MemoryLocation(V1, V1Size, V1AAInfo),
1279 MemoryLocation(V2, V2Size, V2AAInfo));
1281 std::swap(Locs.first, Locs.second);
1282 std::pair<AliasCacheTy::iterator, bool> Pair =
1283 AliasCache.insert(std::make_pair(Locs, MayAlias));
1285 return Pair.first->second;
1287 // FIXME: This isn't aggressively handling alias(GEP, PHI) for example: if the
1288 // GEP can't simplify, we don't even look at the PHI cases.
1289 if (!isa<GEPOperator>(V1) && isa<GEPOperator>(V2)) {
1291 std::swap(V1Size, V2Size);
1293 std::swap(V1AAInfo, V2AAInfo);
1295 if (const GEPOperator *GV1 = dyn_cast<GEPOperator>(V1)) {
1296 AliasResult Result = aliasGEP(GV1, V1Size, V1AAInfo, V2, V2Size, V2AAInfo, O1, O2);
1297 if (Result != MayAlias) return AliasCache[Locs] = Result;
1300 if (isa<PHINode>(V2) && !isa<PHINode>(V1)) {
1302 std::swap(V1Size, V2Size);
1303 std::swap(V1AAInfo, V2AAInfo);
1305 if (const PHINode *PN = dyn_cast<PHINode>(V1)) {
1306 AliasResult Result = aliasPHI(PN, V1Size, V1AAInfo,
1307 V2, V2Size, V2AAInfo);
1308 if (Result != MayAlias) return AliasCache[Locs] = Result;
1311 if (isa<SelectInst>(V2) && !isa<SelectInst>(V1)) {
1313 std::swap(V1Size, V2Size);
1314 std::swap(V1AAInfo, V2AAInfo);
1316 if (const SelectInst *S1 = dyn_cast<SelectInst>(V1)) {
1317 AliasResult Result = aliasSelect(S1, V1Size, V1AAInfo,
1318 V2, V2Size, V2AAInfo);
1319 if (Result != MayAlias) return AliasCache[Locs] = Result;
1322 // If both pointers are pointing into the same object and one of them
1323 // accesses is accessing the entire object, then the accesses must
1324 // overlap in some way.
1326 if ((V1Size != MemoryLocation::UnknownSize &&
1327 isObjectSize(O1, V1Size, *DL, *TLI)) ||
1328 (V2Size != MemoryLocation::UnknownSize &&
1329 isObjectSize(O2, V2Size, *DL, *TLI)))
1330 return AliasCache[Locs] = PartialAlias;
1332 AliasResult Result =
1333 AliasAnalysis::alias(MemoryLocation(V1, V1Size, V1AAInfo),
1334 MemoryLocation(V2, V2Size, V2AAInfo));
1335 return AliasCache[Locs] = Result;
1338 bool BasicAliasAnalysis::isValueEqualInPotentialCycles(const Value *V,
1343 const Instruction *Inst = dyn_cast<Instruction>(V);
1347 if (VisitedPhiBBs.empty())
1350 if (VisitedPhiBBs.size() > MaxNumPhiBBsValueReachabilityCheck)
1353 // Use dominance or loop info if available.
1354 DominatorTreeWrapperPass *DTWP =
1355 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
1356 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
1357 auto *LIWP = getAnalysisIfAvailable<LoopInfoWrapperPass>();
1358 LoopInfo *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
1360 // Make sure that the visited phis cannot reach the Value. This ensures that
1361 // the Values cannot come from different iterations of a potential cycle the
1362 // phi nodes could be involved in.
1363 for (auto *P : VisitedPhiBBs)
1364 if (isPotentiallyReachable(P->begin(), Inst, DT, LI))
1370 /// GetIndexDifference - Dest and Src are the variable indices from two
1371 /// decomposed GetElementPtr instructions GEP1 and GEP2 which have common base
1372 /// pointers. Subtract the GEP2 indices from GEP1 to find the symbolic
1373 /// difference between the two pointers.
1374 void BasicAliasAnalysis::GetIndexDifference(
1375 SmallVectorImpl<VariableGEPIndex> &Dest,
1376 const SmallVectorImpl<VariableGEPIndex> &Src) {
1380 for (unsigned i = 0, e = Src.size(); i != e; ++i) {
1381 const Value *V = Src[i].V;
1382 ExtensionKind Extension = Src[i].Extension;
1383 int64_t Scale = Src[i].Scale;
1385 // Find V in Dest. This is N^2, but pointer indices almost never have more
1386 // than a few variable indexes.
1387 for (unsigned j = 0, e = Dest.size(); j != e; ++j) {
1388 if (!isValueEqualInPotentialCycles(Dest[j].V, V) ||
1389 Dest[j].Extension != Extension)
1392 // If we found it, subtract off Scale V's from the entry in Dest. If it
1393 // goes to zero, remove the entry.
1394 if (Dest[j].Scale != Scale)
1395 Dest[j].Scale -= Scale;
1397 Dest.erase(Dest.begin() + j);
1402 // If we didn't consume this entry, add it to the end of the Dest list.
1404 VariableGEPIndex Entry = { V, Extension, -Scale };
1405 Dest.push_back(Entry);