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)
29 # Convenience variables
35 # Written in the form (<search>, <replace>) where <search> is an expression
36 # and <replace> is either an expression or a value. An expression is
37 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
38 # where each source is either an expression or a value. A value can be
39 # either a numeric constant or a string representing a variable name.
41 # If the opcode in a search expression is prefixed by a '~' character, this
42 # indicates that the operation is inexact. Such operations will only get
43 # applied to SSA values that do not have the exact bit set. This should be
44 # used by by any optimizations that are not bit-for-bit exact. It should not,
45 # however, be used for backend-requested lowering operations as those need to
46 # happen regardless of precision.
48 # Variable names are specified as "[#]name[@type][(cond)]" where "#" inicates
49 # that the given variable will only match constants and the type indicates that
50 # the given variable will only match values from ALU instructions with the
51 # given output type, and (cond) specifies an additional condition function
52 # (see nir_search_helpers.h).
54 # For constants, you have to be careful to make sure that it is the right
55 # type because python is unaware of the source and destination types of the
58 # All expression types can have a bit-size specified. For opcodes, this
59 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
60 # type and size, and for literals, you can write "2.0@32". In the search half
61 # of the expression this indicates that it should only match that particular
62 # bit-size. In the replace half of the expression this indicates that the
63 # constructed value should have that bit-size.
67 (('imul', a
, '#b@32(is_pos_power_of_two)'), ('ishl', a
, ('find_lsb', b
))),
68 (('imul', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a
, ('find_lsb', ('iabs', b
))))),
73 (('udiv', a
, '#b@32(is_pos_power_of_two)'), ('ushr', a
, ('find_lsb', b
))),
74 (('idiv', a
, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', b
))), 'options->lower_idiv'),
75 (('idiv', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', ('iabs', b
))))), 'options->lower_idiv'),
76 (('umod', a
, '#b(is_pos_power_of_two)'), ('iand', a
, ('isub', b
, 1))),
78 (('fneg', ('fneg', a
)), a
),
79 (('ineg', ('ineg', a
)), a
),
80 (('fabs', ('fabs', a
)), ('fabs', a
)),
81 (('fabs', ('fneg', a
)), ('fabs', a
)),
82 (('fabs', ('u2f32', a
)), ('u2f32', a
)),
83 (('iabs', ('iabs', a
)), ('iabs', a
)),
84 (('iabs', ('ineg', a
)), ('iabs', a
)),
85 (('~fadd', a
, 0.0), a
),
87 (('usadd_4x8', a
, 0), a
),
88 (('usadd_4x8', a
, ~
0), ~
0),
89 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
90 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
91 (('~fadd', ('fneg', a
), a
), 0.0),
92 (('iadd', ('ineg', a
), a
), 0),
93 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
94 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
95 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
96 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
97 (('~fmul', a
, 0.0), 0.0),
99 (('umul_unorm_4x8', a
, 0), 0),
100 (('umul_unorm_4x8', a
, ~
0), a
),
101 (('fmul', a
, 1.0), a
),
103 (('fmul', a
, -1.0), ('fneg', a
)),
104 (('imul', a
, -1), ('ineg', a
)),
105 (('~ffma', 0.0, a
, b
), b
),
106 (('~ffma', a
, 0.0, b
), b
),
107 (('~ffma', a
, b
, 0.0), ('fmul', a
, b
)),
108 (('ffma', a
, 1.0, b
), ('fadd', a
, b
)),
109 (('ffma', 1.0, a
, b
), ('fadd', a
, b
)),
110 (('~flrp', a
, b
, 0.0), a
),
111 (('~flrp', a
, b
, 1.0), b
),
112 (('~flrp', a
, a
, b
), a
),
113 (('~flrp', 0.0, a
, b
), ('fmul', a
, b
)),
114 (('~flrp', a
, b
, ('b2f', c
)), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
115 (('~flrp', a
, 0.0, c
), ('fadd', ('fmul', ('fneg', a
), c
), a
)),
116 (('flrp@32', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp32'),
117 (('flrp@64', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp64'),
118 (('ffract', a
), ('fsub', a
, ('ffloor', a
)), 'options->lower_ffract'),
119 (('~fadd', ('fmul', a
, ('fadd', 1.0, ('fneg', ('b2f', c
)))), ('fmul', b
, ('b2f', c
))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
120 (('~fadd@32', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
121 (('~fadd@64', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
122 (('~fadd', a
, ('fmul', ('b2f', c
), ('fadd', b
, ('fneg', a
)))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
123 (('~fadd@32', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
124 (('~fadd@64', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
125 (('ffma', a
, b
, c
), ('fadd', ('fmul', a
, b
), c
), 'options->lower_ffma'),
126 (('~fadd', ('fmul', a
, b
), c
), ('ffma', a
, b
, c
), 'options->fuse_ffma'),
128 (('fdot4', ('vec4', a
, b
, c
, 1.0), d
), ('fdph', ('vec3', a
, b
, c
), d
)),
129 (('fdot4', ('vec4', a
, 0.0, 0.0, 0.0), b
), ('fmul', a
, b
)),
130 (('fdot4', ('vec4', a
, b
, 0.0, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
131 (('fdot4', ('vec4', a
, b
, c
, 0.0), d
), ('fdot3', ('vec3', a
, b
, c
), d
)),
133 (('fdot3', ('vec3', a
, 0.0, 0.0), b
), ('fmul', a
, b
)),
134 (('fdot3', ('vec3', a
, b
, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
136 # (a * #b + #c) << #d
137 # ((a * #b) << #d) + (#c << #d)
138 # (a * (#b << #d)) + (#c << #d)
139 (('ishl', ('iadd', ('imul', a
, '#b'), '#c'), '#d'),
140 ('iadd', ('imul', a
, ('ishl', b
, d
)), ('ishl', c
, d
))),
144 (('ishl', ('imul', a
, '#b'), '#c'), ('imul', a
, ('ishl', b
, c
))),
146 # Comparison simplifications
147 (('~inot', ('flt', a
, b
)), ('fge', a
, b
)),
148 (('~inot', ('fge', a
, b
)), ('flt', a
, b
)),
149 (('~inot', ('feq', a
, b
)), ('fne', a
, b
)),
150 (('~inot', ('fne', a
, b
)), ('feq', a
, b
)),
151 (('inot', ('ilt', a
, b
)), ('ige', a
, b
)),
152 (('inot', ('ige', a
, b
)), ('ilt', a
, b
)),
153 (('inot', ('ieq', a
, b
)), ('ine', a
, b
)),
154 (('inot', ('ine', a
, b
)), ('ieq', a
, b
)),
158 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
160 (('fge', 0.0, ('b2f', a
)), ('inot', a
)),
162 (('fge', ('fneg', ('b2f', a
)), 0.0), ('inot', a
)),
164 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
165 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
166 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
167 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
169 # Cannot remove the addition from ilt or ige due to overflow.
170 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
171 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
173 # fmin(-b2f(a), b) >= 0.0
174 # -b2f(a) >= 0.0 && b >= 0.0
175 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
176 # b2f(a) == 0.0 && b >= 0.0
177 # a == False && b >= 0.0
180 # The fge in the second replacement is not a typo. I leave the proof that
181 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
183 (('fge', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
184 (('feq', ('fmin', ('fneg', ('b2f', a
)), b
), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
188 # fabs(a) != 0.0 because fabs(a) must be >= 0
190 (('flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
192 (('fmax', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('ior', a
, b
))),
193 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('ior', a
, b
)))),
194 (('fmin', ('b2f(is_used_once)', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
195 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', a
)), ('fneg', ('b2f', b
))), ('fneg', ('b2f', ('iand', a
, b
)))),
198 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
199 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
200 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
202 # Since b is a constant, constant folding will eliminate the fmin and the
203 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
204 (('fmin', ('b2f', a
), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
206 # ignore this opt when the result is used by a bcsel or if so we can make
207 # use of conditional modifiers on supported hardware.
208 (('flt(is_not_used_by_conditional)', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
210 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
211 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
212 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
213 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
214 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
215 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
216 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
217 (('bcsel', a
, True, 'b@bool'), ('ior', a
, b
)),
224 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
225 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
226 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
227 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
228 (('fmin', a
, ('fabs', a
)), a
),
229 (('imin', a
, ('iabs', a
)), a
),
230 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
231 (('imax', a
, ('ineg', ('iabs', a
))), a
),
232 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
233 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
234 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
235 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
236 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
237 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
238 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
239 (('fsat', ('fsat', a
)), ('fsat', a
)),
240 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
241 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
242 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
243 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
244 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
245 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
246 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
247 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
248 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
249 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
250 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
251 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
252 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
253 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
254 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
255 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
256 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
257 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
258 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
259 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
260 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
261 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
263 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
264 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
265 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
266 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
267 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
268 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
269 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
270 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
271 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
272 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
273 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
274 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
275 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
276 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
277 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
278 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
280 # These patterns can result when (a < b || a < c) => (a < min(b, c))
281 # transformations occur before constant propagation and loop-unrolling.
282 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
283 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
284 (('~fge', a
, ('fmin', b
, a
)), True),
285 (('~fge', ('fmax', a
, b
), a
), True),
286 (('~flt', a
, ('fmin', b
, a
)), False),
287 (('~flt', ('fmax', a
, b
), a
), False),
289 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
290 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
291 (('ige', a
, ('imin', b
, a
)), True),
292 (('ige', ('imax', a
, b
), a
), True),
293 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
294 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
295 (('uge', a
, ('umin', b
, a
)), True),
296 (('uge', ('umax', a
, b
), a
), True),
298 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
299 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
300 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
301 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
302 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
303 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
304 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
305 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
307 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
308 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
309 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
310 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
311 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
312 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
313 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
314 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
315 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
316 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
318 (('imul', ('b2i', a
), ('b2i', b
)), ('b2i', ('iand', a
, b
))),
319 (('fmul', ('b2f', a
), ('b2f', b
)), ('b2f', ('iand', a
, b
))),
320 (('fsat', ('fadd', ('b2f', a
), ('b2f', b
))), ('b2f', ('ior', a
, b
))),
321 (('iand', 'a@bool', 1.0), ('b2f', a
)),
322 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
323 (('ineg', ('b2i@32', a
)), a
),
324 (('flt', ('fneg', ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
325 (('flt', ('fsub', 0.0, ('b2f', a
)), 0), a
), # Generated by TGSI KILL_IF.
326 # Comparison with the same args. Note that these are not done for
327 # the float versions because NaN always returns false on float
329 (('ilt', a
, a
), False),
330 (('ige', a
, a
), True),
331 (('ieq', a
, a
), True),
332 (('ine', a
, a
), False),
333 (('ult', a
, a
), False),
334 (('uge', a
, a
), True),
335 # Logical and bit operations
336 (('fand', a
, 0.0), 0.0),
338 (('iand', a
, ~
0), a
),
342 (('ior', a
, True), True),
343 (('fxor', a
, a
), 0.0),
346 (('inot', ('inot', a
)), a
),
348 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
349 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
350 # Shift optimizations
357 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
358 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
359 # Exponential/logarithmic identities
360 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
361 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
362 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
363 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
364 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
365 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
366 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
367 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
368 (('~fpow', a
, 1.0), a
),
369 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
370 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
371 (('~fpow', 2.0, a
), ('fexp2', a
)),
372 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
373 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
374 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
375 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
376 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
377 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
378 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
379 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
380 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
381 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
382 # Division and reciprocal
383 (('~fdiv', 1.0, a
), ('frcp', a
)),
384 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
385 (('~frcp', ('frcp', a
)), a
),
386 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
387 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
388 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
389 # Boolean simplifications
390 (('ieq', 'a@bool', True), a
),
391 (('ine(is_not_used_by_if)', 'a@bool', True), ('inot', a
)),
392 (('ine', 'a@bool', False), a
),
393 (('ieq(is_not_used_by_if)', 'a@bool', False), ('inot', 'a')),
394 (('bcsel', a
, True, False), a
),
395 (('bcsel', a
, False, True), ('inot', a
)),
396 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
397 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
398 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
399 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
400 (('bcsel', True, b
, c
), b
),
401 (('bcsel', False, b
, c
), c
),
402 (('bcsel', a
, ('b2f(is_used_once)', b
), ('b2f', c
)), ('b2f', ('bcsel', a
, b
, c
))),
403 # The result of this should be hit by constant propagation and, in the
404 # next round of opt_algebraic, get picked up by one of the above two.
405 (('bcsel', '#a', b
, c
), ('bcsel', ('ine', 'a', 0), b
, c
)),
407 (('bcsel', a
, b
, b
), b
),
408 (('fcsel', a
, b
, b
), b
),
411 (('i2b', ('b2i', a
)), a
),
412 (('i2b', 'a@bool'), a
),
413 (('f2i32', ('ftrunc', a
)), ('f2i32', a
)),
414 (('f2u32', ('ftrunc', a
)), ('f2u32', a
)),
415 (('i2b', ('ineg', a
)), ('i2b', a
)),
416 (('i2b', ('iabs', a
)), ('i2b', a
)),
417 (('fabs', ('b2f', a
)), ('b2f', a
)),
418 (('iabs', ('b2i', a
)), ('b2i', a
)),
420 # Packing and then unpacking does nothing
421 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
422 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
423 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
424 ('unpack_64_2x32_split_y', a
)), a
),
427 (('ushr', a
, 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
428 (('iand', 0xff, ('ushr', a
, 16)), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
429 (('iand', 0xff, ('ushr', a
, 8)), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
430 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
433 (('ushr', a
, 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
434 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
437 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
438 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
439 (('ussub_4x8', a
, 0), a
),
440 (('ussub_4x8', a
, ~
0), 0),
441 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
442 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
443 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
444 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
445 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
446 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
447 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
448 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
450 # Propagate negation up multiplication chains
451 (('fmul', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
452 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
454 # Propagate constants up multiplication chains
455 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
456 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
457 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
458 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
460 # Reassociate constants in add/mul chains so they can be folded together.
461 # For now, we mostly only handle cases where the constants are separated by
462 # a single non-constant. We could do better eventually.
463 (('~fmul', '#a', ('fmul', b
, '#c')), ('fmul', ('fmul', a
, c
), b
)),
464 (('imul', '#a', ('imul', b
, '#c')), ('imul', ('imul', a
, c
), b
)),
465 (('~fadd', '#a', ('fadd', b
, '#c')), ('fadd', ('fadd', a
, c
), b
)),
466 (('~fadd', '#a', ('fneg', ('fadd', b
, '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
467 (('iadd', '#a', ('iadd', b
, '#c')), ('iadd', ('iadd', a
, c
), b
)),
470 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
471 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
472 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
474 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
475 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
476 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
478 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
481 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
482 (('fmod@64', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod64'),
483 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
484 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
485 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
487 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
488 ('bcsel', ('ilt', 31, 'bits'), 'insert',
489 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
490 'options->lower_bitfield_insert'),
492 (('ibitfield_extract', 'value', 'offset', 'bits'),
493 ('bcsel', ('ilt', 31, 'bits'), 'value',
494 ('ibfe', 'value', 'offset', 'bits')),
495 'options->lower_bitfield_extract'),
497 (('ubitfield_extract', 'value', 'offset', 'bits'),
498 ('bcsel', ('ult', 31, 'bits'), 'value',
499 ('ubfe', 'value', 'offset', 'bits')),
500 'options->lower_bitfield_extract'),
502 (('extract_i8', a
, 'b@32'),
503 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
504 'options->lower_extract_byte'),
506 (('extract_u8', a
, 'b@32'),
507 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
508 'options->lower_extract_byte'),
510 (('extract_i16', a
, 'b@32'),
511 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
512 'options->lower_extract_word'),
514 (('extract_u16', a
, 'b@32'),
515 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
516 'options->lower_extract_word'),
518 (('pack_unorm_2x16', 'v'),
519 ('pack_uvec2_to_uint',
520 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
521 'options->lower_pack_unorm_2x16'),
523 (('pack_unorm_4x8', 'v'),
524 ('pack_uvec4_to_uint',
525 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
526 'options->lower_pack_unorm_4x8'),
528 (('pack_snorm_2x16', 'v'),
529 ('pack_uvec2_to_uint',
530 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
531 'options->lower_pack_snorm_2x16'),
533 (('pack_snorm_4x8', 'v'),
534 ('pack_uvec4_to_uint',
535 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
536 'options->lower_pack_snorm_4x8'),
538 (('unpack_unorm_2x16', 'v'),
539 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
540 ('extract_u16', 'v', 1))),
542 'options->lower_unpack_unorm_2x16'),
544 (('unpack_unorm_4x8', 'v'),
545 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
546 ('extract_u8', 'v', 1),
547 ('extract_u8', 'v', 2),
548 ('extract_u8', 'v', 3))),
550 'options->lower_unpack_unorm_4x8'),
552 (('unpack_snorm_2x16', 'v'),
553 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec2', ('extract_i16', 'v', 0),
554 ('extract_i16', 'v', 1))),
556 'options->lower_unpack_snorm_2x16'),
558 (('unpack_snorm_4x8', 'v'),
559 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f32', ('vec4', ('extract_i8', 'v', 0),
560 ('extract_i8', 'v', 1),
561 ('extract_i8', 'v', 2),
562 ('extract_i8', 'v', 3))),
564 'options->lower_unpack_snorm_4x8'),
567 invert
= {'feq': 'fne', 'fne': 'feq', 'fge': 'flt', 'flt': 'fge' }
569 for left
, right
in list(itertools
.combinations(invert
.keys(), 2)) + zip(invert
.keys(), invert
.keys()):
570 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
571 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
572 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
573 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
575 def fexp2i(exp
, bits
):
576 # We assume that exp is already in the right range.
578 return ('ishl', ('iadd', exp
, 127), 23)
580 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
584 def ldexp(f
, exp
, bits
):
585 # First, we clamp exp to a reasonable range. The maximum possible range
586 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
587 # a maximum range of [-149, 127]. This means that we can potentially have
588 # a swing of +-276. If you start with FLT_MAX, you actually have to do
589 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
590 # spec, on the other hand, only requires that we handle an exponent value
591 # in the range [-126, 128]. This implementation is *mostly* correct; it
592 # handles a range on exp of [-252, 254] which allows you to create any
593 # value (including denorms if the hardware supports it) and to adjust the
594 # exponent of any normal value to anything you want.
596 exp
= ('imin', ('imax', exp
, -252), 254)
598 exp
= ('imin', ('imax', exp
, -2044), 2046)
602 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
603 # (We use ishr which isn't the same for -1, but the -1 case still works
604 # since we use exp-exp/2 as the second exponent.) While the spec
605 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
606 # work with denormals and doesn't allow for the full swing in exponents
607 # that you can get with normalized values. Instead, we create two powers
608 # of two and multiply by them each in turn. That way the effective range
609 # of our exponent is doubled.
610 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
611 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
612 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
615 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
616 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
619 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
620 def bitfield_reverse(u
):
621 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
622 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
623 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
624 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
625 step5
= ('ior', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
629 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
631 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
632 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
633 # and, if a is a NaN then the second comparison will fail anyway.
634 for op
in ['flt', 'fge', 'feq']:
636 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
637 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
640 # Add optimizations to handle the case where the result of a ternary is
641 # compared to a constant. This way we can take things like
647 # a ? (0 > 0) : (1 > 0)
649 # which constant folding will eat for lunch. The resulting ternary will
650 # further get cleaned up by the boolean reductions above and we will be
651 # left with just the original variable "a".
652 for op
in ['flt', 'fge', 'feq', 'fne',
653 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
655 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
656 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
657 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
658 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
662 # For example, this converts things like
664 # 1 + mix(0, a - 1, condition)
668 # mix(1, (a-1)+1, condition)
670 # Other optimizations will rearrange the constants.
671 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
673 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
676 # This section contains "late" optimizations that should be run before
677 # creating ffmas and calling regular optimizations for the final time.
678 # Optimizations should go here if they help code generation and conflict
679 # with the regular optimizations.
680 before_ffma_optimizations
= [
681 # Propagate constants down multiplication chains
682 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
683 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
684 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
685 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
687 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
688 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
689 (('~fadd', ('fneg', a
), a
), 0.0),
690 (('iadd', ('ineg', a
), a
), 0),
691 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
692 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
693 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
694 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
697 # This section contains "late" optimizations that should be run after the
698 # regular optimizations have finished. Optimizations should go here if
699 # they help code generation but do not necessarily produce code that is
700 # more easily optimizable.
701 late_optimizations
= [
702 # Most of these optimizations aren't quite safe when you get infinity or
703 # Nan involved but the first one should be fine.
704 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
705 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
706 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
707 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
708 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
709 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
711 (('~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
)))),
713 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
714 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
715 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
716 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
718 (('b2f(is_used_more_than_once)', ('inot', a
)), ('bcsel', a
, 0.0, 1.0)),
719 (('fneg(is_used_more_than_once)', ('b2f', ('inot', a
))), ('bcsel', a
, -0.0, -1.0)),
721 # we do these late so that we don't get in the way of creating ffmas
722 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
723 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
726 print nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render()
727 print nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
728 before_ffma_optimizations
).render()
729 print nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
730 late_optimizations
).render()
projects / mesa.git / blob