Temporarily revert r134057: "Let simplify cfg simplify bb with only debug and

lifetime intrinsics" due to buildbot failures.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134071 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chad Rosier 2011-06-29 16:22:11 +00:00
parent 254cf03a45
commit ce77aa3edc
5 changed files with 11 additions and 68 deletions

View File

@ -138,12 +138,6 @@ public:
return const_cast<BasicBlock*>(this)->getFirstNonPHIOrDbg(); return const_cast<BasicBlock*>(this)->getFirstNonPHIOrDbg();
} }
// Same as above, but also skip lifetime intrinsics.
Instruction* getFirstNonPHIOrDbgOrLifetime();
const Instruction* getFirstNonPHIOrDbgOrLifetime() const {
return const_cast<BasicBlock*>(this)->getFirstNonPHIOrDbgOrLifetime();
}
/// removeFromParent - This method unlinks 'this' from the containing /// removeFromParent - This method unlinks 'this' from the containing
/// function, but does not delete it. /// function, but does not delete it.
/// ///

View File

@ -536,9 +536,9 @@ static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
/// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an /// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an
/// unconditional branch, and contains no instructions other than PHI nodes, /// unconditional branch, and contains no instructions other than PHI nodes,
/// potential side-effect free intrinsics and the branch. If possible, /// potential debug intrinsics and the branch. If possible, eliminate BB by
/// eliminate BB by rewriting all the predecessors to branch to the successor /// rewriting all the predecessors to branch to the successor block and return
/// block and return true. If we can't transform, return false. /// true. If we can't transform, return false.
bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) { bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) {
assert(BB != &BB->getParent()->getEntryBlock() && assert(BB != &BB->getParent()->getEntryBlock() &&
"TryToSimplifyUncondBranchFromEmptyBlock called on entry block!"); "TryToSimplifyUncondBranchFromEmptyBlock called on entry block!");
@ -613,15 +613,13 @@ bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) {
} }
} }
if (Succ->getSinglePredecessor()) { while (PHINode *PN = dyn_cast<PHINode>(&BB->front())) {
// BB is the only predecessor of Succ, so Succ will end up with exactly if (Succ->getSinglePredecessor()) {
// the same predecessors BB had. // BB is the only predecessor of Succ, so Succ will end up with exactly
// the same predecessors BB had.
// Copy over any phi, debug or lifetime instruction. Succ->getInstList().splice(Succ->begin(),
BB->getTerminator()->eraseFromParent(); BB->getInstList(), BB->begin());
Succ->getInstList().splice(Succ->begin(), BB->getInstList()); } else {
} else {
while (PHINode *PN = dyn_cast<PHINode>(&BB->front())) {
// We explicitly check for such uses in CanPropagatePredecessorsForPHIs. // We explicitly check for such uses in CanPropagatePredecessorsForPHIs.
assert(PN->use_empty() && "There shouldn't be any uses here!"); assert(PN->use_empty() && "There shouldn't be any uses here!");
PN->eraseFromParent(); PN->eraseFromParent();

View File

@ -2604,7 +2604,7 @@ bool SimplifyCFGOpt::SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder){
BasicBlock *BB = BI->getParent(); BasicBlock *BB = BI->getParent();
// If the Terminator is the only non-phi instruction, simplify the block. // If the Terminator is the only non-phi instruction, simplify the block.
BasicBlock::iterator I = BB->getFirstNonPHIOrDbgOrLifetime(); BasicBlock::iterator I = BB->getFirstNonPHIOrDbg();
if (I->isTerminator() && BB != &BB->getParent()->getEntryBlock() && if (I->isTerminator() && BB != &BB->getParent()->getEntryBlock() &&
TryToSimplifyUncondBranchFromEmptyBlock(BB)) TryToSimplifyUncondBranchFromEmptyBlock(BB))
return true; return true;

View File

@ -147,26 +147,6 @@ Instruction* BasicBlock::getFirstNonPHIOrDbg() {
return &*i; return &*i;
} }
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;
}
void BasicBlock::dropAllReferences() { void BasicBlock::dropAllReferences() {
for(iterator I = begin(), E = end(); I != E; ++I) for(iterator I = begin(), E = end(); I != E; ++I)
I->dropAllReferences(); I->dropAllReferences();

View File

@ -1,29 +0,0 @@
; RUN: opt < %s -simplifycfg -S | FileCheck %s
; Test that a lifetime intrinsic doesn't prevent us from simplifying this.
; CHECK: foo
; CHECK: entry:
; CHECK-NOT: bb0:
; CHECK-NOT: bb1:
; CHECK: ret
define void @foo(i1 %x) {
entry:
%a = alloca i8
call void @llvm.lifetime.start(i64 -1, i8* %a) nounwind
br i1 %x, label %bb0, label %bb1
bb0:
call void @llvm.lifetime.end(i64 -1, i8* %a) nounwind
br label %bb1
bb1:
call void @f()
ret void
}
declare void @f()
declare void @llvm.lifetime.start(i64, i8* nocapture) nounwind
declare void @llvm.lifetime.end(i64, i8* nocapture) nounwind