1 //===- ADCE.cpp - Code to perform aggressive dead code elimination --------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements "aggressive" dead code elimination. ADCE is DCe where
11 // values are assumed to be dead until proven otherwise. This is similar to
12 // SCCP, except applied to the liveness of values.
14 //===----------------------------------------------------------------------===//
16 #include "llvm/Transforms/Scalar.h"
17 #include "llvm/Type.h"
18 #include "llvm/Analysis/PostDominators.h"
19 #include "llvm/iTerminators.h"
20 #include "llvm/iPHINode.h"
21 #include "llvm/Constant.h"
22 #include "llvm/Support/CFG.h"
23 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
24 #include "llvm/Transforms/Utils/Local.h"
25 #include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
26 #include "Support/Debug.h"
27 #include "Support/DepthFirstIterator.h"
28 #include "Support/Statistic.h"
29 #include "Support/STLExtras.h"
34 Statistic<> NumBlockRemoved("adce", "Number of basic blocks removed");
35 Statistic<> NumInstRemoved ("adce", "Number of instructions removed");
37 //===----------------------------------------------------------------------===//
40 // This class does all of the work of Aggressive Dead Code Elimination.
41 // It's public interface consists of a constructor and a doADCE() method.
43 class ADCE : public FunctionPass {
44 Function *Func; // The function that we are working on
45 std::vector<Instruction*> WorkList; // Instructions that just became live
46 std::set<Instruction*> LiveSet; // The set of live instructions
48 //===--------------------------------------------------------------------===//
49 // The public interface for this class
52 // Execute the Aggressive Dead Code Elimination Algorithm
54 virtual bool runOnFunction(Function &F) {
56 bool Changed = doADCE();
57 assert(WorkList.empty());
61 // getAnalysisUsage - We require post dominance frontiers (aka Control
63 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
64 // We require that all function nodes are unified, because otherwise code
65 // can be marked live that wouldn't necessarily be otherwise.
66 AU.addRequired<UnifyFunctionExitNodes>();
67 AU.addRequired<PostDominatorTree>();
68 AU.addRequired<PostDominanceFrontier>();
72 //===--------------------------------------------------------------------===//
73 // The implementation of this class
76 // doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning
77 // true if the function was modified.
81 void markBlockAlive(BasicBlock *BB);
84 // dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the
85 // instructions in the specified basic block, dropping references on
86 // instructions that are dead according to LiveSet.
87 bool dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB);
89 TerminatorInst *convertToUnconditionalBranch(TerminatorInst *TI);
91 inline void markInstructionLive(Instruction *I) {
92 if (LiveSet.count(I)) return;
93 DEBUG(std::cerr << "Insn Live: " << I);
95 WorkList.push_back(I);
98 inline void markTerminatorLive(const BasicBlock *BB) {
99 DEBUG(std::cerr << "Terminator Live: " << BB->getTerminator());
100 markInstructionLive(const_cast<TerminatorInst*>(BB->getTerminator()));
104 RegisterOpt<ADCE> X("adce", "Aggressive Dead Code Elimination");
105 } // End of anonymous namespace
107 Pass *llvm::createAggressiveDCEPass() { return new ADCE(); }
109 void ADCE::markBlockAlive(BasicBlock *BB) {
110 // Mark the basic block as being newly ALIVE... and mark all branches that
111 // this block is control dependent on as being alive also...
113 PostDominanceFrontier &CDG = getAnalysis<PostDominanceFrontier>();
115 PostDominanceFrontier::const_iterator It = CDG.find(BB);
116 if (It != CDG.end()) {
117 // Get the blocks that this node is control dependent on...
118 const PostDominanceFrontier::DomSetType &CDB = It->second;
119 for_each(CDB.begin(), CDB.end(), // Mark all their terminators as live
120 bind_obj(this, &ADCE::markTerminatorLive));
123 // If this basic block is live, and it ends in an unconditional branch, then
124 // the branch is alive as well...
125 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()))
126 if (BI->isUnconditional())
127 markTerminatorLive(BB);
130 // dropReferencesOfDeadInstructionsInLiveBlock - Loop over all of the
131 // instructions in the specified basic block, dropping references on
132 // instructions that are dead according to LiveSet.
133 bool ADCE::dropReferencesOfDeadInstructionsInLiveBlock(BasicBlock *BB) {
134 bool Changed = false;
135 for (BasicBlock::iterator I = BB->begin(), E = --BB->end(); I != E; )
136 if (!LiveSet.count(I)) { // Is this instruction alive?
137 I->dropAllReferences(); // Nope, drop references...
138 if (PHINode *PN = dyn_cast<PHINode>(I)) {
139 // We don't want to leave PHI nodes in the program that have
140 // #arguments != #predecessors, so we remove them now.
142 PN->replaceAllUsesWith(Constant::getNullValue(PN->getType()));
144 // Delete the instruction...
145 I = BB->getInstList().erase(I);
158 /// convertToUnconditionalBranch - Transform this conditional terminator
159 /// instruction into an unconditional branch because we don't care which of the
160 /// successors it goes to. This eliminate a use of the condition as well.
162 TerminatorInst *ADCE::convertToUnconditionalBranch(TerminatorInst *TI) {
163 BranchInst *NB = new BranchInst(TI->getSuccessor(0), TI);
164 BasicBlock *BB = TI->getParent();
166 // Remove entries from PHI nodes to avoid confusing ourself later...
167 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i)
168 TI->getSuccessor(i)->removePredecessor(BB);
170 // Delete the old branch itself...
171 BB->getInstList().erase(TI);
176 // doADCE() - Run the Aggressive Dead Code Elimination algorithm, returning
177 // true if the function was modified.
179 bool ADCE::doADCE() {
180 bool MadeChanges = false;
182 // Iterate over all of the instructions in the function, eliminating trivially
183 // dead instructions, and marking instructions live that are known to be
184 // needed. Perform the walk in depth first order so that we avoid marking any
185 // instructions live in basic blocks that are unreachable. These blocks will
186 // be eliminated later, along with the instructions inside.
188 for (df_iterator<Function*> BBI = df_begin(Func), BBE = df_end(Func);
190 BasicBlock *BB = *BBI;
191 for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {
192 if (II->mayWriteToMemory() || isa<ReturnInst>(II) || isa<UnwindInst>(II)){
193 markInstructionLive(II);
194 ++II; // Increment the inst iterator if the inst wasn't deleted
195 } else if (isInstructionTriviallyDead(II)) {
196 // Remove the instruction from it's basic block...
197 II = BB->getInstList().erase(II);
201 ++II; // Increment the inst iterator if the inst wasn't deleted
206 // Check to ensure we have an exit node for this CFG. If we don't, we won't
207 // have any post-dominance information, thus we cannot perform our
208 // transformations safely.
210 PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
211 if (DT[&Func->getEntryBlock()] == 0) {
216 // Scan the function marking blocks without post-dominance information as
217 // live. Blocks without post-dominance information occur when there is an
218 // infinite loop in the program. Because the infinite loop could contain a
219 // function which unwinds, exits or has side-effects, we don't want to delete
220 // the infinite loop or those blocks leading up to it.
221 for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)
223 for (pred_iterator PI = pred_begin(I), E = pred_end(I); PI != E; ++PI)
224 markInstructionLive((*PI)->getTerminator());
228 DEBUG(std::cerr << "Processing work list\n");
230 // AliveBlocks - Set of basic blocks that we know have instructions that are
233 std::set<BasicBlock*> AliveBlocks;
235 // Process the work list of instructions that just became live... if they
236 // became live, then that means that all of their operands are necessary as
237 // well... make them live as well.
239 while (!WorkList.empty()) {
240 Instruction *I = WorkList.back(); // Get an instruction that became live...
243 BasicBlock *BB = I->getParent();
244 if (!AliveBlocks.count(BB)) { // Basic block not alive yet...
245 AliveBlocks.insert(BB); // Block is now ALIVE!
246 markBlockAlive(BB); // Make it so now!
249 // PHI nodes are a special case, because the incoming values are actually
250 // defined in the predecessor nodes of this block, meaning that the PHI
251 // makes the predecessors alive.
253 if (PHINode *PN = dyn_cast<PHINode>(I))
254 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)
255 if (!AliveBlocks.count(*PI)) {
256 AliveBlocks.insert(BB); // Block is now ALIVE!
260 // Loop over all of the operands of the live instruction, making sure that
261 // they are known to be alive as well...
263 for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op)
264 if (Instruction *Operand = dyn_cast<Instruction>(I->getOperand(op)))
265 markInstructionLive(Operand);
269 std::cerr << "Current Function: X = Live\n";
270 for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I){
271 std::cerr << I->getName() << ":\t"
272 << (AliveBlocks.count(I) ? "LIVE\n" : "DEAD\n");
273 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE; ++BI){
274 if (LiveSet.count(BI)) std::cerr << "X ";
279 // Find the first postdominator of the entry node that is alive. Make it the
282 if (AliveBlocks.size() == Func->size()) { // No dead blocks?
283 for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I) {
284 // Loop over all of the instructions in the function, telling dead
285 // instructions to drop their references. This is so that the next sweep
286 // over the program can safely delete dead instructions without other dead
287 // instructions still referring to them.
289 dropReferencesOfDeadInstructionsInLiveBlock(I);
291 // Check to make sure the terminator instruction is live. If it isn't,
292 // this means that the condition that it branches on (we know it is not an
293 // unconditional branch), is not needed to make the decision of where to
294 // go to, because all outgoing edges go to the same place. We must remove
295 // the use of the condition (because it's probably dead), so we convert
296 // the terminator to a conditional branch.
298 TerminatorInst *TI = I->getTerminator();
299 if (!LiveSet.count(TI))
300 convertToUnconditionalBranch(TI);
303 } else { // If there are some blocks dead...
304 // If the entry node is dead, insert a new entry node to eliminate the entry
305 // node as a special case.
307 if (!AliveBlocks.count(&Func->front())) {
308 BasicBlock *NewEntry = new BasicBlock();
309 new BranchInst(&Func->front(), NewEntry);
310 Func->getBasicBlockList().push_front(NewEntry);
311 AliveBlocks.insert(NewEntry); // This block is always alive!
312 LiveSet.insert(NewEntry->getTerminator()); // The branch is live
315 // Loop over all of the alive blocks in the function. If any successor
316 // blocks are not alive, we adjust the outgoing branches to branch to the
317 // first live postdominator of the live block, adjusting any PHI nodes in
318 // the block to reflect this.
320 for (Function::iterator I = Func->begin(), E = Func->end(); I != E; ++I)
321 if (AliveBlocks.count(I)) {
323 TerminatorInst *TI = BB->getTerminator();
325 // If the terminator instruction is alive, but the block it is contained
326 // in IS alive, this means that this terminator is a conditional branch
327 // on a condition that doesn't matter. Make it an unconditional branch
328 // to ONE of the successors. This has the side effect of dropping a use
329 // of the conditional value, which may also be dead.
330 if (!LiveSet.count(TI))
331 TI = convertToUnconditionalBranch(TI);
333 // Loop over all of the successors, looking for ones that are not alive.
334 // We cannot save the number of successors in the terminator instruction
335 // here because we may remove them if we don't have a postdominator...
337 for (unsigned i = 0; i != TI->getNumSuccessors(); ++i)
338 if (!AliveBlocks.count(TI->getSuccessor(i))) {
339 // Scan up the postdominator tree, looking for the first
340 // postdominator that is alive, and the last postdominator that is
343 PostDominatorTree::Node *LastNode = DT[TI->getSuccessor(i)];
345 // There is a special case here... if there IS no post-dominator for
346 // the block we have no owhere to point our branch to. Instead,
347 // convert it to a return. This can only happen if the code
348 // branched into an infinite loop. Note that this may not be
349 // desirable, because we _are_ altering the behavior of the code.
350 // This is a well known drawback of ADCE, so in the future if we
351 // choose to revisit the decision, this is where it should be.
353 if (LastNode == 0) { // No postdominator!
354 // Call RemoveSuccessor to transmogrify the terminator instruction
355 // to not contain the outgoing branch, or to create a new
356 // terminator if the form fundamentally changes (i.e.,
357 // unconditional branch to return). Note that this will change a
358 // branch into an infinite loop into a return instruction!
360 RemoveSuccessor(TI, i);
362 // RemoveSuccessor may replace TI... make sure we have a fresh
363 // pointer... and e variable.
365 TI = BB->getTerminator();
367 // Rescan this successor...
370 PostDominatorTree::Node *NextNode = LastNode->getIDom();
372 while (!AliveBlocks.count(NextNode->getBlock())) {
374 NextNode = NextNode->getIDom();
377 // Get the basic blocks that we need...
378 BasicBlock *LastDead = LastNode->getBlock();
379 BasicBlock *NextAlive = NextNode->getBlock();
381 // Make the conditional branch now go to the next alive block...
382 TI->getSuccessor(i)->removePredecessor(BB);
383 TI->setSuccessor(i, NextAlive);
385 // If there are PHI nodes in NextAlive, we need to add entries to
386 // the PHI nodes for the new incoming edge. The incoming values
387 // should be identical to the incoming values for LastDead.
389 for (BasicBlock::iterator II = NextAlive->begin();
390 PHINode *PN = dyn_cast<PHINode>(II); ++II)
391 if (LiveSet.count(PN)) { // Only modify live phi nodes
392 // Get the incoming value for LastDead...
393 int OldIdx = PN->getBasicBlockIndex(LastDead);
394 assert(OldIdx != -1 &&"LastDead is not a pred of NextAlive!");
395 Value *InVal = PN->getIncomingValue(OldIdx);
397 // Add an incoming value for BB now...
398 PN->addIncoming(InVal, BB);
403 // Now loop over all of the instructions in the basic block, telling
404 // dead instructions to drop their references. This is so that the next
405 // sweep over the program can safely delete dead instructions without
406 // other dead instructions still referring to them.
408 dropReferencesOfDeadInstructionsInLiveBlock(BB);
412 // We make changes if there are any dead blocks in the function...
413 if (unsigned NumDeadBlocks = Func->size() - AliveBlocks.size()) {
415 NumBlockRemoved += NumDeadBlocks;
418 // Loop over all of the basic blocks in the function, removing control flow
419 // edges to live blocks (also eliminating any entries in PHI functions in
420 // referenced blocks).
422 for (Function::iterator BB = Func->begin(), E = Func->end(); BB != E; ++BB)
423 if (!AliveBlocks.count(BB)) {
424 // Remove all outgoing edges from this basic block and convert the
425 // terminator into a return instruction.
426 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
428 if (!Succs.empty()) {
429 // Loop over all of the successors, removing this block from PHI node
430 // entries that might be in the block...
431 while (!Succs.empty()) {
432 Succs.back()->removePredecessor(BB);
436 // Delete the old terminator instruction...
437 const Type *TermTy = BB->getTerminator()->getType();
438 if (TermTy != Type::VoidTy)
439 BB->getTerminator()->replaceAllUsesWith(
440 Constant::getNullValue(TermTy));
441 BB->getInstList().pop_back();
442 const Type *RetTy = Func->getReturnType();
443 new ReturnInst(RetTy != Type::VoidTy ?
444 Constant::getNullValue(RetTy) : 0, BB);
449 // Loop over all of the basic blocks in the function, dropping references of
450 // the dead basic blocks. We must do this after the previous step to avoid
451 // dropping references to PHIs which still have entries...
453 for (Function::iterator BB = Func->begin(), E = Func->end(); BB != E; ++BB)
454 if (!AliveBlocks.count(BB))
455 BB->dropAllReferences();
457 // Now loop through all of the blocks and delete the dead ones. We can safely
458 // do this now because we know that there are no references to dead blocks
459 // (because they have dropped all of their references... we also remove dead
460 // instructions from alive blocks.
462 for (Function::iterator BI = Func->begin(); BI != Func->end(); )
463 if (!AliveBlocks.count(BI)) { // Delete dead blocks...
464 BI = Func->getBasicBlockList().erase(BI);
465 } else { // Scan alive blocks...
466 for (BasicBlock::iterator II = BI->begin(); II != --BI->end(); )
467 if (!LiveSet.count(II)) { // Is this instruction alive?
468 // Nope... remove the instruction from it's basic block...
469 II = BI->getInstList().erase(II);
476 ++BI; // Increment iterator...