119 	struct rte_rib_node *node, *node1;  in test_insert_invalid()  local
128 	node = rte_rib_insert(NULL, ip, depth);  in test_insert_invalid()
129 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
137 	node = rte_rib_insert(rib, ip, MAX_DEPTH + 1);  in test_insert_invalid()
138 	RTE_TEST_ASSERT(node == NULL,  in test_insert_invalid()
142 	node = rte_rib_insert(rib, ip, depth);  in test_insert_invalid()
143 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_insert_invalid()
162 	struct rte_rib_node *node;  in test_get_fn()  local
179 	node = rte_rib_insert(rib, ip, depth);  in test_get_fn()
180 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_get_fn()
186 	ret = rte_rib_get_ip(node, NULL);  in test_get_fn()
194 	ret = rte_rib_get_depth(node, NULL);  in test_get_fn()
207 	ret = rte_rib_get_nh(node, NULL);  in test_get_fn()
217 	ret = rte_rib_get_ip(node, &ip_ret);  in test_get_fn()
220 	ret = rte_rib_get_depth(node, &depth_ret);  in test_get_fn()
223 	ret = rte_rib_set_nh(node, nh_set);  in test_get_fn()
226 	ret = rte_rib_get_nh(node, &nh_ret);  in test_get_fn()
242 	struct rte_rib_node *node;  in test_basic()  local
257 	node = rte_rib_insert(rib, ip, depth);  in test_basic()
258 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_basic()
260 	ret = rte_rib_set_nh(node, next_hop_add);  in test_basic()
264 	node = rte_rib_lookup(rib, ip);  in test_basic()
265 	RTE_TEST_ASSERT(node != NULL, "Failed to lookup\n");  in test_basic()
267 	ret = rte_rib_get_nh(node, &next_hop_return);  in test_basic()
271 	node = rte_rib_lookup_exact(rib, ip, depth);  in test_basic()
272 	RTE_TEST_ASSERT(node != NULL,  in test_basic()
275 	ret = rte_rib_get_nh(node, &next_hop_return);  in test_basic()
281 	node = rte_rib_lookup(rib, ip);  in test_basic()
282 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
284 	node = rte_rib_lookup_exact(rib, ip, depth);  in test_basic()
285 	RTE_TEST_ASSERT(node == NULL,  in test_basic()
297 	struct rte_rib_node *node;  in test_tree_traversal()  local
310 	node = rte_rib_insert(rib, ip1, depth);  in test_tree_traversal()
311 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
313 	node = rte_rib_insert(rib, ip2, depth);  in test_tree_traversal()
314 	RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");  in test_tree_traversal()
316 	node = NULL;  in test_tree_traversal()
317 	node = rte_rib_get_nxt(rib, RTE_IPV4(10, 10, 130, 0), 24, node,  in test_tree_traversal()
319 	RTE_TEST_ASSERT(node != NULL, "Failed to get rib_node\n");  in test_tree_traversal()