2009-10-14 17:57:32 +00:00
|
|
|
//===- ScalarEvolutionAliasAnalysis.cpp - SCEV-based Alias Analysis -------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the ScalarEvolutionAliasAnalysis pass, which implements a
|
|
|
|
// simple alias analysis implemented in terms of ScalarEvolution queries.
|
|
|
|
//
|
2010-03-03 17:27:15 +00:00
|
|
|
// This differs from traditional loop dependence analysis in that it tests
|
|
|
|
// for dependencies within a single iteration of a loop, rather than
|
2010-07-13 17:19:57 +00:00
|
|
|
// dependencies between different iterations.
|
2010-03-03 17:27:15 +00:00
|
|
|
//
|
2009-10-14 17:57:32 +00:00
|
|
|
// ScalarEvolution has a more complete understanding of pointer arithmetic
|
|
|
|
// than BasicAliasAnalysis' collection of ad-hoc analyses.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2015-12-30 11:46:15 +00:00
|
|
|
#include "llvm/Analysis/ScalarEvolutionAliasAnalysis.h"
|
|
|
|
#include "llvm/Analysis/TargetLibraryInfo.h"
|
2009-10-14 17:57:32 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2015-12-30 11:46:15 +00:00
|
|
|
AliasResult SCEVAAResult::alias(const MemoryLocation &LocA,
|
|
|
|
const MemoryLocation &LocB) {
|
2010-07-13 17:19:57 +00:00
|
|
|
// If either of the memory references is empty, it doesn't matter what the
|
|
|
|
// pointer values are. This allows the code below to ignore this special
|
|
|
|
// case.
|
2011-02-20 12:57:14 +00:00
|
|
|
if (LocA.Size == 0 || LocB.Size == 0)
|
2010-07-13 17:19:57 +00:00
|
|
|
return NoAlias;
|
|
|
|
|
2015-12-30 11:46:15 +00:00
|
|
|
// This is SCEVAAResult. Get the SCEVs!
|
|
|
|
const SCEV *AS = SE.getSCEV(const_cast<Value *>(LocA.Ptr));
|
|
|
|
const SCEV *BS = SE.getSCEV(const_cast<Value *>(LocB.Ptr));
|
2009-10-14 17:57:32 +00:00
|
|
|
|
|
|
|
// If they evaluate to the same expression, it's a MustAlias.
|
2015-12-30 11:46:15 +00:00
|
|
|
if (AS == BS)
|
|
|
|
return MustAlias;
|
2009-10-14 17:57:32 +00:00
|
|
|
|
|
|
|
// If something is known about the difference between the two addresses,
|
|
|
|
// see if it's enough to prove a NoAlias.
|
2015-12-30 11:46:15 +00:00
|
|
|
if (SE.getEffectiveSCEVType(AS->getType()) ==
|
|
|
|
SE.getEffectiveSCEVType(BS->getType())) {
|
|
|
|
unsigned BitWidth = SE.getTypeSizeInBits(AS->getType());
|
2011-02-20 12:57:14 +00:00
|
|
|
APInt ASizeInt(BitWidth, LocA.Size);
|
|
|
|
APInt BSizeInt(BitWidth, LocB.Size);
|
2010-07-13 17:19:57 +00:00
|
|
|
|
|
|
|
// Compute the difference between the two pointers.
|
2015-12-30 11:46:15 +00:00
|
|
|
const SCEV *BA = SE.getMinusSCEV(BS, AS);
|
2010-07-13 17:19:57 +00:00
|
|
|
|
|
|
|
// Test whether the difference is known to be great enough that memory of
|
|
|
|
// the given sizes don't overlap. This assumes that ASizeInt and BSizeInt
|
|
|
|
// are non-zero, which is special-cased above.
|
2015-12-30 11:46:15 +00:00
|
|
|
if (ASizeInt.ule(SE.getUnsignedRange(BA).getUnsignedMin()) &&
|
|
|
|
(-BSizeInt).uge(SE.getUnsignedRange(BA).getUnsignedMax()))
|
2010-07-13 17:19:57 +00:00
|
|
|
return NoAlias;
|
|
|
|
|
|
|
|
// Folding the subtraction while preserving range information can be tricky
|
|
|
|
// (because of INT_MIN, etc.); if the prior test failed, swap AS and BS
|
|
|
|
// and try again to see if things fold better that way.
|
|
|
|
|
|
|
|
// Compute the difference between the two pointers.
|
2015-12-30 11:46:15 +00:00
|
|
|
const SCEV *AB = SE.getMinusSCEV(AS, BS);
|
2010-07-13 17:19:57 +00:00
|
|
|
|
|
|
|
// Test whether the difference is known to be great enough that memory of
|
|
|
|
// the given sizes don't overlap. This assumes that ASizeInt and BSizeInt
|
|
|
|
// are non-zero, which is special-cased above.
|
2015-12-30 11:46:15 +00:00
|
|
|
if (BSizeInt.ule(SE.getUnsignedRange(AB).getUnsignedMin()) &&
|
|
|
|
(-ASizeInt).uge(SE.getUnsignedRange(AB).getUnsignedMax()))
|
2010-07-13 17:19:57 +00:00
|
|
|
return NoAlias;
|
2009-10-14 17:57:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// If ScalarEvolution can find an underlying object, form a new query.
|
|
|
|
// The correctness of this depends on ScalarEvolution not recognizing
|
|
|
|
// inttoptr and ptrtoint operators.
|
2009-11-04 14:58:56 +00:00
|
|
|
Value *AO = GetBaseValue(AS);
|
|
|
|
Value *BO = GetBaseValue(BS);
|
2011-02-20 12:57:14 +00:00
|
|
|
if ((AO && AO != LocA.Ptr) || (BO && BO != LocB.Ptr))
|
2015-06-21 13:59:01 +00:00
|
|
|
if (alias(MemoryLocation(AO ? AO : LocA.Ptr,
|
|
|
|
AO ? +MemoryLocation::UnknownSize : LocA.Size,
|
|
|
|
AO ? AAMDNodes() : LocA.AATags),
|
|
|
|
MemoryLocation(BO ? BO : LocB.Ptr,
|
|
|
|
BO ? +MemoryLocation::UnknownSize : LocB.Size,
|
|
|
|
BO ? AAMDNodes() : LocB.AATags)) == NoAlias)
|
2009-10-14 17:57:32 +00:00
|
|
|
return NoAlias;
|
|
|
|
|
|
|
|
// Forward the query to the next analysis.
|
2015-12-30 11:46:15 +00:00
|
|
|
return AAResultBase::alias(LocA, LocB);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Given an expression, try to find a base value.
|
|
|
|
///
|
|
|
|
/// Returns null if none was found.
|
|
|
|
Value *SCEVAAResult::GetBaseValue(const SCEV *S) {
|
|
|
|
if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
|
|
|
|
// In an addrec, assume that the base will be in the start, rather
|
|
|
|
// than the step.
|
|
|
|
return GetBaseValue(AR->getStart());
|
|
|
|
} else if (const SCEVAddExpr *A = dyn_cast<SCEVAddExpr>(S)) {
|
|
|
|
// If there's a pointer operand, it'll be sorted at the end of the list.
|
|
|
|
const SCEV *Last = A->getOperand(A->getNumOperands() - 1);
|
|
|
|
if (Last->getType()->isPointerTy())
|
|
|
|
return GetBaseValue(Last);
|
|
|
|
} else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) {
|
|
|
|
// This is a leaf node.
|
|
|
|
return U->getValue();
|
|
|
|
}
|
|
|
|
// No Identified object found.
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
SCEVAAResult SCEVAA::run(Function &F, AnalysisManager<Function> *AM) {
|
|
|
|
return SCEVAAResult(AM->getResult<TargetLibraryAnalysis>(F),
|
|
|
|
AM->getResult<ScalarEvolutionAnalysis>(F));
|
|
|
|
}
|
|
|
|
|
|
|
|
char SCEVAA::PassID;
|
|
|
|
|
|
|
|
char SCEVAAWrapperPass::ID = 0;
|
|
|
|
INITIALIZE_PASS_BEGIN(SCEVAAWrapperPass, "scev-aa",
|
|
|
|
"ScalarEvolution-based Alias Analysis", false, true)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(ScalarEvolutionWrapperPass)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
|
|
|
|
INITIALIZE_PASS_END(SCEVAAWrapperPass, "scev-aa",
|
|
|
|
"ScalarEvolution-based Alias Analysis", false, true)
|
|
|
|
|
|
|
|
FunctionPass *llvm::createSCEVAAWrapperPass() {
|
|
|
|
return new SCEVAAWrapperPass();
|
|
|
|
}
|
|
|
|
|
|
|
|
SCEVAAWrapperPass::SCEVAAWrapperPass() : FunctionPass(ID) {
|
|
|
|
initializeSCEVAAWrapperPassPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SCEVAAWrapperPass::runOnFunction(Function &F) {
|
|
|
|
Result.reset(
|
|
|
|
new SCEVAAResult(getAnalysis<TargetLibraryInfoWrapperPass>().getTLI(),
|
|
|
|
getAnalysis<ScalarEvolutionWrapperPass>().getSE()));
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void SCEVAAWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesAll();
|
|
|
|
AU.addRequired<ScalarEvolutionWrapperPass>();
|
|
|
|
AU.addRequired<TargetLibraryInfoWrapperPass>();
|
2009-10-14 17:57:32 +00:00
|
|
|
}
|