Chris Lattner | 184b298 | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 1 | //===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===// |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 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. |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | f739fa8 | 2002-04-08 22:03:57 +0000 | [diff] [blame] | 10 | // This file implements the BasicBlock class for the VMCore library. |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 14 | #include "llvm/BasicBlock.h" |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 15 | #include "llvm/Constants.h" |
Misha Brukman | 2d3fa9e | 2004-07-29 16:53:53 +0000 | [diff] [blame] | 16 | #include "llvm/Instructions.h" |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 17 | #include "llvm/Type.h" |
Chris Lattner | 83d485b | 2002-02-12 22:39:50 +0000 | [diff] [blame] | 18 | #include "llvm/Support/CFG.h" |
Reid Spencer | 7c16caa | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 19 | #include "llvm/Support/LeakDetector.h" |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 20 | #include "SymbolTableListTraitsImpl.h" |
| 21 | #include <algorithm> |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 22 | using namespace llvm; |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 23 | |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 24 | namespace { |
| 25 | /// DummyInst - An instance of this class is used to mark the end of the |
| 26 | /// instruction list. This is not a real instruction. |
| 27 | struct DummyInst : public Instruction { |
Chris Lattner | 5d1bc2c | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 28 | DummyInst() : Instruction(Type::VoidTy, OtherOpsEnd, 0, 0) { |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 29 | // This should not be garbage monitored. |
| 30 | LeakDetector::removeGarbageObject(this); |
| 31 | } |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 32 | |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 33 | virtual Instruction *clone() const { |
| 34 | assert(0 && "Cannot clone EOL");abort(); |
| 35 | return 0; |
| 36 | } |
| 37 | virtual const char *getOpcodeName() const { return "*end-of-list-inst*"; } |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 38 | |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 39 | // Methods for support type inquiry through isa, cast, and dyn_cast... |
| 40 | static inline bool classof(const DummyInst *) { return true; } |
| 41 | static inline bool classof(const Instruction *I) { |
| 42 | return I->getOpcode() == OtherOpsEnd; |
| 43 | } |
| 44 | static inline bool classof(const Value *V) { |
| 45 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); |
| 46 | } |
| 47 | }; |
| 48 | } |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 49 | |
Chris Lattner | f6c93e3 | 2005-01-30 00:09:23 +0000 | [diff] [blame] | 50 | Instruction *ilist_traits<Instruction>::createSentinel() { |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 51 | return new DummyInst(); |
| 52 | } |
| 53 | iplist<Instruction> &ilist_traits<Instruction>::getList(BasicBlock *BB) { |
| 54 | return BB->getInstList(); |
| 55 | } |
| 56 | |
| 57 | // Explicit instantiation of SymbolTableListTraits since some of the methods |
| 58 | // are not in the public header file... |
Chris Lattner | 41baa98 | 2003-11-05 05:15:42 +0000 | [diff] [blame] | 59 | template class SymbolTableListTraits<Instruction, BasicBlock, Function>; |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 60 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 61 | |
Chris Lattner | bb5f0db | 2004-02-04 03:57:50 +0000 | [diff] [blame] | 62 | BasicBlock::BasicBlock(const std::string &Name, Function *Parent, |
| 63 | BasicBlock *InsertBefore) |
Chris Lattner | 4dfede8 | 2002-09-26 05:03:22 +0000 | [diff] [blame] | 64 | : Value(Type::LabelTy, Value::BasicBlockVal, Name) { |
| 65 | // Initialize the instlist... |
| 66 | InstList.setItemParent(this); |
| 67 | |
| 68 | // Make sure that we get added to a function |
| 69 | LeakDetector::addGarbageObject(this); |
| 70 | |
| 71 | if (InsertBefore) { |
Chris Lattner | bb5f0db | 2004-02-04 03:57:50 +0000 | [diff] [blame] | 72 | assert(Parent && |
| 73 | "Cannot insert block before another block with no function!"); |
| 74 | Parent->getBasicBlockList().insert(InsertBefore, this); |
| 75 | } else if (Parent) { |
| 76 | Parent->getBasicBlockList().push_back(this); |
Chris Lattner | 4dfede8 | 2002-09-26 05:03:22 +0000 | [diff] [blame] | 77 | } |
| 78 | } |
| 79 | |
| 80 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 81 | BasicBlock::~BasicBlock() { |
Misha Brukman | ede10c9 | 2004-04-16 17:37:12 +0000 | [diff] [blame] | 82 | assert(getParent() == 0 && "BasicBlock still linked into the program!"); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 83 | dropAllReferences(); |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 84 | InstList.clear(); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 85 | } |
| 86 | |
Chris Lattner | 9ed7aef | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 87 | void BasicBlock::setParent(Function *parent) { |
Chris Lattner | 184b298 | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 88 | if (getParent()) |
| 89 | LeakDetector::addGarbageObject(this); |
| 90 | |
Chris Lattner | 9ed7aef | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 91 | InstList.setParent(parent); |
Chris Lattner | 184b298 | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 92 | |
| 93 | if (getParent()) |
| 94 | LeakDetector::removeGarbageObject(this); |
Chris Lattner | 9ed7aef | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 95 | } |
| 96 | |
Chris Lattner | 02a71e7 | 2004-10-11 22:21:39 +0000 | [diff] [blame] | 97 | void BasicBlock::removeFromParent() { |
| 98 | getParent()->getBasicBlockList().remove(this); |
| 99 | } |
| 100 | |
| 101 | void BasicBlock::eraseFromParent() { |
| 102 | getParent()->getBasicBlockList().erase(this); |
| 103 | } |
| 104 | |
Chris Lattner | e09bbc8 | 2005-08-12 22:14:06 +0000 | [diff] [blame] | 105 | /// moveBefore - Unlink this instruction from its current function and |
| 106 | /// insert it into the function that MovePos lives in, right before |
| 107 | /// MovePos. |
| 108 | void BasicBlock::moveBefore(BasicBlock *MovePos) { |
| 109 | MovePos->getParent()->getBasicBlockList().splice(MovePos, |
| 110 | getParent()->getBasicBlockList(), this); |
| 111 | } |
| 112 | |
Chris Lattner | 02a71e7 | 2004-10-11 22:21:39 +0000 | [diff] [blame] | 113 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 114 | TerminatorInst *BasicBlock::getTerminator() { |
| 115 | if (InstList.empty()) return 0; |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 116 | return dyn_cast<TerminatorInst>(&InstList.back()); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 117 | } |
| 118 | |
| 119 | const TerminatorInst *const BasicBlock::getTerminator() const { |
| 120 | if (InstList.empty()) return 0; |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 121 | return dyn_cast<TerminatorInst>(&InstList.back()); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 122 | } |
| 123 | |
Vladimir Prus | b5b6dc4 | 2006-06-08 15:46:18 +0000 | [diff] [blame^] | 124 | Instruction* BasicBlock::getFirstNonPHI() |
| 125 | { |
| 126 | BasicBlock::iterator i = begin(), e = end(); |
| 127 | // All valid basic blocks should have a terminator, |
| 128 | // which is not a PHINode. If we have invalid basic |
| 129 | // block we'll get assert when dereferencing past-the-end |
| 130 | // iterator. |
| 131 | while (isa<PHINode>(i)) ++i; |
| 132 | return &*i; |
| 133 | } |
| 134 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 135 | void BasicBlock::dropAllReferences() { |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 136 | for(iterator I = begin(), E = end(); I != E; ++I) |
| 137 | I->dropAllReferences(); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 138 | } |
| 139 | |
Chris Lattner | ce046ac | 2005-02-24 02:37:26 +0000 | [diff] [blame] | 140 | /// getSinglePredecessor - If this basic block has a single predecessor block, |
| 141 | /// return the block, otherwise return a null pointer. |
| 142 | BasicBlock *BasicBlock::getSinglePredecessor() { |
| 143 | pred_iterator PI = pred_begin(this), E = pred_end(this); |
| 144 | if (PI == E) return 0; // No preds. |
| 145 | BasicBlock *ThePred = *PI; |
| 146 | ++PI; |
| 147 | return (PI == E) ? ThePred : 0 /*multiple preds*/; |
| 148 | } |
| 149 | |
Chris Lattner | 954c64d | 2005-04-21 16:06:03 +0000 | [diff] [blame] | 150 | /// removePredecessor - This method is used to notify a BasicBlock that the |
| 151 | /// specified Predecessor of the block is no longer able to reach it. This is |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 152 | /// actually not used to update the Predecessor list, but is actually used to |
Chris Lattner | 954c64d | 2005-04-21 16:06:03 +0000 | [diff] [blame] | 153 | /// update the PHI nodes that reside in the block. Note that this should be |
| 154 | /// called while the predecessor still refers to this block. |
| 155 | /// |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 156 | void BasicBlock::removePredecessor(BasicBlock *Pred, |
| 157 | bool DontDeleteUselessPHIs) { |
Chris Lattner | 25169ca | 2005-02-23 16:53:04 +0000 | [diff] [blame] | 158 | assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs. |
Chris Lattner | cf08c21 | 2005-02-23 07:09:08 +0000 | [diff] [blame] | 159 | find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && |
Jeff Cohen | 8263985 | 2005-04-23 21:38:35 +0000 | [diff] [blame] | 160 | "removePredecessor: BB is not a predecessor!"); |
Chris Lattner | cf08c21 | 2005-02-23 07:09:08 +0000 | [diff] [blame] | 161 | |
Chris Lattner | 8d0b1b2 | 2004-12-11 22:10:29 +0000 | [diff] [blame] | 162 | if (InstList.empty()) return; |
Chris Lattner | bea7247 | 2004-07-06 17:44:17 +0000 | [diff] [blame] | 163 | PHINode *APN = dyn_cast<PHINode>(&front()); |
| 164 | if (!APN) return; // Quick exit. |
Chris Lattner | 615d3cf | 2001-06-29 05:25:23 +0000 | [diff] [blame] | 165 | |
| 166 | // If there are exactly two predecessors, then we want to nuke the PHI nodes |
Chris Lattner | bea7247 | 2004-07-06 17:44:17 +0000 | [diff] [blame] | 167 | // altogether. However, we cannot do this, if this in this case: |
Chris Lattner | f7373e4 | 2002-05-21 19:52:49 +0000 | [diff] [blame] | 168 | // |
| 169 | // Loop: |
| 170 | // %x = phi [X, Loop] |
| 171 | // %x2 = add %x, 1 ;; This would become %x2 = add %x2, 1 |
| 172 | // br Loop ;; %x2 does not dominate all uses |
| 173 | // |
| 174 | // This is because the PHI node input is actually taken from the predecessor |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 175 | // basic block. The only case this can happen is with a self loop, so we |
Chris Lattner | f7373e4 | 2002-05-21 19:52:49 +0000 | [diff] [blame] | 176 | // check for this case explicitly now. |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 177 | // |
Chris Lattner | bea7247 | 2004-07-06 17:44:17 +0000 | [diff] [blame] | 178 | unsigned max_idx = APN->getNumIncomingValues(); |
Chris Lattner | 615d3cf | 2001-06-29 05:25:23 +0000 | [diff] [blame] | 179 | assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!"); |
Chris Lattner | f7373e4 | 2002-05-21 19:52:49 +0000 | [diff] [blame] | 180 | if (max_idx == 2) { |
Chris Lattner | bea7247 | 2004-07-06 17:44:17 +0000 | [diff] [blame] | 181 | BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred); |
Chris Lattner | f7373e4 | 2002-05-21 19:52:49 +0000 | [diff] [blame] | 182 | |
| 183 | // Disable PHI elimination! |
| 184 | if (this == Other) max_idx = 3; |
| 185 | } |
| 186 | |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 187 | // <= Two predecessors BEFORE I remove one? |
| 188 | if (max_idx <= 2 && !DontDeleteUselessPHIs) { |
Chris Lattner | da55810 | 2001-10-02 03:41:24 +0000 | [diff] [blame] | 189 | // Yup, loop through and nuke the PHI nodes |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 190 | while (PHINode *PN = dyn_cast<PHINode>(&front())) { |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 191 | // Remove the predecessor first. |
| 192 | PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs); |
Chris Lattner | 615d3cf | 2001-06-29 05:25:23 +0000 | [diff] [blame] | 193 | |
| 194 | // If the PHI _HAD_ two uses, replace PHI node with its now *single* value |
Chris Lattner | caf5b50 | 2002-10-08 21:36:34 +0000 | [diff] [blame] | 195 | if (max_idx == 2) { |
Chris Lattner | ef8c833 | 2003-04-25 23:14:19 +0000 | [diff] [blame] | 196 | if (PN->getOperand(0) != PN) |
| 197 | PN->replaceAllUsesWith(PN->getOperand(0)); |
| 198 | else |
| 199 | // We are left with an infinite loop with no entries: kill the PHI. |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 200 | PN->replaceAllUsesWith(UndefValue::get(PN->getType())); |
Chris Lattner | caf5b50 | 2002-10-08 21:36:34 +0000 | [diff] [blame] | 201 | getInstList().pop_front(); // Remove the PHI node |
| 202 | } |
| 203 | |
| 204 | // If the PHI node already only had one entry, it got deleted by |
| 205 | // removeIncomingValue. |
Chris Lattner | 615d3cf | 2001-06-29 05:25:23 +0000 | [diff] [blame] | 206 | } |
| 207 | } else { |
| 208 | // Okay, now we know that we need to remove predecessor #pred_idx from all |
| 209 | // PHI nodes. Iterate over each PHI node fixing them up |
Chris Lattner | 708ee9d | 2004-06-05 00:11:27 +0000 | [diff] [blame] | 210 | PHINode *PN; |
Chris Lattner | 1749aaa | 2005-08-05 15:34:10 +0000 | [diff] [blame] | 211 | for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) { |
| 212 | ++II; |
Chris Lattner | 9daef35 | 2005-04-12 18:52:14 +0000 | [diff] [blame] | 213 | PN->removeIncomingValue(Pred, false); |
Nate Begeman | b392321 | 2005-08-04 23:24:19 +0000 | [diff] [blame] | 214 | // If all incoming values to the Phi are the same, we can replace the Phi |
| 215 | // with that value. |
Chris Lattner | 6f58350 | 2005-08-05 01:02:04 +0000 | [diff] [blame] | 216 | if (Value *PNV = PN->hasConstantValue()) { |
| 217 | PN->replaceAllUsesWith(PNV); |
| 218 | PN->eraseFromParent(); |
| 219 | } |
Nate Begeman | b392321 | 2005-08-04 23:24:19 +0000 | [diff] [blame] | 220 | } |
Chris Lattner | 615d3cf | 2001-06-29 05:25:23 +0000 | [diff] [blame] | 221 | } |
| 222 | } |
| 223 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 224 | |
Chris Lattner | 7ceb081 | 2005-04-21 16:04:49 +0000 | [diff] [blame] | 225 | /// splitBasicBlock - This splits a basic block into two at the specified |
| 226 | /// instruction. Note that all instructions BEFORE the specified iterator stay |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 227 | /// as part of the original basic block, an unconditional branch is added to |
Chris Lattner | 7ceb081 | 2005-04-21 16:04:49 +0000 | [diff] [blame] | 228 | /// the new BB, and the rest of the instructions in the BB are moved to the new |
| 229 | /// BB, including the old terminator. This invalidates the iterator. |
| 230 | /// |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 231 | /// Note that this only works on well formed basic blocks (must have a |
Chris Lattner | 7ceb081 | 2005-04-21 16:04:49 +0000 | [diff] [blame] | 232 | /// terminator), and 'I' must not be the end of instruction list (which would |
| 233 | /// cause a degenerate basic block to be formed, having a terminator inside of |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 234 | /// the basic block). |
Chris Lattner | 7ceb081 | 2005-04-21 16:04:49 +0000 | [diff] [blame] | 235 | /// |
Chris Lattner | 6d56935 | 2003-08-24 03:41:39 +0000 | [diff] [blame] | 236 | BasicBlock *BasicBlock::splitBasicBlock(iterator I, const std::string &BBName) { |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 237 | assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!"); |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 238 | assert(I != InstList.end() && |
Jeff Cohen | 8263985 | 2005-04-23 21:38:35 +0000 | [diff] [blame] | 239 | "Trying to get me to create degenerate basic block!"); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 240 | |
Chris Lattner | bb5f0db | 2004-02-04 03:57:50 +0000 | [diff] [blame] | 241 | BasicBlock *New = new BasicBlock(BBName, getParent(), getNext()); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 242 | |
Chris Lattner | c4c7ea5 | 2004-02-03 23:11:21 +0000 | [diff] [blame] | 243 | // Move all of the specified instructions from the original basic block into |
| 244 | // the new basic block. |
| 245 | New->getInstList().splice(New->end(), this->getInstList(), I, end()); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 246 | |
| 247 | // Add a branch instruction to the newly formed basic block. |
Chris Lattner | a296000 | 2003-11-21 16:52:05 +0000 | [diff] [blame] | 248 | new BranchInst(New, this); |
Chris Lattner | 4eed0b8 | 2002-02-25 00:35:07 +0000 | [diff] [blame] | 249 | |
| 250 | // Now we must loop through all of the successors of the New block (which |
| 251 | // _were_ the successors of the 'this' block), and update any PHI nodes in |
| 252 | // successors. If there were PHI nodes in the successors, then they need to |
| 253 | // know that incoming branches will be from New, not from Old. |
| 254 | // |
Chris Lattner | 64d88bc | 2003-09-24 22:03:22 +0000 | [diff] [blame] | 255 | for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { |
Chris Lattner | 4eed0b8 | 2002-02-25 00:35:07 +0000 | [diff] [blame] | 256 | // Loop over any phi nodes in the basic block, updating the BB field of |
| 257 | // incoming values... |
| 258 | BasicBlock *Successor = *I; |
Chris Lattner | 708ee9d | 2004-06-05 00:11:27 +0000 | [diff] [blame] | 259 | PHINode *PN; |
Chris Lattner | 4eed0b8 | 2002-02-25 00:35:07 +0000 | [diff] [blame] | 260 | for (BasicBlock::iterator II = Successor->begin(); |
Chris Lattner | 08d1b9d | 2004-06-05 17:43:52 +0000 | [diff] [blame] | 261 | (PN = dyn_cast<PHINode>(II)); ++II) { |
Chris Lattner | 4eed0b8 | 2002-02-25 00:35:07 +0000 | [diff] [blame] | 262 | int IDX = PN->getBasicBlockIndex(this); |
| 263 | while (IDX != -1) { |
| 264 | PN->setIncomingBlock((unsigned)IDX, New); |
| 265 | IDX = PN->getBasicBlockIndex(this); |
| 266 | } |
| 267 | } |
| 268 | } |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 269 | return New; |
| 270 | } |