15 node_has_loop_edge(struct node *node)  in node_has_loop_edge()  argument
21 	for (i = 0; i < node->nb_edges; i++) {  in node_has_loop_edge()
22 		if (strncmp(node->name, node->next_nodes[i],  in node_has_loop_edge()
24 			name = node->name;  in node_has_loop_edge()
40 		if (node_has_loop_edge(graph_node->node))  in graph_node_has_loop_edge()
53 		if (graph_node->node->flags & RTE_NODE_SOURCE_F)  in graph_src_nodes_count()
67 	struct node *node;  in graph_node_has_edge_to_src_node()  local
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()
73 			if (node->flags & RTE_NODE_SOURCE_F)  in graph_node_has_edge_to_src_node()
77 					graph_node->node->name, node->name);  in graph_node_has_edge_to_src_node()
126 		for (i = 0; i < v->node->nb_edges; i++) {  in graph_bfs()
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()
164 				    graph_node->node->name);  in graph_has_isolated_node()