On Tue, Aug 18, 2015 at 3:42 PM, Eric Anholt <e...@anholt.net> wrote: > Jason Ekstrand <ja...@jlekstrand.net> writes: > >> This series was inspired by a patch from Chris Willson entitled >> "util/register_allocate: Compute transitive conflicts using 2-passes" >> >> The basic idea is the same: Instead of marking transitive conflicts as you >> go, just mark conflicts with the base register up-front and apply >> transitivity later. One nice result of this is that with this and >> pre-calculated q-values, we can get rid of the expensive conflict lists >> that we build inside the allocator. This takes a full piglit run on 32-bit >> baytrail from about 28 minutes to 22 due to the reduction in screen >> creation time. >> >> The last patch makes BITSET_WORD a 64-bit value on 64-bit systems. I don't >> actually have perf numbers for that, but it should help ra setup as well as >> liveness analysis and a whole host of other compiler tasks. > > Patch 1-4 are: > > Reviewed-by: Eric Anholt <e...@anholt.net>
Awesome! Thanks! --Jason _______________________________________________ mesa-dev mailing list mesa-dev@lists.freedesktop.org http://lists.freedesktop.org/mailman/listinfo/mesa-dev
