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.
36 #include <rte_common.h>
38 #include <rte_malloc.h>
41 #include "rte_table_hash.h"
44 #define RTE_TABLE_HASH_KEY_SIZE 8
46 struct rte_bucket_4_8 {
50 struct rte_bucket_4_8 *next;
59 struct rte_table_hash {
60 /* Input parameters */
62 uint32_t n_entries_per_bucket;
66 uint32_t signature_offset;
68 rte_table_hash_op_hash f_hash;
71 /* Extendible buckets */
72 uint32_t n_buckets_ext;
77 uint8_t memory[0] __rte_cache_aligned;
81 check_params_create_lru(struct rte_table_hash_key8_lru_params *params) {
83 if (params->n_entries == 0) {
84 RTE_LOG(ERR, TABLE, "%s: n_entries is zero\n", __func__);
88 /* signature offset */
89 if ((params->signature_offset & 0x3) != 0) {
90 RTE_LOG(ERR, TABLE, "%s: invalid signature_offset\n", __func__);
95 if ((params->key_offset & 0x7) != 0) {
96 RTE_LOG(ERR, TABLE, "%s: invalid key_offset\n", __func__);
101 if (params->f_hash == NULL) {
102 RTE_LOG(ERR, TABLE, "%s: f_hash function pointer is NULL\n",
111 rte_table_hash_create_key8_lru(void *params, int socket_id, uint32_t entry_size)
113 struct rte_table_hash_key8_lru_params *p =
114 (struct rte_table_hash_key8_lru_params *) params;
115 struct rte_table_hash *f;
116 uint32_t n_buckets, n_entries_per_bucket, key_size, bucket_size_cl;
117 uint32_t total_size, i;
119 /* Check input parameters */
120 if ((check_params_create_lru(p) != 0) ||
121 ((sizeof(struct rte_table_hash) % CACHE_LINE_SIZE) != 0) ||
122 ((sizeof(struct rte_bucket_4_8) % CACHE_LINE_SIZE) != 0)) {
125 n_entries_per_bucket = 4;
128 /* Memory allocation */
129 n_buckets = rte_align32pow2((p->n_entries + n_entries_per_bucket - 1) /
130 n_entries_per_bucket);
131 bucket_size_cl = (sizeof(struct rte_bucket_4_8) + n_entries_per_bucket *
132 entry_size + CACHE_LINE_SIZE - 1) / CACHE_LINE_SIZE;
133 total_size = sizeof(struct rte_table_hash) + n_buckets *
134 bucket_size_cl * CACHE_LINE_SIZE;
136 f = rte_zmalloc_socket("TABLE", total_size, CACHE_LINE_SIZE, socket_id);
139 "%s: Cannot allocate %u bytes for hash table\n",
140 __func__, total_size);
144 "%s: Hash table memory footprint is %u bytes\n",
145 __func__, total_size);
147 /* Memory initialization */
148 f->n_buckets = n_buckets;
149 f->n_entries_per_bucket = n_entries_per_bucket;
150 f->key_size = key_size;
151 f->entry_size = entry_size;
152 f->bucket_size = bucket_size_cl * CACHE_LINE_SIZE;
153 f->signature_offset = p->signature_offset;
154 f->key_offset = p->key_offset;
155 f->f_hash = p->f_hash;
158 for (i = 0; i < n_buckets; i++) {
159 struct rte_bucket_4_8 *bucket;
161 bucket = (struct rte_bucket_4_8 *) &f->memory[i *
163 bucket->lru_list = 0x0000000100020003LLU;
170 rte_table_hash_free_key8_lru(void *table)
172 struct rte_table_hash *f = (struct rte_table_hash *) table;
174 /* Check input parameters */
176 RTE_LOG(ERR, TABLE, "%s: table parameter is NULL\n", __func__);
185 rte_table_hash_entry_add_key8_lru(
192 struct rte_table_hash *f = (struct rte_table_hash *) table;
193 struct rte_bucket_4_8 *bucket;
194 uint64_t signature, mask, pos;
195 uint32_t bucket_index, i;
197 signature = f->f_hash(key, f->key_size, f->seed);
198 bucket_index = signature & (f->n_buckets - 1);
199 bucket = (struct rte_bucket_4_8 *)
200 &f->memory[bucket_index * f->bucket_size];
202 /* Key is present in the bucket */
203 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
204 uint64_t bucket_signature = bucket->signature;
205 uint64_t bucket_key = bucket->key[i];
207 if ((bucket_signature & mask) &&
208 (*((uint64_t *) key) == bucket_key)) {
209 uint8_t *bucket_data = &bucket->data[i * f->entry_size];
211 memcpy(bucket_data, entry, f->entry_size);
212 lru_update(bucket, i);
214 *entry_ptr = (void *) bucket_data;
219 /* Key is not present in the bucket */
220 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
221 uint64_t bucket_signature = bucket->signature;
223 if ((bucket_signature & mask) == 0) {
224 uint8_t *bucket_data = &bucket->data[i * f->entry_size];
226 bucket->signature |= mask;
227 bucket->key[i] = *((uint64_t *) key);
228 memcpy(bucket_data, entry, f->entry_size);
229 lru_update(bucket, i);
231 *entry_ptr = (void *) bucket_data;
237 /* Bucket full: replace LRU entry */
238 pos = lru_pos(bucket);
239 bucket->key[pos] = *((uint64_t *) key);
240 memcpy(&bucket->data[pos * f->entry_size], entry, f->entry_size);
241 lru_update(bucket, pos);
243 *entry_ptr = (void *) &bucket->data[pos * f->entry_size];
249 rte_table_hash_entry_delete_key8_lru(
255 struct rte_table_hash *f = (struct rte_table_hash *) table;
256 struct rte_bucket_4_8 *bucket;
257 uint64_t signature, mask;
258 uint32_t bucket_index, i;
260 signature = f->f_hash(key, f->key_size, f->seed);
261 bucket_index = signature & (f->n_buckets - 1);
262 bucket = (struct rte_bucket_4_8 *)
263 &f->memory[bucket_index * f->bucket_size];
265 /* Key is present in the bucket */
266 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
267 uint64_t bucket_signature = bucket->signature;
268 uint64_t bucket_key = bucket->key[i];
270 if ((bucket_signature & mask) &&
271 (*((uint64_t *) key) == bucket_key)) {
272 uint8_t *bucket_data = &bucket->data[i * f->entry_size];
274 bucket->signature &= ~mask;
277 memcpy(entry, bucket_data, f->entry_size);
283 /* Key is not present in the bucket */
289 check_params_create_ext(struct rte_table_hash_key8_ext_params *params) {
291 if (params->n_entries == 0) {
292 RTE_LOG(ERR, TABLE, "%s: n_entries is zero\n", __func__);
297 if (params->n_entries_ext == 0) {
298 RTE_LOG(ERR, TABLE, "%s: n_entries_ext is zero\n", __func__);
302 /* signature offset */
303 if ((params->signature_offset & 0x3) != 0) {
304 RTE_LOG(ERR, TABLE, "%s: invalid signature_offset\n", __func__);
309 if ((params->key_offset & 0x7) != 0) {
310 RTE_LOG(ERR, TABLE, "%s: invalid key_offset\n", __func__);
315 if (params->f_hash == NULL) {
316 RTE_LOG(ERR, TABLE, "%s: f_hash function pointer is NULL\n",
325 rte_table_hash_create_key8_ext(void *params, int socket_id, uint32_t entry_size)
327 struct rte_table_hash_key8_ext_params *p =
328 (struct rte_table_hash_key8_ext_params *) params;
329 struct rte_table_hash *f;
330 uint32_t n_buckets, n_buckets_ext, n_entries_per_bucket, key_size;
331 uint32_t bucket_size_cl, stack_size_cl, total_size, i;
333 /* Check input parameters */
334 if ((check_params_create_ext(p) != 0) ||
335 ((sizeof(struct rte_table_hash) % CACHE_LINE_SIZE) != 0) ||
336 ((sizeof(struct rte_bucket_4_8) % CACHE_LINE_SIZE) != 0))
339 n_entries_per_bucket = 4;
342 /* Memory allocation */
343 n_buckets = rte_align32pow2((p->n_entries + n_entries_per_bucket - 1) /
344 n_entries_per_bucket);
345 n_buckets_ext = (p->n_entries_ext + n_entries_per_bucket - 1) /
346 n_entries_per_bucket;
347 bucket_size_cl = (sizeof(struct rte_bucket_4_8) + n_entries_per_bucket *
348 entry_size + CACHE_LINE_SIZE - 1) / CACHE_LINE_SIZE;
349 stack_size_cl = (n_buckets_ext * sizeof(uint32_t) + CACHE_LINE_SIZE - 1)
351 total_size = sizeof(struct rte_table_hash) + ((n_buckets +
352 n_buckets_ext) * bucket_size_cl + stack_size_cl) *
355 f = rte_zmalloc_socket("TABLE", total_size, CACHE_LINE_SIZE, socket_id);
358 "%s: Cannot allocate %u bytes for hash table\n",
359 __func__, total_size);
363 "%s: Hash table memory footprint is %u bytes\n",
364 __func__, total_size);
366 /* Memory initialization */
367 f->n_buckets = n_buckets;
368 f->n_entries_per_bucket = n_entries_per_bucket;
369 f->key_size = key_size;
370 f->entry_size = entry_size;
371 f->bucket_size = bucket_size_cl * CACHE_LINE_SIZE;
372 f->signature_offset = p->signature_offset;
373 f->key_offset = p->key_offset;
374 f->f_hash = p->f_hash;
377 f->n_buckets_ext = n_buckets_ext;
378 f->stack_pos = n_buckets_ext;
379 f->stack = (uint32_t *)
380 &f->memory[(n_buckets + n_buckets_ext) * f->bucket_size];
382 for (i = 0; i < n_buckets_ext; i++)
389 rte_table_hash_free_key8_ext(void *table)
391 struct rte_table_hash *f = (struct rte_table_hash *) table;
393 /* Check input parameters */
395 RTE_LOG(ERR, TABLE, "%s: table parameter is NULL\n", __func__);
404 rte_table_hash_entry_add_key8_ext(
411 struct rte_table_hash *f = (struct rte_table_hash *) table;
412 struct rte_bucket_4_8 *bucket0, *bucket, *bucket_prev;
414 uint32_t bucket_index, i;
416 signature = f->f_hash(key, f->key_size, f->seed);
417 bucket_index = signature & (f->n_buckets - 1);
418 bucket0 = (struct rte_bucket_4_8 *)
419 &f->memory[bucket_index * f->bucket_size];
421 /* Key is present in the bucket */
422 for (bucket = bucket0; bucket != NULL; bucket = bucket->next) {
425 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
426 uint64_t bucket_signature = bucket->signature;
427 uint64_t bucket_key = bucket->key[i];
429 if ((bucket_signature & mask) &&
430 (*((uint64_t *) key) == bucket_key)) {
431 uint8_t *bucket_data = &bucket->data[i *
434 memcpy(bucket_data, entry, f->entry_size);
436 *entry_ptr = (void *) bucket_data;
442 /* Key is not present in the bucket */
443 for (bucket_prev = NULL, bucket = bucket0;
444 bucket != NULL; bucket_prev = bucket, bucket = bucket->next) {
447 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
448 uint64_t bucket_signature = bucket->signature;
450 if ((bucket_signature & mask) == 0) {
451 uint8_t *bucket_data = &bucket->data[i *
454 bucket->signature |= mask;
455 bucket->key[i] = *((uint64_t *) key);
456 memcpy(bucket_data, entry, f->entry_size);
458 *entry_ptr = (void *) bucket_data;
465 /* Bucket full: extend bucket */
466 if (f->stack_pos > 0) {
467 bucket_index = f->stack[--f->stack_pos];
469 bucket = (struct rte_bucket_4_8 *) &f->memory[(f->n_buckets +
470 bucket_index) * f->bucket_size];
471 bucket_prev->next = bucket;
472 bucket_prev->next_valid = 1;
474 bucket->signature = 1;
475 bucket->key[0] = *((uint64_t *) key);
476 memcpy(&bucket->data[0], entry, f->entry_size);
478 *entry_ptr = (void *) &bucket->data[0];
486 rte_table_hash_entry_delete_key8_ext(
492 struct rte_table_hash *f = (struct rte_table_hash *) table;
493 struct rte_bucket_4_8 *bucket0, *bucket, *bucket_prev;
495 uint32_t bucket_index, i;
497 signature = f->f_hash(key, f->key_size, f->seed);
498 bucket_index = signature & (f->n_buckets - 1);
499 bucket0 = (struct rte_bucket_4_8 *)
500 &f->memory[bucket_index * f->bucket_size];
502 /* Key is present in the bucket */
503 for (bucket_prev = NULL, bucket = bucket0; bucket != NULL;
504 bucket_prev = bucket, bucket = bucket->next) {
507 for (i = 0, mask = 1LLU; i < 4; i++, mask <<= 1) {
508 uint64_t bucket_signature = bucket->signature;
509 uint64_t bucket_key = bucket->key[i];
511 if ((bucket_signature & mask) &&
512 (*((uint64_t *) key) == bucket_key)) {
513 uint8_t *bucket_data = &bucket->data[i *
516 bucket->signature &= ~mask;
519 memcpy(entry, bucket_data,
522 if ((bucket->signature == 0) &&
523 (bucket_prev != NULL)) {
524 bucket_prev->next = bucket->next;
525 bucket_prev->next_valid =
529 sizeof(struct rte_bucket_4_8));
530 bucket_index = (bucket -
531 ((struct rte_bucket_4_8 *)
532 f->memory)) - f->n_buckets;
533 f->stack[f->stack_pos++] = bucket_index;
541 /* Key is not present in the bucket */
546 #define lookup_key8_cmp(key_in, bucket, pos) \
548 uint64_t xor[4], signature; \
550 signature = ~bucket->signature; \
552 xor[0] = (key_in[0] ^ bucket->key[0]) | (signature & 1);\
553 xor[1] = (key_in[0] ^ bucket->key[1]) | (signature & 2);\
554 xor[2] = (key_in[0] ^ bucket->key[2]) | (signature & 4);\
555 xor[3] = (key_in[0] ^ bucket->key[3]) | (signature & 8);\
568 #define lookup1_stage0(pkt0_index, mbuf0, pkts, pkts_mask) \
572 pkt0_index = __builtin_ctzll(pkts_mask); \
573 pkt_mask = 1LLU << pkt0_index; \
574 pkts_mask &= ~pkt_mask; \
576 mbuf0 = pkts[pkt0_index]; \
577 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf0, 0)); \
580 #define lookup1_stage1(mbuf1, bucket1, f) \
582 uint64_t signature; \
583 uint32_t bucket_index; \
585 signature = RTE_MBUF_METADATA_UINT32(mbuf1, f->signature_offset);\
586 bucket_index = signature & (f->n_buckets - 1); \
587 bucket1 = (struct rte_bucket_4_8 *) \
588 &f->memory[bucket_index * f->bucket_size]; \
589 rte_prefetch0(bucket1); \
592 #define lookup1_stage1_dosig(mbuf1, bucket1, f) \
595 uint64_t signature; \
596 uint32_t bucket_index; \
598 key = RTE_MBUF_METADATA_UINT64_PTR(mbuf1, f->key_offset);\
599 signature = f->f_hash(key, RTE_TABLE_HASH_KEY_SIZE, f->seed);\
600 bucket_index = signature & (f->n_buckets - 1); \
601 bucket1 = (struct rte_bucket_4_8 *) \
602 &f->memory[bucket_index * f->bucket_size]; \
603 rte_prefetch0(bucket1); \
606 #define lookup1_stage2_lru(pkt2_index, mbuf2, bucket2, \
607 pkts_mask_out, entries, f) \
614 key = RTE_MBUF_METADATA_UINT64_PTR(mbuf2, f->key_offset);\
616 lookup_key8_cmp(key, bucket2, pos); \
618 pkt_mask = ((bucket2->signature >> pos) & 1LLU) << pkt2_index;\
619 pkts_mask_out |= pkt_mask; \
621 a = (void *) &bucket2->data[pos * f->entry_size]; \
623 entries[pkt2_index] = a; \
624 lru_update(bucket2, pos); \
627 #define lookup1_stage2_ext(pkt2_index, mbuf2, bucket2, pkts_mask_out,\
628 entries, buckets_mask, buckets, keys, f) \
630 struct rte_bucket_4_8 *bucket_next; \
632 uint64_t pkt_mask, bucket_mask; \
636 key = RTE_MBUF_METADATA_UINT64_PTR(mbuf2, f->key_offset);\
638 lookup_key8_cmp(key, bucket2, pos); \
640 pkt_mask = ((bucket2->signature >> pos) & 1LLU) << pkt2_index;\
641 pkts_mask_out |= pkt_mask; \
643 a = (void *) &bucket2->data[pos * f->entry_size]; \
645 entries[pkt2_index] = a; \
647 bucket_mask = (~pkt_mask) & (bucket2->next_valid << pkt2_index);\
648 buckets_mask |= bucket_mask; \
649 bucket_next = bucket2->next; \
650 buckets[pkt2_index] = bucket_next; \
651 keys[pkt2_index] = key; \
654 #define lookup_grinder(pkt_index, buckets, keys, pkts_mask_out, entries,\
657 struct rte_bucket_4_8 *bucket, *bucket_next; \
659 uint64_t pkt_mask, bucket_mask; \
663 bucket = buckets[pkt_index]; \
664 key = keys[pkt_index]; \
666 lookup_key8_cmp(key, bucket, pos); \
668 pkt_mask = ((bucket->signature >> pos) & 1LLU) << pkt_index;\
669 pkts_mask_out |= pkt_mask; \
671 a = (void *) &bucket->data[pos * f->entry_size]; \
673 entries[pkt_index] = a; \
675 bucket_mask = (~pkt_mask) & (bucket->next_valid << pkt_index);\
676 buckets_mask |= bucket_mask; \
677 bucket_next = bucket->next; \
678 rte_prefetch0(bucket_next); \
679 buckets[pkt_index] = bucket_next; \
680 keys[pkt_index] = key; \
683 #define lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01,\
686 uint64_t pkt00_mask, pkt01_mask; \
688 pkt00_index = __builtin_ctzll(pkts_mask); \
689 pkt00_mask = 1LLU << pkt00_index; \
690 pkts_mask &= ~pkt00_mask; \
692 mbuf00 = pkts[pkt00_index]; \
693 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0)); \
695 pkt01_index = __builtin_ctzll(pkts_mask); \
696 pkt01_mask = 1LLU << pkt01_index; \
697 pkts_mask &= ~pkt01_mask; \
699 mbuf01 = pkts[pkt01_index]; \
700 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0)); \
703 #define lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,\
704 mbuf00, mbuf01, pkts, pkts_mask) \
706 uint64_t pkt00_mask, pkt01_mask; \
708 pkt00_index = __builtin_ctzll(pkts_mask); \
709 pkt00_mask = 1LLU << pkt00_index; \
710 pkts_mask &= ~pkt00_mask; \
712 mbuf00 = pkts[pkt00_index]; \
713 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0)); \
715 pkt01_index = __builtin_ctzll(pkts_mask); \
716 if (pkts_mask == 0) \
717 pkt01_index = pkt00_index; \
719 pkt01_mask = 1LLU << pkt01_index; \
720 pkts_mask &= ~pkt01_mask; \
722 mbuf01 = pkts[pkt01_index]; \
723 rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0)); \
726 #define lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f) \
728 uint64_t signature10, signature11; \
729 uint32_t bucket10_index, bucket11_index; \
731 signature10 = RTE_MBUF_METADATA_UINT32(mbuf10, f->signature_offset);\
732 bucket10_index = signature10 & (f->n_buckets - 1); \
733 bucket10 = (struct rte_bucket_4_8 *) \
734 &f->memory[bucket10_index * f->bucket_size]; \
735 rte_prefetch0(bucket10); \
737 signature11 = RTE_MBUF_METADATA_UINT32(mbuf11, f->signature_offset);\
738 bucket11_index = signature11 & (f->n_buckets - 1); \
739 bucket11 = (struct rte_bucket_4_8 *) \
740 &f->memory[bucket11_index * f->bucket_size]; \
741 rte_prefetch0(bucket11); \
744 #define lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f)\
746 uint64_t *key10, *key11; \
747 uint64_t signature10, signature11; \
748 uint32_t bucket10_index, bucket11_index; \
749 rte_table_hash_op_hash f_hash = f->f_hash; \
750 uint64_t seed = f->seed; \
751 uint32_t key_offset = f->key_offset; \
753 key10 = RTE_MBUF_METADATA_UINT64_PTR(mbuf10, key_offset);\
754 key11 = RTE_MBUF_METADATA_UINT64_PTR(mbuf11, key_offset);\
756 signature10 = f_hash(key10, RTE_TABLE_HASH_KEY_SIZE, seed);\
757 bucket10_index = signature10 & (f->n_buckets - 1); \
758 bucket10 = (struct rte_bucket_4_8 *) \
759 &f->memory[bucket10_index * f->bucket_size]; \
760 rte_prefetch0(bucket10); \
762 signature11 = f_hash(key11, RTE_TABLE_HASH_KEY_SIZE, seed);\
763 bucket11_index = signature11 & (f->n_buckets - 1); \
764 bucket11 = (struct rte_bucket_4_8 *) \
765 &f->memory[bucket11_index * f->bucket_size]; \
766 rte_prefetch0(bucket11); \
769 #define lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,\
770 bucket20, bucket21, pkts_mask_out, entries, f) \
773 uint64_t pkt20_mask, pkt21_mask; \
774 uint64_t *key20, *key21; \
775 uint32_t pos20, pos21; \
777 key20 = RTE_MBUF_METADATA_UINT64_PTR(mbuf20, f->key_offset);\
778 key21 = RTE_MBUF_METADATA_UINT64_PTR(mbuf21, f->key_offset);\
780 lookup_key8_cmp(key20, bucket20, pos20); \
781 lookup_key8_cmp(key21, bucket21, pos21); \
783 pkt20_mask = ((bucket20->signature >> pos20) & 1LLU) << pkt20_index;\
784 pkt21_mask = ((bucket21->signature >> pos21) & 1LLU) << pkt21_index;\
785 pkts_mask_out |= pkt20_mask | pkt21_mask; \
787 a20 = (void *) &bucket20->data[pos20 * f->entry_size]; \
788 a21 = (void *) &bucket21->data[pos21 * f->entry_size]; \
789 rte_prefetch0(a20); \
790 rte_prefetch0(a21); \
791 entries[pkt20_index] = a20; \
792 entries[pkt21_index] = a21; \
793 lru_update(bucket20, pos20); \
794 lru_update(bucket21, pos21); \
797 #define lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21, bucket20, \
798 bucket21, pkts_mask_out, entries, buckets_mask, buckets, keys, f)\
800 struct rte_bucket_4_8 *bucket20_next, *bucket21_next; \
802 uint64_t pkt20_mask, pkt21_mask, bucket20_mask, bucket21_mask;\
803 uint64_t *key20, *key21; \
804 uint32_t pos20, pos21; \
806 key20 = RTE_MBUF_METADATA_UINT64_PTR(mbuf20, f->key_offset);\
807 key21 = RTE_MBUF_METADATA_UINT64_PTR(mbuf21, f->key_offset);\
809 lookup_key8_cmp(key20, bucket20, pos20); \
810 lookup_key8_cmp(key21, bucket21, pos21); \
812 pkt20_mask = ((bucket20->signature >> pos20) & 1LLU) << pkt20_index;\
813 pkt21_mask = ((bucket21->signature >> pos21) & 1LLU) << pkt21_index;\
814 pkts_mask_out |= pkt20_mask | pkt21_mask; \
816 a20 = (void *) &bucket20->data[pos20 * f->entry_size]; \
817 a21 = (void *) &bucket21->data[pos21 * f->entry_size]; \
818 rte_prefetch0(a20); \
819 rte_prefetch0(a21); \
820 entries[pkt20_index] = a20; \
821 entries[pkt21_index] = a21; \
823 bucket20_mask = (~pkt20_mask) & (bucket20->next_valid << pkt20_index);\
824 bucket21_mask = (~pkt21_mask) & (bucket21->next_valid << pkt21_index);\
825 buckets_mask |= bucket20_mask | bucket21_mask; \
826 bucket20_next = bucket20->next; \
827 bucket21_next = bucket21->next; \
828 buckets[pkt20_index] = bucket20_next; \
829 buckets[pkt21_index] = bucket21_next; \
830 keys[pkt20_index] = key20; \
831 keys[pkt21_index] = key21; \
835 rte_table_hash_lookup_key8_lru(
837 struct rte_mbuf **pkts,
839 uint64_t *lookup_hit_mask,
842 struct rte_table_hash *f = (struct rte_table_hash *) table;
843 struct rte_bucket_4_8 *bucket10, *bucket11, *bucket20, *bucket21;
844 struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
845 uint32_t pkt00_index, pkt01_index, pkt10_index,
846 pkt11_index, pkt20_index, pkt21_index;
847 uint64_t pkts_mask_out = 0;
849 /* Cannot run the pipeline with less than 5 packets */
850 if (__builtin_popcountll(pkts_mask) < 5) {
851 for ( ; pkts_mask; ) {
852 struct rte_bucket_4_8 *bucket;
853 struct rte_mbuf *mbuf;
856 lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
857 lookup1_stage1(mbuf, bucket, f);
858 lookup1_stage2_lru(pkt_index, mbuf, bucket,
859 pkts_mask_out, entries, f);
862 *lookup_hit_mask = pkts_mask_out;
870 /* Pipeline stage 0 */
871 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
877 pkt10_index = pkt00_index;
878 pkt11_index = pkt01_index;
880 /* Pipeline stage 0 */
881 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
884 /* Pipeline stage 1 */
885 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
891 for ( ; pkts_mask; ) {
899 pkt20_index = pkt10_index;
900 pkt21_index = pkt11_index;
901 pkt10_index = pkt00_index;
902 pkt11_index = pkt01_index;
904 /* Pipeline stage 0 */
905 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
906 mbuf00, mbuf01, pkts, pkts_mask);
908 /* Pipeline stage 1 */
909 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
911 /* Pipeline stage 2 */
912 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
913 bucket20, bucket21, pkts_mask_out, entries, f);
927 pkt20_index = pkt10_index;
928 pkt21_index = pkt11_index;
929 pkt10_index = pkt00_index;
930 pkt11_index = pkt01_index;
932 /* Pipeline stage 1 */
933 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
935 /* Pipeline stage 2 */
936 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
937 bucket20, bucket21, pkts_mask_out, entries, f);
944 pkt20_index = pkt10_index;
945 pkt21_index = pkt11_index;
947 /* Pipeline stage 2 */
948 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
949 bucket20, bucket21, pkts_mask_out, entries, f);
951 *lookup_hit_mask = pkts_mask_out;
953 } /* rte_table_hash_lookup_key8_lru() */
956 rte_table_hash_lookup_key8_lru_dosig(
958 struct rte_mbuf **pkts,
960 uint64_t *lookup_hit_mask,
963 struct rte_table_hash *f = (struct rte_table_hash *) table;
964 struct rte_bucket_4_8 *bucket10, *bucket11, *bucket20, *bucket21;
965 struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
966 uint32_t pkt00_index, pkt01_index, pkt10_index;
967 uint32_t pkt11_index, pkt20_index, pkt21_index;
968 uint64_t pkts_mask_out = 0;
970 /* Cannot run the pipeline with less than 5 packets */
971 if (__builtin_popcountll(pkts_mask) < 5) {
972 for ( ; pkts_mask; ) {
973 struct rte_bucket_4_8 *bucket;
974 struct rte_mbuf *mbuf;
977 lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
978 lookup1_stage1_dosig(mbuf, bucket, f);
979 lookup1_stage2_lru(pkt_index, mbuf, bucket,
980 pkts_mask_out, entries, f);
983 *lookup_hit_mask = pkts_mask_out;
991 /* Pipeline stage 0 */
992 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
998 pkt10_index = pkt00_index;
999 pkt11_index = pkt01_index;
1001 /* Pipeline stage 0 */
1002 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1005 /* Pipeline stage 1 */
1006 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1012 for ( ; pkts_mask; ) {
1014 bucket20 = bucket10;
1015 bucket21 = bucket11;
1020 pkt20_index = pkt10_index;
1021 pkt21_index = pkt11_index;
1022 pkt10_index = pkt00_index;
1023 pkt11_index = pkt01_index;
1025 /* Pipeline stage 0 */
1026 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
1027 mbuf00, mbuf01, pkts, pkts_mask);
1029 /* Pipeline stage 1 */
1030 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1032 /* Pipeline stage 2 */
1033 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
1034 bucket20, bucket21, pkts_mask_out, entries, f);
1042 bucket20 = bucket10;
1043 bucket21 = bucket11;
1048 pkt20_index = pkt10_index;
1049 pkt21_index = pkt11_index;
1050 pkt10_index = pkt00_index;
1051 pkt11_index = pkt01_index;
1053 /* Pipeline stage 1 */
1054 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1056 /* Pipeline stage 2 */
1057 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
1058 bucket20, bucket21, pkts_mask_out, entries, f);
1061 bucket20 = bucket10;
1062 bucket21 = bucket11;
1065 pkt20_index = pkt10_index;
1066 pkt21_index = pkt11_index;
1068 /* Pipeline stage 2 */
1069 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
1070 bucket20, bucket21, pkts_mask_out, entries, f);
1072 *lookup_hit_mask = pkts_mask_out;
1074 } /* rte_table_hash_lookup_key8_lru_dosig() */
1077 rte_table_hash_lookup_key8_ext(
1079 struct rte_mbuf **pkts,
1081 uint64_t *lookup_hit_mask,
1084 struct rte_table_hash *f = (struct rte_table_hash *) table;
1085 struct rte_bucket_4_8 *bucket10, *bucket11, *bucket20, *bucket21;
1086 struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
1087 uint32_t pkt00_index, pkt01_index, pkt10_index;
1088 uint32_t pkt11_index, pkt20_index, pkt21_index;
1089 uint64_t pkts_mask_out = 0, buckets_mask = 0;
1090 struct rte_bucket_4_8 *buckets[RTE_PORT_IN_BURST_SIZE_MAX];
1091 uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX];
1093 /* Cannot run the pipeline with less than 5 packets */
1094 if (__builtin_popcountll(pkts_mask) < 5) {
1095 for ( ; pkts_mask; ) {
1096 struct rte_bucket_4_8 *bucket;
1097 struct rte_mbuf *mbuf;
1100 lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
1101 lookup1_stage1(mbuf, bucket, f);
1102 lookup1_stage2_ext(pkt_index, mbuf, bucket,
1103 pkts_mask_out, entries, buckets_mask, buckets,
1107 *lookup_hit_mask = pkts_mask_out;
1115 /* Pipeline stage 0 */
1116 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1122 pkt10_index = pkt00_index;
1123 pkt11_index = pkt01_index;
1125 /* Pipeline stage 0 */
1126 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1129 /* Pipeline stage 1 */
1130 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1136 for ( ; pkts_mask; ) {
1138 bucket20 = bucket10;
1139 bucket21 = bucket11;
1144 pkt20_index = pkt10_index;
1145 pkt21_index = pkt11_index;
1146 pkt10_index = pkt00_index;
1147 pkt11_index = pkt01_index;
1149 /* Pipeline stage 0 */
1150 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
1151 mbuf00, mbuf01, pkts, pkts_mask);
1153 /* Pipeline stage 1 */
1154 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1156 /* Pipeline stage 2 */
1157 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1158 bucket20, bucket21, pkts_mask_out, entries,
1159 buckets_mask, buckets, keys, f);
1167 bucket20 = bucket10;
1168 bucket21 = bucket11;
1173 pkt20_index = pkt10_index;
1174 pkt21_index = pkt11_index;
1175 pkt10_index = pkt00_index;
1176 pkt11_index = pkt01_index;
1178 /* Pipeline stage 1 */
1179 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1181 /* Pipeline stage 2 */
1182 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1183 bucket20, bucket21, pkts_mask_out, entries,
1184 buckets_mask, buckets, keys, f);
1187 bucket20 = bucket10;
1188 bucket21 = bucket11;
1191 pkt20_index = pkt10_index;
1192 pkt21_index = pkt11_index;
1194 /* Pipeline stage 2 */
1195 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1196 bucket20, bucket21, pkts_mask_out, entries,
1197 buckets_mask, buckets, keys, f);
1199 /* Grind next buckets */
1200 for ( ; buckets_mask; ) {
1201 uint64_t buckets_mask_next = 0;
1203 for ( ; buckets_mask; ) {
1207 pkt_index = __builtin_ctzll(buckets_mask);
1208 pkt_mask = 1LLU << pkt_index;
1209 buckets_mask &= ~pkt_mask;
1211 lookup_grinder(pkt_index, buckets, keys, pkts_mask_out,
1212 entries, buckets_mask_next, f);
1215 buckets_mask = buckets_mask_next;
1218 *lookup_hit_mask = pkts_mask_out;
1220 } /* rte_table_hash_lookup_key8_ext() */
1223 rte_table_hash_lookup_key8_ext_dosig(
1225 struct rte_mbuf **pkts,
1227 uint64_t *lookup_hit_mask,
1230 struct rte_table_hash *f = (struct rte_table_hash *) table;
1231 struct rte_bucket_4_8 *bucket10, *bucket11, *bucket20, *bucket21;
1232 struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
1233 uint32_t pkt00_index, pkt01_index, pkt10_index;
1234 uint32_t pkt11_index, pkt20_index, pkt21_index;
1235 uint64_t pkts_mask_out = 0, buckets_mask = 0;
1236 struct rte_bucket_4_8 *buckets[RTE_PORT_IN_BURST_SIZE_MAX];
1237 uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX];
1239 /* Cannot run the pipeline with less than 5 packets */
1240 if (__builtin_popcountll(pkts_mask) < 5) {
1241 for ( ; pkts_mask; ) {
1242 struct rte_bucket_4_8 *bucket;
1243 struct rte_mbuf *mbuf;
1246 lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
1247 lookup1_stage1_dosig(mbuf, bucket, f);
1248 lookup1_stage2_ext(pkt_index, mbuf, bucket,
1249 pkts_mask_out, entries, buckets_mask,
1253 *lookup_hit_mask = pkts_mask_out;
1261 /* Pipeline stage 0 */
1262 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1268 pkt10_index = pkt00_index;
1269 pkt11_index = pkt01_index;
1271 /* Pipeline stage 0 */
1272 lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1275 /* Pipeline stage 1 */
1276 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1282 for ( ; pkts_mask; ) {
1284 bucket20 = bucket10;
1285 bucket21 = bucket11;
1290 pkt20_index = pkt10_index;
1291 pkt21_index = pkt11_index;
1292 pkt10_index = pkt00_index;
1293 pkt11_index = pkt01_index;
1295 /* Pipeline stage 0 */
1296 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
1297 mbuf00, mbuf01, pkts, pkts_mask);
1299 /* Pipeline stage 1 */
1300 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1302 /* Pipeline stage 2 */
1303 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1304 bucket20, bucket21, pkts_mask_out, entries,
1305 buckets_mask, buckets, keys, f);
1313 bucket20 = bucket10;
1314 bucket21 = bucket11;
1319 pkt20_index = pkt10_index;
1320 pkt21_index = pkt11_index;
1321 pkt10_index = pkt00_index;
1322 pkt11_index = pkt01_index;
1324 /* Pipeline stage 1 */
1325 lookup2_stage1_dosig(mbuf10, mbuf11, bucket10, bucket11, f);
1327 /* Pipeline stage 2 */
1328 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1329 bucket20, bucket21, pkts_mask_out, entries,
1330 buckets_mask, buckets, keys, f);
1333 bucket20 = bucket10;
1334 bucket21 = bucket11;
1337 pkt20_index = pkt10_index;
1338 pkt21_index = pkt11_index;
1340 /* Pipeline stage 2 */
1341 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1342 bucket20, bucket21, pkts_mask_out, entries,
1343 buckets_mask, buckets, keys, f);
1345 /* Grind next buckets */
1346 for ( ; buckets_mask; ) {
1347 uint64_t buckets_mask_next = 0;
1349 for ( ; buckets_mask; ) {
1353 pkt_index = __builtin_ctzll(buckets_mask);
1354 pkt_mask = 1LLU << pkt_index;
1355 buckets_mask &= ~pkt_mask;
1357 lookup_grinder(pkt_index, buckets, keys, pkts_mask_out,
1358 entries, buckets_mask_next, f);
1361 buckets_mask = buckets_mask_next;
1364 *lookup_hit_mask = pkts_mask_out;
1366 } /* rte_table_hash_lookup_key8_dosig_ext() */
1368 struct rte_table_ops rte_table_hash_key8_lru_ops = {
1369 .f_create = rte_table_hash_create_key8_lru,
1370 .f_free = rte_table_hash_free_key8_lru,
1371 .f_add = rte_table_hash_entry_add_key8_lru,
1372 .f_delete = rte_table_hash_entry_delete_key8_lru,
1373 .f_lookup = rte_table_hash_lookup_key8_lru,
1376 struct rte_table_ops rte_table_hash_key8_lru_dosig_ops = {
1377 .f_create = rte_table_hash_create_key8_lru,
1378 .f_free = rte_table_hash_free_key8_lru,
1379 .f_add = rte_table_hash_entry_add_key8_lru,
1380 .f_delete = rte_table_hash_entry_delete_key8_lru,
1381 .f_lookup = rte_table_hash_lookup_key8_lru_dosig,
1384 struct rte_table_ops rte_table_hash_key8_ext_ops = {
1385 .f_create = rte_table_hash_create_key8_ext,
1386 .f_free = rte_table_hash_free_key8_ext,
1387 .f_add = rte_table_hash_entry_add_key8_ext,
1388 .f_delete = rte_table_hash_entry_delete_key8_ext,
1389 .f_lookup = rte_table_hash_lookup_key8_ext,
1392 struct rte_table_ops rte_table_hash_key8_ext_dosig_ops = {
1393 .f_create = rte_table_hash_create_key8_ext,
1394 .f_free = rte_table_hash_free_key8_ext,
1395 .f_add = rte_table_hash_entry_add_key8_ext,
1396 .f_delete = rte_table_hash_entry_delete_key8_ext,
1397 .f_lookup = rte_table_hash_lookup_key8_ext_dosig,