1 //===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===//
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 file implements the BasicBlock class for the VMCore library.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/BasicBlock.h"
15 #include "llvm/Constants.h"
16 #include "llvm/Instructions.h"
17 #include "llvm/Type.h"
18 #include "llvm/Support/CFG.h"
19 #include "llvm/Support/LeakDetector.h"
20 #include "llvm/Support/Compiler.h"
21 #include "SymbolTableListTraitsImpl.h"
25 inline ValueSymbolTable *
26 ilist_traits<Instruction>::getSymTab(BasicBlock *BB) {
28 if (Function *F = BB->getParent())
29 return &F->getValueSymbolTable();
35 /// DummyInst - An instance of this class is used to mark the end of the
36 /// instruction list. This is not a real instruction.
37 struct VISIBILITY_HIDDEN DummyInst : public Instruction {
38 DummyInst() : Instruction(Type::VoidTy, OtherOpsEnd, 0, 0) {
39 // This should not be garbage monitored.
40 LeakDetector::removeGarbageObject(this);
43 Instruction *clone() const {
44 assert(0 && "Cannot clone EOL");abort();
47 const char *getOpcodeName() const { return "*end-of-list-inst*"; }
49 // Methods for support type inquiry through isa, cast, and dyn_cast...
50 static inline bool classof(const DummyInst *) { return true; }
51 static inline bool classof(const Instruction *I) {
52 return I->getOpcode() == OtherOpsEnd;
54 static inline bool classof(const Value *V) {
55 return isa<Instruction>(V) && classof(cast<Instruction>(V));
60 Instruction *ilist_traits<Instruction>::createSentinel() {
61 return new DummyInst();
63 iplist<Instruction> &ilist_traits<Instruction>::getList(BasicBlock *BB) {
64 return BB->getInstList();
67 // Explicit instantiation of SymbolTableListTraits since some of the methods
68 // are not in the public header file...
69 template class SymbolTableListTraits<Instruction, BasicBlock>;
72 BasicBlock::BasicBlock(const std::string &Name, Function *NewParent,
73 BasicBlock *InsertBefore, BasicBlock *Dest)
74 : User(Type::LabelTy, Value::BasicBlockVal, &unwindDest, 0), Parent(0) {
76 // Make sure that we get added to a function
77 LeakDetector::addGarbageObject(this);
81 "Cannot insert block before another block with no function!");
82 NewParent->getBasicBlockList().insert(InsertBefore, this);
83 } else if (NewParent) {
84 NewParent->getBasicBlockList().push_back(this);
88 unwindDest.init(NULL, this);
93 BasicBlock::~BasicBlock() {
94 assert(getParent() == 0 && "BasicBlock still linked into the program!");
99 void BasicBlock::setParent(Function *parent) {
101 LeakDetector::addGarbageObject(this);
103 // Set Parent=parent, updating instruction symtab entries as appropriate.
104 InstList.setSymTabObject(&Parent, parent);
107 LeakDetector::removeGarbageObject(this);
110 void BasicBlock::removeFromParent() {
111 getParent()->getBasicBlockList().remove(this);
114 void BasicBlock::eraseFromParent() {
115 getParent()->getBasicBlockList().erase(this);
118 const BasicBlock *BasicBlock::getUnwindDest() const {
119 return cast_or_null<const BasicBlock>(unwindDest.get());
122 BasicBlock *BasicBlock::getUnwindDest() {
123 return cast_or_null<BasicBlock>(unwindDest.get());
126 void BasicBlock::setUnwindDest(BasicBlock *dest) {
127 NumOperands = unwindDest ? 1 : 0;
128 unwindDest.set(dest);
131 /// moveBefore - Unlink this basic block from its current function and
132 /// insert it into the function that MovePos lives in, right before MovePos.
133 void BasicBlock::moveBefore(BasicBlock *MovePos) {
134 MovePos->getParent()->getBasicBlockList().splice(MovePos,
135 getParent()->getBasicBlockList(), this);
138 /// moveAfter - Unlink this basic block from its current function and
139 /// insert it into the function that MovePos lives in, right after MovePos.
140 void BasicBlock::moveAfter(BasicBlock *MovePos) {
141 Function::iterator I = MovePos;
142 MovePos->getParent()->getBasicBlockList().splice(++I,
143 getParent()->getBasicBlockList(), this);
147 TerminatorInst *BasicBlock::getTerminator() {
148 if (InstList.empty()) return 0;
149 return dyn_cast<TerminatorInst>(&InstList.back());
152 const TerminatorInst *BasicBlock::getTerminator() const {
153 if (InstList.empty()) return 0;
154 return dyn_cast<TerminatorInst>(&InstList.back());
157 Instruction* BasicBlock::getFirstNonPHI()
159 BasicBlock::iterator i = begin();
160 // All valid basic blocks should have a terminator,
161 // which is not a PHINode. If we have invalid basic
162 // block we'll get assert when dereferencing past-the-end
164 while (isa<PHINode>(i)) ++i;
168 void BasicBlock::dropAllReferences() {
170 for(iterator I = begin(), E = end(); I != E; ++I)
171 I->dropAllReferences();
174 /// getSinglePredecessor - If this basic block has a single predecessor block,
175 /// return the block, otherwise return a null pointer.
176 BasicBlock *BasicBlock::getSinglePredecessor() {
177 pred_iterator PI = pred_begin(this), E = pred_end(this);
178 if (PI == E) return 0; // No preds.
179 BasicBlock *ThePred = *PI;
181 return (PI == E) ? ThePred : 0 /*multiple preds*/;
184 /// removePredecessor - This method is used to notify a BasicBlock that the
185 /// specified Predecessor of the block is no longer able to reach it. This is
186 /// actually not used to update the Predecessor list, but is actually used to
187 /// update the PHI nodes that reside in the block. Note that this should be
188 /// called while the predecessor still refers to this block.
190 void BasicBlock::removePredecessor(BasicBlock *Pred,
191 bool DontDeleteUselessPHIs) {
192 assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs.
193 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
194 "removePredecessor: BB is not a predecessor!");
196 if (Pred == getUnwindDest())
199 if (InstList.empty()) return;
200 PHINode *APN = dyn_cast<PHINode>(&front());
201 if (!APN) return; // Quick exit.
203 // If there are exactly two predecessors, then we want to nuke the PHI nodes
204 // altogether. However, we cannot do this, if this in this case:
207 // %x = phi [X, Loop]
208 // %x2 = add %x, 1 ;; This would become %x2 = add %x2, 1
209 // br Loop ;; %x2 does not dominate all uses
211 // This is because the PHI node input is actually taken from the predecessor
212 // basic block. The only case this can happen is with a self loop, so we
213 // check for this case explicitly now.
215 unsigned max_idx = APN->getNumIncomingValues();
216 assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!");
218 BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred);
220 // Disable PHI elimination!
221 if (this == Other) max_idx = 3;
224 // <= Two predecessors BEFORE I remove one?
225 if (max_idx <= 2 && !DontDeleteUselessPHIs) {
226 // Yup, loop through and nuke the PHI nodes
227 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
228 // Remove the predecessor first.
229 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
231 // If the PHI _HAD_ two uses, replace PHI node with its now *single* value
233 if (PN->getOperand(0) != PN)
234 PN->replaceAllUsesWith(PN->getOperand(0));
236 // We are left with an infinite loop with no entries: kill the PHI.
237 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
238 getInstList().pop_front(); // Remove the PHI node
241 // If the PHI node already only had one entry, it got deleted by
242 // removeIncomingValue.
245 // Okay, now we know that we need to remove predecessor #pred_idx from all
246 // PHI nodes. Iterate over each PHI node fixing them up
248 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) {
250 PN->removeIncomingValue(Pred, false);
251 // If all incoming values to the Phi are the same, we can replace the Phi
254 if (!DontDeleteUselessPHIs && (PNV = PN->hasConstantValue())) {
255 PN->replaceAllUsesWith(PNV);
256 PN->eraseFromParent();
263 /// splitBasicBlock - This splits a basic block into two at the specified
264 /// instruction. Note that all instructions BEFORE the specified iterator stay
265 /// as part of the original basic block, an unconditional branch is added to
266 /// the new BB, and the rest of the instructions in the BB are moved to the new
267 /// BB, including the old terminator. This invalidates the iterator.
269 /// Note that this only works on well formed basic blocks (must have a
270 /// terminator), and 'I' must not be the end of instruction list (which would
271 /// cause a degenerate basic block to be formed, having a terminator inside of
272 /// the basic block).
274 BasicBlock *BasicBlock::splitBasicBlock(iterator I, const std::string &BBName) {
275 assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!");
276 assert(I != InstList.end() &&
277 "Trying to get me to create degenerate basic block!");
279 BasicBlock *New = new BasicBlock(BBName, getParent(), getNext());
281 // Move all of the specified instructions from the original basic block into
282 // the new basic block.
283 New->getInstList().splice(New->end(), this->getInstList(), I, end());
285 // Add a branch instruction to the newly formed basic block.
286 new BranchInst(New, this);
288 // Now we must loop through all of the successors of the New block (which
289 // _were_ the successors of the 'this' block), and update any PHI nodes in
290 // successors. If there were PHI nodes in the successors, then they need to
291 // know that incoming branches will be from New, not from Old.
293 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) {
294 // Loop over any phi nodes in the basic block, updating the BB field of
295 // incoming values...
296 BasicBlock *Successor = *I;
298 for (BasicBlock::iterator II = Successor->begin();
299 (PN = dyn_cast<PHINode>(II)); ++II) {
300 int IDX = PN->getBasicBlockIndex(this);
302 PN->setIncomingBlock((unsigned)IDX, New);
303 IDX = PN->getBasicBlockIndex(this);