36 	struct graph_node *graph_node;  in graph_node_has_loop_edge()  local
38 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_node_has_loop_edge()
39 		if (node_has_loop_edge(graph_node->node))  in graph_node_has_loop_edge()
48 	struct graph_node *graph_node;  in graph_src_nodes_count()  local
51 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_src_nodes_count()
52 		if (graph_node->node->flags & RTE_NODE_SOURCE_F)  in graph_src_nodes_count()
65 	struct graph_node *graph_node;  in graph_node_has_edge_to_src_node()  local
69 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_node_has_edge_to_src_node()
70 		for (i = 0; i < graph_node->node->nb_edges; i++) {  in graph_node_has_edge_to_src_node()
71 			node = graph_node->adjacency_list[i]->node;  in graph_node_has_edge_to_src_node()
76 					graph_node->node->name, node->name);  in graph_node_has_edge_to_src_node()
88 	struct graph_node *graph_node;  in graph_nodes_count()  local
91 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_nodes_count()
100 	struct graph_node *graph_node;  in graph_mark_nodes_as_not_visited()  local
102 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_mark_nodes_as_not_visited()
103 		graph_node->visited = false;  in graph_mark_nodes_as_not_visited()
107 graph_bfs(struct graph *graph, struct graph_node *start)  in graph_bfs()
109 	struct graph_node **queue, *v, *tmp;  in graph_bfs()
114 	sz = sizeof(struct graph_node *) * graph_nodes_count(graph);  in graph_bfs()
145 	struct graph_node *graph_node;  in graph_has_isolated_node()  local
149 	STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in graph_has_isolated_node()
150 		if (graph_node->node->flags & RTE_NODE_SOURCE_F) {  in graph_has_isolated_node()
151 			if (graph_node->node->nb_edges == 0)  in graph_has_isolated_node()
154 					    graph_node->node->name);  in graph_has_isolated_node()
155 			if (graph_bfs(graph, graph_node))  in graph_has_isolated_node()
160 	STAILQ_FOREACH(graph_node, &graph->node_list, next)  in graph_has_isolated_node()
161 		if (graph_node->visited == false)  in graph_has_isolated_node()
163 				    graph_node->node->name);  in graph_has_isolated_node()