n_buckets         396 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	int err, n_buckets;
n_buckets         399 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	n_buckets = brcmf_pno_prep_fwconfig(pi, &pno_cfg, &buckets,
n_buckets         401 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	if (n_buckets < 0)
n_buckets         402 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 		return n_buckets;
n_buckets         404 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	gsz = sizeof(*gscan_cfg) + (n_buckets - 1) * sizeof(*buckets);
n_buckets         432 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	gscan_cfg->count_of_channel_buckets = n_buckets;
n_buckets         434 drivers/net/wireless/broadcom/brcm80211/brcmfmac/pno.c 	       n_buckets * sizeof(*buckets));
n_buckets          85 kernel/bpf/devmap.c 	u32 n_buckets;
n_buckets         107 kernel/bpf/devmap.c 	return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)];
n_buckets         132 kernel/bpf/devmap.c 		dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries);
n_buckets         134 kernel/bpf/devmap.c 		if (!dtab->n_buckets) /* Overflow check */
n_buckets         136 kernel/bpf/devmap.c 		cost += (u64) sizeof(struct hlist_head) * dtab->n_buckets;
n_buckets         154 kernel/bpf/devmap.c 		dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets);
n_buckets         237 kernel/bpf/devmap.c 		for (i = 0; i < dtab->n_buckets; i++) {
n_buckets         330 kernel/bpf/devmap.c 	i = idx & (dtab->n_buckets - 1);
n_buckets         334 kernel/bpf/devmap.c 	for (; i < dtab->n_buckets; i++) {
n_buckets         748 kernel/bpf/devmap.c 	for (i = 0; i < dtab->n_buckets; i++) {
n_buckets          35 kernel/bpf/hashtab.c 	u32 n_buckets;	/* number of hash buckets */
n_buckets         331 kernel/bpf/hashtab.c 	htab->n_buckets = roundup_pow_of_two(htab->map.max_entries);
n_buckets         342 kernel/bpf/hashtab.c 	if (htab->n_buckets == 0 ||
n_buckets         343 kernel/bpf/hashtab.c 	    htab->n_buckets > U32_MAX / sizeof(struct bucket))
n_buckets         346 kernel/bpf/hashtab.c 	cost = (u64) htab->n_buckets * sizeof(struct bucket) +
n_buckets         361 kernel/bpf/hashtab.c 	htab->buckets = bpf_map_area_alloc(htab->n_buckets *
n_buckets         372 kernel/bpf/hashtab.c 	for (i = 0; i < htab->n_buckets; i++) {
n_buckets         412 kernel/bpf/hashtab.c 	return &htab->buckets[hash & (htab->n_buckets - 1)];
n_buckets         440 kernel/bpf/hashtab.c 					       u32 key_size, u32 n_buckets)
n_buckets         450 kernel/bpf/hashtab.c 	if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1))))
n_buckets         477 kernel/bpf/hashtab.c 	l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
n_buckets         617 kernel/bpf/hashtab.c 	l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
n_buckets         633 kernel/bpf/hashtab.c 	i = hash & (htab->n_buckets - 1);
n_buckets         638 kernel/bpf/hashtab.c 	for (; i < htab->n_buckets; i++) {
n_buckets         848 kernel/bpf/hashtab.c 					      htab->n_buckets);
n_buckets        1176 kernel/bpf/hashtab.c 	for (i = 0; i < htab->n_buckets; i++) {
n_buckets        1399 kernel/bpf/hashtab.c 	for (i = 0; i < htab->n_buckets; i++) {
n_buckets          29 kernel/bpf/stackmap.c 	u32 n_buckets;
n_buckets          90 kernel/bpf/stackmap.c 	u64 cost, n_buckets;
n_buckets         114 kernel/bpf/stackmap.c 	n_buckets = roundup_pow_of_two(attr->max_entries);
n_buckets         116 kernel/bpf/stackmap.c 	cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap);
n_buckets         117 kernel/bpf/stackmap.c 	cost += n_buckets * (value_size + sizeof(struct stack_map_bucket));
n_buckets         130 kernel/bpf/stackmap.c 	smap->n_buckets = n_buckets;
n_buckets         386 kernel/bpf/stackmap.c 	id = hash & (smap->n_buckets - 1);
n_buckets         526 kernel/bpf/stackmap.c 	if (unlikely(id >= smap->n_buckets))
n_buckets         556 kernel/bpf/stackmap.c 		if (id >= smap->n_buckets || !smap->buckets[id])
n_buckets         562 kernel/bpf/stackmap.c 	while (id < smap->n_buckets && !smap->buckets[id])
n_buckets         565 kernel/bpf/stackmap.c 	if (id >= smap->n_buckets)
n_buckets         585 kernel/bpf/stackmap.c 	if (unlikely(id >= smap->n_buckets))
n_buckets         159 net/openvswitch/flow_table.c 	ti->n_buckets = new_size;
n_buckets         213 net/openvswitch/flow_table.c 	for (i = 0; i < ti->n_buckets; i++) {
n_buckets         258 net/openvswitch/flow_table.c 	while (*bucket < ti->n_buckets) {
n_buckets         279 net/openvswitch/flow_table.c 	return &ti->buckets[hash & (ti->n_buckets - 1)];
n_buckets         310 net/openvswitch/flow_table.c 	for (i = 0; i < old->n_buckets; i++) {
n_buckets         328 net/openvswitch/flow_table.c 						    int n_buckets, bool ufid)
n_buckets         332 net/openvswitch/flow_table.c 	new_ti = table_instance_alloc(n_buckets);
n_buckets         543 net/openvswitch/flow_table.c 	return table_instance_rehash(ti, ti->n_buckets * 2, ufid);
n_buckets         656 net/openvswitch/flow_table.c 	if (table->count > ti->n_buckets)
n_buckets         659 net/openvswitch/flow_table.c 		new_ti = table_instance_rehash(ti, ti->n_buckets, false);
n_buckets         679 net/openvswitch/flow_table.c 	if (table->ufid_count > ti->n_buckets) {
n_buckets          27 net/openvswitch/flow_table.h 	unsigned int n_buckets;