From ff8e3d3b7bc9f57b831e048e9a78e456dc0a4be5 Mon Sep 17 00:00:00 2001 From: Jason Ekstrand Date: Wed, 7 Nov 2018 16:25:31 -0600 Subject: [PATCH] nir/opt_algebraic: Simplify an optimization using the new search ops Reviewed-by: Connor Abbott --- src/compiler/nir/nir_opt_algebraic.py | 9 ++------- 1 file changed, 2 insertions(+), 7 deletions(-) diff --git a/src/compiler/nir/nir_opt_algebraic.py b/src/compiler/nir/nir_opt_algebraic.py index f2a7be0c403..27c90cebaee 100644 --- a/src/compiler/nir/nir_opt_algebraic.py +++ b/src/compiler/nir/nir_opt_algebraic.py @@ -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.