4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 #include <rte_common.h>
39 #include <rte_memory.h>
40 #include <rte_malloc.h>
43 #include "rte_table_hash.h"
46 #define KEYS_PER_BUCKET 4
48 #ifdef RTE_TABLE_STATS_COLLECT
50 #define RTE_TABLE_HASH_LRU_STATS_PKTS_IN_ADD(table, val) \
51 table->stats.n_pkts_in += val
52 #define RTE_TABLE_HASH_LRU_STATS_PKTS_LOOKUP_MISS(table, val) \
53 table->stats.n_pkts_lookup_miss += val
57 #define RTE_TABLE_HASH_LRU_STATS_PKTS_IN_ADD(table, val)
58 #define RTE_TABLE_HASH_LRU_STATS_PKTS_LOOKUP_MISS(table, val)
67 uint16_t sig[KEYS_PER_BUCKET];
68 uint32_t key_pos[KEYS_PER_BUCKET];
79 struct rte_table_hash {
80 struct rte_table_stats stats;
82 /* Input parameters */
87 rte_table_hash_op_hash f_hash;
89 uint32_t signature_offset;
94 uint32_t key_size_shl;
95 uint32_t data_size_shl;
96 uint32_t key_stack_tos;
99 struct grinder grinders[RTE_PORT_IN_BURST_SIZE_MAX];
102 struct bucket *buckets;
108 uint8_t memory[0] __rte_cache_aligned;
112 check_params_create(struct rte_table_hash_lru_params *params)
114 uint32_t n_buckets_min;
117 if ((params->key_size == 0) ||
118 (!rte_is_power_of_2(params->key_size))) {
119 RTE_LOG(ERR, TABLE, "%s: key_size invalid value\n", __func__);
124 if ((params->n_keys == 0) ||
125 (!rte_is_power_of_2(params->n_keys))) {
126 RTE_LOG(ERR, TABLE, "%s: n_keys invalid value\n", __func__);
131 n_buckets_min = (params->n_keys + KEYS_PER_BUCKET - 1) / params->n_keys;
132 if ((params->n_buckets == 0) ||
133 (!rte_is_power_of_2(params->n_keys)) ||
134 (params->n_buckets < n_buckets_min)) {
135 RTE_LOG(ERR, TABLE, "%s: n_buckets invalid value\n", __func__);
140 if (params->f_hash == NULL) {
141 RTE_LOG(ERR, TABLE, "%s: f_hash invalid value\n", __func__);
149 rte_table_hash_lru_create(void *params, int socket_id, uint32_t entry_size)
151 struct rte_table_hash_lru_params *p =
152 (struct rte_table_hash_lru_params *) params;
153 struct rte_table_hash *t;
154 uint32_t total_size, table_meta_sz;
155 uint32_t bucket_sz, key_sz, key_stack_sz, data_sz;
156 uint32_t bucket_offset, key_offset, key_stack_offset, data_offset;
159 /* Check input parameters */
160 if ((check_params_create(p) != 0) ||
161 (!rte_is_power_of_2(entry_size)) ||
162 ((sizeof(struct rte_table_hash) % RTE_CACHE_LINE_SIZE) != 0) ||
163 (sizeof(struct bucket) != (RTE_CACHE_LINE_SIZE / 2))) {
167 /* Memory allocation */
168 table_meta_sz = RTE_CACHE_LINE_ROUNDUP(sizeof(struct rte_table_hash));
169 bucket_sz = RTE_CACHE_LINE_ROUNDUP(p->n_buckets * sizeof(struct bucket));
170 key_sz = RTE_CACHE_LINE_ROUNDUP(p->n_keys * p->key_size);
171 key_stack_sz = RTE_CACHE_LINE_ROUNDUP(p->n_keys * sizeof(uint32_t));
172 data_sz = RTE_CACHE_LINE_ROUNDUP(p->n_keys * entry_size);
173 total_size = table_meta_sz + bucket_sz + key_sz + key_stack_sz +
176 t = rte_zmalloc_socket("TABLE", total_size, RTE_CACHE_LINE_SIZE, socket_id);
179 "%s: Cannot allocate %u bytes for hash table\n",
180 __func__, total_size);
183 RTE_LOG(INFO, TABLE, "%s (%u-byte key): Hash table memory footprint is "
184 "%u bytes\n", __func__, p->key_size, total_size);
186 /* Memory initialization */
187 t->key_size = p->key_size;
188 t->entry_size = entry_size;
189 t->n_keys = p->n_keys;
190 t->n_buckets = p->n_buckets;
191 t->f_hash = p->f_hash;
193 t->signature_offset = p->signature_offset;
194 t->key_offset = p->key_offset;
197 t->bucket_mask = t->n_buckets - 1;
198 t->key_size_shl = __builtin_ctzl(p->key_size);
199 t->data_size_shl = __builtin_ctzl(entry_size);
203 key_offset = bucket_offset + bucket_sz;
204 key_stack_offset = key_offset + key_sz;
205 data_offset = key_stack_offset + key_stack_sz;
207 t->buckets = (struct bucket *) &t->memory[bucket_offset];
208 t->key_mem = &t->memory[key_offset];
209 t->key_stack = (uint32_t *) &t->memory[key_stack_offset];
210 t->data_mem = &t->memory[data_offset];
213 for (i = 0; i < t->n_keys; i++)
214 t->key_stack[i] = t->n_keys - 1 - i;
215 t->key_stack_tos = t->n_keys;
218 for (i = 0; i < t->n_buckets; i++) {
219 struct bucket *bkt = &t->buckets[i];
228 rte_table_hash_lru_free(void *table)
230 struct rte_table_hash *t = (struct rte_table_hash *) table;
232 /* Check input parameters */
241 rte_table_hash_lru_entry_add(void *table, void *key, void *entry,
242 int *key_found, void **entry_ptr)
244 struct rte_table_hash *t = (struct rte_table_hash *) table;
247 uint32_t bkt_index, i;
249 sig = t->f_hash(key, t->key_size, t->seed);
250 bkt_index = sig & t->bucket_mask;
251 bkt = &t->buckets[bkt_index];
252 sig = (sig >> 16) | 1LLU;
254 /* Key is present in the bucket */
255 for (i = 0; i < KEYS_PER_BUCKET; i++) {
256 uint64_t bkt_sig = (uint64_t) bkt->sig[i];
257 uint32_t bkt_key_index = bkt->key_pos[i];
258 uint8_t *bkt_key = &t->key_mem[bkt_key_index <<
261 if ((sig == bkt_sig) && (memcmp(key, bkt_key, t->key_size)
263 uint8_t *data = &t->data_mem[bkt_key_index <<
266 memcpy(data, entry, t->entry_size);
269 *entry_ptr = (void *) data;
274 /* Key is not present in the bucket */
275 for (i = 0; i < KEYS_PER_BUCKET; i++) {
276 uint64_t bkt_sig = (uint64_t) bkt->sig[i];
279 uint32_t bkt_key_index;
280 uint8_t *bkt_key, *data;
282 /* Allocate new key */
283 if (t->key_stack_tos == 0) {
284 /* No keys available */
287 bkt_key_index = t->key_stack[--t->key_stack_tos];
289 /* Install new key */
290 bkt_key = &t->key_mem[bkt_key_index << t->key_size_shl];
291 data = &t->data_mem[bkt_key_index << t->data_size_shl];
293 bkt->sig[i] = (uint16_t) sig;
294 bkt->key_pos[i] = bkt_key_index;
295 memcpy(bkt_key, key, t->key_size);
296 memcpy(data, entry, t->entry_size);
300 *entry_ptr = (void *) data;
307 uint64_t pos = lru_pos(bkt);
308 uint32_t bkt_key_index = bkt->key_pos[pos];
309 uint8_t *bkt_key = &t->key_mem[bkt_key_index <<
311 uint8_t *data = &t->data_mem[bkt_key_index << t->data_size_shl];
313 bkt->sig[pos] = (uint16_t) sig;
314 memcpy(bkt_key, key, t->key_size);
315 memcpy(data, entry, t->entry_size);
316 lru_update(bkt, pos);
319 *entry_ptr = (void *) data;
325 rte_table_hash_lru_entry_delete(void *table, void *key, int *key_found,
328 struct rte_table_hash *t = (struct rte_table_hash *) table;
331 uint32_t bkt_index, i;
333 sig = t->f_hash(key, t->key_size, t->seed);
334 bkt_index = sig & t->bucket_mask;
335 bkt = &t->buckets[bkt_index];
336 sig = (sig >> 16) | 1LLU;
338 /* Key is present in the bucket */
339 for (i = 0; i < KEYS_PER_BUCKET; i++) {
340 uint64_t bkt_sig = (uint64_t) bkt->sig[i];
341 uint32_t bkt_key_index = bkt->key_pos[i];
342 uint8_t *bkt_key = &t->key_mem[bkt_key_index <<
345 if ((sig == bkt_sig) &&
346 (memcmp(key, bkt_key, t->key_size) == 0)) {
347 uint8_t *data = &t->data_mem[bkt_key_index <<
351 t->key_stack[t->key_stack_tos++] = bkt_key_index;
353 memcpy(entry, data, t->entry_size);
358 /* Key is not present in the bucket */
363 static int rte_table_hash_lru_lookup_unoptimized(
365 struct rte_mbuf **pkts,
367 uint64_t *lookup_hit_mask,
371 struct rte_table_hash *t = (struct rte_table_hash *) table;
372 uint64_t pkts_mask_out = 0;
374 __rte_unused uint32_t n_pkts_in = __builtin_popcountll(pkts_mask);
375 RTE_TABLE_HASH_LRU_STATS_PKTS_IN_ADD(t, n_pkts_in);
377 for ( ; pkts_mask; ) {
379 struct rte_mbuf *pkt;
381 uint64_t pkt_mask, sig;
382 uint32_t pkt_index, bkt_index, i;
384 pkt_index = __builtin_ctzll(pkts_mask);
385 pkt_mask = 1LLU << pkt_index;
386 pkts_mask &= ~pkt_mask;
388 pkt = pkts[pkt_index];
389 key = RTE_MBUF_METADATA_UINT8_PTR(pkt, t->key_offset);
391 sig = (uint64_t) t->f_hash(key, t->key_size, t->seed);
393 sig = RTE_MBUF_METADATA_UINT32(pkt,
394 t->signature_offset);
396 bkt_index = sig & t->bucket_mask;
397 bkt = &t->buckets[bkt_index];
398 sig = (sig >> 16) | 1LLU;
400 /* Key is present in the bucket */
401 for (i = 0; i < KEYS_PER_BUCKET; i++) {
402 uint64_t bkt_sig = (uint64_t) bkt->sig[i];
403 uint32_t bkt_key_index = bkt->key_pos[i];
404 uint8_t *bkt_key = &t->key_mem[bkt_key_index <<
407 if ((sig == bkt_sig) && (memcmp(key, bkt_key,
408 t->key_size) == 0)) {
409 uint8_t *data = &t->data_mem[bkt_key_index <<
413 pkts_mask_out |= pkt_mask;
414 entries[pkt_index] = (void *) data;
420 *lookup_hit_mask = pkts_mask_out;
421 RTE_TABLE_HASH_LRU_STATS_PKTS_LOOKUP_MISS(t, n_pkts_in - __builtin_popcountll(pkts_mask_out));
427 * mask = match bitmask
428 * match = at least one match
429 * match_many = more than one match
430 * match_pos = position of first match
432 * ----------------------------------------
433 * mask match match_many match_pos
434 * ----------------------------------------
439 * ----------------------------------------
444 * ----------------------------------------
449 * ----------------------------------------
454 * ----------------------------------------
456 * match = 1111_1111_1111_1110
457 * match_many = 1111_1110_1110_1000
458 * match_pos = 0001_0010_0001_0011__0001_0010_0001_0000
461 * match_many = 0xFEE8LLU
462 * match_pos = 0x12131210LLU
466 #define LUT_MATCH 0xFFFELLU
467 #define LUT_MATCH_MANY 0xFEE8LLU
468 #define LUT_MATCH_POS 0x12131210LLU
470 #define lookup_cmp_sig(mbuf_sig, bucket, match, match_many, match_pos)\
472 uint64_t bucket_sig[4], mask[4], mask_all; \
474 bucket_sig[0] = bucket->sig[0]; \
475 bucket_sig[1] = bucket->sig[1]; \
476 bucket_sig[2] = bucket->sig[2]; \
477 bucket_sig[3] = bucket->sig[3]; \
479 bucket_sig[0] ^= mbuf_sig; \
480 bucket_sig[1] ^= mbuf_sig; \
481 bucket_sig[2] ^= mbuf_sig; \
482 bucket_sig[3] ^= mbuf_sig; \
489 if (bucket_sig[0] == 0) \
491 if (bucket_sig[1] == 0) \
493 if (bucket_sig[2] == 0) \
495 if (bucket_sig[3] == 0) \
498 mask_all = (mask[0] | mask[1]) | (mask[2] | mask[3]); \
500 match = (LUT_MATCH >> mask_all) & 1; \
501 match_many = (LUT_MATCH_MANY >> mask_all) & 1; \
502 match_pos = (LUT_MATCH_POS >> (mask_all << 1)) & 3; \
505 #define lookup_cmp_key(mbuf, key, match_key, f) \
507 uint64_t *pkt_key = RTE_MBUF_METADATA_UINT64_PTR(mbuf, f->key_offset);\
508 uint64_t *bkt_key = (uint64_t *) key; \
510 switch (f->key_size) { \
513 uint64_t xor = pkt_key[0] ^ bkt_key[0]; \
522 uint64_t xor[2], or; \
524 xor[0] = pkt_key[0] ^ bkt_key[0]; \
525 xor[1] = pkt_key[1] ^ bkt_key[1]; \
526 or = xor[0] | xor[1]; \
535 uint64_t xor[4], or; \
537 xor[0] = pkt_key[0] ^ bkt_key[0]; \
538 xor[1] = pkt_key[1] ^ bkt_key[1]; \
539 xor[2] = pkt_key[2] ^ bkt_key[2]; \
540 xor[3] = pkt_key[3] ^ bkt_key[3]; \
541 or = xor[0] | xor[1] | xor[2] | xor[3]; \
550 uint64_t xor[8], or; \
552 xor[0] = pkt_key[0] ^ bkt_key[0]; \
553 xor[1] = pkt_key[1] ^ bkt_key[1]; \
554 xor[2] = pkt_key[2] ^ bkt_key[2]; \
555 xor[3] = pkt_key[3] ^ bkt_key[3]; \
556 xor[4] = pkt_key[4] ^ bkt_key[4]; \
557 xor[5] = pkt_key[5] ^ bkt_key[5]; \
558 xor[6] = pkt_key[6] ^ bkt_key[6]; \
559 xor[7] = pkt_key[7] ^ bkt_key[7]; \
560 or = xor[0] | xor[1] | xor[2] | xor[3] | \
561 xor[4] | xor[5] | xor[6] | xor[7]; \
570 if (memcmp(pkt_key, bkt_key, f->key_size) == 0) \
575 #define lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index)\
577 uint64_t pkt00_mask, pkt01_mask; \
578 struct rte_mbuf *mbuf00, *mbuf01; \
580 pkt00_index = __builtin_ctzll(pkts_mask); \
581 pkt00_mask = 1LLU << pkt00_index; \
582 pkts_mask &= ~pkt00_mask; \
583 mbuf00 = pkts[pkt00_index]; \
585 pkt01_index = __builtin_ctzll(pkts_mask); \
586 pkt01_mask = 1LLU << pkt01_index; \
587 pkts_mask &= ~pkt01_mask; \
588 mbuf01 = pkts[pkt01_index]; \
590 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0)); \
591 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0)); \
594 #define lookup2_stage0_with_odd_support(t, g, pkts, pkts_mask, pkt00_index, \
597 uint64_t pkt00_mask, pkt01_mask; \
598 struct rte_mbuf *mbuf00, *mbuf01; \
600 pkt00_index = __builtin_ctzll(pkts_mask); \
601 pkt00_mask = 1LLU << pkt00_index; \
602 pkts_mask &= ~pkt00_mask; \
603 mbuf00 = pkts[pkt00_index]; \
605 pkt01_index = __builtin_ctzll(pkts_mask); \
606 if (pkts_mask == 0) \
607 pkt01_index = pkt00_index; \
609 pkt01_mask = 1LLU << pkt01_index; \
610 pkts_mask &= ~pkt01_mask; \
611 mbuf01 = pkts[pkt01_index]; \
613 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0)); \
614 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0)); \
617 #define lookup2_stage1(t, g, pkts, pkt10_index, pkt11_index) \
619 struct grinder *g10, *g11; \
620 uint64_t sig10, sig11, bkt10_index, bkt11_index; \
621 struct rte_mbuf *mbuf10, *mbuf11; \
622 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
623 uint64_t bucket_mask = t->bucket_mask; \
624 uint32_t signature_offset = t->signature_offset; \
626 mbuf10 = pkts[pkt10_index]; \
627 sig10 = (uint64_t) RTE_MBUF_METADATA_UINT32(mbuf10, signature_offset);\
628 bkt10_index = sig10 & bucket_mask; \
629 bkt10 = &buckets[bkt10_index]; \
631 mbuf11 = pkts[pkt11_index]; \
632 sig11 = (uint64_t) RTE_MBUF_METADATA_UINT32(mbuf11, signature_offset);\
633 bkt11_index = sig11 & bucket_mask; \
634 bkt11 = &buckets[bkt11_index]; \
636 rte_prefetch0(bkt10); \
637 rte_prefetch0(bkt11); \
639 g10 = &g[pkt10_index]; \
643 g11 = &g[pkt11_index]; \
648 #define lookup2_stage1_dosig(t, g, pkts, pkt10_index, pkt11_index)\
650 struct grinder *g10, *g11; \
651 uint64_t sig10, sig11, bkt10_index, bkt11_index; \
652 struct rte_mbuf *mbuf10, *mbuf11; \
653 struct bucket *bkt10, *bkt11, *buckets = t->buckets; \
654 uint8_t *key10, *key11; \
655 uint64_t bucket_mask = t->bucket_mask; \
656 rte_table_hash_op_hash f_hash = t->f_hash; \
657 uint64_t seed = t->seed; \
658 uint32_t key_size = t->key_size; \
659 uint32_t key_offset = t->key_offset; \
661 mbuf10 = pkts[pkt10_index]; \
662 key10 = RTE_MBUF_METADATA_UINT8_PTR(mbuf10, key_offset);\
663 sig10 = (uint64_t) f_hash(key10, key_size, seed); \
664 bkt10_index = sig10 & bucket_mask; \
665 bkt10 = &buckets[bkt10_index]; \
667 mbuf11 = pkts[pkt11_index]; \
668 key11 = RTE_MBUF_METADATA_UINT8_PTR(mbuf11, key_offset);\
669 sig11 = (uint64_t) f_hash(key11, key_size, seed); \
670 bkt11_index = sig11 & bucket_mask; \
671 bkt11 = &buckets[bkt11_index]; \
673 rte_prefetch0(bkt10); \
674 rte_prefetch0(bkt11); \
676 g10 = &g[pkt10_index]; \
680 g11 = &g[pkt11_index]; \
685 #define lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many)\
687 struct grinder *g20, *g21; \
688 uint64_t sig20, sig21; \
689 struct bucket *bkt20, *bkt21; \
690 uint8_t *key20, *key21, *key_mem = t->key_mem; \
691 uint64_t match20, match21, match_many20, match_many21; \
692 uint64_t match_pos20, match_pos21; \
693 uint32_t key20_index, key21_index, key_size_shl = t->key_size_shl;\
695 g20 = &g[pkt20_index]; \
698 sig20 = (sig20 >> 16) | 1LLU; \
699 lookup_cmp_sig(sig20, bkt20, match20, match_many20, match_pos20);\
700 match20 <<= pkt20_index; \
701 match_many20 <<= pkt20_index; \
702 key20_index = bkt20->key_pos[match_pos20]; \
703 key20 = &key_mem[key20_index << key_size_shl]; \
705 g21 = &g[pkt21_index]; \
708 sig21 = (sig21 >> 16) | 1LLU; \
709 lookup_cmp_sig(sig21, bkt21, match21, match_many21, match_pos21);\
710 match21 <<= pkt21_index; \
711 match_many21 <<= pkt21_index; \
712 key21_index = bkt21->key_pos[match_pos21]; \
713 key21 = &key_mem[key21_index << key_size_shl]; \
715 rte_prefetch0(key20); \
716 rte_prefetch0(key21); \
718 pkts_mask_match_many |= match_many20 | match_many21; \
720 g20->match = match20; \
721 g20->match_pos = match_pos20; \
722 g20->key_index = key20_index; \
724 g21->match = match21; \
725 g21->match_pos = match_pos21; \
726 g21->key_index = key21_index; \
729 #define lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out, \
732 struct grinder *g30, *g31; \
733 struct rte_mbuf *mbuf30, *mbuf31; \
734 struct bucket *bkt30, *bkt31; \
735 uint8_t *key30, *key31, *key_mem = t->key_mem; \
736 uint8_t *data30, *data31, *data_mem = t->data_mem; \
737 uint64_t match30, match31, match_pos30, match_pos31; \
738 uint64_t match_key30, match_key31, match_keys; \
739 uint32_t key30_index, key31_index; \
740 uint32_t key_size_shl = t->key_size_shl; \
741 uint32_t data_size_shl = t->data_size_shl; \
743 mbuf30 = pkts[pkt30_index]; \
744 g30 = &g[pkt30_index]; \
746 match30 = g30->match; \
747 match_pos30 = g30->match_pos; \
748 key30_index = g30->key_index; \
749 key30 = &key_mem[key30_index << key_size_shl]; \
750 lookup_cmp_key(mbuf30, key30, match_key30, t); \
751 match_key30 <<= pkt30_index; \
752 match_key30 &= match30; \
753 data30 = &data_mem[key30_index << data_size_shl]; \
754 entries[pkt30_index] = data30; \
756 mbuf31 = pkts[pkt31_index]; \
757 g31 = &g[pkt31_index]; \
759 match31 = g31->match; \
760 match_pos31 = g31->match_pos; \
761 key31_index = g31->key_index; \
762 key31 = &key_mem[key31_index << key_size_shl]; \
763 lookup_cmp_key(mbuf31, key31, match_key31, t); \
764 match_key31 <<= pkt31_index; \
765 match_key31 &= match31; \
766 data31 = &data_mem[key31_index << data_size_shl]; \
767 entries[pkt31_index] = data31; \
769 rte_prefetch0(data30); \
770 rte_prefetch0(data31); \
772 match_keys = match_key30 | match_key31; \
773 pkts_mask_out |= match_keys; \
775 if (match_key30 == 0) \
777 lru_update(bkt30, match_pos30); \
779 if (match_key31 == 0) \
781 lru_update(bkt31, match_pos31); \
785 * The lookup function implements a 4-stage pipeline, with each stage processing
786 * two different packets. The purpose of pipelined implementation is to hide the
787 * latency of prefetching the data structures and loosen the data dependency
788 * between instructions.
790 * p00 _______ p10 _______ p20 _______ p30 _______
791 * ----->| |----->| |----->| |----->| |----->
792 * | 0 | | 1 | | 2 | | 3 |
793 * ----->|_______|----->|_______|----->|_______|----->|_______|----->
796 * The naming convention is:
797 * pXY = packet Y of stage X, X = 0 .. 3, Y = 0 .. 1
800 static int rte_table_hash_lru_lookup(
802 struct rte_mbuf **pkts,
804 uint64_t *lookup_hit_mask,
807 struct rte_table_hash *t = (struct rte_table_hash *) table;
808 struct grinder *g = t->grinders;
809 uint64_t pkt00_index, pkt01_index, pkt10_index, pkt11_index;
810 uint64_t pkt20_index, pkt21_index, pkt30_index, pkt31_index;
811 uint64_t pkts_mask_out = 0, pkts_mask_match_many = 0;
814 __rte_unused uint32_t n_pkts_in = __builtin_popcountll(pkts_mask);
815 RTE_TABLE_HASH_LRU_STATS_PKTS_IN_ADD(t, n_pkts_in);
817 /* Cannot run the pipeline with less than 7 packets */
818 if (__builtin_popcountll(pkts_mask) < 7)
819 return rte_table_hash_lru_lookup_unoptimized(table, pkts,
820 pkts_mask, lookup_hit_mask, entries, 0);
822 /* Pipeline stage 0 */
823 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
826 pkt10_index = pkt00_index;
827 pkt11_index = pkt01_index;
829 /* Pipeline stage 0 */
830 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
832 /* Pipeline stage 1 */
833 lookup2_stage1(t, g, pkts, pkt10_index, pkt11_index);
836 pkt20_index = pkt10_index;
837 pkt21_index = pkt11_index;
838 pkt10_index = pkt00_index;
839 pkt11_index = pkt01_index;
841 /* Pipeline stage 0 */
842 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
844 /* Pipeline stage 1 */
845 lookup2_stage1(t, g, pkts, pkt10_index, pkt11_index);
847 /* Pipeline stage 2 */
848 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
854 for ( ; pkts_mask; ) {
856 pkt30_index = pkt20_index;
857 pkt31_index = pkt21_index;
858 pkt20_index = pkt10_index;
859 pkt21_index = pkt11_index;
860 pkt10_index = pkt00_index;
861 pkt11_index = pkt01_index;
863 /* Pipeline stage 0 */
864 lookup2_stage0_with_odd_support(t, g, pkts, pkts_mask,
865 pkt00_index, pkt01_index);
867 /* Pipeline stage 1 */
868 lookup2_stage1(t, g, pkts, pkt10_index, pkt11_index);
870 /* Pipeline stage 2 */
871 lookup2_stage2(t, g, pkt20_index, pkt21_index,
872 pkts_mask_match_many);
874 /* Pipeline stage 3 */
875 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index,
876 pkts_mask_out, entries);
880 pkt30_index = pkt20_index;
881 pkt31_index = pkt21_index;
882 pkt20_index = pkt10_index;
883 pkt21_index = pkt11_index;
884 pkt10_index = pkt00_index;
885 pkt11_index = pkt01_index;
887 /* Pipeline stage 1 */
888 lookup2_stage1(t, g, pkts, pkt10_index, pkt11_index);
890 /* Pipeline stage 2 */
891 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
893 /* Pipeline stage 3 */
894 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
898 pkt30_index = pkt20_index;
899 pkt31_index = pkt21_index;
900 pkt20_index = pkt10_index;
901 pkt21_index = pkt11_index;
903 /* Pipeline stage 2 */
904 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
906 /* Pipeline stage 3 */
907 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
911 pkt30_index = pkt20_index;
912 pkt31_index = pkt21_index;
914 /* Pipeline stage 3 */
915 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
919 pkts_mask_match_many &= ~pkts_mask_out;
920 if (pkts_mask_match_many) {
921 uint64_t pkts_mask_out_slow = 0;
923 status = rte_table_hash_lru_lookup_unoptimized(table, pkts,
924 pkts_mask_match_many, &pkts_mask_out_slow, entries, 0);
925 pkts_mask_out |= pkts_mask_out_slow;
928 *lookup_hit_mask = pkts_mask_out;
929 RTE_TABLE_HASH_LRU_STATS_PKTS_LOOKUP_MISS(t, n_pkts_in - __builtin_popcountll(pkts_mask_out));
933 static int rte_table_hash_lru_lookup_dosig(
935 struct rte_mbuf **pkts,
937 uint64_t *lookup_hit_mask,
940 struct rte_table_hash *t = (struct rte_table_hash *) table;
941 struct grinder *g = t->grinders;
942 uint64_t pkt00_index, pkt01_index, pkt10_index, pkt11_index;
943 uint64_t pkt20_index, pkt21_index, pkt30_index, pkt31_index;
944 uint64_t pkts_mask_out = 0, pkts_mask_match_many = 0;
947 __rte_unused uint32_t n_pkts_in = __builtin_popcountll(pkts_mask);
948 RTE_TABLE_HASH_LRU_STATS_PKTS_IN_ADD(t, n_pkts_in);
950 /* Cannot run the pipeline with less than 7 packets */
951 if (__builtin_popcountll(pkts_mask) < 7)
952 return rte_table_hash_lru_lookup_unoptimized(table, pkts,
953 pkts_mask, lookup_hit_mask, entries, 1);
955 /* Pipeline stage 0 */
956 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
959 pkt10_index = pkt00_index;
960 pkt11_index = pkt01_index;
962 /* Pipeline stage 0 */
963 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
965 /* Pipeline stage 1 */
966 lookup2_stage1_dosig(t, g, pkts, pkt10_index, pkt11_index);
969 pkt20_index = pkt10_index;
970 pkt21_index = pkt11_index;
971 pkt10_index = pkt00_index;
972 pkt11_index = pkt01_index;
974 /* Pipeline stage 0 */
975 lookup2_stage0(t, g, pkts, pkts_mask, pkt00_index, pkt01_index);
977 /* Pipeline stage 1 */
978 lookup2_stage1_dosig(t, g, pkts, pkt10_index, pkt11_index);
980 /* Pipeline stage 2 */
981 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
987 for ( ; pkts_mask; ) {
989 pkt30_index = pkt20_index;
990 pkt31_index = pkt21_index;
991 pkt20_index = pkt10_index;
992 pkt21_index = pkt11_index;
993 pkt10_index = pkt00_index;
994 pkt11_index = pkt01_index;
996 /* Pipeline stage 0 */
997 lookup2_stage0_with_odd_support(t, g, pkts, pkts_mask,
998 pkt00_index, pkt01_index);
1000 /* Pipeline stage 1 */
1001 lookup2_stage1_dosig(t, g, pkts, pkt10_index, pkt11_index);
1003 /* Pipeline stage 2 */
1004 lookup2_stage2(t, g, pkt20_index, pkt21_index,
1005 pkts_mask_match_many);
1007 /* Pipeline stage 3 */
1008 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index,
1009 pkts_mask_out, entries);
1013 pkt30_index = pkt20_index;
1014 pkt31_index = pkt21_index;
1015 pkt20_index = pkt10_index;
1016 pkt21_index = pkt11_index;
1017 pkt10_index = pkt00_index;
1018 pkt11_index = pkt01_index;
1020 /* Pipeline stage 1 */
1021 lookup2_stage1_dosig(t, g, pkts, pkt10_index, pkt11_index);
1023 /* Pipeline stage 2 */
1024 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
1026 /* Pipeline stage 3 */
1027 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
1031 pkt30_index = pkt20_index;
1032 pkt31_index = pkt21_index;
1033 pkt20_index = pkt10_index;
1034 pkt21_index = pkt11_index;
1036 /* Pipeline stage 2 */
1037 lookup2_stage2(t, g, pkt20_index, pkt21_index, pkts_mask_match_many);
1039 /* Pipeline stage 3 */
1040 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
1044 pkt30_index = pkt20_index;
1045 pkt31_index = pkt21_index;
1047 /* Pipeline stage 3 */
1048 lookup2_stage3(t, g, pkts, pkt30_index, pkt31_index, pkts_mask_out,
1052 pkts_mask_match_many &= ~pkts_mask_out;
1053 if (pkts_mask_match_many) {
1054 uint64_t pkts_mask_out_slow = 0;
1056 status = rte_table_hash_lru_lookup_unoptimized(table, pkts,
1057 pkts_mask_match_many, &pkts_mask_out_slow, entries, 1);
1058 pkts_mask_out |= pkts_mask_out_slow;
1061 *lookup_hit_mask = pkts_mask_out;
1062 RTE_TABLE_HASH_LRU_STATS_PKTS_LOOKUP_MISS(t, n_pkts_in - __builtin_popcountll(pkts_mask_out));
1067 rte_table_hash_lru_stats_read(void *table, struct rte_table_stats *stats, int clear)
1069 struct rte_table_hash *t = (struct rte_table_hash *) table;
1072 memcpy(stats, &t->stats, sizeof(t->stats));
1075 memset(&t->stats, 0, sizeof(t->stats));
1080 struct rte_table_ops rte_table_hash_lru_ops = {
1081 .f_create = rte_table_hash_lru_create,
1082 .f_free = rte_table_hash_lru_free,
1083 .f_add = rte_table_hash_lru_entry_add,
1084 .f_delete = rte_table_hash_lru_entry_delete,
1085 .f_lookup = rte_table_hash_lru_lookup,
1086 .f_stats = rte_table_hash_lru_stats_read,
1089 struct rte_table_ops rte_table_hash_lru_dosig_ops = {
1090 .f_create = rte_table_hash_lru_create,
1091 .f_free = rte_table_hash_lru_free,
1092 .f_add = rte_table_hash_lru_entry_add,
1093 .f_delete = rte_table_hash_lru_entry_delete,
1094 .f_lookup = rte_table_hash_lru_lookup_dosig,
1095 .f_stats = rte_table_hash_lru_stats_read,