reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
377 struct isl_sched_graph *root; 400 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) 428 struct isl_sched_graph *graph, __isl_keep isl_space *space) 445 static int is_node(struct isl_sched_graph *graph, 462 struct isl_sched_graph *graph, enum isl_edge_type type, 484 struct isl_sched_graph *graph, struct isl_sched_edge *edge) 501 static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) 520 struct isl_sched_graph *graph, 540 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, 556 static isl_bool graph_has_edge(struct isl_sched_graph *graph, 581 struct isl_sched_graph *graph, struct isl_sched_edge *model) 604 static void graph_remove_edge(struct isl_sched_graph *graph, 625 static isl_bool graph_has_any_edge(struct isl_sched_graph *graph, 651 static isl_bool graph_has_validity_edge(struct isl_sched_graph *graph, 667 static isl_stat graph_alloc(isl_ctx *ctx, struct isl_sched_graph *graph, 700 static void clear_node(struct isl_sched_graph *graph, 718 static void graph_free(isl_ctx *ctx, struct isl_sched_graph *graph) 750 struct isl_sched_graph *graph = user; 768 static isl_stat compute_max_row(struct isl_sched_graph *graph, 992 static isl_stat add_node(struct isl_sched_graph *graph, 1091 struct isl_sched_graph *graph = user; 1125 struct isl_sched_graph *graph; 1242 struct isl_sched_graph *graph, __isl_keep isl_map *map) 1258 struct isl_sched_graph *graph, __isl_keep isl_map *map) 1310 struct isl_sched_graph *graph = data->graph; 1387 static isl_stat graph_init(struct isl_sched_graph *graph, 1454 struct isl_sched_graph *graph = user; 1467 struct isl_sched_graph *graph = user; 1475 static isl_stat detect_ccs(isl_ctx *ctx, struct isl_sched_graph *graph, 1507 static isl_stat detect_sccs(isl_ctx *ctx, struct isl_sched_graph *graph) 1517 static isl_stat detect_wccs(isl_ctx *ctx, struct isl_sched_graph *graph) 1525 struct isl_sched_graph *graph = data; 1534 static int sort_sccs(struct isl_sched_graph *graph) 1640 struct isl_sched_graph *graph, struct isl_sched_node *node, 1693 struct isl_sched_graph *graph, struct isl_sched_edge *edge, 1814 struct isl_sched_graph *graph, struct isl_sched_node *node, 1854 struct isl_sched_graph *graph, struct isl_sched_node *src, 1919 static isl_stat add_intra_validity_constraints(struct isl_sched_graph *graph, 1955 static isl_stat add_inter_validity_constraints(struct isl_sched_graph *graph, 2031 static isl_stat add_intra_proximity_constraints(struct isl_sched_graph *graph, 2109 static isl_stat add_inter_proximity_constraints(struct isl_sched_graph *graph, 2162 static int add_all_validity_constraints(struct isl_sched_graph *graph, 2208 static int add_all_proximity_constraints(struct isl_sched_graph *graph, 2379 static isl_stat count_map_constraints(struct isl_sched_graph *graph, 2430 static int count_constraints(struct isl_sched_graph *graph, 2455 struct isl_sched_graph *graph, int *n_eq, int *n_ineq) 2472 struct isl_sched_graph *graph) 2507 struct isl_sched_graph *graph, int *n_eq, int *n_ineq) 2552 struct isl_sched_graph *graph, struct isl_sched_node *node, int max) 2619 struct isl_sched_graph *graph) 2642 static isl_stat add_sum_constraint(struct isl_sched_graph *graph, 2664 static isl_stat add_param_sum_constraint(struct isl_sched_graph *graph, 2690 static isl_stat add_var_sum_constraint(struct isl_sched_graph *graph, 2744 static isl_stat setup_lp(isl_ctx *ctx, struct isl_sched_graph *graph, 2807 struct isl_sched_graph *graph = user; 2841 static int needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node) 2888 static __isl_give isl_vec *solve_lp(isl_ctx *ctx, struct isl_sched_graph *graph) 2954 static int update_schedule(struct isl_sched_graph *graph, 3164 static isl_stat update_edge(isl_ctx *ctx, struct isl_sched_graph *graph, 3275 static int unconditionalize_adjacent_validity(struct isl_sched_graph *graph, 3327 static int update_edges(isl_ctx *ctx, struct isl_sched_graph *graph) 3378 static void next_band(struct isl_sched_graph *graph) 3387 struct isl_sched_graph *graph, 3419 struct isl_sched_graph *graph) 3439 struct isl_sched_graph *graph) 3458 static isl_stat copy_nodes(struct isl_sched_graph *dst, 3459 struct isl_sched_graph *src, 3506 static isl_stat copy_edges(isl_ctx *ctx, struct isl_sched_graph *dst, 3507 struct isl_sched_graph *src, 3570 static int compute_maxvar(struct isl_sched_graph *graph) 3593 static isl_stat extract_sub_graph(isl_ctx *ctx, struct isl_sched_graph *graph, 3596 int data, struct isl_sched_graph *sub) 3629 struct isl_sched_graph *graph); 3631 isl_schedule_node *node, struct isl_sched_graph *graph); 3646 struct isl_sched_graph *graph, 3651 struct isl_sched_graph split = { 0 }; 3686 static isl_stat reset_band(struct isl_sched_graph *graph) 3725 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 3775 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 3826 struct isl_sched_graph *graph, int permutable) 3862 static isl_stat add_intra_constraints(struct isl_sched_graph *graph, 3905 static isl_stat add_inter_constraints(struct isl_sched_graph *graph, 3980 struct isl_sched_graph *graph, __isl_keep isl_space *space) 4022 struct isl_sched_graph *graph; 4089 static isl_stat add_all_constraints(isl_ctx *ctx, struct isl_sched_graph *graph, 4177 static isl_stat setup_carry_lp(isl_ctx *ctx, struct isl_sched_graph *graph, 4234 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 4254 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 4352 static int is_any_trivial(struct isl_sched_graph *graph, 4540 static __isl_give isl_vec *non_neg_lexmin(struct isl_sched_graph *graph, 4666 struct isl_sched_graph *graph; 4700 struct isl_sched_graph *graph, __isl_take isl_union_set *delta) 4893 static __isl_give isl_union_map *collect_validity(struct isl_sched_graph *graph, 4965 struct isl_sched_graph *graph, int coincidence, 5015 struct isl_sched_graph *graph, int coincidence, 5047 struct isl_sched_graph *graph, int n_edge, 5086 struct isl_sched_graph *graph, int fallback, int coincidence) 5160 struct isl_sched_graph *graph, int fallback, int coincidence) 5203 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 5215 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 5225 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 5236 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 5254 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 5296 static int has_validity_edges(struct isl_sched_graph *graph) 5319 static int need_feautrier_step(isl_ctx *ctx, struct isl_sched_graph *graph) 5339 isl_schedule_node *node, struct isl_sched_graph *graph) 5346 static void clear_local_edges(struct isl_sched_graph *graph) 5357 static int need_condition_check(struct isl_sched_graph *graph) 5375 static int has_any_coincidence(struct isl_sched_graph *graph) 5404 static int is_violated(struct isl_sched_graph *graph, int edge_index) 5435 static int has_adjacent_true_conditions(struct isl_sched_graph *graph, 5488 struct isl_sched_graph *graph) 5568 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 5634 struct isl_sched_graph *graph) 5703 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 5740 struct isl_sched_graph *scc; 5741 struct isl_sched_graph *cluster; 5756 struct isl_sched_graph *graph) 5808 static int bad_cluster(struct isl_sched_graph *graph) 5838 static int find_proximity(struct isl_sched_graph *graph, 5885 struct isl_sched_graph *graph; 5903 struct isl_sched_graph *graph = data->graph; 5938 static isl_stat mark_merge_sccs(isl_ctx *ctx, struct isl_sched_graph *graph, 5995 static __isl_give isl_space *cluster_space(struct isl_sched_graph *scc, int i) 6019 struct isl_sched_graph *graph, struct isl_clustering *c) 6046 struct isl_sched_graph *graph, struct isl_clustering *c) 6196 struct isl_sched_graph *graph, int *scc_in_merge, 6226 static isl_stat init_merge_graph(isl_ctx *ctx, struct isl_sched_graph *graph, 6227 struct isl_clustering *c, struct isl_sched_graph *merge_graph) 6266 struct isl_sched_graph *scc; 6306 struct isl_sched_graph *scc; 6348 struct isl_sched_graph *merge_graph, struct isl_clustering *c) 6372 static int get_n_coincident(struct isl_sched_graph *graph) 6392 struct isl_sched_graph *merge_graph) 6428 struct isl_sched_graph *merge_graph) 6557 struct isl_sched_graph *graph, struct isl_clustering *c, 6558 struct isl_sched_graph *merge_graph) 6622 struct isl_sched_graph *graph, struct isl_clustering *c, 6623 struct isl_sched_graph *merge_graph) 6667 static isl_bool ok_to_merge(isl_ctx *ctx, struct isl_sched_graph *graph, 6668 struct isl_clustering *c, struct isl_sched_graph *merge_graph) 6735 static isl_stat transform(isl_ctx *ctx, struct isl_sched_graph *graph, 6778 struct isl_sched_graph *merge_graph) 6839 static isl_bool try_merge(isl_ctx *ctx, struct isl_sched_graph *graph, 6842 struct isl_sched_graph merge_graph = { 0 }; 6878 static int any_no_merge(struct isl_sched_graph *graph, int *scc_in_merge, 6920 struct isl_sched_graph *graph, int edge, struct isl_clustering *c) 6986 static isl_stat copy_partial(struct isl_sched_graph *graph, 7018 struct isl_sched_graph *graph = user; 7040 static isl_stat extract_clusters(isl_ctx *ctx, struct isl_sched_graph *graph, 7084 static isl_stat compute_weights(struct isl_sched_graph *graph, 7150 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 7195 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 7247 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) 7289 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, 7337 struct isl_sched_graph *graph) 7378 struct isl_sched_graph graph = { 0 };