[Intel-gfx] [PATCH] dma-buf: Replace reservation shared fence array with a compressed radix tree

2016-11-14 Thread kbuild test robot
Hi Chris, [auto build test WARNING on drm/drm-next] [also build test WARNING on next-20161114] [cannot apply to v4.9-rc5] [if your patch is applied to the wrong git tree, please drop us a note to help improve the system] url: https://github.com/0day-ci/linux/commits/Chris-Wilson/dma-buf-Repl

[Intel-gfx] [PATCH] dma-buf: Replace reservation shared fence array with a compressed radix tree

2016-11-14 Thread kbuild test robot
Hi Chris, [auto build test ERROR on drm/drm-next] [also build test ERROR on next-20161114] [cannot apply to v4.9-rc5] [if your patch is applied to the wrong git tree, please drop us a note to help improve the system] url: https://github.com/0day-ci/linux/commits/Chris-Wilson/dma-buf-Replace-

[PATCH] dma-buf: Replace reservation shared fence array with a compressed radix tree

2016-11-14 Thread Christian König
Hi Chris, Am 14.11.2016 um 09:31 schrieb Chris Wilson: > The primary operation on the shared fence arrays is insertion and > retrieval. Retrieval is reasonably fast, as we just copy the array, but > insertion into the shared fence array is slow as we must iterate over all > current fences to disc

[PATCH] dma-buf: Replace reservation shared fence array with a compressed radix tree

2016-11-14 Thread Chris Wilson
The primary operation on the shared fence arrays is insertion and retrieval. Retrieval is reasonably fast, as we just copy the array, but insertion into the shared fence array is slow as we must iterate over all current fences to discard an older fence. (Note also that since the array is not auto