Lines Matching refs:n_buckets
43 u32 n_buckets; /* number of hash buckets */ member
334 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries); in htab_map_alloc()
345 if (htab->n_buckets == 0 || in htab_map_alloc()
346 htab->n_buckets > U32_MAX / sizeof(struct bucket)) in htab_map_alloc()
349 cost = (u64) htab->n_buckets * sizeof(struct bucket) + in htab_map_alloc()
370 htab->buckets = bpf_map_area_alloc(htab->n_buckets * in htab_map_alloc()
377 for (i = 0; i < htab->n_buckets; i++) { in htab_map_alloc()
415 return &htab->buckets[hash & (htab->n_buckets - 1)]; in __select_bucket()
443 u32 key_size, u32 n_buckets) in lookup_nulls_elem_raw() argument
453 if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1)))) in lookup_nulls_elem_raw()
480 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets); in __htab_map_lookup_elem()
608 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets); in htab_map_get_next_key()
624 i = hash & (htab->n_buckets - 1); in htab_map_get_next_key()
629 for (; i < htab->n_buckets; i++) { in htab_map_get_next_key()
1132 for (i = 0; i < htab->n_buckets; i++) { in delete_all_elements()
1323 for (i = 0; i < htab->n_buckets; i++) { in fd_htab_map_free()