1 //===-- BasicBlockUtils.cpp - BasicBlock Utilities -------------------------==//
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 family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
16 #include "llvm/Analysis/AliasAnalysis.h"
17 #include "llvm/Analysis/CFG.h"
18 #include "llvm/Analysis/Dominators.h"
19 #include "llvm/Analysis/LoopInfo.h"
20 #include "llvm/Analysis/MemoryDependenceAnalysis.h"
21 #include "llvm/IR/Constant.h"
22 #include "llvm/IR/DataLayout.h"
23 #include "llvm/IR/Function.h"
24 #include "llvm/IR/Instructions.h"
25 #include "llvm/IR/IntrinsicInst.h"
26 #include "llvm/IR/Type.h"
27 #include "llvm/Support/ErrorHandling.h"
28 #include "llvm/Support/ValueHandle.h"
29 #include "llvm/Transforms/Scalar.h"
30 #include "llvm/Transforms/Utils/Local.h"
34 /// DeleteDeadBlock - Delete the specified block, which must have no
36 void llvm::DeleteDeadBlock(BasicBlock *BB) {
37 assert((pred_begin(BB) == pred_end(BB) ||
38 // Can delete self loop.
39 BB->getSinglePredecessor() == BB) && "Block is not dead!");
40 TerminatorInst *BBTerm = BB->getTerminator();
42 // Loop through all of our successors and make sure they know that one
43 // of their predecessors is going away.
44 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i)
45 BBTerm->getSuccessor(i)->removePredecessor(BB);
47 // Zap all the instructions in the block.
48 while (!BB->empty()) {
49 Instruction &I = BB->back();
50 // If this instruction is used, replace uses with an arbitrary value.
51 // Because control flow can't get here, we don't care what we replace the
52 // value with. Note that since this block is unreachable, and all values
53 // contained within it must dominate their uses, that all uses will
54 // eventually be removed (they are themselves dead).
56 I.replaceAllUsesWith(UndefValue::get(I.getType()));
57 BB->getInstList().pop_back();
61 BB->eraseFromParent();
64 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
65 /// any single-entry PHI nodes in it, fold them away. This handles the case
66 /// when all entries to the PHI nodes in a block are guaranteed equal, such as
67 /// when the block has exactly one predecessor.
68 void llvm::FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P) {
69 if (!isa<PHINode>(BB->begin())) return;
71 AliasAnalysis *AA = 0;
72 MemoryDependenceAnalysis *MemDep = 0;
74 AA = P->getAnalysisIfAvailable<AliasAnalysis>();
75 MemDep = P->getAnalysisIfAvailable<MemoryDependenceAnalysis>();
78 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
79 if (PN->getIncomingValue(0) != PN)
80 PN->replaceAllUsesWith(PN->getIncomingValue(0));
82 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
85 MemDep->removeInstruction(PN); // Memdep updates AA itself.
86 else if (AA && isa<PointerType>(PN->getType()))
89 PN->eraseFromParent();
94 /// DeleteDeadPHIs - Examine each PHI in the given block and delete it if it
95 /// is dead. Also recursively delete any operands that become dead as
96 /// a result. This includes tracing the def-use list from the PHI to see if
97 /// it is ultimately unused or if it reaches an unused cycle.
98 bool llvm::DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI) {
99 // Recursively deleting a PHI may cause multiple PHIs to be deleted
100 // or RAUW'd undef, so use an array of WeakVH for the PHIs to delete.
101 SmallVector<WeakVH, 8> PHIs;
102 for (BasicBlock::iterator I = BB->begin();
103 PHINode *PN = dyn_cast<PHINode>(I); ++I)
106 bool Changed = false;
107 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
108 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
109 Changed |= RecursivelyDeleteDeadPHINode(PN, TLI);
114 /// MergeBlockIntoPredecessor - Attempts to merge a block into its predecessor,
115 /// if possible. The return value indicates success or failure.
116 bool llvm::MergeBlockIntoPredecessor(BasicBlock *BB, Pass *P) {
117 // Don't merge away blocks who have their address taken.
118 if (BB->hasAddressTaken()) return false;
120 // Can't merge if there are multiple predecessors, or no predecessors.
121 BasicBlock *PredBB = BB->getUniquePredecessor();
122 if (!PredBB) return false;
124 // Don't break self-loops.
125 if (PredBB == BB) return false;
126 // Don't break invokes.
127 if (isa<InvokeInst>(PredBB->getTerminator())) return false;
129 succ_iterator SI(succ_begin(PredBB)), SE(succ_end(PredBB));
130 BasicBlock *OnlySucc = BB;
131 for (; SI != SE; ++SI)
132 if (*SI != OnlySucc) {
133 OnlySucc = 0; // There are multiple distinct successors!
137 // Can't merge if there are multiple successors.
138 if (!OnlySucc) return false;
140 // Can't merge if there is PHI loop.
141 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; ++BI) {
142 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
143 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
144 if (PN->getIncomingValue(i) == PN)
150 // Begin by getting rid of unneeded PHIs.
151 if (isa<PHINode>(BB->front()))
152 FoldSingleEntryPHINodes(BB, P);
154 // Delete the unconditional branch from the predecessor...
155 PredBB->getInstList().pop_back();
157 // Make all PHI nodes that referred to BB now refer to Pred as their
159 BB->replaceAllUsesWith(PredBB);
161 // Move all definitions in the successor to the predecessor...
162 PredBB->getInstList().splice(PredBB->end(), BB->getInstList());
164 // Inherit predecessors name if it exists.
165 if (!PredBB->hasName())
166 PredBB->takeName(BB);
168 // Finally, erase the old block and update dominator info.
170 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
171 if (DomTreeNode *DTN = DT->getNode(BB)) {
172 DomTreeNode *PredDTN = DT->getNode(PredBB);
173 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
174 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(),
175 DE = Children.end(); DI != DE; ++DI)
176 DT->changeImmediateDominator(*DI, PredDTN);
181 if (LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>())
184 if (MemoryDependenceAnalysis *MD =
185 P->getAnalysisIfAvailable<MemoryDependenceAnalysis>())
186 MD->invalidateCachedPredecessors();
190 BB->eraseFromParent();
194 /// ReplaceInstWithValue - Replace all uses of an instruction (specified by BI)
195 /// with a value, then remove and delete the original instruction.
197 void llvm::ReplaceInstWithValue(BasicBlock::InstListType &BIL,
198 BasicBlock::iterator &BI, Value *V) {
199 Instruction &I = *BI;
200 // Replaces all of the uses of the instruction with uses of the value
201 I.replaceAllUsesWith(V);
203 // Make sure to propagate a name if there is one already.
204 if (I.hasName() && !V->hasName())
207 // Delete the unnecessary instruction now...
212 /// ReplaceInstWithInst - Replace the instruction specified by BI with the
213 /// instruction specified by I. The original instruction is deleted and BI is
214 /// updated to point to the new instruction.
216 void llvm::ReplaceInstWithInst(BasicBlock::InstListType &BIL,
217 BasicBlock::iterator &BI, Instruction *I) {
218 assert(I->getParent() == 0 &&
219 "ReplaceInstWithInst: Instruction already inserted into basic block!");
221 // Insert the new instruction into the basic block...
222 BasicBlock::iterator New = BIL.insert(BI, I);
224 // Replace all uses of the old instruction, and delete it.
225 ReplaceInstWithValue(BIL, BI, I);
227 // Move BI back to point to the newly inserted instruction
231 /// ReplaceInstWithInst - Replace the instruction specified by From with the
232 /// instruction specified by To.
234 void llvm::ReplaceInstWithInst(Instruction *From, Instruction *To) {
235 BasicBlock::iterator BI(From);
236 ReplaceInstWithInst(From->getParent()->getInstList(), BI, To);
239 /// SplitEdge - Split the edge connecting specified block. Pass P must
241 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) {
242 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
244 // If this is a critical edge, let SplitCriticalEdge do it.
245 TerminatorInst *LatchTerm = BB->getTerminator();
246 if (SplitCriticalEdge(LatchTerm, SuccNum, P))
247 return LatchTerm->getSuccessor(SuccNum);
249 // If the edge isn't critical, then BB has a single successor or Succ has a
250 // single pred. Split the block.
251 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
252 // If the successor only has a single pred, split the top of the successor
254 assert(SP == BB && "CFG broken");
256 return SplitBlock(Succ, Succ->begin(), P);
259 // Otherwise, if BB has a single successor, split it at the bottom of the
261 assert(BB->getTerminator()->getNumSuccessors() == 1 &&
262 "Should have a single succ!");
263 return SplitBlock(BB, BB->getTerminator(), P);
266 /// SplitBlock - Split the specified block at the specified instruction - every
267 /// thing before SplitPt stays in Old and everything starting with SplitPt moves
268 /// to a new block. The two blocks are joined by an unconditional branch and
269 /// the loop info is updated.
271 BasicBlock *llvm::SplitBlock(BasicBlock *Old, Instruction *SplitPt, Pass *P) {
272 BasicBlock::iterator SplitIt = SplitPt;
273 while (isa<PHINode>(SplitIt) || isa<LandingPadInst>(SplitIt))
275 BasicBlock *New = Old->splitBasicBlock(SplitIt, Old->getName()+".split");
277 // The new block lives in whichever loop the old one did. This preserves
278 // LCSSA as well, because we force the split point to be after any PHI nodes.
279 if (LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>())
280 if (Loop *L = LI->getLoopFor(Old))
281 L->addBasicBlockToLoop(New, LI->getBase());
283 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
284 // Old dominates New. New node dominates all other nodes dominated by Old.
285 if (DomTreeNode *OldNode = DT->getNode(Old)) {
286 std::vector<DomTreeNode *> Children;
287 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();
289 Children.push_back(*I);
291 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
292 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
293 E = Children.end(); I != E; ++I)
294 DT->changeImmediateDominator(*I, NewNode);
301 /// UpdateAnalysisInformation - Update DominatorTree, LoopInfo, and LCCSA
302 /// analysis information.
303 static void UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB,
304 ArrayRef<BasicBlock *> Preds,
305 Pass *P, bool &HasLoopExit) {
308 LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>();
309 Loop *L = LI ? LI->getLoopFor(OldBB) : 0;
311 // If we need to preserve loop analyses, collect some information about how
312 // this split will affect loops.
313 bool IsLoopEntry = !!L;
314 bool SplitMakesNewLoopHeader = false;
316 bool PreserveLCSSA = P->mustPreserveAnalysisID(LCSSAID);
317 for (ArrayRef<BasicBlock*>::iterator
318 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
319 BasicBlock *Pred = *i;
321 // If we need to preserve LCSSA, determine if any of the preds is a loop
324 if (Loop *PL = LI->getLoopFor(Pred))
325 if (!PL->contains(OldBB))
328 // If we need to preserve LoopInfo, note whether any of the preds crosses
329 // an interesting loop boundary.
331 if (L->contains(Pred))
334 SplitMakesNewLoopHeader = true;
338 // Update dominator tree if available.
339 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>();
341 DT->splitBlock(NewBB);
346 // Add the new block to the nearest enclosing loop (and not an adjacent
347 // loop). To find this, examine each of the predecessors and determine which
348 // loops enclose them, and select the most-nested loop which contains the
349 // loop containing the block being split.
350 Loop *InnermostPredLoop = 0;
351 for (ArrayRef<BasicBlock*>::iterator
352 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
353 BasicBlock *Pred = *i;
354 if (Loop *PredLoop = LI->getLoopFor(Pred)) {
355 // Seek a loop which actually contains the block being split (to avoid
357 while (PredLoop && !PredLoop->contains(OldBB))
358 PredLoop = PredLoop->getParentLoop();
360 // Select the most-nested of these loops which contains the block.
361 if (PredLoop && PredLoop->contains(OldBB) &&
362 (!InnermostPredLoop ||
363 InnermostPredLoop->getLoopDepth() < PredLoop->getLoopDepth()))
364 InnermostPredLoop = PredLoop;
368 if (InnermostPredLoop)
369 InnermostPredLoop->addBasicBlockToLoop(NewBB, LI->getBase());
371 L->addBasicBlockToLoop(NewBB, LI->getBase());
372 if (SplitMakesNewLoopHeader)
373 L->moveToHeader(NewBB);
377 /// UpdatePHINodes - Update the PHI nodes in OrigBB to include the values coming
378 /// from NewBB. This also updates AliasAnalysis, if available.
379 static void UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB,
380 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
381 Pass *P, bool HasLoopExit) {
382 // Otherwise, create a new PHI node in NewBB for each PHI node in OrigBB.
383 AliasAnalysis *AA = P ? P->getAnalysisIfAvailable<AliasAnalysis>() : 0;
384 for (BasicBlock::iterator I = OrigBB->begin(); isa<PHINode>(I); ) {
385 PHINode *PN = cast<PHINode>(I++);
387 // Check to see if all of the values coming in are the same. If so, we
388 // don't need to create a new PHI node, unless it's needed for LCSSA.
391 InVal = PN->getIncomingValueForBlock(Preds[0]);
392 for (unsigned i = 1, e = Preds.size(); i != e; ++i)
393 if (InVal != PN->getIncomingValueForBlock(Preds[i])) {
400 // If all incoming values for the new PHI would be the same, just don't
401 // make a new PHI. Instead, just remove the incoming values from the old
403 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
404 // Explicitly check the BB index here to handle duplicates in Preds.
405 int Idx = PN->getBasicBlockIndex(Preds[i]);
407 PN->removeIncomingValue(Idx, false);
410 // If the values coming into the block are not the same, we need a PHI.
411 // Create the new PHI node, insert it into NewBB at the end of the block
413 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI);
414 if (AA) AA->copyValue(PN, NewPHI);
416 // Move all of the PHI values for 'Preds' to the new PHI.
417 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
418 Value *V = PN->removeIncomingValue(Preds[i], false);
419 NewPHI->addIncoming(V, Preds[i]);
425 // Add an incoming value to the PHI node in the loop for the preheader
427 PN->addIncoming(InVal, NewBB);
431 /// SplitBlockPredecessors - This method transforms BB by introducing a new
432 /// basic block into the function, and moving some of the predecessors of BB to
433 /// be predecessors of the new block. The new predecessors are indicated by the
434 /// Preds array, which has NumPreds elements in it. The new block is given a
435 /// suffix of 'Suffix'.
437 /// This currently updates the LLVM IR, AliasAnalysis, DominatorTree,
438 /// LoopInfo, and LCCSA but no other analyses. In particular, it does not
439 /// preserve LoopSimplify (because it's complicated to handle the case where one
440 /// of the edges being split is an exit of a loop with other exits).
442 BasicBlock *llvm::SplitBlockPredecessors(BasicBlock *BB,
443 ArrayRef<BasicBlock*> Preds,
444 const char *Suffix, Pass *P) {
445 // Create new basic block, insert right before the original block.
446 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), BB->getName()+Suffix,
447 BB->getParent(), BB);
449 // The new block unconditionally branches to the old block.
450 BranchInst *BI = BranchInst::Create(BB, NewBB);
452 // Move the edges from Preds to point to NewBB instead of BB.
453 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
454 // This is slightly more strict than necessary; the minimum requirement
455 // is that there be no more than one indirectbr branching to BB. And
456 // all BlockAddress uses would need to be updated.
457 assert(!isa<IndirectBrInst>(Preds[i]->getTerminator()) &&
458 "Cannot split an edge from an IndirectBrInst");
459 Preds[i]->getTerminator()->replaceUsesOfWith(BB, NewBB);
462 // Insert a new PHI node into NewBB for every PHI node in BB and that new PHI
463 // node becomes an incoming value for BB's phi node. However, if the Preds
464 // list is empty, we need to insert dummy entries into the PHI nodes in BB to
465 // account for the newly created predecessor.
466 if (Preds.size() == 0) {
467 // Insert dummy values as the incoming value.
468 for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++I)
469 cast<PHINode>(I)->addIncoming(UndefValue::get(I->getType()), NewBB);
473 // Update DominatorTree, LoopInfo, and LCCSA analysis information.
474 bool HasLoopExit = false;
475 UpdateAnalysisInformation(BB, NewBB, Preds, P, HasLoopExit);
477 // Update the PHI nodes in BB with the values coming from NewBB.
478 UpdatePHINodes(BB, NewBB, Preds, BI, P, HasLoopExit);
482 /// SplitLandingPadPredecessors - This method transforms the landing pad,
483 /// OrigBB, by introducing two new basic blocks into the function. One of those
484 /// new basic blocks gets the predecessors listed in Preds. The other basic
485 /// block gets the remaining predecessors of OrigBB. The landingpad instruction
486 /// OrigBB is clone into both of the new basic blocks. The new blocks are given
487 /// the suffixes 'Suffix1' and 'Suffix2', and are returned in the NewBBs vector.
489 /// This currently updates the LLVM IR, AliasAnalysis, DominatorTree,
490 /// DominanceFrontier, LoopInfo, and LCCSA but no other analyses. In particular,
491 /// it does not preserve LoopSimplify (because it's complicated to handle the
492 /// case where one of the edges being split is an exit of a loop with other
495 void llvm::SplitLandingPadPredecessors(BasicBlock *OrigBB,
496 ArrayRef<BasicBlock*> Preds,
497 const char *Suffix1, const char *Suffix2,
499 SmallVectorImpl<BasicBlock*> &NewBBs) {
500 assert(OrigBB->isLandingPad() && "Trying to split a non-landing pad!");
502 // Create a new basic block for OrigBB's predecessors listed in Preds. Insert
503 // it right before the original block.
504 BasicBlock *NewBB1 = BasicBlock::Create(OrigBB->getContext(),
505 OrigBB->getName() + Suffix1,
506 OrigBB->getParent(), OrigBB);
507 NewBBs.push_back(NewBB1);
509 // The new block unconditionally branches to the old block.
510 BranchInst *BI1 = BranchInst::Create(OrigBB, NewBB1);
512 // Move the edges from Preds to point to NewBB1 instead of OrigBB.
513 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
514 // This is slightly more strict than necessary; the minimum requirement
515 // is that there be no more than one indirectbr branching to BB. And
516 // all BlockAddress uses would need to be updated.
517 assert(!isa<IndirectBrInst>(Preds[i]->getTerminator()) &&
518 "Cannot split an edge from an IndirectBrInst");
519 Preds[i]->getTerminator()->replaceUsesOfWith(OrigBB, NewBB1);
522 // Update DominatorTree, LoopInfo, and LCCSA analysis information.
523 bool HasLoopExit = false;
524 UpdateAnalysisInformation(OrigBB, NewBB1, Preds, P, HasLoopExit);
526 // Update the PHI nodes in OrigBB with the values coming from NewBB1.
527 UpdatePHINodes(OrigBB, NewBB1, Preds, BI1, P, HasLoopExit);
529 // Move the remaining edges from OrigBB to point to NewBB2.
530 SmallVector<BasicBlock*, 8> NewBB2Preds;
531 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB);
533 BasicBlock *Pred = *i++;
534 if (Pred == NewBB1) continue;
535 assert(!isa<IndirectBrInst>(Pred->getTerminator()) &&
536 "Cannot split an edge from an IndirectBrInst");
537 NewBB2Preds.push_back(Pred);
538 e = pred_end(OrigBB);
541 BasicBlock *NewBB2 = 0;
542 if (!NewBB2Preds.empty()) {
543 // Create another basic block for the rest of OrigBB's predecessors.
544 NewBB2 = BasicBlock::Create(OrigBB->getContext(),
545 OrigBB->getName() + Suffix2,
546 OrigBB->getParent(), OrigBB);
547 NewBBs.push_back(NewBB2);
549 // The new block unconditionally branches to the old block.
550 BranchInst *BI2 = BranchInst::Create(OrigBB, NewBB2);
552 // Move the remaining edges from OrigBB to point to NewBB2.
553 for (SmallVectorImpl<BasicBlock*>::iterator
554 i = NewBB2Preds.begin(), e = NewBB2Preds.end(); i != e; ++i)
555 (*i)->getTerminator()->replaceUsesOfWith(OrigBB, NewBB2);
557 // Update DominatorTree, LoopInfo, and LCCSA analysis information.
559 UpdateAnalysisInformation(OrigBB, NewBB2, NewBB2Preds, P, HasLoopExit);
561 // Update the PHI nodes in OrigBB with the values coming from NewBB2.
562 UpdatePHINodes(OrigBB, NewBB2, NewBB2Preds, BI2, P, HasLoopExit);
565 LandingPadInst *LPad = OrigBB->getLandingPadInst();
566 Instruction *Clone1 = LPad->clone();
567 Clone1->setName(Twine("lpad") + Suffix1);
568 NewBB1->getInstList().insert(NewBB1->getFirstInsertionPt(), Clone1);
571 Instruction *Clone2 = LPad->clone();
572 Clone2->setName(Twine("lpad") + Suffix2);
573 NewBB2->getInstList().insert(NewBB2->getFirstInsertionPt(), Clone2);
575 // Create a PHI node for the two cloned landingpad instructions.
576 PHINode *PN = PHINode::Create(LPad->getType(), 2, "lpad.phi", LPad);
577 PN->addIncoming(Clone1, NewBB1);
578 PN->addIncoming(Clone2, NewBB2);
579 LPad->replaceAllUsesWith(PN);
580 LPad->eraseFromParent();
582 // There is no second clone. Just replace the landing pad with the first
584 LPad->replaceAllUsesWith(Clone1);
585 LPad->eraseFromParent();
589 /// FoldReturnIntoUncondBranch - This method duplicates the specified return
590 /// instruction into a predecessor which ends in an unconditional branch. If
591 /// the return instruction returns a value defined by a PHI, propagate the
592 /// right value into the return. It returns the new return instruction in the
594 ReturnInst *llvm::FoldReturnIntoUncondBranch(ReturnInst *RI, BasicBlock *BB,
596 Instruction *UncondBranch = Pred->getTerminator();
597 // Clone the return and add it to the end of the predecessor.
598 Instruction *NewRet = RI->clone();
599 Pred->getInstList().push_back(NewRet);
601 // If the return instruction returns a value, and if the value was a
602 // PHI node in "BB", propagate the right value into the return.
603 for (User::op_iterator i = NewRet->op_begin(), e = NewRet->op_end();
606 Instruction *NewBC = 0;
607 if (BitCastInst *BCI = dyn_cast<BitCastInst>(V)) {
608 // Return value might be bitcasted. Clone and insert it before the
609 // return instruction.
610 V = BCI->getOperand(0);
611 NewBC = BCI->clone();
612 Pred->getInstList().insert(NewRet, NewBC);
615 if (PHINode *PN = dyn_cast<PHINode>(V)) {
616 if (PN->getParent() == BB) {
618 NewBC->setOperand(0, PN->getIncomingValueForBlock(Pred));
620 *i = PN->getIncomingValueForBlock(Pred);
625 // Update any PHI nodes in the returning block to realize that we no
626 // longer branch to them.
627 BB->removePredecessor(Pred);
628 UncondBranch->eraseFromParent();
629 return cast<ReturnInst>(NewRet);
632 /// SplitBlockAndInsertIfThen - Split the containing block at the
633 /// specified instruction - everything before and including SplitBefore stays
634 /// in the old basic block, and everything after SplitBefore is moved to a
635 /// new block. The two blocks are connected by a conditional branch
636 /// (with value of Cmp being the condition).
648 /// If Unreachable is true, then ThenBlock ends with
649 /// UnreachableInst, otherwise it branches to Tail.
650 /// Returns the NewBasicBlock's terminator.
652 TerminatorInst *llvm::SplitBlockAndInsertIfThen(Value *Cond,
653 Instruction *SplitBefore,
655 MDNode *BranchWeights) {
656 BasicBlock *Head = SplitBefore->getParent();
657 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore);
658 TerminatorInst *HeadOldTerm = Head->getTerminator();
659 LLVMContext &C = Head->getContext();
660 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail);
661 TerminatorInst *CheckTerm;
663 CheckTerm = new UnreachableInst(C, ThenBlock);
665 CheckTerm = BranchInst::Create(Tail, ThenBlock);
666 BranchInst *HeadNewTerm =
667 BranchInst::Create(/*ifTrue*/ThenBlock, /*ifFalse*/Tail, Cond);
668 HeadNewTerm->setMetadata(LLVMContext::MD_prof, BranchWeights);
669 ReplaceInstWithInst(HeadOldTerm, HeadNewTerm);
673 /// GetIfCondition - Given a basic block (BB) with two predecessors,
674 /// check to see if the merge at this block is due
675 /// to an "if condition". If so, return the boolean condition that determines
676 /// which entry into BB will be taken. Also, return by references the block
677 /// that will be entered from if the condition is true, and the block that will
678 /// be entered if the condition is false.
680 /// This does no checking to see if the true/false blocks have large or unsavory
681 /// instructions in them.
682 Value *llvm::GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue,
683 BasicBlock *&IfFalse) {
684 PHINode *SomePHI = dyn_cast<PHINode>(BB->begin());
685 BasicBlock *Pred1 = NULL;
686 BasicBlock *Pred2 = NULL;
689 if (SomePHI->getNumIncomingValues() != 2)
691 Pred1 = SomePHI->getIncomingBlock(0);
692 Pred2 = SomePHI->getIncomingBlock(1);
694 pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
695 if (PI == PE) // No predecessor
698 if (PI == PE) // Only one predecessor
701 if (PI != PE) // More than two predecessors
705 // We can only handle branches. Other control flow will be lowered to
706 // branches if possible anyway.
707 BranchInst *Pred1Br = dyn_cast<BranchInst>(Pred1->getTerminator());
708 BranchInst *Pred2Br = dyn_cast<BranchInst>(Pred2->getTerminator());
709 if (Pred1Br == 0 || Pred2Br == 0)
712 // Eliminate code duplication by ensuring that Pred1Br is conditional if
714 if (Pred2Br->isConditional()) {
715 // If both branches are conditional, we don't have an "if statement". In
716 // reality, we could transform this case, but since the condition will be
717 // required anyway, we stand no chance of eliminating it, so the xform is
718 // probably not profitable.
719 if (Pred1Br->isConditional())
722 std::swap(Pred1, Pred2);
723 std::swap(Pred1Br, Pred2Br);
726 if (Pred1Br->isConditional()) {
727 // The only thing we have to watch out for here is to make sure that Pred2
728 // doesn't have incoming edges from other blocks. If it does, the condition
729 // doesn't dominate BB.
730 if (Pred2->getSinglePredecessor() == 0)
733 // If we found a conditional branch predecessor, make sure that it branches
734 // to BB and Pred2Br. If it doesn't, this isn't an "if statement".
735 if (Pred1Br->getSuccessor(0) == BB &&
736 Pred1Br->getSuccessor(1) == Pred2) {
739 } else if (Pred1Br->getSuccessor(0) == Pred2 &&
740 Pred1Br->getSuccessor(1) == BB) {
744 // We know that one arm of the conditional goes to BB, so the other must
745 // go somewhere unrelated, and this must not be an "if statement".
749 return Pred1Br->getCondition();
752 // Ok, if we got here, both predecessors end with an unconditional branch to
753 // BB. Don't panic! If both blocks only have a single (identical)
754 // predecessor, and THAT is a conditional branch, then we're all ok!
755 BasicBlock *CommonPred = Pred1->getSinglePredecessor();
756 if (CommonPred == 0 || CommonPred != Pred2->getSinglePredecessor())
759 // Otherwise, if this is a conditional branch, then we can use it!
760 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator());
761 if (BI == 0) return 0;
763 assert(BI->isConditional() && "Two successors but not conditional?");
764 if (BI->getSuccessor(0) == Pred1) {
771 return BI->getCondition();