blob: c2bf9f2c5898d23417abc893cc336a3b6a9ddbf8 [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"
Reid Spencer551ccae2004-09-01 22:55:40 +000020#include "llvm/Support/CommandLine.h"
21#include "llvm/Support/Debug.h"
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000022#include "llvm/Support/raw_ostream.h"
Dan Gohman45b31972008-05-14 00:24:14 +000023#include "llvm/Transforms/Utils/UnrollLoop.h"
Duncan Sands1a2d6672008-05-16 09:30:00 +000024#include <climits>
Chris Lattner83bf2882004-04-18 05:20:17 +000025
Dan Gohman45b31972008-05-14 00:24:14 +000026using namespace llvm;
Chris Lattner83bf2882004-04-18 05:20:17 +000027
Dan Gohman844731a2008-05-13 00:00:25 +000028static cl::opt<unsigned>
29UnrollThreshold("unroll-threshold", cl::init(100), cl::Hidden,
30 cl::desc("The cut-off point for automatic loop unrolling"));
31
32static cl::opt<unsigned>
33UnrollCount("unroll-count", cl::init(0), cl::Hidden,
34 cl::desc("Use this unroll count for all loops, for testing purposes"));
35
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +000036static cl::opt<bool>
37UnrollAllowPartial("unroll-allow-partial", cl::init(false), cl::Hidden,
38 cl::desc("Allows loops to be partially unrolled until "
39 "-unroll-threshold loop size is reached."));
40
Chris Lattner0e5f4992006-12-19 21:40:18 +000041namespace {
Chris Lattner3e8b6632009-09-02 06:11:42 +000042 class LoopUnroll : public LoopPass {
Chris Lattner83bf2882004-04-18 05:20:17 +000043 public:
Devang Patel19974732007-05-03 01:11:54 +000044 static char ID; // Pass ID, replacement for typeid
Dan Gohmanae73dc12008-09-04 17:05:41 +000045 LoopUnroll() : LoopPass(&ID) {}
Devang Patel794fd752007-05-01 21:15:47 +000046
Dan Gohmanc7678442007-05-11 20:53:41 +000047 /// A magic value for use with the Threshold parameter to indicate
48 /// that the loop unroll should be performed regardless of how much
49 /// code expansion would result.
50 static const unsigned NoThreshold = UINT_MAX;
51
Devang Patel3f1a1e02007-03-07 01:38:05 +000052 bool runOnLoop(Loop *L, LPPassManager &LPM);
Chris Lattner83bf2882004-04-18 05:20:17 +000053
54 /// This transformation requires natural loop information & requires that
55 /// loop preheaders be inserted into the CFG...
56 ///
57 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
Chris Lattner83bf2882004-04-18 05:20:17 +000058 AU.addRequiredID(LoopSimplifyID);
Owen Anderson3b53c4e2006-08-24 21:28:19 +000059 AU.addRequiredID(LCSSAID);
Chris Lattner83bf2882004-04-18 05:20:17 +000060 AU.addRequired<LoopInfo>();
Owen Anderson3b53c4e2006-08-24 21:28:19 +000061 AU.addPreservedID(LCSSAID);
Chris Lattner9c2cc462004-04-18 05:38:37 +000062 AU.addPreserved<LoopInfo>();
Devang Patel98260a42008-07-03 07:04:22 +000063 // FIXME: Loop unroll requires LCSSA. And LCSSA requires dom info.
64 // If loop unroll does not preserve dom info then LCSSA pass on next
65 // loop will receive invalid dom info.
66 // For now, recreate dom info, if loop is unrolled.
67 AU.addPreserved<DominatorTree>();
68 AU.addPreserved<DominanceFrontier>();
Chris Lattner83bf2882004-04-18 05:20:17 +000069 }
70 };
Chris Lattner83bf2882004-04-18 05:20:17 +000071}
72
Dan Gohman844731a2008-05-13 00:00:25 +000073char LoopUnroll::ID = 0;
74static RegisterPass<LoopUnroll> X("loop-unroll", "Unroll loops");
75
Daniel Dunbar394f0442008-10-22 23:32:42 +000076Pass *llvm::createLoopUnrollPass() { return new LoopUnroll(); }
Chris Lattner83bf2882004-04-18 05:20:17 +000077
Dan Gohmanf742c232007-05-08 15:14:19 +000078/// ApproximateLoopSize - Approximate the size of the loop.
Chris Lattner83bf2882004-04-18 05:20:17 +000079static unsigned ApproximateLoopSize(const Loop *L) {
Dan Gohmana2aabe32009-10-31 14:54:17 +000080 CodeMetrics Metrics;
Dan Gohman9b787632008-06-22 20:18:58 +000081 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
Dan Gohmana2aabe32009-10-31 14:54:17 +000082 I != E; ++I)
83 Metrics.analyzeBasicBlock(*I);
84 return Metrics.NumInsts;
Chris Lattner83bf2882004-04-18 05:20:17 +000085}
86
Devang Patel3f1a1e02007-03-07 01:38:05 +000087bool LoopUnroll::runOnLoop(Loop *L, LPPassManager &LPM) {
Dan Gohmanc7678442007-05-11 20:53:41 +000088 assert(L->isLCSSAForm());
Dan Gohman45b31972008-05-14 00:24:14 +000089 LoopInfo *LI = &getAnalysis<LoopInfo>();
Dan Gohmanc7678442007-05-11 20:53:41 +000090
Dan Gohman1cc00962007-05-08 15:19:19 +000091 BasicBlock *Header = L->getHeader();
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000092 DEBUG(errs() << "Loop Unroll: F[" << Header->getParent()->getName()
93 << "] Loop %" << Header->getName() << "\n");
Mike Stump02efa782009-07-27 23:14:11 +000094 (void)Header;
Dan Gohmanc7678442007-05-11 20:53:41 +000095
Dan Gohman45b31972008-05-14 00:24:14 +000096 // Find trip count
97 unsigned TripCount = L->getSmallConstantTripCount();
98 unsigned Count = UnrollCount;
Andreas Bolkaf1f2dc22009-08-13 02:40:50 +000099
Dan Gohmanc7678442007-05-11 20:53:41 +0000100 // Automatically select an unroll count.
101 if (Count == 0) {
102 // Conservative heuristic: if we know the trip count, see if we can
103 // completely unroll (subject to the threshold, checked below); otherwise
Andreas Bolkaf1f2dc22009-08-13 02:40:50 +0000104 // try to find greatest modulo of the trip count which is still under
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000105 // threshold value.
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000106 if (TripCount == 0)
Dan Gohmanc7678442007-05-11 20:53:41 +0000107 return false;
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000108 Count = TripCount;
Dan Gohmanc7678442007-05-11 20:53:41 +0000109 }
110
Dan Gohmanc7678442007-05-11 20:53:41 +0000111 // Enforce the threshold.
Dan Gohman45b31972008-05-14 00:24:14 +0000112 if (UnrollThreshold != NoThreshold) {
Dan Gohmanc7678442007-05-11 20:53:41 +0000113 unsigned LoopSize = ApproximateLoopSize(L);
Andreas Bolka52e539c2009-08-13 02:45:03 +0000114 DEBUG(errs() << " Loop Size = " << LoopSize << "\n");
Dan Gohmanc7678442007-05-11 20:53:41 +0000115 uint64_t Size = (uint64_t)LoopSize*Count;
Dan Gohman45b31972008-05-14 00:24:14 +0000116 if (TripCount != 1 && Size > UnrollThreshold) {
Andreas Bolka52e539c2009-08-13 02:45:03 +0000117 DEBUG(errs() << " Too large to fully unroll with count: " << Count
118 << " because size: " << Size << ">" << UnrollThreshold << "\n");
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000119 if (!UnrollAllowPartial) {
Andreas Bolka52e539c2009-08-13 02:45:03 +0000120 DEBUG(errs() << " will not try to unroll partially because "
121 << "-unroll-allow-partial not given\n");
Matthijs Kooijman75cf9cc2008-07-29 13:21:23 +0000122 return false;
123 }
Andreas Bolkaec40eb42009-08-13 03:00:57 +0000124 // Reduce unroll count to be modulo of TripCount for partial unrolling
125 Count = UnrollThreshold / LoopSize;
126 while (Count != 0 && TripCount%Count != 0) {
127 Count--;
128 }
129 if (Count < 2) {
130 DEBUG(errs() << " could not unroll partially\n");
131 return false;
132 }
133 DEBUG(errs() << " partially unrolling with count: " << Count << "\n");
Dan Gohmanc7678442007-05-11 20:53:41 +0000134 }
135 }
136
Dan Gohman45b31972008-05-14 00:24:14 +0000137 // Unroll the loop.
Devang Patel98260a42008-07-03 07:04:22 +0000138 Function *F = L->getHeader()->getParent();
Dan Gohman45b31972008-05-14 00:24:14 +0000139 if (!UnrollLoop(L, Count, LI, &LPM))
140 return false;
Dan Gohmanc7678442007-05-11 20:53:41 +0000141
Devang Patel98260a42008-07-03 07:04:22 +0000142 // FIXME: Reconstruct dom info, because it is not preserved properly.
Duncan Sands1465d612009-01-28 13:14:17 +0000143 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
Devang Patel98260a42008-07-03 07:04:22 +0000144 if (DT) {
145 DT->runOnFunction(*F);
Duncan Sands1465d612009-01-28 13:14:17 +0000146 DominanceFrontier *DF = getAnalysisIfAvailable<DominanceFrontier>();
Devang Patel98260a42008-07-03 07:04:22 +0000147 if (DF)
148 DF->runOnFunction(*F);
149 }
Chris Lattner83bf2882004-04-18 05:20:17 +0000150 return true;
151}