diff options
author | Chris Lattner <sabre@nondot.org> | 2008-12-03 06:37:44 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2008-12-03 06:37:44 +0000 |
commit | 2b1ba24fb75e633560846e551acadade92783bb3 (patch) | |
tree | c35b89ce8a58f3305c854e83a1d3126160614545 /lib/Transforms | |
parent | 62c939d7d5572e57963a5f26fb6fe802e13dc0bf (diff) |
Factor some code out of SimplifyCFG, forming a new
DeleteBlockIfDead method.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60463 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms')
-rw-r--r-- | lib/Transforms/Utils/BasicBlockUtils.cpp | 33 | ||||
-rw-r--r-- | lib/Transforms/Utils/SimplifyCFG.cpp | 22 |
2 files changed, 34 insertions, 21 deletions
diff --git a/lib/Transforms/Utils/BasicBlockUtils.cpp b/lib/Transforms/Utils/BasicBlockUtils.cpp index bd32a99516..bfcf375f51 100644 --- a/lib/Transforms/Utils/BasicBlockUtils.cpp +++ b/lib/Transforms/Utils/BasicBlockUtils.cpp @@ -24,6 +24,39 @@ #include <algorithm> using namespace llvm; +/// DeleteBlockIfDead - If the specified basic block is trivially dead (has no +/// predecessors and not the entry block), delete it and return true. Otherwise +/// return false. +bool llvm::DeleteBlockIfDead(BasicBlock *BB) { + if (pred_begin(BB) != pred_end(BB) || + BB == &BB->getParent()->getEntryBlock()) + return false; + + TerminatorInst *BBTerm = BB->getTerminator(); + + // Loop through all of our successors and make sure they know that one + // of their predecessors is going away. + for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) + BBTerm->getSuccessor(i)->removePredecessor(BB); + + // Zap all the instructions in the block. + while (!BB->empty()) { + Instruction &I = BB->back(); + // If this instruction is used, replace uses with an arbitrary value. + // Because control flow can't get here, we don't care what we replace the + // value with. Note that since this block is unreachable, and all values + // contained within it must dominate their uses, that all uses will + // eventually be removed (they are themselves dead). + if (!I.use_empty()) + I.replaceAllUsesWith(UndefValue::get(I.getType())); + BB->getInstList().pop_back(); + } + + // Zap the block! + BB->eraseFromParent(); + return true; +} + /// MergeBlockIntoPredecessor - Attempts to merge a block into its predecessor, /// if possible. The return value indicates success or failure. bool llvm::MergeBlockIntoPredecessor(BasicBlock* BB, Pass* P) { diff --git a/lib/Transforms/Utils/SimplifyCFG.cpp b/lib/Transforms/Utils/SimplifyCFG.cpp index 9ba75502e7..7077436a1d 100644 --- a/lib/Transforms/Utils/SimplifyCFG.cpp +++ b/lib/Transforms/Utils/SimplifyCFG.cpp @@ -1681,27 +1681,7 @@ bool llvm::SimplifyCFG(BasicBlock *BB) { // as a predecessor. These are unreachable. if (pred_begin(BB) == pred_end(BB) || BB->getSinglePredecessor() == BB) { DOUT << "Removing BB: \n" << *BB; - - // Loop through all of our successors and make sure they know that one - // of their predecessors is going away. - for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) - SI->removePredecessor(BB); - - while (!BB->empty()) { - Instruction &I = BB->back(); - // If this instruction is used, replace uses with an arbitrary - // value. Because control flow can't get here, we don't care - // what we replace the value with. Note that since this block is - // unreachable, and all values contained within it must dominate their - // uses, that all uses will eventually be removed. - if (!I.use_empty()) - // Make all users of this instruction use undef instead - I.replaceAllUsesWith(UndefValue::get(I.getType())); - - // Remove the instruction from the basic block - BB->getInstList().pop_back(); - } - BB->eraseFromParent(); + DeleteBlockIfDead(BB); return true; } |