Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 1 | //===-- BasicBlockUtils.cpp - BasicBlock Utilities -------------------------==// |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 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. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 9 | // |
| 10 | // This family of functions perform manipulations on basic blocks, and |
| 11 | // instructions contained within basic blocks. |
| 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
| 15 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
| 16 | #include "llvm/Function.h" |
Chris Lattner | b0f0ef8 | 2002-07-29 22:32:08 +0000 | [diff] [blame] | 17 | #include "llvm/iTerminators.h" |
| 18 | #include "llvm/Constant.h" |
| 19 | #include "llvm/Type.h" |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 20 | #include <algorithm> |
| 21 | |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 22 | namespace llvm { |
| 23 | |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 24 | // ReplaceInstWithValue - Replace all uses of an instruction (specified by BI) |
| 25 | // with a value, then remove and delete the original instruction. |
| 26 | // |
| 27 | void ReplaceInstWithValue(BasicBlock::InstListType &BIL, |
| 28 | BasicBlock::iterator &BI, Value *V) { |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 29 | Instruction &I = *BI; |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 30 | // Replaces all of the uses of the instruction with uses of the value |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 31 | I.replaceAllUsesWith(V); |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 32 | |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 33 | std::string OldName = I.getName(); |
| 34 | |
Misha Brukman | 5560c9d | 2003-08-18 14:43:39 +0000 | [diff] [blame] | 35 | // Delete the unnecessary instruction now... |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 36 | BI = BIL.erase(BI); |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 37 | |
Misha Brukman | a3bbcb5 | 2002-10-29 23:06:16 +0000 | [diff] [blame] | 38 | // Make sure to propagate a name if there is one already... |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 39 | if (OldName.size() && !V->hasName()) |
Chris Lattner | 6e6026b | 2002-11-20 18:36:02 +0000 | [diff] [blame] | 40 | V->setName(OldName, &BIL.getParent()->getSymbolTable()); |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 41 | } |
| 42 | |
| 43 | |
| 44 | // ReplaceInstWithInst - Replace the instruction specified by BI with the |
| 45 | // instruction specified by I. The original instruction is deleted and BI is |
| 46 | // updated to point to the new instruction. |
| 47 | // |
| 48 | void ReplaceInstWithInst(BasicBlock::InstListType &BIL, |
| 49 | BasicBlock::iterator &BI, Instruction *I) { |
| 50 | assert(I->getParent() == 0 && |
| 51 | "ReplaceInstWithInst: Instruction already inserted into basic block!"); |
| 52 | |
| 53 | // Insert the new instruction into the basic block... |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 54 | BasicBlock::iterator New = BIL.insert(BI, I); |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 55 | |
| 56 | // Replace all uses of the old instruction, and delete it. |
| 57 | ReplaceInstWithValue(BIL, BI, I); |
| 58 | |
| 59 | // Move BI back to point to the newly inserted instruction |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 60 | BI = New; |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 61 | } |
| 62 | |
| 63 | // ReplaceInstWithInst - Replace the instruction specified by From with the |
Chris Lattner | b0f0ef8 | 2002-07-29 22:32:08 +0000 | [diff] [blame] | 64 | // instruction specified by To. |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 65 | // |
| 66 | void ReplaceInstWithInst(Instruction *From, Instruction *To) { |
Chris Lattner | 1896150 | 2002-06-25 16:12:52 +0000 | [diff] [blame] | 67 | BasicBlock::iterator BI(From); |
| 68 | ReplaceInstWithInst(From->getParent()->getInstList(), BI, To); |
Chris Lattner | 4d1e46e | 2002-05-07 18:07:59 +0000 | [diff] [blame] | 69 | } |
Chris Lattner | b0f0ef8 | 2002-07-29 22:32:08 +0000 | [diff] [blame] | 70 | |
| 71 | // RemoveSuccessor - Change the specified terminator instruction such that its |
| 72 | // successor #SuccNum no longer exists. Because this reduces the outgoing |
| 73 | // degree of the current basic block, the actual terminator instruction itself |
| 74 | // may have to be changed. In the case where the last successor of the block is |
| 75 | // deleted, a return instruction is inserted in its place which can cause a |
Misha Brukman | cf00c4a | 2003-10-10 17:57:28 +0000 | [diff] [blame] | 76 | // surprising change in program behavior if it is not expected. |
Chris Lattner | b0f0ef8 | 2002-07-29 22:32:08 +0000 | [diff] [blame] | 77 | // |
| 78 | void RemoveSuccessor(TerminatorInst *TI, unsigned SuccNum) { |
| 79 | assert(SuccNum < TI->getNumSuccessors() && |
| 80 | "Trying to remove a nonexistant successor!"); |
| 81 | |
| 82 | // If our old successor block contains any PHI nodes, remove the entry in the |
| 83 | // PHI nodes that comes from this branch... |
| 84 | // |
| 85 | BasicBlock *BB = TI->getParent(); |
| 86 | TI->getSuccessor(SuccNum)->removePredecessor(BB); |
| 87 | |
| 88 | TerminatorInst *NewTI = 0; |
| 89 | switch (TI->getOpcode()) { |
| 90 | case Instruction::Br: |
| 91 | // If this is a conditional branch... convert to unconditional branch. |
| 92 | if (TI->getNumSuccessors() == 2) { |
| 93 | cast<BranchInst>(TI)->setUnconditionalDest(TI->getSuccessor(1-SuccNum)); |
| 94 | } else { // Otherwise convert to a return instruction... |
| 95 | Value *RetVal = 0; |
| 96 | |
| 97 | // Create a value to return... if the function doesn't return null... |
| 98 | if (BB->getParent()->getReturnType() != Type::VoidTy) |
| 99 | RetVal = Constant::getNullValue(BB->getParent()->getReturnType()); |
| 100 | |
| 101 | // Create the return... |
| 102 | NewTI = new ReturnInst(RetVal); |
| 103 | } |
| 104 | break; |
| 105 | |
| 106 | case Instruction::Invoke: // Should convert to call |
| 107 | case Instruction::Switch: // Should remove entry |
| 108 | default: |
| 109 | case Instruction::Ret: // Cannot happen, has no successors! |
| 110 | assert(0 && "Unhandled terminator instruction type in RemoveSuccessor!"); |
| 111 | abort(); |
| 112 | } |
| 113 | |
| 114 | if (NewTI) // If it's a different instruction, replace. |
| 115 | ReplaceInstWithInst(TI, NewTI); |
| 116 | } |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 117 | |
| 118 | } // End llvm namespace |