BasicBlock.cpp revision 9ef7e06ccef062dfa5df516913b12b7c3ca17805
1d1e693f2a3883dacf213aa2b477540c57b53b714Chris Lattner//===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 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. 7fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 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" 153464547968b58dda0acbf6e0e192f03f66652848Chris Lattner#include "llvm/Constants.h" 1644336292fcd9f3f99cbfc2c3366bea0cf95bb675Misha Brukman#include "llvm/Instructions.h" 17009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner#include "llvm/Type.h" 18455889aa79e3463a4b0f2161e3d9d72a683268b6Chris Lattner#include "llvm/Support/CFG.h" 19551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/LeakDetector.h" 209ef7e06ccef062dfa5df516913b12b7c3ca17805Chris Lattner#include "llvm/Support/Visibility.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. 289ef7e06ccef062dfa5df516913b12b7c3ca17805Chris Lattner struct VISIBILITY_HIDDEN DummyInst : public Instruction { 2996d83f63cdbb33c075901b1b84eb07622d86386fChris Lattner DummyInst() : Instruction(Type::VoidTy, OtherOpsEnd, 0, 0) { 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 51bca81448ac8e19c588c9a4ad16fc70732b76327cChris LattnerInstruction *ilist_traits<Instruction>::createSentinel() { 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 984b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattnervoid BasicBlock::removeFromParent() { 994b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner getParent()->getBasicBlockList().remove(this); 1004b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner} 1014b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner 1024b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattnervoid BasicBlock::eraseFromParent() { 1034b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner getParent()->getBasicBlockList().erase(this); 1044b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner} 1054b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner 1066a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner/// moveBefore - Unlink this instruction from its current function and 1076a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner/// insert it into the function that MovePos lives in, right before 1086a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner/// MovePos. 1096a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattnervoid BasicBlock::moveBefore(BasicBlock *MovePos) { 1106a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner MovePos->getParent()->getBasicBlockList().splice(MovePos, 1116a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner getParent()->getBasicBlockList(), this); 1126a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner} 1136a13aed525f586fc8f475ce17ce7f6cf77ddd2f4Chris Lattner 1144b83380f330b1c77bb9b4ad8f63bdcf1a596afd6Chris Lattner 115009505452b713ed2e3a8e99c5545a6e721c65495Chris LattnerTerminatorInst *BasicBlock::getTerminator() { 116009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner if (InstList.empty()) return 0; 1177e70829632f82de15db187845666aaca6e04b792Chris Lattner return dyn_cast<TerminatorInst>(&InstList.back()); 118009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 119009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 120009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattnerconst TerminatorInst *const BasicBlock::getTerminator() const { 121009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner if (InstList.empty()) return 0; 1227e70829632f82de15db187845666aaca6e04b792Chris Lattner return dyn_cast<TerminatorInst>(&InstList.back()); 123009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 124009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 125dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir PrusInstruction* BasicBlock::getFirstNonPHI() 126dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus{ 12728962f353b16f34571b3ed3127f7e17e1c0a76f2Vladimir Prus BasicBlock::iterator i = begin(); 128dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus // All valid basic blocks should have a terminator, 129dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus // which is not a PHINode. If we have invalid basic 130dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus // block we'll get assert when dereferencing past-the-end 131dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus // iterator. 132dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus while (isa<PHINode>(i)) ++i; 133dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus return &*i; 134dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus} 135dd49dbfe44098eb53b1ac29f017e422147572bbbVladimir Prus 136009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattnervoid BasicBlock::dropAllReferences() { 1377e70829632f82de15db187845666aaca6e04b792Chris Lattner for(iterator I = begin(), E = end(); I != E; ++I) 1387e70829632f82de15db187845666aaca6e04b792Chris Lattner I->dropAllReferences(); 139009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 140009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 141ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner/// getSinglePredecessor - If this basic block has a single predecessor block, 142ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner/// return the block, otherwise return a null pointer. 143ad993cbb77b26b36cee938686b3377c0d92abd5eChris LattnerBasicBlock *BasicBlock::getSinglePredecessor() { 144ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner pred_iterator PI = pred_begin(this), E = pred_end(this); 145ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner if (PI == E) return 0; // No preds. 146ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner BasicBlock *ThePred = *PI; 147ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner ++PI; 148ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner return (PI == E) ? ThePred : 0 /*multiple preds*/; 149ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner} 150ad993cbb77b26b36cee938686b3377c0d92abd5eChris Lattner 151566f600779d8c28a81bb08951ec1962fe34322abChris Lattner/// removePredecessor - This method is used to notify a BasicBlock that the 152566f600779d8c28a81bb08951ec1962fe34322abChris Lattner/// specified Predecessor of the block is no longer able to reach it. This is 153fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman/// actually not used to update the Predecessor list, but is actually used to 154566f600779d8c28a81bb08951ec1962fe34322abChris Lattner/// update the PHI nodes that reside in the block. Note that this should be 155566f600779d8c28a81bb08951ec1962fe34322abChris Lattner/// called while the predecessor still refers to this block. 156566f600779d8c28a81bb08951ec1962fe34322abChris Lattner/// 1573464547968b58dda0acbf6e0e192f03f66652848Chris Lattnervoid BasicBlock::removePredecessor(BasicBlock *Pred, 1583464547968b58dda0acbf6e0e192f03f66652848Chris Lattner bool DontDeleteUselessPHIs) { 1591f21ef1511ce003fc177121b980e783b83992f82Chris Lattner assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs. 16035f0aecdb012ba150953f6f3a98862be9c72d265Chris Lattner find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && 1619d80930e950214d026afd3a3d18cda32629efdb9Jeff Cohen "removePredecessor: BB is not a predecessor!"); 16235f0aecdb012ba150953f6f3a98862be9c72d265Chris Lattner 163f23586c7efe615d061c00c24cf62f03f7962776fChris Lattner if (InstList.empty()) return; 164a9e7781b3b8e457946491529816feab73c66d774Chris Lattner PHINode *APN = dyn_cast<PHINode>(&front()); 165a9e7781b3b8e457946491529816feab73c66d774Chris Lattner if (!APN) return; // Quick exit. 166b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 167b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // If there are exactly two predecessors, then we want to nuke the PHI nodes 168a9e7781b3b8e457946491529816feab73c66d774Chris Lattner // altogether. However, we cannot do this, if this in this case: 16987a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // 17087a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // Loop: 17187a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // %x = phi [X, Loop] 17287a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // %x2 = add %x, 1 ;; This would become %x2 = add %x2, 1 17387a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // br Loop ;; %x2 does not dominate all uses 17487a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // 17587a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // This is because the PHI node input is actually taken from the predecessor 176fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman // basic block. The only case this can happen is with a self loop, so we 17787a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // check for this case explicitly now. 178fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman // 179a9e7781b3b8e457946491529816feab73c66d774Chris Lattner unsigned max_idx = APN->getNumIncomingValues(); 180b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!"); 18187a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner if (max_idx == 2) { 182a9e7781b3b8e457946491529816feab73c66d774Chris Lattner BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred); 18387a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner 18487a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner // Disable PHI elimination! 18587a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner if (this == Other) max_idx = 3; 18687a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner } 18787a09b10f8e03182e9edcb6e9ee8386f4a5d8daeChris Lattner 1883464547968b58dda0acbf6e0e192f03f66652848Chris Lattner // <= Two predecessors BEFORE I remove one? 1893464547968b58dda0acbf6e0e192f03f66652848Chris Lattner if (max_idx <= 2 && !DontDeleteUselessPHIs) { 190b00c582b6d40e6b9ff2d1ed4f5eaf7930e792aceChris Lattner // Yup, loop through and nuke the PHI nodes 1917e70829632f82de15db187845666aaca6e04b792Chris Lattner while (PHINode *PN = dyn_cast<PHINode>(&front())) { 1923464547968b58dda0acbf6e0e192f03f66652848Chris Lattner // Remove the predecessor first. 1933464547968b58dda0acbf6e0e192f03f66652848Chris Lattner PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs); 194b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 195b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // If the PHI _HAD_ two uses, replace PHI node with its now *single* value 196dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner if (max_idx == 2) { 19702a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner if (PN->getOperand(0) != PN) 19802a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner PN->replaceAllUsesWith(PN->getOperand(0)); 19902a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner else 20002a78cf7eacf97f2c9584e29d02f77612aead35fChris Lattner // We are left with an infinite loop with no entries: kill the PHI. 2013464547968b58dda0acbf6e0e192f03f66652848Chris Lattner PN->replaceAllUsesWith(UndefValue::get(PN->getType())); 202dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner getInstList().pop_front(); // Remove the PHI node 203dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner } 204dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner 205dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner // If the PHI node already only had one entry, it got deleted by 206dee430d26e14a3d7c8d86688d49ac8b116aa044fChris Lattner // removeIncomingValue. 207b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } 208b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } else { 209b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // Okay, now we know that we need to remove predecessor #pred_idx from all 210b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner // PHI nodes. Iterate over each PHI node fixing them up 211f878218c972dc570eb50e739c2ee2b9dd75ee5ddChris Lattner PHINode *PN; 21280f4d88a97e1b925c2ea67f932dd9c3ce1df1f8dChris Lattner for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) { 21380f4d88a97e1b925c2ea67f932dd9c3ce1df1f8dChris Lattner ++II; 2143464547968b58dda0acbf6e0e192f03f66652848Chris Lattner PN->removeIncomingValue(Pred, false); 215a83ba0f5c934e2cdbb5724cab365ecc0b5aae6c6Nate Begeman // If all incoming values to the Phi are the same, we can replace the Phi 216a83ba0f5c934e2cdbb5724cab365ecc0b5aae6c6Nate Begeman // with that value. 21790245d4cbb7816ef21f038ec5ef7e01971283436Owen Anderson Value* PNV = 0; 21890245d4cbb7816ef21f038ec5ef7e01971283436Owen Anderson if (!DontDeleteUselessPHIs && (PNV = PN->hasConstantValue())) { 2191325b42a7dc38e99e1aa3531395d1678b31d3c55Chris Lattner PN->replaceAllUsesWith(PNV); 2201325b42a7dc38e99e1aa3531395d1678b31d3c55Chris Lattner PN->eraseFromParent(); 2211325b42a7dc38e99e1aa3531395d1678b31d3c55Chris Lattner } 222a83ba0f5c934e2cdbb5724cab365ecc0b5aae6c6Nate Begeman } 223b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner } 224b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner} 225b47af25099cac5c59795d6f1eb3b7cf9f962b32fChris Lattner 226009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 2270f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// splitBasicBlock - This splits a basic block into two at the specified 2280f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// instruction. Note that all instructions BEFORE the specified iterator stay 229fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman/// as part of the original basic block, an unconditional branch is added to 2300f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// the new BB, and the rest of the instructions in the BB are moved to the new 2310f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// BB, including the old terminator. This invalidates the iterator. 2320f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// 233fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman/// Note that this only works on well formed basic blocks (must have a 2340f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// terminator), and 'I' must not be the end of instruction list (which would 2350f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// cause a degenerate basic block to be formed, having a terminator inside of 236fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman/// the basic block). 2370f67dd6237eb7227aa58e9b77cd95f354989b891Chris Lattner/// 2384bd4aa5e3c41c0fc803e960252bb6fe75b804b1dChris LattnerBasicBlock *BasicBlock::splitBasicBlock(iterator I, const std::string &BBName) { 239009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!"); 240fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(I != InstList.end() && 2419d80930e950214d026afd3a3d18cda32629efdb9Jeff Cohen "Trying to get me to create degenerate basic block!"); 242009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 2434f05611ed948ed1fb3e861d178aae18bd025ce1cChris Lattner BasicBlock *New = new BasicBlock(BBName, getParent(), getNext()); 244009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 245f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner // Move all of the specified instructions from the original basic block into 246f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner // the new basic block. 247f2c3106866137b0c06e99f453a83d9558c0c6934Chris Lattner New->getInstList().splice(New->end(), this->getInstList(), I, end()); 248009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner 249009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner // Add a branch instruction to the newly formed basic block. 250108e4ab159b59a616b0868e396dc7ddc1fb48616Chris Lattner new BranchInst(New, this); 251e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner 252e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // Now we must loop through all of the successors of the New block (which 253e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // _were_ the successors of the 'this' block), and update any PHI nodes in 254e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // successors. If there were PHI nodes in the successors, then they need to 255e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // know that incoming branches will be from New, not from Old. 256e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // 2571c9ab515de41707c8e04a51694a50479068e891dChris Lattner for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { 258e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // Loop over any phi nodes in the basic block, updating the BB field of 259e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner // incoming values... 260e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner BasicBlock *Successor = *I; 261f878218c972dc570eb50e739c2ee2b9dd75ee5ddChris Lattner PHINode *PN; 262e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner for (BasicBlock::iterator II = Successor->begin(); 2639bf2a926cbdf05c5b412ec35e72908a08a4cf34bChris Lattner (PN = dyn_cast<PHINode>(II)); ++II) { 264e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner int IDX = PN->getBasicBlockIndex(this); 265e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner while (IDX != -1) { 266e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner PN->setIncomingBlock((unsigned)IDX, New); 267e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner IDX = PN->getBasicBlockIndex(this); 268e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 269e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 270e8e320d2faa997605c76a7c3ab9e9b4fb578e8c0Chris Lattner } 271009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner return New; 272009505452b713ed2e3a8e99c5545a6e721c65495Chris Lattner} 273