1 //===- LoopSimplify.cpp - Loop Canonicalization Pass ----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass performs several transformations to transform natural loops into a
11 // simpler form, which makes subsequent analyses and transformations simpler and
14 // Loop pre-header insertion guarantees that there is a single, non-critical
15 // entry edge from outside of the loop to the loop header. This simplifies a
16 // number of analyses and transformations, such as LICM.
18 // Loop exit-block insertion guarantees that all exit blocks from the loop
19 // (blocks which are outside of the loop that have predecessors inside of the
20 // loop) only have predecessors from inside of the loop (and are thus dominated
21 // by the loop header). This simplifies transformations such as store-sinking
22 // that are built into LICM.
24 // This pass also guarantees that loops will have exactly one backedge.
26 // Indirectbr instructions introduce several complications. If the loop
27 // contains or is entered by an indirectbr instruction, it may not be possible
28 // to transform the loop and make these guarantees. Client code should check
29 // that these conditions are true before relying on them.
31 // Note that the simplifycfg pass will clean up blocks which are split out but
32 // end up being unnecessary, so usage of this pass should not pessimize
35 // This pass obviously modifies the CFG, but updates loop information and
36 // dominator information.
38 //===----------------------------------------------------------------------===//
40 #define DEBUG_TYPE "loop-simplify"
41 #include "llvm/Transforms/Scalar.h"
42 #include "llvm/Constants.h"
43 #include "llvm/Instructions.h"
44 #include "llvm/IntrinsicInst.h"
45 #include "llvm/Function.h"
46 #include "llvm/LLVMContext.h"
47 #include "llvm/Type.h"
48 #include "llvm/Analysis/AliasAnalysis.h"
49 #include "llvm/Analysis/Dominators.h"
50 #include "llvm/Analysis/InstructionSimplify.h"
51 #include "llvm/Analysis/LoopPass.h"
52 #include "llvm/Analysis/ScalarEvolution.h"
53 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
54 #include "llvm/Transforms/Utils/Local.h"
55 #include "llvm/Support/CFG.h"
56 #include "llvm/Support/Debug.h"
57 #include "llvm/ADT/SetOperations.h"
58 #include "llvm/ADT/SetVector.h"
59 #include "llvm/ADT/Statistic.h"
60 #include "llvm/ADT/DepthFirstIterator.h"
63 STATISTIC(NumInserted, "Number of pre-header or exit blocks inserted");
64 STATISTIC(NumNested , "Number of nested loops split out");
67 struct LoopSimplify : public LoopPass {
68 static char ID; // Pass identification, replacement for typeid
69 LoopSimplify() : LoopPass(ID) {
70 initializeLoopSimplifyPass(*PassRegistry::getPassRegistry());
73 // AA - If we have an alias analysis object to update, this is it, otherwise
80 virtual bool runOnLoop(Loop *L, LPPassManager &LPM);
82 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
83 // We need loop information to identify the loops...
84 AU.addRequired<DominatorTree>();
85 AU.addPreserved<DominatorTree>();
87 AU.addRequired<LoopInfo>();
88 AU.addPreserved<LoopInfo>();
90 AU.addPreserved<AliasAnalysis>();
91 AU.addPreserved<ScalarEvolution>();
92 AU.addPreservedID(BreakCriticalEdgesID); // No critical edges added.
95 /// verifyAnalysis() - Verify LoopSimplifyForm's guarantees.
96 void verifyAnalysis() const;
99 bool ProcessLoop(Loop *L, LPPassManager &LPM);
100 BasicBlock *RewriteLoopExitBlock(Loop *L, BasicBlock *Exit);
101 BasicBlock *InsertPreheaderForLoop(Loop *L);
102 Loop *SeparateNestedLoop(Loop *L, LPPassManager &LPM,
103 BasicBlock *Preheader);
104 BasicBlock *InsertUniqueBackedgeBlock(Loop *L, BasicBlock *Preheader);
105 void PlaceSplitBlockCarefully(BasicBlock *NewBB,
106 SmallVectorImpl<BasicBlock*> &SplitPreds,
111 char LoopSimplify::ID = 0;
112 INITIALIZE_PASS_BEGIN(LoopSimplify, "loop-simplify",
113 "Canonicalize natural loops", true, false)
114 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
115 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
116 INITIALIZE_PASS_END(LoopSimplify, "loop-simplify",
117 "Canonicalize natural loops", true, false)
119 // Publicly exposed interface to pass...
120 char &llvm::LoopSimplifyID = LoopSimplify::ID;
121 Pass *llvm::createLoopSimplifyPass() { return new LoopSimplify(); }
123 /// runOnLoop - Run down all loops in the CFG (recursively, but we could do
124 /// it in any convenient order) inserting preheaders...
126 bool LoopSimplify::runOnLoop(Loop *l, LPPassManager &LPM) {
128 bool Changed = false;
129 LI = &getAnalysis<LoopInfo>();
130 AA = getAnalysisIfAvailable<AliasAnalysis>();
131 DT = &getAnalysis<DominatorTree>();
132 SE = getAnalysisIfAvailable<ScalarEvolution>();
134 Changed |= ProcessLoop(L, LPM);
139 /// ProcessLoop - Walk the loop structure in depth first order, ensuring that
140 /// all loops have preheaders.
142 bool LoopSimplify::ProcessLoop(Loop *L, LPPassManager &LPM) {
143 bool Changed = false;
146 // Check to see that no blocks (other than the header) in this loop have
147 // predecessors that are not in the loop. This is not valid for natural
148 // loops, but can occur if the blocks are unreachable. Since they are
149 // unreachable we can just shamelessly delete those CFG edges!
150 for (Loop::block_iterator BB = L->block_begin(), E = L->block_end();
152 if (*BB == L->getHeader()) continue;
154 SmallPtrSet<BasicBlock*, 4> BadPreds;
155 for (pred_iterator PI = pred_begin(*BB),
156 PE = pred_end(*BB); PI != PE; ++PI) {
162 // Delete each unique out-of-loop (and thus dead) predecessor.
163 for (SmallPtrSet<BasicBlock*, 4>::iterator I = BadPreds.begin(),
164 E = BadPreds.end(); I != E; ++I) {
166 DEBUG(dbgs() << "LoopSimplify: Deleting edge from dead predecessor "
167 << (*I)->getName() << "\n");
169 // Inform each successor of each dead pred.
170 for (succ_iterator SI = succ_begin(*I), SE = succ_end(*I); SI != SE; ++SI)
171 (*SI)->removePredecessor(*I);
172 // Zap the dead pred's terminator and replace it with unreachable.
173 TerminatorInst *TI = (*I)->getTerminator();
174 TI->replaceAllUsesWith(UndefValue::get(TI->getType()));
175 (*I)->getTerminator()->eraseFromParent();
176 new UnreachableInst((*I)->getContext(), *I);
181 // If there are exiting blocks with branches on undef, resolve the undef in
182 // the direction which will exit the loop. This will help simplify loop
183 // trip count computations.
184 SmallVector<BasicBlock*, 8> ExitingBlocks;
185 L->getExitingBlocks(ExitingBlocks);
186 for (SmallVectorImpl<BasicBlock *>::iterator I = ExitingBlocks.begin(),
187 E = ExitingBlocks.end(); I != E; ++I)
188 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator()))
189 if (BI->isConditional()) {
190 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) {
192 DEBUG(dbgs() << "LoopSimplify: Resolving \"br i1 undef\" to exit in "
193 << (*I)->getName() << "\n");
195 BI->setCondition(ConstantInt::get(Cond->getType(),
196 !L->contains(BI->getSuccessor(0))));
201 // Does the loop already have a preheader? If so, don't insert one.
202 BasicBlock *Preheader = L->getLoopPreheader();
204 Preheader = InsertPreheaderForLoop(L);
211 // Next, check to make sure that all exit nodes of the loop only have
212 // predecessors that are inside of the loop. This check guarantees that the
213 // loop preheader/header will dominate the exit blocks. If the exit block has
214 // predecessors from outside of the loop, split the edge now.
215 SmallVector<BasicBlock*, 8> ExitBlocks;
216 L->getExitBlocks(ExitBlocks);
218 SmallSetVector<BasicBlock *, 8> ExitBlockSet(ExitBlocks.begin(),
220 for (SmallSetVector<BasicBlock *, 8>::iterator I = ExitBlockSet.begin(),
221 E = ExitBlockSet.end(); I != E; ++I) {
222 BasicBlock *ExitBlock = *I;
223 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock);
225 // Must be exactly this loop: no subloops, parent loops, or non-loop preds
227 if (!L->contains(*PI)) {
228 if (RewriteLoopExitBlock(L, ExitBlock)) {
236 // If the header has more than two predecessors at this point (from the
237 // preheader and from multiple backedges), we must adjust the loop.
238 BasicBlock *LoopLatch = L->getLoopLatch();
240 // If this is really a nested loop, rip it out into a child loop. Don't do
241 // this for loops with a giant number of backedges, just factor them into a
242 // common backedge instead.
243 if (L->getNumBackEdges() < 8) {
244 if (SeparateNestedLoop(L, LPM, Preheader)) {
246 // This is a big restructuring change, reprocess the whole loop.
248 // GCC doesn't tail recursion eliminate this.
253 // If we either couldn't, or didn't want to, identify nesting of the loops,
254 // insert a new block that all backedges target, then make it jump to the
256 LoopLatch = InsertUniqueBackedgeBlock(L, Preheader);
263 // Scan over the PHI nodes in the loop header. Since they now have only two
264 // incoming values (the loop is canonicalized), we may have simplified the PHI
265 // down to 'X = phi [X, Y]', which should be replaced with 'Y'.
267 for (BasicBlock::iterator I = L->getHeader()->begin();
268 (PN = dyn_cast<PHINode>(I++)); )
269 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
270 if (AA) AA->deleteValue(PN);
271 if (SE) SE->forgetValue(PN);
272 PN->replaceAllUsesWith(V);
273 PN->eraseFromParent();
276 // If this loop has multiple exits and the exits all go to the same
277 // block, attempt to merge the exits. This helps several passes, such
278 // as LoopRotation, which do not support loops with multiple exits.
279 // SimplifyCFG also does this (and this code uses the same utility
280 // function), however this code is loop-aware, where SimplifyCFG is
281 // not. That gives it the advantage of being able to hoist
282 // loop-invariant instructions out of the way to open up more
283 // opportunities, and the disadvantage of having the responsibility
284 // to preserve dominator information.
285 bool UniqueExit = true;
286 if (!ExitBlocks.empty())
287 for (unsigned i = 1, e = ExitBlocks.size(); i != e; ++i)
288 if (ExitBlocks[i] != ExitBlocks[0]) {
293 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
294 BasicBlock *ExitingBlock = ExitingBlocks[i];
295 if (!ExitingBlock->getSinglePredecessor()) continue;
296 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
297 if (!BI || !BI->isConditional()) continue;
298 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
299 if (!CI || CI->getParent() != ExitingBlock) continue;
301 // Attempt to hoist out all instructions except for the
302 // comparison and the branch.
303 bool AllInvariant = true;
304 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
305 Instruction *Inst = I++;
306 // Skip debug info intrinsics.
307 if (isa<DbgInfoIntrinsic>(Inst))
311 if (!L->makeLoopInvariant(Inst, Changed,
312 Preheader ? Preheader->getTerminator() : 0)) {
313 AllInvariant = false;
317 if (!AllInvariant) continue;
319 // The block has now been cleared of all instructions except for
320 // a comparison and a conditional branch. SimplifyCFG may be able
322 if (!FoldBranchToCommonDest(BI)) continue;
324 // Success. The block is now dead, so remove it from the loop,
325 // update the dominator tree and delete it.
326 DEBUG(dbgs() << "LoopSimplify: Eliminating exiting block "
327 << ExitingBlock->getName() << "\n");
329 // If any reachable control flow within this loop has changed, notify
330 // ScalarEvolution. Currently assume the parent loop doesn't change
331 // (spliting edges doesn't count). If blocks, CFG edges, or other values
332 // in the parent loop change, then we need call to forgetLoop() for the
337 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock));
339 LI->removeBlock(ExitingBlock);
341 DomTreeNode *Node = DT->getNode(ExitingBlock);
342 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
344 while (!Children.empty()) {
345 DomTreeNode *Child = Children.front();
346 DT->changeImmediateDominator(Child, Node->getIDom());
348 DT->eraseNode(ExitingBlock);
350 BI->getSuccessor(0)->removePredecessor(ExitingBlock);
351 BI->getSuccessor(1)->removePredecessor(ExitingBlock);
352 ExitingBlock->eraseFromParent();
359 /// InsertPreheaderForLoop - Once we discover that a loop doesn't have a
360 /// preheader, this method is called to insert one. This method has two phases:
361 /// preheader insertion and analysis updating.
363 BasicBlock *LoopSimplify::InsertPreheaderForLoop(Loop *L) {
364 BasicBlock *Header = L->getHeader();
366 // Compute the set of predecessors of the loop that are not in the loop.
367 SmallVector<BasicBlock*, 8> OutsideBlocks;
368 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
371 if (!L->contains(P)) { // Coming in from outside the loop?
372 // If the loop is branched to from an indirect branch, we won't
373 // be able to fully transform the loop, because it prohibits
375 if (isa<IndirectBrInst>(P->getTerminator())) return 0;
378 OutsideBlocks.push_back(P);
382 // Split out the loop pre-header.
383 BasicBlock *PreheaderBB;
384 if (!Header->isLandingPad()) {
385 PreheaderBB = SplitBlockPredecessors(Header, OutsideBlocks, ".preheader",
388 SmallVector<BasicBlock*, 2> NewBBs;
389 SplitLandingPadPredecessors(Header, OutsideBlocks, ".preheader",
390 ".split-lp", this, NewBBs);
391 PreheaderBB = NewBBs[0];
394 PreheaderBB->getTerminator()->setDebugLoc(
395 Header->getFirstNonPHI()->getDebugLoc());
396 DEBUG(dbgs() << "LoopSimplify: Creating pre-header "
397 << PreheaderBB->getName() << "\n");
399 // Make sure that NewBB is put someplace intelligent, which doesn't mess up
400 // code layout too horribly.
401 PlaceSplitBlockCarefully(PreheaderBB, OutsideBlocks, L);
406 /// RewriteLoopExitBlock - Ensure that the loop preheader dominates all exit
407 /// blocks. This method is used to split exit blocks that have predecessors
408 /// outside of the loop.
409 BasicBlock *LoopSimplify::RewriteLoopExitBlock(Loop *L, BasicBlock *Exit) {
410 SmallVector<BasicBlock*, 8> LoopBlocks;
411 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) {
413 if (L->contains(P)) {
414 // Don't do this if the loop is exited via an indirect branch.
415 if (isa<IndirectBrInst>(P->getTerminator())) return 0;
417 LoopBlocks.push_back(P);
421 assert(!LoopBlocks.empty() && "No edges coming in from outside the loop?");
422 BasicBlock *NewExitBB = 0;
424 if (Exit->isLandingPad()) {
425 SmallVector<BasicBlock*, 2> NewBBs;
426 SplitLandingPadPredecessors(Exit, ArrayRef<BasicBlock*>(&LoopBlocks[0],
428 ".loopexit", ".nonloopexit",
430 NewExitBB = NewBBs[0];
432 NewExitBB = SplitBlockPredecessors(Exit, LoopBlocks, ".loopexit", this);
435 DEBUG(dbgs() << "LoopSimplify: Creating dedicated exit block "
436 << NewExitBB->getName() << "\n");
440 /// AddBlockAndPredsToSet - Add the specified block, and all of its
441 /// predecessors, to the specified set, if it's not already in there. Stop
442 /// predecessor traversal when we reach StopBlock.
443 static void AddBlockAndPredsToSet(BasicBlock *InputBB, BasicBlock *StopBlock,
444 std::set<BasicBlock*> &Blocks) {
445 std::vector<BasicBlock *> WorkList;
446 WorkList.push_back(InputBB);
448 BasicBlock *BB = WorkList.back(); WorkList.pop_back();
449 if (Blocks.insert(BB).second && BB != StopBlock)
450 // If BB is not already processed and it is not a stop block then
451 // insert its predecessor in the work list
452 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
453 BasicBlock *WBB = *I;
454 WorkList.push_back(WBB);
456 } while(!WorkList.empty());
459 /// FindPHIToPartitionLoops - The first part of loop-nestification is to find a
460 /// PHI node that tells us how to partition the loops.
461 static PHINode *FindPHIToPartitionLoops(Loop *L, DominatorTree *DT,
462 AliasAnalysis *AA, LoopInfo *LI) {
463 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ) {
464 PHINode *PN = cast<PHINode>(I);
466 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
467 // This is a degenerate PHI already, don't modify it!
468 PN->replaceAllUsesWith(V);
469 if (AA) AA->deleteValue(PN);
470 PN->eraseFromParent();
474 // Scan this PHI node looking for a use of the PHI node by itself.
475 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
476 if (PN->getIncomingValue(i) == PN &&
477 L->contains(PN->getIncomingBlock(i)))
478 // We found something tasty to remove.
484 // PlaceSplitBlockCarefully - If the block isn't already, move the new block to
485 // right after some 'outside block' block. This prevents the preheader from
486 // being placed inside the loop body, e.g. when the loop hasn't been rotated.
487 void LoopSimplify::PlaceSplitBlockCarefully(BasicBlock *NewBB,
488 SmallVectorImpl<BasicBlock*> &SplitPreds,
490 // Check to see if NewBB is already well placed.
491 Function::iterator BBI = NewBB; --BBI;
492 for (unsigned i = 0, e = SplitPreds.size(); i != e; ++i) {
493 if (&*BBI == SplitPreds[i])
497 // If it isn't already after an outside block, move it after one. This is
498 // always good as it makes the uncond branch from the outside block into a
501 // Figure out *which* outside block to put this after. Prefer an outside
502 // block that neighbors a BB actually in the loop.
503 BasicBlock *FoundBB = 0;
504 for (unsigned i = 0, e = SplitPreds.size(); i != e; ++i) {
505 Function::iterator BBI = SplitPreds[i];
506 if (++BBI != NewBB->getParent()->end() &&
508 FoundBB = SplitPreds[i];
513 // If our heuristic for a *good* bb to place this after doesn't find
514 // anything, just pick something. It's likely better than leaving it within
517 FoundBB = SplitPreds[0];
518 NewBB->moveAfter(FoundBB);
522 /// SeparateNestedLoop - If this loop has multiple backedges, try to pull one of
523 /// them out into a nested loop. This is important for code that looks like
528 /// br cond, Loop, Next
530 /// br cond2, Loop, Out
532 /// To identify this common case, we look at the PHI nodes in the header of the
533 /// loop. PHI nodes with unchanging values on one backedge correspond to values
534 /// that change in the "outer" loop, but not in the "inner" loop.
536 /// If we are able to separate out a loop, return the new outer loop that was
539 Loop *LoopSimplify::SeparateNestedLoop(Loop *L, LPPassManager &LPM,
540 BasicBlock *Preheader) {
541 // Don't try to separate loops without a preheader (this excludes
542 // loop headers which are targeted by an indirectbr).
546 // The header is not a landing pad; preheader insertion should ensure this.
547 assert(!L->getHeader()->isLandingPad() &&
548 "Can't insert backedge to landing pad");
550 PHINode *PN = FindPHIToPartitionLoops(L, DT, AA, LI);
551 if (PN == 0) return 0; // No known way to partition.
553 // Pull out all predecessors that have varying values in the loop. This
554 // handles the case when a PHI node has multiple instances of itself as
556 SmallVector<BasicBlock*, 8> OuterLoopPreds;
557 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
558 if (PN->getIncomingValue(i) != PN ||
559 !L->contains(PN->getIncomingBlock(i)))
560 OuterLoopPreds.push_back(PN->getIncomingBlock(i));
562 DEBUG(dbgs() << "LoopSimplify: Splitting out a new outer loop\n");
564 // If ScalarEvolution is around and knows anything about values in
565 // this loop, tell it to forget them, because we're about to
566 // substantially change it.
570 BasicBlock *Header = L->getHeader();
572 SplitBlockPredecessors(Header, OuterLoopPreds, ".outer", this);
574 // Make sure that NewBB is put someplace intelligent, which doesn't mess up
575 // code layout too horribly.
576 PlaceSplitBlockCarefully(NewBB, OuterLoopPreds, L);
578 // Create the new outer loop.
579 Loop *NewOuter = new Loop();
581 // Change the parent loop to use the outer loop as its child now.
582 if (Loop *Parent = L->getParentLoop())
583 Parent->replaceChildLoopWith(L, NewOuter);
585 LI->changeTopLevelLoop(L, NewOuter);
587 // L is now a subloop of our outer loop.
588 NewOuter->addChildLoop(L);
590 // Add the new loop to the pass manager queue.
591 LPM.insertLoopIntoQueue(NewOuter);
593 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
595 NewOuter->addBlockEntry(*I);
597 // Now reset the header in L, which had been moved by
598 // SplitBlockPredecessors for the outer loop.
599 L->moveToHeader(Header);
601 // Determine which blocks should stay in L and which should be moved out to
602 // the Outer loop now.
603 std::set<BasicBlock*> BlocksInL;
604 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) {
606 if (DT->dominates(Header, P))
607 AddBlockAndPredsToSet(P, Header, BlocksInL);
610 // Scan all of the loop children of L, moving them to OuterLoop if they are
611 // not part of the inner loop.
612 const std::vector<Loop*> &SubLoops = L->getSubLoops();
613 for (size_t I = 0; I != SubLoops.size(); )
614 if (BlocksInL.count(SubLoops[I]->getHeader()))
615 ++I; // Loop remains in L
617 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I));
619 // Now that we know which blocks are in L and which need to be moved to
620 // OuterLoop, move any blocks that need it.
621 for (unsigned i = 0; i != L->getBlocks().size(); ++i) {
622 BasicBlock *BB = L->getBlocks()[i];
623 if (!BlocksInL.count(BB)) {
624 // Move this block to the parent, updating the exit blocks sets
625 L->removeBlockFromLoop(BB);
627 LI->changeLoopFor(BB, NewOuter);
637 /// InsertUniqueBackedgeBlock - This method is called when the specified loop
638 /// has more than one backedge in it. If this occurs, revector all of these
639 /// backedges to target a new basic block and have that block branch to the loop
640 /// header. This ensures that loops have exactly one backedge.
643 LoopSimplify::InsertUniqueBackedgeBlock(Loop *L, BasicBlock *Preheader) {
644 assert(L->getNumBackEdges() > 1 && "Must have > 1 backedge!");
646 // Get information about the loop
647 BasicBlock *Header = L->getHeader();
648 Function *F = Header->getParent();
650 // Unique backedge insertion currently depends on having a preheader.
654 // The header is not a landing pad; preheader insertion should ensure this.
655 assert(!Header->isLandingPad() && "Can't insert backedge to landing pad");
657 // Figure out which basic blocks contain back-edges to the loop header.
658 std::vector<BasicBlock*> BackedgeBlocks;
659 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){
662 // Indirectbr edges cannot be split, so we must fail if we find one.
663 if (isa<IndirectBrInst>(P->getTerminator()))
666 if (P != Preheader) BackedgeBlocks.push_back(P);
669 // Create and insert the new backedge block...
670 BasicBlock *BEBlock = BasicBlock::Create(Header->getContext(),
671 Header->getName()+".backedge", F);
672 BranchInst *BETerminator = BranchInst::Create(Header, BEBlock);
674 DEBUG(dbgs() << "LoopSimplify: Inserting unique backedge block "
675 << BEBlock->getName() << "\n");
677 // Move the new backedge block to right after the last backedge block.
678 Function::iterator InsertPos = BackedgeBlocks.back(); ++InsertPos;
679 F->getBasicBlockList().splice(InsertPos, F->getBasicBlockList(), BEBlock);
681 // Now that the block has been inserted into the function, create PHI nodes in
682 // the backedge block which correspond to any PHI nodes in the header block.
683 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
684 PHINode *PN = cast<PHINode>(I);
685 PHINode *NewPN = PHINode::Create(PN->getType(), BackedgeBlocks.size(),
686 PN->getName()+".be", BETerminator);
687 if (AA) AA->copyValue(PN, NewPN);
689 // Loop over the PHI node, moving all entries except the one for the
690 // preheader over to the new PHI node.
691 unsigned PreheaderIdx = ~0U;
692 bool HasUniqueIncomingValue = true;
693 Value *UniqueValue = 0;
694 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
695 BasicBlock *IBB = PN->getIncomingBlock(i);
696 Value *IV = PN->getIncomingValue(i);
697 if (IBB == Preheader) {
700 NewPN->addIncoming(IV, IBB);
701 if (HasUniqueIncomingValue) {
702 if (UniqueValue == 0)
704 else if (UniqueValue != IV)
705 HasUniqueIncomingValue = false;
710 // Delete all of the incoming values from the old PN except the preheader's
711 assert(PreheaderIdx != ~0U && "PHI has no preheader entry??");
712 if (PreheaderIdx != 0) {
713 PN->setIncomingValue(0, PN->getIncomingValue(PreheaderIdx));
714 PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx));
716 // Nuke all entries except the zero'th.
717 for (unsigned i = 0, e = PN->getNumIncomingValues()-1; i != e; ++i)
718 PN->removeIncomingValue(e-i, false);
720 // Finally, add the newly constructed PHI node as the entry for the BEBlock.
721 PN->addIncoming(NewPN, BEBlock);
723 // As an optimization, if all incoming values in the new PhiNode (which is a
724 // subset of the incoming values of the old PHI node) have the same value,
725 // eliminate the PHI Node.
726 if (HasUniqueIncomingValue) {
727 NewPN->replaceAllUsesWith(UniqueValue);
728 if (AA) AA->deleteValue(NewPN);
729 BEBlock->getInstList().erase(NewPN);
733 // Now that all of the PHI nodes have been inserted and adjusted, modify the
734 // backedge blocks to just to the BEBlock instead of the header.
735 for (unsigned i = 0, e = BackedgeBlocks.size(); i != e; ++i) {
736 TerminatorInst *TI = BackedgeBlocks[i]->getTerminator();
737 for (unsigned Op = 0, e = TI->getNumSuccessors(); Op != e; ++Op)
738 if (TI->getSuccessor(Op) == Header)
739 TI->setSuccessor(Op, BEBlock);
742 //===--- Update all analyses which we must preserve now -----------------===//
744 // Update Loop Information - we know that this block is now in the current
745 // loop and all parent loops.
746 L->addBasicBlockToLoop(BEBlock, LI->getBase());
748 // Update dominator information
749 DT->splitBlock(BEBlock);
754 void LoopSimplify::verifyAnalysis() const {
755 // It used to be possible to just assert L->isLoopSimplifyForm(), however
756 // with the introduction of indirectbr, there are now cases where it's
757 // not possible to transform a loop as necessary. We can at least check
758 // that there is an indirectbr near any time there's trouble.
760 // Indirectbr can interfere with preheader and unique backedge insertion.
761 if (!L->getLoopPreheader() || !L->getLoopLatch()) {
762 bool HasIndBrPred = false;
763 for (pred_iterator PI = pred_begin(L->getHeader()),
764 PE = pred_end(L->getHeader()); PI != PE; ++PI)
765 if (isa<IndirectBrInst>((*PI)->getTerminator())) {
769 assert(HasIndBrPred &&
770 "LoopSimplify has no excuse for missing loop header info!");
774 // Indirectbr can interfere with exit block canonicalization.
775 if (!L->hasDedicatedExits()) {
776 bool HasIndBrExiting = false;
777 SmallVector<BasicBlock*, 8> ExitingBlocks;
778 L->getExitingBlocks(ExitingBlocks);
779 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
780 if (isa<IndirectBrInst>((ExitingBlocks[i])->getTerminator())) {
781 HasIndBrExiting = true;
786 assert(HasIndBrExiting &&
787 "LoopSimplify has no excuse for missing exit block info!");
788 (void)HasIndBrExiting;