summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Transforms
diff options
context:
space:
mode:
authorSanjoy Das <sanjoy@playingwithpointers.com>2017-03-03 18:19:15 +0000
committerSanjoy Das <sanjoy@playingwithpointers.com>2017-03-03 18:19:15 +0000
commit664c925a5712d5977b244868c652e158b600af04 (patch)
treefe7c9ba0c55d543be49391e6792dfd19e147589c /llvm/lib/Transforms
parenteed71b9e1ccd4d04f47eb3372a8a39a6aea980a8 (diff)
downloadbcm5719-llvm-664c925a5712d5977b244868c652e158b600af04.tar.gz
bcm5719-llvm-664c925a5712d5977b244868c652e158b600af04.zip
[LoopUnrolling] Peel loops with invariant backedge Phi input
Summary: If a loop contains a Phi node which has an invariant input from back edge, it is profitable to peel such loops (rather than unroll them) to use the advantage that this Phi is always invariant starting from 2nd iteration. After the 1st iteration is peeled, other optimizations can potentially simplify calculations with this invariant. Patch by Max Kazantsev! Reviewers: sanjoy, apilipenko, igor-laevsky, anna, mkuper, reames Reviewed By: mkuper Subscribers: mkuper, mzolotukhin, llvm-commits Differential Revision: https://reviews.llvm.org/D30161 llvm-svn: 296898
Diffstat (limited to 'llvm/lib/Transforms')
-rw-r--r--llvm/lib/Transforms/Utils/LoopUnrollPeel.cpp25
1 files changed, 25 insertions, 0 deletions
diff --git a/llvm/lib/Transforms/Utils/LoopUnrollPeel.cpp b/llvm/lib/Transforms/Utils/LoopUnrollPeel.cpp
index 0227f8a5d13..e45aef88722 100644
--- a/llvm/lib/Transforms/Utils/LoopUnrollPeel.cpp
+++ b/llvm/lib/Transforms/Utils/LoopUnrollPeel.cpp
@@ -71,6 +71,31 @@ void llvm::computePeelCount(Loop *L, unsigned LoopSize,
if (!L->empty())
return;
+ // Try to find a Phi node that has the same loop invariant as an input from
+ // its only back edge. If there is such Phi, peeling 1 iteration from the
+ // loop is profitable, because starting from 2nd iteration we will have an
+ // invariant instead of this Phi.
+ if (auto *BackEdge = L->getLoopLatch()) {
+ BasicBlock *Header = L->getHeader();
+ // Iterate over Phis to find one with invariant input on back edge.
+ bool FoundCandidate = false;
+ PHINode *Phi;
+ for (auto BI = Header->begin(); Phi = dyn_cast<PHINode>(&*BI); ++BI) {
+ Value *Input = Phi->getIncomingValueForBlock(BackEdge);
+ if (L->isLoopInvariant(Input)) {
+ FoundCandidate = true;
+ break;
+ }
+ }
+ if (FoundCandidate) {
+ DEBUG(dbgs() << "Peel one iteration to get rid of " << *Phi
+ << " because starting from 2nd iteration it is always"
+ << " an invariant\n");
+ UP.PeelCount = 1;
+ return;
+ }
+ }
+
// Bail if we know the statically calculated trip count.
// In this case we rather prefer partial unrolling.
if (TripCount)
OpenPOWER on IntegriCloud