37 	struct graph_node *graph_node;  in graph_node_has_loop_edge()  local
39 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_node_has_loop_edge()
40 		if (node_has_loop_edge(graph_node->node))  in graph_node_has_loop_edge()
49 	struct graph_node *graph_node;  in graph_src_nodes_count()  local
52 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_src_nodes_count()
53 		if (graph_node->node->flags & RTE_NODE_SOURCE_F)  in graph_src_nodes_count()
66 	struct graph_node *graph_node;  in graph_node_has_edge_to_src_node()  local
70 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_node_has_edge_to_src_node()
71 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_node_has_edge_to_src_node()
72 			node = graph_node->adjacency_list[i]->node;  in graph_node_has_edge_to_src_node()
77 					graph_node->node->name, node->name);  in graph_node_has_edge_to_src_node()
89 	struct graph_node *graph_node;  in graph_nodes_count()  local
92 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_nodes_count()
101 	struct graph_node *graph_node;  in graph_mark_nodes_as_not_visited()  local
103 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_mark_nodes_as_not_visited()
104 		graph_node->visited = false;  in graph_mark_nodes_as_not_visited()
108 graph_bfs(struct graph *graph, struct graph_node *start)  in graph_bfs()
110 	struct graph_node **queue, *v, *tmp;  in graph_bfs()
115 	sz = sizeof(struct graph_node *) * graph_nodes_count(graph);  in graph_bfs()
146 	struct graph_node *graph_node;  in graph_has_isolated_node()  local
150 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_has_isolated_node()
151 		if (graph_node->node->flags & RTE_NODE_SOURCE_F) {  in graph_has_isolated_node()
152 			if (graph_node->node->nb_edges == 0)  in graph_has_isolated_node()
155 					    graph_node->node->name);  in graph_has_isolated_node()
156 			if (graph_bfs(graph, graph_node))  in graph_has_isolated_node()
161 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_has_isolated_node()
162 		if (graph_node->visited == false)  in graph_has_isolated_node()
164 				    graph_node->node->name);  in graph_has_isolated_node()