OSchip
/
llvm-project
mirror of https://github.com/THU-DSP-LAB/llvm-project.git
13
0
Fork 2
Code Issues Packages Projects Releases Wiki Activity

Revert "[NFC] Formatting fix" 

This reverts commit 59d938e649.
This commit is contained in:
Stefan Pintilie 2021-05-28 11:34:02 -05:00
parent 807fc7cdc9
commit fd55331203
1 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
llvm/lib/Transforms/Scalar/LoopDeletion.cpp
View File

@ -283,17 +283,16 @@ static bool canProveExitOnFirstIteration(Loop *L, DominatorTree &DT,
// Can we prove constant true or false for this condition?
const SCEV *LHSS = getSCEVOnFirstIteration(LHS, L, SE, FirstIterSCEV);
const SCEV *RHSS = getSCEVOnFirstIteration(RHS, L, SE, FirstIterSCEV);
// Only query for liveness of in-loop edge if another successor is also
// 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));
// Only query for liveness of in-loop edge if another successor is also
// 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)) &&
SE.isKnownPredicate(ICmpInst::getInversePredicate(Pred), LHSS,
RHSS))
MarkLiveEdge(BB, Term->getSuccessor(1));
RHSS)) MarkLiveEdge(BB, Term->getSuccessor(1));
else
MarkAllSuccessorsLive(BB);
}