81 int isl_sched_edge_has_type(struct isl_sched_edge *edge,  in isl_sched_edge_has_type()
89 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type)  in set_type()
96 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type)  in clear_type()
103 static int is_validity(struct isl_sched_edge *edge)  in is_validity()
110 static void set_validity(struct isl_sched_edge *edge)  in set_validity()
117 int isl_sched_edge_is_proximity(struct isl_sched_edge *edge)  in isl_sched_edge_is_proximity()
124 static int is_local(struct isl_sched_edge *edge)  in is_local()
131 static void set_local(struct isl_sched_edge *edge)  in set_local()
138 static void clear_local(struct isl_sched_edge *edge)  in clear_local()
145 static int is_coincidence(struct isl_sched_edge *edge)  in is_coincidence()
152 int isl_sched_edge_is_condition(struct isl_sched_edge *edge)  in isl_sched_edge_is_condition()
159 int isl_sched_edge_is_conditional_validity(struct isl_sched_edge *edge)  in isl_sched_edge_is_conditional_validity()
171 static int is_multi_edge_type(struct isl_sched_edge *edge)  in is_multi_edge_type()
236 	const struct isl_sched_edge *edge = entry;  in edge_has_src_and_dst()  local
246 	struct isl_sched_edge *edge)  in graph_edge_table_add()
267 	struct isl_sched_graph *graph, struct isl_sched_edge *edge)  in graph_edge_tables_add()
348 	struct isl_sched_edge *edge;  in graph_has_edge()  local
372 	struct isl_sched_edge *edge;  in graph_find_matching_edge()  local
395 	struct isl_sched_edge *edge)  in graph_remove_edge()
1272 	struct isl_sched_edge *edge;  in extract_edge()  local
1680 	struct isl_sched_graph *graph, struct isl_sched_edge *edge,  in inter_coefficients()
1904 	struct isl_sched_edge *edge)  in add_intra_validity_constraints()
1941 	struct isl_sched_edge *edge)  in add_inter_validity_constraints()
2018 	struct isl_sched_edge *edge, int s, int local)  in add_intra_proximity_constraints()
2097 	struct isl_sched_edge *edge, int s, int local)  in add_inter_proximity_constraints()
2135 static int force_zero(struct isl_sched_edge *edge, int use_coincidence)  in force_zero()
2156 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_validity_constraints()  local
2169 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_validity_constraints()  local
2202 		struct isl_sched_edge *edge = &graph->edge[i];  in add_all_proximity_constraints()  local
2302 static int is_any_validity(struct isl_sched_edge *edge)  in is_any_validity()
2322 static int edge_multiplicity(struct isl_sched_edge *edge, int use_coincidence)  in edge_multiplicity()
2341 static int parametric_intra_edge_multiplicity(struct isl_sched_edge *edge,  in parametric_intra_edge_multiplicity()
2385 	struct isl_sched_edge *edge, __isl_take isl_map *map,  in count_map_constraints()
2442 		struct isl_sched_edge *edge = &graph->edge[i];  in count_constraints()  local
3187 	struct isl_sched_edge *edge)  in update_edge()
3266 static int is_condition_false(struct isl_sched_edge *edge)  in is_condition_false()
3541 	int (*edge_pred)(struct isl_sched_edge *edge, int data), int data)  in copy_edges()
3547 		struct isl_sched_edge *edge = &src->edge[i];  in copy_edges()  local
3631 	int (*edge_pred)(struct isl_sched_edge *edge, int data),  in isl_sched_graph_extract_sub_graph()
3684 	int (*edge_pred)(struct isl_sched_edge *edge, int data),  in compute_sub_schedule()
3705 int isl_sched_edge_scc_exactly(struct isl_sched_edge *edge, int scc)  in isl_sched_edge_scc_exactly()
3710 static int edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc)  in edge_dst_scc_at_most()
3715 static int edge_src_scc_at_least(struct isl_sched_edge *edge, int scc)  in edge_src_scc_at_least()
4654 	struct isl_sched_edge *edge)  in add_intra()
4674 	struct isl_sched_edge *edge)  in add_inter()
4928 		struct isl_sched_edge *edge), int coincidence)  in collect_validity()
4938 		struct isl_sched_edge *edge = &graph->edge[i];  in collect_validity()  local
5433 	struct isl_sched_edge *edge = &graph->edge[edge_index];  in is_violated()  local