blob: 91395b2af6aab0362300838a1b1878fa12398a35 [file] [log] [blame]
Chris Lattner83bf2882004-04-18 05:20:17 +00001//===-- LoopUnroll.cpp - Loop unroller pass -------------------------------===//
Misha Brukmanfd939082005-04-21 23:48:37 +00002//
Chris Lattner83bf2882004-04-18 05:20:17 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanfd939082005-04-21 23:48:37 +00007//
Chris Lattner83bf2882004-04-18 05:20:17 +00008//===----------------------------------------------------------------------===//
9//
10// This pass implements a simple loop unroller. It works best when loops have
11// been canonicalized by the -indvars pass, allowing it to determine the trip
12// counts of loops easily.
Chris Lattner83bf2882004-04-18 05:20:17 +000013//===----------------------------------------------------------------------===//
14
15#define DEBUG_TYPE "loop-unroll"
Dan Gohman45b31972008-05-14 00:24:14 +000016#include "llvm/IntrinsicInst.h"
Chris Lattner83bf2882004-04-18 05:20:17 +000017#include "llvm/Transforms/Scalar.h"
Devang Patel3f1a1e02007-03-07 01:38:05 +000018#include "llvm/Analysis/LoopPass.h"
Chris Lattnerd9e07972011-01-02 07:35:53 +000019#include "llvm/Analysis/CodeMetrics.h"
Dan Gohman052f0002010-07-26 18:11:16 +000020#include "llvm/Analysis/ScalarEvolution.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000021#include "llvm/Support/CommandLine.h"
22#include "llvm/Support/Debug.h"
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000023#include "llvm/Support/raw_ostream.h"
Dan Gohman45b31972008-05-14 00:24:14 +000024#include "llvm/Transforms/Utils/UnrollLoop.h"
Andrew Trickb2ab2fa2011-10-01 01:39:05 +000025#include "llvm/Target/TargetData.h"
Duncan Sands1a2d6672008-05-16 09:30:00 +000026#include <climits>
Chris Lattner83bf2882004-04-18 05:20:17 +000027
Dan Gohman45b31972008-05-14 00:24:14 +000028using namespace llvm;
Chris Lattner83bf2882004-04-18 05:20:17 +000029
Dan Gohman844731a2008-05-13 00:00:25 +000030static cl::opt<unsigned>
Owen Anderson8ea298a2010-09-10 17:57:00 +000031UnrollThreshold("unroll-threshold", cl::init(150), cl::Hidden,
Dan Gohman844731a2008-05-13 00:00:25 +000032 cl::desc("The cut-off point for automatic loop unrolling"));
33
34static cl::opt<unsigned>
35UnrollCount("unroll-count", cl::init(0), cl::Hidden,
36 cl::desc("Use this unroll count for all loops, for testing purposes"));
37
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +000038static cl::opt<bool>
39UnrollAllowPartial("unroll-allow-partial", cl::init(false), cl::Hidden,
40 cl::desc("Allows loops to be partially unrolled until "
41 "-unroll-threshold loop size is reached."));
42
Andrew Trick12d1ebe2011-09-02 17:26:28 +000043// Temporary flag to be removed in 3.0
Andrew Trickb1831c62011-08-11 23:36:16 +000044static cl::opt<bool>
Andrew Trick12d1ebe2011-09-02 17:26:28 +000045NoSCEVUnroll("disable-unroll-scev", cl::init(false), cl::Hidden,
Andrew Trickb1831c62011-08-11 23:36:16 +000046 cl::desc("Use ScalarEvolution to analyze loop trip counts for unrolling"));
47
Chris Lattner0e5f4992006-12-19 21:40:18 +000048namespace {
Chris Lattner3e8b6632009-09-02 06:11:42 +000049 class LoopUnroll : public LoopPass {
Chris Lattner83bf2882004-04-18 05:20:17 +000050 public:
Devang Patel19974732007-05-03 01:11:54 +000051 static char ID; // Pass ID, replacement for typeid
Junjie Gu32644d92011-04-13 16:15:29 +000052 LoopUnroll(int T = -1, int C = -1, int P = -1) : LoopPass(ID) {
Chris Lattnerb3b15712011-04-14 02:27:25 +000053 CurrentThreshold = (T == -1) ? UnrollThreshold : unsigned(T);
54 CurrentCount = (C == -1) ? UnrollCount : unsigned(C);
Junjie Gu32644d92011-04-13 16:15:29 +000055 CurrentAllowPartial = (P == -1) ? UnrollAllowPartial : (bool)P;
56
57 UserThreshold = (T != -1) || (UnrollThreshold.getNumOccurrences() > 0);
Andrew Trickba033772011-07-23 00:29:16 +000058
Owen Anderson081c34b2010-10-19 17:21:58 +000059 initializeLoopUnrollPass(*PassRegistry::getPassRegistry());
60 }
Devang Patel794fd752007-05-01 21:15:47 +000061
Dan Gohmanc7678442007-05-11 20:53:41 +000062 /// A magic value for use with the Threshold parameter to indicate
63 /// that the loop unroll should be performed regardless of how much
64 /// code expansion would result.
65 static const unsigned NoThreshold = UINT_MAX;
Andrew Trickba033772011-07-23 00:29:16 +000066
Owen Andersone9f18822010-09-07 23:15:30 +000067 // Threshold to use when optsize is specified (and there is no
68 // explicit -unroll-threshold).
69 static const unsigned OptSizeUnrollThreshold = 50;
Andrew Trickba033772011-07-23 00:29:16 +000070
Junjie Gu32644d92011-04-13 16:15:29 +000071 unsigned CurrentCount;
Owen Andersone9f18822010-09-07 23:15:30 +000072 unsigned CurrentThreshold;
Junjie Gu32644d92011-04-13 16:15:29 +000073 bool CurrentAllowPartial;
74 bool UserThreshold; // CurrentThreshold is user-specified.
Dan Gohmanc7678442007-05-11 20:53:41 +000075
Devang Patel3f1a1e02007-03-07 01:38:05 +000076 bool runOnLoop(Loop *L, LPPassManager &LPM);
Chris Lattner83bf2882004-04-18 05:20:17 +000077
78 /// This transformation requires natural loop information & requires that
79 /// loop preheaders be inserted into the CFG...
80 ///
81 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
Chris Lattner83bf2882004-04-18 05:20:17 +000082 AU.addRequired<LoopInfo>();
Chris Lattner9c2cc462004-04-18 05:38:37 +000083 AU.addPreserved<LoopInfo>();
Dan Gohman052f0002010-07-26 18:11:16 +000084 AU.addRequiredID(LoopSimplifyID);
85 AU.addPreservedID(LoopSimplifyID);
86 AU.addRequiredID(LCSSAID);
87 AU.addPreservedID(LCSSAID);
Andrew Trick39f40292011-08-10 04:29:49 +000088 AU.addRequired<ScalarEvolution>();
Chris Lattner93779012010-08-29 17:21:35 +000089 AU.addPreserved<ScalarEvolution>();
Devang Patel98260a42008-07-03 07:04:22 +000090 // FIXME: Loop unroll requires LCSSA. And LCSSA requires dom info.
91 // If loop unroll does not preserve dom info then LCSSA pass on next
92 // loop will receive invalid dom info.
93 // For now, recreate dom info, if loop is unrolled.
94 AU.addPreserved<DominatorTree>();
Chris Lattner83bf2882004-04-18 05:20:17 +000095 }
96 };
Chris Lattner83bf2882004-04-18 05:20:17 +000097}
98
Dan Gohman844731a2008-05-13 00:00:25 +000099char LoopUnroll::ID = 0;
Owen Anderson2ab36d32010-10-12 19:48:12 +0000100INITIALIZE_PASS_BEGIN(LoopUnroll, "loop-unroll", "Unroll loops", false, false)
101INITIALIZE_PASS_DEPENDENCY(LoopInfo)
102INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
103INITIALIZE_PASS_DEPENDENCY(LCSSA)
Owen Anderson2ab36d32010-10-12 19:48:12 +0000104INITIALIZE_PASS_END(LoopUnroll, "loop-unroll", "Unroll loops", false, false)
Dan Gohman844731a2008-05-13 00:00:25 +0000105
Junjie Gu32644d92011-04-13 16:15:29 +0000106Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial) {
Junjie Gu7133b852011-04-13 16:45:49 +0000107 return new LoopUnroll(Threshold, Count, AllowPartial);
Junjie Gu32644d92011-04-13 16:15:29 +0000108}
Chris Lattner83bf2882004-04-18 05:20:17 +0000109
Dan Gohmanf742c232007-05-08 15:14:19 +0000110/// ApproximateLoopSize - Approximate the size of the loop.
Andrew Trickb2ab2fa2011-10-01 01:39:05 +0000111static unsigned ApproximateLoopSize(const Loop *L, unsigned &NumCalls,
112 const TargetData *TD) {
Dan Gohmana2aabe32009-10-31 14:54:17 +0000113 CodeMetrics Metrics;
Dan Gohman9b787632008-06-22 20:18:58 +0000114 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
Dan Gohmana2aabe32009-10-31 14:54:17 +0000115 I != E; ++I)
Andrew Trickb2ab2fa2011-10-01 01:39:05 +0000116 Metrics.analyzeBasicBlock(*I, TD);
Owen Andersonf9a26b82010-09-09 20:32:23 +0000117 NumCalls = Metrics.NumInlineCandidates;
Andrew Trickba033772011-07-23 00:29:16 +0000118
Owen Anderson6add2fb2010-09-09 19:07:31 +0000119 unsigned LoopSize = Metrics.NumInsts;
Andrew Trickba033772011-07-23 00:29:16 +0000120
Owen Anderson6add2fb2010-09-09 19:07:31 +0000121 // Don't allow an estimate of size zero. This would allows unrolling of loops
122 // with huge iteration counts, which is a compile time problem even if it's
123 // not a problem for code quality.
124 if (LoopSize == 0) LoopSize = 1;
Andrew Trickba033772011-07-23 00:29:16 +0000125
Owen Anderson6add2fb2010-09-09 19:07:31 +0000126 return LoopSize;
Chris Lattner83bf2882004-04-18 05:20:17 +0000127}
128
Devang Patel3f1a1e02007-03-07 01:38:05 +0000129bool LoopUnroll::runOnLoop(Loop *L, LPPassManager &LPM) {
Dan Gohman45b31972008-05-14 00:24:14 +0000130 LoopInfo *LI = &getAnalysis<LoopInfo>();
Andrew Trickb1831c62011-08-11 23:36:16 +0000131 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>();
Dan Gohmanc7678442007-05-11 20:53:41 +0000132
Dan Gohman1cc00962007-05-08 15:19:19 +0000133 BasicBlock *Header = L->getHeader();
David Greened241e382010-01-05 01:27:44 +0000134 DEBUG(dbgs() << "Loop Unroll: F[" << Header->getParent()->getName()
Daniel Dunbarce63ffb2009-07-25 00:23:56 +0000135 << "] Loop %" << Header->getName() << "\n");
Mike Stump02efa782009-07-27 23:14:11 +0000136 (void)Header;
Andrew Trickba033772011-07-23 00:29:16 +0000137
Owen Andersone9f18822010-09-07 23:15:30 +0000138 // Determine the current unrolling threshold. While this is normally set
139 // from UnrollThreshold, it is overridden to a smaller value if the current
140 // function is marked as optimize-for-size, and the unroll threshold was
141 // not user specified.
Junjie Gu32644d92011-04-13 16:15:29 +0000142 unsigned Threshold = CurrentThreshold;
Andrew Trickba033772011-07-23 00:29:16 +0000143 if (!UserThreshold &&
Junjie Gu32644d92011-04-13 16:15:29 +0000144 Header->getParent()->hasFnAttr(Attribute::OptimizeForSize))
145 Threshold = OptSizeUnrollThreshold;
Dan Gohmanc7678442007-05-11 20:53:41 +0000146
Andrew Trickb1831c62011-08-11 23:36:16 +0000147 // Find trip count and trip multiple if count is not available
148 unsigned TripCount = 0;
Andrew Trick2045ce12011-07-23 00:33:05 +0000149 unsigned TripMultiple = 1;
Andrew Trick12d1ebe2011-09-02 17:26:28 +0000150 if (!NoSCEVUnroll) {
Andrew Trickb1831c62011-08-11 23:36:16 +0000151 // Find "latch trip count". UnrollLoop assumes that control cannot exit
152 // via the loop latch on any iteration prior to TripCount. The loop may exit
153 // early via an earlier branch.
154 BasicBlock *LatchBlock = L->getLoopLatch();
155 if (LatchBlock) {
156 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
157 TripMultiple = SE->getSmallConstantTripMultiple(L, LatchBlock);
158 }
159 }
160 else {
161 TripCount = L->getSmallConstantTripCount();
162 if (TripCount == 0)
163 TripMultiple = L->getSmallConstantTripMultiple();
164 }
Dan Gohmanc7678442007-05-11 20:53:41 +0000165 // Automatically select an unroll count.
Andrew Trick2045ce12011-07-23 00:33:05 +0000166 unsigned Count = CurrentCount;
Dan Gohmanc7678442007-05-11 20:53:41 +0000167 if (Count == 0) {
168 // Conservative heuristic: if we know the trip count, see if we can
169 // completely unroll (subject to the threshold, checked below); otherwise
Andreas Bolkaf1f2dc22009-08-13 02:40:50 +0000170 // try to find greatest modulo of the trip count which is still under
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000171 // threshold value.
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000172 if (TripCount == 0)
Dan Gohmanc7678442007-05-11 20:53:41 +0000173 return false;
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000174 Count = TripCount;
Dan Gohmanc7678442007-05-11 20:53:41 +0000175 }
176
Dan Gohmanc7678442007-05-11 20:53:41 +0000177 // Enforce the threshold.
Junjie Gu32644d92011-04-13 16:15:29 +0000178 if (Threshold != NoThreshold) {
Andrew Trickb2ab2fa2011-10-01 01:39:05 +0000179 const TargetData *TD = getAnalysisIfAvailable<TargetData>();
Owen Andersonf9a26b82010-09-09 20:32:23 +0000180 unsigned NumInlineCandidates;
Andrew Trickb2ab2fa2011-10-01 01:39:05 +0000181 unsigned LoopSize = ApproximateLoopSize(L, NumInlineCandidates, TD);
David Greened241e382010-01-05 01:27:44 +0000182 DEBUG(dbgs() << " Loop Size = " << LoopSize << "\n");
Owen Andersonf9a26b82010-09-09 20:32:23 +0000183 if (NumInlineCandidates != 0) {
184 DEBUG(dbgs() << " Not unrolling loop with inlinable calls.\n");
Owen Anderson547462b2010-09-09 20:02:23 +0000185 return false;
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +0000186 }
Owen Anderson69daca52010-09-29 18:05:19 +0000187 uint64_t Size = (uint64_t)LoopSize*Count;
Junjie Gu32644d92011-04-13 16:15:29 +0000188 if (TripCount != 1 && Size > Threshold) {
David Greened241e382010-01-05 01:27:44 +0000189 DEBUG(dbgs() << " Too large to fully unroll with count: " << Count
Junjie Gu32644d92011-04-13 16:15:29 +0000190 << " because size: " << Size << ">" << Threshold << "\n");
191 if (!CurrentAllowPartial) {
David Greened241e382010-01-05 01:27:44 +0000192 DEBUG(dbgs() << " will not try to unroll partially because "
Andreas Bolka52e539c2009-08-13 02:45:03 +0000193 << "-unroll-allow-partial not given\n");
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000194 return false;
195 }
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000196 // Reduce unroll count to be modulo of TripCount for partial unrolling
Junjie Gu32644d92011-04-13 16:15:29 +0000197 Count = Threshold / LoopSize;
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000198 while (Count != 0 && TripCount%Count != 0) {
199 Count--;
200 }
201 if (Count < 2) {
David Greened241e382010-01-05 01:27:44 +0000202 DEBUG(dbgs() << " could not unroll partially\n");
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000203 return false;
204 }
David Greened241e382010-01-05 01:27:44 +0000205 DEBUG(dbgs() << " partially unrolling with count: " << Count << "\n");
Dan Gohmanc7678442007-05-11 20:53:41 +0000206 }
207 }
208
Dan Gohman45b31972008-05-14 00:24:14 +0000209 // Unroll the loop.
Andrew Trick2045ce12011-07-23 00:33:05 +0000210 if (!UnrollLoop(L, Count, TripCount, TripMultiple, LI, &LPM))
Dan Gohman45b31972008-05-14 00:24:14 +0000211 return false;
Dan Gohmanc7678442007-05-11 20:53:41 +0000212
Chris Lattner83bf2882004-04-18 05:20:17 +0000213 return true;
214}