On ma, 2016-12-12 at 11:53 +0000, Chris Wilson wrote:
> Check that we add arbitrary blocks to a restrited eviction scanner in
> order to find the first minimal hole that matches our request.
>
> Signed-off-by: Chris Wilson <chris at chris-wilson.co.uk>
<SNIP>
> +static int igt_evict_range(void *ignored)
> +{
<SNIP>
> + drm_for_each_prime(n, range_size) {
> + LIST_HEAD(evict_list);
> + struct evict_node *e, *en;
> + struct drm_mm_node tmp;
> + int nsize = (range_size - n + 1) / 2;
> + int err;
DRM_MM_BUG_ON(!nsize);
Same comment aplies about reserve vs insert (the amount of tests after
each, can be resolved with helpers).
Reviewed-by: Joonas Lahtinen <joonas.lahtinen at linux.intel.com>
Regards, Joonas
--
Joonas Lahtinen
Open Source Technology Center
Intel Corporation
