32 	u32 n_buckets;  member
92 	u64 cost, n_buckets;  in stack_map_alloc()  local
116 	n_buckets = roundup_pow_of_two(attr->max_entries);  in stack_map_alloc()
118 	cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap);  in stack_map_alloc()
127 	cost += n_buckets * (value_size + sizeof(struct stack_map_bucket));  in stack_map_alloc()
133 	smap->n_buckets = n_buckets;  in stack_map_alloc()
378 	id = hash & (smap->n_buckets - 1);  in BPF_CALL_3()
518 	if (unlikely(id >= smap->n_buckets))  in bpf_stackmap_copy()
548 		if (id >= smap->n_buckets || !smap->buckets[id])  in stack_map_get_next_key()
554 	while (id < smap->n_buckets && !smap->buckets[id])  in stack_map_get_next_key()
557 	if (id >= smap->n_buckets)  in stack_map_get_next_key()
577 	if (unlikely(id >= smap->n_buckets))  in stack_map_delete_elem()