6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-17 03:30:28 +00:00
Code Issues Projects Releases Wiki Activity

Replace ScalarEvolution's private copy of getLoopPredecessor

Browse Source 
with LoopInfo's public copy.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@106603 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2010-06-22 23:43:28 +00:00
parent 62a76c6401
commit 605c14fb11
2 changed files with 2 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/llvm/Analysis/ScalarEvolution.h
View File

@ -343,10 +343,6 @@ namespace llvm {
BackedgeTakenInfo HowManyLessThans(const SCEV *LHS, const SCEV *RHS, BackedgeTakenInfo HowManyLessThans(const SCEV *LHS, const SCEV *RHS,
const Loop *L, bool isSigned); const Loop *L, bool isSigned);
/// getLoopPredecessor - If the given loop's header has exactly one unique
/// predecessor outside the loop, return it. Otherwise return null.
BasicBlock *getLoopPredecessor(const Loop *L);
/// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB /// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB
/// (which may not be an immediate predecessor) which has exactly one /// (which may not be an immediate predecessor) which has exactly one
/// successor from which BB is reachable, or null if no such block is /// successor from which BB is reachable, or null if no such block is

21
lib/Analysis/ScalarEvolution.cpp
View File

@ -4691,23 +4691,6 @@ ScalarEvolution::HowFarToNonZero(const SCEV *V, const Loop *L) {
return getCouldNotCompute(); return getCouldNotCompute();
} }
/// getLoopPredecessor - If the given loop's header has exactly one unique
/// predecessor outside the loop, return it. Otherwise return null.
/// This is less strict that the loop "preheader" concept, which requires
/// the predecessor to have only one single successor.
///
BasicBlock *ScalarEvolution::getLoopPredecessor(const Loop *L) {
BasicBlock *Header = L->getHeader();
BasicBlock *Pred = 0;
for (pred_iterator PI = pred_begin(Header), E = pred_end(Header);
PI != E; ++PI)
if (!L->contains(*PI)) {
if (Pred && Pred != *PI) return 0; // Multiple predecessors.
Pred = *PI;
}
return Pred;
}
/// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB /// getPredecessorWithUniqueSuccessorForBB - Return a predecessor of BB
/// (which may not be an immediate predecessor) which has exactly one /// (which may not be an immediate predecessor) which has exactly one
/// successor from which BB is reachable, or null if no such block is /// successor from which BB is reachable, or null if no such block is
@ -4725,7 +4708,7 @@ ScalarEvolution::getPredecessorWithUniqueSuccessorForBB(BasicBlock *BB) {
// If the header has a unique predecessor outside the loop, it must be // If the header has a unique predecessor outside the loop, it must be
// a block that has exactly one successor that can reach the loop. // a block that has exactly one successor that can reach the loop.
if (Loop *L = LI->getLoopFor(BB)) if (Loop *L = LI->getLoopFor(BB))
return std::make_pair(getLoopPredecessor(L), L->getHeader()); return std::make_pair(L->getLoopPredecessor(), L->getHeader());
return std::pair<BasicBlock *, BasicBlock *>(); return std::pair<BasicBlock *, BasicBlock *>();
} }
@ -5176,7 +5159,7 @@ ScalarEvolution::isLoopEntryGuardedByCond(const Loop *L,
// as there are predecessors that can be found that have unique successors // as there are predecessors that can be found that have unique successors
// leading to the original header. // leading to the original header.
for (std::pair<BasicBlock *, BasicBlock *> for (std::pair<BasicBlock *, BasicBlock *>
Pair(getLoopPredecessor(L), L->getHeader()); Pair(L->getLoopPredecessor(), L->getHeader());
Pair.first; Pair.first;
Pair = getPredecessorWithUniqueSuccessorForBB(Pair.first)) { Pair = getPredecessorWithUniqueSuccessorForBB(Pair.first)) {