nir/algebraic: Add missing ffma(-1, a, b) pattern
[mesa.git] / src / compiler / nir / nir_opt_algebraic.py
1 #
2 # Copyright (C) 2014 Intel Corporation
3 #
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:
10 #
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
13 # Software.
14 #
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
21 # IN THE SOFTWARE.
22 #
23 # Authors:
24 # Jason Ekstrand (jason@jlekstrand.net)
25
26 from __future__ import print_function
27
28 from collections import OrderedDict
29 import nir_algebraic
30 from nir_opcodes import type_sizes
31 import itertools
32
33 # Convenience variables
34 a = 'a'
35 b = 'b'
36 c = 'c'
37 d = 'd'
38 e = 'e'
39
40 # Written in the form (<search>, <replace>) where <search> is an expression
41 # and <replace> is either an expression or a value. An expression is
42 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
43 # where each source is either an expression or a value. A value can be
44 # either a numeric constant or a string representing a variable name.
45 #
46 # If the opcode in a search expression is prefixed by a '~' character, this
47 # indicates that the operation is inexact. Such operations will only get
48 # applied to SSA values that do not have the exact bit set. This should be
49 # used by by any optimizations that are not bit-for-bit exact. It should not,
50 # however, be used for backend-requested lowering operations as those need to
51 # happen regardless of precision.
52 #
53 # Variable names are specified as "[#]name[@type][(cond)]" where "#" inicates
54 # that the given variable will only match constants and the type indicates that
55 # the given variable will only match values from ALU instructions with the
56 # given output type, and (cond) specifies an additional condition function
57 # (see nir_search_helpers.h).
58 #
59 # For constants, you have to be careful to make sure that it is the right
60 # type because python is unaware of the source and destination types of the
61 # opcodes.
62 #
63 # All expression types can have a bit-size specified. For opcodes, this
64 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
65 # type and size. In the search half of the expression this indicates that it
66 # should only match that particular bit-size. In the replace half of the
67 # expression this indicates that the constructed value should have that
68 # bit-size.
69
70 optimizations = [
71
72 (('imul', a, '#b@32(is_pos_power_of_two)'), ('ishl', a, ('find_lsb', b))),
73 (('imul', a, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a, ('find_lsb', ('iabs', b))))),
74 (('unpack_64_2x32_split_x', ('imul_2x32_64(is_used_once)', a, b)), ('imul', a, b)),
75 (('unpack_64_2x32_split_x', ('umul_2x32_64(is_used_once)', a, b)), ('imul', a, b)),
76 (('imul_2x32_64', a, b), ('pack_64_2x32_split', ('imul', a, b), ('imul_high', a, b)), 'options->lower_mul_2x32_64'),
77 (('umul_2x32_64', a, b), ('pack_64_2x32_split', ('imul', a, b), ('umul_high', a, b)), 'options->lower_mul_2x32_64'),
78 (('udiv', a, 1), a),
79 (('idiv', a, 1), a),
80 (('umod', a, 1), 0),
81 (('imod', a, 1), 0),
82 (('udiv', a, '#b@32(is_pos_power_of_two)'), ('ushr', a, ('find_lsb', b))),
83 (('idiv', a, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a), ('ushr', ('iabs', a), ('find_lsb', b))), 'options->lower_idiv'),
84 (('idiv', a, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a), ('ushr', ('iabs', a), ('find_lsb', ('iabs', b))))), 'options->lower_idiv'),
85 (('umod', a, '#b(is_pos_power_of_two)'), ('iand', a, ('isub', b, 1))),
86
87 (('fneg', ('fneg', a)), a),
88 (('ineg', ('ineg', a)), a),
89 (('fabs', ('fabs', a)), ('fabs', a)),
90 (('fabs', ('fneg', a)), ('fabs', a)),
91 (('fabs', ('u2f', a)), ('u2f', a)),
92 (('iabs', ('iabs', a)), ('iabs', a)),
93 (('iabs', ('ineg', a)), ('iabs', a)),
94 (('f2b', ('fneg', a)), ('f2b', a)),
95 (('i2b', ('ineg', a)), ('i2b', a)),
96 (('~fadd', a, 0.0), a),
97 (('iadd', a, 0), a),
98 (('usadd_4x8', a, 0), a),
99 (('usadd_4x8', a, ~0), ~0),
100 (('~fadd', ('fmul', a, b), ('fmul', a, c)), ('fmul', a, ('fadd', b, c))),
101 (('iadd', ('imul', a, b), ('imul', a, c)), ('imul', a, ('iadd', b, c))),
102 (('~fadd', ('fneg', a), a), 0.0),
103 (('iadd', ('ineg', a), a), 0),
104 (('iadd', ('ineg', a), ('iadd', a, b)), b),
105 (('iadd', a, ('iadd', ('ineg', a), b)), b),
106 (('~fadd', ('fneg', a), ('fadd', a, b)), b),
107 (('~fadd', a, ('fadd', ('fneg', a), b)), b),
108 (('~fmul', a, 0.0), 0.0),
109 (('imul', a, 0), 0),
110 (('umul_unorm_4x8', a, 0), 0),
111 (('umul_unorm_4x8', a, ~0), a),
112 (('fmul', a, 1.0), a),
113 (('imul', a, 1), a),
114 (('fmul', a, -1.0), ('fneg', a)),
115 (('imul', a, -1), ('ineg', a)),
116 # If a < 0: fsign(a)*a*a => -1*a*a => -a*a => abs(a)*a
117 # If a > 0: fsign(a)*a*a => 1*a*a => a*a => abs(a)*a
118 # If a == 0: fsign(a)*a*a => 0*0*0 => abs(0)*0
119 (('fmul', ('fsign', a), ('fmul', a, a)), ('fmul', ('fabs', a), a)),
120 (('fmul', ('fmul', ('fsign', a), a), a), ('fmul', ('fabs', a), a)),
121 (('~ffma', 0.0, a, b), b),
122 (('~ffma', a, b, 0.0), ('fmul', a, b)),
123 (('ffma', 1.0, a, b), ('fadd', a, b)),
124 (('ffma', -1.0, a, b), ('fadd', ('fneg', a), b)),
125 (('~flrp', a, b, 0.0), a),
126 (('~flrp', a, b, 1.0), b),
127 (('~flrp', a, a, b), a),
128 (('~flrp', 0.0, a, b), ('fmul', a, b)),
129
130 # flrp(a, a + b, c) => a + flrp(0, b, c) => a + (b * c)
131 (('~flrp', a, ('fadd(is_used_once)', a, b), c), ('fadd', ('fmul', b, c), a)),
132 (('~flrp@32', a, ('fadd', a, b), c), ('fadd', ('fmul', b, c), a), 'options->lower_flrp32'),
133 (('~flrp@64', a, ('fadd', a, b), c), ('fadd', ('fmul', b, c), a), 'options->lower_flrp64'),
134
135 (('~flrp@32', ('fadd', a, b), ('fadd', a, c), d), ('fadd', ('flrp', b, c, d), a), 'options->lower_flrp32'),
136 (('~flrp@64', ('fadd', a, b), ('fadd', a, c), d), ('fadd', ('flrp', b, c, d), a), 'options->lower_flrp64'),
137
138 (('~flrp@32', a, ('fmul(is_used_once)', a, b), c), ('fmul', ('flrp', 1.0, b, c), a), 'options->lower_flrp32'),
139 (('~flrp@64', a, ('fmul(is_used_once)', a, b), c), ('fmul', ('flrp', 1.0, b, c), a), 'options->lower_flrp64'),
140
141 (('~flrp', ('fmul(is_used_once)', a, b), ('fmul(is_used_once)', a, c), d), ('fmul', ('flrp', b, c, d), a)),
142
143 (('~flrp', a, b, ('b2f', 'c@1')), ('bcsel', c, b, a), 'options->lower_flrp32'),
144 (('~flrp', a, 0.0, c), ('fadd', ('fmul', ('fneg', a), c), a)),
145 (('ftrunc', a), ('bcsel', ('flt', a, 0.0), ('fneg', ('ffloor', ('fabs', a))), ('ffloor', ('fabs', a))), 'options->lower_ftrunc'),
146 (('ffloor', a), ('fsub', a, ('ffract', a)), 'options->lower_ffloor'),
147 (('fadd', a, ('fneg', ('ffract', a))), ('ffloor', a), '!options->lower_ffloor'),
148 (('ffract', a), ('fsub', a, ('ffloor', a)), 'options->lower_ffract'),
149 (('fceil', a), ('fneg', ('ffloor', ('fneg', a))), 'options->lower_fceil'),
150 (('~fadd', ('fmul', a, ('fadd', 1.0, ('fneg', ('b2f', 'c@1')))), ('fmul', b, ('b2f', c))), ('bcsel', c, b, a), 'options->lower_flrp32'),
151 (('~fadd@32', ('fmul', a, ('fadd', 1.0, ('fneg', c ))), ('fmul', b, c )), ('flrp', a, b, c), '!options->lower_flrp32'),
152 (('~fadd@64', ('fmul', a, ('fadd', 1.0, ('fneg', c ))), ('fmul', b, c )), ('flrp', a, b, c), '!options->lower_flrp64'),
153 (('~fadd', a, ('fmul', ('b2f', 'c@1'), ('fadd', b, ('fneg', a)))), ('bcsel', c, b, a), 'options->lower_flrp32'),
154 (('~fadd@32', a, ('fmul', c , ('fadd', b, ('fneg', a)))), ('flrp', a, b, c), '!options->lower_flrp32'),
155 (('~fadd@64', a, ('fmul', c , ('fadd', b, ('fneg', a)))), ('flrp', a, b, c), '!options->lower_flrp64'),
156 (('ffma', a, b, c), ('fadd', ('fmul', a, b), c), 'options->lower_ffma'),
157 (('~fadd', ('fmul', a, b), c), ('ffma', a, b, c), 'options->fuse_ffma'),
158
159 (('~fmul', ('fadd', ('iand', ('ineg', ('b2i32', 'a@bool')), ('fmul', b, c)), '#d'), '#e'),
160 ('bcsel', a, ('fmul', ('fadd', ('fmul', b, c), d), e), ('fmul', d, e))),
161
162 (('fdot4', ('vec4', a, b, c, 1.0), d), ('fdph', ('vec3', a, b, c), d)),
163 (('fdot4', ('vec4', a, 0.0, 0.0, 0.0), b), ('fmul', a, b)),
164 (('fdot4', ('vec4', a, b, 0.0, 0.0), c), ('fdot2', ('vec2', a, b), c)),
165 (('fdot4', ('vec4', a, b, c, 0.0), d), ('fdot3', ('vec3', a, b, c), d)),
166
167 (('fdot3', ('vec3', a, 0.0, 0.0), b), ('fmul', a, b)),
168 (('fdot3', ('vec3', a, b, 0.0), c), ('fdot2', ('vec2', a, b), c)),
169
170 # (a * #b + #c) << #d
171 # ((a * #b) << #d) + (#c << #d)
172 # (a * (#b << #d)) + (#c << #d)
173 (('ishl', ('iadd', ('imul', a, '#b'), '#c'), '#d'),
174 ('iadd', ('imul', a, ('ishl', b, d)), ('ishl', c, d))),
175
176 # (a * #b) << #c
177 # a * (#b << #c)
178 (('ishl', ('imul', a, '#b'), '#c'), ('imul', a, ('ishl', b, c))),
179
180 # Comparison simplifications
181 (('~inot', ('flt', a, b)), ('fge', a, b)),
182 (('~inot', ('fge', a, b)), ('flt', a, b)),
183 (('~inot', ('feq', a, b)), ('fne', a, b)),
184 (('~inot', ('fne', a, b)), ('feq', a, b)),
185 (('inot', ('ilt', a, b)), ('ige', a, b)),
186 (('inot', ('ult', a, b)), ('uge', a, b)),
187 (('inot', ('ige', a, b)), ('ilt', a, b)),
188 (('inot', ('uge', a, b)), ('ult', a, b)),
189 (('inot', ('ieq', a, b)), ('ine', a, b)),
190 (('inot', ('ine', a, b)), ('ieq', a, b)),
191
192 # 0.0 >= b2f(a)
193 # b2f(a) <= 0.0
194 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
195 # inot(a)
196 (('fge', 0.0, ('b2f', 'a@1')), ('inot', a)),
197
198 (('fge', ('fneg', ('b2f', 'a@1')), 0.0), ('inot', a)),
199
200 (('fne', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a, b)),
201 (('fne', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a, b)),
202 (('fne', ('bcsel', a, 1.0, ('b2f', 'b@1')) , 0.0), ('ior', a, b)),
203 (('fne', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('ior', a, b)),
204 (('fne', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a, b)),
205 (('fne', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a, b)),
206 (('fne', ('bcsel', a, ('b2f', 'b@1'), 0.0) , 0.0), ('iand', a, b)),
207 (('fne', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ixor', a, b)),
208 (('fne', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ixor', a, b)),
209 (('fne', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ixor', a, b)),
210 (('feq', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a, b))),
211 (('feq', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a, b))),
212 (('feq', ('bcsel', a, 1.0, ('b2f', 'b@1')) , 0.0), ('inot', ('ior', a, b))),
213 (('feq', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('inot', ('ior', a, b))),
214 (('feq', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a, b))),
215 (('feq', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a, b))),
216 (('feq', ('bcsel', a, ('b2f', 'b@1'), 0.0) , 0.0), ('inot', ('iand', a, b))),
217 (('feq', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ieq', a, b)),
218 (('feq', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ieq', a, b)),
219 (('feq', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ieq', a, b)),
220
221 # -(b2f(a) + b2f(b)) < 0
222 # 0 < b2f(a) + b2f(b)
223 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
224 # a || b
225 (('flt', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('ior', a, b)),
226 (('flt', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('ior', a, b)),
227
228 # -(b2f(a) + b2f(b)) >= 0
229 # 0 >= b2f(a) + b2f(b)
230 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
231 # !(a || b)
232 (('fge', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('inot', ('ior', a, b))),
233 (('fge', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('inot', ('ior', a, b))),
234
235 (('flt', a, ('fneg', a)), ('flt', a, 0.0)),
236 (('fge', a, ('fneg', a)), ('fge', a, 0.0)),
237
238 # Some optimizations (below) convert things like (a < b || c < b) into
239 # (min(a, c) < b). However, this interfers with the previous optimizations
240 # that try to remove comparisons with negated sums of b2f. This just
241 # breaks that apart.
242 (('flt', ('fmin', c, ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')))), 0.0),
243 ('ior', ('flt', c, 0.0), ('ior', a, b))),
244
245 (('~flt', ('fadd', a, b), a), ('flt', b, 0.0)),
246 (('~fge', ('fadd', a, b), a), ('fge', b, 0.0)),
247 (('~feq', ('fadd', a, b), a), ('feq', b, 0.0)),
248 (('~fne', ('fadd', a, b), a), ('fne', b, 0.0)),
249
250 # Cannot remove the addition from ilt or ige due to overflow.
251 (('ieq', ('iadd', a, b), a), ('ieq', b, 0)),
252 (('ine', ('iadd', a, b), a), ('ine', b, 0)),
253
254 # fmin(-b2f(a), b) >= 0.0
255 # -b2f(a) >= 0.0 && b >= 0.0
256 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
257 # b2f(a) == 0.0 && b >= 0.0
258 # a == False && b >= 0.0
259 # !a && b >= 0.0
260 #
261 # The fge in the second replacement is not a typo. I leave the proof that
262 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
263 # reader.
264 (('fge', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a), ('fge', b, 0.0))),
265 (('feq', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a), ('fge', b, 0.0))),
266
267 (('feq', ('b2f', 'a@1'), 0.0), ('inot', a)),
268 (('fne', ('b2f', 'a@1'), 0.0), a),
269 (('ieq', ('b2i', 'a@1'), 0), ('inot', a)),
270 (('ine', ('b2i', 'a@1'), 0), a),
271
272 (('fne', ('u2f', a), 0.0), ('ine', a, 0)),
273 (('feq', ('u2f', a), 0.0), ('ieq', a, 0)),
274 (('fge', ('u2f', a), 0.0), True),
275 (('fge', 0.0, ('u2f', a)), ('uge', 0, a)), # ieq instead?
276 (('flt', ('u2f', a), 0.0), False),
277 (('flt', 0.0, ('u2f', a)), ('ult', 0, a)), # ine instead?
278 (('fne', ('i2f', a), 0.0), ('ine', a, 0)),
279 (('feq', ('i2f', a), 0.0), ('ieq', a, 0)),
280 (('fge', ('i2f', a), 0.0), ('ige', a, 0)),
281 (('fge', 0.0, ('i2f', a)), ('ige', 0, a)),
282 (('flt', ('i2f', a), 0.0), ('ilt', a, 0)),
283 (('flt', 0.0, ('i2f', a)), ('ilt', 0, a)),
284
285 # 0.0 < fabs(a)
286 # fabs(a) > 0.0
287 # fabs(a) != 0.0 because fabs(a) must be >= 0
288 # a != 0.0
289 (('~flt', 0.0, ('fabs', a)), ('fne', a, 0.0)),
290
291 # -fabs(a) < 0.0
292 # fabs(a) > 0.0
293 (('~flt', ('fneg', ('fabs', a)), 0.0), ('fne', a, 0.0)),
294
295 # 0.0 >= fabs(a)
296 # 0.0 == fabs(a) because fabs(a) must be >= 0
297 # 0.0 == a
298 (('fge', 0.0, ('fabs', a)), ('feq', a, 0.0)),
299
300 # -fabs(a) >= 0.0
301 # 0.0 >= fabs(a)
302 (('fge', ('fneg', ('fabs', a)), 0.0), ('feq', a, 0.0)),
303
304 (('fmax', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('ior', a, b))),
305 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('ior', a, b)))),
306 (('fmin', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a, b))),
307 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('iand', a, b)))),
308
309 # fmin(b2f(a), b)
310 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
311 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
312 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
313 #
314 # Since b is a constant, constant folding will eliminate the fmin and the
315 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
316 (('fmin', ('b2f', 'a@1'), '#b'), ('bcsel', a, ('fmin', b, 1.0), ('fmin', b, 0.0))),
317
318 (('flt', ('fadd(is_used_once)', a, ('fneg', b)), 0.0), ('flt', a, b)),
319
320 (('fge', ('fneg', ('fabs', a)), 0.0), ('feq', a, 0.0)),
321 (('~bcsel', ('flt', b, a), b, a), ('fmin', a, b)),
322 (('~bcsel', ('flt', a, b), b, a), ('fmax', a, b)),
323 (('~bcsel', ('fge', a, b), b, a), ('fmin', a, b)),
324 (('~bcsel', ('fge', b, a), b, a), ('fmax', a, b)),
325 (('bcsel', ('i2b', a), b, c), ('bcsel', ('ine', a, 0), b, c)),
326 (('bcsel', ('inot', a), b, c), ('bcsel', a, c, b)),
327 (('bcsel', a, ('bcsel', a, b, c), d), ('bcsel', a, b, d)),
328 (('bcsel', a, b, ('bcsel', a, c, d)), ('bcsel', a, b, d)),
329 (('bcsel', a, ('bcsel', b, c, d), ('bcsel(is_used_once)', b, c, 'e')), ('bcsel', b, c, ('bcsel', a, d, 'e'))),
330 (('bcsel', a, ('bcsel(is_used_once)', b, c, d), ('bcsel', b, c, 'e')), ('bcsel', b, c, ('bcsel', a, d, 'e'))),
331 (('bcsel', a, ('bcsel', b, c, d), ('bcsel(is_used_once)', b, 'e', d)), ('bcsel', b, ('bcsel', a, c, 'e'), d)),
332 (('bcsel', a, ('bcsel(is_used_once)', b, c, d), ('bcsel', b, 'e', d)), ('bcsel', b, ('bcsel', a, c, 'e'), d)),
333 (('bcsel', a, True, b), ('ior', a, b)),
334 (('bcsel', a, a, b), ('ior', a, b)),
335 (('bcsel', a, b, False), ('iand', a, b)),
336 (('bcsel', a, b, a), ('iand', a, b)),
337 (('fmin', a, a), a),
338 (('fmax', a, a), a),
339 (('imin', a, a), a),
340 (('imax', a, a), a),
341 (('umin', a, a), a),
342 (('umax', a, a), a),
343 (('fmax', ('fmax', a, b), b), ('fmax', a, b)),
344 (('umax', ('umax', a, b), b), ('umax', a, b)),
345 (('imax', ('imax', a, b), b), ('imax', a, b)),
346 (('fmin', ('fmin', a, b), b), ('fmin', a, b)),
347 (('umin', ('umin', a, b), b), ('umin', a, b)),
348 (('imin', ('imin', a, b), b), ('imin', a, b)),
349 (('fmax', a, ('fneg', a)), ('fabs', a)),
350 (('imax', a, ('ineg', a)), ('iabs', a)),
351 (('fmin', a, ('fneg', a)), ('fneg', ('fabs', a))),
352 (('imin', a, ('ineg', a)), ('ineg', ('iabs', a))),
353 (('fmin', a, ('fneg', ('fabs', a))), ('fneg', ('fabs', a))),
354 (('imin', a, ('ineg', ('iabs', a))), ('ineg', ('iabs', a))),
355 (('fmin', a, ('fabs', a)), a),
356 (('imin', a, ('iabs', a)), a),
357 (('fmax', a, ('fneg', ('fabs', a))), a),
358 (('imax', a, ('ineg', ('iabs', a))), a),
359 (('fmax', a, ('fabs', a)), ('fabs', a)),
360 (('imax', a, ('iabs', a)), ('iabs', a)),
361 (('fmax', a, ('fneg', a)), ('fabs', a)),
362 (('imax', a, ('ineg', a)), ('iabs', a)),
363 (('~fmin', ('fmax', a, 0.0), 1.0), ('fsat', a), '!options->lower_fsat'),
364 (('~fmax', ('fmin', a, 1.0), 0.0), ('fsat', a), '!options->lower_fsat'),
365 (('fsat', ('fsign', a)), ('b2f', ('flt', 0.0, a))),
366 (('fsat', ('b2f', a)), ('b2f', a)),
367 (('fsat', a), ('fmin', ('fmax', a, 0.0), 1.0), 'options->lower_fsat'),
368 (('fsat', ('fsat', a)), ('fsat', a)),
369 (('fmin', ('fmax', ('fmin', ('fmax', a, b), c), b), c), ('fmin', ('fmax', a, b), c)),
370 (('imin', ('imax', ('imin', ('imax', a, b), c), b), c), ('imin', ('imax', a, b), c)),
371 (('umin', ('umax', ('umin', ('umax', a, b), c), b), c), ('umin', ('umax', a, b), c)),
372 (('fmax', ('fsat', a), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a, b))),
373 (('fmin', ('fsat', a), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a, b))),
374 (('extract_u8', ('imin', ('imax', a, 0), 0xff), 0), ('imin', ('imax', a, 0), 0xff)),
375 (('~ior', ('flt(is_used_once)', a, b), ('flt', a, c)), ('flt', a, ('fmax', b, c))),
376 (('~ior', ('flt(is_used_once)', a, c), ('flt', b, c)), ('flt', ('fmin', a, b), c)),
377 (('~ior', ('fge(is_used_once)', a, b), ('fge', a, c)), ('fge', a, ('fmin', b, c))),
378 (('~ior', ('fge(is_used_once)', a, c), ('fge', b, c)), ('fge', ('fmax', a, b), c)),
379 (('~ior', ('flt', a, '#b'), ('flt', a, '#c')), ('flt', a, ('fmax', b, c))),
380 (('~ior', ('flt', '#a', c), ('flt', '#b', c)), ('flt', ('fmin', a, b), c)),
381 (('~ior', ('fge', a, '#b'), ('fge', a, '#c')), ('fge', a, ('fmin', b, c))),
382 (('~ior', ('fge', '#a', c), ('fge', '#b', c)), ('fge', ('fmax', a, b), c)),
383 (('~iand', ('flt(is_used_once)', a, b), ('flt', a, c)), ('flt', a, ('fmin', b, c))),
384 (('~iand', ('flt(is_used_once)', a, c), ('flt', b, c)), ('flt', ('fmax', a, b), c)),
385 (('~iand', ('fge(is_used_once)', a, b), ('fge', a, c)), ('fge', a, ('fmax', b, c))),
386 (('~iand', ('fge(is_used_once)', a, c), ('fge', b, c)), ('fge', ('fmin', a, b), c)),
387 (('~iand', ('flt', a, '#b'), ('flt', a, '#c')), ('flt', a, ('fmin', b, c))),
388 (('~iand', ('flt', '#a', c), ('flt', '#b', c)), ('flt', ('fmax', a, b), c)),
389 (('~iand', ('fge', a, '#b'), ('fge', a, '#c')), ('fge', a, ('fmax', b, c))),
390 (('~iand', ('fge', '#a', c), ('fge', '#b', c)), ('fge', ('fmin', a, b), c)),
391
392 (('ior', ('ilt(is_used_once)', a, b), ('ilt', a, c)), ('ilt', a, ('imax', b, c))),
393 (('ior', ('ilt(is_used_once)', a, c), ('ilt', b, c)), ('ilt', ('imin', a, b), c)),
394 (('ior', ('ige(is_used_once)', a, b), ('ige', a, c)), ('ige', a, ('imin', b, c))),
395 (('ior', ('ige(is_used_once)', a, c), ('ige', b, c)), ('ige', ('imax', a, b), c)),
396 (('ior', ('ult(is_used_once)', a, b), ('ult', a, c)), ('ult', a, ('umax', b, c))),
397 (('ior', ('ult(is_used_once)', a, c), ('ult', b, c)), ('ult', ('umin', a, b), c)),
398 (('ior', ('uge(is_used_once)', a, b), ('uge', a, c)), ('uge', a, ('umin', b, c))),
399 (('ior', ('uge(is_used_once)', a, c), ('uge', b, c)), ('uge', ('umax', a, b), c)),
400 (('iand', ('ilt(is_used_once)', a, b), ('ilt', a, c)), ('ilt', a, ('imin', b, c))),
401 (('iand', ('ilt(is_used_once)', a, c), ('ilt', b, c)), ('ilt', ('imax', a, b), c)),
402 (('iand', ('ige(is_used_once)', a, b), ('ige', a, c)), ('ige', a, ('imax', b, c))),
403 (('iand', ('ige(is_used_once)', a, c), ('ige', b, c)), ('ige', ('imin', a, b), c)),
404 (('iand', ('ult(is_used_once)', a, b), ('ult', a, c)), ('ult', a, ('umin', b, c))),
405 (('iand', ('ult(is_used_once)', a, c), ('ult', b, c)), ('ult', ('umax', a, b), c)),
406 (('iand', ('uge(is_used_once)', a, b), ('uge', a, c)), ('uge', a, ('umax', b, c))),
407 (('iand', ('uge(is_used_once)', a, c), ('uge', b, c)), ('uge', ('umin', a, b), c)),
408
409 # Common pattern like 'if (i == 0 || i == 1 || ...)'
410 (('ior', ('ieq', a, 0), ('ieq', a, 1)), ('uge', 1, a)),
411 (('ior', ('uge', 1, a), ('ieq', a, 2)), ('uge', 2, a)),
412 (('ior', ('uge', 2, a), ('ieq', a, 3)), ('uge', 3, a)),
413
414 # The (i2f32, ...) part is an open-coded fsign. When that is combined with
415 # the bcsel, it's basically copysign(1.0, a). There is no copysign in NIR,
416 # so emit an open-coded version of that.
417 (('bcsel@32', ('feq', a, 0.0), 1.0, ('i2f32', ('iadd', ('b2i32', ('flt', 0.0, 'a@32')), ('ineg', ('b2i32', ('flt', 'a@32', 0.0)))))),
418 ('ior', 0x3f800000, ('iand', a, 0x80000000))),
419
420 (('ior', a, ('ieq', a, False)), True),
421 (('ior', a, ('inot', a)), -1),
422
423 (('ine', ('ineg', ('b2i32', 'a@1')), ('ineg', ('b2i32', 'b@1'))), ('ine', a, b)),
424 (('b2i32', ('ine', 'a@1', 'b@1')), ('b2i32', ('ixor', a, b))),
425
426 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0)),
427
428 # These patterns can result when (a < b || a < c) => (a < min(b, c))
429 # transformations occur before constant propagation and loop-unrolling.
430 (('~flt', a, ('fmax', b, a)), ('flt', a, b)),
431 (('~flt', ('fmin', a, b), a), ('flt', b, a)),
432 (('~fge', a, ('fmin', b, a)), True),
433 (('~fge', ('fmax', a, b), a), True),
434 (('~flt', a, ('fmin', b, a)), False),
435 (('~flt', ('fmax', a, b), a), False),
436 (('~fge', a, ('fmax', b, a)), ('fge', a, b)),
437 (('~fge', ('fmin', a, b), a), ('fge', b, a)),
438
439 (('ilt', a, ('imax', b, a)), ('ilt', a, b)),
440 (('ilt', ('imin', a, b), a), ('ilt', b, a)),
441 (('ige', a, ('imin', b, a)), True),
442 (('ige', ('imax', a, b), a), True),
443 (('ult', a, ('umax', b, a)), ('ult', a, b)),
444 (('ult', ('umin', a, b), a), ('ult', b, a)),
445 (('uge', a, ('umin', b, a)), True),
446 (('uge', ('umax', a, b), a), True),
447 (('ilt', a, ('imin', b, a)), False),
448 (('ilt', ('imax', a, b), a), False),
449 (('ige', a, ('imax', b, a)), ('ige', a, b)),
450 (('ige', ('imin', a, b), a), ('ige', b, a)),
451 (('ult', a, ('umin', b, a)), False),
452 (('ult', ('umax', a, b), a), False),
453 (('uge', a, ('umax', b, a)), ('uge', a, b)),
454 (('uge', ('umin', a, b), a), ('uge', b, a)),
455
456 (('ilt', '#a', ('imax', '#b', c)), ('ior', ('ilt', a, b), ('ilt', a, c))),
457 (('ilt', ('imin', '#a', b), '#c'), ('ior', ('ilt', a, c), ('ilt', b, c))),
458 (('ige', '#a', ('imin', '#b', c)), ('ior', ('ige', a, b), ('ige', a, c))),
459 (('ige', ('imax', '#a', b), '#c'), ('ior', ('ige', a, c), ('ige', b, c))),
460 (('ult', '#a', ('umax', '#b', c)), ('ior', ('ult', a, b), ('ult', a, c))),
461 (('ult', ('umin', '#a', b), '#c'), ('ior', ('ult', a, c), ('ult', b, c))),
462 (('uge', '#a', ('umin', '#b', c)), ('ior', ('uge', a, b), ('uge', a, c))),
463 (('uge', ('umax', '#a', b), '#c'), ('ior', ('uge', a, c), ('uge', b, c))),
464 (('ilt', '#a', ('imin', '#b', c)), ('iand', ('ilt', a, b), ('ilt', a, c))),
465 (('ilt', ('imax', '#a', b), '#c'), ('iand', ('ilt', a, c), ('ilt', b, c))),
466 (('ige', '#a', ('imax', '#b', c)), ('iand', ('ige', a, b), ('ige', a, c))),
467 (('ige', ('imin', '#a', b), '#c'), ('iand', ('ige', a, c), ('ige', b, c))),
468 (('ult', '#a', ('umin', '#b', c)), ('iand', ('ult', a, b), ('ult', a, c))),
469 (('ult', ('umax', '#a', b), '#c'), ('iand', ('ult', a, c), ('ult', b, c))),
470 (('uge', '#a', ('umax', '#b', c)), ('iand', ('uge', a, b), ('uge', a, c))),
471 (('uge', ('umin', '#a', b), '#c'), ('iand', ('uge', a, c), ('uge', b, c))),
472
473 # Thanks to sign extension, the ishr(a, b) is negative if and only if a is
474 # negative.
475 (('bcsel', ('ilt', a, 0), ('ineg', ('ishr', a, b)), ('ishr', a, b)),
476 ('iabs', ('ishr', a, b))),
477 (('iabs', ('ishr', ('iabs', a), b)), ('ishr', ('iabs', a), b)),
478
479 (('fabs', ('slt', a, b)), ('slt', a, b)),
480 (('fabs', ('sge', a, b)), ('sge', a, b)),
481 (('fabs', ('seq', a, b)), ('seq', a, b)),
482 (('fabs', ('sne', a, b)), ('sne', a, b)),
483 (('slt', a, b), ('b2f', ('flt', a, b)), 'options->lower_scmp'),
484 (('sge', a, b), ('b2f', ('fge', a, b)), 'options->lower_scmp'),
485 (('seq', a, b), ('b2f', ('feq', a, b)), 'options->lower_scmp'),
486 (('sne', a, b), ('b2f', ('fne', a, b)), 'options->lower_scmp'),
487 (('fne', ('fneg', a), a), ('fne', a, 0.0)),
488 (('feq', ('fneg', a), a), ('feq', a, 0.0)),
489 # Emulating booleans
490 (('imul', ('b2i', 'a@1'), ('b2i', 'b@1')), ('b2i', ('iand', a, b))),
491 (('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a, b))),
492 (('fsat', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('b2f', ('ior', a, b))),
493 (('iand', 'a@bool32', 1.0), ('b2f', a)),
494 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
495 (('ineg', ('b2i32', 'a@32')), a),
496 (('flt', ('fneg', ('b2f', 'a@1')), 0), a), # Generated by TGSI KILL_IF.
497 (('flt', ('fsub', 0.0, ('b2f', 'a@1')), 0), a), # Generated by TGSI KILL_IF.
498 # Comparison with the same args. Note that these are not done for
499 # the float versions because NaN always returns false on float
500 # inequalities.
501 (('ilt', a, a), False),
502 (('ige', a, a), True),
503 (('ieq', a, a), True),
504 (('ine', a, a), False),
505 (('ult', a, a), False),
506 (('uge', a, a), True),
507 # Logical and bit operations
508 (('fand', a, 0.0), 0.0),
509 (('iand', a, a), a),
510 (('iand', a, ~0), a),
511 (('iand', a, 0), 0),
512 (('ior', a, a), a),
513 (('ior', a, 0), a),
514 (('ior', a, True), True),
515 (('fxor', a, a), 0.0),
516 (('ixor', a, a), 0),
517 (('ixor', a, 0), a),
518 (('inot', ('inot', a)), a),
519 (('ior', ('iand', a, b), b), b),
520 (('ior', ('ior', a, b), b), ('ior', a, b)),
521 (('iand', ('ior', a, b), b), b),
522 (('iand', ('iand', a, b), b), ('iand', a, b)),
523 # DeMorgan's Laws
524 (('iand', ('inot', a), ('inot', b)), ('inot', ('ior', a, b))),
525 (('ior', ('inot', a), ('inot', b)), ('inot', ('iand', a, b))),
526 # Shift optimizations
527 (('ishl', 0, a), 0),
528 (('ishl', a, 0), a),
529 (('ishr', 0, a), 0),
530 (('ishr', a, 0), a),
531 (('ushr', 0, a), 0),
532 (('ushr', a, 0), a),
533 (('iand', 0xff, ('ushr@32', a, 24)), ('ushr', a, 24)),
534 (('iand', 0xffff, ('ushr@32', a, 16)), ('ushr', a, 16)),
535 # Exponential/logarithmic identities
536 (('~fexp2', ('flog2', a)), a), # 2^lg2(a) = a
537 (('~flog2', ('fexp2', a)), a), # lg2(2^a) = a
538 (('fpow', a, b), ('fexp2', ('fmul', ('flog2', a), b)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
539 (('~fexp2', ('fmul', ('flog2', a), b)), ('fpow', a, b), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
540 (('~fexp2', ('fadd', ('fmul', ('flog2', a), b), ('fmul', ('flog2', c), d))),
541 ('~fmul', ('fpow', a, b), ('fpow', c, d)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
542 (('~fexp2', ('fmul', ('flog2', a), 2.0)), ('fmul', a, a)),
543 (('~fexp2', ('fmul', ('flog2', a), 4.0)), ('fmul', ('fmul', a, a), ('fmul', a, a))),
544 (('~fpow', a, 1.0), a),
545 (('~fpow', a, 2.0), ('fmul', a, a)),
546 (('~fpow', a, 4.0), ('fmul', ('fmul', a, a), ('fmul', a, a))),
547 (('~fpow', 2.0, a), ('fexp2', a)),
548 (('~fpow', ('fpow', a, 2.2), 0.454545), a),
549 (('~fpow', ('fabs', ('fpow', a, 2.2)), 0.454545), ('fabs', a)),
550 (('~fsqrt', ('fexp2', a)), ('fexp2', ('fmul', 0.5, a))),
551 (('~frcp', ('fexp2', a)), ('fexp2', ('fneg', a))),
552 (('~frsq', ('fexp2', a)), ('fexp2', ('fmul', -0.5, a))),
553 (('~flog2', ('fsqrt', a)), ('fmul', 0.5, ('flog2', a))),
554 (('~flog2', ('frcp', a)), ('fneg', ('flog2', a))),
555 (('~flog2', ('frsq', a)), ('fmul', -0.5, ('flog2', a))),
556 (('~flog2', ('fpow', a, b)), ('fmul', b, ('flog2', a))),
557 (('~fmul', ('fexp2(is_used_once)', a), ('fexp2(is_used_once)', b)), ('fexp2', ('fadd', a, b))),
558 # Division and reciprocal
559 (('~fdiv', 1.0, a), ('frcp', a)),
560 (('fdiv', a, b), ('fmul', a, ('frcp', b)), 'options->lower_fdiv'),
561 (('~frcp', ('frcp', a)), a),
562 (('~frcp', ('fsqrt', a)), ('frsq', a)),
563 (('fsqrt', a), ('frcp', ('frsq', a)), 'options->lower_fsqrt'),
564 (('~frcp', ('frsq', a)), ('fsqrt', a), '!options->lower_fsqrt'),
565 # Boolean simplifications
566 (('i2b32(is_used_by_if)', a), ('ine32', a, 0)),
567 (('i2b1(is_used_by_if)', a), ('ine', a, 0)),
568 (('ieq', a, True), a),
569 (('ine(is_not_used_by_if)', a, True), ('inot', a)),
570 (('ine', a, False), a),
571 (('ieq(is_not_used_by_if)', a, False), ('inot', 'a')),
572 (('bcsel', a, True, False), a),
573 (('bcsel', a, False, True), ('inot', a)),
574 (('bcsel@32', a, 1.0, 0.0), ('b2f', a)),
575 (('bcsel@32', a, 0.0, 1.0), ('b2f', ('inot', a))),
576 (('bcsel@32', a, -1.0, -0.0), ('fneg', ('b2f', a))),
577 (('bcsel@32', a, -0.0, -1.0), ('fneg', ('b2f', ('inot', a)))),
578 (('bcsel', True, b, c), b),
579 (('bcsel', False, b, c), c),
580 (('bcsel', a, ('b2f(is_used_once)', 'b@32'), ('b2f', 'c@32')), ('b2f', ('bcsel', a, b, c))),
581 # The result of this should be hit by constant propagation and, in the
582 # next round of opt_algebraic, get picked up by one of the above two.
583 (('bcsel', '#a', b, c), ('bcsel', ('ine', 'a', 0), b, c)),
584
585 (('bcsel', a, b, b), b),
586 (('fcsel', a, b, b), b),
587
588 # D3D Boolean emulation
589 (('bcsel', a, -1, 0), ('ineg', ('b2i', 'a@1'))),
590 (('bcsel', a, 0, -1), ('ineg', ('b2i', ('inot', a)))),
591 (('iand', ('ineg', ('b2i', 'a@1')), ('ineg', ('b2i', 'b@1'))),
592 ('ineg', ('b2i', ('iand', a, b)))),
593 (('ior', ('ineg', ('b2i','a@1')), ('ineg', ('b2i', 'b@1'))),
594 ('ineg', ('b2i', ('ior', a, b)))),
595 (('ieq', ('ineg', ('b2i', 'a@1')), 0), ('inot', a)),
596 (('ieq', ('ineg', ('b2i', 'a@1')), -1), a),
597 (('ine', ('ineg', ('b2i', 'a@1')), 0), a),
598 (('ine', ('ineg', ('b2i', 'a@1')), -1), ('inot', a)),
599 (('iand', ('ineg', ('b2i', a)), 1.0), ('b2f', a)),
600
601 # SM5 32-bit shifts are defined to use the 5 least significant bits
602 (('ishl', 'a@32', ('iand', 31, b)), ('ishl', a, b)),
603 (('ishr', 'a@32', ('iand', 31, b)), ('ishr', a, b)),
604 (('ushr', 'a@32', ('iand', 31, b)), ('ushr', a, b)),
605
606 # Conversions
607 (('i2b32', ('b2i', 'a@32')), a),
608 (('f2i', ('ftrunc', a)), ('f2i', a)),
609 (('f2u', ('ftrunc', a)), ('f2u', a)),
610 (('i2b', ('ineg', a)), ('i2b', a)),
611 (('i2b', ('iabs', a)), ('i2b', a)),
612 (('fabs', ('b2f', a)), ('b2f', a)),
613 (('iabs', ('b2i', a)), ('b2i', a)),
614 (('inot', ('f2b1', a)), ('feq', a, 0.0)),
615
616 # Ironically, mark these as imprecise because removing the conversions may
617 # preserve more precision than doing the conversions (e.g.,
618 # uint(float(0x81818181u)) == 0x81818200).
619 (('~f2i32', ('i2f', 'a@32')), a),
620 (('~f2i32', ('u2f', 'a@32')), a),
621 (('~f2u32', ('i2f', 'a@32')), a),
622 (('~f2u32', ('u2f', 'a@32')), a),
623
624 # Section 5.4.1 (Conversion and Scalar Constructors) of the GLSL 4.60 spec
625 # says:
626 #
627 # It is undefined to convert a negative floating-point value to an
628 # uint.
629 #
630 # Assuming that (uint)some_float behaves like (uint)(int)some_float allows
631 # some optimizations in the i965 backend to proceed.
632 (('ige', ('f2u', a), b), ('ige', ('f2i', a), b)),
633 (('ige', b, ('f2u', a)), ('ige', b, ('f2i', a))),
634 (('ilt', ('f2u', a), b), ('ilt', ('f2i', a), b)),
635 (('ilt', b, ('f2u', a)), ('ilt', b, ('f2i', a))),
636
637 # Packing and then unpacking does nothing
638 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a, b)), a),
639 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a, b)), b),
640 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a),
641 ('unpack_64_2x32_split_y', a)), a),
642
643 # Byte extraction
644 (('ushr', 'a@16', 8), ('extract_u8', a, 1), '!options->lower_extract_byte'),
645 (('ushr', 'a@32', 24), ('extract_u8', a, 3), '!options->lower_extract_byte'),
646 (('ushr', 'a@64', 56), ('extract_u8', a, 7), '!options->lower_extract_byte'),
647 (('ishr', 'a@16', 8), ('extract_i8', a, 1), '!options->lower_extract_byte'),
648 (('ishr', 'a@32', 24), ('extract_i8', a, 3), '!options->lower_extract_byte'),
649 (('ishr', 'a@64', 56), ('extract_i8', a, 7), '!options->lower_extract_byte'),
650 (('iand', 0xff, a), ('extract_u8', a, 0), '!options->lower_extract_byte')
651 ]
652
653 # After the ('extract_u8', a, 0) pattern, above, triggers, there will be
654 # patterns like those below.
655 for op in ('ushr', 'ishr'):
656 optimizations.extend([(('extract_u8', (op, 'a@16', 8), 0), ('extract_u8', a, 1))])
657 optimizations.extend([(('extract_u8', (op, 'a@32', 8 * i), 0), ('extract_u8', a, i)) for i in range(1, 4)])
658 optimizations.extend([(('extract_u8', (op, 'a@64', 8 * i), 0), ('extract_u8', a, i)) for i in range(1, 8)])
659
660 optimizations.extend([(('extract_u8', ('extract_u16', a, 1), 0), ('extract_u8', a, 2))])
661
662 # After the ('extract_[iu]8', a, 3) patterns, above, trigger, there will be
663 # patterns like those below.
664 for op in ('extract_u8', 'extract_i8'):
665 optimizations.extend([((op, ('ishl', 'a@16', 8), 1), (op, a, 0))])
666 optimizations.extend([((op, ('ishl', 'a@32', 24 - 8 * i), 3), (op, a, i)) for i in range(2, -1, -1)])
667 optimizations.extend([((op, ('ishl', 'a@64', 56 - 8 * i), 7), (op, a, i)) for i in range(6, -1, -1)])
668
669 optimizations.extend([
670 # Word extraction
671 (('ushr', ('ishl', 'a@32', 16), 16), ('extract_u16', a, 0), '!options->lower_extract_word'),
672 (('ushr', 'a@32', 16), ('extract_u16', a, 1), '!options->lower_extract_word'),
673 (('ishr', ('ishl', 'a@32', 16), 16), ('extract_i16', a, 0), '!options->lower_extract_word'),
674 (('ishr', 'a@32', 16), ('extract_i16', a, 1), '!options->lower_extract_word'),
675 (('iand', 0xffff, a), ('extract_u16', a, 0), '!options->lower_extract_word'),
676
677 # Subtracts
678 (('~fsub', a, ('fsub', 0.0, b)), ('fadd', a, b)),
679 (('isub', a, ('isub', 0, b)), ('iadd', a, b)),
680 (('ussub_4x8', a, 0), a),
681 (('ussub_4x8', a, ~0), 0),
682 (('fsub', a, b), ('fadd', a, ('fneg', b)), 'options->lower_sub'),
683 (('isub', a, b), ('iadd', a, ('ineg', b)), 'options->lower_sub'),
684 (('fneg', a), ('fsub', 0.0, a), 'options->lower_negate'),
685 (('ineg', a), ('isub', 0, a), 'options->lower_negate'),
686 (('~fadd', a, ('fsub', 0.0, b)), ('fsub', a, b)),
687 (('iadd', a, ('isub', 0, b)), ('isub', a, b)),
688 (('fabs', ('fsub', 0.0, a)), ('fabs', a)),
689 (('iabs', ('isub', 0, a)), ('iabs', a)),
690
691 # Propagate negation up multiplication chains
692 (('fmul', ('fneg', a), b), ('fneg', ('fmul', a, b))),
693 (('imul', ('ineg', a), b), ('ineg', ('imul', a, b))),
694
695 # Propagate constants up multiplication chains
696 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a, c), b)),
697 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a, c), b)),
698 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a, c), b)),
699 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a, c), b)),
700
701 # Reassociate constants in add/mul chains so they can be folded together.
702 # For now, we mostly only handle cases where the constants are separated by
703 # a single non-constant. We could do better eventually.
704 (('~fmul', '#a', ('fmul', 'b(is_not_const)', '#c')), ('fmul', ('fmul', a, c), b)),
705 (('imul', '#a', ('imul', 'b(is_not_const)', '#c')), ('imul', ('imul', a, c), b)),
706 (('~fadd', '#a', ('fadd', 'b(is_not_const)', '#c')), ('fadd', ('fadd', a, c), b)),
707 (('~fadd', '#a', ('fneg', ('fadd', 'b(is_not_const)', '#c'))), ('fadd', ('fadd', a, ('fneg', c)), ('fneg', b))),
708 (('iadd', '#a', ('iadd', 'b(is_not_const)', '#c')), ('iadd', ('iadd', a, c), b)),
709
710 # By definition...
711 (('bcsel', ('ige', ('find_lsb', a), 0), ('find_lsb', a), -1), ('find_lsb', a)),
712 (('bcsel', ('ige', ('ifind_msb', a), 0), ('ifind_msb', a), -1), ('ifind_msb', a)),
713 (('bcsel', ('ige', ('ufind_msb', a), 0), ('ufind_msb', a), -1), ('ufind_msb', a)),
714
715 (('bcsel', ('ine', a, 0), ('find_lsb', a), -1), ('find_lsb', a)),
716 (('bcsel', ('ine', a, 0), ('ifind_msb', a), -1), ('ifind_msb', a)),
717 (('bcsel', ('ine', a, 0), ('ufind_msb', a), -1), ('ufind_msb', a)),
718
719 (('bcsel', ('ine', a, -1), ('ifind_msb', a), -1), ('ifind_msb', a)),
720
721 # Misc. lowering
722 (('fmod@16', a, b), ('fsub', a, ('fmul', b, ('ffloor', ('fdiv', a, b)))), 'options->lower_fmod16'),
723 (('fmod@32', a, b), ('fsub', a, ('fmul', b, ('ffloor', ('fdiv', a, b)))), 'options->lower_fmod32'),
724 (('fmod@64', a, b), ('fsub', a, ('fmul', b, ('ffloor', ('fdiv', a, b)))), 'options->lower_fmod64'),
725 (('frem', a, b), ('fsub', a, ('fmul', b, ('ftrunc', ('fdiv', a, b)))), 'options->lower_fmod32'),
726 (('uadd_carry@32', a, b), ('b2i', ('ult', ('iadd', a, b), a)), 'options->lower_uadd_carry'),
727 (('usub_borrow@32', a, b), ('b2i', ('ult', a, b)), 'options->lower_usub_borrow'),
728
729 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
730 ('bcsel', ('ilt', 31, 'bits'), 'insert',
731 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
732 'options->lower_bitfield_insert'),
733 (('ihadd', a, b), ('iadd', ('iand', a, b), ('ishr', ('ixor', a, b), 1)), 'options->lower_hadd'),
734 (('uhadd', a, b), ('iadd', ('iand', a, b), ('ushr', ('ixor', a, b), 1)), 'options->lower_hadd'),
735 (('irhadd', a, b), ('isub', ('ior', a, b), ('ishr', ('ixor', a, b), 1)), 'options->lower_hadd'),
736 (('urhadd', a, b), ('isub', ('ior', a, b), ('ushr', ('ixor', a, b), 1)), 'options->lower_hadd'),
737 (('uadd_sat', a, b), ('bcsel', ('ult', ('iadd', a, b), a), -1, ('iadd', a, b)), 'options->lower_add_sat'),
738 (('usub_sat', a, b), ('bcsel', ('ult', a, b), 0, ('isub', a, b)), 'options->lower_add_sat'),
739
740 # Alternative lowering that doesn't rely on bfi.
741 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
742 ('bcsel', ('ilt', 31, 'bits'),
743 'insert',
744 ('ior',
745 ('iand', 'base', ('inot', ('bfm', 'bits', 'offset'))),
746 ('iand', ('ishl', 'insert', 'offset'), ('bfm', 'bits', 'offset')))),
747 'options->lower_bitfield_insert_to_shifts'),
748
749 # bfm lowering -- note that the NIR opcode is undefined if either arg is 32.
750 (('bfm', 'bits', 'offset'),
751 ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'),
752 'options->lower_bfm'),
753
754 (('ibitfield_extract', 'value', 'offset', 'bits'),
755 ('bcsel', ('ilt', 31, 'bits'), 'value',
756 ('ibfe', 'value', 'offset', 'bits')),
757 'options->lower_bitfield_extract'),
758
759 (('ubitfield_extract', 'value', 'offset', 'bits'),
760 ('bcsel', ('ult', 31, 'bits'), 'value',
761 ('ubfe', 'value', 'offset', 'bits')),
762 'options->lower_bitfield_extract'),
763
764 (('ibitfield_extract', 'value', 'offset', 'bits'),
765 ('bcsel', ('ieq', 0, 'bits'),
766 0,
767 ('ishr',
768 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
769 ('isub', 32, 'bits'))),
770 'options->lower_bitfield_extract_to_shifts'),
771
772 (('ubitfield_extract', 'value', 'offset', 'bits'),
773 ('iand',
774 ('ushr', 'value', 'offset'),
775 ('bcsel', ('ieq', 'bits', 32),
776 0xffffffff,
777 ('bfm', 'bits', 0))),
778 'options->lower_bitfield_extract_to_shifts'),
779
780 (('ifind_msb', 'value'),
781 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
782 'options->lower_ifind_msb'),
783
784 (('find_lsb', 'value'),
785 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
786 'options->lower_find_lsb'),
787
788 (('extract_i8', a, 'b@32'),
789 ('ishr', ('ishl', a, ('imul', ('isub', 3, b), 8)), 24),
790 'options->lower_extract_byte'),
791
792 (('extract_u8', a, 'b@32'),
793 ('iand', ('ushr', a, ('imul', b, 8)), 0xff),
794 'options->lower_extract_byte'),
795
796 (('extract_i16', a, 'b@32'),
797 ('ishr', ('ishl', a, ('imul', ('isub', 1, b), 16)), 16),
798 'options->lower_extract_word'),
799
800 (('extract_u16', a, 'b@32'),
801 ('iand', ('ushr', a, ('imul', b, 16)), 0xffff),
802 'options->lower_extract_word'),
803
804 (('pack_unorm_2x16', 'v'),
805 ('pack_uvec2_to_uint',
806 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
807 'options->lower_pack_unorm_2x16'),
808
809 (('pack_unorm_4x8', 'v'),
810 ('pack_uvec4_to_uint',
811 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
812 'options->lower_pack_unorm_4x8'),
813
814 (('pack_snorm_2x16', 'v'),
815 ('pack_uvec2_to_uint',
816 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
817 'options->lower_pack_snorm_2x16'),
818
819 (('pack_snorm_4x8', 'v'),
820 ('pack_uvec4_to_uint',
821 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
822 'options->lower_pack_snorm_4x8'),
823
824 (('unpack_unorm_2x16', 'v'),
825 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
826 ('extract_u16', 'v', 1))),
827 65535.0),
828 'options->lower_unpack_unorm_2x16'),
829
830 (('unpack_unorm_4x8', 'v'),
831 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
832 ('extract_u8', 'v', 1),
833 ('extract_u8', 'v', 2),
834 ('extract_u8', 'v', 3))),
835 255.0),
836 'options->lower_unpack_unorm_4x8'),
837
838 (('unpack_snorm_2x16', 'v'),
839 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec2', ('extract_i16', 'v', 0),
840 ('extract_i16', 'v', 1))),
841 32767.0))),
842 'options->lower_unpack_snorm_2x16'),
843
844 (('unpack_snorm_4x8', 'v'),
845 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec4', ('extract_i8', 'v', 0),
846 ('extract_i8', 'v', 1),
847 ('extract_i8', 'v', 2),
848 ('extract_i8', 'v', 3))),
849 127.0))),
850 'options->lower_unpack_snorm_4x8'),
851
852 (('isign', a), ('imin', ('imax', a, -1), 1), 'options->lower_isign'),
853 (('fsign', a), ('fsub', ('b2f', ('flt', 0.0, a)), ('b2f', ('flt', a, 0.0))), 'options->lower_fsign'),
854 ])
855
856 # bit_size dependent lowerings
857 for bit_size in [8, 16, 32, 64]:
858 # convenience constants
859 intmax = (1 << (bit_size - 1)) - 1
860 intmin = 1 << (bit_size - 1)
861
862 optimizations += [
863 (('iadd_sat@' + str(bit_size), a, b),
864 ('bcsel', ('ige', b, 1), ('bcsel', ('ilt', ('iadd', a, b), a), intmax, ('iadd', a, b)),
865 ('bcsel', ('ilt', a, ('iadd', a, b)), intmin, ('iadd', a, b))), 'options->lower_add_sat'),
866 (('isub_sat@' + str(bit_size), a, b),
867 ('bcsel', ('ilt', b, 0), ('bcsel', ('ilt', ('isub', a, b), a), intmax, ('isub', a, b)),
868 ('bcsel', ('ilt', a, ('isub', a, b)), intmin, ('isub', a, b))), 'options->lower_add_sat'),
869 ]
870
871 invert = OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
872
873 for left, right in itertools.combinations_with_replacement(invert.keys(), 2):
874 optimizations.append((('inot', ('ior(is_used_once)', (left, a, b), (right, c, d))),
875 ('iand', (invert[left], a, b), (invert[right], c, d))))
876 optimizations.append((('inot', ('iand(is_used_once)', (left, a, b), (right, c, d))),
877 ('ior', (invert[left], a, b), (invert[right], c, d))))
878
879 # Optimize x2bN(b2x(x)) -> x
880 for size in type_sizes('bool'):
881 aN = 'a@' + str(size)
882 f2bN = 'f2b' + str(size)
883 i2bN = 'i2b' + str(size)
884 optimizations.append(((f2bN, ('b2f', aN)), a))
885 optimizations.append(((i2bN, ('b2i', aN)), a))
886
887 # Optimize x2yN(b2x(x)) -> b2y
888 for x, y in itertools.product(['f', 'u', 'i'], ['f', 'u', 'i']):
889 if x != 'f' and y != 'f' and x != y:
890 continue
891
892 b2x = 'b2f' if x == 'f' else 'b2i'
893 b2y = 'b2f' if y == 'f' else 'b2i'
894 x2yN = '{}2{}'.format(x, y)
895 optimizations.append(((x2yN, (b2x, a)), (b2y, a)))
896
897 # Optimize away x2xN(a@N)
898 for t in ['int', 'uint', 'float']:
899 for N in type_sizes(t):
900 x2xN = '{0}2{0}{1}'.format(t[0], N)
901 aN = 'a@{0}'.format(N)
902 optimizations.append(((x2xN, aN), a))
903
904 # Optimize x2xN(y2yM(a@P)) -> y2yN(a) for integers
905 # In particular, we can optimize away everything except upcast of downcast and
906 # upcasts where the type differs from the other cast
907 for N, M in itertools.product(type_sizes('uint'), type_sizes('uint')):
908 if N < M:
909 # The outer cast is a down-cast. It doesn't matter what the size of the
910 # argument of the inner cast is because we'll never been in the upcast
911 # of downcast case. Regardless of types, we'll always end up with y2yN
912 # in the end.
913 for x, y in itertools.product(['i', 'u'], ['i', 'u']):
914 x2xN = '{0}2{0}{1}'.format(x, N)
915 y2yM = '{0}2{0}{1}'.format(y, M)
916 y2yN = '{0}2{0}{1}'.format(y, N)
917 optimizations.append(((x2xN, (y2yM, a)), (y2yN, a)))
918 elif N > M:
919 # If the outer cast is an up-cast, we have to be more careful about the
920 # size of the argument of the inner cast and with types. In this case,
921 # the type is always the type of type up-cast which is given by the
922 # outer cast.
923 for P in type_sizes('uint'):
924 # We can't optimize away up-cast of down-cast.
925 if M < P:
926 continue
927
928 # Because we're doing down-cast of down-cast, the types always have
929 # to match between the two casts
930 for x in ['i', 'u']:
931 x2xN = '{0}2{0}{1}'.format(x, N)
932 x2xM = '{0}2{0}{1}'.format(x, M)
933 aP = 'a@{0}'.format(P)
934 optimizations.append(((x2xN, (x2xM, aP)), (x2xN, a)))
935 else:
936 # The N == M case is handled by other optimizations
937 pass
938
939 def fexp2i(exp, bits):
940 # We assume that exp is already in the right range.
941 if bits == 16:
942 return ('i2i16', ('ishl', ('iadd', exp, 15), 10))
943 elif bits == 32:
944 return ('ishl', ('iadd', exp, 127), 23)
945 elif bits == 64:
946 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp, 1023), 20))
947 else:
948 assert False
949
950 def ldexp(f, exp, bits):
951 # First, we clamp exp to a reasonable range. The maximum possible range
952 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
953 # a maximum range of [-149, 127]. This means that we can potentially have
954 # a swing of +-276. If you start with FLT_MAX, you actually have to do
955 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
956 # spec, on the other hand, only requires that we handle an exponent value
957 # in the range [-126, 128]. This implementation is *mostly* correct; it
958 # handles a range on exp of [-252, 254] which allows you to create any
959 # value (including denorms if the hardware supports it) and to adjust the
960 # exponent of any normal value to anything you want.
961 if bits == 16:
962 exp = ('imin', ('imax', exp, -28), 30)
963 elif bits == 32:
964 exp = ('imin', ('imax', exp, -252), 254)
965 elif bits == 64:
966 exp = ('imin', ('imax', exp, -2044), 2046)
967 else:
968 assert False
969
970 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
971 # (We use ishr which isn't the same for -1, but the -1 case still works
972 # since we use exp-exp/2 as the second exponent.) While the spec
973 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
974 # work with denormals and doesn't allow for the full swing in exponents
975 # that you can get with normalized values. Instead, we create two powers
976 # of two and multiply by them each in turn. That way the effective range
977 # of our exponent is doubled.
978 pow2_1 = fexp2i(('ishr', exp, 1), bits)
979 pow2_2 = fexp2i(('isub', exp, ('ishr', exp, 1)), bits)
980 return ('fmul', ('fmul', f, pow2_1), pow2_2)
981
982 optimizations += [
983 (('ldexp@16', 'x', 'exp'), ldexp('x', 'exp', 16), 'options->lower_ldexp'),
984 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
985 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
986 ]
987
988 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
989 def bitfield_reverse(u):
990 step1 = ('ior', ('ishl', u, 16), ('ushr', u, 16))
991 step2 = ('ior', ('ishl', ('iand', step1, 0x00ff00ff), 8), ('ushr', ('iand', step1, 0xff00ff00), 8))
992 step3 = ('ior', ('ishl', ('iand', step2, 0x0f0f0f0f), 4), ('ushr', ('iand', step2, 0xf0f0f0f0), 4))
993 step4 = ('ior', ('ishl', ('iand', step3, 0x33333333), 2), ('ushr', ('iand', step3, 0xcccccccc), 2))
994 step5 = ('ior', ('ishl', ('iand', step4, 0x55555555), 1), ('ushr', ('iand', step4, 0xaaaaaaaa), 1))
995
996 return step5
997
998 optimizations += [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
999
1000 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
1001 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
1002 # and, if a is a NaN then the second comparison will fail anyway.
1003 for op in ['flt', 'fge', 'feq']:
1004 optimizations += [
1005 (('iand', ('feq', a, a), (op, a, b)), (op, a, b)),
1006 (('iand', ('feq', a, a), (op, b, a)), (op, b, a)),
1007 ]
1008
1009 # Add optimizations to handle the case where the result of a ternary is
1010 # compared to a constant. This way we can take things like
1011 #
1012 # (a ? 0 : 1) > 0
1013 #
1014 # and turn it into
1015 #
1016 # a ? (0 > 0) : (1 > 0)
1017 #
1018 # which constant folding will eat for lunch. The resulting ternary will
1019 # further get cleaned up by the boolean reductions above and we will be
1020 # left with just the original variable "a".
1021 for op in ['flt', 'fge', 'feq', 'fne',
1022 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
1023 optimizations += [
1024 ((op, ('bcsel', 'a', '#b', '#c'), '#d'),
1025 ('bcsel', 'a', (op, 'b', 'd'), (op, 'c', 'd'))),
1026 ((op, '#d', ('bcsel', a, '#b', '#c')),
1027 ('bcsel', 'a', (op, 'd', 'b'), (op, 'd', 'c'))),
1028 ]
1029
1030
1031 # For example, this converts things like
1032 #
1033 # 1 + mix(0, a - 1, condition)
1034 #
1035 # into
1036 #
1037 # mix(1, (a-1)+1, condition)
1038 #
1039 # Other optimizations will rearrange the constants.
1040 for op in ['fadd', 'fmul', 'iadd', 'imul']:
1041 optimizations += [
1042 ((op, ('bcsel(is_used_once)', a, '#b', c), '#d'), ('bcsel', a, (op, b, d), (op, c, d)))
1043 ]
1044
1045 # For derivatives in compute shaders, GLSL_NV_compute_shader_derivatives
1046 # states:
1047 #
1048 # If neither layout qualifier is specified, derivatives in compute shaders
1049 # return zero, which is consistent with the handling of built-in texture
1050 # functions like texture() in GLSL 4.50 compute shaders.
1051 for op in ['fddx', 'fddx_fine', 'fddx_coarse',
1052 'fddy', 'fddy_fine', 'fddy_coarse']:
1053 optimizations += [
1054 ((op, 'a'), 0.0, 'info->stage == MESA_SHADER_COMPUTE && info->cs.derivative_group == DERIVATIVE_GROUP_NONE')
1055 ]
1056
1057 # This section contains "late" optimizations that should be run before
1058 # creating ffmas and calling regular optimizations for the final time.
1059 # Optimizations should go here if they help code generation and conflict
1060 # with the regular optimizations.
1061 before_ffma_optimizations = [
1062 # Propagate constants down multiplication chains
1063 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a, c), b)),
1064 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a, c), b)),
1065 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a, c), b)),
1066 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a, c), b)),
1067
1068 (('~fadd', ('fmul', a, b), ('fmul', a, c)), ('fmul', a, ('fadd', b, c))),
1069 (('iadd', ('imul', a, b), ('imul', a, c)), ('imul', a, ('iadd', b, c))),
1070 (('~fadd', ('fneg', a), a), 0.0),
1071 (('iadd', ('ineg', a), a), 0),
1072 (('iadd', ('ineg', a), ('iadd', a, b)), b),
1073 (('iadd', a, ('iadd', ('ineg', a), b)), b),
1074 (('~fadd', ('fneg', a), ('fadd', a, b)), b),
1075 (('~fadd', a, ('fadd', ('fneg', a), b)), b),
1076
1077 (('~flrp@32', ('fadd(is_used_once)', a, -1.0), ('fadd(is_used_once)', a, 1.0), d), ('fadd', ('flrp', -1.0, 1.0, d), a)),
1078 (('~flrp@32', ('fadd(is_used_once)', a, 1.0), ('fadd(is_used_once)', a, -1.0), d), ('fadd', ('flrp', 1.0, -1.0, d), a)),
1079 (('~flrp@32', ('fadd(is_used_once)', a, '#b'), ('fadd(is_used_once)', a, '#c'), d), ('fadd', ('fmul', d, ('fadd', c, ('fneg', b))), ('fadd', a, b))),
1080 ]
1081
1082 # This section contains "late" optimizations that should be run after the
1083 # regular optimizations have finished. Optimizations should go here if
1084 # they help code generation but do not necessarily produce code that is
1085 # more easily optimizable.
1086 late_optimizations = [
1087 # Most of these optimizations aren't quite safe when you get infinity or
1088 # Nan involved but the first one should be fine.
1089 (('flt', ('fadd', a, b), 0.0), ('flt', a, ('fneg', b))),
1090 (('flt', ('fneg', ('fadd', a, b)), 0.0), ('flt', ('fneg', a), b)),
1091 (('~fge', ('fadd', a, b), 0.0), ('fge', a, ('fneg', b))),
1092 (('~fge', ('fneg', ('fadd', a, b)), 0.0), ('fge', ('fneg', a), b)),
1093 (('~feq', ('fadd', a, b), 0.0), ('feq', a, ('fneg', b))),
1094 (('~fne', ('fadd', a, b), 0.0), ('fne', a, ('fneg', b))),
1095
1096 (('~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)))),
1097
1098 (('fdot2', a, b), ('fdot_replicated2', a, b), 'options->fdot_replicates'),
1099 (('fdot3', a, b), ('fdot_replicated3', a, b), 'options->fdot_replicates'),
1100 (('fdot4', a, b), ('fdot_replicated4', a, b), 'options->fdot_replicates'),
1101 (('fdph', a, b), ('fdph_replicated', a, b), 'options->fdot_replicates'),
1102
1103 (('~flrp@32', ('fadd(is_used_once)', a, b), ('fadd(is_used_once)', a, c), d), ('fadd', ('flrp', b, c, d), a)),
1104 (('~flrp@64', ('fadd(is_used_once)', a, b), ('fadd(is_used_once)', a, c), d), ('fadd', ('flrp', b, c, d), a)),
1105
1106 (('b2f(is_used_more_than_once)', ('inot', 'a@1')), ('bcsel', a, 0.0, 1.0)),
1107 (('fneg(is_used_more_than_once)', ('b2f', ('inot', 'a@1'))), ('bcsel', a, -0.0, -1.0)),
1108
1109 (('~fadd@32', 1.0, ('fmul(is_used_once)', c , ('fadd', b, -1.0 ))), ('fadd', ('fadd', 1.0, ('fneg', c)), ('fmul', b, c)), 'options->lower_flrp32'),
1110 (('~fadd@64', 1.0, ('fmul(is_used_once)', c , ('fadd', b, -1.0 ))), ('fadd', ('fadd', 1.0, ('fneg', c)), ('fmul', b, c)), 'options->lower_flrp64'),
1111
1112 # we do these late so that we don't get in the way of creating ffmas
1113 (('fmin', ('fadd(is_used_once)', '#c', a), ('fadd(is_used_once)', '#c', b)), ('fadd', c, ('fmin', a, b))),
1114 (('fmax', ('fadd(is_used_once)', '#c', a), ('fadd(is_used_once)', '#c', b)), ('fadd', c, ('fmax', a, b))),
1115
1116 (('bcsel', a, 0, ('b2f32', ('inot', 'b@bool'))), ('b2f32', ('inot', ('ior', a, b)))),
1117 ]
1118
1119 print(nir_algebraic.AlgebraicPass("nir_opt_algebraic", optimizations).render())
1120 print(nir_algebraic.AlgebraicPass("nir_opt_algebraic_before_ffma",
1121 before_ffma_optimizations).render())
1122 print(nir_algebraic.AlgebraicPass("nir_opt_algebraic_late",
1123 late_optimizations).render())