BasicBlock.cpp revision 44336292fcd9f3f99cbfc2c3366bea0cf95bb675
1d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner//===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===// 2b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 5b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// This file was developed by the LLVM research group and is distributed under 6b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// the University of Illinois Open Source License. See LICENSE.TXT for details. 7b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 8b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell//===----------------------------------------------------------------------===// 9009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// 10b7653df0853f06112b741be09f1b7ae5a6aa6fdeChris Lattner// This file implements the BasicBlock class for the VMCore library. 11009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// 12009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner//===----------------------------------------------------------------------===// 13009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 147e70829632f82de15db187845666aaca6e04b792Chris Lattner#include "llvm/BasicBlock.h" 1544336292fcd9f3f99cbfc2c3366bea0cf95bb675Misha Brukman#include "llvm/Constant.h" 1644336292fcd9f3f99cbfc2c3366bea0cf95bb675Misha Brukman#include "llvm/Instructions.h" 17009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner#include "llvm/Type.h" 18455889aa79e3463a4b0f2161e3d9d72a683268b6Chris Lattner#include "llvm/Support/CFG.h" 197e70829632f82de15db187845666aaca6e04b792Chris Lattner#include "llvm/SymbolTable.h" 20d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner#include "Support/LeakDetector.h" 217e70829632f82de15db187845666aaca6e04b792Chris Lattner#include "SymbolTableListTraitsImpl.h" 227e70829632f82de15db187845666aaca6e04b792Chris Lattner#include <algorithm> 23108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattnerusing namespace llvm; 24108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner 25108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattnernamespace { 26108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner /// DummyInst - An instance of this class is used to mark the end of the 27108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner /// instruction list. This is not a real instruction. 28108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner struct DummyInst : public Instruction { 29108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner DummyInst() : Instruction(Type::VoidTy, OtherOpsEnd) { 30108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner // This should not be garbage monitored. 31108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner LeakDetector::removeGarbageObject(this); 32108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner } 33009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 34108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner virtual Instruction *clone() const { 35108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner assert(0 && "Cannot clone EOL");abort(); 36108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner return 0; 37108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner } 38108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner virtual const char *getOpcodeName() const { return "*end-of-list-inst*"; } 397e70829632f82de15db187845666aaca6e04b792Chris Lattner 40108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner // Methods for support type inquiry through isa, cast, and dyn_cast... 41108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner static inline bool classof(const DummyInst *) { return true; } 42108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner static inline bool classof(const Instruction *I) { 43108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner return I->getOpcode() == OtherOpsEnd; 44108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner } 45108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner static inline bool classof(const Value *V) { 46108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner return isa<Instruction>(V) && classof(cast<Instruction>(V)); 47108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner } 48108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner }; 49108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner} 507e70829632f82de15db187845666aaca6e04b792Chris Lattner 517e70829632f82de15db187845666aaca6e04b792Chris LattnerInstruction *ilist_traits<Instruction>::createNode() { 527e70829632f82de15db187845666aaca6e04b792Chris Lattner return new DummyInst(); 537e70829632f82de15db187845666aaca6e04b792Chris Lattner} 547e70829632f82de15db187845666aaca6e04b792Chris Lattneriplist<Instruction> &ilist_traits<Instruction>::getList(BasicBlock *BB) { 557e70829632f82de15db187845666aaca6e04b792Chris Lattner return BB->getInstList(); 567e70829632f82de15db187845666aaca6e04b792Chris Lattner} 577e70829632f82de15db187845666aaca6e04b792Chris Lattner 587e70829632f82de15db187845666aaca6e04b792Chris Lattner// Explicit instantiation of SymbolTableListTraits since some of the methods 597e70829632f82de15db187845666aaca6e04b792Chris Lattner// are not in the public header file... 60e860e0d69c9c155704cd3c4b2533410a8c782d9eChris Lattnertemplate class SymbolTableListTraits<Instruction, BasicBlock, Function>; 617e70829632f82de15db187845666aaca6e04b792Chris Lattner 62009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 634f05611ed948ed1fb3e861d178aae18bd025ce1cChris LattnerBasicBlock::BasicBlock(const std::string &Name, Function *Parent, 644f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner BasicBlock *InsertBefore) 650a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner : Value(Type::LabelTy, Value::BasicBlockVal, Name) { 660a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner // Initialize the instlist... 670a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner InstList.setItemParent(this); 680a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner 690a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner // Make sure that we get added to a function 700a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner LeakDetector::addGarbageObject(this); 710a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner 720a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner if (InsertBefore) { 734f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner assert(Parent && 744f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner "Cannot insert block before another block with no function!"); 754f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner Parent->getBasicBlockList().insert(InsertBefore, this); 764f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner } else if (Parent) { 774f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner Parent->getBasicBlockList().push_back(this); 780a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner } 790a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner} 800a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner 810a1a874d1f4659f02c0d4fdd6be69f1188bd0625Chris Lattner 82009505452b713ed2e3a8e99c5545a6e721c65495Chris LattnerBasicBlock::~BasicBlock() { 83ea51deb18a60d37e546909af4aa95ca6f2c5d56fMisha Brukman assert(getParent() == 0 && "BasicBlock still linked into the program!"); 84009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner dropAllReferences(); 857e70829632f82de15db187845666aaca6e04b792Chris Lattner InstList.clear(); 86009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 87009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 88bded132d00ed626a6541b67ad101ef0fd47d3491Chris Lattnervoid BasicBlock::setParent(Function *parent) { 89d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner if (getParent()) 90d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner LeakDetector::addGarbageObject(this); 91d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner 92bded132d00ed626a6541b67ad101ef0fd47d3491Chris Lattner InstList.setParent(parent); 93d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner 94d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner if (getParent()) 95d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner LeakDetector::removeGarbageObject(this); 96bded132d00ed626a6541b67ad101ef0fd47d3491Chris Lattner} 97bded132d00ed626a6541b67ad101ef0fd47d3491Chris Lattner 98009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// Specialize setName to take care of symbol table majik 99697954c15da58bd8b186dbafdedd8b06db770201Chris Lattnervoid BasicBlock::setName(const std::string &name, SymbolTable *ST) { 100b7653df0853f06112b741be09f1b7ae5a6aa6fdeChris Lattner Function *P; 1016e6026b46569b01f8f6d4dcdb6c899c3a9c76b3eChris Lattner assert((ST == 0 || (!getParent() || ST == &getParent()->getSymbolTable())) && 1026892b126e3d3b90f13744cc1a7c83fd7f8d615f2Chris Lattner "Invalid symtab argument!"); 1036e6026b46569b01f8f6d4dcdb6c899c3a9c76b3eChris Lattner if ((P = getParent()) && hasName()) P->getSymbolTable().remove(this); 104009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner Value::setName(name); 1056e6026b46569b01f8f6d4dcdb6c899c3a9c76b3eChris Lattner if (P && hasName()) P->getSymbolTable().insert(this); 106009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 107009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 108009505452b713ed2e3a8e99c5545a6e721c65495Chris LattnerTerminatorInst *BasicBlock::getTerminator() { 109009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner if (InstList.empty()) return 0; 1107e70829632f82de15db187845666aaca6e04b792Chris Lattner return dyn_cast<TerminatorInst>(&InstList.back()); 111009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 112009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 113009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattnerconst TerminatorInst *const BasicBlock::getTerminator() const { 114009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner if (InstList.empty()) return 0; 1157e70829632f82de15db187845666aaca6e04b792Chris Lattner return dyn_cast<TerminatorInst>(&InstList.back()); 116009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 117009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 118009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattnervoid BasicBlock::dropAllReferences() { 1197e70829632f82de15db187845666aaca6e04b792Chris Lattner for(iterator I = begin(), E = end(); I != E; ++I) 1207e70829632f82de15db187845666aaca6e04b792Chris Lattner I->dropAllReferences(); 121009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 122009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 123b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// removePredecessor - This method is used to notify a BasicBlock that the 124b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// specified Predecessor of the block is no longer able to reach it. This is 125b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// actually not used to update the Predecessor list, but is actually used to 126b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// update the PHI nodes that reside in the block. Note that this should be 127b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// called while the predecessor still refers to this block. 128b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner// 129b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattnervoid BasicBlock::removePredecessor(BasicBlock *Pred) { 130455889aa79e3463a4b0f2161e3d9d72a683268b6Chris Lattner assert(find(pred_begin(this), pred_end(this), Pred) != pred_end(this) && 131b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner "removePredecessor: BB is not a predecessor!"); 132a9e7781b3b8e457946491529816feab73c66d774Chris Lattner PHINode *APN = dyn_cast<PHINode>(&front()); 133a9e7781b3b8e457946491529816feab73c66d774Chris Lattner if (!APN) return; // Quick exit. 134b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 135b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // If there are exactly two predecessors, then we want to nuke the PHI nodes 136a9e7781b3b8e457946491529816feab73c66d774Chris Lattner // altogether. However, we cannot do this, if this in this case: 13787a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // 13887a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // Loop: 13987a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // %x = phi [X, Loop] 14087a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // %x2 = add %x, 1 ;; This would become %x2 = add %x2, 1 14187a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // br Loop ;; %x2 does not dominate all uses 14287a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // 14387a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // This is because the PHI node input is actually taken from the predecessor 14487a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // basic block. The only case this can happen is with a self loop, so we 14587a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // check for this case explicitly now. 14687a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // 147a9e7781b3b8e457946491529816feab73c66d774Chris Lattner unsigned max_idx = APN->getNumIncomingValues(); 148b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!"); 14987a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner if (max_idx == 2) { 150a9e7781b3b8e457946491529816feab73c66d774Chris Lattner BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred); 15187a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner 15287a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // Disable PHI elimination! 15387a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner if (this == Other) max_idx = 3; 15487a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner } 15587a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner 156b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner if (max_idx <= 2) { // <= Two predecessors BEFORE I remove one? 157b00c582b6d40e6b9ff2d1ed4f5eaf7930e792aceChris Lattner // Yup, loop through and nuke the PHI nodes 1587e70829632f82de15db187845666aaca6e04b792Chris Lattner while (PHINode *PN = dyn_cast<PHINode>(&front())) { 159b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner PN->removeIncomingValue(Pred); // Remove the predecessor first... 160b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 161b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // If the PHI _HAD_ two uses, replace PHI node with its now *single* value 162dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner if (max_idx == 2) { 16302a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner if (PN->getOperand(0) != PN) 16402a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner PN->replaceAllUsesWith(PN->getOperand(0)); 16502a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner else 16602a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner // We are left with an infinite loop with no entries: kill the PHI. 16702a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner PN->replaceAllUsesWith(Constant::getNullValue(PN->getType())); 168dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner getInstList().pop_front(); // Remove the PHI node 169dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner } 170dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner 171dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner // If the PHI node already only had one entry, it got deleted by 172dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner // removeIncomingValue. 173b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } 174b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } else { 175b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // Okay, now we know that we need to remove predecessor #pred_idx from all 176b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // PHI nodes. Iterate over each PHI node fixing them up 177f878218c972dc570eb50e739c2ee2b9dd75ee5ddChris Lattner PHINode *PN; 1789bf2a926cbdf05c5b412ec35e72908a08a4cf34bChris Lattner for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ++II) 17987a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner PN->removeIncomingValue(Pred); 180b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } 181b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner} 182b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 183009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 184009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// splitBasicBlock - This splits a basic block into two at the specified 185009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// instruction. Note that all instructions BEFORE the specified iterator stay 186009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// as part of the original basic block, an unconditional branch is added to 187009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// the new BB, and the rest of the instructions in the BB are moved to the new 188009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// BB, including the old terminator. This invalidates the iterator. 189009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// 190009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// Note that this only works on well formed basic blocks (must have a 191009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// terminator), and 'I' must not be the end of instruction list (which would 192009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// cause a degenerate basic block to be formed, having a terminator inside of 193009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// the basic block). 194009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner// 1954bd4aa5e3c41c0fc803e960252bb6fe75b804b1dChris LattnerBasicBlock *BasicBlock::splitBasicBlock(iterator I, const std::string &BBName) { 196009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!"); 197009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner assert(I != InstList.end() && 198009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner "Trying to get me to create degenerate basic block!"); 199009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 2004f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner BasicBlock *New = new BasicBlock(BBName, getParent(), getNext()); 201009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 202f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner // Move all of the specified instructions from the original basic block into 203f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner // the new basic block. 204f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner New->getInstList().splice(New->end(), this->getInstList(), I, end()); 205009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 206009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner // Add a branch instruction to the newly formed basic block. 207108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner new BranchInst(New, this); 208e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner 209e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // Now we must loop through all of the successors of the New block (which 210e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // _were_ the successors of the 'this' block), and update any PHI nodes in 211e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // successors. If there were PHI nodes in the successors, then they need to 212e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // know that incoming branches will be from New, not from Old. 213e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // 2141c9ab515de41707c8e04a51694a50479068e891dChris Lattner for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { 215e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // Loop over any phi nodes in the basic block, updating the BB field of 216e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // incoming values... 217e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner BasicBlock *Successor = *I; 218f878218c972dc570eb50e739c2ee2b9dd75ee5ddChris Lattner PHINode *PN; 219e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner for (BasicBlock::iterator II = Successor->begin(); 2209bf2a926cbdf05c5b412ec35e72908a08a4cf34bChris Lattner (PN = dyn_cast<PHINode>(II)); ++II) { 221e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner int IDX = PN->getBasicBlockIndex(this); 222e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner while (IDX != -1) { 223e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner PN->setIncomingBlock((unsigned)IDX, New); 224e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner IDX = PN->getBasicBlockIndex(this); 225e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 226e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 227e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 228009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner return New; 229009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 230