Searched refs:n_buckets (Results 1 - 10 of 10) sorted by last modified time
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | arena_htab.c | 20 printf("htab %p buckets %p n_buckets %d\n", htab, htab->buckets, htab->n_buckets);
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | map_ptr_kern.c | 94 __u32 n_buckets; member in struct:bpf_htab 116 VERIFY(hash->n_buckets == MAX_ENTRIES);
|
/linux-master/tools/testing/selftests/bpf/ |
H A D | bpf_arena_htab.h | 15 int n_buckets; member in struct:htab 24 return &b[hash & (htab->n_buckets - 1)]; 99 htab->n_buckets = 2 * PAGE_SIZE / sizeof(struct htab_bucket);
|
/linux-master/kernel/bpf/ |
H A D | stackmap.c | 30 u32 n_buckets; member in struct:bpf_stack_map 31 struct stack_map_bucket *buckets[] __counted_by(n_buckets); 74 u64 cost, n_buckets; local 100 n_buckets = roundup_pow_of_two(attr->max_entries); 102 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); 108 smap->n_buckets = n_buckets; 232 id = hash & (smap->n_buckets - 1); 584 if (unlikely(id >= smap->n_buckets)) 614 if (id >= smap->n_buckets || !sma 670 u64 n_buckets = smap->n_buckets; local [all...] |
H A D | hashtab.c | 104 u32 n_buckets; /* number of hash buckets */ member in struct:bpf_htab 141 for (i = 0; i < htab->n_buckets; i++) { 156 hash = hash & min_t(u32, HASHTAB_MAP_LOCK_MASK, htab->n_buckets - 1); 177 hash = hash & min_t(u32, HASHTAB_MAP_LOCK_MASK, htab->n_buckets - 1); 509 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries); 519 if (htab->n_buckets > U32_MAX / sizeof(struct bucket)) 527 htab->buckets = bpf_map_area_alloc(htab->n_buckets * 626 return &htab->buckets[hash & (htab->n_buckets - 1)]; 654 u32 key_size, u32 n_buckets) 664 if (unlikely(get_nulls_value(n) != (hash & (n_buckets 652 lookup_nulls_elem_raw(struct hlist_nulls_head *head, u32 hash, void *key, u32 key_size, u32 n_buckets) argument [all...] |
H A D | devmap.c | 83 u32 n_buckets; member in struct:bpf_dtab 107 return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)]; 139 dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries); 141 dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets, 206 for (i = 0; i < dtab->n_buckets; i++) { 304 i = idx & (dtab->n_buckets - 1); 308 for (; i < dtab->n_buckets; i++) { 641 for (i = 0; i < dtab->n_buckets; i++) { 760 for (i = 0; i < dtab->n_buckets; i++) { 1035 usage += (u64)dtab->n_buckets * sizeo [all...] |
/linux-master/net/core/ |
H A D | bpf_sk_storage.c | 718 u32 i, count, n_buckets; local 722 n_buckets = 1U << smap->bucket_log; 723 if (bucket_id >= n_buckets)
|
/linux-master/net/openvswitch/ |
H A D | flow_table.c | 170 ti->n_buckets = new_size; 482 for (i = 0; i < ti->n_buckets; i++) { 534 while (*bucket < ti->n_buckets) { 555 return &ti->buckets[hash & (ti->n_buckets - 1)]; 586 for (i = 0; i < old->n_buckets; i++) { 604 int n_buckets, bool ufid) 608 new_ti = table_instance_alloc(n_buckets); 952 return table_instance_rehash(ti, ti->n_buckets * 2, ufid); 1046 if (table->count > ti->n_buckets) 1049 new_ti = table_instance_rehash(ti, ti->n_buckets, fals 603 table_instance_rehash(struct table_instance *ti, int n_buckets, bool ufid) argument [all...] |
H A D | flow_table.h | 56 unsigned int n_buckets; member in struct:table_instance
|
/linux-master/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
H A D | pno.c | 400 int err, n_buckets; local 403 n_buckets = brcmf_pno_prep_fwconfig(pi, &pno_cfg, &buckets, 405 if (n_buckets < 0) 406 return n_buckets; 408 gsz = struct_size(gscan_cfg, bucket, n_buckets); 436 gscan_cfg->count_of_channel_buckets = n_buckets; 438 array_size(n_buckets, sizeof(*buckets)));
|
Completed in 167 milliseconds