184 	struct dma_resv_list *old, *new;  in dma_resv_reserve_fences()  local
189 	old = dma_resv_fences_list(obj);  in dma_resv_reserve_fences()
190 	if (old && old->max_fences) {  in dma_resv_reserve_fences()
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()
208 	for (i = 0, j = 0, k = max; i < (old ? old->num_fences : 0); ++i) {  in dma_resv_reserve_fences()
212 		dma_resv_list_entry(old, i, obj, &fence, &usage);  in dma_resv_reserve_fences()
230 	if (!old)  in dma_resv_reserve_fences()
241 	kfree_rcu(old, rcu);  in dma_resv_reserve_fences()
284 	struct dma_fence *old;  in dma_resv_add_fence()  local
302 		dma_resv_list_entry(fobj, i, obj, &old, &old_usage);  in dma_resv_add_fence()
303 		if ((old->context == fence->context && old_usage >= usage &&  in dma_resv_add_fence()
304 		     dma_fence_is_later_or_same(fence, old)) ||  in dma_resv_add_fence()
305 		    dma_fence_is_signaled(old)) {  in dma_resv_add_fence()
307 			dma_fence_put(old);  in dma_resv_add_fence()
346 		struct dma_fence *old;  in dma_resv_replace_fences()  local
348 		dma_resv_list_entry(list, i, obj, &old, NULL);  in dma_resv_replace_fences()
349 		if (old->context != context)  in dma_resv_replace_fences()
353 		dma_fence_put(old);  in dma_resv_replace_fences()