Home
last modified time | relevance | path

Searched refs:RTE_RIB6_IPV6_ADDR_SIZE (Results 1 – 3 of 3) sorted by relevance

/f-stack/dpdk/lib/librte_rib/
H A Drte_rib6.h28 #define RTE_RIB6_IPV6_ADDR_SIZE 16 macro
68 rte_memcpy(dst, src, RTE_RIB6_IPV6_ADDR_SIZE); in rte_rib6_copy_addr()
89 for (i = 0; i < RTE_RIB6_IPV6_ADDR_SIZE; i++) { in rte_rib6_is_equal()
132 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE]);
164 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
192 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE],
208 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
226 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
242 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE]);
H A Drte_rib6.c36 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE];
72 for (i = 0; i < RTE_RIB6_IPV6_ADDR_SIZE; i++) in is_covered()
94 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE]) in get_nxt_node() argument
121 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE]) in rte_rib6_lookup() argument
160 uint8_t tmp_ip[RTE_RIB6_IPV6_ADDR_SIZE]; in rte_rib6_lookup_exact()
169 for (i = 0; i < RTE_RIB6_IPV6_ADDR_SIZE; i++) in rte_rib6_lookup_exact()
195 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], in rte_rib6_get_nxt() argument
199 uint8_t tmp_ip[RTE_RIB6_IPV6_ADDR_SIZE]; in rte_rib6_get_nxt()
207 for (i = 0; i < RTE_RIB6_IPV6_ADDR_SIZE; i++) in rte_rib6_get_nxt()
281 uint8_t tmp_ip[RTE_RIB6_IPV6_ADDR_SIZE]; in rte_rib6_insert()
[all …]
/f-stack/dpdk/app/test/
H A Dtest_rib6.c122 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {0}; in test_insert_invalid()
166 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {192, 0, 2, 0, 0, 0, 0, 0, in test_get_fn()
168 uint8_t ip_ret[RTE_RIB6_IPV6_ADDR_SIZE]; in test_get_fn()
247 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {192, 0, 2, 0, 0, 0, 0, 0, in test_basic()
303 uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 130, 0, 0, 0, 0, in test_tree_traversal()
305 uint8_t ip1[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 0, 0, 0, 0, 0, in test_tree_traversal()
307 uint8_t ip2[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 130, 0, 0, 0, 0, in test_tree_traversal()