46 	struct graph_node *graph_node;  in graph_node_add()  local
50 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_node_add()
51 		if (strncmp(node->name, graph_node->node->name,  in graph_node_add()
56 	sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *);  in graph_node_add()
57 	graph_node = calloc(1, sz);  in graph_node_add()
59 	if (graph_node == NULL)  in graph_node_add()
64 	graph_node->node = node;  in graph_node_add()
67 	STAILQ_INSERT_TAIL(&graph->node_list, graph_node, next);  in graph_node_add()
71 	free(graph_node);  in graph_node_add()
75 static struct graph_node *
78 	struct graph_node *graph_node;  in node_to_graph_node()  local
80 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in node_to_graph_node()
81 		if (graph_node->node == node)  in node_to_graph_node()
82 			return graph_node;  in node_to_graph_node()
92 	struct graph_node *graph_node;  in graph_node_edges_add()  local
97 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_node_edges_add()
98 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_node_edges_add()
99 			next = graph_node->node->next_nodes[i];  in graph_node_edges_add()
116 	struct graph_node *graph_node, *tmp;  in graph_adjacency_list_update()  local
121 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_adjacency_list_update()
122 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_adjacency_list_update()
123 			next = graph_node->node->next_nodes[i];  in graph_adjacency_list_update()
131 			graph_node->adjacency_list[i] = tmp;  in graph_adjacency_list_update()
166 	struct graph_node *graph_node;  in graph_cleanup()  local
169 		graph_node = STAILQ_FIRST(&graph->node_list);  in graph_cleanup()
171 		free(graph_node);  in graph_cleanup()
178 	struct graph_node *graph_node;  in graph_node_init()  local
182 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_node_init()
183 		if (graph_node->node->init) {  in graph_node_init()
184 			name = graph_node->node->name;  in graph_node_init()
185 			rc = graph_node->node->init(  in graph_node_init()
202 	struct graph_node *graph_node;  in graph_node_fini()  local
204 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_node_fini()
205 		if (graph_node->node->fini)  in graph_node_fini()
206 			graph_node->node->fini(  in graph_node_fini()
209 						       graph_node->node->name));  in graph_node_fini()
496 	struct graph_node *graph_node;  in graph_to_dot()  local
505 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_to_dot()
506 		node_name = graph_node->node->name;  in graph_to_dot()
507 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_to_dot()
509 				     graph_node->adjacency_list[i]->node->name,  in graph_to_dot()
510 				     graph_node->node->flags & RTE_NODE_SOURCE_F  in graph_to_dot()