123 	uint8_t depth = 24;  in test_insert_invalid()  local
129 	node = rte_rib6_insert(NULL, ip, depth);  in test_insert_invalid()
143 	node = rte_rib6_insert(rib, ip, depth);  in test_insert_invalid()
145 	node1 = rte_rib6_insert(rib, ip, depth);  in test_insert_invalid()
171 	uint8_t depth = 24;  in test_get_fn()  local
181 	node = rte_rib6_insert(rib, ip, depth);  in test_get_fn()
223 	RTE_TEST_ASSERT((ret == 0) && (depth_ret == depth),  in test_get_fn()
251 	uint8_t depth = 24;  in test_basic()  local
260 	node = rte_rib6_insert(rib, ip, depth);  in test_basic()
274 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
282 	rte_rib6_remove(rib, ip, depth);  in test_basic()
287 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
309 	uint8_t depth = 126;  in test_tree_traversal()  local
317 	node = rte_rib6_insert(rib, ip1, depth);  in test_tree_traversal()
319 	node = rte_rib6_insert(rib, ip2, depth);  in test_tree_traversal()