179 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()
394 static isl_stat graph_remove_edge(struct isl_sched_graph *graph,  in graph_remove_edge()
419 static isl_bool graph_has_any_edge(struct isl_sched_graph *graph,  in graph_has_any_edge()
445 isl_bool isl_sched_graph_has_validity_edge(struct isl_sched_graph *graph,  in isl_sched_graph_has_validity_edge()
461 static isl_stat graph_alloc(isl_ctx *ctx, struct isl_sched_graph *graph,  in graph_alloc()
494 static void clear_node(struct isl_sched_graph *graph,  in clear_node()
512 void isl_sched_graph_free(isl_ctx *ctx, struct isl_sched_graph *graph)  in isl_sched_graph_free()
544 	struct isl_sched_graph *graph = user;  in init_n_maxvar()  local
564 static isl_stat compute_max_row(struct isl_sched_graph *graph,  in compute_max_row()
972 static isl_stat add_node(struct isl_sched_graph *graph,  in add_node()
1042 	struct isl_sched_graph *graph = user;  in extract_node()  local
1078 	struct isl_sched_graph *graph;  member
1196 	struct isl_sched_graph *graph, __isl_keep isl_map *map)  in find_domain_node()
1212 	struct isl_sched_graph *graph, __isl_keep isl_map *map)  in find_range_node()
1264 	struct isl_sched_graph *graph = data->graph;  in extract_edge()  local
1342 isl_stat isl_sched_graph_init(struct isl_sched_graph *graph,  in isl_sched_graph_init()
1416 	struct isl_sched_graph *graph = user;  in node_follows_weak()  local
1429 	struct isl_sched_graph *graph = user;  in node_follows_strong()  local
1439 	struct isl_sched_graph *graph,  in isl_sched_graph_detect_ccs()
1471 static isl_stat detect_sccs(isl_ctx *ctx, struct isl_sched_graph *graph)  in detect_sccs()
1481 static isl_stat detect_wccs(isl_ctx *ctx, struct isl_sched_graph *graph)  in detect_wccs()
1489 	struct isl_sched_graph *graph = data;  in cmp_scc()  local
1498 static int sort_sccs(struct isl_sched_graph *graph)  in sort_sccs()
1621 	struct isl_sched_graph *graph, struct isl_sched_node *node,  in intra_coefficients()
1669 	struct isl_sched_graph *graph, struct isl_sched_edge *edge,  in inter_coefficients()
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()
1892 static isl_stat add_intra_validity_constraints(struct isl_sched_graph *graph,  in add_intra_validity_constraints()
1929 static isl_stat add_inter_validity_constraints(struct isl_sched_graph *graph,  in add_inter_validity_constraints()
2006 static isl_stat add_intra_proximity_constraints(struct isl_sched_graph *graph,  in add_intra_proximity_constraints()
2085 static isl_stat add_inter_proximity_constraints(struct isl_sched_graph *graph,  in add_inter_proximity_constraints()
2139 static int add_all_validity_constraints(struct isl_sched_graph *graph,  in add_all_validity_constraints()
2185 static int add_all_proximity_constraints(struct isl_sched_graph *graph,  in add_all_proximity_constraints()
2373 static isl_stat count_map_constraints(struct isl_sched_graph *graph,  in count_map_constraints()
2424 static int count_constraints(struct isl_sched_graph *graph,  in count_constraints()
2449 	struct isl_sched_graph *graph, int *n_eq, int *n_ineq)  in count_bound_constant_constraints()
2466 	struct isl_sched_graph *graph)  in add_bound_constant_constraints()
2503 	struct isl_sched_graph *graph, int *n_eq, int *n_ineq)  in count_bound_coefficient_constraints()
2548 	struct isl_sched_graph *graph, struct isl_sched_node *node, int max)  in node_add_coefficient_constraints()
2617 	struct isl_sched_graph *graph)  in add_bound_coefficient_constraints()
2640 static isl_stat add_sum_constraint(struct isl_sched_graph *graph,  in add_sum_constraint()
2664 static isl_stat add_param_sum_constraint(struct isl_sched_graph *graph,  in add_param_sum_constraint()
2692 static isl_stat add_var_sum_constraint(struct isl_sched_graph *graph,  in add_var_sum_constraint()
2748 static isl_stat setup_lp(isl_ctx *ctx, struct isl_sched_graph *graph,  in setup_lp()
2813 	struct isl_sched_graph *graph = user;  in check_conflict()  local
2847 static int needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node)  in needs_row()
2895 static __isl_give isl_vec *solve_lp(isl_ctx *ctx, struct isl_sched_graph *graph)  in solve_lp()
2961 static int update_schedule(struct isl_sched_graph *graph,  in update_schedule()
3175 static isl_stat update_edge(isl_ctx *ctx, struct isl_sched_graph *graph,  in update_edge()
3287 static int unconditionalize_adjacent_validity(struct isl_sched_graph *graph,  in unconditionalize_adjacent_validity()
3339 static int update_edges(isl_ctx *ctx, struct isl_sched_graph *graph)  in update_edges()
3390 static void next_band(struct isl_sched_graph *graph)  in next_band()
3399 	struct isl_sched_graph *graph,  in isl_sched_graph_domain()
3431 	struct isl_sched_graph *graph, int scc)  in isl_sched_graph_extract_scc()
3441 	struct isl_sched_graph *graph)  in isl_sched_graph_extract_sccs()
3461 	struct isl_sched_graph *graph)  in extract_split()
3594 isl_stat isl_sched_graph_compute_maxvar(struct isl_sched_graph *graph)  in isl_sched_graph_compute_maxvar()
3618 	struct isl_sched_graph *graph,  in isl_sched_graph_extract_sub_graph()
3671 	struct isl_sched_graph *graph,  in compute_sub_schedule()
3711 static isl_stat reset_band(struct isl_sched_graph *graph)  in reset_band()
3750 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in compute_split_schedule()
3791 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph,  in insert_current_band()
3843 	struct isl_sched_graph *graph, int permutable)  in compute_next_band()
3879 static isl_stat add_intra_constraints(struct isl_sched_graph *graph,  in add_intra_constraints()
3924 static isl_stat add_inter_constraints(struct isl_sched_graph *graph,  in add_inter_constraints()
4001 	struct isl_sched_graph *graph, __isl_keep isl_space *space)  in graph_find_compressed_node()
4043 	struct isl_sched_graph *graph;  member
4110 static isl_stat add_all_constraints(isl_ctx *ctx, struct isl_sched_graph *graph,  in add_all_constraints()
4198 static isl_stat setup_carry_lp(isl_ctx *ctx, struct isl_sched_graph *graph,  in setup_carry_lp()
4275 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in split_scaled()
4381 static int is_any_trivial(struct isl_sched_graph *graph,  in is_any_trivial()
4569 static __isl_give isl_vec *non_neg_lexmin(struct isl_sched_graph *graph,  in non_neg_lexmin()
4685 	struct isl_sched_graph *graph;  member
4719 	struct isl_sched_graph *graph, __isl_take isl_union_set *delta)  in union_drop_coalescing_constraints()
4915 static __isl_give isl_union_map *collect_validity(struct isl_sched_graph *graph,  in collect_validity()
4976 	struct isl_sched_graph *graph, int coincidence,  in collect_intra_validity()
5026 	struct isl_sched_graph *graph, int coincidence,  in collect_inter_validity()
5058 	struct isl_sched_graph *graph, int n_edge,  in compute_carrying_sol_coef()
5097 	struct isl_sched_graph *graph, int fallback, int coincidence)  in compute_carrying_sol()
5171 	struct isl_sched_graph *graph, int fallback, int coincidence)  in carry()
5214 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph,  in carry_fallback()
5226 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in carry_feautrier()
5236 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in carry_dependences()
5247 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in carry_coincidence()
5266 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph,  in sort_statements()
5308 static int has_validity_edges(struct isl_sched_graph *graph)  in has_validity_edges()
5331 static int need_feautrier_step(isl_ctx *ctx, struct isl_sched_graph *graph)  in need_feautrier_step()
5351 	isl_schedule_node *node, struct isl_sched_graph *graph)  in compute_schedule_wcc_feautrier()
5358 static void clear_local_edges(struct isl_sched_graph *graph)  in clear_local_edges()
5369 static int need_condition_check(struct isl_sched_graph *graph)  in need_condition_check()
5387 static int has_any_coincidence(struct isl_sched_graph *graph)  in has_any_coincidence()
5419 static int is_violated(struct isl_sched_graph *graph, int edge_index)  in is_violated()
5450 static int has_adjacent_true_conditions(struct isl_sched_graph *graph,  in has_adjacent_true_conditions()
5503 	struct isl_sched_graph *graph)  in has_violated_conditional_constraint()
5584 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph,  in isl_schedule_node_compute_finish_band()
5650 	struct isl_sched_graph *graph)  in isl_schedule_node_compute_wcc_band()
5719 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in compute_schedule_wcc_whole()
5749 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph)  in compute_schedule_wcc()
5791 	__isl_take isl_schedule_node *node, struct isl_sched_graph *graph,  in compute_component_schedule()
5838 	struct isl_sched_graph *graph)  in compute_schedule()
5879 	struct isl_sched_graph graph = { 0 };  in isl_schedule_constraints_compute_schedule()  local