summaryrefslogtreecommitdiff
path: root/lib/VMCore/BasicBlock.cpp
diff options
context:
space:
mode:
authorNick Lewycky <nicholas@mxc.ca>2008-03-09 05:04:48 +0000
committerNick Lewycky <nicholas@mxc.ca>2008-03-09 05:04:48 +0000
commitc6694228fa8df57193cbd924d627814384106ba2 (patch)
tree43eba4c5e757ca7e8b5a237ad5c60cea059d6b4f /lib/VMCore/BasicBlock.cpp
parentc0d025f54f96ff719ae99d57d7c413aee35b6cbc (diff)
downloadllvm-c6694228fa8df57193cbd924d627814384106ba2.tar.gz
llvm-c6694228fa8df57193cbd924d627814384106ba2.tar.bz2
llvm-c6694228fa8df57193cbd924d627814384106ba2.tar.xz
Two things. Preserve the unwind_to when splitting a BB.
Add the ability to remove just one instance of a BB from a phi node. This fixes the compile error in the tree now. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@48085 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore/BasicBlock.cpp')
-rw-r--r--lib/VMCore/BasicBlock.cpp19
1 files changed, 13 insertions, 6 deletions
diff --git a/lib/VMCore/BasicBlock.cpp b/lib/VMCore/BasicBlock.cpp
index f9bead74d2..1288fdf32c 100644
--- a/lib/VMCore/BasicBlock.cpp
+++ b/lib/VMCore/BasicBlock.cpp
@@ -188,14 +188,12 @@ BasicBlock *BasicBlock::getSinglePredecessor() {
/// called while the predecessor still refers to this block.
///
void BasicBlock::removePredecessor(BasicBlock *Pred,
- bool DontDeleteUselessPHIs) {
+ bool DontDeleteUselessPHIs,
+ bool OnlyDeleteOne) {
assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs.
find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
"removePredecessor: BB is not a predecessor!");
- if (Pred == getUnwindDest())
- setUnwindDest(NULL);
-
if (InstList.empty()) return;
PHINode *APN = dyn_cast<PHINode>(&front());
if (!APN) return; // Quick exit.
@@ -226,7 +224,11 @@ void BasicBlock::removePredecessor(BasicBlock *Pred,
// Yup, loop through and nuke the PHI nodes
while (PHINode *PN = dyn_cast<PHINode>(&front())) {
// Remove the predecessor first.
- PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
+ if (OnlyDeleteOne) {
+ int idx = PN->getBasicBlockIndex(Pred);
+ PN->removeIncomingValue(idx, !DontDeleteUselessPHIs);
+ } else
+ PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
// If the PHI _HAD_ two uses, replace PHI node with its now *single* value
if (max_idx == 2) {
@@ -247,7 +249,12 @@ void BasicBlock::removePredecessor(BasicBlock *Pred,
PHINode *PN;
for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) {
++II;
- PN->removeIncomingValue(Pred, false);
+ if (OnlyDeleteOne) {
+ int idx = PN->getBasicBlockIndex(Pred);
+ PN->removeIncomingValue(idx, false);
+ } else
+ PN->removeIncomingValue(Pred, false);
+
// If all incoming values to the Phi are the same, we can replace the Phi
// with that value.
Value* PNV = 0;