34 					struct rte_node *node, void **objs,
38 				  struct rte_node *node, void **objs,
42 				  struct rte_node *node, void **objs,
46 				  struct rte_node *node, void **objs,
50 				  struct rte_node *node, void **objs,
94 	struct test_node_register node;  member
104 			.node = {
115 			.node = {
124 			.node = {
133 			.node = {
144 node_init(const struct rte_graph *graph, struct rte_node *node)  in node_init()  argument
147 	*(uint32_t *)node->ctx = node->id;  in node_init()
170 test_node_worker_source(struct rte_graph *graph, struct rte_node *node,  in test_node_worker_source()  argument
186 	next_stream = rte_node_next_stream_get(graph, node, next, obj_node0);  in test_node_worker_source()
194 	rte_node_next_stream_put(graph, node, next, obj_node0);  in test_node_worker_source()
199 	next_stream = rte_node_next_stream_get(graph, node, next, obj_node1);  in test_node_worker_source()
208 	rte_node_next_stream_put(graph, node, next, obj_node1);  in test_node_worker_source()
215 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node0_worker()  argument
220 	if (*(uint32_t *)node->ctx == test_node0.id) {  in test_node0_worker()
267 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[1][0],  in test_node0_worker()
280 		rte_node_enqueue(graph, node, 1, (void **)&mbuf_p[1][obj_node0],  in test_node0_worker()
283 	} else if (*(uint32_t *)node->ctx == tm->test_node[1].idx) {  in test_node0_worker()
284 		test_node1_worker(graph, node, objs, nb_objs);  in test_node0_worker()
285 	} else if (*(uint32_t *)node->ctx == tm->test_node[2].idx) {  in test_node0_worker()
286 		test_node2_worker(graph, node, objs, nb_objs);  in test_node0_worker()
287 	} else if (*(uint32_t *)node->ctx == tm->test_node[3].idx) {  in test_node0_worker()
288 		test_node3_worker(graph, node, objs, nb_objs);  in test_node0_worker()
298 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node1_worker()  argument
345 	rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[2][0], obj_node0);  in test_node1_worker()
352 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node2_worker()  argument
399 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[3][0],  in test_node2_worker()
408 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs,  in test_node3_worker()  argument
459 		rte_node_enqueue(graph, node, 0, (void **)&mbuf_p[4][0],  in test_node3_worker()
498 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
500 			       tm->test_node[i].node.name,  in test_lookup_functions()
501 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
512 		if (count != tm->test_node[i].node.nb_edges * sizeof(char *)) {  in test_lookup_functions()
514 			       tm->test_node[i].node.name,  in test_lookup_functions()
515 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
520 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
522 			       tm->test_node[i].node.name,  in test_lookup_functions()
523 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
530 				   tm->test_node[i].node.next_nodes[j]) != 0) {  in test_lookup_functions()
532 				       tm->test_node[i].node.next_nodes[j],  in test_lookup_functions()
569 			rte_node_clone(node_id, tm->test_node[i].node.name);  in test_node_clone()
596 				     tm->test_node[0].node.next_nodes,  in test_update_edges()
597 				     tm->test_node[0].node.nb_edges);  in test_update_edges()
598 	if (count != tm->test_node[0].node.nb_edges) {  in test_update_edges()
600 		       tm->test_node[0].node.nb_edges, count);  in test_update_edges()
606 					     tm->test_node[i].node.next_nodes,  in test_update_edges()
607 					     tm->test_node[i].node.nb_edges);  in test_update_edges()
608 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()
610 			       tm->test_node[i].node.nb_edges, count);  in test_update_edges()
615 					     tm->test_node[i].node.nb_edges);  in test_update_edges()
616 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()
778 	struct rte_node *node;  in test_graph_model_mcore_dispatch_node_lcore_affinity_set()  local
788 	node = rte_graph_node_get(cloned_graph_id, nid);  in test_graph_model_mcore_dispatch_node_lcore_affinity_set()
790 	if (node->dispatch.lcore_id != worker_lcore) {  in test_graph_model_mcore_dispatch_node_lcore_affinity_set()
893 	struct rte_node *node;  in test_graph_lookup_functions()  local
897 		node = rte_graph_node_get(graph_id, tm->test_node[i].idx);  in test_graph_lookup_functions()
898 		if (!node) {  in test_graph_lookup_functions()
904 		if (tm->test_node[i].idx != node->id) {  in test_graph_lookup_functions()
906 			       tm->test_node[i].idx, node->id);  in test_graph_lookup_functions()
910 		if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) {  in test_graph_lookup_functions()
912 			       node_names[i], node->name);  in test_graph_lookup_functions()
918 		node = rte_graph_node_get_by_name("worker0", node_names[i]);  in test_graph_lookup_functions()
919 		if (!node) {  in test_graph_lookup_functions()
925 		if (tm->test_node[i].idx != node->id) {  in test_graph_lookup_functions()
927 			       tm->test_node[i].idx, node->id);  in test_graph_lookup_functions()
931 		if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) {  in test_graph_lookup_functions()
933 			       node_names[i], node->name);  in test_graph_lookup_functions()