mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-07-23 14:25:07 +00:00
Standardize {pred,succ,use,user}_empty()
The functions {pred,succ,use,user}_{begin,end} exist, but many users have to check *_begin() with *_end() by hand to determine if the BasicBlock or User is empty. Fix this with a standard *_empty(), demonstrating a few usecases. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@225760 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -200,7 +200,7 @@ bool PruneEH::SimplifyFunction(Function *F) {
|
||||
BB->getInstList().pop_back();
|
||||
|
||||
// If the unwind block is now dead, nuke it.
|
||||
if (pred_begin(UnwindBlock) == pred_end(UnwindBlock))
|
||||
if (pred_empty(UnwindBlock))
|
||||
DeleteBasicBlock(UnwindBlock); // Delete the new BB.
|
||||
|
||||
++NumRemoved;
|
||||
@@ -234,7 +234,7 @@ bool PruneEH::SimplifyFunction(Function *F) {
|
||||
/// updating the callgraph to reflect any now-obsolete edges due to calls that
|
||||
/// exist in the BB.
|
||||
void PruneEH::DeleteBasicBlock(BasicBlock *BB) {
|
||||
assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!");
|
||||
assert(pred_empty(BB) && "BB is not dead!");
|
||||
CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
|
||||
|
||||
CallGraphNode *CGN = CG[BB->getParent()];
|
||||
|
@@ -188,7 +188,7 @@ bool JumpThreading::runOnFunction(Function &F) {
|
||||
|
||||
// If the block is trivially dead, zap it. This eliminates the successor
|
||||
// edges which simplifies the CFG.
|
||||
if (pred_begin(BB) == pred_end(BB) &&
|
||||
if (pred_empty(BB) &&
|
||||
BB != &BB->getParent()->getEntryBlock()) {
|
||||
DEBUG(dbgs() << " JT: Deleting dead block '" << BB->getName()
|
||||
<< "' with terminator: " << *BB->getTerminator() << '\n');
|
||||
@@ -662,7 +662,7 @@ static bool hasAddressTakenAndUsed(BasicBlock *BB) {
|
||||
bool JumpThreading::ProcessBlock(BasicBlock *BB) {
|
||||
// If the block is trivially dead, just return and let the caller nuke it.
|
||||
// This simplifies other transformations.
|
||||
if (pred_begin(BB) == pred_end(BB) &&
|
||||
if (pred_empty(BB) &&
|
||||
BB != &BB->getParent()->getEntryBlock())
|
||||
return false;
|
||||
|
||||
|
@@ -73,7 +73,7 @@ bool RegToMem::runOnFunction(Function &F) {
|
||||
|
||||
// Insert all new allocas into entry block.
|
||||
BasicBlock *BBEntry = &F.getEntryBlock();
|
||||
assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
|
||||
assert(pred_empty(BBEntry) &&
|
||||
"Entry block to function must not have predecessors!");
|
||||
|
||||
// Find first non-alloca instruction and create insertion point. This is
|
||||
|
@@ -3020,7 +3020,7 @@ bool SimplifyCFGOpt::SimplifyReturn(ReturnInst *RI, IRBuilder<> &Builder) {
|
||||
}
|
||||
|
||||
// If we eliminated all predecessors of the block, delete the block now.
|
||||
if (pred_begin(BB) == pred_end(BB))
|
||||
if (pred_empty(BB))
|
||||
// We know there are no successors, so just nuke the block.
|
||||
BB->eraseFromParent();
|
||||
|
||||
@@ -3193,7 +3193,7 @@ bool SimplifyCFGOpt::SimplifyUnreachable(UnreachableInst *UI) {
|
||||
}
|
||||
|
||||
// If this block is now dead, remove it.
|
||||
if (pred_begin(BB) == pred_end(BB) &&
|
||||
if (pred_empty(BB) &&
|
||||
BB != &BB->getParent()->getEntryBlock()) {
|
||||
// We know there are no successors, so just nuke the block.
|
||||
BB->eraseFromParent();
|
||||
@@ -4587,7 +4587,7 @@ bool SimplifyCFGOpt::run(BasicBlock *BB) {
|
||||
|
||||
// Remove basic blocks that have no predecessors (except the entry block)...
|
||||
// or that just have themself as a predecessor. These are unreachable.
|
||||
if ((pred_begin(BB) == pred_end(BB) &&
|
||||
if ((pred_emtpy(BB) &&
|
||||
BB != &BB->getParent()->getEntryBlock()) ||
|
||||
BB->getSinglePredecessor() == BB) {
|
||||
DEBUG(dbgs() << "Removing BB: \n" << *BB);
|
||||
|
Reference in New Issue
Block a user