kernel/bpf/hashtab.c

105 	u32 n_buckets;	/* number of hash buckets */
140 	for (i = 0; i < htab->n_buckets; i++) {
506 	htab->n_buckets = roundup_pow_of_two(htab->map.max_entries);
516 	if (htab->n_buckets > U32_MAX / sizeof(struct bucket))
524 	htab->buckets = bpf_map_area_alloc(htab->n_buckets *
608 	return &htab->buckets[hash & (htab->n_buckets - 1)];
636 					       u32 key_size, u32 n_buckets)
646 	if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1))))
673 	l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
838 	l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
854 	i = hash & (htab->n_buckets - 1);
859 	for (; i < htab->n_buckets; i++) {
1108 					      htab->n_buckets);
1480 	for (i = 0; i < htab->n_buckets; i++) {
1498 	for (i = 0; i < htab->n_buckets; i++) {
1720 	if (batch >= htab->n_buckets)
1868 	if (!bucket_cnt && (batch + 1 < htab->n_buckets)) {
1885 	if (batch >= htab->n_buckets) {
1997 	if (bucket_id >= htab->n_buckets)
2016 	for (i = bucket_id; i < htab->n_buckets; i++) {
2185 	for (i = 0; i < htab->n_buckets; i++) {
2223 	usage += sizeof(struct bucket) * htab->n_buckets;
2503 	for (i = 0; i < htab->n_buckets; i++) {