nir: Refactor algebraic's block walk
authorEric Anholt <eric@anholt.net>
Wed, 13 Nov 2019 20:15:08 +0000 (12:15 -0800)
committerEric Anholt <eric@anholt.net>
Tue, 26 Nov 2019 18:13:40 +0000 (10:13 -0800)
commit90ad6304bff0e8ba05261c32a5bc964a803868c8
treee8cb81e5af9f0ad7c828e9c3a80fdaef5e6fdaa3
parent305d1300f9052405ad9d273b9cbda48c55faf46a
nir: Refactor algebraic's block walk

My motivation was to clarify the changes in the following commit, but
incidentally, it reduces runtime of
dEQP-GLES2.functional.uniform_api.random.3 (an algebraic-heavy
testcase) by -5.39524% +/- 2.21179% (n=15)

Reviewed-by: Connor Abbott <cwabbott0@gmail.com>
src/compiler/nir/nir_search.c