Searched refs:scc_graph (Results 1 – 3 of 3) sorted by relevance
84 struct isl_scc_graph *scc_graph; member106 void isl_scc_graph_dump(struct isl_scc_graph *scc_graph) in isl_scc_graph_dump() argument111 if (!scc_graph) in isl_scc_graph_dump()114 ctx = scc_graph->ctx; in isl_scc_graph_dump()115 for (i = 0; i < scc_graph->n; ++i) { in isl_scc_graph_dump()118 fprintf(stderr, "%d", scc_graph->graph_scc[i]); in isl_scc_graph_dump()121 for (i = 0; i < scc_graph->n; ++i) { in isl_scc_graph_dump()122 isl_hash_table_foreach(ctx, scc_graph->edge_table[i], in isl_scc_graph_dump()123 &print_edge, &scc_graph->graph_scc[i]); in isl_scc_graph_dump()126 for (i = 0; i < scc_graph->n; ++i) { in isl_scc_graph_dump()[all …]
14 struct isl_scc_graph *scc_graph, __isl_take isl_schedule_node *node);15 struct isl_scc_graph *isl_scc_graph_free(struct isl_scc_graph *scc_graph);17 void isl_scc_graph_dump(struct isl_scc_graph *scc_graph);
1453 struct isl_scc_graph *scc_graph; in finish_bands_decompose() local1457 scc_graph = isl_scc_graph_from_sched_graph(ctx, graph, c); in finish_bands_decompose()1458 node = isl_scc_graph_decompose(scc_graph, node); in finish_bands_decompose()1459 isl_scc_graph_free(scc_graph); in finish_bands_decompose()