2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
15 * B.P. 105 - 78153 Le Chesnay, France
21 #include <isl_ctx_private.h>
22 #include <isl_map_private.h>
23 #include <isl_aff_private.h>
24 #include <isl_space_private.h>
28 #include <isl_constraint_private.h>
29 #include <isl/polynomial.h>
30 #include <isl/union_set.h>
31 #include <isl/union_map.h>
32 #include <isl_factorization.h>
33 #include <isl/schedule.h>
34 #include <isl/schedule_node.h>
35 #include <isl_options_private.h>
36 #include <isl_vertices_private.h>
37 #include <isl/ast_build.h>
40 #include <isl_ast_build_expr.h>
41 #include <isl/options.h>
43 #include "isl_srcdir.c"
45 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
47 static char *get_filename(isl_ctx
*ctx
, const char *name
, const char *suffix
) {
50 char *pattern
= "%s/test_inputs/%s.%s";
52 length
= strlen(pattern
) - 6 + strlen(srcdir
) + strlen(name
)
54 filename
= isl_alloc_array(ctx
, char, length
);
59 sprintf(filename
, pattern
, srcdir
, name
, suffix
);
64 void test_parse_map(isl_ctx
*ctx
, const char *str
)
68 map
= isl_map_read_from_str(ctx
, str
);
73 int test_parse_map_equal(isl_ctx
*ctx
, const char *str
, const char *str2
)
78 map
= isl_map_read_from_str(ctx
, str
);
79 map2
= isl_map_read_from_str(ctx
, str2
);
80 equal
= isl_map_is_equal(map
, map2
);
87 isl_die(ctx
, isl_error_unknown
, "maps not equal",
93 void test_parse_pwqp(isl_ctx
*ctx
, const char *str
)
95 isl_pw_qpolynomial
*pwqp
;
97 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
99 isl_pw_qpolynomial_free(pwqp
);
102 static void test_parse_pwaff(isl_ctx
*ctx
, const char *str
)
106 pwaff
= isl_pw_aff_read_from_str(ctx
, str
);
108 isl_pw_aff_free(pwaff
);
111 /* Check that we can read an isl_multi_val from "str" without errors.
113 static int test_parse_multi_val(isl_ctx
*ctx
, const char *str
)
117 mv
= isl_multi_val_read_from_str(ctx
, str
);
118 isl_multi_val_free(mv
);
123 /* Check that printing "mpa" and parsing the output results
124 * in the same expression.
126 static isl_stat
check_reparse_mpa(isl_ctx
*ctx
,
127 __isl_take isl_multi_pw_aff
*mpa
)
131 isl_multi_pw_aff
*mpa2
;
133 str
= isl_multi_pw_aff_to_str(mpa
);
134 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, str
);
136 equal
= isl_multi_pw_aff_plain_is_equal(mpa
, mpa2
);
137 isl_multi_pw_aff_free(mpa
);
138 isl_multi_pw_aff_free(mpa2
);
140 return isl_stat_error
;
142 isl_die(ctx
, isl_error_unknown
,
143 "parsed function not equal to original",
144 return isl_stat_error
);
149 /* String descriptions of multi piecewise affine expressions
150 * that are used for testing printing and parsing.
152 const char *parse_multi_mpa_tests
[] = {
153 "{ A[x, y] -> [] : x + y >= 0 }",
154 "{ A[x, y] -> B[] : x + y >= 0 }",
155 "{ A[x, y] -> [x] : x + y >= 0 }",
156 "[N] -> { A[x, y] -> [x] : x + y <= N }",
157 "{ A[x, y] -> [x, y] : x + y >= 0 }",
158 "{ A[x, y] -> [(x : x >= 0), (y : y >= 0)] : x + y >= 0 }",
159 "[N] -> { [] : N >= 0 }",
160 "[N] -> { [] : N >= 0 }",
161 "[N] -> { [N] : N >= 0 }",
162 "[N] -> { [N, N + 1] : N >= 0 }",
163 "[N, M] -> { [(N : N >= 0), (M : M >= 0)] : N + M >= 0 }",
166 /* Test parsing of multi piecewise affine expressions by printing
167 * the expressions and checking that parsing the output results
168 * in the same expression.
169 * Do this for a couple of manually constructed expressions and
170 * a set of expressions parsed from strings.
172 static int test_parse_mpa(isl_ctx
*ctx
)
177 isl_multi_pw_aff
*mpa
;
180 space
= isl_space_set_alloc(ctx
, 0, 0);
181 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "A");
182 mpa
= isl_multi_pw_aff_zero(space
);
183 r
= check_reparse_mpa(ctx
, mpa
);
187 space
= isl_space_set_alloc(ctx
, 1, 0);
188 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
189 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "A");
190 dom
= isl_set_universe(isl_space_params(isl_space_copy(space
)));
191 dom
= isl_set_lower_bound_si(dom
, isl_dim_param
, 0, 5);
192 mpa
= isl_multi_pw_aff_zero(space
);
193 mpa
= isl_multi_pw_aff_intersect_domain(mpa
, dom
);
194 r
= check_reparse_mpa(ctx
, mpa
);
198 for (i
= 0; i
< ARRAY_SIZE(parse_multi_mpa_tests
); ++i
) {
201 str
= parse_multi_mpa_tests
[i
];
202 mpa
= isl_multi_pw_aff_read_from_str(ctx
, str
);
203 r
= check_reparse_mpa(ctx
, mpa
);
211 /* Check that printing "mupa" and parsing the output results
212 * in the same expression.
214 static isl_stat
check_reparse_mupa(isl_ctx
*ctx
,
215 __isl_take isl_multi_union_pw_aff
*mupa
)
219 isl_multi_union_pw_aff
*mupa2
;
221 str
= isl_multi_union_pw_aff_to_str(mupa
);
222 mupa2
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
224 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
, mupa2
);
225 isl_multi_union_pw_aff_free(mupa
);
226 isl_multi_union_pw_aff_free(mupa2
);
228 return isl_stat_error
;
230 isl_die(ctx
, isl_error_unknown
,
231 "parsed function not equal to original",
232 return isl_stat_error
);
237 /* String descriptions of multi union piecewise affine expressions
238 * that are used for testing printing and parsing.
240 const char *parse_multi_mupa_tests
[] = {
244 "(A[] : { S[x] : x > 0; T[y] : y >= 0 })",
246 "[N] -> (A[] : { })",
247 "[N] -> (A[] : { : N >= 0 })",
248 "[N] -> (A[] : { S[x] : x > N; T[y] : y >= 0 })",
249 "(A[] : [N] -> { S[x] : x > N; T[y] : y >= 0 })",
250 "A[{ S[x] -> [x + 1]; T[x] -> [x] }]",
251 "(A[{ S[x] -> [x + 1]; T[x] -> [x] }] : "
252 "{ S[x] : x > 0; T[y] : y >= 0 })",
255 /* Test parsing of multi union piecewise affine expressions by printing
256 * the expressions and checking that parsing the output results
257 * in the same expression.
258 * Do this for a couple of manually constructed expressions and
259 * a set of expressions parsed from strings.
261 static int test_parse_mupa(isl_ctx
*ctx
)
265 isl_multi_union_pw_aff
*mupa
;
270 space
= isl_space_set_alloc(ctx
, 0, 0);
271 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "A");
272 mupa
= isl_multi_union_pw_aff_zero(space
);
273 r
= check_reparse_mupa(ctx
, mupa
);
277 space
= isl_space_set_alloc(ctx
, 1, 0);
278 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
279 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "A");
280 dom
= isl_set_universe(space
);
281 dom
= isl_set_lower_bound_si(dom
, isl_dim_param
, 0, 5);
282 uset
= isl_union_set_from_set(dom
);
283 space
= isl_space_set_alloc(ctx
, 1, 0);
284 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
285 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "B");
286 mupa
= isl_multi_union_pw_aff_zero(space
);
287 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, uset
);
288 r
= check_reparse_mupa(ctx
, mupa
);
292 for (i
= 0; i
< ARRAY_SIZE(parse_multi_mupa_tests
); ++i
) {
295 str
= parse_multi_mupa_tests
[i
];
296 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
297 r
= check_reparse_mupa(ctx
, mupa
);
305 /* Test parsing of multi expressions.
307 static int test_parse_multi(isl_ctx
*ctx
)
309 if (test_parse_mpa(ctx
) < 0)
311 if (test_parse_mupa(ctx
) < 0)
317 /* Pairs of binary relation representations that should represent
318 * the same binary relations.
323 } parse_map_equal_tests
[] = {
324 { "{ [x,y] : [([x/2]+y)/3] >= 1 }",
325 "{ [x, y] : 2y >= 6 - x }" },
326 { "{ [x,y] : x <= min(y, 2*y+3) }",
327 "{ [x,y] : x <= y, 2*y + 3 }" },
328 { "{ [x,y] : x >= min(y, 2*y+3) }",
329 "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }" },
330 { "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }",
331 "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }" },
332 { "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }",
333 "{ [i,j] -> [min(i,j)] }" },
334 { "{ [i,j] : i != j }",
335 "{ [i,j] : i < j or i > j }" },
336 { "{ [i,j] : (i+1)*2 >= j }",
337 "{ [i, j] : j <= 2 + 2i }" },
338 { "{ [i] -> [i > 0 ? 4 : 5] }",
339 "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }" },
340 { "[N=2,M] -> { [i=[(M+N)/4]] }",
341 "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }" },
342 { "{ [x] : x >= 0 }",
343 "{ [x] : x-0 >= 0 }" },
344 { "{ [i] : ((i > 10)) }",
345 "{ [i] : i >= 11 }" },
347 "{ [i] -> [0 * i] }" },
348 { "{ [a] -> [b] : (not false) }",
349 "{ [a] -> [b] : true }" },
350 { "{ [i] : i/2 <= 5 }",
351 "{ [i] : i <= 10 }" },
352 { "{Sym=[n] [i] : i <= n }",
353 "[n] -> { [i] : i <= n }" },
356 { "{ [i] : 2*floor(i/2) = i }",
357 "{ [i] : exists a : i = 2 a }" },
358 { "{ [a] -> [b] : a = 5 implies b = 5 }",
359 "{ [a] -> [b] : a != 5 or b = 5 }" },
360 { "{ [a] -> [a - 1 : a > 0] }",
361 "{ [a] -> [a - 1] : a > 0 }" },
362 { "{ [a] -> [a - 1 : a > 0; a : a <= 0] }",
363 "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }" },
364 { "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }",
365 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
366 { "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }",
367 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
368 { "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }",
369 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
370 { "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }",
371 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
372 { "{ [a,b] -> [i,j] : a,b << i,j }",
373 "{ [a,b] -> [i,j] : a < i or (a = i and b < j) }" },
374 { "{ [a,b] -> [i,j] : a,b <<= i,j }",
375 "{ [a,b] -> [i,j] : a < i or (a = i and b <= j) }" },
376 { "{ [a,b] -> [i,j] : a,b >> i,j }",
377 "{ [a,b] -> [i,j] : a > i or (a = i and b > j) }" },
378 { "{ [a,b] -> [i,j] : a,b >>= i,j }",
379 "{ [a,b] -> [i,j] : a > i or (a = i and b >= j) }" },
380 { "{ [n] -> [i] : exists (a, b, c: 8b <= i - 32a and "
381 "8b >= -7 + i - 32 a and b >= 0 and b <= 3 and "
382 "8c < n - 32a and i < n and c >= 0 and "
383 "c <= 3 and c >= -4a) }",
384 "{ [n] -> [i] : 0 <= i < n }" },
385 { "{ [x] -> [] : exists (a, b: 0 <= a <= 1 and 0 <= b <= 3 and "
386 "2b <= x - 8a and 2b >= -1 + x - 8a) }",
387 "{ [x] -> [] : 0 <= x <= 15 }" },
388 { "{ [x] -> [x] : }",
392 int test_parse(struct isl_ctx
*ctx
)
396 const char *str
, *str2
;
398 if (test_parse_multi_val(ctx
, "{ A[B[2] -> C[5, 7]] }") < 0)
400 if (test_parse_multi_val(ctx
, "[n] -> { [2] }") < 0)
402 if (test_parse_multi_val(ctx
, "{ A[4, infty, NaN, -1/2, 2/3] }") < 0)
404 if (test_parse_multi(ctx
) < 0)
407 str
= "{ [i] -> [-i] }";
408 map
= isl_map_read_from_str(ctx
, str
);
412 str
= "{ A[i] -> L[([i/3])] }";
413 map
= isl_map_read_from_str(ctx
, str
);
417 test_parse_map(ctx
, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
418 test_parse_map(ctx
, "{ [p1, y1, y2] -> [2, y1, y2] : "
419 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
421 for (i
= 0; i
< ARRAY_SIZE(parse_map_equal_tests
); ++i
) {
422 str
= parse_map_equal_tests
[i
].map1
;
423 str2
= parse_map_equal_tests
[i
].map2
;
424 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
428 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
429 map
= isl_map_read_from_str(ctx
, str
);
430 str
= "{ [new, old] -> [o0, o1] : "
431 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
432 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
433 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
434 map2
= isl_map_read_from_str(ctx
, str
);
435 assert(isl_map_is_equal(map
, map2
));
439 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
440 map
= isl_map_read_from_str(ctx
, str
);
441 str
= "{[new,old] -> [(new+1)%2,(old+1)%2]}";
442 map2
= isl_map_read_from_str(ctx
, str
);
443 assert(isl_map_is_equal(map
, map2
));
447 test_parse_pwqp(ctx
, "{ [i] -> i + [ (i + [i/3])/2 ] }");
448 test_parse_map(ctx
, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
449 test_parse_pwaff(ctx
, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
450 test_parse_pwqp(ctx
, "{ [x] -> ([(x)/2] * [(x)/3]) }");
451 test_parse_pwaff(ctx
, "{ [] -> [(100)] }");
456 static int test_read(isl_ctx
*ctx
)
460 isl_basic_set
*bset1
, *bset2
;
461 const char *str
= "{[y]: Exists ( alpha : 2alpha = y)}";
464 filename
= get_filename(ctx
, "set", "omega");
466 input
= fopen(filename
, "r");
469 bset1
= isl_basic_set_read_from_file(ctx
, input
);
470 bset2
= isl_basic_set_read_from_str(ctx
, str
);
472 equal
= isl_basic_set_is_equal(bset1
, bset2
);
474 isl_basic_set_free(bset1
);
475 isl_basic_set_free(bset2
);
483 isl_die(ctx
, isl_error_unknown
,
484 "read sets not equal", return -1);
489 static int test_bounded(isl_ctx
*ctx
)
494 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : 0 <= i <= n }");
495 bounded
= isl_set_is_bounded(set
);
501 isl_die(ctx
, isl_error_unknown
,
502 "set not considered bounded", return -1);
504 set
= isl_set_read_from_str(ctx
, "{[n, i] : 0 <= i <= n }");
505 bounded
= isl_set_is_bounded(set
);
512 isl_die(ctx
, isl_error_unknown
,
513 "set considered bounded", return -1);
515 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : i <= n }");
516 bounded
= isl_set_is_bounded(set
);
522 isl_die(ctx
, isl_error_unknown
,
523 "set considered bounded", return -1);
528 /* Construct the basic set { [i] : 5 <= i <= N } */
529 static int test_construction_1(isl_ctx
*ctx
)
536 dim
= isl_space_set_alloc(ctx
, 1, 1);
537 bset
= isl_basic_set_universe(isl_space_copy(dim
));
538 ls
= isl_local_space_from_space(dim
);
540 c
= isl_constraint_alloc_inequality(isl_local_space_copy(ls
));
541 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
542 c
= isl_constraint_set_coefficient_si(c
, isl_dim_param
, 0, 1);
543 bset
= isl_basic_set_add_constraint(bset
, c
);
545 c
= isl_constraint_alloc_inequality(isl_local_space_copy(ls
));
546 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
547 c
= isl_constraint_set_constant_si(c
, -5);
548 bset
= isl_basic_set_add_constraint(bset
, c
);
550 isl_local_space_free(ls
);
551 isl_basic_set_free(bset
);
556 /* Construct the basic set { [x] : -100 <= x <= 100 }
557 * using isl_basic_set_{lower,upper}_bound_val and
558 * check that it is equal the same basic set parsed from a string.
560 static int test_construction_2(isl_ctx
*ctx
)
565 isl_basic_set
*bset1
, *bset2
;
567 v
= isl_val_int_from_si(ctx
, 100);
568 space
= isl_space_set_alloc(ctx
, 0, 1);
569 bset1
= isl_basic_set_universe(space
);
570 bset1
= isl_basic_set_upper_bound_val(bset1
, isl_dim_set
, 0,
572 bset1
= isl_basic_set_lower_bound_val(bset1
, isl_dim_set
, 0,
574 bset2
= isl_basic_set_read_from_str(ctx
, "{ [x] : -100 <= x <= 100 }");
575 equal
= isl_basic_set_is_equal(bset1
, bset2
);
576 isl_basic_set_free(bset1
);
577 isl_basic_set_free(bset2
);
582 isl_die(ctx
, isl_error_unknown
,
583 "failed construction", return -1);
588 /* Basic tests for constructing basic sets.
590 static int test_construction(isl_ctx
*ctx
)
592 if (test_construction_1(ctx
) < 0)
594 if (test_construction_2(ctx
) < 0)
599 static int test_dim(isl_ctx
*ctx
)
602 isl_map
*map1
, *map2
;
605 map1
= isl_map_read_from_str(ctx
,
606 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
607 map1
= isl_map_add_dims(map1
, isl_dim_in
, 1);
608 map2
= isl_map_read_from_str(ctx
,
609 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
610 equal
= isl_map_is_equal(map1
, map2
);
613 map1
= isl_map_project_out(map1
, isl_dim_in
, 0, 1);
614 map2
= isl_map_read_from_str(ctx
, "[n] -> { [i] -> [j] : n >= 0 }");
615 if (equal
>= 0 && equal
)
616 equal
= isl_map_is_equal(map1
, map2
);
624 isl_die(ctx
, isl_error_unknown
,
625 "unexpected result", return -1);
627 str
= "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
628 map1
= isl_map_read_from_str(ctx
, str
);
629 str
= "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
630 map2
= isl_map_read_from_str(ctx
, str
);
631 map1
= isl_map_move_dims(map1
, isl_dim_out
, 0, isl_dim_param
, 0, 1);
632 equal
= isl_map_is_equal(map1
, map2
);
639 isl_die(ctx
, isl_error_unknown
,
640 "unexpected result", return -1);
645 /* Check that "val" is equal to the value described by "str".
646 * If "str" is "NaN", then check for a NaN value explicitly.
648 static isl_stat
val_check_equal(__isl_keep isl_val
*val
, const char *str
)
655 return isl_stat_error
;
657 ctx
= isl_val_get_ctx(val
);
658 res
= isl_val_read_from_str(ctx
, str
);
659 is_nan
= isl_val_is_nan(res
);
663 ok
= isl_val_is_nan(val
);
665 ok
= isl_val_eq(val
, res
);
668 return isl_stat_error
;
670 isl_die(ctx
, isl_error_unknown
,
671 "unexpected result", return isl_stat_error
);
676 __isl_give isl_val
*(*op
)(__isl_take isl_val
*v
);
680 { &isl_val_neg
, "0", "0" },
681 { &isl_val_abs
, "0", "0" },
682 { &isl_val_2exp
, "0", "1" },
683 { &isl_val_floor
, "0", "0" },
684 { &isl_val_ceil
, "0", "0" },
685 { &isl_val_neg
, "1", "-1" },
686 { &isl_val_neg
, "-1", "1" },
687 { &isl_val_neg
, "1/2", "-1/2" },
688 { &isl_val_neg
, "-1/2", "1/2" },
689 { &isl_val_neg
, "infty", "-infty" },
690 { &isl_val_neg
, "-infty", "infty" },
691 { &isl_val_neg
, "NaN", "NaN" },
692 { &isl_val_abs
, "1", "1" },
693 { &isl_val_abs
, "-1", "1" },
694 { &isl_val_abs
, "1/2", "1/2" },
695 { &isl_val_abs
, "-1/2", "1/2" },
696 { &isl_val_abs
, "infty", "infty" },
697 { &isl_val_abs
, "-infty", "infty" },
698 { &isl_val_abs
, "NaN", "NaN" },
699 { &isl_val_floor
, "1", "1" },
700 { &isl_val_floor
, "-1", "-1" },
701 { &isl_val_floor
, "1/2", "0" },
702 { &isl_val_floor
, "-1/2", "-1" },
703 { &isl_val_floor
, "infty", "infty" },
704 { &isl_val_floor
, "-infty", "-infty" },
705 { &isl_val_floor
, "NaN", "NaN" },
706 { &isl_val_ceil
, "1", "1" },
707 { &isl_val_ceil
, "-1", "-1" },
708 { &isl_val_ceil
, "1/2", "1" },
709 { &isl_val_ceil
, "-1/2", "0" },
710 { &isl_val_ceil
, "infty", "infty" },
711 { &isl_val_ceil
, "-infty", "-infty" },
712 { &isl_val_ceil
, "NaN", "NaN" },
713 { &isl_val_2exp
, "-3", "1/8" },
714 { &isl_val_2exp
, "-1", "1/2" },
715 { &isl_val_2exp
, "1", "2" },
716 { &isl_val_2exp
, "2", "4" },
717 { &isl_val_2exp
, "3", "8" },
718 { &isl_val_inv
, "1", "1" },
719 { &isl_val_inv
, "2", "1/2" },
720 { &isl_val_inv
, "1/2", "2" },
721 { &isl_val_inv
, "-2", "-1/2" },
722 { &isl_val_inv
, "-1/2", "-2" },
723 { &isl_val_inv
, "0", "NaN" },
724 { &isl_val_inv
, "NaN", "NaN" },
725 { &isl_val_inv
, "infty", "0" },
726 { &isl_val_inv
, "-infty", "0" },
729 /* Perform some basic tests of unary operations on isl_val objects.
731 static int test_un_val(isl_ctx
*ctx
)
735 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v
);
737 for (i
= 0; i
< ARRAY_SIZE(val_un_tests
); ++i
) {
740 v
= isl_val_read_from_str(ctx
, val_un_tests
[i
].arg
);
741 fn
= val_un_tests
[i
].op
;
743 r
= val_check_equal(v
, val_un_tests
[i
].res
);
753 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
754 __isl_take isl_val
*v2
);
756 ['+'] = { &isl_val_add
},
757 ['-'] = { &isl_val_sub
},
758 ['*'] = { &isl_val_mul
},
759 ['/'] = { &isl_val_div
},
760 ['g'] = { &isl_val_gcd
},
761 ['m'] = { &isl_val_min
},
762 ['M'] = { &isl_val_max
},
770 } val_bin_tests
[] = {
771 { "0", '+', "0", "0" },
772 { "1", '+', "0", "1" },
773 { "1", '+', "1", "2" },
774 { "1", '-', "1", "0" },
775 { "1", '*', "1", "1" },
776 { "1", '/', "1", "1" },
777 { "2", '*', "3", "6" },
778 { "2", '*', "1/2", "1" },
779 { "2", '*', "1/3", "2/3" },
780 { "2/3", '*', "3/5", "2/5" },
781 { "2/3", '*', "7/5", "14/15" },
782 { "2", '/', "1/2", "4" },
783 { "-2", '/', "-1/2", "4" },
784 { "-2", '/', "1/2", "-4" },
785 { "2", '/', "-1/2", "-4" },
786 { "2", '/', "2", "1" },
787 { "2", '/', "3", "2/3" },
788 { "2/3", '/', "5/3", "2/5" },
789 { "2/3", '/', "5/7", "14/15" },
790 { "0", '/', "0", "NaN" },
791 { "42", '/', "0", "NaN" },
792 { "-42", '/', "0", "NaN" },
793 { "infty", '/', "0", "NaN" },
794 { "-infty", '/', "0", "NaN" },
795 { "NaN", '/', "0", "NaN" },
796 { "0", '/', "NaN", "NaN" },
797 { "42", '/', "NaN", "NaN" },
798 { "-42", '/', "NaN", "NaN" },
799 { "infty", '/', "NaN", "NaN" },
800 { "-infty", '/', "NaN", "NaN" },
801 { "NaN", '/', "NaN", "NaN" },
802 { "0", '/', "infty", "0" },
803 { "42", '/', "infty", "0" },
804 { "-42", '/', "infty", "0" },
805 { "infty", '/', "infty", "NaN" },
806 { "-infty", '/', "infty", "NaN" },
807 { "NaN", '/', "infty", "NaN" },
808 { "0", '/', "-infty", "0" },
809 { "42", '/', "-infty", "0" },
810 { "-42", '/', "-infty", "0" },
811 { "infty", '/', "-infty", "NaN" },
812 { "-infty", '/', "-infty", "NaN" },
813 { "NaN", '/', "-infty", "NaN" },
814 { "1", '-', "1/3", "2/3" },
815 { "1/3", '+', "1/2", "5/6" },
816 { "1/2", '+', "1/2", "1" },
817 { "3/4", '-', "1/4", "1/2" },
818 { "1/2", '-', "1/3", "1/6" },
819 { "infty", '+', "42", "infty" },
820 { "infty", '+', "infty", "infty" },
821 { "42", '+', "infty", "infty" },
822 { "infty", '-', "infty", "NaN" },
823 { "infty", '*', "infty", "infty" },
824 { "infty", '*', "-infty", "-infty" },
825 { "-infty", '*', "infty", "-infty" },
826 { "-infty", '*', "-infty", "infty" },
827 { "0", '*', "infty", "NaN" },
828 { "1", '*', "infty", "infty" },
829 { "infty", '*', "0", "NaN" },
830 { "infty", '*', "42", "infty" },
831 { "42", '-', "infty", "-infty" },
832 { "infty", '+', "-infty", "NaN" },
833 { "4", 'g', "6", "2" },
834 { "5", 'g', "6", "1" },
835 { "42", 'm', "3", "3" },
836 { "42", 'M', "3", "42" },
837 { "3", 'm', "42", "3" },
838 { "3", 'M', "42", "42" },
839 { "42", 'm', "infty", "42" },
840 { "42", 'M', "infty", "infty" },
841 { "42", 'm', "-infty", "-infty" },
842 { "42", 'M', "-infty", "42" },
843 { "42", 'm', "NaN", "NaN" },
844 { "42", 'M', "NaN", "NaN" },
845 { "infty", 'm', "-infty", "-infty" },
846 { "infty", 'M', "-infty", "infty" },
849 /* Perform some basic tests of binary operations on isl_val objects.
851 static int test_bin_val(isl_ctx
*ctx
)
854 isl_val
*v1
, *v2
, *res
;
855 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
856 __isl_take isl_val
*v2
);
859 for (i
= 0; i
< ARRAY_SIZE(val_bin_tests
); ++i
) {
860 v1
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg1
);
861 v2
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg2
);
862 res
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].res
);
863 fn
= val_bin_op
[val_bin_tests
[i
].op
].fn
;
865 if (isl_val_is_nan(res
))
866 ok
= isl_val_is_nan(v1
);
868 ok
= isl_val_eq(v1
, res
);
874 isl_die(ctx
, isl_error_unknown
,
875 "unexpected result", return -1);
881 /* Perform some basic tests on isl_val objects.
883 static int test_val(isl_ctx
*ctx
)
885 if (test_un_val(ctx
) < 0)
887 if (test_bin_val(ctx
) < 0)
892 /* Sets described using existentially quantified variables that
893 * can also be described without.
895 static const char *elimination_tests
[] = {
896 "{ [i,j] : 2 * [i/2] + 3 * [j/4] <= 10 and 2 i = j }",
897 "{ [m, w] : exists a : w - 2m - 5 <= 3a <= m - 2w }",
898 "{ [m, w] : exists a : w >= 0 and a < m and -1 + w <= a <= 2m - w }",
901 /* Check that redundant existentially quantified variables are
904 static int test_elimination(isl_ctx
*ctx
)
910 for (i
= 0; i
< ARRAY_SIZE(elimination_tests
); ++i
) {
911 bset
= isl_basic_set_read_from_str(ctx
, elimination_tests
[i
]);
912 n
= isl_basic_set_dim(bset
, isl_dim_div
);
913 isl_basic_set_free(bset
);
917 isl_die(ctx
, isl_error_unknown
,
918 "expecting no existentials", return -1);
924 static int test_div(isl_ctx
*ctx
)
931 struct isl_basic_set
*bset
;
932 struct isl_constraint
*c
;
935 dim
= isl_space_set_alloc(ctx
, 0, 3);
936 bset
= isl_basic_set_universe(isl_space_copy(dim
));
937 ls
= isl_local_space_from_space(dim
);
939 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
940 c
= isl_constraint_set_constant_si(c
, -1);
941 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
942 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, 3);
943 bset
= isl_basic_set_add_constraint(bset
, c
);
945 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
946 c
= isl_constraint_set_constant_si(c
, 1);
947 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
948 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 3);
949 bset
= isl_basic_set_add_constraint(bset
, c
);
951 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
953 assert(bset
&& bset
->n_div
== 1);
954 isl_local_space_free(ls
);
955 isl_basic_set_free(bset
);
958 dim
= isl_space_set_alloc(ctx
, 0, 3);
959 bset
= isl_basic_set_universe(isl_space_copy(dim
));
960 ls
= isl_local_space_from_space(dim
);
962 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
963 c
= isl_constraint_set_constant_si(c
, 1);
964 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
965 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, 3);
966 bset
= isl_basic_set_add_constraint(bset
, c
);
968 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
969 c
= isl_constraint_set_constant_si(c
, -1);
970 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
971 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 3);
972 bset
= isl_basic_set_add_constraint(bset
, c
);
974 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
976 assert(bset
&& bset
->n_div
== 1);
977 isl_local_space_free(ls
);
978 isl_basic_set_free(bset
);
981 dim
= isl_space_set_alloc(ctx
, 0, 3);
982 bset
= isl_basic_set_universe(isl_space_copy(dim
));
983 ls
= isl_local_space_from_space(dim
);
985 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
986 c
= isl_constraint_set_constant_si(c
, 1);
987 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
988 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, 3);
989 bset
= isl_basic_set_add_constraint(bset
, c
);
991 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
992 c
= isl_constraint_set_constant_si(c
, -3);
993 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
994 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 4);
995 bset
= isl_basic_set_add_constraint(bset
, c
);
997 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
999 assert(bset
&& bset
->n_div
== 1);
1000 isl_local_space_free(ls
);
1001 isl_basic_set_free(bset
);
1004 dim
= isl_space_set_alloc(ctx
, 0, 3);
1005 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1006 ls
= isl_local_space_from_space(dim
);
1008 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1009 c
= isl_constraint_set_constant_si(c
, 2);
1010 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1011 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, 3);
1012 bset
= isl_basic_set_add_constraint(bset
, c
);
1014 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1015 c
= isl_constraint_set_constant_si(c
, -1);
1016 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
1017 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 6);
1018 bset
= isl_basic_set_add_constraint(bset
, c
);
1020 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
1022 assert(isl_basic_set_is_empty(bset
));
1023 isl_local_space_free(ls
);
1024 isl_basic_set_free(bset
);
1027 dim
= isl_space_set_alloc(ctx
, 0, 3);
1028 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1029 ls
= isl_local_space_from_space(dim
);
1031 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1032 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1033 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 3);
1034 bset
= isl_basic_set_add_constraint(bset
, c
);
1036 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1037 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
1038 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, -3);
1039 bset
= isl_basic_set_add_constraint(bset
, c
);
1041 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
1043 assert(bset
&& bset
->n_div
== 0);
1044 isl_basic_set_free(bset
);
1045 isl_local_space_free(ls
);
1048 dim
= isl_space_set_alloc(ctx
, 0, 3);
1049 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1050 ls
= isl_local_space_from_space(dim
);
1052 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1053 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1054 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 6);
1055 bset
= isl_basic_set_add_constraint(bset
, c
);
1057 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1058 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
1059 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, -3);
1060 bset
= isl_basic_set_add_constraint(bset
, c
);
1062 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
1064 assert(bset
&& bset
->n_div
== 1);
1065 isl_basic_set_free(bset
);
1066 isl_local_space_free(ls
);
1069 /* This test is a bit tricky. We set up an equality
1070 * a + 3b + 3c = 6 e0
1071 * Normalization of divs creates _two_ divs
1074 * Afterwards e0 is removed again because it has coefficient -1
1075 * and we end up with the original equality and div again.
1076 * Perhaps we can avoid the introduction of this temporary div.
1078 dim
= isl_space_set_alloc(ctx
, 0, 4);
1079 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1080 ls
= isl_local_space_from_space(dim
);
1082 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1083 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1084 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, -3);
1085 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, -3);
1086 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 3, 6);
1087 bset
= isl_basic_set_add_constraint(bset
, c
);
1089 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
1091 /* Test disabled for now */
1093 assert(bset && bset->n_div == 1);
1095 isl_local_space_free(ls
);
1096 isl_basic_set_free(bset
);
1099 dim
= isl_space_set_alloc(ctx
, 0, 5);
1100 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1101 ls
= isl_local_space_from_space(dim
);
1103 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1104 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1105 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, -3);
1106 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 3, -3);
1107 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 4, 6);
1108 bset
= isl_basic_set_add_constraint(bset
, c
);
1110 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1111 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1112 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, 1);
1113 c
= isl_constraint_set_constant_si(c
, 1);
1114 bset
= isl_basic_set_add_constraint(bset
, c
);
1116 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
1118 /* Test disabled for now */
1120 assert(bset && bset->n_div == 1);
1122 isl_local_space_free(ls
);
1123 isl_basic_set_free(bset
);
1126 dim
= isl_space_set_alloc(ctx
, 0, 4);
1127 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1128 ls
= isl_local_space_from_space(dim
);
1130 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1131 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
1132 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 1, -1);
1133 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, -2);
1134 bset
= isl_basic_set_add_constraint(bset
, c
);
1136 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1137 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, -1);
1138 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 3, 3);
1139 c
= isl_constraint_set_constant_si(c
, 2);
1140 bset
= isl_basic_set_add_constraint(bset
, c
);
1142 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
1144 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
1146 assert(!isl_basic_set_is_empty(bset
));
1148 isl_local_space_free(ls
);
1149 isl_basic_set_free(bset
);
1152 dim
= isl_space_set_alloc(ctx
, 0, 3);
1153 bset
= isl_basic_set_universe(isl_space_copy(dim
));
1154 ls
= isl_local_space_from_space(dim
);
1156 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
1157 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 0, 1);
1158 c
= isl_constraint_set_coefficient_si(c
, isl_dim_set
, 2, -2);
1159 bset
= isl_basic_set_add_constraint(bset
, c
);
1161 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
1163 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
1165 isl_local_space_free(ls
);
1166 isl_basic_set_free(bset
);
1168 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
1169 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
1170 set
= isl_set_read_from_str(ctx
, str
);
1171 set
= isl_set_compute_divs(set
);
1176 if (test_elimination(ctx
) < 0)
1179 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
1180 set
= isl_set_read_from_str(ctx
, str
);
1181 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
1182 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
1183 empty
= isl_set_is_empty(set
);
1188 isl_die(ctx
, isl_error_unknown
,
1189 "result not as accurate as expected", return -1);
1194 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
1198 struct isl_basic_set
*bset1
, *bset2
;
1199 struct isl_basic_map
*bmap
;
1201 filename
= get_filename(ctx
, name
, "omega");
1203 input
= fopen(filename
, "r");
1206 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1207 bmap
= isl_basic_map_read_from_file(ctx
, input
);
1209 bset1
= isl_basic_set_apply(bset1
, bmap
);
1211 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1213 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1215 isl_basic_set_free(bset1
);
1216 isl_basic_set_free(bset2
);
1222 static int test_application(isl_ctx
*ctx
)
1224 test_application_case(ctx
, "application");
1225 test_application_case(ctx
, "application2");
1230 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
1234 struct isl_basic_set
*bset1
, *bset2
;
1236 filename
= get_filename(ctx
, name
, "polylib");
1238 input
= fopen(filename
, "r");
1241 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1242 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1244 bset1
= isl_basic_set_affine_hull(bset1
);
1246 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1248 isl_basic_set_free(bset1
);
1249 isl_basic_set_free(bset2
);
1255 int test_affine_hull(struct isl_ctx
*ctx
)
1259 isl_basic_set
*bset
, *bset2
;
1263 test_affine_hull_case(ctx
, "affine2");
1264 test_affine_hull_case(ctx
, "affine");
1265 test_affine_hull_case(ctx
, "affine3");
1267 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
1268 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1269 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1270 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1271 set
= isl_set_read_from_str(ctx
, str
);
1272 bset
= isl_set_affine_hull(set
);
1273 n
= isl_basic_set_dim(bset
, isl_dim_div
);
1274 isl_basic_set_free(bset
);
1276 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
1279 /* Check that isl_map_affine_hull is not confused by
1280 * the reordering of divs in isl_map_align_divs.
1282 str
= "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1283 "32e0 = b and 32e1 = c); "
1284 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1285 set
= isl_set_read_from_str(ctx
, str
);
1286 bset
= isl_set_affine_hull(set
);
1287 isl_basic_set_free(bset
);
1291 str
= "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1292 "32e2 = 31 + 31e0 }";
1293 set
= isl_set_read_from_str(ctx
, str
);
1294 bset
= isl_set_affine_hull(set
);
1295 str
= "{ [a] : exists e : a = 32 e }";
1296 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1297 subset
= isl_basic_set_is_subset(bset
, bset2
);
1298 isl_basic_set_free(bset
);
1299 isl_basic_set_free(bset2
);
1303 isl_die(ctx
, isl_error_unknown
, "not as accurate as expected",
1309 /* Pairs of maps and the corresponding expected results of
1310 * isl_map_plain_unshifted_simple_hull.
1315 } plain_unshifted_simple_hull_tests
[] = {
1316 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1317 "{ [i] -> [j] : i >= 1 }" },
1318 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1319 "(j mod 4 = 2 and k mod 6 = n) }",
1320 "{ [n] -> [i,j,k] : j mod 4 = 2 }" },
1323 /* Basic tests for isl_map_plain_unshifted_simple_hull.
1325 static int test_plain_unshifted_simple_hull(isl_ctx
*ctx
)
1329 isl_basic_map
*hull
, *expected
;
1332 for (i
= 0; i
< ARRAY_SIZE(plain_unshifted_simple_hull_tests
); ++i
) {
1334 str
= plain_unshifted_simple_hull_tests
[i
].map
;
1335 map
= isl_map_read_from_str(ctx
, str
);
1336 str
= plain_unshifted_simple_hull_tests
[i
].hull
;
1337 expected
= isl_basic_map_read_from_str(ctx
, str
);
1338 hull
= isl_map_plain_unshifted_simple_hull(map
);
1339 equal
= isl_basic_map_is_equal(hull
, expected
);
1340 isl_basic_map_free(hull
);
1341 isl_basic_map_free(expected
);
1345 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1352 /* Pairs of sets and the corresponding expected results of
1353 * isl_set_unshifted_simple_hull.
1358 } unshifted_simple_hull_tests
[] = {
1359 { "{ [0,x,y] : x <= -1; [1,x,y] : x <= y <= -x; [2,x,y] : x <= 1 }",
1360 "{ [t,x,y] : 0 <= t <= 2 and x <= 1 }" },
1363 /* Basic tests for isl_set_unshifted_simple_hull.
1365 static int test_unshifted_simple_hull(isl_ctx
*ctx
)
1369 isl_basic_set
*hull
, *expected
;
1372 for (i
= 0; i
< ARRAY_SIZE(unshifted_simple_hull_tests
); ++i
) {
1374 str
= unshifted_simple_hull_tests
[i
].set
;
1375 set
= isl_set_read_from_str(ctx
, str
);
1376 str
= unshifted_simple_hull_tests
[i
].hull
;
1377 expected
= isl_basic_set_read_from_str(ctx
, str
);
1378 hull
= isl_set_unshifted_simple_hull(set
);
1379 equal
= isl_basic_set_is_equal(hull
, expected
);
1380 isl_basic_set_free(hull
);
1381 isl_basic_set_free(expected
);
1385 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1392 static int test_simple_hull(struct isl_ctx
*ctx
)
1396 isl_basic_set
*bset
;
1399 str
= "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x;"
1400 "[y, x] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }";
1401 set
= isl_set_read_from_str(ctx
, str
);
1402 bset
= isl_set_simple_hull(set
);
1403 is_empty
= isl_basic_set_is_empty(bset
);
1404 isl_basic_set_free(bset
);
1406 if (is_empty
== isl_bool_error
)
1409 if (is_empty
== isl_bool_false
)
1410 isl_die(ctx
, isl_error_unknown
, "Empty set should be detected",
1413 if (test_plain_unshifted_simple_hull(ctx
) < 0)
1415 if (test_unshifted_simple_hull(ctx
) < 0)
1421 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
1425 struct isl_basic_set
*bset1
, *bset2
;
1426 struct isl_set
*set
;
1428 filename
= get_filename(ctx
, name
, "polylib");
1430 input
= fopen(filename
, "r");
1433 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1434 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1436 set
= isl_basic_set_union(bset1
, bset2
);
1437 bset1
= isl_set_convex_hull(set
);
1439 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1441 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1443 isl_basic_set_free(bset1
);
1444 isl_basic_set_free(bset2
);
1453 } convex_hull_tests
[] = {
1454 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1455 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1456 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1457 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1458 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1459 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1460 "i2 <= 5 and i2 >= 4; "
1461 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1462 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1463 "i2 <= 5 + i0 and i2 >= i0 }" },
1464 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1465 "{ [x, y] : 1 = 0 }" },
1466 { "{ [x, y, z] : 0 <= x, y, z <= 10; [x, y, 0] : x >= 0 and y > 0; "
1467 "[x, y, 0] : x >= 0 and y < 0 }",
1468 "{ [x, y, z] : x >= 0 and 0 <= z <= 10 }" },
1471 static int test_convex_hull_algo(isl_ctx
*ctx
, int convex
)
1474 int orig_convex
= ctx
->opt
->convex
;
1475 ctx
->opt
->convex
= convex
;
1477 test_convex_hull_case(ctx
, "convex0");
1478 test_convex_hull_case(ctx
, "convex1");
1479 test_convex_hull_case(ctx
, "convex2");
1480 test_convex_hull_case(ctx
, "convex3");
1481 test_convex_hull_case(ctx
, "convex4");
1482 test_convex_hull_case(ctx
, "convex5");
1483 test_convex_hull_case(ctx
, "convex6");
1484 test_convex_hull_case(ctx
, "convex7");
1485 test_convex_hull_case(ctx
, "convex8");
1486 test_convex_hull_case(ctx
, "convex9");
1487 test_convex_hull_case(ctx
, "convex10");
1488 test_convex_hull_case(ctx
, "convex11");
1489 test_convex_hull_case(ctx
, "convex12");
1490 test_convex_hull_case(ctx
, "convex13");
1491 test_convex_hull_case(ctx
, "convex14");
1492 test_convex_hull_case(ctx
, "convex15");
1494 for (i
= 0; i
< ARRAY_SIZE(convex_hull_tests
); ++i
) {
1495 isl_set
*set1
, *set2
;
1498 set1
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].set
);
1499 set2
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].hull
);
1500 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
1501 equal
= isl_set_is_equal(set1
, set2
);
1508 isl_die(ctx
, isl_error_unknown
,
1509 "unexpected convex hull", return -1);
1512 ctx
->opt
->convex
= orig_convex
;
1517 static int test_convex_hull(isl_ctx
*ctx
)
1519 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
) < 0)
1521 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
) < 0)
1526 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
1530 struct isl_basic_set
*bset1
, *bset2
;
1532 filename
= get_filename(ctx
, name
, "polylib");
1534 input
= fopen(filename
, "r");
1537 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1538 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1540 bset1
= isl_basic_set_gist(bset1
, bset2
);
1542 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1544 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1546 isl_basic_set_free(bset1
);
1547 isl_basic_set_free(bset2
);
1553 /* Inputs to isl_map_plain_gist_basic_map, along with the expected output.
1557 const char *context
;
1559 } plain_gist_tests
[] = {
1560 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1561 "{ [i] -> [j] : i >= 1 }",
1562 "{ [i] -> [j] : j >= 1 or i >= 2 and j <= 10 }" },
1563 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1564 "(j mod 4 = 2 and k mod 6 = n) }",
1565 "{ [n] -> [i,j,k] : j mod 4 = 2 }",
1566 "{ [n] -> [i,j,k] : (i mod 3 = 2) or (k mod 6 = n) }" },
1567 { "{ [i] -> [j] : i > j and (exists a,b : i <= 2a + 5b <= 2) }",
1568 "{ [i] -> [j] : i > j }",
1569 "{ [i] -> [j] : exists a,b : i <= 2a + 5b <= 2 }" },
1572 /* Basic tests for isl_map_plain_gist_basic_map.
1574 static int test_plain_gist(isl_ctx
*ctx
)
1578 for (i
= 0; i
< ARRAY_SIZE(plain_gist_tests
); ++i
) {
1581 isl_map
*map
, *gist
;
1582 isl_basic_map
*context
;
1584 map
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].map
);
1585 str
= plain_gist_tests
[i
].context
;
1586 context
= isl_basic_map_read_from_str(ctx
, str
);
1587 map
= isl_map_plain_gist_basic_map(map
, context
);
1588 gist
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].gist
);
1589 equal
= isl_map_is_equal(map
, gist
);
1595 isl_die(ctx
, isl_error_unknown
,
1596 "incorrect gist result", return -1);
1604 const char *context
;
1607 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1608 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1609 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1610 "{ [a, b, c] : a <= 15 }" },
1611 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1612 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1613 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1614 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1615 { "{ [m, n, a, b] : a <= 2147 + n }",
1616 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1617 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1618 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1620 "{ [m, n, ku, kl] }" },
1621 { "{ [a, a, b] : a >= 10 }",
1622 "{ [a, b, c] : c >= a and c <= b and c >= 2 }",
1623 "{ [a, a, b] : a >= 10 }" },
1624 { "{ [i, j] : i >= 0 and i + j >= 0 }", "{ [i, j] : i <= 0 }",
1625 "{ [0, j] : j >= 0 }" },
1626 /* Check that no constraints on i6 are introduced in the gist */
1627 { "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1628 "20e0 <= 1530 - 4t1 - 5i4 and 20e0 >= 1511 - 4t1 - 5i4 and "
1629 "5e0 <= 381 - t1 and i4 <= 1) }",
1630 "[t1] -> { [i4, i6] : exists (e0 = floor((-t1 + i6)/5): "
1631 "5e0 = -t1 + i6 and i6 <= 6 and i6 >= 3) }",
1632 "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1633 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 <= 1530 - 4t1 - 5i4 and "
1634 "20e0 >= 1511 - 4t1 - 5i4) }" },
1635 /* Check that no constraints on i6 are introduced in the gist */
1636 { "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((1 + i4)/2), "
1637 "e1 = floor((1530 - 4t1 - 5i4)/20), "
1638 "e2 = floor((-4t1 - 5i4 + 10*floor((1 + i4)/2))/20), "
1639 "e3 = floor((-1 + i4)/2): t2 = 0 and 2e3 = -1 + i4 and "
1640 "20e2 >= -19 - 4t1 - 5i4 + 10e0 and 5e2 <= 1 - t1 and "
1641 "2e0 <= 1 + i4 and 2e0 >= i4 and "
1642 "20e1 <= 1530 - 4t1 - 5i4 and "
1643 "20e1 >= 1511 - 4t1 - 5i4 and i4 <= 1 and "
1644 "5e1 <= 381 - t1 and 20e2 <= -4t1 - 5i4 + 10e0) }",
1645 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((-17 + i4)/2), "
1646 "e1 = floor((-t1 + i6)/5): 5e1 = -t1 + i6 and "
1647 "2e0 <= -17 + i4 and 2e0 >= -18 + i4 and "
1648 "10e0 <= -91 + 5i4 + 4i6 and "
1649 "10e0 >= -105 + 5i4 + 4i6) }",
1650 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((381 - t1)/5), "
1651 "e1 = floor((-1 + i4)/2): t2 = 0 and 2e1 = -1 + i4 and "
1652 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 >= 1511 - 4t1 - 5i4) }" },
1653 { "{ [0, 0, q, p] : -5 <= q <= 5 and p >= 0 }",
1654 "{ [a, b, q, p] : b >= 1 + a }",
1655 "{ [a, b, q, p] : false }" },
1656 { "[n] -> { [x] : x = n && x mod 32 = 0 }",
1657 "[n] -> { [x] : x mod 32 = 0 }",
1658 "[n] -> { [x = n] }" },
1659 { "{ [x] : x mod 6 = 0 }", "{ [x] : x mod 3 = 0 }",
1660 "{ [x] : x mod 2 = 0 }" },
1661 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10000 = 0 }",
1662 "{ [x] : x mod 128 = 0 }" },
1663 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10 = 0 }",
1664 "{ [x] : x mod 3200 = 0 }" },
1665 { "{ [a, b, c] : a mod 2 = 0 and a = c }",
1666 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1667 "{ [a, b, c = a] }" },
1668 { "{ [a, b, c] : a mod 6 = 0 and a = c }",
1669 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1670 "{ [a, b, c = a] : a mod 3 = 0 }" },
1671 { "{ [x] : 0 <= x <= 4 or 6 <= x <= 9 }",
1672 "{ [x] : 1 <= x <= 3 or 7 <= x <= 8 }",
1674 { "{ [x,y] : x < 0 and 0 <= y <= 4 or x >= -2 and -x <= y <= 10 + x }",
1675 "{ [x,y] : 1 <= y <= 3 }",
1679 /* Check that isl_set_gist behaves as expected.
1681 * For the test cases in gist_tests, besides checking that the result
1682 * is as expected, also check that applying the gist operation does
1683 * not modify the input set (an earlier version of isl would do that) and
1684 * that the test case is consistent, i.e., that the gist has the same
1685 * intersection with the context as the input set.
1687 static int test_gist(struct isl_ctx
*ctx
)
1691 isl_basic_set
*bset1
, *bset2
;
1692 isl_map
*map1
, *map2
;
1695 for (i
= 0; i
< ARRAY_SIZE(gist_tests
); ++i
) {
1696 int equal_input
, equal_intersection
;
1697 isl_set
*set1
, *set2
, *copy
, *context
;
1699 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1700 context
= isl_set_read_from_str(ctx
, gist_tests
[i
].context
);
1701 copy
= isl_set_copy(set1
);
1702 set1
= isl_set_gist(set1
, isl_set_copy(context
));
1703 set2
= isl_set_read_from_str(ctx
, gist_tests
[i
].gist
);
1704 equal
= isl_set_is_equal(set1
, set2
);
1706 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1707 equal_input
= isl_set_is_equal(set1
, copy
);
1709 set1
= isl_set_intersect(set1
, isl_set_copy(context
));
1710 set2
= isl_set_intersect(set2
, context
);
1711 equal_intersection
= isl_set_is_equal(set1
, set2
);
1714 if (equal
< 0 || equal_input
< 0 || equal_intersection
< 0)
1717 isl_die(ctx
, isl_error_unknown
,
1718 "incorrect gist result", return -1);
1720 isl_die(ctx
, isl_error_unknown
,
1721 "gist modified input", return -1);
1723 isl_die(ctx
, isl_error_unknown
,
1724 "inconsistent gist test case", return -1);
1727 test_gist_case(ctx
, "gist1");
1729 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
1730 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1731 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1732 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1733 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1734 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1735 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1736 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1737 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1738 bset1
= isl_basic_set_read_from_str(ctx
, str
);
1739 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1740 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1741 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1742 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1743 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1744 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1745 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1746 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1747 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1748 bset1
= isl_basic_set_gist(bset1
, bset2
);
1749 assert(bset1
&& bset1
->n_div
== 0);
1750 isl_basic_set_free(bset1
);
1752 /* Check that the integer divisions of the second disjunct
1753 * do not spread to the first disjunct.
1755 str
= "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1756 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1757 "(exists (e0 = [(-1 + t1)/16], "
1758 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1759 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1760 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1761 "o0 <= 4294967295 and t1 <= -1)) }";
1762 map1
= isl_map_read_from_str(ctx
, str
);
1763 str
= "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1764 map2
= isl_map_read_from_str(ctx
, str
);
1765 map1
= isl_map_gist(map1
, map2
);
1769 isl_die(ctx
, isl_error_unknown
, "expecting single disjunct",
1770 isl_map_free(map1
); return -1);
1771 if (isl_basic_map_dim(map1
->p
[0], isl_dim_div
) != 1)
1772 isl_die(ctx
, isl_error_unknown
, "expecting single div",
1773 isl_map_free(map1
); return -1);
1776 if (test_plain_gist(ctx
) < 0)
1782 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
1784 isl_set
*set
, *set2
;
1788 set
= isl_set_read_from_str(ctx
, str
);
1789 set
= isl_set_coalesce(set
);
1790 set2
= isl_set_read_from_str(ctx
, str
);
1791 equal
= isl_set_is_equal(set
, set2
);
1792 one
= set
&& set
->n
== 1;
1799 isl_die(ctx
, isl_error_unknown
,
1800 "coalesced set not equal to input", return -1);
1801 if (check_one
&& !one
)
1802 isl_die(ctx
, isl_error_unknown
,
1803 "coalesced set should not be a union", return -1);
1808 /* Inputs for coalescing tests with unbounded wrapping.
1809 * "str" is a string representation of the input set.
1810 * "single_disjunct" is set if we expect the result to consist of
1811 * a single disjunct.
1814 int single_disjunct
;
1816 } coalesce_unbounded_tests
[] = {
1817 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1818 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1819 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1820 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1822 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1823 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1824 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1825 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1828 /* Test the functionality of isl_set_coalesce with the bounded wrapping
1829 * option turned off.
1831 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
1837 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
1838 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
1840 for (i
= 0; i
< ARRAY_SIZE(coalesce_unbounded_tests
); ++i
) {
1841 const char *str
= coalesce_unbounded_tests
[i
].str
;
1842 int check_one
= coalesce_unbounded_tests
[i
].single_disjunct
;
1843 if (test_coalesce_set(ctx
, str
, check_one
) >= 0)
1849 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
1854 /* Inputs for coalescing tests.
1855 * "str" is a string representation of the input set.
1856 * "single_disjunct" is set if we expect the result to consist of
1857 * a single disjunct.
1860 int single_disjunct
;
1862 } coalesce_tests
[] = {
1863 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1864 "y >= x & x >= 2 & 5 >= y }" },
1865 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1866 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1867 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1868 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1869 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1870 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1871 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1872 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1873 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1874 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1875 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1876 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1877 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1878 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1879 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1880 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1881 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1882 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1883 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1884 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1885 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1886 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1887 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1888 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1889 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1890 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1891 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1892 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1893 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1894 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1895 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1896 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1897 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1898 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1899 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1900 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1901 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1902 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1903 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1904 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1905 "[o0, o1, o2, o3, o4, o5, o6]] : "
1906 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1907 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1908 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1909 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1910 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1911 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1912 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1913 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1914 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1915 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1916 "o6 >= i3 + i6 - o3 and M >= 0 and "
1917 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1918 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1919 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1920 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1921 "(o0 = 0 and M >= 2 and N >= 3) or "
1922 "(M = 0 and o0 = 0 and N >= 3) }" },
1923 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1924 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1925 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1926 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1927 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1928 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1929 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1930 "(y = 3 and x = 1) }" },
1931 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1932 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1933 "i1 <= M and i3 <= M and i4 <= M) or "
1934 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1935 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1936 "i4 <= -1 + M) }" },
1937 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1938 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1939 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1940 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1941 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1942 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1943 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1944 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1945 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1946 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1947 { 0, "{ [a, b] : exists e : 2e = a and "
1948 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1949 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1950 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1951 "j >= 1 and j' <= i + j - i' and i >= 1; "
1953 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1954 "[i,j] : exists a : j = 3a }" },
1955 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1956 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1958 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1959 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1960 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1961 "c <= 6 + 8a and a >= 3; "
1962 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1963 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1964 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1965 "[x,0] : 3 <= x <= 4 }" },
1966 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1967 "[x,0] : 4 <= x <= 5 }" },
1968 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1969 "[x,0] : 3 <= x <= 5 }" },
1970 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1971 "[x,0] : 3 <= x <= 4 }" },
1972 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1974 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1975 { 1, "{ [0,0]; [1,1] }" },
1976 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1977 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1979 "[k, 0, k] : k <= 6 and k >= 1 }" },
1980 { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;"
1981 "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" },
1982 { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" },
1983 { 1, "[n] -> { [1] : n >= 0;"
1984 "[x] : exists (e0 = floor((x)/2): x >= 2 and "
1985 "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" },
1986 { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): "
1987 "3e1 = y and x >= 2 and 2e0 >= -1 + x and "
1988 "2e0 <= x and 2e0 <= n);"
1989 "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and "
1991 { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): "
1992 "128e0 >= -134 + 127t1 and t1 >= 2 and "
1993 "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or "
1995 { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and "
1996 "3e0 >= -1 + 2i and i <= 9 and i >= 1);"
1998 { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and "
1999 "t1 >= 13 and t1 <= 16);"
2000 "[t1] : t1 <= 15 and t1 >= 12 }" },
2001 { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" },
2002 { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" },
2003 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" },
2004 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" },
2005 { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;"
2006 "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and "
2008 { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or "
2009 "(exists (e0 : 3e0 = -2 + c0)) }" },
2010 { 0, "[n, b0, t0] -> "
2011 "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2012 "(exists (e0 = floor((-32b0 + i4)/1048576), "
2013 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
2014 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
2015 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and "
2016 "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and "
2017 "i8 >= -157 + i0 - 4i4 and i8 >= 0 and "
2018 "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or "
2019 "(exists (e0 = floor((-32b0 + i4)/1048576), "
2020 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
2021 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
2022 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and "
2023 "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and "
2024 "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and "
2025 "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));"
2026 "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : "
2027 "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and "
2028 "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and "
2029 "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and "
2030 "i8 >= -40 + i0 and i8 <= -10 + i0)) }" },
2031 { 0, "{ [i0, i1, i2] : "
2032 "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): "
2033 "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and "
2034 "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and "
2035 "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and "
2036 "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and "
2037 "32e0 <= 31 + i0)) or "
2039 { 1, "{ [a, b, c] : 2b = 1 + a and 2c = 2 + a; [0, 0, 0] }" },
2040 { 1, "{ [a, a, b, c] : 32*floor((a)/32) = a and 2*floor((b)/2) = b and "
2041 "2*floor((c)/2) = c and 0 <= a <= 192;"
2042 "[224, 224, b, c] : 2*floor((b)/2) = b and 2*floor((c)/2) = c }"
2044 { 1, "[n] -> { [a,b] : (exists e : 1 <= a <= 7e and 9e <= b <= n) or "
2045 "(0 <= a <= b <= n) }" },
2046 { 1, "{ [a, b] : 0 <= a <= 2 and b >= 0 and "
2047 "((0 < b <= 13) or (2*floor((a + b)/2) >= -5 + a + 2b)) }" },
2048 { 1, "{ [a] : (2 <= a <= 5) or (a mod 2 = 1 and 1 <= a <= 5) }" },
2049 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
2050 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
2051 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
2052 "b = 3 and 9e0 <= -19 + 2c)) }" },
2053 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
2054 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
2055 "(a = 4 and b = 3 and "
2056 "9*floor((-16 + 2c)/9) <= -19 + 2c) }" },
2057 { 0, "{ [a, b, c] : (b <= 2 and b <= -2 + a) or "
2058 "(b = -1 + a and 0 < a <= 3 and "
2059 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
2060 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
2061 "b = 3 and 9e0 <= -19 + 2c)) }" },
2062 { 1, "{ [y, x] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
2064 { 1, "{ [x, y] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
2066 { 1, "{ [1, y] : -1 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
2067 { 1, "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
2068 { 1, "{ [x, y] : 0 <= x <= 10 and x - 4*floor(x/4) <= 1 and y <= 0; "
2069 "[x, y] : 0 <= x <= 10 and x - 4*floor(x/4) > 1 and y <= 0; "
2070 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) <= 1 and 0 < y; "
2071 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) > 1 and 0 < y }" },
2072 { 1, "{ [x, 0] : 0 <= x <= 10 and x mod 2 = 0; "
2073 "[x, 0] : 0 <= x <= 10 and x mod 2 = 1; "
2074 "[x, y] : 0 <= x <= 10 and 1 <= y <= 10 }" },
2075 { 1, "{ [a] : a <= 8 and "
2076 "(a mod 10 = 7 or a mod 10 = 8 or a mod 10 = 9) }" },
2077 { 1, "{ [x, y] : 2y = -x and x <= 0 or "
2078 "x <= -1 and 2y <= -x - 1 and 2y >= x - 1 }" },
2079 { 0, "{ [x, y] : 2y = -x and x <= 0 or "
2080 "x <= -2 and 2y <= -x - 1 and 2y >= x - 1 }" },
2081 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
2082 "(a < 0 and 3*floor((a)/3) < a) }" },
2083 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
2084 "(a < -1 and 3*floor((a)/3) < a) }" },
2085 { 1, "{ [a, b] : a <= 1024 and b >= 0 and "
2086 "((-31 - a + b <= 32*floor((-1 - a)/32) <= -33 + b and "
2087 "32*floor((-1 - a)/32) <= -16 + b + 16*floor((-1 - a)/16))"
2088 "or (2 <= a <= 15 and b < a)) }" },
2089 { 1, "{ [a] : a > 0 and ((16*floor((a)/16) < a and "
2090 "32*floor((a)/32) < a) or a <= 15) }" },
2091 { 1, "{ [a, b, c, d] : (-a + d) mod 64 = 0 and a <= 8 and b <= 1 and "
2092 "10 - a <= c <= 3 and d >= 5 and 9 - 64b <= d <= 70;"
2093 "[a, b = 1, c, d] : (-a + d) mod 64 = 0 and a <= 8 and c >= 4 and "
2094 "10 - a <= c <= 5 and 5 <= d <= 73 - c }" },
2095 { 1, "[n, m] -> { S_0[i] : (-n + i) mod 3 = 0 and m >= 3 + n and "
2096 "i >= n and 3*floor((2 + n + 2m)/3) <= n + 3m - i; "
2097 "S_0[n] : n <= m <= 2 + n }" },
2098 { 1, "{ [a, b] : exists (e0: 0 <= a <= 1 and b >= 0 and "
2099 "2e0 >= -5 + a + 2b and 2e0 >= -1 + a + b and "
2101 "[a, b] : exists (e0: 0 <= a <= 1 and 2e0 >= -5 + a + 2b and "
2102 "2e0 >= -1 - a + b and 2e0 <= -a + b and "
2103 "2e0 < -a + 2b) }" },
2104 { 1, "{ [i, j, i - 8j] : 8 <= i <= 63 and -7 + i <= 8j <= i; "
2105 "[i, 0, i] : 0 <= i <= 7 }" },
2106 { 1, "{ [a, b] : a >= 0 and 0 <= b <= 1 - a; [1, 1] }" },
2107 { 0, "{ [a, b] : a >= 0 and 0 <= b <= 1 - a; [0, 2] }" },
2108 { 0, "{ [a, b] : a >= 0 and 0 <= b <= 1 - a; [-1, 3] }" },
2109 { 1, "{ [a, b] : a, b >= 0 and a + 2b <= 2; [1, 1] }" },
2110 { 0, "{ [a, b] : a, b >= 0 and a + 2b <= 2; [2, 1] }" },
2111 { 0, "{ [a, c] : (2 + a) mod 4 = 0 or "
2112 "(c = 4 + a and 4 * floor((a)/4) = a and a >= 0 and a <= 4) or "
2113 "(c = 3 + a and 4 * floor((-1 + a)/4) = -1 + a and "
2114 "a > 0 and a <= 5) }" },
2117 /* A specialized coalescing test case that would result
2118 * in a segmentation fault or a failed assertion in earlier versions of isl.
2120 static int test_coalesce_special(struct isl_ctx
*ctx
)
2123 isl_map
*map1
, *map2
;
2125 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
2126 "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : "
2127 "(y = 201 and o1 <= 239 and o1 >= 212) or "
2128 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and "
2129 "o1 <= 239 and o1 >= 212)) or "
2130 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and "
2131 "o1 <= 241 and o1 >= 240));"
2132 "[S_L220_OUT[] -> T7[]] -> "
2133 "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : "
2134 "(y = 2 and o1 <= 241 and o1 >= 212) or "
2135 "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and "
2136 "y >= 5 and o1 <= 241 and o1 >= 212)) }";
2137 map1
= isl_map_read_from_str(ctx
, str
);
2138 map1
= isl_map_align_divs_internal(map1
);
2139 map1
= isl_map_coalesce(map1
);
2140 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
2141 "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : "
2142 "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and "
2143 "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and "
2144 "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }";
2145 map2
= isl_map_read_from_str(ctx
, str
);
2146 map2
= isl_map_union(map2
, map1
);
2147 map2
= isl_map_align_divs_internal(map2
);
2148 map2
= isl_map_coalesce(map2
);
2156 /* A specialized coalescing test case that would result in an assertion
2157 * in an earlier version of isl.
2158 * The explicit call to isl_basic_set_union prevents the implicit
2159 * equality constraints in the first basic map from being detected prior
2160 * to the call to isl_set_coalesce, at least at the point
2161 * where this test case was introduced.
2163 static int test_coalesce_special2(struct isl_ctx
*ctx
)
2166 isl_basic_set
*bset1
, *bset2
;
2169 str
= "{ [x, y] : x, y >= 0 and x + 2y <= 1 and 2x + y <= 1 }";
2170 bset1
= isl_basic_set_read_from_str(ctx
, str
);
2171 str
= "{ [x,0] : -1 <= x <= 1 and x mod 2 = 1 }" ;
2172 bset2
= isl_basic_set_read_from_str(ctx
, str
);
2173 set
= isl_basic_set_union(bset1
, bset2
);
2174 set
= isl_set_coalesce(set
);
2182 /* Check that calling isl_set_coalesce does not leave other sets
2183 * that may share some information with the input to isl_set_coalesce
2184 * in an inconsistent state.
2185 * In particular, older versions of isl would modify all copies
2186 * of the basic sets in the isl_set_coalesce input in a way
2187 * that could leave them in an inconsistent state.
2188 * The result of printing any other set containing one of these
2189 * basic sets would then result in an invalid set description.
2191 static int test_coalesce_special3(isl_ctx
*ctx
)
2195 isl_set
*set1
, *set2
;
2198 set1
= isl_set_read_from_str(ctx
, "{ [0, 0, 0] }");
2199 str
= "{ [a, b, a + b] : a >= 0 and b >= 0 and 0 < a + b }";
2200 set2
= isl_set_read_from_str(ctx
, str
);
2201 set1
= isl_set_union(set1
, isl_set_copy(set2
));
2202 set1
= isl_set_coalesce(set1
);
2205 p
= isl_printer_to_str(ctx
);
2206 p
= isl_printer_print_set(p
, set2
);
2208 s
= isl_printer_get_str(p
);
2209 isl_printer_free(p
);
2210 set1
= isl_set_read_from_str(ctx
, s
);
2220 /* Test the functionality of isl_set_coalesce.
2221 * That is, check that the output is always equal to the input
2222 * and in some cases that the result consists of a single disjunct.
2224 static int test_coalesce(struct isl_ctx
*ctx
)
2228 for (i
= 0; i
< ARRAY_SIZE(coalesce_tests
); ++i
) {
2229 const char *str
= coalesce_tests
[i
].str
;
2230 int check_one
= coalesce_tests
[i
].single_disjunct
;
2231 if (test_coalesce_set(ctx
, str
, check_one
) < 0)
2235 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
2237 if (test_coalesce_special(ctx
) < 0)
2239 if (test_coalesce_special2(ctx
) < 0)
2241 if (test_coalesce_special3(ctx
) < 0)
2247 /* Construct a representation of the graph on the right of Figure 1
2248 * in "Computing the Transitive Closure of a Union of
2249 * Affine Integer Tuple Relations".
2251 static __isl_give isl_map
*cocoa_fig_1_right_graph(isl_ctx
*ctx
)
2254 isl_map
*up
, *right
;
2256 dom
= isl_set_read_from_str(ctx
,
2257 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
2258 "2 x - 3 y + 3 >= 0 }");
2259 right
= isl_map_read_from_str(ctx
,
2260 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
2261 up
= isl_map_read_from_str(ctx
,
2262 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
2263 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
2264 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
2265 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
2266 up
= isl_map_intersect_range(up
, dom
);
2267 return isl_map_union(up
, right
);
2270 /* Construct a representation of the power of the graph
2271 * on the right of Figure 1 in "Computing the Transitive Closure of
2272 * a Union of Affine Integer Tuple Relations".
2274 static __isl_give isl_map
*cocoa_fig_1_right_power(isl_ctx
*ctx
)
2276 return isl_map_read_from_str(ctx
,
2277 "{ [1] -> [[0,0] -> [0,1]]; [2] -> [[0,0] -> [1,1]]; "
2278 " [1] -> [[0,1] -> [1,1]]; [1] -> [[2,2] -> [3,2]]; "
2279 " [2] -> [[2,2] -> [3,3]]; [1] -> [[3,2] -> [3,3]] }");
2282 /* Construct a representation of the transitive closure of the graph
2283 * on the right of Figure 1 in "Computing the Transitive Closure of
2284 * a Union of Affine Integer Tuple Relations".
2286 static __isl_give isl_map
*cocoa_fig_1_right_tc(isl_ctx
*ctx
)
2288 return isl_set_unwrap(isl_map_range(cocoa_fig_1_right_power(ctx
)));
2291 static int test_closure(isl_ctx
*ctx
)
2294 isl_map
*map
, *map2
;
2297 /* COCOA example 1 */
2298 map
= isl_map_read_from_str(ctx
,
2299 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2300 "1 <= i and i < n and 1 <= j and j < n or "
2301 "i2 = i + 1 and j2 = j - 1 and "
2302 "1 <= i and i < n and 2 <= j and j <= n }");
2303 map
= isl_map_power(map
, &exact
);
2307 /* COCOA example 1 */
2308 map
= isl_map_read_from_str(ctx
,
2309 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2310 "1 <= i and i < n and 1 <= j and j < n or "
2311 "i2 = i + 1 and j2 = j - 1 and "
2312 "1 <= i and i < n and 2 <= j and j <= n }");
2313 map
= isl_map_transitive_closure(map
, &exact
);
2315 map2
= isl_map_read_from_str(ctx
,
2316 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2317 "1 <= i and i < n and 1 <= j and j <= n and "
2318 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2319 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
2320 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
2321 assert(isl_map_is_equal(map
, map2
));
2325 map
= isl_map_read_from_str(ctx
,
2326 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
2327 " 0 <= y and y <= n }");
2328 map
= isl_map_transitive_closure(map
, &exact
);
2329 map2
= isl_map_read_from_str(ctx
,
2330 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
2331 " 0 <= y and y <= n }");
2332 assert(isl_map_is_equal(map
, map2
));
2336 /* COCOA example 2 */
2337 map
= isl_map_read_from_str(ctx
,
2338 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
2339 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
2340 "i2 = i + 2 and j2 = j - 2 and "
2341 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
2342 map
= isl_map_transitive_closure(map
, &exact
);
2344 map2
= isl_map_read_from_str(ctx
,
2345 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2346 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
2347 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2348 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
2349 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
2350 assert(isl_map_is_equal(map
, map2
));
2354 /* COCOA Fig.2 left */
2355 map
= isl_map_read_from_str(ctx
,
2356 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
2357 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
2359 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
2360 "j <= 2 i - 3 and j <= n - 2 or "
2361 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2362 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2363 map
= isl_map_transitive_closure(map
, &exact
);
2367 /* COCOA Fig.2 right */
2368 map
= isl_map_read_from_str(ctx
,
2369 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2370 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2372 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2373 "j <= 2 i - 4 and j <= n - 3 or "
2374 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2375 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2376 map
= isl_map_power(map
, &exact
);
2380 /* COCOA Fig.2 right */
2381 map
= isl_map_read_from_str(ctx
,
2382 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2383 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2385 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2386 "j <= 2 i - 4 and j <= n - 3 or "
2387 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2388 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2389 map
= isl_map_transitive_closure(map
, &exact
);
2391 map2
= isl_map_read_from_str(ctx
,
2392 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
2393 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
2394 "j <= n and 3 + i + 2 j <= 3 n and "
2395 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
2396 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
2397 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
2398 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
2399 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
2400 assert(isl_map_is_equal(map
, map2
));
2404 map
= cocoa_fig_1_right_graph(ctx
);
2405 map
= isl_map_transitive_closure(map
, &exact
);
2407 map2
= cocoa_fig_1_right_tc(ctx
);
2408 assert(isl_map_is_equal(map
, map2
));
2412 map
= cocoa_fig_1_right_graph(ctx
);
2413 map
= isl_map_power(map
, &exact
);
2414 map2
= cocoa_fig_1_right_power(ctx
);
2415 equal
= isl_map_is_equal(map
, map2
);
2421 isl_die(ctx
, isl_error_unknown
, "power not exact", return -1);
2423 isl_die(ctx
, isl_error_unknown
, "unexpected power", return -1);
2425 /* COCOA Theorem 1 counter example */
2426 map
= isl_map_read_from_str(ctx
,
2427 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
2428 "i2 = 1 and j2 = j or "
2429 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
2430 map
= isl_map_transitive_closure(map
, &exact
);
2434 map
= isl_map_read_from_str(ctx
,
2435 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
2436 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
2437 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
2438 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
2439 map
= isl_map_transitive_closure(map
, &exact
);
2443 /* Kelly et al 1996, fig 12 */
2444 map
= isl_map_read_from_str(ctx
,
2445 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
2446 "1 <= i,j,j+1 <= n or "
2447 "j = n and j2 = 1 and i2 = i + 1 and "
2448 "1 <= i,i+1 <= n }");
2449 map
= isl_map_transitive_closure(map
, &exact
);
2451 map2
= isl_map_read_from_str(ctx
,
2452 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
2453 "1 <= i <= n and i = i2 or "
2454 "1 <= i < i2 <= n and 1 <= j <= n and "
2456 assert(isl_map_is_equal(map
, map2
));
2460 /* Omega's closure4 */
2461 map
= isl_map_read_from_str(ctx
,
2462 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
2463 "1 <= x,y <= 10 or "
2464 "x2 = x + 1 and y2 = y and "
2465 "1 <= x <= 20 && 5 <= y <= 15 }");
2466 map
= isl_map_transitive_closure(map
, &exact
);
2470 map
= isl_map_read_from_str(ctx
,
2471 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
2472 map
= isl_map_transitive_closure(map
, &exact
);
2474 map2
= isl_map_read_from_str(ctx
,
2475 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
2476 assert(isl_map_is_equal(map
, map2
));
2480 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
2481 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
2482 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
2483 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
2484 map
= isl_map_read_from_str(ctx
, str
);
2485 map
= isl_map_transitive_closure(map
, &exact
);
2487 map2
= isl_map_read_from_str(ctx
, str
);
2488 assert(isl_map_is_equal(map
, map2
));
2492 str
= "{[0] -> [1]; [2] -> [3]}";
2493 map
= isl_map_read_from_str(ctx
, str
);
2494 map
= isl_map_transitive_closure(map
, &exact
);
2496 map2
= isl_map_read_from_str(ctx
, str
);
2497 assert(isl_map_is_equal(map
, map2
));
2501 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
2502 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
2503 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
2504 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2505 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2506 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
2507 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
2508 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
2509 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2510 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2511 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
2512 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
2513 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
2514 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2515 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2516 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
2517 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
2518 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
2519 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2520 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
2521 map
= isl_map_read_from_str(ctx
, str
);
2522 map
= isl_map_transitive_closure(map
, NULL
);
2529 static int test_lex(struct isl_ctx
*ctx
)
2535 dim
= isl_space_set_alloc(ctx
, 0, 0);
2536 map
= isl_map_lex_le(dim
);
2537 empty
= isl_map_is_empty(map
);
2543 isl_die(ctx
, isl_error_unknown
,
2544 "expecting non-empty result", return -1);
2549 /* Inputs for isl_map_lexmin tests.
2550 * "map" is the input and "lexmin" is the expected result.
2555 } lexmin_tests
[] = {
2556 { "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }",
2557 "{ [x] -> [5] : 6 <= x <= 8; "
2558 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }" },
2559 { "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }",
2560 "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }" },
2561 { "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }",
2562 "{ [x] -> [y] : (4y = x and x >= 0) or "
2563 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
2564 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
2565 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }" },
2566 { "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }",
2567 "{ T[a] -> S[b, c] : 2b = a and 2c = a }" },
2568 /* Check that empty pieces are properly combined. */
2569 { "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
2570 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
2571 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }",
2572 "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
2573 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
2575 { "{ [i, k, j] -> [a, b, c, d] : 8*floor((b)/8) = b and k <= 255 and "
2576 "a <= 255 and c <= 255 and d <= 255 - j and "
2577 "255 - j <= 7d <= 7 - i and 240d <= 239 + a and "
2578 "247d <= 247 + k - j and 247d <= 247 + k - b and "
2579 "247d <= 247 + i and 248 - b <= 248d <= c and "
2580 "254d >= i - a + b and 254d >= -a + b and "
2581 "255d >= -i + a - b and 1792d >= -63736 + 257b }",
2583 "[-127762 + i + 502j, -62992 + 248j, 63240 - 248j, 255 - j] : "
2584 "k <= 255 and 7j >= 1778 + i and 246j >= 62738 - k and "
2585 "247j >= 62738 - i and 509j <= 129795 + i and "
2586 "742j >= 188724 - i; "
2587 "[0, k, j] -> [1, 0, 248, 1] : k <= 255 and 248 <= j <= 254, k }" },
2588 { "{ [a] -> [b] : 0 <= b <= 255 and -509 + a <= 512b < a and "
2589 "16*floor((8 + b)/16) <= 7 + b; "
2591 "{ [a] -> [b = 1] : a >= 510 or a <= 0; "
2592 "[a] -> [b = 0] : 0 < a <= 509 }" },
2593 { "{ rat: [i] : 1 <= 2i <= 9 }", "{ rat: [i] : 2i = 1 }" },
2594 { "{ rat: [i] : 1 <= 2i <= 9 or i >= 10 }", "{ rat: [i] : 2i = 1 }" },
2597 static int test_lexmin(struct isl_ctx
*ctx
)
2602 isl_basic_map
*bmap
;
2603 isl_map
*map
, *map2
;
2606 isl_pw_multi_aff
*pma
;
2608 str
= "[p0, p1] -> { [] -> [] : "
2609 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
2610 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
2611 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
2612 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
2613 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
2614 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
2615 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
2616 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
2617 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
2618 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
2619 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
2620 map
= isl_map_read_from_str(ctx
, str
);
2621 map
= isl_map_lexmin(map
);
2624 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
2625 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
2626 set
= isl_set_read_from_str(ctx
, str
);
2627 set
= isl_set_lexmax(set
);
2628 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
2629 set2
= isl_set_read_from_str(ctx
, str
);
2630 set
= isl_set_intersect(set
, set2
);
2631 assert(!isl_set_is_empty(set
));
2634 for (i
= 0; i
< ARRAY_SIZE(lexmin_tests
); ++i
) {
2635 map
= isl_map_read_from_str(ctx
, lexmin_tests
[i
].map
);
2636 map
= isl_map_lexmin(map
);
2637 map2
= isl_map_read_from_str(ctx
, lexmin_tests
[i
].lexmin
);
2638 equal
= isl_map_is_equal(map
, map2
);
2645 isl_die(ctx
, isl_error_unknown
,
2646 "unexpected result", return -1);
2649 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2650 " 8i' <= i and 8i' >= -7 + i }";
2651 bmap
= isl_basic_map_read_from_str(ctx
, str
);
2652 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
2653 map2
= isl_map_from_pw_multi_aff(pma
);
2654 map
= isl_map_from_basic_map(bmap
);
2655 assert(isl_map_is_equal(map
, map2
));
2659 str
= "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2660 " 8i' <= i and 8i' >= -7 + i }";
2661 set
= isl_set_read_from_str(ctx
, str
);
2662 pma
= isl_set_lexmin_pw_multi_aff(isl_set_copy(set
));
2663 set2
= isl_set_from_pw_multi_aff(pma
);
2664 equal
= isl_set_is_equal(set
, set2
);
2670 isl_die(ctx
, isl_error_unknown
,
2671 "unexpected difference between set and "
2672 "piecewise affine expression", return -1);
2677 /* A specialized isl_set_min_val test case that would return the wrong result
2678 * in earlier versions of isl.
2679 * The explicit call to isl_basic_set_union prevents the second basic set
2680 * from being determined to be empty prior to the call to isl_set_min_val,
2681 * at least at the point where this test case was introduced.
2683 static int test_min_special(isl_ctx
*ctx
)
2686 isl_basic_set
*bset1
, *bset2
;
2692 str
= "{ [a, b] : a >= 2 and b >= 0 and 14 - a <= b <= 9 }";
2693 bset1
= isl_basic_set_read_from_str(ctx
, str
);
2694 str
= "{ [a, b] : 1 <= a, b and a + b <= 1 }";
2695 bset2
= isl_basic_set_read_from_str(ctx
, str
);
2696 set
= isl_basic_set_union(bset1
, bset2
);
2697 obj
= isl_aff_read_from_str(ctx
, "{ [a, b] -> [a] }");
2699 res
= isl_set_min_val(set
, obj
);
2700 ok
= isl_val_cmp_si(res
, 5) == 0;
2709 isl_die(ctx
, isl_error_unknown
, "unexpected minimum",
2715 /* A specialized isl_set_min_val test case that would return an error
2716 * in earlier versions of isl.
2718 static int test_min_special2(isl_ctx
*ctx
)
2721 isl_basic_set
*bset
;
2725 str
= "{ [i, j, k] : 2j = i and 2k = i + 1 and i >= 2 }";
2726 bset
= isl_basic_set_read_from_str(ctx
, str
);
2728 obj
= isl_aff_read_from_str(ctx
, "{ [i, j, k] -> [i] }");
2730 res
= isl_basic_set_max_val(bset
, obj
);
2732 isl_basic_set_free(bset
);
2745 __isl_give isl_val
*(*fn
)(__isl_keep isl_set
*set
,
2746 __isl_keep isl_aff
*obj
);
2749 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_min_val
, "-1" },
2750 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_max_val
, "1" },
2751 { "{ [a, b] : 0 <= a, b <= 100 and b mod 2 = 0}",
2752 "{ [a, b] -> [floor((b - 2*floor((-a)/4))/5)] }",
2753 &isl_set_max_val
, "30" },
2757 /* Perform basic isl_set_min_val and isl_set_max_val tests.
2758 * In particular, check the results on non-convex inputs.
2760 static int test_min(struct isl_ctx
*ctx
)
2768 for (i
= 0; i
< ARRAY_SIZE(opt_tests
); ++i
) {
2769 set
= isl_set_read_from_str(ctx
, opt_tests
[i
].set
);
2770 obj
= isl_aff_read_from_str(ctx
, opt_tests
[i
].obj
);
2771 res
= isl_val_read_from_str(ctx
, opt_tests
[i
].res
);
2772 val
= opt_tests
[i
].fn(set
, obj
);
2773 ok
= isl_val_eq(res
, val
);
2782 isl_die(ctx
, isl_error_unknown
,
2783 "unexpected optimum", return -1);
2786 if (test_min_special(ctx
) < 0)
2788 if (test_min_special2(ctx
) < 0)
2799 static isl_stat
collect_must_may(__isl_take isl_map
*dep
, int must
,
2800 void *dep_user
, void *user
)
2802 struct must_may
*mm
= (struct must_may
*)user
;
2805 mm
->must
= isl_map_union(mm
->must
, dep
);
2807 mm
->may
= isl_map_union(mm
->may
, dep
);
2812 static int common_space(void *first
, void *second
)
2814 int depth
= *(int *)first
;
2818 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
2826 map2
= isl_map_read_from_str(map
->ctx
, str
);
2827 equal
= isl_map_is_equal(map
, map2
);
2833 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
2837 equal
= map_is_equal(map
, str
);
2841 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
2842 "result not as expected", return -1);
2846 static int test_dep(struct isl_ctx
*ctx
)
2851 isl_access_info
*ai
;
2858 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2859 map
= isl_map_read_from_str(ctx
, str
);
2860 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2862 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2863 map
= isl_map_read_from_str(ctx
, str
);
2864 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2866 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2867 map
= isl_map_read_from_str(ctx
, str
);
2868 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2870 flow
= isl_access_info_compute_flow(ai
);
2871 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2872 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2873 mm
.may
= isl_map_empty(dim
);
2875 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2877 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
2878 " [1,10,0] -> [2,5,0] }";
2879 assert(map_is_equal(mm
.must
, str
));
2880 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2881 assert(map_is_equal(mm
.may
, str
));
2883 isl_map_free(mm
.must
);
2884 isl_map_free(mm
.may
);
2885 isl_flow_free(flow
);
2888 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2889 map
= isl_map_read_from_str(ctx
, str
);
2890 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2892 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2893 map
= isl_map_read_from_str(ctx
, str
);
2894 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2896 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2897 map
= isl_map_read_from_str(ctx
, str
);
2898 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2900 flow
= isl_access_info_compute_flow(ai
);
2901 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2902 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2903 mm
.may
= isl_map_empty(dim
);
2905 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2907 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
2908 assert(map_is_equal(mm
.must
, str
));
2909 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2910 assert(map_is_equal(mm
.may
, str
));
2912 isl_map_free(mm
.must
);
2913 isl_map_free(mm
.may
);
2914 isl_flow_free(flow
);
2917 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2918 map
= isl_map_read_from_str(ctx
, str
);
2919 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2921 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2922 map
= isl_map_read_from_str(ctx
, str
);
2923 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2925 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2926 map
= isl_map_read_from_str(ctx
, str
);
2927 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2929 flow
= isl_access_info_compute_flow(ai
);
2930 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2931 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2932 mm
.may
= isl_map_empty(dim
);
2934 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2936 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2937 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2938 assert(map_is_equal(mm
.may
, str
));
2939 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2940 assert(map_is_equal(mm
.must
, str
));
2942 isl_map_free(mm
.must
);
2943 isl_map_free(mm
.may
);
2944 isl_flow_free(flow
);
2947 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2948 map
= isl_map_read_from_str(ctx
, str
);
2949 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2951 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2952 map
= isl_map_read_from_str(ctx
, str
);
2953 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2955 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2956 map
= isl_map_read_from_str(ctx
, str
);
2957 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2959 flow
= isl_access_info_compute_flow(ai
);
2960 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2961 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2962 mm
.may
= isl_map_empty(dim
);
2964 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2966 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2967 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2968 assert(map_is_equal(mm
.may
, str
));
2969 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2970 assert(map_is_equal(mm
.must
, str
));
2972 isl_map_free(mm
.must
);
2973 isl_map_free(mm
.may
);
2974 isl_flow_free(flow
);
2977 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2978 map
= isl_map_read_from_str(ctx
, str
);
2979 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2981 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2982 map
= isl_map_read_from_str(ctx
, str
);
2983 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2985 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2986 map
= isl_map_read_from_str(ctx
, str
);
2987 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2989 flow
= isl_access_info_compute_flow(ai
);
2990 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2991 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2992 mm
.may
= isl_map_empty(dim
);
2994 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2996 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2997 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2998 assert(map_is_equal(mm
.may
, str
));
2999 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
3000 assert(map_is_equal(mm
.must
, str
));
3002 isl_map_free(mm
.must
);
3003 isl_map_free(mm
.may
);
3004 isl_flow_free(flow
);
3009 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
3010 map
= isl_map_read_from_str(ctx
, str
);
3011 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
3013 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
3014 map
= isl_map_read_from_str(ctx
, str
);
3015 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
3017 flow
= isl_access_info_compute_flow(ai
);
3018 dim
= isl_space_alloc(ctx
, 0, 5, 5);
3019 mm
.must
= isl_map_empty(isl_space_copy(dim
));
3020 mm
.may
= isl_map_empty(dim
);
3022 isl_flow_foreach(flow
, collect_must_may
, &mm
);
3024 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
3025 assert(map_is_equal(mm
.must
, str
));
3026 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
3027 assert(map_is_equal(mm
.may
, str
));
3029 isl_map_free(mm
.must
);
3030 isl_map_free(mm
.may
);
3031 isl_flow_free(flow
);
3036 /* Check that the dependence analysis proceeds without errors.
3037 * Earlier versions of isl would break down during the analysis
3038 * due to the use of the wrong spaces.
3040 static int test_flow(isl_ctx
*ctx
)
3043 isl_union_map
*access
, *schedule
;
3044 isl_union_map
*must_dep
, *may_dep
;
3047 str
= "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
3048 access
= isl_union_map_read_from_str(ctx
, str
);
3049 str
= "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
3050 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
3051 "S2[] -> [1,0,0,0]; "
3052 "S3[] -> [-1,0,0,0] }";
3053 schedule
= isl_union_map_read_from_str(ctx
, str
);
3054 r
= isl_union_map_compute_flow(access
, isl_union_map_copy(access
),
3055 isl_union_map_copy(access
), schedule
,
3056 &must_dep
, &may_dep
, NULL
, NULL
);
3057 isl_union_map_free(may_dep
);
3058 isl_union_map_free(must_dep
);
3067 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
3068 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
3069 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
3070 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
3071 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
3072 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
3073 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
3074 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
3075 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
3078 int test_sv(isl_ctx
*ctx
)
3080 isl_union_map
*umap
;
3084 for (i
= 0; i
< ARRAY_SIZE(sv_tests
); ++i
) {
3085 umap
= isl_union_map_read_from_str(ctx
, sv_tests
[i
].map
);
3086 sv
= isl_union_map_is_single_valued(umap
);
3087 isl_union_map_free(umap
);
3090 if (sv_tests
[i
].sv
&& !sv
)
3091 isl_die(ctx
, isl_error_internal
,
3092 "map not detected as single valued", return -1);
3093 if (!sv_tests
[i
].sv
&& sv
)
3094 isl_die(ctx
, isl_error_internal
,
3095 "map detected as single valued", return -1);
3104 } bijective_tests
[] = {
3105 { "[N,M]->{[i,j] -> [i]}", 0 },
3106 { "[N,M]->{[i,j] -> [i] : j=i}", 1 },
3107 { "[N,M]->{[i,j] -> [i] : j=0}", 1 },
3108 { "[N,M]->{[i,j] -> [i] : j=N}", 1 },
3109 { "[N,M]->{[i,j] -> [j,i]}", 1 },
3110 { "[N,M]->{[i,j] -> [i+j]}", 0 },
3111 { "[N,M]->{[i,j] -> []}", 0 },
3112 { "[N,M]->{[i,j] -> [i,j,N]}", 1 },
3113 { "[N,M]->{[i,j] -> [2i]}", 0 },
3114 { "[N,M]->{[i,j] -> [i,i]}", 0 },
3115 { "[N,M]->{[i,j] -> [2i,i]}", 0 },
3116 { "[N,M]->{[i,j] -> [2i,j]}", 1 },
3117 { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 },
3120 static int test_bijective(struct isl_ctx
*ctx
)
3126 for (i
= 0; i
< ARRAY_SIZE(bijective_tests
); ++i
) {
3127 map
= isl_map_read_from_str(ctx
, bijective_tests
[i
].str
);
3128 bijective
= isl_map_is_bijective(map
);
3132 if (bijective_tests
[i
].bijective
&& !bijective
)
3133 isl_die(ctx
, isl_error_internal
,
3134 "map not detected as bijective", return -1);
3135 if (!bijective_tests
[i
].bijective
&& bijective
)
3136 isl_die(ctx
, isl_error_internal
,
3137 "map detected as bijective", return -1);
3143 /* Inputs for isl_pw_qpolynomial_gist tests.
3144 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
3150 } pwqp_gist_tests
[] = {
3151 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
3152 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
3153 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
3154 "{ [i] -> -1/2 + 1/2 * i }" },
3155 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
3158 static int test_pwqp(struct isl_ctx
*ctx
)
3163 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
3166 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
3167 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3169 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
3172 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
3173 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3175 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
3177 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
3179 isl_pw_qpolynomial_free(pwqp1
);
3181 for (i
= 0; i
< ARRAY_SIZE(pwqp_gist_tests
); ++i
) {
3182 str
= pwqp_gist_tests
[i
].pwqp
;
3183 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3184 str
= pwqp_gist_tests
[i
].set
;
3185 set
= isl_set_read_from_str(ctx
, str
);
3186 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
3187 str
= pwqp_gist_tests
[i
].gist
;
3188 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3189 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
3190 equal
= isl_pw_qpolynomial_is_zero(pwqp1
);
3191 isl_pw_qpolynomial_free(pwqp1
);
3196 isl_die(ctx
, isl_error_unknown
,
3197 "unexpected result", return -1);
3200 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
3201 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3202 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
3203 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3205 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
3207 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
3209 isl_pw_qpolynomial_free(pwqp1
);
3211 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
3212 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3213 str
= "{ [x] -> x }";
3214 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3216 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
3218 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
3220 isl_pw_qpolynomial_free(pwqp1
);
3222 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
3223 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3224 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3225 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
3226 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
3227 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
3228 isl_pw_qpolynomial_free(pwqp1
);
3230 str
= "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
3231 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3232 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
3233 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3234 set
= isl_set_read_from_str(ctx
, "{ [a,b,a] }");
3235 pwqp1
= isl_pw_qpolynomial_intersect_domain(pwqp1
, set
);
3236 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
3237 isl_pw_qpolynomial_free(pwqp1
);
3238 isl_pw_qpolynomial_free(pwqp2
);
3242 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3244 str
= "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
3245 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3246 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
3247 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3248 pwqp1
= isl_pw_qpolynomial_fix_val(pwqp1
, isl_dim_set
, 1,
3250 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
3251 isl_pw_qpolynomial_free(pwqp1
);
3252 isl_pw_qpolynomial_free(pwqp2
);
3256 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3261 static int test_split_periods(isl_ctx
*ctx
)
3264 isl_pw_qpolynomial
*pwqp
;
3266 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
3267 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
3268 "U >= 0; [U,V] -> U^2 : U >= 100 }";
3269 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3271 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
3273 isl_pw_qpolynomial_free(pwqp
);
3281 static int test_union(isl_ctx
*ctx
)
3284 isl_union_set
*uset1
, *uset2
;
3285 isl_union_map
*umap1
, *umap2
;
3288 str
= "{ [i] : 0 <= i <= 1 }";
3289 uset1
= isl_union_set_read_from_str(ctx
, str
);
3290 str
= "{ [1] -> [0] }";
3291 umap1
= isl_union_map_read_from_str(ctx
, str
);
3293 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
3294 equal
= isl_union_map_is_equal(umap1
, umap2
);
3296 isl_union_map_free(umap1
);
3297 isl_union_map_free(umap2
);
3302 isl_die(ctx
, isl_error_unknown
, "union maps not equal",
3305 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
3306 umap1
= isl_union_map_read_from_str(ctx
, str
);
3307 str
= "{ A[i]; B[i] }";
3308 uset1
= isl_union_set_read_from_str(ctx
, str
);
3310 uset2
= isl_union_map_domain(umap1
);
3312 equal
= isl_union_set_is_equal(uset1
, uset2
);
3314 isl_union_set_free(uset1
);
3315 isl_union_set_free(uset2
);
3320 isl_die(ctx
, isl_error_unknown
, "union sets not equal",
3326 /* Check that computing a bound of a non-zero polynomial over an unbounded
3327 * domain does not produce a rational value.
3328 * In particular, check that the upper bound is infinity.
3330 static int test_bound_unbounded_domain(isl_ctx
*ctx
)
3333 isl_pw_qpolynomial
*pwqp
;
3334 isl_pw_qpolynomial_fold
*pwf
, *pwf2
;
3337 str
= "{ [m,n] -> -m * n }";
3338 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3339 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3341 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3342 pwf2
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3343 equal
= isl_pw_qpolynomial_fold_plain_is_equal(pwf
, pwf2
);
3344 isl_pw_qpolynomial_fold_free(pwf
);
3345 isl_pw_qpolynomial_fold_free(pwf2
);
3350 isl_die(ctx
, isl_error_unknown
,
3351 "expecting infinite polynomial bound", return -1);
3356 static int test_bound(isl_ctx
*ctx
)
3360 isl_pw_qpolynomial
*pwqp
;
3361 isl_pw_qpolynomial_fold
*pwf
;
3363 if (test_bound_unbounded_domain(ctx
) < 0)
3366 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
3367 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3368 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3369 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
3370 isl_pw_qpolynomial_fold_free(pwf
);
3372 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
3375 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
3376 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3377 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3378 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
3379 isl_pw_qpolynomial_fold_free(pwf
);
3381 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
3387 static int test_lift(isl_ctx
*ctx
)
3390 isl_basic_map
*bmap
;
3391 isl_basic_set
*bset
;
3393 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
3394 bset
= isl_basic_set_read_from_str(ctx
, str
);
3395 bset
= isl_basic_set_lift(bset
);
3396 bmap
= isl_basic_map_from_range(bset
);
3397 bset
= isl_basic_map_domain(bmap
);
3398 isl_basic_set_free(bset
);
3407 } subset_tests
[] = {
3409 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
3410 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
3411 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
3413 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
3414 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
3415 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
3416 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
3417 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
3418 "256e0 <= 255i and 256e0 >= -255 + 255i and "
3419 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
3420 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
3421 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
3422 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
3423 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
3424 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
3425 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
3426 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
3427 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
3428 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
3429 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
3430 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
3431 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
3432 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
3433 "4e0 <= -57 + i0 + i1)) or "
3434 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
3435 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
3436 "4e0 >= -61 + i0 + i1)) or "
3437 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
3438 { "[a, b] -> { : a = 0 and b = -1 }", "[b, a] -> { : b >= -10 }", 1 },
3441 static int test_subset(isl_ctx
*ctx
)
3444 isl_set
*set1
, *set2
;
3447 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
3448 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
3449 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
3450 subset
= isl_set_is_subset(set1
, set2
);
3455 if (subset
!= subset_tests
[i
].subset
)
3456 isl_die(ctx
, isl_error_unknown
,
3457 "incorrect subset result", return -1);
3464 const char *minuend
;
3465 const char *subtrahend
;
3466 const char *difference
;
3467 } subtract_domain_tests
[] = {
3468 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
3469 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
3470 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
3473 static int test_subtract(isl_ctx
*ctx
)
3476 isl_union_map
*umap1
, *umap2
;
3477 isl_union_pw_multi_aff
*upma1
, *upma2
;
3478 isl_union_set
*uset
;
3481 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3482 umap1
= isl_union_map_read_from_str(ctx
,
3483 subtract_domain_tests
[i
].minuend
);
3484 uset
= isl_union_set_read_from_str(ctx
,
3485 subtract_domain_tests
[i
].subtrahend
);
3486 umap2
= isl_union_map_read_from_str(ctx
,
3487 subtract_domain_tests
[i
].difference
);
3488 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
3489 equal
= isl_union_map_is_equal(umap1
, umap2
);
3490 isl_union_map_free(umap1
);
3491 isl_union_map_free(umap2
);
3495 isl_die(ctx
, isl_error_unknown
,
3496 "incorrect subtract domain result", return -1);
3499 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3500 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
3501 subtract_domain_tests
[i
].minuend
);
3502 uset
= isl_union_set_read_from_str(ctx
,
3503 subtract_domain_tests
[i
].subtrahend
);
3504 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
3505 subtract_domain_tests
[i
].difference
);
3506 upma1
= isl_union_pw_multi_aff_subtract_domain(upma1
, uset
);
3507 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
3508 isl_union_pw_multi_aff_free(upma1
);
3509 isl_union_pw_multi_aff_free(upma2
);
3513 isl_die(ctx
, isl_error_unknown
,
3514 "incorrect subtract domain result", return -1);
3520 /* Check that intersecting the empty basic set with another basic set
3521 * does not increase the number of constraints. In particular,
3522 * the empty basic set should maintain its canonical representation.
3524 static int test_intersect(isl_ctx
*ctx
)
3527 isl_basic_set
*bset1
, *bset2
;
3529 bset1
= isl_basic_set_read_from_str(ctx
, "{ [a,b,c] : 1 = 0 }");
3530 bset2
= isl_basic_set_read_from_str(ctx
, "{ [1,2,3] }");
3531 n1
= isl_basic_set_n_constraint(bset1
);
3532 bset1
= isl_basic_set_intersect(bset1
, bset2
);
3533 n2
= isl_basic_set_n_constraint(bset1
);
3534 isl_basic_set_free(bset1
);
3538 isl_die(ctx
, isl_error_unknown
,
3539 "number of constraints of empty set changed",
3545 int test_factorize(isl_ctx
*ctx
)
3548 isl_basic_set
*bset
;
3551 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
3552 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
3553 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
3554 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
3555 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
3556 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
3557 "3i5 >= -2i0 - i2 + 3i4 }";
3558 bset
= isl_basic_set_read_from_str(ctx
, str
);
3559 f
= isl_basic_set_factorizer(bset
);
3560 isl_basic_set_free(bset
);
3561 isl_factorizer_free(f
);
3563 isl_die(ctx
, isl_error_unknown
,
3564 "failed to construct factorizer", return -1);
3566 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
3567 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
3568 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
3569 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
3570 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
3571 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
3572 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
3573 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
3574 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
3575 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
3576 bset
= isl_basic_set_read_from_str(ctx
, str
);
3577 f
= isl_basic_set_factorizer(bset
);
3578 isl_basic_set_free(bset
);
3579 isl_factorizer_free(f
);
3581 isl_die(ctx
, isl_error_unknown
,
3582 "failed to construct factorizer", return -1);
3587 static isl_stat
check_injective(__isl_take isl_map
*map
, void *user
)
3589 int *injective
= user
;
3591 *injective
= isl_map_is_injective(map
);
3594 if (*injective
< 0 || !*injective
)
3595 return isl_stat_error
;
3600 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
3601 const char *r
, const char *s
, int tilable
, int parallel
)
3605 isl_union_map
*W
, *R
, *S
;
3606 isl_union_map
*empty
;
3607 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
3608 isl_union_map
*validity
, *proximity
, *coincidence
;
3609 isl_union_map
*schedule
;
3610 isl_union_map
*test
;
3611 isl_union_set
*delta
;
3612 isl_union_set
*domain
;
3616 isl_schedule_constraints
*sc
;
3617 isl_schedule
*sched
;
3618 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
3620 D
= isl_union_set_read_from_str(ctx
, d
);
3621 W
= isl_union_map_read_from_str(ctx
, w
);
3622 R
= isl_union_map_read_from_str(ctx
, r
);
3623 S
= isl_union_map_read_from_str(ctx
, s
);
3625 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
3626 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
3628 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
3629 isl_union_map_compute_flow(isl_union_map_copy(R
),
3630 isl_union_map_copy(W
), empty
,
3631 isl_union_map_copy(S
),
3632 &dep_raw
, NULL
, NULL
, NULL
);
3633 isl_union_map_compute_flow(isl_union_map_copy(W
),
3634 isl_union_map_copy(W
),
3635 isl_union_map_copy(R
),
3636 isl_union_map_copy(S
),
3637 &dep_waw
, &dep_war
, NULL
, NULL
);
3639 dep
= isl_union_map_union(dep_waw
, dep_war
);
3640 dep
= isl_union_map_union(dep
, dep_raw
);
3641 validity
= isl_union_map_copy(dep
);
3642 coincidence
= isl_union_map_copy(dep
);
3643 proximity
= isl_union_map_copy(dep
);
3645 sc
= isl_schedule_constraints_on_domain(isl_union_set_copy(D
));
3646 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3647 sc
= isl_schedule_constraints_set_coincidence(sc
, coincidence
);
3648 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3649 sched
= isl_schedule_constraints_compute_schedule(sc
);
3650 schedule
= isl_schedule_get_map(sched
);
3651 isl_schedule_free(sched
);
3652 isl_union_map_free(W
);
3653 isl_union_map_free(R
);
3654 isl_union_map_free(S
);
3657 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
3659 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
3660 is_complete
= isl_union_set_is_subset(D
, domain
);
3661 isl_union_set_free(D
);
3662 isl_union_set_free(domain
);
3664 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
3665 test
= isl_union_map_apply_range(test
, dep
);
3666 test
= isl_union_map_apply_range(test
, schedule
);
3668 delta
= isl_union_map_deltas(test
);
3669 if (isl_union_set_n_set(delta
) == 0) {
3673 isl_union_set_free(delta
);
3675 delta_set
= isl_set_from_union_set(delta
);
3677 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3678 for (i
= 0; i
< tilable
; ++i
)
3679 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
3680 is_tilable
= isl_set_is_subset(delta_set
, slice
);
3681 isl_set_free(slice
);
3683 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3684 for (i
= 0; i
< parallel
; ++i
)
3685 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
3686 is_parallel
= isl_set_is_subset(delta_set
, slice
);
3687 isl_set_free(slice
);
3689 origin
= isl_set_universe(isl_set_get_space(delta_set
));
3690 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
3691 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
3693 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
3694 delta_set
= isl_set_lexmin(delta_set
);
3696 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
3698 isl_set_free(origin
);
3699 isl_set_free(delta_set
);
3702 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
3703 is_injection
< 0 || is_complete
< 0)
3706 isl_die(ctx
, isl_error_unknown
,
3707 "generated schedule incomplete", return -1);
3709 isl_die(ctx
, isl_error_unknown
,
3710 "generated schedule not injective on each statement",
3713 isl_die(ctx
, isl_error_unknown
,
3714 "negative dependences in generated schedule",
3717 isl_die(ctx
, isl_error_unknown
,
3718 "generated schedule not as tilable as expected",
3721 isl_die(ctx
, isl_error_unknown
,
3722 "generated schedule not as parallel as expected",
3728 /* Compute a schedule for the given instance set, validity constraints,
3729 * proximity constraints and context and return a corresponding union map
3732 static __isl_give isl_union_map
*compute_schedule_with_context(isl_ctx
*ctx
,
3733 const char *domain
, const char *validity
, const char *proximity
,
3734 const char *context
)
3739 isl_union_map
*prox
;
3740 isl_schedule_constraints
*sc
;
3741 isl_schedule
*schedule
;
3742 isl_union_map
*sched
;
3744 con
= isl_set_read_from_str(ctx
, context
);
3745 dom
= isl_union_set_read_from_str(ctx
, domain
);
3746 dep
= isl_union_map_read_from_str(ctx
, validity
);
3747 prox
= isl_union_map_read_from_str(ctx
, proximity
);
3748 sc
= isl_schedule_constraints_on_domain(dom
);
3749 sc
= isl_schedule_constraints_set_context(sc
, con
);
3750 sc
= isl_schedule_constraints_set_validity(sc
, dep
);
3751 sc
= isl_schedule_constraints_set_proximity(sc
, prox
);
3752 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3753 sched
= isl_schedule_get_map(schedule
);
3754 isl_schedule_free(schedule
);
3759 /* Compute a schedule for the given instance set, validity constraints and
3760 * proximity constraints and return a corresponding union map representation.
3762 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
3763 const char *domain
, const char *validity
, const char *proximity
)
3765 return compute_schedule_with_context(ctx
, domain
, validity
, proximity
,
3769 /* Check that a schedule can be constructed on the given domain
3770 * with the given validity and proximity constraints.
3772 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
3773 const char *validity
, const char *proximity
)
3775 isl_union_map
*sched
;
3777 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
3781 isl_union_map_free(sched
);
3785 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
3786 const char *validity
, const char *proximity
, const char *expected_sched
)
3788 isl_union_map
*sched1
, *sched2
;
3791 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
3792 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
3794 equal
= isl_union_map_is_equal(sched1
, sched2
);
3795 isl_union_map_free(sched1
);
3796 isl_union_map_free(sched2
);
3801 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
3807 /* Check that the schedule map is properly padded, i.e., that the range
3808 * lives in a single space.
3810 static int test_padded_schedule(isl_ctx
*ctx
)
3814 isl_union_map
*validity
, *proximity
;
3815 isl_schedule_constraints
*sc
;
3816 isl_schedule
*sched
;
3817 isl_union_map
*umap
;
3818 isl_union_set
*range
;
3821 str
= "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
3822 D
= isl_union_set_read_from_str(ctx
, str
);
3823 validity
= isl_union_map_empty(isl_union_set_get_space(D
));
3824 proximity
= isl_union_map_copy(validity
);
3825 sc
= isl_schedule_constraints_on_domain(D
);
3826 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3827 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3828 sched
= isl_schedule_constraints_compute_schedule(sc
);
3829 umap
= isl_schedule_get_map(sched
);
3830 isl_schedule_free(sched
);
3831 range
= isl_union_map_range(umap
);
3832 set
= isl_set_from_union_set(range
);
3841 /* Check that conditional validity constraints are also taken into
3842 * account across bands.
3843 * In particular, try to make sure that live ranges D[1,0]->C[2,1] and
3844 * D[2,0]->C[3,0] are not local in the outer band of the generated schedule
3845 * and then check that the adjacent order constraint C[2,1]->D[2,0]
3846 * is enforced by the rest of the schedule.
3848 static int test_special_conditional_schedule_constraints(isl_ctx
*ctx
)
3851 isl_union_set
*domain
;
3852 isl_union_map
*validity
, *proximity
, *condition
;
3853 isl_union_map
*sink
, *source
, *dep
;
3854 isl_schedule_constraints
*sc
;
3855 isl_schedule
*schedule
;
3856 isl_union_access_info
*access
;
3857 isl_union_flow
*flow
;
3860 str
= "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3861 "A[k] : k >= 1 and k <= -1 + n; "
3862 "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3863 "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }";
3864 domain
= isl_union_set_read_from_str(ctx
, str
);
3865 sc
= isl_schedule_constraints_on_domain(domain
);
3866 str
= "[n] -> { D[k, i] -> C[1 + k, k - i] : "
3867 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3868 "D[k, i] -> C[1 + k, i] : "
3869 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3870 "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; "
3871 "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }";
3872 validity
= isl_union_map_read_from_str(ctx
, str
);
3873 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3874 str
= "[n] -> { C[k, i] -> D[k, i] : "
3875 "0 <= i <= -1 + k and k <= -1 + n }";
3876 proximity
= isl_union_map_read_from_str(ctx
, str
);
3877 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3878 str
= "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : "
3879 "i <= -1 + k and i >= 1 and k <= -2 + n; "
3880 "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : "
3881 "k <= -1 + n and i >= 0 and i <= -2 + k }";
3882 condition
= isl_union_map_read_from_str(ctx
, str
);
3883 str
= "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : "
3884 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3885 "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : "
3886 "i >= 0 and i <= -1 + k and k <= -1 + n and "
3887 "k' <= -1 + n and k' >= k - i and k' >= 1 + k; "
3888 "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : "
3889 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3890 "[B[k, i] -> c[]] -> [A[k'] -> d[]] : "
3891 "k <= -1 + n and i >= 0 and i <= -1 + k and "
3892 "k' >= 1 and k' <= -1 + n and k' >= 1 + k }";
3893 validity
= isl_union_map_read_from_str(ctx
, str
);
3894 sc
= isl_schedule_constraints_set_conditional_validity(sc
, condition
,
3896 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3897 str
= "{ D[2,0] -> [] }";
3898 sink
= isl_union_map_read_from_str(ctx
, str
);
3899 access
= isl_union_access_info_from_sink(sink
);
3900 str
= "{ C[2,1] -> [] }";
3901 source
= isl_union_map_read_from_str(ctx
, str
);
3902 access
= isl_union_access_info_set_must_source(access
, source
);
3903 access
= isl_union_access_info_set_schedule(access
, schedule
);
3904 flow
= isl_union_access_info_compute_flow(access
);
3905 dep
= isl_union_flow_get_must_dependence(flow
);
3906 isl_union_flow_free(flow
);
3907 empty
= isl_union_map_is_empty(dep
);
3908 isl_union_map_free(dep
);
3913 isl_die(ctx
, isl_error_unknown
,
3914 "conditional validity not respected", return -1);
3919 /* Check that the test for violated conditional validity constraints
3920 * is not confused by domain compression.
3921 * In particular, earlier versions of isl would apply
3922 * a schedule on the compressed domains to the original domains,
3923 * resulting in a failure to detect that the default schedule
3924 * violates the conditional validity constraints.
3926 static int test_special_conditional_schedule_constraints_2(isl_ctx
*ctx
)
3930 isl_union_set
*domain
;
3931 isl_union_map
*validity
, *condition
;
3932 isl_schedule_constraints
*sc
;
3933 isl_schedule
*schedule
;
3934 isl_union_map
*umap
;
3937 str
= "{ A[0, i] : 0 <= i <= 10; B[1, i] : 0 <= i <= 10 }";
3938 domain
= isl_union_set_read_from_str(ctx
, str
);
3939 sc
= isl_schedule_constraints_on_domain(domain
);
3940 str
= "{ B[1, i] -> A[0, i + 1] }";
3941 condition
= isl_union_map_read_from_str(ctx
, str
);
3942 str
= "{ A[0, i] -> B[1, i - 1] }";
3943 validity
= isl_union_map_read_from_str(ctx
, str
);
3944 sc
= isl_schedule_constraints_set_conditional_validity(sc
, condition
,
3945 isl_union_map_copy(validity
));
3946 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3947 umap
= isl_schedule_get_map(schedule
);
3948 isl_schedule_free(schedule
);
3949 validity
= isl_union_map_apply_domain(validity
,
3950 isl_union_map_copy(umap
));
3951 validity
= isl_union_map_apply_range(validity
, umap
);
3952 map
= isl_map_from_union_map(validity
);
3953 ge
= isl_map_lex_ge(isl_space_domain(isl_map_get_space(map
)));
3954 map
= isl_map_intersect(map
, ge
);
3955 empty
= isl_map_is_empty(map
);
3961 isl_die(ctx
, isl_error_unknown
,
3962 "conditional validity constraints not satisfied",
3968 /* Input for testing of schedule construction based on
3969 * conditional constraints.
3971 * domain is the iteration domain
3972 * flow are the flow dependences, which determine the validity and
3973 * proximity constraints
3974 * condition are the conditions on the conditional validity constraints
3975 * conditional_validity are the conditional validity constraints
3976 * outer_band_n is the expected number of members in the outer band
3981 const char *condition
;
3982 const char *conditional_validity
;
3984 } live_range_tests
[] = {
3985 /* Contrived example that illustrates that we need to keep
3986 * track of tagged condition dependences and
3987 * tagged conditional validity dependences
3988 * in isl_sched_edge separately.
3989 * In particular, the conditional validity constraints on A
3990 * cannot be satisfied,
3991 * but they can be ignored because there are no corresponding
3992 * condition constraints. However, we do have an additional
3993 * conditional validity constraint that maps to the same
3994 * dependence relation
3995 * as the condition constraint on B. If we did not make a distinction
3996 * between tagged condition and tagged conditional validity
3997 * dependences, then we
3998 * could end up treating this shared dependence as an condition
3999 * constraint on A, forcing a localization of the conditions,
4000 * which is impossible.
4002 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
4003 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
4004 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
4005 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
4006 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
4007 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
4010 /* TACO 2013 Fig. 7 */
4011 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
4012 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
4013 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
4014 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
4015 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
4016 "0 <= i < n and 0 <= j < n - 1 }",
4017 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
4018 "0 <= i < n and 0 <= j < j' < n;"
4019 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
4020 "0 <= i < i' < n and 0 <= j,j' < n;"
4021 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
4022 "0 <= i,j,j' < n and j < j' }",
4025 /* TACO 2013 Fig. 7, without tags */
4026 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
4027 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
4028 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
4029 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
4030 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
4031 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
4032 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
4033 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
4036 /* TACO 2013 Fig. 12 */
4037 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
4038 "S3[i,3] : 0 <= i <= 1 }",
4039 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
4040 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
4041 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
4042 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
4043 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
4044 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
4045 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
4046 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
4047 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
4048 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
4049 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
4054 /* Test schedule construction based on conditional constraints.
4055 * In particular, check the number of members in the outer band node
4056 * as an indication of whether tiling is possible or not.
4058 static int test_conditional_schedule_constraints(isl_ctx
*ctx
)
4061 isl_union_set
*domain
;
4062 isl_union_map
*condition
;
4063 isl_union_map
*flow
;
4064 isl_union_map
*validity
;
4065 isl_schedule_constraints
*sc
;
4066 isl_schedule
*schedule
;
4067 isl_schedule_node
*node
;
4070 if (test_special_conditional_schedule_constraints(ctx
) < 0)
4072 if (test_special_conditional_schedule_constraints_2(ctx
) < 0)
4075 for (i
= 0; i
< ARRAY_SIZE(live_range_tests
); ++i
) {
4076 domain
= isl_union_set_read_from_str(ctx
,
4077 live_range_tests
[i
].domain
);
4078 flow
= isl_union_map_read_from_str(ctx
,
4079 live_range_tests
[i
].flow
);
4080 condition
= isl_union_map_read_from_str(ctx
,
4081 live_range_tests
[i
].condition
);
4082 validity
= isl_union_map_read_from_str(ctx
,
4083 live_range_tests
[i
].conditional_validity
);
4084 sc
= isl_schedule_constraints_on_domain(domain
);
4085 sc
= isl_schedule_constraints_set_validity(sc
,
4086 isl_union_map_copy(flow
));
4087 sc
= isl_schedule_constraints_set_proximity(sc
, flow
);
4088 sc
= isl_schedule_constraints_set_conditional_validity(sc
,
4089 condition
, validity
);
4090 schedule
= isl_schedule_constraints_compute_schedule(sc
);
4091 node
= isl_schedule_get_root(schedule
);
4093 isl_schedule_node_get_type(node
) != isl_schedule_node_band
)
4094 node
= isl_schedule_node_first_child(node
);
4095 n_member
= isl_schedule_node_band_n_member(node
);
4096 isl_schedule_node_free(node
);
4097 isl_schedule_free(schedule
);
4101 if (n_member
!= live_range_tests
[i
].outer_band_n
)
4102 isl_die(ctx
, isl_error_unknown
,
4103 "unexpected number of members in outer band",
4109 /* Check that the schedule computed for the given instance set and
4110 * dependence relation strongly satisfies the dependences.
4111 * In particular, check that no instance is scheduled before
4112 * or together with an instance on which it depends.
4113 * Earlier versions of isl would produce a schedule that
4114 * only weakly satisfies the dependences.
4116 static int test_strongly_satisfying_schedule(isl_ctx
*ctx
)
4118 const char *domain
, *dep
;
4119 isl_union_map
*D
, *schedule
;
4123 domain
= "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; "
4124 "A[i0] : 0 <= i0 <= 1 }";
4125 dep
= "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; "
4126 "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }";
4127 schedule
= compute_schedule(ctx
, domain
, dep
, dep
);
4128 D
= isl_union_map_read_from_str(ctx
, dep
);
4129 D
= isl_union_map_apply_domain(D
, isl_union_map_copy(schedule
));
4130 D
= isl_union_map_apply_range(D
, schedule
);
4131 map
= isl_map_from_union_map(D
);
4132 ge
= isl_map_lex_ge(isl_space_domain(isl_map_get_space(map
)));
4133 map
= isl_map_intersect(map
, ge
);
4134 empty
= isl_map_is_empty(map
);
4140 isl_die(ctx
, isl_error_unknown
,
4141 "dependences not strongly satisfied", return -1);
4146 /* Compute a schedule for input where the instance set constraints
4147 * conflict with the context constraints.
4148 * Earlier versions of isl did not properly handle this situation.
4150 static int test_conflicting_context_schedule(isl_ctx
*ctx
)
4152 isl_union_map
*schedule
;
4153 const char *domain
, *context
;
4155 domain
= "[n] -> { A[] : n >= 0 }";
4156 context
= "[n] -> { : n < 0 }";
4157 schedule
= compute_schedule_with_context(ctx
,
4158 domain
, "{}", "{}", context
);
4159 isl_union_map_free(schedule
);
4167 /* Check that the dependence carrying step is not confused by
4168 * a bound on the coefficient size.
4169 * In particular, force the scheduler to move to a dependence carrying
4170 * step by demanding outer coincidence and bound the size of
4171 * the coefficients. Earlier versions of isl would take this
4172 * bound into account while carrying dependences, breaking
4173 * fundamental assumptions.
4174 * On the other hand, the dependence carrying step now tries
4175 * to prevent loop coalescing by default, so check that indeed
4176 * no loop coalescing occurs by comparing the computed schedule
4177 * to the expected non-coalescing schedule.
4179 static int test_bounded_coefficients_schedule(isl_ctx
*ctx
)
4181 const char *domain
, *dep
;
4184 isl_schedule_constraints
*sc
;
4185 isl_schedule
*schedule
;
4186 isl_union_map
*sched1
, *sched2
;
4189 domain
= "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }";
4190 dep
= "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and "
4192 "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }";
4193 I
= isl_union_set_read_from_str(ctx
, domain
);
4194 D
= isl_union_map_read_from_str(ctx
, dep
);
4195 sc
= isl_schedule_constraints_on_domain(I
);
4196 sc
= isl_schedule_constraints_set_validity(sc
, isl_union_map_copy(D
));
4197 sc
= isl_schedule_constraints_set_coincidence(sc
, D
);
4198 isl_options_set_schedule_outer_coincidence(ctx
, 1);
4199 isl_options_set_schedule_max_coefficient(ctx
, 20);
4200 schedule
= isl_schedule_constraints_compute_schedule(sc
);
4201 isl_options_set_schedule_max_coefficient(ctx
, -1);
4202 isl_options_set_schedule_outer_coincidence(ctx
, 0);
4203 sched1
= isl_schedule_get_map(schedule
);
4204 isl_schedule_free(schedule
);
4206 sched2
= isl_union_map_read_from_str(ctx
, "{ C[x,y] -> [x,y] }");
4207 equal
= isl_union_map_is_equal(sched1
, sched2
);
4208 isl_union_map_free(sched1
);
4209 isl_union_map_free(sched2
);
4214 isl_die(ctx
, isl_error_unknown
,
4215 "unexpected schedule", return -1);
4220 /* Check that the bounds on the coefficients are respected.
4221 * This function checks for a particular output schedule,
4222 * but the exact output is not important, only that it does
4223 * not contain any coefficients greater than 4.
4224 * It is, however, easier to check for a particular output.
4225 * This test is only run for the whole component scheduler
4226 * because the incremental scheduler produces a slightly different schedule.
4228 static int test_bounded_coefficients_schedule_whole(isl_ctx
*ctx
)
4230 const char *domain
, *dep
, *str
;
4233 isl_schedule_constraints
*sc
;
4234 isl_schedule
*schedule
;
4235 isl_union_map
*sched1
, *sched2
;
4238 domain
= "{ S_4[i, j, k] : 0 <= i < j <= 10 and 0 <= k <= 100; "
4239 "S_2[i, j] : 0 <= i < j <= 10; S_6[i, j] : 0 <= i < j <= 10 }";
4240 dep
= "{ S_2[0, j] -> S_4[0, j, 0] : 0 < j <= 10; "
4241 "S_4[0, j, 100] -> S_6[0, j] : 0 < j <= 10 }";
4242 I
= isl_union_set_read_from_str(ctx
, domain
);
4243 D
= isl_union_map_read_from_str(ctx
, dep
);
4244 sc
= isl_schedule_constraints_on_domain(I
);
4245 sc
= isl_schedule_constraints_set_validity(sc
, D
);
4246 isl_options_set_schedule_max_constant_term(ctx
, 10);
4247 isl_options_set_schedule_max_coefficient(ctx
, 4);
4248 schedule
= isl_schedule_constraints_compute_schedule(sc
);
4249 isl_options_set_schedule_max_coefficient(ctx
, -1);
4250 isl_options_set_schedule_max_constant_term(ctx
, -1);
4251 sched1
= isl_schedule_get_map(schedule
);
4252 isl_schedule_free(schedule
);
4254 str
= "{ S_4[i, j, k] -> [i, j, 10 - k]; "
4255 "S_2[i, j] -> [0, i, j]; S_6[i, j] -> [0, 10 + i, j] }";
4256 sched2
= isl_union_map_read_from_str(ctx
, str
);
4257 equal
= isl_union_map_is_equal(sched1
, sched2
);
4258 isl_union_map_free(sched1
);
4259 isl_union_map_free(sched2
);
4264 isl_die(ctx
, isl_error_unknown
,
4265 "unexpected schedule", return -1);
4270 /* Check that a set of schedule constraints that only allow for
4271 * a coalescing schedule still produces a schedule even if the user
4272 * request a non-coalescing schedule. Earlier versions of isl
4273 * would not handle this case correctly.
4275 static int test_coalescing_schedule(isl_ctx
*ctx
)
4277 const char *domain
, *dep
;
4280 isl_schedule_constraints
*sc
;
4281 isl_schedule
*schedule
;
4282 int treat_coalescing
;
4284 domain
= "{ S[a, b] : 0 <= a <= 1 and 0 <= b <= 1 }";
4285 dep
= "{ S[a, b] -> S[a + b, 1 - b] }";
4286 I
= isl_union_set_read_from_str(ctx
, domain
);
4287 D
= isl_union_map_read_from_str(ctx
, dep
);
4288 sc
= isl_schedule_constraints_on_domain(I
);
4289 sc
= isl_schedule_constraints_set_validity(sc
, D
);
4290 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
4291 isl_options_set_schedule_treat_coalescing(ctx
, 1);
4292 schedule
= isl_schedule_constraints_compute_schedule(sc
);
4293 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
4294 isl_schedule_free(schedule
);
4300 /* Check that the scheduler does not perform any needless
4301 * compound skewing. Earlier versions of isl would compute
4302 * schedules in terms of transformed schedule coefficients and
4303 * would not accurately keep track of the sum of the original
4304 * schedule coefficients. It could then produce the schedule
4305 * S[t,i,j,k] -> [t, 2t + i, 2t + i + j, 2t + i + j + k]
4306 * for the input below instead of the schedule below.
4308 static int test_skewing_schedule(isl_ctx
*ctx
)
4310 const char *D
, *V
, *P
, *S
;
4312 D
= "[n] -> { S[t,i,j,k] : 0 <= t,i,j,k < n }";
4313 V
= "[n] -> { S[t,i,j,k] -> S[t+1,a,b,c] : 0 <= t,i,j,k,a,b,c < n and "
4314 "-2 <= a-i <= 2 and -1 <= a-i + b-j <= 1 and "
4315 "-1 <= a-i + b-j + c-k <= 1 }";
4317 S
= "{ S[t,i,j,k] -> [t, 2t + i, t + i + j, 2t + k] }";
4319 return test_special_schedule(ctx
, D
, V
, P
, S
);
4322 int test_schedule(isl_ctx
*ctx
)
4324 const char *D
, *W
, *R
, *V
, *P
, *S
;
4325 int max_coincidence
;
4326 int treat_coalescing
;
4328 /* Handle resulting schedule with zero bands. */
4329 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
4333 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
4334 W
= "{ S1[t,i] -> a[t,i] }";
4335 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
4336 "S1[t,i] -> a[t-1,i+1] }";
4337 S
= "{ S1[t,i] -> [t,i] }";
4338 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
4341 /* Fig. 5 of CC2008 */
4342 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
4344 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
4345 "j >= 2 and j <= -1 + N }";
4346 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
4347 "j >= 2 and j <= -1 + N; "
4348 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
4349 "j >= 2 and j <= -1 + N }";
4350 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
4351 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
4354 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
4355 W
= "{ S1[i] -> a[i] }";
4356 R
= "{ S2[i] -> a[i+1] }";
4357 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4358 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
4361 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
4362 W
= "{ S1[i] -> a[i] }";
4363 R
= "{ S2[i] -> a[9-i] }";
4364 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4365 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
4368 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
4369 W
= "{ S1[i] -> a[i] }";
4370 R
= "[N] -> { S2[i] -> a[N-1-i] }";
4371 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4372 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
4375 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
4376 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
4377 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
4378 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
4379 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4382 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4383 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
4384 R
= "{ S2[i,j] -> a[i-1,j] }";
4385 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4386 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4389 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4390 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
4391 R
= "{ S2[i,j] -> a[i,j-1] }";
4392 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4393 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4396 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
4397 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
4398 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
4399 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
4400 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
4401 "S_0[] -> [0, 0, 0] }";
4402 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
4404 ctx
->opt
->schedule_parametric
= 0;
4405 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4407 ctx
->opt
->schedule_parametric
= 1;
4409 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
4410 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
4411 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
4412 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
4413 "S4[i] -> a[i,N] }";
4414 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
4415 "S4[i] -> [4,i,0] }";
4416 max_coincidence
= isl_options_get_schedule_maximize_coincidence(ctx
);
4417 isl_options_set_schedule_maximize_coincidence(ctx
, 0);
4418 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
4420 isl_options_set_schedule_maximize_coincidence(ctx
, max_coincidence
);
4422 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
4423 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4425 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4427 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
4429 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
4430 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4433 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
4434 " S_2[t] : t >= 0 and t <= -1 + N; "
4435 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
4437 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
4438 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
4439 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
4440 "i >= 0 and i <= -1 + N }";
4441 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
4442 "i >= 0 and i <= -1 + N; "
4443 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
4444 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
4445 " S_0[t] -> [0, t, 0] }";
4447 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4449 ctx
->opt
->schedule_parametric
= 0;
4450 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4452 ctx
->opt
->schedule_parametric
= 1;
4454 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
4455 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
4456 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
4459 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
4460 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
4461 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
4462 "j >= 0 and j <= -1 + N; "
4463 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4464 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
4465 "j >= 0 and j <= -1 + N; "
4466 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4467 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
4468 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4471 D
= "{ S_0[i] : i >= 0 }";
4472 W
= "{ S_0[i] -> a[i] : i >= 0 }";
4473 R
= "{ S_0[i] -> a[0] : i >= 0 }";
4474 S
= "{ S_0[i] -> [0, i, 0] }";
4475 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4478 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
4479 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
4480 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
4481 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
4482 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4485 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
4486 "k <= -1 + n and k >= 0 }";
4487 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
4488 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
4489 "k <= -1 + n and k >= 0; "
4490 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
4491 "k <= -1 + n and k >= 0; "
4492 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
4493 "k <= -1 + n and k >= 0 }";
4494 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
4495 ctx
->opt
->schedule_outer_coincidence
= 1;
4496 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4498 ctx
->opt
->schedule_outer_coincidence
= 0;
4500 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
4501 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
4502 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
4503 "Stmt_for_body24[i0, i1, 1, 0]:"
4504 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
4505 "Stmt_for_body7[i0, i1, i2]:"
4506 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
4509 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
4510 "Stmt_for_body24[1, i1, i2, i3]:"
4511 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
4513 "Stmt_for_body24[0, i1, i2, i3] -> "
4514 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
4515 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
4517 "Stmt_for_body24[0, i1, i2, i3] ->"
4518 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
4519 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
4520 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
4521 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
4522 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
4523 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
4524 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
4525 "i1 <= 6 and i1 >= 0;"
4526 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
4527 "Stmt_for_body7[i0, i1, i2] -> "
4528 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
4529 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
4530 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
4531 "Stmt_for_body7[i0, i1, i2] -> "
4532 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
4533 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
4534 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
4537 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
4538 isl_options_set_schedule_treat_coalescing(ctx
, 0);
4539 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4541 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
4543 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
4544 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
4545 "j >= 1 and j <= 7;"
4546 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
4547 "j >= 1 and j <= 8 }";
4549 S
= "{ S_0[i, j] -> [i + j, i] }";
4550 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4551 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4553 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4555 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
4556 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
4557 "j >= 0 and j <= -1 + i }";
4558 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
4559 "i <= -1 + N and j >= 0;"
4560 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
4563 S
= "{ S_0[i, j] -> [i, j] }";
4564 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4565 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4567 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4569 /* Test both algorithms on a case with only proximity dependences. */
4570 D
= "{ S[i,j] : 0 <= i <= 10 }";
4572 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
4573 S
= "{ S[i, j] -> [j, i] }";
4574 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4575 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4577 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4578 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4581 D
= "{ A[a]; B[] }";
4583 P
= "{ A[a] -> B[] }";
4584 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4587 if (test_padded_schedule(ctx
) < 0)
4590 /* Check that check for progress is not confused by rational
4593 D
= "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
4594 V
= "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
4596 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
4597 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
4599 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4600 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4602 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4604 /* Check that we allow schedule rows that are only non-trivial
4605 * on some full-dimensional domains.
4607 D
= "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
4608 V
= "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
4609 "S1[j] -> S2[1] : 0 <= j <= 1 }";
4611 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4612 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4614 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4616 if (test_conditional_schedule_constraints(ctx
) < 0)
4619 if (test_strongly_satisfying_schedule(ctx
) < 0)
4622 if (test_conflicting_context_schedule(ctx
) < 0)
4625 if (test_bounded_coefficients_schedule(ctx
) < 0)
4627 if (test_coalescing_schedule(ctx
) < 0)
4629 if (test_skewing_schedule(ctx
) < 0)
4635 /* Perform scheduling tests using the whole component scheduler.
4637 static int test_schedule_whole(isl_ctx
*ctx
)
4642 whole
= isl_options_get_schedule_whole_component(ctx
);
4643 isl_options_set_schedule_whole_component(ctx
, 1);
4644 r
= test_schedule(ctx
);
4646 r
= test_bounded_coefficients_schedule_whole(ctx
);
4647 isl_options_set_schedule_whole_component(ctx
, whole
);
4652 /* Perform scheduling tests using the incremental scheduler.
4654 static int test_schedule_incremental(isl_ctx
*ctx
)
4659 whole
= isl_options_get_schedule_whole_component(ctx
);
4660 isl_options_set_schedule_whole_component(ctx
, 0);
4661 r
= test_schedule(ctx
);
4662 isl_options_set_schedule_whole_component(ctx
, whole
);
4667 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
4669 isl_union_map
*umap
;
4672 umap
= isl_union_map_read_from_str(ctx
, str
);
4673 test
= isl_union_map_plain_is_injective(umap
);
4674 isl_union_map_free(umap
);
4677 if (test
== injective
)
4680 isl_die(ctx
, isl_error_unknown
,
4681 "map not detected as injective", return -1);
4683 isl_die(ctx
, isl_error_unknown
,
4684 "map detected as injective", return -1);
4687 int test_injective(isl_ctx
*ctx
)
4691 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
4693 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
4695 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
4697 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
4699 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
4701 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
4703 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
4705 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
4708 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
4709 if (test_plain_injective(ctx
, str
, 1))
4711 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
4712 if (test_plain_injective(ctx
, str
, 0))
4718 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
4726 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
4727 equal
= isl_aff_plain_is_equal(aff
, aff2
);
4733 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
4737 equal
= aff_plain_is_equal(aff
, str
);
4741 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
4742 "result not as expected", return -1);
4746 /* Is "upa" obviously equal to the isl_union_pw_aff represented by "str"?
4748 static isl_bool
union_pw_aff_plain_is_equal(__isl_keep isl_union_pw_aff
*upa
,
4752 isl_union_pw_aff
*upa2
;
4756 return isl_bool_error
;
4758 ctx
= isl_union_pw_aff_get_ctx(upa
);
4759 upa2
= isl_union_pw_aff_read_from_str(ctx
, str
);
4760 equal
= isl_union_pw_aff_plain_is_equal(upa
, upa2
);
4761 isl_union_pw_aff_free(upa2
);
4766 /* Check that "upa" is obviously equal to the isl_union_pw_aff
4767 * represented by "str".
4769 static isl_stat
union_pw_aff_check_plain_equal(__isl_keep isl_union_pw_aff
*upa
,
4774 equal
= union_pw_aff_plain_is_equal(upa
, str
);
4776 return isl_stat_error
;
4778 isl_die(isl_union_pw_aff_get_ctx(upa
), isl_error_unknown
,
4779 "result not as expected", return isl_stat_error
);
4783 /* Basic tests on isl_union_pw_aff.
4785 * In particular, check that isl_union_pw_aff_aff_on_domain
4786 * aligns the parameters of the input objects and
4787 * that isl_union_pw_aff_param_on_domain_id properly
4788 * introduces the parameter.
4790 static int test_upa(isl_ctx
*ctx
)
4795 isl_union_set
*domain
;
4796 isl_union_pw_aff
*upa
;
4799 aff
= isl_aff_read_from_str(ctx
, "[N] -> { [N] }");
4800 str
= "[M] -> { A[i] : 0 <= i < M; B[] }";
4801 domain
= isl_union_set_read_from_str(ctx
, str
);
4802 upa
= isl_union_pw_aff_aff_on_domain(domain
, aff
);
4803 str
= "[N, M] -> { A[i] -> [N] : 0 <= i < M; B[] -> [N] }";
4804 ok
= union_pw_aff_check_plain_equal(upa
, str
);
4805 isl_union_pw_aff_free(upa
);
4809 id
= isl_id_alloc(ctx
, "N", NULL
);
4810 str
= "[M] -> { A[i] : 0 <= i < M; B[] }";
4811 domain
= isl_union_set_read_from_str(ctx
, str
);
4812 upa
= isl_union_pw_aff_param_on_domain_id(domain
, id
);
4813 str
= "[N, M] -> { A[i] -> [N] : 0 <= i < M; B[] -> [N] }";
4814 ok
= union_pw_aff_check_plain_equal(upa
, str
);
4815 isl_union_pw_aff_free(upa
);
4823 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4824 __isl_take isl_aff
*aff2
);
4826 ['+'] = { &isl_aff_add
},
4827 ['-'] = { &isl_aff_sub
},
4828 ['*'] = { &isl_aff_mul
},
4829 ['/'] = { &isl_aff_div
},
4837 } aff_bin_tests
[] = {
4838 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
4839 "{ [i] -> [2i] }" },
4840 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
4842 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
4843 "{ [i] -> [2i] }" },
4844 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
4845 "{ [i] -> [2i] }" },
4846 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
4847 "{ [i] -> [i/2] }" },
4848 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
4850 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
4851 "{ [i] -> [NaN] }" },
4852 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
4853 "{ [i] -> [NaN] }" },
4854 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
4855 "{ [i] -> [NaN] }" },
4856 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
4857 "{ [i] -> [NaN] }" },
4858 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
4859 "{ [i] -> [NaN] }" },
4860 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
4861 "{ [i] -> [NaN] }" },
4862 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
4863 "{ [i] -> [NaN] }" },
4864 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
4865 "{ [i] -> [NaN] }" },
4866 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
4867 "{ [i] -> [NaN] }" },
4868 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
4869 "{ [i] -> [NaN] }" },
4870 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
4871 "{ [i] -> [NaN] }" },
4872 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
4873 "{ [i] -> [NaN] }" },
4876 /* Perform some basic tests of binary operations on isl_aff objects.
4878 static int test_bin_aff(isl_ctx
*ctx
)
4881 isl_aff
*aff1
, *aff2
, *res
;
4882 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4883 __isl_take isl_aff
*aff2
);
4886 for (i
= 0; i
< ARRAY_SIZE(aff_bin_tests
); ++i
) {
4887 aff1
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg1
);
4888 aff2
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg2
);
4889 res
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].res
);
4890 fn
= aff_bin_op
[aff_bin_tests
[i
].op
].fn
;
4891 aff1
= fn(aff1
, aff2
);
4892 if (isl_aff_is_nan(res
))
4893 ok
= isl_aff_is_nan(aff1
);
4895 ok
= isl_aff_plain_is_equal(aff1
, res
);
4901 isl_die(ctx
, isl_error_unknown
,
4902 "unexpected result", return -1);
4909 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
4910 __isl_take isl_pw_aff
*pa2
);
4911 } pw_aff_bin_op
[] = {
4912 ['m'] = { &isl_pw_aff_min
},
4913 ['M'] = { &isl_pw_aff_max
},
4916 /* Inputs for binary isl_pw_aff operation tests.
4917 * "arg1" and "arg2" are the two arguments, "op" identifies the operation
4918 * defined by pw_aff_bin_op, and "res" is the expected result.
4925 } pw_aff_bin_tests
[] = {
4926 { "{ [i] -> [i] }", 'm', "{ [i] -> [i] }",
4928 { "{ [i] -> [i] }", 'M', "{ [i] -> [i] }",
4930 { "{ [i] -> [i] }", 'm', "{ [i] -> [0] }",
4931 "{ [i] -> [i] : i <= 0; [i] -> [0] : i > 0 }" },
4932 { "{ [i] -> [i] }", 'M', "{ [i] -> [0] }",
4933 "{ [i] -> [i] : i >= 0; [i] -> [0] : i < 0 }" },
4934 { "{ [i] -> [i] }", 'm', "{ [i] -> [NaN] }",
4935 "{ [i] -> [NaN] }" },
4936 { "{ [i] -> [NaN] }", 'm', "{ [i] -> [i] }",
4937 "{ [i] -> [NaN] }" },
4940 /* Perform some basic tests of binary operations on isl_pw_aff objects.
4942 static int test_bin_pw_aff(isl_ctx
*ctx
)
4946 isl_pw_aff
*pa1
, *pa2
, *res
;
4948 for (i
= 0; i
< ARRAY_SIZE(pw_aff_bin_tests
); ++i
) {
4949 pa1
= isl_pw_aff_read_from_str(ctx
, pw_aff_bin_tests
[i
].arg1
);
4950 pa2
= isl_pw_aff_read_from_str(ctx
, pw_aff_bin_tests
[i
].arg2
);
4951 res
= isl_pw_aff_read_from_str(ctx
, pw_aff_bin_tests
[i
].res
);
4952 pa1
= pw_aff_bin_op
[pw_aff_bin_tests
[i
].op
].fn(pa1
, pa2
);
4953 if (isl_pw_aff_involves_nan(res
))
4954 ok
= isl_pw_aff_involves_nan(pa1
);
4956 ok
= isl_pw_aff_plain_is_equal(pa1
, res
);
4957 isl_pw_aff_free(pa1
);
4958 isl_pw_aff_free(res
);
4962 isl_die(ctx
, isl_error_unknown
,
4963 "unexpected result", return -1);
4970 __isl_give isl_union_pw_multi_aff
*(*fn
)(
4971 __isl_take isl_union_pw_multi_aff
*upma1
,
4972 __isl_take isl_union_pw_multi_aff
*upma2
);
4976 } upma_bin_tests
[] = {
4977 { &isl_union_pw_multi_aff_add
, "{ A[] -> [0]; B[0] -> [1] }",
4978 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
4979 { &isl_union_pw_multi_aff_union_add
, "{ A[] -> [0]; B[0] -> [1] }",
4980 "{ B[x] -> [2] : x >= 0 }",
4981 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
4982 { &isl_union_pw_multi_aff_pullback_union_pw_multi_aff
,
4983 "{ A[] -> B[0]; C[x] -> B[1] : x < 10; C[y] -> B[2] : y >= 10 }",
4984 "{ D[i] -> A[] : i < 0; D[i] -> C[i + 5] : i >= 0 }",
4985 "{ D[i] -> B[0] : i < 0; D[i] -> B[1] : 0 <= i < 5; "
4986 "D[i] -> B[2] : i >= 5 }" },
4987 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4988 "{ B[x] -> C[2] : x > 0 }",
4989 "{ B[x] -> A[1] : x <= 0; B[x] -> C[2] : x > 0 }" },
4990 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4991 "{ B[x] -> A[2] : x >= 0 }",
4992 "{ B[x] -> A[1] : x < 0; B[x] -> A[2] : x > 0; B[0] -> A[3] }" },
4995 /* Perform some basic tests of binary operations on
4996 * isl_union_pw_multi_aff objects.
4998 static int test_bin_upma(isl_ctx
*ctx
)
5001 isl_union_pw_multi_aff
*upma1
, *upma2
, *res
;
5004 for (i
= 0; i
< ARRAY_SIZE(upma_bin_tests
); ++i
) {
5005 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
5006 upma_bin_tests
[i
].arg1
);
5007 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
5008 upma_bin_tests
[i
].arg2
);
5009 res
= isl_union_pw_multi_aff_read_from_str(ctx
,
5010 upma_bin_tests
[i
].res
);
5011 upma1
= upma_bin_tests
[i
].fn(upma1
, upma2
);
5012 ok
= isl_union_pw_multi_aff_plain_is_equal(upma1
, res
);
5013 isl_union_pw_multi_aff_free(upma1
);
5014 isl_union_pw_multi_aff_free(res
);
5018 isl_die(ctx
, isl_error_unknown
,
5019 "unexpected result", return -1);
5026 __isl_give isl_union_pw_multi_aff
*(*fn
)(
5027 __isl_take isl_union_pw_multi_aff
*upma1
,
5028 __isl_take isl_union_pw_multi_aff
*upma2
);
5031 } upma_bin_fail_tests
[] = {
5032 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
5033 "{ B[x] -> C[2] : x >= 0 }" },
5036 /* Perform some basic tests of binary operations on
5037 * isl_union_pw_multi_aff objects that are expected to fail.
5039 static int test_bin_upma_fail(isl_ctx
*ctx
)
5042 isl_union_pw_multi_aff
*upma1
, *upma2
;
5045 on_error
= isl_options_get_on_error(ctx
);
5046 isl_options_set_on_error(ctx
, ISL_ON_ERROR_CONTINUE
);
5047 n
= ARRAY_SIZE(upma_bin_fail_tests
);
5048 for (i
= 0; i
< n
; ++i
) {
5049 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
5050 upma_bin_fail_tests
[i
].arg1
);
5051 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
5052 upma_bin_fail_tests
[i
].arg2
);
5053 upma1
= upma_bin_fail_tests
[i
].fn(upma1
, upma2
);
5054 isl_union_pw_multi_aff_free(upma1
);
5058 isl_options_set_on_error(ctx
, on_error
);
5060 isl_die(ctx
, isl_error_unknown
,
5061 "operation not expected to succeed", return -1);
5066 /* Inputs for basic tests of unary operations on isl_multi_pw_aff objects.
5067 * "fn" is the function that is tested.
5068 * "arg" is a string description of the input.
5069 * "res" is a string description of the expected result.
5072 __isl_give isl_multi_pw_aff
*(*fn
)(__isl_take isl_multi_pw_aff
*mpa
);
5075 } mpa_un_tests
[] = {
5076 { &isl_multi_pw_aff_range_factor_domain
,
5077 "{ A[x] -> [B[(1 : x >= 5)] -> C[(2 : x <= 10)]] }",
5078 "{ A[x] -> B[(1 : x >= 5)] }" },
5079 { &isl_multi_pw_aff_range_factor_range
,
5080 "{ A[x] -> [B[(1 : x >= 5)] -> C[(2 : x <= 10)]] }",
5081 "{ A[y] -> C[(2 : y <= 10)] }" },
5082 { &isl_multi_pw_aff_range_factor_domain
,
5083 "{ A[x] -> [B[(1 : x >= 5)] -> C[]] }",
5084 "{ A[x] -> B[(1 : x >= 5)] }" },
5085 { &isl_multi_pw_aff_range_factor_range
,
5086 "{ A[x] -> [B[(1 : x >= 5)] -> C[]] }",
5087 "{ A[y] -> C[] }" },
5088 { &isl_multi_pw_aff_range_factor_domain
,
5089 "{ A[x] -> [B[] -> C[(2 : x <= 10)]] }",
5090 "{ A[x] -> B[] }" },
5091 { &isl_multi_pw_aff_range_factor_range
,
5092 "{ A[x] -> [B[] -> C[(2 : x <= 10)]] }",
5093 "{ A[y] -> C[(2 : y <= 10)] }" },
5094 { &isl_multi_pw_aff_range_factor_domain
,
5095 "{ A[x] -> [B[] -> C[]] }",
5096 "{ A[x] -> B[] }" },
5097 { &isl_multi_pw_aff_range_factor_range
,
5098 "{ A[x] -> [B[] -> C[]] }",
5099 "{ A[y] -> C[] }" },
5100 { &isl_multi_pw_aff_factor_range
,
5103 { &isl_multi_pw_aff_range_factor_domain
,
5104 "{ A[x] -> [B[] -> C[]] : x >= 0 }",
5105 "{ A[x] -> B[] : x >= 0 }" },
5106 { &isl_multi_pw_aff_range_factor_range
,
5107 "{ A[x] -> [B[] -> C[]] : x >= 0 }",
5108 "{ A[y] -> C[] : y >= 0 }" },
5109 { &isl_multi_pw_aff_factor_range
,
5110 "[N] -> { [B[] -> C[]] : N >= 0 }",
5111 "[N] -> { C[] : N >= 0 }" },
5114 /* Perform some basic tests of unary operations on isl_multi_pw_aff objects.
5116 static int test_un_mpa(isl_ctx
*ctx
)
5120 isl_multi_pw_aff
*mpa
, *res
;
5122 for (i
= 0; i
< ARRAY_SIZE(mpa_un_tests
); ++i
) {
5123 mpa
= isl_multi_pw_aff_read_from_str(ctx
, mpa_un_tests
[i
].arg
);
5124 res
= isl_multi_pw_aff_read_from_str(ctx
, mpa_un_tests
[i
].res
);
5125 mpa
= mpa_un_tests
[i
].fn(mpa
);
5126 ok
= isl_multi_pw_aff_plain_is_equal(mpa
, res
);
5127 isl_multi_pw_aff_free(mpa
);
5128 isl_multi_pw_aff_free(res
);
5132 isl_die(ctx
, isl_error_unknown
,
5133 "unexpected result", return -1);
5139 /* Inputs for basic tests of binary operations on isl_multi_pw_aff objects.
5140 * "fn" is the function that is tested.
5141 * "arg1" and "arg2" are string descriptions of the inputs.
5142 * "res" is a string description of the expected result.
5145 __isl_give isl_multi_pw_aff
*(*fn
)(
5146 __isl_take isl_multi_pw_aff
*mpa1
,
5147 __isl_take isl_multi_pw_aff
*mpa2
);
5151 } mpa_bin_tests
[] = {
5152 { &isl_multi_pw_aff_add
, "{ A[] -> [1] }", "{ A[] -> [2] }",
5154 { &isl_multi_pw_aff_add
, "{ A[x] -> [(1 : x >= 5)] }",
5155 "{ A[x] -> [(x : x <= 10)] }",
5156 "{ A[x] -> [(1 + x : 5 <= x <= 10)] }" },
5157 { &isl_multi_pw_aff_add
, "{ A[x] -> [] : x >= 5 }",
5158 "{ A[x] -> [] : x <= 10 }",
5159 "{ A[x] -> [] : 5 <= x <= 10 }" },
5160 { &isl_multi_pw_aff_add
, "{ A[x] -> [] : x >= 5 }",
5161 "[N] -> { A[x] -> [] : x <= N }",
5162 "[N] -> { A[x] -> [] : 5 <= x <= N }" },
5163 { &isl_multi_pw_aff_add
,
5164 "[N] -> { A[x] -> [] : x <= N }",
5165 "{ A[x] -> [] : x >= 5 }",
5166 "[N] -> { A[x] -> [] : 5 <= x <= N }" },
5167 { &isl_multi_pw_aff_range_product
, "{ A[x] -> B[(1 : x >= 5)] }",
5168 "{ A[y] -> C[(2 : y <= 10)] }",
5169 "{ A[x] -> [B[(1 : x >= 5)] -> C[(2 : x <= 10)]] }" },
5170 { &isl_multi_pw_aff_range_product
, "{ A[x] -> B[1] : x >= 5 }",
5171 "{ A[y] -> C[2] : y <= 10 }",
5172 "{ A[x] -> [B[(1 : x >= 5)] -> C[(2 : x <= 10)]] }" },
5173 { &isl_multi_pw_aff_range_product
, "{ A[x] -> B[1] : x >= 5 }",
5174 "[N] -> { A[y] -> C[2] : y <= N }",
5175 "[N] -> { A[x] -> [B[(1 : x >= 5)] -> C[(2 : x <= N)]] }" },
5176 { &isl_multi_pw_aff_range_product
, "[N] -> { A[x] -> B[1] : x >= N }",
5177 "{ A[y] -> C[2] : y <= 10 }",
5178 "[N] -> { A[x] -> [B[(1 : x >= N)] -> C[(2 : x <= 10)]] }" },
5179 { &isl_multi_pw_aff_range_product
, "{ A[] -> B[1] }", "{ A[] -> C[2] }",
5180 "{ A[] -> [B[1] -> C[2]] }" },
5181 { &isl_multi_pw_aff_range_product
, "{ A[] -> B[] }", "{ A[] -> C[] }",
5182 "{ A[] -> [B[] -> C[]] }" },
5183 { &isl_multi_pw_aff_range_product
, "{ A[x] -> B[(1 : x >= 5)] }",
5184 "{ A[y] -> C[] : y <= 10 }",
5185 "{ A[x] -> [B[(1 : x >= 5)] -> C[]] : x <= 10 }" },
5186 { &isl_multi_pw_aff_range_product
, "{ A[y] -> C[] : y <= 10 }",
5187 "{ A[x] -> B[(1 : x >= 5)] }",
5188 "{ A[x] -> [C[] -> B[(1 : x >= 5)]] : x <= 10 }" },
5189 { &isl_multi_pw_aff_product
, "{ A[x] -> B[(1 : x >= 5)] }",
5190 "{ A[y] -> C[(2 : y <= 10)] }",
5191 "{ [A[x] -> A[y]] -> [B[(1 : x >= 5)] -> C[(2 : y <= 10)]] }" },
5192 { &isl_multi_pw_aff_product
, "{ A[x] -> B[(1 : x >= 5)] }",
5193 "{ A[y] -> C[] : y <= 10 }",
5194 "{ [A[x] -> A[y]] -> [B[(1 : x >= 5)] -> C[]] : y <= 10 }" },
5195 { &isl_multi_pw_aff_product
, "{ A[y] -> C[] : y <= 10 }",
5196 "{ A[x] -> B[(1 : x >= 5)] }",
5197 "{ [A[y] -> A[x]] -> [C[] -> B[(1 : x >= 5)]] : y <= 10 }" },
5198 { &isl_multi_pw_aff_product
, "{ A[x] -> B[(1 : x >= 5)] }",
5199 "[N] -> { A[y] -> C[] : y <= N }",
5200 "[N] -> { [A[x] -> A[y]] -> [B[(1 : x >= 5)] -> C[]] : y <= N }" },
5201 { &isl_multi_pw_aff_product
, "[N] -> { A[y] -> C[] : y <= N }",
5202 "{ A[x] -> B[(1 : x >= 5)] }",
5203 "[N] -> { [A[y] -> A[x]] -> [C[] -> B[(1 : x >= 5)]] : y <= N }" },
5204 { &isl_multi_pw_aff_product
, "{ A[x] -> B[] : x >= 5 }",
5205 "{ A[y] -> C[] : y <= 10 }",
5206 "{ [A[x] -> A[y]] -> [B[] -> C[]] : x >= 5 and y <= 10 }" },
5207 { &isl_multi_pw_aff_product
, "{ A[] -> B[1] }", "{ A[] -> C[2] }",
5208 "{ [A[] -> A[]] -> [B[1] -> C[2]] }" },
5209 { &isl_multi_pw_aff_product
, "{ A[] -> B[] }", "{ A[] -> C[] }",
5210 "{ [A[] -> A[]] -> [B[] -> C[]] }" },
5211 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5212 "{ B[i,j] -> C[i + 2j] }", "{ A[a,b] -> B[b,a] }",
5213 "{ A[a,b] -> C[b + 2a] }" },
5214 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5215 "{ B[i,j] -> C[i + 2j] }",
5216 "{ A[a,b] -> B[(b : b > a),(a : b > a)] }",
5217 "{ A[a,b] -> C[(b + 2a : b > a)] }" },
5218 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5219 "{ B[i,j] -> C[(i + 2j : j > 4)] }",
5220 "{ A[a,b] -> B[(b : b > a),(a : b > a)] }",
5221 "{ A[a,b] -> C[(b + 2a : b > a > 4)] }" },
5222 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5223 "{ B[i,j] -> C[] }",
5224 "{ A[a,b] -> B[(b : b > a),(a : b > a)] }",
5225 "{ A[a,b] -> C[] }" },
5226 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5227 "{ B[i,j] -> C[] : i > j }",
5228 "{ A[a,b] -> B[b,a] }",
5229 "{ A[a,b] -> C[] : b > a }" },
5230 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5231 "{ B[i,j] -> C[] : j > 5 }",
5232 "{ A[a,b] -> B[(b : b > a),(a : b > a)] }",
5233 "{ A[a,b] -> C[] : b > a > 5 }" },
5234 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5235 "[N] -> { B[i,j] -> C[] : j > N }",
5236 "{ A[a,b] -> B[(b : b > a),(a : b > a)] }",
5237 "[N] -> { A[a,b] -> C[] : b > a > N }" },
5238 { &isl_multi_pw_aff_pullback_multi_pw_aff
,
5239 "[M,N] -> { B[] -> C[] : N > 5 }",
5240 "[M,N] -> { A[] -> B[] : M > N }",
5241 "[M,N] -> { A[] -> C[] : M > N > 5 }" },
5244 /* Perform some basic tests of binary operations on isl_multi_pw_aff objects.
5246 static int test_bin_mpa(isl_ctx
*ctx
)
5250 isl_multi_pw_aff
*mpa1
, *mpa2
, *res
;
5252 for (i
= 0; i
< ARRAY_SIZE(mpa_bin_tests
); ++i
) {
5253 mpa1
= isl_multi_pw_aff_read_from_str(ctx
,
5254 mpa_bin_tests
[i
].arg1
);
5255 mpa2
= isl_multi_pw_aff_read_from_str(ctx
,
5256 mpa_bin_tests
[i
].arg2
);
5257 res
= isl_multi_pw_aff_read_from_str(ctx
,
5258 mpa_bin_tests
[i
].res
);
5259 mpa1
= mpa_bin_tests
[i
].fn(mpa1
, mpa2
);
5260 ok
= isl_multi_pw_aff_plain_is_equal(mpa1
, res
);
5261 isl_multi_pw_aff_free(mpa1
);
5262 isl_multi_pw_aff_free(res
);
5266 isl_die(ctx
, isl_error_unknown
,
5267 "unexpected result", return -1);
5273 /* Inputs for basic tests of unary operations on
5274 * isl_multi_union_pw_aff objects.
5275 * "fn" is the function that is tested.
5276 * "arg" is a string description of the input.
5277 * "res" is a string description of the expected result.
5280 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5281 __isl_take isl_multi_union_pw_aff
*mupa
);
5284 } mupa_un_tests
[] = {
5285 { &isl_multi_union_pw_aff_factor_range
,
5286 "[B[{ A[] -> [1] }] -> C[{ A[] -> [2] }]]",
5287 "C[{ A[] -> [2] }]" },
5288 { &isl_multi_union_pw_aff_factor_range
,
5289 "[B[] -> C[{ A[] -> [2] }]]",
5290 "C[{ A[] -> [2] }]" },
5291 { &isl_multi_union_pw_aff_factor_range
,
5292 "[B[{ A[] -> [1] }] -> C[]]",
5294 { &isl_multi_union_pw_aff_factor_range
,
5297 { &isl_multi_union_pw_aff_factor_range
,
5298 "([B[] -> C[]] : { A[x] : x >= 0 })",
5299 "(C[] : { A[x] : x >= 0 })" },
5300 { &isl_multi_union_pw_aff_factor_range
,
5301 "[N] -> ([B[] -> C[]] : { A[x] : x <= N })",
5302 "[N] -> (C[] : { A[x] : x <= N })" },
5303 { &isl_multi_union_pw_aff_factor_range
,
5304 "[N] -> ([B[] -> C[]] : { : N >= 0 })",
5305 "[N] -> (C[] : { : N >= 0 })" },
5308 /* Perform some basic tests of unary operations on
5309 * isl_multi_union_pw_aff objects.
5311 static int test_un_mupa(isl_ctx
*ctx
)
5315 isl_multi_union_pw_aff
*mupa
, *res
;
5317 for (i
= 0; i
< ARRAY_SIZE(mupa_un_tests
); ++i
) {
5318 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5319 mupa_un_tests
[i
].arg
);
5320 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5321 mupa_un_tests
[i
].res
);
5322 mupa
= mupa_un_tests
[i
].fn(mupa
);
5323 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
5324 isl_multi_union_pw_aff_free(mupa
);
5325 isl_multi_union_pw_aff_free(res
);
5329 isl_die(ctx
, isl_error_unknown
,
5330 "unexpected result", return -1);
5336 /* Inputs for basic tests of binary operations on
5337 * isl_multi_union_pw_aff objects.
5338 * "fn" is the function that is tested.
5339 * "arg1" and "arg2" are string descriptions of the inputs.
5340 * "res" is a string description of the expected result.
5343 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5344 __isl_take isl_multi_union_pw_aff
*mupa1
,
5345 __isl_take isl_multi_union_pw_aff
*mupa2
);
5349 } mupa_bin_tests
[] = {
5350 { &isl_multi_union_pw_aff_add
, "[{ A[] -> [1] }]", "[{ A[] -> [2] }]",
5351 "[{ A[] -> [3] }]" },
5352 { &isl_multi_union_pw_aff_sub
, "[{ A[] -> [1] }]", "[{ A[] -> [2] }]",
5353 "[{ A[] -> [-1] }]" },
5354 { &isl_multi_union_pw_aff_add
,
5355 "[{ A[] -> [1]; B[] -> [4] }]",
5356 "[{ A[] -> [2]; C[] -> [5] }]",
5357 "[{ A[] -> [3] }]" },
5358 { &isl_multi_union_pw_aff_union_add
,
5359 "[{ A[] -> [1]; B[] -> [4] }]",
5360 "[{ A[] -> [2]; C[] -> [5] }]",
5361 "[{ A[] -> [3]; B[] -> [4]; C[] -> [5] }]" },
5362 { &isl_multi_union_pw_aff_add
, "[{ A[x] -> [(1)] : x >= 5 }]",
5363 "[{ A[x] -> [(x)] : x <= 10 }]",
5364 "[{ A[x] -> [(1 + x)] : 5 <= x <= 10 }]" },
5365 { &isl_multi_union_pw_aff_add
, "([] : { A[x] : x >= 5 })",
5366 "([] : { A[x] : x <= 10 })",
5367 "([] : { A[x] : 5 <= x <= 10 })" },
5368 { &isl_multi_union_pw_aff_add
, "([] : { A[x] : x >= 5 })",
5369 "[N] -> ([] : { A[x] : x <= N })",
5370 "[N] -> ([] : { A[x] : 5 <= x <= N })" },
5371 { &isl_multi_union_pw_aff_add
, "[N] -> ([] : { A[x] : x >= N })",
5372 "([] : { A[x] : x <= 10 })",
5373 "[N] -> ([] : { A[x] : N <= x <= 10 })" },
5374 { &isl_multi_union_pw_aff_union_add
, "[{ A[x] -> [(1)] : x >= 5 }]",
5375 "[{ A[x] -> [(x)] : x <= 10 }]",
5376 "[{ A[x] -> [(1 + x)] : 5 <= x <= 10; "
5377 "A[x] -> [(1)] : x > 10; A[x] -> [(x)] : x < 5 }]" },
5378 { &isl_multi_union_pw_aff_union_add
, "([] : { A[x] : x >= 5 })",
5379 "([] : { A[x] : x <= 10 })",
5380 "([] : { A[x] })" },
5381 { &isl_multi_union_pw_aff_union_add
, "([] : { A[x] : x >= 0 })",
5382 "[N] -> ([] : { A[x] : x >= N })",
5383 "[N] -> ([] : { A[x] : x >= 0 or x >= N })" },
5384 { &isl_multi_union_pw_aff_union_add
,
5385 "[N] -> ([] : { A[] : N >= 0})",
5386 "[N] -> ([] : { A[] : N <= 0})",
5387 "[N] -> ([] : { A[] })" },
5388 { &isl_multi_union_pw_aff_union_add
,
5389 "[N] -> ([] : { A[] })",
5390 "[N] -> ([] : { : })",
5391 "[N] -> ([] : { : })" },
5392 { &isl_multi_union_pw_aff_union_add
,
5393 "[N] -> ([] : { : })",
5394 "[N] -> ([] : { A[] })",
5395 "[N] -> ([] : { : })" },
5396 { &isl_multi_union_pw_aff_union_add
,
5397 "[N] -> ([] : { : N >= 0})",
5398 "[N] -> ([] : { : N <= 0})",
5399 "[N] -> ([] : { : })" },
5400 { &isl_multi_union_pw_aff_range_product
,
5401 "B[{ A[] -> [1] }]",
5402 "C[{ A[] -> [2] }]",
5403 "[B[{ A[] -> [1] }] -> C[{ A[] -> [2] }]]" },
5404 { &isl_multi_union_pw_aff_range_product
,
5405 "(B[] : { A[x] : x >= 5 })",
5406 "(C[] : { A[x] : x <= 10 })",
5407 "([B[] -> C[]] : { A[x] : 5 <= x <= 10 })" },
5408 { &isl_multi_union_pw_aff_range_product
,
5409 "B[{ A[x] -> [x + 1] : x >= 5 }]",
5410 "(C[] : { A[x] : x <= 10 })",
5411 "[B[{ A[x] -> [x + 1] : 5 <= x <= 10 }] -> C[]]" },
5412 { &isl_multi_union_pw_aff_range_product
,
5413 "(C[] : { A[x] : x <= 10 })",
5414 "B[{ A[x] -> [x + 1] : x >= 5 }]",
5415 "[C[] -> B[{ A[x] -> [x + 1] : 5 <= x <= 10 }]]" },
5416 { &isl_multi_union_pw_aff_range_product
,
5417 "B[{ A[x] -> [x + 1] : x >= 5 }]",
5418 "[N] -> (C[] : { A[x] : x <= N })",
5419 "[N] -> [B[{ A[x] -> [x + 1] : 5 <= x <= N }] -> C[]]" },
5420 { &isl_multi_union_pw_aff_range_product
,
5421 "[N] -> (C[] : { A[x] : x <= N })",
5422 "B[{ A[x] -> [x + 1] : x >= 5 }]",
5423 "[N] -> [C[] -> B[{ A[x] -> [x + 1] : 5 <= x <= N }]]" },
5424 { &isl_multi_union_pw_aff_range_product
,
5425 "B[{ A[] -> [1]; D[] -> [3] }]",
5426 "C[{ A[] -> [2] }]",
5427 "[B[{ A[] -> [1]; D[] -> [3] }] -> C[{ A[] -> [2] }]]" },
5428 { &isl_multi_union_pw_aff_range_product
,
5431 "([B[] -> C[]] : { A[x] })" },
5432 { &isl_multi_union_pw_aff_range_product
,
5435 "([B[] -> C[]] : { A[x] })" },
5438 /* Perform some basic tests of binary operations on
5439 * isl_multi_union_pw_aff objects.
5441 static int test_bin_mupa(isl_ctx
*ctx
)
5445 isl_multi_union_pw_aff
*mupa1
, *mupa2
, *res
;
5447 for (i
= 0; i
< ARRAY_SIZE(mupa_bin_tests
); ++i
) {
5448 mupa1
= isl_multi_union_pw_aff_read_from_str(ctx
,
5449 mupa_bin_tests
[i
].arg1
);
5450 mupa2
= isl_multi_union_pw_aff_read_from_str(ctx
,
5451 mupa_bin_tests
[i
].arg2
);
5452 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5453 mupa_bin_tests
[i
].res
);
5454 mupa1
= mupa_bin_tests
[i
].fn(mupa1
, mupa2
);
5455 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa1
, res
);
5456 isl_multi_union_pw_aff_free(mupa1
);
5457 isl_multi_union_pw_aff_free(res
);
5461 isl_die(ctx
, isl_error_unknown
,
5462 "unexpected result", return -1);
5468 /* Inputs for basic tests of binary operations on
5469 * pairs of isl_multi_union_pw_aff and isl_set objects.
5470 * "fn" is the function that is tested.
5471 * "arg1" and "arg2" are string descriptions of the inputs.
5472 * "res" is a string description of the expected result.
5475 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5476 __isl_take isl_multi_union_pw_aff
*mupa
,
5477 __isl_take isl_set
*set
);
5481 } mupa_set_tests
[] = {
5482 { &isl_multi_union_pw_aff_intersect_range
,
5483 "C[{ B[i,j] -> [i + 2j] }]", "{ C[1] }",
5484 "C[{ B[i,j] -> [i + 2j] : i + 2j = 1 }]" },
5485 { &isl_multi_union_pw_aff_intersect_range
,
5486 "C[{ B[i,j] -> [i + 2j] }]", "[N] -> { C[N] }",
5487 "[N] -> C[{ B[i,j] -> [i + 2j] : i + 2j = N }]" },
5488 { &isl_multi_union_pw_aff_intersect_range
,
5489 "[N] -> C[{ B[i,j] -> [i + 2j + N] }]", "{ C[1] }",
5490 "[N] -> C[{ B[i,j] -> [i + 2j + N] : i + 2j + N = 1 }]" },
5491 { &isl_multi_union_pw_aff_intersect_range
,
5492 "C[{ B[i,j] -> [i + 2j] }]", "[N] -> { C[x] : N >= 0 }",
5493 "[N] -> C[{ B[i,j] -> [i + 2j] : N >= 0 }]" },
5494 { &isl_multi_union_pw_aff_intersect_range
,
5495 "C[]", "{ C[] }", "C[]" },
5496 { &isl_multi_union_pw_aff_intersect_range
,
5497 "[N] -> (C[] : { : N >= 0 })",
5499 "[N] -> (C[] : { : N >= 0 })" },
5500 { &isl_multi_union_pw_aff_intersect_range
,
5501 "(C[] : { A[a,b] })",
5503 "(C[] : { A[a,b] })" },
5504 { &isl_multi_union_pw_aff_intersect_range
,
5505 "[N] -> (C[] : { A[a,b] : a,b <= N })",
5507 "[N] -> (C[] : { A[a,b] : a,b <= N })" },
5508 { &isl_multi_union_pw_aff_intersect_range
,
5510 "[N] -> { C[] : N >= 0 }",
5511 "[N] -> (C[] : { : N >= 0 })" },
5512 { &isl_multi_union_pw_aff_intersect_range
,
5513 "(C[] : { A[a,b] })",
5514 "[N] -> { C[] : N >= 0 }",
5515 "[N] -> (C[] : { A[a,b] : N >= 0 })" },
5516 { &isl_multi_union_pw_aff_intersect_range
,
5517 "[N] -> (C[] : { : N >= 0 })",
5518 "[N] -> { C[] : N < 1024 }",
5519 "[N] -> (C[] : { : 0 <= N < 1024 })" },
5520 { &isl_multi_union_pw_aff_intersect_params
,
5521 "C[{ B[i,j] -> [i + 2j] }]", "[N] -> { : N >= 0 }",
5522 "[N] -> C[{ B[i,j] -> [i + 2j] : N >= 0}]" },
5523 { &isl_multi_union_pw_aff_intersect_params
,
5524 "[N] -> C[{ B[i,j] -> [i + 2j] : N <= 256 }]", "[N] -> { : N >= 0 }",
5525 "[N] -> C[{ B[i,j] -> [i + 2j] : 0 <= N <= 256 }]" },
5526 { &isl_multi_union_pw_aff_intersect_params
,
5527 "[N] -> C[{ B[i,j] -> [i + 2j] : N <= 256 }]", "{ : }",
5528 "[N] -> C[{ B[i,j] -> [i + 2j] : N <= 256 }]" },
5529 { &isl_multi_union_pw_aff_intersect_params
,
5530 "C[]", "[N] -> { : N >= 0 }",
5531 "[N] -> (C[] : { : N >= 0 })" },
5532 { &isl_multi_union_pw_aff_intersect_params
,
5533 "(C[] : { A[a,b] })", "[N] -> { : N >= 0 }",
5534 "[N] -> (C[] : { A[a,b] : N >= 0 })" },
5535 { &isl_multi_union_pw_aff_intersect_params
,
5536 "[N] -> (C[] : { A[a,N] })", "{ : }",
5537 "[N] -> (C[] : { A[a,N] })" },
5538 { &isl_multi_union_pw_aff_intersect_params
,
5539 "[N] -> (C[] : { A[a,b] : N <= 256 })", "[N] -> { : N >= 0 }",
5540 "[N] -> (C[] : { A[a,b] : 0 <= N <= 256 })" },
5543 /* Perform some basic tests of binary operations on
5544 * pairs of isl_multi_union_pw_aff and isl_set objects.
5546 static int test_mupa_set(isl_ctx
*ctx
)
5550 isl_multi_union_pw_aff
*mupa
, *res
;
5553 for (i
= 0; i
< ARRAY_SIZE(mupa_set_tests
); ++i
) {
5554 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5555 mupa_set_tests
[i
].arg1
);
5556 set
= isl_set_read_from_str(ctx
, mupa_set_tests
[i
].arg2
);
5557 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5558 mupa_set_tests
[i
].res
);
5559 mupa
= mupa_set_tests
[i
].fn(mupa
, set
);
5560 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
5561 isl_multi_union_pw_aff_free(mupa
);
5562 isl_multi_union_pw_aff_free(res
);
5566 isl_die(ctx
, isl_error_unknown
,
5567 "unexpected result", return -1);
5573 /* Inputs for basic tests of binary operations on
5574 * pairs of isl_multi_union_pw_aff and isl_union_set objects.
5575 * "fn" is the function that is tested.
5576 * "arg1" and "arg2" are string descriptions of the inputs.
5577 * "res" is a string description of the expected result.
5580 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5581 __isl_take isl_multi_union_pw_aff
*mupa
,
5582 __isl_take isl_union_set
*uset
);
5586 } mupa_uset_tests
[] = {
5587 { &isl_multi_union_pw_aff_intersect_domain
,
5588 "C[{ B[i,j] -> [i + 2j] }]", "{ B[i,i] }",
5589 "C[{ B[i,i] -> [3i] }]" },
5590 { &isl_multi_union_pw_aff_intersect_domain
,
5591 "(C[] : { B[i,j] })", "{ B[i,i] }",
5592 "(C[] : { B[i,i] })" },
5593 { &isl_multi_union_pw_aff_intersect_domain
,
5594 "(C[] : { B[i,j] })", "[N] -> { B[N,N] }",
5595 "[N] -> (C[] : { B[N,N] })" },
5596 { &isl_multi_union_pw_aff_intersect_domain
,
5597 "C[]", "{ B[i,i] }",
5598 "(C[] : { B[i,i] })" },
5599 { &isl_multi_union_pw_aff_intersect_domain
,
5600 "[N] -> (C[] : { : N >= 0 })", "{ B[i,i] }",
5601 "[N] -> (C[] : { B[i,i] : N >= 0 })" },
5604 /* Perform some basic tests of binary operations on
5605 * pairs of isl_multi_union_pw_aff and isl_union_set objects.
5607 static int test_mupa_uset(isl_ctx
*ctx
)
5611 isl_multi_union_pw_aff
*mupa
, *res
;
5612 isl_union_set
*uset
;
5614 for (i
= 0; i
< ARRAY_SIZE(mupa_uset_tests
); ++i
) {
5615 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5616 mupa_uset_tests
[i
].arg1
);
5617 uset
= isl_union_set_read_from_str(ctx
,
5618 mupa_uset_tests
[i
].arg2
);
5619 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5620 mupa_uset_tests
[i
].res
);
5621 mupa
= mupa_uset_tests
[i
].fn(mupa
, uset
);
5622 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
5623 isl_multi_union_pw_aff_free(mupa
);
5624 isl_multi_union_pw_aff_free(res
);
5628 isl_die(ctx
, isl_error_unknown
,
5629 "unexpected result", return -1);
5635 /* Inputs for basic tests of binary operations on
5636 * pairs of isl_multi_union_pw_aff and isl_multi_aff objects.
5637 * "fn" is the function that is tested.
5638 * "arg1" and "arg2" are string descriptions of the inputs.
5639 * "res" is a string description of the expected result.
5642 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5643 __isl_take isl_multi_union_pw_aff
*mupa
,
5644 __isl_take isl_multi_aff
*ma
);
5648 } mupa_ma_tests
[] = {
5649 { &isl_multi_union_pw_aff_apply_multi_aff
,
5650 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }, "
5651 "{ A[i,j] -> [j]; B[i,j] -> [i] }]",
5652 "{ C[a,b] -> D[b,a] }",
5653 "D[{ A[i,j] -> [j]; B[i,j] -> [i] }, "
5654 "{ A[i,j] -> [i]; B[i,j] -> [j] }]" },
5655 { &isl_multi_union_pw_aff_apply_multi_aff
,
5656 "C[{ A[i,j] -> [i] : i >= 0; B[i,j] -> [j] }, "
5657 "{ A[i,j] -> [j]; B[i,j] -> [i] }]",
5658 "{ C[a,b] -> D[b,a] }",
5659 "D[{ A[i,j] -> [j] : i >= 0; B[i,j] -> [i] }, "
5660 "{ A[i,j] -> [i] : i >= 0; B[i,j] -> [j] }]" },
5661 { &isl_multi_union_pw_aff_apply_multi_aff
,
5662 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }]",
5663 "[N] -> { C[a] -> D[a + N] }",
5664 "[N] -> D[{ A[i,j] -> [i + N]; B[i,j] -> [j + N] }] " },
5665 { &isl_multi_union_pw_aff_apply_multi_aff
,
5669 { &isl_multi_union_pw_aff_apply_multi_aff
,
5670 "[N] -> (C[] : { : N >= 0 })",
5672 "[N] -> (D[] : { : N >= 0 })" },
5673 { &isl_multi_union_pw_aff_apply_multi_aff
,
5675 "[N] -> { C[] -> D[N] }",
5676 "[N] -> D[{ [N] }]" },
5677 { &isl_multi_union_pw_aff_apply_multi_aff
,
5678 "(C[] : { A[i,j] : i >= j })",
5680 "(D[] : { A[i,j] : i >= j })" },
5681 { &isl_multi_union_pw_aff_apply_multi_aff
,
5682 "[N] -> (C[] : { A[i,j] : N >= 0 })",
5684 "[N] -> (D[] : { A[i,j] : N >= 0 })" },
5685 { &isl_multi_union_pw_aff_apply_multi_aff
,
5686 "(C[] : { A[i,j] : i >= j })",
5687 "[N] -> { C[] -> D[N] }",
5688 "[N] -> (D[{ A[i,j] -> [N] : i >= j }])" },
5691 /* Perform some basic tests of binary operations on
5692 * pairs of isl_multi_union_pw_aff and isl_multi_aff objects.
5694 static int test_mupa_ma(isl_ctx
*ctx
)
5698 isl_multi_union_pw_aff
*mupa
, *res
;
5701 for (i
= 0; i
< ARRAY_SIZE(mupa_ma_tests
); ++i
) {
5702 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5703 mupa_ma_tests
[i
].arg1
);
5704 ma
= isl_multi_aff_read_from_str(ctx
, mupa_ma_tests
[i
].arg2
);
5705 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5706 mupa_ma_tests
[i
].res
);
5707 mupa
= mupa_ma_tests
[i
].fn(mupa
, ma
);
5708 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
5709 isl_multi_union_pw_aff_free(mupa
);
5710 isl_multi_union_pw_aff_free(res
);
5714 isl_die(ctx
, isl_error_unknown
,
5715 "unexpected result", return -1);
5721 /* Inputs for basic tests of binary operations on
5722 * pairs of isl_multi_union_pw_aff and isl_pw_aff objects.
5723 * "fn" is the function that is tested.
5724 * "arg1" and "arg2" are string descriptions of the inputs.
5725 * "res" is a string description of the expected result.
5728 __isl_give isl_union_pw_aff
*(*fn
)(
5729 __isl_take isl_multi_union_pw_aff
*mupa
,
5730 __isl_take isl_pw_aff
*pa
);
5734 } mupa_pa_tests
[] = {
5735 { &isl_multi_union_pw_aff_apply_pw_aff
,
5736 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }]",
5737 "[N] -> { C[a] -> [a + N] }",
5738 "[N] -> { A[i,j] -> [i + N]; B[i,j] -> [j + N] }" },
5739 { &isl_multi_union_pw_aff_apply_pw_aff
,
5740 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }]",
5741 "{ C[a] -> [a] : a >= 0; C[a] -> [-a] : a < 0 }",
5742 "{ A[i,j] -> [i] : i >= 0; A[i,j] -> [-i] : i < 0; "
5743 "B[i,j] -> [j] : j >= 0; B[i,j] -> [-j] : j < 0 }" },
5744 { &isl_multi_union_pw_aff_apply_pw_aff
,
5746 "[N] -> { C[] -> [N] }",
5748 { &isl_multi_union_pw_aff_apply_pw_aff
,
5750 "[N] -> { C[] -> [N] : N >= 0; C[] -> [-N] : N < 0 }",
5751 "[N] -> { [N] : N >= 0; [-N] : N < 0 }" },
5752 { &isl_multi_union_pw_aff_apply_pw_aff
,
5753 "[N] -> (C[] : { : N >= 0 })",
5754 "[N] -> { C[] -> [N] }",
5755 "[N] -> { [N] : N >= 0 }" },
5756 { &isl_multi_union_pw_aff_apply_pw_aff
,
5757 "[N] -> (C[] : { : N >= 0 })",
5758 "[N] -> { C[] -> [N] : N >= 0; C[] -> [-N] : N < 0 }",
5759 "[N] -> { [N] : N >= 0 }" },
5760 { &isl_multi_union_pw_aff_apply_pw_aff
,
5761 "[N] -> (C[] : { : N >= 0 })",
5763 "[N] -> { [0] : N >= 0 }" },
5764 { &isl_multi_union_pw_aff_apply_pw_aff
,
5765 "(C[] : { A[i,j] : i >= j })",
5766 "[N] -> { C[] -> [N] }",
5767 "[N] -> { A[i,j] -> [N] : i >= j }" },
5768 { &isl_multi_union_pw_aff_apply_pw_aff
,
5769 "(C[] : { A[i,j] : i >= j })",
5770 "[N] -> { C[] -> [N] : N >= 0 }",
5771 "[N] -> { A[i,j] -> [N] : i >= j and N >= 0 }" },
5774 /* Perform some basic tests of binary operations on
5775 * pairs of isl_multi_union_pw_aff and isl_pw_aff objects.
5777 static int test_mupa_pa(isl_ctx
*ctx
)
5781 isl_multi_union_pw_aff
*mupa
;
5782 isl_union_pw_aff
*upa
, *res
;
5785 for (i
= 0; i
< ARRAY_SIZE(mupa_pa_tests
); ++i
) {
5786 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5787 mupa_pa_tests
[i
].arg1
);
5788 pa
= isl_pw_aff_read_from_str(ctx
, mupa_pa_tests
[i
].arg2
);
5789 res
= isl_union_pw_aff_read_from_str(ctx
,
5790 mupa_pa_tests
[i
].res
);
5791 upa
= mupa_pa_tests
[i
].fn(mupa
, pa
);
5792 ok
= isl_union_pw_aff_plain_is_equal(upa
, res
);
5793 isl_union_pw_aff_free(upa
);
5794 isl_union_pw_aff_free(res
);
5798 isl_die(ctx
, isl_error_unknown
,
5799 "unexpected result", return -1);
5805 /* Inputs for basic tests of binary operations on
5806 * pairs of isl_multi_union_pw_aff and isl_pw_multi_aff objects.
5807 * "fn" is the function that is tested.
5808 * "arg1" and "arg2" are string descriptions of the inputs.
5809 * "res" is a string description of the expected result.
5812 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5813 __isl_take isl_multi_union_pw_aff
*mupa
,
5814 __isl_take isl_pw_multi_aff
*pma
);
5818 } mupa_pma_tests
[] = {
5819 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5820 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }, "
5821 "{ A[i,j] -> [j]; B[i,j] -> [i] }]",
5822 "{ C[a,b] -> D[b,a] }",
5823 "D[{ A[i,j] -> [j]; B[i,j] -> [i] }, "
5824 "{ A[i,j] -> [i]; B[i,j] -> [j] }]" },
5825 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5826 "C[{ A[i,j] -> [i] : i >= 0; B[i,j] -> [j] }, "
5827 "{ A[i,j] -> [j]; B[i,j] -> [i] }]",
5828 "{ C[a,b] -> D[b,a] }",
5829 "D[{ A[i,j] -> [j] : i >= 0; B[i,j] -> [i] }, "
5830 "{ A[i,j] -> [i] : i >= 0; B[i,j] -> [j] }]" },
5831 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5832 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }]",
5833 "[N] -> { C[a] -> D[a + N] }",
5834 "[N] -> D[{ A[i,j] -> [i + N]; B[i,j] -> [j + N] }]" },
5835 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5836 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }]",
5837 "{ C[a] -> D[a] : a >= 0; C[a] -> D[-a] : a < 0 }",
5838 "D[{ A[i,j] -> [i] : i >= 0; A[i,j] -> [-i] : i < 0; "
5839 "B[i,j] -> [j] : j >= 0; B[i,j] -> [-j] : j < 0 }]" },
5840 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5841 "C[{ A[i,j] -> [i]; B[i,j] -> [j] }, "
5842 "{ A[i,j] -> [j]; B[i,j] -> [i] }]",
5843 "{ C[a,b] -> D[a,b] : a >= b; C[a,b] -> D[b,a] : a < b }",
5844 "D[{ A[i,j] -> [i] : i >= j; A[i,j] -> [j] : i < j; "
5845 "B[i,j] -> [j] : i <= j; B[i,j] -> [i] : i > j }, "
5846 "{ A[i,j] -> [j] : i >= j; A[i,j] -> [i] : i < j; "
5847 "B[i,j] -> [i] : i <= j; B[i,j] -> [j] : i > j }]" },
5848 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5852 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5853 "[N] -> (C[] : { : N >= 0 })",
5855 "[N] -> (D[] : { : N >= 0 })" },
5856 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5858 "[N] -> { C[] -> D[N] }",
5859 "[N] -> D[{ [N] }]" },
5860 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5861 "(C[] : { A[i,j] : i >= j })",
5863 "(D[] : { A[i,j] : i >= j })" },
5864 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5865 "[N] -> (C[] : { A[i,j] : N >= 0 })",
5867 "[N] -> (D[] : { A[i,j] : N >= 0 })" },
5868 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5869 "(C[] : { A[i,j] : i >= j })",
5870 "[N] -> { C[] -> D[N] }",
5871 "[N] -> (D[{ A[i,j] -> [N] : i >= j }])" },
5872 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5874 "[N] -> { C[] -> D[N] : N >= 0; C[] -> D[-N] : N < 0 }",
5875 "[N] -> D[{ [N] : N >= 0; [-N] : N < 0 }]" },
5876 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5877 "[N] -> (C[] : { : N >= 0 })",
5878 "[N] -> { C[] -> D[N] }",
5879 "[N] -> D[{ [N] : N >= 0 }]" },
5880 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5881 "[N] -> (C[] : { : N >= 0 })",
5882 "[N] -> { C[] -> D[N] : N >= 0; C[] -> D[-N] : N < 0 }",
5883 "[N] -> D[{ [N] : N >= 0 }]" },
5884 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5885 "[N] -> (C[] : { : N >= 0 })",
5887 "[N] -> D[{ [0] : N >= 0 }]" },
5888 { &isl_multi_union_pw_aff_apply_pw_multi_aff
,
5889 "(C[] : { A[i,j] : i >= j })",
5890 "[N] -> { C[] -> D[N] : N >= 0 }",
5891 "[N] -> D[{ A[i,j] -> [N] : i >= j and N >= 0 }]" },
5894 /* Perform some basic tests of binary operations on
5895 * pairs of isl_multi_union_pw_aff and isl_pw_multi_aff objects.
5897 static int test_mupa_pma(isl_ctx
*ctx
)
5901 isl_multi_union_pw_aff
*mupa
, *res
;
5902 isl_pw_multi_aff
*pma
;
5904 for (i
= 0; i
< ARRAY_SIZE(mupa_pma_tests
); ++i
) {
5905 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
5906 mupa_pma_tests
[i
].arg1
);
5907 pma
= isl_pw_multi_aff_read_from_str(ctx
,
5908 mupa_pma_tests
[i
].arg2
);
5909 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
5910 mupa_pma_tests
[i
].res
);
5911 mupa
= mupa_pma_tests
[i
].fn(mupa
, pma
);
5912 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
5913 isl_multi_union_pw_aff_free(mupa
);
5914 isl_multi_union_pw_aff_free(res
);
5918 isl_die(ctx
, isl_error_unknown
,
5919 "unexpected result", return -1);
5925 /* Inputs for basic tests of binary operations on
5926 * pairs of isl_multi_union_pw_aff and isl_union_pw_multi_aff objects.
5927 * "fn" is the function that is tested.
5928 * "arg1" and "arg2" are string descriptions of the inputs.
5929 * "res" is a string description of the expected result.
5932 __isl_give isl_multi_union_pw_aff
*(*fn
)(
5933 __isl_take isl_multi_union_pw_aff
*mupa
,
5934 __isl_take isl_union_pw_multi_aff
*upma
);
5938 } mupa_upma_tests
[] = {
5939 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5940 "C[{ B[i,j] -> [i + 2j] }]", "{ A[a,b] -> B[b,a] }",
5941 "C[{ A[a,b] -> [b + 2a] }]" },
5942 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5943 "C[{ B[i,j] -> [i + 2j] }]",
5944 "{ A[a,b] -> B[b,a] : b > a }",
5945 "C[{ A[a,b] -> [b + 2a] : b > a }]" },
5946 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5947 "C[{ B[i,j] -> [i + 2j] : j > 4 }]",
5948 "{ A[a,b] -> B[b,a] : b > a }",
5949 "C[{ A[a,b] -> [b + 2a] : b > a > 4 }]" },
5950 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5951 "C[{ B[i,j] -> [i + 2j] }]",
5952 "{ A[a,b] -> B[b,a] : a > b; A[a,b] -> B[a,b] : a <= b }",
5953 "C[{ A[a,b] -> [b + 2a] : a > b; A[a,b] -> [a + 2b] : a <= b }]" },
5954 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5955 "(C[] : { B[a,b] })",
5956 "{ A[a,b] -> B[b,a] }",
5957 "(C[] : { A[a,b] })" },
5958 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5959 "(C[] : { B[a,b] })",
5960 "{ B[a,b] -> A[b,a] }",
5962 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5963 "(C[] : { B[a,b] })",
5964 "{ A[a,b] -> B[b,a] : a > b }",
5965 "(C[] : { A[a,b] : a > b })" },
5966 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5967 "(C[] : { B[a,b] : a > b })",
5968 "{ A[a,b] -> B[b,a] }",
5969 "(C[] : { A[a,b] : b > a })" },
5970 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5971 "[N] -> (C[] : { B[a,b] : a > N })",
5972 "{ A[a,b] -> B[b,a] : a > b }",
5973 "[N] -> (C[] : { A[a,b] : a > b > N })" },
5974 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5975 "(C[] : { B[a,b] : a > b })",
5976 "[N] -> { A[a,b] -> B[b,a] : a > N }",
5977 "[N] -> (C[] : { A[a,b] : b > a > N })" },
5978 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5980 "{ A[a,b] -> B[b,a] }",
5982 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5983 "[N] -> (C[] : { : N >= 0 })",
5984 "{ A[a,b] -> B[b,a] }",
5985 "[N] -> (C[] : { : N >= 0 })" },
5986 { &isl_multi_union_pw_aff_pullback_union_pw_multi_aff
,
5988 "[N] -> { A[a,b] -> B[b,a] : N >= 0 }",
5989 "[N] -> (C[] : { : N >= 0 })" },
5992 /* Perform some basic tests of binary operations on
5993 * pairs of isl_multi_union_pw_aff and isl_union_pw_multi_aff objects.
5995 static int test_mupa_upma(isl_ctx
*ctx
)
5999 isl_multi_union_pw_aff
*mupa
, *res
;
6000 isl_union_pw_multi_aff
*upma
;
6002 for (i
= 0; i
< ARRAY_SIZE(mupa_upma_tests
); ++i
) {
6003 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
6004 mupa_upma_tests
[i
].arg1
);
6005 upma
= isl_union_pw_multi_aff_read_from_str(ctx
,
6006 mupa_upma_tests
[i
].arg2
);
6007 res
= isl_multi_union_pw_aff_read_from_str(ctx
,
6008 mupa_upma_tests
[i
].res
);
6009 mupa
= mupa_upma_tests
[i
].fn(mupa
, upma
);
6010 ok
= isl_multi_union_pw_aff_plain_is_equal(mupa
, res
);
6011 isl_multi_union_pw_aff_free(mupa
);
6012 isl_multi_union_pw_aff_free(res
);
6016 isl_die(ctx
, isl_error_unknown
,
6017 "unexpected result", return -1);
6023 /* Check that the input tuple of an isl_aff can be set properly.
6025 static isl_stat
test_aff_set_tuple_id(isl_ctx
*ctx
)
6031 aff
= isl_aff_read_from_str(ctx
, "{ [x] -> [x + 1] }");
6032 id
= isl_id_alloc(ctx
, "A", NULL
);
6033 aff
= isl_aff_set_tuple_id(aff
, isl_dim_in
, id
);
6034 equal
= aff_check_plain_equal(aff
, "{ A[x] -> [x + 1] }");
6037 return isl_stat_error
;
6042 int test_aff(isl_ctx
*ctx
)
6047 isl_local_space
*ls
;
6051 if (test_upa(ctx
) < 0)
6053 if (test_bin_aff(ctx
) < 0)
6055 if (test_bin_pw_aff(ctx
) < 0)
6057 if (test_bin_upma(ctx
) < 0)
6059 if (test_bin_upma_fail(ctx
) < 0)
6061 if (test_un_mpa(ctx
) < 0)
6063 if (test_bin_mpa(ctx
) < 0)
6065 if (test_un_mupa(ctx
) < 0)
6067 if (test_bin_mupa(ctx
) < 0)
6069 if (test_mupa_set(ctx
) < 0)
6071 if (test_mupa_uset(ctx
) < 0)
6073 if (test_mupa_ma(ctx
) < 0)
6075 if (test_mupa_pa(ctx
) < 0)
6077 if (test_mupa_pma(ctx
) < 0)
6079 if (test_mupa_upma(ctx
) < 0)
6082 space
= isl_space_set_alloc(ctx
, 0, 1);
6083 ls
= isl_local_space_from_space(space
);
6084 aff
= isl_aff_zero_on_domain(ls
);
6086 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
6087 aff
= isl_aff_scale_down_ui(aff
, 3);
6088 aff
= isl_aff_floor(aff
);
6089 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
6090 aff
= isl_aff_scale_down_ui(aff
, 2);
6091 aff
= isl_aff_floor(aff
);
6092 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
6095 set
= isl_set_read_from_str(ctx
, str
);
6096 aff
= isl_aff_gist(aff
, set
);
6098 aff
= isl_aff_add_constant_si(aff
, -16);
6099 zero
= isl_aff_plain_is_zero(aff
);
6105 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6107 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
6108 aff
= isl_aff_scale_down_ui(aff
, 64);
6109 aff
= isl_aff_floor(aff
);
6110 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
6115 if (test_aff_set_tuple_id(ctx
) < 0)
6121 /* Check that "pa" consists of a single expression.
6123 static int check_single_piece(isl_ctx
*ctx
, __isl_take isl_pw_aff
*pa
)
6127 n
= isl_pw_aff_n_piece(pa
);
6128 isl_pw_aff_free(pa
);
6133 isl_die(ctx
, isl_error_unknown
, "expecting single expression",
6139 /* Check that the computation below results in a single expression.
6140 * One or two expressions may result depending on which constraint
6141 * ends up being considered as redundant with respect to the other
6142 * constraints after the projection that is performed internally
6143 * by isl_set_dim_min.
6145 static int test_dim_max_1(isl_ctx
*ctx
)
6151 str
= "[n] -> { [a, b] : n >= 0 and 4a >= -4 + n and b >= 0 and "
6152 "-4a <= b <= 3 and b < n - 4a }";
6153 set
= isl_set_read_from_str(ctx
, str
);
6154 pa
= isl_set_dim_min(set
, 0);
6155 return check_single_piece(ctx
, pa
);
6158 /* Check that the computation below results in a single expression.
6159 * The PIP problem corresponding to these constraints has a row
6160 * that causes a split of the solution domain. The solver should
6161 * first pick rows that split off empty parts such that the actual
6162 * solution domain does not get split.
6163 * Note that the description contains some redundant constraints.
6164 * If these constraints get removed first, then the row mentioned
6165 * above does not appear in the PIP problem.
6167 static int test_dim_max_2(isl_ctx
*ctx
)
6173 str
= "[P, N] -> { [a] : a < N and a >= 0 and N > P and a <= P and "
6174 "N > 0 and P >= 0 }";
6175 set
= isl_set_read_from_str(ctx
, str
);
6176 pa
= isl_set_dim_max(set
, 0);
6177 return check_single_piece(ctx
, pa
);
6180 int test_dim_max(isl_ctx
*ctx
)
6184 isl_set
*set1
, *set2
;
6189 if (test_dim_max_1(ctx
) < 0)
6191 if (test_dim_max_2(ctx
) < 0)
6194 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
6195 set
= isl_set_read_from_str(ctx
, str
);
6196 pwaff
= isl_set_dim_max(set
, 0);
6197 set1
= isl_set_from_pw_aff(pwaff
);
6198 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
6199 set2
= isl_set_read_from_str(ctx
, str
);
6200 equal
= isl_set_is_equal(set1
, set2
);
6206 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6208 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
6209 set
= isl_set_read_from_str(ctx
, str
);
6210 pwaff
= isl_set_dim_max(set
, 0);
6211 set1
= isl_set_from_pw_aff(pwaff
);
6212 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
6213 set2
= isl_set_read_from_str(ctx
, str
);
6214 equal
= isl_set_is_equal(set1
, set2
);
6220 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6222 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
6223 set
= isl_set_read_from_str(ctx
, str
);
6224 pwaff
= isl_set_dim_max(set
, 0);
6225 set1
= isl_set_from_pw_aff(pwaff
);
6226 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
6227 set2
= isl_set_read_from_str(ctx
, str
);
6228 equal
= isl_set_is_equal(set1
, set2
);
6234 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6236 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
6237 "0 <= i < N and 0 <= j < M }";
6238 map
= isl_map_read_from_str(ctx
, str
);
6239 set
= isl_map_range(map
);
6241 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
6242 set1
= isl_set_from_pw_aff(pwaff
);
6243 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
6244 set2
= isl_set_read_from_str(ctx
, str
);
6245 equal
= isl_set_is_equal(set1
, set2
);
6249 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
6250 set1
= isl_set_from_pw_aff(pwaff
);
6251 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
6252 set2
= isl_set_read_from_str(ctx
, str
);
6253 if (equal
>= 0 && equal
)
6254 equal
= isl_set_is_equal(set1
, set2
);
6263 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6265 /* Check that solutions are properly merged. */
6266 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
6267 "c <= -1 + n - 4a - 2b and c >= -2b and "
6268 "4a >= -4 + n and c >= 0 }";
6269 set
= isl_set_read_from_str(ctx
, str
);
6270 pwaff
= isl_set_dim_min(set
, 2);
6271 set1
= isl_set_from_pw_aff(pwaff
);
6272 str
= "[n] -> { [(0)] : n >= 1 }";
6273 set2
= isl_set_read_from_str(ctx
, str
);
6274 equal
= isl_set_is_equal(set1
, set2
);
6281 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6283 /* Check that empty solution lie in the right space. */
6284 str
= "[n] -> { [t,a] : 1 = 0 }";
6285 set
= isl_set_read_from_str(ctx
, str
);
6286 pwaff
= isl_set_dim_max(set
, 0);
6287 set1
= isl_set_from_pw_aff(pwaff
);
6288 str
= "[n] -> { [t] : 1 = 0 }";
6289 set2
= isl_set_read_from_str(ctx
, str
);
6290 equal
= isl_set_is_equal(set1
, set2
);
6297 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6302 /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
6304 static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff
*pma
,
6308 isl_pw_multi_aff
*pma2
;
6314 ctx
= isl_pw_multi_aff_get_ctx(pma
);
6315 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
6316 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma2
);
6317 isl_pw_multi_aff_free(pma2
);
6322 /* Check that "pma" is obviously equal to the isl_pw_multi_aff
6323 * represented by "str".
6325 static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff
*pma
,
6330 equal
= pw_multi_aff_plain_is_equal(pma
, str
);
6334 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_unknown
,
6335 "result not as expected", return -1);
6339 /* Basic test for isl_pw_multi_aff_product.
6341 * Check that multiple pieces are properly handled.
6343 static int test_product_pma(isl_ctx
*ctx
)
6347 isl_pw_multi_aff
*pma1
, *pma2
;
6349 str
= "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
6350 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
6351 str
= "{ C[] -> D[] }";
6352 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
6353 pma1
= isl_pw_multi_aff_product(pma1
, pma2
);
6354 str
= "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
6355 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
6356 equal
= pw_multi_aff_check_plain_equal(pma1
, str
);
6357 isl_pw_multi_aff_free(pma1
);
6364 int test_product(isl_ctx
*ctx
)
6368 isl_union_set
*uset1
, *uset2
;
6372 set
= isl_set_read_from_str(ctx
, str
);
6373 set
= isl_set_product(set
, isl_set_copy(set
));
6374 ok
= isl_set_is_wrapping(set
);
6379 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6382 uset1
= isl_union_set_read_from_str(ctx
, str
);
6383 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
6384 str
= "{ [[] -> []] }";
6385 uset2
= isl_union_set_read_from_str(ctx
, str
);
6386 ok
= isl_union_set_is_equal(uset1
, uset2
);
6387 isl_union_set_free(uset1
);
6388 isl_union_set_free(uset2
);
6392 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6394 if (test_product_pma(ctx
) < 0)
6400 /* Check that two sets are not considered disjoint just because
6401 * they have a different set of (named) parameters.
6403 static int test_disjoint(isl_ctx
*ctx
)
6406 isl_set
*set
, *set2
;
6409 str
= "[n] -> { [[]->[]] }";
6410 set
= isl_set_read_from_str(ctx
, str
);
6411 str
= "{ [[]->[]] }";
6412 set2
= isl_set_read_from_str(ctx
, str
);
6413 disjoint
= isl_set_is_disjoint(set
, set2
);
6419 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6424 /* Inputs for isl_pw_multi_aff_is_equal tests.
6425 * "f1" and "f2" are the two function that need to be compared.
6426 * "equal" is the expected result.
6432 } pma_equal_tests
[] = {
6433 { 1, "[N] -> { [floor(N/2)] : 0 <= N <= 1 }",
6434 "[N] -> { [0] : 0 <= N <= 1 }" },
6435 { 1, "[N] -> { [floor(N/2)] : 0 <= N <= 2 }",
6436 "[N] -> { [0] : 0 <= N <= 1; [1] : N = 2 }" },
6437 { 0, "[N] -> { [floor(N/2)] : 0 <= N <= 2 }",
6438 "[N] -> { [0] : 0 <= N <= 1 }" },
6439 { 0, "{ [NaN] }", "{ [NaN] }" },
6442 int test_equal(isl_ctx
*ctx
)
6446 isl_set
*set
, *set2
;
6450 set
= isl_set_read_from_str(ctx
, str
);
6452 set2
= isl_set_read_from_str(ctx
, str
);
6453 equal
= isl_set_is_equal(set
, set2
);
6459 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6461 for (i
= 0; i
< ARRAY_SIZE(pma_equal_tests
); ++i
) {
6462 int expected
= pma_equal_tests
[i
].equal
;
6463 isl_pw_multi_aff
*f1
, *f2
;
6465 f1
= isl_pw_multi_aff_read_from_str(ctx
, pma_equal_tests
[i
].f1
);
6466 f2
= isl_pw_multi_aff_read_from_str(ctx
, pma_equal_tests
[i
].f2
);
6467 equal
= isl_pw_multi_aff_is_equal(f1
, f2
);
6468 isl_pw_multi_aff_free(f1
);
6469 isl_pw_multi_aff_free(f2
);
6472 if (equal
!= expected
)
6473 isl_die(ctx
, isl_error_unknown
,
6474 "unexpected equality result", return -1);
6480 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
6481 enum isl_dim_type type
, unsigned pos
, int fixed
)
6485 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
6492 isl_die(ctx
, isl_error_unknown
,
6493 "map not detected as fixed", return -1);
6495 isl_die(ctx
, isl_error_unknown
,
6496 "map detected as fixed", return -1);
6499 int test_fixed(isl_ctx
*ctx
)
6504 str
= "{ [i] -> [i] }";
6505 map
= isl_map_read_from_str(ctx
, str
);
6506 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
6508 str
= "{ [i] -> [1] }";
6509 map
= isl_map_read_from_str(ctx
, str
);
6510 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
6512 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
6513 map
= isl_map_read_from_str(ctx
, str
);
6514 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
6516 map
= isl_map_read_from_str(ctx
, str
);
6517 map
= isl_map_neg(map
);
6518 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
6524 struct isl_vertices_test_data
{
6527 const char *vertex
[6];
6528 } vertices_tests
[] = {
6529 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
6530 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
6531 { "{ A[t, i] : t = 14 and i = 1 }",
6532 1, { "{ A[14, 1] }" } },
6533 { "[n, m] -> { [a, b, c] : b <= a and a <= n and b > 0 and c >= b and "
6534 "c <= m and m <= n and m > 0 }",
6536 "[n, m] -> { [n, m, m] : 0 < m <= n }",
6537 "[n, m] -> { [n, 1, m] : 0 < m <= n }",
6538 "[n, m] -> { [n, 1, 1] : 0 < m <= n }",
6539 "[n, m] -> { [m, m, m] : 0 < m <= n }",
6540 "[n, m] -> { [1, 1, m] : 0 < m <= n }",
6541 "[n, m] -> { [1, 1, 1] : 0 < m <= n }"
6545 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
6547 static isl_stat
find_vertex(__isl_take isl_vertex
*vertex
, void *user
)
6549 struct isl_vertices_test_data
*data
= user
;
6552 isl_basic_set
*bset
;
6553 isl_pw_multi_aff
*pma
;
6557 ctx
= isl_vertex_get_ctx(vertex
);
6558 bset
= isl_vertex_get_domain(vertex
);
6559 ma
= isl_vertex_get_expr(vertex
);
6560 pma
= isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset
), ma
);
6562 for (i
= 0; i
< data
->n
; ++i
) {
6563 isl_pw_multi_aff
*pma_i
;
6565 pma_i
= isl_pw_multi_aff_read_from_str(ctx
, data
->vertex
[i
]);
6566 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma_i
);
6567 isl_pw_multi_aff_free(pma_i
);
6569 if (equal
< 0 || equal
)
6573 isl_pw_multi_aff_free(pma
);
6574 isl_vertex_free(vertex
);
6577 return isl_stat_error
;
6579 return equal
? isl_stat_ok
: isl_stat_error
;
6582 int test_vertices(isl_ctx
*ctx
)
6586 for (i
= 0; i
< ARRAY_SIZE(vertices_tests
); ++i
) {
6587 isl_basic_set
*bset
;
6588 isl_vertices
*vertices
;
6592 bset
= isl_basic_set_read_from_str(ctx
, vertices_tests
[i
].set
);
6593 vertices
= isl_basic_set_compute_vertices(bset
);
6594 n
= isl_vertices_get_n_vertices(vertices
);
6595 if (vertices_tests
[i
].n
!= n
)
6597 if (isl_vertices_foreach_vertex(vertices
, &find_vertex
,
6598 &vertices_tests
[i
]) < 0)
6600 isl_vertices_free(vertices
);
6601 isl_basic_set_free(bset
);
6606 isl_die(ctx
, isl_error_unknown
, "unexpected vertices",
6613 int test_union_pw(isl_ctx
*ctx
)
6617 isl_union_set
*uset
;
6618 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
6620 str
= "{ [x] -> x^2 }";
6621 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
6622 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
6623 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
6624 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
6625 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
6626 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
6627 isl_union_pw_qpolynomial_free(upwqp1
);
6628 isl_union_pw_qpolynomial_free(upwqp2
);
6632 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
6637 /* Inputs for basic tests of functions that select
6638 * subparts of the domain of an isl_multi_union_pw_aff.
6639 * "fn" is the function that is tested.
6640 * "arg" is a string description of the input.
6641 * "res" is a string description of the expected result.
6644 __isl_give isl_union_set
*(*fn
)(
6645 __isl_take isl_multi_union_pw_aff
*mupa
);
6648 } un_locus_tests
[] = {
6649 { &isl_multi_union_pw_aff_zero_union_set
,
6650 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }]",
6651 "{ A[0,j]; B[0,j] }" },
6652 { &isl_multi_union_pw_aff_zero_union_set
,
6653 "F[{ A[i,j] -> [i-j]; B[i,j] -> [i-j] : i >= 0 }]",
6654 "{ A[i,i]; B[i,i] : i >= 0 }" },
6655 { &isl_multi_union_pw_aff_zero_union_set
,
6656 "(F[] : { A[i,j]; B[i,i] : i >= 0 })",
6657 "{ A[i,j]; B[i,i] : i >= 0 }" },
6660 /* Perform some basic tests of functions that select
6661 * subparts of the domain of an isl_multi_union_pw_aff.
6663 static int test_un_locus(isl_ctx
*ctx
)
6667 isl_union_set
*uset
, *res
;
6668 isl_multi_union_pw_aff
*mupa
;
6670 for (i
= 0; i
< ARRAY_SIZE(un_locus_tests
); ++i
) {
6671 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
6672 un_locus_tests
[i
].arg
);
6673 res
= isl_union_set_read_from_str(ctx
, un_locus_tests
[i
].res
);
6674 uset
= un_locus_tests
[i
].fn(mupa
);
6675 ok
= isl_union_set_is_equal(uset
, res
);
6676 isl_union_set_free(uset
);
6677 isl_union_set_free(res
);
6681 isl_die(ctx
, isl_error_unknown
,
6682 "unexpected result", return -1);
6688 /* Inputs for basic tests of functions that select
6689 * subparts of an isl_union_map based on a relation
6690 * specified by an isl_multi_union_pw_aff.
6691 * "fn" is the function that is tested.
6692 * "arg1" and "arg2" are string descriptions of the inputs.
6693 * "res" is a string description of the expected result.
6696 __isl_give isl_union_map
*(*fn
)(
6697 __isl_take isl_union_map
*umap
,
6698 __isl_take isl_multi_union_pw_aff
*mupa
);
6702 } bin_locus_tests
[] = {
6703 { &isl_union_map_eq_at_multi_union_pw_aff
,
6704 "{ A[i,j] -> B[i',j'] }",
6705 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }]",
6706 "{ A[i,j] -> B[i,j'] }" },
6707 { &isl_union_map_eq_at_multi_union_pw_aff
,
6708 "{ A[i,j] -> B[i',j'] }",
6709 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }, "
6710 "{ A[i,j] -> [j]; B[i,j] -> [j] }]",
6711 "{ A[i,j] -> B[i,j] }" },
6712 { &isl_union_map_eq_at_multi_union_pw_aff
,
6713 "{ A[i,j] -> B[i',j']; A[i,j] -> C[i',j'] }",
6714 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }]",
6715 "{ A[i,j] -> B[i,j'] }" },
6716 { &isl_union_map_eq_at_multi_union_pw_aff
,
6717 "{ A[i,j] -> B[i',j']; A[i,j] -> C[i',j'] }",
6718 "F[{ A[i,j] -> [i]; B[i,j] -> [i]; C[i,j] -> [0] }]",
6719 "{ A[i,j] -> B[i,j']; A[0,j] -> C[i',j'] }" },
6720 { &isl_union_map_eq_at_multi_union_pw_aff
,
6721 "{ A[i,j] -> B[i',j'] }",
6722 "F[{ A[i,j] -> [i] : i > j; B[i,j] -> [i] }]",
6723 "{ A[i,j] -> B[i,j'] : i > j }" },
6724 { &isl_union_map_lex_lt_at_multi_union_pw_aff
,
6725 "{ A[i,j] -> B[i',j'] }",
6726 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }, "
6727 "{ A[i,j] -> [j]; B[i,j] -> [j] }]",
6728 "{ A[i,j] -> B[i',j'] : i,j << i',j' }" },
6729 { &isl_union_map_lex_gt_at_multi_union_pw_aff
,
6730 "{ A[i,j] -> B[i',j'] }",
6731 "F[{ A[i,j] -> [i]; B[i,j] -> [i] }, "
6732 "{ A[i,j] -> [j]; B[i,j] -> [j] }]",
6733 "{ A[i,j] -> B[i',j'] : i,j >> i',j' }" },
6734 { &isl_union_map_eq_at_multi_union_pw_aff
,
6735 "{ A[i,j] -> B[i',j']; A[i,j] -> C[i',j'] }",
6736 "(F[] : { A[i,j]; B[i,j] })",
6737 "{ A[i,j] -> B[i',j'] }" },
6738 { &isl_union_map_eq_at_multi_union_pw_aff
,
6739 "{ A[i,j] -> B[i',j'] }",
6740 "(F[] : { A[i,j] : i > j; B[i,j] : i < j })",
6741 "{ A[i,j] -> B[i',j'] : i > j and i' < j' }" },
6742 { &isl_union_map_eq_at_multi_union_pw_aff
,
6743 "[N] -> { A[i,j] -> B[i',j'] : i,i' <= N }",
6744 "(F[] : { A[i,j] : i > j; B[i,j] : i < j })",
6745 "[N] -> { A[i,j] -> B[i',j'] : i > j and i' < j' and i,i' <= N }" },
6746 { &isl_union_map_eq_at_multi_union_pw_aff
,
6747 "{ A[i,j] -> B[i',j'] }",
6748 "[N] -> (F[] : { A[i,j] : i < N; B[i,j] : i < N })",
6749 "[N] -> { A[i,j] -> B[i',j'] : i,i' < N }" },
6750 { &isl_union_map_eq_at_multi_union_pw_aff
,
6751 "{ A[i,j] -> B[i',j'] }",
6752 "[N] -> (F[] : { : N >= 0 })",
6753 "[N] -> { A[i,j] -> B[i',j'] : N >= 0 }" },
6756 /* Perform some basic tests of functions that select
6757 * subparts of an isl_union_map based on a relation
6758 * specified by an isl_multi_union_pw_aff.
6760 static int test_bin_locus(isl_ctx
*ctx
)
6764 isl_union_map
*umap
, *res
;
6765 isl_multi_union_pw_aff
*mupa
;
6767 for (i
= 0; i
< ARRAY_SIZE(bin_locus_tests
); ++i
) {
6768 umap
= isl_union_map_read_from_str(ctx
,
6769 bin_locus_tests
[i
].arg1
);
6770 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
,
6771 bin_locus_tests
[i
].arg2
);
6772 res
= isl_union_map_read_from_str(ctx
, bin_locus_tests
[i
].res
);
6773 umap
= bin_locus_tests
[i
].fn(umap
, mupa
);
6774 ok
= isl_union_map_is_equal(umap
, res
);
6775 isl_union_map_free(umap
);
6776 isl_union_map_free(res
);
6780 isl_die(ctx
, isl_error_unknown
,
6781 "unexpected result", return -1);
6787 /* Perform basic locus tests.
6789 static int test_locus(isl_ctx
*ctx
)
6791 if (test_un_locus(ctx
) < 0)
6793 if (test_bin_locus(ctx
) < 0)
6798 /* Test that isl_union_pw_qpolynomial_eval picks up the function
6799 * defined over the correct domain space.
6801 static int test_eval_1(isl_ctx
*ctx
)
6806 isl_union_pw_qpolynomial
*upwqp
;
6810 str
= "{ A[x] -> x^2; B[x] -> -x^2 }";
6811 upwqp
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
6813 set
= isl_set_read_from_str(ctx
, str
);
6814 pnt
= isl_set_sample_point(set
);
6815 v
= isl_union_pw_qpolynomial_eval(upwqp
, pnt
);
6816 cmp
= isl_val_cmp_si(v
, 36);
6822 isl_die(ctx
, isl_error_unknown
, "unexpected value", return -1);
6827 /* Check that isl_qpolynomial_eval handles getting called on a void point.
6829 static int test_eval_2(isl_ctx
*ctx
)
6834 isl_qpolynomial
*qp
;
6838 str
= "{ A[x] -> [x] }";
6839 qp
= isl_qpolynomial_from_aff(isl_aff_read_from_str(ctx
, str
));
6840 str
= "{ A[x] : false }";
6841 set
= isl_set_read_from_str(ctx
, str
);
6842 pnt
= isl_set_sample_point(set
);
6843 v
= isl_qpolynomial_eval(qp
, pnt
);
6844 ok
= isl_val_is_nan(v
);
6850 isl_die(ctx
, isl_error_unknown
, "expecting NaN", return -1);
6855 /* Inputs for isl_pw_aff_eval test.
6856 * "f" is the affine function.
6857 * "p" is the point where the function should be evaluated.
6858 * "res" is the expected result.
6864 } aff_eval_tests
[] = {
6865 { "{ [i] -> [2 * i] }", "{ [4] }", "8" },
6866 { "{ [i] -> [2 * i] }", "{ [x] : false }", "NaN" },
6867 { "{ [i] -> [i + floor(i/2) + floor(i/3)] }", "{ [0] }", "0" },
6868 { "{ [i] -> [i + floor(i/2) + floor(i/3)] }", "{ [1] }", "1" },
6869 { "{ [i] -> [i + floor(i/2) + floor(i/3)] }", "{ [2] }", "3" },
6870 { "{ [i] -> [i + floor(i/2) + floor(i/3)] }", "{ [3] }", "5" },
6871 { "{ [i] -> [i + floor(i/2) + floor(i/3)] }", "{ [4] }", "7" },
6872 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [0] }", "0" },
6873 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [1] }", "0" },
6874 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [2] }", "0" },
6875 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [3] }", "0" },
6876 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [4] }", "1" },
6877 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [6] }", "1" },
6878 { "{ [i] -> [floor((3 * floor(i/2))/5)] }", "{ [8] }", "2" },
6879 { "{ [i] -> [i] : i > 0; [i] -> [-i] : i < 0 }", "{ [4] }", "4" },
6880 { "{ [i] -> [i] : i > 0; [i] -> [-i] : i < 0 }", "{ [-2] }", "2" },
6881 { "{ [i] -> [i] : i > 0; [i] -> [-i] : i < 0 }", "{ [0] }", "NaN" },
6882 { "[N] -> { [2 * N] }", "[N] -> { : N = 4 }", "8" },
6883 { "{ [i, j] -> [(i + j)/2] }", "{ [1, 1] }", "1" },
6884 { "{ [i, j] -> [(i + j)/2] }", "{ [1, 2] }", "3/2" },
6885 { "{ [i] -> [i] : i mod 2 = 0 }", "{ [4] }", "4" },
6886 { "{ [i] -> [i] : i mod 2 = 0 }", "{ [3] }", "NaN" },
6887 { "{ [i] -> [i] : i mod 2 = 0 }", "{ [x] : false }", "NaN" },
6890 /* Perform basic isl_pw_aff_eval tests.
6892 static int test_eval_aff(isl_ctx
*ctx
)
6896 for (i
= 0; i
< ARRAY_SIZE(aff_eval_tests
); ++i
) {
6903 pa
= isl_pw_aff_read_from_str(ctx
, aff_eval_tests
[i
].f
);
6904 set
= isl_set_read_from_str(ctx
, aff_eval_tests
[i
].p
);
6905 pnt
= isl_set_sample_point(set
);
6906 v
= isl_pw_aff_eval(pa
, pnt
);
6907 r
= val_check_equal(v
, aff_eval_tests
[i
].res
);
6915 /* Perform basic evaluation tests.
6917 static int test_eval(isl_ctx
*ctx
)
6919 if (test_eval_1(ctx
) < 0)
6921 if (test_eval_2(ctx
) < 0)
6923 if (test_eval_aff(ctx
) < 0)
6928 /* Descriptions of sets that are tested for reparsing after printing.
6930 const char *output_tests
[] = {
6931 "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }",
6934 "{ [x] : x mod 2 = 0 }",
6935 "{ [x] : x mod 2 = 1 }",
6936 "{ [x, y] : x mod 2 = 0 and 3*floor(y/2) < x }",
6937 "{ [y, x] : x mod 2 = 0 and 3*floor(y/2) < x }",
6938 "{ [x, y] : x mod 2 = 0 and 3*floor(y/2) = x + y }",
6939 "{ [y, x] : x mod 2 = 0 and 3*floor(y/2) = x + y }",
6940 "[n] -> { [y, x] : 2*((x + 2y) mod 3) = n }",
6941 "{ [x, y] : (2*floor(x/3) + 3*floor(y/4)) mod 5 = x }",
6944 /* Check that printing a set and reparsing a set from the printed output
6945 * results in the same set.
6947 static int test_output_set(isl_ctx
*ctx
)
6951 isl_set
*set1
, *set2
;
6954 for (i
= 0; i
< ARRAY_SIZE(output_tests
); ++i
) {
6955 set1
= isl_set_read_from_str(ctx
, output_tests
[i
]);
6956 str
= isl_set_to_str(set1
);
6957 set2
= isl_set_read_from_str(ctx
, str
);
6959 equal
= isl_set_is_equal(set1
, set2
);
6965 isl_die(ctx
, isl_error_unknown
,
6966 "parsed output not the same", return -1);
6972 int test_output(isl_ctx
*ctx
)
6980 if (test_output_set(ctx
) < 0)
6983 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
6984 pa
= isl_pw_aff_read_from_str(ctx
, str
);
6986 p
= isl_printer_to_str(ctx
);
6987 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
6988 p
= isl_printer_print_pw_aff(p
, pa
);
6989 s
= isl_printer_get_str(p
);
6990 isl_printer_free(p
);
6991 isl_pw_aff_free(pa
);
6995 equal
= !strcmp(s
, "4 * floord(x, 4) + 2 >= x ? 1 : 2");
7000 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
7005 int test_sample(isl_ctx
*ctx
)
7008 isl_basic_set
*bset1
, *bset2
;
7011 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
7012 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
7013 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
7014 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
7015 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
7016 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
7017 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
7018 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
7019 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
7020 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
7021 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
7022 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
7023 "d - 1073741821e and "
7024 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
7025 "3j >= 1 - a + b + 2e and "
7026 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
7027 "3i <= 4 - a + 4b - e and "
7028 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
7029 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
7030 "c <= -1 + a and 3i >= -2 - a + 3e and "
7031 "1073741822e <= 1073741823 - a + 1073741822b + c and "
7032 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
7033 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
7034 "1073741823e >= 1 + 1073741823b - d and "
7035 "3i >= 1073741823b + c - 1073741823e - f and "
7036 "3i >= 1 + 2b + e + 3g }";
7037 bset1
= isl_basic_set_read_from_str(ctx
, str
);
7038 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
7039 empty
= isl_basic_set_is_empty(bset2
);
7040 subset
= isl_basic_set_is_subset(bset2
, bset1
);
7041 isl_basic_set_free(bset1
);
7042 isl_basic_set_free(bset2
);
7043 if (empty
< 0 || subset
< 0)
7046 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
7048 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
7053 int test_fixed_power(isl_ctx
*ctx
)
7060 str
= "{ [i] -> [i + 1] }";
7061 map
= isl_map_read_from_str(ctx
, str
);
7062 exp
= isl_val_int_from_si(ctx
, 23);
7063 map
= isl_map_fixed_power_val(map
, exp
);
7064 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
7072 int test_slice(isl_ctx
*ctx
)
7078 str
= "{ [i] -> [j] }";
7079 map
= isl_map_read_from_str(ctx
, str
);
7080 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
7081 equal
= map_check_equal(map
, "{ [i] -> [i] }");
7086 str
= "{ [i] -> [j] }";
7087 map
= isl_map_read_from_str(ctx
, str
);
7088 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
7089 equal
= map_check_equal(map
, "{ [i] -> [j] }");
7094 str
= "{ [i] -> [j] }";
7095 map
= isl_map_read_from_str(ctx
, str
);
7096 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
7097 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
7102 str
= "{ [i] -> [j] }";
7103 map
= isl_map_read_from_str(ctx
, str
);
7104 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
7105 equal
= map_check_equal(map
, "{ [0] -> [j] }");
7110 str
= "{ [i] -> [j] }";
7111 map
= isl_map_read_from_str(ctx
, str
);
7112 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
7113 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
7118 str
= "{ [i] -> [j] }";
7119 map
= isl_map_read_from_str(ctx
, str
);
7120 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
7121 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
7129 int test_eliminate(isl_ctx
*ctx
)
7135 str
= "{ [i] -> [j] : i = 2j }";
7136 map
= isl_map_read_from_str(ctx
, str
);
7137 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
7138 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
7146 /* Check that isl_set_dim_residue_class detects that the values of j
7147 * in the set below are all odd and that it does not detect any spurious
7150 static int test_residue_class(isl_ctx
*ctx
)
7157 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
7158 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
7159 set
= isl_set_read_from_str(ctx
, str
);
7162 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
7164 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
7165 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
7166 res
= isl_stat_error
);
7174 int test_align_parameters(isl_ctx
*ctx
)
7178 isl_multi_aff
*ma1
, *ma2
;
7181 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
7182 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
7184 space
= isl_space_params_alloc(ctx
, 1);
7185 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
7186 ma1
= isl_multi_aff_align_params(ma1
, space
);
7188 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
7189 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
7191 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
7193 isl_multi_aff_free(ma1
);
7194 isl_multi_aff_free(ma2
);
7199 isl_die(ctx
, isl_error_unknown
,
7200 "result not as expected", return -1);
7205 /* Check that isl_*_drop_unused_params actually drops the unused parameters
7206 * by comparing the result using isl_*_plain_is_equal.
7207 * Note that this assumes that isl_*_plain_is_equal does not consider
7208 * objects that only differ by unused parameters to be equal.
7210 int test_drop_unused_parameters(isl_ctx
*ctx
)
7212 const char *str_with
, *str_without
;
7213 isl_basic_set
*bset1
, *bset2
;
7214 isl_set
*set1
, *set2
;
7215 isl_pw_aff
*pwa1
, *pwa2
;
7218 str_with
= "[n, m, o] -> { [m] }";
7219 str_without
= "[m] -> { [m] }";
7221 bset1
= isl_basic_set_read_from_str(ctx
, str_with
);
7222 bset2
= isl_basic_set_read_from_str(ctx
, str_without
);
7223 bset1
= isl_basic_set_drop_unused_params(bset1
);
7224 equal
= isl_basic_set_plain_is_equal(bset1
, bset2
);
7225 isl_basic_set_free(bset1
);
7226 isl_basic_set_free(bset2
);
7231 isl_die(ctx
, isl_error_unknown
,
7232 "result not as expected", return -1);
7234 set1
= isl_set_read_from_str(ctx
, str_with
);
7235 set2
= isl_set_read_from_str(ctx
, str_without
);
7236 set1
= isl_set_drop_unused_params(set1
);
7237 equal
= isl_set_plain_is_equal(set1
, set2
);
7244 isl_die(ctx
, isl_error_unknown
,
7245 "result not as expected", return -1);
7247 pwa1
= isl_pw_aff_read_from_str(ctx
, str_with
);
7248 pwa2
= isl_pw_aff_read_from_str(ctx
, str_without
);
7249 pwa1
= isl_pw_aff_drop_unused_params(pwa1
);
7250 equal
= isl_pw_aff_plain_is_equal(pwa1
, pwa2
);
7251 isl_pw_aff_free(pwa1
);
7252 isl_pw_aff_free(pwa2
);
7257 isl_die(ctx
, isl_error_unknown
,
7258 "result not as expected", return -1);
7263 static int test_list(isl_ctx
*ctx
)
7265 isl_id
*a
, *b
, *c
, *d
, *id
;
7269 a
= isl_id_alloc(ctx
, "a", NULL
);
7270 b
= isl_id_alloc(ctx
, "b", NULL
);
7271 c
= isl_id_alloc(ctx
, "c", NULL
);
7272 d
= isl_id_alloc(ctx
, "d", NULL
);
7274 list
= isl_id_list_alloc(ctx
, 4);
7275 list
= isl_id_list_add(list
, b
);
7276 list
= isl_id_list_insert(list
, 0, a
);
7277 list
= isl_id_list_add(list
, c
);
7278 list
= isl_id_list_add(list
, d
);
7279 list
= isl_id_list_drop(list
, 1, 1);
7283 if (isl_id_list_n_id(list
) != 3) {
7284 isl_id_list_free(list
);
7285 isl_die(ctx
, isl_error_unknown
,
7286 "unexpected number of elements in list", return -1);
7289 id
= isl_id_list_get_id(list
, 0);
7292 id
= isl_id_list_get_id(list
, 1);
7295 id
= isl_id_list_get_id(list
, 2);
7299 isl_id_list_free(list
);
7302 isl_die(ctx
, isl_error_unknown
,
7303 "unexpected elements in list", return -1);
7308 const char *set_conversion_tests
[] = {
7309 "[N] -> { [i] : N - 1 <= 2 i <= N }",
7310 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
7311 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
7312 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
7313 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
7314 "[a, b] -> { [c, d] : (4*floor((-a + c)/4) = -a + c and "
7315 "32*floor((-b + d)/32) = -b + d and 5 <= c <= 8 and "
7316 "-3 + c <= d <= 28 + c) }",
7319 /* Check that converting from isl_set to isl_pw_multi_aff and back
7320 * to isl_set produces the original isl_set.
7322 static int test_set_conversion(isl_ctx
*ctx
)
7326 isl_set
*set1
, *set2
;
7327 isl_pw_multi_aff
*pma
;
7330 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
7331 str
= set_conversion_tests
[i
];
7332 set1
= isl_set_read_from_str(ctx
, str
);
7333 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
7334 set2
= isl_set_from_pw_multi_aff(pma
);
7335 equal
= isl_set_is_equal(set1
, set2
);
7342 isl_die(ctx
, isl_error_unknown
, "bad conversion",
7349 const char *conversion_tests
[] = {
7350 "{ [a, b, c, d] -> s0[a, b, e, f] : "
7351 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
7352 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
7353 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
7355 "{ [a, b] -> [c] : exists (e0 = floor((-a - b + c)/5): "
7356 "5e0 = -a - b + c and c >= -a and c <= 4 - a) }",
7357 "{ [a, b] -> [c] : exists d : 18 * d = -3 - a + 2c and 1 <= c <= 3 }",
7360 /* Check that converting from isl_map to isl_pw_multi_aff and back
7361 * to isl_map produces the original isl_map.
7363 static int test_map_conversion(isl_ctx
*ctx
)
7366 isl_map
*map1
, *map2
;
7367 isl_pw_multi_aff
*pma
;
7370 for (i
= 0; i
< ARRAY_SIZE(conversion_tests
); ++i
) {
7371 map1
= isl_map_read_from_str(ctx
, conversion_tests
[i
]);
7372 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
7373 map2
= isl_map_from_pw_multi_aff(pma
);
7374 equal
= isl_map_is_equal(map1
, map2
);
7381 isl_die(ctx
, isl_error_unknown
, "bad conversion",
7388 /* Descriptions of isl_pw_multi_aff objects for testing conversion
7389 * to isl_multi_pw_aff and back.
7391 const char *mpa_conversion_tests
[] = {
7393 "{ [x] -> A[x] : x >= 0 }",
7394 "{ [x] -> A[x] : x >= 0; [x] -> A[-x] : x < 0 }",
7395 "{ [x] -> A[x, x + 1] }",
7397 "{ [x] -> A[] : x >= 0 }",
7400 /* Check that conversion from isl_pw_multi_aff to isl_multi_pw_aff and
7401 * back to isl_pw_multi_aff preserves the original meaning.
7403 static int test_mpa_conversion(isl_ctx
*ctx
)
7406 isl_pw_multi_aff
*pma1
, *pma2
;
7407 isl_multi_pw_aff
*mpa
;
7410 for (i
= 0; i
< ARRAY_SIZE(mpa_conversion_tests
); ++i
) {
7412 str
= mpa_conversion_tests
[i
];
7413 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
7414 pma2
= isl_pw_multi_aff_copy(pma1
);
7415 mpa
= isl_multi_pw_aff_from_pw_multi_aff(pma1
);
7416 pma1
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
7417 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
7418 isl_pw_multi_aff_free(pma1
);
7419 isl_pw_multi_aff_free(pma2
);
7424 isl_die(ctx
, isl_error_unknown
, "bad conversion",
7431 /* Descriptions of union maps that should be convertible
7432 * to an isl_multi_union_pw_aff.
7434 const char *umap_mupa_conversion_tests
[] = {
7435 "{ [a, b, c, d] -> s0[a, b, e, f] : "
7436 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
7437 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
7438 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
7440 "{ [a, b] -> [c] : exists (e0 = floor((-a - b + c)/5): "
7441 "5e0 = -a - b + c and c >= -a and c <= 4 - a) }",
7442 "{ [a, b] -> [c] : exists d : 18 * d = -3 - a + 2c and 1 <= c <= 3 }",
7443 "{ A[] -> B[0]; C[] -> B[1] }",
7444 "{ A[] -> B[]; C[] -> B[] }",
7447 /* Check that converting from isl_union_map to isl_multi_union_pw_aff and back
7448 * to isl_union_map produces the original isl_union_map.
7450 static int test_union_map_mupa_conversion(isl_ctx
*ctx
)
7453 isl_union_map
*umap1
, *umap2
;
7454 isl_multi_union_pw_aff
*mupa
;
7457 for (i
= 0; i
< ARRAY_SIZE(umap_mupa_conversion_tests
); ++i
) {
7459 str
= umap_mupa_conversion_tests
[i
];
7460 umap1
= isl_union_map_read_from_str(ctx
, str
);
7461 umap2
= isl_union_map_copy(umap1
);
7462 mupa
= isl_multi_union_pw_aff_from_union_map(umap2
);
7463 umap2
= isl_union_map_from_multi_union_pw_aff(mupa
);
7464 equal
= isl_union_map_is_equal(umap1
, umap2
);
7465 isl_union_map_free(umap1
);
7466 isl_union_map_free(umap2
);
7471 isl_die(ctx
, isl_error_unknown
, "bad conversion",
7478 static int test_conversion(isl_ctx
*ctx
)
7480 if (test_set_conversion(ctx
) < 0)
7482 if (test_map_conversion(ctx
) < 0)
7484 if (test_mpa_conversion(ctx
) < 0)
7486 if (test_union_map_mupa_conversion(ctx
) < 0)
7491 /* Check that isl_basic_map_curry does not modify input.
7493 static int test_curry(isl_ctx
*ctx
)
7496 isl_basic_map
*bmap1
, *bmap2
;
7499 str
= "{ [A[] -> B[]] -> C[] }";
7500 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
7501 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
7502 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
7503 isl_basic_map_free(bmap1
);
7504 isl_basic_map_free(bmap2
);
7509 isl_die(ctx
, isl_error_unknown
,
7510 "curried map should not be equal to original",
7520 } preimage_tests
[] = {
7521 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
7522 "{ A[j,i] -> B[i,j] }",
7523 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
7524 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
7525 "{ A[a,b] -> B[a/2,b/6] }",
7526 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
7527 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
7528 "{ A[a,b] -> B[a/2,b/6] }",
7529 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
7530 "exists i,j : a = 2 i and b = 6 j }" },
7531 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
7532 "[n] -> { : 0 <= n <= 100 }" },
7533 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
7534 "{ A[a] -> B[2a] }",
7535 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
7536 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
7537 "{ A[a] -> B[([a/2])] }",
7538 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
7539 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
7540 "{ A[a] -> B[a,a,a/3] }",
7541 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
7542 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
7543 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
7546 static int test_preimage_basic_set(isl_ctx
*ctx
)
7549 isl_basic_set
*bset1
, *bset2
;
7553 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
7554 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
7555 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
7556 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
7557 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
7558 equal
= isl_basic_set_is_equal(bset1
, bset2
);
7559 isl_basic_set_free(bset1
);
7560 isl_basic_set_free(bset2
);
7564 isl_die(ctx
, isl_error_unknown
, "bad preimage",
7575 } preimage_domain_tests
[] = {
7576 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
7577 "{ A[j,i] -> B[i,j] }",
7578 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
7579 { "{ B[i] -> C[i]; D[i] -> E[i] }",
7580 "{ A[i] -> B[i + 1] }",
7581 "{ A[i] -> C[i + 1] }" },
7582 { "{ B[i] -> C[i]; B[i] -> E[i] }",
7583 "{ A[i] -> B[i + 1] }",
7584 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
7585 { "{ B[i] -> C[([i/2])] }",
7586 "{ A[i] -> B[2i] }",
7587 "{ A[i] -> C[i] }" },
7588 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
7589 "{ A[i] -> B[([i/5]), ([i/7])] }",
7590 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
7591 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
7592 "[N] -> { A[] -> B[([N/5])] }",
7593 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
7594 { "{ B[i] -> C[i] : exists a : i = 5 a }",
7595 "{ A[i] -> B[2i] }",
7596 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
7597 { "{ B[i] -> C[i] : exists a : i = 2 a; "
7598 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
7599 "{ A[i] -> B[2i] }",
7600 "{ A[i] -> C[2i] }" },
7601 { "{ A[i] -> B[i] }", "{ C[i] -> A[(i + floor(i/3))/2] }",
7602 "{ C[i] -> B[j] : 2j = i + floor(i/3) }" },
7605 static int test_preimage_union_map(isl_ctx
*ctx
)
7608 isl_union_map
*umap1
, *umap2
;
7612 for (i
= 0; i
< ARRAY_SIZE(preimage_domain_tests
); ++i
) {
7613 umap1
= isl_union_map_read_from_str(ctx
,
7614 preimage_domain_tests
[i
].map
);
7615 ma
= isl_multi_aff_read_from_str(ctx
,
7616 preimage_domain_tests
[i
].ma
);
7617 umap2
= isl_union_map_read_from_str(ctx
,
7618 preimage_domain_tests
[i
].res
);
7619 umap1
= isl_union_map_preimage_domain_multi_aff(umap1
, ma
);
7620 equal
= isl_union_map_is_equal(umap1
, umap2
);
7621 isl_union_map_free(umap1
);
7622 isl_union_map_free(umap2
);
7626 isl_die(ctx
, isl_error_unknown
, "bad preimage",
7633 static int test_preimage(isl_ctx
*ctx
)
7635 if (test_preimage_basic_set(ctx
) < 0)
7637 if (test_preimage_union_map(ctx
) < 0)
7647 } pullback_tests
[] = {
7648 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
7649 "{ A[a,b] -> C[b + 2a] }" },
7650 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
7651 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
7652 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
7653 "{ A[a] -> C[(a)/6] }" },
7654 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
7655 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
7656 "{ A[a] -> C[(2a)/3] }" },
7657 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
7658 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
7659 "{ A[i,j] -> C[i + j, i + j] }"},
7660 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
7661 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
7662 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
7663 { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }",
7664 "{ [i, j] -> [floor((i)/3), j] }",
7665 "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" },
7668 static int test_pullback(isl_ctx
*ctx
)
7671 isl_multi_aff
*ma1
, *ma2
;
7675 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
7676 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
7677 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
7678 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
7679 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
7680 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
7681 isl_multi_aff_free(ma1
);
7682 isl_multi_aff_free(ma2
);
7686 isl_die(ctx
, isl_error_unknown
, "bad pullback",
7693 /* Check that negation is printed correctly and that equal expressions
7694 * are correctly identified.
7696 static int test_ast(isl_ctx
*ctx
)
7698 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
7702 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
7703 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
7704 expr
= isl_ast_expr_add(expr1
, expr2
);
7705 expr2
= isl_ast_expr_copy(expr
);
7706 expr
= isl_ast_expr_neg(expr
);
7707 expr2
= isl_ast_expr_neg(expr2
);
7708 equal
= isl_ast_expr_is_equal(expr
, expr2
);
7709 str
= isl_ast_expr_to_C_str(expr
);
7710 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
7712 isl_ast_expr_free(expr
);
7713 isl_ast_expr_free(expr2
);
7715 if (ok
< 0 || equal
< 0)
7718 isl_die(ctx
, isl_error_unknown
,
7719 "equal expressions not considered equal", return -1);
7721 isl_die(ctx
, isl_error_unknown
,
7722 "isl_ast_expr printed incorrectly", return -1);
7724 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
7725 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
7726 expr
= isl_ast_expr_add(expr1
, expr2
);
7727 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
7728 expr
= isl_ast_expr_sub(expr3
, expr
);
7729 str
= isl_ast_expr_to_C_str(expr
);
7730 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
7732 isl_ast_expr_free(expr
);
7737 isl_die(ctx
, isl_error_unknown
,
7738 "isl_ast_expr printed incorrectly", return -1);
7743 /* Check that isl_ast_build_expr_from_set returns a valid expression
7744 * for an empty set. Note that isl_ast_build_expr_from_set getting
7745 * called on an empty set probably indicates a bug in the caller.
7747 static int test_ast_build(isl_ctx
*ctx
)
7750 isl_ast_build
*build
;
7753 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
7754 build
= isl_ast_build_from_context(set
);
7756 set
= isl_set_empty(isl_space_params_alloc(ctx
, 0));
7757 expr
= isl_ast_build_expr_from_set(build
, set
);
7759 isl_ast_expr_free(expr
);
7760 isl_ast_build_free(build
);
7768 /* Internal data structure for before_for and after_for callbacks.
7770 * depth is the current depth
7771 * before is the number of times before_for has been called
7772 * after is the number of times after_for has been called
7774 struct isl_test_codegen_data
{
7780 /* This function is called before each for loop in the AST generated
7781 * from test_ast_gen1.
7783 * Increment the number of calls and the depth.
7784 * Check that the space returned by isl_ast_build_get_schedule_space
7785 * matches the target space of the schedule returned by
7786 * isl_ast_build_get_schedule.
7787 * Return an isl_id that is checked by the corresponding call
7790 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
7793 struct isl_test_codegen_data
*data
= user
;
7796 isl_union_map
*schedule
;
7797 isl_union_set
*uset
;
7802 ctx
= isl_ast_build_get_ctx(build
);
7804 if (data
->before
>= 3)
7805 isl_die(ctx
, isl_error_unknown
,
7806 "unexpected number of for nodes", return NULL
);
7807 if (data
->depth
>= 2)
7808 isl_die(ctx
, isl_error_unknown
,
7809 "unexpected depth", return NULL
);
7811 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
7815 schedule
= isl_ast_build_get_schedule(build
);
7816 uset
= isl_union_map_range(schedule
);
7819 if (isl_union_set_n_set(uset
) != 1) {
7820 isl_union_set_free(uset
);
7821 isl_die(ctx
, isl_error_unknown
,
7822 "expecting single range space", return NULL
);
7825 space
= isl_ast_build_get_schedule_space(build
);
7826 set
= isl_union_set_extract_set(uset
, space
);
7827 isl_union_set_free(uset
);
7828 empty
= isl_set_is_empty(set
);
7834 isl_die(ctx
, isl_error_unknown
,
7835 "spaces don't match", return NULL
);
7837 return isl_id_alloc(ctx
, name
, NULL
);
7840 /* This function is called after each for loop in the AST generated
7841 * from test_ast_gen1.
7843 * Increment the number of calls and decrement the depth.
7844 * Check that the annotation attached to the node matches
7845 * the isl_id returned by the corresponding call to before_for.
7847 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
7848 __isl_keep isl_ast_build
*build
, void *user
)
7850 struct isl_test_codegen_data
*data
= user
;
7858 if (data
->after
> data
->before
)
7859 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
7860 "mismatch in number of for nodes",
7861 return isl_ast_node_free(node
));
7863 id
= isl_ast_node_get_annotation(node
);
7865 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
7866 "missing annotation", return isl_ast_node_free(node
));
7868 name
= isl_id_get_name(id
);
7869 valid
= name
&& atoi(name
+ 1) == data
->depth
;
7873 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
7874 "wrong annotation", return isl_ast_node_free(node
));
7879 /* Check that the before_each_for and after_each_for callbacks
7880 * are called for each for loop in the generated code,
7881 * that they are called in the right order and that the isl_id
7882 * returned from the before_each_for callback is attached to
7883 * the isl_ast_node passed to the corresponding after_each_for call.
7885 static int test_ast_gen1(isl_ctx
*ctx
)
7889 isl_union_map
*schedule
;
7890 isl_ast_build
*build
;
7892 struct isl_test_codegen_data data
;
7894 str
= "[N] -> { : N >= 10 }";
7895 set
= isl_set_read_from_str(ctx
, str
);
7896 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
7897 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
7898 schedule
= isl_union_map_read_from_str(ctx
, str
);
7903 build
= isl_ast_build_from_context(set
);
7904 build
= isl_ast_build_set_before_each_for(build
,
7905 &before_for
, &data
);
7906 build
= isl_ast_build_set_after_each_for(build
,
7908 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
7909 isl_ast_build_free(build
);
7913 isl_ast_node_free(tree
);
7915 if (data
.before
!= 3 || data
.after
!= 3)
7916 isl_die(ctx
, isl_error_unknown
,
7917 "unexpected number of for nodes", return -1);
7922 /* Check that the AST generator handles domains that are integrally disjoint
7923 * but not rationally disjoint.
7925 static int test_ast_gen2(isl_ctx
*ctx
)
7929 isl_union_map
*schedule
;
7930 isl_union_map
*options
;
7931 isl_ast_build
*build
;
7934 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
7935 schedule
= isl_union_map_read_from_str(ctx
, str
);
7936 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
7937 build
= isl_ast_build_from_context(set
);
7939 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
7940 options
= isl_union_map_read_from_str(ctx
, str
);
7941 build
= isl_ast_build_set_options(build
, options
);
7942 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
7943 isl_ast_build_free(build
);
7946 isl_ast_node_free(tree
);
7951 /* Increment *user on each call.
7953 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
7954 __isl_keep isl_ast_build
*build
, void *user
)
7963 /* Test that unrolling tries to minimize the number of instances.
7964 * In particular, for the schedule given below, make sure it generates
7965 * 3 nodes (rather than 101).
7967 static int test_ast_gen3(isl_ctx
*ctx
)
7971 isl_union_map
*schedule
;
7972 isl_union_map
*options
;
7973 isl_ast_build
*build
;
7977 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
7978 schedule
= isl_union_map_read_from_str(ctx
, str
);
7979 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
7981 str
= "{ [i] -> unroll[0] }";
7982 options
= isl_union_map_read_from_str(ctx
, str
);
7984 build
= isl_ast_build_from_context(set
);
7985 build
= isl_ast_build_set_options(build
, options
);
7986 build
= isl_ast_build_set_at_each_domain(build
,
7987 &count_domains
, &n_domain
);
7988 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
7989 isl_ast_build_free(build
);
7993 isl_ast_node_free(tree
);
7996 isl_die(ctx
, isl_error_unknown
,
7997 "unexpected number of for nodes", return -1);
8002 /* Check that if the ast_build_exploit_nested_bounds options is set,
8003 * we do not get an outer if node in the generated AST,
8004 * while we do get such an outer if node if the options is not set.
8006 static int test_ast_gen4(isl_ctx
*ctx
)
8010 isl_union_map
*schedule
;
8011 isl_ast_build
*build
;
8013 enum isl_ast_node_type type
;
8016 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
8017 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
8019 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
8021 schedule
= isl_union_map_read_from_str(ctx
, str
);
8022 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
8023 build
= isl_ast_build_from_context(set
);
8024 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
8025 isl_ast_build_free(build
);
8029 type
= isl_ast_node_get_type(tree
);
8030 isl_ast_node_free(tree
);
8032 if (type
== isl_ast_node_if
)
8033 isl_die(ctx
, isl_error_unknown
,
8034 "not expecting if node", return -1);
8036 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
8038 schedule
= isl_union_map_read_from_str(ctx
, str
);
8039 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
8040 build
= isl_ast_build_from_context(set
);
8041 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
8042 isl_ast_build_free(build
);
8046 type
= isl_ast_node_get_type(tree
);
8047 isl_ast_node_free(tree
);
8049 if (type
!= isl_ast_node_if
)
8050 isl_die(ctx
, isl_error_unknown
,
8051 "expecting if node", return -1);
8053 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
8058 /* This function is called for each leaf in the AST generated
8059 * from test_ast_gen5.
8061 * We finalize the AST generation by extending the outer schedule
8062 * with a zero-dimensional schedule. If this results in any for loops,
8063 * then this means that we did not pass along enough information
8064 * about the outer schedule to the inner AST generation.
8066 static __isl_give isl_ast_node
*create_leaf(__isl_take isl_ast_build
*build
,
8069 isl_union_map
*schedule
, *extra
;
8072 schedule
= isl_ast_build_get_schedule(build
);
8073 extra
= isl_union_map_copy(schedule
);
8074 extra
= isl_union_map_from_domain(isl_union_map_domain(extra
));
8075 schedule
= isl_union_map_range_product(schedule
, extra
);
8076 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
8077 isl_ast_build_free(build
);
8082 if (isl_ast_node_get_type(tree
) == isl_ast_node_for
)
8083 isl_die(isl_ast_node_get_ctx(tree
), isl_error_unknown
,
8084 "code should not contain any for loop",
8085 return isl_ast_node_free(tree
));
8090 /* Check that we do not lose any information when going back and
8091 * forth between internal and external schedule.
8093 * In particular, we create an AST where we unroll the only
8094 * non-constant dimension in the schedule. We therefore do
8095 * not expect any for loops in the AST. However, older versions
8096 * of isl would not pass along enough information about the outer
8097 * schedule when performing an inner code generation from a create_leaf
8098 * callback, resulting in the inner code generation producing a for loop.
8100 static int test_ast_gen5(isl_ctx
*ctx
)
8104 isl_union_map
*schedule
, *options
;
8105 isl_ast_build
*build
;
8108 str
= "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
8109 schedule
= isl_union_map_read_from_str(ctx
, str
);
8111 str
= "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
8112 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
8113 options
= isl_union_map_read_from_str(ctx
, str
);
8115 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
8116 build
= isl_ast_build_from_context(set
);
8117 build
= isl_ast_build_set_options(build
, options
);
8118 build
= isl_ast_build_set_create_leaf(build
, &create_leaf
, NULL
);
8119 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
8120 isl_ast_build_free(build
);
8121 isl_ast_node_free(tree
);
8128 /* Check that the expression
8130 * [n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }
8132 * is not combined into
8136 * as this would result in n/2 being evaluated in parts of
8137 * the definition domain where n is not a multiple of 2.
8139 static int test_ast_expr(isl_ctx
*ctx
)
8143 isl_ast_build
*build
;
8148 min_max
= isl_options_get_ast_build_detect_min_max(ctx
);
8149 isl_options_set_ast_build_detect_min_max(ctx
, 1);
8151 str
= "[n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }";
8152 pa
= isl_pw_aff_read_from_str(ctx
, str
);
8153 build
= isl_ast_build_alloc(ctx
);
8154 expr
= isl_ast_build_expr_from_pw_aff(build
, pa
);
8155 is_min
= isl_ast_expr_get_type(expr
) == isl_ast_expr_op
&&
8156 isl_ast_expr_get_op_type(expr
) == isl_ast_op_min
;
8157 isl_ast_build_free(build
);
8158 isl_ast_expr_free(expr
);
8160 isl_options_set_ast_build_detect_min_max(ctx
, min_max
);
8165 isl_die(ctx
, isl_error_unknown
,
8166 "expressions should not be combined", return -1);
8171 static int test_ast_gen(isl_ctx
*ctx
)
8173 if (test_ast_gen1(ctx
) < 0)
8175 if (test_ast_gen2(ctx
) < 0)
8177 if (test_ast_gen3(ctx
) < 0)
8179 if (test_ast_gen4(ctx
) < 0)
8181 if (test_ast_gen5(ctx
) < 0)
8183 if (test_ast_expr(ctx
) < 0)
8188 /* Check if dropping output dimensions from an isl_pw_multi_aff
8191 static int test_pw_multi_aff(isl_ctx
*ctx
)
8194 isl_pw_multi_aff
*pma1
, *pma2
;
8197 str
= "{ [i,j] -> [i+j, 4i-j] }";
8198 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
8199 str
= "{ [i,j] -> [4i-j] }";
8200 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
8202 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
8204 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
8206 isl_pw_multi_aff_free(pma1
);
8207 isl_pw_multi_aff_free(pma2
);
8211 isl_die(ctx
, isl_error_unknown
,
8212 "expressions not equal", return -1);
8217 /* Check that we can properly parse multi piecewise affine expressions
8218 * where the piecewise affine expressions have different domains.
8220 static int test_multi_pw_aff_1(isl_ctx
*ctx
)
8223 isl_set
*dom
, *dom2
;
8224 isl_multi_pw_aff
*mpa1
, *mpa2
;
8229 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [i] }");
8230 dom
= isl_set_read_from_str(ctx
, "{ [i] : i > 0 }");
8231 mpa1
= isl_multi_pw_aff_intersect_domain(mpa1
, dom
);
8232 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [2i] }");
8233 mpa2
= isl_multi_pw_aff_flat_range_product(mpa1
, mpa2
);
8234 str
= "{ [i] -> [(i : i > 0), 2i] }";
8235 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, str
);
8237 equal
= isl_multi_pw_aff_plain_is_equal(mpa1
, mpa2
);
8239 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 0);
8240 dom
= isl_pw_aff_domain(pa
);
8241 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 1);
8242 dom2
= isl_pw_aff_domain(pa
);
8243 equal_domain
= isl_set_is_equal(dom
, dom2
);
8247 isl_multi_pw_aff_free(mpa1
);
8248 isl_multi_pw_aff_free(mpa2
);
8253 isl_die(ctx
, isl_error_unknown
,
8254 "expressions not equal", return -1);
8256 if (equal_domain
< 0)
8259 isl_die(ctx
, isl_error_unknown
,
8260 "domains unexpectedly equal", return -1);
8265 /* Check that the dimensions in the explicit domain
8266 * of a multi piecewise affine expression are properly
8267 * taken into account.
8269 static int test_multi_pw_aff_2(isl_ctx
*ctx
)
8272 isl_bool involves1
, involves2
, involves3
, equal
;
8273 isl_multi_pw_aff
*mpa
, *mpa1
, *mpa2
;
8275 str
= "{ A[x,y] -> B[] : x >= y }";
8276 mpa
= isl_multi_pw_aff_read_from_str(ctx
, str
);
8277 involves1
= isl_multi_pw_aff_involves_dims(mpa
, isl_dim_in
, 0, 2);
8278 mpa1
= isl_multi_pw_aff_copy(mpa
);
8280 mpa
= isl_multi_pw_aff_insert_dims(mpa
, isl_dim_in
, 0, 1);
8281 involves2
= isl_multi_pw_aff_involves_dims(mpa
, isl_dim_in
, 0, 1);
8282 involves3
= isl_multi_pw_aff_involves_dims(mpa
, isl_dim_in
, 1, 2);
8283 str
= "{ [a,x,y] -> B[] : x >= y }";
8284 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, str
);
8285 equal
= isl_multi_pw_aff_plain_is_equal(mpa
, mpa2
);
8286 isl_multi_pw_aff_free(mpa2
);
8288 mpa
= isl_multi_pw_aff_drop_dims(mpa
, isl_dim_in
, 0, 1);
8289 mpa
= isl_multi_pw_aff_set_tuple_name(mpa
, isl_dim_in
, "A");
8290 if (equal
>= 0 && equal
)
8291 equal
= isl_multi_pw_aff_plain_is_equal(mpa
, mpa1
);
8292 isl_multi_pw_aff_free(mpa1
);
8293 isl_multi_pw_aff_free(mpa
);
8295 if (involves1
< 0 || involves2
< 0 || involves3
< 0 || equal
< 0)
8298 isl_die(ctx
, isl_error_unknown
,
8299 "incorrect result of dimension insertion/removal",
8300 return isl_stat_error
);
8301 if (!involves1
|| involves2
|| !involves3
)
8302 isl_die(ctx
, isl_error_unknown
,
8303 "incorrect characterization of involved dimensions",
8304 return isl_stat_error
);
8309 /* Check that isl_multi_union_pw_aff_multi_val_on_domain
8310 * sets the explicit domain of a zero-dimensional result,
8311 * such that it can be converted to an isl_union_map.
8313 static isl_stat
test_multi_pw_aff_3(isl_ctx
*ctx
)
8318 isl_multi_union_pw_aff
*mupa
;
8319 isl_union_map
*umap
;
8321 dom
= isl_union_set_read_from_str(ctx
, "{ A[]; B[] }");
8322 space
= isl_union_set_get_space(dom
);
8323 mv
= isl_multi_val_zero(isl_space_set_from_params(space
));
8324 mupa
= isl_multi_union_pw_aff_multi_val_on_domain(dom
, mv
);
8325 umap
= isl_union_map_from_multi_union_pw_aff(mupa
);
8326 isl_union_map_free(umap
);
8328 return isl_stat_error
;
8333 /* Perform some tests on multi piecewise affine expressions.
8335 static int test_multi_pw_aff(isl_ctx
*ctx
)
8337 if (test_multi_pw_aff_1(ctx
) < 0)
8339 if (test_multi_pw_aff_2(ctx
) < 0)
8341 if (test_multi_pw_aff_3(ctx
) < 0)
8346 /* This is a regression test for a bug where isl_basic_map_simplify
8347 * would end up in an infinite loop. In particular, we construct
8348 * an empty basic set that is not obviously empty.
8349 * isl_basic_set_is_empty marks the basic set as empty.
8350 * After projecting out i3, the variable can be dropped completely,
8351 * but isl_basic_map_simplify refrains from doing so if the basic set
8352 * is empty and would end up in an infinite loop if it didn't test
8353 * explicitly for empty basic maps in the outer loop.
8355 static int test_simplify_1(isl_ctx
*ctx
)
8358 isl_basic_set
*bset
;
8361 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
8362 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
8363 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
8365 bset
= isl_basic_set_read_from_str(ctx
, str
);
8366 empty
= isl_basic_set_is_empty(bset
);
8367 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
8368 isl_basic_set_free(bset
);
8372 isl_die(ctx
, isl_error_unknown
,
8373 "basic set should be empty", return -1);
8378 /* Check that the equality in the set description below
8379 * is simplified away.
8381 static int test_simplify_2(isl_ctx
*ctx
)
8384 isl_basic_set
*bset
;
8387 str
= "{ [a] : exists e0, e1: 32e1 = 31 + 31a + 31e0 }";
8388 bset
= isl_basic_set_read_from_str(ctx
, str
);
8389 universe
= isl_basic_set_plain_is_universe(bset
);
8390 isl_basic_set_free(bset
);
8395 isl_die(ctx
, isl_error_unknown
,
8396 "equality not simplified away", return -1);
8400 /* Some simplification tests.
8402 static int test_simplify(isl_ctx
*ctx
)
8404 if (test_simplify_1(ctx
) < 0)
8406 if (test_simplify_2(ctx
) < 0)
8411 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
8412 * with gbr context would fail to disable the use of the shifted tableau
8413 * when transferring equalities for the input to the context, resulting
8414 * in invalid sample values.
8416 static int test_partial_lexmin(isl_ctx
*ctx
)
8419 isl_basic_set
*bset
;
8420 isl_basic_map
*bmap
;
8423 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
8424 bmap
= isl_basic_map_read_from_str(ctx
, str
);
8425 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
8426 bset
= isl_basic_set_read_from_str(ctx
, str
);
8427 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
8436 /* Check that the variable compression performed on the existentially
8437 * quantified variables inside isl_basic_set_compute_divs is not confused
8438 * by the implicit equalities among the parameters.
8440 static int test_compute_divs(isl_ctx
*ctx
)
8443 isl_basic_set
*bset
;
8446 str
= "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
8447 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
8448 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
8449 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
8450 bset
= isl_basic_set_read_from_str(ctx
, str
);
8451 set
= isl_basic_set_compute_divs(bset
);
8459 /* Check that isl_schedule_get_map is not confused by a schedule tree
8460 * with divergent filter node parameters, as can result from a call
8461 * to isl_schedule_intersect_domain.
8463 static int test_schedule_tree(isl_ctx
*ctx
)
8466 isl_union_set
*uset
;
8467 isl_schedule
*sched1
, *sched2
;
8468 isl_union_map
*umap
;
8470 uset
= isl_union_set_read_from_str(ctx
, "{ A[i] }");
8471 sched1
= isl_schedule_from_domain(uset
);
8472 uset
= isl_union_set_read_from_str(ctx
, "{ B[] }");
8473 sched2
= isl_schedule_from_domain(uset
);
8475 sched1
= isl_schedule_sequence(sched1
, sched2
);
8476 str
= "[n] -> { A[i] : 0 <= i < n; B[] }";
8477 uset
= isl_union_set_read_from_str(ctx
, str
);
8478 sched1
= isl_schedule_intersect_domain(sched1
, uset
);
8479 umap
= isl_schedule_get_map(sched1
);
8480 isl_schedule_free(sched1
);
8481 isl_union_map_free(umap
);
8488 /* Check that a zero-dimensional prefix schedule keeps track
8489 * of the domain and outer filters.
8491 static int test_schedule_tree_prefix(isl_ctx
*ctx
)
8495 isl_union_set
*uset
;
8496 isl_union_set_list
*filters
;
8497 isl_multi_union_pw_aff
*mupa
, *mupa2
;
8498 isl_schedule_node
*node
;
8500 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
8501 uset
= isl_union_set_read_from_str(ctx
, str
);
8502 node
= isl_schedule_node_from_domain(uset
);
8503 node
= isl_schedule_node_child(node
, 0);
8505 str
= "{ S1[i,j] : i > j }";
8506 uset
= isl_union_set_read_from_str(ctx
, str
);
8507 filters
= isl_union_set_list_from_union_set(uset
);
8508 str
= "{ S1[i,j] : i <= j; S2[i,j] }";
8509 uset
= isl_union_set_read_from_str(ctx
, str
);
8510 filters
= isl_union_set_list_add(filters
, uset
);
8511 node
= isl_schedule_node_insert_sequence(node
, filters
);
8513 node
= isl_schedule_node_child(node
, 0);
8514 node
= isl_schedule_node_child(node
, 0);
8515 mupa
= isl_schedule_node_get_prefix_schedule_multi_union_pw_aff(node
);
8516 str
= "([] : { S1[i,j] : i > j })";
8517 mupa2
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8518 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
, mupa2
);
8519 isl_multi_union_pw_aff_free(mupa2
);
8520 isl_multi_union_pw_aff_free(mupa
);
8521 isl_schedule_node_free(node
);
8526 isl_die(ctx
, isl_error_unknown
, "unexpected prefix schedule",
8532 /* Check that the reaching domain elements and the prefix schedule
8533 * at a leaf node are the same before and after grouping.
8535 static int test_schedule_tree_group_1(isl_ctx
*ctx
)
8540 isl_union_set
*uset
;
8541 isl_multi_union_pw_aff
*mupa
;
8542 isl_union_pw_multi_aff
*upma1
, *upma2
;
8543 isl_union_set
*domain1
, *domain2
;
8544 isl_union_map
*umap1
, *umap2
;
8545 isl_schedule_node
*node
;
8547 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
8548 uset
= isl_union_set_read_from_str(ctx
, str
);
8549 node
= isl_schedule_node_from_domain(uset
);
8550 node
= isl_schedule_node_child(node
, 0);
8551 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]";
8552 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8553 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
8554 node
= isl_schedule_node_child(node
, 0);
8555 str
= "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]";
8556 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8557 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
8558 node
= isl_schedule_node_child(node
, 0);
8559 umap1
= isl_schedule_node_get_prefix_schedule_union_map(node
);
8560 upma1
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
8561 domain1
= isl_schedule_node_get_domain(node
);
8562 id
= isl_id_alloc(ctx
, "group", NULL
);
8563 node
= isl_schedule_node_parent(node
);
8564 node
= isl_schedule_node_group(node
, id
);
8565 node
= isl_schedule_node_child(node
, 0);
8566 umap2
= isl_schedule_node_get_prefix_schedule_union_map(node
);
8567 upma2
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
8568 domain2
= isl_schedule_node_get_domain(node
);
8569 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
8570 if (equal
>= 0 && equal
)
8571 equal
= isl_union_set_is_equal(domain1
, domain2
);
8572 if (equal
>= 0 && equal
)
8573 equal
= isl_union_map_is_equal(umap1
, umap2
);
8574 isl_union_map_free(umap1
);
8575 isl_union_map_free(umap2
);
8576 isl_union_set_free(domain1
);
8577 isl_union_set_free(domain2
);
8578 isl_union_pw_multi_aff_free(upma1
);
8579 isl_union_pw_multi_aff_free(upma2
);
8580 isl_schedule_node_free(node
);
8585 isl_die(ctx
, isl_error_unknown
,
8586 "expressions not equal", return -1);
8591 /* Check that we can have nested groupings and that the union map
8592 * schedule representation is the same before and after the grouping.
8593 * Note that after the grouping, the union map representation contains
8594 * the domain constraints from the ranges of the expansion nodes,
8595 * while they are missing from the union map representation of
8596 * the tree without expansion nodes.
8598 * Also check that the global expansion is as expected.
8600 static int test_schedule_tree_group_2(isl_ctx
*ctx
)
8602 int equal
, equal_expansion
;
8605 isl_union_set
*uset
;
8606 isl_union_map
*umap1
, *umap2
;
8607 isl_union_map
*expansion1
, *expansion2
;
8608 isl_union_set_list
*filters
;
8609 isl_multi_union_pw_aff
*mupa
;
8610 isl_schedule
*schedule
;
8611 isl_schedule_node
*node
;
8613 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; "
8614 "S3[i,j] : 0 <= i,j < 10 }";
8615 uset
= isl_union_set_read_from_str(ctx
, str
);
8616 node
= isl_schedule_node_from_domain(uset
);
8617 node
= isl_schedule_node_child(node
, 0);
8618 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]";
8619 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8620 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
8621 node
= isl_schedule_node_child(node
, 0);
8622 str
= "{ S1[i,j] }";
8623 uset
= isl_union_set_read_from_str(ctx
, str
);
8624 filters
= isl_union_set_list_from_union_set(uset
);
8625 str
= "{ S2[i,j]; S3[i,j] }";
8626 uset
= isl_union_set_read_from_str(ctx
, str
);
8627 filters
= isl_union_set_list_add(filters
, uset
);
8628 node
= isl_schedule_node_insert_sequence(node
, filters
);
8629 node
= isl_schedule_node_child(node
, 1);
8630 node
= isl_schedule_node_child(node
, 0);
8631 str
= "{ S2[i,j] }";
8632 uset
= isl_union_set_read_from_str(ctx
, str
);
8633 filters
= isl_union_set_list_from_union_set(uset
);
8634 str
= "{ S3[i,j] }";
8635 uset
= isl_union_set_read_from_str(ctx
, str
);
8636 filters
= isl_union_set_list_add(filters
, uset
);
8637 node
= isl_schedule_node_insert_sequence(node
, filters
);
8639 schedule
= isl_schedule_node_get_schedule(node
);
8640 umap1
= isl_schedule_get_map(schedule
);
8641 uset
= isl_schedule_get_domain(schedule
);
8642 umap1
= isl_union_map_intersect_domain(umap1
, uset
);
8643 isl_schedule_free(schedule
);
8645 node
= isl_schedule_node_parent(node
);
8646 node
= isl_schedule_node_parent(node
);
8647 id
= isl_id_alloc(ctx
, "group1", NULL
);
8648 node
= isl_schedule_node_group(node
, id
);
8649 node
= isl_schedule_node_child(node
, 1);
8650 node
= isl_schedule_node_child(node
, 0);
8651 id
= isl_id_alloc(ctx
, "group2", NULL
);
8652 node
= isl_schedule_node_group(node
, id
);
8654 schedule
= isl_schedule_node_get_schedule(node
);
8655 umap2
= isl_schedule_get_map(schedule
);
8656 isl_schedule_free(schedule
);
8658 node
= isl_schedule_node_root(node
);
8659 node
= isl_schedule_node_child(node
, 0);
8660 expansion1
= isl_schedule_node_get_subtree_expansion(node
);
8661 isl_schedule_node_free(node
);
8663 str
= "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; "
8664 "group1[i] -> S2[i,j] : 0 <= i,j < 10; "
8665 "group1[i] -> S3[i,j] : 0 <= i,j < 10 }";
8667 expansion2
= isl_union_map_read_from_str(ctx
, str
);
8669 equal
= isl_union_map_is_equal(umap1
, umap2
);
8670 equal_expansion
= isl_union_map_is_equal(expansion1
, expansion2
);
8672 isl_union_map_free(umap1
);
8673 isl_union_map_free(umap2
);
8674 isl_union_map_free(expansion1
);
8675 isl_union_map_free(expansion2
);
8677 if (equal
< 0 || equal_expansion
< 0)
8680 isl_die(ctx
, isl_error_unknown
,
8681 "expressions not equal", return -1);
8682 if (!equal_expansion
)
8683 isl_die(ctx
, isl_error_unknown
,
8684 "unexpected expansion", return -1);
8689 /* Some tests for the isl_schedule_node_group function.
8691 static int test_schedule_tree_group(isl_ctx
*ctx
)
8693 if (test_schedule_tree_group_1(ctx
) < 0)
8695 if (test_schedule_tree_group_2(ctx
) < 0)
8704 { "{ rat: [i] : 0 <= i <= 10 }",
8705 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
8706 { "{ rat: [i] : FALSE }",
8707 "{ rat: coefficients[[cst] -> [a]] }" },
8709 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
8716 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
8717 "{ rat: [i] : 0 <= i <= 10 }" },
8718 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
8720 { "{ rat: coefficients[[cst] -> [a]] }",
8721 "{ rat: [i] : FALSE }" },
8724 /* Test the basic functionality of isl_basic_set_coefficients and
8725 * isl_basic_set_solutions.
8727 static int test_dual(isl_ctx
*ctx
)
8731 for (i
= 0; i
< ARRAY_SIZE(coef_tests
); ++i
) {
8733 isl_basic_set
*bset1
, *bset2
;
8735 bset1
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].set
);
8736 bset2
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].dual
);
8737 bset1
= isl_basic_set_coefficients(bset1
);
8738 equal
= isl_basic_set_is_equal(bset1
, bset2
);
8739 isl_basic_set_free(bset1
);
8740 isl_basic_set_free(bset2
);
8744 isl_die(ctx
, isl_error_unknown
,
8745 "incorrect dual", return -1);
8748 for (i
= 0; i
< ARRAY_SIZE(sol_tests
); ++i
) {
8750 isl_basic_set
*bset1
, *bset2
;
8752 bset1
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].set
);
8753 bset2
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].dual
);
8754 bset1
= isl_basic_set_solutions(bset1
);
8755 equal
= isl_basic_set_is_equal(bset1
, bset2
);
8756 isl_basic_set_free(bset1
);
8757 isl_basic_set_free(bset2
);
8761 isl_die(ctx
, isl_error_unknown
,
8762 "incorrect dual", return -1);
8772 const char *schedule
;
8777 { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
8778 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8780 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
8781 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8783 { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
8784 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8786 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
8787 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8789 { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
8790 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8792 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
8793 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
8795 { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
8796 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
8798 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
8799 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
8803 /* Basic tiling tests. Create a schedule tree with a domain and a band node,
8804 * tile the band and then check if the tile and point bands have the
8805 * expected partial schedule.
8807 static int test_tile(isl_ctx
*ctx
)
8813 scale
= isl_options_get_tile_scale_tile_loops(ctx
);
8814 shift
= isl_options_get_tile_shift_point_loops(ctx
);
8816 for (i
= 0; i
< ARRAY_SIZE(tile_tests
); ++i
) {
8820 isl_union_set
*domain
;
8821 isl_multi_union_pw_aff
*mupa
, *mupa2
;
8822 isl_schedule_node
*node
;
8823 isl_multi_val
*sizes
;
8825 opt
= tile_tests
[i
].scale_tile
;
8826 isl_options_set_tile_scale_tile_loops(ctx
, opt
);
8827 opt
= tile_tests
[i
].shift_point
;
8828 isl_options_set_tile_shift_point_loops(ctx
, opt
);
8830 str
= tile_tests
[i
].domain
;
8831 domain
= isl_union_set_read_from_str(ctx
, str
);
8832 node
= isl_schedule_node_from_domain(domain
);
8833 node
= isl_schedule_node_child(node
, 0);
8834 str
= tile_tests
[i
].schedule
;
8835 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8836 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
8837 str
= tile_tests
[i
].sizes
;
8838 sizes
= isl_multi_val_read_from_str(ctx
, str
);
8839 node
= isl_schedule_node_band_tile(node
, sizes
);
8841 str
= tile_tests
[i
].tile
;
8842 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8843 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
8844 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
, mupa2
);
8845 isl_multi_union_pw_aff_free(mupa
);
8846 isl_multi_union_pw_aff_free(mupa2
);
8848 node
= isl_schedule_node_child(node
, 0);
8850 str
= tile_tests
[i
].point
;
8851 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
8852 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
8853 if (equal
>= 0 && equal
)
8854 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
,
8856 isl_multi_union_pw_aff_free(mupa
);
8857 isl_multi_union_pw_aff_free(mupa2
);
8859 isl_schedule_node_free(node
);
8864 isl_die(ctx
, isl_error_unknown
,
8865 "unexpected result", return -1);
8868 isl_options_set_tile_scale_tile_loops(ctx
, scale
);
8869 isl_options_set_tile_shift_point_loops(ctx
, shift
);
8874 /* Check that the domain hash of a space is equal to the hash
8875 * of the domain of the space.
8877 static int test_domain_hash(isl_ctx
*ctx
)
8881 uint32_t hash1
, hash2
;
8883 map
= isl_map_read_from_str(ctx
, "[n] -> { A[B[x] -> C[]] -> D[] }");
8884 space
= isl_map_get_space(map
);
8886 hash1
= isl_space_get_domain_hash(space
);
8887 space
= isl_space_domain(space
);
8888 hash2
= isl_space_get_hash(space
);
8889 isl_space_free(space
);
8894 isl_die(ctx
, isl_error_unknown
,
8895 "domain hash not equal to hash of domain", return -1);
8900 /* Check that a universe basic set that is not obviously equal to the universe
8901 * is still recognized as being equal to the universe.
8903 static int test_universe(isl_ctx
*ctx
)
8906 isl_basic_set
*bset
;
8909 s
= "{ [] : exists x, y : 3y <= 2x and y >= -3 + 2x and 2y >= 2 - x }";
8910 bset
= isl_basic_set_read_from_str(ctx
, s
);
8911 is_univ
= isl_basic_set_is_universe(bset
);
8912 isl_basic_set_free(bset
);
8917 isl_die(ctx
, isl_error_unknown
,
8918 "not recognized as universe set", return -1);
8923 /* Sets for which chambers are computed and checked.
8925 const char *chambers_tests
[] = {
8926 "[A, B, C] -> { [x, y, z] : x >= 0 and y >= 0 and y <= A - x and "
8927 "z >= 0 and z <= C - y and z <= B - x - y }",
8930 /* Add the domain of "cell" to "cells".
8932 static isl_stat
add_cell(__isl_take isl_cell
*cell
, void *user
)
8934 isl_basic_set_list
**cells
= user
;
8937 dom
= isl_cell_get_domain(cell
);
8938 isl_cell_free(cell
);
8939 *cells
= isl_basic_set_list_add(*cells
, dom
);
8941 return *cells
? isl_stat_ok
: isl_stat_error
;
8944 /* Check that the elements of "list" are pairwise disjoint.
8946 static isl_stat
check_pairwise_disjoint(__isl_keep isl_basic_set_list
*list
)
8951 return isl_stat_error
;
8953 n
= isl_basic_set_list_n_basic_set(list
);
8954 for (i
= 0; i
< n
; ++i
) {
8955 isl_basic_set
*bset_i
;
8957 bset_i
= isl_basic_set_list_get_basic_set(list
, i
);
8958 for (j
= i
+ 1; j
< n
; ++j
) {
8959 isl_basic_set
*bset_j
;
8962 bset_j
= isl_basic_set_list_get_basic_set(list
, j
);
8963 disjoint
= isl_basic_set_is_disjoint(bset_i
, bset_j
);
8964 isl_basic_set_free(bset_j
);
8966 isl_die(isl_basic_set_list_get_ctx(list
),
8967 isl_error_unknown
, "not disjoint",
8969 if (disjoint
< 0 || !disjoint
)
8972 isl_basic_set_free(bset_i
);
8974 return isl_stat_error
;
8980 /* Check that the chambers computed by isl_vertices_foreach_disjoint_cell
8981 * are pairwise disjoint.
8983 static int test_chambers(isl_ctx
*ctx
)
8987 for (i
= 0; i
< ARRAY_SIZE(chambers_tests
); ++i
) {
8988 isl_basic_set
*bset
;
8989 isl_vertices
*vertices
;
8990 isl_basic_set_list
*cells
;
8993 bset
= isl_basic_set_read_from_str(ctx
, chambers_tests
[i
]);
8994 vertices
= isl_basic_set_compute_vertices(bset
);
8995 cells
= isl_basic_set_list_alloc(ctx
, 0);
8996 if (isl_vertices_foreach_disjoint_cell(vertices
, &add_cell
,
8998 cells
= isl_basic_set_list_free(cells
);
8999 ok
= check_pairwise_disjoint(cells
);
9000 isl_basic_set_list_free(cells
);
9001 isl_vertices_free(vertices
);
9002 isl_basic_set_free(bset
);
9013 int (*fn
)(isl_ctx
*ctx
);
9015 { "universe", &test_universe
},
9016 { "domain hash", &test_domain_hash
},
9017 { "dual", &test_dual
},
9018 { "dependence analysis", &test_flow
},
9019 { "val", &test_val
},
9020 { "compute divs", &test_compute_divs
},
9021 { "partial lexmin", &test_partial_lexmin
},
9022 { "simplify", &test_simplify
},
9023 { "curry", &test_curry
},
9024 { "piecewise multi affine expressions", &test_pw_multi_aff
},
9025 { "multi piecewise affine expressions", &test_multi_pw_aff
},
9026 { "conversion", &test_conversion
},
9027 { "list", &test_list
},
9028 { "align parameters", &test_align_parameters
},
9029 { "drop unused parameters", &test_drop_unused_parameters
},
9030 { "preimage", &test_preimage
},
9031 { "pullback", &test_pullback
},
9032 { "AST", &test_ast
},
9033 { "AST build", &test_ast_build
},
9034 { "AST generation", &test_ast_gen
},
9035 { "eliminate", &test_eliminate
},
9036 { "residue class", &test_residue_class
},
9037 { "div", &test_div
},
9038 { "slice", &test_slice
},
9039 { "fixed power", &test_fixed_power
},
9040 { "sample", &test_sample
},
9041 { "output", &test_output
},
9042 { "vertices", &test_vertices
},
9043 { "chambers", &test_chambers
},
9044 { "fixed", &test_fixed
},
9045 { "equal", &test_equal
},
9046 { "disjoint", &test_disjoint
},
9047 { "product", &test_product
},
9048 { "dim_max", &test_dim_max
},
9049 { "affine", &test_aff
},
9050 { "injective", &test_injective
},
9051 { "schedule (whole component)", &test_schedule_whole
},
9052 { "schedule (incremental)", &test_schedule_incremental
},
9053 { "schedule tree", &test_schedule_tree
},
9054 { "schedule tree prefix", &test_schedule_tree_prefix
},
9055 { "schedule tree grouping", &test_schedule_tree_group
},
9056 { "tile", &test_tile
},
9057 { "union_pw", &test_union_pw
},
9058 { "locus", &test_locus
},
9059 { "eval", &test_eval
},
9060 { "parse", &test_parse
},
9061 { "single-valued", &test_sv
},
9062 { "affine hull", &test_affine_hull
},
9063 { "simple_hull", &test_simple_hull
},
9064 { "coalesce", &test_coalesce
},
9065 { "factorize", &test_factorize
},
9066 { "subset", &test_subset
},
9067 { "subtract", &test_subtract
},
9068 { "intersect", &test_intersect
},
9069 { "lexmin", &test_lexmin
},
9070 { "min", &test_min
},
9071 { "gist", &test_gist
},
9072 { "piecewise quasi-polynomials", &test_pwqp
},
9073 { "lift", &test_lift
},
9074 { "bound", &test_bound
},
9075 { "union", &test_union
},
9076 { "split periods", &test_split_periods
},
9077 { "lexicographic order", &test_lex
},
9078 { "bijectivity", &test_bijective
},
9079 { "dataflow analysis", &test_dep
},
9080 { "reading", &test_read
},
9081 { "bounded", &test_bounded
},
9082 { "construction", &test_construction
},
9083 { "dimension manipulation", &test_dim
},
9084 { "map application", &test_application
},
9085 { "convex hull", &test_convex_hull
},
9086 { "transitive closure", &test_closure
},
9089 int main(int argc
, char **argv
)
9092 struct isl_ctx
*ctx
;
9093 struct isl_options
*options
;
9095 options
= isl_options_new_with_defaults();
9097 argc
= isl_options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
9099 ctx
= isl_ctx_alloc_with_options(&isl_options_args
, options
);
9100 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
9101 printf("%s\n", tests
[i
].name
);
9102 if (tests
[i
].fn(ctx
) < 0)