Lines Matching refs:num_fences
65 u32 num_fences, max_fences; member
125 for (i = 0; i < list->num_fences; ++i) { in dma_resv_list_free()
182 int dma_resv_reserve_fences(struct dma_resv *obj, unsigned int num_fences) in dma_resv_reserve_fences() argument
191 if ((old->num_fences + num_fences) <= old->max_fences) in dma_resv_reserve_fences()
193 max = max(old->num_fences + num_fences, old->max_fences * 2); in dma_resv_reserve_fences()
195 max = max(4ul, roundup_pow_of_two(num_fences)); in dma_resv_reserve_fences()
208 for (i = 0, j = 0, k = max; i < (old ? old->num_fences : 0); ++i) { in dma_resv_reserve_fences()
218 new->num_fences = j; in dma_resv_reserve_fences()
264 fences->max_fences = fences->num_fences; in dma_resv_reset_max_fences()
297 count = fobj->num_fences; in dma_resv_add_fence()
312 BUG_ON(fobj->num_fences >= fobj->max_fences); in dma_resv_add_fence()
317 smp_store_mb(fobj->num_fences, count); in dma_resv_add_fence()
345 for (i = 0; list && i < list->num_fences; ++i) { in dma_resv_replace_fences()
362 cursor->num_fences = 0; in dma_resv_iter_restart_unlocked()
365 cursor->num_fences = cursor->fences->num_fences; in dma_resv_iter_restart_unlocked()
379 if (cursor->index >= cursor->num_fences) { in dma_resv_iter_walk_unlocked()
495 cursor->index >= cursor->fences->num_fences) in dma_resv_iter_next()
529 list = dma_resv_list_alloc(cursor.num_fences); in dma_resv_copy_fences()
534 list->num_fences = 0; in dma_resv_copy_fences()
538 dma_resv_list_set(list, list->num_fences++, f, in dma_resv_copy_fences()
562 unsigned int *num_fences, struct dma_fence ***fences) in dma_resv_get_fences() argument
567 *num_fences = 0; in dma_resv_get_fences()
576 while (*num_fences) in dma_resv_get_fences()
577 dma_fence_put((*fences)[--(*num_fences)]); in dma_resv_get_fences()
579 count = cursor.num_fences + 1; in dma_resv_get_fences()
591 (*fences)[(*num_fences)++] = dma_fence_get(fence); in dma_resv_get_fences()