umin-icmp.ll
6.16 KB
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
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -S -instcombine < %s | FileCheck %s
; If we have a umin feeding an unsigned or equality icmp that shares an
; operand with the umin, the compare should always be folded.
; Test all 4 foldable predicates (eq,ne,uge,ult) * 4 commutation
; possibilities for each predicate. Note that folds to true/false
; (predicate is ule/ugt) or folds to an existing instruction should be
; handled by InstSimplify.
; umin(X, Y) == X --> X <= Y
define i1 @eq_umin1(i32 %x, i32 %y) {
; CHECK-LABEL: @eq_umin1(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp eq i32 %sel, %x
ret i1 %cmp2
}
; Commute min operands.
define i1 @eq_umin2(i32 %x, i32 %y) {
; CHECK-LABEL: @eq_umin2(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp eq i32 %sel, %x
ret i1 %cmp2
}
; Disguise the icmp predicate by commuting the min op to the RHS.
define i1 @eq_umin3(i32 %a, i32 %y) {
; CHECK-LABEL: @eq_umin3(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp eq i32 %x, %sel
ret i1 %cmp2
}
; Commute min operands.
define i1 @eq_umin4(i32 %a, i32 %y) {
; CHECK-LABEL: @eq_umin4(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp eq i32 %x, %sel
ret i1 %cmp2
}
; umin(X, Y) >= X --> X <= Y
define i1 @uge_umin1(i32 %x, i32 %y) {
; CHECK-LABEL: @uge_umin1(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp uge i32 %sel, %x
ret i1 %cmp2
}
; Commute min operands.
define i1 @uge_umin2(i32 %x, i32 %y) {
; CHECK-LABEL: @uge_umin2(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp uge i32 %sel, %x
ret i1 %cmp2
}
; Disguise the icmp predicate by commuting the min op to the RHS.
define i1 @uge_umin3(i32 %a, i32 %y) {
; CHECK-LABEL: @uge_umin3(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp ule i32 %x, %sel
ret i1 %cmp2
}
; Commute min operands.
define i1 @uge_umin4(i32 %a, i32 %y) {
; CHECK-LABEL: @uge_umin4(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ule i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp ule i32 %x, %sel
ret i1 %cmp2
}
; umin(X, Y) != X --> X > Y
define i1 @ne_umin1(i32 %x, i32 %y) {
; CHECK-LABEL: @ne_umin1(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ugt i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp ne i32 %sel, %x
ret i1 %cmp2
}
; Commute min operands.
define i1 @ne_umin2(i32 %x, i32 %y) {
; CHECK-LABEL: @ne_umin2(
; CHECK-NEXT: [[CMP1:%.*]] = icmp ult i32 %y, %x
; CHECK-NEXT: ret i1 [[CMP1]]
;
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp ne i32 %sel, %x
ret i1 %cmp2
}
; Disguise the icmp predicate by commuting the min op to the RHS.
define i1 @ne_umin3(i32 %a, i32 %y) {
; CHECK-LABEL: @ne_umin3(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ugt i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp ne i32 %x, %sel
ret i1 %cmp2
}
; Commute min operands.
define i1 @ne_umin4(i32 %a, i32 %y) {
; CHECK-LABEL: @ne_umin4(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP1:%.*]] = icmp ugt i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP1]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp ne i32 %x, %sel
ret i1 %cmp2
}
; umin(X, Y) < X --> X > Y
define i1 @ult_umin1(i32 %x, i32 %y) {
; CHECK-LABEL: @ult_umin1(
; CHECK-NEXT: [[CMP2:%.*]] = icmp ugt i32 %x, %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp ult i32 %sel, %x
ret i1 %cmp2
}
; Commute min operands.
define i1 @ult_umin2(i32 %x, i32 %y) {
; CHECK-LABEL: @ult_umin2(
; CHECK-NEXT: [[CMP1:%.*]] = icmp ult i32 %y, %x
; CHECK-NEXT: ret i1 [[CMP1]]
;
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp ult i32 %sel, %x
ret i1 %cmp2
}
; Disguise the icmp predicate by commuting the min op to the RHS.
define i1 @ult_umin3(i32 %a, i32 %y) {
; CHECK-LABEL: @ult_umin3(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP2:%.*]] = icmp ugt i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP2]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %x, %y
%sel = select i1 %cmp1, i32 %x, i32 %y
%cmp2 = icmp ugt i32 %x, %sel
ret i1 %cmp2
}
; Commute min operands.
define i1 @ult_umin4(i32 %a, i32 %y) {
; CHECK-LABEL: @ult_umin4(
; CHECK-NEXT: [[X:%.*]] = add i32 %a, 3
; CHECK-NEXT: [[CMP1:%.*]] = icmp ugt i32 [[X]], %y
; CHECK-NEXT: ret i1 [[CMP1]]
;
%x = add i32 %a, 3 ; thwart complexity-based canonicalization
%cmp1 = icmp ult i32 %y, %x
%sel = select i1 %cmp1, i32 %y, i32 %x
%cmp2 = icmp ugt i32 %x, %sel
ret i1 %cmp2
}