2 # Copyright (C) 2014 Intel Corporation
4 # Permission is hereby granted, free of charge, to any person obtaining a
5 # copy of this software and associated documentation files (the "Software"),
6 # to deal in the Software without restriction, including without limitation
7 # the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 # and/or sell copies of the Software, and to permit persons to whom the
9 # Software is furnished to do so, subject to the following conditions:
11 # The above copyright notice and this permission notice (including the next
12 # paragraph) shall be included in all copies or substantial portions of the
15 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 # Jason Ekstrand (jason@jlekstrand.net)
26 from __future__
import print_function
28 from collections
import OrderedDict
30 from nir_opcodes
import type_sizes
34 # Convenience variables
41 # Written in the form (<search>, <replace>) where <search> is an expression
42 # and <replace> is either an expression or a value. An expression is
43 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
44 # where each source is either an expression or a value. A value can be
45 # either a numeric constant or a string representing a variable name.
47 # If the opcode in a search expression is prefixed by a '~' character, this
48 # indicates that the operation is inexact. Such operations will only get
49 # applied to SSA values that do not have the exact bit set. This should be
50 # used by by any optimizations that are not bit-for-bit exact. It should not,
51 # however, be used for backend-requested lowering operations as those need to
52 # happen regardless of precision.
54 # Variable names are specified as "[#]name[@type][(cond)][.swiz]" where:
55 # "#" indicates that the given variable will only match constants,
56 # type indicates that the given variable will only match values from ALU
57 # instructions with the given output type,
58 # (cond) specifies an additional condition function (see nir_search_helpers.h),
59 # swiz is a swizzle applied to the variable (only in the <replace> expression)
61 # For constants, you have to be careful to make sure that it is the right
62 # type because python is unaware of the source and destination types of the
65 # All expression types can have a bit-size specified. For opcodes, this
66 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
67 # type and size. In the search half of the expression this indicates that it
68 # should only match that particular bit-size. In the replace half of the
69 # expression this indicates that the constructed value should have that
72 # A special condition "many-comm-expr" can be used with expressions to note
73 # that the expression and its subexpressions have more commutative expressions
74 # than nir_replace_instr can handle. If this special condition is needed with
75 # another condition, the two can be separated by a comma (e.g.,
76 # "(many-comm-expr,is_used_once)").
78 # based on https://web.archive.org/web/20180105155939/http://forum.devmaster.net/t/fast-and-accurate-sine-cosine/9648
79 def lowered_sincos(c
):
80 x
= ('fsub', ('fmul', 2.0, ('ffract', ('fadd', ('fmul', 0.5 / pi
, a
), c
))), 1.0)
81 x
= ('fmul', ('fsub', x
, ('fmul', x
, ('fabs', x
))), 4.0)
82 return ('ffma', ('ffma', x
, ('fabs', x
), ('fneg', x
)), 0.225, x
)
86 (('imul', a
, '#b@32(is_pos_power_of_two)'), ('ishl', a
, ('find_lsb', b
)), '!options->lower_bitops'),
87 (('imul', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a
, ('find_lsb', ('iabs', b
)))), '!options->lower_bitops'),
88 (('ishl', a
, '#b@32'), ('imul', a
, ('ishl', 1, b
)), 'options->lower_bitops'),
90 (('unpack_64_2x32_split_x', ('imul_2x32_64(is_used_once)', a
, b
)), ('imul', a
, b
)),
91 (('unpack_64_2x32_split_x', ('umul_2x32_64(is_used_once)', a
, b
)), ('imul', a
, b
)),
92 (('imul_2x32_64', a
, b
), ('pack_64_2x32_split', ('imul', a
, b
), ('imul_high', a
, b
)), 'options->lower_mul_2x32_64'),
93 (('umul_2x32_64', a
, b
), ('pack_64_2x32_split', ('imul', a
, b
), ('umul_high', a
, b
)), 'options->lower_mul_2x32_64'),
98 (('udiv', a
, '#b@32(is_pos_power_of_two)'), ('ushr', a
, ('find_lsb', b
)), '!options->lower_bitops'),
99 (('idiv', a
, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', b
))), 'options->lower_idiv'),
100 (('idiv', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', ('iabs', b
))))), 'options->lower_idiv'),
101 (('umod', a
, '#b(is_pos_power_of_two)'), ('iand', a
, ('isub', b
, 1))),
103 (('fneg', ('fneg', a
)), a
),
104 (('ineg', ('ineg', a
)), a
),
105 (('fabs', ('fabs', a
)), ('fabs', a
)),
106 (('fabs', ('fneg', a
)), ('fabs', a
)),
107 (('fabs', ('u2f', a
)), ('u2f', a
)),
108 (('iabs', ('iabs', a
)), ('iabs', a
)),
109 (('iabs', ('ineg', a
)), ('iabs', a
)),
110 (('f2b', ('fneg', a
)), ('f2b', a
)),
111 (('i2b', ('ineg', a
)), ('i2b', a
)),
112 (('~fadd', a
, 0.0), a
),
114 (('usadd_4x8', a
, 0), a
),
115 (('usadd_4x8', a
, ~
0), ~
0),
116 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
117 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
118 (('~fadd', ('fneg', a
), a
), 0.0),
119 (('iadd', ('ineg', a
), a
), 0),
120 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
121 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
122 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
123 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
124 (('fadd', ('fsat', a
), ('fsat', ('fneg', a
))), ('fsat', ('fabs', a
))),
125 (('~fmul', a
, 0.0), 0.0),
127 (('umul_unorm_4x8', a
, 0), 0),
128 (('umul_unorm_4x8', a
, ~
0), a
),
129 (('fmul', a
, 1.0), a
),
131 (('fmul', a
, -1.0), ('fneg', a
)),
132 (('imul', a
, -1), ('ineg', a
)),
133 # If a < 0: fsign(a)*a*a => -1*a*a => -a*a => abs(a)*a
134 # If a > 0: fsign(a)*a*a => 1*a*a => a*a => abs(a)*a
135 # If a == 0: fsign(a)*a*a => 0*0*0 => abs(0)*0
136 (('fmul', ('fsign', a
), ('fmul', a
, a
)), ('fmul', ('fabs', a
), a
)),
137 (('fmul', ('fmul', ('fsign', a
), a
), a
), ('fmul', ('fabs', a
), a
)),
138 (('~ffma', 0.0, a
, b
), b
),
139 (('~ffma', a
, b
, 0.0), ('fmul', a
, b
)),
140 (('ffma', 1.0, a
, b
), ('fadd', a
, b
)),
141 (('ffma', -1.0, a
, b
), ('fadd', ('fneg', a
), b
)),
142 (('~flrp', a
, b
, 0.0), a
),
143 (('~flrp', a
, b
, 1.0), b
),
144 (('~flrp', a
, a
, b
), a
),
145 (('~flrp', 0.0, a
, b
), ('fmul', a
, b
)),
147 # flrp(a, a + b, c) => a + flrp(0, b, c) => a + (b * c)
148 (('~flrp', a
, ('fadd(is_used_once)', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
)),
149 (('~flrp@32', a
, ('fadd', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
), 'options->lower_flrp32'),
150 (('~flrp@64', a
, ('fadd', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
), 'options->lower_flrp64'),
152 (('~flrp@32', ('fadd', a
, b
), ('fadd', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
), 'options->lower_flrp32'),
153 (('~flrp@64', ('fadd', a
, b
), ('fadd', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
), 'options->lower_flrp64'),
155 (('~flrp@32', a
, ('fmul(is_used_once)', a
, b
), c
), ('fmul', ('flrp', 1.0, b
, c
), a
), 'options->lower_flrp32'),
156 (('~flrp@64', a
, ('fmul(is_used_once)', a
, b
), c
), ('fmul', ('flrp', 1.0, b
, c
), a
), 'options->lower_flrp64'),
158 (('~flrp', ('fmul(is_used_once)', a
, b
), ('fmul(is_used_once)', a
, c
), d
), ('fmul', ('flrp', b
, c
, d
), a
)),
160 (('~flrp', a
, b
, ('b2f', 'c@1')), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
161 (('~flrp', a
, 0.0, c
), ('fadd', ('fmul', ('fneg', a
), c
), a
)),
162 (('ftrunc', a
), ('bcsel', ('flt', a
, 0.0), ('fneg', ('ffloor', ('fabs', a
))), ('ffloor', ('fabs', a
))), 'options->lower_ftrunc'),
163 (('ffloor', a
), ('fsub', a
, ('ffract', a
)), 'options->lower_ffloor'),
164 (('fadd', a
, ('fneg', ('ffract', a
))), ('ffloor', a
), '!options->lower_ffloor'),
165 (('ffract', a
), ('fsub', a
, ('ffloor', a
)), 'options->lower_ffract'),
166 (('fceil', a
), ('fneg', ('ffloor', ('fneg', a
))), 'options->lower_fceil'),
167 (('~fadd', ('fmul', a
, ('fadd', 1.0, ('fneg', ('b2f', 'c@1')))), ('fmul', b
, ('b2f', c
))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
168 (('~fadd@32', ('fmul', a
, ('fadd', 1.0, ('fneg', c
) )), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
169 (('~fadd@64', ('fmul', a
, ('fadd', 1.0, ('fneg', c
) )), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
170 # These are the same as the previous three rules, but it depends on
171 # 1-fsat(x) <=> fsat(1-x). See below.
172 (('~fadd@32', ('fmul', a
, ('fsat', ('fadd', 1.0, ('fneg', c
)))), ('fmul', b
, ('fsat', c
))), ('flrp', a
, b
, ('fsat', c
)), '!options->lower_flrp32'),
173 (('~fadd@64', ('fmul', a
, ('fsat', ('fadd', 1.0, ('fneg', c
)))), ('fmul', b
, ('fsat', c
))), ('flrp', a
, b
, ('fsat', c
)), '!options->lower_flrp64'),
175 (('~fadd', a
, ('fmul', ('b2f', 'c@1'), ('fadd', b
, ('fneg', a
)))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
176 (('~fadd@32', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
177 (('~fadd@64', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
178 (('ffma', a
, b
, c
), ('fadd', ('fmul', a
, b
), c
), 'options->lower_ffma'),
179 (('~fadd', ('fmul', a
, b
), c
), ('ffma', a
, b
, c
), 'options->fuse_ffma'),
181 (('~fmul', ('fadd', ('iand', ('ineg', ('b2i32', 'a@bool')), ('fmul', b
, c
)), '#d'), '#e'),
182 ('bcsel', a
, ('fmul', ('fadd', ('fmul', b
, c
), d
), e
), ('fmul', d
, e
))),
184 (('fdph', a
, b
), ('fdot4', ('vec4', 'a.x', 'a.y', 'a.z', 1.0), b
), 'options->lower_fdph'),
186 (('fdot4', ('vec4', a
, b
, c
, 1.0), d
), ('fdph', ('vec3', a
, b
, c
), d
), '!options->lower_fdph'),
187 (('fdot4', ('vec4', a
, 0.0, 0.0, 0.0), b
), ('fmul', a
, b
)),
188 (('fdot4', ('vec4', a
, b
, 0.0, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
189 (('fdot4', ('vec4', a
, b
, c
, 0.0), d
), ('fdot3', ('vec3', a
, b
, c
), d
)),
191 (('fdot3', ('vec3', a
, 0.0, 0.0), b
), ('fmul', a
, b
)),
192 (('fdot3', ('vec3', a
, b
, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
194 (('fdot2', ('vec2', a
, 0.0), b
), ('fmul', a
, b
)),
195 (('fdot2', a
, 1.0), ('fadd', 'a.x', 'a.y')),
197 # Lower fdot to fsum when it is available
198 (('fdot2', a
, b
), ('fsum2', ('fmul', a
, b
)), 'options->lower_fdot'),
199 (('fdot3', a
, b
), ('fsum3', ('fmul', a
, b
)), 'options->lower_fdot'),
200 (('fdot4', a
, b
), ('fsum4', ('fmul', a
, b
)), 'options->lower_fdot'),
201 (('fsum2', a
), ('fadd', 'a.x', 'a.y'), 'options->lower_fdot'),
203 # If x >= 0 and x <= 1: fsat(1 - x) == 1 - fsat(x) trivially
204 # If x < 0: 1 - fsat(x) => 1 - 0 => 1 and fsat(1 - x) => fsat(> 1) => 1
205 # If x > 1: 1 - fsat(x) => 1 - 1 => 0 and fsat(1 - x) => fsat(< 0) => 0
206 (('~fadd', ('fneg(is_used_once)', ('fsat(is_used_once)', 'a(is_not_fmul)')), 1.0), ('fsat', ('fadd', 1.0, ('fneg', a
)))),
208 # 1 - ((1 - a) * (1 - b))
209 # 1 - (1 - a - b + a*b)
210 # 1 - 1 + a + b - a*b
215 (('~fadd@32', 1.0, ('fneg', ('fmul', ('fadd', 1.0, ('fneg', a
)), ('fadd', 1.0, ('fneg', b
))))),
216 ('flrp', b
, 1.0, a
), '!options->lower_flrp32'),
218 # (a * #b + #c) << #d
219 # ((a * #b) << #d) + (#c << #d)
220 # (a * (#b << #d)) + (#c << #d)
221 (('ishl', ('iadd', ('imul', a
, '#b'), '#c'), '#d'),
222 ('iadd', ('imul', a
, ('ishl', b
, d
)), ('ishl', c
, d
))),
226 (('ishl', ('imul', a
, '#b'), '#c'), ('imul', a
, ('ishl', b
, c
))),
228 # Comparison simplifications
229 (('~inot', ('flt', a
, b
)), ('fge', a
, b
)),
230 (('~inot', ('fge', a
, b
)), ('flt', a
, b
)),
231 (('inot', ('feq', a
, b
)), ('fne', a
, b
)),
232 (('inot', ('fne', a
, b
)), ('feq', a
, b
)),
233 (('inot', ('ilt', a
, b
)), ('ige', a
, b
)),
234 (('inot', ('ult', a
, b
)), ('uge', a
, b
)),
235 (('inot', ('ige', a
, b
)), ('ilt', a
, b
)),
236 (('inot', ('uge', a
, b
)), ('ult', a
, b
)),
237 (('inot', ('ieq', a
, b
)), ('ine', a
, b
)),
238 (('inot', ('ine', a
, b
)), ('ieq', a
, b
)),
240 (('iand', ('feq', a
, b
), ('fne', a
, b
)), False),
241 (('iand', ('flt', a
, b
), ('flt', b
, a
)), False),
242 (('iand', ('ieq', a
, b
), ('ine', a
, b
)), False),
243 (('iand', ('ilt', a
, b
), ('ilt', b
, a
)), False),
244 (('iand', ('ult', a
, b
), ('ult', b
, a
)), False),
246 # This helps some shaders because, after some optimizations, they end up
247 # with patterns like (-a < -b) || (b < a). In an ideal world, this sort of
248 # matching would be handled by CSE.
249 (('flt', ('fneg', a
), ('fneg', b
)), ('flt', b
, a
)),
250 (('fge', ('fneg', a
), ('fneg', b
)), ('fge', b
, a
)),
251 (('feq', ('fneg', a
), ('fneg', b
)), ('feq', b
, a
)),
252 (('fne', ('fneg', a
), ('fneg', b
)), ('fne', b
, a
)),
253 (('flt', ('fneg', a
), -1.0), ('flt', 1.0, a
)),
254 (('flt', -1.0, ('fneg', a
)), ('flt', a
, 1.0)),
255 (('fge', ('fneg', a
), -1.0), ('fge', 1.0, a
)),
256 (('fge', -1.0, ('fneg', a
)), ('fge', a
, 1.0)),
257 (('fne', ('fneg', a
), -1.0), ('fne', 1.0, a
)),
258 (('feq', -1.0, ('fneg', a
)), ('feq', a
, 1.0)),
260 (('flt', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('flt', a
, b
)),
261 (('flt', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('flt', b
, a
)),
262 (('fge', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fge', a
, b
)),
263 (('fge', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('fge', b
, a
)),
264 (('feq', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('feq', a
, b
)),
265 (('fne', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fne', a
, b
)),
267 (('fge', ('fsat(is_used_once)', a
), 1.0), ('fge', a
, 1.0)),
268 (('flt', ('fsat(is_used_once)', a
), 1.0), ('flt', a
, 1.0)),
269 (('fge', 0.0, ('fsat(is_used_once)', a
)), ('fge', 0.0, a
)),
270 (('flt', 0.0, ('fsat(is_used_once)', a
)), ('flt', 0.0, a
)),
274 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
276 (('fge', 0.0, ('b2f', 'a@1')), ('inot', a
)),
278 (('fge', ('fneg', ('b2f', 'a@1')), 0.0), ('inot', a
)),
280 (('fne', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
281 (('fne', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
282 (('fne', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('ior', a
, b
)),
283 (('fne', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('ior', a
, b
)),
284 (('fne', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
285 (('fne', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
286 (('fne', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('iand', a
, b
)),
287 (('fne', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ixor', a
, b
)),
288 (('fne', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ixor', a
, b
)),
289 (('fne', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ixor', a
, b
)),
290 (('feq', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
291 (('feq', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
292 (('feq', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('inot', ('ior', a
, b
))),
293 (('feq', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
294 (('feq', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
295 (('feq', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
296 (('feq', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('inot', ('iand', a
, b
))),
297 (('feq', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ieq', a
, b
)),
298 (('feq', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ieq', a
, b
)),
299 (('feq', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ieq', a
, b
)),
301 # -(b2f(a) + b2f(b)) < 0
302 # 0 < b2f(a) + b2f(b)
303 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
305 (('flt', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('ior', a
, b
)),
306 (('flt', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('ior', a
, b
)),
308 # -(b2f(a) + b2f(b)) >= 0
309 # 0 >= b2f(a) + b2f(b)
310 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
312 (('fge', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('inot', ('ior', a
, b
))),
313 (('fge', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
315 (('flt', a
, ('fneg', a
)), ('flt', a
, 0.0)),
316 (('fge', a
, ('fneg', a
)), ('fge', a
, 0.0)),
318 # Some optimizations (below) convert things like (a < b || c < b) into
319 # (min(a, c) < b). However, this interfers with the previous optimizations
320 # that try to remove comparisons with negated sums of b2f. This just
322 (('flt', ('fmin', c
, ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')))), 0.0),
323 ('ior', ('flt', c
, 0.0), ('ior', a
, b
))),
325 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
326 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
327 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
328 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
329 (('~flt', ('fadd(is_used_once)', a
, '#b'), '#c'), ('flt', a
, ('fadd', c
, ('fneg', b
)))),
330 (('~flt', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, '#b')), '#c'), ('flt', ('fneg', ('fadd', c
, b
)), a
)),
331 (('~fge', ('fadd(is_used_once)', a
, '#b'), '#c'), ('fge', a
, ('fadd', c
, ('fneg', b
)))),
332 (('~fge', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, '#b')), '#c'), ('fge', ('fneg', ('fadd', c
, b
)), a
)),
333 (('~feq', ('fadd(is_used_once)', a
, '#b'), '#c'), ('feq', a
, ('fadd', c
, ('fneg', b
)))),
334 (('~feq', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, '#b')), '#c'), ('feq', ('fneg', ('fadd', c
, b
)), a
)),
335 (('~fne', ('fadd(is_used_once)', a
, '#b'), '#c'), ('fne', a
, ('fadd', c
, ('fneg', b
)))),
336 (('~fne', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, '#b')), '#c'), ('fne', ('fneg', ('fadd', c
, b
)), a
)),
338 # Cannot remove the addition from ilt or ige due to overflow.
339 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
340 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
342 # fmin(-b2f(a), b) >= 0.0
343 # -b2f(a) >= 0.0 && b >= 0.0
344 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
345 # b2f(a) == 0.0 && b >= 0.0
346 # a == False && b >= 0.0
349 # The fge in the second replacement is not a typo. I leave the proof that
350 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
352 (('fge', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
353 (('feq', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
355 (('feq', ('b2f', 'a@1'), 0.0), ('inot', a
)),
356 (('fne', ('b2f', 'a@1'), 0.0), a
),
357 (('ieq', ('b2i', 'a@1'), 0), ('inot', a
)),
358 (('ine', ('b2i', 'a@1'), 0), a
),
360 (('fne', ('u2f', a
), 0.0), ('ine', a
, 0)),
361 (('feq', ('u2f', a
), 0.0), ('ieq', a
, 0)),
362 (('fge', ('u2f', a
), 0.0), True),
363 (('fge', 0.0, ('u2f', a
)), ('uge', 0, a
)), # ieq instead?
364 (('flt', ('u2f', a
), 0.0), False),
365 (('flt', 0.0, ('u2f', a
)), ('ult', 0, a
)), # ine instead?
366 (('fne', ('i2f', a
), 0.0), ('ine', a
, 0)),
367 (('feq', ('i2f', a
), 0.0), ('ieq', a
, 0)),
368 (('fge', ('i2f', a
), 0.0), ('ige', a
, 0)),
369 (('fge', 0.0, ('i2f', a
)), ('ige', 0, a
)),
370 (('flt', ('i2f', a
), 0.0), ('ilt', a
, 0)),
371 (('flt', 0.0, ('i2f', a
)), ('ilt', 0, a
)),
375 # fabs(a) != 0.0 because fabs(a) must be >= 0
377 (('~flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
381 (('~flt', ('fneg', ('fabs', a
)), 0.0), ('fne', a
, 0.0)),
384 # 0.0 == fabs(a) because fabs(a) must be >= 0
386 (('fge', 0.0, ('fabs', a
)), ('feq', a
, 0.0)),
390 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
392 # (a >= 0.0) && (a <= 1.0) -> fsat(a) == a
393 (('iand', ('fge', a
, 0.0), ('fge', 1.0, a
)), ('feq', a
, ('fsat', a
)), '!options->lower_fsat'),
395 # (a < 0.0) || (a > 1.0)
396 # !(!(a < 0.0) && !(a > 1.0))
397 # !((a >= 0.0) && (a <= 1.0))
400 (('ior', ('flt', a
, 0.0), ('flt', 1.0, a
)), ('fne', a
, ('fsat', a
)), '!options->lower_fsat'),
402 (('fmax', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('ior', a
, b
))),
403 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('ior', a
, b
)))),
404 (('fmin', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
405 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('iand', a
, b
)))),
408 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
409 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
410 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
412 # Since b is a constant, constant folding will eliminate the fmin and the
413 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
414 (('fmin', ('b2f', 'a@1'), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
416 (('flt', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
418 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
419 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
420 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
421 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
422 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
423 (('bcsel', ('i2b', a
), b
, c
), ('bcsel', ('ine', a
, 0), b
, c
)),
424 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
425 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
426 (('bcsel', a
, b
, ('bcsel', a
, c
, d
)), ('bcsel', a
, b
, d
)),
427 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
428 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
429 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
430 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
431 (('bcsel', a
, True, b
), ('ior', a
, b
)),
432 (('bcsel', a
, a
, b
), ('ior', a
, b
)),
433 (('bcsel', a
, b
, False), ('iand', a
, b
)),
434 (('bcsel', a
, b
, a
), ('iand', a
, b
)),
441 (('fmax', ('fmax', a
, b
), b
), ('fmax', a
, b
)),
442 (('umax', ('umax', a
, b
), b
), ('umax', a
, b
)),
443 (('imax', ('imax', a
, b
), b
), ('imax', a
, b
)),
444 (('fmin', ('fmin', a
, b
), b
), ('fmin', a
, b
)),
445 (('umin', ('umin', a
, b
), b
), ('umin', a
, b
)),
446 (('imin', ('imin', a
, b
), b
), ('imin', a
, b
)),
447 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
448 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
449 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
450 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
451 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
452 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
453 (('fmin', a
, ('fabs', a
)), a
),
454 (('imin', a
, ('iabs', a
)), a
),
455 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
456 (('imax', a
, ('ineg', ('iabs', a
))), a
),
457 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
458 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
459 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
460 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
461 (('~fmax', ('fabs', a
), 0.0), ('fabs', a
)),
462 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
463 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
464 (('~fmin', ('fmax', a
, -1.0), 0.0), ('fneg', ('fsat', ('fneg', a
))), '!options->lower_negate && !options->lower_fsat'),
465 (('~fmax', ('fmin', a
, 0.0), -1.0), ('fneg', ('fsat', ('fneg', a
))), '!options->lower_negate && !options->lower_fsat'),
466 (('fsat', ('fsign', a
)), ('b2f', ('flt', 0.0, a
))),
467 (('fsat', ('b2f', a
)), ('b2f', a
)),
468 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
469 (('fsat', ('fsat', a
)), ('fsat', a
)),
470 (('fsat', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, b
))), ('fsat', ('fadd', ('fneg', a
), ('fneg', b
))), '!options->lower_negate && !options->lower_fsat'),
471 (('fsat', ('fneg(is_used_once)', ('fmul(is_used_once)', a
, b
))), ('fsat', ('fmul', ('fneg', a
), b
)), '!options->lower_negate && !options->lower_fsat'),
472 (('fsat', ('fabs(is_used_once)', ('fmul(is_used_once)', a
, b
))), ('fsat', ('fmul', ('fabs', a
), ('fabs', b
))), '!options->lower_fsat'),
473 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
474 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
475 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
476 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
477 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
478 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
479 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
480 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
481 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
482 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
483 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
484 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
485 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
486 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
487 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
488 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
489 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
490 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
491 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
492 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
493 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
494 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
496 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
497 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
498 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
499 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
500 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
501 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
502 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
503 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
504 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
505 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
506 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
507 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
508 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
509 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
510 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
511 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
513 # These derive from the previous patterns with the application of b < 0 <=>
514 # 0 < -b. The transformation should be applied if either comparison is
515 # used once as this ensures that the number of comparisons will not
516 # increase. The sources to the ior and iand are not symmetric, so the
517 # rules have to be duplicated to get this behavior.
518 (('~ior', ('flt(is_used_once)', 0.0, 'a@32'), ('flt', 'b@32', 0.0)), ('flt', 0.0, ('fmax', a
, ('fneg', b
)))),
519 (('~ior', ('flt', 0.0, 'a@32'), ('flt(is_used_once)', 'b@32', 0.0)), ('flt', 0.0, ('fmax', a
, ('fneg', b
)))),
520 (('~ior', ('fge(is_used_once)', 0.0, 'a@32'), ('fge', 'b@32', 0.0)), ('fge', 0.0, ('fmin', a
, ('fneg', b
)))),
521 (('~ior', ('fge', 0.0, 'a@32'), ('fge(is_used_once)', 'b@32', 0.0)), ('fge', 0.0, ('fmin', a
, ('fneg', b
)))),
522 (('~iand', ('flt(is_used_once)', 0.0, 'a@32'), ('flt', 'b@32', 0.0)), ('flt', 0.0, ('fmin', a
, ('fneg', b
)))),
523 (('~iand', ('flt', 0.0, 'a@32'), ('flt(is_used_once)', 'b@32', 0.0)), ('flt', 0.0, ('fmin', a
, ('fneg', b
)))),
524 (('~iand', ('fge(is_used_once)', 0.0, 'a@32'), ('fge', 'b@32', 0.0)), ('fge', 0.0, ('fmax', a
, ('fneg', b
)))),
525 (('~iand', ('fge', 0.0, 'a@32'), ('fge(is_used_once)', 'b@32', 0.0)), ('fge', 0.0, ('fmax', a
, ('fneg', b
)))),
527 # Common pattern like 'if (i == 0 || i == 1 || ...)'
528 (('ior', ('ieq', a
, 0), ('ieq', a
, 1)), ('uge', 1, a
)),
529 (('ior', ('uge', 1, a
), ('ieq', a
, 2)), ('uge', 2, a
)),
530 (('ior', ('uge', 2, a
), ('ieq', a
, 3)), ('uge', 3, a
)),
532 # The (i2f32, ...) part is an open-coded fsign. When that is combined with
533 # the bcsel, it's basically copysign(1.0, a). There is no copysign in NIR,
534 # so emit an open-coded version of that.
535 (('bcsel@32', ('feq', a
, 0.0), 1.0, ('i2f32', ('iadd', ('b2i32', ('flt', 0.0, 'a@32')), ('ineg', ('b2i32', ('flt', 'a@32', 0.0)))))),
536 ('ior', 0x3f800000, ('iand', a
, 0x80000000))),
538 (('ior', a
, ('ieq', a
, False)), True),
539 (('ior', a
, ('inot', a
)), -1),
541 (('ine', ('ineg', ('b2i32', 'a@1')), ('ineg', ('b2i32', 'b@1'))), ('ine', a
, b
)),
542 (('b2i32', ('ine', 'a@1', 'b@1')), ('b2i32', ('ixor', a
, b
))),
544 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0), '!options->lower_bitops'),
546 # These patterns can result when (a < b || a < c) => (a < min(b, c))
547 # transformations occur before constant propagation and loop-unrolling.
548 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
549 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
550 (('~fge', a
, ('fmin', b
, a
)), True),
551 (('~fge', ('fmax', a
, b
), a
), True),
552 (('~flt', a
, ('fmin', b
, a
)), False),
553 (('~flt', ('fmax', a
, b
), a
), False),
554 (('~fge', a
, ('fmax', b
, a
)), ('fge', a
, b
)),
555 (('~fge', ('fmin', a
, b
), a
), ('fge', b
, a
)),
557 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
558 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
559 (('ige', a
, ('imin', b
, a
)), True),
560 (('ige', ('imax', a
, b
), a
), True),
561 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
562 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
563 (('uge', a
, ('umin', b
, a
)), True),
564 (('uge', ('umax', a
, b
), a
), True),
565 (('ilt', a
, ('imin', b
, a
)), False),
566 (('ilt', ('imax', a
, b
), a
), False),
567 (('ige', a
, ('imax', b
, a
)), ('ige', a
, b
)),
568 (('ige', ('imin', a
, b
), a
), ('ige', b
, a
)),
569 (('ult', a
, ('umin', b
, a
)), False),
570 (('ult', ('umax', a
, b
), a
), False),
571 (('uge', a
, ('umax', b
, a
)), ('uge', a
, b
)),
572 (('uge', ('umin', a
, b
), a
), ('uge', b
, a
)),
573 (('ult', a
, ('iand', b
, a
)), False),
574 (('ult', ('ior', a
, b
), a
), False),
575 (('uge', a
, ('iand', b
, a
)), True),
576 (('uge', ('ior', a
, b
), a
), True),
578 (('ilt', '#a', ('imax', '#b', c
)), ('ior', ('ilt', a
, b
), ('ilt', a
, c
))),
579 (('ilt', ('imin', '#a', b
), '#c'), ('ior', ('ilt', a
, c
), ('ilt', b
, c
))),
580 (('ige', '#a', ('imin', '#b', c
)), ('ior', ('ige', a
, b
), ('ige', a
, c
))),
581 (('ige', ('imax', '#a', b
), '#c'), ('ior', ('ige', a
, c
), ('ige', b
, c
))),
582 (('ult', '#a', ('umax', '#b', c
)), ('ior', ('ult', a
, b
), ('ult', a
, c
))),
583 (('ult', ('umin', '#a', b
), '#c'), ('ior', ('ult', a
, c
), ('ult', b
, c
))),
584 (('uge', '#a', ('umin', '#b', c
)), ('ior', ('uge', a
, b
), ('uge', a
, c
))),
585 (('uge', ('umax', '#a', b
), '#c'), ('ior', ('uge', a
, c
), ('uge', b
, c
))),
586 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
587 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
588 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
589 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
590 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
591 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
592 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
593 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
595 # Thanks to sign extension, the ishr(a, b) is negative if and only if a is
597 (('bcsel', ('ilt', a
, 0), ('ineg', ('ishr', a
, b
)), ('ishr', a
, b
)),
598 ('iabs', ('ishr', a
, b
))),
599 (('iabs', ('ishr', ('iabs', a
), b
)), ('ishr', ('iabs', a
), b
)),
601 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
602 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
603 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
604 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
605 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
606 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
607 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
608 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
609 (('seq', ('seq', a
, b
), 1.0), ('seq', a
, b
)),
610 (('seq', ('sne', a
, b
), 1.0), ('sne', a
, b
)),
611 (('seq', ('slt', a
, b
), 1.0), ('slt', a
, b
)),
612 (('seq', ('sge', a
, b
), 1.0), ('sge', a
, b
)),
613 (('sne', ('seq', a
, b
), 0.0), ('seq', a
, b
)),
614 (('sne', ('sne', a
, b
), 0.0), ('sne', a
, b
)),
615 (('sne', ('slt', a
, b
), 0.0), ('slt', a
, b
)),
616 (('sne', ('sge', a
, b
), 0.0), ('sge', a
, b
)),
617 (('seq', ('seq', a
, b
), 0.0), ('sne', a
, b
)),
618 (('seq', ('sne', a
, b
), 0.0), ('seq', a
, b
)),
619 (('seq', ('slt', a
, b
), 0.0), ('sge', a
, b
)),
620 (('seq', ('sge', a
, b
), 0.0), ('slt', a
, b
)),
621 (('sne', ('seq', a
, b
), 1.0), ('sne', a
, b
)),
622 (('sne', ('sne', a
, b
), 1.0), ('seq', a
, b
)),
623 (('sne', ('slt', a
, b
), 1.0), ('sge', a
, b
)),
624 (('sne', ('sge', a
, b
), 1.0), ('slt', a
, b
)),
625 (('fall_equal2', a
, b
), ('fmin', ('seq', 'a.x', 'b.x'), ('seq', 'a.y', 'b.y')), 'options->lower_vector_cmp'),
626 (('fall_equal3', a
, b
), ('seq', ('fany_nequal3', a
, b
), 0.0), 'options->lower_vector_cmp'),
627 (('fall_equal4', a
, b
), ('seq', ('fany_nequal4', a
, b
), 0.0), 'options->lower_vector_cmp'),
628 (('fany_nequal2', a
, b
), ('fmax', ('sne', 'a.x', 'b.x'), ('sne', 'a.y', 'b.y')), 'options->lower_vector_cmp'),
629 (('fany_nequal3', a
, b
), ('fsat', ('fdot3', ('sne', a
, b
), ('sne', a
, b
))), 'options->lower_vector_cmp'),
630 (('fany_nequal4', a
, b
), ('fsat', ('fdot4', ('sne', a
, b
), ('sne', a
, b
))), 'options->lower_vector_cmp'),
631 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
632 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
634 (('imul', ('b2i', 'a@1'), ('b2i', 'b@1')), ('b2i', ('iand', a
, b
))),
635 (('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
636 (('fsat', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('b2f', ('ior', a
, b
))),
637 (('iand', 'a@bool32', 1.0), ('b2f', a
)),
638 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
639 (('ineg', ('b2i32', 'a@32')), a
),
640 (('flt', ('fneg', ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
641 (('flt', ('fsub', 0.0, ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
642 # Comparison with the same args. Note that these are not done for
643 # the float versions because NaN always returns false on float
645 (('ilt', a
, a
), False),
646 (('ige', a
, a
), True),
647 (('ieq', a
, a
), True),
648 (('ine', a
, a
), False),
649 (('ult', a
, a
), False),
650 (('uge', a
, a
), True),
651 # Logical and bit operations
653 (('iand', a
, ~
0), a
),
657 (('ior', a
, True), True),
660 (('inot', ('inot', a
)), a
),
661 (('ior', ('iand', a
, b
), b
), b
),
662 (('ior', ('ior', a
, b
), b
), ('ior', a
, b
)),
663 (('iand', ('ior', a
, b
), b
), b
),
664 (('iand', ('iand', a
, b
), b
), ('iand', a
, b
)),
666 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
667 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
668 # Shift optimizations
675 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
676 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
677 (('ior', ('ishl@16', a
, b
), ('ushr@16', a
, ('iadd', 16, ('ineg', b
)))), ('urol', a
, b
), '!options->lower_rotate'),
678 (('ior', ('ishl@16', a
, b
), ('ushr@16', a
, ('isub', 16, b
))), ('urol', a
, b
), '!options->lower_rotate'),
679 (('ior', ('ishl@32', a
, b
), ('ushr@32', a
, ('iadd', 32, ('ineg', b
)))), ('urol', a
, b
), '!options->lower_rotate'),
680 (('ior', ('ishl@32', a
, b
), ('ushr@32', a
, ('isub', 32, b
))), ('urol', a
, b
), '!options->lower_rotate'),
681 (('ior', ('ushr@16', a
, b
), ('ishl@16', a
, ('iadd', 16, ('ineg', b
)))), ('uror', a
, b
), '!options->lower_rotate'),
682 (('ior', ('ushr@16', a
, b
), ('ishl@16', a
, ('isub', 16, b
))), ('uror', a
, b
), '!options->lower_rotate'),
683 (('ior', ('ushr@32', a
, b
), ('ishl@32', a
, ('iadd', 32, ('ineg', b
)))), ('uror', a
, b
), '!options->lower_rotate'),
684 (('ior', ('ushr@32', a
, b
), ('ishl@32', a
, ('isub', 32, b
))), ('uror', a
, b
), '!options->lower_rotate'),
685 (('urol@16', a
, b
), ('ior', ('ishl', a
, b
), ('ushr', a
, ('isub', 16, b
))), 'options->lower_rotate'),
686 (('urol@32', a
, b
), ('ior', ('ishl', a
, b
), ('ushr', a
, ('isub', 32, b
))), 'options->lower_rotate'),
687 (('uror@16', a
, b
), ('ior', ('ushr', a
, b
), ('ishl', a
, ('isub', 16, b
))), 'options->lower_rotate'),
688 (('uror@32', a
, b
), ('ior', ('ushr', a
, b
), ('ishl', a
, ('isub', 32, b
))), 'options->lower_rotate'),
689 # Exponential/logarithmic identities
690 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
691 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
692 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
693 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
694 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
695 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
696 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
697 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
698 (('~fpow', a
, 1.0), a
),
699 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
700 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
701 (('~fpow', 2.0, a
), ('fexp2', a
)),
702 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
703 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
704 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
705 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
706 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
707 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
708 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
709 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
710 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
711 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
712 (('bcsel', ('flt', a
, 0.0), 0.0, ('fsqrt', a
)), ('fsqrt', ('fmax', a
, 0.0))),
713 # Division and reciprocal
714 (('~fdiv', 1.0, a
), ('frcp', a
)),
715 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
716 (('~frcp', ('frcp', a
)), a
),
717 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
718 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
719 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
721 (('fsin', a
), lowered_sincos(0.5), 'options->lower_sincos'),
722 (('fcos', a
), lowered_sincos(0.75), 'options->lower_sincos'),
723 # Boolean simplifications
724 (('i2b32(is_used_by_if)', a
), ('ine32', a
, 0)),
725 (('i2b1(is_used_by_if)', a
), ('ine', a
, 0)),
726 (('ieq', a
, True), a
),
727 (('ine(is_not_used_by_if)', a
, True), ('inot', a
)),
728 (('ine', a
, False), a
),
729 (('ieq(is_not_used_by_if)', a
, False), ('inot', 'a')),
730 (('bcsel', a
, True, False), a
),
731 (('bcsel', a
, False, True), ('inot', a
)),
732 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
733 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
734 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
735 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
736 (('bcsel', True, b
, c
), b
),
737 (('bcsel', False, b
, c
), c
),
738 (('bcsel', a
, ('b2f(is_used_once)', 'b@32'), ('b2f', 'c@32')), ('b2f', ('bcsel', a
, b
, c
))),
740 (('bcsel', a
, b
, b
), b
),
741 (('fcsel', a
, b
, b
), b
),
743 # D3D Boolean emulation
744 (('bcsel', a
, -1, 0), ('ineg', ('b2i', 'a@1'))),
745 (('bcsel', a
, 0, -1), ('ineg', ('b2i', ('inot', a
)))),
746 (('iand', ('ineg', ('b2i', 'a@1')), ('ineg', ('b2i', 'b@1'))),
747 ('ineg', ('b2i', ('iand', a
, b
)))),
748 (('ior', ('ineg', ('b2i','a@1')), ('ineg', ('b2i', 'b@1'))),
749 ('ineg', ('b2i', ('ior', a
, b
)))),
750 (('ieq', ('ineg', ('b2i', 'a@1')), 0), ('inot', a
)),
751 (('ieq', ('ineg', ('b2i', 'a@1')), -1), a
),
752 (('ine', ('ineg', ('b2i', 'a@1')), 0), a
),
753 (('ine', ('ineg', ('b2i', 'a@1')), -1), ('inot', a
)),
754 (('iand', ('ineg', ('b2i', a
)), 1.0), ('b2f', a
)),
756 # SM5 32-bit shifts are defined to use the 5 least significant bits
757 (('ishl', 'a@32', ('iand', 31, b
)), ('ishl', a
, b
)),
758 (('ishr', 'a@32', ('iand', 31, b
)), ('ishr', a
, b
)),
759 (('ushr', 'a@32', ('iand', 31, b
)), ('ushr', a
, b
)),
762 (('i2b32', ('b2i', 'a@32')), a
),
763 (('f2i', ('ftrunc', a
)), ('f2i', a
)),
764 (('f2u', ('ftrunc', a
)), ('f2u', a
)),
765 (('i2b', ('ineg', a
)), ('i2b', a
)),
766 (('i2b', ('iabs', a
)), ('i2b', a
)),
767 (('fabs', ('b2f', a
)), ('b2f', a
)),
768 (('iabs', ('b2i', a
)), ('b2i', a
)),
769 (('inot', ('f2b1', a
)), ('feq', a
, 0.0)),
771 # Ironically, mark these as imprecise because removing the conversions may
772 # preserve more precision than doing the conversions (e.g.,
773 # uint(float(0x81818181u)) == 0x81818200).
774 (('~f2i32', ('i2f', 'a@32')), a
),
775 (('~f2i32', ('u2f', 'a@32')), a
),
776 (('~f2u32', ('i2f', 'a@32')), a
),
777 (('~f2u32', ('u2f', 'a@32')), a
),
779 # Section 5.4.1 (Conversion and Scalar Constructors) of the GLSL 4.60 spec
782 # It is undefined to convert a negative floating-point value to an
785 # Assuming that (uint)some_float behaves like (uint)(int)some_float allows
786 # some optimizations in the i965 backend to proceed.
787 (('ige', ('f2u', a
), b
), ('ige', ('f2i', a
), b
)),
788 (('ige', b
, ('f2u', a
)), ('ige', b
, ('f2i', a
))),
789 (('ilt', ('f2u', a
), b
), ('ilt', ('f2i', a
), b
)),
790 (('ilt', b
, ('f2u', a
)), ('ilt', b
, ('f2i', a
))),
792 (('~fmin', ('fabs', a
), 1.0), ('fsat', ('fabs', a
)), '!options->lower_fsat'),
794 # The result of the multiply must be in [-1, 0], so the result of the ffma
796 (('flt', ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0), 0.0), False),
797 (('flt', ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0), 0.0), False),
798 (('fmax', ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0), 0.0), ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0)),
799 (('fmax', ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0), 0.0), ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0)),
801 (('fne(is_not_used_by_if)', 'a(is_not_zero)', 0.0), True),
802 (('feq(is_not_used_by_if)', 'a(is_not_zero)', 0.0), False),
804 (('fge(is_not_used_by_if)', 'a(is_not_negative)', 'b(is_not_positive)'), True),
805 (('fge(is_not_used_by_if)', 'b(is_not_positive)', 'a(is_gt_zero)'), False),
806 (('fge(is_not_used_by_if)', 'a(is_lt_zero)', 'b(is_not_negative)'), False),
807 (('fge(is_not_used_by_if)', 'b(is_not_negative)', 'a(is_not_positive)'), True),
809 (('flt(is_not_used_by_if)', 'a(is_not_negative)', 'b(is_not_positive)'), False),
810 (('flt(is_not_used_by_if)', 'b(is_not_positive)', 'a(is_gt_zero)'), True),
811 (('flt(is_not_used_by_if)', 'a(is_lt_zero)', 'b(is_not_negative)'), True),
812 (('flt(is_not_used_by_if)', 'b(is_not_negative)', 'a(is_not_positive)'), False),
814 (('ine(is_not_used_by_if)', 'a(is_not_zero)', 0), True),
815 (('ieq(is_not_used_by_if)', 'a(is_not_zero)', 0), False),
817 (('ige(is_not_used_by_if)', 'a(is_not_negative)', 'b(is_not_positive)'), True),
818 (('ige(is_not_used_by_if)', 'b(is_not_positive)', 'a(is_gt_zero)'), False),
819 (('ige(is_not_used_by_if)', 'a(is_lt_zero)', 'b(is_not_negative)'), False),
820 (('ige(is_not_used_by_if)', 'b(is_not_negative)', 'a(is_not_positive)'), True),
822 (('ilt(is_not_used_by_if)', 'a(is_not_negative)', 'b(is_not_positive)'), False),
823 (('ilt(is_not_used_by_if)', 'b(is_not_positive)', 'a(is_gt_zero)'), True),
824 (('ilt(is_not_used_by_if)', 'a(is_lt_zero)', 'b(is_not_negative)'), True),
825 (('ilt(is_not_used_by_if)', 'b(is_not_negative)', 'a(is_not_positive)'), False),
827 (('ult(is_not_used_by_if)', 0, 'a(is_gt_zero)'), True),
829 # Packing and then unpacking does nothing
830 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
831 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
832 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
833 ('unpack_64_2x32_split_y', a
)), a
),
835 # Comparing two halves of an unpack separately. While this optimization
836 # should be correct for non-constant values, it's less obvious that it's
837 # useful in that case. For constant values, the pack will fold and we're
838 # guaranteed to reduce the whole tree to one instruction.
839 (('iand', ('ieq', ('unpack_32_2x16_split_x', a
), '#b'),
840 ('ieq', ('unpack_32_2x16_split_y', a
), '#c')),
841 ('ieq', a
, ('pack_32_2x16_split', b
, c
))),
844 (('ushr', 'a@16', 8), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
845 (('ushr', 'a@32', 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
846 (('ushr', 'a@64', 56), ('extract_u8', a
, 7), '!options->lower_extract_byte'),
847 (('ishr', 'a@16', 8), ('extract_i8', a
, 1), '!options->lower_extract_byte'),
848 (('ishr', 'a@32', 24), ('extract_i8', a
, 3), '!options->lower_extract_byte'),
849 (('ishr', 'a@64', 56), ('extract_i8', a
, 7), '!options->lower_extract_byte'),
850 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte')
853 # After the ('extract_u8', a, 0) pattern, above, triggers, there will be
854 # patterns like those below.
855 for op
in ('ushr', 'ishr'):
856 optimizations
.extend([(('extract_u8', (op
, 'a@16', 8), 0), ('extract_u8', a
, 1))])
857 optimizations
.extend([(('extract_u8', (op
, 'a@32', 8 * i
), 0), ('extract_u8', a
, i
)) for i
in range(1, 4)])
858 optimizations
.extend([(('extract_u8', (op
, 'a@64', 8 * i
), 0), ('extract_u8', a
, i
)) for i
in range(1, 8)])
860 optimizations
.extend([(('extract_u8', ('extract_u16', a
, 1), 0), ('extract_u8', a
, 2))])
862 # After the ('extract_[iu]8', a, 3) patterns, above, trigger, there will be
863 # patterns like those below.
864 for op
in ('extract_u8', 'extract_i8'):
865 optimizations
.extend([((op
, ('ishl', 'a@16', 8), 1), (op
, a
, 0))])
866 optimizations
.extend([((op
, ('ishl', 'a@32', 24 - 8 * i
), 3), (op
, a
, i
)) for i
in range(2, -1, -1)])
867 optimizations
.extend([((op
, ('ishl', 'a@64', 56 - 8 * i
), 7), (op
, a
, i
)) for i
in range(6, -1, -1)])
869 optimizations
.extend([
871 (('ushr', ('ishl', 'a@32', 16), 16), ('extract_u16', a
, 0), '!options->lower_extract_word'),
872 (('ushr', 'a@32', 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
873 (('ishr', ('ishl', 'a@32', 16), 16), ('extract_i16', a
, 0), '!options->lower_extract_word'),
874 (('ishr', 'a@32', 16), ('extract_i16', a
, 1), '!options->lower_extract_word'),
875 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
878 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
879 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
880 (('ussub_4x8', a
, 0), a
),
881 (('ussub_4x8', a
, ~
0), 0),
882 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
883 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
884 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
885 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
886 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
887 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
888 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
889 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
891 # Propagate negation up multiplication chains
892 (('fmul(is_used_by_non_fsat)', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
893 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
895 # Propagate constants up multiplication chains
896 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
897 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
898 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
899 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
901 # Reassociate constants in add/mul chains so they can be folded together.
902 # For now, we mostly only handle cases where the constants are separated by
903 # a single non-constant. We could do better eventually.
904 (('~fmul', '#a', ('fmul', 'b(is_not_const)', '#c')), ('fmul', ('fmul', a
, c
), b
)),
905 (('imul', '#a', ('imul', 'b(is_not_const)', '#c')), ('imul', ('imul', a
, c
), b
)),
906 (('~fadd', '#a', ('fadd', 'b(is_not_const)', '#c')), ('fadd', ('fadd', a
, c
), b
)),
907 (('~fadd', '#a', ('fneg', ('fadd', 'b(is_not_const)', '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
908 (('iadd', '#a', ('iadd', 'b(is_not_const)', '#c')), ('iadd', ('iadd', a
, c
), b
)),
910 # Drop mul-div by the same value when there's no wrapping.
911 (('idiv', ('imul(no_signed_wrap)', a
, b
), b
), a
),
914 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
915 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
916 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
918 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
919 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
920 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
922 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
925 (('fmod@16', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod'),
926 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod'),
927 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod'),
928 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
929 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
931 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
932 ('bcsel', ('ult', 31, 'bits'), 'insert',
933 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
934 'options->lower_bitfield_insert'),
935 (('ihadd', a
, b
), ('iadd', ('iand', a
, b
), ('ishr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
936 (('uhadd', a
, b
), ('iadd', ('iand', a
, b
), ('ushr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
937 (('irhadd', a
, b
), ('isub', ('ior', a
, b
), ('ishr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
938 (('urhadd', a
, b
), ('isub', ('ior', a
, b
), ('ushr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
939 (('uadd_sat', a
, b
), ('bcsel', ('ult', ('iadd', a
, b
), a
), -1, ('iadd', a
, b
)), 'options->lower_add_sat'),
940 (('usub_sat', a
, b
), ('bcsel', ('ult', a
, b
), 0, ('isub', a
, b
)), 'options->lower_add_sat'),
942 # Alternative lowering that doesn't rely on bfi.
943 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
944 ('bcsel', ('ult', 31, 'bits'),
947 ('iand', 'base', ('inot', ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'))),
948 ('iand', ('ishl', 'insert', 'offset'), ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'))))),
949 'options->lower_bitfield_insert_to_shifts'),
951 # Alternative lowering that uses bitfield_select.
952 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
953 ('bcsel', ('ult', 31, 'bits'), 'insert',
954 ('bitfield_select', ('bfm', 'bits', 'offset'), ('ishl', 'insert', 'offset'), 'base')),
955 'options->lower_bitfield_insert_to_bitfield_select'),
957 (('ibitfield_extract', 'value', 'offset', 'bits'),
958 ('bcsel', ('ult', 31, 'bits'), 'value',
959 ('ibfe', 'value', 'offset', 'bits')),
960 'options->lower_bitfield_extract'),
962 (('ubitfield_extract', 'value', 'offset', 'bits'),
963 ('bcsel', ('ult', 31, 'bits'), 'value',
964 ('ubfe', 'value', 'offset', 'bits')),
965 'options->lower_bitfield_extract'),
967 # Note that these opcodes are defined to only use the five least significant bits of 'offset' and 'bits'
968 (('ubfe', 'value', 'offset', ('iand', 31, 'bits')), ('ubfe', 'value', 'offset', 'bits')),
969 (('ubfe', 'value', ('iand', 31, 'offset'), 'bits'), ('ubfe', 'value', 'offset', 'bits')),
970 (('ibfe', 'value', 'offset', ('iand', 31, 'bits')), ('ibfe', 'value', 'offset', 'bits')),
971 (('ibfe', 'value', ('iand', 31, 'offset'), 'bits'), ('ibfe', 'value', 'offset', 'bits')),
972 (('bfm', 'bits', ('iand', 31, 'offset')), ('bfm', 'bits', 'offset')),
973 (('bfm', ('iand', 31, 'bits'), 'offset'), ('bfm', 'bits', 'offset')),
975 (('ibitfield_extract', 'value', 'offset', 'bits'),
976 ('bcsel', ('ieq', 0, 'bits'),
979 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
980 ('isub', 32, 'bits'))),
981 'options->lower_bitfield_extract_to_shifts'),
983 (('ubitfield_extract', 'value', 'offset', 'bits'),
985 ('ushr', 'value', 'offset'),
986 ('bcsel', ('ieq', 'bits', 32),
988 ('isub', ('ishl', 1, 'bits'), 1))),
989 'options->lower_bitfield_extract_to_shifts'),
991 (('ifind_msb', 'value'),
992 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
993 'options->lower_ifind_msb'),
995 (('find_lsb', 'value'),
996 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
997 'options->lower_find_lsb'),
999 (('extract_i8', a
, 'b@32'),
1000 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
1001 'options->lower_extract_byte'),
1003 (('extract_u8', a
, 'b@32'),
1004 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
1005 'options->lower_extract_byte'),
1007 (('extract_i16', a
, 'b@32'),
1008 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
1009 'options->lower_extract_word'),
1011 (('extract_u16', a
, 'b@32'),
1012 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
1013 'options->lower_extract_word'),
1015 (('pack_unorm_2x16', 'v'),
1016 ('pack_uvec2_to_uint',
1017 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
1018 'options->lower_pack_unorm_2x16'),
1020 (('pack_unorm_4x8', 'v'),
1021 ('pack_uvec4_to_uint',
1022 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
1023 'options->lower_pack_unorm_4x8'),
1025 (('pack_snorm_2x16', 'v'),
1026 ('pack_uvec2_to_uint',
1027 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
1028 'options->lower_pack_snorm_2x16'),
1030 (('pack_snorm_4x8', 'v'),
1031 ('pack_uvec4_to_uint',
1032 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
1033 'options->lower_pack_snorm_4x8'),
1035 (('unpack_unorm_2x16', 'v'),
1036 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
1037 ('extract_u16', 'v', 1))),
1039 'options->lower_unpack_unorm_2x16'),
1041 (('unpack_unorm_4x8', 'v'),
1042 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
1043 ('extract_u8', 'v', 1),
1044 ('extract_u8', 'v', 2),
1045 ('extract_u8', 'v', 3))),
1047 'options->lower_unpack_unorm_4x8'),
1049 (('unpack_snorm_2x16', 'v'),
1050 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec2', ('extract_i16', 'v', 0),
1051 ('extract_i16', 'v', 1))),
1053 'options->lower_unpack_snorm_2x16'),
1055 (('unpack_snorm_4x8', 'v'),
1056 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec4', ('extract_i8', 'v', 0),
1057 ('extract_i8', 'v', 1),
1058 ('extract_i8', 'v', 2),
1059 ('extract_i8', 'v', 3))),
1061 'options->lower_unpack_snorm_4x8'),
1063 (('isign', a
), ('imin', ('imax', a
, -1), 1), 'options->lower_isign'),
1064 (('fsign', a
), ('fsub', ('b2f', ('flt', 0.0, a
)), ('b2f', ('flt', a
, 0.0))), 'options->lower_fsign'),
1067 # bit_size dependent lowerings
1068 for bit_size
in [8, 16, 32, 64]:
1069 # convenience constants
1070 intmax
= (1 << (bit_size
- 1)) - 1
1071 intmin
= 1 << (bit_size
- 1)
1074 (('iadd_sat@' + str(bit_size
), a
, b
),
1075 ('bcsel', ('ige', b
, 1), ('bcsel', ('ilt', ('iadd', a
, b
), a
), intmax
, ('iadd', a
, b
)),
1076 ('bcsel', ('ilt', a
, ('iadd', a
, b
)), intmin
, ('iadd', a
, b
))), 'options->lower_add_sat'),
1077 (('isub_sat@' + str(bit_size
), a
, b
),
1078 ('bcsel', ('ilt', b
, 0), ('bcsel', ('ilt', ('isub', a
, b
), a
), intmax
, ('isub', a
, b
)),
1079 ('bcsel', ('ilt', a
, ('isub', a
, b
)), intmin
, ('isub', a
, b
))), 'options->lower_add_sat'),
1082 invert
= OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
1084 for left
, right
in itertools
.combinations_with_replacement(invert
.keys(), 2):
1085 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
1086 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
1087 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
1088 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
1090 # Optimize x2bN(b2x(x)) -> x
1091 for size
in type_sizes('bool'):
1092 aN
= 'a@' + str(size
)
1093 f2bN
= 'f2b' + str(size
)
1094 i2bN
= 'i2b' + str(size
)
1095 optimizations
.append(((f2bN
, ('b2f', aN
)), a
))
1096 optimizations
.append(((i2bN
, ('b2i', aN
)), a
))
1098 # Optimize x2yN(b2x(x)) -> b2y
1099 for x
, y
in itertools
.product(['f', 'u', 'i'], ['f', 'u', 'i']):
1100 if x
!= 'f' and y
!= 'f' and x
!= y
:
1103 b2x
= 'b2f' if x
== 'f' else 'b2i'
1104 b2y
= 'b2f' if y
== 'f' else 'b2i'
1105 x2yN
= '{}2{}'.format(x
, y
)
1106 optimizations
.append(((x2yN
, (b2x
, a
)), (b2y
, a
)))
1108 # Optimize away x2xN(a@N)
1109 for t
in ['int', 'uint', 'float']:
1110 for N
in type_sizes(t
):
1111 x2xN
= '{0}2{0}{1}'.format(t
[0], N
)
1112 aN
= 'a@{0}'.format(N
)
1113 optimizations
.append(((x2xN
, aN
), a
))
1115 # Optimize x2xN(y2yM(a@P)) -> y2yN(a) for integers
1116 # In particular, we can optimize away everything except upcast of downcast and
1117 # upcasts where the type differs from the other cast
1118 for N
, M
in itertools
.product(type_sizes('uint'), type_sizes('uint')):
1120 # The outer cast is a down-cast. It doesn't matter what the size of the
1121 # argument of the inner cast is because we'll never been in the upcast
1122 # of downcast case. Regardless of types, we'll always end up with y2yN
1124 for x
, y
in itertools
.product(['i', 'u'], ['i', 'u']):
1125 x2xN
= '{0}2{0}{1}'.format(x
, N
)
1126 y2yM
= '{0}2{0}{1}'.format(y
, M
)
1127 y2yN
= '{0}2{0}{1}'.format(y
, N
)
1128 optimizations
.append(((x2xN
, (y2yM
, a
)), (y2yN
, a
)))
1130 # If the outer cast is an up-cast, we have to be more careful about the
1131 # size of the argument of the inner cast and with types. In this case,
1132 # the type is always the type of type up-cast which is given by the
1134 for P
in type_sizes('uint'):
1135 # We can't optimize away up-cast of down-cast.
1139 # Because we're doing down-cast of down-cast, the types always have
1140 # to match between the two casts
1141 for x
in ['i', 'u']:
1142 x2xN
= '{0}2{0}{1}'.format(x
, N
)
1143 x2xM
= '{0}2{0}{1}'.format(x
, M
)
1144 aP
= 'a@{0}'.format(P
)
1145 optimizations
.append(((x2xN
, (x2xM
, aP
)), (x2xN
, a
)))
1147 # The N == M case is handled by other optimizations
1150 # Optimize comparisons with up-casts
1151 for t
in ['int', 'uint', 'float']:
1152 for N
, M
in itertools
.product(type_sizes(t
), repeat
=2):
1153 if N
== 1 or N
>= M
:
1156 x2xM
= '{0}2{0}{1}'.format(t
[0], M
)
1157 x2xN
= '{0}2{0}{1}'.format(t
[0], N
)
1160 xeq
= 'feq' if t
== 'float' else 'ieq'
1161 xne
= 'fne' if t
== 'float' else 'ine'
1162 xge
= '{0}ge'.format(t
[0])
1163 xlt
= '{0}lt'.format(t
[0])
1165 # Up-casts are lossless so for correctly signed comparisons of
1166 # up-casted values we can do the comparison at the largest of the two
1167 # original sizes and drop one or both of the casts. (We have
1168 # optimizations to drop the no-op casts which this may generate.)
1169 for P
in type_sizes(t
):
1175 ((xeq
, (x2xM
, aN
), (x2xM
, bP
)), (xeq
, a
, (x2xN
, b
))),
1176 ((xne
, (x2xM
, aN
), (x2xM
, bP
)), (xne
, a
, (x2xN
, b
))),
1177 ((xge
, (x2xM
, aN
), (x2xM
, bP
)), (xge
, a
, (x2xN
, b
))),
1178 ((xlt
, (x2xM
, aN
), (x2xM
, bP
)), (xlt
, a
, (x2xN
, b
))),
1179 ((xge
, (x2xM
, bP
), (x2xM
, aN
)), (xge
, (x2xN
, b
), a
)),
1180 ((xlt
, (x2xM
, bP
), (x2xM
, aN
)), (xlt
, (x2xN
, b
), a
)),
1183 # The next bit doesn't work on floats because the range checks would
1184 # get way too complicated.
1185 if t
in ['int', 'uint']:
1187 xN_min
= -(1 << (N
- 1))
1188 xN_max
= (1 << (N
- 1)) - 1
1191 xN_max
= (1 << N
) - 1
1195 # If we're up-casting and comparing to a constant, we can unfold
1196 # the comparison into a comparison with the shrunk down constant
1197 # and a check that the constant fits in the smaller bit size.
1199 ((xeq
, (x2xM
, aN
), '#b'),
1200 ('iand', (xeq
, a
, (x2xN
, b
)), (xeq
, (x2xM
, (x2xN
, b
)), b
))),
1201 ((xne
, (x2xM
, aN
), '#b'),
1202 ('ior', (xne
, a
, (x2xN
, b
)), (xne
, (x2xM
, (x2xN
, b
)), b
))),
1203 ((xlt
, (x2xM
, aN
), '#b'),
1204 ('iand', (xlt
, xN_min
, b
),
1205 ('ior', (xlt
, xN_max
, b
), (xlt
, a
, (x2xN
, b
))))),
1206 ((xlt
, '#a', (x2xM
, bN
)),
1207 ('iand', (xlt
, a
, xN_max
),
1208 ('ior', (xlt
, a
, xN_min
), (xlt
, (x2xN
, a
), b
)))),
1209 ((xge
, (x2xM
, aN
), '#b'),
1210 ('iand', (xge
, xN_max
, b
),
1211 ('ior', (xge
, xN_min
, b
), (xge
, a
, (x2xN
, b
))))),
1212 ((xge
, '#a', (x2xM
, bN
)),
1213 ('iand', (xge
, a
, xN_min
),
1214 ('ior', (xge
, a
, xN_max
), (xge
, (x2xN
, a
), b
)))),
1217 def fexp2i(exp
, bits
):
1218 # We assume that exp is already in the right range.
1220 return ('i2i16', ('ishl', ('iadd', exp
, 15), 10))
1222 return ('ishl', ('iadd', exp
, 127), 23)
1224 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
1228 def ldexp(f
, exp
, bits
):
1229 # First, we clamp exp to a reasonable range. The maximum possible range
1230 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
1231 # a maximum range of [-149, 127]. This means that we can potentially have
1232 # a swing of +-276. If you start with FLT_MAX, you actually have to do
1233 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
1234 # spec, on the other hand, only requires that we handle an exponent value
1235 # in the range [-126, 128]. This implementation is *mostly* correct; it
1236 # handles a range on exp of [-252, 254] which allows you to create any
1237 # value (including denorms if the hardware supports it) and to adjust the
1238 # exponent of any normal value to anything you want.
1240 exp
= ('imin', ('imax', exp
, -28), 30)
1242 exp
= ('imin', ('imax', exp
, -252), 254)
1244 exp
= ('imin', ('imax', exp
, -2044), 2046)
1248 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
1249 # (We use ishr which isn't the same for -1, but the -1 case still works
1250 # since we use exp-exp/2 as the second exponent.) While the spec
1251 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
1252 # work with denormals and doesn't allow for the full swing in exponents
1253 # that you can get with normalized values. Instead, we create two powers
1254 # of two and multiply by them each in turn. That way the effective range
1255 # of our exponent is doubled.
1256 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
1257 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
1258 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
1261 (('ldexp@16', 'x', 'exp'), ldexp('x', 'exp', 16), 'options->lower_ldexp'),
1262 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
1263 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
1266 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
1267 def bitfield_reverse(u
):
1268 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
1269 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
1270 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
1271 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
1272 step5
= ('ior(many-comm-expr)', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
1276 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
1278 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
1279 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
1280 # and, if a is a NaN then the second comparison will fail anyway.
1281 for op
in ['flt', 'fge', 'feq']:
1283 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
1284 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
1287 # Add optimizations to handle the case where the result of a ternary is
1288 # compared to a constant. This way we can take things like
1294 # a ? (0 > 0) : (1 > 0)
1296 # which constant folding will eat for lunch. The resulting ternary will
1297 # further get cleaned up by the boolean reductions above and we will be
1298 # left with just the original variable "a".
1299 for op
in ['flt', 'fge', 'feq', 'fne',
1300 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
1302 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
1303 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
1304 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
1305 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
1309 # For example, this converts things like
1311 # 1 + mix(0, a - 1, condition)
1315 # mix(1, (a-1)+1, condition)
1317 # Other optimizations will rearrange the constants.
1318 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
1320 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
1323 # For derivatives in compute shaders, GLSL_NV_compute_shader_derivatives
1326 # If neither layout qualifier is specified, derivatives in compute shaders
1327 # return zero, which is consistent with the handling of built-in texture
1328 # functions like texture() in GLSL 4.50 compute shaders.
1329 for op
in ['fddx', 'fddx_fine', 'fddx_coarse',
1330 'fddy', 'fddy_fine', 'fddy_coarse']:
1332 ((op
, 'a'), 0.0, 'info->stage == MESA_SHADER_COMPUTE && info->cs.derivative_group == DERIVATIVE_GROUP_NONE')
1335 # Some optimizations for ir3-specific instructions.
1337 # 'al * bl': If either 'al' or 'bl' is zero, return zero.
1338 (('umul_low', '#a(is_lower_half_zero)', 'b'), (0)),
1339 # '(ah * bl) << 16 + c': If either 'ah' or 'bl' is zero, return 'c'.
1340 (('imadsh_mix16', '#a@32(is_lower_half_zero)', 'b@32', 'c@32'), ('c')),
1341 (('imadsh_mix16', 'a@32', '#b@32(is_upper_half_zero)', 'c@32'), ('c')),
1344 # This section contains "late" optimizations that should be run before
1345 # creating ffmas and calling regular optimizations for the final time.
1346 # Optimizations should go here if they help code generation and conflict
1347 # with the regular optimizations.
1348 before_ffma_optimizations
= [
1349 # Propagate constants down multiplication chains
1350 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
1351 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
1352 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
1353 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
1355 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
1356 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
1357 (('~fadd', ('fneg', a
), a
), 0.0),
1358 (('iadd', ('ineg', a
), a
), 0),
1359 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
1360 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
1361 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
1362 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
1364 (('~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
)),
1365 (('~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
)),
1366 (('~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
))),
1369 # This section contains "late" optimizations that should be run after the
1370 # regular optimizations have finished. Optimizations should go here if
1371 # they help code generation but do not necessarily produce code that is
1372 # more easily optimizable.
1373 late_optimizations
= [
1374 # Most of these optimizations aren't quite safe when you get infinity or
1375 # Nan involved but the first one should be fine.
1376 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
1377 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
1378 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
1379 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
1380 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
1381 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
1383 # nir_lower_to_source_mods will collapse this, but its existence during the
1384 # optimization loop can prevent other optimizations.
1385 (('fneg', ('fneg', a
)), a
),
1387 # These are duplicated from the main optimizations table. The late
1388 # patterns that rearrange expressions like x - .5 < 0 to x < .5 can create
1389 # new patterns like these. The patterns that compare with zero are removed
1390 # because they are unlikely to be created in by anything in
1391 # late_optimizations.
1392 (('flt', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('flt', a
, b
)),
1393 (('flt', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('flt', b
, a
)),
1394 (('fge', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fge', a
, b
)),
1395 (('fge', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('fge', b
, a
)),
1396 (('feq', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('feq', a
, b
)),
1397 (('fne', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fne', a
, b
)),
1399 (('fge', ('fsat(is_used_once)', a
), 1.0), ('fge', a
, 1.0)),
1400 (('flt', ('fsat(is_used_once)', a
), 1.0), ('flt', a
, 1.0)),
1402 (('~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
)))),
1404 (('flt', ('fneg', a
), ('fneg', b
)), ('flt', b
, a
)),
1405 (('fge', ('fneg', a
), ('fneg', b
)), ('fge', b
, a
)),
1406 (('feq', ('fneg', a
), ('fneg', b
)), ('feq', b
, a
)),
1407 (('fne', ('fneg', a
), ('fneg', b
)), ('fne', b
, a
)),
1408 (('flt', ('fneg', a
), -1.0), ('flt', 1.0, a
)),
1409 (('flt', -1.0, ('fneg', a
)), ('flt', a
, 1.0)),
1410 (('fge', ('fneg', a
), -1.0), ('fge', 1.0, a
)),
1411 (('fge', -1.0, ('fneg', a
)), ('fge', a
, 1.0)),
1412 (('fne', ('fneg', a
), -1.0), ('fne', 1.0, a
)),
1413 (('feq', -1.0, ('fneg', a
)), ('feq', a
, 1.0)),
1416 (('iand', a
, a
), a
),
1418 (('~fadd', ('fneg(is_used_once)', ('fsat(is_used_once)', 'a(is_not_fmul)')), 1.0), ('fsat', ('fadd', 1.0, ('fneg', a
)))),
1420 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
1421 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
1422 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
1423 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
1425 (('~flrp@32', ('fadd(is_used_once)', a
, b
), ('fadd(is_used_once)', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
)),
1426 (('~flrp@64', ('fadd(is_used_once)', a
, b
), ('fadd(is_used_once)', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
)),
1428 (('~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'),
1429 (('~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'),
1431 # A similar operation could apply to any ffma(#a, b, #(-a/2)), but this
1432 # particular operation is common for expanding values stored in a texture
1433 # from [0,1] to [-1,1].
1434 (('~ffma@32', a
, 2.0, -1.0), ('flrp', -1.0, 1.0, a
), '!options->lower_flrp32'),
1435 (('~ffma@32', a
, -2.0, -1.0), ('flrp', -1.0, 1.0, ('fneg', a
)), '!options->lower_flrp32'),
1436 (('~ffma@32', a
, -2.0, 1.0), ('flrp', 1.0, -1.0, a
), '!options->lower_flrp32'),
1437 (('~ffma@32', a
, 2.0, 1.0), ('flrp', 1.0, -1.0, ('fneg', a
)), '!options->lower_flrp32'),
1438 (('~fadd@32', ('fmul(is_used_once)', 2.0, a
), -1.0), ('flrp', -1.0, 1.0, a
), '!options->lower_flrp32'),
1439 (('~fadd@32', ('fmul(is_used_once)', -2.0, a
), -1.0), ('flrp', -1.0, 1.0, ('fneg', a
)), '!options->lower_flrp32'),
1440 (('~fadd@32', ('fmul(is_used_once)', -2.0, a
), 1.0), ('flrp', 1.0, -1.0, a
), '!options->lower_flrp32'),
1441 (('~fadd@32', ('fmul(is_used_once)', 2.0, a
), 1.0), ('flrp', 1.0, -1.0, ('fneg', a
)), '!options->lower_flrp32'),
1445 # a + -a*a + a*b (1)
1447 # Option 1: ffma(a, (b-a), a)
1449 # Alternately, after (1):
1455 # Option 2: ffma(a, 2, -(a*a))
1456 # Option 3: ffma(a, 2, (-a)*a)
1457 # Option 4: ffma(a, -a, (2*a)
1458 # Option 5: a * (2 - a)
1460 # There are a lot of other possible combinations.
1461 (('~ffma@32', ('fadd', b
, ('fneg', a
)), a
, a
), ('flrp', a
, b
, a
), '!options->lower_flrp32'),
1462 (('~ffma@32', a
, 2.0, ('fneg', ('fmul', a
, a
))), ('flrp', a
, 1.0, a
), '!options->lower_flrp32'),
1463 (('~ffma@32', a
, 2.0, ('fmul', ('fneg', a
), a
)), ('flrp', a
, 1.0, a
), '!options->lower_flrp32'),
1464 (('~ffma@32', a
, ('fneg', a
), ('fmul', 2.0, a
)), ('flrp', a
, 1.0, a
), '!options->lower_flrp32'),
1465 (('~fmul@32', a
, ('fadd', 2.0, ('fneg', a
))), ('flrp', a
, 1.0, a
), '!options->lower_flrp32'),
1467 # we do these late so that we don't get in the way of creating ffmas
1468 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
1469 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
1471 (('bcsel', a
, 0, ('b2f32', ('inot', 'b@bool'))), ('b2f32', ('inot', ('ior', a
, b
)))),
1473 # Things that look like DPH in the source shader may get expanded to
1474 # something that looks like dot(v1.xyz, v2.xyz) + v1.w by the time it gets
1475 # to NIR. After FFMA is generated, this can look like:
1477 # fadd(ffma(v1.z, v2.z, ffma(v1.y, v2.y, fmul(v1.x, v2.x))), v1.w)
1479 # Reassociate the last addition into the first multiplication.
1480 (('~fadd', ('ffma(is_used_once)', a
, b
, ('ffma', c
, d
, ('fmul', 'e(is_not_const_and_not_fsign)', 'f(is_not_const_and_not_fsign)'))), 'g(is_not_const)'),
1481 ('ffma', a
, b
, ('ffma', c
, d
, ('ffma', e
, 'f', 'g'))), '!options->intel_vec4'),
1482 (('~fadd', ('ffma(is_used_once)', a
, b
, ('fmul', 'e(is_not_const_and_not_fsign)', 'f(is_not_const_and_not_fsign)') ), 'g(is_not_const)'),
1483 ('ffma', a
, b
, ('ffma', e
, 'f', 'g') ), '!options->intel_vec4'),
1486 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render())
1487 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
1488 before_ffma_optimizations
).render())
1489 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
1490 late_optimizations
).render())
projects / mesa.git / blob