58 	struct isl_sched_node *node = (struct isl_sched_node *)entry;  in node_has_tuples()
64 int isl_sched_node_scc_exactly(struct isl_sched_node *node, int scc)  in isl_sched_node_scc_exactly()
69 static int node_scc_at_most(struct isl_sched_node *node, int scc)  in node_scc_at_most()
74 static int node_scc_at_least(struct isl_sched_node *node, int scc)  in node_scc_at_least()
206 struct isl_sched_node *isl_sched_graph_find_node(isl_ctx *ctx,  in isl_sched_graph_find_node()
229 	struct isl_sched_node *node)  in isl_sched_graph_is_node()
305 	struct isl_sched_node *src, struct isl_sched_node *dst)  in graph_find_edge_entry()
326 	struct isl_sched_node *src, struct isl_sched_node *dst,  in graph_find_edge()
345 	struct isl_sched_node *src, struct isl_sched_node *dst)  in graph_has_edge()
420 	struct isl_sched_node *src, struct isl_sched_node *dst)  in graph_has_any_edge()
446 	struct isl_sched_node *src, struct isl_sched_node *dst)  in isl_sched_graph_has_validity_edge()
468 	graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n);  in graph_alloc()
495 	struct isl_sched_node *node)  in clear_node()
612 static isl_stat set_max_coefficient(isl_ctx *ctx, struct isl_sched_node *node)  in set_max_coefficient()
644 	struct isl_sched_node *node)  in compute_max_coefficient()
696 	struct isl_sched_node *node)  in construct_compressed_id()
792 static isl_stat compress_node(struct isl_sched_node *node,  in compress_node()
838 static isl_stat project_out_fixed(struct isl_sched_node *node,  in project_out_fixed()
890 static isl_stat compute_sizes(struct isl_sched_node *node,  in compute_sizes()
941 static isl_stat compute_sizes_and_max(isl_ctx *ctx, struct isl_sched_node *node,  in compute_sizes_and_max()
982 	struct isl_sched_node *node;  in add_node()
1160 static __isl_give isl_map *extract_hull(struct isl_sched_node *src,  in extract_hull()
1161 	struct isl_sched_node *dst)  in extract_hull()
1195 static struct isl_sched_node *find_domain_node(isl_ctx *ctx,  in find_domain_node()
1198 	struct isl_sched_node *node;  in find_domain_node()
1211 static struct isl_sched_node *find_range_node(isl_ctx *ctx,  in find_range_node()
1214 	struct isl_sched_node *node;  in find_range_node()
1265 	struct isl_sched_node *src, *dst;  in extract_edge()
1513 static __isl_give isl_basic_set *get_size_bounds(struct isl_sched_node *node)  in get_size_bounds()
1554 	struct isl_sched_node *src, struct isl_sched_node *dst)  in compress()
1572 	__isl_take isl_set *delta, struct isl_sched_node *node)  in drop_coalescing_constraints()
1621 	struct isl_sched_graph *graph, struct isl_sched_node *node,  in intra_coefficients()
1722 static int node_cst_coef_offset(struct isl_sched_node *node)  in node_cst_coef_offset()
1735 static int node_par_coef_offset(struct isl_sched_node *node)  in node_par_coef_offset()
1748 static int node_var_coef_offset(struct isl_sched_node *node)  in node_var_coef_offset()
1759 static int node_var_coef_pos(struct isl_sched_node *node, int i)  in node_var_coef_pos()
1785 	struct isl_sched_graph *graph, struct isl_sched_node *node,  in intra_dim_map()
1825 	struct isl_sched_graph *graph, struct isl_sched_node *src,  in inter_dim_map()
1826 	struct isl_sched_node *dst, int offset, int s)  in inter_dim_map()
1900 	struct isl_sched_node *node = edge->src;  in add_intra_validity_constraints()
1937 	struct isl_sched_node *src = edge->src;  in add_inter_validity_constraints()
1938 	struct isl_sched_node *dst = edge->dst;  in add_inter_validity_constraints()
2015 	struct isl_sched_node *node = edge->src;  in add_intra_proximity_constraints()
2094 	struct isl_sched_node *src = edge->src;  in add_inter_proximity_constraints()
2095 	struct isl_sched_node *dst = edge->dst;  in add_inter_proximity_constraints()
2230 static __isl_give isl_mat *extract_linear_schedule(struct isl_sched_node *node)  in extract_linear_schedule()
2268 isl_stat isl_sched_node_update_vmap(struct isl_sched_node *node)  in isl_sched_node_update_vmap()
2481 		struct isl_sched_node *node = &graph->node[i];  in add_bound_constant_constraints()
2548 	struct isl_sched_graph *graph, struct isl_sched_node *node, int max)  in node_add_coefficient_constraints()
2628 		struct isl_sched_node *node = &graph->node[i];  in add_bound_coefficient_constraints()
2708 		struct isl_sched_node *node = &graph->node[i];  in add_var_sum_constraint()
2766 		struct isl_sched_node *node = &graph->node[graph->sorted[i]];  in setup_lp()
2847 static int needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node)  in needs_row()
2902 		struct isl_sched_node *node = &graph->node[i];  in solve_lp()
2930 static __isl_give isl_vec *extract_var_coef(struct isl_sched_node *node,  in extract_var_coef()
2977 		struct isl_sched_node *node = &graph->node[i];  in update_schedule()
3020 	struct isl_sched_node *node, int row)  in extract_schedule_row()
3059 	struct isl_sched_node *node, int first, int n)  in isl_sched_node_extract_partial_schedule_multi_aff()
3101 	struct isl_sched_node *node)  in node_extract_schedule_multi_aff()
3117 static __isl_give isl_map *node_extract_schedule(struct isl_sched_node *node)  in node_extract_schedule()
3137 static __isl_give isl_map *specializer(struct isl_sched_node *src,  in specializer()
3138 	struct isl_sched_node *dst)  in specializer()
3400 	int (*pred)(struct isl_sched_node *node, int data), int data)  in isl_sched_graph_domain()
3482 	int (*node_pred)(struct isl_sched_node *node, int data), int data)  in copy_nodes()
3540 		struct isl_sched_node *dst_src, *dst_dst;  in copy_edges()
3600 		struct isl_sched_node *node = &graph->node[i];  in isl_sched_graph_compute_maxvar()
3619 	int (*node_pred)(struct isl_sched_node *node, int data),  in isl_sched_graph_extract_sub_graph()
3672 	int (*node_pred)(struct isl_sched_node *node, int data),  in compute_sub_schedule()
3721 		struct isl_sched_node *node = &graph->node[i];  in reset_band()
3880 	struct isl_sched_node *node, __isl_take isl_basic_set *coef, int pos)  in add_intra_constraints()
3925 	struct isl_sched_node *src, struct isl_sched_node *dst,  in add_inter_constraints()
4000 static struct isl_sched_node *graph_find_compressed_node(isl_ctx *ctx,  in graph_find_compressed_node()
4004 	struct isl_sched_node *node;  in graph_find_compressed_node()
4063 	struct isl_sched_node *node;  in lp_add_intra()
4087 	struct isl_sched_node *src, *dst;  in lp_add_inter()
4210 		struct isl_sched_node *node = &graph->node[graph->sorted[i]];  in setup_carry_lp()
4303 		struct isl_sched_node *node = &graph->node[i];  in split_scaled()
4322 		struct isl_sched_node *node = &graph->node[i];  in split_scaled()
4354 static int is_trivial(struct isl_sched_node *node, __isl_keep isl_vec *sol)  in is_trivial()
4387 		struct isl_sched_node *node = &graph->node[i];  in is_any_trivial()
4409 static int find_node_coalescing(struct isl_sched_node *node,  in find_node_coalescing()
4467 	__isl_take isl_tab_lexmin *tl, struct isl_sched_node *node, int pos)  in zero_out_node_coef()
4612 			struct isl_sched_node *node = &graph->node[i];  in non_neg_lexmin()
4646 	struct isl_sched_node *node = edge->src;  in add_intra()
4695 	struct isl_sched_node *node;  in collect_bounds()
5401 static __isl_give isl_map *final_row(struct isl_sched_node *node)  in final_row()