static int test_get_fences()

in st-dma-resv.c [276:343]

• 61 lines of code
• 13 McCabe index (conditional complexity)

static int test_get_fences(void *arg, bool shared)
{
	struct dma_fence *f, *excl = NULL, **fences = NULL;
	struct dma_resv resv;
	int r, i;

	f = alloc_fence();
	if (!f)
		return -ENOMEM;

	dma_resv_init(&resv);
	r = dma_resv_lock(&resv, NULL);
	if (r) {
		pr_err("Resv locking failed\n");
		goto err_resv;
	}

	if (shared) {
		r = dma_resv_reserve_shared(&resv, 1);
		if (r) {
			pr_err("Resv shared slot allocation failed\n");
			dma_resv_unlock(&resv);
			goto err_resv;
		}

		dma_resv_add_shared_fence(&resv, f);
	} else {
		dma_resv_add_excl_fence(&resv, f);
	}
	dma_resv_unlock(&resv);

	r = dma_resv_get_fences(&resv, &excl, &i, &fences);
	if (r) {
		pr_err("get_fences failed\n");
		goto err_free;
	}

	if (shared) {
		if (excl != NULL) {
			pr_err("get_fences returned unexpected excl fence\n");
			goto err_free;
		}
		if (i != 1 || fences[0] != f) {
			pr_err("get_fences returned unexpected shared fence\n");
			goto err_free;
		}
	} else {
		if (excl != f) {
			pr_err("get_fences returned unexpected excl fence\n");
			goto err_free;
		}
		if (i != 0) {
			pr_err("get_fences returned unexpected shared fence\n");
			goto err_free;
		}
	}

	dma_fence_signal(f);
err_free:
	dma_fence_put(excl);
	while (i--)
		dma_fence_put(fences[i]);
	kfree(fences);
err_resv:
	dma_resv_fini(&resv);
	dma_fence_put(f);
	return r;
}