- Change PHINode::removeIncomingValue to delete the phi node if the last

incoming value is removed!


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4078 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-10-08 21:34:58 +00:00
parent f7f009d9a5
commit 8bcb768a9c

View File

@ -8,6 +8,7 @@
#include "llvm/iPHINode.h"
#include "llvm/Function.h"
#include "llvm/SymbolTable.h"
#include "llvm/Constant.h"
#include "llvm/Type.h"
#include <algorithm> // find
@ -41,11 +42,19 @@ void PHINode::addIncoming(Value *D, BasicBlock *BB) {
// removeIncomingValue - Remove an incoming value. This is useful if a
// predecessor basic block is deleted.
Value *PHINode::removeIncomingValue(const BasicBlock *BB) {
Value *PHINode::removeIncomingValue(const BasicBlock *BB,
bool DeletePHIIfEmpty) {
op_iterator Idx = find(Operands.begin(), Operands.end(), (const Value*)BB);
assert(Idx != Operands.end() && "BB not in PHI node!");
--Idx; // Back up to value prior to Basic block
Value *Removed = *Idx;
Operands.erase(Idx, Idx+2); // Erase Value and BasicBlock
// If the PHI node is dead, because it has zero entries, nuke it now.
if (getNumOperands() == 0 && DeletePHIIfEmpty) {
// If anyone is using this PHI, make them use a dummy value instead...
replaceAllUsesWith(Constant::getNullValue(getType()));
getParent()->getInstList().erase(this);
}
return Removed;
}