Home
last modified time | relevance | path

Searched refs:isl_sched_graph (Results 1 – 6 of 6) sorted by relevance

/netbsd-src/external/mit/isl/dist/
H A Disl_scheduler.h221 struct isl_sched_graph { struct
237 struct isl_sched_graph *root; argument
258 isl_stat isl_sched_graph_init(struct isl_sched_graph *graph, argument
260 void isl_sched_graph_free(isl_ctx *ctx, struct isl_sched_graph *graph);
262 int isl_sched_graph_is_node(struct isl_sched_graph *graph,
264 isl_bool isl_sched_graph_has_validity_edge(struct isl_sched_graph *graph,
268 struct isl_sched_graph *graph, __isl_keep isl_space *space);
270 isl_stat isl_sched_graph_detect_ccs(isl_ctx *ctx, struct isl_sched_graph *graph,
274 struct isl_sched_graph *graph, int scc);
276 struct isl_sched_graph *graph);
[all …]
H A Disl_scheduler_clustering.c30 struct isl_sched_graph *graph) in clustering_init()
35 c->scc = isl_calloc_array(ctx, struct isl_sched_graph, c->n); in clustering_init()
36 c->cluster = isl_calloc_array(ctx, struct isl_sched_graph, c->n); in clustering_init()
84 static int bad_cluster(struct isl_sched_graph *graph) in bad_cluster()
114 static int find_proximity(struct isl_sched_graph *graph, in find_proximity()
161 struct isl_sched_graph *graph;
179 struct isl_sched_graph *graph = data->graph; in cluster_follows()
215 static isl_stat mark_merge_sccs(isl_ctx *ctx, struct isl_sched_graph *graph, in mark_merge_sccs()
272 static __isl_give isl_space *cluster_space(struct isl_sched_graph *scc, int i) in cluster_space()
296 struct isl_sched_graph *graph, struct isl_clustering *c) in collect_domain()
[all …]
H A Disl_scheduler.c179 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_table()
207 struct isl_sched_graph *graph, __isl_keep isl_space *space) in isl_sched_graph_find_node()
228 int isl_sched_graph_is_node(struct isl_sched_graph *graph, in isl_sched_graph_is_node()
245 struct isl_sched_graph *graph, enum isl_edge_type type, in graph_edge_table_add()
267 struct isl_sched_graph *graph, struct isl_sched_edge *edge) in graph_edge_tables_add()
284 static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_edge_tables()
303 struct isl_sched_graph *graph, in graph_find_edge_entry()
324 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, in graph_find_edge()
343 static isl_bool graph_has_edge(struct isl_sched_graph *graph, in graph_has_edge()
369 struct isl_sched_graph *graph, struct isl_sched_edge *model) in graph_find_matching_edge()
[all …]
H A Disl_scheduler_clustering.h29 struct isl_sched_graph *scc;
30 struct isl_sched_graph *cluster;
37 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph);
H A Disl_scheduler_scc.h12 struct isl_sched_graph *graph, struct isl_clustering *c);
H A Disl_scheduler_scc.c65 struct isl_sched_graph *graph;
523 struct isl_sched_graph *graph, struct isl_clustering *c) in isl_scc_graph_alloc()
576 struct isl_sched_graph *graph, struct isl_clustering *c) in isl_scc_graph_from_sched_graph()