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
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -passes=constraint-elimination -S %s | FileCheck %s
define i1 @idx_known_positive_via_len_1(i8 %len, i8 %idx) {
; CHECK-LABEL: @idx_known_positive_via_len_1(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN_POS:%.*]] = icmp sge i8 [[LEN:%.*]], 0
; CHECK-NEXT: [[IDX_ULT_LEN:%.*]] = icmp ult i8 [[IDX:%.*]], [[LEN]]
; CHECK-NEXT: [[AND_1:%.*]] = and i1 [[LEN_POS]], [[IDX_ULT_LEN]]
; CHECK-NEXT: br i1 [[AND_1]], label [[THEN_1:%.*]], label [[ELSE:%.*]]
; CHECK: then.1:
; CHECK-NEXT: [[T_1:%.*]] = icmp ult i8 [[IDX]], [[LEN]]
; CHECK-NEXT: [[T_2:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: [[R_1:%.*]] = xor i1 true, true
; CHECK-NEXT: [[C_1:%.*]] = icmp sge i8 [[IDX]], 1
; CHECK-NEXT: [[R_2:%.*]] = xor i1 [[R_1]], [[C_1]]
; CHECK-NEXT: [[C_2:%.*]] = icmp sge i8 [[LEN]], 1
; CHECK-NEXT: [[R_3:%.*]] = xor i1 [[R_2]], true
; CHECK-NEXT: ret i1 [[R_3]]
; CHECK: else:
; CHECK-NEXT: [[C_3:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: ret i1 [[C_3]]
;
entry:
%len.pos = icmp sge i8 %len, 0
%idx.ult.len = icmp ult i8 %idx, %len
%and.1 = and i1 %len.pos, %idx.ult.len
br i1 %and.1, label %then.1, label %else
then.1:
%t.1 = icmp ult i8 %idx, %len
%t.2 = icmp sge i8 %idx, 0
%r.1 = xor i1 %t.1, %t.2
%c.1 = icmp sge i8 %idx, 1
%r.2 = xor i1 %r.1, %c.1
%c.2 = icmp sge i8 %len, 1
%r.3 = xor i1 %r.2, %c.2
ret i1 %r.3
else:
%c.3 = icmp sge i8 %idx, 0
ret i1 %c.3
}
; Like @idx_known_positive_via_len_1, but with a different order of known facts.
define i1 @idx_known_positive_via_len_2(i8 %len, i8 %idx) {
; CHECK-LABEL: @idx_known_positive_via_len_2(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[IDX_ULT_LEN:%.*]] = icmp ult i8 [[IDX:%.*]], [[LEN:%.*]]
; CHECK-NEXT: [[LEN_POS:%.*]] = icmp sge i8 [[LEN]], 0
; CHECK-NEXT: [[AND_1:%.*]] = and i1 [[IDX_ULT_LEN]], [[LEN_POS]]
; CHECK-NEXT: br i1 [[AND_1]], label [[THEN_1:%.*]], label [[ELSE:%.*]]
; CHECK: then.1:
; CHECK-NEXT: [[T_1:%.*]] = icmp ult i8 [[IDX]], [[LEN]]
; CHECK-NEXT: [[T_2:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: [[R_1:%.*]] = xor i1 true, true
; CHECK-NEXT: [[C_1:%.*]] = icmp sge i8 [[IDX]], 1
; CHECK-NEXT: [[R_2:%.*]] = xor i1 [[R_1]], [[C_1]]
; CHECK-NEXT: [[C_2:%.*]] = icmp sge i8 [[LEN]], 1
; CHECK-NEXT: [[R_3:%.*]] = xor i1 [[R_2]], true
; CHECK-NEXT: ret i1 [[R_3]]
; CHECK: else:
; CHECK-NEXT: [[C_3:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: ret i1 [[C_3]]
;
entry:
%idx.ult.len = icmp ult i8 %idx, %len
%len.pos = icmp sge i8 %len, 0
%and.1 = and i1 %idx.ult.len, %len.pos
br i1 %and.1, label %then.1, label %else
then.1:
%t.1 = icmp ult i8 %idx, %len
%t.2 = icmp sge i8 %idx, 0
%r.1 = xor i1 %t.1, %t.2
%c.1 = icmp sge i8 %idx, 1
%r.2 = xor i1 %r.1, %c.1
%c.2 = icmp sge i8 %len, 1
%r.3 = xor i1 %r.2, %c.2
ret i1 %r.3
else:
%c.3 = icmp sge i8 %idx, 0
ret i1 %c.3
}
; %len >=u 0 is not enough to determine idx >=s 0.
define i1 @idx_not_known_positive_via_len_uge(i8 %len, i8 %idx) {
; CHECK-LABEL: @idx_not_known_positive_via_len_uge(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN_POS:%.*]] = icmp uge i8 [[LEN:%.*]], 0
; CHECK-NEXT: [[IDX_ULT_LEN:%.*]] = icmp ult i8 [[IDX:%.*]], [[LEN]]
; CHECK-NEXT: [[AND_1:%.*]] = and i1 [[LEN_POS]], [[IDX_ULT_LEN]]
; CHECK-NEXT: br i1 [[AND_1]], label [[THEN_1:%.*]], label [[ELSE:%.*]]
; CHECK: then.1:
; CHECK-NEXT: [[C_1:%.*]] = icmp ult i8 [[IDX]], [[LEN]]
; CHECK-NEXT: [[C_2:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: [[R_1:%.*]] = xor i1 true, [[C_2]]
; CHECK-NEXT: [[C_3:%.*]] = icmp sge i8 [[IDX]], 1
; CHECK-NEXT: [[R_2:%.*]] = xor i1 [[R_1]], [[C_3]]
; CHECK-NEXT: [[C_4:%.*]] = icmp sge i8 [[LEN]], 1
; CHECK-NEXT: [[R_3:%.*]] = xor i1 [[R_2]], [[C_4]]
; CHECK-NEXT: ret i1 [[R_3]]
; CHECK: else:
; CHECK-NEXT: [[C_5:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: ret i1 [[C_5]]
;
entry:
%len.pos = icmp uge i8 %len, 0
%idx.ult.len = icmp ult i8 %idx, %len
%and.1 = and i1 %len.pos, %idx.ult.len
br i1 %and.1, label %then.1, label %else
then.1:
%c.1 = icmp ult i8 %idx, %len
%c.2 = icmp sge i8 %idx, 0
%r.1 = xor i1 %c.1, %c.2
%c.3 = icmp sge i8 %idx, 1
%r.2 = xor i1 %r.1, %c.3
%c.4 = icmp sge i8 %len, 1
%r.3 = xor i1 %r.2, %c.4
ret i1 %r.3
else:
%c.5 = icmp sge i8 %idx, 0
ret i1 %c.5
}
; There's no information about %len which could be used to determine %len >=s 0.
define i1 @idx_not_known_positive_via_len(i8 %len, i8 %idx) {
; CHECK-LABEL: @idx_not_known_positive_via_len(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[IDX_ULT_LEN:%.*]] = icmp ult i8 [[IDX:%.*]], [[LEN:%.*]]
; CHECK-NEXT: br i1 [[IDX_ULT_LEN]], label [[THEN_1:%.*]], label [[ELSE:%.*]]
; CHECK: then.1:
; CHECK-NEXT: [[C_1:%.*]] = icmp ult i8 [[IDX]], [[LEN]]
; CHECK-NEXT: [[C_2:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: [[R_1:%.*]] = xor i1 true, [[C_2]]
; CHECK-NEXT: [[C_3:%.*]] = icmp sge i8 [[IDX]], 1
; CHECK-NEXT: [[R_2:%.*]] = xor i1 [[R_1]], [[C_3]]
; CHECK-NEXT: [[C_4:%.*]] = icmp sge i8 [[LEN]], 1
; CHECK-NEXT: [[R_3:%.*]] = xor i1 [[R_2]], [[C_4]]
; CHECK-NEXT: ret i1 [[R_3]]
; CHECK: else:
; CHECK-NEXT: [[C_5:%.*]] = icmp sge i8 [[IDX]], 0
; CHECK-NEXT: ret i1 [[C_5]]
;
entry:
%idx.ult.len = icmp ult i8 %idx, %len
br i1 %idx.ult.len, label %then.1, label %else
then.1:
%c.1 = icmp ult i8 %idx, %len
%c.2 = icmp sge i8 %idx, 0
%r.1 = xor i1 %c.1, %c.2
%c.3 = icmp sge i8 %idx, 1
%r.2 = xor i1 %r.1, %c.3
%c.4 = icmp sge i8 %len, 1
%r.3 = xor i1 %r.2, %c.4
ret i1 %r.3
else:
%c.5 = icmp sge i8 %idx, 0
ret i1 %c.5
}
define i1 @ult_signed_pos_constant(i8 %a) {
; CHECK-LABEL: @ult_signed_pos_constant(
; CHECK-NEXT: [[A_ULT_4:%.*]] = icmp ult i8 [[A:%.*]], 4
; CHECK-NEXT: br i1 [[A_ULT_4]], label [[THEN:%.*]], label [[ELSE:%.*]]
; CHECK: then:
; CHECK-NEXT: [[T_0:%.*]] = icmp sge i8 [[A]], 0
; CHECK-NEXT: [[T_1:%.*]] = icmp slt i8 [[A]], 4
; CHECK-NEXT: [[RES_1:%.*]] = xor i1 true, true
; CHECK-NEXT: [[C_0:%.*]] = icmp slt i8 [[A]], 5
; CHECK-NEXT: [[RES_2:%.*]] = xor i1 [[RES_1]], true
; CHECK-NEXT: ret i1 [[RES_2]]
; CHECK: else:
; CHECK-NEXT: [[C_2:%.*]] = icmp sge i8 [[A]], 0
; CHECK-NEXT: [[C_3:%.*]] = icmp slt i8 [[A]], 4
; CHECK-NEXT: [[RES_3:%.*]] = xor i1 [[C_2]], [[C_3]]
; CHECK-NEXT: [[C_4:%.*]] = icmp slt i8 [[A]], 5
; CHECK-NEXT: [[RES_4:%.*]] = xor i1 [[RES_3]], [[C_4]]
; CHECK-NEXT: ret i1 [[RES_4]]
;
%a.ult.4 = icmp ult i8 %a, 4
br i1 %a.ult.4, label %then, label %else
then:
%t.0 = icmp sge i8 %a, 0
%t.1 = icmp slt i8 %a, 4
%res.1 = xor i1 %t.0, %t.1
%c.0 = icmp slt i8 %a, 5
%res.2 = xor i1 %res.1, %c.0
ret i1 %res.2
else:
%c.2 = icmp sge i8 %a, 0
%c.3 = icmp slt i8 %a, 4
%res.3 = xor i1 %c.2, %c.3
%c.4 = icmp slt i8 %a, 5
%res.4 = xor i1 %res.3, %c.4
ret i1 %res.4
}
define i1 @ult_signed_neg_constant(i8 %a) {
; CHECK-LABEL: @ult_signed_neg_constant(
; CHECK-NEXT: [[A_ULT_4:%.*]] = icmp ult i8 [[A:%.*]], -2
; CHECK-NEXT: br i1 [[A_ULT_4]], label [[THEN:%.*]], label [[ELSE:%.*]]
; CHECK: then:
; CHECK-NEXT: [[C_0:%.*]] = icmp sge i8 [[A]], 0
; CHECK-NEXT: [[C_1:%.*]] = icmp slt i8 [[A]], -2
; CHECK-NEXT: [[RES_1:%.*]] = xor i1 [[C_0]], [[C_1]]
; CHECK-NEXT: ret i1 [[RES_1]]
; CHECK: else:
; CHECK-NEXT: ret i1 false
;
%a.ult.4 = icmp ult i8 %a, -2
br i1 %a.ult.4, label %then, label %else
then:
%c.0 = icmp sge i8 %a, 0
%c.1 = icmp slt i8 %a, -2
%res.1 = xor i1 %c.0, %c.1
ret i1 %res.1
else:
ret i1 0
}
|
