2 # Copyright (C) 2014 Intel Corporation
4 # Permission is hereby granted, free of charge, to any person obtaining a
5 # copy of this software and associated documentation files (the "Software"),
6 # to deal in the Software without restriction, including without limitation
7 # the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 # and/or sell copies of the Software, and to permit persons to whom the
9 # Software is furnished to do so, subject to the following conditions:
11 # The above copyright notice and this permission notice (including the next
12 # paragraph) shall be included in all copies or substantial portions of the
15 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 # Jason Ekstrand (jason@jlekstrand.net)
26 from __future__
import print_function
28 from collections
import OrderedDict
32 # Convenience variables
38 # Written in the form (<search>, <replace>) where <search> is an expression
39 # and <replace> is either an expression or a value. An expression is
40 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
41 # where each source is either an expression or a value. A value can be
42 # either a numeric constant or a string representing a variable name.
44 # If the opcode in a search expression is prefixed by a '~' character, this
45 # indicates that the operation is inexact. Such operations will only get
46 # applied to SSA values that do not have the exact bit set. This should be
47 # used by by any optimizations that are not bit-for-bit exact. It should not,
48 # however, be used for backend-requested lowering operations as those need to
49 # happen regardless of precision.
51 # Variable names are specified as "[#]name[@type][(cond)]" where "#" inicates
52 # that the given variable will only match constants and the type indicates that
53 # the given variable will only match values from ALU instructions with the
54 # given output type, and (cond) specifies an additional condition function
55 # (see nir_search_helpers.h).
57 # For constants, you have to be careful to make sure that it is the right
58 # type because python is unaware of the source and destination types of the
61 # All expression types can have a bit-size specified. For opcodes, this
62 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
63 # type and size, and for literals, you can write "2.0@32". In the search half
64 # of the expression this indicates that it should only match that particular
65 # bit-size. In the replace half of the expression this indicates that the
66 # constructed value should have that bit-size.
70 (('imul', a
, '#b@32(is_pos_power_of_two)'), ('ishl', a
, ('find_lsb', b
))),
71 (('imul', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a
, ('find_lsb', ('iabs', b
))))),
76 (('udiv', a
, '#b@32(is_pos_power_of_two)'), ('ushr', a
, ('find_lsb', b
))),
77 (('idiv', a
, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', b
))), 'options->lower_idiv'),
78 (('idiv', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', ('iabs', b
))))), 'options->lower_idiv'),
79 (('umod', a
, '#b(is_pos_power_of_two)'), ('iand', a
, ('isub', b
, 1))),
81 (('fneg', ('fneg', a
)), a
),
82 (('ineg', ('ineg', a
)), a
),
83 (('fabs', ('fabs', a
)), ('fabs', a
)),
84 (('fabs', ('fneg', a
)), ('fabs', a
)),
85 (('fabs', ('u2f32', a
)), ('u2f32', a
)),
86 (('iabs', ('iabs', a
)), ('iabs', a
)),
87 (('iabs', ('ineg', a
)), ('iabs', a
)),
88 (('~fadd', a
, 0.0), a
),
90 (('usadd_4x8', a
, 0), a
),
91 (('usadd_4x8', a
, ~
0), ~
0),
92 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
93 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
94 (('~fadd', ('fneg', a
), a
), 0.0),
95 (('iadd', ('ineg', a
), a
), 0),
96 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
97 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
98 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
99 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
100 (('~fmul', a
, 0.0), 0.0),
102 (('umul_unorm_4x8', a
, 0), 0),
103 (('umul_unorm_4x8', a
, ~
0), a
),
104 (('fmul', a
, 1.0), a
),
106 (('fmul', a
, -1.0), ('fneg', a
)),
107 (('imul', a
, -1), ('ineg', a
)),
108 (('~ffma', 0.0, a
, b
), b
),
109 (('~ffma', a
, 0.0, b
), b
),
110 (('~ffma', a
, b
, 0.0), ('fmul', a
, b
)),
111 (('ffma', a
, 1.0, b
), ('fadd', a
, b
)),
112 (('ffma', 1.0, a
, b
), ('fadd', a
, b
)),
113 (('~flrp', a
, b
, 0.0), a
),
114 (('~flrp', a
, b
, 1.0), b
),
115 (('~flrp', a
, a
, b
), a
),
116 (('~flrp', 0.0, a
, b
), ('fmul', a
, b
)),
117 (('~flrp', a
, b
, ('b2f', c
)), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
118 (('~flrp', a
, 0.0, c
), ('fadd', ('fmul', ('fneg', a
), c
), a
)),
119 (('flrp@32', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp32'),
120 (('flrp@64', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp64'),
121 (('ffract', a
), ('fsub', a
, ('ffloor', a
)), 'options->lower_ffract'),
122 (('~fadd', ('fmul', a
, ('fadd', 1.0, ('fneg', ('b2f', c
)))), ('fmul', b
, ('b2f', c
))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
123 (('~fadd@32', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
124 (('~fadd@64', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
125 (('~fadd', a
, ('fmul', ('b2f', c
), ('fadd', b
, ('fneg', a
)))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
126 (('~fadd@32', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
127 (('~fadd@64', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
128 (('ffma', a
, b
, c
), ('fadd', ('fmul', a
, b
), c
), 'options->lower_ffma'),
129 (('~fadd', ('fmul', a
, b
), c
), ('ffma', a
, b
, c
), 'options->fuse_ffma'),
131 (('fdot4', ('vec4', a
, b
, c
, 1.0), d
), ('fdph', ('vec3', a
, b
, c
), d
)),
132 (('fdot4', ('vec4', a
, 0.0, 0.0, 0.0), b
), ('fmul', a
, b
)),
133 (('fdot4', ('vec4', a
, b
, 0.0, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
134 (('fdot4', ('vec4', a
, b
, c
, 0.0), d
), ('fdot3', ('vec3', a
, b
, c
), d
)),
136 (('fdot3', ('vec3', a
, 0.0, 0.0), b
), ('fmul', a
, b
)),
137 (('fdot3', ('vec3', a
, b
, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
139 # (a * #b + #c) << #d
140 # ((a * #b) << #d) + (#c << #d)
141 # (a * (#b << #d)) + (#c << #d)
142 (('ishl', ('iadd', ('imul', a
, '#b'), '#c'), '#d'),
143 ('iadd', ('imul', a
, ('ishl', b
, d
)), ('ishl', c
, d
))),
147 (('ishl', ('imul', a
, '#b'), '#c'), ('imul', a
, ('ishl', b
, c
))),
149 # Comparison simplifications
150 (('~inot', ('flt', a
, b
)), ('fge', a
, b
)),
151 (('~inot', ('fge', a
, b
)), ('flt', a
, b
)),
152 (('~inot', ('feq', a
, b
)), ('fne', a
, b
)),
153 (('~inot', ('fne', a
, b
)), ('feq', a
, b
)),
154 (('inot', ('ilt', a
, b
)), ('ige', a
, b
)),
155 (('inot', ('ult', a
, b
)), ('uge', a
, b
)),
156 (('inot', ('ige', a
, b
)), ('ilt', a
, b
)),
157 (('inot', ('uge', a
, b
)), ('ult', a
, b
)),
158 (('inot', ('ieq', a
, b
)), ('ine', a
, b
)),
159 (('inot', ('ine', a
, b
)), ('ieq', a
, b
)),
163 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
165 (('fge', 0.0, ('b2f', a
)), ('inot', a
)),
167 (('fge', ('fneg', ('b2f', a
)), 0.0), ('inot', a
)),
169 (('fne', ('fadd', ('b2f', a
), ('b2f', b
)), 0.0), ('ior', a
, b
)),
170 (('fne', ('fmax', ('b2f', a
), ('b2f', b
)), 0.0), ('ior', a
, b
)),
171 (('fne', ('bcsel', a
, 1.0, ('b2f', b
)) , 0.0), ('ior', a
, b
)),
172 (('fne', ('b2f', a
), ('fneg', ('b2f', b
))), ('ior', a
, b
)),
173 (('fne', ('fmul', ('b2f', a
), ('b2f', b
)), 0.0), ('iand', a
, b
)),
174 (('fne', ('fmin', ('b2f', a
), ('b2f', b
)), 0.0), ('iand', a
, b
)),
175 (('fne', ('bcsel', a
, ('b2f', b
), 0.0) , 0.0), ('iand', a
, b
)),
176 (('fne', ('fadd', ('b2f', a
), ('fneg', ('b2f', b
))), 0.0), ('ixor', a
, b
)),
177 (('fne', ('b2f', a
) , ('b2f', b
) ), ('ixor', a
, b
)),
178 (('fne', ('fneg', ('b2f', a
)), ('fneg', ('b2f', b
))), ('ixor', a
, b
)),
179 (('feq', ('fadd', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('ior', a
, b
))),
180 (('feq', ('fmax', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('ior', a
, b
))),
181 (('feq', ('bcsel', a
, 1.0, ('b2f', b
)) , 0.0), ('inot', ('ior', a
, b
))),
182 (('feq', ('b2f', a
), ('fneg', ('b2f', b
))), ('inot', ('ior', a
, b
))),
183 (('feq', ('fmul', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('iand', a
, b
))),
184 (('feq', ('fmin', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('iand', a
, b
))),
185 (('feq', ('bcsel', a
, ('b2f', b
), 0.0) , 0.0), ('inot', ('iand', a
, b
))),
186 (('feq', ('fadd', ('b2f', a
), ('fneg', ('b2f', b
))), 0.0), ('ieq', a
, b
)),
187 (('feq', ('b2f', a
) , ('b2f', b
) ), ('ieq', a
, b
)),
188 (('feq', ('fneg', ('b2f', a
)), ('fneg', ('b2f', b
))), ('ieq', a
, b
)),
190 # -(b2f(a) + b2f(b)) < 0
191 # 0 < b2f(a) + b2f(b)
192 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
194 (('flt', ('fneg', ('fadd', ('b2f', a
), ('b2f', b
))), 0.0), ('ior', a
, b
)),
195 (('flt', 0.0, ('fadd', ('b2f', a
), ('b2f', b
))), ('ior', a
, b
)),
197 # -(b2f(a) + b2f(b)) >= 0
198 # 0 >= b2f(a) + b2f(b)
199 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
201 (('fge', ('fneg', ('fadd', ('b2f', a
), ('b2f', b
))), 0.0), ('inot', ('ior', a
, b
))),
202 (('fge', 0.0, ('fadd', ('b2f', a
), ('b2f', b
))), ('inot', ('ior', a
, b
))),
204 # Some optimizations (below) convert things like (a < b || c < b) into
205 # (min(a, c) < b). However, this interfers with the previous optimizations
206 # that try to remove comparisons with negated sums of b2f. This just
208 (('flt', ('fmin', c
, ('fneg', ('fadd', ('b2f', a
), ('b2f', b
)))), 0.0),
209 ('ior', ('flt', c
, 0.0), ('ior', a
, b
))),
211 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
212 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
213 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
214 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
216 # Cannot remove the addition from ilt or ige due to overflow.
217 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
218 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
220 # fmin(-b2f(a), b) >= 0.0
221 # -b2f(a) >= 0.0 && b >= 0.0
222 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
223 # b2f(a) == 0.0 && b >= 0.0
224 # a == False && b >= 0.0
227 # The fge in the second replacement is not a typo. I leave the proof that
228 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
230 (('fge', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
231 (('feq', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
233 (('feq', ('b2f', a
), 0.0), ('inot', a
)),
234 (('fne', ('b2f', a
), 0.0), a
),
235 (('ieq', ('b2i', a
), 0), ('inot', a
)),
236 (('ine', ('b2i', a
), 0), a
),
238 (('fne', ('u2f32', a
), 0.0), ('ine', a
, 0)),
239 (('feq', ('u2f32', a
), 0.0), ('ieq', a
, 0)),
240 (('fge', ('u2f32', a
), 0.0), True),
241 (('fge', 0.0, ('u2f32', a
)), ('uge', 0, a
)), # ieq instead?
242 (('flt', ('u2f32', a
), 0.0), False),
243 (('flt', 0.0, ('u2f32', a
)), ('ult', 0, a
)), # ine instead?
244 (('fne', ('i2f32', a
), 0.0), ('ine', a
, 0)),
245 (('feq', ('i2f32', a
), 0.0), ('ieq', a
, 0)),
246 (('fge', ('i2f32', a
), 0.0), ('ige', a
, 0)),
247 (('fge', 0.0, ('i2f32', a
)), ('ige', 0, a
)),
248 (('flt', ('i2f32', a
), 0.0), ('ilt', a
, 0)),
249 (('flt', 0.0, ('i2f32', a
)), ('ilt', 0, a
)),
253 # fabs(a) != 0.0 because fabs(a) must be >= 0
255 (('~flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
259 (('~flt', ('fneg', ('fabs', a
)), 0.0), ('fne', a
, 0.0)),
262 # 0.0 == fabs(a) because fabs(a) must be >= 0
264 (('fge', 0.0, ('fabs', a
)), ('feq', a
, 0.0)),
268 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
270 (('fmax', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('ior', a
, b
))),
271 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('ior', a
, b
)))),
272 (('fmin', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
273 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('iand', a
, b
)))),
276 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
277 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
278 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
280 # Since b is a constant, constant folding will eliminate the fmin and the
281 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
282 (('fmin', ('b2f', a
), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
284 (('flt', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
286 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
287 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
288 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
289 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
290 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
291 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
292 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
293 (('bcsel', a
, b
, ('bcsel', a
, c
, d
)), ('bcsel', a
, b
, d
)),
294 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
295 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
296 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
297 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
298 (('bcsel', a
, True, 'b@bool'), ('ior', a
, b
)),
305 (('fmax', ('fmax', a
, b
), b
), ('fmax', a
, b
)),
306 (('umax', ('umax', a
, b
), b
), ('umax', a
, b
)),
307 (('imax', ('imax', a
, b
), b
), ('imax', a
, b
)),
308 (('fmin', ('fmin', a
, b
), b
), ('fmin', a
, b
)),
309 (('umin', ('umin', a
, b
), b
), ('umin', a
, b
)),
310 (('imin', ('imin', a
, b
), b
), ('imin', a
, b
)),
311 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
312 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
313 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
314 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
315 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
316 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
317 (('fmin', a
, ('fabs', a
)), a
),
318 (('imin', a
, ('iabs', a
)), a
),
319 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
320 (('imax', a
, ('ineg', ('iabs', a
))), a
),
321 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
322 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
323 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
324 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
325 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
326 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
327 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
328 (('fsat', ('fsat', a
)), ('fsat', a
)),
329 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
330 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
331 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
332 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
333 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
334 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
335 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
336 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
337 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
338 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
339 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
340 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
341 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
342 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
343 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
344 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
345 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
346 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
347 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
348 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
349 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
350 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
352 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
353 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
354 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
355 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
356 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
357 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
358 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
359 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
360 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
361 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
362 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
363 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
364 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
365 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
366 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
367 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
369 (('ior', 'a@bool', ('ieq', a
, False)), True),
370 (('ior', 'a@bool', ('inot', a
)), True),
372 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0)),
374 # These patterns can result when (a < b || a < c) => (a < min(b, c))
375 # transformations occur before constant propagation and loop-unrolling.
376 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
377 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
378 (('~fge', a
, ('fmin', b
, a
)), True),
379 (('~fge', ('fmax', a
, b
), a
), True),
380 (('~flt', a
, ('fmin', b
, a
)), False),
381 (('~flt', ('fmax', a
, b
), a
), False),
382 (('~fge', a
, ('fmax', b
, a
)), ('fge', a
, b
)),
383 (('~fge', ('fmin', a
, b
), a
), ('fge', b
, a
)),
385 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
386 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
387 (('ige', a
, ('imin', b
, a
)), True),
388 (('ige', ('imax', a
, b
), a
), True),
389 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
390 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
391 (('uge', a
, ('umin', b
, a
)), True),
392 (('uge', ('umax', a
, b
), a
), True),
393 (('ilt', a
, ('imin', b
, a
)), False),
394 (('ilt', ('imax', a
, b
), a
), False),
395 (('ige', a
, ('imax', b
, a
)), ('ige', a
, b
)),
396 (('ige', ('imin', a
, b
), a
), ('ige', b
, a
)),
397 (('ult', a
, ('umin', b
, a
)), False),
398 (('ult', ('umax', a
, b
), a
), False),
399 (('uge', a
, ('umax', b
, a
)), ('uge', a
, b
)),
400 (('uge', ('umin', a
, b
), a
), ('uge', b
, a
)),
402 (('ilt', '#a', ('imax', '#b', c
)), ('ior', ('ilt', a
, b
), ('ilt', a
, c
))),
403 (('ilt', ('imin', '#a', b
), '#c'), ('ior', ('ilt', a
, c
), ('ilt', b
, c
))),
404 (('ige', '#a', ('imin', '#b', c
)), ('ior', ('ige', a
, b
), ('ige', a
, c
))),
405 (('ige', ('imax', '#a', b
), '#c'), ('ior', ('ige', a
, c
), ('ige', b
, c
))),
406 (('ult', '#a', ('umax', '#b', c
)), ('ior', ('ult', a
, b
), ('ult', a
, c
))),
407 (('ult', ('umin', '#a', b
), '#c'), ('ior', ('ult', a
, c
), ('ult', b
, c
))),
408 (('uge', '#a', ('umin', '#b', c
)), ('ior', ('uge', a
, b
), ('uge', a
, c
))),
409 (('uge', ('umax', '#a', b
), '#c'), ('ior', ('uge', a
, c
), ('uge', b
, c
))),
410 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
411 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
412 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
413 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
414 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
415 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
416 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
417 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
419 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
420 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
421 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
422 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
423 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
424 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
425 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
426 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
427 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
428 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
430 (('imul', ('b2i', a
), ('b2i', b
)), ('b2i', ('iand', a
, b
))),
431 (('fmul', ('b2f', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
432 (('fsat', ('fadd', ('b2f', a
), ('b2f', b
))), ('b2f', ('ior', a
, b
))),
433 (('iand', 'a@bool', 1.0), ('b2f', a
), '!options->lower_b2f'),
434 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
435 (('ineg', ('b2i@32', a
)), a
),
436 (('flt', ('fneg', ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
437 (('flt', ('fsub', 0.0, ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
438 # Comparison with the same args. Note that these are not done for
439 # the float versions because NaN always returns false on float
441 (('ilt', a
, a
), False),
442 (('ige', a
, a
), True),
443 (('ieq', a
, a
), True),
444 (('ine', a
, a
), False),
445 (('ult', a
, a
), False),
446 (('uge', a
, a
), True),
447 # Logical and bit operations
448 (('fand', a
, 0.0), 0.0),
450 (('iand', a
, ~
0), a
),
454 (('ior', a
, True), True),
455 (('fxor', a
, a
), 0.0),
458 (('inot', ('inot', a
)), a
),
459 (('ior', ('iand', a
, b
), b
), b
),
460 (('ior', ('ior', a
, b
), b
), ('ior', a
, b
)),
461 (('iand', ('ior', a
, b
), b
), b
),
462 (('iand', ('iand', a
, b
), b
), ('iand', a
, b
)),
464 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
465 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
466 # Shift optimizations
473 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
474 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
475 # Exponential/logarithmic identities
476 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
477 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
478 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
479 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
480 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
481 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
482 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
483 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
484 (('~fpow', a
, 1.0), a
),
485 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
486 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
487 (('~fpow', 2.0, a
), ('fexp2', a
)),
488 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
489 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
490 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
491 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
492 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
493 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
494 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
495 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
496 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
497 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
498 # Division and reciprocal
499 (('~fdiv', 1.0, a
), ('frcp', a
)),
500 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
501 (('~frcp', ('frcp', a
)), a
),
502 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
503 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
504 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
505 # Boolean simplifications
506 (('ieq', 'a@bool', True), a
),
507 (('ine(is_not_used_by_if)', 'a@bool', True), ('inot', a
)),
508 (('ine', 'a@bool', False), a
),
509 (('ieq(is_not_used_by_if)', 'a@bool', False), ('inot', 'a')),
510 (('bcsel', a
, True, False), a
),
511 (('bcsel', a
, False, True), ('inot', a
)),
512 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
513 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
514 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
515 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
516 (('bcsel', True, b
, c
), b
),
517 (('bcsel', False, b
, c
), c
),
518 (('bcsel', a
, ('b2f(is_used_once)', b
), ('b2f', c
)), ('b2f', ('bcsel', a
, b
, c
))),
519 # The result of this should be hit by constant propagation and, in the
520 # next round of opt_algebraic, get picked up by one of the above two.
521 (('bcsel', '#a', b
, c
), ('bcsel', ('ine', 'a', 0), b
, c
)),
523 (('bcsel', a
, b
, b
), b
),
524 (('fcsel', a
, b
, b
), b
),
527 (('i2b', ('b2i', a
)), a
),
528 (('i2b', 'a@bool'), a
),
529 (('f2i32', ('ftrunc', a
)), ('f2i32', a
)),
530 (('f2u32', ('ftrunc', a
)), ('f2u32', a
)),
531 (('i2b', ('ineg', a
)), ('i2b', a
)),
532 (('i2b', ('iabs', a
)), ('i2b', a
)),
533 (('fabs', ('b2f', a
)), ('b2f', a
)),
534 (('iabs', ('b2i', a
)), ('b2i', a
)),
535 (('inot', ('f2b', a
)), ('feq', a
, 0.0)),
537 # Ironically, mark these as imprecise because removing the conversions may
538 # preserve more precision than doing the conversions (e.g.,
539 # uint(float(0x81818181u)) == 0x81818200).
540 (('~f2i32', ('i2f32', 'a@32')), a
),
541 (('~f2i32', ('u2f32', 'a@32')), a
),
542 (('~f2u32', ('i2f32', 'a@32')), a
),
543 (('~f2u32', ('u2f32', 'a@32')), a
),
545 # Packing and then unpacking does nothing
546 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
547 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
548 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
549 ('unpack_64_2x32_split_y', a
)), a
),
552 (('ushr', ('ishl', 'a@32', 24), 24), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
553 (('ushr', ('ishl', 'a@32', 16), 24), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
554 (('ushr', ('ishl', 'a@32', 8), 24), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
555 (('ushr', 'a@32', 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
556 (('ishr', ('ishl', 'a@32', 24), 24), ('extract_i8', a
, 0), '!options->lower_extract_byte'),
557 (('ishr', ('ishl', 'a@32', 16), 24), ('extract_i8', a
, 1), '!options->lower_extract_byte'),
558 (('ishr', ('ishl', 'a@32', 8), 24), ('extract_i8', a
, 2), '!options->lower_extract_byte'),
559 (('ishr', 'a@32', 24), ('extract_i8', a
, 3), '!options->lower_extract_byte'),
560 (('iand', 0xff, ('ushr', a
, 16)), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
561 (('iand', 0xff, ('ushr', a
, 8)), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
562 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
565 (('ushr', ('ishl', 'a@32', 16), 16), ('extract_u16', a
, 0), '!options->lower_extract_word'),
566 (('ushr', 'a@32', 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
567 (('ishr', ('ishl', 'a@32', 16), 16), ('extract_i16', a
, 0), '!options->lower_extract_word'),
568 (('ishr', 'a@32', 16), ('extract_i16', a
, 1), '!options->lower_extract_word'),
569 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
572 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
573 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
574 (('ussub_4x8', a
, 0), a
),
575 (('ussub_4x8', a
, ~
0), 0),
576 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
577 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
578 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
579 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
580 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
581 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
582 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
583 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
585 # Propagate negation up multiplication chains
586 (('fmul', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
587 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
589 # Propagate constants up multiplication chains
590 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
591 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
592 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
593 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
595 # Reassociate constants in add/mul chains so they can be folded together.
596 # For now, we mostly only handle cases where the constants are separated by
597 # a single non-constant. We could do better eventually.
598 (('~fmul', '#a', ('fmul', b
, '#c')), ('fmul', ('fmul', a
, c
), b
)),
599 (('imul', '#a', ('imul', b
, '#c')), ('imul', ('imul', a
, c
), b
)),
600 (('~fadd', '#a', ('fadd', b
, '#c')), ('fadd', ('fadd', a
, c
), b
)),
601 (('~fadd', '#a', ('fneg', ('fadd', b
, '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
602 (('iadd', '#a', ('iadd', b
, '#c')), ('iadd', ('iadd', a
, c
), b
)),
605 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
606 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
607 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
609 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
610 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
611 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
613 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
616 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
617 (('fmod@64', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod64'),
618 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
619 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
620 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
622 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
623 ('bcsel', ('ilt', 31, 'bits'), 'insert',
624 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
625 'options->lower_bitfield_insert'),
627 # Alternative lowering that doesn't rely on bfi.
628 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
629 ('bcsel', ('ilt', 31, 'bits'),
632 ('iand', 'base', ('inot', ('bfm', 'bits', 'offset'))),
633 ('iand', ('ishl', 'insert', 'offset'), ('bfm', 'bits', 'offset')))),
634 'options->lower_bitfield_insert_to_shifts'),
636 # bfm lowering -- note that the NIR opcode is undefined if either arg is 32.
637 (('bfm', 'bits', 'offset'),
638 ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'),
639 'options->lower_bfm'),
641 (('ibitfield_extract', 'value', 'offset', 'bits'),
642 ('bcsel', ('ilt', 31, 'bits'), 'value',
643 ('ibfe', 'value', 'offset', 'bits')),
644 'options->lower_bitfield_extract'),
646 (('ubitfield_extract', 'value', 'offset', 'bits'),
647 ('bcsel', ('ult', 31, 'bits'), 'value',
648 ('ubfe', 'value', 'offset', 'bits')),
649 'options->lower_bitfield_extract'),
651 (('ibitfield_extract', 'value', 'offset', 'bits'),
652 ('bcsel', ('ieq', 0, 'bits'),
655 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
656 ('isub', 32, 'bits'))),
657 'options->lower_bitfield_extract_to_shifts'),
659 (('ubitfield_extract', 'value', 'offset', 'bits'),
661 ('ushr', 'value', 'offset'),
662 ('bcsel', ('ieq', 'bits', 32),
664 ('bfm', 'bits', 0))),
665 'options->lower_bitfield_extract_to_shifts'),
667 (('ifind_msb', 'value'),
668 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
669 'options->lower_ifind_msb'),
671 (('find_lsb', 'value'),
672 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
673 'options->lower_find_lsb'),
675 (('extract_i8', a
, 'b@32'),
676 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
677 'options->lower_extract_byte'),
679 (('extract_u8', a
, 'b@32'),
680 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
681 'options->lower_extract_byte'),
683 (('extract_i16', a
, 'b@32'),
684 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
685 'options->lower_extract_word'),
687 (('extract_u16', a
, 'b@32'),
688 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
689 'options->lower_extract_word'),
691 (('pack_unorm_2x16', 'v'),
692 ('pack_uvec2_to_uint',
693 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
694 'options->lower_pack_unorm_2x16'),
696 (('pack_unorm_4x8', 'v'),
697 ('pack_uvec4_to_uint',
698 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
699 'options->lower_pack_unorm_4x8'),
701 (('pack_snorm_2x16', 'v'),
702 ('pack_uvec2_to_uint',
703 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
704 'options->lower_pack_snorm_2x16'),
706 (('pack_snorm_4x8', 'v'),
707 ('pack_uvec4_to_uint',
708 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
709 'options->lower_pack_snorm_4x8'),
711 (('unpack_unorm_2x16', 'v'),
712 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
713 ('extract_u16', 'v', 1))),
715 'options->lower_unpack_unorm_2x16'),
717 (('unpack_unorm_4x8', 'v'),
718 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
719 ('extract_u8', 'v', 1),
720 ('extract_u8', 'v', 2),
721 ('extract_u8', 'v', 3))),
723 'options->lower_unpack_unorm_4x8'),
725 (('unpack_snorm_2x16', 'v'),
726 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec2', ('extract_i16', 'v', 0),
727 ('extract_i16', 'v', 1))),
729 'options->lower_unpack_snorm_2x16'),
731 (('unpack_snorm_4x8', 'v'),
732 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec4', ('extract_i8', 'v', 0),
733 ('extract_i8', 'v', 1),
734 ('extract_i8', 'v', 2),
735 ('extract_i8', 'v', 3))),
737 'options->lower_unpack_snorm_4x8'),
740 invert
= OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
742 for left
, right
in itertools
.combinations_with_replacement(invert
.keys(), 2):
743 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
744 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
745 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
746 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
748 def fexp2i(exp
, bits
):
749 # We assume that exp is already in the right range.
751 return ('ishl', ('iadd', exp
, 127), 23)
753 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
757 def ldexp(f
, exp
, bits
):
758 # First, we clamp exp to a reasonable range. The maximum possible range
759 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
760 # a maximum range of [-149, 127]. This means that we can potentially have
761 # a swing of +-276. If you start with FLT_MAX, you actually have to do
762 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
763 # spec, on the other hand, only requires that we handle an exponent value
764 # in the range [-126, 128]. This implementation is *mostly* correct; it
765 # handles a range on exp of [-252, 254] which allows you to create any
766 # value (including denorms if the hardware supports it) and to adjust the
767 # exponent of any normal value to anything you want.
769 exp
= ('imin', ('imax', exp
, -252), 254)
771 exp
= ('imin', ('imax', exp
, -2044), 2046)
775 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
776 # (We use ishr which isn't the same for -1, but the -1 case still works
777 # since we use exp-exp/2 as the second exponent.) While the spec
778 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
779 # work with denormals and doesn't allow for the full swing in exponents
780 # that you can get with normalized values. Instead, we create two powers
781 # of two and multiply by them each in turn. That way the effective range
782 # of our exponent is doubled.
783 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
784 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
785 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
788 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
789 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
792 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
793 def bitfield_reverse(u
):
794 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
795 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
796 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
797 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
798 step5
= ('ior', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
802 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
804 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
805 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
806 # and, if a is a NaN then the second comparison will fail anyway.
807 for op
in ['flt', 'fge', 'feq']:
809 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
810 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
813 # Add optimizations to handle the case where the result of a ternary is
814 # compared to a constant. This way we can take things like
820 # a ? (0 > 0) : (1 > 0)
822 # which constant folding will eat for lunch. The resulting ternary will
823 # further get cleaned up by the boolean reductions above and we will be
824 # left with just the original variable "a".
825 for op
in ['flt', 'fge', 'feq', 'fne',
826 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
828 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
829 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
830 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
831 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
835 # For example, this converts things like
837 # 1 + mix(0, a - 1, condition)
841 # mix(1, (a-1)+1, condition)
843 # Other optimizations will rearrange the constants.
844 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
846 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
849 # This section contains "late" optimizations that should be run before
850 # creating ffmas and calling regular optimizations for the final time.
851 # Optimizations should go here if they help code generation and conflict
852 # with the regular optimizations.
853 before_ffma_optimizations
= [
854 # Propagate constants down multiplication chains
855 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
856 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
857 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
858 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
860 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
861 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
862 (('~fadd', ('fneg', a
), a
), 0.0),
863 (('iadd', ('ineg', a
), a
), 0),
864 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
865 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
866 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
867 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
870 # This section contains "late" optimizations that should be run after the
871 # regular optimizations have finished. Optimizations should go here if
872 # they help code generation but do not necessarily produce code that is
873 # more easily optimizable.
874 late_optimizations
= [
875 # Most of these optimizations aren't quite safe when you get infinity or
876 # Nan involved but the first one should be fine.
877 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
878 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
879 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
880 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
881 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
882 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
884 (('~fge', ('fmin(is_used_once)', ('fadd(is_used_once)', a
, b
), ('fadd', c
, d
)), 0.0), ('iand', ('fge', a
, ('fneg', b
)), ('fge', c
, ('fneg', d
)))),
886 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
887 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
888 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
889 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
891 (('b2f(is_used_more_than_once)', ('inot', a
)), ('bcsel', a
, 0.0, 1.0)),
892 (('fneg(is_used_more_than_once)', ('b2f', ('inot', a
))), ('bcsel', a
, -0.0, -1.0)),
894 # we do these late so that we don't get in the way of creating ffmas
895 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
896 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
898 # Lowered for backends without a dedicated b2f instruction
899 (('b2f@32', a
), ('iand', a
, 1.0), 'options->lower_b2f'),
902 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render())
903 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
904 before_ffma_optimizations
).render())
905 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
906 late_optimizations
).render())
projects / mesa.git / blob