Home
last modified time | relevance | path

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

12

/dpdk/lib/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 …]
/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 …]
/dpdk/lib/hash/
H A Drte_cuckoo_hash.c143 void *buckets = NULL; in rte_hash_create() local
292 buckets = rte_zmalloc_socket(NULL, in rte_hash_create()
296 if (buckets == NULL) { in rte_hash_create()
416 h->buckets = buckets; in rte_hash_create()
476 rte_free(buckets); in rte_hash_create()
522 rte_free(h->buckets); in rte_hash_free()
958 alt_bkt = &(h->buckets[alt_idx]); in rte_hash_cuckoo_make_space_mw()
1323 bkt = &h->buckets[prim_bucket_idx]; in __rte_hash_lookup_with_hash_l()
1334 bkt = &h->buckets[sec_bucket_idx]; in __rte_hash_lookup_with_hash_l()
1374 bkt = &h->buckets[prim_bucket_idx]; in __rte_hash_lookup_with_hash_lf()
[all …]
H A Drte_cuckoo_hash.h218 struct rte_hash_bucket *buckets; member
/dpdk/lib/table/
H A Drte_table_hash_key8.c654 entries, buckets_mask, buckets, keys, f) \ argument
675 buckets[pkt2_index] = bucket_next; \
688 bucket = buckets[pkt_index]; \
703 buckets[pkt_index] = bucket_next; \
836 buckets[pkt20_index] = bucket20_next; \
837 buckets[pkt21_index] = bucket21_next; \
999 buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1053 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1078 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1091 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
[all …]
H A Drte_table_hash_key16.c684 buckets_mask, buckets, keys, f) \ argument
705 buckets[pkt2_index] = bucket_next; \
718 bucket = buckets[pkt_index]; \
734 buckets[pkt_index] = bucket_next; \
864 buckets[pkt20_index] = bucket20_next; \
865 buckets[pkt21_index] = bucket21_next; \
1031 buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1085 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1110 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1123 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
[all …]
H A Drte_table_hash_key32.c713 entries, buckets_mask, buckets, keys, f) \ argument
734 buckets[pkt2_index] = bucket_next; \
747 bucket = buckets[pkt_index]; \
766 buckets[pkt_index] = bucket_next; \
901 buckets[pkt20_index] = bucket20_next; \
902 buckets[pkt21_index] = bucket21_next; \
1064 pkts_mask_out, entries, buckets_mask, buckets, in rte_table_hash_lookup_key32_ext()
1119 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
1144 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
1157 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
[all …]
H A Drte_table_hash_lru.c71 struct bucket *buckets; member
234 t->buckets = (struct bucket *) &t->memory[bucket_offset]; in rte_table_hash_lru_create()
252 struct bucket *bkt = &t->buckets[i]; in rte_table_hash_lru_create()
284 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_entry_add()
368 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_entry_delete()
426 bkt = &t->buckets[bkt_index]; in rte_table_hash_lru_lookup_unoptimized()
654 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
666 bkt10 = &buckets[bkt10_index]; \
672 bkt11 = &buckets[bkt11_index]; \
H A Drte_table_hash_ext.c92 struct bucket *buckets; member
259 t->buckets = (struct bucket *) &t->memory[bucket_offset]; in rte_table_hash_ext_create()
309 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_entry_add()
410 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_entry_delete()
490 bkt0 = &t->buckets[bkt_index]; in rte_table_hash_ext_lookup_unoptimized()
716 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
728 bkt10 = &buckets[bkt10_index]; \
734 bkt11 = &buckets[bkt11_index]; \
H A Drte_swx_table_em.c259 struct bucket_extension *buckets; member
440 t->buckets = (struct bucket_extension *)&memory[bucket_offset]; in __table_create()
490 bkt0 = &t->buckets[bkt_id]; in table_add()
550 bkt0 = &t->buckets[bkt_id]; in table_del()
601 bkt0 = &t->buckets[bkt_id]; in table_lookup_unoptimized()
700 bkt = &t->buckets[bkt_id]; in table_lookup()
H A Drte_swx_table_learner.c302 uint8_t buckets[0]; member
360 return (struct table_bucket *)&t->buckets[bucket_id << t->params.bucket_size_log2]; in table_bucket_get()
/dpdk/drivers/common/mlx5/
H A Dmlx5_common_utils.c438 gc = (struct mlx5_list_cache *)&h->buckets[act_size]; in mlx5_hlist_create()
440 if (mlx5_list_init(&h->buckets[i].l, &h->l_const, in mlx5_hlist_create()
461 return _mlx5_list_lookup(&h->buckets[idx].l, &h->l_const, ctx); in mlx5_hlist_lookup()
479 entry = _mlx5_list_register(&h->buckets[idx].l, &h->l_const, ctx, in mlx5_hlist_register()
503 ret = _mlx5_list_unregister(&h->buckets[idx].l, &h->l_const, entry, in mlx5_hlist_unregister()
516 mlx5_list_uninit(&h->buckets[i].l, &h->l_const); in mlx5_hlist_destroy()
H A Dmlx5_common_utils.h259 struct mlx5_hlist_bucket buckets[] __rte_cache_aligned; member
/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 …]
H A Dpacket_framework.rst291 …keys, when dividing the space of signature values into a fixed number of equal intervals (buckets),
302 …storing the (key, value) pairs in a single list, the hash table maintains multiple lists (buckets).
310 provided that the table keys are evenly distributed among the hash table buckets,
312 …ucket can simply be to use the key signature (modulo the number of table buckets) as the table buc…
316 By selecting the number of buckets to be a power of two, the modulo operator can be replaced by a b…
322 …number of keys in the same bucket (collisions), the number of hash table buckets needs to be incre…
387 …| 3 | Number of buckets | Needs to be a power of two. …
H A Dqos_framework.rst1729 The srTCM algorithm defines two token buckets for each traffic flow,
1730 with the two buckets sharing the same token update rate:
1739 The trTCM algorithm defines two token buckets for each traffic flow,
1740 with the two buckets being updated with tokens at independent rates:
1751 from the buckets and how the packet color is determined.
1768 * Update the C and E / P token buckets. This is done by reading the current time (from the CPU ti…
1774 …and the amount of tokens currently available in the C and E / P buckets; for color aware mode only,
1777 …subtracted from the C or E /P or both buckets, depending on the algorithm and the output color of …
H A Dtraffic_management.rst96 committed and the peak token buckets. The rate of the peak bucket has to be
/dpdk/app/test/
H A Dtest_hash_perf.c68 static uint8_t buckets[NUM_BUCKETS]; variable
176 buckets[i] = 0; in get_input_keys()
222 if (buckets[bucket_idx] == BUCKET_SIZE) in get_input_keys()
236 buckets[bucket_idx]++; in get_input_keys()
/dpdk/examples/ip_pipeline/examples/
H A Dflow_crypto.cli42 pipeline PIPELINE0 table match hash ext key 8 mask FFFFFFFF00000000 offset 282 buckets 1K size 4K a…
H A Dflow.cli47 …e match hash ext key 16 mask 00FF0000FFFFFFFFFFFFFFFFFFFFFFFF offset 278 buckets 16K size 65K acti…
/dpdk/doc/guides/nics/
H A Dsoftnic.rst344 offset 278 buckets 16K size 65K action AP0
355 offset 278 buckets 16K size 65K action AP0
/dpdk/doc/guides/sample_app_ug/
H A Dip_pipeline.rst401 buckets <n_buckets>
/dpdk/doc/guides/eventdevs/
H A Ddlb2.rst322 Four buckets are used
/dpdk/doc/guides/rel_notes/
H A Drelease_18_11.rst225 buckets when needed to accommodate the unlikely event of intensive hash

12