From 6e8d4a2f8043a3a7a28175326e63770aa9511ee7 Mon Sep 17 00:00:00 2001 From: Eric Anholt Date: Sun, 29 Mar 2015 22:59:39 -0700 Subject: [PATCH] nir: Recognize a pattern for doing b2f without the opcode. Since we have patterns based on b2f, generate them if we see the b2f equivalent using an iand. This is common when generating NIR from TGSI. Reviewed-by: Connor Abbott --- src/glsl/nir/nir_opt_algebraic.py | 1 + 1 file changed, 1 insertion(+) diff --git a/src/glsl/nir/nir_opt_algebraic.py b/src/glsl/nir/nir_opt_algebraic.py index 66b456d1164..301d7a8ebcf 100644 --- a/src/glsl/nir/nir_opt_algebraic.py +++ b/src/glsl/nir/nir_opt_algebraic.py @@ -99,6 +99,7 @@ optimizations = [ # Emulating booleans (('fmul', ('b2f', a), ('b2f', b)), ('b2f', ('iand', a, b))), (('fsat', ('fadd', ('b2f', a), ('b2f', b))), ('b2f', ('ior', a, b))), + (('iand', 'a@bool', 1.0), ('b2f', a)), # Comparison with the same args. Note that these are not done for # the float versions because NaN always returns false on float # inequalities. -- 2.30.2