Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / llvm / 78c552ef309eb8c47d12aac2c0b3af7849c27ce9 / . / test / Transforms / JumpThreading / basic.ll
blob: 50433db152da376e243ba41fd75ceb7b55e8b9b0 [file] [log] [blame]
Chris Lattnerd98eb442009-10-11 03:54:21 +0000[diff] [blame]1; RUN: opt < %s -jump-threading -S | FileCheck %s
Chris Lattnerf29984f2008-04-22 06:35:14 +0000[diff] [blame]2
3declare i32 @f1()
4declare i32 @f2()
5declare void @f3()
6
Chris Lattner41fb43b2009-10-11 03:55:30 +0000[diff] [blame]7define i32 @test1(i1 %cond) {
8; CHECK: @test1
9
Chris Lattnerf29984f2008-04-22 06:35:14 +0000[diff] [blame]10 br i1 %cond, label %T1, label %F1
11
12T1:
13 %v1 = call i32 @f1()
14 br label %Merge
15
16F1:
17 %v2 = call i32 @f2()
18 br label %Merge
19
20Merge:
21 %A = phi i1 [true, %T1], [false, %F1]
22 %B = phi i32 [%v1, %T1], [%v2, %F1]
23 br i1 %A, label %T2, label %F2
24
25T2:
Chris Lattnerd98eb442009-10-11 03:54:21 +0000[diff] [blame]26; CHECK: T2:
27; CHECK: ret i32 %v1
Chris Lattnerf29984f2008-04-22 06:35:14 +0000[diff] [blame]28 call void @f3()
29 ret i32 %B
30
31F2:
Chris Lattnerd98eb442009-10-11 03:54:21 +0000[diff] [blame]32; CHECK: F2:
33; CHECK: ret i32 %v2
Chris Lattnerf29984f2008-04-22 06:35:14 +0000[diff] [blame]34 ret i32 %B
35}
Chris Lattner421fa9e2008-12-03 07:48:08 +0000[diff] [blame]36
37
38;; cond is known false on Entry -> F1 edge!
39define i32 @test2(i1 %cond) {
Chris Lattner41fb43b2009-10-11 03:55:30 +0000[diff] [blame]40; CHECK: @test2
Chris Lattner421fa9e2008-12-03 07:48:08 +0000[diff] [blame]41Entry:
42 br i1 %cond, label %T1, label %F1
43
44T1:
Chris Lattnerd98eb442009-10-11 03:54:21 +0000[diff] [blame]45; CHECK: %v1 = call i32 @f1()
46; CHECK: ret i32 47
Chris Lattner421fa9e2008-12-03 07:48:08 +0000[diff] [blame]47 %v1 = call i32 @f1()
48 br label %Merge
49
50F1:
51 br i1 %cond, label %Merge, label %F2
52
53Merge:
54 %B = phi i32 [47, %T1], [192, %F1]
55 ret i32 %B
56
57F2:
58 call void @f3()
59 ret i32 12
60}
Chris Lattner41fb43b2009-10-11 03:55:30 +0000[diff] [blame]61
62
63; Undef handling.
64define i32 @test3(i1 %cond) {
65; CHECK: @test3
66; CHECK-NEXT: T1:
67; CHECK-NEXT: ret i32 42
68 br i1 undef, label %T1, label %F1
69
70T1:
71 ret i32 42
72
73F1:
74 ret i32 17
75}
Chris Lattnere33583b2009-10-11 04:18:15 +0000[diff] [blame]76
77define i32 @test4(i1 %cond, i1 %cond2) {
78; CHECK: @test4
79
80 br i1 %cond, label %T1, label %F1
81
82T1:
83; CHECK: %v1 = call i32 @f1()
84; CHECK-NEXT: br label %T
85
86 %v1 = call i32 @f1()
87 br label %Merge
88
89F1:
90 %v2 = call i32 @f2()
91; CHECK: %v2 = call i32 @f2()
92; CHECK-NEXT: br i1 %cond2,
93 br label %Merge
94
95Merge:
96 %A = phi i1 [undef, %T1], [%cond2, %F1]
97 %B = phi i32 [%v1, %T1], [%v2, %F1]
98 br i1 %A, label %T2, label %F2
99
100T2:
101 call void @f3()
102 ret i32 %B
103
104F2:
105 ret i32 %B
106}
107
Chris Lattner78c552e2009-10-11 07:24:57 +0000[diff] [blame^]108
109;; This tests that the branch in 'merge' can be cloned up into T1.
110define i32 @test5(i1 %cond, i1 %cond2) {
111; CHECK: @test5
112
113 br i1 %cond, label %T1, label %F1
114
115T1:
116; CHECK: T1:
117; CHECK-NEXT: %v1 = call i32 @f1()
118; CHECK-NEXT: %cond3 = icmp eq i32 %v1, 412
119; CHECK-NEXT: br i1 %cond3, label %T2, label %F2
120
121 %v1 = call i32 @f1()
122 %cond3 = icmp eq i32 %v1, 412
123 br label %Merge
124
125F1:
126 %v2 = call i32 @f2()
127 br label %Merge
128
129Merge:
130 %A = phi i1 [%cond3, %T1], [%cond2, %F1]
131 %B = phi i32 [%v1, %T1], [%v2, %F1]
132 br i1 %A, label %T2, label %F2
133
134T2:
135 call void @f3()
136 ret i32 %B
137
138F2:
139 ret i32 %B
140}
141