210 static int is_type(struct isl_sched_edge *edge, enum isl_edge_type type)  in is_type()
217 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type)  in set_type()
224 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type)  in clear_type()
231 static int is_validity(struct isl_sched_edge *edge)  in is_validity()
238 static void set_validity(struct isl_sched_edge *edge)  in set_validity()
245 static int is_proximity(struct isl_sched_edge *edge)  in is_proximity()
252 static int is_local(struct isl_sched_edge *edge)  in is_local()
259 static void set_local(struct isl_sched_edge *edge)  in set_local()
266 static void clear_local(struct isl_sched_edge *edge)  in clear_local()
273 static int is_coincidence(struct isl_sched_edge *edge)  in is_coincidence()
280 static int is_condition(struct isl_sched_edge *edge)  in is_condition()
287 static int is_conditional_validity(struct isl_sched_edge *edge)  in is_conditional_validity()
299 static int is_multi_edge_type(struct isl_sched_edge *edge)  in is_multi_edge_type()
379 	struct isl_sched_edge *edge;  member
457 	const struct isl_sched_edge *edge = entry;  in edge_has_src_and_dst()  local
467 	struct isl_sched_edge *edge)  in graph_edge_table_add()
488 	struct isl_sched_graph *graph, struct isl_sched_edge *edge)  in graph_edge_tables_add()
569 	struct isl_sched_edge *edge;  in graph_has_edge()  local
593 	struct isl_sched_edge *edge;  in graph_find_matching_edge()  local
616 	struct isl_sched_edge *edge)  in graph_remove_edge()
1486 	struct isl_sched_edge *edge;  in extract_edge()  local
1886 	struct isl_sched_graph *graph, struct isl_sched_edge *edge,  in inter_coefficients()
2110 	struct isl_sched_edge *edge)  in add_intra_validity_constraints()
2147 	struct isl_sched_edge *edge)  in add_inter_validity_constraints()
2224 	struct isl_sched_edge *edge, int s, int local)  in add_intra_proximity_constraints()
2303 	struct isl_sched_edge *edge, int s, int local)  in add_inter_proximity_constraints()
2341 static int force_zero(struct isl_sched_edge *edge, int use_coincidence)  in force_zero()
2362 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_validity_constraints()  local
2375 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_validity_constraints()  local
2408 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_proximity_constraints()  local
2508 static int is_any_validity(struct isl_sched_edge *edge)  in is_any_validity()
2527 static int edge_multiplicity(struct isl_sched_edge *edge, int use_coincidence)  in edge_multiplicity()
2545 static int parametric_intra_edge_multiplicity(struct isl_sched_edge *edge,  in parametric_intra_edge_multiplicity()
2589 	struct isl_sched_edge *edge, __isl_take isl_map *map,  in count_map_constraints()
2646 		struct isl_sched_edge *edge = &graph->edge[i];  in count_constraints()  local
3391 	struct isl_sched_edge *edge)  in update_edge()
3470 static int is_condition_false(struct isl_sched_edge *edge)  in is_condition_false()
3735 	int (*edge_pred)(struct isl_sched_edge *edge, int data), int data)  in copy_edges()
3741 		struct isl_sched_edge *edge = &src->edge[i];  in copy_edges()  local
3822 	int (*edge_pred)(struct isl_sched_edge *edge, int data),  in extract_sub_graph()
3875 	int (*edge_pred)(struct isl_sched_edge *edge, int data),  in compute_sub_schedule()
3896 static int edge_scc_exactly(struct isl_sched_edge *edge, int scc)  in edge_scc_exactly()
3901 static int edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc)  in edge_dst_scc_at_most()
3906 static int edge_src_scc_at_least(struct isl_sched_edge *edge, int scc)  in edge_src_scc_at_least()
4853 	struct isl_sched_edge *edge)  in add_intra()
4873 	struct isl_sched_edge *edge)  in add_inter()
5127 		struct isl_sched_edge *edge), int coincidence)  in collect_validity()
5137 		struct isl_sched_edge *edge = &graph->edge[i];  in collect_validity()  local
5630 	struct isl_sched_edge *edge = &graph->edge[edge_index];  in is_violated()  local
6039 static isl_bool is_non_empty_proximity(struct isl_sched_edge *edge)  in is_non_empty_proximity()
6067 		struct isl_sched_edge *edge = &graph->edge[i];  in find_proximity()  local
6162 	int edge, struct isl_clustering *c)  in mark_merge_sccs()
6309 	struct isl_sched_edge *edge, __isl_keep isl_union_map *umap,  in add_non_conditional_constraints()
6336 	struct isl_sched_edge *edge, __isl_keep isl_union_map *umap,  in add_conditional_constraints()
6375 	struct isl_sched_edge *edge, __isl_keep isl_union_map *cluster_map,  in collect_edge_constraints()
6426 		struct isl_sched_edge *edge = &graph->edge[i];  in collect_constraints()  local
6779 static isl_bool has_bounded_distances(isl_ctx *ctx, struct isl_sched_edge *edge,  in has_bounded_distances()
6854 		struct isl_sched_edge *edge = &graph->edge[i];  in ok_to_merge_proximity()  local
7115 		struct isl_sched_edge *edge = &graph->edge[i];  in any_no_merge()  local
7151 	struct isl_sched_graph *graph, int edge, struct isl_clustering *c)  in merge_clusters_along_edge()
7181 static int edge_cluster_exactly(struct isl_sched_edge *edge, int cluster)  in edge_cluster_exactly()
7323 		struct isl_sched_edge *edge = &graph->edge[i];  in compute_weights()  local