Home
last modified time | relevance | path

Searched refs:isl_sched_graph_is_node (Results 1 – 3 of 3) sorted by relevance

/llvm-project/polly/lib/External/isl/
H A Disl_scheduler.h262 int isl_sched_graph_is_node(struct isl_sched_graph *graph,
H A Disl_scheduler_clustering.c718 if (scc_node && !isl_sched_graph_is_node(&c->scc[node->scc], scc_node)) in extract_node_transformation()
727 if (cluster_node && !isl_sched_graph_is_node(merge_graph, cluster_node)) in extract_node_transformation()
1087 if (!isl_sched_graph_is_node(merge_graph, node)) in merge()
H A Disl_scheduler.c228 int isl_sched_graph_is_node(struct isl_sched_graph *graph, in isl_sched_graph_is_node() function
1284 if (!isl_sched_graph_is_node(graph, src) || in extract_edge()
1285 !isl_sched_graph_is_node(graph, dst)) in extract_edge()
3552 if (!isl_sched_graph_is_node(dst, dst_src) || in copy_edges()
3553 !isl_sched_graph_is_node(dst, dst_dst)) { in copy_edges()
4012 if (isl_sched_graph_is_node(graph, node)) in graph_find_compressed_node()
4022 if (!isl_sched_graph_is_node(graph->root, node)) in graph_find_compressed_node()
4027 if (!isl_sched_graph_is_node(graph, node)) in graph_find_compressed_node()