30 	u32 n_buckets;  member
74 	u64 cost, n_buckets;  in stack_map_alloc()  local
98 	n_buckets = roundup_pow_of_two(attr->max_entries);  in stack_map_alloc()
99 	if (!n_buckets)  in stack_map_alloc()
102 	cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap);  in stack_map_alloc()
108 	smap->n_buckets = n_buckets;  in stack_map_alloc()
232 	id = hash & (smap->n_buckets - 1);  in __bpf_get_stackid()
575 	if (unlikely(id >= smap->n_buckets))  in bpf_stackmap_copy()
605 		if (id >= smap->n_buckets || !smap->buckets[id])  in stack_map_get_next_key()
611 	while (id < smap->n_buckets && !smap->buckets[id])  in stack_map_get_next_key()
614 	if (id >= smap->n_buckets)  in stack_map_get_next_key()
634 	if (unlikely(id >= smap->n_buckets))  in stack_map_delete_elem()