Lines Matching refs:cluster

15 struct cluster {  struct
102 stats_mem_init(struct cluster *cluster, in stats_mem_init() argument
118 cluster_node_size += cluster->nb_graphs * sizeof(struct rte_node *); in stats_mem_init()
141 struct cluster_node *cluster; in stats_mem_populate() local
145 cluster = stats->clusters; in stats_mem_populate()
150 if (cluster->stat.id == id) { in stats_mem_populate()
158 cluster->nodes[cluster->nb_nodes++] = node; in stats_mem_populate()
161 cluster = RTE_PTR_ADD(cluster, stats->cluster_node_size); in stats_mem_populate()
170 cluster = RTE_PTR_ADD(stats, stats->sz), in stats_mem_populate()
171 memset(cluster, 0, stats->cluster_node_size); in stats_mem_populate()
172 memcpy(cluster->stat.name, graph_node->node->name, RTE_NODE_NAMESIZE); in stats_mem_populate()
173 cluster->stat.id = graph_node->node->id; in stats_mem_populate()
174 cluster->stat.hz = rte_get_timer_hz(); in stats_mem_populate()
179 cluster->nodes[cluster->nb_nodes++] = node; in stats_mem_populate()
197 cluster_init(struct cluster *cluster) in cluster_init() argument
199 memset(cluster, 0, sizeof(*cluster)); in cluster_init()
203 cluster_add(struct cluster *cluster, struct graph *graph) in cluster_add() argument
209 for (count = 0; count < cluster->nb_graphs; count++) in cluster_add()
210 if (cluster->graphs[count] == graph) in cluster_add()
214 if (cluster->nb_graphs + 1 > cluster->size) { in cluster_add()
215 cluster->size = RTE_MAX(1, cluster->size * 2); in cluster_add()
216 sz = sizeof(struct graph *) * cluster->size; in cluster_add()
217 cluster->graphs = realloc(cluster->graphs, sz); in cluster_add()
218 if (cluster->graphs == NULL) in cluster_add()
223 cluster->graphs[cluster->nb_graphs++] = graph; in cluster_add()
231 cluster_fini(struct cluster *cluster) in cluster_fini() argument
233 if (cluster->graphs) in cluster_fini()
234 free(cluster->graphs); in cluster_fini()
238 expand_pattern_to_cluster(struct cluster *cluster, const char *pattern) in expand_pattern_to_cluster() argument
247 if (cluster_add(cluster, graph)) in expand_pattern_to_cluster()
266 struct cluster cluster; in rte_graph_cluster_stats_create() local
281 cluster_init(&cluster); in rte_graph_cluster_stats_create()
287 if (expand_pattern_to_cluster(&cluster, pattern)) in rte_graph_cluster_stats_create()
292 stats = stats_mem_init(&cluster, prm); in rte_graph_cluster_stats_create()
297 for (i = 0; i < cluster.nb_graphs; i++) { in rte_graph_cluster_stats_create()
298 graph = cluster.graphs[i]; in rte_graph_cluster_stats_create()
317 cluster_fini(&cluster); in rte_graph_cluster_stats_create()
329 cluster_node_arregate_stats(struct cluster_node *cluster) in cluster_node_arregate_stats() argument
332 struct rte_graph_cluster_node_stats *stat = &cluster->stat; in cluster_node_arregate_stats()
336 for (count = 0; count < cluster->nb_nodes; count++) { in cluster_node_arregate_stats()
337 node = cluster->nodes[count]; in cluster_node_arregate_stats()
353 cluster_node_store_prev_stats(struct cluster_node *cluster) in cluster_node_store_prev_stats() argument
355 struct rte_graph_cluster_node_stats *stat = &cluster->stat; in cluster_node_store_prev_stats()
366 struct cluster_node *cluster; in rte_graph_cluster_stats_get() local
370 cluster = stat->clusters; in rte_graph_cluster_stats_get()
373 cluster_node_arregate_stats(cluster); in rte_graph_cluster_stats_get()
376 stat->cookie, &cluster->stat); in rte_graph_cluster_stats_get()
377 cluster_node_store_prev_stats(cluster); in rte_graph_cluster_stats_get()
380 cluster = RTE_PTR_ADD(cluster, stat->cluster_node_size); in rte_graph_cluster_stats_get()
387 struct cluster_node *cluster; in rte_graph_cluster_stats_reset() local
390 cluster = stat->clusters; in rte_graph_cluster_stats_reset()
393 struct rte_graph_cluster_node_stats *node = &cluster->stat; in rte_graph_cluster_stats_reset()
404 cluster = RTE_PTR_ADD(cluster, stat->cluster_node_size); in rte_graph_cluster_stats_reset()