aa2009fe78
First step after e1133179587dd895962a2fe4d6eb0cb1e63b5ee2, 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.
22 lines
522 B
LLVM
22 lines
522 B
LLVM
; RUN: opt < %s -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | grep " = phi " | count 1
|
|
|
|
; instcombine should sort the PHI operands so that simplifycfg can see the
|
|
; duplicate and remove it.
|
|
|
|
define i32 @foo(i1 %t) {
|
|
entry:
|
|
call void @bar()
|
|
br i1 %t, label %true, label %false
|
|
true:
|
|
call void @bar()
|
|
br label %false
|
|
false:
|
|
%a = phi i32 [ 2, %true ], [ 5, %entry ]
|
|
%b = phi i32 [ 5, %entry ], [ 2, %true ]
|
|
call void @bar()
|
|
%c = add i32 %a, %b
|
|
ret i32 %c
|
|
}
|
|
|
|
declare void @bar()
|