Home
last modified time | relevance | path

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

/OK3568_Linux_fs/kernel/kernel/bpf/
H A Dstackmap.c31 u32 n_buckets; member
95 u64 cost, n_buckets; in stack_map_alloc() local
119 n_buckets = roundup_pow_of_two(attr->max_entries); in stack_map_alloc()
120 if (!n_buckets) in stack_map_alloc()
123 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
137 smap->n_buckets = n_buckets; in stack_map_alloc()
416 id = hash & (smap->n_buckets - 1); in __bpf_get_stackid()
761 if (unlikely(id >= smap->n_buckets)) in bpf_stackmap_copy()
791 if (id >= smap->n_buckets || !smap->buckets[id]) in stack_map_get_next_key()
797 while (id < smap->n_buckets && !smap->buckets[id]) in stack_map_get_next_key()
[all …]
H A Ddevmap.c82 u32 n_buckets; member
106 return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)]; in dev_map_index_hash()
134 dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries); in dev_map_init_map()
136 if (!dtab->n_buckets) /* Overflow check */ in dev_map_init_map()
138 cost += (u64) sizeof(struct hlist_head) * dtab->n_buckets; in dev_map_init_map()
149 dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets, in dev_map_init_map()
221 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_free()
315 i = idx & (dtab->n_buckets - 1); in dev_map_hash_get_next_key()
319 for (; i < dtab->n_buckets; i++) { in dev_map_hash_get_next_key()
786 for (i = 0; i < dtab->n_buckets; i++) { in dev_map_hash_remove_netdev()
H A Dhashtab.c99 u32 n_buckets; /* number of hash buckets */ member
139 for (i = 0; i < htab->n_buckets; i++) { in htab_init_buckets()
447 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries); in htab_map_alloc()
458 if (htab->n_buckets == 0 || in htab_map_alloc()
459 htab->n_buckets > U32_MAX / sizeof(struct bucket)) in htab_map_alloc()
462 cost = (u64) htab->n_buckets * sizeof(struct bucket) + in htab_map_alloc()
477 htab->buckets = bpf_map_area_alloc(htab->n_buckets * in htab_map_alloc()
525 return &htab->buckets[hash & (htab->n_buckets - 1)]; in __select_bucket()
553 u32 key_size, u32 n_buckets) in lookup_nulls_elem_raw() argument
563 if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1)))) in lookup_nulls_elem_raw()
[all …]
/OK3568_Linux_fs/kernel/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 = 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()
/OK3568_Linux_fs/kernel/net/openvswitch/
H 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 …]
H A Dflow_table.h56 unsigned int n_buckets; member
/OK3568_Linux_fs/kernel/net/core/
H A Dbpf_sk_storage.c665 u32 i, count, n_buckets; in bpf_sk_storage_map_seq_find_next() local
669 n_buckets = 1U << smap->bucket_log; in bpf_sk_storage_map_seq_find_next()
670 if (bucket_id >= n_buckets) in bpf_sk_storage_map_seq_find_next()
/OK3568_Linux_fs/kernel/tools/testing/selftests/bpf/progs/
H A Dmap_ptr_kern.c100 __u32 n_buckets; member
120 VERIFY(hash->n_buckets == MAX_ENTRIES); in check_hash()
/OK3568_Linux_fs/recovery/
HDrootfs.cpio.gz107070100A8AEB0000041ED0000000000000000000000116841B48100000000000000FD0000000200000000000000000000000200000000.�07070100A8B07C000081A40000000000000000000000016841263500000000000000FD0000000200000000000000000000000900000000.gitkeep��07070100A8B07D000081A40000000000000000000000016841263500000000000000FD0000000200000000000000000000000B00000000.skip_fsck����07070100A8AEB10000A1FF0000000000000000000000016841B0B600000007000000FD0000000200000000000000000000000400000000bin���usr/bin�07070100A8B07E000081A400000000000000000000000168412635000001CC000000FD0000000200000000000000000000001100000000busybox. ...