On Thu, Sep 6, 2012 at 2:29 PM, Marek Olšák <mar...@gmail.com> wrote: > This looks good to me. It's funny to see the r300g architecture being > re-implemented in r600g. :) > > There's one optimization that r300g has that this patch doesn't. r300g > keeps the index of the first and the last dirty atom and the loops > over the list of atoms look like this: > for (i = first_dirty; i <= last_dirty; i++) > > And after emission: > first_dirty = some large number; > last_dirty= 0; > > The atoms should be ordered according to how frequently they are > updated (except when the ordering is required by the hw). But most > importantly, if there are no state changes, the loops are trivially > skipped. > > Marek
Don't think this optimization is worth it, there won't be much more than 32 atom in the end and it definitely can't be ordered from most frequent to less frequent as some of the stuff need to be at the last being emitted and they are frequent one (primitive type for instance). Cheers, Jerome _______________________________________________ mesa-dev mailing list mesa-dev@lists.freedesktop.org http://lists.freedesktop.org/mailman/listinfo/mesa-dev
