136 	struct rte_rib_node *node, *node1;  in test_insert_invalid()  local
145 	node = rte_rib_insert(NULL, ip, depth);  in test_insert_invalid()
146 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
154 	node = rte_rib_insert(rib, ip, MAX_DEPTH + 1);  in test_insert_invalid()
155 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
159 	node = rte_rib_insert(rib, ip, depth);  in test_insert_invalid()
160 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_insert_invalid()
179 	struct rte_rib_node *node;  in test_get_fn()  local
196 	node = rte_rib_insert(rib, ip, depth);  in test_get_fn()
197 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_get_fn()
203 	ret = rte_rib_get_ip(node, NULL);  in test_get_fn()
211 	ret = rte_rib_get_depth(node, NULL);  in test_get_fn()
224 	ret = rte_rib_get_nh(node, NULL);  in test_get_fn()
234 	ret = rte_rib_get_ip(node, &ip_ret);  in test_get_fn()
237 	ret = rte_rib_get_depth(node, &depth_ret);  in test_get_fn()
240 	ret = rte_rib_set_nh(node, nh_set);  in test_get_fn()
243 	ret = rte_rib_get_nh(node, &nh_ret);  in test_get_fn()
259 	struct rte_rib_node *node;  in test_basic()  local
274 	node = rte_rib_insert(rib, ip, depth);  in test_basic()
275 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_basic()
277 	ret = rte_rib_set_nh(node, next_hop_add);  in test_basic()
281 	node = rte_rib_lookup(rib, ip);  in test_basic()
282 	RTE_TEST_ASSERT(node != NULL, "Failed to lookup\n");  in test_basic()
284 	ret = rte_rib_get_nh(node, &next_hop_return);  in test_basic()
288 	node = rte_rib_lookup_exact(rib, ip, depth);  in test_basic()
289 	RTE_TEST_ASSERT(node != NULL,  in test_basic()
292 	ret = rte_rib_get_nh(node, &next_hop_return);  in test_basic()
298 	node = rte_rib_lookup(rib, ip);  in test_basic()
299 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
301 	node = rte_rib_lookup_exact(rib, ip, depth);  in test_basic()
302 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
314 	struct rte_rib_node *node;  in test_tree_traversal()  local
327 	node = rte_rib_insert(rib, ip1, depth);  in test_tree_traversal()
328 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
330 	node = rte_rib_insert(rib, ip2, depth);  in test_tree_traversal()
331 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
333 	node = NULL;  in test_tree_traversal()
334 	node = rte_rib_get_nxt(rib, RTE_IPV4(10, 10, 130, 0), 24, node,  in test_tree_traversal()
336 	RTE_TEST_ASSERT(node != NULL, "Failed to get rib_node\n");  in test_tree_traversal()