2002-09-08 18:59:35 +00:00
|
|
|
//===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
2013-01-02 09:10:48 +00:00
|
|
|
// This file implements the BasicBlock class for the IR library.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/BasicBlock.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "SymbolTableListTraitsImpl.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2014-03-04 11:45:46 +00:00
|
|
|
#include "llvm/IR/CFG.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/IntrinsicInst.h"
|
|
|
|
#include "llvm/IR/LLVMContext.h"
|
|
|
|
#include "llvm/IR/Type.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/LeakDetector.h"
|
2002-06-25 16:13:24 +00:00
|
|
|
#include <algorithm>
|
2003-11-21 16:52:05 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2009-03-07 12:33:24 +00:00
|
|
|
ValueSymbolTable *BasicBlock::getValueSymbolTable() {
|
|
|
|
if (Function *F = getParent())
|
|
|
|
return &F->getValueSymbolTable();
|
2007-04-17 03:26:42 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-02-25 23:25:17 +00:00
|
|
|
const DataLayout *BasicBlock::getDataLayout() const {
|
|
|
|
return getParent()->getDataLayout();
|
|
|
|
}
|
|
|
|
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &BasicBlock::getContext() const {
|
|
|
|
return getType()->getContext();
|
2009-07-05 22:41:43 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
// Explicit instantiation of SymbolTableListTraits since some of the methods
|
|
|
|
// are not in the public header file...
|
2009-12-19 00:55:12 +00:00
|
|
|
template class llvm::SymbolTableListTraits<Instruction, BasicBlock>;
|
2002-06-25 16:13:24 +00:00
|
|
|
|
2011-04-10 23:18:04 +00:00
|
|
|
|
2009-08-13 21:58:54 +00:00
|
|
|
BasicBlock::BasicBlock(LLVMContext &C, const Twine &Name, Function *NewParent,
|
2008-04-25 16:53:59 +00:00
|
|
|
BasicBlock *InsertBefore)
|
2011-04-10 23:18:04 +00:00
|
|
|
: Value(Type::getLabelTy(C), Value::BasicBlockVal), Parent(0) {
|
2002-09-26 05:03:22 +00:00
|
|
|
|
|
|
|
// Make sure that we get added to a function
|
|
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
|
|
|
|
if (InsertBefore) {
|
2007-04-17 03:26:42 +00:00
|
|
|
assert(NewParent &&
|
2004-02-04 03:57:50 +00:00
|
|
|
"Cannot insert block before another block with no function!");
|
2007-04-17 03:26:42 +00:00
|
|
|
NewParent->getBasicBlockList().insert(InsertBefore, this);
|
|
|
|
} else if (NewParent) {
|
|
|
|
NewParent->getBasicBlockList().push_back(this);
|
2002-09-26 05:03:22 +00:00
|
|
|
}
|
2011-08-09 23:12:56 +00:00
|
|
|
|
2007-02-12 05:18:08 +00:00
|
|
|
setName(Name);
|
2002-09-26 05:03:22 +00:00
|
|
|
}
|
|
|
|
|
2011-04-10 23:18:04 +00:00
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
BasicBlock::~BasicBlock() {
|
2009-10-30 22:39:36 +00:00
|
|
|
// If the address of the block is taken and it is being deleted (e.g. because
|
|
|
|
// it is dead), this means that there is either a dangling constant expr
|
|
|
|
// hanging off the block, or an undefined use of the block (source code
|
|
|
|
// expecting the address of a label to keep the block alive even though there
|
|
|
|
// is no indirect branch). Handle these cases by zapping the BlockAddress
|
2009-11-01 01:27:45 +00:00
|
|
|
// nodes. There are no other possible uses at this point.
|
2009-10-30 22:39:36 +00:00
|
|
|
if (hasAddressTaken()) {
|
|
|
|
assert(!use_empty() && "There should be at least one blockaddress!");
|
2009-11-01 01:27:45 +00:00
|
|
|
Constant *Replacement =
|
|
|
|
ConstantInt::get(llvm::Type::getInt32Ty(getContext()), 1);
|
2009-10-30 22:39:36 +00:00
|
|
|
while (!use_empty()) {
|
|
|
|
BlockAddress *BA = cast<BlockAddress>(use_back());
|
2009-11-01 01:27:45 +00:00
|
|
|
BA->replaceAllUsesWith(ConstantExpr::getIntToPtr(Replacement,
|
|
|
|
BA->getType()));
|
2009-10-30 22:39:36 +00:00
|
|
|
BA->destroyConstant();
|
|
|
|
}
|
|
|
|
}
|
2011-08-09 23:12:56 +00:00
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
assert(getParent() == 0 && "BasicBlock still linked into the program!");
|
|
|
|
dropAllReferences();
|
|
|
|
InstList.clear();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2002-09-06 21:33:15 +00:00
|
|
|
void BasicBlock::setParent(Function *parent) {
|
2002-09-08 18:59:35 +00:00
|
|
|
if (getParent())
|
|
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
|
2007-04-17 03:26:42 +00:00
|
|
|
// Set Parent=parent, updating instruction symtab entries as appropriate.
|
|
|
|
InstList.setSymTabObject(&Parent, parent);
|
2002-09-08 18:59:35 +00:00
|
|
|
|
|
|
|
if (getParent())
|
|
|
|
LeakDetector::removeGarbageObject(this);
|
2002-09-06 21:33:15 +00:00
|
|
|
}
|
|
|
|
|
2004-10-11 22:21:39 +00:00
|
|
|
void BasicBlock::removeFromParent() {
|
|
|
|
getParent()->getBasicBlockList().remove(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void BasicBlock::eraseFromParent() {
|
|
|
|
getParent()->getBasicBlockList().erase(this);
|
|
|
|
}
|
|
|
|
|
2006-09-23 04:03:45 +00:00
|
|
|
/// moveBefore - Unlink this basic block from its current function and
|
|
|
|
/// insert it into the function that MovePos lives in, right before MovePos.
|
2005-08-12 22:14:06 +00:00
|
|
|
void BasicBlock::moveBefore(BasicBlock *MovePos) {
|
|
|
|
MovePos->getParent()->getBasicBlockList().splice(MovePos,
|
|
|
|
getParent()->getBasicBlockList(), this);
|
|
|
|
}
|
|
|
|
|
2006-09-23 04:03:45 +00:00
|
|
|
/// moveAfter - Unlink this basic block from its current function and
|
|
|
|
/// insert it into the function that MovePos lives in, right after MovePos.
|
|
|
|
void BasicBlock::moveAfter(BasicBlock *MovePos) {
|
|
|
|
Function::iterator I = MovePos;
|
|
|
|
MovePos->getParent()->getBasicBlockList().splice(++I,
|
|
|
|
getParent()->getBasicBlockList(), this);
|
|
|
|
}
|
|
|
|
|
2004-10-11 22:21:39 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
TerminatorInst *BasicBlock::getTerminator() {
|
|
|
|
if (InstList.empty()) return 0;
|
2002-06-25 16:13:24 +00:00
|
|
|
return dyn_cast<TerminatorInst>(&InstList.back());
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-11-19 20:46:23 +00:00
|
|
|
const TerminatorInst *BasicBlock::getTerminator() const {
|
2001-06-06 20:29:01 +00:00
|
|
|
if (InstList.empty()) return 0;
|
2002-06-25 16:13:24 +00:00
|
|
|
return dyn_cast<TerminatorInst>(&InstList.back());
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2008-05-23 21:05:58 +00:00
|
|
|
Instruction* BasicBlock::getFirstNonPHI() {
|
|
|
|
BasicBlock::iterator i = begin();
|
|
|
|
// All valid basic blocks should have a terminator,
|
|
|
|
// which is not a PHINode. If we have an invalid basic
|
|
|
|
// block we'll get an assertion failure when dereferencing
|
|
|
|
// a past-the-end iterator.
|
|
|
|
while (isa<PHINode>(i)) ++i;
|
|
|
|
return &*i;
|
2006-06-08 15:46:18 +00:00
|
|
|
}
|
|
|
|
|
2010-04-02 21:49:27 +00:00
|
|
|
Instruction* BasicBlock::getFirstNonPHIOrDbg() {
|
|
|
|
BasicBlock::iterator i = begin();
|
|
|
|
// All valid basic blocks should have a terminator,
|
|
|
|
// which is not a PHINode. If we have an invalid basic
|
|
|
|
// block we'll get an assertion failure when dereferencing
|
|
|
|
// a past-the-end iterator.
|
|
|
|
while (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i)) ++i;
|
|
|
|
return &*i;
|
|
|
|
}
|
|
|
|
|
2011-06-30 20:14:24 +00:00
|
|
|
Instruction* BasicBlock::getFirstNonPHIOrDbgOrLifetime() {
|
|
|
|
// All valid basic blocks should have a terminator,
|
|
|
|
// which is not a PHINode. If we have an invalid basic
|
|
|
|
// block we'll get an assertion failure when dereferencing
|
|
|
|
// a past-the-end iterator.
|
|
|
|
BasicBlock::iterator i = begin();
|
|
|
|
for (;; ++i) {
|
|
|
|
if (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
const IntrinsicInst *II = dyn_cast<IntrinsicInst>(i);
|
|
|
|
if (!II)
|
|
|
|
break;
|
|
|
|
if (II->getIntrinsicID() != Intrinsic::lifetime_start &&
|
|
|
|
II->getIntrinsicID() != Intrinsic::lifetime_end)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return &*i;
|
|
|
|
}
|
|
|
|
|
2011-08-16 20:42:52 +00:00
|
|
|
BasicBlock::iterator BasicBlock::getFirstInsertionPt() {
|
|
|
|
iterator InsertPt = getFirstNonPHI();
|
|
|
|
if (isa<LandingPadInst>(InsertPt)) ++InsertPt;
|
|
|
|
return InsertPt;
|
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
void BasicBlock::dropAllReferences() {
|
2002-06-25 16:13:24 +00:00
|
|
|
for(iterator I = begin(), E = end(); I != E; ++I)
|
|
|
|
I->dropAllReferences();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2005-02-24 02:37:26 +00:00
|
|
|
/// getSinglePredecessor - If this basic block has a single predecessor block,
|
|
|
|
/// return the block, otherwise return a null pointer.
|
|
|
|
BasicBlock *BasicBlock::getSinglePredecessor() {
|
|
|
|
pred_iterator PI = pred_begin(this), E = pred_end(this);
|
|
|
|
if (PI == E) return 0; // No preds.
|
|
|
|
BasicBlock *ThePred = *PI;
|
|
|
|
++PI;
|
|
|
|
return (PI == E) ? ThePred : 0 /*multiple preds*/;
|
|
|
|
}
|
|
|
|
|
2008-12-11 10:36:07 +00:00
|
|
|
/// getUniquePredecessor - If this basic block has a unique predecessor block,
|
|
|
|
/// return the block, otherwise return a null pointer.
|
2011-08-09 23:12:56 +00:00
|
|
|
/// Note that unique predecessor doesn't mean single edge, there can be
|
|
|
|
/// multiple edges from the unique predecessor to this block (for example
|
2008-12-11 11:44:49 +00:00
|
|
|
/// a switch statement with multiple cases having the same destination).
|
2008-12-11 10:36:07 +00:00
|
|
|
BasicBlock *BasicBlock::getUniquePredecessor() {
|
|
|
|
pred_iterator PI = pred_begin(this), E = pred_end(this);
|
|
|
|
if (PI == E) return 0; // No preds.
|
|
|
|
BasicBlock *PredBB = *PI;
|
|
|
|
++PI;
|
|
|
|
for (;PI != E; ++PI) {
|
|
|
|
if (*PI != PredBB)
|
|
|
|
return 0;
|
2008-12-11 11:44:49 +00:00
|
|
|
// The same predecessor appears multiple times in the predecessor list.
|
|
|
|
// This is OK.
|
2008-12-11 10:36:07 +00:00
|
|
|
}
|
|
|
|
return PredBB;
|
|
|
|
}
|
|
|
|
|
2005-04-21 16:06:03 +00:00
|
|
|
/// removePredecessor - This method is used to notify a BasicBlock that the
|
|
|
|
/// specified Predecessor of the block is no longer able to reach it. This is
|
2005-04-21 23:48:37 +00:00
|
|
|
/// actually not used to update the Predecessor list, but is actually used to
|
2005-04-21 16:06:03 +00:00
|
|
|
/// update the PHI nodes that reside in the block. Note that this should be
|
|
|
|
/// called while the predecessor still refers to this block.
|
|
|
|
///
|
2005-04-12 18:52:14 +00:00
|
|
|
void BasicBlock::removePredecessor(BasicBlock *Pred,
|
2008-04-25 16:53:59 +00:00
|
|
|
bool DontDeleteUselessPHIs) {
|
2005-02-23 16:53:04 +00:00
|
|
|
assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs.
|
2005-02-23 07:09:08 +00:00
|
|
|
find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
|
2005-04-23 21:38:35 +00:00
|
|
|
"removePredecessor: BB is not a predecessor!");
|
2005-02-23 07:09:08 +00:00
|
|
|
|
2004-12-11 22:10:29 +00:00
|
|
|
if (InstList.empty()) return;
|
2004-07-06 17:44:17 +00:00
|
|
|
PHINode *APN = dyn_cast<PHINode>(&front());
|
|
|
|
if (!APN) return; // Quick exit.
|
2001-06-29 05:25:23 +00:00
|
|
|
|
|
|
|
// If there are exactly two predecessors, then we want to nuke the PHI nodes
|
2004-07-06 17:44:17 +00:00
|
|
|
// altogether. However, we cannot do this, if this in this case:
|
2002-05-21 19:52:49 +00:00
|
|
|
//
|
|
|
|
// Loop:
|
|
|
|
// %x = phi [X, Loop]
|
|
|
|
// %x2 = add %x, 1 ;; This would become %x2 = add %x2, 1
|
|
|
|
// br Loop ;; %x2 does not dominate all uses
|
|
|
|
//
|
|
|
|
// This is because the PHI node input is actually taken from the predecessor
|
2005-04-21 23:48:37 +00:00
|
|
|
// basic block. The only case this can happen is with a self loop, so we
|
2002-05-21 19:52:49 +00:00
|
|
|
// check for this case explicitly now.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2004-07-06 17:44:17 +00:00
|
|
|
unsigned max_idx = APN->getNumIncomingValues();
|
2001-06-29 05:25:23 +00:00
|
|
|
assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!");
|
2002-05-21 19:52:49 +00:00
|
|
|
if (max_idx == 2) {
|
2004-07-06 17:44:17 +00:00
|
|
|
BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred);
|
2002-05-21 19:52:49 +00:00
|
|
|
|
|
|
|
// Disable PHI elimination!
|
|
|
|
if (this == Other) max_idx = 3;
|
|
|
|
}
|
|
|
|
|
2005-04-12 18:52:14 +00:00
|
|
|
// <= Two predecessors BEFORE I remove one?
|
|
|
|
if (max_idx <= 2 && !DontDeleteUselessPHIs) {
|
2001-10-02 03:41:24 +00:00
|
|
|
// Yup, loop through and nuke the PHI nodes
|
2002-06-25 16:13:24 +00:00
|
|
|
while (PHINode *PN = dyn_cast<PHINode>(&front())) {
|
2005-04-12 18:52:14 +00:00
|
|
|
// Remove the predecessor first.
|
2008-04-25 16:53:59 +00:00
|
|
|
PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
|
2001-06-29 05:25:23 +00:00
|
|
|
|
|
|
|
// If the PHI _HAD_ two uses, replace PHI node with its now *single* value
|
2002-10-08 21:36:34 +00:00
|
|
|
if (max_idx == 2) {
|
2011-06-20 14:18:48 +00:00
|
|
|
if (PN->getIncomingValue(0) != PN)
|
|
|
|
PN->replaceAllUsesWith(PN->getIncomingValue(0));
|
2003-04-25 23:14:19 +00:00
|
|
|
else
|
|
|
|
// We are left with an infinite loop with no entries: kill the PHI.
|
2009-07-30 23:03:37 +00:00
|
|
|
PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
|
2002-10-08 21:36:34 +00:00
|
|
|
getInstList().pop_front(); // Remove the PHI node
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the PHI node already only had one entry, it got deleted by
|
|
|
|
// removeIncomingValue.
|
2001-06-29 05:25:23 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Okay, now we know that we need to remove predecessor #pred_idx from all
|
|
|
|
// PHI nodes. Iterate over each PHI node fixing them up
|
2004-06-05 00:11:27 +00:00
|
|
|
PHINode *PN;
|
2005-08-05 15:34:10 +00:00
|
|
|
for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) {
|
|
|
|
++II;
|
2008-04-25 16:53:59 +00:00
|
|
|
PN->removeIncomingValue(Pred, false);
|
2005-08-04 23:24:19 +00:00
|
|
|
// If all incoming values to the Phi are the same, we can replace the Phi
|
|
|
|
// with that value.
|
2006-06-14 04:43:14 +00:00
|
|
|
Value* PNV = 0;
|
2010-11-17 10:23:23 +00:00
|
|
|
if (!DontDeleteUselessPHIs && (PNV = PN->hasConstantValue()))
|
|
|
|
if (PNV != PN) {
|
|
|
|
PN->replaceAllUsesWith(PNV);
|
|
|
|
PN->eraseFromParent();
|
|
|
|
}
|
2005-08-04 23:24:19 +00:00
|
|
|
}
|
2001-06-29 05:25:23 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2005-04-21 16:04:49 +00:00
|
|
|
/// splitBasicBlock - This splits a basic block into two at the specified
|
|
|
|
/// instruction. Note that all instructions BEFORE the specified iterator stay
|
2005-04-21 23:48:37 +00:00
|
|
|
/// as part of the original basic block, an unconditional branch is added to
|
2005-04-21 16:04:49 +00:00
|
|
|
/// the new BB, and the rest of the instructions in the BB are moved to the new
|
|
|
|
/// BB, including the old terminator. This invalidates the iterator.
|
|
|
|
///
|
2005-04-21 23:48:37 +00:00
|
|
|
/// Note that this only works on well formed basic blocks (must have a
|
2005-04-21 16:04:49 +00:00
|
|
|
/// terminator), and 'I' must not be the end of instruction list (which would
|
|
|
|
/// cause a degenerate basic block to be formed, having a terminator inside of
|
2005-04-21 23:48:37 +00:00
|
|
|
/// the basic block).
|
2005-04-21 16:04:49 +00:00
|
|
|
///
|
2009-07-25 04:41:11 +00:00
|
|
|
BasicBlock *BasicBlock::splitBasicBlock(iterator I, const Twine &BBName) {
|
2001-06-06 20:29:01 +00:00
|
|
|
assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!");
|
2005-04-21 23:48:37 +00:00
|
|
|
assert(I != InstList.end() &&
|
2005-04-23 21:38:35 +00:00
|
|
|
"Trying to get me to create degenerate basic block!");
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2014-03-02 12:27:27 +00:00
|
|
|
BasicBlock *InsertBefore = std::next(Function::iterator(this))
|
2008-07-28 21:51:04 +00:00
|
|
|
.getNodePtrUnchecked();
|
2009-08-13 21:58:54 +00:00
|
|
|
BasicBlock *New = BasicBlock::Create(getContext(), BBName,
|
|
|
|
getParent(), InsertBefore);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2004-02-03 23:11:21 +00:00
|
|
|
// Move all of the specified instructions from the original basic block into
|
|
|
|
// the new basic block.
|
|
|
|
New->getInstList().splice(New->end(), this->getInstList(), I, end());
|
2001-06-06 20:29:01 +00:00
|
|
|
|
|
|
|
// Add a branch instruction to the newly formed basic block.
|
2008-04-06 20:25:17 +00:00
|
|
|
BranchInst::Create(New, this);
|
2002-02-25 00:35:07 +00:00
|
|
|
|
|
|
|
// Now we must loop through all of the successors of the New block (which
|
|
|
|
// _were_ the successors of the 'this' block), and update any PHI nodes in
|
|
|
|
// successors. If there were PHI nodes in the successors, then they need to
|
|
|
|
// know that incoming branches will be from New, not from Old.
|
|
|
|
//
|
2003-09-24 22:03:22 +00:00
|
|
|
for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) {
|
2002-02-25 00:35:07 +00:00
|
|
|
// Loop over any phi nodes in the basic block, updating the BB field of
|
|
|
|
// incoming values...
|
|
|
|
BasicBlock *Successor = *I;
|
2004-06-05 00:11:27 +00:00
|
|
|
PHINode *PN;
|
2002-02-25 00:35:07 +00:00
|
|
|
for (BasicBlock::iterator II = Successor->begin();
|
2004-06-05 17:43:52 +00:00
|
|
|
(PN = dyn_cast<PHINode>(II)); ++II) {
|
2002-02-25 00:35:07 +00:00
|
|
|
int IDX = PN->getBasicBlockIndex(this);
|
|
|
|
while (IDX != -1) {
|
|
|
|
PN->setIncomingBlock((unsigned)IDX, New);
|
|
|
|
IDX = PN->getBasicBlockIndex(this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2001-06-06 20:29:01 +00:00
|
|
|
return New;
|
|
|
|
}
|
2009-10-29 00:09:08 +00:00
|
|
|
|
2011-06-23 09:09:15 +00:00
|
|
|
void BasicBlock::replaceSuccessorsPhiUsesWith(BasicBlock *New) {
|
|
|
|
TerminatorInst *TI = getTerminator();
|
|
|
|
if (!TI)
|
|
|
|
// Cope with being called on a BasicBlock that doesn't have a terminator
|
|
|
|
// yet. Clang's CodeGenFunction::EmitReturnBlock() likes to do this.
|
|
|
|
return;
|
|
|
|
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
|
|
|
|
BasicBlock *Succ = TI->getSuccessor(i);
|
2011-08-09 23:13:05 +00:00
|
|
|
// N.B. Succ might not be a complete BasicBlock, so don't assume
|
|
|
|
// that it ends with a non-phi instruction.
|
|
|
|
for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
|
|
|
PHINode *PN = dyn_cast<PHINode>(II);
|
|
|
|
if (!PN)
|
|
|
|
break;
|
2011-06-23 09:09:15 +00:00
|
|
|
int i;
|
|
|
|
while ((i = PN->getBasicBlockIndex(this)) >= 0)
|
|
|
|
PN->setIncomingBlock(i, New);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-08-12 20:24:12 +00:00
|
|
|
|
|
|
|
/// isLandingPad - Return true if this basic block is a landing pad. I.e., it's
|
|
|
|
/// the destination of the 'unwind' edge of an invoke instruction.
|
|
|
|
bool BasicBlock::isLandingPad() const {
|
|
|
|
return isa<LandingPadInst>(getFirstNonPHI());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getLandingPadInst() - Return the landingpad instruction associated with
|
|
|
|
/// the landing pad.
|
|
|
|
LandingPadInst *BasicBlock::getLandingPadInst() {
|
|
|
|
return dyn_cast<LandingPadInst>(getFirstNonPHI());
|
|
|
|
}
|
2012-01-31 00:26:24 +00:00
|
|
|
const LandingPadInst *BasicBlock::getLandingPadInst() const {
|
|
|
|
return dyn_cast<LandingPadInst>(getFirstNonPHI());
|
|
|
|
}
|