Quoting Chris Wilson (2018-05-13 10:50:07) > As we keep an rbtree of available holes sorted by their size, we can > very easily determine if there is any hole large enough that might > satisfy the allocation request. This helps when dealing with a highly > fragmented address space and a request for a search by address. > > To cache the largest size, we convert into the cached rbtree variant > which tracks the leftmost node for us. However, currently we sorted into > ascending size order so the leftmost node is the smallest, and so to > make it the largest hole we need to invert our sorting. > > Signed-off-by: Chris Wilson <ch...@chris-wilson.co.uk> > Cc: Joonas Lahtinen <joonas.lahti...@linux.intel.com>
Reviewed-by: Joonas Lahtinen <joonas.lahti...@linux.intel.com> Regards, Joonas _______________________________________________ dri-devel mailing list dri-devel@lists.freedesktop.org https://lists.freedesktop.org/mailman/listinfo/dri-devel
