X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=isl_test.c;h=4d1bfd1a8462287a17396d9c07e7fe38914c02b5;hb=d17afdd1f5e49c0c5dcf6a6e0687330dcdc8e6bf;hp=0050848ead7677466b7e714757f8b9e3c3d05b83;hpb=3a37260f65351a47d453f33e057c8f1e9ff0fba8;p=platform%2Fupstream%2Fisl.git diff --git a/isl_test.c b/isl_test.c index 0050848..4d1bfd1 100644 --- a/isl_test.c +++ b/isl_test.c @@ -10,17 +10,36 @@ #include #include #include +#include #include -#include +#include #include #include #include #include #include #include +#include static char *srcdir; +static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) { + char *filename; + int length; + char *pattern = "%s/test_inputs/%s.%s"; + + length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name) + + strlen(suffix) + 1; + filename = isl_alloc_array(ctx, char, length); + + if (!filename) + return NULL; + + sprintf(filename, pattern, srcdir, name, suffix); + + return filename; +} + void test_parse_map(isl_ctx *ctx, const char *str) { isl_map *map; @@ -30,6 +49,17 @@ void test_parse_map(isl_ctx *ctx, const char *str) isl_map_free(map); } +void test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2) +{ + isl_map *map, *map2; + + map = isl_map_read_from_str(ctx, str, -1); + map2 = isl_map_read_from_str(ctx, str2, -1); + assert(map && map2 && isl_map_is_equal(map, map2)); + isl_map_free(map); + isl_map_free(map2); +} + void test_parse_pwqp(isl_ctx *ctx, const char *str) { isl_pw_qpolynomial *pwqp; @@ -42,7 +72,7 @@ void test_parse_pwqp(isl_ctx *ctx, const char *str) void test_parse(struct isl_ctx *ctx) { isl_map *map, *map2; - const char *str; + const char *str, *str2; str = "{ [i] -> [-i] }"; map = isl_map_read_from_str(ctx, str, -1); @@ -55,6 +85,17 @@ void test_parse(struct isl_ctx *ctx) isl_map_free(map); test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}"); + test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : " + "p1 = 1 && (y1 <= y2 || y2 = 0) }"); + + str = "{ [x,y] : [([x/2]+y)/3] >= 1 }"; + str2 = "{ [x, y] : 2y >= 6 - x }"; + test_parse_map_equal(ctx, str, str2); + + test_parse_map_equal(ctx, "{ [x,y] : x <= min(y, 2*y+3) }", + "{ [x,y] : x <= y, 2*y + 3 }"); + str = "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }"; + test_parse_map_equal(ctx, "{ [x,y] : x >= min(y, 2*y+3) }", str); str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}"; map = isl_map_read_from_str(ctx, str, -1); @@ -75,20 +116,23 @@ void test_parse(struct isl_ctx *ctx) isl_map_free(map); isl_map_free(map2); + str = "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }"; + str2 = "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }"; + test_parse_map_equal(ctx, str, str2); + test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }"); + test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }"); } void test_read(struct isl_ctx *ctx) { - char filename[PATH_MAX]; + char *filename; FILE *input; - int n; struct isl_basic_set *bset1, *bset2; const char *str = "{[y]: Exists ( alpha : 2alpha = y)}"; - n = snprintf(filename, sizeof(filename), - "%s/test_inputs/set.omega", srcdir); - assert(n < sizeof(filename)); + filename = get_filename(ctx, "set", "omega"); + assert(filename); input = fopen(filename, "r"); assert(input); @@ -99,6 +143,7 @@ void test_read(struct isl_ctx *ctx) isl_basic_set_free(bset1); isl_basic_set_free(bset2); + free(filename); fclose(input); } @@ -190,16 +235,14 @@ void test_dim(struct isl_ctx *ctx) void test_div(struct isl_ctx *ctx) { isl_int v; - int pos; struct isl_dim *dim; - struct isl_div *div; struct isl_basic_set *bset; struct isl_constraint *c; isl_int_init(v); /* test 1 */ - dim = isl_dim_set_alloc(ctx, 0, 1); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -207,10 +250,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -218,17 +259,17 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); + assert(bset && bset->n_div == 1); isl_basic_set_free(bset); /* test 2 */ - dim = isl_dim_set_alloc(ctx, 0, 1); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -236,10 +277,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -247,17 +286,17 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); + assert(bset && bset->n_div == 1); isl_basic_set_free(bset); /* test 3 */ - dim = isl_dim_set_alloc(ctx, 0, 1); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -265,10 +304,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -276,17 +313,17 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 4); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); + assert(bset && bset->n_div == 1); isl_basic_set_free(bset); /* test 4 */ - dim = isl_dim_set_alloc(ctx, 0, 1); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -294,10 +331,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -305,26 +340,24 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 6); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); + assert(isl_basic_set_is_empty(bset)); isl_basic_set_free(bset); /* test 5 */ - dim = isl_dim_set_alloc(ctx, 0, 2); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -334,20 +367,20 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); + assert(bset && bset->n_div == 0); isl_basic_set_free(bset); /* test 6 */ - dim = isl_dim_set_alloc(ctx, 0, 2); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 6); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -357,6 +390,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); + assert(bset && bset->n_div == 1); isl_basic_set_free(bset); @@ -370,7 +405,7 @@ void test_div(struct isl_ctx *ctx) * and we end up with the original equality and div again. * Perhaps we can avoid the introduction of this temporary div. */ - dim = isl_dim_set_alloc(ctx, 0, 3); + dim = isl_dim_set_alloc(ctx, 0, 4); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -380,12 +415,12 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_coefficient(c, isl_dim_set, 1, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 6); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 3, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1); + /* Test disabled for now */ /* assert(bset && bset->n_div == 1); @@ -393,7 +428,7 @@ void test_div(struct isl_ctx *ctx) isl_basic_set_free(bset); /* test 8 */ - dim = isl_dim_set_alloc(ctx, 0, 4); + dim = isl_dim_set_alloc(ctx, 0, 5); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -403,10 +438,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_coefficient(c, isl_dim_set, 1, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 3, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 6); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 4, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -418,6 +451,8 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_constant(c, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1); + /* Test disabled for now */ /* assert(bset && bset->n_div == 1); @@ -425,7 +460,7 @@ void test_div(struct isl_ctx *ctx) isl_basic_set_free(bset); /* test 9 */ - dim = isl_dim_set_alloc(ctx, 0, 2); + dim = isl_dim_set_alloc(ctx, 0, 4); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); @@ -433,23 +468,21 @@ void test_div(struct isl_ctx *ctx) isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, -2); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, 3); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 3, v); isl_int_set_si(v, 2); isl_constraint_set_constant(c, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2); + bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2); assert(!isl_basic_set_is_empty(bset)); @@ -457,18 +490,18 @@ void test_div(struct isl_ctx *ctx) isl_basic_set_free(bset); /* test 10 */ - dim = isl_dim_set_alloc(ctx, 0, 2); + dim = isl_dim_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(dim); c = isl_equality_alloc(isl_basic_set_get_dim(bset)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); - div = isl_div_alloc(isl_basic_set_get_dim(bset)); - c = isl_constraint_add_div(c, div, &pos); isl_int_set_si(v, -2); - isl_constraint_set_coefficient(c, isl_dim_div, pos, v); + isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); + bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); + bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2); isl_basic_set_free(bset); @@ -478,15 +511,13 @@ void test_div(struct isl_ctx *ctx) void test_application_case(struct isl_ctx *ctx, const char *name) { - char filename[PATH_MAX]; + char *filename; FILE *input; - int n; struct isl_basic_set *bset1, *bset2; struct isl_basic_map *bmap; - n = snprintf(filename, sizeof(filename), - "%s/test_inputs/%s.omega", srcdir, name); - assert(n < sizeof(filename)); + filename = get_filename(ctx, name, "omega"); + assert(filename); input = fopen(filename, "r"); assert(input); @@ -501,6 +532,7 @@ void test_application_case(struct isl_ctx *ctx, const char *name) isl_basic_set_free(bset1); isl_basic_set_free(bset2); + free(filename); fclose(input); } @@ -513,14 +545,12 @@ void test_application(struct isl_ctx *ctx) void test_affine_hull_case(struct isl_ctx *ctx, const char *name) { - char filename[PATH_MAX]; + char *filename; FILE *input; - int n; struct isl_basic_set *bset1, *bset2; - n = snprintf(filename, sizeof(filename), - "%s/test_inputs/%s.polylib", srcdir, name); - assert(n < sizeof(filename)); + filename = get_filename(ctx, name, "polylib"); + assert(filename); input = fopen(filename, "r"); assert(input); @@ -533,6 +563,7 @@ void test_affine_hull_case(struct isl_ctx *ctx, const char *name) isl_basic_set_free(bset1); isl_basic_set_free(bset2); + free(filename); fclose(input); } @@ -546,15 +577,13 @@ void test_affine_hull(struct isl_ctx *ctx) void test_convex_hull_case(struct isl_ctx *ctx, const char *name) { - char filename[PATH_MAX]; + char *filename; FILE *input; - int n; struct isl_basic_set *bset1, *bset2; struct isl_set *set; - n = snprintf(filename, sizeof(filename), - "%s/test_inputs/%s.polylib", srcdir, name); - assert(n < sizeof(filename)); + filename = get_filename(ctx, name, "polylib"); + assert(filename); input = fopen(filename, "r"); assert(input); @@ -570,6 +599,7 @@ void test_convex_hull_case(struct isl_ctx *ctx, const char *name) isl_basic_set_free(bset1); isl_basic_set_free(bset2); + free(filename); fclose(input); } @@ -620,14 +650,12 @@ void test_convex_hull(struct isl_ctx *ctx) void test_gist_case(struct isl_ctx *ctx, const char *name) { - char filename[PATH_MAX]; + char *filename; FILE *input; - int n; struct isl_basic_set *bset1, *bset2; - n = snprintf(filename, sizeof(filename), - "%s/test_inputs/%s.polylib", srcdir, name); - assert(n < sizeof(filename)); + filename = get_filename(ctx, name, "polylib"); + assert(filename); input = fopen(filename, "r"); assert(input); @@ -642,13 +670,40 @@ void test_gist_case(struct isl_ctx *ctx, const char *name) isl_basic_set_free(bset1); isl_basic_set_free(bset2); + free(filename); fclose(input); } void test_gist(struct isl_ctx *ctx) { + const char *str; + isl_basic_set *bset1, *bset2; + test_gist_case(ctx, "gist1"); + + str = "[p0, p2, p3, p5, p6, p10] -> { [] : " + "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], " + "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], " + "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and " + "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and " + "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and " + "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and " + "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and " + "p10 <= 15 and p10 <= -1 + p0 - p6) }"; + bset1 = isl_basic_set_read_from_str(ctx, str, -1); + str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], " + "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], " + "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and " + "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and " + "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and " + "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and " + "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and " + "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }"; + bset2 = isl_basic_set_read_from_str(ctx, str, -1); + bset1 = isl_basic_set_gist(bset1, bset2); + assert(bset1 && bset1->n_div == 0); + isl_basic_set_free(bset1); } void test_coalesce_set(isl_ctx *ctx, const char *str, int check_one) @@ -904,6 +959,12 @@ void test_coalesce(struct isl_ctx *ctx) test_coalesce_set(ctx, "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1); test_coalesce_set(ctx, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }", 1); + test_coalesce_set(ctx, "{ [0,0]; [i,i] : 1 <= i <= 10 }", 1); + test_coalesce_set(ctx, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }", 0); + test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 1 <= i <= 10 }", 1); + test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 2 <= i <= 10 }", 0); + test_coalesce_set(ctx, "{ [1,0]; [i,2i] : 1 <= i <= 10 }", 0); + test_coalesce_set(ctx, "{ [0,1]; [i,2i] : 1 <= i <= 10 }", 0); } void test_closure(struct isl_ctx *ctx) @@ -916,11 +977,11 @@ void test_closure(struct isl_ctx *ctx) /* COCOA example 1 */ map = isl_map_read_from_str(ctx, - "[n,k] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and " + "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and " "1 <= i and i < n and 1 <= j and j < n or " "i2 = i + 1 and j2 = j - 1 and " "1 <= i and i < n and 2 <= j and j <= n }", -1); - map = isl_map_power(map, 1, &exact); + map = isl_map_power(map, &exact); assert(exact); isl_map_free(map); @@ -986,14 +1047,14 @@ void test_closure(struct isl_ctx *ctx) /* COCOA Fig.2 right */ map = isl_map_read_from_str(ctx, - "[n,k] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and " + "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and " "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and " "j <= n or " "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and " "j <= 2 i - 4 and j <= n - 3 or " "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and " "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }", -1); - map = isl_map_power(map, 1, &exact); + map = isl_map_power(map, &exact); assert(exact); isl_map_free(map); @@ -1156,9 +1217,26 @@ void test_lex(struct isl_ctx *ctx) isl_map_free(map); } +static int consume_lexmin(__isl_take isl_basic_set *dom, + __isl_take isl_aff_list *list, void *user) +{ + isl_dim *dim; + isl_basic_map *bmap; + isl_map **map = user; + + dim = isl_basic_set_get_dim(dom); + bmap = isl_basic_map_from_aff_list(dim, list); + bmap = isl_basic_map_intersect_domain(bmap, dom); + + *map = isl_map_union(*map, isl_map_from_basic_map(bmap)); + + return 0; +} + void test_lexmin(struct isl_ctx *ctx) { const char *str; + isl_basic_map *bmap; isl_map *map, *map2; isl_set *set; isl_set *set2; @@ -1218,6 +1296,16 @@ void test_lexmin(struct isl_ctx *ctx) assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); + + str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and " + " 8i' <= i and 8i' >= -7 + i }"; + bmap = isl_basic_map_read_from_str(ctx, str, -1); + map2 = isl_map_empty(isl_basic_map_get_dim(bmap)); + isl_basic_map_foreach_lexmin(bmap, &consume_lexmin, &map2); + map = isl_map_from_basic_map(bmap); + assert(isl_map_is_equal(map, map2)); + isl_map_free(map); + isl_map_free(map2); } struct must_may { @@ -1447,20 +1535,54 @@ void test_dep(struct isl_ctx *ctx) isl_flow_free(flow); } -void test_sv(struct isl_ctx *ctx) +int test_sv(isl_ctx *ctx) { const char *str; isl_map *map; + isl_union_map *umap; + int sv; str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }"; map = isl_map_read_from_str(ctx, str, -1); - assert(isl_map_is_single_valued(map)); + sv = isl_map_is_single_valued(map); isl_map_free(map); + if (sv < 0) + return -1; + if (!sv) + isl_die(ctx, isl_error_internal, + "map not detected as single valued", return -1); str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }"; map = isl_map_read_from_str(ctx, str, -1); - assert(!isl_map_is_single_valued(map)); + sv = isl_map_is_single_valued(map); isl_map_free(map); + if (sv < 0) + return -1; + if (sv) + isl_die(ctx, isl_error_internal, + "map detected as single valued", return -1); + + str = "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }"; + umap = isl_union_map_read_from_str(ctx, str); + sv = isl_union_map_is_single_valued(umap); + isl_union_map_free(umap); + if (sv < 0) + return -1; + if (!sv) + isl_die(ctx, isl_error_internal, + "map not detected as single valued", return -1); + + str = "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }"; + umap = isl_union_map_read_from_str(ctx, str); + sv = isl_union_map_is_single_valued(umap); + isl_union_map_free(umap); + if (sv < 0) + return -1; + if (sv) + isl_die(ctx, isl_error_internal, + "map detected as single valued", return -1); + + return 0; } void test_bijective_case(struct isl_ctx *ctx, const char *str, int bijective) @@ -1576,6 +1698,14 @@ void test_pwqp(struct isl_ctx *ctx) assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); + + str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }"; + pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); + pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); + pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1); + pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); + assert(isl_pw_qpolynomial_is_zero(pwqp1)); + isl_pw_qpolynomial_free(pwqp1); } void test_split_periods(isl_ctx *ctx) @@ -1635,6 +1765,12 @@ void test_bound(isl_ctx *ctx) pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL); assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_set) == 4); isl_pw_qpolynomial_fold_free(pwf); + + str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }"; + pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); + pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL); + assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_set) == 1); + isl_pw_qpolynomial_fold_free(pwf); } void test_lift(isl_ctx *ctx) @@ -1703,6 +1839,523 @@ void test_factorize(isl_ctx *ctx) isl_factorizer_free(f); } +static int check_injective(__isl_take isl_map *map, void *user) +{ + int *injective = user; + + *injective = isl_map_is_injective(map); + isl_map_free(map); + + if (*injective < 0 || !*injective) + return -1; + + return 0; +} + +int test_one_schedule(isl_ctx *ctx, const char *d, const char *w, + const char *r, const char *s, int tilable, int parallel) +{ + int i; + isl_union_set *D; + isl_union_map *W, *R, *S; + isl_union_map *empty; + isl_union_map *dep_raw, *dep_war, *dep_waw, *dep; + isl_union_map *validity, *proximity; + isl_union_map *schedule; + isl_union_map *test; + isl_union_set *delta; + isl_union_set *domain; + isl_set *delta_set; + isl_set *slice; + isl_set *origin; + isl_schedule *sched; + int is_nonneg, is_parallel, is_tilable, is_injection, is_complete; + + D = isl_union_set_read_from_str(ctx, d); + W = isl_union_map_read_from_str(ctx, w); + R = isl_union_map_read_from_str(ctx, r); + S = isl_union_map_read_from_str(ctx, s); + + W = isl_union_map_intersect_domain(W, isl_union_set_copy(D)); + R = isl_union_map_intersect_domain(R, isl_union_set_copy(D)); + + empty = isl_union_map_empty(isl_union_map_get_dim(S)); + isl_union_map_compute_flow(isl_union_map_copy(R), + isl_union_map_copy(W), empty, + isl_union_map_copy(S), + &dep_raw, NULL, NULL, NULL); + isl_union_map_compute_flow(isl_union_map_copy(W), + isl_union_map_copy(W), + isl_union_map_copy(R), + isl_union_map_copy(S), + &dep_waw, &dep_war, NULL, NULL); + + dep = isl_union_map_union(dep_waw, dep_war); + dep = isl_union_map_union(dep, dep_raw); + validity = isl_union_map_copy(dep); + proximity = isl_union_map_copy(dep); + + sched = isl_union_set_compute_schedule(isl_union_set_copy(D), + validity, proximity); + schedule = isl_schedule_get_map(sched); + isl_schedule_free(sched); + isl_union_map_free(W); + isl_union_map_free(R); + isl_union_map_free(S); + + is_injection = 1; + isl_union_map_foreach_map(schedule, &check_injective, &is_injection); + + domain = isl_union_map_domain(isl_union_map_copy(schedule)); + is_complete = isl_union_set_is_subset(D, domain); + isl_union_set_free(D); + isl_union_set_free(domain); + + test = isl_union_map_reverse(isl_union_map_copy(schedule)); + test = isl_union_map_apply_range(test, dep); + test = isl_union_map_apply_range(test, schedule); + + delta = isl_union_map_deltas(test); + if (isl_union_set_n_set(delta) == 0) { + is_tilable = 1; + is_parallel = 1; + is_nonneg = 1; + isl_union_set_free(delta); + } else { + delta_set = isl_set_from_union_set(delta); + + slice = isl_set_universe(isl_set_get_dim(delta_set)); + for (i = 0; i < tilable; ++i) + slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0); + is_tilable = isl_set_is_subset(delta_set, slice); + isl_set_free(slice); + + slice = isl_set_universe(isl_set_get_dim(delta_set)); + for (i = 0; i < parallel; ++i) + slice = isl_set_fix_si(slice, isl_dim_set, i, 0); + is_parallel = isl_set_is_subset(delta_set, slice); + isl_set_free(slice); + + origin = isl_set_universe(isl_set_get_dim(delta_set)); + for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i) + origin = isl_set_fix_si(origin, isl_dim_set, i, 0); + + delta_set = isl_set_union(delta_set, isl_set_copy(origin)); + delta_set = isl_set_lexmin(delta_set); + + is_nonneg = isl_set_is_equal(delta_set, origin); + + isl_set_free(origin); + isl_set_free(delta_set); + } + + if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 || + is_injection < 0 || is_complete < 0) + return -1; + if (!is_complete) + isl_die(ctx, isl_error_unknown, + "generated schedule incomplete", return -1); + if (!is_injection) + isl_die(ctx, isl_error_unknown, + "generated schedule not injective on each statement", + return -1); + if (!is_nonneg) + isl_die(ctx, isl_error_unknown, + "negative dependences in generated schedule", + return -1); + if (!is_tilable) + isl_die(ctx, isl_error_unknown, + "generated schedule not as tilable as expected", + return -1); + if (!is_parallel) + isl_die(ctx, isl_error_unknown, + "generated schedule not as parallel as expected", + return -1); + + return 0; +} + +int test_special_schedule(isl_ctx *ctx) +{ + const char *str; + isl_union_set *dom; + isl_union_map *empty; + isl_union_map *dep; + isl_union_map *sched1, *sched2; + isl_schedule *schedule; + int equal; + + str = "{ S[i,j] : 0 <= i <= 10 }"; + dom = isl_union_set_read_from_str(ctx, str); + str = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }"; + dep = isl_union_map_read_from_str(ctx, str); + empty = isl_union_map_read_from_str(ctx, "{}"); + schedule = isl_union_set_compute_schedule(dom, empty, dep); + sched1 = isl_schedule_get_map(schedule); + isl_schedule_free(schedule); + + str = "{ S[i, j] -> [j, i] }"; + sched2 = isl_union_map_read_from_str(ctx, str); + + equal = isl_union_map_is_equal(sched1, sched2); + isl_union_map_free(sched1); + isl_union_map_free(sched2); + + if (equal < 0) + return -1; + if (!equal) + isl_die(ctx, isl_error_unknown, "unexpected schedule", + return -1); + + return 0; +} + +int test_schedule(isl_ctx *ctx) +{ + const char *D, *W, *R, *S; + + /* Jacobi */ + D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }"; + W = "{ S1[t,i] -> a[t,i] }"; + R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; " + "S1[t,i] -> a[t-1,i+1] }"; + S = "{ S1[t,i] -> [t,i] }"; + if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) + return -1; + + /* Fig. 5 of CC2008 */ + D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and " + "j <= -1 + N }"; + W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and " + "j >= 2 and j <= -1 + N }"; + R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and " + "j >= 2 and j <= -1 + N; " + "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and " + "j >= 2 and j <= -1 + N }"; + S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) + return -1; + + D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }"; + W = "{ S1[i] -> a[i] }"; + R = "{ S2[i] -> a[i+1] }"; + S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; + if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) + return -1; + + D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }"; + W = "{ S1[i] -> a[i] }"; + R = "{ S2[i] -> a[9-i] }"; + S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; + if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) + return -1; + + D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }"; + W = "{ S1[i] -> a[i] }"; + R = "[N] -> { S2[i] -> a[N-1-i] }"; + S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; + if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) + return -1; + + D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }"; + W = "{ S1[i] -> a[i]; S2[i] -> b[i] }"; + R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }"; + S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }"; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + + D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }"; + W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }"; + R = "{ S2[i,j] -> a[i-1,j] }"; + S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }"; + if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) + return -1; + + D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }"; + W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }"; + R = "{ S2[i,j] -> a[i,j-1] }"; + S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }"; + if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) + return -1; + + D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }"; + W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; " + "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }"; + R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }"; + S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; " + "S_0[] -> [0, 0, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0) + return -1; + ctx->opt->schedule_parametric = 0; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + ctx->opt->schedule_parametric = 1; + + D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; " + "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }"; + W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }"; + R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; " + "S4[i] -> a[i,N] }"; + S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; " + "S4[i] -> [4,i,0] }"; + if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) + return -1; + + D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }"; + W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and " + "j <= N }"; + R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and " + "j <= N; " + "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and " + "j <= N }"; + S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + + D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; " + " S_2[t] : t >= 0 and t <= -1 + N; " + " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and " + "i <= -1 + N }"; + W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; " + " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; " + " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and " + "i >= 0 and i <= -1 + N }"; + R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and " + "i >= 0 and i <= -1 + N; " + " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }"; + S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; " + " S_0[t] -> [0, t, 0] }"; + + if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) + return -1; + ctx->opt->schedule_parametric = 0; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + ctx->opt->schedule_parametric = 1; + + D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }"; + S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }"; + if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0) + return -1; + + D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; " + "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }"; + W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and " + "j >= 0 and j <= -1 + N; " + "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }"; + R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and " + "j >= 0 and j <= -1 + N; " + "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }"; + S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + + D = "{ S_0[i] : i >= 0 }"; + W = "{ S_0[i] -> a[i] : i >= 0 }"; + R = "{ S_0[i] -> a[0] : i >= 0 }"; + S = "{ S_0[i] -> [0, i, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + + D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }"; + W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }"; + R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }"; + S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }"; + if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) + return -1; + + return test_special_schedule(ctx); +} + +int test_plain_injective(isl_ctx *ctx, const char *str, int injective) +{ + isl_union_map *umap; + int test; + + umap = isl_union_map_read_from_str(ctx, str); + test = isl_union_map_plain_is_injective(umap); + isl_union_map_free(umap); + if (test < 0) + return -1; + if (test == injective) + return 0; + if (injective) + isl_die(ctx, isl_error_unknown, + "map not detected as injective", return -1); + else + isl_die(ctx, isl_error_unknown, + "map detected as injective", return -1); +} + +int test_injective(isl_ctx *ctx) +{ + const char *str; + + if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0)) + return -1; + if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1)) + return -1; + if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1)) + return -1; + if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0)) + return -1; + if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1)) + return -1; + if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0)) + return -1; + if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1)) + return -1; + if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1)) + return -1; + + str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}"; + if (test_plain_injective(ctx, str, 1)) + return -1; + str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}"; + if (test_plain_injective(ctx, str, 0)) + return -1; + + return 0; +} + +int test_aff(isl_ctx *ctx) +{ + const char *str; + isl_set *set; + isl_dim *dim; + isl_local_space *ls; + isl_aff *aff; + int zero; + + dim = isl_dim_set_alloc(ctx, 0, 1); + ls = isl_local_space_from_dim(dim); + aff = isl_aff_zero(ls); + + aff = isl_aff_add_coefficient_si(aff, isl_dim_set, 0, 1); + aff = isl_aff_scale_down_ui(aff, 3); + aff = isl_aff_floor(aff); + aff = isl_aff_add_coefficient_si(aff, isl_dim_set, 0, 1); + aff = isl_aff_scale_down_ui(aff, 2); + aff = isl_aff_floor(aff); + aff = isl_aff_add_coefficient_si(aff, isl_dim_set, 0, 1); + + str = "{ [10] }"; + set = isl_set_read_from_str(ctx, str, 0); + aff = isl_aff_gist(aff, set); + + aff = isl_aff_add_constant_si(aff, -16); + zero = isl_aff_plain_is_zero(aff); + isl_aff_free(aff); + + if (zero < 0) + return -1; + if (!zero) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + return 0; +} + +int test_dim_max(isl_ctx *ctx) +{ + int equal; + const char *str; + isl_map *map, *map2; + isl_set *set; + isl_pw_aff *pwaff; + + str = "[N] -> { [i] : 0 <= i <= min(N,10) }"; + set = isl_set_read_from_str(ctx, str, -1); + pwaff = isl_set_dim_max(set, 0); + map = isl_map_from_pw_aff(pwaff); + str = "[N] -> { [] -> [10] : N >= 10; [] -> [N] : N <= 9 and N >= 0 }"; + map2 = isl_map_read_from_str(ctx, str, -1); + equal = isl_map_is_equal(map, map2); + isl_map_free(map); + isl_map_free(map2); + if (equal < 0) + return -1; + if (!equal) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }"; + set = isl_set_read_from_str(ctx, str, -1); + pwaff = isl_set_dim_max(set, 0); + map = isl_map_from_pw_aff(pwaff); + str = "[N] -> { [] -> [6 + N] : -6 <= N <= 5; [] -> [2N] : N >= 6 }"; + map2 = isl_map_read_from_str(ctx, str, -1); + equal = isl_map_is_equal(map, map2); + isl_map_free(map); + isl_map_free(map2); + if (equal < 0) + return -1; + if (!equal) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }"; + set = isl_set_read_from_str(ctx, str, -1); + pwaff = isl_set_dim_max(set, 0); + map = isl_map_from_pw_aff(pwaff); + str = "[N] -> { [] -> [6 + N] : -6 <= N <= 5; [] -> [2N] : N >= 6 }"; + map2 = isl_map_read_from_str(ctx, str, -1); + equal = isl_map_is_equal(map, map2); + isl_map_free(map); + isl_map_free(map2); + if (equal < 0) + return -1; + if (!equal) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : " + "0 <= i < N and 0 <= j < M }"; + map = isl_map_read_from_str(ctx, str, -1); + set = isl_map_range(map); + + pwaff = isl_set_dim_max(isl_set_copy(set), 0); + map = isl_map_from_pw_aff(pwaff); + str = "[N,M] -> { [] -> [([(N-1)/16])] : M,N > 0 }"; + map2 = isl_map_read_from_str(ctx, str, -1); + equal = isl_map_is_equal(map, map2); + isl_map_free(map); + isl_map_free(map2); + + pwaff = isl_set_dim_max(isl_set_copy(set), 3); + map = isl_map_from_pw_aff(pwaff); + str = "[N,M] -> { [] -> [t] : t = min(M-1,15) and M,N > 0 }"; + map2 = isl_map_read_from_str(ctx, str, -1); + if (equal >= 0 && equal) + equal = isl_map_is_equal(map, map2); + isl_map_free(map); + isl_map_free(map2); + + isl_set_free(set); + + if (equal < 0) + return -1; + if (!equal) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + return 0; +} + +int test_product(isl_ctx *ctx) +{ + const char *str; + isl_set *set; + int ok; + + str = "{ A[i] }"; + set = isl_set_read_from_str(ctx, str, -1); + set = isl_set_product(set, isl_set_copy(set)); + ok = isl_set_is_wrapping(set); + isl_set_free(set); + if (ok < 0) + return -1; + if (!ok) + isl_die(ctx, isl_error_unknown, "unexpected result", return -1); + + return 0; +} + int main() { struct isl_ctx *ctx; @@ -1711,6 +2364,16 @@ int main() assert(srcdir); ctx = isl_ctx_alloc(); + if (test_product(ctx) < 0) + goto error; + if (test_dim_max(ctx) < 0) + goto error; + if (test_aff(ctx) < 0) + goto error; + if (test_injective(ctx) < 0) + goto error; + if (test_schedule(ctx) < 0) + goto error; test_factorize(ctx); test_subset(ctx); test_lift(ctx); @@ -1720,7 +2383,8 @@ int main() test_parse(ctx); test_pwqp(ctx); test_lex(ctx); - test_sv(ctx); + if (test_sv(ctx) < 0) + goto error; test_bijective(ctx); test_dep(ctx); test_read(ctx); @@ -1737,4 +2401,7 @@ int main() test_lexmin(ctx); isl_ctx_free(ctx); return 0; +error: + isl_ctx_free(ctx); + return -1; }