Home
last modified time | relevance | path

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

/linux/kernel/bpf/
A Dstackmap.c30 u32 n_buckets; member
93 u64 cost, n_buckets; in stack_map_alloc() local
117 n_buckets = roundup_pow_of_two(attr->max_entries); in stack_map_alloc()
118 if (!n_buckets) in stack_map_alloc()
129 smap->n_buckets = n_buckets; in stack_map_alloc()
286 id = hash & (smap->n_buckets - 1); in __bpf_get_stackid()
627 if (unlikely(id >= smap->n_buckets)) in bpf_stackmap_copy()
657 if (id >= smap->n_buckets || !smap->buckets[id]) in stack_map_get_next_key()
663 while (id < smap->n_buckets && !smap->buckets[id]) in stack_map_get_next_key()
666 if (id >= smap->n_buckets) in stack_map_get_next_key()
[all …]
A Ddevmap.c83 u32 n_buckets; member
107 return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)]; in dev_map_index_hash()
133 dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries); in dev_map_init_map()
135 if (!dtab->n_buckets) /* Overflow check */ in dev_map_init_map()
140 dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets, in dev_map_init_map()
208 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_free()
306 i = idx & (dtab->n_buckets - 1); in dev_map_hash_get_next_key()
310 for (; i < dtab->n_buckets; i++) { in dev_map_hash_get_next_key()
633 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_enqueue_multi()
752 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_redirect_multi()
[all …]
A Dhashtab.c144 for (i = 0; i < htab->n_buckets; i++) { in htab_init_buckets()
510 if (htab->n_buckets == 0 || in htab_map_alloc()
601 u32 key_size, u32 n_buckets) in lookup_nulls_elem_raw() argument
806 i = hash & (htab->n_buckets - 1); in htab_map_get_next_key()
811 for (; i < htab->n_buckets; i++) { in htab_map_get_next_key()
1049 htab->n_buckets); in htab_map_update_elem()
1400 for (i = 0; i < htab->n_buckets; i++) { in delete_all_elements()
1417 for (i = 0; i < htab->n_buckets; i++) { in htab_free_malloced_timers()
1628 if (batch >= htab->n_buckets) in __htab_map_lookup_and_delete_batch()
1778 if (batch >= htab->n_buckets) { in __htab_map_lookup_and_delete_batch()
[all …]
/linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
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 = sizeof(*gscan_cfg) + (n_buckets - 1) * sizeof(*buckets); in brcmf_pno_config_sched_scans()
436 gscan_cfg->count_of_channel_buckets = n_buckets; in brcmf_pno_config_sched_scans()
438 n_buckets * sizeof(*buckets)); in brcmf_pno_config_sched_scans()
/linux/net/openvswitch/
A Dflow_table.c169 ti->n_buckets = new_size; in table_instance_alloc()
484 for (i = 0; i < ti->n_buckets; i++) { in table_instance_flow_flush()
536 while (*bucket < ti->n_buckets) { in ovs_flow_tbl_dump_next()
557 return &ti->buckets[hash & (ti->n_buckets - 1)]; in find_bucket()
588 for (i = 0; i < old->n_buckets; i++) { in flow_table_copy_flows()
606 int n_buckets, bool ufid) in table_instance_rehash() argument
610 new_ti = table_instance_alloc(n_buckets); in table_instance_rehash()
954 return table_instance_rehash(ti, ti->n_buckets * 2, ufid); in table_instance_expand()
1048 if (table->count > ti->n_buckets) in flow_key_insert()
1051 new_ti = table_instance_rehash(ti, ti->n_buckets, false); in flow_key_insert()
[all …]
A Dflow_table.h56 unsigned int n_buckets; member
/linux/net/core/
A Dbpf_sk_storage.c738 u32 i, count, n_buckets; in bpf_sk_storage_map_seq_find_next() local
742 n_buckets = 1U << smap->bucket_log; in bpf_sk_storage_map_seq_find_next()
743 if (bucket_id >= n_buckets) in bpf_sk_storage_map_seq_find_next()
/linux/tools/testing/selftests/bpf/progs/
A Dmap_ptr_kern.c94 __u32 n_buckets; member
114 VERIFY(hash->n_buckets == MAX_ENTRIES); in check_hash()

Completed in 86 milliseconds