1 //===- LoopSimplify.cpp - Loop Canonicalization Pass ----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This 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 // Note that the simplifycfg pass will clean up blocks which are split out but
27 // end up being unnecessary, so usage of this pass should not pessimize
30 // This pass obviously modifies the CFG, but updates loop information and
31 // dominator information.
33 //===----------------------------------------------------------------------===//
35 #include "llvm/Transforms/Scalar.h"
36 #include "llvm/Constant.h"
37 #include "llvm/Instructions.h"
38 #include "llvm/Function.h"
39 #include "llvm/Type.h"
40 #include "llvm/Analysis/AliasAnalysis.h"
41 #include "llvm/Analysis/Dominators.h"
42 #include "llvm/Analysis/LoopInfo.h"
43 #include "llvm/Support/CFG.h"
44 #include "llvm/ADT/SetOperations.h"
45 #include "llvm/ADT/SetVector.h"
46 #include "llvm/ADT/Statistic.h"
47 #include "llvm/ADT/DepthFirstIterator.h"
52 NumInserted("loopsimplify", "Number of pre-header or exit blocks inserted");
54 NumNested("loopsimplify", "Number of nested loops split out");
56 struct LoopSimplify : public FunctionPass {
57 // AA - If we have an alias analysis object to update, this is it, otherwise
61 virtual bool runOnFunction(Function &F);
63 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
64 // We need loop information to identify the loops...
65 AU.addRequired<LoopInfo>();
66 AU.addRequired<DominatorSet>();
67 AU.addRequired<DominatorTree>();
69 AU.addPreserved<LoopInfo>();
70 AU.addPreserved<DominatorSet>();
71 AU.addPreserved<ImmediateDominators>();
72 AU.addPreserved<ETForest>();
73 AU.addPreserved<DominatorTree>();
74 AU.addPreserved<DominanceFrontier>();
75 AU.addPreservedID(BreakCriticalEdgesID); // No critical edges added.
78 bool ProcessLoop(Loop *L);
79 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, const char *Suffix,
80 const std::vector<BasicBlock*> &Preds);
81 BasicBlock *RewriteLoopExitBlock(Loop *L, BasicBlock *Exit);
82 void InsertPreheaderForLoop(Loop *L);
83 Loop *SeparateNestedLoop(Loop *L);
84 void InsertUniqueBackedgeBlock(Loop *L);
86 void UpdateDomInfoForRevectoredPreds(BasicBlock *NewBB,
87 std::vector<BasicBlock*> &PredBlocks);
90 RegisterOpt<LoopSimplify>
91 X("loopsimplify", "Canonicalize natural loops", true);
94 // Publically exposed interface to pass...
95 const PassInfo *llvm::LoopSimplifyID = X.getPassInfo();
96 FunctionPass *llvm::createLoopSimplifyPass() { return new LoopSimplify(); }
98 /// runOnFunction - Run down all loops in the CFG (recursively, but we could do
99 /// it in any convenient order) inserting preheaders...
101 bool LoopSimplify::runOnFunction(Function &F) {
102 bool Changed = false;
103 LoopInfo &LI = getAnalysis<LoopInfo>();
104 AA = getAnalysisToUpdate<AliasAnalysis>();
106 for (LoopInfo::iterator I = LI.begin(), E = LI.end(); I != E; ++I)
107 Changed |= ProcessLoop(*I);
113 /// ProcessLoop - Walk the loop structure in depth first order, ensuring that
114 /// all loops have preheaders.
116 bool LoopSimplify::ProcessLoop(Loop *L) {
117 bool Changed = false;
119 // Check to see that no blocks (other than the header) in the loop have
120 // predecessors that are not in the loop. This is not valid for natural
121 // loops, but can occur if the blocks are unreachable. Since they are
122 // unreachable we can just shamelessly destroy their terminators to make them
123 // not branch into the loop!
124 assert(L->getBlocks()[0] == L->getHeader() &&
125 "Header isn't first block in loop?");
126 for (unsigned i = 1, e = L->getBlocks().size(); i != e; ++i) {
127 BasicBlock *LoopBB = L->getBlocks()[i];
129 for (pred_iterator PI = pred_begin(LoopBB), E = pred_end(LoopBB);
131 if (!L->contains(*PI)) {
132 // This predecessor is not in the loop. Kill its terminator!
133 BasicBlock *DeadBlock = *PI;
134 for (succ_iterator SI = succ_begin(DeadBlock), E = succ_end(DeadBlock);
136 (*SI)->removePredecessor(DeadBlock); // Remove PHI node entries
138 // Delete the dead terminator.
139 if (AA) AA->deleteValue(&DeadBlock->back());
140 DeadBlock->getInstList().pop_back();
143 if (LoopBB->getParent()->getReturnType() != Type::VoidTy)
144 RetVal = Constant::getNullValue(LoopBB->getParent()->getReturnType());
145 new ReturnInst(RetVal, DeadBlock);
146 goto Retry; // We just invalidated the pred_iterator. Retry.
150 // Does the loop already have a preheader? If so, don't modify the loop...
151 if (L->getLoopPreheader() == 0) {
152 InsertPreheaderForLoop(L);
157 // Next, check to make sure that all exit nodes of the loop only have
158 // predecessors that are inside of the loop. This check guarantees that the
159 // loop preheader/header will dominate the exit blocks. If the exit block has
160 // predecessors from outside of the loop, split the edge now.
161 std::vector<BasicBlock*> ExitBlocks;
162 L->getExitBlocks(ExitBlocks);
164 SetVector<BasicBlock*> ExitBlockSet(ExitBlocks.begin(), ExitBlocks.end());
165 for (SetVector<BasicBlock*>::iterator I = ExitBlockSet.begin(),
166 E = ExitBlockSet.end(); I != E; ++I) {
167 BasicBlock *ExitBlock = *I;
168 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock);
170 if (!L->contains(*PI)) {
171 RewriteLoopExitBlock(L, ExitBlock);
178 // If the header has more than two predecessors at this point (from the
179 // preheader and from multiple backedges), we must adjust the loop.
180 if (L->getNumBackEdges() != 1) {
181 // If this is really a nested loop, rip it out into a child loop.
182 if (Loop *NL = SeparateNestedLoop(L)) {
184 // This is a big restructuring change, reprocess the whole loop.
189 InsertUniqueBackedgeBlock(L);
194 // Scan over the PHI nodes in the loop header. Since they now have only two
195 // incoming values (the loop is canonicalized), we may have simplified the PHI
196 // down to 'X = phi [X, Y]', which should be replaced with 'Y'.
198 for (BasicBlock::iterator I = L->getHeader()->begin();
199 (PN = dyn_cast<PHINode>(I++)); )
200 if (Value *V = PN->hasConstantValue()) {
201 PN->replaceAllUsesWith(V);
202 PN->eraseFromParent();
205 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
206 Changed |= ProcessLoop(*I);
211 /// SplitBlockPredecessors - Split the specified block into two blocks. We want
212 /// to move the predecessors specified in the Preds list to point to the new
213 /// block, leaving the remaining predecessors pointing to BB. This method
214 /// updates the SSA PHINode's, but no other analyses.
216 BasicBlock *LoopSimplify::SplitBlockPredecessors(BasicBlock *BB,
218 const std::vector<BasicBlock*> &Preds) {
220 // Create new basic block, insert right before the original block...
221 BasicBlock *NewBB = new BasicBlock(BB->getName()+Suffix, BB->getParent(), BB);
223 // The preheader first gets an unconditional branch to the loop header...
224 BranchInst *BI = new BranchInst(BB, NewBB);
226 // For every PHI node in the block, insert a PHI node into NewBB where the
227 // incoming values from the out of loop edges are moved to NewBB. We have two
228 // possible cases here. If the loop is dead, we just insert dummy entries
229 // into the PHI nodes for the new edge. If the loop is not dead, we move the
230 // incoming edges in BB into new PHI nodes in NewBB.
232 if (!Preds.empty()) { // Is the loop not obviously dead?
233 // Check to see if the values being merged into the new block need PHI
234 // nodes. If so, insert them.
235 for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ) {
236 PHINode *PN = cast<PHINode>(I);
239 // Check to see if all of the values coming in are the same. If so, we
240 // don't need to create a new PHI node.
241 Value *InVal = PN->getIncomingValueForBlock(Preds[0]);
242 for (unsigned i = 1, e = Preds.size(); i != e; ++i)
243 if (InVal != PN->getIncomingValueForBlock(Preds[i])) {
248 // If the values coming into the block are not the same, we need a PHI.
250 // Create the new PHI node, insert it into NewBB at the end of the block
251 PHINode *NewPHI = new PHINode(PN->getType(), PN->getName()+".ph", BI);
252 if (AA) AA->copyValue(PN, NewPHI);
254 // Move all of the edges from blocks outside the loop to the new PHI
255 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
256 Value *V = PN->removeIncomingValue(Preds[i], false);
257 NewPHI->addIncoming(V, Preds[i]);
261 // Remove all of the edges coming into the PHI nodes from outside of the
263 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
264 PN->removeIncomingValue(Preds[i], false);
267 // Add an incoming value to the PHI node in the loop for the preheader
269 PN->addIncoming(InVal, NewBB);
271 // Can we eliminate this phi node now?
272 if (Value *V = PN->hasConstantValue(true)) {
273 if (!isa<Instruction>(V) ||
274 getAnalysis<DominatorSet>().dominates(cast<Instruction>(V), PN)) {
275 PN->replaceAllUsesWith(V);
276 if (AA) AA->deleteValue(PN);
277 BB->getInstList().erase(PN);
282 // Now that the PHI nodes are updated, actually move the edges from
283 // Preds to point to NewBB instead of BB.
285 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
286 TerminatorInst *TI = Preds[i]->getTerminator();
287 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s)
288 if (TI->getSuccessor(s) == BB)
289 TI->setSuccessor(s, NewBB);
292 } else { // Otherwise the loop is dead...
293 for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++I) {
294 PHINode *PN = cast<PHINode>(I);
295 // Insert dummy values as the incoming value...
296 PN->addIncoming(Constant::getNullValue(PN->getType()), NewBB);
302 /// InsertPreheaderForLoop - Once we discover that a loop doesn't have a
303 /// preheader, this method is called to insert one. This method has two phases:
304 /// preheader insertion and analysis updating.
306 void LoopSimplify::InsertPreheaderForLoop(Loop *L) {
307 BasicBlock *Header = L->getHeader();
309 // Compute the set of predecessors of the loop that are not in the loop.
310 std::vector<BasicBlock*> OutsideBlocks;
311 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
313 if (!L->contains(*PI)) // Coming in from outside the loop?
314 OutsideBlocks.push_back(*PI); // Keep track of it...
316 // Split out the loop pre-header
318 SplitBlockPredecessors(Header, ".preheader", OutsideBlocks);
320 //===--------------------------------------------------------------------===//
321 // Update analysis results now that we have performed the transformation
324 // We know that we have loop information to update... update it now.
325 if (Loop *Parent = L->getParentLoop())
326 Parent->addBasicBlockToLoop(NewBB, getAnalysis<LoopInfo>());
328 DominatorSet &DS = getAnalysis<DominatorSet>(); // Update dominator info
329 DominatorTree &DT = getAnalysis<DominatorTree>();
332 // Update the dominator tree information.
333 // The immediate dominator of the preheader is the immediate dominator of
335 DominatorTree::Node *PHDomTreeNode =
336 DT.createNewNode(NewBB, DT.getNode(Header)->getIDom());
337 BasicBlock *oldHeaderIDom = DT.getNode(Header)->getIDom()->getBlock();
339 // Change the header node so that PNHode is the new immediate dominator
340 DT.changeImmediateDominator(DT.getNode(Header), PHDomTreeNode);
343 // The blocks that dominate NewBB are the blocks that dominate Header,
344 // minus Header, plus NewBB.
345 DominatorSet::DomSetType DomSet = DS.getDominators(Header);
346 DomSet.erase(Header); // Header does not dominate us...
347 DS.addBasicBlock(NewBB, DomSet);
349 // The newly created basic block dominates all nodes dominated by Header.
350 for (df_iterator<DominatorTree::Node*> DFI = df_begin(PHDomTreeNode),
351 E = df_end(PHDomTreeNode); DFI != E; ++DFI)
352 DS.addDominator((*DFI)->getBlock(), NewBB);
355 // Update immediate dominator information if we have it...
356 if (ImmediateDominators *ID = getAnalysisToUpdate<ImmediateDominators>()) {
357 // Whatever i-dominated the header node now immediately dominates NewBB
358 ID->addNewBlock(NewBB, ID->get(Header));
360 // The preheader now is the immediate dominator for the header node...
361 ID->setImmediateDominator(Header, NewBB);
364 // Update ET Forest information if we have it...
365 if (ETForest *EF = getAnalysisToUpdate<ETForest>()) {
366 // Whatever i-dominated the header node now immediately dominates NewBB
367 EF->addNewBlock(NewBB, oldHeaderIDom);
369 // The preheader now is the immediate dominator for the header node...
370 EF->setImmediateDominator(Header, NewBB);
373 // Update dominance frontier information...
374 if (DominanceFrontier *DF = getAnalysisToUpdate<DominanceFrontier>()) {
375 // The DF(NewBB) is just (DF(Header)-Header), because NewBB dominates
376 // everything that Header does, and it strictly dominates Header in
378 assert(DF->find(Header) != DF->end() && "Header node doesn't have DF set?");
379 DominanceFrontier::DomSetType NewDFSet = DF->find(Header)->second;
380 NewDFSet.erase(Header);
381 DF->addBasicBlock(NewBB, NewDFSet);
383 // Now we must loop over all of the dominance frontiers in the function,
384 // replacing occurrences of Header with NewBB in some cases. If a block
385 // dominates a (now) predecessor of NewBB, but did not strictly dominate
386 // Header, it will have Header in it's DF set, but should now have NewBB in
388 for (unsigned i = 0, e = OutsideBlocks.size(); i != e; ++i) {
389 // Get all of the dominators of the predecessor...
390 const DominatorSet::DomSetType &PredDoms =
391 DS.getDominators(OutsideBlocks[i]);
392 for (DominatorSet::DomSetType::const_iterator PDI = PredDoms.begin(),
393 PDE = PredDoms.end(); PDI != PDE; ++PDI) {
394 BasicBlock *PredDom = *PDI;
395 // If the loop header is in DF(PredDom), then PredDom didn't dominate
396 // the header but did dominate a predecessor outside of the loop. Now
397 // we change this entry to include the preheader in the DF instead of
399 DominanceFrontier::iterator DFI = DF->find(PredDom);
400 assert(DFI != DF->end() && "No dominance frontier for node?");
401 if (DFI->second.count(Header)) {
402 DF->removeFromFrontier(DFI, Header);
403 DF->addToFrontier(DFI, NewBB);
410 /// RewriteLoopExitBlock - Ensure that the loop preheader dominates all exit
411 /// blocks. This method is used to split exit blocks that have predecessors
412 /// outside of the loop.
413 BasicBlock *LoopSimplify::RewriteLoopExitBlock(Loop *L, BasicBlock *Exit) {
414 DominatorSet &DS = getAnalysis<DominatorSet>();
416 std::vector<BasicBlock*> LoopBlocks;
417 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I)
419 LoopBlocks.push_back(*I);
421 assert(!LoopBlocks.empty() && "No edges coming in from outside the loop?");
422 BasicBlock *NewBB = SplitBlockPredecessors(Exit, ".loopexit", LoopBlocks);
424 // Update Loop Information - we know that the new block will be in the parent
426 if (Loop *Parent = L->getParentLoop())
427 Parent->addBasicBlockToLoop(NewBB, getAnalysis<LoopInfo>());
429 // Update dominator information (set, immdom, domtree, and domfrontier)
430 UpdateDomInfoForRevectoredPreds(NewBB, LoopBlocks);
434 /// AddBlockAndPredsToSet - Add the specified block, and all of its
435 /// predecessors, to the specified set, if it's not already in there. Stop
436 /// predecessor traversal when we reach StopBlock.
437 static void AddBlockAndPredsToSet(BasicBlock *BB, BasicBlock *StopBlock,
438 std::set<BasicBlock*> &Blocks) {
439 if (!Blocks.insert(BB).second) return; // already processed.
440 if (BB == StopBlock) return; // Stop here!
442 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I)
443 AddBlockAndPredsToSet(*I, StopBlock, Blocks);
446 /// FindPHIToPartitionLoops - The first part of loop-nestification is to find a
447 /// PHI node that tells us how to partition the loops.
448 static PHINode *FindPHIToPartitionLoops(Loop *L, DominatorSet &DS,
450 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ) {
451 PHINode *PN = cast<PHINode>(I);
453 if (Value *V = PN->hasConstantValue())
454 if (!isa<Instruction>(V) || DS.dominates(cast<Instruction>(V), PN)) {
455 // This is a degenerate PHI already, don't modify it!
456 PN->replaceAllUsesWith(V);
457 if (AA) AA->deleteValue(PN);
458 PN->eraseFromParent();
462 // Scan this PHI node looking for a use of the PHI node by itself.
463 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
464 if (PN->getIncomingValue(i) == PN &&
465 L->contains(PN->getIncomingBlock(i)))
466 // We found something tasty to remove.
472 /// SeparateNestedLoop - If this loop has multiple backedges, try to pull one of
473 /// them out into a nested loop. This is important for code that looks like
478 /// br cond, Loop, Next
480 /// br cond2, Loop, Out
482 /// To identify this common case, we look at the PHI nodes in the header of the
483 /// loop. PHI nodes with unchanging values on one backedge correspond to values
484 /// that change in the "outer" loop, but not in the "inner" loop.
486 /// If we are able to separate out a loop, return the new outer loop that was
489 Loop *LoopSimplify::SeparateNestedLoop(Loop *L) {
490 PHINode *PN = FindPHIToPartitionLoops(L, getAnalysis<DominatorSet>(), AA);
491 if (PN == 0) return 0; // No known way to partition.
493 // Pull out all predecessors that have varying values in the loop. This
494 // handles the case when a PHI node has multiple instances of itself as
496 std::vector<BasicBlock*> OuterLoopPreds;
497 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
498 if (PN->getIncomingValue(i) != PN ||
499 !L->contains(PN->getIncomingBlock(i)))
500 OuterLoopPreds.push_back(PN->getIncomingBlock(i));
502 BasicBlock *Header = L->getHeader();
503 BasicBlock *NewBB = SplitBlockPredecessors(Header, ".outer", OuterLoopPreds);
505 // Update dominator information (set, immdom, domtree, and domfrontier)
506 UpdateDomInfoForRevectoredPreds(NewBB, OuterLoopPreds);
508 // Create the new outer loop.
509 Loop *NewOuter = new Loop();
511 LoopInfo &LI = getAnalysis<LoopInfo>();
513 // Change the parent loop to use the outer loop as its child now.
514 if (Loop *Parent = L->getParentLoop())
515 Parent->replaceChildLoopWith(L, NewOuter);
517 LI.changeTopLevelLoop(L, NewOuter);
519 // This block is going to be our new header block: add it to this loop and all
521 NewOuter->addBasicBlockToLoop(NewBB, getAnalysis<LoopInfo>());
523 // L is now a subloop of our outer loop.
524 NewOuter->addChildLoop(L);
526 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i)
527 NewOuter->addBlockEntry(L->getBlocks()[i]);
529 // Determine which blocks should stay in L and which should be moved out to
530 // the Outer loop now.
531 DominatorSet &DS = getAnalysis<DominatorSet>();
532 std::set<BasicBlock*> BlocksInL;
533 for (pred_iterator PI = pred_begin(Header), E = pred_end(Header); PI!=E; ++PI)
534 if (DS.dominates(Header, *PI))
535 AddBlockAndPredsToSet(*PI, Header, BlocksInL);
538 // Scan all of the loop children of L, moving them to OuterLoop if they are
539 // not part of the inner loop.
540 for (Loop::iterator I = L->begin(); I != L->end(); )
541 if (BlocksInL.count((*I)->getHeader()))
542 ++I; // Loop remains in L
544 NewOuter->addChildLoop(L->removeChildLoop(I));
546 // Now that we know which blocks are in L and which need to be moved to
547 // OuterLoop, move any blocks that need it.
548 for (unsigned i = 0; i != L->getBlocks().size(); ++i) {
549 BasicBlock *BB = L->getBlocks()[i];
550 if (!BlocksInL.count(BB)) {
551 // Move this block to the parent, updating the exit blocks sets
552 L->removeBlockFromLoop(BB);
554 LI.changeLoopFor(BB, NewOuter);
564 /// InsertUniqueBackedgeBlock - This method is called when the specified loop
565 /// has more than one backedge in it. If this occurs, revector all of these
566 /// backedges to target a new basic block and have that block branch to the loop
567 /// header. This ensures that loops have exactly one backedge.
569 void LoopSimplify::InsertUniqueBackedgeBlock(Loop *L) {
570 assert(L->getNumBackEdges() > 1 && "Must have > 1 backedge!");
572 // Get information about the loop
573 BasicBlock *Preheader = L->getLoopPreheader();
574 BasicBlock *Header = L->getHeader();
575 Function *F = Header->getParent();
577 // Figure out which basic blocks contain back-edges to the loop header.
578 std::vector<BasicBlock*> BackedgeBlocks;
579 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I)
580 if (*I != Preheader) BackedgeBlocks.push_back(*I);
582 // Create and insert the new backedge block...
583 BasicBlock *BEBlock = new BasicBlock(Header->getName()+".backedge", F);
584 BranchInst *BETerminator = new BranchInst(Header, BEBlock);
586 // Move the new backedge block to right after the last backedge block.
587 Function::iterator InsertPos = BackedgeBlocks.back(); ++InsertPos;
588 F->getBasicBlockList().splice(InsertPos, F->getBasicBlockList(), BEBlock);
590 // Now that the block has been inserted into the function, create PHI nodes in
591 // the backedge block which correspond to any PHI nodes in the header block.
592 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
593 PHINode *PN = cast<PHINode>(I);
594 PHINode *NewPN = new PHINode(PN->getType(), PN->getName()+".be",
596 NewPN->reserveOperandSpace(BackedgeBlocks.size());
597 if (AA) AA->copyValue(PN, NewPN);
599 // Loop over the PHI node, moving all entries except the one for the
600 // preheader over to the new PHI node.
601 unsigned PreheaderIdx = ~0U;
602 bool HasUniqueIncomingValue = true;
603 Value *UniqueValue = 0;
604 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
605 BasicBlock *IBB = PN->getIncomingBlock(i);
606 Value *IV = PN->getIncomingValue(i);
607 if (IBB == Preheader) {
610 NewPN->addIncoming(IV, IBB);
611 if (HasUniqueIncomingValue) {
612 if (UniqueValue == 0)
614 else if (UniqueValue != IV)
615 HasUniqueIncomingValue = false;
620 // Delete all of the incoming values from the old PN except the preheader's
621 assert(PreheaderIdx != ~0U && "PHI has no preheader entry??");
622 if (PreheaderIdx != 0) {
623 PN->setIncomingValue(0, PN->getIncomingValue(PreheaderIdx));
624 PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx));
626 // Nuke all entries except the zero'th.
627 for (unsigned i = 0, e = PN->getNumIncomingValues()-1; i != e; ++i)
628 PN->removeIncomingValue(e-i, false);
630 // Finally, add the newly constructed PHI node as the entry for the BEBlock.
631 PN->addIncoming(NewPN, BEBlock);
633 // As an optimization, if all incoming values in the new PhiNode (which is a
634 // subset of the incoming values of the old PHI node) have the same value,
635 // eliminate the PHI Node.
636 if (HasUniqueIncomingValue) {
637 NewPN->replaceAllUsesWith(UniqueValue);
638 if (AA) AA->deleteValue(NewPN);
639 BEBlock->getInstList().erase(NewPN);
643 // Now that all of the PHI nodes have been inserted and adjusted, modify the
644 // backedge blocks to just to the BEBlock instead of the header.
645 for (unsigned i = 0, e = BackedgeBlocks.size(); i != e; ++i) {
646 TerminatorInst *TI = BackedgeBlocks[i]->getTerminator();
647 for (unsigned Op = 0, e = TI->getNumSuccessors(); Op != e; ++Op)
648 if (TI->getSuccessor(Op) == Header)
649 TI->setSuccessor(Op, BEBlock);
652 //===--- Update all analyses which we must preserve now -----------------===//
654 // Update Loop Information - we know that this block is now in the current
655 // loop and all parent loops.
656 L->addBasicBlockToLoop(BEBlock, getAnalysis<LoopInfo>());
658 // Update dominator information (set, immdom, domtree, and domfrontier)
659 UpdateDomInfoForRevectoredPreds(BEBlock, BackedgeBlocks);
662 /// UpdateDomInfoForRevectoredPreds - This method is used to update the four
663 /// different kinds of dominator information (dominator sets, immediate
664 /// dominators, dominator trees, and dominance frontiers) after a new block has
665 /// been added to the CFG.
667 /// This only supports the case when an existing block (known as "NewBBSucc"),
668 /// had some of its predecessors factored into a new basic block. This
669 /// transformation inserts a new basic block ("NewBB"), with a single
670 /// unconditional branch to NewBBSucc, and moves some predecessors of
671 /// "NewBBSucc" to now branch to NewBB. These predecessors are listed in
672 /// PredBlocks, even though they are the same as
673 /// pred_begin(NewBB)/pred_end(NewBB).
675 void LoopSimplify::UpdateDomInfoForRevectoredPreds(BasicBlock *NewBB,
676 std::vector<BasicBlock*> &PredBlocks) {
677 assert(!PredBlocks.empty() && "No predblocks??");
678 assert(succ_begin(NewBB) != succ_end(NewBB) &&
679 ++succ_begin(NewBB) == succ_end(NewBB) &&
680 "NewBB should have a single successor!");
681 BasicBlock *NewBBSucc = *succ_begin(NewBB);
682 DominatorSet &DS = getAnalysis<DominatorSet>();
684 // Update dominator information... The blocks that dominate NewBB are the
685 // intersection of the dominators of predecessors, plus the block itself.
687 DominatorSet::DomSetType NewBBDomSet = DS.getDominators(PredBlocks[0]);
688 for (unsigned i = 1, e = PredBlocks.size(); i != e; ++i)
689 set_intersect(NewBBDomSet, DS.getDominators(PredBlocks[i]));
690 NewBBDomSet.insert(NewBB); // All blocks dominate themselves...
691 DS.addBasicBlock(NewBB, NewBBDomSet);
693 // The newly inserted basic block will dominate existing basic blocks iff the
694 // PredBlocks dominate all of the non-pred blocks. If all predblocks dominate
695 // the non-pred blocks, then they all must be the same block!
697 bool NewBBDominatesNewBBSucc = true;
699 BasicBlock *OnePred = PredBlocks[0];
700 for (unsigned i = 1, e = PredBlocks.size(); i != e; ++i)
701 if (PredBlocks[i] != OnePred) {
702 NewBBDominatesNewBBSucc = false;
706 if (NewBBDominatesNewBBSucc)
707 for (pred_iterator PI = pred_begin(NewBBSucc), E = pred_end(NewBBSucc);
709 if (*PI != NewBB && !DS.dominates(NewBBSucc, *PI)) {
710 NewBBDominatesNewBBSucc = false;
715 // The other scenario where the new block can dominate its successors are when
716 // all predecessors of NewBBSucc that are not NewBB are dominated by NewBBSucc
718 if (!NewBBDominatesNewBBSucc) {
719 NewBBDominatesNewBBSucc = true;
720 for (pred_iterator PI = pred_begin(NewBBSucc), E = pred_end(NewBBSucc);
722 if (*PI != NewBB && !DS.dominates(NewBBSucc, *PI)) {
723 NewBBDominatesNewBBSucc = false;
728 // If NewBB dominates some blocks, then it will dominate all blocks that
730 if (NewBBDominatesNewBBSucc) {
731 BasicBlock *PredBlock = PredBlocks[0];
732 Function *F = NewBB->getParent();
733 for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I)
734 if (DS.dominates(NewBBSucc, I))
735 DS.addDominator(I, NewBB);
738 // Update immediate dominator information if we have it...
739 BasicBlock *NewBBIDom = 0;
740 if (ImmediateDominators *ID = getAnalysisToUpdate<ImmediateDominators>()) {
741 // To find the immediate dominator of the new exit node, we trace up the
742 // immediate dominators of a predecessor until we find a basic block that
743 // dominates the exit block.
745 BasicBlock *Dom = PredBlocks[0]; // Some random predecessor...
746 while (!NewBBDomSet.count(Dom)) { // Loop until we find a dominator...
747 assert(Dom != 0 && "No shared dominator found???");
751 // Set the immediate dominator now...
752 ID->addNewBlock(NewBB, Dom);
753 NewBBIDom = Dom; // Reuse this if calculating DominatorTree info...
755 // If NewBB strictly dominates other blocks, we need to update their idom's
756 // now. The only block that need adjustment is the NewBBSucc block, whose
757 // idom should currently be set to PredBlocks[0].
758 if (NewBBDominatesNewBBSucc)
759 ID->setImmediateDominator(NewBBSucc, NewBB);
762 // Update DominatorTree information if it is active.
763 if (DominatorTree *DT = getAnalysisToUpdate<DominatorTree>()) {
764 // If we don't have ImmediateDominator info around, calculate the idom as
766 DominatorTree::Node *NewBBIDomNode;
768 NewBBIDomNode = DT->getNode(NewBBIDom);
770 NewBBIDomNode = DT->getNode(PredBlocks[0]); // Random pred
771 while (!NewBBDomSet.count(NewBBIDomNode->getBlock())) {
772 NewBBIDomNode = NewBBIDomNode->getIDom();
773 assert(NewBBIDomNode && "No shared dominator found??");
775 NewBBIDom = NewBBIDomNode->getBlock();
778 // Create the new dominator tree node... and set the idom of NewBB.
779 DominatorTree::Node *NewBBNode = DT->createNewNode(NewBB, NewBBIDomNode);
781 // If NewBB strictly dominates other blocks, then it is now the immediate
782 // dominator of NewBBSucc. Update the dominator tree as appropriate.
783 if (NewBBDominatesNewBBSucc) {
784 DominatorTree::Node *NewBBSuccNode = DT->getNode(NewBBSucc);
785 DT->changeImmediateDominator(NewBBSuccNode, NewBBNode);
789 // Update ET-Forest information if it is active.
790 if (ETForest *EF = getAnalysisToUpdate<ETForest>()) {
791 EF->addNewBlock(NewBB, NewBBIDom);
792 if (NewBBDominatesNewBBSucc)
793 EF->setImmediateDominator(NewBBSucc, NewBB);
796 // Update dominance frontier information...
797 if (DominanceFrontier *DF = getAnalysisToUpdate<DominanceFrontier>()) {
798 // If NewBB dominates NewBBSucc, then DF(NewBB) is now going to be the
799 // DF(PredBlocks[0]) without the stuff that the new block does not dominate
801 if (NewBBDominatesNewBBSucc) {
802 DominanceFrontier::iterator DFI = DF->find(PredBlocks[0]);
803 if (DFI != DF->end()) {
804 DominanceFrontier::DomSetType Set = DFI->second;
805 // Filter out stuff in Set that we do not dominate a predecessor of.
806 for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),
807 E = Set.end(); SetI != E;) {
808 bool DominatesPred = false;
809 for (pred_iterator PI = pred_begin(*SetI), E = pred_end(*SetI);
811 if (DS.dominates(NewBB, *PI))
812 DominatesPred = true;
819 DF->addBasicBlock(NewBB, Set);
823 // DF(NewBB) is {NewBBSucc} because NewBB does not strictly dominate
824 // NewBBSucc, but it does dominate itself (and there is an edge (NewBB ->
825 // NewBBSucc)). NewBBSucc is the single successor of NewBB.
826 DominanceFrontier::DomSetType NewDFSet;
827 NewDFSet.insert(NewBBSucc);
828 DF->addBasicBlock(NewBB, NewDFSet);
831 // Now we must loop over all of the dominance frontiers in the function,
832 // replacing occurrences of NewBBSucc with NewBB in some cases. All
833 // blocks that dominate a block in PredBlocks and contained NewBBSucc in
834 // their dominance frontier must be updated to contain NewBB instead.
836 for (unsigned i = 0, e = PredBlocks.size(); i != e; ++i) {
837 BasicBlock *Pred = PredBlocks[i];
838 // Get all of the dominators of the predecessor...
839 const DominatorSet::DomSetType &PredDoms = DS.getDominators(Pred);
840 for (DominatorSet::DomSetType::const_iterator PDI = PredDoms.begin(),
841 PDE = PredDoms.end(); PDI != PDE; ++PDI) {
842 BasicBlock *PredDom = *PDI;
844 // If the NewBBSucc node is in DF(PredDom), then PredDom didn't
845 // dominate NewBBSucc but did dominate a predecessor of it. Now we
846 // change this entry to include NewBB in the DF instead of NewBBSucc.
847 DominanceFrontier::iterator DFI = DF->find(PredDom);
848 assert(DFI != DF->end() && "No dominance frontier for node?");
849 if (DFI->second.count(NewBBSucc)) {
850 // If NewBBSucc should not stay in our dominator frontier, remove it.
851 // We remove it unless there is a predecessor of NewBBSucc that we
852 // dominate, but we don't strictly dominate NewBBSucc.
853 bool ShouldRemove = true;
854 if (PredDom == NewBBSucc || !DS.dominates(PredDom, NewBBSucc)) {
855 // Okay, we know that PredDom does not strictly dominate NewBBSucc.
856 // Check to see if it dominates any predecessors of NewBBSucc.
857 for (pred_iterator PI = pred_begin(NewBBSucc),
858 E = pred_end(NewBBSucc); PI != E; ++PI)
859 if (DS.dominates(PredDom, *PI)) {
860 ShouldRemove = false;
866 DF->removeFromFrontier(DFI, NewBBSucc);
867 DF->addToFrontier(DFI, NewBB);