i915/gem/i915_gem_execbuffer.c

315 	struct eb_fence *fences;
1050 		/* Reserve enough slots to accommodate composite fences */
2130 		 *   using mandatory fences underneath. Currently the below
2791 __free_fence_array(struct eb_fence *fences, unsigned int n)
2794 		drm_syncobj_put(ptr_mask_bits(fences[n].syncobj, 2));
2795 		dma_fence_put(fences[n].dma_fence);
2796 		dma_fence_chain_free(fences[n].chain_fence);
2798 	kvfree(fences);
2830 	f = krealloc(eb->fences,
2836 	eb->fences = f;
2959 	f = krealloc(eb->fences,
2965 	eb->fences = f;
3009 static void put_fence_array(struct eb_fence *fences, int num_fences)
3011 	if (fences)
3012 		__free_fence_array(fences, num_fences);
3023 		if (!eb->fences[n].dma_fence)
3026 		err = i915_request_await_dma_fence(rq, eb->fences[n].dma_fence);
3043 		syncobj = ptr_unpack_bits(eb->fences[n].syncobj, &flags, 2);
3047 		if (eb->fences[n].chain_fence) {
3049 					      eb->fences[n].chain_fence,
3051 					      eb->fences[n].value);
3056 			eb->fences[n].chain_fence = NULL;
3204 	struct dma_fence **fences;
3209 	fences = kmalloc_array(eb->num_batches, sizeof(*fences), GFP_KERNEL);
3210 	if (!fences)
3214 		fences[i] = &eb->requests[i]->fence;
3220 					     fences,
3225 		kfree(fences);
3231 		dma_fence_get(fences[i]);
3272 	if (eb->fences) {
3326 		 * take the in fences into account as all subsequent requests
3327 		 * will have fences inserted inbetween them.
3389 	eb.fences = NULL;
3500 	if (eb.fences)
3547 	put_fence_array(eb.fences, eb.num_fences);