/*
* Each test case should name statements S_0, S_1, ...
*/
int test2()
{
printf("TEST 2\n");
isl_ctx *ctx = isl_ctx_alloc();
isl_union_set *domains = isl_union_set_read_from_str(ctx,
"[p_0, p_1, p_2, p_3, p_4, p_5, p_7] -> { S_1[i0, i1] : i0 >= 0 and i0 <= p_0 and i1 >= 0 and i1 <= p_3 and p_2 >= 0; S_0[i0] : i0 >= 0 and i0 <= p_0}");
isl_union_map *deps = isl_union_map_read_from_str(ctx, "[p_0, p_1, p_2, p_3, p_4, p_5, p_7] -> { S_0[i0] -> S_1[o0, o1] : (exists (e0 = [(p_7)/8]: 8o1 = -p_5 + p_7 + 8192i0 - 8192o0 and 8e0 = p_7 and i0 >= 0 and o0 <= p_0 and 8192o0 >= -8p_3 - p_5 + p_7 + 8192i0 and 8192o0 <= -p_5 + p_7 + 8192i0 and p_2 >= 0 and o0 >= 1 + i0)); S_1[i0, i1] -> S_0[o0] : (exists (e0 = [(p_1)/8], e1 = [(p_4)/8], e2 = [(-p_1 + p_7)/8184]: 8192o0 = p_5 - p_7 + 8192i0 + 8i1 and 8e0 = p_1 and 8e1 = p_4 and 8184e2 = -p_1 + p_7 and i1 >= 0 and 8i1 <= 8192p_0 - p_5 + p_7 - 8192i0 and 8184i1 >= 1024 + 1024p_1 - 1023p_5 - p_7 - 8380416i0 and p_2 >= 0 and p_7 <= -1 + p_5 and 8i1 >= 1 + 8p_3 + p_4 - p_5 - 8192i0 and i1 <= p_3 and i0 >= 0 and 8i1 >= 8192 - p_5 + p_7))}");
isl_union_map *schedule = pluto_schedule(domains, deps, options);
if (schedule) {
isl_printer *printer = isl_printer_to_file(ctx, stdout);
isl_printer_print_union_map(printer, schedule);
printf("\n");
isl_printer_free(printer);
// Check if the schedule can be applied to the domain.
domains = isl_union_set_apply(domains, schedule);
}else{
printf("No schedule\n");
}
isl_union_set_free(domains);
isl_union_map_free(deps);
isl_ctx_free(ctx);
}
/* Clear all memory allocated by "grouping".
*/
static void ppcg_grouping_clear(struct ppcg_grouping *grouping)
{
isl_union_map_free(grouping->dep);
isl_union_set_free(grouping->domain);
isl_union_pw_multi_aff_free(grouping->contraction);
isl_schedule_free(grouping->schedule);
}
/* Free all memory allocated for "leaves".
*/
static void ppcg_grouping_leaf_free(int n, struct ppcg_grouping_leaf leaves[n])
{
int i;
if (!leaves)
return;
for (i = 0; i < n; ++i) {
isl_union_set_free(leaves[i].domain);
isl_union_set_list_free(leaves[i].list);
isl_multi_union_pw_aff_free(leaves[i].prefix);
}
free(leaves);
}
/* Construct a unique identifier for a group in "grouping".
*
* The name is of the form G_n, with n the first value starting at
* grouping->group_id that does not result in an identifier
* that is already in use in the domain of the original schedule
* constraints.
*/
static isl_id *construct_group_id(struct ppcg_grouping *grouping,
__isl_take isl_space *space)
{
isl_ctx *ctx;
isl_id *id;
isl_bool empty;
isl_union_set *domain;
if (!space)
return NULL;
ctx = isl_space_get_ctx(space);
domain = isl_schedule_constraints_get_domain(grouping->sc);
do {
char buffer[20];
isl_id *id;
isl_set *set;
snprintf(buffer, sizeof(buffer), "G_%d", grouping->group_id);
grouping->group_id++;
id = isl_id_alloc(ctx, buffer, NULL);
space = isl_space_set_tuple_id(space, isl_dim_set, id);
set = isl_union_set_extract_set(domain, isl_space_copy(space));
empty = isl_set_plain_is_empty(set);
isl_set_free(set);
} while (empty >= 0 && !empty);
if (empty < 0)
space = isl_space_free(space);
id = isl_space_get_tuple_id(space, isl_dim_set);
isl_space_free(space);
isl_union_set_free(domain);
return id;
}
void test1()
{
isl_ctx *ctx = isl_ctx_alloc();
isl_union_set *domains = isl_union_set_read_from_str(ctx,
"[n] -> {S_1[i0, i1] : i0 >= 0 and i0 <= 99 and i1 >= 0 and i1 <= 99; S_0[i0] : i0 >= 0 and i0 <= 99; S_2[i0] : i0 >= 0 and i0 <= 99 }");
isl_union_map *deps = isl_union_map_read_from_str(ctx, "[n] -> {S_1[i0, 99] -> S_0[1 + i0] : i0 >= 0 and i0 <= 98; S_1[i0, i1] -> S_1[i0, 1 + i1] : i0 >= 0 and i0 <= 99 and i1 >= 0 and i1 <= 98; S_1[i0, 99] -> S_1[1 + i0, 0] : i0 >= 0 and i0 <= 98; S_0[i0] -> S_1[i0, 0] : i0 >= 0 and i0 <= 99; S_2[i0] -> S_1[1 + i0, 0] : i0 >= 0 and i0 <= 98; S_0[i0] -> S_2[i0] : i0 >= 0 and i0 <= 99; S_1[i0, 99] -> S_2[i0] : i0 >= 0 and i0 <= 99 }");
isl_union_map *schedule = pluto_schedule(domains, deps, options);
isl_printer *printer = isl_printer_to_file(ctx, stdout);
isl_printer_print_union_map(printer, schedule);
printf("\n");
isl_printer_free(printer);
// Check if the schedule can be applied to the domain.
domains = isl_union_set_apply(domains, schedule);
isl_union_set_free(domains);
isl_union_map_free(deps);
isl_ctx_free(ctx);
}
static void isl_obj_union_set_free(void *v)
{
isl_union_set_free((isl_union_set *)v);
}