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 (('feq', ('fadd', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('ior', a
, b
))),
177 (('feq', ('fmax', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('ior', a
, b
))),
178 (('feq', ('bcsel', a
, 1.0, ('b2f', b
)) , 0.0), ('inot', ('ior', a
, b
))),
179 (('feq', ('b2f', a
), ('fneg', ('b2f', b
))), ('inot', ('ior', a
, b
))),
180 (('feq', ('fmul', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('iand', a
, b
))),
181 (('feq', ('fmin', ('b2f', a
), ('b2f', b
)), 0.0), ('inot', ('iand', a
, b
))),
182 (('feq', ('bcsel', a
, ('b2f', b
), 0.0) , 0.0), ('inot', ('iand', a
, b
))),
184 # -(b2f(a) + b2f(b)) < 0
185 # 0 < b2f(a) + b2f(b)
186 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
188 (('flt', ('fneg', ('fadd', ('b2f', a
), ('b2f', b
))), 0.0), ('ior', a
, b
)),
189 (('flt', 0.0, ('fadd', ('b2f', a
), ('b2f', b
))), ('ior', a
, b
)),
191 # -(b2f(a) + b2f(b)) >= 0
192 # 0 >= b2f(a) + b2f(b)
193 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
195 (('fge', ('fneg', ('fadd', ('b2f', a
), ('b2f', b
))), 0.0), ('inot', ('ior', a
, b
))),
196 (('fge', 0.0, ('fadd', ('b2f', a
), ('b2f', b
))), ('inot', ('ior', a
, b
))),
198 # Some optimizations (below) convert things like (a < b || c < b) into
199 # (min(a, c) < b). However, this interfers with the previous optimizations
200 # that try to remove comparisons with negated sums of b2f. This just
202 (('flt', ('fmin', c
, ('fneg', ('fadd', ('b2f', a
), ('b2f', b
)))), 0.0),
203 ('ior', ('flt', c
, 0.0), ('ior', a
, b
))),
205 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
206 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
207 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
208 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
210 # Cannot remove the addition from ilt or ige due to overflow.
211 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
212 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
214 # fmin(-b2f(a), b) >= 0.0
215 # -b2f(a) >= 0.0 && b >= 0.0
216 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
217 # b2f(a) == 0.0 && b >= 0.0
218 # a == False && b >= 0.0
221 # The fge in the second replacement is not a typo. I leave the proof that
222 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
224 (('fge', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
225 (('feq', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
227 (('feq', ('b2f', a
), 0.0), ('inot', a
)),
228 (('fne', ('b2f', a
), 0.0), a
),
229 (('ieq', ('b2i', a
), 0), ('inot', a
)),
230 (('ine', ('b2i', a
), 0), a
),
232 (('fne', ('u2f32', a
), 0.0), ('ine', a
, 0)),
233 (('feq', ('u2f32', a
), 0.0), ('ieq', a
, 0)),
234 (('fge', ('u2f32', a
), 0.0), True),
235 (('fge', 0.0, ('u2f32', a
)), ('uge', 0, a
)), # ieq instead?
236 (('flt', ('u2f32', a
), 0.0), False),
237 (('flt', 0.0, ('u2f32', a
)), ('ult', 0, a
)), # ine instead?
238 (('fne', ('i2f32', a
), 0.0), ('ine', a
, 0)),
239 (('feq', ('i2f32', a
), 0.0), ('ieq', a
, 0)),
240 (('fge', ('i2f32', a
), 0.0), ('ige', a
, 0)),
241 (('fge', 0.0, ('i2f32', a
)), ('ige', 0, a
)),
242 (('flt', ('i2f32', a
), 0.0), ('ilt', a
, 0)),
243 (('flt', 0.0, ('i2f32', a
)), ('ilt', 0, a
)),
247 # fabs(a) != 0.0 because fabs(a) must be >= 0
249 (('~flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
253 (('~flt', ('fneg', ('fabs', a
)), 0.0), ('fne', a
, 0.0)),
256 # 0.0 == fabs(a) because fabs(a) must be >= 0
258 (('fge', 0.0, ('fabs', a
)), ('feq', a
, 0.0)),
262 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
264 (('fmax', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('ior', a
, b
))),
265 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('ior', a
, b
)))),
266 (('fmin', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
267 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('iand', a
, b
)))),
270 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
271 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
272 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
274 # Since b is a constant, constant folding will eliminate the fmin and the
275 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
276 (('fmin', ('b2f', a
), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
278 (('flt', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
280 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
281 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
282 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
283 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
284 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
285 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
286 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
287 (('bcsel', a
, b
, ('bcsel', a
, c
, d
)), ('bcsel', a
, b
, d
)),
288 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
289 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
290 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
291 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
292 (('bcsel', a
, True, 'b@bool'), ('ior', a
, b
)),
299 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
300 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
301 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
302 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
303 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
304 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
305 (('fmin', a
, ('fabs', a
)), a
),
306 (('imin', a
, ('iabs', a
)), a
),
307 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
308 (('imax', a
, ('ineg', ('iabs', a
))), a
),
309 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
310 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
311 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
312 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
313 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
314 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
315 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
316 (('fsat', ('fsat', a
)), ('fsat', a
)),
317 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
318 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
319 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
320 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
321 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
322 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
323 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
324 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
325 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
326 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
327 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
328 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
329 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
330 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
331 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
332 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
333 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
334 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
335 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
336 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
337 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
338 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
340 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
341 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
342 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
343 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
344 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
345 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
346 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
347 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
348 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
349 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
350 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
351 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
352 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
353 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
354 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
355 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
357 (('ior', 'a@bool', ('ieq', a
, False)), True),
358 (('ior', 'a@bool', ('inot', a
)), True),
360 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0)),
362 # These patterns can result when (a < b || a < c) => (a < min(b, c))
363 # transformations occur before constant propagation and loop-unrolling.
364 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
365 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
366 (('~fge', a
, ('fmin', b
, a
)), True),
367 (('~fge', ('fmax', a
, b
), a
), True),
368 (('~flt', a
, ('fmin', b
, a
)), False),
369 (('~flt', ('fmax', a
, b
), a
), False),
370 (('~fge', a
, ('fmax', b
, a
)), ('fge', a
, b
)),
371 (('~fge', ('fmin', a
, b
), a
), ('fge', b
, a
)),
373 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
374 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
375 (('ige', a
, ('imin', b
, a
)), True),
376 (('ige', ('imax', a
, b
), a
), True),
377 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
378 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
379 (('uge', a
, ('umin', b
, a
)), True),
380 (('uge', ('umax', a
, b
), a
), True),
381 (('ilt', a
, ('imin', b
, a
)), False),
382 (('ilt', ('imax', a
, b
), a
), False),
383 (('ige', a
, ('imax', b
, a
)), ('ige', a
, b
)),
384 (('ige', ('imin', a
, b
), a
), ('ige', b
, a
)),
385 (('ult', a
, ('umin', b
, a
)), False),
386 (('ult', ('umax', a
, b
), a
), False),
387 (('uge', a
, ('umax', b
, a
)), ('uge', a
, b
)),
388 (('uge', ('umin', a
, b
), a
), ('uge', b
, a
)),
390 (('ilt', '#a', ('imax', '#b', c
)), ('ior', ('ilt', a
, b
), ('ilt', a
, c
))),
391 (('ilt', ('imin', '#a', b
), '#c'), ('ior', ('ilt', a
, c
), ('ilt', b
, c
))),
392 (('ige', '#a', ('imin', '#b', c
)), ('ior', ('ige', a
, b
), ('ige', a
, c
))),
393 (('ige', ('imax', '#a', b
), '#c'), ('ior', ('ige', a
, c
), ('ige', b
, c
))),
394 (('ult', '#a', ('umax', '#b', c
)), ('ior', ('ult', a
, b
), ('ult', a
, c
))),
395 (('ult', ('umin', '#a', b
), '#c'), ('ior', ('ult', a
, c
), ('ult', b
, c
))),
396 (('uge', '#a', ('umin', '#b', c
)), ('ior', ('uge', a
, b
), ('uge', a
, c
))),
397 (('uge', ('umax', '#a', b
), '#c'), ('ior', ('uge', a
, c
), ('uge', b
, c
))),
398 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
399 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
400 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
401 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
402 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
403 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
404 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
405 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
407 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
408 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
409 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
410 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
411 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
412 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
413 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
414 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
415 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
416 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
418 (('imul', ('b2i', a
), ('b2i', b
)), ('b2i', ('iand', a
, b
))),
419 (('fmul', ('b2f', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
420 (('fsat', ('fadd', ('b2f', a
), ('b2f', b
))), ('b2f', ('ior', a
, b
))),
421 (('iand', 'a@bool', 1.0), ('b2f', a
), '!options->lower_b2f'),
422 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
423 (('ineg', ('b2i@32', a
)), a
),
424 (('flt', ('fneg', ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
425 (('flt', ('fsub', 0.0, ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
426 # Comparison with the same args. Note that these are not done for
427 # the float versions because NaN always returns false on float
429 (('ilt', a
, a
), False),
430 (('ige', a
, a
), True),
431 (('ieq', a
, a
), True),
432 (('ine', a
, a
), False),
433 (('ult', a
, a
), False),
434 (('uge', a
, a
), True),
435 # Logical and bit operations
436 (('fand', a
, 0.0), 0.0),
438 (('iand', a
, ~
0), a
),
442 (('ior', a
, True), True),
443 (('fxor', a
, a
), 0.0),
446 (('inot', ('inot', a
)), a
),
447 (('ior', ('iand', a
, b
), b
), b
),
448 (('ior', ('ior', a
, b
), b
), ('ior', a
, b
)),
449 (('iand', ('ior', a
, b
), b
), b
),
450 (('iand', ('iand', a
, b
), b
), ('iand', a
, b
)),
452 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
453 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
454 # Shift optimizations
461 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
462 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
463 # Exponential/logarithmic identities
464 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
465 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
466 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
467 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
468 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
469 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
470 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
471 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
472 (('~fpow', a
, 1.0), a
),
473 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
474 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
475 (('~fpow', 2.0, a
), ('fexp2', a
)),
476 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
477 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
478 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
479 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
480 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
481 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
482 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
483 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
484 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
485 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
486 # Division and reciprocal
487 (('~fdiv', 1.0, a
), ('frcp', a
)),
488 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
489 (('~frcp', ('frcp', a
)), a
),
490 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
491 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
492 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
493 # Boolean simplifications
494 (('ieq', 'a@bool', True), a
),
495 (('ine(is_not_used_by_if)', 'a@bool', True), ('inot', a
)),
496 (('ine', 'a@bool', False), a
),
497 (('ieq(is_not_used_by_if)', 'a@bool', False), ('inot', 'a')),
498 (('bcsel', a
, True, False), a
),
499 (('bcsel', a
, False, True), ('inot', a
)),
500 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
501 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
502 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
503 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
504 (('bcsel', True, b
, c
), b
),
505 (('bcsel', False, b
, c
), c
),
506 (('bcsel', a
, ('b2f(is_used_once)', b
), ('b2f', c
)), ('b2f', ('bcsel', a
, b
, c
))),
507 # The result of this should be hit by constant propagation and, in the
508 # next round of opt_algebraic, get picked up by one of the above two.
509 (('bcsel', '#a', b
, c
), ('bcsel', ('ine', 'a', 0), b
, c
)),
511 (('bcsel', a
, b
, b
), b
),
512 (('fcsel', a
, b
, b
), b
),
515 (('i2b', ('b2i', a
)), a
),
516 (('i2b', 'a@bool'), a
),
517 (('f2i32', ('ftrunc', a
)), ('f2i32', a
)),
518 (('f2u32', ('ftrunc', a
)), ('f2u32', a
)),
519 (('i2b', ('ineg', a
)), ('i2b', a
)),
520 (('i2b', ('iabs', a
)), ('i2b', a
)),
521 (('fabs', ('b2f', a
)), ('b2f', a
)),
522 (('iabs', ('b2i', a
)), ('b2i', a
)),
523 (('inot', ('f2b', a
)), ('feq', a
, 0.0)),
525 # Ironically, mark these as imprecise because removing the conversions may
526 # preserve more precision than doing the conversions (e.g.,
527 # uint(float(0x81818181u)) == 0x81818200).
528 (('~f2i32', ('i2f32', 'a@32')), a
),
529 (('~f2i32', ('u2f32', 'a@32')), a
),
530 (('~f2u32', ('i2f32', 'a@32')), a
),
531 (('~f2u32', ('u2f32', 'a@32')), a
),
533 # Packing and then unpacking does nothing
534 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
535 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
536 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
537 ('unpack_64_2x32_split_y', a
)), a
),
540 (('ushr', a
, 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
541 (('iand', 0xff, ('ushr', a
, 16)), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
542 (('iand', 0xff, ('ushr', a
, 8)), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
543 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
546 (('ushr', a
, 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
547 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
550 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
551 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
552 (('ussub_4x8', a
, 0), a
),
553 (('ussub_4x8', a
, ~
0), 0),
554 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
555 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
556 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
557 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
558 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
559 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
560 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
561 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
563 # Propagate negation up multiplication chains
564 (('fmul', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
565 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
567 # Propagate constants up multiplication chains
568 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
569 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
570 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
571 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
573 # Reassociate constants in add/mul chains so they can be folded together.
574 # For now, we mostly only handle cases where the constants are separated by
575 # a single non-constant. We could do better eventually.
576 (('~fmul', '#a', ('fmul', b
, '#c')), ('fmul', ('fmul', a
, c
), b
)),
577 (('imul', '#a', ('imul', b
, '#c')), ('imul', ('imul', a
, c
), b
)),
578 (('~fadd', '#a', ('fadd', b
, '#c')), ('fadd', ('fadd', a
, c
), b
)),
579 (('~fadd', '#a', ('fneg', ('fadd', b
, '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
580 (('iadd', '#a', ('iadd', b
, '#c')), ('iadd', ('iadd', a
, c
), b
)),
583 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
584 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
585 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
587 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
588 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
589 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
591 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
594 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
595 (('fmod@64', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod64'),
596 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
597 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
598 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
600 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
601 ('bcsel', ('ilt', 31, 'bits'), 'insert',
602 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
603 'options->lower_bitfield_insert'),
605 # Alternative lowering that doesn't rely on bfi.
606 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
607 ('bcsel', ('ilt', 31, 'bits'),
610 ('iand', 'base', ('inot', ('bfm', 'bits', 'offset'))),
611 ('iand', ('ishl', 'insert', 'offset'), ('bfm', 'bits', 'offset')))),
612 'options->lower_bitfield_insert_to_shifts'),
614 # bfm lowering -- note that the NIR opcode is undefined if either arg is 32.
615 (('bfm', 'bits', 'offset'),
616 ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'),
617 'options->lower_bfm'),
619 (('ibitfield_extract', 'value', 'offset', 'bits'),
620 ('bcsel', ('ilt', 31, 'bits'), 'value',
621 ('ibfe', 'value', 'offset', 'bits')),
622 'options->lower_bitfield_extract'),
624 (('ubitfield_extract', 'value', 'offset', 'bits'),
625 ('bcsel', ('ult', 31, 'bits'), 'value',
626 ('ubfe', 'value', 'offset', 'bits')),
627 'options->lower_bitfield_extract'),
629 (('ibitfield_extract', 'value', 'offset', 'bits'),
630 ('bcsel', ('ieq', 0, 'bits'),
633 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
634 ('isub', 32, 'bits'))),
635 'options->lower_bitfield_extract_to_shifts'),
637 (('ubitfield_extract', 'value', 'offset', 'bits'),
639 ('ushr', 'value', 'offset'),
640 ('bcsel', ('ieq', 'bits', 32),
642 ('bfm', 'bits', 0))),
643 'options->lower_bitfield_extract_to_shifts'),
645 (('ifind_msb', 'value'),
646 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
647 'options->lower_ifind_msb'),
649 (('find_lsb', 'value'),
650 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
651 'options->lower_find_lsb'),
653 (('extract_i8', a
, 'b@32'),
654 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
655 'options->lower_extract_byte'),
657 (('extract_u8', a
, 'b@32'),
658 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
659 'options->lower_extract_byte'),
661 (('extract_i16', a
, 'b@32'),
662 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
663 'options->lower_extract_word'),
665 (('extract_u16', a
, 'b@32'),
666 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
667 'options->lower_extract_word'),
669 (('pack_unorm_2x16', 'v'),
670 ('pack_uvec2_to_uint',
671 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
672 'options->lower_pack_unorm_2x16'),
674 (('pack_unorm_4x8', 'v'),
675 ('pack_uvec4_to_uint',
676 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
677 'options->lower_pack_unorm_4x8'),
679 (('pack_snorm_2x16', 'v'),
680 ('pack_uvec2_to_uint',
681 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
682 'options->lower_pack_snorm_2x16'),
684 (('pack_snorm_4x8', 'v'),
685 ('pack_uvec4_to_uint',
686 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
687 'options->lower_pack_snorm_4x8'),
689 (('unpack_unorm_2x16', 'v'),
690 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
691 ('extract_u16', 'v', 1))),
693 'options->lower_unpack_unorm_2x16'),
695 (('unpack_unorm_4x8', 'v'),
696 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
697 ('extract_u8', 'v', 1),
698 ('extract_u8', 'v', 2),
699 ('extract_u8', 'v', 3))),
701 'options->lower_unpack_unorm_4x8'),
703 (('unpack_snorm_2x16', 'v'),
704 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec2', ('extract_i16', 'v', 0),
705 ('extract_i16', 'v', 1))),
707 'options->lower_unpack_snorm_2x16'),
709 (('unpack_snorm_4x8', 'v'),
710 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec4', ('extract_i8', 'v', 0),
711 ('extract_i8', 'v', 1),
712 ('extract_i8', 'v', 2),
713 ('extract_i8', 'v', 3))),
715 'options->lower_unpack_snorm_4x8'),
718 invert
= OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
720 for left
, right
in list(itertools
.combinations(invert
.keys(), 2)) + zip(invert
.keys(), invert
.keys()):
721 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
722 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
723 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
724 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
726 def fexp2i(exp
, bits
):
727 # We assume that exp is already in the right range.
729 return ('ishl', ('iadd', exp
, 127), 23)
731 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
735 def ldexp(f
, exp
, bits
):
736 # First, we clamp exp to a reasonable range. The maximum possible range
737 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
738 # a maximum range of [-149, 127]. This means that we can potentially have
739 # a swing of +-276. If you start with FLT_MAX, you actually have to do
740 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
741 # spec, on the other hand, only requires that we handle an exponent value
742 # in the range [-126, 128]. This implementation is *mostly* correct; it
743 # handles a range on exp of [-252, 254] which allows you to create any
744 # value (including denorms if the hardware supports it) and to adjust the
745 # exponent of any normal value to anything you want.
747 exp
= ('imin', ('imax', exp
, -252), 254)
749 exp
= ('imin', ('imax', exp
, -2044), 2046)
753 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
754 # (We use ishr which isn't the same for -1, but the -1 case still works
755 # since we use exp-exp/2 as the second exponent.) While the spec
756 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
757 # work with denormals and doesn't allow for the full swing in exponents
758 # that you can get with normalized values. Instead, we create two powers
759 # of two and multiply by them each in turn. That way the effective range
760 # of our exponent is doubled.
761 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
762 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
763 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
766 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
767 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
770 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
771 def bitfield_reverse(u
):
772 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
773 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
774 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
775 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
776 step5
= ('ior', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
780 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
782 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
783 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
784 # and, if a is a NaN then the second comparison will fail anyway.
785 for op
in ['flt', 'fge', 'feq']:
787 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
788 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
791 # Add optimizations to handle the case where the result of a ternary is
792 # compared to a constant. This way we can take things like
798 # a ? (0 > 0) : (1 > 0)
800 # which constant folding will eat for lunch. The resulting ternary will
801 # further get cleaned up by the boolean reductions above and we will be
802 # left with just the original variable "a".
803 for op
in ['flt', 'fge', 'feq', 'fne',
804 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
806 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
807 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
808 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
809 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
813 # For example, this converts things like
815 # 1 + mix(0, a - 1, condition)
819 # mix(1, (a-1)+1, condition)
821 # Other optimizations will rearrange the constants.
822 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
824 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
827 # This section contains "late" optimizations that should be run before
828 # creating ffmas and calling regular optimizations for the final time.
829 # Optimizations should go here if they help code generation and conflict
830 # with the regular optimizations.
831 before_ffma_optimizations
= [
832 # Propagate constants down multiplication chains
833 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
834 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
835 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
836 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
838 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
839 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
840 (('~fadd', ('fneg', a
), a
), 0.0),
841 (('iadd', ('ineg', a
), a
), 0),
842 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
843 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
844 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
845 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
848 # This section contains "late" optimizations that should be run after the
849 # regular optimizations have finished. Optimizations should go here if
850 # they help code generation but do not necessarily produce code that is
851 # more easily optimizable.
852 late_optimizations
= [
853 # Most of these optimizations aren't quite safe when you get infinity or
854 # Nan involved but the first one should be fine.
855 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
856 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
857 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
858 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
859 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
860 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
862 (('~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
)))),
864 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
865 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
866 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
867 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
869 (('b2f(is_used_more_than_once)', ('inot', a
)), ('bcsel', a
, 0.0, 1.0)),
870 (('fneg(is_used_more_than_once)', ('b2f', ('inot', a
))), ('bcsel', a
, -0.0, -1.0)),
872 # we do these late so that we don't get in the way of creating ffmas
873 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
874 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
876 # Lowered for backends without a dedicated b2f instruction
877 (('b2f@32', a
), ('iand', a
, 1.0), 'options->lower_b2f'),
880 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render())
881 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
882 before_ffma_optimizations
).render())
883 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
884 late_optimizations
).render())
projects / mesa.git / blob