forked from OSchip/llvm-project
parent
249da5cb73
commit
de5ab4860f
|
@ -451,6 +451,12 @@ static unsigned GetBestDestForJumpOnUndef(BasicBlock *BB) {
|
|||
/// ProcessBlock - If there are any predecessors whose control can be threaded
|
||||
/// through to a successor, transform them now.
|
||||
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) &&
|
||||
BB != &BB->getParent()->getEntryBlock())
|
||||
return false;
|
||||
|
||||
// If this block has a single predecessor, and if that pred has a single
|
||||
// successor, merge the blocks. This encourages recursive jump threading
|
||||
// because now the condition in this block can be threaded through
|
||||
|
|
|
@ -234,3 +234,28 @@ bb2:
|
|||
return:
|
||||
ret void
|
||||
}
|
||||
|
||||
; PR6119
|
||||
define i32 @test8(i32 %action) nounwind {
|
||||
entry:
|
||||
switch i32 %action, label %lor.rhs [
|
||||
i32 1, label %if.then
|
||||
i32 0, label %lor.end
|
||||
]
|
||||
|
||||
if.then: ; preds = %for.cond, %lor.end, %entry
|
||||
ret i32 undef
|
||||
|
||||
lor.rhs: ; preds = %entry
|
||||
br label %lor.end
|
||||
|
||||
lor.end: ; preds = %lor.rhs, %entry
|
||||
%cmp103 = xor i1 undef, undef ; <i1> [#uses=1]
|
||||
br i1 %cmp103, label %for.cond, label %if.then
|
||||
|
||||
for.cond: ; preds = %for.body, %lor.end
|
||||
br i1 undef, label %if.then, label %for.body
|
||||
|
||||
for.body: ; preds = %for.cond
|
||||
br label %for.cond
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue