98 	u32 npossible = num_possible_cpus();  in scx_cid_alloc_tables()  local
105 	tbls->cid_to_cpu = kvcalloc(npossible, sizeof(*tbls->cid_to_cpu), GFP_KERNEL);  in scx_cid_alloc_tables()
107 	tbls->cid_to_shard = kvcalloc(npossible, sizeof(*tbls->cid_to_shard), GFP_KERNEL);  in scx_cid_alloc_tables()
108 	tbls->shard_node = kvcalloc(npossible, sizeof(*tbls->shard_node), GFP_KERNEL);  in scx_cid_alloc_tables()
109 	tbls->shard_ranges = kvcalloc(npossible, sizeof(*tbls->shard_ranges), GFP_KERNEL);  in scx_cid_alloc_tables()
110 	tbls->topo = kvcalloc(npossible, sizeof(*tbls->topo), GFP_KERNEL);  in scx_cid_alloc_tables()
475 	u32 npossible = num_possible_cpus();  in scx_bpf_cid_override()  local
497 	if (nr_shards && nr_shards <= npossible)  in scx_bpf_cid_override()
517 	if (!nr_shards || nr_shards > npossible) {  in scx_bpf_cid_override()
540 		if (shard_start[si] >= npossible) {  in scx_bpf_cid_override()
542 				  si, shard_start[si], npossible);  in scx_bpf_cid_override()
552 	if (npossible - shard_start[nr_shards - 1] > SCX_CID_SHARD_MAX_CPUS) {  in scx_bpf_cid_override()
554 			  nr_shards - 1, npossible - shard_start[nr_shards - 1],  in scx_bpf_cid_override()
583 		u32 end = (si + 1 < nr_shards) ? shard_start[si + 1] : npossible;  in scx_bpf_cid_override()
600 	for (cid = 0; cid < npossible; cid++) {  in scx_bpf_cid_override()
610 	memset(tbls->shard_ranges, 0, npossible * sizeof(*tbls->shard_ranges));  in scx_bpf_cid_override()
612 		u32 end = (si + 1 < nr_shards) ? shard_start[si + 1] : npossible;  in scx_bpf_cid_override()
979 	u32 base, nr_cids, alloc_words, npossible = num_possible_cpus();  in scx_cmask_ref_init()  local
986 	if (unlikely(base >= npossible || nr_cids > npossible - base ||  in scx_cmask_ref_init()