On Sun, 6 Jun 2010 23:52:59 -0700, Eric Anholt <e...@anholt.net> wrote: > Theory being that we don't keep *that* many buffers around, and the > pain of trying to find the right size in the list is less than the > pain of using gratuitous amounts of system memory for our BOs.
And, if you sorted the list in size order, you could locate a matching object in log instead of linear time, eliminating most of the potential performance impact. Either a RB tree or a skip list might make sense here; I'd probably use a skip list as those are easier to understand though. -- keith.pack...@intel.com
pgpfHDbbjtugH.pgp
Description: PGP signature
_______________________________________________ Intel-gfx mailing list Intel-gfx@lists.freedesktop.org http://lists.freedesktop.org/mailman/listinfo/intel-gfx
