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
33 # Convenience variables
40 # Written in the form (<search>, <replace>) where <search> is an expression
41 # and <replace> is either an expression or a value. An expression is
42 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
43 # where each source is either an expression or a value. A value can be
44 # either a numeric constant or a string representing a variable name.
46 # If the opcode in a search expression is prefixed by a '~' character, this
47 # indicates that the operation is inexact. Such operations will only get
48 # applied to SSA values that do not have the exact bit set. This should be
49 # used by by any optimizations that are not bit-for-bit exact. It should not,
50 # however, be used for backend-requested lowering operations as those need to
51 # happen regardless of precision.
53 # Variable names are specified as "[#]name[@type][(cond)]" where "#" inicates
54 # that the given variable will only match constants and the type indicates that
55 # the given variable will only match values from ALU instructions with the
56 # given output type, and (cond) specifies an additional condition function
57 # (see nir_search_helpers.h).
59 # For constants, you have to be careful to make sure that it is the right
60 # type because python is unaware of the source and destination types of the
63 # All expression types can have a bit-size specified. For opcodes, this
64 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
65 # type and size. In the search half of the expression this indicates that it
66 # should only match that particular bit-size. In the replace half of the
67 # expression this indicates that the constructed value should have that
72 (('imul', a
, '#b@32(is_pos_power_of_two)'), ('ishl', a
, ('find_lsb', b
)), '!options->lower_bitshift'),
73 (('imul', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a
, ('find_lsb', ('iabs', b
)))), '!options->lower_bitshift'),
74 (('ishl', a
, '#b@32'), ('imul', a
, ('ishl', 1, b
)), 'options->lower_bitshift'),
76 (('unpack_64_2x32_split_x', ('imul_2x32_64(is_used_once)', a
, b
)), ('imul', a
, b
)),
77 (('unpack_64_2x32_split_x', ('umul_2x32_64(is_used_once)', a
, b
)), ('imul', a
, b
)),
78 (('imul_2x32_64', a
, b
), ('pack_64_2x32_split', ('imul', a
, b
), ('imul_high', a
, b
)), 'options->lower_mul_2x32_64'),
79 (('umul_2x32_64', a
, b
), ('pack_64_2x32_split', ('imul', a
, b
), ('umul_high', a
, b
)), 'options->lower_mul_2x32_64'),
84 (('udiv', a
, '#b@32(is_pos_power_of_two)'), ('ushr', a
, ('find_lsb', b
)), '!options->lower_bitshift'),
85 (('idiv', a
, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', b
))), 'options->lower_idiv'),
86 (('idiv', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', ('iabs', b
))))), 'options->lower_idiv'),
87 (('umod', a
, '#b(is_pos_power_of_two)'), ('iand', a
, ('isub', b
, 1))),
89 (('fneg', ('fneg', a
)), a
),
90 (('ineg', ('ineg', a
)), a
),
91 (('fabs', ('fabs', a
)), ('fabs', a
)),
92 (('fabs', ('fneg', a
)), ('fabs', a
)),
93 (('fabs', ('u2f', a
)), ('u2f', a
)),
94 (('iabs', ('iabs', a
)), ('iabs', a
)),
95 (('iabs', ('ineg', a
)), ('iabs', a
)),
96 (('f2b', ('fneg', a
)), ('f2b', a
)),
97 (('i2b', ('ineg', a
)), ('i2b', a
)),
98 (('~fadd', a
, 0.0), a
),
100 (('usadd_4x8', a
, 0), a
),
101 (('usadd_4x8', a
, ~
0), ~
0),
102 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
103 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
104 (('~fadd', ('fneg', a
), a
), 0.0),
105 (('iadd', ('ineg', a
), a
), 0),
106 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
107 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
108 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
109 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
110 (('fadd', ('fsat', a
), ('fsat', ('fneg', a
))), ('fsat', ('fabs', a
))),
111 (('~fmul', a
, 0.0), 0.0),
113 (('umul_unorm_4x8', a
, 0), 0),
114 (('umul_unorm_4x8', a
, ~
0), a
),
115 (('fmul', a
, 1.0), a
),
117 (('fmul', a
, -1.0), ('fneg', a
)),
118 (('imul', a
, -1), ('ineg', a
)),
119 # If a < 0: fsign(a)*a*a => -1*a*a => -a*a => abs(a)*a
120 # If a > 0: fsign(a)*a*a => 1*a*a => a*a => abs(a)*a
121 # If a == 0: fsign(a)*a*a => 0*0*0 => abs(0)*0
122 (('fmul', ('fsign', a
), ('fmul', a
, a
)), ('fmul', ('fabs', a
), a
)),
123 (('fmul', ('fmul', ('fsign', a
), a
), a
), ('fmul', ('fabs', a
), a
)),
124 (('~ffma', 0.0, a
, b
), b
),
125 (('~ffma', a
, b
, 0.0), ('fmul', a
, b
)),
126 (('ffma', 1.0, a
, b
), ('fadd', a
, b
)),
127 (('ffma', -1.0, a
, b
), ('fadd', ('fneg', a
), b
)),
128 (('~flrp', a
, b
, 0.0), a
),
129 (('~flrp', a
, b
, 1.0), b
),
130 (('~flrp', a
, a
, b
), a
),
131 (('~flrp', 0.0, a
, b
), ('fmul', a
, b
)),
133 # flrp(a, a + b, c) => a + flrp(0, b, c) => a + (b * c)
134 (('~flrp', a
, ('fadd(is_used_once)', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
)),
135 (('~flrp@32', a
, ('fadd', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
), 'options->lower_flrp32'),
136 (('~flrp@64', a
, ('fadd', a
, b
), c
), ('fadd', ('fmul', b
, c
), a
), 'options->lower_flrp64'),
138 (('~flrp@32', ('fadd', a
, b
), ('fadd', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
), 'options->lower_flrp32'),
139 (('~flrp@64', ('fadd', a
, b
), ('fadd', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
), 'options->lower_flrp64'),
141 (('~flrp@32', a
, ('fmul(is_used_once)', a
, b
), c
), ('fmul', ('flrp', 1.0, b
, c
), a
), 'options->lower_flrp32'),
142 (('~flrp@64', a
, ('fmul(is_used_once)', a
, b
), c
), ('fmul', ('flrp', 1.0, b
, c
), a
), 'options->lower_flrp64'),
144 (('~flrp', ('fmul(is_used_once)', a
, b
), ('fmul(is_used_once)', a
, c
), d
), ('fmul', ('flrp', b
, c
, d
), a
)),
146 (('~flrp', a
, b
, ('b2f', 'c@1')), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
147 (('~flrp', a
, 0.0, c
), ('fadd', ('fmul', ('fneg', a
), c
), a
)),
148 (('ftrunc', a
), ('bcsel', ('flt', a
, 0.0), ('fneg', ('ffloor', ('fabs', a
))), ('ffloor', ('fabs', a
))), 'options->lower_ftrunc'),
149 (('ffloor', a
), ('fsub', a
, ('ffract', a
)), 'options->lower_ffloor'),
150 (('fadd', a
, ('fneg', ('ffract', a
))), ('ffloor', a
), '!options->lower_ffloor'),
151 (('ffract', a
), ('fsub', a
, ('ffloor', a
)), 'options->lower_ffract'),
152 (('fceil', a
), ('fneg', ('ffloor', ('fneg', a
))), 'options->lower_fceil'),
153 (('~fadd', ('fmul', a
, ('fadd', 1.0, ('fneg', ('b2f', 'c@1')))), ('fmul', b
, ('b2f', c
))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
154 (('~fadd@32', ('fmul', a
, ('fadd', 1.0, ('fneg', c
) )), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
155 (('~fadd@64', ('fmul', a
, ('fadd', 1.0, ('fneg', c
) )), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
156 # These are the same as the previous three rules, but it depends on
157 # 1-fsat(x) <=> fsat(1-x). See below.
158 (('~fadd@32', ('fmul', a
, ('fsat', ('fadd', 1.0, ('fneg', c
)))), ('fmul', b
, ('fsat', c
))), ('flrp', a
, b
, ('fsat', c
)), '!options->lower_flrp32'),
159 (('~fadd@64', ('fmul', a
, ('fsat', ('fadd', 1.0, ('fneg', c
)))), ('fmul', b
, ('fsat', c
))), ('flrp', a
, b
, ('fsat', c
)), '!options->lower_flrp64'),
161 (('~fadd', a
, ('fmul', ('b2f', 'c@1'), ('fadd', b
, ('fneg', a
)))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
162 (('~fadd@32', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
163 (('~fadd@64', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
164 (('ffma', a
, b
, c
), ('fadd', ('fmul', a
, b
), c
), 'options->lower_ffma'),
165 (('~fadd', ('fmul', a
, b
), c
), ('ffma', a
, b
, c
), 'options->fuse_ffma'),
167 (('~fmul', ('fadd', ('iand', ('ineg', ('b2i32', 'a@bool')), ('fmul', b
, c
)), '#d'), '#e'),
168 ('bcsel', a
, ('fmul', ('fadd', ('fmul', b
, c
), d
), e
), ('fmul', d
, e
))),
170 (('fdot4', ('vec4', a
, b
, c
, 1.0), d
), ('fdph', ('vec3', a
, b
, c
), d
)),
171 (('fdot4', ('vec4', a
, 0.0, 0.0, 0.0), b
), ('fmul', a
, b
)),
172 (('fdot4', ('vec4', a
, b
, 0.0, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
173 (('fdot4', ('vec4', a
, b
, c
, 0.0), d
), ('fdot3', ('vec3', a
, b
, c
), d
)),
175 (('fdot3', ('vec3', a
, 0.0, 0.0), b
), ('fmul', a
, b
)),
176 (('fdot3', ('vec3', a
, b
, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
178 # If x >= 0 and x <= 1: fsat(1 - x) == 1 - fsat(x) trivially
179 # If x < 0: 1 - fsat(x) => 1 - 0 => 1 and fsat(1 - x) => fsat(> 1) => 1
180 # If x > 1: 1 - fsat(x) => 1 - 1 => 0 and fsat(1 - x) => fsat(< 0) => 0
181 (('~fadd', ('fneg(is_used_once)', ('fsat(is_used_once)', 'a(is_not_fmul)')), 1.0), ('fsat', ('fadd', 1.0, ('fneg', a
)))),
183 # (a * #b + #c) << #d
184 # ((a * #b) << #d) + (#c << #d)
185 # (a * (#b << #d)) + (#c << #d)
186 (('ishl', ('iadd', ('imul', a
, '#b'), '#c'), '#d'),
187 ('iadd', ('imul', a
, ('ishl', b
, d
)), ('ishl', c
, d
))),
191 (('ishl', ('imul', a
, '#b'), '#c'), ('imul', a
, ('ishl', b
, c
))),
193 # Comparison simplifications
194 (('~inot', ('flt', a
, b
)), ('fge', a
, b
)),
195 (('~inot', ('fge', a
, b
)), ('flt', a
, b
)),
196 (('~inot', ('feq', a
, b
)), ('fne', a
, b
)),
197 (('~inot', ('fne', a
, b
)), ('feq', a
, b
)),
198 (('inot', ('ilt', a
, b
)), ('ige', a
, b
)),
199 (('inot', ('ult', a
, b
)), ('uge', a
, b
)),
200 (('inot', ('ige', a
, b
)), ('ilt', a
, b
)),
201 (('inot', ('uge', a
, b
)), ('ult', a
, b
)),
202 (('inot', ('ieq', a
, b
)), ('ine', a
, b
)),
203 (('inot', ('ine', a
, b
)), ('ieq', a
, b
)),
205 # This helps some shaders because, after some optimizations, they end up
206 # with patterns like (-a < -b) || (b < a). In an ideal world, this sort of
207 # matching would be handled by CSE.
208 (('flt', ('fneg', a
), ('fneg', b
)), ('flt', b
, a
)),
209 (('fge', ('fneg', a
), ('fneg', b
)), ('fge', b
, a
)),
210 (('feq', ('fneg', a
), ('fneg', b
)), ('feq', b
, a
)),
211 (('fne', ('fneg', a
), ('fneg', b
)), ('fne', b
, a
)),
212 (('flt', ('fneg', a
), -1.0), ('flt', 1.0, a
)),
213 (('flt', -1.0, ('fneg', a
)), ('flt', a
, 1.0)),
214 (('fge', ('fneg', a
), -1.0), ('fge', 1.0, a
)),
215 (('fge', -1.0, ('fneg', a
)), ('fge', a
, 1.0)),
216 (('fne', ('fneg', a
), -1.0), ('fne', 1.0, a
)),
217 (('feq', -1.0, ('fneg', a
)), ('feq', a
, 1.0)),
219 (('flt', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('flt', a
, b
)),
220 (('flt', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('flt', b
, a
)),
221 (('fge', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fge', a
, b
)),
222 (('fge', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('fge', b
, a
)),
223 (('feq', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('feq', a
, b
)),
224 (('fne', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fne', a
, b
)),
226 (('fge', ('fsat(is_used_once)', a
), 1.0), ('fge', a
, 1.0)),
227 (('flt', ('fsat(is_used_once)', a
), 1.0), ('flt', a
, 1.0)),
228 (('fge', 0.0, ('fsat(is_used_once)', a
)), ('fge', 0.0, a
)),
229 (('flt', 0.0, ('fsat(is_used_once)', a
)), ('flt', 0.0, a
)),
233 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
235 (('fge', 0.0, ('b2f', 'a@1')), ('inot', a
)),
237 (('fge', ('fneg', ('b2f', 'a@1')), 0.0), ('inot', a
)),
239 (('fne', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
240 (('fne', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
241 (('fne', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('ior', a
, b
)),
242 (('fne', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('ior', a
, b
)),
243 (('fne', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
244 (('fne', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
245 (('fne', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('iand', a
, b
)),
246 (('fne', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ixor', a
, b
)),
247 (('fne', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ixor', a
, b
)),
248 (('fne', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ixor', a
, b
)),
249 (('feq', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
250 (('feq', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
251 (('feq', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('inot', ('ior', a
, b
))),
252 (('feq', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
253 (('feq', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
254 (('feq', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
255 (('feq', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('inot', ('iand', a
, b
))),
256 (('feq', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ieq', a
, b
)),
257 (('feq', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ieq', a
, b
)),
258 (('feq', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ieq', a
, b
)),
260 # -(b2f(a) + b2f(b)) < 0
261 # 0 < b2f(a) + b2f(b)
262 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
264 (('flt', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('ior', a
, b
)),
265 (('flt', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('ior', a
, b
)),
267 # -(b2f(a) + b2f(b)) >= 0
268 # 0 >= b2f(a) + b2f(b)
269 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
271 (('fge', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('inot', ('ior', a
, b
))),
272 (('fge', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
274 (('flt', a
, ('fneg', a
)), ('flt', a
, 0.0)),
275 (('fge', a
, ('fneg', a
)), ('fge', a
, 0.0)),
277 # Some optimizations (below) convert things like (a < b || c < b) into
278 # (min(a, c) < b). However, this interfers with the previous optimizations
279 # that try to remove comparisons with negated sums of b2f. This just
281 (('flt', ('fmin', c
, ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')))), 0.0),
282 ('ior', ('flt', c
, 0.0), ('ior', a
, b
))),
284 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
285 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
286 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
287 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
289 # Cannot remove the addition from ilt or ige due to overflow.
290 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
291 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
293 # fmin(-b2f(a), b) >= 0.0
294 # -b2f(a) >= 0.0 && b >= 0.0
295 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
296 # b2f(a) == 0.0 && b >= 0.0
297 # a == False && b >= 0.0
300 # The fge in the second replacement is not a typo. I leave the proof that
301 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
303 (('fge', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
304 (('feq', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
306 (('feq', ('b2f', 'a@1'), 0.0), ('inot', a
)),
307 (('fne', ('b2f', 'a@1'), 0.0), a
),
308 (('ieq', ('b2i', 'a@1'), 0), ('inot', a
)),
309 (('ine', ('b2i', 'a@1'), 0), a
),
311 (('fne', ('u2f', a
), 0.0), ('ine', a
, 0)),
312 (('feq', ('u2f', a
), 0.0), ('ieq', a
, 0)),
313 (('fge', ('u2f', a
), 0.0), True),
314 (('fge', 0.0, ('u2f', a
)), ('uge', 0, a
)), # ieq instead?
315 (('flt', ('u2f', a
), 0.0), False),
316 (('flt', 0.0, ('u2f', a
)), ('ult', 0, a
)), # ine instead?
317 (('fne', ('i2f', a
), 0.0), ('ine', a
, 0)),
318 (('feq', ('i2f', a
), 0.0), ('ieq', a
, 0)),
319 (('fge', ('i2f', a
), 0.0), ('ige', a
, 0)),
320 (('fge', 0.0, ('i2f', a
)), ('ige', 0, a
)),
321 (('flt', ('i2f', a
), 0.0), ('ilt', a
, 0)),
322 (('flt', 0.0, ('i2f', a
)), ('ilt', 0, a
)),
326 # fabs(a) != 0.0 because fabs(a) must be >= 0
328 (('~flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
332 (('~flt', ('fneg', ('fabs', a
)), 0.0), ('fne', a
, 0.0)),
335 # 0.0 == fabs(a) because fabs(a) must be >= 0
337 (('fge', 0.0, ('fabs', a
)), ('feq', a
, 0.0)),
341 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
343 (('fmax', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('ior', a
, b
))),
344 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('ior', a
, b
)))),
345 (('fmin', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
346 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('iand', a
, b
)))),
349 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
350 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
351 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
353 # Since b is a constant, constant folding will eliminate the fmin and the
354 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
355 (('fmin', ('b2f', 'a@1'), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
357 (('flt', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
359 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
360 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
361 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
362 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
363 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
364 (('bcsel', ('i2b', a
), b
, c
), ('bcsel', ('ine', a
, 0), b
, c
)),
365 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
366 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
367 (('bcsel', a
, b
, ('bcsel', a
, c
, d
)), ('bcsel', a
, b
, d
)),
368 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
369 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
370 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
371 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
372 (('bcsel', a
, True, b
), ('ior', a
, b
)),
373 (('bcsel', a
, a
, b
), ('ior', a
, b
)),
374 (('bcsel', a
, b
, False), ('iand', a
, b
)),
375 (('bcsel', a
, b
, a
), ('iand', a
, b
)),
382 (('fmax', ('fmax', a
, b
), b
), ('fmax', a
, b
)),
383 (('umax', ('umax', a
, b
), b
), ('umax', a
, b
)),
384 (('imax', ('imax', a
, b
), b
), ('imax', a
, b
)),
385 (('fmin', ('fmin', a
, b
), b
), ('fmin', a
, b
)),
386 (('umin', ('umin', a
, b
), b
), ('umin', a
, b
)),
387 (('imin', ('imin', a
, b
), b
), ('imin', a
, b
)),
388 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
389 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
390 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
391 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
392 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
393 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
394 (('fmin', a
, ('fabs', a
)), a
),
395 (('imin', a
, ('iabs', a
)), a
),
396 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
397 (('imax', a
, ('ineg', ('iabs', a
))), a
),
398 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
399 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
400 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
401 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
402 (('~fmax', ('fabs', a
), 0.0), ('fabs', a
)),
403 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
404 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
405 (('~fmin', ('fmax', a
, -1.0), 0.0), ('fneg', ('fsat', ('fneg', a
))), '!options->lower_negate && !options->lower_fsat'),
406 (('~fmax', ('fmin', a
, 0.0), -1.0), ('fneg', ('fsat', ('fneg', a
))), '!options->lower_negate && !options->lower_fsat'),
407 (('fsat', ('fsign', a
)), ('b2f', ('flt', 0.0, a
))),
408 (('fsat', ('b2f', a
)), ('b2f', a
)),
409 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
410 (('fsat', ('fsat', a
)), ('fsat', a
)),
411 (('fsat', ('fneg(is_used_once)', ('fadd(is_used_once)', a
, b
))), ('fsat', ('fadd', ('fneg', a
), ('fneg', b
))), '!options->lower_negate && !options->lower_fsat'),
412 (('fsat', ('fneg(is_used_once)', ('fmul(is_used_once)', a
, b
))), ('fsat', ('fmul', ('fneg', a
), b
)), '!options->lower_negate && !options->lower_fsat'),
413 (('fsat', ('fabs(is_used_once)', ('fmul(is_used_once)', a
, b
))), ('fsat', ('fmul', ('fabs', a
), ('fabs', b
))), '!options->lower_fsat'),
414 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
415 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
416 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
417 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
418 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
419 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
420 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
421 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
422 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
423 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
424 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
425 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
426 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
427 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
428 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
429 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
430 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
431 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
432 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
433 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
434 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
435 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
437 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
438 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
439 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
440 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
441 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
442 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
443 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
444 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
445 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
446 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
447 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
448 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
449 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
450 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
451 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
452 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
454 # Common pattern like 'if (i == 0 || i == 1 || ...)'
455 (('ior', ('ieq', a
, 0), ('ieq', a
, 1)), ('uge', 1, a
)),
456 (('ior', ('uge', 1, a
), ('ieq', a
, 2)), ('uge', 2, a
)),
457 (('ior', ('uge', 2, a
), ('ieq', a
, 3)), ('uge', 3, a
)),
459 # The (i2f32, ...) part is an open-coded fsign. When that is combined with
460 # the bcsel, it's basically copysign(1.0, a). There is no copysign in NIR,
461 # so emit an open-coded version of that.
462 (('bcsel@32', ('feq', a
, 0.0), 1.0, ('i2f32', ('iadd', ('b2i32', ('flt', 0.0, 'a@32')), ('ineg', ('b2i32', ('flt', 'a@32', 0.0)))))),
463 ('ior', 0x3f800000, ('iand', a
, 0x80000000))),
465 (('ior', a
, ('ieq', a
, False)), True),
466 (('ior', a
, ('inot', a
)), -1),
468 (('ine', ('ineg', ('b2i32', 'a@1')), ('ineg', ('b2i32', 'b@1'))), ('ine', a
, b
)),
469 (('b2i32', ('ine', 'a@1', 'b@1')), ('b2i32', ('ixor', a
, b
))),
471 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0)),
473 # These patterns can result when (a < b || a < c) => (a < min(b, c))
474 # transformations occur before constant propagation and loop-unrolling.
475 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
476 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
477 (('~fge', a
, ('fmin', b
, a
)), True),
478 (('~fge', ('fmax', a
, b
), a
), True),
479 (('~flt', a
, ('fmin', b
, a
)), False),
480 (('~flt', ('fmax', a
, b
), a
), False),
481 (('~fge', a
, ('fmax', b
, a
)), ('fge', a
, b
)),
482 (('~fge', ('fmin', a
, b
), a
), ('fge', b
, a
)),
484 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
485 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
486 (('ige', a
, ('imin', b
, a
)), True),
487 (('ige', ('imax', a
, b
), a
), True),
488 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
489 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
490 (('uge', a
, ('umin', b
, a
)), True),
491 (('uge', ('umax', a
, b
), a
), True),
492 (('ilt', a
, ('imin', b
, a
)), False),
493 (('ilt', ('imax', a
, b
), a
), False),
494 (('ige', a
, ('imax', b
, a
)), ('ige', a
, b
)),
495 (('ige', ('imin', a
, b
), a
), ('ige', b
, a
)),
496 (('ult', a
, ('umin', b
, a
)), False),
497 (('ult', ('umax', a
, b
), a
), False),
498 (('uge', a
, ('umax', b
, a
)), ('uge', a
, b
)),
499 (('uge', ('umin', a
, b
), a
), ('uge', b
, a
)),
501 (('ilt', '#a', ('imax', '#b', c
)), ('ior', ('ilt', a
, b
), ('ilt', a
, c
))),
502 (('ilt', ('imin', '#a', b
), '#c'), ('ior', ('ilt', a
, c
), ('ilt', b
, c
))),
503 (('ige', '#a', ('imin', '#b', c
)), ('ior', ('ige', a
, b
), ('ige', a
, c
))),
504 (('ige', ('imax', '#a', b
), '#c'), ('ior', ('ige', a
, c
), ('ige', b
, c
))),
505 (('ult', '#a', ('umax', '#b', c
)), ('ior', ('ult', a
, b
), ('ult', a
, c
))),
506 (('ult', ('umin', '#a', b
), '#c'), ('ior', ('ult', a
, c
), ('ult', b
, c
))),
507 (('uge', '#a', ('umin', '#b', c
)), ('ior', ('uge', a
, b
), ('uge', a
, c
))),
508 (('uge', ('umax', '#a', b
), '#c'), ('ior', ('uge', a
, c
), ('uge', b
, c
))),
509 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
510 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
511 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
512 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
513 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
514 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
515 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
516 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
518 # Thanks to sign extension, the ishr(a, b) is negative if and only if a is
520 (('bcsel', ('ilt', a
, 0), ('ineg', ('ishr', a
, b
)), ('ishr', a
, b
)),
521 ('iabs', ('ishr', a
, b
))),
522 (('iabs', ('ishr', ('iabs', a
), b
)), ('ishr', ('iabs', a
), b
)),
524 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
525 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
526 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
527 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
528 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
529 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
530 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
531 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
532 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
533 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
535 (('imul', ('b2i', 'a@1'), ('b2i', 'b@1')), ('b2i', ('iand', a
, b
))),
536 (('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
537 (('fsat', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('b2f', ('ior', a
, b
))),
538 (('iand', 'a@bool32', 1.0), ('b2f', a
)),
539 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
540 (('ineg', ('b2i32', 'a@32')), a
),
541 (('flt', ('fneg', ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
542 (('flt', ('fsub', 0.0, ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
543 # Comparison with the same args. Note that these are not done for
544 # the float versions because NaN always returns false on float
546 (('ilt', a
, a
), False),
547 (('ige', a
, a
), True),
548 (('ieq', a
, a
), True),
549 (('ine', a
, a
), False),
550 (('ult', a
, a
), False),
551 (('uge', a
, a
), True),
552 # Logical and bit operations
553 (('fand', a
, 0.0), 0.0),
555 (('iand', a
, ~
0), a
),
559 (('ior', a
, True), True),
560 (('fxor', a
, a
), 0.0),
563 (('inot', ('inot', a
)), a
),
564 (('ior', ('iand', a
, b
), b
), b
),
565 (('ior', ('ior', a
, b
), b
), ('ior', a
, b
)),
566 (('iand', ('ior', a
, b
), b
), b
),
567 (('iand', ('iand', a
, b
), b
), ('iand', a
, b
)),
569 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
570 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
571 # Shift optimizations
578 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
579 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
580 # Exponential/logarithmic identities
581 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
582 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
583 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
584 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
585 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
586 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
587 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
588 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
589 (('~fpow', a
, 1.0), a
),
590 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
591 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
592 (('~fpow', 2.0, a
), ('fexp2', a
)),
593 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
594 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
595 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
596 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
597 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
598 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
599 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
600 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
601 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
602 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
603 (('bcsel', ('flt', a
, 0.0), 0.0, ('fsqrt', a
)), ('fsqrt', ('fmax', a
, 0.0))),
604 # Division and reciprocal
605 (('~fdiv', 1.0, a
), ('frcp', a
)),
606 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
607 (('~frcp', ('frcp', a
)), a
),
608 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
609 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
610 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
611 # Boolean simplifications
612 (('i2b32(is_used_by_if)', a
), ('ine32', a
, 0)),
613 (('i2b1(is_used_by_if)', a
), ('ine', a
, 0)),
614 (('ieq', a
, True), a
),
615 (('ine(is_not_used_by_if)', a
, True), ('inot', a
)),
616 (('ine', a
, False), a
),
617 (('ieq(is_not_used_by_if)', a
, False), ('inot', 'a')),
618 (('bcsel', a
, True, False), a
),
619 (('bcsel', a
, False, True), ('inot', a
)),
620 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
621 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
622 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
623 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
624 (('bcsel', True, b
, c
), b
),
625 (('bcsel', False, b
, c
), c
),
626 (('bcsel', a
, ('b2f(is_used_once)', 'b@32'), ('b2f', 'c@32')), ('b2f', ('bcsel', a
, b
, c
))),
628 (('bcsel', a
, b
, b
), b
),
629 (('fcsel', a
, b
, b
), b
),
631 # D3D Boolean emulation
632 (('bcsel', a
, -1, 0), ('ineg', ('b2i', 'a@1'))),
633 (('bcsel', a
, 0, -1), ('ineg', ('b2i', ('inot', a
)))),
634 (('iand', ('ineg', ('b2i', 'a@1')), ('ineg', ('b2i', 'b@1'))),
635 ('ineg', ('b2i', ('iand', a
, b
)))),
636 (('ior', ('ineg', ('b2i','a@1')), ('ineg', ('b2i', 'b@1'))),
637 ('ineg', ('b2i', ('ior', a
, b
)))),
638 (('ieq', ('ineg', ('b2i', 'a@1')), 0), ('inot', a
)),
639 (('ieq', ('ineg', ('b2i', 'a@1')), -1), a
),
640 (('ine', ('ineg', ('b2i', 'a@1')), 0), a
),
641 (('ine', ('ineg', ('b2i', 'a@1')), -1), ('inot', a
)),
642 (('iand', ('ineg', ('b2i', a
)), 1.0), ('b2f', a
)),
644 # SM5 32-bit shifts are defined to use the 5 least significant bits
645 (('ishl', 'a@32', ('iand', 31, b
)), ('ishl', a
, b
)),
646 (('ishr', 'a@32', ('iand', 31, b
)), ('ishr', a
, b
)),
647 (('ushr', 'a@32', ('iand', 31, b
)), ('ushr', a
, b
)),
650 (('i2b32', ('b2i', 'a@32')), a
),
651 (('f2i', ('ftrunc', a
)), ('f2i', a
)),
652 (('f2u', ('ftrunc', a
)), ('f2u', a
)),
653 (('i2b', ('ineg', a
)), ('i2b', a
)),
654 (('i2b', ('iabs', a
)), ('i2b', a
)),
655 (('fabs', ('b2f', a
)), ('b2f', a
)),
656 (('iabs', ('b2i', a
)), ('b2i', a
)),
657 (('inot', ('f2b1', a
)), ('feq', a
, 0.0)),
659 # Ironically, mark these as imprecise because removing the conversions may
660 # preserve more precision than doing the conversions (e.g.,
661 # uint(float(0x81818181u)) == 0x81818200).
662 (('~f2i32', ('i2f', 'a@32')), a
),
663 (('~f2i32', ('u2f', 'a@32')), a
),
664 (('~f2u32', ('i2f', 'a@32')), a
),
665 (('~f2u32', ('u2f', 'a@32')), a
),
667 # Section 5.4.1 (Conversion and Scalar Constructors) of the GLSL 4.60 spec
670 # It is undefined to convert a negative floating-point value to an
673 # Assuming that (uint)some_float behaves like (uint)(int)some_float allows
674 # some optimizations in the i965 backend to proceed.
675 (('ige', ('f2u', a
), b
), ('ige', ('f2i', a
), b
)),
676 (('ige', b
, ('f2u', a
)), ('ige', b
, ('f2i', a
))),
677 (('ilt', ('f2u', a
), b
), ('ilt', ('f2i', a
), b
)),
678 (('ilt', b
, ('f2u', a
)), ('ilt', b
, ('f2i', a
))),
680 (('~fmin', ('fabs', a
), 1.0), ('fsat', ('fabs', a
)), '!options->lower_fsat'),
682 # The result of the multiply must be in [-1, 0], so the result of the ffma
684 (('flt', ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0), 0.0), False),
685 (('flt', ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0), 0.0), False),
686 (('fmax', ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0), 0.0), ('fadd', ('fmul', ('fsat', a
), ('fneg', ('fsat', a
))), 1.0)),
687 (('fmax', ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0), 0.0), ('fadd', ('fneg', ('fmul', ('fsat', a
), ('fsat', a
))), 1.0)),
689 # Packing and then unpacking does nothing
690 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
691 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
692 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
693 ('unpack_64_2x32_split_y', a
)), a
),
696 (('ushr', 'a@16', 8), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
697 (('ushr', 'a@32', 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
698 (('ushr', 'a@64', 56), ('extract_u8', a
, 7), '!options->lower_extract_byte'),
699 (('ishr', 'a@16', 8), ('extract_i8', a
, 1), '!options->lower_extract_byte'),
700 (('ishr', 'a@32', 24), ('extract_i8', a
, 3), '!options->lower_extract_byte'),
701 (('ishr', 'a@64', 56), ('extract_i8', a
, 7), '!options->lower_extract_byte'),
702 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte')
705 # After the ('extract_u8', a, 0) pattern, above, triggers, there will be
706 # patterns like those below.
707 for op
in ('ushr', 'ishr'):
708 optimizations
.extend([(('extract_u8', (op
, 'a@16', 8), 0), ('extract_u8', a
, 1))])
709 optimizations
.extend([(('extract_u8', (op
, 'a@32', 8 * i
), 0), ('extract_u8', a
, i
)) for i
in range(1, 4)])
710 optimizations
.extend([(('extract_u8', (op
, 'a@64', 8 * i
), 0), ('extract_u8', a
, i
)) for i
in range(1, 8)])
712 optimizations
.extend([(('extract_u8', ('extract_u16', a
, 1), 0), ('extract_u8', a
, 2))])
714 # After the ('extract_[iu]8', a, 3) patterns, above, trigger, there will be
715 # patterns like those below.
716 for op
in ('extract_u8', 'extract_i8'):
717 optimizations
.extend([((op
, ('ishl', 'a@16', 8), 1), (op
, a
, 0))])
718 optimizations
.extend([((op
, ('ishl', 'a@32', 24 - 8 * i
), 3), (op
, a
, i
)) for i
in range(2, -1, -1)])
719 optimizations
.extend([((op
, ('ishl', 'a@64', 56 - 8 * i
), 7), (op
, a
, i
)) for i
in range(6, -1, -1)])
721 optimizations
.extend([
723 (('ushr', ('ishl', 'a@32', 16), 16), ('extract_u16', a
, 0), '!options->lower_extract_word'),
724 (('ushr', 'a@32', 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
725 (('ishr', ('ishl', 'a@32', 16), 16), ('extract_i16', a
, 0), '!options->lower_extract_word'),
726 (('ishr', 'a@32', 16), ('extract_i16', a
, 1), '!options->lower_extract_word'),
727 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
730 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
731 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
732 (('ussub_4x8', a
, 0), a
),
733 (('ussub_4x8', a
, ~
0), 0),
734 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
735 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
736 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
737 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
738 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
739 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
740 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
741 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
743 # Propagate negation up multiplication chains
744 (('fmul(is_used_by_non_fsat)', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
745 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
747 # Propagate constants up multiplication chains
748 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
749 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
750 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
751 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
753 # Reassociate constants in add/mul chains so they can be folded together.
754 # For now, we mostly only handle cases where the constants are separated by
755 # a single non-constant. We could do better eventually.
756 (('~fmul', '#a', ('fmul', 'b(is_not_const)', '#c')), ('fmul', ('fmul', a
, c
), b
)),
757 (('imul', '#a', ('imul', 'b(is_not_const)', '#c')), ('imul', ('imul', a
, c
), b
)),
758 (('~fadd', '#a', ('fadd', 'b(is_not_const)', '#c')), ('fadd', ('fadd', a
, c
), b
)),
759 (('~fadd', '#a', ('fneg', ('fadd', 'b(is_not_const)', '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
760 (('iadd', '#a', ('iadd', 'b(is_not_const)', '#c')), ('iadd', ('iadd', a
, c
), b
)),
763 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
764 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
765 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
767 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
768 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
769 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
771 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
774 (('fmod@16', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod'),
775 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod'),
776 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod'),
777 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
778 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
780 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
781 ('bcsel', ('ilt', 31, 'bits'), 'insert',
782 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
783 'options->lower_bitfield_insert'),
784 (('ihadd', a
, b
), ('iadd', ('iand', a
, b
), ('ishr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
785 (('uhadd', a
, b
), ('iadd', ('iand', a
, b
), ('ushr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
786 (('irhadd', a
, b
), ('isub', ('ior', a
, b
), ('ishr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
787 (('urhadd', a
, b
), ('isub', ('ior', a
, b
), ('ushr', ('ixor', a
, b
), 1)), 'options->lower_hadd'),
788 (('uadd_sat', a
, b
), ('bcsel', ('ult', ('iadd', a
, b
), a
), -1, ('iadd', a
, b
)), 'options->lower_add_sat'),
789 (('usub_sat', a
, b
), ('bcsel', ('ult', a
, b
), 0, ('isub', a
, b
)), 'options->lower_add_sat'),
791 # Alternative lowering that doesn't rely on bfi.
792 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
793 ('bcsel', ('ilt', 31, 'bits'),
796 ('iand', 'base', ('inot', ('bfm', 'bits', 'offset'))),
797 ('iand', ('ishl', 'insert', 'offset'), ('bfm', 'bits', 'offset')))),
798 'options->lower_bitfield_insert_to_shifts'),
800 # bfm lowering -- note that the NIR opcode is undefined if either arg is 32.
801 (('bfm', 'bits', 'offset'),
802 ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'),
803 'options->lower_bfm'),
805 (('ibitfield_extract', 'value', 'offset', 'bits'),
806 ('bcsel', ('ilt', 31, 'bits'), 'value',
807 ('ibfe', 'value', 'offset', 'bits')),
808 'options->lower_bitfield_extract'),
810 (('ubitfield_extract', 'value', 'offset', 'bits'),
811 ('bcsel', ('ult', 31, 'bits'), 'value',
812 ('ubfe', 'value', 'offset', 'bits')),
813 'options->lower_bitfield_extract'),
815 (('ibitfield_extract', 'value', 'offset', 'bits'),
816 ('bcsel', ('ieq', 0, 'bits'),
819 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
820 ('isub', 32, 'bits'))),
821 'options->lower_bitfield_extract_to_shifts'),
823 (('ubitfield_extract', 'value', 'offset', 'bits'),
825 ('ushr', 'value', 'offset'),
826 ('bcsel', ('ieq', 'bits', 32),
828 ('bfm', 'bits', 0))),
829 'options->lower_bitfield_extract_to_shifts'),
831 (('ifind_msb', 'value'),
832 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
833 'options->lower_ifind_msb'),
835 (('find_lsb', 'value'),
836 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
837 'options->lower_find_lsb'),
839 (('extract_i8', a
, 'b@32'),
840 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
841 'options->lower_extract_byte'),
843 (('extract_u8', a
, 'b@32'),
844 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
845 'options->lower_extract_byte'),
847 (('extract_i16', a
, 'b@32'),
848 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
849 'options->lower_extract_word'),
851 (('extract_u16', a
, 'b@32'),
852 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
853 'options->lower_extract_word'),
855 (('pack_unorm_2x16', 'v'),
856 ('pack_uvec2_to_uint',
857 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
858 'options->lower_pack_unorm_2x16'),
860 (('pack_unorm_4x8', 'v'),
861 ('pack_uvec4_to_uint',
862 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
863 'options->lower_pack_unorm_4x8'),
865 (('pack_snorm_2x16', 'v'),
866 ('pack_uvec2_to_uint',
867 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
868 'options->lower_pack_snorm_2x16'),
870 (('pack_snorm_4x8', 'v'),
871 ('pack_uvec4_to_uint',
872 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
873 'options->lower_pack_snorm_4x8'),
875 (('unpack_unorm_2x16', 'v'),
876 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
877 ('extract_u16', 'v', 1))),
879 'options->lower_unpack_unorm_2x16'),
881 (('unpack_unorm_4x8', 'v'),
882 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
883 ('extract_u8', 'v', 1),
884 ('extract_u8', 'v', 2),
885 ('extract_u8', 'v', 3))),
887 'options->lower_unpack_unorm_4x8'),
889 (('unpack_snorm_2x16', 'v'),
890 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec2', ('extract_i16', 'v', 0),
891 ('extract_i16', 'v', 1))),
893 'options->lower_unpack_snorm_2x16'),
895 (('unpack_snorm_4x8', 'v'),
896 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec4', ('extract_i8', 'v', 0),
897 ('extract_i8', 'v', 1),
898 ('extract_i8', 'v', 2),
899 ('extract_i8', 'v', 3))),
901 'options->lower_unpack_snorm_4x8'),
903 (('isign', a
), ('imin', ('imax', a
, -1), 1), 'options->lower_isign'),
904 (('fsign', a
), ('fsub', ('b2f', ('flt', 0.0, a
)), ('b2f', ('flt', a
, 0.0))), 'options->lower_fsign'),
907 # bit_size dependent lowerings
908 for bit_size
in [8, 16, 32, 64]:
909 # convenience constants
910 intmax
= (1 << (bit_size
- 1)) - 1
911 intmin
= 1 << (bit_size
- 1)
914 (('iadd_sat@' + str(bit_size
), a
, b
),
915 ('bcsel', ('ige', b
, 1), ('bcsel', ('ilt', ('iadd', a
, b
), a
), intmax
, ('iadd', a
, b
)),
916 ('bcsel', ('ilt', a
, ('iadd', a
, b
)), intmin
, ('iadd', a
, b
))), 'options->lower_add_sat'),
917 (('isub_sat@' + str(bit_size
), a
, b
),
918 ('bcsel', ('ilt', b
, 0), ('bcsel', ('ilt', ('isub', a
, b
), a
), intmax
, ('isub', a
, b
)),
919 ('bcsel', ('ilt', a
, ('isub', a
, b
)), intmin
, ('isub', a
, b
))), 'options->lower_add_sat'),
922 invert
= OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
924 for left
, right
in itertools
.combinations_with_replacement(invert
.keys(), 2):
925 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
926 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
927 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
928 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
930 # Optimize x2bN(b2x(x)) -> x
931 for size
in type_sizes('bool'):
932 aN
= 'a@' + str(size
)
933 f2bN
= 'f2b' + str(size
)
934 i2bN
= 'i2b' + str(size
)
935 optimizations
.append(((f2bN
, ('b2f', aN
)), a
))
936 optimizations
.append(((i2bN
, ('b2i', aN
)), a
))
938 # Optimize x2yN(b2x(x)) -> b2y
939 for x
, y
in itertools
.product(['f', 'u', 'i'], ['f', 'u', 'i']):
940 if x
!= 'f' and y
!= 'f' and x
!= y
:
943 b2x
= 'b2f' if x
== 'f' else 'b2i'
944 b2y
= 'b2f' if y
== 'f' else 'b2i'
945 x2yN
= '{}2{}'.format(x
, y
)
946 optimizations
.append(((x2yN
, (b2x
, a
)), (b2y
, a
)))
948 # Optimize away x2xN(a@N)
949 for t
in ['int', 'uint', 'float']:
950 for N
in type_sizes(t
):
951 x2xN
= '{0}2{0}{1}'.format(t
[0], N
)
952 aN
= 'a@{0}'.format(N
)
953 optimizations
.append(((x2xN
, aN
), a
))
955 # Optimize x2xN(y2yM(a@P)) -> y2yN(a) for integers
956 # In particular, we can optimize away everything except upcast of downcast and
957 # upcasts where the type differs from the other cast
958 for N
, M
in itertools
.product(type_sizes('uint'), type_sizes('uint')):
960 # The outer cast is a down-cast. It doesn't matter what the size of the
961 # argument of the inner cast is because we'll never been in the upcast
962 # of downcast case. Regardless of types, we'll always end up with y2yN
964 for x
, y
in itertools
.product(['i', 'u'], ['i', 'u']):
965 x2xN
= '{0}2{0}{1}'.format(x
, N
)
966 y2yM
= '{0}2{0}{1}'.format(y
, M
)
967 y2yN
= '{0}2{0}{1}'.format(y
, N
)
968 optimizations
.append(((x2xN
, (y2yM
, a
)), (y2yN
, a
)))
970 # If the outer cast is an up-cast, we have to be more careful about the
971 # size of the argument of the inner cast and with types. In this case,
972 # the type is always the type of type up-cast which is given by the
974 for P
in type_sizes('uint'):
975 # We can't optimize away up-cast of down-cast.
979 # Because we're doing down-cast of down-cast, the types always have
980 # to match between the two casts
982 x2xN
= '{0}2{0}{1}'.format(x
, N
)
983 x2xM
= '{0}2{0}{1}'.format(x
, M
)
984 aP
= 'a@{0}'.format(P
)
985 optimizations
.append(((x2xN
, (x2xM
, aP
)), (x2xN
, a
)))
987 # The N == M case is handled by other optimizations
990 def fexp2i(exp
, bits
):
991 # We assume that exp is already in the right range.
993 return ('i2i16', ('ishl', ('iadd', exp
, 15), 10))
995 return ('ishl', ('iadd', exp
, 127), 23)
997 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
1001 def ldexp(f
, exp
, bits
):
1002 # First, we clamp exp to a reasonable range. The maximum possible range
1003 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
1004 # a maximum range of [-149, 127]. This means that we can potentially have
1005 # a swing of +-276. If you start with FLT_MAX, you actually have to do
1006 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
1007 # spec, on the other hand, only requires that we handle an exponent value
1008 # in the range [-126, 128]. This implementation is *mostly* correct; it
1009 # handles a range on exp of [-252, 254] which allows you to create any
1010 # value (including denorms if the hardware supports it) and to adjust the
1011 # exponent of any normal value to anything you want.
1013 exp
= ('imin', ('imax', exp
, -28), 30)
1015 exp
= ('imin', ('imax', exp
, -252), 254)
1017 exp
= ('imin', ('imax', exp
, -2044), 2046)
1021 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
1022 # (We use ishr which isn't the same for -1, but the -1 case still works
1023 # since we use exp-exp/2 as the second exponent.) While the spec
1024 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
1025 # work with denormals and doesn't allow for the full swing in exponents
1026 # that you can get with normalized values. Instead, we create two powers
1027 # of two and multiply by them each in turn. That way the effective range
1028 # of our exponent is doubled.
1029 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
1030 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
1031 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
1034 (('ldexp@16', 'x', 'exp'), ldexp('x', 'exp', 16), 'options->lower_ldexp'),
1035 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
1036 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
1039 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
1040 def bitfield_reverse(u
):
1041 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
1042 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
1043 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
1044 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
1045 step5
= ('ior', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
1049 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
1051 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
1052 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
1053 # and, if a is a NaN then the second comparison will fail anyway.
1054 for op
in ['flt', 'fge', 'feq']:
1056 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
1057 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
1060 # Add optimizations to handle the case where the result of a ternary is
1061 # compared to a constant. This way we can take things like
1067 # a ? (0 > 0) : (1 > 0)
1069 # which constant folding will eat for lunch. The resulting ternary will
1070 # further get cleaned up by the boolean reductions above and we will be
1071 # left with just the original variable "a".
1072 for op
in ['flt', 'fge', 'feq', 'fne',
1073 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
1075 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
1076 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
1077 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
1078 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
1082 # For example, this converts things like
1084 # 1 + mix(0, a - 1, condition)
1088 # mix(1, (a-1)+1, condition)
1090 # Other optimizations will rearrange the constants.
1091 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
1093 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
1096 # For derivatives in compute shaders, GLSL_NV_compute_shader_derivatives
1099 # If neither layout qualifier is specified, derivatives in compute shaders
1100 # return zero, which is consistent with the handling of built-in texture
1101 # functions like texture() in GLSL 4.50 compute shaders.
1102 for op
in ['fddx', 'fddx_fine', 'fddx_coarse',
1103 'fddy', 'fddy_fine', 'fddy_coarse']:
1105 ((op
, 'a'), 0.0, 'info->stage == MESA_SHADER_COMPUTE && info->cs.derivative_group == DERIVATIVE_GROUP_NONE')
1108 # Some optimizations for ir3-specific instructions.
1110 # 'al * bl': If either 'al' or 'bl' is zero, return zero.
1111 (('umul_low', '#a(is_lower_half_zero)', 'b'), (0)),
1112 # '(ah * bl) << 16 + c': If either 'ah' or 'bl' is zero, return 'c'.
1113 (('imadsh_mix16', '#a@32(is_lower_half_zero)', 'b@32', 'c@32'), ('c')),
1114 (('imadsh_mix16', 'a@32', '#b@32(is_upper_half_zero)', 'c@32'), ('c')),
1117 # This section contains "late" optimizations that should be run before
1118 # creating ffmas and calling regular optimizations for the final time.
1119 # Optimizations should go here if they help code generation and conflict
1120 # with the regular optimizations.
1121 before_ffma_optimizations
= [
1122 # Propagate constants down multiplication chains
1123 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
1124 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
1125 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
1126 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
1128 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
1129 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
1130 (('~fadd', ('fneg', a
), a
), 0.0),
1131 (('iadd', ('ineg', a
), a
), 0),
1132 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
1133 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
1134 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
1135 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
1137 (('~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
)),
1138 (('~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
)),
1139 (('~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
))),
1142 # This section contains "late" optimizations that should be run after the
1143 # regular optimizations have finished. Optimizations should go here if
1144 # they help code generation but do not necessarily produce code that is
1145 # more easily optimizable.
1146 late_optimizations
= [
1147 # Most of these optimizations aren't quite safe when you get infinity or
1148 # Nan involved but the first one should be fine.
1149 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
1150 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
1151 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
1152 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
1153 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
1154 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
1156 # nir_lower_to_source_mods will collapse this, but its existence during the
1157 # optimization loop can prevent other optimizations.
1158 (('fneg', ('fneg', a
)), a
),
1160 # These are duplicated from the main optimizations table. The late
1161 # patterns that rearrange expressions like x - .5 < 0 to x < .5 can create
1162 # new patterns like these. The patterns that compare with zero are removed
1163 # because they are unlikely to be created in by anything in
1164 # late_optimizations.
1165 (('flt', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('flt', a
, b
)),
1166 (('flt', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('flt', b
, a
)),
1167 (('fge', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fge', a
, b
)),
1168 (('fge', '#b(is_gt_0_and_lt_1)', ('fsat(is_used_once)', a
)), ('fge', b
, a
)),
1169 (('feq', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('feq', a
, b
)),
1170 (('fne', ('fsat(is_used_once)', a
), '#b(is_gt_0_and_lt_1)'), ('fne', a
, b
)),
1172 (('fge', ('fsat(is_used_once)', a
), 1.0), ('fge', a
, 1.0)),
1173 (('flt', ('fsat(is_used_once)', a
), 1.0), ('flt', a
, 1.0)),
1175 (('~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
)))),
1177 (('flt', ('fneg', a
), ('fneg', b
)), ('flt', b
, a
)),
1178 (('fge', ('fneg', a
), ('fneg', b
)), ('fge', b
, a
)),
1179 (('feq', ('fneg', a
), ('fneg', b
)), ('feq', b
, a
)),
1180 (('fne', ('fneg', a
), ('fneg', b
)), ('fne', b
, a
)),
1181 (('flt', ('fneg', a
), -1.0), ('flt', 1.0, a
)),
1182 (('flt', -1.0, ('fneg', a
)), ('flt', a
, 1.0)),
1183 (('fge', ('fneg', a
), -1.0), ('fge', 1.0, a
)),
1184 (('fge', -1.0, ('fneg', a
)), ('fge', a
, 1.0)),
1185 (('fne', ('fneg', a
), -1.0), ('fne', 1.0, a
)),
1186 (('feq', -1.0, ('fneg', a
)), ('feq', a
, 1.0)),
1189 (('iand', a
, a
), a
),
1191 (('~fadd', ('fneg(is_used_once)', ('fsat(is_used_once)', 'a(is_not_fmul)')), 1.0), ('fsat', ('fadd', 1.0, ('fneg', a
)))),
1193 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
1194 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
1195 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
1196 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
1198 (('~flrp@32', ('fadd(is_used_once)', a
, b
), ('fadd(is_used_once)', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
)),
1199 (('~flrp@64', ('fadd(is_used_once)', a
, b
), ('fadd(is_used_once)', a
, c
), d
), ('fadd', ('flrp', b
, c
, d
), a
)),
1201 (('~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'),
1202 (('~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'),
1204 # we do these late so that we don't get in the way of creating ffmas
1205 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
1206 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
1208 (('bcsel', a
, 0, ('b2f32', ('inot', 'b@bool'))), ('b2f32', ('inot', ('ior', a
, b
)))),
1211 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render())
1212 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
1213 before_ffma_optimizations
).render())
1214 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
1215 late_optimizations
).render())
projects / mesa.git / blob