Lines Matching refs:num_fences
65 u32 num_fences, max_fences;
125 for (i = 0; i < list->num_fences; ++i) {
170 * @num_fences: number of fences we want to add
182 int dma_resv_reserve_fences(struct dma_resv *obj, unsigned int num_fences)
191 if ((old->num_fences + num_fences) <= old->max_fences)
193 max = max(old->num_fences + num_fences, old->max_fences * 2);
195 max = max(4ul, roundup_pow_of_two(num_fences));
208 for (i = 0, j = 0, k = max; i < (old ? old->num_fences : 0); ++i) {
218 new->num_fences = j;
264 fences->max_fences = fences->num_fences;
297 count = fobj->num_fences;
312 BUG_ON(fobj->num_fences >= fobj->max_fences);
316 /* pointer update must be visible before we extend the num_fences */
317 smp_store_mb(fobj->num_fences, count);
345 for (i = 0; list && i < list->num_fences; ++i) {
362 cursor->num_fences = 0;
365 cursor->num_fences = cursor->fences->num_fences;
379 if (cursor->index >= cursor->num_fences) {
495 cursor->index >= cursor->fences->num_fences)
529 list = dma_resv_list_alloc(cursor.num_fences);
534 list->num_fences = 0;
538 dma_resv_list_set(list, list->num_fences++, f,
554 * @num_fences: the number of fences returned
562 unsigned int *num_fences, struct dma_fence ***fences)
567 *num_fences = 0;
577 while (*num_fences)
578 dma_fence_put((*fences)[--(*num_fences)]);
580 count = cursor.num_fences + 1;
589 *num_fences = 0;
596 (*fences)[(*num_fences)++] = dma_fence_get(fence);