Home
last modified time | relevance | path

Searched refs:buckets (Results 1 – 25 of 55) sorted by relevance

123

/f-stack/dpdk/lib/librte_member/
H A Drte_member_ht.c22 struct member_ht_bucket *buckets, in update_entry_search() argument
38 struct member_ht_bucket *buckets, in search_bucket_single() argument
45 buckets[bucket_id].sets[iter] != in search_bucket_single()
56 struct member_ht_bucket *buckets, in search_bucket_multi() argument
100 if (buckets == NULL) { in rte_member_create_ht()
106 ss->table = buckets; in rte_member_create_ht()
186 buckets, set_id)) in rte_member_lookup_ht()
194 buckets, set_id)) in rte_member_lookup_ht()
234 buckets, &set_id[i]) || in rte_member_lookup_bulk_ht()
340 buckets[prim].sigs[i] = sig; in try_insert()
[all …]
H A Drte_member_x86.h18 struct member_ht_bucket *buckets, in update_entry_search_avx() argument
22 _mm256_load_si256((__m256i const *)buckets[bucket_id].sigs), in update_entry_search_avx()
26 buckets[bucket_id].sets[hit_idx] = set_id; in update_entry_search_avx()
34 struct member_ht_bucket *buckets, in search_bucket_single_avx() argument
38 _mm256_load_si256((__m256i const *)buckets[bucket_id].sigs), in search_bucket_single_avx()
42 if (buckets[bucket_id].sets[hit_idx] != RTE_MEMBER_NO_MATCH) { in search_bucket_single_avx()
43 *set_id = buckets[bucket_id].sets[hit_idx]; in search_bucket_single_avx()
53 struct member_ht_bucket *buckets, in search_bucket_multi_avx() argument
59 _mm256_load_si256((__m256i const *)buckets[bucket_id].sigs), in search_bucket_multi_avx()
63 if (buckets[bucket_id].sets[hit_idx] != RTE_MEMBER_NO_MATCH) { in search_bucket_multi_avx()
[all …]
/f-stack/freebsd/netpfil/ipfw/
H A Ddn_heap.c371 if (buckets < 1 || buckets > 65536) in dn_ht_init()
374 b_ori = buckets; in dn_ht_init()
376 buckets |= buckets >> 1; in dn_ht_init()
377 buckets |= buckets >> 2; in dn_ht_init()
378 buckets |= buckets >> 4; in dn_ht_init()
379 buckets |= buckets >> 8; in dn_ht_init()
380 buckets |= buckets >> 16; in dn_ht_init()
387 buckets = b_max; in dn_ht_init()
392 if (buckets <= ht->buckets) { in dn_ht_init()
393 ht->buckets = buckets; in dn_ht_init()
[all …]
H A Dip_dn_glue.c422 fs->buckets = f->rq_size; in dn_compat_config_queue()
465 sch->buckets = fs->buckets; /*XXX*/ in dn_compat_config_pipe()
466 fs->buckets = 0; in dn_compat_config_pipe()
645 fs->rq_size = s->sch.buckets ? s->sch.buckets : 1; in dn_c_copy_pipe()
709 fs->rq_size = (f->fs.buckets ? f->fs.buckets : 1); in dn_c_copy_fs()
H A Ddn_heap.h169 struct dn_ht *dn_ht_init(struct dn_ht *, int buckets, int ofs,
/f-stack/dpdk/drivers/mempool/bucket/
H A Drte_mempool_bucket.c48 struct bucket_stack *buckets[RTE_MAX_LCORE]; member
118 bucket_stack_push(bd->buckets[lcore_id], hdr); in bucket_enqueue_single()
191 objptr = bucket_stack_pop(bd->buckets[rte_lcore_id()]); in bucket_dequeue_orphans()
226 struct bucket_stack *cur_stack = bd->buckets[rte_lcore_id()]; in bucket_dequeue_buckets()
360 bplc->bd->buckets[lcore_id]->top; in bucket_count_per_lcore()
418 bd->buckets[lcore_id] = bucket_stack_create(mp, in bucket_init_per_lcore()
420 if (bd->buckets[lcore_id] == NULL) in bucket_init_per_lcore()
438 rte_free(bd->buckets[lcore_id]); in bucket_init_per_lcore()
439 bd->buckets[lcore_id] = NULL; in bucket_init_per_lcore()
450 rte_free(bd->buckets[lcore_id]); in bucket_uninit_per_lcore()
[all …]
/f-stack/app/nginx-1.16.1/src/core/
H A Dngx_hash.c22 elt = hash->buckets[key % hash->size]; in ngx_hash_find()
216 if (hash->hash.buckets) { in ngx_hash_find_combined()
228 if (hash->wc_head && hash->wc_head->hash.buckets) { in ngx_hash_find_combined()
236 if (hash->wc_tail && hash->wc_tail->hash.buckets) { in ngx_hash_find_combined()
258 ngx_hash_elt_t *elt, **buckets; in ngx_hash_init() local
367 buckets = (ngx_hash_elt_t **) in ngx_hash_init()
372 if (buckets == NULL) { in ngx_hash_init()
391 buckets[i] = (ngx_hash_elt_t *) elts; in ngx_hash_init()
416 if (buckets[i] == NULL) { in ngx_hash_init()
427 hinit->hash->buckets = buckets; in ngx_hash_init()
[all …]
H A Dngx_hash.h24 ngx_hash_elt_t **buckets; member
/f-stack/dpdk/lib/librte_hash/
H A Drte_cuckoo_hash.c147 void *buckets = NULL; in rte_hash_create() local
296 buckets = rte_zmalloc_socket(NULL, in rte_hash_create()
300 if (buckets == NULL) { in rte_hash_create()
420 h->buckets = buckets; in rte_hash_create()
480 rte_free(buckets); in rte_hash_create()
526 rte_free(h->buckets); in rte_hash_free()
962 alt_bkt = &(h->buckets[alt_idx]); in rte_hash_cuckoo_make_space_mw()
1327 bkt = &h->buckets[prim_bucket_idx]; in __rte_hash_lookup_with_hash_l()
1338 bkt = &h->buckets[sec_bucket_idx]; in __rte_hash_lookup_with_hash_l()
1378 bkt = &h->buckets[prim_bucket_idx]; in __rte_hash_lookup_with_hash_lf()
[all …]
H A Drte_cuckoo_hash.h212 struct rte_hash_bucket *buckets; member
/f-stack/freebsd/netinet/
H A Dtcp_fastopen.c407 V_tcp_fastopen_ccache.buckets = in tcp_fastopen_init()
410 V_tcp_fastopen_ccache.buckets = V_tcp_fastopen_ccache_buckets; in tcp_fastopen_init()
412 V_tcp_fastopen_ccache.mask = V_tcp_fastopen_ccache.buckets - 1; in tcp_fastopen_init()
415 V_tcp_fastopen_ccache.base = malloc(V_tcp_fastopen_ccache.buckets * in tcp_fastopen_init()
419 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) { in tcp_fastopen_init()
454 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) { in tcp_fastopen_destroy()
818 for (i = 0; i < V_tcp_fastopen_ccache.buckets; in sysctl_net_inet_tcp_fastopen_ccache_bucket_limit()
842 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) { in sysctl_net_inet_tcp_fastopen_client_enable()
852 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) { in sysctl_net_inet_tcp_fastopen_client_enable()
1173 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) { in sysctl_net_inet_tcp_fastopen_ccache_list()
[all …]
H A Dip_dummynet.h151 uint32_t buckets; /* buckets used for the queue hash table */ member
198 uint32_t buckets; /* number of buckets for the instances */ member
H A Dtcp_fastopen.h79 unsigned int buckets; member
/f-stack/dpdk/lib/librte_table/
H A Drte_table_hash_key16.c686 buckets_mask, buckets, keys, f) \ argument
707 buckets[pkt2_index] = bucket_next; \
720 bucket = buckets[pkt_index]; \
736 buckets[pkt_index] = bucket_next; \
866 buckets[pkt20_index] = bucket20_next; \
867 buckets[pkt21_index] = bucket21_next; \
1033 buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1087 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1112 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1125 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
[all …]
H A Drte_table_hash_key8.c656 entries, buckets_mask, buckets, keys, f) \ argument
677 buckets[pkt2_index] = bucket_next; \
690 bucket = buckets[pkt_index]; \
705 buckets[pkt_index] = bucket_next; \
838 buckets[pkt20_index] = bucket20_next; \
839 buckets[pkt21_index] = bucket21_next; \
1001 buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1055 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1080 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1093 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
[all …]
H A Drte_table_hash_key32.c715 entries, buckets_mask, buckets, keys, f) \ argument
736 buckets[pkt2_index] = bucket_next; \
749 bucket = buckets[pkt_index]; \
768 buckets[pkt_index] = bucket_next; \
903 buckets[pkt20_index] = bucket20_next; \
904 buckets[pkt21_index] = bucket21_next; \
1066 pkts_mask_out, entries, buckets_mask, buckets, in rte_table_hash_lookup_key32_ext()
1121 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
1146 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
1159 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
[all …]
H A Drte_table_hash_lru.c73 struct bucket *buckets; member
236 t->buckets = (struct bucket *) &t->memory[bucket_offset]; in rte_table_hash_lru_create()
254 struct bucket *bkt = &t->buckets[i]; in rte_table_hash_lru_create()
286 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_entry_add()
370 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_entry_delete()
428 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_lookup_unoptimized()
656 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
668 bkt10 = &buckets[bkt10_index]; \
674 bkt11 = &buckets[bkt11_index]; \
H A Drte_table_hash_ext.c94 struct bucket *buckets; member
261 t->buckets = (struct bucket *) &t->memory[bucket_offset]; in rte_table_hash_ext_create()
311 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_entry_add()
412 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_entry_delete()
492 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_lookup_unoptimized()
718 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
730 bkt10 = &buckets[bkt10_index]; \
736 bkt11 = &buckets[bkt11_index]; \
H A Drte_swx_table_em.c260 struct bucket_extension *buckets; member
441 t->buckets = (struct bucket_extension *)&memory[bucket_offset]; in __table_create()
493 bkt0 = &t->buckets[bkt_id]; in table_add()
553 bkt0 = &t->buckets[bkt_id]; in table_del()
604 bkt0 = &t->buckets[bkt_id]; in table_lookup_unoptimized()
703 bkt = &t->buckets[bkt_id]; in table_lookup()
/f-stack/app/redis-5.0.5/src/
H A Dgeo.h18 size_t buckets; member
H A Dgeo.c57 ga->buckets = 0; in geoArrayCreate()
65 if (ga->used == ga->buckets) { in geoArrayAppend()
66 ga->buckets = (ga->buckets == 0) ? 8 : ga->buckets*2; in geoArrayAppend()
67 ga->array = zrealloc(ga->array,sizeof(geoPoint)*ga->buckets); in geoArrayAppend()
/f-stack/dpdk/doc/guides/prog_guide/
H A Dhash_lib.rst117 (or use external RCU mechanisms) in order to free the empty buckets and deleted keys, to maintain t…
124 * First table is an array of buckets each of which consists of multiple entries,
131 For any input key, there are two possible buckets (primary and secondary/alternative location)
132 to store that key in the hash table, therefore only the entries within those two buckets need to be…
137 Once the buckets are identified, the scope of the key add,
157 Like lookup, the primary and secondary buckets are identified. If there is an empty entry in
176 Similar to lookup, the key is searched in its primary and secondary buckets. If the key is found, t…
187 with a linked list of extra buckets and the key is stored in this linked list.
190 If there is no match there either, the extendable buckets (linked list of extra buckets) are search…
194 and an empty location is created, the last entry from the extendable buckets associated with this b…
[all …]
/f-stack/app/redis-5.0.5/utils/hashtable/
H A DREADME6 Visually show buckets in the two hash tables between rehashings. Also stress
/f-stack/tools/ipfw/
H A Ddummynet.c511 prefix, qs, plr, fs->oid.id, fs->buckets, red); in print_flowset_parms()
516 fs->fs_nr, qs, plr, fs->oid.id, fs->buckets, in print_flowset_parms()
597 s->name, s->flags, s->buckets, s->oid.id); in list_pipes()
1288 uint32_t _foo = 0, *flags = &_foo , *buckets = &_foo; in ipfw_config_pipe() local
1348 buckets = &sch->buckets; in ipfw_config_pipe()
1367 buckets = &fs->buckets; in ipfw_config_pipe()
1384 buckets = &sch->buckets; in ipfw_config_pipe()
1440 *buckets = strtoul(av[0], NULL, 0); in ipfw_config_pipe()
/f-stack/dpdk/app/test/
H A Dtest_hash_perf.c68 static uint8_t buckets[NUM_BUCKETS]; variable
181 buckets[i] = 0; in get_input_keys()
227 if (buckets[bucket_idx] == BUCKET_SIZE) in get_input_keys()
241 buckets[bucket_idx]++; in get_input_keys()

123