14 node_has_loop_edge(struct node *node)  in node_has_loop_edge()  argument
20 	for (i = 0; i < node->nb_edges; i++) {  in node_has_loop_edge()
21 		if (strncmp(node->name, node->next_nodes[i],  in node_has_loop_edge()
23 			name = node->name;  in node_has_loop_edge()
39 		if (node_has_loop_edge(graph_node->node))  in graph_node_has_loop_edge()
52 		if (graph_node->node->flags & RTE_NODE_SOURCE_F)  in graph_src_nodes_count()
66 	struct node *node;  in graph_node_has_edge_to_src_node()  local
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()
72 			if (node->flags & RTE_NODE_SOURCE_F)  in graph_node_has_edge_to_src_node()
76 					graph_node->node->name, node->name);  in graph_node_has_edge_to_src_node()
125 		for (i = 0; i < v->node->nb_edges; i++) {  in graph_bfs()
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()
163 				    graph_node->node->name);  in graph_has_isolated_node()