nir: Simplify 0 >= b2f(a)
authorIan Romanick <ian.d.romanick@intel.com>
Wed, 2 Mar 2016 23:18:34 +0000 (15:18 -0800)
committerIan Romanick <ian.d.romanick@intel.com>
Tue, 22 Mar 2016 21:44:57 +0000 (14:44 -0700)
commit564a8b8a2645939cd416b62ae2e59c2fbd4b9fc2
treec914706e38104d68fb8837eac6d6bf70f544a989
parentbf0d60aa115cb8ba83f9b853f1b57c290eaf325b
nir: Simplify 0 >= b2f(a)

This also prevented some regressions with other patches in my local
tree.

Broadwell / Skylake
total instructions in shared programs: 8980835 -> 8980833 (-0.00%)
instructions in affected programs: 45 -> 43 (-4.44%)
helped: 1
HURT: 0

total cycles in shared programs: 70077904 -> 70077900 (-0.00%)
cycles in affected programs: 122 -> 118 (-3.28%)
helped: 1
HURT: 0

No changes on earlier platforms.

v2: Modify the comments to look more like a proof.

Signed-off-by: Ian Romanick <ian.d.romanick@intel.com>
Reviewed-by: Matt Turner <mattst88@gmail.com>
src/compiler/nir/nir_opt_algebraic.py