HomeSort by: relevance | last modified time | path
    Searched refs:isl_sched_graph (Results 1 - 6 of 6) sorted by relevancy

  /src/external/mit/isl/dist/
isl_scheduler_clustering.h 29 struct isl_sched_graph *scc;
30 struct isl_sched_graph *cluster;
37 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph);
isl_scheduler.h 221 struct isl_sched_graph { struct
237 struct isl_sched_graph *root;
258 isl_stat isl_sched_graph_init(struct isl_sched_graph *graph,
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...]
isl_scheduler_scc.h 12 struct isl_sched_graph *graph, struct isl_clustering *c);
isl_scheduler_clustering.c 30 struct isl_sched_graph *graph)
35 c->scc = isl_calloc_array(ctx, struct isl_sched_graph, c->n);
36 c->cluster = isl_calloc_array(ctx, struct isl_sched_graph, c->n);
84 static int bad_cluster(struct isl_sched_graph *graph)
114 static int find_proximity(struct isl_sched_graph *graph,
161 struct isl_sched_graph *graph;
179 struct isl_sched_graph *graph = data->graph;
215 static isl_stat mark_merge_sccs(isl_ctx *ctx, struct isl_sched_graph *graph,
272 static __isl_give isl_space *cluster_space(struct isl_sched_graph *scc, int i)
296 struct isl_sched_graph *graph, struct isl_clustering *c
    [all...]
isl_scheduler.c 179 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph)
207 struct isl_sched_graph *graph, __isl_keep isl_space *space)
228 int isl_sched_graph_is_node(struct isl_sched_graph *graph,
245 struct isl_sched_graph *graph, enum isl_edge_type type,
267 struct isl_sched_graph *graph, struct isl_sched_edge *edge)
284 static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph)
303 struct isl_sched_graph *graph,
324 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph,
343 static isl_bool graph_has_edge(struct isl_sched_graph *graph,
369 struct isl_sched_graph *graph, struct isl_sched_edge *model
    [all...]
isl_scheduler_scc.c 65 struct isl_sched_graph *graph;
523 struct isl_sched_graph *graph, struct isl_clustering *c)
576 struct isl_sched_graph *graph, struct isl_clustering *c)

Completed in 32 milliseconds