Home | History | Annotate | Download | only in dist

Lines Matching refs:coincidence

143 /* Is "edge" marked as a coincidence edge?
2132 * If "use_coincidence" is set, then coincidence edges are treated
2147 * If "use_coincidence" is set, then we treat coincidence edges as local edges.
2193 * If "use_coincidence" is set, then we treat coincidence edges as local edges.
2319 * If "use_coincidence" is set, then we treat coincidence edges as local edges.
2382 * "use_coincidence" is set if we should take into account coincidence edges.
2432 * If "use_coincidence" is set, then we treat coincidence edges as local edges.
2756 * If "use_coincidence" is set, then we treat coincidence edges as local edges.
2970 * row satisfies the coincidence constraints.
3797 * The partial schedules and the coincidence property are extracted
4924 * If "coincidence" is set, then coincidence edges are considered as well.
4928 struct isl_sched_edge *edge), int coincidence)
4941 (!coincidence || !is_coincidence(edge)))
4954 * If "coincidence" is set, then coincidence edges are considered as well.
4987 coincidence,
4994 intra = collect_validity(graph, &add_intra, coincidence);
5011 * If "coincidence" is set, then coincidence edges are considered as well.
5037 struct isl_sched_graph *graph, int coincidence,
5044 inter = collect_validity(graph, &add_inter, coincidence);
5089 * If "coincidence" is set, then try and carry coincidence edges as well.
5108 struct isl_sched_graph *graph, int fallback, int coincidence)
5115 carry.intra = collect_intra_validity(ctx, graph, coincidence,
5117 carry.inter = collect_inter_validity(graph, coincidence,
5154 * If "coincidence" is set, then try and carry coincidence edges as well.
5182 struct isl_sched_graph *graph, int fallback, int coincidence)
5192 sol = compute_carrying_sol(ctx, graph, fallback, coincidence);
5222 * If "coincidence" is set, then try and carry coincidence edges as well.
5226 int coincidence)
5228 return carry(node, graph, 1, coincidence);
5253 * coincidence dependences as possible are carried and
5396 /* Does "graph" contain any coincidence edge?
5578 * - if outer coincidence needs to be enforced, then try to carry as many
5579 * validity or coincidence dependences as possible and
5635 * many of the initial rows as possible satisfying the coincidence constraints.
5640 * outermost dimension to satisfy the coincidence constraints. If this