Searched refs:buckets (Results 1 - 13 of 13) sorted by relevance

/net/ceph/crush/
H A Dcrush.c104 /* buckets */
105 if (map->buckets) {
108 if (map->buckets[b] == NULL)
110 crush_destroy_bucket(map->buckets[b]);
112 kfree(map->buckets);
H A Dmapper.c340 /* choose through intervening buckets */
368 itemtype = map->buckets[-1-item]->type;
381 in = map->buckets[-1-item];
403 map->buckets[-1-item],
515 /* choose through intervening buckets */
554 itemtype = map->buckets[-1-item]->type;
571 in = map->buckets[-1-item];
589 map->buckets[-1-item],
759 map->buckets[-1-w[i]],
775 map->buckets[
[all...]
/net/netfilter/ipvs/
H A Dip_vs_dh.c68 struct ip_vs_dh_bucket buckets[IP_VS_DH_TAB_SIZE]; member in struct:ip_vs_dh_state
94 return rcu_dereference(s->buckets[ip_vs_dh_hashkey(af, addr)].dest);
99 * Assign all the hash buckets of the specified table with the service.
110 b = &s->buckets[0];
136 * Flush all the hash buckets of the specified table.
144 b = &s->buckets[0];
170 /* assign the hash buckets with current dests */
181 /* got to clean up hash buckets here */
196 /* assign the hash buckets with the updated service */
H A Dip_vs_sh.c75 struct ip_vs_sh_bucket buckets[IP_VS_SH_TAB_SIZE]; member in struct:ip_vs_sh_state
112 struct ip_vs_dest *dest = rcu_dereference(s->buckets[hash].dest);
134 dest = rcu_dereference(s->buckets[ihash].dest);
149 dest = rcu_dereference(s->buckets[hash].dest);
164 * Assign all the hash buckets of the specified table with the service.
176 b = &s->buckets[0];
212 * Flush all the hash buckets of the specified table.
220 b = &s->buckets[0];
246 /* assign the hash buckets with current dests */
257 /* got to clean up hash buckets her
[all...]
/net/openvswitch/
H A Dflow_table.c117 struct flex_array *buckets; local
120 buckets = flex_array_alloc(sizeof(struct hlist_head),
122 if (!buckets)
125 err = flex_array_prealloc(buckets, 0, n_buckets, GFP_KERNEL);
127 flex_array_free(buckets);
133 flex_array_get(buckets, i));
135 return buckets;
168 static void free_buckets(struct flex_array *buckets) argument
170 flex_array_free(buckets);
176 free_buckets(ti->buckets);
[all...]
H A Dflow_table.h40 struct flex_array *buckets; member in struct:table_instance
/net/netfilter/
H A Dnft_hash.c106 pprev = &tbl->buckets[h];
107 rht_for_each_entry_rcu(he, tbl->buckets[h], node) {
133 rht_for_each_entry_rcu(he, tbl->buckets[i], node) {
188 for (he = rht_entry(tbl->buckets[i], struct nft_hash_elem, node);
214 * is used for the size estimation of the hash buckets,
215 * meaning we calculate two buckets per element.
/net/sched/
H A Dsch_hhf.c19 * Flows are classified into two buckets: non-heavy-hitter and heavy-hitter
20 * buckets. Initially, a new flow starts as non-heavy-hitter. Once classified
22 * The buckets are dequeued by a Weighted Deficit Round Robin (WDRR) scheduler,
103 #define WDRR_BUCKET_CNT 2 /* two buckets for Weighted DRR */
128 struct wdrr_bucket buckets[WDRR_BUCKET_CNT]; member in struct:hhf_sched_data
147 struct list_head new_buckets; /* list of new buckets */
148 struct list_head old_buckets; /* list of old buckets */
260 /* Assigns packets to WDRR buckets. Implements a multi-stage filter to
371 bucket = &q->buckets[WDRR_BUCKET_FOR_HH];
373 bucket = &q->buckets[WDRR_BUCKET_FOR_NON_H
[all...]
/net/netlink/
H A Ddiag.c116 rht_for_each_entry(nlsk, htbl->buckets[i], ht, node) {
H A Daf_netlink.c2917 rht_for_each_entry_rcu(nlk, tbl->buckets[j], node) {
2971 rht_for_each_entry(nlk, tbl->buckets[j], ht, node) {
/net/ceph/
H A Dosdmap.c173 c->buckets = kcalloc(c->max_buckets, sizeof(*c->buckets), GFP_NOFS);
174 if (c->buckets == NULL)
180 /* buckets */
188 c->buckets[i] = NULL;
212 b = c->buckets[i] = kzalloc(size, GFP_NOFS);
/net/core/
H A Dneighbour.c65 Neighbour hash table buckets are protected with rwlock tbl->lock.
67 - All the scans/updates to hash buckets MUST be made under this lock.
323 struct neighbour __rcu **buckets; local
330 buckets = kzalloc(size, GFP_ATOMIC);
332 buckets = (struct neighbour __rcu **)
335 if (!buckets) {
339 ret->hash_buckets = buckets;
352 struct neighbour __rcu **buckets = nht->hash_buckets; local
355 kfree(buckets);
357 free_pages((unsigned long)buckets, get_orde
[all...]
H A Ddev.c359 * MUST BE last in hash buckets and checking protocol handlers
3275 if (likely(fl->buckets[old_flow]))
3276 fl->buckets[old_flow]--;
3278 if (++fl->buckets[new_flow] > (FLOW_LIMIT_HISTORY >> 1)) {

Completed in 255 milliseconds