Lines Matching defs:shared_count
89 for (i = 0; i < list->shared_count; ++i)
197 if ((old->shared_count + num_fences) <= old->shared_max)
200 max = max(old->shared_count + num_fences,
216 for (i = 0, j = 0, k = max; i < (old ? old->shared_count : 0); ++i) {
226 new->shared_count = j;
274 count = fobj->shared_count;
287 BUG_ON(fobj->shared_count >= fobj->shared_max);
293 /* pointer update must be visible before we extend the shared_count */
294 smp_store_mb(fobj->shared_count, count);
318 i = old->shared_count;
327 old->shared_count = 0;
359 unsigned shared_count = src_list->shared_count;
363 dst_list = dma_resv_list_alloc(shared_count);
369 if (!src_list || src_list->shared_count > shared_count) {
374 dst_list->shared_count = 0;
375 for (i = 0; i < src_list->shared_count; ++i) {
394 rcu_assign_pointer(dst_list->shared[dst_list->shared_count++], fence);
439 unsigned int shared_count;
447 shared_count = i = 0;
484 shared_count = fobj ? fobj->shared_count : 0;
485 for (i = 0; i < shared_count; ++i) {
492 if (i != shared_count || read_seqcount_retry(&obj->seq, seq)) {
507 shared[shared_count++] = fence_excl;
509 if (!shared_count) {
514 *pshared_count = shared_count;
537 unsigned seq, shared_count;
542 shared_count = 0;
565 shared_count = fobj->shared_count;
567 for (i = 0; !fence && i < shared_count; ++i) {
596 if (ret > 0 && wait_all && (i + 1 < shared_count))
636 unsigned seq, shared_count;
642 shared_count = 0;
651 shared_count = fobj->shared_count;
653 for (i = 0; i < shared_count; ++i) {
667 if (!shared_count) {