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
39 # Written in the form (<search>, <replace>) where <search> is an expression
40 # and <replace> is either an expression or a value. An expression is
41 # defined as a tuple of the form ([~]<op>, <src0>, <src1>, <src2>, <src3>)
42 # where each source is either an expression or a value. A value can be
43 # either a numeric constant or a string representing a variable name.
45 # If the opcode in a search expression is prefixed by a '~' character, this
46 # indicates that the operation is inexact. Such operations will only get
47 # applied to SSA values that do not have the exact bit set. This should be
48 # used by by any optimizations that are not bit-for-bit exact. It should not,
49 # however, be used for backend-requested lowering operations as those need to
50 # happen regardless of precision.
52 # Variable names are specified as "[#]name[@type][(cond)]" where "#" inicates
53 # that the given variable will only match constants and the type indicates that
54 # the given variable will only match values from ALU instructions with the
55 # given output type, and (cond) specifies an additional condition function
56 # (see nir_search_helpers.h).
58 # For constants, you have to be careful to make sure that it is the right
59 # type because python is unaware of the source and destination types of the
62 # All expression types can have a bit-size specified. For opcodes, this
63 # looks like "op@32", for variables it is "a@32" or "a@uint32" to specify a
64 # type and size. In the search half of the expression this indicates that it
65 # should only match that particular bit-size. In the replace half of the
66 # expression this indicates that the constructed value should have that
71 (('imul', a
, '#b@32(is_pos_power_of_two)'), ('ishl', a
, ('find_lsb', b
))),
72 (('imul', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('ishl', a
, ('find_lsb', ('iabs', b
))))),
77 (('udiv', a
, '#b@32(is_pos_power_of_two)'), ('ushr', a
, ('find_lsb', b
))),
78 (('idiv', a
, '#b@32(is_pos_power_of_two)'), ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', b
))), 'options->lower_idiv'),
79 (('idiv', a
, '#b@32(is_neg_power_of_two)'), ('ineg', ('imul', ('isign', a
), ('ushr', ('iabs', a
), ('find_lsb', ('iabs', b
))))), 'options->lower_idiv'),
80 (('umod', a
, '#b(is_pos_power_of_two)'), ('iand', a
, ('isub', b
, 1))),
82 (('fneg', ('fneg', a
)), a
),
83 (('ineg', ('ineg', a
)), a
),
84 (('fabs', ('fabs', a
)), ('fabs', a
)),
85 (('fabs', ('fneg', a
)), ('fabs', a
)),
86 (('fabs', ('u2f', a
)), ('u2f', a
)),
87 (('iabs', ('iabs', a
)), ('iabs', a
)),
88 (('iabs', ('ineg', a
)), ('iabs', a
)),
89 (('f2b', ('fneg', a
)), ('f2b', a
)),
90 (('i2b', ('ineg', a
)), ('i2b', a
)),
91 (('~fadd', a
, 0.0), a
),
93 (('usadd_4x8', a
, 0), a
),
94 (('usadd_4x8', a
, ~
0), ~
0),
95 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
96 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
97 (('~fadd', ('fneg', a
), a
), 0.0),
98 (('iadd', ('ineg', a
), a
), 0),
99 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
100 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
101 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
102 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
103 (('~fmul', a
, 0.0), 0.0),
105 (('umul_unorm_4x8', a
, 0), 0),
106 (('umul_unorm_4x8', a
, ~
0), a
),
107 (('fmul', a
, 1.0), a
),
109 (('fmul', a
, -1.0), ('fneg', a
)),
110 (('imul', a
, -1), ('ineg', a
)),
111 # If a < 0: fsign(a)*a*a => -1*a*a => -a*a => abs(a)*a
112 # If a > 0: fsign(a)*a*a => 1*a*a => a*a => abs(a)*a
113 # If a == 0: fsign(a)*a*a => 0*0*0 => abs(0)*0
114 (('fmul', ('fsign', a
), ('fmul', a
, a
)), ('fmul', ('fabs', a
), a
)),
115 (('fmul', ('fmul', ('fsign', a
), a
), a
), ('fmul', ('fabs', a
), a
)),
116 (('~ffma', 0.0, a
, b
), b
),
117 (('~ffma', a
, 0.0, b
), b
),
118 (('~ffma', a
, b
, 0.0), ('fmul', a
, b
)),
119 (('ffma', a
, 1.0, b
), ('fadd', a
, b
)),
120 (('ffma', 1.0, a
, b
), ('fadd', a
, b
)),
121 (('~flrp', a
, b
, 0.0), a
),
122 (('~flrp', a
, b
, 1.0), b
),
123 (('~flrp', a
, a
, b
), a
),
124 (('~flrp', 0.0, a
, b
), ('fmul', a
, b
)),
125 (('~flrp', a
, b
, ('b2f', 'c@1')), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
126 (('~flrp', a
, 0.0, c
), ('fadd', ('fmul', ('fneg', a
), c
), a
)),
127 (('flrp@32', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp32'),
128 (('flrp@64', a
, b
, c
), ('fadd', ('fmul', c
, ('fsub', b
, a
)), a
), 'options->lower_flrp64'),
129 (('ffloor', a
), ('fsub', a
, ('ffract', a
)), 'options->lower_ffloor'),
130 (('ffract', a
), ('fsub', a
, ('ffloor', a
)), 'options->lower_ffract'),
131 (('fceil', a
), ('fneg', ('ffloor', ('fneg', a
))), 'options->lower_fceil'),
132 (('~fadd', ('fmul', a
, ('fadd', 1.0, ('fneg', ('b2f', 'c@1')))), ('fmul', b
, ('b2f', c
))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
133 (('~fadd@32', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
134 (('~fadd@64', ('fmul', a
, ('fadd', 1.0, ('fneg', c
))), ('fmul', b
, c
)), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
135 (('~fadd', a
, ('fmul', ('b2f', 'c@1'), ('fadd', b
, ('fneg', a
)))), ('bcsel', c
, b
, a
), 'options->lower_flrp32'),
136 (('~fadd@32', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp32'),
137 (('~fadd@64', a
, ('fmul', c
, ('fadd', b
, ('fneg', a
)))), ('flrp', a
, b
, c
), '!options->lower_flrp64'),
138 (('ffma', a
, b
, c
), ('fadd', ('fmul', a
, b
), c
), 'options->lower_ffma'),
139 (('~fadd', ('fmul', a
, b
), c
), ('ffma', a
, b
, c
), 'options->fuse_ffma'),
141 (('fdot4', ('vec4', a
, b
, c
, 1.0), d
), ('fdph', ('vec3', a
, b
, c
), d
)),
142 (('fdot4', ('vec4', a
, 0.0, 0.0, 0.0), b
), ('fmul', a
, b
)),
143 (('fdot4', ('vec4', a
, b
, 0.0, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
144 (('fdot4', ('vec4', a
, b
, c
, 0.0), d
), ('fdot3', ('vec3', a
, b
, c
), d
)),
146 (('fdot3', ('vec3', a
, 0.0, 0.0), b
), ('fmul', a
, b
)),
147 (('fdot3', ('vec3', a
, b
, 0.0), c
), ('fdot2', ('vec2', a
, b
), c
)),
149 # (a * #b + #c) << #d
150 # ((a * #b) << #d) + (#c << #d)
151 # (a * (#b << #d)) + (#c << #d)
152 (('ishl', ('iadd', ('imul', a
, '#b'), '#c'), '#d'),
153 ('iadd', ('imul', a
, ('ishl', b
, d
)), ('ishl', c
, d
))),
157 (('ishl', ('imul', a
, '#b'), '#c'), ('imul', a
, ('ishl', b
, c
))),
159 # Comparison simplifications
160 (('~inot', ('flt', a
, b
)), ('fge', a
, b
)),
161 (('~inot', ('fge', a
, b
)), ('flt', a
, b
)),
162 (('~inot', ('feq', a
, b
)), ('fne', a
, b
)),
163 (('~inot', ('fne', a
, b
)), ('feq', a
, b
)),
164 (('inot', ('ilt', a
, b
)), ('ige', a
, b
)),
165 (('inot', ('ult', a
, b
)), ('uge', a
, b
)),
166 (('inot', ('ige', a
, b
)), ('ilt', a
, b
)),
167 (('inot', ('uge', a
, b
)), ('ult', a
, b
)),
168 (('inot', ('ieq', a
, b
)), ('ine', a
, b
)),
169 (('inot', ('ine', a
, b
)), ('ieq', a
, b
)),
173 # b2f(a) == 0.0 because b2f(a) can only be 0 or 1
175 (('fge', 0.0, ('b2f', 'a@1')), ('inot', a
)),
177 (('fge', ('fneg', ('b2f', 'a@1')), 0.0), ('inot', a
)),
179 (('fne', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
180 (('fne', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('ior', a
, b
)),
181 (('fne', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('ior', a
, b
)),
182 (('fne', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('ior', a
, b
)),
183 (('fne', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
184 (('fne', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('iand', a
, b
)),
185 (('fne', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('iand', a
, b
)),
186 (('fne', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ixor', a
, b
)),
187 (('fne', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ixor', a
, b
)),
188 (('fne', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ixor', a
, b
)),
189 (('feq', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
190 (('feq', ('fmax', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('ior', a
, b
))),
191 (('feq', ('bcsel', a
, 1.0, ('b2f', 'b@1')) , 0.0), ('inot', ('ior', a
, b
))),
192 (('feq', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
193 (('feq', ('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
194 (('feq', ('fmin', ('b2f', 'a@1'), ('b2f', 'b@1')), 0.0), ('inot', ('iand', a
, b
))),
195 (('feq', ('bcsel', a
, ('b2f', 'b@1'), 0.0) , 0.0), ('inot', ('iand', a
, b
))),
196 (('feq', ('fadd', ('b2f', 'a@1'), ('fneg', ('b2f', 'b@1'))), 0.0), ('ieq', a
, b
)),
197 (('feq', ('b2f', 'a@1') , ('b2f', 'b@1') ), ('ieq', a
, b
)),
198 (('feq', ('fneg', ('b2f', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('ieq', a
, b
)),
200 # -(b2f(a) + b2f(b)) < 0
201 # 0 < b2f(a) + b2f(b)
202 # 0 != b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
204 (('flt', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('ior', a
, b
)),
205 (('flt', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('ior', a
, b
)),
207 # -(b2f(a) + b2f(b)) >= 0
208 # 0 >= b2f(a) + b2f(b)
209 # 0 == b2f(a) + b2f(b) b2f must be 0 or 1, so the sum is non-negative
211 (('fge', ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), 0.0), ('inot', ('ior', a
, b
))),
212 (('fge', 0.0, ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('inot', ('ior', a
, b
))),
214 # Some optimizations (below) convert things like (a < b || c < b) into
215 # (min(a, c) < b). However, this interfers with the previous optimizations
216 # that try to remove comparisons with negated sums of b2f. This just
218 (('flt', ('fmin', c
, ('fneg', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1')))), 0.0),
219 ('ior', ('flt', c
, 0.0), ('ior', a
, b
))),
221 (('~flt', ('fadd', a
, b
), a
), ('flt', b
, 0.0)),
222 (('~fge', ('fadd', a
, b
), a
), ('fge', b
, 0.0)),
223 (('~feq', ('fadd', a
, b
), a
), ('feq', b
, 0.0)),
224 (('~fne', ('fadd', a
, b
), a
), ('fne', b
, 0.0)),
226 # Cannot remove the addition from ilt or ige due to overflow.
227 (('ieq', ('iadd', a
, b
), a
), ('ieq', b
, 0)),
228 (('ine', ('iadd', a
, b
), a
), ('ine', b
, 0)),
230 # fmin(-b2f(a), b) >= 0.0
231 # -b2f(a) >= 0.0 && b >= 0.0
232 # -b2f(a) == 0.0 && b >= 0.0 -b2f can only be 0 or -1, never >0
233 # b2f(a) == 0.0 && b >= 0.0
234 # a == False && b >= 0.0
237 # The fge in the second replacement is not a typo. I leave the proof that
238 # "fmin(-b2f(a), b) >= 0 <=> fmin(-b2f(a), b) == 0" as an exercise for the
240 (('fge', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
241 (('feq', ('fmin', ('fneg', ('b2f', 'a@1')), 'b@1'), 0.0), ('iand', ('inot', a
), ('fge', b
, 0.0))),
243 (('feq', ('b2f', 'a@1'), 0.0), ('inot', a
)),
244 (('fne', ('b2f', 'a@1'), 0.0), a
),
245 (('ieq', ('b2i', 'a@1'), 0), ('inot', a
)),
246 (('ine', ('b2i', 'a@1'), 0), a
),
248 (('fne', ('u2f', a
), 0.0), ('ine', a
, 0)),
249 (('feq', ('u2f', a
), 0.0), ('ieq', a
, 0)),
250 (('fge', ('u2f', a
), 0.0), True),
251 (('fge', 0.0, ('u2f', a
)), ('uge', 0, a
)), # ieq instead?
252 (('flt', ('u2f', a
), 0.0), False),
253 (('flt', 0.0, ('u2f', a
)), ('ult', 0, a
)), # ine instead?
254 (('fne', ('i2f', a
), 0.0), ('ine', a
, 0)),
255 (('feq', ('i2f', a
), 0.0), ('ieq', a
, 0)),
256 (('fge', ('i2f', a
), 0.0), ('ige', a
, 0)),
257 (('fge', 0.0, ('i2f', a
)), ('ige', 0, a
)),
258 (('flt', ('i2f', a
), 0.0), ('ilt', a
, 0)),
259 (('flt', 0.0, ('i2f', a
)), ('ilt', 0, a
)),
263 # fabs(a) != 0.0 because fabs(a) must be >= 0
265 (('~flt', 0.0, ('fabs', a
)), ('fne', a
, 0.0)),
269 (('~flt', ('fneg', ('fabs', a
)), 0.0), ('fne', a
, 0.0)),
272 # 0.0 == fabs(a) because fabs(a) must be >= 0
274 (('fge', 0.0, ('fabs', a
)), ('feq', a
, 0.0)),
278 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
280 (('fmax', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('ior', a
, b
))),
281 (('fmax', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('ior', a
, b
)))),
282 (('fmin', ('b2f(is_used_once)', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
283 (('fmin', ('fneg(is_used_once)', ('b2f(is_used_once)', 'a@1')), ('fneg', ('b2f', 'b@1'))), ('fneg', ('b2f', ('iand', a
, b
)))),
286 # bcsel(a, fmin(b2f(a), b), fmin(b2f(a), b))
287 # bcsel(a, fmin(b2f(True), b), fmin(b2f(False), b))
288 # bcsel(a, fmin(1.0, b), fmin(0.0, b))
290 # Since b is a constant, constant folding will eliminate the fmin and the
291 # fmax. If b is > 1.0, the bcsel will be replaced with a b2f.
292 (('fmin', ('b2f', 'a@1'), '#b'), ('bcsel', a
, ('fmin', b
, 1.0), ('fmin', b
, 0.0))),
294 (('flt', ('fadd(is_used_once)', a
, ('fneg', b
)), 0.0), ('flt', a
, b
)),
296 (('fge', ('fneg', ('fabs', a
)), 0.0), ('feq', a
, 0.0)),
297 (('~bcsel', ('flt', b
, a
), b
, a
), ('fmin', a
, b
)),
298 (('~bcsel', ('flt', a
, b
), b
, a
), ('fmax', a
, b
)),
299 (('~bcsel', ('fge', a
, b
), b
, a
), ('fmin', a
, b
)),
300 (('~bcsel', ('fge', b
, a
), b
, a
), ('fmax', a
, b
)),
301 (('bcsel', ('inot', a
), b
, c
), ('bcsel', a
, c
, b
)),
302 (('bcsel', a
, ('bcsel', a
, b
, c
), d
), ('bcsel', a
, b
, d
)),
303 (('bcsel', a
, b
, ('bcsel', a
, c
, d
)), ('bcsel', a
, b
, d
)),
304 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
305 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, c
, 'e')), ('bcsel', b
, c
, ('bcsel', a
, d
, 'e'))),
306 (('bcsel', a
, ('bcsel', b
, c
, d
), ('bcsel(is_used_once)', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
307 (('bcsel', a
, ('bcsel(is_used_once)', b
, c
, d
), ('bcsel', b
, 'e', d
)), ('bcsel', b
, ('bcsel', a
, c
, 'e'), d
)),
308 (('bcsel', a
, True, 'b@bool'), ('ior', a
, b
)),
315 (('fmax', ('fmax', a
, b
), b
), ('fmax', a
, b
)),
316 (('umax', ('umax', a
, b
), b
), ('umax', a
, b
)),
317 (('imax', ('imax', a
, b
), b
), ('imax', a
, b
)),
318 (('fmin', ('fmin', a
, b
), b
), ('fmin', a
, b
)),
319 (('umin', ('umin', a
, b
), b
), ('umin', a
, b
)),
320 (('imin', ('imin', a
, b
), b
), ('imin', a
, b
)),
321 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
322 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
323 (('fmin', a
, ('fneg', a
)), ('fneg', ('fabs', a
))),
324 (('imin', a
, ('ineg', a
)), ('ineg', ('iabs', a
))),
325 (('fmin', a
, ('fneg', ('fabs', a
))), ('fneg', ('fabs', a
))),
326 (('imin', a
, ('ineg', ('iabs', a
))), ('ineg', ('iabs', a
))),
327 (('fmin', a
, ('fabs', a
)), a
),
328 (('imin', a
, ('iabs', a
)), a
),
329 (('fmax', a
, ('fneg', ('fabs', a
))), a
),
330 (('imax', a
, ('ineg', ('iabs', a
))), a
),
331 (('fmax', a
, ('fabs', a
)), ('fabs', a
)),
332 (('imax', a
, ('iabs', a
)), ('iabs', a
)),
333 (('fmax', a
, ('fneg', a
)), ('fabs', a
)),
334 (('imax', a
, ('ineg', a
)), ('iabs', a
)),
335 (('~fmin', ('fmax', a
, 0.0), 1.0), ('fsat', a
), '!options->lower_fsat'),
336 (('~fmax', ('fmin', a
, 1.0), 0.0), ('fsat', a
), '!options->lower_fsat'),
337 (('fsat', ('fsign', a
)), ('b2f', ('flt', 0.0, a
))),
338 (('fsat', a
), ('fmin', ('fmax', a
, 0.0), 1.0), 'options->lower_fsat'),
339 (('fsat', ('fsat', a
)), ('fsat', a
)),
340 (('fmin', ('fmax', ('fmin', ('fmax', a
, b
), c
), b
), c
), ('fmin', ('fmax', a
, b
), c
)),
341 (('imin', ('imax', ('imin', ('imax', a
, b
), c
), b
), c
), ('imin', ('imax', a
, b
), c
)),
342 (('umin', ('umax', ('umin', ('umax', a
, b
), c
), b
), c
), ('umin', ('umax', a
, b
), c
)),
343 (('fmax', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmax', a
, b
))),
344 (('fmin', ('fsat', a
), '#b@32(is_zero_to_one)'), ('fsat', ('fmin', a
, b
))),
345 (('extract_u8', ('imin', ('imax', a
, 0), 0xff), 0), ('imin', ('imax', a
, 0), 0xff)),
346 (('~ior', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmax', b
, c
))),
347 (('~ior', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmin', a
, b
), c
)),
348 (('~ior', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmin', b
, c
))),
349 (('~ior', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmax', a
, b
), c
)),
350 (('~ior', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmax', b
, c
))),
351 (('~ior', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmin', a
, b
), c
)),
352 (('~ior', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmin', b
, c
))),
353 (('~ior', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmax', a
, b
), c
)),
354 (('~iand', ('flt(is_used_once)', a
, b
), ('flt', a
, c
)), ('flt', a
, ('fmin', b
, c
))),
355 (('~iand', ('flt(is_used_once)', a
, c
), ('flt', b
, c
)), ('flt', ('fmax', a
, b
), c
)),
356 (('~iand', ('fge(is_used_once)', a
, b
), ('fge', a
, c
)), ('fge', a
, ('fmax', b
, c
))),
357 (('~iand', ('fge(is_used_once)', a
, c
), ('fge', b
, c
)), ('fge', ('fmin', a
, b
), c
)),
358 (('~iand', ('flt', a
, '#b'), ('flt', a
, '#c')), ('flt', a
, ('fmin', b
, c
))),
359 (('~iand', ('flt', '#a', c
), ('flt', '#b', c
)), ('flt', ('fmax', a
, b
), c
)),
360 (('~iand', ('fge', a
, '#b'), ('fge', a
, '#c')), ('fge', a
, ('fmax', b
, c
))),
361 (('~iand', ('fge', '#a', c
), ('fge', '#b', c
)), ('fge', ('fmin', a
, b
), c
)),
363 (('ior', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imax', b
, c
))),
364 (('ior', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imin', a
, b
), c
)),
365 (('ior', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imin', b
, c
))),
366 (('ior', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imax', a
, b
), c
)),
367 (('ior', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umax', b
, c
))),
368 (('ior', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umin', a
, b
), c
)),
369 (('ior', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umin', b
, c
))),
370 (('ior', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umax', a
, b
), c
)),
371 (('iand', ('ilt(is_used_once)', a
, b
), ('ilt', a
, c
)), ('ilt', a
, ('imin', b
, c
))),
372 (('iand', ('ilt(is_used_once)', a
, c
), ('ilt', b
, c
)), ('ilt', ('imax', a
, b
), c
)),
373 (('iand', ('ige(is_used_once)', a
, b
), ('ige', a
, c
)), ('ige', a
, ('imax', b
, c
))),
374 (('iand', ('ige(is_used_once)', a
, c
), ('ige', b
, c
)), ('ige', ('imin', a
, b
), c
)),
375 (('iand', ('ult(is_used_once)', a
, b
), ('ult', a
, c
)), ('ult', a
, ('umin', b
, c
))),
376 (('iand', ('ult(is_used_once)', a
, c
), ('ult', b
, c
)), ('ult', ('umax', a
, b
), c
)),
377 (('iand', ('uge(is_used_once)', a
, b
), ('uge', a
, c
)), ('uge', a
, ('umax', b
, c
))),
378 (('iand', ('uge(is_used_once)', a
, c
), ('uge', b
, c
)), ('uge', ('umin', a
, b
), c
)),
380 # Common pattern like 'if (i == 0 || i == 1 || ...)'
381 (('ior', ('ieq', a
, 0), ('ieq', a
, 1)), ('uge', 1, a
)),
382 (('ior', ('uge', 1, a
), ('ieq', a
, 2)), ('uge', 2, a
)),
383 (('ior', ('uge', 2, a
), ('ieq', a
, 3)), ('uge', 3, a
)),
385 (('ior', 'a@bool', ('ieq', a
, False)), True),
386 (('ior', a
, ('inot', a
)), -1),
388 (('iand', ('ieq', 'a@32', 0), ('ieq', 'b@32', 0)), ('ieq', ('ior', 'a@32', 'b@32'), 0)),
390 # These patterns can result when (a < b || a < c) => (a < min(b, c))
391 # transformations occur before constant propagation and loop-unrolling.
392 (('~flt', a
, ('fmax', b
, a
)), ('flt', a
, b
)),
393 (('~flt', ('fmin', a
, b
), a
), ('flt', b
, a
)),
394 (('~fge', a
, ('fmin', b
, a
)), True),
395 (('~fge', ('fmax', a
, b
), a
), True),
396 (('~flt', a
, ('fmin', b
, a
)), False),
397 (('~flt', ('fmax', a
, b
), a
), False),
398 (('~fge', a
, ('fmax', b
, a
)), ('fge', a
, b
)),
399 (('~fge', ('fmin', a
, b
), a
), ('fge', b
, a
)),
401 (('ilt', a
, ('imax', b
, a
)), ('ilt', a
, b
)),
402 (('ilt', ('imin', a
, b
), a
), ('ilt', b
, a
)),
403 (('ige', a
, ('imin', b
, a
)), True),
404 (('ige', ('imax', a
, b
), a
), True),
405 (('ult', a
, ('umax', b
, a
)), ('ult', a
, b
)),
406 (('ult', ('umin', a
, b
), a
), ('ult', b
, a
)),
407 (('uge', a
, ('umin', b
, a
)), True),
408 (('uge', ('umax', a
, b
), a
), True),
409 (('ilt', a
, ('imin', b
, a
)), False),
410 (('ilt', ('imax', a
, b
), a
), False),
411 (('ige', a
, ('imax', b
, a
)), ('ige', a
, b
)),
412 (('ige', ('imin', a
, b
), a
), ('ige', b
, a
)),
413 (('ult', a
, ('umin', b
, a
)), False),
414 (('ult', ('umax', a
, b
), a
), False),
415 (('uge', a
, ('umax', b
, a
)), ('uge', a
, b
)),
416 (('uge', ('umin', a
, b
), a
), ('uge', b
, a
)),
418 (('ilt', '#a', ('imax', '#b', c
)), ('ior', ('ilt', a
, b
), ('ilt', a
, c
))),
419 (('ilt', ('imin', '#a', b
), '#c'), ('ior', ('ilt', a
, c
), ('ilt', b
, c
))),
420 (('ige', '#a', ('imin', '#b', c
)), ('ior', ('ige', a
, b
), ('ige', a
, c
))),
421 (('ige', ('imax', '#a', b
), '#c'), ('ior', ('ige', a
, c
), ('ige', b
, c
))),
422 (('ult', '#a', ('umax', '#b', c
)), ('ior', ('ult', a
, b
), ('ult', a
, c
))),
423 (('ult', ('umin', '#a', b
), '#c'), ('ior', ('ult', a
, c
), ('ult', b
, c
))),
424 (('uge', '#a', ('umin', '#b', c
)), ('ior', ('uge', a
, b
), ('uge', a
, c
))),
425 (('uge', ('umax', '#a', b
), '#c'), ('ior', ('uge', a
, c
), ('uge', b
, c
))),
426 (('ilt', '#a', ('imin', '#b', c
)), ('iand', ('ilt', a
, b
), ('ilt', a
, c
))),
427 (('ilt', ('imax', '#a', b
), '#c'), ('iand', ('ilt', a
, c
), ('ilt', b
, c
))),
428 (('ige', '#a', ('imax', '#b', c
)), ('iand', ('ige', a
, b
), ('ige', a
, c
))),
429 (('ige', ('imin', '#a', b
), '#c'), ('iand', ('ige', a
, c
), ('ige', b
, c
))),
430 (('ult', '#a', ('umin', '#b', c
)), ('iand', ('ult', a
, b
), ('ult', a
, c
))),
431 (('ult', ('umax', '#a', b
), '#c'), ('iand', ('ult', a
, c
), ('ult', b
, c
))),
432 (('uge', '#a', ('umax', '#b', c
)), ('iand', ('uge', a
, b
), ('uge', a
, c
))),
433 (('uge', ('umin', '#a', b
), '#c'), ('iand', ('uge', a
, c
), ('uge', b
, c
))),
435 (('fabs', ('slt', a
, b
)), ('slt', a
, b
)),
436 (('fabs', ('sge', a
, b
)), ('sge', a
, b
)),
437 (('fabs', ('seq', a
, b
)), ('seq', a
, b
)),
438 (('fabs', ('sne', a
, b
)), ('sne', a
, b
)),
439 (('slt', a
, b
), ('b2f', ('flt', a
, b
)), 'options->lower_scmp'),
440 (('sge', a
, b
), ('b2f', ('fge', a
, b
)), 'options->lower_scmp'),
441 (('seq', a
, b
), ('b2f', ('feq', a
, b
)), 'options->lower_scmp'),
442 (('sne', a
, b
), ('b2f', ('fne', a
, b
)), 'options->lower_scmp'),
443 (('fne', ('fneg', a
), a
), ('fne', a
, 0.0)),
444 (('feq', ('fneg', a
), a
), ('feq', a
, 0.0)),
446 (('imul', ('b2i', 'a@1'), ('b2i', 'b@1')), ('b2i', ('iand', a
, b
))),
447 (('fmul', ('b2f', 'a@1'), ('b2f', 'b@1')), ('b2f', ('iand', a
, b
))),
448 (('fsat', ('fadd', ('b2f', 'a@1'), ('b2f', 'b@1'))), ('b2f', ('ior', a
, b
))),
449 (('iand', 'a@bool32', 1.0), ('b2f', a
)),
450 # True/False are ~0 and 0 in NIR. b2i of True is 1, and -1 is ~0 (True).
451 (('ineg', ('b2i32', 'a@32')), a
),
452 (('flt', ('fneg', ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
453 (('flt', ('fsub', 0.0, ('b2f', 'a@1')), 0), a
), # Generated by TGSI KILL_IF.
454 # Comparison with the same args. Note that these are not done for
455 # the float versions because NaN always returns false on float
457 (('ilt', a
, a
), False),
458 (('ige', a
, a
), True),
459 (('ieq', a
, a
), True),
460 (('ine', a
, a
), False),
461 (('ult', a
, a
), False),
462 (('uge', a
, a
), True),
463 # Logical and bit operations
464 (('fand', a
, 0.0), 0.0),
466 (('iand', a
, ~
0), a
),
470 (('ior', a
, True), True),
471 (('fxor', a
, a
), 0.0),
474 (('inot', ('inot', a
)), a
),
475 (('ior', ('iand', a
, b
), b
), b
),
476 (('ior', ('ior', a
, b
), b
), ('ior', a
, b
)),
477 (('iand', ('ior', a
, b
), b
), b
),
478 (('iand', ('iand', a
, b
), b
), ('iand', a
, b
)),
480 (('iand', ('inot', a
), ('inot', b
)), ('inot', ('ior', a
, b
))),
481 (('ior', ('inot', a
), ('inot', b
)), ('inot', ('iand', a
, b
))),
482 # Shift optimizations
489 (('iand', 0xff, ('ushr@32', a
, 24)), ('ushr', a
, 24)),
490 (('iand', 0xffff, ('ushr@32', a
, 16)), ('ushr', a
, 16)),
491 # Exponential/logarithmic identities
492 (('~fexp2', ('flog2', a
)), a
), # 2^lg2(a) = a
493 (('~flog2', ('fexp2', a
)), a
), # lg2(2^a) = a
494 (('fpow', a
, b
), ('fexp2', ('fmul', ('flog2', a
), b
)), 'options->lower_fpow'), # a^b = 2^(lg2(a)*b)
495 (('~fexp2', ('fmul', ('flog2', a
), b
)), ('fpow', a
, b
), '!options->lower_fpow'), # 2^(lg2(a)*b) = a^b
496 (('~fexp2', ('fadd', ('fmul', ('flog2', a
), b
), ('fmul', ('flog2', c
), d
))),
497 ('~fmul', ('fpow', a
, b
), ('fpow', c
, d
)), '!options->lower_fpow'), # 2^(lg2(a) * b + lg2(c) + d) = a^b * c^d
498 (('~fexp2', ('fmul', ('flog2', a
), 2.0)), ('fmul', a
, a
)),
499 (('~fexp2', ('fmul', ('flog2', a
), 4.0)), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
500 (('~fpow', a
, 1.0), a
),
501 (('~fpow', a
, 2.0), ('fmul', a
, a
)),
502 (('~fpow', a
, 4.0), ('fmul', ('fmul', a
, a
), ('fmul', a
, a
))),
503 (('~fpow', 2.0, a
), ('fexp2', a
)),
504 (('~fpow', ('fpow', a
, 2.2), 0.454545), a
),
505 (('~fpow', ('fabs', ('fpow', a
, 2.2)), 0.454545), ('fabs', a
)),
506 (('~fsqrt', ('fexp2', a
)), ('fexp2', ('fmul', 0.5, a
))),
507 (('~frcp', ('fexp2', a
)), ('fexp2', ('fneg', a
))),
508 (('~frsq', ('fexp2', a
)), ('fexp2', ('fmul', -0.5, a
))),
509 (('~flog2', ('fsqrt', a
)), ('fmul', 0.5, ('flog2', a
))),
510 (('~flog2', ('frcp', a
)), ('fneg', ('flog2', a
))),
511 (('~flog2', ('frsq', a
)), ('fmul', -0.5, ('flog2', a
))),
512 (('~flog2', ('fpow', a
, b
)), ('fmul', b
, ('flog2', a
))),
513 (('~fmul', ('fexp2(is_used_once)', a
), ('fexp2(is_used_once)', b
)), ('fexp2', ('fadd', a
, b
))),
514 # Division and reciprocal
515 (('~fdiv', 1.0, a
), ('frcp', a
)),
516 (('fdiv', a
, b
), ('fmul', a
, ('frcp', b
)), 'options->lower_fdiv'),
517 (('~frcp', ('frcp', a
)), a
),
518 (('~frcp', ('fsqrt', a
)), ('frsq', a
)),
519 (('fsqrt', a
), ('frcp', ('frsq', a
)), 'options->lower_fsqrt'),
520 (('~frcp', ('frsq', a
)), ('fsqrt', a
), '!options->lower_fsqrt'),
521 # Boolean simplifications
522 (('ieq', 'a@bool', True), a
),
523 (('ine(is_not_used_by_if)', 'a@bool', True), ('inot', a
)),
524 (('ine', 'a@bool', False), a
),
525 (('ieq(is_not_used_by_if)', 'a@bool', False), ('inot', 'a')),
526 (('bcsel', a
, True, False), a
),
527 (('bcsel', a
, False, True), ('inot', a
)),
528 (('bcsel@32', a
, 1.0, 0.0), ('b2f', a
)),
529 (('bcsel@32', a
, 0.0, 1.0), ('b2f', ('inot', a
))),
530 (('bcsel@32', a
, -1.0, -0.0), ('fneg', ('b2f', a
))),
531 (('bcsel@32', a
, -0.0, -1.0), ('fneg', ('b2f', ('inot', a
)))),
532 (('bcsel', True, b
, c
), b
),
533 (('bcsel', False, b
, c
), c
),
534 (('bcsel', a
, ('b2f(is_used_once)', 'b@32'), ('b2f', 'c@32')), ('b2f', ('bcsel', a
, b
, c
))),
535 # The result of this should be hit by constant propagation and, in the
536 # next round of opt_algebraic, get picked up by one of the above two.
537 (('bcsel', '#a', b
, c
), ('bcsel', ('ine', 'a', 0), b
, c
)),
539 (('bcsel', a
, b
, b
), b
),
540 (('fcsel', a
, b
, b
), b
),
542 # D3D Boolean emulation
543 (('bcsel', a
, -1, 0), ('ineg', ('b2i', 'a@1'))),
544 (('bcsel', a
, 0, -1), ('ineg', ('b2i', ('inot', a
)))),
545 (('iand', ('ineg', ('b2i', 'a@1')), ('ineg', ('b2i', 'b@1'))),
546 ('ineg', ('b2i', ('iand', a
, b
)))),
547 (('ior', ('ineg', ('b2i','a@1')), ('ineg', ('b2i', 'b@1'))),
548 ('ineg', ('b2i', ('ior', a
, b
)))),
549 (('ieq', ('ineg', ('b2i', 'a@1')), 0), ('inot', a
)),
550 (('ieq', ('ineg', ('b2i', 'a@1')), -1), a
),
551 (('ine', ('ineg', ('b2i', 'a@1')), 0), a
),
552 (('ine', ('ineg', ('b2i', 'a@1')), -1), ('inot', a
)),
553 (('iand', ('ineg', ('b2i', a
)), 1.0), ('b2f', a
)),
556 (('i2b32', ('b2i', 'a@32')), a
),
557 (('f2i', ('ftrunc', a
)), ('f2i', a
)),
558 (('f2u', ('ftrunc', a
)), ('f2u', a
)),
559 (('i2b', ('ineg', a
)), ('i2b', a
)),
560 (('i2b', ('iabs', a
)), ('i2b', a
)),
561 (('fabs', ('b2f', a
)), ('b2f', a
)),
562 (('iabs', ('b2i', a
)), ('b2i', a
)),
563 (('inot', ('f2b1', a
)), ('feq', a
, 0.0)),
565 # Ironically, mark these as imprecise because removing the conversions may
566 # preserve more precision than doing the conversions (e.g.,
567 # uint(float(0x81818181u)) == 0x81818200).
568 (('~f2i32', ('i2f', 'a@32')), a
),
569 (('~f2i32', ('u2f', 'a@32')), a
),
570 (('~f2u32', ('i2f', 'a@32')), a
),
571 (('~f2u32', ('u2f', 'a@32')), a
),
573 # Section 5.4.1 (Conversion and Scalar Constructors) of the GLSL 4.60 spec
576 # It is undefined to convert a negative floating-point value to an
579 # Assuming that (uint)some_float behaves like (uint)(int)some_float allows
580 # some optimizations in the i965 backend to proceed.
581 (('ige', ('f2u', a
), b
), ('ige', ('f2i', a
), b
)),
582 (('ige', b
, ('f2u', a
)), ('ige', b
, ('f2i', a
))),
583 (('ilt', ('f2u', a
), b
), ('ilt', ('f2i', a
), b
)),
584 (('ilt', b
, ('f2u', a
)), ('ilt', b
, ('f2i', a
))),
586 # Packing and then unpacking does nothing
587 (('unpack_64_2x32_split_x', ('pack_64_2x32_split', a
, b
)), a
),
588 (('unpack_64_2x32_split_y', ('pack_64_2x32_split', a
, b
)), b
),
589 (('pack_64_2x32_split', ('unpack_64_2x32_split_x', a
),
590 ('unpack_64_2x32_split_y', a
)), a
),
593 (('ushr', ('ishl', 'a@32', 24), 24), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
594 (('ushr', ('ishl', 'a@32', 16), 24), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
595 (('ushr', ('ishl', 'a@32', 8), 24), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
596 (('ushr', 'a@32', 24), ('extract_u8', a
, 3), '!options->lower_extract_byte'),
597 (('ishr', ('ishl', 'a@32', 24), 24), ('extract_i8', a
, 0), '!options->lower_extract_byte'),
598 (('ishr', ('ishl', 'a@32', 16), 24), ('extract_i8', a
, 1), '!options->lower_extract_byte'),
599 (('ishr', ('ishl', 'a@32', 8), 24), ('extract_i8', a
, 2), '!options->lower_extract_byte'),
600 (('ishr', 'a@32', 24), ('extract_i8', a
, 3), '!options->lower_extract_byte'),
601 (('iand', 0xff, ('ushr', a
, 16)), ('extract_u8', a
, 2), '!options->lower_extract_byte'),
602 (('iand', 0xff, ('ushr', a
, 8)), ('extract_u8', a
, 1), '!options->lower_extract_byte'),
603 (('iand', 0xff, a
), ('extract_u8', a
, 0), '!options->lower_extract_byte'),
606 (('ushr', ('ishl', 'a@32', 16), 16), ('extract_u16', a
, 0), '!options->lower_extract_word'),
607 (('ushr', 'a@32', 16), ('extract_u16', a
, 1), '!options->lower_extract_word'),
608 (('ishr', ('ishl', 'a@32', 16), 16), ('extract_i16', a
, 0), '!options->lower_extract_word'),
609 (('ishr', 'a@32', 16), ('extract_i16', a
, 1), '!options->lower_extract_word'),
610 (('iand', 0xffff, a
), ('extract_u16', a
, 0), '!options->lower_extract_word'),
613 (('~fsub', a
, ('fsub', 0.0, b
)), ('fadd', a
, b
)),
614 (('isub', a
, ('isub', 0, b
)), ('iadd', a
, b
)),
615 (('ussub_4x8', a
, 0), a
),
616 (('ussub_4x8', a
, ~
0), 0),
617 (('fsub', a
, b
), ('fadd', a
, ('fneg', b
)), 'options->lower_sub'),
618 (('isub', a
, b
), ('iadd', a
, ('ineg', b
)), 'options->lower_sub'),
619 (('fneg', a
), ('fsub', 0.0, a
), 'options->lower_negate'),
620 (('ineg', a
), ('isub', 0, a
), 'options->lower_negate'),
621 (('~fadd', a
, ('fsub', 0.0, b
)), ('fsub', a
, b
)),
622 (('iadd', a
, ('isub', 0, b
)), ('isub', a
, b
)),
623 (('fabs', ('fsub', 0.0, a
)), ('fabs', a
)),
624 (('iabs', ('isub', 0, a
)), ('iabs', a
)),
626 # Propagate negation up multiplication chains
627 (('fmul', ('fneg', a
), b
), ('fneg', ('fmul', a
, b
))),
628 (('imul', ('ineg', a
), b
), ('ineg', ('imul', a
, b
))),
630 # Propagate constants up multiplication chains
631 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fmul', ('fmul', a
, c
), b
)),
632 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('imul', ('imul', a
, c
), b
)),
633 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('fadd', ('fadd', a
, c
), b
)),
634 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', 'b(is_not_const)'), '#c'), ('iadd', ('iadd', a
, c
), b
)),
636 # Reassociate constants in add/mul chains so they can be folded together.
637 # For now, we mostly only handle cases where the constants are separated by
638 # a single non-constant. We could do better eventually.
639 (('~fmul', '#a', ('fmul', b
, '#c')), ('fmul', ('fmul', a
, c
), b
)),
640 (('imul', '#a', ('imul', b
, '#c')), ('imul', ('imul', a
, c
), b
)),
641 (('~fadd', '#a', ('fadd', b
, '#c')), ('fadd', ('fadd', a
, c
), b
)),
642 (('~fadd', '#a', ('fneg', ('fadd', b
, '#c'))), ('fadd', ('fadd', a
, ('fneg', c
)), ('fneg', b
))),
643 (('iadd', '#a', ('iadd', b
, '#c')), ('iadd', ('iadd', a
, c
), b
)),
646 (('bcsel', ('ige', ('find_lsb', a
), 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
647 (('bcsel', ('ige', ('ifind_msb', a
), 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
648 (('bcsel', ('ige', ('ufind_msb', a
), 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
650 (('bcsel', ('ine', a
, 0), ('find_lsb', a
), -1), ('find_lsb', a
)),
651 (('bcsel', ('ine', a
, 0), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
652 (('bcsel', ('ine', a
, 0), ('ufind_msb', a
), -1), ('ufind_msb', a
)),
654 (('bcsel', ('ine', a
, -1), ('ifind_msb', a
), -1), ('ifind_msb', a
)),
657 (('fmod@32', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
658 (('fmod@64', a
, b
), ('fsub', a
, ('fmul', b
, ('ffloor', ('fdiv', a
, b
)))), 'options->lower_fmod64'),
659 (('frem', a
, b
), ('fsub', a
, ('fmul', b
, ('ftrunc', ('fdiv', a
, b
)))), 'options->lower_fmod32'),
660 (('uadd_carry@32', a
, b
), ('b2i', ('ult', ('iadd', a
, b
), a
)), 'options->lower_uadd_carry'),
661 (('usub_borrow@32', a
, b
), ('b2i', ('ult', a
, b
)), 'options->lower_usub_borrow'),
663 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
664 ('bcsel', ('ilt', 31, 'bits'), 'insert',
665 ('bfi', ('bfm', 'bits', 'offset'), 'insert', 'base')),
666 'options->lower_bitfield_insert'),
668 # Alternative lowering that doesn't rely on bfi.
669 (('bitfield_insert', 'base', 'insert', 'offset', 'bits'),
670 ('bcsel', ('ilt', 31, 'bits'),
673 ('iand', 'base', ('inot', ('bfm', 'bits', 'offset'))),
674 ('iand', ('ishl', 'insert', 'offset'), ('bfm', 'bits', 'offset')))),
675 'options->lower_bitfield_insert_to_shifts'),
677 # bfm lowering -- note that the NIR opcode is undefined if either arg is 32.
678 (('bfm', 'bits', 'offset'),
679 ('ishl', ('isub', ('ishl', 1, 'bits'), 1), 'offset'),
680 'options->lower_bfm'),
682 (('ibitfield_extract', 'value', 'offset', 'bits'),
683 ('bcsel', ('ilt', 31, 'bits'), 'value',
684 ('ibfe', 'value', 'offset', 'bits')),
685 'options->lower_bitfield_extract'),
687 (('ubitfield_extract', 'value', 'offset', 'bits'),
688 ('bcsel', ('ult', 31, 'bits'), 'value',
689 ('ubfe', 'value', 'offset', 'bits')),
690 'options->lower_bitfield_extract'),
692 (('ibitfield_extract', 'value', 'offset', 'bits'),
693 ('bcsel', ('ieq', 0, 'bits'),
696 ('ishl', 'value', ('isub', ('isub', 32, 'bits'), 'offset')),
697 ('isub', 32, 'bits'))),
698 'options->lower_bitfield_extract_to_shifts'),
700 (('ubitfield_extract', 'value', 'offset', 'bits'),
702 ('ushr', 'value', 'offset'),
703 ('bcsel', ('ieq', 'bits', 32),
705 ('bfm', 'bits', 0))),
706 'options->lower_bitfield_extract_to_shifts'),
708 (('ifind_msb', 'value'),
709 ('ufind_msb', ('bcsel', ('ilt', 'value', 0), ('inot', 'value'), 'value')),
710 'options->lower_ifind_msb'),
712 (('find_lsb', 'value'),
713 ('ufind_msb', ('iand', 'value', ('ineg', 'value'))),
714 'options->lower_find_lsb'),
716 (('extract_i8', a
, 'b@32'),
717 ('ishr', ('ishl', a
, ('imul', ('isub', 3, b
), 8)), 24),
718 'options->lower_extract_byte'),
720 (('extract_u8', a
, 'b@32'),
721 ('iand', ('ushr', a
, ('imul', b
, 8)), 0xff),
722 'options->lower_extract_byte'),
724 (('extract_i16', a
, 'b@32'),
725 ('ishr', ('ishl', a
, ('imul', ('isub', 1, b
), 16)), 16),
726 'options->lower_extract_word'),
728 (('extract_u16', a
, 'b@32'),
729 ('iand', ('ushr', a
, ('imul', b
, 16)), 0xffff),
730 'options->lower_extract_word'),
732 (('pack_unorm_2x16', 'v'),
733 ('pack_uvec2_to_uint',
734 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 65535.0)))),
735 'options->lower_pack_unorm_2x16'),
737 (('pack_unorm_4x8', 'v'),
738 ('pack_uvec4_to_uint',
739 ('f2u32', ('fround_even', ('fmul', ('fsat', 'v'), 255.0)))),
740 'options->lower_pack_unorm_4x8'),
742 (('pack_snorm_2x16', 'v'),
743 ('pack_uvec2_to_uint',
744 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 32767.0)))),
745 'options->lower_pack_snorm_2x16'),
747 (('pack_snorm_4x8', 'v'),
748 ('pack_uvec4_to_uint',
749 ('f2i32', ('fround_even', ('fmul', ('fmin', 1.0, ('fmax', -1.0, 'v')), 127.0)))),
750 'options->lower_pack_snorm_4x8'),
752 (('unpack_unorm_2x16', 'v'),
753 ('fdiv', ('u2f32', ('vec2', ('extract_u16', 'v', 0),
754 ('extract_u16', 'v', 1))),
756 'options->lower_unpack_unorm_2x16'),
758 (('unpack_unorm_4x8', 'v'),
759 ('fdiv', ('u2f32', ('vec4', ('extract_u8', 'v', 0),
760 ('extract_u8', 'v', 1),
761 ('extract_u8', 'v', 2),
762 ('extract_u8', 'v', 3))),
764 'options->lower_unpack_unorm_4x8'),
766 (('unpack_snorm_2x16', 'v'),
767 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec2', ('extract_i16', 'v', 0),
768 ('extract_i16', 'v', 1))),
770 'options->lower_unpack_snorm_2x16'),
772 (('unpack_snorm_4x8', 'v'),
773 ('fmin', 1.0, ('fmax', -1.0, ('fdiv', ('i2f', ('vec4', ('extract_i8', 'v', 0),
774 ('extract_i8', 'v', 1),
775 ('extract_i8', 'v', 2),
776 ('extract_i8', 'v', 3))),
778 'options->lower_unpack_snorm_4x8'),
780 (('isign', a
), ('imin', ('imax', a
, -1), 1), 'options->lower_isign'),
783 invert
= OrderedDict([('feq', 'fne'), ('fne', 'feq'), ('fge', 'flt'), ('flt', 'fge')])
785 for left
, right
in itertools
.combinations_with_replacement(invert
.keys(), 2):
786 optimizations
.append((('inot', ('ior(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
787 ('iand', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
788 optimizations
.append((('inot', ('iand(is_used_once)', (left
, a
, b
), (right
, c
, d
))),
789 ('ior', (invert
[left
], a
, b
), (invert
[right
], c
, d
))))
791 # Optimize x2bN(b2x(x)) -> x
792 for size
in type_sizes('bool'):
793 aN
= 'a@' + str(size
)
794 f2bN
= 'f2b' + str(size
)
795 i2bN
= 'i2b' + str(size
)
796 optimizations
.append(((f2bN
, ('b2f', aN
)), a
))
797 optimizations
.append(((i2bN
, ('b2i', aN
)), a
))
799 # Optimize x2yN(b2x(x)) -> b2y
800 for x
, y
in itertools
.product(['f', 'u', 'i'], ['f', 'u', 'i']):
801 if x
!= 'f' and y
!= 'f' and x
!= y
:
804 b2x
= 'b2f' if x
== 'f' else 'b2i'
805 b2y
= 'b2f' if y
== 'f' else 'b2i'
806 x2yN
= '{}2{}'.format(x
, y
)
807 optimizations
.append(((x2yN
, (b2x
, a
)), (b2y
, a
)))
809 def fexp2i(exp
, bits
):
810 # We assume that exp is already in the right range.
812 return ('ishl', ('iadd', exp
, 127), 23)
814 return ('pack_64_2x32_split', 0, ('ishl', ('iadd', exp
, 1023), 20))
818 def ldexp(f
, exp
, bits
):
819 # First, we clamp exp to a reasonable range. The maximum possible range
820 # for a normal exponent is [-126, 127] and, throwing in denormals, you get
821 # a maximum range of [-149, 127]. This means that we can potentially have
822 # a swing of +-276. If you start with FLT_MAX, you actually have to do
823 # ldexp(FLT_MAX, -278) to get it to flush all the way to zero. The GLSL
824 # spec, on the other hand, only requires that we handle an exponent value
825 # in the range [-126, 128]. This implementation is *mostly* correct; it
826 # handles a range on exp of [-252, 254] which allows you to create any
827 # value (including denorms if the hardware supports it) and to adjust the
828 # exponent of any normal value to anything you want.
830 exp
= ('imin', ('imax', exp
, -252), 254)
832 exp
= ('imin', ('imax', exp
, -2044), 2046)
836 # Now we compute two powers of 2, one for exp/2 and one for exp-exp/2.
837 # (We use ishr which isn't the same for -1, but the -1 case still works
838 # since we use exp-exp/2 as the second exponent.) While the spec
839 # technically defines ldexp as f * 2.0^exp, simply multiplying once doesn't
840 # work with denormals and doesn't allow for the full swing in exponents
841 # that you can get with normalized values. Instead, we create two powers
842 # of two and multiply by them each in turn. That way the effective range
843 # of our exponent is doubled.
844 pow2_1
= fexp2i(('ishr', exp
, 1), bits
)
845 pow2_2
= fexp2i(('isub', exp
, ('ishr', exp
, 1)), bits
)
846 return ('fmul', ('fmul', f
, pow2_1
), pow2_2
)
849 (('ldexp@32', 'x', 'exp'), ldexp('x', 'exp', 32), 'options->lower_ldexp'),
850 (('ldexp@64', 'x', 'exp'), ldexp('x', 'exp', 64), 'options->lower_ldexp'),
853 # Unreal Engine 4 demo applications open-codes bitfieldReverse()
854 def bitfield_reverse(u
):
855 step1
= ('ior', ('ishl', u
, 16), ('ushr', u
, 16))
856 step2
= ('ior', ('ishl', ('iand', step1
, 0x00ff00ff), 8), ('ushr', ('iand', step1
, 0xff00ff00), 8))
857 step3
= ('ior', ('ishl', ('iand', step2
, 0x0f0f0f0f), 4), ('ushr', ('iand', step2
, 0xf0f0f0f0), 4))
858 step4
= ('ior', ('ishl', ('iand', step3
, 0x33333333), 2), ('ushr', ('iand', step3
, 0xcccccccc), 2))
859 step5
= ('ior', ('ishl', ('iand', step4
, 0x55555555), 1), ('ushr', ('iand', step4
, 0xaaaaaaaa), 1))
863 optimizations
+= [(bitfield_reverse('x@32'), ('bitfield_reverse', 'x'))]
865 # For any float comparison operation, "cmp", if you have "a == a && a cmp b"
866 # then the "a == a" is redundant because it's equivalent to "a is not NaN"
867 # and, if a is a NaN then the second comparison will fail anyway.
868 for op
in ['flt', 'fge', 'feq']:
870 (('iand', ('feq', a
, a
), (op
, a
, b
)), (op
, a
, b
)),
871 (('iand', ('feq', a
, a
), (op
, b
, a
)), (op
, b
, a
)),
874 # Add optimizations to handle the case where the result of a ternary is
875 # compared to a constant. This way we can take things like
881 # a ? (0 > 0) : (1 > 0)
883 # which constant folding will eat for lunch. The resulting ternary will
884 # further get cleaned up by the boolean reductions above and we will be
885 # left with just the original variable "a".
886 for op
in ['flt', 'fge', 'feq', 'fne',
887 'ilt', 'ige', 'ieq', 'ine', 'ult', 'uge']:
889 ((op
, ('bcsel', 'a', '#b', '#c'), '#d'),
890 ('bcsel', 'a', (op
, 'b', 'd'), (op
, 'c', 'd'))),
891 ((op
, '#d', ('bcsel', a
, '#b', '#c')),
892 ('bcsel', 'a', (op
, 'd', 'b'), (op
, 'd', 'c'))),
896 # For example, this converts things like
898 # 1 + mix(0, a - 1, condition)
902 # mix(1, (a-1)+1, condition)
904 # Other optimizations will rearrange the constants.
905 for op
in ['fadd', 'fmul', 'iadd', 'imul']:
907 ((op
, ('bcsel(is_used_once)', a
, '#b', c
), '#d'), ('bcsel', a
, (op
, b
, d
), (op
, c
, d
)))
910 # This section contains "late" optimizations that should be run before
911 # creating ffmas and calling regular optimizations for the final time.
912 # Optimizations should go here if they help code generation and conflict
913 # with the regular optimizations.
914 before_ffma_optimizations
= [
915 # Propagate constants down multiplication chains
916 (('~fmul(is_used_once)', ('fmul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fmul', ('fmul', a
, c
), b
)),
917 (('imul(is_used_once)', ('imul(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('imul', ('imul', a
, c
), b
)),
918 (('~fadd(is_used_once)', ('fadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('fadd', ('fadd', a
, c
), b
)),
919 (('iadd(is_used_once)', ('iadd(is_used_once)', 'a(is_not_const)', '#b'), 'c(is_not_const)'), ('iadd', ('iadd', a
, c
), b
)),
921 (('~fadd', ('fmul', a
, b
), ('fmul', a
, c
)), ('fmul', a
, ('fadd', b
, c
))),
922 (('iadd', ('imul', a
, b
), ('imul', a
, c
)), ('imul', a
, ('iadd', b
, c
))),
923 (('~fadd', ('fneg', a
), a
), 0.0),
924 (('iadd', ('ineg', a
), a
), 0),
925 (('iadd', ('ineg', a
), ('iadd', a
, b
)), b
),
926 (('iadd', a
, ('iadd', ('ineg', a
), b
)), b
),
927 (('~fadd', ('fneg', a
), ('fadd', a
, b
)), b
),
928 (('~fadd', a
, ('fadd', ('fneg', a
), b
)), b
),
931 # This section contains "late" optimizations that should be run after the
932 # regular optimizations have finished. Optimizations should go here if
933 # they help code generation but do not necessarily produce code that is
934 # more easily optimizable.
935 late_optimizations
= [
936 # Most of these optimizations aren't quite safe when you get infinity or
937 # Nan involved but the first one should be fine.
938 (('flt', ('fadd', a
, b
), 0.0), ('flt', a
, ('fneg', b
))),
939 (('flt', ('fneg', ('fadd', a
, b
)), 0.0), ('flt', ('fneg', a
), b
)),
940 (('~fge', ('fadd', a
, b
), 0.0), ('fge', a
, ('fneg', b
))),
941 (('~fge', ('fneg', ('fadd', a
, b
)), 0.0), ('fge', ('fneg', a
), b
)),
942 (('~feq', ('fadd', a
, b
), 0.0), ('feq', a
, ('fneg', b
))),
943 (('~fne', ('fadd', a
, b
), 0.0), ('fne', a
, ('fneg', b
))),
945 (('~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
)))),
947 (('fdot2', a
, b
), ('fdot_replicated2', a
, b
), 'options->fdot_replicates'),
948 (('fdot3', a
, b
), ('fdot_replicated3', a
, b
), 'options->fdot_replicates'),
949 (('fdot4', a
, b
), ('fdot_replicated4', a
, b
), 'options->fdot_replicates'),
950 (('fdph', a
, b
), ('fdph_replicated', a
, b
), 'options->fdot_replicates'),
952 (('b2f(is_used_more_than_once)', ('inot', 'a@1')), ('bcsel', a
, 0.0, 1.0)),
953 (('fneg(is_used_more_than_once)', ('b2f', ('inot', 'a@1'))), ('bcsel', a
, -0.0, -1.0)),
955 # we do these late so that we don't get in the way of creating ffmas
956 (('fmin', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmin', a
, b
))),
957 (('fmax', ('fadd(is_used_once)', '#c', a
), ('fadd(is_used_once)', '#c', b
)), ('fadd', c
, ('fmax', a
, b
))),
960 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic", optimizations
).render())
961 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_before_ffma",
962 before_ffma_optimizations
).render())
963 print(nir_algebraic
.AlgebraicPass("nir_opt_algebraic_late",
964 late_optimizations
).render())
projects / mesa.git / blob