RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-18 18:42:46 +02:00
Code Issues Projects Releases Wiki Activity

[NFC] Reuse existing variables instead of re-requesting successors

Browse Source
This commit is contained in:
Max Kazantsev 2021-05-27 15:01:20 +07:00
parent d5383816bc
commit 8529f1644f
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/Transforms/Scalar/LoopDeletion.cpp
View File

@ -293,7 +293,7 @@ static bool canProveExitOnFirstIteration(Loop *L, DominatorTree &DT,
using namespace PatternMatch;
ICmpInst::Predicate Pred;
Value *LHS, *RHS;
const BasicBlock *IfTrue, *IfFalse;
BasicBlock *IfTrue, *IfFalse;
auto *Term = BB->getTerminator();
// TODO: Handle switches.
if (!match(Term, m_Br(m_ICmp(Pred, m_Value(LHS), m_Value(RHS)),
@ -316,13 +316,12 @@ static bool canProveExitOnFirstIteration(Loop *L, DominatorTree &DT,
// in-loop.
// TODO: isKnownPredicateAt is more powerful, but it's too compile time
// consuming. So we avoid using it here.
if (L->contains(Term->getSuccessor(1)) &&
SE.isKnownPredicate(Pred, LHSS, RHSS))
MarkLiveEdge(BB, Term->getSuccessor(0));
else if (L->contains(Term->getSuccessor(0)) &&
if (L->contains(IfFalse) && SE.isKnownPredicate(Pred, LHSS, RHSS))
MarkLiveEdge(BB, IfTrue);
else if (L->contains(IfTrue) &&
SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), LHSS,
RHSS))
MarkLiveEdge(BB, Term->getSuccessor(1));
MarkLiveEdge(BB, IfFalse);
else
MarkAllSuccessorsLive(BB);
}