blob: ff087693ea89eeff2e6d36c46f8a424baf21f976 [file] [log] [blame]
Hal Finkela3f23e32014-10-14 16:04:49 +00001; RUN: opt -S -jump-threading < %s | FileCheck %s
2
3declare i8* @escape()
4declare void @llvm.assume(i1)
5
6define i1 @test1(i1 %cond) {
7entry:
8 br i1 %cond, label %taken, label %not_taken
9
10; CHECK-LABEL: @test1
11; CHECK: br i1 %cond, label %no, label %yes
12; CHECK: ret i1 true
13
14taken:
15 %res1 = call i8* @escape()
16 %a = icmp eq i8* %res1, null
Hal Finkelcb9f78e2016-12-15 02:53:42 +000017 tail call void @llvm.assume(i1 %a) [ "affected"(i8* %res1) ]
Hal Finkela3f23e32014-10-14 16:04:49 +000018 br label %done
19not_taken:
20 %res2 = call i8* @escape()
21 %b = icmp ne i8* %res2, null
Hal Finkelcb9f78e2016-12-15 02:53:42 +000022 tail call void @llvm.assume(i1 %b) [ "affected"(i8* %res2) ]
Hal Finkela3f23e32014-10-14 16:04:49 +000023 br label %done
24
25; An assume that can be used to simplify this comparison dominates each
26; predecessor branch (although no assume dominates the cmp itself). Make sure
27; this still can be simplified.
28
29done:
30 %res = phi i8* [ %res1, %taken ], [ %res2, %not_taken ]
31 %cnd = icmp ne i8* %res, null
32 br i1 %cnd, label %yes, label %no
33
34yes:
35 ret i1 true
36no:
37 ret i1 false
38}
39