KonstantinSeurer
/
mesa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

nir/opt_algebraic: Simplify an optimization using the new search ops 

Reviewed-by: Connor Abbott <cwabbott0@gmail.com>
This commit is contained in:
Jason Ekstrand 2018-11-07 16:25:31 -06:00
parent 05af952a11
commit ff8e3d3b7b
1 changed files with 2 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/compiler/nir/nir_opt_algebraic.py
View File

@ -762,13 +762,8 @@ for x, y in itertools.product(['f', 'u', 'i'], ['f', 'u', 'i']):
b2x = 'b2f' if x == 'f' else 'b2i'
b2y = 'b2f' if y == 'f' else 'b2i'
for N in [8, 16, 32, 64]:
if y == 'f' and N == 8:
continue
x2yN = '{}2{}{}'.format(x, y, N)
optimizations.append(((x2yN, (b2x, a)), (b2y, a)))
x2yN = '{}2{}'.format(x, y)
optimizations.append(((x2yN, (b2x, a)), (b2y, a)))
def fexp2i(exp, bits):
# We assume that exp is already in the right range.