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.
35 #include <rte_byteorder.h>
36 #include <rte_table_lpm_ipv6.h>
38 #include <rte_cycles.h>
39 #include "test_table_tables.h"
40 #include "test_table.h"
42 table_test table_tests[] = {
51 #define PREPARE_PACKET(mbuf, value) do { \
52 uint32_t *k32, *signature; \
54 mbuf = rte_pktmbuf_alloc(pool); \
55 signature = RTE_MBUF_METADATA_UINT32_PTR(mbuf, 0); \
56 key = RTE_MBUF_METADATA_UINT8_PTR(mbuf, 32); \
58 k32 = (uint32_t *) key; \
60 *signature = pipeline_test_hash(key, 0, 0); \
63 unsigned n_table_tests = RTE_DIM(table_tests);
65 /* Function prototypes */
67 test_table_hash_lru_generic(struct rte_table_ops *ops);
69 test_table_hash_ext_generic(struct rte_table_ops *ops);
71 struct rte_bucket_4_8 {
75 struct rte_bucket_4_8 *next;
82 #if RTE_TABLE_HASH_LRU_STRATEGY == 3
83 uint64_t shuffles = 0xfffffffdfffbfff9ULL;
85 uint64_t shuffles = 0x0003000200010000ULL;
88 static int test_lru_update(void)
90 struct rte_bucket_4_8 b;
91 struct rte_bucket_4_8 *bucket;
98 printf("---------------------------\n");
99 printf("Testing lru_update macro...\n");
100 printf("---------------------------\n");
103 #if RTE_TABLE_HASH_LRU_STRATEGY == 3
104 bucket->lru_list = 0xFFFFFFFFFFFFFFFFULL;
106 bucket->lru_list = 0x0000000100020003ULL;
109 for (j = 0; j < iterations; j++)
110 for (i = 0; i < 9; i++) {
111 uint32_t idx = i >> 1;
112 lru_update(bucket, idx);
113 pos = lru_pos(bucket);
115 printf("%s: %d lru_list=%016"PRIx64", upd=%d, "
117 __func__, i, bucket->lru_list, i>>1, pos);
120 if (bucket->lru_list != shuffles) {
121 printf("%s: ERROR: %d lru_list=%016"PRIx64", expected %016"
123 __func__, i, bucket->lru_list, shuffles);
126 printf("%s: output checksum of results =%d\n",
130 printf("%s: ERROR output checksum of results =%d expected %d\n",
131 __func__, poss, 126);
138 uint64_t sc_start = rte_rdtsc();
139 iterations = 100000000;
141 for (j = 0; j < iterations; j++) {
142 for (i = 0; i < 4; i++) {
143 lru_update(bucket, i);
144 pos |= bucket->lru_list;
147 uint64_t sc_end = rte_rdtsc();
149 printf("%s: output checksum of results =%llu\n",
150 __func__, (long long unsigned int)pos);
151 printf("%s: start=%016"PRIx64", end=%016"PRIx64"\n",
152 __func__, sc_start, sc_end);
153 printf("\nlru_update: %lu cycles per loop iteration.\n\n",
154 (long unsigned int)((sc_end-sc_start)/(iterations*4)));
161 test_table_stub(void)
164 uint64_t expected_mask = 0, result_mask;
165 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
167 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
170 table = rte_table_stub_ops.f_create(NULL, 0, 1);
175 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
177 PREPARE_PACKET(mbufs[i], 0xadadadad);
179 PREPARE_PACKET(mbufs[i], 0xadadadab);
182 rte_table_stub_ops.f_lookup(table, mbufs, -1,
183 &result_mask, (void **)entries);
184 if (result_mask != expected_mask)
188 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
189 rte_pktmbuf_free(mbufs[i]);
195 test_table_array(void)
198 uint64_t result_mask;
199 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
201 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
207 struct rte_table_array_params array_params;
209 table = rte_table_array_ops.f_create(NULL, 0, 1);
213 array_params.n_entries = 0;
215 table = rte_table_array_ops.f_create(&array_params, 0, 1);
219 array_params.n_entries = 7;
221 table = rte_table_array_ops.f_create(&array_params, 0, 1);
225 array_params.n_entries = 1 << 24;
226 array_params.offset = 1;
228 table = rte_table_array_ops.f_create(&array_params, 0, 1);
232 array_params.offset = 32;
234 table = rte_table_array_ops.f_create(&array_params, 0, 1);
239 status = rte_table_array_ops.f_free(table);
243 status = rte_table_array_ops.f_free(NULL);
248 struct rte_table_array_key array_key_1 = {
251 struct rte_table_array_key array_key_2 = {
257 table = rte_table_array_ops.f_create(&array_params, 0, 1);
261 status = rte_table_array_ops.f_add(NULL, (void *) &array_key_1, &entry1,
262 &key_found, &entry_ptr);
266 status = rte_table_array_ops.f_add(table, (void *) &array_key_1, NULL,
267 &key_found, &entry_ptr);
271 status = rte_table_array_ops.f_add(table, (void *) &array_key_1,
272 &entry1, &key_found, &entry_ptr);
277 status = rte_table_array_ops.f_add(table, (void *) &array_key_2,
278 &entry2, &key_found, &entry_ptr);
282 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
284 PREPARE_PACKET(mbufs[i], 10);
286 PREPARE_PACKET(mbufs[i], 20);
288 rte_table_array_ops.f_lookup(table, mbufs, -1,
289 &result_mask, (void **)entries);
291 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
292 if (i % 2 == 0 && *entries[i] != 'A')
295 if (i % 2 == 1 && *entries[i] != 'B')
299 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
300 rte_pktmbuf_free(mbufs[i]);
302 status = rte_table_array_ops.f_free(table);
311 uint64_t expected_mask = 0, result_mask;
312 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
314 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
318 uint32_t entry_size = 1;
321 struct rte_table_lpm_params lpm_params;
323 table = rte_table_lpm_ops.f_create(NULL, 0, entry_size);
327 lpm_params.n_rules = 0;
329 table = rte_table_lpm_ops.f_create(&lpm_params, 0, entry_size);
333 lpm_params.n_rules = 1 << 24;
334 lpm_params.offset = 1;
336 table = rte_table_lpm_ops.f_create(&lpm_params, 0, entry_size);
340 lpm_params.offset = 32;
341 lpm_params.entry_unique_size = 0;
343 table = rte_table_lpm_ops.f_create(&lpm_params, 0, entry_size);
347 lpm_params.entry_unique_size = entry_size + 1;
349 table = rte_table_lpm_ops.f_create(&lpm_params, 0, entry_size);
353 lpm_params.entry_unique_size = entry_size;
355 table = rte_table_lpm_ops.f_create(&lpm_params, 0, entry_size);
360 status = rte_table_lpm_ops.f_free(table);
364 status = rte_table_lpm_ops.f_free(NULL);
369 struct rte_table_lpm_key lpm_key;
370 lpm_key.ip = 0xadadadad;
372 table = rte_table_lpm_ops.f_create(&lpm_params, 0, 1);
376 status = rte_table_lpm_ops.f_add(NULL, &lpm_key, &entry, &key_found,
381 status = rte_table_lpm_ops.f_add(table, NULL, &entry, &key_found,
386 status = rte_table_lpm_ops.f_add(table, &lpm_key, NULL, &key_found,
392 status = rte_table_lpm_ops.f_add(table, &lpm_key, &entry, &key_found,
398 status = rte_table_lpm_ops.f_add(table, &lpm_key, &entry, &key_found,
404 status = rte_table_lpm_ops.f_add(table, &lpm_key, &entry, &key_found,
410 status = rte_table_lpm_ops.f_delete(NULL, &lpm_key, &key_found, NULL);
414 status = rte_table_lpm_ops.f_delete(table, NULL, &key_found, NULL);
419 status = rte_table_lpm_ops.f_delete(table, &lpm_key, &key_found, NULL);
424 status = rte_table_lpm_ops.f_delete(table, &lpm_key, &key_found, NULL);
429 status = rte_table_lpm_ops.f_delete(table, &lpm_key, &key_found, NULL);
433 status = rte_table_lpm_ops.f_delete(table, &lpm_key, &key_found, NULL);
439 status = rte_table_lpm_ops.f_add(table, &lpm_key, &entry, &key_found,
444 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
446 expected_mask |= (uint64_t)1 << i;
447 PREPARE_PACKET(mbufs[i], 0xadadadad);
449 PREPARE_PACKET(mbufs[i], 0xadadadab);
451 rte_table_lpm_ops.f_lookup(table, mbufs, -1,
452 &result_mask, (void **)entries);
453 if (result_mask != expected_mask)
457 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
458 rte_pktmbuf_free(mbufs[i]);
460 status = rte_table_lpm_ops.f_free(table);
466 test_table_lpm_ipv6(void)
469 uint64_t expected_mask = 0, result_mask;
470 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
472 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
476 uint32_t entry_size = 1;
479 struct rte_table_lpm_ipv6_params lpm_params;
481 table = rte_table_lpm_ipv6_ops.f_create(NULL, 0, entry_size);
485 lpm_params.n_rules = 0;
487 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
491 lpm_params.n_rules = 1 << 24;
492 lpm_params.number_tbl8s = 0;
493 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
497 lpm_params.number_tbl8s = 1 << 21;
498 lpm_params.entry_unique_size = 0;
499 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
503 lpm_params.entry_unique_size = entry_size + 1;
504 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
508 lpm_params.entry_unique_size = entry_size;
509 lpm_params.offset = 32;
511 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
516 status = rte_table_lpm_ipv6_ops.f_free(table);
520 status = rte_table_lpm_ipv6_ops.f_free(NULL);
525 struct rte_table_lpm_ipv6_key lpm_key;
527 lpm_key.ip[0] = 0xad;
528 lpm_key.ip[1] = 0xad;
529 lpm_key.ip[2] = 0xad;
530 lpm_key.ip[3] = 0xad;
532 table = rte_table_lpm_ipv6_ops.f_create(&lpm_params, 0, entry_size);
536 status = rte_table_lpm_ipv6_ops.f_add(NULL, &lpm_key, &entry,
537 &key_found, &entry_ptr);
541 status = rte_table_lpm_ipv6_ops.f_add(table, NULL, &entry, &key_found,
546 status = rte_table_lpm_ipv6_ops.f_add(table, &lpm_key, NULL, &key_found,
552 status = rte_table_lpm_ipv6_ops.f_add(table, &lpm_key, &entry,
553 &key_found, &entry_ptr);
558 status = rte_table_lpm_ipv6_ops.f_add(table, &lpm_key, &entry,
559 &key_found, &entry_ptr);
564 status = rte_table_lpm_ipv6_ops.f_add(table, &lpm_key, &entry,
565 &key_found, &entry_ptr);
570 status = rte_table_lpm_ipv6_ops.f_delete(NULL, &lpm_key, &key_found,
575 status = rte_table_lpm_ipv6_ops.f_delete(table, NULL, &key_found, NULL);
580 status = rte_table_lpm_ipv6_ops.f_delete(table, &lpm_key, &key_found,
586 status = rte_table_lpm_ipv6_ops.f_delete(table, &lpm_key, &key_found,
592 status = rte_table_lpm_ipv6_ops.f_delete(table, &lpm_key, &key_found,
597 status = rte_table_lpm_ipv6_ops.f_delete(table, &lpm_key, &key_found,
604 status = rte_table_lpm_ipv6_ops.f_add(table, &lpm_key, &entry,
605 &key_found, &entry_ptr);
609 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
611 expected_mask |= (uint64_t)1 << i;
612 PREPARE_PACKET(mbufs[i], 0xadadadad);
614 PREPARE_PACKET(mbufs[i], 0xadadadab);
616 rte_table_lpm_ipv6_ops.f_lookup(table, mbufs, -1,
617 &result_mask, (void **)entries);
618 if (result_mask != expected_mask)
622 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
623 rte_pktmbuf_free(mbufs[i]);
625 status = rte_table_lpm_ipv6_ops.f_free(table);
631 test_table_hash_lru_generic(struct rte_table_ops *ops)
634 uint64_t expected_mask = 0, result_mask;
635 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
637 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
643 struct rte_table_hash_key8_lru_params hash_params;
645 hash_params.n_entries = 0;
647 table = ops->f_create(&hash_params, 0, 1);
651 hash_params.n_entries = 1 << 10;
652 hash_params.signature_offset = 1;
654 table = ops->f_create(&hash_params, 0, 1);
658 hash_params.signature_offset = 0;
659 hash_params.key_offset = 1;
661 table = ops->f_create(&hash_params, 0, 1);
665 hash_params.key_offset = 32;
666 hash_params.f_hash = NULL;
668 table = ops->f_create(&hash_params, 0, 1);
672 hash_params.f_hash = pipeline_test_hash;
674 table = ops->f_create(&hash_params, 0, 1);
679 status = ops->f_free(table);
683 status = ops->f_free(NULL);
689 uint32_t *k32 = (uint32_t *) &key;
692 k32[0] = rte_be_to_cpu_32(0xadadadad);
694 table = ops->f_create(&hash_params, 0, 1);
699 status = ops->f_add(table, &key, &entry, &key_found, &entry_ptr);
704 status = ops->f_delete(table, &key, &key_found, NULL);
708 status = ops->f_delete(table, &key, &key_found, NULL);
714 status = ops->f_add(table, &key, &entry, &key_found, &entry_ptr);
718 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
720 expected_mask |= (uint64_t)1 << i;
721 PREPARE_PACKET(mbufs[i], 0xadadadad);
723 PREPARE_PACKET(mbufs[i], 0xadadadab);
725 ops->f_lookup(table, mbufs, -1, &result_mask, (void **)entries);
726 if (result_mask != expected_mask)
730 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
731 rte_pktmbuf_free(mbufs[i]);
733 status = ops->f_free(table);
739 test_table_hash_ext_generic(struct rte_table_ops *ops)
742 uint64_t expected_mask = 0, result_mask;
743 struct rte_mbuf *mbufs[RTE_PORT_IN_BURST_SIZE_MAX];
745 char *entries[RTE_PORT_IN_BURST_SIZE_MAX];
751 struct rte_table_hash_key8_ext_params hash_params;
753 hash_params.n_entries = 0;
755 table = ops->f_create(&hash_params, 0, 1);
759 hash_params.n_entries = 1 << 10;
760 hash_params.n_entries_ext = 0;
761 table = ops->f_create(&hash_params, 0, 1);
765 hash_params.n_entries_ext = 1 << 4;
766 hash_params.signature_offset = 1;
767 table = ops->f_create(&hash_params, 0, 1);
771 hash_params.signature_offset = 0;
772 hash_params.key_offset = 1;
774 table = ops->f_create(&hash_params, 0, 1);
778 hash_params.key_offset = 32;
779 hash_params.f_hash = NULL;
781 table = ops->f_create(&hash_params, 0, 1);
785 hash_params.f_hash = pipeline_test_hash;
787 table = ops->f_create(&hash_params, 0, 1);
792 status = ops->f_free(table);
796 status = ops->f_free(NULL);
802 uint32_t *k32 = (uint32_t *) &key;
805 k32[0] = rte_be_to_cpu_32(0xadadadad);
807 table = ops->f_create(&hash_params, 0, 1);
812 status = ops->f_add(table, &key, &entry, &key_found, &entry_ptr);
817 status = ops->f_delete(table, &key, &key_found, NULL);
821 status = ops->f_delete(table, &key, &key_found, NULL);
827 status = ops->f_add(table, &key, &entry, &key_found, &entry_ptr);
831 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
833 expected_mask |= (uint64_t)1 << i;
834 PREPARE_PACKET(mbufs[i], 0xadadadad);
836 PREPARE_PACKET(mbufs[i], 0xadadadab);
838 ops->f_lookup(table, mbufs, -1, &result_mask, (void **)entries);
839 if (result_mask != expected_mask)
843 for (i = 0; i < RTE_PORT_IN_BURST_SIZE_MAX; i++)
844 rte_pktmbuf_free(mbufs[i]);
846 status = ops->f_free(table);
852 test_table_hash_lru(void)
856 status = test_table_hash_lru_generic(&rte_table_hash_key8_lru_ops);
860 status = test_table_hash_lru_generic(
861 &rte_table_hash_key8_lru_dosig_ops);
865 status = test_table_hash_lru_generic(&rte_table_hash_key16_lru_ops);
869 status = test_table_hash_lru_generic(&rte_table_hash_key32_lru_ops);
873 status = test_lru_update();
881 test_table_hash_ext(void)
885 status = test_table_hash_ext_generic(&rte_table_hash_key8_ext_ops);
889 status = test_table_hash_ext_generic(
890 &rte_table_hash_key8_ext_dosig_ops);
894 status = test_table_hash_ext_generic(&rte_table_hash_key16_ext_ops);
898 status = test_table_hash_ext_generic(&rte_table_hash_key32_ext_ops);