|
Polly 22.0.0git
|
#include <isl_scheduler.h>
Public Attributes | |
| isl_map * | map |
| isl_union_map * | tagged_condition |
| isl_union_map * | tagged_validity |
| struct isl_sched_node * | src |
| struct isl_sched_node * | dst |
| unsigned | types |
| int | start |
| int | end |
| int | no_merge |
| int | weight |
Definition at line 140 of file isl_scheduler.h.
| struct isl_sched_node* isl_sched_edge::dst |
Definition at line 146 of file isl_scheduler.h.
Referenced by add_all_proximity_constraints(), add_all_validity_constraints(), add_inter(), add_inter_proximity_constraints(), add_inter_validity_constraints(), add_intra(), add_scc_edge(), any_no_merge(), check_conflict(), collect_constraints(), compute_weights(), copy_edges(), count_map_constraints(), edge_cluster_exactly(), edge_dst_scc_at_most(), edge_has_src_and_dst(), extract_edge(), find_proximity(), graph_edge_table_add(), graph_find_edge_entry(), graph_find_matching_edge(), graph_has_edge(), graph_remove_edge(), has_bounded_distances(), inter_coefficients(), is_condition_false(), is_violated(), isl_sched_edge_scc_exactly(), mark_merge_sccs(), ok_to_merge_proximity(), parametric_intra_edge_multiplicity(), and update_edge().
| int isl_sched_edge::end |
Definition at line 151 of file isl_scheduler.h.
Referenced by add_inter_validity_constraints(), and check_conflict().
| isl_map* isl_sched_edge::map |
Definition at line 141 of file isl_scheduler.h.
Referenced by add_inter(), add_inter_proximity_constraints(), add_inter_validity_constraints(), add_intra(), add_intra_proximity_constraints(), add_intra_validity_constraints(), collect_edge_constraints(), compute_weights(), copy_edges(), count_constraints(), extract_edge(), graph_find_matching_edge(), graph_has_edge(), graph_remove_edge(), has_bounded_distances(), has_validity_edges(), is_non_empty_proximity(), is_violated(), isl_sched_graph_free(), merge_edge(), and update_edge().
| int isl_sched_edge::no_merge |
Definition at line 153 of file isl_scheduler.h.
Referenced by any_no_merge(), find_proximity(), and merge_clusters_along_edge().
| struct isl_sched_node* isl_sched_edge::src |
Definition at line 145 of file isl_scheduler.h.
Referenced by add_all_proximity_constraints(), add_all_validity_constraints(), add_inter(), add_inter_proximity_constraints(), add_inter_validity_constraints(), add_intra(), add_intra_proximity_constraints(), add_intra_validity_constraints(), add_scc_edge(), any_no_merge(), check_conflict(), collect_constraints(), compute_weights(), copy_edges(), count_map_constraints(), edge_cluster_exactly(), edge_has_src_and_dst(), edge_src_scc_at_least(), extract_edge(), find_proximity(), graph_edge_table_add(), graph_find_edge_entry(), graph_find_matching_edge(), graph_has_edge(), graph_remove_edge(), has_bounded_distances(), inter_coefficients(), is_condition_false(), is_violated(), isl_sched_edge_scc_exactly(), mark_merge_sccs(), ok_to_merge_proximity(), parametric_intra_edge_multiplicity(), and update_edge().
| int isl_sched_edge::start |
Definition at line 150 of file isl_scheduler.h.
Referenced by add_inter_validity_constraints(), check_conflict(), and transform().
| isl_union_map* isl_sched_edge::tagged_condition |
Definition at line 142 of file isl_scheduler.h.
Referenced by add_conditional_constraints(), copy_edges(), extract_edge(), has_adjacent_true_conditions(), is_condition_false(), isl_sched_graph_free(), merge_edge(), update_edge(), and update_edges().
| isl_union_map* isl_sched_edge::tagged_validity |
Definition at line 143 of file isl_scheduler.h.
Referenced by add_conditional_constraints(), copy_edges(), extract_edge(), has_violated_conditional_constraint(), isl_sched_graph_free(), merge_edge(), unconditionalize_adjacent_validity(), and update_edge().
| unsigned isl_sched_edge::types |
Definition at line 148 of file isl_scheduler.h.
Referenced by clear_type(), copy_edges(), extract_edge(), isl_sched_edge_has_type(), merge_edge(), and set_type().
| int isl_sched_edge::weight |
Definition at line 154 of file isl_scheduler.h.
Referenced by any_no_merge(), compute_weights(), find_proximity(), has_bounded_distances(), and merge_clusters_along_edge().