19 	struct graph **graphs;
137 		   struct rte_graph *graph, struct graph_node *graph_node)  in stats_mem_populate()  argument
151 			node = graph_node_id_to_ptr(graph, id);  in stats_mem_populate()
156 					graph_node->node->name, graph->name);  in stats_mem_populate()
175 	node = graph_node_id_to_ptr(graph, id);  in stats_mem_populate()
178 			    graph_node->node->name, graph->name);  in stats_mem_populate()
203 cluster_add(struct cluster *cluster, struct graph *graph)  in cluster_add()  argument
210 		if (cluster->graphs[count] == graph)  in cluster_add()
216 		sz = sizeof(struct graph *) * cluster->size;  in cluster_add()
223 	cluster->graphs[cluster->nb_graphs++] = graph;  in cluster_add()
241 	struct graph *graph;  in expand_pattern_to_cluster()  local
245 	STAILQ_FOREACH(graph, graph_head, next) {  in expand_pattern_to_cluster()
246 		if (fnmatch(pattern, graph->name, 0) == 0) {  in expand_pattern_to_cluster()
247 			if (cluster_add(cluster, graph))  in expand_pattern_to_cluster()
267 	struct graph *graph;  in rte_graph_cluster_stats_create()  local
298 		graph = cluster.graphs[i];  in rte_graph_cluster_stats_create()
299 		STAILQ_FOREACH(graph_node, &graph->node_list, next) {  in rte_graph_cluster_stats_create()
300 			struct rte_graph *graph_fp = graph->graph;  in rte_graph_cluster_stats_create()