forked from OSchip/llvm-project
when folding duplicate conditions, delete the
now-probably-dead instruction tree feeding it. llvm-svn: 83778
This commit is contained in:
parent
94ac58d99a
commit
85c85c5e04
|
@ -450,9 +450,11 @@ bool JumpThreading::ProcessBranchOnDuplicateCond(BasicBlock *PredBB,
|
|||
<< "' folding condition to '" << BranchDir << "': "
|
||||
<< *BB->getTerminator() << '\n');
|
||||
++NumFolds;
|
||||
Value *OldCond = DestBI->getCondition();
|
||||
DestBI->setCondition(ConstantInt::get(Type::getInt1Ty(BB->getContext()),
|
||||
BranchDir));
|
||||
ConstantFoldTerminator(BB);
|
||||
RecursivelyDeleteTriviallyDeadInstructions(OldCond);
|
||||
return true;
|
||||
}
|
||||
|
||||
|
|
|
@ -139,3 +139,36 @@ F2:
|
|||
ret i32 %B
|
||||
}
|
||||
|
||||
|
||||
;; Lexically duplicated conditionals should be threaded.
|
||||
|
||||
|
||||
define i32 @test6(i32 %A) {
|
||||
; CHECK: @test6
|
||||
%tmp455 = icmp eq i32 %A, 42
|
||||
br i1 %tmp455, label %BB1, label %BB2
|
||||
|
||||
BB2:
|
||||
; CHECK: call i32 @f1()
|
||||
; CHECK-NEXT: call void @f3()
|
||||
; CHECK-NEXT: ret i32 4
|
||||
call i32 @f1()
|
||||
br label %BB1
|
||||
|
||||
|
||||
BB1:
|
||||
%tmp459 = icmp eq i32 %A, 42
|
||||
br i1 %tmp459, label %BB3, label %BB4
|
||||
|
||||
BB3:
|
||||
call i32 @f2()
|
||||
ret i32 3
|
||||
|
||||
BB4:
|
||||
call void @f3()
|
||||
ret i32 4
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
|
|
@ -1,30 +0,0 @@
|
|||
; RUN: opt < %s -jump-threading -die -S | grep icmp | count 1
|
||||
|
||||
declare void @f1()
|
||||
declare void @f2()
|
||||
declare void @f3()
|
||||
|
||||
define i32 @test(i32 %A) {
|
||||
%tmp455 = icmp eq i32 %A, 42
|
||||
br i1 %tmp455, label %BB1, label %BB2
|
||||
|
||||
BB2:
|
||||
call void @f1()
|
||||
br label %BB1
|
||||
|
||||
|
||||
BB1:
|
||||
%tmp459 = icmp eq i32 %A, 42
|
||||
br i1 %tmp459, label %BB3, label %BB4
|
||||
|
||||
BB3:
|
||||
call void @f2()
|
||||
ret i32 3
|
||||
|
||||
BB4:
|
||||
call void @f3()
|
||||
ret i32 4
|
||||
}
|
||||
|
||||
|
||||
|
Loading…
Reference in New Issue