30 	u32 n_buckets;  member
74 	u64 cost, n_buckets;  in stack_map_alloc()  local
95 	n_buckets = roundup_pow_of_two(attr->max_entries);  in stack_map_alloc()
96 	if (!n_buckets)  in stack_map_alloc()
99 	cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap);  in stack_map_alloc()
105 	smap->n_buckets = n_buckets;  in stack_map_alloc()
229 	id = hash & (smap->n_buckets - 1);  in __bpf_get_stackid()
572 	if (unlikely(id >= smap->n_buckets))  in bpf_stackmap_copy()
602 		if (id >= smap->n_buckets || !smap->buckets[id])  in stack_map_get_next_key()
608 	while (id < smap->n_buckets && !smap->buckets[id])  in stack_map_get_next_key()
611 	if (id >= smap->n_buckets)  in stack_map_get_next_key()
631 	if (unlikely(id >= smap->n_buckets))  in stack_map_delete_elem()
658 	u64 n_buckets = smap->n_buckets;  in stack_map_mem_usage()  local
662 	usage += n_buckets * sizeof(struct stack_map_bucket *);  in stack_map_mem_usage()