Lines Matching refs:num_siblings
408 u16 num_siblings, idx; in set_proto_ctx_engines_balance() local
431 if (get_user(num_siblings, &ext->num_siblings)) in set_proto_ctx_engines_balance()
442 if (num_siblings == 0) in set_proto_ctx_engines_balance()
445 siblings = kmalloc_array(num_siblings, sizeof(*siblings), GFP_KERNEL); in set_proto_ctx_engines_balance()
449 for (n = 0; n < num_siblings; n++) { in set_proto_ctx_engines_balance()
469 if (num_siblings == 1) { in set_proto_ctx_engines_balance()
475 set->engines[idx].num_siblings = num_siblings; in set_proto_ctx_engines_balance()
590 u16 slot, width, num_siblings; in set_proto_ctx_engines_parallel_submit() local
600 if (get_user(num_siblings, &ext->num_siblings)) in set_proto_ctx_engines_parallel_submit()
604 num_siblings != 1) { in set_proto_ctx_engines_parallel_submit()
606 num_siblings); in set_proto_ctx_engines_parallel_submit()
641 if (num_siblings < 1) { in set_proto_ctx_engines_parallel_submit()
643 num_siblings); in set_proto_ctx_engines_parallel_submit()
647 siblings = kmalloc_array(num_siblings * width, in set_proto_ctx_engines_parallel_submit()
657 for (j = 0; j < num_siblings; ++j) { in set_proto_ctx_engines_parallel_submit()
660 n = i * num_siblings + j; in set_proto_ctx_engines_parallel_submit()
716 set->engines[slot].num_siblings = num_siblings; in set_proto_ctx_engines_parallel_submit()
1222 pe[n].num_siblings, 0); in user_engines()
1227 pe[n].num_siblings, in user_engines()