On Fri, Feb 7, 2014 at 6:34 AM, Connor Abbott <cwabbo...@gmail.com> wrote: > - It turns out that the original advantage of a tree-based IR, to be > able to automatically generate pattern-matching code for optimizing > certain code patterns, only really matters for CPU's with weird > instruction sets with lots of exotic instructions; GPU's tend to be > pretty regular and consistent in their ISA's, so being able to > pattern-match with trees doesn't help us much here.
>From my understanding this point in Ian's talk wasn't really about optimizations, but rather about instruction selection. I know at least one shader compiler architecture where pattern matching optimizations have paid off quite well, but not necessarily for a tree-based ISA. _______________________________________________ mesa-dev mailing list mesa-dev@lists.freedesktop.org http://lists.freedesktop.org/mailman/listinfo/mesa-dev