Lines Matching refs:shared_count
92 for (i = 0; i < list->shared_count; ++i) in dma_resv_list_free()
160 if ((old->shared_count + num_fences) <= old->shared_max) in dma_resv_reserve_shared()
162 max = max(old->shared_count + num_fences, old->shared_max * 2); in dma_resv_reserve_shared()
177 for (i = 0, j = 0, k = max; i < (old ? old->shared_count : 0); ++i) { in dma_resv_reserve_shared()
187 new->shared_count = j; in dma_resv_reserve_shared()
233 fences->shared_max = fences->shared_count; in dma_resv_reset_shared_max()
259 count = fobj->shared_count; in dma_resv_add_shared_fence()
272 BUG_ON(fobj->shared_count >= fobj->shared_max); in dma_resv_add_shared_fence()
279 smp_store_mb(fobj->shared_count, count); in dma_resv_add_shared_fence()
305 i = old->shared_count; in dma_resv_add_excl_fence()
314 old->shared_count = 0; in dma_resv_add_excl_fence()
336 cursor->shared_count = 0; in dma_resv_iter_restart_unlocked()
340 cursor->shared_count = cursor->fences->shared_count; in dma_resv_iter_restart_unlocked()
370 cursor->index >= cursor->shared_count) { in dma_resv_iter_walk_unlocked()
472 if (!cursor->fences || cursor->index >= cursor->fences->shared_count) in dma_resv_iter_next()
506 if (cursor.shared_count) { in dma_resv_copy_fences()
507 list = dma_resv_list_alloc(cursor.shared_count); in dma_resv_copy_fences()
513 list->shared_count = 0; in dma_resv_copy_fences()
525 RCU_INIT_POINTER(list->shared[list->shared_count++], f); in dma_resv_copy_fences()
555 unsigned int *shared_count, struct dma_fence ***shared) in dma_resv_get_fences() argument
560 *shared_count = 0; in dma_resv_get_fences()
572 while (*shared_count) in dma_resv_get_fences()
573 dma_fence_put((*shared)[--(*shared_count)]); in dma_resv_get_fences()
578 count = cursor.shared_count; in dma_resv_get_fences()
595 (*shared)[(*shared_count)++] = fence; in dma_resv_get_fences()