120 	struct rte_rib6_node *node, *node1;  in test_insert_invalid()  local
129 	node = rte_rib6_insert(NULL, ip, depth);  in test_insert_invalid()
130 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
138 	node = rte_rib6_insert(rib, ip, MAX_DEPTH + 1);  in test_insert_invalid()
139 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
143 	node = rte_rib6_insert(rib, ip, depth);  in test_insert_invalid()
144 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_insert_invalid()
163 	struct rte_rib6_node *node;  in test_get_fn()  local
181 	node = rte_rib6_insert(rib, ip, depth);  in test_get_fn()
182 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_get_fn()
188 	ret = rte_rib6_get_ip(node, NULL);  in test_get_fn()
196 	ret = rte_rib6_get_depth(node, NULL);  in test_get_fn()
209 	ret = rte_rib6_get_nh(node, NULL);  in test_get_fn()
219 	ret = rte_rib6_get_ip(node, ip_ret);  in test_get_fn()
222 	ret = rte_rib6_get_depth(node, &depth_ret);  in test_get_fn()
225 	ret = rte_rib6_set_nh(node, nh_set);  in test_get_fn()
228 	ret = rte_rib6_get_nh(node, &nh_ret);  in test_get_fn()
244 	struct rte_rib6_node *node;  in test_basic()  local
260 	node = rte_rib6_insert(rib, ip, depth);  in test_basic()
261 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_basic()
263 	status = rte_rib6_set_nh(node, next_hop_add);  in test_basic()
267 	node = rte_rib6_lookup(rib, ip);  in test_basic()
268 	RTE_TEST_ASSERT(node != NULL, "Failed to lookup\n");  in test_basic()
270 	status = rte_rib6_get_nh(node, &next_hop_return);  in test_basic()
274 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
275 	RTE_TEST_ASSERT(node != NULL,  in test_basic()
278 	status = rte_rib6_get_nh(node, &next_hop_return);  in test_basic()
284 	node = rte_rib6_lookup(rib, ip);  in test_basic()
285 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
287 	node = rte_rib6_lookup_exact(rib, ip, depth);  in test_basic()
288 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
300 	struct rte_rib6_node *node;  in test_tree_traversal()  local
317 	node = rte_rib6_insert(rib, ip1, depth);  in test_tree_traversal()
318 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
319 	node = rte_rib6_insert(rib, ip2, depth);  in test_tree_traversal()
320 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
322 	node = NULL;  in test_tree_traversal()
323 	node = rte_rib6_get_nxt(rib, ip, 32, node, RTE_RIB6_GET_NXT_ALL);  in test_tree_traversal()
324 	RTE_TEST_ASSERT(node != NULL, "Failed to get rib_node\n");  in test_tree_traversal()