X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FAnalysis%2FLoopDependenceAnalysis.cpp;h=c1afe8fbd61834da3573c1a07a2eea09a46a791a;hb=dcfd404e3ccc66844632aa601bf52522dae41512;hp=bb4f46dff9af0e50d07315ef81e3aba0ec0a9073;hpb=d387b2b1cfe95efcc6269ac26d3160ea10822a45;p=oota-llvm.git diff --git a/lib/Analysis/LoopDependenceAnalysis.cpp b/lib/Analysis/LoopDependenceAnalysis.cpp index bb4f46dff9a..c1afe8fbd61 100644 --- a/lib/Analysis/LoopDependenceAnalysis.cpp +++ b/lib/Analysis/LoopDependenceAnalysis.cpp @@ -27,6 +27,8 @@ #include "llvm/Analysis/LoopPass.h" #include "llvm/Analysis/ScalarEvolution.h" #include "llvm/Analysis/ScalarEvolutionExpressions.h" +#include "llvm/Analysis/ValueTracking.h" +#include "llvm/Assembly/Writer.h" #include "llvm/Instructions.h" #include "llvm/Operator.h" #include "llvm/Support/Allocator.h" @@ -46,8 +48,12 @@ LoopPass *llvm::createLoopDependenceAnalysisPass() { return new LoopDependenceAnalysis(); } -static RegisterPass -R("lda", "Loop Dependence Analysis", false, true); +INITIALIZE_PASS_BEGIN(LoopDependenceAnalysis, "lda", + "Loop Dependence Analysis", false, true) +INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) +INITIALIZE_AG_DEPENDENCY(AliasAnalysis) +INITIALIZE_PASS_END(LoopDependenceAnalysis, "lda", + "Loop Dependence Analysis", false, true) char LoopDependenceAnalysis::ID = 0; //===----------------------------------------------------------------------===// @@ -86,8 +92,8 @@ static Value *GetPointerOperand(Value *I) { static AliasAnalysis::AliasResult UnderlyingObjectsAlias(AliasAnalysis *AA, const Value *A, const Value *B) { - const Value *aObj = A->getUnderlyingObject(); - const Value *bObj = B->getUnderlyingObject(); + const Value *aObj = GetUnderlyingObject(A); + const Value *bObj = GetUnderlyingObject(B); return AA->alias(aObj, AA->getTypeStoreSize(aObj->getType()), bObj, AA->getTypeStoreSize(bObj->getType())); } @@ -119,8 +125,7 @@ bool LoopDependenceAnalysis::findOrInsertDependencePair(Value *A, P = Pairs.FindNodeOrInsertPos(id, insertPos); if (P) return true; - P = PairAllocator.Allocate(); - new (P) DependencePair(id, A, B); + P = new (PairAllocator) DependencePair(id, A, B); Pairs.InsertNode(P, insertPos); return false; } @@ -129,7 +134,7 @@ void LoopDependenceAnalysis::getLoops(const SCEV *S, DenseSet* Loops) const { // Refactor this into an SCEVVisitor, if efficiency becomes a concern. for (const Loop *L = this->L; L != 0; L = L->getParentLoop()) - if (!S->isLoopInvariant(L)) + if (!SE->isLoopInvariant(S, L)) Loops->insert(L); } @@ -218,6 +223,7 @@ LoopDependenceAnalysis::analysePair(DependencePair *P) const { switch (UnderlyingObjectsAlias(AA, aPtr, bPtr)) { case AliasAnalysis::MayAlias: + case AliasAnalysis::PartialAlias: // We can not analyse objects if we do not know about their aliasing. DEBUG(dbgs() << "---> [?] may alias\n"); return Unknown;