1 ; This test makes sure that these instructions are properly eliminated.
3 ; RUN: opt < %s -instcombine -S | FileCheck %s
5 define i32 @test1(i32 %A, i1 %b) {
7 br i1 %b, label %BB1, label %BB2
10 ; Combine away one argument PHI nodes
11 %B = phi i32 [ %A, %BB0 ]
18 ; CHECK-NEXT: ret i32 %A
21 define i32 @test2(i32 %A, i1 %b) {
23 br i1 %b, label %BB1, label %BB2
29 ; Combine away PHI nodes with same values
30 %B = phi i32 [ %A, %BB0 ], [ %A, %BB1 ]
34 ; CHECK-NEXT: ret i32 %A
37 define i32 @test3(i32 %A, i1 %b) {
42 ; PHI has same value always.
43 %B = phi i32 [ %A, %BB0 ], [ %B, %Loop ]
44 br i1 %b, label %Loop, label %Exit
50 ; CHECK-NEXT: ret i32 %A
53 define i32 @test4(i1 %b) {
58 Loop: ; preds = %L2, %Loop
59 ; PHI has same value always.
60 %B = phi i32 [ %B, %L2 ], [ %B, %Loop ]
61 br i1 %b, label %L2, label %Loop
67 ; CHECK-NEXT: br i1 %b
70 define i32 @test5(i32 %A, i1 %b) {
74 Loop: ; preds = %Loop, %BB0
75 ; PHI has same value always.
76 %B = phi i32 [ %A, %BB0 ], [ undef, %Loop ]
77 br i1 %b, label %Loop, label %Exit
83 ; CHECK-NEXT: br i1 %b
85 ; CHECK-NEXT: ret i32 %A
88 define i32 @test6(i16 %A, i1 %b) {
90 %X = zext i16 %A to i32
91 br i1 %b, label %BB1, label %BB2
94 %Y = zext i16 %A to i32
98 ;; Suck casts into phi
99 %B = phi i32 [ %X, %BB0 ], [ %Y, %BB1 ]
103 ; CHECK: zext i16 %A to i32
104 ; CHECK-NEXT: ret i32
107 define i32 @test7(i32 %A, i1 %b) {
111 Loop: ; preds = %Loop, %BB0
113 %B = phi i32 [ %A, %BB0 ], [ %C, %Loop ]
115 br i1 %b, label %Loop, label %Exit
117 Exit: ; preds = %Loop
121 ; CHECK-NEXT: br i1 %b
124 define i32* @test8({ i32, i32 } *%A, i1 %b) {
126 %X = getelementptr { i32, i32 } *%A, i32 0, i32 1
127 br i1 %b, label %BB1, label %BB2
130 %Y = getelementptr { i32, i32 } *%A, i32 0, i32 1
134 ;; Suck GEPs into phi
135 %B = phi i32* [ %X, %BB0 ], [ %Y, %BB1 ]
140 ; CHECK-NEXT: %B = getelementptr
141 ; CHECK-NEXT: ret i32* %B
144 define i32 @test9(i32* %A, i32* %B) {
146 %c = icmp eq i32* %A, null
147 br i1 %c, label %bb1, label %bb
150 %C = load i32* %B, align 1
154 %D = load i32* %A, align 1
158 %E = phi i32 [ %C, %bb ], [ %D, %bb1 ]
162 ; CHECK-NEXT: phi i32* [ %B, %bb ], [ %A, %bb1 ]
163 ; CHECK-NEXT: %E = load i32* %{{[^,]*}}, align 1
164 ; CHECK-NEXT: ret i32 %E
168 define i32 @test10(i32* %A, i32* %B) {
170 %c = icmp eq i32* %A, null
171 br i1 %c, label %bb1, label %bb
174 %C = load i32* %B, align 16
178 %D = load i32* %A, align 32
182 %E = phi i32 [ %C, %bb ], [ %D, %bb1 ]
186 ; CHECK-NEXT: phi i32* [ %B, %bb ], [ %A, %bb1 ]
187 ; CHECK-NEXT: %E = load i32* %{{[^,]*}}, align 16
188 ; CHECK-NEXT: ret i32 %E
193 declare i1 @test11a()
195 define i1 @test11() {
198 %i = ptrtoint i32* %a to i32
199 %b = call i1 @test11a()
200 br i1 %b, label %one, label %two
203 %x = phi i32 [%i, %entry], [%y, %two]
204 %c = call i1 @test11a()
205 br i1 %c, label %two, label %end
208 %y = phi i32 [%i, %entry], [%x, %one]
209 %d = call i1 @test11a()
210 br i1 %d, label %one, label %end
213 %f = phi i32 [ %x, %one], [%y, %two]
214 ; Change the %f to %i, and the optimizer suddenly becomes a lot smarter
215 ; even though %f must equal %i at this point
216 %g = inttoptr i32 %f to i32*
217 store i32 10, i32* %g
218 %z = call i1 @test11a()