1 //===- LoopDeletion.cpp - Dead Loop Deletion Pass ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Dead Loop Deletion Pass. This pass is responsible
11 // for eliminating loops with non-infinite computable trip counts that have no
12 // side effects or volatile instructions, and do not contribute to the
13 // computation of the function's return value.
15 //===----------------------------------------------------------------------===//
17 #define DEBUG_TYPE "loop-delete"
18 #include "llvm/Transforms/Scalar.h"
19 #include "llvm/ADT/SmallVector.h"
20 #include "llvm/ADT/Statistic.h"
21 #include "llvm/Analysis/LoopPass.h"
22 #include "llvm/Analysis/ScalarEvolution.h"
23 #include "llvm/IR/Dominators.h"
26 STATISTIC(NumDeleted, "Number of loops deleted");
29 class LoopDeletion : public LoopPass {
31 static char ID; // Pass ID, replacement for typeid
32 LoopDeletion() : LoopPass(ID) {
33 initializeLoopDeletionPass(*PassRegistry::getPassRegistry());
36 // Possibly eliminate loop L if it is dead.
37 bool runOnLoop(Loop *L, LPPassManager &LPM) override;
39 void getAnalysisUsage(AnalysisUsage &AU) const override {
40 AU.addRequired<DominatorTreeWrapperPass>();
41 AU.addRequired<LoopInfo>();
42 AU.addRequired<ScalarEvolution>();
43 AU.addRequiredID(LoopSimplifyID);
44 AU.addRequiredID(LCSSAID);
46 AU.addPreserved<ScalarEvolution>();
47 AU.addPreserved<DominatorTreeWrapperPass>();
48 AU.addPreserved<LoopInfo>();
49 AU.addPreservedID(LoopSimplifyID);
50 AU.addPreservedID(LCSSAID);
54 bool isLoopDead(Loop *L, SmallVectorImpl<BasicBlock *> &exitingBlocks,
55 SmallVectorImpl<BasicBlock *> &exitBlocks,
56 bool &Changed, BasicBlock *Preheader);
61 char LoopDeletion::ID = 0;
62 INITIALIZE_PASS_BEGIN(LoopDeletion, "loop-deletion",
63 "Delete dead loops", false, false)
64 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
65 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
66 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
67 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
68 INITIALIZE_PASS_DEPENDENCY(LCSSA)
69 INITIALIZE_PASS_END(LoopDeletion, "loop-deletion",
70 "Delete dead loops", false, false)
72 Pass *llvm::createLoopDeletionPass() {
73 return new LoopDeletion();
76 /// isLoopDead - Determined if a loop is dead. This assumes that we've already
77 /// checked for unique exit and exiting blocks, and that the code is in LCSSA
79 bool LoopDeletion::isLoopDead(Loop *L,
80 SmallVectorImpl<BasicBlock *> &exitingBlocks,
81 SmallVectorImpl<BasicBlock *> &exitBlocks,
82 bool &Changed, BasicBlock *Preheader) {
83 BasicBlock *exitBlock = exitBlocks[0];
85 // Make sure that all PHI entries coming from the loop are loop invariant.
86 // Because the code is in LCSSA form, any values used outside of the loop
87 // must pass through a PHI in the exit block, meaning that this check is
88 // sufficient to guarantee that no loop-variant values are used outside
90 BasicBlock::iterator BI = exitBlock->begin();
91 while (PHINode *P = dyn_cast<PHINode>(BI)) {
92 Value *incoming = P->getIncomingValueForBlock(exitingBlocks[0]);
94 // Make sure all exiting blocks produce the same incoming value for the exit
95 // block. If there are different incoming values for different exiting
96 // blocks, then it is impossible to statically determine which value should
98 for (unsigned i = 1, e = exitingBlocks.size(); i < e; ++i) {
99 if (incoming != P->getIncomingValueForBlock(exitingBlocks[i]))
103 if (Instruction *I = dyn_cast<Instruction>(incoming))
104 if (!L->makeLoopInvariant(I, Changed, Preheader->getTerminator()))
110 // Make sure that no instructions in the block have potential side-effects.
111 // This includes instructions that could write to memory, and loads that are
112 // marked volatile. This could be made more aggressive by using aliasing
113 // information to identify readonly and readnone calls.
114 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
116 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
118 if (BI->mayHaveSideEffects())
126 /// runOnLoop - Remove dead loops, by which we mean loops that do not impact the
127 /// observable behavior of the program other than finite running time. Note
128 /// we do ensure that this never remove a loop that might be infinite, as doing
129 /// so could change the halting/non-halting nature of a program.
130 /// NOTE: This entire process relies pretty heavily on LoopSimplify and LCSSA
131 /// in order to make various safety checks work.
132 bool LoopDeletion::runOnLoop(Loop *L, LPPassManager &LPM) {
133 if (skipOptnoneFunction(L))
136 // We can only remove the loop if there is a preheader that we can
137 // branch from after removing it.
138 BasicBlock *preheader = L->getLoopPreheader();
142 // If LoopSimplify form is not available, stay out of trouble.
143 if (!L->hasDedicatedExits())
146 // We can't remove loops that contain subloops. If the subloops were dead,
147 // they would already have been removed in earlier executions of this pass.
148 if (L->begin() != L->end())
151 SmallVector<BasicBlock*, 4> exitingBlocks;
152 L->getExitingBlocks(exitingBlocks);
154 SmallVector<BasicBlock*, 4> exitBlocks;
155 L->getUniqueExitBlocks(exitBlocks);
157 // We require that the loop only have a single exit block. Otherwise, we'd
158 // be in the situation of needing to be able to solve statically which exit
159 // block will be branched to, or trying to preserve the branching logic in
160 // a loop invariant manner.
161 if (exitBlocks.size() != 1)
164 // Finally, we have to check that the loop really is dead.
165 bool Changed = false;
166 if (!isLoopDead(L, exitingBlocks, exitBlocks, Changed, preheader))
169 // Don't remove loops for which we can't solve the trip count.
170 // They could be infinite, in which case we'd be changing program behavior.
171 ScalarEvolution &SE = getAnalysis<ScalarEvolution>();
172 const SCEV *S = SE.getMaxBackedgeTakenCount(L);
173 if (isa<SCEVCouldNotCompute>(S))
176 // Now that we know the removal is safe, remove the loop by changing the
177 // branch from the preheader to go to the single exit block.
178 BasicBlock *exitBlock = exitBlocks[0];
180 // Because we're deleting a large chunk of code at once, the sequence in which
181 // we remove things is very important to avoid invalidation issues. Don't
182 // mess with this unless you have good reason and know what you're doing.
184 // Tell ScalarEvolution that the loop is deleted. Do this before
185 // deleting the loop so that ScalarEvolution can look at the loop
186 // to determine what it needs to clean up.
189 // Connect the preheader directly to the exit block.
190 TerminatorInst *TI = preheader->getTerminator();
191 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
193 // Rewrite phis in the exit block to get their inputs from
194 // the preheader instead of the exiting block.
195 BasicBlock *exitingBlock = exitingBlocks[0];
196 BasicBlock::iterator BI = exitBlock->begin();
197 while (PHINode *P = dyn_cast<PHINode>(BI)) {
198 int j = P->getBasicBlockIndex(exitingBlock);
199 assert(j >= 0 && "Can't find exiting block in exit block's phi node!");
200 P->setIncomingBlock(j, preheader);
201 for (unsigned i = 1; i < exitingBlocks.size(); ++i)
202 P->removeIncomingValue(exitingBlocks[i]);
206 // Update the dominator tree and remove the instructions and blocks that will
207 // be deleted from the reference counting scheme.
208 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
209 SmallVector<DomTreeNode*, 8> ChildNodes;
210 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
212 // Move all of the block's children to be children of the preheader, which
213 // allows us to remove the domtree entry for the block.
214 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
215 for (SmallVectorImpl<DomTreeNode *>::iterator DI = ChildNodes.begin(),
216 DE = ChildNodes.end(); DI != DE; ++DI) {
217 DT.changeImmediateDominator(*DI, DT[preheader]);
223 // Remove the block from the reference counting scheme, so that we can
224 // delete it freely later.
225 (*LI)->dropAllReferences();
228 // Erase the instructions and the blocks without having to worry
229 // about ordering because we already dropped the references.
230 // NOTE: This iteration is safe because erasing the block does not remove its
231 // entry from the loop's block list. We do that in the next section.
232 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
234 (*LI)->eraseFromParent();
236 // Finally, the blocks from loopinfo. This has to happen late because
237 // otherwise our loop iterators won't work.
238 LoopInfo &loopInfo = getAnalysis<LoopInfo>();
239 SmallPtrSet<BasicBlock*, 8> blocks;
240 blocks.insert(L->block_begin(), L->block_end());
241 for (SmallPtrSet<BasicBlock*,8>::iterator I = blocks.begin(),
242 E = blocks.end(); I != E; ++I)
243 loopInfo.removeBlock(*I);
245 // The last step is to inform the loop pass manager that we've
246 // eliminated this loop.
247 LPM.deleteLoopFromQueue(L);