reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
131 struct isl_sched_node *node = (struct isl_sched_node *)entry; 137 static int node_scc_exactly(struct isl_sched_node *node, int scc) 142 static int node_scc_at_most(struct isl_sched_node *node, int scc) 147 static int node_scc_at_least(struct isl_sched_node *node, int scc) 196 struct isl_sched_node *src; 197 struct isl_sched_node *dst; 366 struct isl_sched_node *node; 427 static struct isl_sched_node *graph_find_node(isl_ctx *ctx, 446 struct isl_sched_node *node) 522 struct isl_sched_node *src, struct isl_sched_node *dst) 522 struct isl_sched_node *src, struct isl_sched_node *dst) 542 struct isl_sched_node *src, struct isl_sched_node *dst) 542 struct isl_sched_node *src, struct isl_sched_node *dst) 558 struct isl_sched_node *src, struct isl_sched_node *dst) 558 struct isl_sched_node *src, struct isl_sched_node *dst) 626 struct isl_sched_node *src, struct isl_sched_node *dst) 626 struct isl_sched_node *src, struct isl_sched_node *dst) 652 struct isl_sched_node *src, struct isl_sched_node *dst) 652 struct isl_sched_node *src, struct isl_sched_node *dst) 701 struct isl_sched_node *node) 815 static isl_stat set_max_coefficient(isl_ctx *ctx, struct isl_sched_node *node) 847 struct isl_sched_node *node) 948 static isl_stat compute_sizes_and_max(isl_ctx *ctx, struct isl_sched_node *node, 1002 struct isl_sched_node *node; 1043 struct isl_sched_node *node) 1206 static __isl_give isl_map *extract_hull(struct isl_sched_node *src, 1207 struct isl_sched_node *dst) 1241 static struct isl_sched_node *find_domain_node(isl_ctx *ctx, 1244 struct isl_sched_node *node; 1257 static struct isl_sched_node *find_range_node(isl_ctx *ctx, 1260 struct isl_sched_node *node; 1311 struct isl_sched_node *src, *dst; 1549 static __isl_give isl_basic_set *get_size_bounds(struct isl_sched_node *node) 1594 __isl_take isl_set *delta, struct isl_sched_node *node) 1640 struct isl_sched_graph *graph, struct isl_sched_node *node, 1751 static int node_cst_coef_offset(struct isl_sched_node *node) 1764 static int node_par_coef_offset(struct isl_sched_node *node) 1777 static int node_var_coef_offset(struct isl_sched_node *node) 1788 static int node_var_coef_pos(struct isl_sched_node *node, int i) 1814 struct isl_sched_graph *graph, struct isl_sched_node *node, 1854 struct isl_sched_graph *graph, struct isl_sched_node *src, 1855 struct isl_sched_node *dst, int offset, int s) 1927 struct isl_sched_node *node = edge->src; 1963 struct isl_sched_node *src = edge->src; 1964 struct isl_sched_node *dst = edge->dst; 2040 struct isl_sched_node *node = edge->src; 2118 struct isl_sched_node *src = edge->src; 2119 struct isl_sched_node *dst = edge->dst; 2279 static int node_update_vmap(struct isl_sched_node *node) 2485 struct isl_sched_node *node = &graph->node[i]; 2552 struct isl_sched_graph *graph, struct isl_sched_node *node, int max) 2630 struct isl_sched_node *node = &graph->node[i]; 2704 struct isl_sched_node *node = &graph->node[i]; 2760 struct isl_sched_node *node = &graph->node[graph->sorted[i]]; 2841 static int needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node) 2895 struct isl_sched_node *node = &graph->node[i]; 2923 static __isl_give isl_vec *extract_var_coef(struct isl_sched_node *node, 2970 struct isl_sched_node *node = &graph->node[i]; 3013 struct isl_sched_node *node, int row) 3052 struct isl_sched_node *node, int first, int n) 3092 struct isl_sched_node *node) 3106 static __isl_give isl_map *node_extract_schedule(struct isl_sched_node *node) 3126 static __isl_give isl_map *specializer(struct isl_sched_node *src, 3127 struct isl_sched_node *dst) 3388 int (*pred)(struct isl_sched_node *node, int data), int data) 3460 int (*node_pred)(struct isl_sched_node *node, int data), int data) 3518 struct isl_sched_node *dst_src, *dst_dst; 3576 struct isl_sched_node *node = &graph->node[i]; 3594 int (*node_pred)(struct isl_sched_node *node, int data), 3647 int (*node_pred)(struct isl_sched_node *node, int data), 3696 struct isl_sched_node *node = &graph->node[i]; 3863 struct isl_sched_node *node, __isl_take isl_basic_set *coef, int pos) 3906 struct isl_sched_node *src, struct isl_sched_node *dst, 3906 struct isl_sched_node *src, struct isl_sched_node *dst, 3979 static struct isl_sched_node *graph_find_compressed_node(isl_ctx *ctx, 3983 struct isl_sched_node *node; 4042 struct isl_sched_node *node; 4066 struct isl_sched_node *src, *dst; 4189 struct isl_sched_node *node = &graph->node[graph->sorted[i]]; 4278 struct isl_sched_node *node = &graph->node[i]; 4293 struct isl_sched_node *node = &graph->node[i]; 4325 static int is_trivial(struct isl_sched_node *node, __isl_keep isl_vec *sol) 4358 struct isl_sched_node *node = &graph->node[i]; 4380 static int find_node_coalescing(struct isl_sched_node *node, 4438 __isl_take isl_tab_lexmin *tl, struct isl_sched_node *node, int pos) 4583 struct isl_sched_node *node = &graph->node[i]; 4617 struct isl_sched_node *node = edge->src; 4676 struct isl_sched_node *node; 5389 static __isl_give isl_map *final_row(struct isl_sched_node *node) 6067 struct isl_sched_node *node = &c->scc[i].node[j]; 6275 struct isl_sched_node *node = &scc->node[j]; 6315 struct isl_sched_node *node = &scc->node[j]; 6427 struct isl_sched_node *node, struct isl_clustering *c, 6430 struct isl_sched_node *scc_node, *cluster_node; 6699 struct isl_sched_node *t_node, struct isl_sched_node *node, 6699 struct isl_sched_node *t_node, struct isl_sched_node *node, 6736 struct isl_sched_node *t_node) 6747 struct isl_sched_node *node = &graph->node[i]; 6785 struct isl_sched_node *node; 6942 static int node_cluster_exactly(struct isl_sched_node *node, int cluster) 6960 static void swap_sched(struct isl_sched_node *node1, 6961 struct isl_sched_node *node2) 7093 struct isl_sched_node *src = edge->src; 7094 struct isl_sched_node *dst = edge->dst;