/* Construct a contraction from "prefix" and "domain" for a new group
* in "grouping".
*
* The values of the prefix schedule "prefix" are used as instances
* of the new group. The identifier of the group is constructed
* in such a way that it does not conflict with those of earlier
* groups nor with statements in the domain of the original
* schedule constraints.
* The isl_multi_union_pw_aff "prefix" then simply needs to be
* converted to an isl_union_pw_multi_aff. However, this is not
* possible if "prefix" is zero-dimensional, so in this case,
* a contraction is constructed from "domain" instead.
*/
static isl_union_pw_multi_aff *group_contraction_from_prefix_and_domain(
struct ppcg_grouping *grouping,
__isl_keep isl_multi_union_pw_aff *prefix,
__isl_keep isl_union_set *domain)
{
isl_id *id;
isl_space *space;
int dim;
space = isl_multi_union_pw_aff_get_space(prefix);
if (!space)
return NULL;
dim = isl_space_dim(space, isl_dim_set);
id = construct_group_id(grouping, space);
if (dim == 0) {
isl_multi_val *mv;
space = isl_multi_union_pw_aff_get_space(prefix);
space = isl_space_set_tuple_id(space, isl_dim_set, id);
mv = isl_multi_val_zero(space);
domain = isl_union_set_copy(domain);
return isl_union_pw_multi_aff_multi_val_on_domain(domain, mv);
}
prefix = isl_multi_union_pw_aff_copy(prefix);
prefix = isl_multi_union_pw_aff_set_tuple_id(prefix, isl_dim_out, id);
return isl_union_pw_multi_aff_from_multi_union_pw_aff(prefix);
}
/* Given a relation "map" between instances of two statements A and B,
* are pairs of related instances executed together in the input schedule?
* That is, is each pair of instances assigned the same value
* by the corresponding prefix schedules?
*
* In particular, select the subset of "map" that has pairs of elements
* with the same value for the prefix schedules and then check
* if "map" is still a subset of the result.
*/
static isl_bool matches_prefix(__isl_keep isl_map *map,
struct ppcg_grouping_leaf *src, struct ppcg_grouping_leaf *dst)
{
isl_union_map *umap, *equal;
isl_multi_union_pw_aff *src_prefix, *dst_prefix, *prefix;
isl_bool is_subset;
src_prefix = isl_multi_union_pw_aff_copy(src->prefix);
dst_prefix = isl_multi_union_pw_aff_copy(dst->prefix);
prefix = isl_multi_union_pw_aff_union_add(src_prefix, dst_prefix);
umap = isl_union_map_from_map(isl_map_copy(map));
equal = isl_union_map_copy(umap);
equal = isl_union_map_eq_at_multi_union_pw_aff(equal, prefix);
is_subset = isl_union_map_is_subset(umap, equal);
isl_union_map_free(umap);
isl_union_map_free(equal);
return is_subset;
}
/* Create a duplicate of the given isl_schedule_band.
*/
__isl_give isl_schedule_band *isl_schedule_band_dup(
__isl_keep isl_schedule_band *band)
{
int i;
isl_ctx *ctx;
isl_schedule_band *dup;
if (!band)
return NULL;
ctx = isl_schedule_band_get_ctx(band);
dup = isl_schedule_band_alloc(ctx);
if (!dup)
return NULL;
dup->n = band->n;
dup->coincident = isl_alloc_array(ctx, int, band->n);
if (band->n && !dup->coincident)
return isl_schedule_band_free(dup);
for (i = 0; i < band->n; ++i)
dup->coincident[i] = band->coincident[i];
dup->permutable = band->permutable;
dup->mupa = isl_multi_union_pw_aff_copy(band->mupa);
dup->ast_build_options = isl_union_set_copy(band->ast_build_options);
if (!dup->mupa || !dup->ast_build_options)
return isl_schedule_band_free(dup);
if (band->loop_type) {
dup->loop_type = isl_alloc_array(ctx,
enum isl_ast_loop_type, band->n);
if (band->n && !dup->loop_type)
return isl_schedule_band_free(dup);
for (i = 0; i < band->n; ++i)
dup->loop_type[i] = band->loop_type[i];
}
