reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
210 static int is_type(struct isl_sched_edge *edge, enum isl_edge_type type) 217 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type) 224 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type) 231 static int is_validity(struct isl_sched_edge *edge) 238 static void set_validity(struct isl_sched_edge *edge) 245 static int is_proximity(struct isl_sched_edge *edge) 252 static int is_local(struct isl_sched_edge *edge) 259 static void set_local(struct isl_sched_edge *edge) 266 static void clear_local(struct isl_sched_edge *edge) 273 static int is_coincidence(struct isl_sched_edge *edge) 280 static int is_condition(struct isl_sched_edge *edge) 287 static int is_conditional_validity(struct isl_sched_edge *edge) 299 static int is_multi_edge_type(struct isl_sched_edge *edge) 379 struct isl_sched_edge *edge; 453 const struct isl_sched_edge *edge = entry; 454 const struct isl_sched_edge *temp = val; 463 struct isl_sched_edge *edge) 484 struct isl_sched_graph *graph, struct isl_sched_edge *edge) 526 struct isl_sched_edge temp = { .src = src, .dst = dst }; 540 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, 560 struct isl_sched_edge *edge; 580 static struct isl_sched_edge *graph_find_matching_edge( 581 struct isl_sched_graph *graph, struct isl_sched_edge *model) 584 struct isl_sched_edge *edge; 605 struct isl_sched_edge *edge) 1133 static int merge_edge(struct isl_sched_edge *edge1, 1134 struct isl_sched_edge *edge2) 1312 struct isl_sched_edge *edge; 1693 struct isl_sched_graph *graph, struct isl_sched_edge *edge, 1920 struct isl_sched_edge *edge) 1956 struct isl_sched_edge *edge) 2032 struct isl_sched_edge *edge, int s, int local) 2110 struct isl_sched_edge *edge, int s, int local) 2147 static int force_zero(struct isl_sched_edge *edge, int use_coincidence) 2168 struct isl_sched_edge *edge = &graph->edge[i]; 2181 struct isl_sched_edge *edge = &graph->edge[i]; 2214 struct isl_sched_edge *edge = &graph->edge[i]; 2304 static int is_any_validity(struct isl_sched_edge *edge) 2323 static int edge_multiplicity(struct isl_sched_edge *edge, int use_coincidence) 2341 static int parametric_intra_edge_multiplicity(struct isl_sched_edge *edge, 2380 struct isl_sched_edge *edge, __isl_take isl_map *map, 2437 struct isl_sched_edge *edge = &graph->edge[i]; 3165 struct isl_sched_edge *edge) 3243 static int is_condition_false(struct isl_sched_edge *edge) 3508 int (*edge_pred)(struct isl_sched_edge *edge, int data), int data) 3514 struct isl_sched_edge *edge = &src->edge[i]; 3595 int (*edge_pred)(struct isl_sched_edge *edge, int data), 3648 int (*edge_pred)(struct isl_sched_edge *edge, int data), 3669 static int edge_scc_exactly(struct isl_sched_edge *edge, int scc) 3674 static int edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc) 3679 static int edge_src_scc_at_least(struct isl_sched_edge *edge, int scc) 4614 struct isl_sched_edge *edge) 4639 struct isl_sched_edge *edge) 4895 struct isl_sched_edge *edge), int coincidence) 4905 struct isl_sched_edge *edge = &graph->edge[i]; 5407 struct isl_sched_edge *edge = &graph->edge[edge_index]; 5816 static isl_bool is_non_empty_proximity(struct isl_sched_edge *edge) 5844 struct isl_sched_edge *edge = &graph->edge[i]; 6086 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, 6113 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, 6152 struct isl_sched_edge *edge, __isl_keep isl_union_map *cluster_map, 6203 struct isl_sched_edge *edge = &graph->edge[i]; 6556 static isl_bool has_bounded_distances(isl_ctx *ctx, struct isl_sched_edge *edge, 6628 struct isl_sched_edge *edge = &graph->edge[i]; 6879 struct isl_sched_edge *merge_edge) 6884 struct isl_sched_edge *edge = &graph->edge[i]; 6950 static int edge_cluster_exactly(struct isl_sched_edge *edge, int cluster) 7092 struct isl_sched_edge *edge = &graph->edge[i];