1 /* SPDX-License-Identifier: BSD-3-Clause 2 * Copyright(c) 2010-2014 Intel Corporation 3 */ 4 5 #include <stdio.h> 6 #include <stdint.h> 7 #include <stdlib.h> 8 #include <string.h> 9 10 #include <rte_cycles.h> 11 #include <rte_random.h> 12 #include <rte_memory.h> 13 #include <rte_fib6.h> 14 15 #include "test.h" 16 17 #include "test_lpm6_data.h" 18 19 #define TEST_FIB_ASSERT(cond) do { \ 20 if (!(cond)) { \ 21 printf("Error at line %d:\n", __LINE__); \ 22 return -1; \ 23 } \ 24 } while (0) 25 26 #define ITERATIONS (1 << 10) 27 #define BATCH_SIZE 100000 28 #define NUMBER_TBL8S (1 << 16) 29 30 static void 31 print_route_distribution(const struct rules_tbl_entry *table, uint32_t n) 32 { 33 unsigned int i, j; 34 35 printf("Route distribution per prefix width:\n"); 36 printf("DEPTH QUANTITY (PERCENT)\n"); 37 printf("---------------------------\n"); 38 39 /* Count depths. */ 40 for (i = 1; i <= 128; i++) { 41 unsigned int depth_counter = 0; 42 double percent_hits; 43 44 for (j = 0; j < n; j++) 45 if (table[j].depth == (uint8_t) i) 46 depth_counter++; 47 48 percent_hits = ((double)depth_counter)/((double)n) * 100; 49 printf("%.2u%15u (%.2f)\n", i, depth_counter, percent_hits); 50 } 51 printf("\n"); 52 } 53 54 static inline uint8_t 55 bits_in_nh(uint8_t nh_sz) 56 { 57 return 8 * (1 << nh_sz); 58 } 59 60 static inline uint64_t 61 get_max_nh(uint8_t nh_sz) 62 { 63 return ((1ULL << (bits_in_nh(nh_sz) - 1)) - 1); 64 } 65 66 static int 67 test_fib6_perf(void) 68 { 69 struct rte_fib6 *fib = NULL; 70 struct rte_fib6_conf conf; 71 uint64_t begin, total_time; 72 unsigned int i, j; 73 uint64_t next_hop_add; 74 int status = 0; 75 int64_t count = 0; 76 struct rte_ipv6_addr ip_batch[NUM_IPS_ENTRIES]; 77 uint64_t next_hops[NUM_IPS_ENTRIES]; 78 79 conf.type = RTE_FIB6_TRIE; 80 conf.default_nh = 0; 81 conf.max_routes = 1000000; 82 conf.rib_ext_sz = 0; 83 conf.trie.nh_sz = RTE_FIB6_TRIE_4B; 84 conf.trie.num_tbl8 = RTE_MIN(get_max_nh(conf.trie.nh_sz), 1000000U); 85 86 printf("No. routes = %u\n", (unsigned int) NUM_ROUTE_ENTRIES); 87 88 print_route_distribution(large_route_table, 89 (uint32_t)NUM_ROUTE_ENTRIES); 90 91 /* Only generate IPv6 address of each item in large IPS table, 92 * here next_hop is not needed. 93 */ 94 generate_large_ips_table(0); 95 96 fib = rte_fib6_create(__func__, SOCKET_ID_ANY, &conf); 97 TEST_FIB_ASSERT(fib != NULL); 98 99 /* Measure add. */ 100 begin = rte_rdtsc(); 101 102 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { 103 next_hop_add = (i & ((1 << 14) - 1)) + 1; 104 if (rte_fib6_add(fib, &large_route_table[i].ip, 105 large_route_table[i].depth, next_hop_add) == 0) 106 status++; 107 } 108 /* End Timer. */ 109 total_time = rte_rdtsc() - begin; 110 111 printf("Unique added entries = %d\n", status); 112 printf("Average FIB Add: %g cycles\n", 113 (double)total_time / NUM_ROUTE_ENTRIES); 114 115 /* Measure bulk Lookup */ 116 total_time = 0; 117 count = 0; 118 119 for (i = 0; i < NUM_IPS_ENTRIES; i++) 120 ip_batch[i] = large_ips_table[i].ip; 121 122 for (i = 0; i < ITERATIONS; i++) { 123 124 /* Lookup per batch */ 125 begin = rte_rdtsc(); 126 rte_fib6_lookup_bulk(fib, ip_batch, next_hops, NUM_IPS_ENTRIES); 127 total_time += rte_rdtsc() - begin; 128 129 for (j = 0; j < NUM_IPS_ENTRIES; j++) 130 if (next_hops[j] == 0) 131 count++; 132 } 133 printf("BULK FIB Lookup: %.1f cycles (fails = %.1f%%)\n", 134 (double)total_time / ((double)ITERATIONS * BATCH_SIZE), 135 (count * 100.0) / (double)(ITERATIONS * BATCH_SIZE)); 136 137 /* Delete */ 138 status = 0; 139 begin = rte_rdtsc(); 140 141 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { 142 /* rte_fib_delete(fib, ip, depth) */ 143 status += rte_fib6_delete(fib, &large_route_table[i].ip, 144 large_route_table[i].depth); 145 } 146 147 total_time = rte_rdtsc() - begin; 148 149 printf("Average FIB Delete: %g cycles\n", 150 (double)total_time / NUM_ROUTE_ENTRIES); 151 152 rte_fib6_free(fib); 153 154 return 0; 155 } 156 157 REGISTER_PERF_TEST(fib6_perf_autotest, test_fib6_perf); 158