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/Analysis/InlineCost.h"
36 #include "llvm/Analysis/InstructionSimplify.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/Debug.h"
48 #include "llvm/Support/raw_ostream.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 // The specific value of 50 here was chosen based only on intuition and a
60 // few specific examples.
61 static cl::opt<unsigned>
62 Threshold("loop-unswitch-threshold", cl::desc("Max loop size to unswitch"),
63 cl::init(50), cl::Hidden);
66 class LoopUnswitch : public LoopPass {
67 LoopInfo *LI; // Loop information
70 // LoopProcessWorklist - Used to check if second loop needs processing
71 // after RewriteLoopBodyWithConditionConstant rewrites first loop.
72 std::vector<Loop*> LoopProcessWorklist;
73 SmallPtrSet<Value *,8> UnswitchedVals;
80 BasicBlock *loopHeader;
81 BasicBlock *loopPreheader;
83 // LoopBlocks contains all of the basic blocks of the loop, including the
84 // preheader of the loop, the body of the loop, and the exit blocks of the
85 // loop, in that order.
86 std::vector<BasicBlock*> LoopBlocks;
87 // NewBlocks contained cloned copy of basic blocks from LoopBlocks.
88 std::vector<BasicBlock*> NewBlocks;
91 static char ID; // Pass ID, replacement for typeid
92 explicit LoopUnswitch(bool Os = false) :
93 LoopPass(ID), OptimizeForSize(Os), redoLoop(false),
94 currentLoop(NULL), DT(NULL), loopHeader(NULL),
96 initializeLoopUnswitchPass(*PassRegistry::getPassRegistry());
99 bool runOnLoop(Loop *L, LPPassManager &LPM);
100 bool processCurrentLoop();
102 /// This transformation requires natural loop information & requires that
103 /// loop preheaders be inserted into the CFG.
105 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
106 AU.addRequiredID(LoopSimplifyID);
107 AU.addPreservedID(LoopSimplifyID);
108 AU.addRequired<LoopInfo>();
109 AU.addPreserved<LoopInfo>();
110 AU.addRequiredID(LCSSAID);
111 AU.addPreservedID(LCSSAID);
112 AU.addPreserved<DominatorTree>();
117 virtual void releaseMemory() {
118 UnswitchedVals.clear();
121 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
123 void RemoveLoopFromWorklist(Loop *L) {
124 std::vector<Loop*>::iterator I = std::find(LoopProcessWorklist.begin(),
125 LoopProcessWorklist.end(), L);
126 if (I != LoopProcessWorklist.end())
127 LoopProcessWorklist.erase(I);
130 void initLoopData() {
131 loopHeader = currentLoop->getHeader();
132 loopPreheader = currentLoop->getLoopPreheader();
135 /// Split all of the edges from inside the loop to their exit blocks.
136 /// Update the appropriate Phi nodes as we do so.
137 void SplitExitEdges(Loop *L, const SmallVector<BasicBlock *, 8> &ExitBlocks);
139 bool UnswitchIfProfitable(Value *LoopCond, Constant *Val);
140 void UnswitchTrivialCondition(Loop *L, Value *Cond, Constant *Val,
141 BasicBlock *ExitBlock);
142 void UnswitchNontrivialCondition(Value *LIC, Constant *OnVal, Loop *L);
144 void RewriteLoopBodyWithConditionConstant(Loop *L, Value *LIC,
145 Constant *Val, bool isEqual);
147 void EmitPreheaderBranchOnCondition(Value *LIC, Constant *Val,
148 BasicBlock *TrueDest,
149 BasicBlock *FalseDest,
150 Instruction *InsertPt);
152 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
153 void RemoveBlockIfDead(BasicBlock *BB,
154 std::vector<Instruction*> &Worklist, Loop *l);
155 void RemoveLoopFromHierarchy(Loop *L);
156 bool IsTrivialUnswitchCondition(Value *Cond, Constant **Val = 0,
157 BasicBlock **LoopExit = 0);
161 char LoopUnswitch::ID = 0;
162 INITIALIZE_PASS_BEGIN(LoopUnswitch, "loop-unswitch", "Unswitch loops",
164 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
165 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
166 INITIALIZE_PASS_DEPENDENCY(LCSSA)
167 INITIALIZE_PASS_END(LoopUnswitch, "loop-unswitch", "Unswitch loops",
170 Pass *llvm::createLoopUnswitchPass(bool Os) {
171 return new LoopUnswitch(Os);
174 /// FindLIVLoopCondition - Cond is a condition that occurs in L. If it is
175 /// invariant in the loop, or has an invariant piece, return the invariant.
176 /// Otherwise, return null.
177 static Value *FindLIVLoopCondition(Value *Cond, Loop *L, bool &Changed) {
178 // We can never unswitch on vector conditions.
179 if (Cond->getType()->isVectorTy())
182 // Constants should be folded, not unswitched on!
183 if (isa<Constant>(Cond)) return 0;
185 // TODO: Handle: br (VARIANT|INVARIANT).
187 // Hoist simple values out.
188 if (L->makeLoopInvariant(Cond, Changed))
191 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Cond))
192 if (BO->getOpcode() == Instruction::And ||
193 BO->getOpcode() == Instruction::Or) {
194 // If either the left or right side is invariant, we can unswitch on this,
195 // which will cause the branch to go away in one loop and the condition to
196 // simplify in the other one.
197 if (Value *LHS = FindLIVLoopCondition(BO->getOperand(0), L, Changed))
199 if (Value *RHS = FindLIVLoopCondition(BO->getOperand(1), L, Changed))
206 bool LoopUnswitch::runOnLoop(Loop *L, LPPassManager &LPM_Ref) {
207 LI = &getAnalysis<LoopInfo>();
209 DT = getAnalysisIfAvailable<DominatorTree>();
211 Function *F = currentLoop->getHeader()->getParent();
212 bool Changed = false;
214 assert(currentLoop->isLCSSAForm(*DT));
216 Changed |= processCurrentLoop();
220 // FIXME: Reconstruct dom info, because it is not preserved properly.
222 DT->runOnFunction(*F);
227 /// processCurrentLoop - Do actual work and unswitch loop if possible
229 bool LoopUnswitch::processCurrentLoop() {
230 bool Changed = false;
231 LLVMContext &Context = currentLoop->getHeader()->getContext();
233 // Loop over all of the basic blocks in the loop. If we find an interior
234 // block that is branching on a loop-invariant condition, we can unswitch this
236 for (Loop::block_iterator I = currentLoop->block_begin(),
237 E = currentLoop->block_end(); I != E; ++I) {
238 TerminatorInst *TI = (*I)->getTerminator();
239 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
240 // If this isn't branching on an invariant condition, we can't unswitch
242 if (BI->isConditional()) {
243 // See if this, or some part of it, is loop invariant. If so, we can
244 // unswitch on it if we desire.
245 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(),
246 currentLoop, Changed);
247 if (LoopCond && UnswitchIfProfitable(LoopCond,
248 ConstantInt::getTrue(Context))) {
253 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
254 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(),
255 currentLoop, Changed);
256 if (LoopCond && SI->getNumCases() > 1) {
257 // Find a value to unswitch on:
258 // FIXME: this should chose the most expensive case!
259 Constant *UnswitchVal = SI->getCaseValue(1);
260 // Do not process same value again and again.
261 if (!UnswitchedVals.insert(UnswitchVal))
264 if (UnswitchIfProfitable(LoopCond, UnswitchVal)) {
271 // Scan the instructions to check for unswitchable values.
272 for (BasicBlock::iterator BBI = (*I)->begin(), E = (*I)->end();
274 if (SelectInst *SI = dyn_cast<SelectInst>(BBI)) {
275 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(),
276 currentLoop, Changed);
277 if (LoopCond && UnswitchIfProfitable(LoopCond,
278 ConstantInt::getTrue(Context))) {
287 /// isTrivialLoopExitBlock - Check to see if all paths from BB exit the
288 /// loop with no side effects (including infinite loops).
290 /// If true, we return true and set ExitBB to the block we
293 static bool isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *BB,
295 std::set<BasicBlock*> &Visited) {
296 if (!Visited.insert(BB).second) {
297 // Already visited. Without more analysis, this could indicate an infinte loop.
299 } else if (!L->contains(BB)) {
300 // Otherwise, this is a loop exit, this is fine so long as this is the
302 if (ExitBB != 0) return false;
307 // Otherwise, this is an unvisited intra-loop node. Check all successors.
308 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) {
309 // Check to see if the successor is a trivial loop exit.
310 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
314 // Okay, everything after this looks good, check to make sure that this block
315 // doesn't include any side effects.
316 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
317 if (I->mayHaveSideEffects())
323 /// isTrivialLoopExitBlock - Return true if the specified block unconditionally
324 /// leads to an exit from the specified loop, and has no side-effects in the
325 /// process. If so, return the block that is exited to, otherwise return null.
326 static BasicBlock *isTrivialLoopExitBlock(Loop *L, BasicBlock *BB) {
327 std::set<BasicBlock*> Visited;
328 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
329 BasicBlock *ExitBB = 0;
330 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
335 /// IsTrivialUnswitchCondition - Check to see if this unswitch condition is
336 /// trivial: that is, that the condition controls whether or not the loop does
337 /// anything at all. If this is a trivial condition, unswitching produces no
338 /// code duplications (equivalently, it produces a simpler loop and a new empty
339 /// loop, which gets deleted).
341 /// If this is a trivial condition, return true, otherwise return false. When
342 /// returning true, this sets Cond and Val to the condition that controls the
343 /// trivial condition: when Cond dynamically equals Val, the loop is known to
344 /// exit. Finally, this sets LoopExit to the BB that the loop exits to when
347 bool LoopUnswitch::IsTrivialUnswitchCondition(Value *Cond, Constant **Val,
348 BasicBlock **LoopExit) {
349 BasicBlock *Header = currentLoop->getHeader();
350 TerminatorInst *HeaderTerm = Header->getTerminator();
351 LLVMContext &Context = Header->getContext();
353 BasicBlock *LoopExitBB = 0;
354 if (BranchInst *BI = dyn_cast<BranchInst>(HeaderTerm)) {
355 // If the header block doesn't end with a conditional branch on Cond, we
357 if (!BI->isConditional() || BI->getCondition() != Cond)
360 // Check to see if a successor of the branch is guaranteed to
361 // exit through a unique exit block without having any
362 // side-effects. If so, determine the value of Cond that causes it to do
364 if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
365 BI->getSuccessor(0)))) {
366 if (Val) *Val = ConstantInt::getTrue(Context);
367 } else if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
368 BI->getSuccessor(1)))) {
369 if (Val) *Val = ConstantInt::getFalse(Context);
371 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(HeaderTerm)) {
372 // If this isn't a switch on Cond, we can't handle it.
373 if (SI->getCondition() != Cond) return false;
375 // Check to see if a successor of the switch is guaranteed to go to the
376 // latch block or exit through a one exit block without having any
377 // side-effects. If so, determine the value of Cond that causes it to do
378 // this. Note that we can't trivially unswitch on the default case.
379 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
380 if ((LoopExitBB = isTrivialLoopExitBlock(currentLoop,
381 SI->getSuccessor(i)))) {
382 // Okay, we found a trivial case, remember the value that is trivial.
383 if (Val) *Val = SI->getCaseValue(i);
388 // If we didn't find a single unique LoopExit block, or if the loop exit block
389 // contains phi nodes, this isn't trivial.
390 if (!LoopExitBB || isa<PHINode>(LoopExitBB->begin()))
391 return false; // Can't handle this.
393 if (LoopExit) *LoopExit = LoopExitBB;
395 // We already know that nothing uses any scalar values defined inside of this
396 // loop. As such, we just have to check to see if this loop will execute any
397 // side-effecting instructions (e.g. stores, calls, volatile loads) in the
398 // part of the loop that the code *would* execute. We already checked the
399 // tail, check the header now.
400 for (BasicBlock::iterator I = Header->begin(), E = Header->end(); I != E; ++I)
401 if (I->mayHaveSideEffects())
406 /// UnswitchIfProfitable - We have found that we can unswitch currentLoop when
407 /// LoopCond == Val to simplify the loop. If we decide that this is profitable,
408 /// unswitch the loop, reprocess the pieces, then return true.
409 bool LoopUnswitch::UnswitchIfProfitable(Value *LoopCond, Constant *Val) {
413 // If LoopSimplify was unable to form a preheader, don't do any unswitching.
417 Function *F = loopHeader->getParent();
419 Constant *CondVal = 0;
420 BasicBlock *ExitBlock = 0;
421 if (IsTrivialUnswitchCondition(LoopCond, &CondVal, &ExitBlock)) {
422 // If the condition is trivial, always unswitch. There is no code growth
424 UnswitchTrivialCondition(currentLoop, LoopCond, CondVal, ExitBlock);
428 // Check to see if it would be profitable to unswitch current loop.
430 // Do not do non-trivial unswitch while optimizing for size.
431 if (OptimizeForSize || F->hasFnAttr(Attribute::OptimizeForSize))
434 // FIXME: This is overly conservative because it does not take into
435 // consideration code simplification opportunities and code that can
436 // be shared by the resultant unswitched loops.
438 for (Loop::block_iterator I = currentLoop->block_begin(),
439 E = currentLoop->block_end();
441 Metrics.analyzeBasicBlock(*I);
443 // Limit the number of instructions to avoid causing significant code
444 // expansion, and the number of basic blocks, to avoid loops with
445 // large numbers of branches which cause loop unswitching to go crazy.
446 // This is a very ad-hoc heuristic.
447 if (Metrics.NumInsts > Threshold ||
448 Metrics.NumBlocks * 5 > Threshold ||
449 Metrics.containsIndirectBr || Metrics.isRecursive) {
450 DEBUG(dbgs() << "NOT unswitching loop %"
451 << currentLoop->getHeader()->getName() << ", cost too high: "
452 << currentLoop->getBlocks().size() << "\n");
456 UnswitchNontrivialCondition(LoopCond, Val, currentLoop);
460 /// CloneLoop - Recursively clone the specified loop and all of its children,
461 /// mapping the blocks with the specified map.
462 static Loop *CloneLoop(Loop *L, Loop *PL, ValueToValueMapTy &VM,
463 LoopInfo *LI, LPPassManager *LPM) {
464 Loop *New = new Loop();
465 LPM->insertLoop(New, PL);
467 // Add all of the blocks in L to the new loop.
468 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
470 if (LI->getLoopFor(*I) == L)
471 New->addBasicBlockToLoop(cast<BasicBlock>(VM[*I]), LI->getBase());
473 // Add all of the subloops to the new loop.
474 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
475 CloneLoop(*I, New, VM, LI, LPM);
480 /// EmitPreheaderBranchOnCondition - Emit a conditional branch on two values
481 /// if LIC == Val, branch to TrueDst, otherwise branch to FalseDest. Insert the
482 /// code immediately before InsertPt.
483 void LoopUnswitch::EmitPreheaderBranchOnCondition(Value *LIC, Constant *Val,
484 BasicBlock *TrueDest,
485 BasicBlock *FalseDest,
486 Instruction *InsertPt) {
487 // Insert a conditional branch on LIC to the two preheaders. The original
488 // code is the true version and the new code is the false version.
489 Value *BranchVal = LIC;
490 if (!isa<ConstantInt>(Val) ||
491 Val->getType() != Type::getInt1Ty(LIC->getContext()))
492 BranchVal = new ICmpInst(InsertPt, ICmpInst::ICMP_EQ, LIC, Val, "tmp");
493 else if (Val != ConstantInt::getTrue(Val->getContext()))
494 // We want to enter the new loop when the condition is true.
495 std::swap(TrueDest, FalseDest);
497 // Insert the new branch.
498 BranchInst *BI = BranchInst::Create(TrueDest, FalseDest, BranchVal, InsertPt);
500 // If either edge is critical, split it. This helps preserve LoopSimplify
501 // form for enclosing loops.
502 SplitCriticalEdge(BI, 0, this);
503 SplitCriticalEdge(BI, 1, this);
506 /// UnswitchTrivialCondition - Given a loop that has a trivial unswitchable
507 /// condition in it (a cond branch from its header block to its latch block,
508 /// where the path through the loop that doesn't execute its body has no
509 /// side-effects), unswitch it. This doesn't involve any code duplication, just
510 /// moving the conditional branch outside of the loop and updating loop info.
511 void LoopUnswitch::UnswitchTrivialCondition(Loop *L, Value *Cond,
513 BasicBlock *ExitBlock) {
514 DEBUG(dbgs() << "loop-unswitch: Trivial-Unswitch loop %"
515 << loopHeader->getName() << " [" << L->getBlocks().size()
516 << " blocks] in Function " << L->getHeader()->getParent()->getName()
517 << " on cond: " << *Val << " == " << *Cond << "\n");
519 // First step, split the preheader, so that we know that there is a safe place
520 // to insert the conditional branch. We will change loopPreheader to have a
521 // conditional branch on Cond.
522 BasicBlock *NewPH = SplitEdge(loopPreheader, loopHeader, this);
524 // Now that we have a place to insert the conditional branch, create a place
525 // to branch to: this is the exit block out of the loop that we should
528 // Split this block now, so that the loop maintains its exit block, and so
529 // that the jump from the preheader can execute the contents of the exit block
530 // without actually branching to it (the exit block should be dominated by the
531 // loop header, not the preheader).
532 assert(!L->contains(ExitBlock) && "Exit block is in the loop?");
533 BasicBlock *NewExit = SplitBlock(ExitBlock, ExitBlock->begin(), this);
535 // Okay, now we have a position to branch from and a position to branch to,
536 // insert the new conditional branch.
537 EmitPreheaderBranchOnCondition(Cond, Val, NewExit, NewPH,
538 loopPreheader->getTerminator());
539 LPM->deleteSimpleAnalysisValue(loopPreheader->getTerminator(), L);
540 loopPreheader->getTerminator()->eraseFromParent();
542 // We need to reprocess this loop, it could be unswitched again.
545 // Now that we know that the loop is never entered when this condition is a
546 // particular value, rewrite the loop with this info. We know that this will
547 // at least eliminate the old branch.
548 RewriteLoopBodyWithConditionConstant(L, Cond, Val, false);
552 /// SplitExitEdges - Split all of the edges from inside the loop to their exit
553 /// blocks. Update the appropriate Phi nodes as we do so.
554 void LoopUnswitch::SplitExitEdges(Loop *L,
555 const SmallVector<BasicBlock *, 8> &ExitBlocks){
557 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
558 BasicBlock *ExitBlock = ExitBlocks[i];
559 SmallVector<BasicBlock *, 4> Preds(pred_begin(ExitBlock),
560 pred_end(ExitBlock));
561 SplitBlockPredecessors(ExitBlock, Preds.data(), Preds.size(),
566 /// UnswitchNontrivialCondition - We determined that the loop is profitable
567 /// to unswitch when LIC equal Val. Split it into loop versions and test the
568 /// condition outside of either loop. Return the loops created as Out1/Out2.
569 void LoopUnswitch::UnswitchNontrivialCondition(Value *LIC, Constant *Val,
571 Function *F = loopHeader->getParent();
572 DEBUG(dbgs() << "loop-unswitch: Unswitching loop %"
573 << loopHeader->getName() << " [" << L->getBlocks().size()
574 << " blocks] in Function " << F->getName()
575 << " when '" << *Val << "' == " << *LIC << "\n");
580 // First step, split the preheader and exit blocks, and add these blocks to
581 // the LoopBlocks list.
582 BasicBlock *NewPreheader = SplitEdge(loopPreheader, loopHeader, this);
583 LoopBlocks.push_back(NewPreheader);
585 // We want the loop to come after the preheader, but before the exit blocks.
586 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end());
588 SmallVector<BasicBlock*, 8> ExitBlocks;
589 L->getUniqueExitBlocks(ExitBlocks);
591 // Split all of the edges from inside the loop to their exit blocks. Update
592 // the appropriate Phi nodes as we do so.
593 SplitExitEdges(L, ExitBlocks);
595 // The exit blocks may have been changed due to edge splitting, recompute.
597 L->getUniqueExitBlocks(ExitBlocks);
599 // Add exit blocks to the loop blocks.
600 LoopBlocks.insert(LoopBlocks.end(), ExitBlocks.begin(), ExitBlocks.end());
602 // Next step, clone all of the basic blocks that make up the loop (including
603 // the loop preheader and exit blocks), keeping track of the mapping between
604 // the instructions and blocks.
605 NewBlocks.reserve(LoopBlocks.size());
606 ValueToValueMapTy VMap;
607 for (unsigned i = 0, e = LoopBlocks.size(); i != e; ++i) {
608 BasicBlock *NewBB = CloneBasicBlock(LoopBlocks[i], VMap, ".us", F);
609 NewBlocks.push_back(NewBB);
610 VMap[LoopBlocks[i]] = NewBB; // Keep the BB mapping.
611 LPM->cloneBasicBlockSimpleAnalysis(LoopBlocks[i], NewBB, L);
614 // Splice the newly inserted blocks into the function right before the
615 // original preheader.
616 F->getBasicBlockList().splice(NewPreheader, F->getBasicBlockList(),
617 NewBlocks[0], F->end());
619 // Now we create the new Loop object for the versioned loop.
620 Loop *NewLoop = CloneLoop(L, L->getParentLoop(), VMap, LI, LPM);
621 Loop *ParentLoop = L->getParentLoop();
623 // Make sure to add the cloned preheader and exit blocks to the parent loop
625 ParentLoop->addBasicBlockToLoop(NewBlocks[0], LI->getBase());
628 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
629 BasicBlock *NewExit = cast<BasicBlock>(VMap[ExitBlocks[i]]);
630 // The new exit block should be in the same loop as the old one.
631 if (Loop *ExitBBLoop = LI->getLoopFor(ExitBlocks[i]))
632 ExitBBLoop->addBasicBlockToLoop(NewExit, LI->getBase());
634 assert(NewExit->getTerminator()->getNumSuccessors() == 1 &&
635 "Exit block should have been split to have one successor!");
636 BasicBlock *ExitSucc = NewExit->getTerminator()->getSuccessor(0);
638 // If the successor of the exit block had PHI nodes, add an entry for
641 for (BasicBlock::iterator I = ExitSucc->begin(); isa<PHINode>(I); ++I) {
642 PN = cast<PHINode>(I);
643 Value *V = PN->getIncomingValueForBlock(ExitBlocks[i]);
644 ValueToValueMapTy::iterator It = VMap.find(V);
645 if (It != VMap.end()) V = It->second;
646 PN->addIncoming(V, NewExit);
650 // Rewrite the code to refer to itself.
651 for (unsigned i = 0, e = NewBlocks.size(); i != e; ++i)
652 for (BasicBlock::iterator I = NewBlocks[i]->begin(),
653 E = NewBlocks[i]->end(); I != E; ++I)
654 RemapInstruction(I, VMap,RF_NoModuleLevelChanges|RF_IgnoreMissingEntries);
656 // Rewrite the original preheader to select between versions of the loop.
657 BranchInst *OldBR = cast<BranchInst>(loopPreheader->getTerminator());
658 assert(OldBR->isUnconditional() && OldBR->getSuccessor(0) == LoopBlocks[0] &&
659 "Preheader splitting did not work correctly!");
661 // Emit the new branch that selects between the two versions of this loop.
662 EmitPreheaderBranchOnCondition(LIC, Val, NewBlocks[0], LoopBlocks[0], OldBR);
663 LPM->deleteSimpleAnalysisValue(OldBR, L);
664 OldBR->eraseFromParent();
666 LoopProcessWorklist.push_back(NewLoop);
669 // Keep a WeakVH holding onto LIC. If the first call to RewriteLoopBody
670 // deletes the instruction (for example by simplifying a PHI that feeds into
671 // the condition that we're unswitching on), we don't rewrite the second
673 WeakVH LICHandle(LIC);
675 // Now we rewrite the original code to know that the condition is true and the
676 // new code to know that the condition is false.
677 RewriteLoopBodyWithConditionConstant(L, LIC, Val, false);
679 // It's possible that simplifying one loop could cause the other to be
680 // changed to another value or a constant. If its a constant, don't simplify
682 if (!LoopProcessWorklist.empty() && LoopProcessWorklist.back() == NewLoop &&
683 LICHandle && !isa<Constant>(LICHandle))
684 RewriteLoopBodyWithConditionConstant(NewLoop, LICHandle, Val, true);
687 /// RemoveFromWorklist - Remove all instances of I from the worklist vector
689 static void RemoveFromWorklist(Instruction *I,
690 std::vector<Instruction*> &Worklist) {
691 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(),
693 while (WI != Worklist.end()) {
694 unsigned Offset = WI-Worklist.begin();
696 WI = std::find(Worklist.begin()+Offset, Worklist.end(), I);
700 /// ReplaceUsesOfWith - When we find that I really equals V, remove I from the
701 /// program, replacing all uses with V and update the worklist.
702 static void ReplaceUsesOfWith(Instruction *I, Value *V,
703 std::vector<Instruction*> &Worklist,
704 Loop *L, LPPassManager *LPM) {
705 DEBUG(dbgs() << "Replace with '" << *V << "': " << *I);
707 // Add uses to the worklist, which may be dead now.
708 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
709 if (Instruction *Use = dyn_cast<Instruction>(I->getOperand(i)))
710 Worklist.push_back(Use);
712 // Add users to the worklist which may be simplified now.
713 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
715 Worklist.push_back(cast<Instruction>(*UI));
716 LPM->deleteSimpleAnalysisValue(I, L);
717 RemoveFromWorklist(I, Worklist);
718 I->replaceAllUsesWith(V);
719 I->eraseFromParent();
723 /// RemoveBlockIfDead - If the specified block is dead, remove it, update loop
724 /// information, and remove any dead successors it has.
726 void LoopUnswitch::RemoveBlockIfDead(BasicBlock *BB,
727 std::vector<Instruction*> &Worklist,
729 if (pred_begin(BB) != pred_end(BB)) {
730 // This block isn't dead, since an edge to BB was just removed, see if there
731 // are any easy simplifications we can do now.
732 if (BasicBlock *Pred = BB->getSinglePredecessor()) {
733 // If it has one pred, fold phi nodes in BB.
734 while (isa<PHINode>(BB->begin()))
735 ReplaceUsesOfWith(BB->begin(),
736 cast<PHINode>(BB->begin())->getIncomingValue(0),
739 // If this is the header of a loop and the only pred is the latch, we now
740 // have an unreachable loop.
741 if (Loop *L = LI->getLoopFor(BB))
742 if (loopHeader == BB && L->contains(Pred)) {
743 // Remove the branch from the latch to the header block, this makes
744 // the header dead, which will make the latch dead (because the header
745 // dominates the latch).
746 LPM->deleteSimpleAnalysisValue(Pred->getTerminator(), L);
747 Pred->getTerminator()->eraseFromParent();
748 new UnreachableInst(BB->getContext(), Pred);
750 // The loop is now broken, remove it from LI.
751 RemoveLoopFromHierarchy(L);
753 // Reprocess the header, which now IS dead.
754 RemoveBlockIfDead(BB, Worklist, L);
758 // If pred ends in a uncond branch, add uncond branch to worklist so that
759 // the two blocks will get merged.
760 if (BranchInst *BI = dyn_cast<BranchInst>(Pred->getTerminator()))
761 if (BI->isUnconditional())
762 Worklist.push_back(BI);
767 DEBUG(dbgs() << "Nuking dead block: " << *BB);
769 // Remove the instructions in the basic block from the worklist.
770 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
771 RemoveFromWorklist(I, Worklist);
773 // Anything that uses the instructions in this basic block should have their
774 // uses replaced with undefs.
775 // If I is not void type then replaceAllUsesWith undef.
776 // This allows ValueHandlers and custom metadata to adjust itself.
777 if (!I->getType()->isVoidTy())
778 I->replaceAllUsesWith(UndefValue::get(I->getType()));
781 // If this is the edge to the header block for a loop, remove the loop and
782 // promote all subloops.
783 if (Loop *BBLoop = LI->getLoopFor(BB)) {
784 if (BBLoop->getLoopLatch() == BB)
785 RemoveLoopFromHierarchy(BBLoop);
788 // Remove the block from the loop info, which removes it from any loops it
793 // Remove phi node entries in successors for this block.
794 TerminatorInst *TI = BB->getTerminator();
795 SmallVector<BasicBlock*, 4> Succs;
796 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
797 Succs.push_back(TI->getSuccessor(i));
798 TI->getSuccessor(i)->removePredecessor(BB);
801 // Unique the successors, remove anything with multiple uses.
802 array_pod_sort(Succs.begin(), Succs.end());
803 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end());
805 // Remove the basic block, including all of the instructions contained in it.
806 LPM->deleteSimpleAnalysisValue(BB, L);
807 BB->eraseFromParent();
808 // Remove successor blocks here that are not dead, so that we know we only
809 // have dead blocks in this list. Nondead blocks have a way of becoming dead,
810 // then getting removed before we revisit them, which is badness.
812 for (unsigned i = 0; i != Succs.size(); ++i)
813 if (pred_begin(Succs[i]) != pred_end(Succs[i])) {
814 // One exception is loop headers. If this block was the preheader for a
815 // loop, then we DO want to visit the loop so the loop gets deleted.
816 // We know that if the successor is a loop header, that this loop had to
817 // be the preheader: the case where this was the latch block was handled
818 // above and headers can only have two predecessors.
819 if (!LI->isLoopHeader(Succs[i])) {
820 Succs.erase(Succs.begin()+i);
825 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
826 RemoveBlockIfDead(Succs[i], Worklist, L);
829 /// RemoveLoopFromHierarchy - We have discovered that the specified loop has
830 /// become unwrapped, either because the backedge was deleted, or because the
831 /// edge into the header was removed. If the edge into the header from the
832 /// latch block was removed, the loop is unwrapped but subloops are still alive,
833 /// so they just reparent loops. If the loops are actually dead, they will be
835 void LoopUnswitch::RemoveLoopFromHierarchy(Loop *L) {
836 LPM->deleteLoopFromQueue(L);
837 RemoveLoopFromWorklist(L);
840 // RewriteLoopBodyWithConditionConstant - We know either that the value LIC has
841 // the value specified by Val in the specified loop, or we know it does NOT have
842 // that value. Rewrite any uses of LIC or of properties correlated to it.
843 void LoopUnswitch::RewriteLoopBodyWithConditionConstant(Loop *L, Value *LIC,
846 assert(!isa<Constant>(LIC) && "Why are we unswitching on a constant?");
848 // FIXME: Support correlated properties, like:
855 // FOLD boolean conditions (X|LIC), (X&LIC). Fold conditional branches,
856 // selects, switches.
857 std::vector<User*> Users(LIC->use_begin(), LIC->use_end());
858 std::vector<Instruction*> Worklist;
859 LLVMContext &Context = Val->getContext();
862 // If we know that LIC == Val, or that LIC == NotVal, just replace uses of LIC
863 // in the loop with the appropriate one directly.
864 if (IsEqual || (isa<ConstantInt>(Val) &&
865 Val->getType()->isIntegerTy(1))) {
870 Replacement = ConstantInt::get(Type::getInt1Ty(Val->getContext()),
871 !cast<ConstantInt>(Val)->getZExtValue());
873 for (unsigned i = 0, e = Users.size(); i != e; ++i)
874 if (Instruction *U = cast<Instruction>(Users[i])) {
877 U->replaceUsesOfWith(LIC, Replacement);
878 Worklist.push_back(U);
880 SimplifyCode(Worklist, L);
884 // Otherwise, we don't know the precise value of LIC, but we do know that it
885 // is certainly NOT "Val". As such, simplify any uses in the loop that we
886 // can. This case occurs when we unswitch switch statements.
887 for (unsigned i = 0, e = Users.size(); i != e; ++i) {
888 Instruction *U = cast<Instruction>(Users[i]);
892 Worklist.push_back(U);
894 // TODO: We could do other simplifications, for example, turning
895 // 'icmp eq LIC, Val' -> false.
897 // If we know that LIC is not Val, use this info to simplify code.
898 SwitchInst *SI = dyn_cast<SwitchInst>(U);
899 if (SI == 0 || !isa<ConstantInt>(Val)) continue;
901 unsigned DeadCase = SI->findCaseValue(cast<ConstantInt>(Val));
902 if (DeadCase == 0) continue; // Default case is live for multiple values.
904 // Found a dead case value. Don't remove PHI nodes in the
905 // successor if they become single-entry, those PHI nodes may
906 // be in the Users list.
908 // FIXME: This is a hack. We need to keep the successor around
909 // and hooked up so as to preserve the loop structure, because
910 // trying to update it is complicated. So instead we preserve the
911 // loop structure and put the block on a dead code path.
912 BasicBlock *Switch = SI->getParent();
913 SplitEdge(Switch, SI->getSuccessor(DeadCase), this);
914 // Compute the successors instead of relying on the return value
915 // of SplitEdge, since it may have split the switch successor
917 BasicBlock *NewSISucc = SI->getSuccessor(DeadCase);
918 BasicBlock *OldSISucc = *succ_begin(NewSISucc);
919 // Create an "unreachable" destination.
920 BasicBlock *Abort = BasicBlock::Create(Context, "us-unreachable",
923 new UnreachableInst(Context, Abort);
924 // Force the new case destination to branch to the "unreachable"
925 // block while maintaining a (dead) CFG edge to the old block.
926 NewSISucc->getTerminator()->eraseFromParent();
927 BranchInst::Create(Abort, OldSISucc,
928 ConstantInt::getTrue(Context), NewSISucc);
929 // Release the PHI operands for this edge.
930 for (BasicBlock::iterator II = NewSISucc->begin();
931 PHINode *PN = dyn_cast<PHINode>(II); ++II)
932 PN->setIncomingValue(PN->getBasicBlockIndex(Switch),
933 UndefValue::get(PN->getType()));
934 // Tell the domtree about the new block. We don't fully update the
935 // domtree here -- instead we force it to do a full recomputation
936 // after the pass is complete -- but we do need to inform it of
939 DT->addNewBlock(Abort, NewSISucc);
942 SimplifyCode(Worklist, L);
945 /// SimplifyCode - Okay, now that we have simplified some instructions in the
946 /// loop, walk over it and constant prop, dce, and fold control flow where
947 /// possible. Note that this is effectively a very simple loop-structure-aware
948 /// optimizer. During processing of this loop, L could very well be deleted, so
949 /// it must not be used.
951 /// FIXME: When the loop optimizer is more mature, separate this out to a new
954 void LoopUnswitch::SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) {
955 while (!Worklist.empty()) {
956 Instruction *I = Worklist.back();
960 if (isInstructionTriviallyDead(I)) {
961 DEBUG(dbgs() << "Remove dead instruction '" << *I);
963 // Add uses to the worklist, which may be dead now.
964 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
965 if (Instruction *Use = dyn_cast<Instruction>(I->getOperand(i)))
966 Worklist.push_back(Use);
967 LPM->deleteSimpleAnalysisValue(I, L);
968 RemoveFromWorklist(I, Worklist);
969 I->eraseFromParent();
974 // See if instruction simplification can hack this up. This is common for
975 // things like "select false, X, Y" after unswitching made the condition be
977 if (Value *V = SimplifyInstruction(I, 0, DT))
978 if (LI->replacementPreservesLCSSAForm(I, V)) {
979 ReplaceUsesOfWith(I, V, Worklist, L, LPM);
983 // Special case hacks that appear commonly in unswitched code.
984 if (BranchInst *BI = dyn_cast<BranchInst>(I)) {
985 if (BI->isUnconditional()) {
986 // If BI's parent is the only pred of the successor, fold the two blocks
988 BasicBlock *Pred = BI->getParent();
989 BasicBlock *Succ = BI->getSuccessor(0);
990 BasicBlock *SinglePred = Succ->getSinglePredecessor();
991 if (!SinglePred) continue; // Nothing to do.
992 assert(SinglePred == Pred && "CFG broken");
994 DEBUG(dbgs() << "Merging blocks: " << Pred->getName() << " <- "
995 << Succ->getName() << "\n");
997 // Resolve any single entry PHI nodes in Succ.
998 while (PHINode *PN = dyn_cast<PHINode>(Succ->begin()))
999 ReplaceUsesOfWith(PN, PN->getIncomingValue(0), Worklist, L, LPM);
1001 // Move all of the successor contents from Succ to Pred.
1002 Pred->getInstList().splice(BI, Succ->getInstList(), Succ->begin(),
1004 LPM->deleteSimpleAnalysisValue(BI, L);
1005 BI->eraseFromParent();
1006 RemoveFromWorklist(BI, Worklist);
1008 // If Succ has any successors with PHI nodes, update them to have
1009 // entries coming from Pred instead of Succ.
1010 Succ->replaceAllUsesWith(Pred);
1012 // Remove Succ from the loop tree.
1013 LI->removeBlock(Succ);
1014 LPM->deleteSimpleAnalysisValue(Succ, L);
1015 Succ->eraseFromParent();
1020 if (ConstantInt *CB = dyn_cast<ConstantInt>(BI->getCondition())){
1021 // Conditional branch. Turn it into an unconditional branch, then
1022 // remove dead blocks.
1023 continue; // FIXME: Enable.
1025 DEBUG(dbgs() << "Folded branch: " << *BI);
1026 BasicBlock *DeadSucc = BI->getSuccessor(CB->getZExtValue());
1027 BasicBlock *LiveSucc = BI->getSuccessor(!CB->getZExtValue());
1028 DeadSucc->removePredecessor(BI->getParent(), true);
1029 Worklist.push_back(BranchInst::Create(LiveSucc, BI));
1030 LPM->deleteSimpleAnalysisValue(BI, L);
1031 BI->eraseFromParent();
1032 RemoveFromWorklist(BI, Worklist);
1035 RemoveBlockIfDead(DeadSucc, Worklist, L);