blob: f0a661cb69935556bbe02ae0d45c4ff25ba5e89c [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"
Dan Gohmana2aabe32009-10-31 14:54:17 +000019#include "llvm/Analysis/InlineCost.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"
Duncan Sands1a2d6672008-05-16 09:30:00 +000025#include <climits>
Chris Lattner83bf2882004-04-18 05:20:17 +000026
Dan Gohman45b31972008-05-14 00:24:14 +000027using namespace llvm;
Chris Lattner83bf2882004-04-18 05:20:17 +000028
Dan Gohman844731a2008-05-13 00:00:25 +000029static cl::opt<unsigned>
Owen Andersonb57e6552010-08-04 18:32:46 +000030UnrollThreshold("unroll-threshold", cl::init(200), cl::Hidden,
Dan Gohman844731a2008-05-13 00:00:25 +000031 cl::desc("The cut-off point for automatic loop unrolling"));
32
33static cl::opt<unsigned>
34UnrollCount("unroll-count", cl::init(0), cl::Hidden,
35 cl::desc("Use this unroll count for all loops, for testing purposes"));
36
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +000037static cl::opt<bool>
38UnrollAllowPartial("unroll-allow-partial", cl::init(false), cl::Hidden,
39 cl::desc("Allows loops to be partially unrolled until "
40 "-unroll-threshold loop size is reached."));
41
Chris Lattner0e5f4992006-12-19 21:40:18 +000042namespace {
Chris Lattner3e8b6632009-09-02 06:11:42 +000043 class LoopUnroll : public LoopPass {
Chris Lattner83bf2882004-04-18 05:20:17 +000044 public:
Devang Patel19974732007-05-03 01:11:54 +000045 static char ID; // Pass ID, replacement for typeid
Owen Anderson90c579d2010-08-06 18:33:48 +000046 LoopUnroll() : LoopPass(ID) {}
Devang Patel794fd752007-05-01 21:15:47 +000047
Dan Gohmanc7678442007-05-11 20:53:41 +000048 /// A magic value for use with the Threshold parameter to indicate
49 /// that the loop unroll should be performed regardless of how much
50 /// code expansion would result.
51 static const unsigned NoThreshold = UINT_MAX;
Owen Andersone9f18822010-09-07 23:15:30 +000052
53 // Threshold to use when optsize is specified (and there is no
54 // explicit -unroll-threshold).
55 static const unsigned OptSizeUnrollThreshold = 50;
56
57 unsigned CurrentThreshold;
Dan Gohmanc7678442007-05-11 20:53:41 +000058
Devang Patel3f1a1e02007-03-07 01:38:05 +000059 bool runOnLoop(Loop *L, LPPassManager &LPM);
Chris Lattner83bf2882004-04-18 05:20:17 +000060
61 /// This transformation requires natural loop information & requires that
62 /// loop preheaders be inserted into the CFG...
63 ///
64 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
Chris Lattner83bf2882004-04-18 05:20:17 +000065 AU.addRequired<LoopInfo>();
Chris Lattner9c2cc462004-04-18 05:38:37 +000066 AU.addPreserved<LoopInfo>();
Dan Gohman052f0002010-07-26 18:11:16 +000067 AU.addRequiredID(LoopSimplifyID);
68 AU.addPreservedID(LoopSimplifyID);
69 AU.addRequiredID(LCSSAID);
70 AU.addPreservedID(LCSSAID);
Chris Lattner93779012010-08-29 17:21:35 +000071 AU.addPreserved<ScalarEvolution>();
Devang Patel98260a42008-07-03 07:04:22 +000072 // FIXME: Loop unroll requires LCSSA. And LCSSA requires dom info.
73 // If loop unroll does not preserve dom info then LCSSA pass on next
74 // loop will receive invalid dom info.
75 // For now, recreate dom info, if loop is unrolled.
76 AU.addPreserved<DominatorTree>();
Chris Lattner83bf2882004-04-18 05:20:17 +000077 }
78 };
Chris Lattner83bf2882004-04-18 05:20:17 +000079}
80
Dan Gohman844731a2008-05-13 00:00:25 +000081char LoopUnroll::ID = 0;
Owen Andersond13db2c2010-07-21 22:09:45 +000082INITIALIZE_PASS(LoopUnroll, "loop-unroll", "Unroll loops", false, false);
Dan Gohman844731a2008-05-13 00:00:25 +000083
Daniel Dunbar394f0442008-10-22 23:32:42 +000084Pass *llvm::createLoopUnrollPass() { return new LoopUnroll(); }
Chris Lattner83bf2882004-04-18 05:20:17 +000085
Dan Gohmanf742c232007-05-08 15:14:19 +000086/// ApproximateLoopSize - Approximate the size of the loop.
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +000087static unsigned ApproximateLoopSize(const Loop *L, unsigned &NumCalls) {
Dan Gohmana2aabe32009-10-31 14:54:17 +000088 CodeMetrics Metrics;
Dan Gohman9b787632008-06-22 20:18:58 +000089 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
Dan Gohmana2aabe32009-10-31 14:54:17 +000090 I != E; ++I)
91 Metrics.analyzeBasicBlock(*I);
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +000092 NumCalls = Metrics.NumCalls;
Dan Gohmana2aabe32009-10-31 14:54:17 +000093 return Metrics.NumInsts;
Chris Lattner83bf2882004-04-18 05:20:17 +000094}
95
Devang Patel3f1a1e02007-03-07 01:38:05 +000096bool LoopUnroll::runOnLoop(Loop *L, LPPassManager &LPM) {
Owen Andersone9f18822010-09-07 23:15:30 +000097
Dan Gohman45b31972008-05-14 00:24:14 +000098 LoopInfo *LI = &getAnalysis<LoopInfo>();
Dan Gohmanc7678442007-05-11 20:53:41 +000099
Dan Gohman1cc00962007-05-08 15:19:19 +0000100 BasicBlock *Header = L->getHeader();
David Greened241e382010-01-05 01:27:44 +0000101 DEBUG(dbgs() << "Loop Unroll: F[" << Header->getParent()->getName()
Daniel Dunbarce63ffb2009-07-25 00:23:56 +0000102 << "] Loop %" << Header->getName() << "\n");
Mike Stump02efa782009-07-27 23:14:11 +0000103 (void)Header;
Owen Andersone9f18822010-09-07 23:15:30 +0000104
105 // Determine the current unrolling threshold. While this is normally set
106 // from UnrollThreshold, it is overridden to a smaller value if the current
107 // function is marked as optimize-for-size, and the unroll threshold was
108 // not user specified.
109 CurrentThreshold = UnrollThreshold;
110 if (Header->getParent()->hasFnAttr(Attribute::OptimizeForSize) &&
111 UnrollThreshold.getNumOccurrences() == 0)
112 CurrentThreshold = OptSizeUnrollThreshold;
Dan Gohmanc7678442007-05-11 20:53:41 +0000113
Dan Gohman45b31972008-05-14 00:24:14 +0000114 // Find trip count
115 unsigned TripCount = L->getSmallConstantTripCount();
116 unsigned Count = UnrollCount;
Andreas Bolkaf1f2dc22009-08-13 02:40:50 +0000117
Dan Gohmanc7678442007-05-11 20:53:41 +0000118 // Automatically select an unroll count.
119 if (Count == 0) {
120 // Conservative heuristic: if we know the trip count, see if we can
121 // completely unroll (subject to the threshold, checked below); otherwise
Andreas Bolkaf1f2dc22009-08-13 02:40:50 +0000122 // try to find greatest modulo of the trip count which is still under
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000123 // threshold value.
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000124 if (TripCount == 0)
Dan Gohmanc7678442007-05-11 20:53:41 +0000125 return false;
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000126 Count = TripCount;
Dan Gohmanc7678442007-05-11 20:53:41 +0000127 }
128
Dan Gohmanc7678442007-05-11 20:53:41 +0000129 // Enforce the threshold.
Owen Andersone9f18822010-09-07 23:15:30 +0000130 if (CurrentThreshold != NoThreshold) {
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +0000131 unsigned NumCalls;
132 unsigned LoopSize = ApproximateLoopSize(L, NumCalls);
David Greened241e382010-01-05 01:27:44 +0000133 DEBUG(dbgs() << " Loop Size = " << LoopSize << "\n");
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +0000134 if (NumCalls != 0) {
Owen Anderson49754472010-09-08 23:10:07 +0000135 // Even for a loop that contains calls, it can still be profitable to
136 // unroll if the loop is really, REALLY small.
137 DEBUG(dbgs() <<" Using lower threshold for loop with function calls.\n");
138 CurrentThreshold = OptSizeUnrollThreshold;
Jakob Stoklund Olesend450e5b2010-02-05 23:21:31 +0000139 }
Dan Gohmanc7678442007-05-11 20:53:41 +0000140 uint64_t Size = (uint64_t)LoopSize*Count;
Owen Andersone9f18822010-09-07 23:15:30 +0000141 if (TripCount != 1 && Size > CurrentThreshold) {
David Greened241e382010-01-05 01:27:44 +0000142 DEBUG(dbgs() << " Too large to fully unroll with count: " << Count
Owen Andersone9f18822010-09-07 23:15:30 +0000143 << " because size: " << Size << ">" << CurrentThreshold << "\n");
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000144 if (!UnrollAllowPartial) {
David Greened241e382010-01-05 01:27:44 +0000145 DEBUG(dbgs() << " will not try to unroll partially because "
Andreas Bolka52e539c2009-08-13 02:45:03 +0000146 << "-unroll-allow-partial not given\n");
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000147 return false;
148 }
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000149 // Reduce unroll count to be modulo of TripCount for partial unrolling
Owen Andersone9f18822010-09-07 23:15:30 +0000150 Count = CurrentThreshold / LoopSize;
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000151 while (Count != 0 && TripCount%Count != 0) {
152 Count--;
153 }
154 if (Count < 2) {
David Greened241e382010-01-05 01:27:44 +0000155 DEBUG(dbgs() << " could not unroll partially\n");
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000156 return false;
157 }
David Greened241e382010-01-05 01:27:44 +0000158 DEBUG(dbgs() << " partially unrolling with count: " << Count << "\n");
Dan Gohmanc7678442007-05-11 20:53:41 +0000159 }
160 }
161
Dan Gohman45b31972008-05-14 00:24:14 +0000162 // Unroll the loop.
Devang Patel98260a42008-07-03 07:04:22 +0000163 Function *F = L->getHeader()->getParent();
Dan Gohman45b31972008-05-14 00:24:14 +0000164 if (!UnrollLoop(L, Count, LI, &LPM))
165 return false;
Dan Gohmanc7678442007-05-11 20:53:41 +0000166
Devang Patel98260a42008-07-03 07:04:22 +0000167 // FIXME: Reconstruct dom info, because it is not preserved properly.
Chris Lattner93779012010-08-29 17:21:35 +0000168 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
Devang Patel98260a42008-07-03 07:04:22 +0000169 DT->runOnFunction(*F);
Chris Lattner83bf2882004-04-18 05:20:17 +0000170 return true;
171}