aa2009fe78
First step after e113317958,
in these tests, DomTree is valid afterwards, so mark them as such,
so that they don't regress.
In further steps, SimplifyCFG transforms shall taught to preserve DomTree,
in as small steps as possible.
23 lines
484 B
LLVM
23 lines
484 B
LLVM
; This test checks to make sure that 'br X, Dest, Dest' is folded into
|
|
; 'br Dest'
|
|
|
|
; RUN: opt < %s -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
|
|
|
|
declare void @noop()
|
|
|
|
; CHECK-NOT: br i1 %c2
|
|
define i32 @test(i1 %c1, i1 %c2) {
|
|
call void @noop( )
|
|
br i1 %c1, label %A, label %Y
|
|
A: ; preds = %0
|
|
call void @noop( )
|
|
br i1 %c2, label %X, label %X
|
|
X: ; preds = %Y, %A, %A
|
|
call void @noop( )
|
|
ret i32 0
|
|
Y: ; preds = %0
|
|
call void @noop( )
|
|
br label %X
|
|
}
|
|
|