HomeSort by: relevance | last modified time | path
    Searched defs:scc_graph (Results 1 - 2 of 2) sorted by relevancy

  /src/external/mit/isl/dist/
isl_scheduler_scc.c 80 * "scc_graph" is the SCC graph containing the edges.
84 struct isl_scc_graph *scc_graph; member in struct:isl_edge_src
102 /* Print some debugging information about "scc_graph".
106 void isl_scc_graph_dump(struct isl_scc_graph *scc_graph)
111 if (!scc_graph)
114 ctx = scc_graph->ctx;
115 for (i = 0; i < scc_graph->n; ++i) {
118 fprintf(stderr, "%d", scc_graph->graph_scc[i]);
121 for (i = 0; i < scc_graph->n; ++i) {
122 isl_hash_table_foreach(ctx, scc_graph->edge_table[i]
250 struct isl_scc_graph *scc_graph; member in struct:isl_extract_dst_data
314 struct isl_scc_graph *scc_graph; member in struct:isl_foreach_reachable_data
383 struct isl_scc_graph *scc_graph = data->scc_graph; local
506 struct isl_scc_graph *scc_graph = user; local
526 struct isl_scc_graph *scc_graph; local
579 struct isl_scc_graph *scc_graph; local
610 struct isl_scc_graph *scc_graph; member in struct:isl_copy_edge_data
627 struct isl_scc_graph *scc_graph = data->scc_graph; local
918 struct isl_scc_graph *scc_graph; member in struct:isl_merge_src_dst_data
    [all...]
isl_scheduler_clustering.c 1453 struct isl_scc_graph *scc_graph; local
1457 scc_graph = isl_scc_graph_from_sched_graph(ctx, graph, c);
1458 node = isl_scc_graph_decompose(scc_graph, node);
1459 isl_scc_graph_free(scc_graph);

Completed in 23 milliseconds