Am 27.11.18 um 10:20 schrieb Chris Wilson:
Quoting Monk Liu (2018-11-27 03:10:34)
v2:
amend description:
for RB tree traveler we don't need to travel to
the bottom level if already found the equal size node,
thus the search performance can get improved.
v3:
split "<=" to "<" case and "==" case
Tested-by: Rex Zhu <rex....@amd.com>
Signed-off-by: Monk Liu <monk....@amd.com>
Still fundamentally broken.
Can you explain that further? Do we need to return the deepest hole of
the right size because the following algorithm depends on that?
Thanks,
Christian.
-Chris
_______________________________________________
dri-devel mailing list
dri-devel@lists.freedesktop.org
https://lists.freedesktop.org/mailman/listinfo/dri-devel
_______________________________________________
dri-devel mailing list
dri-devel@lists.freedesktop.org
https://lists.freedesktop.org/mailman/listinfo/dri-devel
