33 					struct rte_node *node, void **objs,
37 				  struct rte_node *node, void **objs,
41 				  struct rte_node *node, void **objs,
45 				  struct rte_node *node, void **objs,
49 				  struct rte_node *node, void **objs,
93 	struct test_node_register node;  member
103 			.node = {
114 			.node = {
123 			.node = {
132 			.node = {
143 node_init(const struct rte_graph *graph, struct rte_node *node)  in node_init()  argument
146 	*(uint32_t *)node->ctx = node->id;  in node_init()
169 test_node_worker_source(struct rte_graph *graph, struct rte_node *node,  in test_node_worker_source()  argument
185 	next_stream = rte_node_next_stream_get(graph, node, next, obj_node0);  in test_node_worker_source()
193 	rte_node_next_stream_put(graph, node, next, obj_node0);  in test_node_worker_source()
198 	next_stream = rte_node_next_stream_get(graph, node, next, obj_node1);  in test_node_worker_source()
207 	rte_node_next_stream_put(graph, node, next, obj_node1);  in test_node_worker_source()
214 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node0_worker()  argument
219 	if (*(uint32_t *)node->ctx == test_node0.id) {  in test_node0_worker()
266 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[1][0],  in test_node0_worker()
279 		rte_node_enqueue(graph, node, 1, (void **)&mbuf_p[1][obj_node0],  in test_node0_worker()
282 	} else if (*(uint32_t *)node->ctx == tm->test_node[1].idx) {  in test_node0_worker()
283 		test_node1_worker(graph, node, objs, nb_objs);  in test_node0_worker()
284 	} else if (*(uint32_t *)node->ctx == tm->test_node[2].idx) {  in test_node0_worker()
285 		test_node2_worker(graph, node, objs, nb_objs);  in test_node0_worker()
286 	} else if (*(uint32_t *)node->ctx == tm->test_node[3].idx) {  in test_node0_worker()
287 		test_node3_worker(graph, node, objs, nb_objs);  in test_node0_worker()
297 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node1_worker()  argument
344 	rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[2][0], obj_node0);  in test_node1_worker()
351 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node2_worker()  argument
398 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[3][0],  in test_node2_worker()
407 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node3_worker()  argument
458 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[4][0],  in test_node3_worker()
497 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
499 			       tm->test_node[i].node.name,  in test_lookup_functions()
500 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
511 		if (count != tm->test_node[i].node.nb_edges * sizeof(char *)) {  in test_lookup_functions()
513 			       tm->test_node[i].node.name,  in test_lookup_functions()
514 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
519 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
521 			       tm->test_node[i].node.name,  in test_lookup_functions()
522 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
529 				   tm->test_node[i].node.next_nodes[j]) != 0) {  in test_lookup_functions()
531 				       tm->test_node[i].node.next_nodes[j],  in test_lookup_functions()
568 			rte_node_clone(node_id, tm->test_node[i].node.name);  in test_node_clone()
595 				     tm->test_node[0].node.next_nodes,  in test_update_edges()
596 				     tm->test_node[0].node.nb_edges);  in test_update_edges()
597 	if (count != tm->test_node[0].node.nb_edges) {  in test_update_edges()
599 		       tm->test_node[0].node.nb_edges, count);  in test_update_edges()
605 					     tm->test_node[i].node.next_nodes,  in test_update_edges()
606 					     tm->test_node[i].node.nb_edges);  in test_update_edges()
607 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()
609 			       tm->test_node[i].node.nb_edges, count);  in test_update_edges()
614 					     tm->test_node[i].node.nb_edges);  in test_update_edges()
615 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()
683 	struct rte_node *node;  in test_graph_lookup_functions()  local
687 		node = rte_graph_node_get(graph_id, tm->test_node[i].idx);  in test_graph_lookup_functions()
688 		if (!node) {  in test_graph_lookup_functions()
694 		if (tm->test_node[i].idx != node->id) {  in test_graph_lookup_functions()
696 			       tm->test_node[i].idx, node->id);  in test_graph_lookup_functions()
700 		if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) {  in test_graph_lookup_functions()
702 			       node_names[i], node->name);  in test_graph_lookup_functions()
708 		node = rte_graph_node_get_by_name("worker0", node_names[i]);  in test_graph_lookup_functions()
709 		if (!node) {  in test_graph_lookup_functions()
715 		if (tm->test_node[i].idx != node->id) {  in test_graph_lookup_functions()
717 			       tm->test_node[i].idx, node->id);  in test_graph_lookup_functions()
721 		if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) {  in test_graph_lookup_functions()
723 			       node_names[i], node->name);  in test_graph_lookup_functions()