1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -S -passes=simplifycfg -simplifycfg-require-and-preserve-domtree=1 | FileCheck %s
declare void @foo()
declare void @bar()
define void @test_and1(i32 %a, i32 %b) {
; CHECK-LABEL: @test_and1(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP1:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMP2:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[AND:%.*]] = and i1 [[CMP1]], [[CMP2]]
; CHECK-NEXT: br i1 [[AND]], label [[TAKEN:%.*]], label [[END:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
entry:
%cmp1 = icmp eq i32 %a, 0
%cmp2 = icmp eq i32 %b, 0
%and = and i1 %cmp1, %cmp2
br i1 %and, label %taken, label %end
taken:
call void @bar()
%cmp3 = icmp eq i32 %a, 0 ;; <-- implied true
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
; We can't infer anything if the result of the 'and' is false
define void @test_and2(i32 %a, i32 %b) {
; CHECK-LABEL: @test_and2(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP1:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMP2:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[AND:%.*]] = and i1 [[CMP1]], [[CMP2]]
; CHECK-NEXT: br i1 [[AND]], label [[END:%.*]], label [[TAKEN:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: [[CMP3:%.*]] = icmp eq i32 [[A]], 0
; CHECK-NEXT: br i1 [[CMP3]], label [[IF_THEN:%.*]], label [[END]]
; CHECK: if.then:
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
entry:
%cmp1 = icmp eq i32 %a, 0
%cmp2 = icmp eq i32 %b, 0
%and = and i1 %cmp1, %cmp2
br i1 %and, label %end, label %taken
taken:
call void @bar()
%cmp3 = icmp eq i32 %a, 0
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
define void @test_or1(i32 %a, i32 %b) {
; CHECK-LABEL: @test_or1(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP1:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMP2:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[OR:%.*]] = or i1 [[CMP1]], [[CMP2]]
; CHECK-NEXT: br i1 [[OR]], label [[END:%.*]], label [[TAKEN:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
entry:
%cmp1 = icmp eq i32 %a, 0
%cmp2 = icmp eq i32 %b, 0
%or = or i1 %cmp1, %cmp2
br i1 %or, label %end, label %taken
taken:
call void @bar()
%cmp3 = icmp ne i32 %a, 0 ;; <-- implied true
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
; We can't infer anything if the result of the 'or' is true
define void @test_or2(i32 %a, i32 %b) {
; CHECK-LABEL: @test_or2(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP1:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMP2:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[OR:%.*]] = or i1 [[CMP1]], [[CMP2]]
; CHECK-NEXT: br i1 [[OR]], label [[TAKEN:%.*]], label [[END:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: [[CMP3:%.*]] = icmp eq i32 [[A]], 0
; CHECK-NEXT: br i1 [[CMP3]], label [[IF_THEN:%.*]], label [[END]]
; CHECK: if.then:
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
entry:
%cmp1 = icmp eq i32 %a, 0
%cmp2 = icmp eq i32 %b, 0
%or = or i1 %cmp1, %cmp2
br i1 %or, label %taken, label %end
taken:
call void @bar()
%cmp3 = icmp eq i32 %a, 0
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
; We can recurse a tree of 'and' or 'or's.
define void @test_and_recurse1(i32 %a, i32 %b, i32 %c) {
; CHECK-LABEL: @test_and_recurse1(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMPA:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMPB:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[CMPC:%.*]] = icmp eq i32 [[C:%.*]], 0
; CHECK-NEXT: [[AND1:%.*]] = and i1 [[CMPA]], [[CMPB]]
; CHECK-NEXT: [[AND2:%.*]] = and i1 [[AND1]], [[CMPC]]
; CHECK-NEXT: br i1 [[AND2]], label [[TAKEN:%.*]], label [[END:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
entry:
%cmpa = icmp eq i32 %a, 0
%cmpb = icmp eq i32 %b, 0
%cmpc = icmp eq i32 %c, 0
%and1 = and i1 %cmpa, %cmpb
%and2 = and i1 %and1, %cmpc
br i1 %and2, label %taken, label %end
taken:
call void @bar()
%cmp3 = icmp eq i32 %a, 0
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
; Check to make sure we don't recurse too deep.
define void @test_and_recurse2(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f,
; CHECK-LABEL: @test_and_recurse2(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMPA:%.*]] = icmp eq i32 [[A:%.*]], 0
; CHECK-NEXT: [[CMPB:%.*]] = icmp eq i32 [[B:%.*]], 0
; CHECK-NEXT: [[CMPC:%.*]] = icmp eq i32 [[C:%.*]], 0
; CHECK-NEXT: [[CMPD:%.*]] = icmp eq i32 [[D:%.*]], 0
; CHECK-NEXT: [[CMPE:%.*]] = icmp eq i32 [[E:%.*]], 0
; CHECK-NEXT: [[CMPF:%.*]] = icmp eq i32 [[F:%.*]], 0
; CHECK-NEXT: [[CMPG:%.*]] = icmp eq i32 [[G:%.*]], 0
; CHECK-NEXT: [[CMPH:%.*]] = icmp eq i32 [[H:%.*]], 0
; CHECK-NEXT: [[AND1:%.*]] = and i1 [[CMPA]], [[CMPB]]
; CHECK-NEXT: [[AND2:%.*]] = and i1 [[AND1]], [[CMPC]]
; CHECK-NEXT: [[AND3:%.*]] = and i1 [[AND2]], [[CMPD]]
; CHECK-NEXT: [[AND4:%.*]] = and i1 [[AND3]], [[CMPE]]
; CHECK-NEXT: [[AND5:%.*]] = and i1 [[AND4]], [[CMPF]]
; CHECK-NEXT: [[AND6:%.*]] = and i1 [[AND5]], [[CMPG]]
; CHECK-NEXT: [[AND7:%.*]] = and i1 [[AND6]], [[CMPH]]
; CHECK-NEXT: br i1 [[AND7]], label [[TAKEN:%.*]], label [[END:%.*]]
; CHECK: taken:
; CHECK-NEXT: call void @bar()
; CHECK-NEXT: [[CMP3:%.*]] = icmp eq i32 [[A]], 0
; CHECK-NEXT: br i1 [[CMP3]], label [[IF_THEN:%.*]], label [[END]]
; CHECK: if.then:
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: ret void
;
i32 %g, i32 %h) {
entry:
%cmpa = icmp eq i32 %a, 0
%cmpb = icmp eq i32 %b, 0
%cmpc = icmp eq i32 %c, 0
%cmpd = icmp eq i32 %d, 0
%cmpe = icmp eq i32 %e, 0
%cmpf = icmp eq i32 %f, 0
%cmpg = icmp eq i32 %g, 0
%cmph = icmp eq i32 %h, 0
%and1 = and i1 %cmpa, %cmpb
%and2 = and i1 %and1, %cmpc
%and3 = and i1 %and2, %cmpd
%and4 = and i1 %and3, %cmpe
%and5 = and i1 %and4, %cmpf
%and6 = and i1 %and5, %cmpg
%and7 = and i1 %and6, %cmph
br i1 %and7, label %taken, label %end
taken:
call void @bar()
%cmp3 = icmp eq i32 %a, 0 ; <-- can be implied true
br i1 %cmp3, label %if.then, label %end
if.then:
call void @foo()
br label %end
end:
ret void
}
|
