mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 12:12:47 +01:00
495950222a
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.
38 lines
924 B
LLVM
38 lines
924 B
LLVM
; RUN: opt < %s -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
|
|
|
|
; This test checks that the SimplifyCFG pass won't duplicate a call to a
|
|
; function marked noduplicate.
|
|
;
|
|
; CHECK-LABEL: @noduplicate
|
|
; CHECK: call void @barrier
|
|
; CHECK-NOT: call void @barrier
|
|
define void @noduplicate(i32 %cond, i32* %out) {
|
|
entry:
|
|
%out1 = getelementptr i32, i32* %out, i32 1
|
|
%out2 = getelementptr i32, i32* %out, i32 2
|
|
%cmp = icmp eq i32 %cond, 0
|
|
br i1 %cmp, label %if.then, label %if.end
|
|
|
|
if.then:
|
|
store i32 5, i32* %out
|
|
br label %if.end
|
|
|
|
if.end:
|
|
call void @barrier() #0
|
|
br i1 %cmp, label %cond.end, label %cond.false
|
|
|
|
cond.false:
|
|
store i32 5, i32* %out1
|
|
br label %cond.end
|
|
|
|
cond.end:
|
|
%value = phi i32 [ 1, %cond.false ], [ 0, %if.end ]
|
|
store i32 %value, i32* %out2
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: noduplicate nounwind
|
|
declare void @barrier() #0
|
|
|
|
attributes #0 = { noduplicate nounwind }
|