Lines Matching refs:fences
313 struct eb_fence *fences;
1048 /* Reserve enough slots to accommodate composite fences */
2128 * using mandatory fences underneath. Currently the below
2789 __free_fence_array(struct eb_fence *fences, unsigned int n)
2792 drm_syncobj_put(ptr_mask_bits(fences[n].syncobj, 2));
2793 dma_fence_put(fences[n].dma_fence);
2794 dma_fence_chain_free(fences[n].chain_fence);
2796 kvfree(fences);
2828 f = krealloc(eb->fences,
2834 eb->fences = f;
2957 f = krealloc(eb->fences,
2963 eb->fences = f;
3007 static void put_fence_array(struct eb_fence *fences, int num_fences)
3009 if (fences)
3010 __free_fence_array(fences, num_fences);
3021 if (!eb->fences[n].dma_fence)
3024 err = i915_request_await_dma_fence(rq, eb->fences[n].dma_fence);
3041 syncobj = ptr_unpack_bits(eb->fences[n].syncobj, &flags, 2);
3045 if (eb->fences[n].chain_fence) {
3047 eb->fences[n].chain_fence,
3049 eb->fences[n].value);
3054 eb->fences[n].chain_fence = NULL;
3202 struct dma_fence **fences;
3207 fences = kmalloc_array(eb->num_batches, sizeof(*fences), GFP_KERNEL);
3208 if (!fences)
3212 fences[i] = &eb->requests[i]->fence;
3218 fences,
3223 kfree(fences);
3229 dma_fence_get(fences[i]);
3270 if (eb->fences) {
3324 * take the in fences into account as all subsequent requests
3325 * will have fences inserted inbetween them.
3387 eb.fences = NULL;
3498 if (eb.fences)
3545 put_fence_array(eb.fences, eb.num_fences);