65 	u32 num_fences, max_fences;  member
120 	for (i = 0; i < list->num_fences; ++i) {  in dma_resv_list_free()
177 int dma_resv_reserve_fences(struct dma_resv *obj, unsigned int num_fences)  in dma_resv_reserve_fences()  argument
186 		if ((old->num_fences + num_fences) <= old->max_fences)  in dma_resv_reserve_fences()
188 		max = max(old->num_fences + num_fences, old->max_fences * 2);  in dma_resv_reserve_fences()
190 		max = max(4ul, roundup_pow_of_two(num_fences));  in dma_resv_reserve_fences()
203 	for (i = 0, j = 0, k = max; i < (old ? old->num_fences : 0); ++i) {  in dma_resv_reserve_fences()
213 	new->num_fences = j;  in dma_resv_reserve_fences()
259 		fences->max_fences = fences->num_fences;  in dma_resv_reset_max_fences()
292 	count = fobj->num_fences;  in dma_resv_add_fence()
307 	BUG_ON(fobj->num_fences >= fobj->max_fences);  in dma_resv_add_fence()
312 	smp_store_mb(fobj->num_fences, count);  in dma_resv_add_fence()
340 	for (i = 0; list && i < list->num_fences; ++i) {  in dma_resv_replace_fences()
357 	cursor->num_fences = 0;  in dma_resv_iter_restart_unlocked()
360 		cursor->num_fences = cursor->fences->num_fences;  in dma_resv_iter_restart_unlocked()
374 		if (cursor->index >= cursor->num_fences) {  in dma_resv_iter_walk_unlocked()
490 		    cursor->index >= cursor->fences->num_fences)  in dma_resv_iter_next()
524 			list = dma_resv_list_alloc(cursor.num_fences);  in dma_resv_copy_fences()
529 			list->num_fences = 0;  in dma_resv_copy_fences()
533 		dma_resv_list_set(list, list->num_fences++, f,  in dma_resv_copy_fences()
557 			unsigned int *num_fences, struct dma_fence ***fences)  in dma_resv_get_fences()  argument
562 	*num_fences = 0;  in dma_resv_get_fences()
571 			while (*num_fences)  in dma_resv_get_fences()
572 				dma_fence_put((*fences)[--(*num_fences)]);  in dma_resv_get_fences()
574 			count = cursor.num_fences + 1;  in dma_resv_get_fences()
586 		(*fences)[(*num_fences)++] = dma_fence_get(fence);  in dma_resv_get_fences()