Home
last modified time | relevance | path

Searched refs:n_buckets (Results 1 – 9 of 9) sorted by relevance

/linux/tools/testing/selftests/bpf/
H A Dbpf_arena_htab.h15 int n_buckets; member
23 return &b[hash & (htab->n_buckets - 1)]; in __select_bucket()
98 htab->n_buckets = 2 * PAGE_SIZE / sizeof(struct htab_bucket); in htab_init()
/linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dpno.c400 int err, n_buckets; in brcmf_pno_config_sched_scans() local
403 n_buckets = brcmf_pno_prep_fwconfig(pi, &pno_cfg, &buckets, in brcmf_pno_config_sched_scans()
405 if (n_buckets < 0) in brcmf_pno_config_sched_scans()
406 return n_buckets; in brcmf_pno_config_sched_scans()
408 gsz = struct_size(gscan_cfg, bucket, n_buckets); in brcmf_pno_config_sched_scans()
436 gscan_cfg->count_of_channel_buckets = n_buckets; in brcmf_pno_config_sched_scans()
438 array_size(n_buckets, sizeof(*buckets))); in brcmf_pno_config_sched_scans()
/linux/kernel/bpf/
H A Ddevmap.c85 u32 n_buckets; member
108 return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)]; in dev_map_index_hash()
146 dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries); in dev_map_init_map()
147 dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets, in dev_map_init_map()
219 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_free()
317 i = idx & (dtab->n_buckets - 1); in dev_map_hash_get_next_key()
321 for (; i < dtab->n_buckets; i++) { in dev_map_hash_get_next_key()
669 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_enqueue_multi()
806 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_redirect_multi()
1078 usage += (u64)dtab->n_buckets * sizeo
[all...]
H A Dhashtab.c103 u32 n_buckets; /* number of hash buckets */
143 for (i = 0; i < htab->n_buckets; i++) { in htab_init_buckets()
584 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries); in htab_map_alloc()
594 if (htab->n_buckets > U32_MAX / sizeof(struct bucket)) in htab_map_alloc()
602 htab->buckets = bpf_map_area_alloc(htab->n_buckets * in htab_map_alloc()
686 return &htab->buckets[hash & (htab->n_buckets - 1)]; in select_bucket()
714 u32 key_size, u32 n_buckets) in lookup_nulls_elem_raw()
724 if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1)))) in lookup_nulls_elem_raw()
750 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets); in __htab_map_lookup_elem()
915 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets); in htab_map_get_next_key()
102 u32 n_buckets; /* number of hash buckets */ global() member
711 lookup_nulls_elem_raw(struct hlist_nulls_head * head,u32 hash,void * key,u32 key_size,u32 n_buckets) lookup_nulls_elem_raw() argument
[all...]
/linux/net/openvswitch/
H A Dflow_table.c168 ti->n_buckets = new_size; in table_instance_alloc()
480 for (i = 0; i < ti->n_buckets; i++) { in table_instance_flow_flush()
532 while (*bucket < ti->n_buckets) { in ovs_flow_tbl_dump_next()
553 return &ti->buckets[hash & (ti->n_buckets - 1)]; in find_bucket()
584 for (i = 0; i < old->n_buckets; i++) { in flow_table_copy_flows()
602 int n_buckets, bool ufid) in table_instance_rehash() argument
606 new_ti = table_instance_alloc(n_buckets); in table_instance_rehash()
950 return table_instance_rehash(ti, ti->n_buckets * 2, ufid); in table_instance_expand()
1044 if (table->count > ti->n_buckets) in flow_key_insert()
1047 new_ti = table_instance_rehash(ti, ti->n_buckets, fals in flow_key_insert()
[all...]
H A Dflow_table.h56 unsigned int n_buckets; member
/linux/tools/testing/selftests/bpf/prog_tests/
H A Darena_htab.c20 printf("htab %p buckets %p n_buckets %d\n", htab, htab->buckets, htab->n_buckets); in test_arena_htab_common()
/linux/net/core/
H A Dbpf_sk_storage.c709 u32 i, count, n_buckets; in bpf_sk_storage_map_seq_find_next() local
713 n_buckets = 1U << smap->bucket_log; in bpf_sk_storage_map_seq_find_next()
714 if (bucket_id >= n_buckets) in bpf_sk_storage_map_seq_find_next()
/linux/tools/testing/selftests/bpf/progs/
H A Dmap_ptr_kern.c94 __u32 n_buckets; member
116 VERIFY(hash->n_buckets == MAX_ENTRIES); in check_hash()