97 	test_node_t test_node[MAX_NODES];  member
101 	.test_node = {
188 		*graph_field(data) = ((uint64_t)tm->test_node[0].idx << 32) | i;  in test_node_worker_source()
201 		*graph_field(data) = ((uint64_t)tm->test_node[1].idx << 32) | i;  in test_node_worker_source()
231 			if ((*graph_field(data) >> 32) != tm->test_node[0].idx) {  in test_node0_worker()
234 				       tm->test_node[0].idx,  in test_node0_worker()
260 				((uint64_t)tm->test_node[1].idx << 32) | i;  in test_node0_worker()
273 				((uint64_t)tm->test_node[2].idx << 32) | i;  in test_node0_worker()
282 	} else if (*(uint32_t *)node->ctx == tm->test_node[1].idx) {  in test_node0_worker()
284 	} else if (*(uint32_t *)node->ctx == tm->test_node[2].idx) {  in test_node0_worker()
286 	} else if (*(uint32_t *)node->ctx == tm->test_node[3].idx) {  in test_node0_worker()
311 		if ((*graph_field(data) >> 32) != tm->test_node[1].idx) {  in test_node1_worker()
314 			       tm->test_node[1].idx,  in test_node1_worker()
338 		*graph_field(data) = ((uint64_t)tm->test_node[2].idx << 32) | i;  in test_node1_worker()
365 		if ((*graph_field(data) >> 32) != tm->test_node[2].idx) {  in test_node2_worker()
368 			       tm->test_node[2].idx,  in test_node2_worker()
394 				((uint64_t)tm->test_node[3].idx << 32) | i;  in test_node2_worker()
421 		if ((*graph_field(data) >> 32) != tm->test_node[3].idx) {  in test_node3_worker()
424 			       tm->test_node[3].idx,  in test_node3_worker()
453 				((uint64_t)tm->test_node[0].idx << 32) | i;  in test_node3_worker()
474 		char *name = rte_node_id_to_name(tm->test_node[i].idx);  in test_lookup_functions()
486 		if (idx != tm->test_node[i].idx) {  in test_lookup_functions()
489 			       node_names[i], tm->test_node[i].idx, idx);  in test_lookup_functions()
496 		uint32_t count = rte_node_edge_count(tm->test_node[i].idx);  in test_lookup_functions()
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()
510 		count = rte_node_edge_get(tm->test_node[i].idx, NULL);  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()
518 		count = rte_node_edge_get(tm->test_node[i].idx, next_edges);  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()
551 	tm->test_node[0].idx = node_id;  in test_node_clone()
567 		tm->test_node[i].idx =  in test_node_clone()
568 			rte_node_clone(node_id, tm->test_node[i].node.name);  in test_node_clone()
569 		if (rte_node_is_invalid(tm->test_node[i].idx)) {  in test_node_clone()
576 	dummy_id = rte_node_clone(tm->test_node[1].idx, "dummy_node");  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()
604 		count = rte_node_edge_update(tm->test_node[i].idx, 0,  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()
613 		count = rte_node_edge_shrink(tm->test_node[i].idx,  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()
687 		node = rte_graph_node_get(graph_id, tm->test_node[i].idx);  in test_graph_lookup_functions()
690 			       tm->test_node[i].idx);  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()
711 			       tm->test_node[i].idx);  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()