1 //===-- LoopUnswitch.cpp - Hoist loop-invariant conditionals in loop ------===//
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 pass transforms loops that contain branches on loop-invariant conditions
11 // to have multiple loops. For example, it turns the left into the right code:
20 // This can increase the size of the code exponentially (doubling it every time
21 // a loop is unswitched) so we only unswitch if the resultant code will be
22 // smaller than a threshold.
24 // This pass expects LICM to be run before it to hoist invariant conditions out
25 // of the loop, to make the unswitching opportunity obvious.
27 //===----------------------------------------------------------------------===//
29 #define DEBUG_TYPE "loop-unswitch"
30 #include "llvm/Transforms/Scalar.h"
31 #include "llvm/Constants.h"
32 #include "llvm/DerivedTypes.h"
33 #include "llvm/Function.h"
34 #include "llvm/Instructions.h"
35 #include "llvm/LLVMContext.h"
36 #include "llvm/Analysis/ConstantFolding.h"
37 #include "llvm/Analysis/LoopInfo.h"
38 #include "llvm/Analysis/LoopPass.h"
39 #include "llvm/Analysis/Dominators.h"
40 #include "llvm/Transforms/Utils/Cloning.h"
41 #include "llvm/Transforms/Utils/Local.h"
42 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
43 #include "llvm/ADT/Statistic.h"
44 #include "llvm/ADT/SmallPtrSet.h"
45 #include "llvm/ADT/STLExtras.h"
46 #include "llvm/Support/CommandLine.h"
47 #include "llvm/Support/Compiler.h"
48 #include "llvm/Support/Debug.h"
53 STATISTIC(NumBranches, "Number of branches unswitched");
54 STATISTIC(NumSwitches, "Number of switches unswitched");
55 STATISTIC(NumSelects , "Number of selects unswitched");
56 STATISTIC(NumTrivial , "Number of unswitches that are trivial");
57 STATISTIC(NumSimplify, "Number of simplifications of unswitched code");
59 static cl::opt<unsigned>
60 Threshold("loop-unswitch-threshold", cl::desc("Max loop size to unswitch"),
61 cl::init(10), cl::Hidden);
64 class VISIBILITY_HIDDEN LoopUnswitch : public LoopPass {
65 LoopInfo *LI; // Loop information
68 // LoopProcessWorklist - Used to check if second loop needs processing
69 // after RewriteLoopBodyWithConditionConstant rewrites first loop.
70 std::vector<Loop*> LoopProcessWorklist;
71 SmallPtrSet<Value *,8> UnswitchedVals;
77 DominanceFrontier *DF;
79 BasicBlock *loopHeader;
80 BasicBlock *loopPreheader;
82 // LoopBlocks contains all of the basic blocks of the loop, including the
83 // preheader of the loop, the body of the loop, and the exit blocks of the
84 // loop, in that order.
85 std::vector<BasicBlock*> LoopBlocks;
86 // NewBlocks contained cloned copy of basic blocks from LoopBlocks.
87 std::vector<BasicBlock*> NewBlocks;
90 static char ID; // Pass ID, replacement for typeid
91 explicit LoopUnswitch(bool Os = false) :
92 LoopPass(&ID), OptimizeForSize(Os), redoLoop(false),
93 currentLoop(NULL), DF(NULL), DT(NULL), loopHeader(NULL),
94 loopPreheader(NULL) {}
96 bool runOnLoop(Loop *L, LPPassManager &LPM);
97 bool processCurrentLoop();
99 /// This transformation requires natural loop information & requires that
100 /// loop preheaders be inserted into the CFG...
102 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
103 AU.addRequiredID(LoopSimplifyID);
104 AU.addPreservedID(LoopSimplifyID);
105 AU.addRequired<LoopInfo>();
106 AU.addPreserved<LoopInfo>();
107 AU.addRequiredID(LCSSAID);
108 AU.addPreservedID(LCSSAID);
109 AU.addPreserved<DominatorTree>();
110 AU.addPreserved<DominanceFrontier>();
115 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
117 void RemoveLoopFromWorklist(Loop *L) {
118 std::vector<Loop*>::iterator I = std::find(LoopProcessWorklist.begin(),
119 LoopProcessWorklist.end(), L);
120 if (I != LoopProcessWorklist.end())
121 LoopProcessWorklist.erase(I);
124 void initLoopData() {
125 loopHeader = currentLoop->getHeader();
126 loopPreheader = currentLoop->getLoopPreheader();
129 /// Split all of the edges from inside the loop to their exit blocks.
130 /// Update the appropriate Phi nodes as we do so.
131 void SplitExitEdges(Loop *L, const SmallVector<BasicBlock *, 8> &ExitBlocks);
133 bool UnswitchIfProfitable(Value *LoopCond, Constant *Val);
134 unsigned getLoopUnswitchCost(Value *LIC);
135 void UnswitchTrivialCondition(Loop *L, Value *Cond, Constant *Val,
136 BasicBlock *ExitBlock);
137 void UnswitchNontrivialCondition(Value *LIC, Constant *OnVal, Loop *L);
139 void RewriteLoopBodyWithConditionConstant(Loop *L, Value *LIC,
140 Constant *Val, bool isEqual);
142 void EmitPreheaderBranchOnCondition(Value *LIC, Constant *Val,
143 BasicBlock *TrueDest,
144 BasicBlock *FalseDest,
145 Instruction *InsertPt);
147 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
148 void RemoveBlockIfDead(BasicBlock *BB,
149 std::vector<Instruction*> &Worklist, Loop *l);
150 void RemoveLoopFromHierarchy(Loop *L);
151 bool IsTrivialUnswitchCondition(Value *Cond, Constant **Val = 0,
152 BasicBlock **LoopExit = 0);
156 char LoopUnswitch::ID = 0;
157 static RegisterPass<LoopUnswitch> X("loop-unswitch", "Unswitch loops");
159 Pass *llvm::createLoopUnswitchPass(bool Os) {
160 return new LoopUnswitch(Os);
163 /// FindLIVLoopCondition - Cond is a condition that occurs in L. If it is
164 /// invariant in the loop, or has an invariant piece, return the invariant.
165 /// Otherwise, return null.
166 static Value *FindLIVLoopCondition(Value *Cond, Loop *L, bool &Changed) {
167 // Constants should be folded, not unswitched on!
168 if (isa<Constant>(Cond)) return 0;
170 // TODO: Handle: br (VARIANT|INVARIANT).
172 // Hoist simple values out.
173 if (L->makeLoopInvariant(Cond, Changed))
176 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Cond))
177 if (BO->getOpcode() == Instruction::And ||
178 BO->getOpcode() == Instruction::Or) {
179 // If either the left or right side is invariant, we can unswitch on this,
180 // which will cause the branch to go away in one loop and the condition to
181 // simplify in the other one.
182 if (Value *LHS = FindLIVLoopCondition(BO->getOperand(0), L, Changed))
184 if (Value *RHS = FindLIVLoopCondition(BO->getOperand(1), L, Changed))
191 bool LoopUnswitch::runOnLoop(Loop *L, LPPassManager &LPM_Ref) {
192 LI = &getAnalysis<LoopInfo>();
194 DF = getAnalysisIfAvailable<DominanceFrontier>();
195 DT = getAnalysisIfAvailable<DominatorTree>();
197 Function *F = currentLoop->getHeader()->getParent();
198 bool Changed = false;
200 assert(currentLoop->isLCSSAForm());
202 Changed |= processCurrentLoop();
206 // FIXME: Reconstruct dom info, because it is not preserved properly.
208 DT->runOnFunction(*F);
210 DF->runOnFunction(*F);
215 /// processCurrentLoop - Do actual work and unswitch loop if possible
217 bool LoopUnswitch::processCurrentLoop() {
218 bool Changed = false;
219 LLVMContext &Context = currentLoop->getHeader()->getContext();
221 // Loop over all of the basic blocks in the loop. If we find an interior
222 // block that is branching on a loop-invariant condition, we can unswitch this
224 for (Loop::block_iterator I = currentLoop->block_begin(),
225 E = currentLoop->block_end();
227 TerminatorInst *TI = (*I)->getTerminator();
228 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
229 // If this isn't branching on an invariant condition, we can't unswitch
231 if (BI->isConditional()) {
232 // See if this, or some part of it, is loop invariant. If so, we can
233 // unswitch on it if we desire.
234 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(),
235 currentLoop, Changed);
236 if (LoopCond && UnswitchIfProfitable(LoopCond,
237 Context.getTrue())) {
242 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
243 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(),
244 currentLoop, Changed);
245 if (LoopCond && SI->getNumCases() > 1) {
246 // Find a value to unswitch on:
247 // FIXME: this should chose the most expensive case!
248 Constant *UnswitchVal = SI->getCaseValue(1);
249 // Do not process same value again and again.
250 if (!UnswitchedVals.insert(UnswitchVal))
253 if (UnswitchIfProfitable(LoopCond, UnswitchVal)) {
260 // Scan the instructions to check for unswitchable values.
261 for (BasicBlock::iterator BBI = (*I)->begin(), E = (*I)->end();
263 if (SelectInst *SI = dyn_cast<SelectInst>(BBI)) {
264 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(),
265 currentLoop, Changed);
266 if (LoopCond && UnswitchIfProfitable(LoopCond,
267 Context.getTrue())) {
276 /// isTrivialLoopExitBlock - Check to see if all paths from BB either:
277 /// 1. Exit the loop with no side effects.
278 /// 2. Branch to the latch block with no side-effects.
280 /// If these conditions are true, we return true and set ExitBB to the block we
283 static bool isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *BB,
285 std::set<BasicBlock*> &Visited) {
286 if (!Visited.insert(BB).second) {
287 // Already visited and Ok, end of recursion.
289 } else if (!L->contains(BB)) {
290 // Otherwise, this is a loop exit, this is fine so long as this is the
292 if (ExitBB != 0) return false;
297 // Otherwise, this is an unvisited intra-loop node. Check all successors.
298 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) {
299 // Check to see if the successor is a trivial loop exit.
300 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
304 // Okay, everything after this looks good, check to make sure that this block
305 // doesn't include any side effects.
306 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
307 if (I->mayHaveSideEffects())
313 /// isTrivialLoopExitBlock - Return true if the specified block unconditionally
314 /// leads to an exit from the specified loop, and has no side-effects in the
315 /// process. If so, return the block that is exited to, otherwise return null.
316 static BasicBlock *isTrivialLoopExitBlock(Loop *L, BasicBlock *BB) {
317 std::set<BasicBlock*> Visited;
318 Visited.insert(L->getHeader()); // Branches to header are ok.
319 BasicBlock *ExitBB = 0;
320 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
325 /// IsTrivialUnswitchCondition - Check to see if this unswitch condition is
326 /// trivial: that is, that the condition controls whether or not the loop does
327 /// anything at all. If this is a trivial condition, unswitching produces no
328 /// code duplications (equivalently, it produces a simpler loop and a new empty
329 /// loop, which gets deleted).
331 /// If this is a trivial condition, return true, otherwise return false. When
332 /// returning true, this sets Cond and Val to the condition that controls the
333 /// trivial condition: when Cond dynamically equals Val, the loop is known to
334 /// exit. Finally, this sets LoopExit to the BB that the loop exits to when
337 bool LoopUnswitch::IsTrivialUnswitchCondition(Value *Cond, Constant **Val,
338 BasicBlock **LoopExit) {
339 BasicBlock *Header = currentLoop->getHeader();
340 TerminatorInst *HeaderTerm = Header->getTerminator();
341 LLVMContext &Context = Header->getContext();
343 BasicBlock *LoopExitBB = 0;
344 if (BranchInst *BI = dyn_cast<BranchInst>(HeaderTerm)) {
345 // If the header block doesn't end with a conditional branch on Cond, we
347 if (!BI->isConditional() || BI->getCondition() != Cond)
350 // Check to see if a successor of the branch is guaranteed to go to the
351 // latch block or exit through a one exit block without having any
352 // side-effects. If so, determine the value of Cond that causes it to do
354 if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
355 BI->getSuccessor(0)))) {
356 if (Val) *Val = Context.getTrue();
357 } else if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
358 BI->getSuccessor(1)))) {
359 if (Val) *Val = Context.getFalse();
361 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(HeaderTerm)) {
362 // If this isn't a switch on Cond, we can't handle it.
363 if (SI->getCondition() != Cond) return false;
365 // Check to see if a successor of the switch is guaranteed to go to the
366 // latch block or exit through a one exit block without having any
367 // side-effects. If so, determine the value of Cond that causes it to do
368 // this. Note that we can't trivially unswitch on the default case.
369 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
370 if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
371 SI->getSuccessor(i)))) {
372 // Okay, we found a trivial case, remember the value that is trivial.
373 if (Val) *Val = SI->getCaseValue(i);
378 // If we didn't find a single unique LoopExit block, or if the loop exit block
379 // contains phi nodes, this isn't trivial.
380 if (!LoopExitBB || isa<PHINode>(LoopExitBB->begin()))
381 return false; // Can't handle this.
383 if (LoopExit) *LoopExit = LoopExitBB;
385 // We already know that nothing uses any scalar values defined inside of this
386 // loop. As such, we just have to check to see if this loop will execute any
387 // side-effecting instructions (e.g. stores, calls, volatile loads) in the
388 // part of the loop that the code *would* execute. We already checked the
389 // tail, check the header now.
390 for (BasicBlock::iterator I = Header->begin(), E = Header->end(); I != E; ++I)
391 if (I->mayHaveSideEffects())
396 /// getLoopUnswitchCost - Return the cost (code size growth) that will happen if
397 /// we choose to unswitch current loop on the specified value.
399 unsigned LoopUnswitch::getLoopUnswitchCost(Value *LIC) {
400 // If the condition is trivial, always unswitch. There is no code growth for
402 if (IsTrivialUnswitchCondition(LIC))
405 // FIXME: This is really overly conservative. However, more liberal
406 // estimations have thus far resulted in excessive unswitching, which is bad
407 // both in compile time and in code size. This should be replaced once
408 // someone figures out how a good estimation.
409 return currentLoop->getBlocks().size();
412 // FIXME: this is brain dead. It should take into consideration code
414 for (Loop::block_iterator I = currentLoop->block_begin(),
415 E = currentLoop->block_end();
418 // Do not include empty blocks in the cost calculation. This happen due to
419 // loop canonicalization and will be removed.
420 if (BB->begin() == BasicBlock::iterator(BB->getTerminator()))
423 // Count basic blocks.
430 /// UnswitchIfProfitable - We have found that we can unswitch currentLoop when
431 /// LoopCond == Val to simplify the loop. If we decide that this is profitable,
432 /// unswitch the loop, reprocess the pieces, then return true.
433 bool LoopUnswitch::UnswitchIfProfitable(Value *LoopCond, Constant *Val){
436 Function *F = loopHeader->getParent();
439 // Check to see if it would be profitable to unswitch current loop.
440 unsigned Cost = getLoopUnswitchCost(LoopCond);
442 // Do not do non-trivial unswitch while optimizing for size.
443 if (Cost && OptimizeForSize)
445 if (Cost && !F->isDeclaration() && F->hasFnAttr(Attribute::OptimizeForSize))
448 if (Cost > Threshold) {
449 // FIXME: this should estimate growth by the amount of code shared by the
450 // resultant unswitched loops.
452 DOUT << "NOT unswitching loop %"
453 << currentLoop->getHeader()->getName() << ", cost too high: "
454 << currentLoop->getBlocks().size() << "\n";
459 BasicBlock *ExitBlock;
460 if (IsTrivialUnswitchCondition(LoopCond, &CondVal, &ExitBlock)) {
461 UnswitchTrivialCondition(currentLoop, LoopCond, CondVal, ExitBlock);
463 UnswitchNontrivialCondition(LoopCond, Val, currentLoop);
469 // RemapInstruction - Convert the instruction operands from referencing the
470 // current values into those specified by ValueMap.
472 static inline void RemapInstruction(Instruction *I,
473 DenseMap<const Value *, Value*> &ValueMap) {
474 for (unsigned op = 0, E = I->getNumOperands(); op != E; ++op) {
475 Value *Op = I->getOperand(op);
476 DenseMap<const Value *, Value*>::iterator It = ValueMap.find(Op);
477 if (It != ValueMap.end()) Op = It->second;
478 I->setOperand(op, Op);
482 /// CloneLoop - Recursively clone the specified loop and all of its children,
483 /// mapping the blocks with the specified map.
484 static Loop *CloneLoop(Loop *L, Loop *PL, DenseMap<const Value*, Value*> &VM,
485 LoopInfo *LI, LPPassManager *LPM) {
486 Loop *New = new Loop();
488 LPM->insertLoop(New, PL);
490 // Add all of the blocks in L to the new loop.
491 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
493 if (LI->getLoopFor(*I) == L)
494 New->addBasicBlockToLoop(cast<BasicBlock>(VM[*I]), LI->getBase());
496 // Add all of the subloops to the new loop.
497 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
498 CloneLoop(*I, New, VM, LI, LPM);
503 /// EmitPreheaderBranchOnCondition - Emit a conditional branch on two values
504 /// if LIC == Val, branch to TrueDst, otherwise branch to FalseDest. Insert the
505 /// code immediately before InsertPt.
506 void LoopUnswitch::EmitPreheaderBranchOnCondition(Value *LIC, Constant *Val,
507 BasicBlock *TrueDest,
508 BasicBlock *FalseDest,
509 Instruction *InsertPt) {
510 // Insert a conditional branch on LIC to the two preheaders. The original
511 // code is the true version and the new code is the false version.
512 Value *BranchVal = LIC;
513 if (!isa<ConstantInt>(Val) || Val->getType() != Type::Int1Ty)
514 BranchVal = new ICmpInst(InsertPt, ICmpInst::ICMP_EQ, LIC, Val, "tmp");
515 else if (Val != Val->getContext().getTrue())
516 // We want to enter the new loop when the condition is true.
517 std::swap(TrueDest, FalseDest);
519 // Insert the new branch.
520 BranchInst::Create(TrueDest, FalseDest, BranchVal, InsertPt);
523 /// UnswitchTrivialCondition - Given a loop that has a trivial unswitchable
524 /// condition in it (a cond branch from its header block to its latch block,
525 /// where the path through the loop that doesn't execute its body has no
526 /// side-effects), unswitch it. This doesn't involve any code duplication, just
527 /// moving the conditional branch outside of the loop and updating loop info.
528 void LoopUnswitch::UnswitchTrivialCondition(Loop *L, Value *Cond,
530 BasicBlock *ExitBlock) {
531 DOUT << "loop-unswitch: Trivial-Unswitch loop %"
532 << loopHeader->getName() << " [" << L->getBlocks().size()
533 << " blocks] in Function " << L->getHeader()->getParent()->getName()
534 << " on cond: " << *Val << " == " << *Cond << "\n";
536 // First step, split the preheader, so that we know that there is a safe place
537 // to insert the conditional branch. We will change loopPreheader to have a
538 // conditional branch on Cond.
539 BasicBlock *NewPH = SplitEdge(loopPreheader, loopHeader, this);
541 // Now that we have a place to insert the conditional branch, create a place
542 // to branch to: this is the exit block out of the loop that we should
545 // Split this block now, so that the loop maintains its exit block, and so
546 // that the jump from the preheader can execute the contents of the exit block
547 // without actually branching to it (the exit block should be dominated by the
548 // loop header, not the preheader).
549 assert(!L->contains(ExitBlock) && "Exit block is in the loop?");
550 BasicBlock *NewExit = SplitBlock(ExitBlock, ExitBlock->begin(), this);
552 // Okay, now we have a position to branch from and a position to branch to,
553 // insert the new conditional branch.
554 EmitPreheaderBranchOnCondition(Cond, Val, NewExit, NewPH,
555 loopPreheader->getTerminator());
556 LPM->deleteSimpleAnalysisValue(loopPreheader->getTerminator(), L);
557 loopPreheader->getTerminator()->eraseFromParent();
559 // We need to reprocess this loop, it could be unswitched again.
562 // Now that we know that the loop is never entered when this condition is a
563 // particular value, rewrite the loop with this info. We know that this will
564 // at least eliminate the old branch.
565 RewriteLoopBodyWithConditionConstant(L, Cond, Val, false);
569 /// SplitExitEdges - Split all of the edges from inside the loop to their exit
570 /// blocks. Update the appropriate Phi nodes as we do so.
571 void LoopUnswitch::SplitExitEdges(Loop *L,
572 const SmallVector<BasicBlock *, 8> &ExitBlocks)
575 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
576 BasicBlock *ExitBlock = ExitBlocks[i];
577 std::vector<BasicBlock*> Preds(pred_begin(ExitBlock), pred_end(ExitBlock));
579 for (unsigned j = 0, e = Preds.size(); j != e; ++j) {
580 BasicBlock* NewExitBlock = SplitEdge(Preds[j], ExitBlock, this);
581 BasicBlock* StartBlock = Preds[j];
582 BasicBlock* EndBlock;
583 if (NewExitBlock->getSinglePredecessor() == ExitBlock) {
584 EndBlock = NewExitBlock;
585 NewExitBlock = EndBlock->getSinglePredecessor();
587 EndBlock = ExitBlock;
590 std::set<PHINode*> InsertedPHIs;
591 PHINode* OldLCSSA = 0;
592 for (BasicBlock::iterator I = EndBlock->begin();
593 (OldLCSSA = dyn_cast<PHINode>(I)); ++I) {
594 Value* OldValue = OldLCSSA->getIncomingValueForBlock(NewExitBlock);
595 PHINode* NewLCSSA = PHINode::Create(OldLCSSA->getType(),
596 OldLCSSA->getName() + ".us-lcssa",
597 NewExitBlock->getTerminator());
598 NewLCSSA->addIncoming(OldValue, StartBlock);
599 OldLCSSA->setIncomingValue(OldLCSSA->getBasicBlockIndex(NewExitBlock),
601 InsertedPHIs.insert(NewLCSSA);
604 BasicBlock::iterator InsertPt = EndBlock->getFirstNonPHI();
605 for (BasicBlock::iterator I = NewExitBlock->begin();
606 (OldLCSSA = dyn_cast<PHINode>(I)) && InsertedPHIs.count(OldLCSSA) == 0;
608 PHINode *NewLCSSA = PHINode::Create(OldLCSSA->getType(),
609 OldLCSSA->getName() + ".us-lcssa",
611 OldLCSSA->replaceAllUsesWith(NewLCSSA);
612 NewLCSSA->addIncoming(OldLCSSA, NewExitBlock);
620 /// UnswitchNontrivialCondition - We determined that the loop is profitable
621 /// to unswitch when LIC equal Val. Split it into loop versions and test the
622 /// condition outside of either loop. Return the loops created as Out1/Out2.
623 void LoopUnswitch::UnswitchNontrivialCondition(Value *LIC, Constant *Val,
625 Function *F = loopHeader->getParent();
626 DOUT << "loop-unswitch: Unswitching loop %"
627 << loopHeader->getName() << " [" << L->getBlocks().size()
628 << " blocks] in Function " << F->getName()
629 << " when '" << *Val << "' == " << *LIC << "\n";
634 // First step, split the preheader and exit blocks, and add these blocks to
635 // the LoopBlocks list.
636 BasicBlock *NewPreheader = SplitEdge(loopPreheader, loopHeader, this);
637 LoopBlocks.push_back(NewPreheader);
639 // We want the loop to come after the preheader, but before the exit blocks.
640 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end());
642 SmallVector<BasicBlock*, 8> ExitBlocks;
643 L->getUniqueExitBlocks(ExitBlocks);
645 // Split all of the edges from inside the loop to their exit blocks. Update
646 // the appropriate Phi nodes as we do so.
647 SplitExitEdges(L, ExitBlocks);
649 // The exit blocks may have been changed due to edge splitting, recompute.
651 L->getUniqueExitBlocks(ExitBlocks);
653 // Add exit blocks to the loop blocks.
654 LoopBlocks.insert(LoopBlocks.end(), ExitBlocks.begin(), ExitBlocks.end());
656 // Next step, clone all of the basic blocks that make up the loop (including
657 // the loop preheader and exit blocks), keeping track of the mapping between
658 // the instructions and blocks.
659 NewBlocks.reserve(LoopBlocks.size());
660 DenseMap<const Value*, Value*> ValueMap;
661 for (unsigned i = 0, e = LoopBlocks.size(); i != e; ++i) {
662 BasicBlock *New = CloneBasicBlock(LoopBlocks[i], ValueMap, ".us", F);
663 NewBlocks.push_back(New);
664 ValueMap[LoopBlocks[i]] = New; // Keep the BB mapping.
665 LPM->cloneBasicBlockSimpleAnalysis(LoopBlocks[i], New, L);
668 // Splice the newly inserted blocks into the function right before the
669 // original preheader.
670 F->getBasicBlockList().splice(LoopBlocks[0], F->getBasicBlockList(),
671 NewBlocks[0], F->end());
673 // Now we create the new Loop object for the versioned loop.
674 Loop *NewLoop = CloneLoop(L, L->getParentLoop(), ValueMap, LI, LPM);
675 Loop *ParentLoop = L->getParentLoop();
677 // Make sure to add the cloned preheader and exit blocks to the parent loop
679 ParentLoop->addBasicBlockToLoop(NewBlocks[0], LI->getBase());
682 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
683 BasicBlock *NewExit = cast<BasicBlock>(ValueMap[ExitBlocks[i]]);
684 // The new exit block should be in the same loop as the old one.
685 if (Loop *ExitBBLoop = LI->getLoopFor(ExitBlocks[i]))
686 ExitBBLoop->addBasicBlockToLoop(NewExit, LI->getBase());
688 assert(NewExit->getTerminator()->getNumSuccessors() == 1 &&
689 "Exit block should have been split to have one successor!");
690 BasicBlock *ExitSucc = NewExit->getTerminator()->getSuccessor(0);
692 // If the successor of the exit block had PHI nodes, add an entry for
695 for (BasicBlock::iterator I = ExitSucc->begin();
696 (PN = dyn_cast<PHINode>(I)); ++I) {
697 Value *V = PN->getIncomingValueForBlock(ExitBlocks[i]);
698 DenseMap<const Value *, Value*>::iterator It = ValueMap.find(V);
699 if (It != ValueMap.end()) V = It->second;
700 PN->addIncoming(V, NewExit);
704 // Rewrite the code to refer to itself.
705 for (unsigned i = 0, e = NewBlocks.size(); i != e; ++i)
706 for (BasicBlock::iterator I = NewBlocks[i]->begin(),
707 E = NewBlocks[i]->end(); I != E; ++I)
708 RemapInstruction(I, ValueMap);
710 // Rewrite the original preheader to select between versions of the loop.
711 BranchInst *OldBR = cast<BranchInst>(loopPreheader->getTerminator());
712 assert(OldBR->isUnconditional() && OldBR->getSuccessor(0) == LoopBlocks[0] &&
713 "Preheader splitting did not work correctly!");
715 // Emit the new branch that selects between the two versions of this loop.
716 EmitPreheaderBranchOnCondition(LIC, Val, NewBlocks[0], LoopBlocks[0], OldBR);
717 LPM->deleteSimpleAnalysisValue(OldBR, L);
718 OldBR->eraseFromParent();
720 LoopProcessWorklist.push_back(NewLoop);
723 // Now we rewrite the original code to know that the condition is true and the
724 // new code to know that the condition is false.
725 RewriteLoopBodyWithConditionConstant(L , LIC, Val, false);
727 // It's possible that simplifying one loop could cause the other to be
728 // deleted. If so, don't simplify it.
729 if (!LoopProcessWorklist.empty() && LoopProcessWorklist.back() == NewLoop)
730 RewriteLoopBodyWithConditionConstant(NewLoop, LIC, Val, true);
734 /// RemoveFromWorklist - Remove all instances of I from the worklist vector
736 static void RemoveFromWorklist(Instruction *I,
737 std::vector<Instruction*> &Worklist) {
738 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(),
740 while (WI != Worklist.end()) {
741 unsigned Offset = WI-Worklist.begin();
743 WI = std::find(Worklist.begin()+Offset, Worklist.end(), I);
747 /// ReplaceUsesOfWith - When we find that I really equals V, remove I from the
748 /// program, replacing all uses with V and update the worklist.
749 static void ReplaceUsesOfWith(Instruction *I, Value *V,
750 std::vector<Instruction*> &Worklist,
751 Loop *L, LPPassManager *LPM) {
752 DOUT << "Replace with '" << *V << "': " << *I;
754 // Add uses to the worklist, which may be dead now.
755 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
756 if (Instruction *Use = dyn_cast<Instruction>(I->getOperand(i)))
757 Worklist.push_back(Use);
759 // Add users to the worklist which may be simplified now.
760 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
762 Worklist.push_back(cast<Instruction>(*UI));
763 LPM->deleteSimpleAnalysisValue(I, L);
764 RemoveFromWorklist(I, Worklist);
765 I->replaceAllUsesWith(V);
766 I->eraseFromParent();
770 /// RemoveBlockIfDead - If the specified block is dead, remove it, update loop
771 /// information, and remove any dead successors it has.
773 void LoopUnswitch::RemoveBlockIfDead(BasicBlock *BB,
774 std::vector<Instruction*> &Worklist,
776 if (pred_begin(BB) != pred_end(BB)) {
777 // This block isn't dead, since an edge to BB was just removed, see if there
778 // are any easy simplifications we can do now.
779 if (BasicBlock *Pred = BB->getSinglePredecessor()) {
780 // If it has one pred, fold phi nodes in BB.
781 while (isa<PHINode>(BB->begin()))
782 ReplaceUsesOfWith(BB->begin(),
783 cast<PHINode>(BB->begin())->getIncomingValue(0),
786 // If this is the header of a loop and the only pred is the latch, we now
787 // have an unreachable loop.
788 if (Loop *L = LI->getLoopFor(BB))
789 if (loopHeader == BB && L->contains(Pred)) {
790 // Remove the branch from the latch to the header block, this makes
791 // the header dead, which will make the latch dead (because the header
792 // dominates the latch).
793 LPM->deleteSimpleAnalysisValue(Pred->getTerminator(), L);
794 Pred->getTerminator()->eraseFromParent();
795 new UnreachableInst(Pred);
797 // The loop is now broken, remove it from LI.
798 RemoveLoopFromHierarchy(L);
800 // Reprocess the header, which now IS dead.
801 RemoveBlockIfDead(BB, Worklist, L);
805 // If pred ends in a uncond branch, add uncond branch to worklist so that
806 // the two blocks will get merged.
807 if (BranchInst *BI = dyn_cast<BranchInst>(Pred->getTerminator()))
808 if (BI->isUnconditional())
809 Worklist.push_back(BI);
814 DOUT << "Nuking dead block: " << *BB;
816 // Remove the instructions in the basic block from the worklist.
817 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
818 RemoveFromWorklist(I, Worklist);
820 // Anything that uses the instructions in this basic block should have their
821 // uses replaced with undefs.
823 I->replaceAllUsesWith(I->getContext().getUndef(I->getType()));
826 // If this is the edge to the header block for a loop, remove the loop and
827 // promote all subloops.
828 if (Loop *BBLoop = LI->getLoopFor(BB)) {
829 if (BBLoop->getLoopLatch() == BB)
830 RemoveLoopFromHierarchy(BBLoop);
833 // Remove the block from the loop info, which removes it from any loops it
838 // Remove phi node entries in successors for this block.
839 TerminatorInst *TI = BB->getTerminator();
840 SmallVector<BasicBlock*, 4> Succs;
841 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
842 Succs.push_back(TI->getSuccessor(i));
843 TI->getSuccessor(i)->removePredecessor(BB);
846 // Unique the successors, remove anything with multiple uses.
847 array_pod_sort(Succs.begin(), Succs.end());
848 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end());
850 // Remove the basic block, including all of the instructions contained in it.
851 LPM->deleteSimpleAnalysisValue(BB, L);
852 BB->eraseFromParent();
853 // Remove successor blocks here that are not dead, so that we know we only
854 // have dead blocks in this list. Nondead blocks have a way of becoming dead,
855 // then getting removed before we revisit them, which is badness.
857 for (unsigned i = 0; i != Succs.size(); ++i)
858 if (pred_begin(Succs[i]) != pred_end(Succs[i])) {
859 // One exception is loop headers. If this block was the preheader for a
860 // loop, then we DO want to visit the loop so the loop gets deleted.
861 // We know that if the successor is a loop header, that this loop had to
862 // be the preheader: the case where this was the latch block was handled
863 // above and headers can only have two predecessors.
864 if (!LI->isLoopHeader(Succs[i])) {
865 Succs.erase(Succs.begin()+i);
870 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
871 RemoveBlockIfDead(Succs[i], Worklist, L);
874 /// RemoveLoopFromHierarchy - We have discovered that the specified loop has
875 /// become unwrapped, either because the backedge was deleted, or because the
876 /// edge into the header was removed. If the edge into the header from the
877 /// latch block was removed, the loop is unwrapped but subloops are still alive,
878 /// so they just reparent loops. If the loops are actually dead, they will be
880 void LoopUnswitch::RemoveLoopFromHierarchy(Loop *L) {
881 LPM->deleteLoopFromQueue(L);
882 RemoveLoopFromWorklist(L);
885 // RewriteLoopBodyWithConditionConstant - We know either that the value LIC has
886 // the value specified by Val in the specified loop, or we know it does NOT have
887 // that value. Rewrite any uses of LIC or of properties correlated to it.
888 void LoopUnswitch::RewriteLoopBodyWithConditionConstant(Loop *L, Value *LIC,
891 assert(!isa<Constant>(LIC) && "Why are we unswitching on a constant?");
893 // FIXME: Support correlated properties, like:
900 // FOLD boolean conditions (X|LIC), (X&LIC). Fold conditional branches,
901 // selects, switches.
902 std::vector<User*> Users(LIC->use_begin(), LIC->use_end());
903 std::vector<Instruction*> Worklist;
904 LLVMContext &Context = Val->getContext();
907 // If we know that LIC == Val, or that LIC == NotVal, just replace uses of LIC
908 // in the loop with the appropriate one directly.
909 if (IsEqual || (isa<ConstantInt>(Val) && Val->getType() == Type::Int1Ty)) {
914 Replacement = Context.getConstantInt(Type::Int1Ty,
915 !cast<ConstantInt>(Val)->getZExtValue());
917 for (unsigned i = 0, e = Users.size(); i != e; ++i)
918 if (Instruction *U = cast<Instruction>(Users[i])) {
919 if (!L->contains(U->getParent()))
921 U->replaceUsesOfWith(LIC, Replacement);
922 Worklist.push_back(U);
925 // Otherwise, we don't know the precise value of LIC, but we do know that it
926 // is certainly NOT "Val". As such, simplify any uses in the loop that we
927 // can. This case occurs when we unswitch switch statements.
928 for (unsigned i = 0, e = Users.size(); i != e; ++i)
929 if (Instruction *U = cast<Instruction>(Users[i])) {
930 if (!L->contains(U->getParent()))
933 Worklist.push_back(U);
935 // If we know that LIC is not Val, use this info to simplify code.
936 if (SwitchInst *SI = dyn_cast<SwitchInst>(U)) {
937 for (unsigned i = 1, e = SI->getNumCases(); i != e; ++i) {
938 if (SI->getCaseValue(i) == Val) {
939 // Found a dead case value. Don't remove PHI nodes in the
940 // successor if they become single-entry, those PHI nodes may
941 // be in the Users list.
943 // FIXME: This is a hack. We need to keep the successor around
944 // and hooked up so as to preserve the loop structure, because
945 // trying to update it is complicated. So instead we preserve the
946 // loop structure and put the block on an dead code path.
948 BasicBlock *SISucc = SI->getSuccessor(i);
949 BasicBlock* Old = SI->getParent();
950 BasicBlock* Split = SplitBlock(Old, SI, this);
952 Instruction* OldTerm = Old->getTerminator();
953 BranchInst::Create(Split, SISucc,
954 Context.getTrue(), OldTerm);
956 LPM->deleteSimpleAnalysisValue(Old->getTerminator(), L);
957 Old->getTerminator()->eraseFromParent();
960 for (BasicBlock::iterator II = SISucc->begin();
961 (PN = dyn_cast<PHINode>(II)); ++II) {
962 Value *InVal = PN->removeIncomingValue(Split, false);
963 PN->addIncoming(InVal, Old);
972 // TODO: We could do other simplifications, for example, turning
973 // LIC == Val -> false.
977 SimplifyCode(Worklist, L);
980 /// SimplifyCode - Okay, now that we have simplified some instructions in the
981 /// loop, walk over it and constant prop, dce, and fold control flow where
982 /// possible. Note that this is effectively a very simple loop-structure-aware
983 /// optimizer. During processing of this loop, L could very well be deleted, so
984 /// it must not be used.
986 /// FIXME: When the loop optimizer is more mature, separate this out to a new
989 void LoopUnswitch::SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) {
990 while (!Worklist.empty()) {
991 Instruction *I = Worklist.back();
994 // Simple constant folding.
995 if (Constant *C = ConstantFoldInstruction(I, I->getContext())) {
996 ReplaceUsesOfWith(I, C, Worklist, L, LPM);
1001 if (isInstructionTriviallyDead(I)) {
1002 DOUT << "Remove dead instruction '" << *I;
1004 // Add uses to the worklist, which may be dead now.
1005 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
1006 if (Instruction *Use = dyn_cast<Instruction>(I->getOperand(i)))
1007 Worklist.push_back(Use);
1008 LPM->deleteSimpleAnalysisValue(I, L);
1009 RemoveFromWorklist(I, Worklist);
1010 I->eraseFromParent();
1015 // Special case hacks that appear commonly in unswitched code.
1016 switch (I->getOpcode()) {
1017 case Instruction::Select:
1018 if (ConstantInt *CB = dyn_cast<ConstantInt>(I->getOperand(0))) {
1019 ReplaceUsesOfWith(I, I->getOperand(!CB->getZExtValue()+1), Worklist, L,
1024 case Instruction::And:
1025 if (isa<ConstantInt>(I->getOperand(0)) &&
1026 I->getOperand(0)->getType() == Type::Int1Ty) // constant -> RHS
1027 cast<BinaryOperator>(I)->swapOperands();
1028 if (ConstantInt *CB = dyn_cast<ConstantInt>(I->getOperand(1)))
1029 if (CB->getType() == Type::Int1Ty) {
1030 if (CB->isOne()) // X & 1 -> X
1031 ReplaceUsesOfWith(I, I->getOperand(0), Worklist, L, LPM);
1033 ReplaceUsesOfWith(I, I->getOperand(1), Worklist, L, LPM);
1037 case Instruction::Or:
1038 if (isa<ConstantInt>(I->getOperand(0)) &&
1039 I->getOperand(0)->getType() == Type::Int1Ty) // constant -> RHS
1040 cast<BinaryOperator>(I)->swapOperands();
1041 if (ConstantInt *CB = dyn_cast<ConstantInt>(I->getOperand(1)))
1042 if (CB->getType() == Type::Int1Ty) {
1043 if (CB->isOne()) // X | 1 -> 1
1044 ReplaceUsesOfWith(I, I->getOperand(1), Worklist, L, LPM);
1046 ReplaceUsesOfWith(I, I->getOperand(0), Worklist, L, LPM);
1050 case Instruction::Br: {
1051 BranchInst *BI = cast<BranchInst>(I);
1052 if (BI->isUnconditional()) {
1053 // If BI's parent is the only pred of the successor, fold the two blocks
1055 BasicBlock *Pred = BI->getParent();
1056 BasicBlock *Succ = BI->getSuccessor(0);
1057 BasicBlock *SinglePred = Succ->getSinglePredecessor();
1058 if (!SinglePred) continue; // Nothing to do.
1059 assert(SinglePred == Pred && "CFG broken");
1061 DOUT << "Merging blocks: " << Pred->getName() << " <- "
1062 << Succ->getName() << "\n";
1064 // Resolve any single entry PHI nodes in Succ.
1065 while (PHINode *PN = dyn_cast<PHINode>(Succ->begin()))
1066 ReplaceUsesOfWith(PN, PN->getIncomingValue(0), Worklist, L, LPM);
1068 // Move all of the successor contents from Succ to Pred.
1069 Pred->getInstList().splice(BI, Succ->getInstList(), Succ->begin(),
1071 LPM->deleteSimpleAnalysisValue(BI, L);
1072 BI->eraseFromParent();
1073 RemoveFromWorklist(BI, Worklist);
1075 // If Succ has any successors with PHI nodes, update them to have
1076 // entries coming from Pred instead of Succ.
1077 Succ->replaceAllUsesWith(Pred);
1079 // Remove Succ from the loop tree.
1080 LI->removeBlock(Succ);
1081 LPM->deleteSimpleAnalysisValue(Succ, L);
1082 Succ->eraseFromParent();
1084 } else if (ConstantInt *CB = dyn_cast<ConstantInt>(BI->getCondition())){
1085 // Conditional branch. Turn it into an unconditional branch, then
1086 // remove dead blocks.
1087 break; // FIXME: Enable.
1089 DOUT << "Folded branch: " << *BI;
1090 BasicBlock *DeadSucc = BI->getSuccessor(CB->getZExtValue());
1091 BasicBlock *LiveSucc = BI->getSuccessor(!CB->getZExtValue());
1092 DeadSucc->removePredecessor(BI->getParent(), true);
1093 Worklist.push_back(BranchInst::Create(LiveSucc, BI));
1094 LPM->deleteSimpleAnalysisValue(BI, L);
1095 BI->eraseFromParent();
1096 RemoveFromWorklist(BI, Worklist);
1099 RemoveBlockIfDead(DeadSucc, Worklist, L);