137 	struct rte_rib6_node *node, *node1;  in test_insert_invalid()  local
146 	node = rte_rib6_insert(NULL, ip, depth);  in test_insert_invalid()
147 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
155 	node = rte_rib6_insert(rib, ip, MAX_DEPTH + 1);  in test_insert_invalid()
156 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
160 	node = rte_rib6_insert(rib, ip, depth);  in test_insert_invalid()
161 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_insert_invalid()
180 	struct rte_rib6_node *node;  in test_get_fn()  local
198 	node = rte_rib6_insert(rib, ip, depth);  in test_get_fn()
199 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_get_fn()
205 	ret = rte_rib6_get_ip(node, NULL);  in test_get_fn()
213 	ret = rte_rib6_get_depth(node, NULL);  in test_get_fn()
226 	ret = rte_rib6_get_nh(node, NULL);  in test_get_fn()
236 	ret = rte_rib6_get_ip(node, ip_ret);  in test_get_fn()
239 	ret = rte_rib6_get_depth(node, &depth_ret);  in test_get_fn()
242 	ret = rte_rib6_set_nh(node, nh_set);  in test_get_fn()
245 	ret = rte_rib6_get_nh(node, &nh_ret);  in test_get_fn()
261 	struct rte_rib6_node *node;  in test_basic()  local
277 	node = rte_rib6_insert(rib, ip, depth);  in test_basic()
278 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_basic()
280 	status = rte_rib6_set_nh(node, next_hop_add);  in test_basic()
284 	node = rte_rib6_lookup(rib, ip);  in test_basic()
285 	RTE_TEST_ASSERT(node != NULL, "Failed to lookup\n");  in test_basic()
287 	status = rte_rib6_get_nh(node, &next_hop_return);  in test_basic()
291 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
292 	RTE_TEST_ASSERT(node != NULL,  in test_basic()
295 	status = rte_rib6_get_nh(node, &next_hop_return);  in test_basic()
301 	node = rte_rib6_lookup(rib, ip);  in test_basic()
302 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
304 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
305 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
317 	struct rte_rib6_node *node;  in test_tree_traversal()  local
334 	node = rte_rib6_insert(rib, ip1, depth);  in test_tree_traversal()
335 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
336 	node = rte_rib6_insert(rib, ip2, depth);  in test_tree_traversal()
337 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
339 	node = NULL;  in test_tree_traversal()
340 	node = rte_rib6_get_nxt(rib, ip, 32, node, RTE_RIB6_GET_NXT_ALL);  in test_tree_traversal()
341 	RTE_TEST_ASSERT(node != NULL, "Failed to get rib_node\n");  in test_tree_traversal()