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>
27 #include <isl_constraint_private.h>
28 #include <isl/polynomial.h>
29 #include <isl/union_set.h>
30 #include <isl/union_map.h>
31 #include <isl_factorization.h>
32 #include <isl/schedule.h>
33 #include <isl/schedule_node.h>
34 #include <isl_options_private.h>
35 #include <isl_vertices_private.h>
36 #include <isl/ast_build.h>
39 #include <isl_ast_build_expr.h>
40 #include <isl/options.h>
42 #include "isl_srcdir.c"
44 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
46 static char *get_filename(isl_ctx
*ctx
, const char *name
, const char *suffix
) {
49 char *pattern
= "%s/test_inputs/%s.%s";
51 length
= strlen(pattern
) - 6 + strlen(srcdir
) + strlen(name
)
53 filename
= isl_alloc_array(ctx
, char, length
);
58 sprintf(filename
, pattern
, srcdir
, name
, suffix
);
63 void test_parse_map(isl_ctx
*ctx
, const char *str
)
67 map
= isl_map_read_from_str(ctx
, str
);
72 int test_parse_map_equal(isl_ctx
*ctx
, const char *str
, const char *str2
)
77 map
= isl_map_read_from_str(ctx
, str
);
78 map2
= isl_map_read_from_str(ctx
, str2
);
79 equal
= isl_map_is_equal(map
, map2
);
86 isl_die(ctx
, isl_error_unknown
, "maps not equal",
92 void test_parse_pwqp(isl_ctx
*ctx
, const char *str
)
94 isl_pw_qpolynomial
*pwqp
;
96 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
98 isl_pw_qpolynomial_free(pwqp
);
101 static void test_parse_pwaff(isl_ctx
*ctx
, const char *str
)
105 pwaff
= isl_pw_aff_read_from_str(ctx
, str
);
107 isl_pw_aff_free(pwaff
);
110 /* Check that we can read an isl_multi_val from "str" without errors.
112 static int test_parse_multi_val(isl_ctx
*ctx
, const char *str
)
116 mv
= isl_multi_val_read_from_str(ctx
, str
);
117 isl_multi_val_free(mv
);
122 /* Pairs of binary relation representations that should represent
123 * the same binary relations.
128 } parse_map_equal_tests
[] = {
129 { "{ [x,y] : [([x/2]+y)/3] >= 1 }",
130 "{ [x, y] : 2y >= 6 - x }" },
131 { "{ [x,y] : x <= min(y, 2*y+3) }",
132 "{ [x,y] : x <= y, 2*y + 3 }" },
133 { "{ [x,y] : x >= min(y, 2*y+3) }",
134 "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }" },
135 { "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }",
136 "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }" },
137 { "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }",
138 "{ [i,j] -> [min(i,j)] }" },
139 { "{ [i,j] : i != j }",
140 "{ [i,j] : i < j or i > j }" },
141 { "{ [i,j] : (i+1)*2 >= j }",
142 "{ [i, j] : j <= 2 + 2i }" },
143 { "{ [i] -> [i > 0 ? 4 : 5] }",
144 "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }" },
145 { "[N=2,M] -> { [i=[(M+N)/4]] }",
146 "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }" },
147 { "{ [x] : x >= 0 }",
148 "{ [x] : x-0 >= 0 }" },
149 { "{ [i] : ((i > 10)) }",
150 "{ [i] : i >= 11 }" },
152 "{ [i] -> [0 * i] }" },
153 { "{ [a] -> [b] : (not false) }",
154 "{ [a] -> [b] : true }" },
155 { "{ [i] : i/2 <= 5 }",
156 "{ [i] : i <= 10 }" },
157 { "{Sym=[n] [i] : i <= n }",
158 "[n] -> { [i] : i <= n }" },
161 { "{ [i] : 2*floor(i/2) = i }",
162 "{ [i] : exists a : i = 2 a }" },
163 { "{ [a] -> [b] : a = 5 implies b = 5 }",
164 "{ [a] -> [b] : a != 5 or b = 5 }" },
165 { "{ [a] -> [a - 1 : a > 0] }",
166 "{ [a] -> [a - 1] : a > 0 }" },
167 { "{ [a] -> [a - 1 : a > 0; a : a <= 0] }",
168 "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }" },
169 { "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }",
170 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
171 { "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }",
172 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
173 { "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }",
174 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
175 { "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }",
176 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
177 { "{ [a,b] -> [i,j] : a,b << i,j }",
178 "{ [a,b] -> [i,j] : a < i or (a = i and b < j) }" },
179 { "{ [a,b] -> [i,j] : a,b <<= i,j }",
180 "{ [a,b] -> [i,j] : a < i or (a = i and b <= j) }" },
181 { "{ [a,b] -> [i,j] : a,b >> i,j }",
182 "{ [a,b] -> [i,j] : a > i or (a = i and b > j) }" },
183 { "{ [a,b] -> [i,j] : a,b >>= i,j }",
184 "{ [a,b] -> [i,j] : a > i or (a = i and b >= j) }" },
185 { "{ [n] -> [i] : exists (a, b, c: 8b <= i - 32a and "
186 "8b >= -7 + i - 32 a and b >= 0 and b <= 3 and "
187 "8c < n - 32a and i < n and c >= 0 and "
188 "c <= 3 and c >= -4a) }",
189 "{ [n] -> [i] : 0 <= i < n }" },
190 { "{ [x] -> [] : exists (a, b: 0 <= a <= 1 and 0 <= b <= 3 and "
191 "2b <= x - 8a and 2b >= -1 + x - 8a) }",
192 "{ [x] -> [] : 0 <= x <= 15 }" },
195 int test_parse(struct isl_ctx
*ctx
)
199 const char *str
, *str2
;
201 if (test_parse_multi_val(ctx
, "{ A[B[2] -> C[5, 7]] }") < 0)
203 if (test_parse_multi_val(ctx
, "[n] -> { [2] }") < 0)
205 if (test_parse_multi_val(ctx
, "{ A[4, infty, NaN, -1/2, 2/3] }") < 0)
208 str
= "{ [i] -> [-i] }";
209 map
= isl_map_read_from_str(ctx
, str
);
213 str
= "{ A[i] -> L[([i/3])] }";
214 map
= isl_map_read_from_str(ctx
, str
);
218 test_parse_map(ctx
, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
219 test_parse_map(ctx
, "{ [p1, y1, y2] -> [2, y1, y2] : "
220 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
222 for (i
= 0; i
< ARRAY_SIZE(parse_map_equal_tests
); ++i
) {
223 str
= parse_map_equal_tests
[i
].map1
;
224 str2
= parse_map_equal_tests
[i
].map2
;
225 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
229 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
230 map
= isl_map_read_from_str(ctx
, str
);
231 str
= "{ [new, old] -> [o0, o1] : "
232 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
233 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
234 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
235 map2
= isl_map_read_from_str(ctx
, str
);
236 assert(isl_map_is_equal(map
, map2
));
240 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
241 map
= isl_map_read_from_str(ctx
, str
);
242 str
= "{[new,old] -> [(new+1)%2,(old+1)%2]}";
243 map2
= isl_map_read_from_str(ctx
, str
);
244 assert(isl_map_is_equal(map
, map2
));
248 test_parse_pwqp(ctx
, "{ [i] -> i + [ (i + [i/3])/2 ] }");
249 test_parse_map(ctx
, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
250 test_parse_pwaff(ctx
, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
251 test_parse_pwqp(ctx
, "{ [x] -> ([(x)/2] * [(x)/3]) }");
252 test_parse_pwaff(ctx
, "{ [] -> [(100)] }");
257 static int test_read(isl_ctx
*ctx
)
261 isl_basic_set
*bset1
, *bset2
;
262 const char *str
= "{[y]: Exists ( alpha : 2alpha = y)}";
265 filename
= get_filename(ctx
, "set", "omega");
267 input
= fopen(filename
, "r");
270 bset1
= isl_basic_set_read_from_file(ctx
, input
);
271 bset2
= isl_basic_set_read_from_str(ctx
, str
);
273 equal
= isl_basic_set_is_equal(bset1
, bset2
);
275 isl_basic_set_free(bset1
);
276 isl_basic_set_free(bset2
);
284 isl_die(ctx
, isl_error_unknown
,
285 "read sets not equal", return -1);
290 static int test_bounded(isl_ctx
*ctx
)
295 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : 0 <= i <= n }");
296 bounded
= isl_set_is_bounded(set
);
302 isl_die(ctx
, isl_error_unknown
,
303 "set not considered bounded", return -1);
305 set
= isl_set_read_from_str(ctx
, "{[n, i] : 0 <= i <= n }");
306 bounded
= isl_set_is_bounded(set
);
313 isl_die(ctx
, isl_error_unknown
,
314 "set considered bounded", return -1);
316 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : i <= n }");
317 bounded
= isl_set_is_bounded(set
);
323 isl_die(ctx
, isl_error_unknown
,
324 "set considered bounded", return -1);
329 /* Construct the basic set { [i] : 5 <= i <= N } */
330 static int test_construction(isl_ctx
*ctx
)
340 dim
= isl_space_set_alloc(ctx
, 1, 1);
341 bset
= isl_basic_set_universe(isl_space_copy(dim
));
342 ls
= isl_local_space_from_space(dim
);
344 c
= isl_constraint_alloc_inequality(isl_local_space_copy(ls
));
345 isl_int_set_si(v
, -1);
346 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
347 isl_int_set_si(v
, 1);
348 isl_constraint_set_coefficient(c
, isl_dim_param
, 0, v
);
349 bset
= isl_basic_set_add_constraint(bset
, c
);
351 c
= isl_constraint_alloc_inequality(isl_local_space_copy(ls
));
352 isl_int_set_si(v
, 1);
353 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
354 isl_int_set_si(v
, -5);
355 isl_constraint_set_constant(c
, v
);
356 bset
= isl_basic_set_add_constraint(bset
, c
);
358 isl_local_space_free(ls
);
359 isl_basic_set_free(bset
);
366 static int test_dim(isl_ctx
*ctx
)
369 isl_map
*map1
, *map2
;
372 map1
= isl_map_read_from_str(ctx
,
373 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
374 map1
= isl_map_add_dims(map1
, isl_dim_in
, 1);
375 map2
= isl_map_read_from_str(ctx
,
376 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
377 equal
= isl_map_is_equal(map1
, map2
);
380 map1
= isl_map_project_out(map1
, isl_dim_in
, 0, 1);
381 map2
= isl_map_read_from_str(ctx
, "[n] -> { [i] -> [j] : n >= 0 }");
382 if (equal
>= 0 && equal
)
383 equal
= isl_map_is_equal(map1
, map2
);
391 isl_die(ctx
, isl_error_unknown
,
392 "unexpected result", return -1);
394 str
= "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
395 map1
= isl_map_read_from_str(ctx
, str
);
396 str
= "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
397 map2
= isl_map_read_from_str(ctx
, str
);
398 map1
= isl_map_move_dims(map1
, isl_dim_out
, 0, isl_dim_param
, 0, 1);
399 equal
= isl_map_is_equal(map1
, map2
);
406 isl_die(ctx
, isl_error_unknown
,
407 "unexpected result", return -1);
413 __isl_give isl_val
*(*op
)(__isl_take isl_val
*v
);
417 { &isl_val_neg
, "0", "0" },
418 { &isl_val_abs
, "0", "0" },
419 { &isl_val_2exp
, "0", "1" },
420 { &isl_val_floor
, "0", "0" },
421 { &isl_val_ceil
, "0", "0" },
422 { &isl_val_neg
, "1", "-1" },
423 { &isl_val_neg
, "-1", "1" },
424 { &isl_val_neg
, "1/2", "-1/2" },
425 { &isl_val_neg
, "-1/2", "1/2" },
426 { &isl_val_neg
, "infty", "-infty" },
427 { &isl_val_neg
, "-infty", "infty" },
428 { &isl_val_neg
, "NaN", "NaN" },
429 { &isl_val_abs
, "1", "1" },
430 { &isl_val_abs
, "-1", "1" },
431 { &isl_val_abs
, "1/2", "1/2" },
432 { &isl_val_abs
, "-1/2", "1/2" },
433 { &isl_val_abs
, "infty", "infty" },
434 { &isl_val_abs
, "-infty", "infty" },
435 { &isl_val_abs
, "NaN", "NaN" },
436 { &isl_val_floor
, "1", "1" },
437 { &isl_val_floor
, "-1", "-1" },
438 { &isl_val_floor
, "1/2", "0" },
439 { &isl_val_floor
, "-1/2", "-1" },
440 { &isl_val_floor
, "infty", "infty" },
441 { &isl_val_floor
, "-infty", "-infty" },
442 { &isl_val_floor
, "NaN", "NaN" },
443 { &isl_val_ceil
, "1", "1" },
444 { &isl_val_ceil
, "-1", "-1" },
445 { &isl_val_ceil
, "1/2", "1" },
446 { &isl_val_ceil
, "-1/2", "0" },
447 { &isl_val_ceil
, "infty", "infty" },
448 { &isl_val_ceil
, "-infty", "-infty" },
449 { &isl_val_ceil
, "NaN", "NaN" },
450 { &isl_val_2exp
, "-3", "1/8" },
451 { &isl_val_2exp
, "-1", "1/2" },
452 { &isl_val_2exp
, "1", "2" },
453 { &isl_val_2exp
, "2", "4" },
454 { &isl_val_2exp
, "3", "8" },
455 { &isl_val_inv
, "1", "1" },
456 { &isl_val_inv
, "2", "1/2" },
457 { &isl_val_inv
, "1/2", "2" },
458 { &isl_val_inv
, "-2", "-1/2" },
459 { &isl_val_inv
, "-1/2", "-2" },
460 { &isl_val_inv
, "0", "NaN" },
461 { &isl_val_inv
, "NaN", "NaN" },
462 { &isl_val_inv
, "infty", "0" },
463 { &isl_val_inv
, "-infty", "0" },
466 /* Perform some basic tests of unary operations on isl_val objects.
468 static int test_un_val(isl_ctx
*ctx
)
472 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v
);
475 for (i
= 0; i
< ARRAY_SIZE(val_un_tests
); ++i
) {
476 v
= isl_val_read_from_str(ctx
, val_un_tests
[i
].arg
);
477 res
= isl_val_read_from_str(ctx
, val_un_tests
[i
].res
);
478 fn
= val_un_tests
[i
].op
;
480 if (isl_val_is_nan(res
))
481 ok
= isl_val_is_nan(v
);
483 ok
= isl_val_eq(v
, res
);
489 isl_die(ctx
, isl_error_unknown
,
490 "unexpected result", return -1);
497 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
498 __isl_take isl_val
*v2
);
500 ['+'] = { &isl_val_add
},
501 ['-'] = { &isl_val_sub
},
502 ['*'] = { &isl_val_mul
},
503 ['/'] = { &isl_val_div
},
504 ['g'] = { &isl_val_gcd
},
505 ['m'] = { &isl_val_min
},
506 ['M'] = { &isl_val_max
},
514 } val_bin_tests
[] = {
515 { "0", '+', "0", "0" },
516 { "1", '+', "0", "1" },
517 { "1", '+', "1", "2" },
518 { "1", '-', "1", "0" },
519 { "1", '*', "1", "1" },
520 { "1", '/', "1", "1" },
521 { "2", '*', "3", "6" },
522 { "2", '*', "1/2", "1" },
523 { "2", '*', "1/3", "2/3" },
524 { "2/3", '*', "3/5", "2/5" },
525 { "2/3", '*', "7/5", "14/15" },
526 { "2", '/', "1/2", "4" },
527 { "-2", '/', "-1/2", "4" },
528 { "-2", '/', "1/2", "-4" },
529 { "2", '/', "-1/2", "-4" },
530 { "2", '/', "2", "1" },
531 { "2", '/', "3", "2/3" },
532 { "2/3", '/', "5/3", "2/5" },
533 { "2/3", '/', "5/7", "14/15" },
534 { "0", '/', "0", "NaN" },
535 { "42", '/', "0", "NaN" },
536 { "-42", '/', "0", "NaN" },
537 { "infty", '/', "0", "NaN" },
538 { "-infty", '/', "0", "NaN" },
539 { "NaN", '/', "0", "NaN" },
540 { "0", '/', "NaN", "NaN" },
541 { "42", '/', "NaN", "NaN" },
542 { "-42", '/', "NaN", "NaN" },
543 { "infty", '/', "NaN", "NaN" },
544 { "-infty", '/', "NaN", "NaN" },
545 { "NaN", '/', "NaN", "NaN" },
546 { "0", '/', "infty", "0" },
547 { "42", '/', "infty", "0" },
548 { "-42", '/', "infty", "0" },
549 { "infty", '/', "infty", "NaN" },
550 { "-infty", '/', "infty", "NaN" },
551 { "NaN", '/', "infty", "NaN" },
552 { "0", '/', "-infty", "0" },
553 { "42", '/', "-infty", "0" },
554 { "-42", '/', "-infty", "0" },
555 { "infty", '/', "-infty", "NaN" },
556 { "-infty", '/', "-infty", "NaN" },
557 { "NaN", '/', "-infty", "NaN" },
558 { "1", '-', "1/3", "2/3" },
559 { "1/3", '+', "1/2", "5/6" },
560 { "1/2", '+', "1/2", "1" },
561 { "3/4", '-', "1/4", "1/2" },
562 { "1/2", '-', "1/3", "1/6" },
563 { "infty", '+', "42", "infty" },
564 { "infty", '+', "infty", "infty" },
565 { "42", '+', "infty", "infty" },
566 { "infty", '-', "infty", "NaN" },
567 { "infty", '*', "infty", "infty" },
568 { "infty", '*', "-infty", "-infty" },
569 { "-infty", '*', "infty", "-infty" },
570 { "-infty", '*', "-infty", "infty" },
571 { "0", '*', "infty", "NaN" },
572 { "1", '*', "infty", "infty" },
573 { "infty", '*', "0", "NaN" },
574 { "infty", '*', "42", "infty" },
575 { "42", '-', "infty", "-infty" },
576 { "infty", '+', "-infty", "NaN" },
577 { "4", 'g', "6", "2" },
578 { "5", 'g', "6", "1" },
579 { "42", 'm', "3", "3" },
580 { "42", 'M', "3", "42" },
581 { "3", 'm', "42", "3" },
582 { "3", 'M', "42", "42" },
583 { "42", 'm', "infty", "42" },
584 { "42", 'M', "infty", "infty" },
585 { "42", 'm', "-infty", "-infty" },
586 { "42", 'M', "-infty", "42" },
587 { "42", 'm', "NaN", "NaN" },
588 { "42", 'M', "NaN", "NaN" },
589 { "infty", 'm', "-infty", "-infty" },
590 { "infty", 'M', "-infty", "infty" },
593 /* Perform some basic tests of binary operations on isl_val objects.
595 static int test_bin_val(isl_ctx
*ctx
)
598 isl_val
*v1
, *v2
, *res
;
599 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
600 __isl_take isl_val
*v2
);
603 for (i
= 0; i
< ARRAY_SIZE(val_bin_tests
); ++i
) {
604 v1
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg1
);
605 v2
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg2
);
606 res
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].res
);
607 fn
= val_bin_op
[val_bin_tests
[i
].op
].fn
;
609 if (isl_val_is_nan(res
))
610 ok
= isl_val_is_nan(v1
);
612 ok
= isl_val_eq(v1
, res
);
618 isl_die(ctx
, isl_error_unknown
,
619 "unexpected result", return -1);
625 /* Perform some basic tests on isl_val objects.
627 static int test_val(isl_ctx
*ctx
)
629 if (test_un_val(ctx
) < 0)
631 if (test_bin_val(ctx
) < 0)
636 /* Sets described using existentially quantified variables that
637 * can also be described without.
639 static const char *elimination_tests
[] = {
640 "{ [i,j] : 2 * [i/2] + 3 * [j/4] <= 10 and 2 i = j }",
641 "{ [m, w] : exists a : w - 2m - 5 <= 3a <= m - 2w }",
642 "{ [m, w] : exists a : w >= 0 and a < m and -1 + w <= a <= 2m - w }",
645 /* Check that redundant existentially quantified variables are
648 static int test_elimination(isl_ctx
*ctx
)
654 for (i
= 0; i
< ARRAY_SIZE(elimination_tests
); ++i
) {
655 bset
= isl_basic_set_read_from_str(ctx
, elimination_tests
[i
]);
656 n
= isl_basic_set_dim(bset
, isl_dim_div
);
657 isl_basic_set_free(bset
);
661 isl_die(ctx
, isl_error_unknown
,
662 "expecting no existentials", return -1);
668 static int test_div(isl_ctx
*ctx
)
676 struct isl_basic_set
*bset
;
677 struct isl_constraint
*c
;
682 dim
= isl_space_set_alloc(ctx
, 0, 3);
683 bset
= isl_basic_set_universe(isl_space_copy(dim
));
684 ls
= isl_local_space_from_space(dim
);
686 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
687 isl_int_set_si(v
, -1);
688 isl_constraint_set_constant(c
, v
);
689 isl_int_set_si(v
, 1);
690 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
691 isl_int_set_si(v
, 3);
692 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
693 bset
= isl_basic_set_add_constraint(bset
, c
);
695 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
696 isl_int_set_si(v
, 1);
697 isl_constraint_set_constant(c
, v
);
698 isl_int_set_si(v
, -1);
699 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
700 isl_int_set_si(v
, 3);
701 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
702 bset
= isl_basic_set_add_constraint(bset
, c
);
704 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
706 assert(bset
&& bset
->n_div
== 1);
707 isl_local_space_free(ls
);
708 isl_basic_set_free(bset
);
711 dim
= isl_space_set_alloc(ctx
, 0, 3);
712 bset
= isl_basic_set_universe(isl_space_copy(dim
));
713 ls
= isl_local_space_from_space(dim
);
715 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
716 isl_int_set_si(v
, 1);
717 isl_constraint_set_constant(c
, v
);
718 isl_int_set_si(v
, -1);
719 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
720 isl_int_set_si(v
, 3);
721 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
722 bset
= isl_basic_set_add_constraint(bset
, c
);
724 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
725 isl_int_set_si(v
, -1);
726 isl_constraint_set_constant(c
, v
);
727 isl_int_set_si(v
, 1);
728 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
729 isl_int_set_si(v
, 3);
730 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
731 bset
= isl_basic_set_add_constraint(bset
, c
);
733 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
735 assert(bset
&& bset
->n_div
== 1);
736 isl_local_space_free(ls
);
737 isl_basic_set_free(bset
);
740 dim
= isl_space_set_alloc(ctx
, 0, 3);
741 bset
= isl_basic_set_universe(isl_space_copy(dim
));
742 ls
= isl_local_space_from_space(dim
);
744 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
745 isl_int_set_si(v
, 1);
746 isl_constraint_set_constant(c
, v
);
747 isl_int_set_si(v
, -1);
748 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
749 isl_int_set_si(v
, 3);
750 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
751 bset
= isl_basic_set_add_constraint(bset
, c
);
753 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
754 isl_int_set_si(v
, -3);
755 isl_constraint_set_constant(c
, v
);
756 isl_int_set_si(v
, 1);
757 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
758 isl_int_set_si(v
, 4);
759 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
760 bset
= isl_basic_set_add_constraint(bset
, c
);
762 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
764 assert(bset
&& bset
->n_div
== 1);
765 isl_local_space_free(ls
);
766 isl_basic_set_free(bset
);
769 dim
= isl_space_set_alloc(ctx
, 0, 3);
770 bset
= isl_basic_set_universe(isl_space_copy(dim
));
771 ls
= isl_local_space_from_space(dim
);
773 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
774 isl_int_set_si(v
, 2);
775 isl_constraint_set_constant(c
, v
);
776 isl_int_set_si(v
, -1);
777 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
778 isl_int_set_si(v
, 3);
779 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
780 bset
= isl_basic_set_add_constraint(bset
, c
);
782 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
783 isl_int_set_si(v
, -1);
784 isl_constraint_set_constant(c
, v
);
785 isl_int_set_si(v
, 1);
786 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
787 isl_int_set_si(v
, 6);
788 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
789 bset
= isl_basic_set_add_constraint(bset
, c
);
791 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
793 assert(isl_basic_set_is_empty(bset
));
794 isl_local_space_free(ls
);
795 isl_basic_set_free(bset
);
798 dim
= isl_space_set_alloc(ctx
, 0, 3);
799 bset
= isl_basic_set_universe(isl_space_copy(dim
));
800 ls
= isl_local_space_from_space(dim
);
802 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
803 isl_int_set_si(v
, -1);
804 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
805 isl_int_set_si(v
, 3);
806 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
807 bset
= isl_basic_set_add_constraint(bset
, c
);
809 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
810 isl_int_set_si(v
, 1);
811 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
812 isl_int_set_si(v
, -3);
813 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
814 bset
= isl_basic_set_add_constraint(bset
, c
);
816 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
818 assert(bset
&& bset
->n_div
== 0);
819 isl_basic_set_free(bset
);
820 isl_local_space_free(ls
);
823 dim
= isl_space_set_alloc(ctx
, 0, 3);
824 bset
= isl_basic_set_universe(isl_space_copy(dim
));
825 ls
= isl_local_space_from_space(dim
);
827 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
828 isl_int_set_si(v
, -1);
829 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
830 isl_int_set_si(v
, 6);
831 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
832 bset
= isl_basic_set_add_constraint(bset
, c
);
834 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
835 isl_int_set_si(v
, 1);
836 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
837 isl_int_set_si(v
, -3);
838 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
839 bset
= isl_basic_set_add_constraint(bset
, c
);
841 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
843 assert(bset
&& bset
->n_div
== 1);
844 isl_basic_set_free(bset
);
845 isl_local_space_free(ls
);
848 /* This test is a bit tricky. We set up an equality
850 * Normalization of divs creates _two_ divs
853 * Afterwards e0 is removed again because it has coefficient -1
854 * and we end up with the original equality and div again.
855 * Perhaps we can avoid the introduction of this temporary div.
857 dim
= isl_space_set_alloc(ctx
, 0, 4);
858 bset
= isl_basic_set_universe(isl_space_copy(dim
));
859 ls
= isl_local_space_from_space(dim
);
861 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
862 isl_int_set_si(v
, -1);
863 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
864 isl_int_set_si(v
, -3);
865 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
866 isl_int_set_si(v
, -3);
867 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
868 isl_int_set_si(v
, 6);
869 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
870 bset
= isl_basic_set_add_constraint(bset
, c
);
872 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
874 /* Test disabled for now */
876 assert(bset && bset->n_div == 1);
878 isl_local_space_free(ls
);
879 isl_basic_set_free(bset
);
882 dim
= isl_space_set_alloc(ctx
, 0, 5);
883 bset
= isl_basic_set_universe(isl_space_copy(dim
));
884 ls
= isl_local_space_from_space(dim
);
886 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
887 isl_int_set_si(v
, -1);
888 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
889 isl_int_set_si(v
, -3);
890 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
891 isl_int_set_si(v
, -3);
892 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
893 isl_int_set_si(v
, 6);
894 isl_constraint_set_coefficient(c
, isl_dim_set
, 4, v
);
895 bset
= isl_basic_set_add_constraint(bset
, c
);
897 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
898 isl_int_set_si(v
, -1);
899 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
900 isl_int_set_si(v
, 1);
901 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
902 isl_int_set_si(v
, 1);
903 isl_constraint_set_constant(c
, v
);
904 bset
= isl_basic_set_add_constraint(bset
, c
);
906 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
908 /* Test disabled for now */
910 assert(bset && bset->n_div == 1);
912 isl_local_space_free(ls
);
913 isl_basic_set_free(bset
);
916 dim
= isl_space_set_alloc(ctx
, 0, 4);
917 bset
= isl_basic_set_universe(isl_space_copy(dim
));
918 ls
= isl_local_space_from_space(dim
);
920 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
921 isl_int_set_si(v
, 1);
922 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
923 isl_int_set_si(v
, -1);
924 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
925 isl_int_set_si(v
, -2);
926 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
927 bset
= isl_basic_set_add_constraint(bset
, c
);
929 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
930 isl_int_set_si(v
, -1);
931 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
932 isl_int_set_si(v
, 3);
933 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
934 isl_int_set_si(v
, 2);
935 isl_constraint_set_constant(c
, v
);
936 bset
= isl_basic_set_add_constraint(bset
, c
);
938 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
940 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
942 assert(!isl_basic_set_is_empty(bset
));
944 isl_local_space_free(ls
);
945 isl_basic_set_free(bset
);
948 dim
= isl_space_set_alloc(ctx
, 0, 3);
949 bset
= isl_basic_set_universe(isl_space_copy(dim
));
950 ls
= isl_local_space_from_space(dim
);
952 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
953 isl_int_set_si(v
, 1);
954 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
955 isl_int_set_si(v
, -2);
956 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
957 bset
= isl_basic_set_add_constraint(bset
, c
);
959 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
961 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
963 isl_local_space_free(ls
);
964 isl_basic_set_free(bset
);
968 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
969 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
970 set
= isl_set_read_from_str(ctx
, str
);
971 set
= isl_set_compute_divs(set
);
976 if (test_elimination(ctx
) < 0)
979 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
980 set
= isl_set_read_from_str(ctx
, str
);
981 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
982 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
983 empty
= isl_set_is_empty(set
);
988 isl_die(ctx
, isl_error_unknown
,
989 "result not as accurate as expected", return -1);
994 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
998 struct isl_basic_set
*bset1
, *bset2
;
999 struct isl_basic_map
*bmap
;
1001 filename
= get_filename(ctx
, name
, "omega");
1003 input
= fopen(filename
, "r");
1006 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1007 bmap
= isl_basic_map_read_from_file(ctx
, input
);
1009 bset1
= isl_basic_set_apply(bset1
, bmap
);
1011 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1013 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1015 isl_basic_set_free(bset1
);
1016 isl_basic_set_free(bset2
);
1022 static int test_application(isl_ctx
*ctx
)
1024 test_application_case(ctx
, "application");
1025 test_application_case(ctx
, "application2");
1030 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
1034 struct isl_basic_set
*bset1
, *bset2
;
1036 filename
= get_filename(ctx
, name
, "polylib");
1038 input
= fopen(filename
, "r");
1041 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1042 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1044 bset1
= isl_basic_set_affine_hull(bset1
);
1046 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1048 isl_basic_set_free(bset1
);
1049 isl_basic_set_free(bset2
);
1055 int test_affine_hull(struct isl_ctx
*ctx
)
1059 isl_basic_set
*bset
, *bset2
;
1063 test_affine_hull_case(ctx
, "affine2");
1064 test_affine_hull_case(ctx
, "affine");
1065 test_affine_hull_case(ctx
, "affine3");
1067 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
1068 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1069 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1070 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1071 set
= isl_set_read_from_str(ctx
, str
);
1072 bset
= isl_set_affine_hull(set
);
1073 n
= isl_basic_set_dim(bset
, isl_dim_div
);
1074 isl_basic_set_free(bset
);
1076 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
1079 /* Check that isl_map_affine_hull is not confused by
1080 * the reordering of divs in isl_map_align_divs.
1082 str
= "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1083 "32e0 = b and 32e1 = c); "
1084 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1085 set
= isl_set_read_from_str(ctx
, str
);
1086 bset
= isl_set_affine_hull(set
);
1087 isl_basic_set_free(bset
);
1091 str
= "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1092 "32e2 = 31 + 31e0 }";
1093 set
= isl_set_read_from_str(ctx
, str
);
1094 bset
= isl_set_affine_hull(set
);
1095 str
= "{ [a] : exists e : a = 32 e }";
1096 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1097 subset
= isl_basic_set_is_subset(bset
, bset2
);
1098 isl_basic_set_free(bset
);
1099 isl_basic_set_free(bset2
);
1103 isl_die(ctx
, isl_error_unknown
, "not as accurate as expected",
1109 /* Pairs of maps and the corresponding expected results of
1110 * isl_map_plain_unshifted_simple_hull.
1115 } plain_unshifted_simple_hull_tests
[] = {
1116 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1117 "{ [i] -> [j] : i >= 1 }" },
1118 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1119 "(j mod 4 = 2 and k mod 6 = n) }",
1120 "{ [n] -> [i,j,k] : j mod 4 = 2 }" },
1123 /* Basic tests for isl_map_plain_unshifted_simple_hull.
1125 static int test_plain_unshifted_simple_hull(isl_ctx
*ctx
)
1129 isl_basic_map
*hull
, *expected
;
1132 for (i
= 0; i
< ARRAY_SIZE(plain_unshifted_simple_hull_tests
); ++i
) {
1134 str
= plain_unshifted_simple_hull_tests
[i
].map
;
1135 map
= isl_map_read_from_str(ctx
, str
);
1136 str
= plain_unshifted_simple_hull_tests
[i
].hull
;
1137 expected
= isl_basic_map_read_from_str(ctx
, str
);
1138 hull
= isl_map_plain_unshifted_simple_hull(map
);
1139 equal
= isl_basic_map_is_equal(hull
, expected
);
1140 isl_basic_map_free(hull
);
1141 isl_basic_map_free(expected
);
1145 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1152 /* Pairs of sets and the corresponding expected results of
1153 * isl_set_unshifted_simple_hull.
1158 } unshifted_simple_hull_tests
[] = {
1159 { "{ [0,x,y] : x <= -1; [1,x,y] : x <= y <= -x; [2,x,y] : x <= 1 }",
1160 "{ [t,x,y] : 0 <= t <= 2 and x <= 1 }" },
1163 /* Basic tests for isl_set_unshifted_simple_hull.
1165 static int test_unshifted_simple_hull(isl_ctx
*ctx
)
1169 isl_basic_set
*hull
, *expected
;
1172 for (i
= 0; i
< ARRAY_SIZE(unshifted_simple_hull_tests
); ++i
) {
1174 str
= unshifted_simple_hull_tests
[i
].set
;
1175 set
= isl_set_read_from_str(ctx
, str
);
1176 str
= unshifted_simple_hull_tests
[i
].hull
;
1177 expected
= isl_basic_set_read_from_str(ctx
, str
);
1178 hull
= isl_set_unshifted_simple_hull(set
);
1179 equal
= isl_basic_set_is_equal(hull
, expected
);
1180 isl_basic_set_free(hull
);
1181 isl_basic_set_free(expected
);
1185 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1192 static int test_simple_hull(struct isl_ctx
*ctx
)
1196 isl_basic_set
*bset
;
1199 str
= "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x;"
1200 "[y, x] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }";
1201 set
= isl_set_read_from_str(ctx
, str
);
1202 bset
= isl_set_simple_hull(set
);
1203 is_empty
= isl_basic_set_is_empty(bset
);
1204 isl_basic_set_free(bset
);
1206 if (is_empty
== isl_bool_error
)
1209 if (is_empty
== isl_bool_false
)
1210 isl_die(ctx
, isl_error_unknown
, "Empty set should be detected",
1213 if (test_plain_unshifted_simple_hull(ctx
) < 0)
1215 if (test_unshifted_simple_hull(ctx
) < 0)
1221 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
1225 struct isl_basic_set
*bset1
, *bset2
;
1226 struct isl_set
*set
;
1228 filename
= get_filename(ctx
, name
, "polylib");
1230 input
= fopen(filename
, "r");
1233 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1234 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1236 set
= isl_basic_set_union(bset1
, bset2
);
1237 bset1
= isl_set_convex_hull(set
);
1239 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1241 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1243 isl_basic_set_free(bset1
);
1244 isl_basic_set_free(bset2
);
1253 } convex_hull_tests
[] = {
1254 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1255 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1256 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1257 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1258 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1259 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1260 "i2 <= 5 and i2 >= 4; "
1261 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1262 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1263 "i2 <= 5 + i0 and i2 >= i0 }" },
1264 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1265 "{ [x, y] : 1 = 0 }" },
1266 { "{ [x, y, z] : 0 <= x, y, z <= 10; [x, y, 0] : x >= 0 and y > 0; "
1267 "[x, y, 0] : x >= 0 and y < 0 }",
1268 "{ [x, y, z] : x >= 0 and 0 <= z <= 10 }" },
1271 static int test_convex_hull_algo(isl_ctx
*ctx
, int convex
)
1274 int orig_convex
= ctx
->opt
->convex
;
1275 ctx
->opt
->convex
= convex
;
1277 test_convex_hull_case(ctx
, "convex0");
1278 test_convex_hull_case(ctx
, "convex1");
1279 test_convex_hull_case(ctx
, "convex2");
1280 test_convex_hull_case(ctx
, "convex3");
1281 test_convex_hull_case(ctx
, "convex4");
1282 test_convex_hull_case(ctx
, "convex5");
1283 test_convex_hull_case(ctx
, "convex6");
1284 test_convex_hull_case(ctx
, "convex7");
1285 test_convex_hull_case(ctx
, "convex8");
1286 test_convex_hull_case(ctx
, "convex9");
1287 test_convex_hull_case(ctx
, "convex10");
1288 test_convex_hull_case(ctx
, "convex11");
1289 test_convex_hull_case(ctx
, "convex12");
1290 test_convex_hull_case(ctx
, "convex13");
1291 test_convex_hull_case(ctx
, "convex14");
1292 test_convex_hull_case(ctx
, "convex15");
1294 for (i
= 0; i
< ARRAY_SIZE(convex_hull_tests
); ++i
) {
1295 isl_set
*set1
, *set2
;
1298 set1
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].set
);
1299 set2
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].hull
);
1300 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
1301 equal
= isl_set_is_equal(set1
, set2
);
1308 isl_die(ctx
, isl_error_unknown
,
1309 "unexpected convex hull", return -1);
1312 ctx
->opt
->convex
= orig_convex
;
1317 static int test_convex_hull(isl_ctx
*ctx
)
1319 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
) < 0)
1321 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
) < 0)
1326 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
1330 struct isl_basic_set
*bset1
, *bset2
;
1332 filename
= get_filename(ctx
, name
, "polylib");
1334 input
= fopen(filename
, "r");
1337 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1338 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1340 bset1
= isl_basic_set_gist(bset1
, bset2
);
1342 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1344 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1346 isl_basic_set_free(bset1
);
1347 isl_basic_set_free(bset2
);
1353 /* Inputs to isl_map_plain_gist_basic_map, along with the expected output.
1357 const char *context
;
1359 } plain_gist_tests
[] = {
1360 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1361 "{ [i] -> [j] : i >= 1 }",
1362 "{ [i] -> [j] : j >= 1 or i >= 2 and j <= 10 }" },
1363 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1364 "(j mod 4 = 2 and k mod 6 = n) }",
1365 "{ [n] -> [i,j,k] : j mod 4 = 2 }",
1366 "{ [n] -> [i,j,k] : (i mod 3 = 2) or (k mod 6 = n) }" },
1367 { "{ [i] -> [j] : i > j and (exists a,b : i <= 2a + 5b <= 2) }",
1368 "{ [i] -> [j] : i > j }",
1369 "{ [i] -> [j] : exists a,b : i <= 2a + 5b <= 2 }" },
1372 /* Basic tests for isl_map_plain_gist_basic_map.
1374 static int test_plain_gist(isl_ctx
*ctx
)
1378 for (i
= 0; i
< ARRAY_SIZE(plain_gist_tests
); ++i
) {
1381 isl_map
*map
, *gist
;
1382 isl_basic_map
*context
;
1384 map
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].map
);
1385 str
= plain_gist_tests
[i
].context
;
1386 context
= isl_basic_map_read_from_str(ctx
, str
);
1387 map
= isl_map_plain_gist_basic_map(map
, context
);
1388 gist
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].gist
);
1389 equal
= isl_map_is_equal(map
, gist
);
1395 isl_die(ctx
, isl_error_unknown
,
1396 "incorrect gist result", return -1);
1404 const char *context
;
1407 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1408 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1409 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1410 "{ [a, b, c] : a <= 15 }" },
1411 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1412 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1413 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1414 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1415 { "{ [m, n, a, b] : a <= 2147 + n }",
1416 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1417 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1418 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1420 "{ [m, n, ku, kl] }" },
1421 { "{ [a, a, b] : a >= 10 }",
1422 "{ [a, b, c] : c >= a and c <= b and c >= 2 }",
1423 "{ [a, a, b] : a >= 10 }" },
1424 { "{ [i, j] : i >= 0 and i + j >= 0 }", "{ [i, j] : i <= 0 }",
1425 "{ [0, j] : j >= 0 }" },
1426 /* Check that no constraints on i6 are introduced in the gist */
1427 { "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1428 "20e0 <= 1530 - 4t1 - 5i4 and 20e0 >= 1511 - 4t1 - 5i4 and "
1429 "5e0 <= 381 - t1 and i4 <= 1) }",
1430 "[t1] -> { [i4, i6] : exists (e0 = floor((-t1 + i6)/5): "
1431 "5e0 = -t1 + i6 and i6 <= 6 and i6 >= 3) }",
1432 "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1433 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 <= 1530 - 4t1 - 5i4 and "
1434 "20e0 >= 1511 - 4t1 - 5i4) }" },
1435 /* Check that no constraints on i6 are introduced in the gist */
1436 { "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((1 + i4)/2), "
1437 "e1 = floor((1530 - 4t1 - 5i4)/20), "
1438 "e2 = floor((-4t1 - 5i4 + 10*floor((1 + i4)/2))/20), "
1439 "e3 = floor((-1 + i4)/2): t2 = 0 and 2e3 = -1 + i4 and "
1440 "20e2 >= -19 - 4t1 - 5i4 + 10e0 and 5e2 <= 1 - t1 and "
1441 "2e0 <= 1 + i4 and 2e0 >= i4 and "
1442 "20e1 <= 1530 - 4t1 - 5i4 and "
1443 "20e1 >= 1511 - 4t1 - 5i4 and i4 <= 1 and "
1444 "5e1 <= 381 - t1 and 20e2 <= -4t1 - 5i4 + 10e0) }",
1445 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((-17 + i4)/2), "
1446 "e1 = floor((-t1 + i6)/5): 5e1 = -t1 + i6 and "
1447 "2e0 <= -17 + i4 and 2e0 >= -18 + i4 and "
1448 "10e0 <= -91 + 5i4 + 4i6 and "
1449 "10e0 >= -105 + 5i4 + 4i6) }",
1450 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((381 - t1)/5), "
1451 "e1 = floor((-1 + i4)/2): t2 = 0 and 2e1 = -1 + i4 and "
1452 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 >= 1511 - 4t1 - 5i4) }" },
1453 { "{ [0, 0, q, p] : -5 <= q <= 5 and p >= 0 }",
1454 "{ [a, b, q, p] : b >= 1 + a }",
1455 "{ [a, b, q, p] : false }" },
1456 { "[n] -> { [x] : x = n && x mod 32 = 0 }",
1457 "[n] -> { [x] : x mod 32 = 0 }",
1458 "[n] -> { [x = n] }" },
1459 { "{ [x] : x mod 6 = 0 }", "{ [x] : x mod 3 = 0 }",
1460 "{ [x] : x mod 2 = 0 }" },
1461 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10000 = 0 }",
1462 "{ [x] : x mod 128 = 0 }" },
1463 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10 = 0 }",
1464 "{ [x] : x mod 3200 = 0 }" },
1465 { "{ [a, b, c] : a mod 2 = 0 and a = c }",
1466 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1467 "{ [a, b, c = a] }" },
1468 { "{ [a, b, c] : a mod 6 = 0 and a = c }",
1469 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1470 "{ [a, b, c = a] : a mod 3 = 0 }" },
1471 { "{ [x] : 0 <= x <= 4 or 6 <= x <= 9 }",
1472 "{ [x] : 1 <= x <= 3 or 7 <= x <= 8 }",
1474 { "{ [x,y] : x < 0 and 0 <= y <= 4 or x >= -2 and -x <= y <= 10 + x }",
1475 "{ [x,y] : 1 <= y <= 3 }",
1479 /* Check that isl_set_gist behaves as expected.
1481 * For the test cases in gist_tests, besides checking that the result
1482 * is as expected, also check that applying the gist operation does
1483 * not modify the input set (an earlier version of isl would do that) and
1484 * that the test case is consistent, i.e., that the gist has the same
1485 * intersection with the context as the input set.
1487 static int test_gist(struct isl_ctx
*ctx
)
1491 isl_basic_set
*bset1
, *bset2
;
1492 isl_map
*map1
, *map2
;
1495 for (i
= 0; i
< ARRAY_SIZE(gist_tests
); ++i
) {
1496 int equal_input
, equal_intersection
;
1497 isl_set
*set1
, *set2
, *copy
, *context
;
1499 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1500 context
= isl_set_read_from_str(ctx
, gist_tests
[i
].context
);
1501 copy
= isl_set_copy(set1
);
1502 set1
= isl_set_gist(set1
, isl_set_copy(context
));
1503 set2
= isl_set_read_from_str(ctx
, gist_tests
[i
].gist
);
1504 equal
= isl_set_is_equal(set1
, set2
);
1506 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1507 equal_input
= isl_set_is_equal(set1
, copy
);
1509 set1
= isl_set_intersect(set1
, isl_set_copy(context
));
1510 set2
= isl_set_intersect(set2
, context
);
1511 equal_intersection
= isl_set_is_equal(set1
, set2
);
1514 if (equal
< 0 || equal_input
< 0 || equal_intersection
< 0)
1517 isl_die(ctx
, isl_error_unknown
,
1518 "incorrect gist result", return -1);
1520 isl_die(ctx
, isl_error_unknown
,
1521 "gist modified input", return -1);
1523 isl_die(ctx
, isl_error_unknown
,
1524 "inconsistent gist test case", return -1);
1527 test_gist_case(ctx
, "gist1");
1529 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
1530 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1531 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1532 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1533 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1534 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1535 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1536 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1537 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1538 bset1
= isl_basic_set_read_from_str(ctx
, str
);
1539 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1540 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1541 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1542 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1543 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1544 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1545 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1546 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1547 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1548 bset1
= isl_basic_set_gist(bset1
, bset2
);
1549 assert(bset1
&& bset1
->n_div
== 0);
1550 isl_basic_set_free(bset1
);
1552 /* Check that the integer divisions of the second disjunct
1553 * do not spread to the first disjunct.
1555 str
= "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1556 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1557 "(exists (e0 = [(-1 + t1)/16], "
1558 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1559 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1560 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1561 "o0 <= 4294967295 and t1 <= -1)) }";
1562 map1
= isl_map_read_from_str(ctx
, str
);
1563 str
= "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1564 map2
= isl_map_read_from_str(ctx
, str
);
1565 map1
= isl_map_gist(map1
, map2
);
1569 isl_die(ctx
, isl_error_unknown
, "expecting single disjunct",
1570 isl_map_free(map1
); return -1);
1571 if (isl_basic_map_dim(map1
->p
[0], isl_dim_div
) != 1)
1572 isl_die(ctx
, isl_error_unknown
, "expecting single div",
1573 isl_map_free(map1
); return -1);
1576 if (test_plain_gist(ctx
) < 0)
1582 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
1584 isl_set
*set
, *set2
;
1588 set
= isl_set_read_from_str(ctx
, str
);
1589 set
= isl_set_coalesce(set
);
1590 set2
= isl_set_read_from_str(ctx
, str
);
1591 equal
= isl_set_is_equal(set
, set2
);
1592 one
= set
&& set
->n
== 1;
1599 isl_die(ctx
, isl_error_unknown
,
1600 "coalesced set not equal to input", return -1);
1601 if (check_one
&& !one
)
1602 isl_die(ctx
, isl_error_unknown
,
1603 "coalesced set should not be a union", return -1);
1608 /* Inputs for coalescing tests with unbounded wrapping.
1609 * "str" is a string representation of the input set.
1610 * "single_disjunct" is set if we expect the result to consist of
1611 * a single disjunct.
1614 int single_disjunct
;
1616 } coalesce_unbounded_tests
[] = {
1617 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1618 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1619 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1620 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1622 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1623 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1624 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1625 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1628 /* Test the functionality of isl_set_coalesce with the bounded wrapping
1629 * option turned off.
1631 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
1637 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
1638 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
1640 for (i
= 0; i
< ARRAY_SIZE(coalesce_unbounded_tests
); ++i
) {
1641 const char *str
= coalesce_unbounded_tests
[i
].str
;
1642 int check_one
= coalesce_unbounded_tests
[i
].single_disjunct
;
1643 if (test_coalesce_set(ctx
, str
, check_one
) >= 0)
1649 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
1654 /* Inputs for coalescing tests.
1655 * "str" is a string representation of the input set.
1656 * "single_disjunct" is set if we expect the result to consist of
1657 * a single disjunct.
1660 int single_disjunct
;
1662 } coalesce_tests
[] = {
1663 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1664 "y >= x & x >= 2 & 5 >= y }" },
1665 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1666 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1667 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1668 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1669 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1670 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1671 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1672 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1673 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1674 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1675 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1676 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1677 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1678 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1679 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1680 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1681 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1682 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1683 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1684 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1685 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1686 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1687 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1688 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1689 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1690 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1691 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1692 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1693 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1694 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1695 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1696 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1697 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1698 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1699 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1700 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1701 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1702 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1703 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1704 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1705 "[o0, o1, o2, o3, o4, o5, o6]] : "
1706 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1707 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1708 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1709 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1710 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1711 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1712 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1713 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1714 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1715 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1716 "o6 >= i3 + i6 - o3 and M >= 0 and "
1717 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1718 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1719 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1720 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1721 "(o0 = 0 and M >= 2 and N >= 3) or "
1722 "(M = 0 and o0 = 0 and N >= 3) }" },
1723 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1724 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1725 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1726 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1727 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1728 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1729 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1730 "(y = 3 and x = 1) }" },
1731 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1732 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1733 "i1 <= M and i3 <= M and i4 <= M) or "
1734 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1735 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1736 "i4 <= -1 + M) }" },
1737 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1738 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1739 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1740 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1741 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1742 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1743 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1744 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1745 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1746 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1747 { 0, "{ [a, b] : exists e : 2e = a and "
1748 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1749 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1750 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1751 "j >= 1 and j' <= i + j - i' and i >= 1; "
1753 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1754 "[i,j] : exists a : j = 3a }" },
1755 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1756 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1758 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1759 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1760 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1761 "c <= 6 + 8a and a >= 3; "
1762 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1763 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1764 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1765 "[x,0] : 3 <= x <= 4 }" },
1766 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1767 "[x,0] : 4 <= x <= 5 }" },
1768 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1769 "[x,0] : 3 <= x <= 5 }" },
1770 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1771 "[x,0] : 3 <= x <= 4 }" },
1772 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1774 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1775 { 1, "{ [0,0]; [1,1] }" },
1776 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1777 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1779 "[k, 0, k] : k <= 6 and k >= 1 }" },
1780 { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;"
1781 "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" },
1782 { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" },
1783 { 1, "[n] -> { [1] : n >= 0;"
1784 "[x] : exists (e0 = floor((x)/2): x >= 2 and "
1785 "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" },
1786 { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): "
1787 "3e1 = y and x >= 2 and 2e0 >= -1 + x and "
1788 "2e0 <= x and 2e0 <= n);"
1789 "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and "
1791 { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): "
1792 "128e0 >= -134 + 127t1 and t1 >= 2 and "
1793 "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or "
1795 { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and "
1796 "3e0 >= -1 + 2i and i <= 9 and i >= 1);"
1798 { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and "
1799 "t1 >= 13 and t1 <= 16);"
1800 "[t1] : t1 <= 15 and t1 >= 12 }" },
1801 { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" },
1802 { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" },
1803 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" },
1804 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" },
1805 { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;"
1806 "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and "
1808 { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or "
1809 "(exists (e0 : 3e0 = -2 + c0)) }" },
1810 { 0, "[n, b0, t0] -> "
1811 "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
1812 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1813 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1814 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1815 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and "
1816 "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and "
1817 "i8 >= -157 + i0 - 4i4 and i8 >= 0 and "
1818 "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or "
1819 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1820 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1821 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1822 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and "
1823 "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and "
1824 "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and "
1825 "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));"
1826 "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : "
1827 "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and "
1828 "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and "
1829 "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and "
1830 "i8 >= -40 + i0 and i8 <= -10 + i0)) }" },
1831 { 0, "{ [i0, i1, i2] : "
1832 "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): "
1833 "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and "
1834 "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and "
1835 "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and "
1836 "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and "
1837 "32e0 <= 31 + i0)) or "
1839 { 1, "{ [a, b, c] : 2b = 1 + a and 2c = 2 + a; [0, 0, 0] }" },
1840 { 1, "{ [a, a, b, c] : 32*floor((a)/32) = a and 2*floor((b)/2) = b and "
1841 "2*floor((c)/2) = c and 0 <= a <= 192;"
1842 "[224, 224, b, c] : 2*floor((b)/2) = b and 2*floor((c)/2) = c }"
1844 { 1, "[n] -> { [a,b] : (exists e : 1 <= a <= 7e and 9e <= b <= n) or "
1845 "(0 <= a <= b <= n) }" },
1846 { 1, "{ [a, b] : 0 <= a <= 2 and b >= 0 and "
1847 "((0 < b <= 13) or (2*floor((a + b)/2) >= -5 + a + 2b)) }" },
1848 { 1, "{ [a] : (2 <= a <= 5) or (a mod 2 = 1 and 1 <= a <= 5) }" },
1849 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
1850 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1851 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
1852 "b = 3 and 9e0 <= -19 + 2c)) }" },
1853 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
1854 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1855 "(a = 4 and b = 3 and "
1856 "9*floor((-16 + 2c)/9) <= -19 + 2c) }" },
1857 { 0, "{ [a, b, c] : (b <= 2 and b <= -2 + a) or "
1858 "(b = -1 + a and 0 < a <= 3 and "
1859 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1860 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
1861 "b = 3 and 9e0 <= -19 + 2c)) }" },
1862 { 1, "{ [y, x] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
1864 { 1, "{ [x, y] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
1866 { 1, "{ [1, y] : -1 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
1867 { 1, "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
1868 { 1, "{ [x, y] : 0 <= x <= 10 and x - 4*floor(x/4) <= 1 and y <= 0; "
1869 "[x, y] : 0 <= x <= 10 and x - 4*floor(x/4) > 1 and y <= 0; "
1870 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) <= 1 and 0 < y; "
1871 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) > 1 and 0 < y }" },
1872 { 1, "{ [x, 0] : 0 <= x <= 10 and x mod 2 = 0; "
1873 "[x, 0] : 0 <= x <= 10 and x mod 2 = 1; "
1874 "[x, y] : 0 <= x <= 10 and 1 <= y <= 10 }" },
1875 { 1, "{ [a] : a <= 8 and "
1876 "(a mod 10 = 7 or a mod 10 = 8 or a mod 10 = 9) }" },
1877 { 1, "{ [x, y] : 2y = -x and x <= 0 or "
1878 "x <= -1 and 2y <= -x - 1 and 2y >= x - 1 }" },
1879 { 0, "{ [x, y] : 2y = -x and x <= 0 or "
1880 "x <= -2 and 2y <= -x - 1 and 2y >= x - 1 }" },
1881 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
1882 "(a < 0 and 3*floor((a)/3) < a) }" },
1883 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
1884 "(a < -1 and 3*floor((a)/3) < a) }" },
1885 { 1, "{ [a, b] : a <= 1024 and b >= 0 and "
1886 "((-31 - a + b <= 32*floor((-1 - a)/32) <= -33 + b and "
1887 "32*floor((-1 - a)/32) <= -16 + b + 16*floor((-1 - a)/16))"
1888 "or (2 <= a <= 15 and b < a)) }" },
1889 { 1, "{ [a] : a > 0 and ((16*floor((a)/16) < a and "
1890 "32*floor((a)/32) < a) or a <= 15) }" },
1891 { 1, "{ [a, b, c, d] : (-a + d) mod 64 = 0 and a <= 8 and b <= 1 and "
1892 "10 - a <= c <= 3 and d >= 5 and 9 - 64b <= d <= 70;"
1893 "[a, b = 1, c, d] : (-a + d) mod 64 = 0 and a <= 8 and c >= 4 and "
1894 "10 - a <= c <= 5 and 5 <= d <= 73 - c }" },
1895 { 1, "[n, m] -> { S_0[i] : (-n + i) mod 3 = 0 and m >= 3 + n and "
1896 "i >= n and 3*floor((2 + n + 2m)/3) <= n + 3m - i; "
1897 "S_0[n] : n <= m <= 2 + n }" },
1900 /* A specialized coalescing test case that would result
1901 * in a segmentation fault or a failed assertion in earlier versions of isl.
1903 static int test_coalesce_special(struct isl_ctx
*ctx
)
1906 isl_map
*map1
, *map2
;
1908 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1909 "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : "
1910 "(y = 201 and o1 <= 239 and o1 >= 212) or "
1911 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and "
1912 "o1 <= 239 and o1 >= 212)) or "
1913 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and "
1914 "o1 <= 241 and o1 >= 240));"
1915 "[S_L220_OUT[] -> T7[]] -> "
1916 "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : "
1917 "(y = 2 and o1 <= 241 and o1 >= 212) or "
1918 "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and "
1919 "y >= 5 and o1 <= 241 and o1 >= 212)) }";
1920 map1
= isl_map_read_from_str(ctx
, str
);
1921 map1
= isl_map_align_divs(map1
);
1922 map1
= isl_map_coalesce(map1
);
1923 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1924 "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : "
1925 "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and "
1926 "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and "
1927 "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }";
1928 map2
= isl_map_read_from_str(ctx
, str
);
1929 map2
= isl_map_union(map2
, map1
);
1930 map2
= isl_map_align_divs(map2
);
1931 map2
= isl_map_coalesce(map2
);
1939 /* A specialized coalescing test case that would result in an assertion
1940 * in an earlier version of isl.
1941 * The explicit call to isl_basic_set_union prevents the implicit
1942 * equality constraints in the first basic map from being detected prior
1943 * to the call to isl_set_coalesce, at least at the point
1944 * where this test case was introduced.
1946 static int test_coalesce_special2(struct isl_ctx
*ctx
)
1949 isl_basic_set
*bset1
, *bset2
;
1952 str
= "{ [x, y] : x, y >= 0 and x + 2y <= 1 and 2x + y <= 1 }";
1953 bset1
= isl_basic_set_read_from_str(ctx
, str
);
1954 str
= "{ [x,0] : -1 <= x <= 1 and x mod 2 = 1 }" ;
1955 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1956 set
= isl_basic_set_union(bset1
, bset2
);
1957 set
= isl_set_coalesce(set
);
1965 /* Test the functionality of isl_set_coalesce.
1966 * That is, check that the output is always equal to the input
1967 * and in some cases that the result consists of a single disjunct.
1969 static int test_coalesce(struct isl_ctx
*ctx
)
1973 for (i
= 0; i
< ARRAY_SIZE(coalesce_tests
); ++i
) {
1974 const char *str
= coalesce_tests
[i
].str
;
1975 int check_one
= coalesce_tests
[i
].single_disjunct
;
1976 if (test_coalesce_set(ctx
, str
, check_one
) < 0)
1980 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
1982 if (test_coalesce_special(ctx
) < 0)
1984 if (test_coalesce_special2(ctx
) < 0)
1990 /* Construct a representation of the graph on the right of Figure 1
1991 * in "Computing the Transitive Closure of a Union of
1992 * Affine Integer Tuple Relations".
1994 static __isl_give isl_map
*cocoa_fig_1_right_graph(isl_ctx
*ctx
)
1997 isl_map
*up
, *right
;
1999 dom
= isl_set_read_from_str(ctx
,
2000 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
2001 "2 x - 3 y + 3 >= 0 }");
2002 right
= isl_map_read_from_str(ctx
,
2003 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
2004 up
= isl_map_read_from_str(ctx
,
2005 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
2006 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
2007 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
2008 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
2009 up
= isl_map_intersect_range(up
, dom
);
2010 return isl_map_union(up
, right
);
2013 /* Construct a representation of the power of the graph
2014 * on the right of Figure 1 in "Computing the Transitive Closure of
2015 * a Union of Affine Integer Tuple Relations".
2017 static __isl_give isl_map
*cocoa_fig_1_right_power(isl_ctx
*ctx
)
2019 return isl_map_read_from_str(ctx
,
2020 "{ [1] -> [[0,0] -> [0,1]]; [2] -> [[0,0] -> [1,1]]; "
2021 " [1] -> [[0,1] -> [1,1]]; [1] -> [[2,2] -> [3,2]]; "
2022 " [2] -> [[2,2] -> [3,3]]; [1] -> [[3,2] -> [3,3]] }");
2025 /* Construct a representation of the transitive closure of the graph
2026 * on the right of Figure 1 in "Computing the Transitive Closure of
2027 * a Union of Affine Integer Tuple Relations".
2029 static __isl_give isl_map
*cocoa_fig_1_right_tc(isl_ctx
*ctx
)
2031 return isl_set_unwrap(isl_map_range(cocoa_fig_1_right_power(ctx
)));
2034 static int test_closure(isl_ctx
*ctx
)
2037 isl_map
*map
, *map2
;
2040 /* COCOA example 1 */
2041 map
= isl_map_read_from_str(ctx
,
2042 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2043 "1 <= i and i < n and 1 <= j and j < n or "
2044 "i2 = i + 1 and j2 = j - 1 and "
2045 "1 <= i and i < n and 2 <= j and j <= n }");
2046 map
= isl_map_power(map
, &exact
);
2050 /* COCOA example 1 */
2051 map
= isl_map_read_from_str(ctx
,
2052 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2053 "1 <= i and i < n and 1 <= j and j < n or "
2054 "i2 = i + 1 and j2 = j - 1 and "
2055 "1 <= i and i < n and 2 <= j and j <= n }");
2056 map
= isl_map_transitive_closure(map
, &exact
);
2058 map2
= isl_map_read_from_str(ctx
,
2059 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2060 "1 <= i and i < n and 1 <= j and j <= n and "
2061 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2062 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
2063 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
2064 assert(isl_map_is_equal(map
, map2
));
2068 map
= isl_map_read_from_str(ctx
,
2069 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
2070 " 0 <= y and y <= n }");
2071 map
= isl_map_transitive_closure(map
, &exact
);
2072 map2
= isl_map_read_from_str(ctx
,
2073 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
2074 " 0 <= y and y <= n }");
2075 assert(isl_map_is_equal(map
, map2
));
2079 /* COCOA example 2 */
2080 map
= isl_map_read_from_str(ctx
,
2081 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
2082 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
2083 "i2 = i + 2 and j2 = j - 2 and "
2084 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
2085 map
= isl_map_transitive_closure(map
, &exact
);
2087 map2
= isl_map_read_from_str(ctx
,
2088 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2089 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
2090 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2091 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
2092 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
2093 assert(isl_map_is_equal(map
, map2
));
2097 /* COCOA Fig.2 left */
2098 map
= isl_map_read_from_str(ctx
,
2099 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
2100 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
2102 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
2103 "j <= 2 i - 3 and j <= n - 2 or "
2104 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2105 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2106 map
= isl_map_transitive_closure(map
, &exact
);
2110 /* COCOA Fig.2 right */
2111 map
= isl_map_read_from_str(ctx
,
2112 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2113 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2115 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2116 "j <= 2 i - 4 and j <= n - 3 or "
2117 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2118 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2119 map
= isl_map_power(map
, &exact
);
2123 /* COCOA Fig.2 right */
2124 map
= isl_map_read_from_str(ctx
,
2125 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2126 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2128 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2129 "j <= 2 i - 4 and j <= n - 3 or "
2130 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2131 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2132 map
= isl_map_transitive_closure(map
, &exact
);
2134 map2
= isl_map_read_from_str(ctx
,
2135 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
2136 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
2137 "j <= n and 3 + i + 2 j <= 3 n and "
2138 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
2139 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
2140 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
2141 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
2142 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
2143 assert(isl_map_is_equal(map
, map2
));
2147 map
= cocoa_fig_1_right_graph(ctx
);
2148 map
= isl_map_transitive_closure(map
, &exact
);
2150 map2
= cocoa_fig_1_right_tc(ctx
);
2151 assert(isl_map_is_equal(map
, map2
));
2155 map
= cocoa_fig_1_right_graph(ctx
);
2156 map
= isl_map_power(map
, &exact
);
2157 map2
= cocoa_fig_1_right_power(ctx
);
2158 equal
= isl_map_is_equal(map
, map2
);
2164 isl_die(ctx
, isl_error_unknown
, "power not exact", return -1);
2166 isl_die(ctx
, isl_error_unknown
, "unexpected power", return -1);
2168 /* COCOA Theorem 1 counter example */
2169 map
= isl_map_read_from_str(ctx
,
2170 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
2171 "i2 = 1 and j2 = j or "
2172 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
2173 map
= isl_map_transitive_closure(map
, &exact
);
2177 map
= isl_map_read_from_str(ctx
,
2178 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
2179 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
2180 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
2181 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
2182 map
= isl_map_transitive_closure(map
, &exact
);
2186 /* Kelly et al 1996, fig 12 */
2187 map
= isl_map_read_from_str(ctx
,
2188 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
2189 "1 <= i,j,j+1 <= n or "
2190 "j = n and j2 = 1 and i2 = i + 1 and "
2191 "1 <= i,i+1 <= n }");
2192 map
= isl_map_transitive_closure(map
, &exact
);
2194 map2
= isl_map_read_from_str(ctx
,
2195 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
2196 "1 <= i <= n and i = i2 or "
2197 "1 <= i < i2 <= n and 1 <= j <= n and "
2199 assert(isl_map_is_equal(map
, map2
));
2203 /* Omega's closure4 */
2204 map
= isl_map_read_from_str(ctx
,
2205 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
2206 "1 <= x,y <= 10 or "
2207 "x2 = x + 1 and y2 = y and "
2208 "1 <= x <= 20 && 5 <= y <= 15 }");
2209 map
= isl_map_transitive_closure(map
, &exact
);
2213 map
= isl_map_read_from_str(ctx
,
2214 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
2215 map
= isl_map_transitive_closure(map
, &exact
);
2217 map2
= isl_map_read_from_str(ctx
,
2218 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
2219 assert(isl_map_is_equal(map
, map2
));
2223 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
2224 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
2225 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
2226 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
2227 map
= isl_map_read_from_str(ctx
, str
);
2228 map
= isl_map_transitive_closure(map
, &exact
);
2230 map2
= isl_map_read_from_str(ctx
, str
);
2231 assert(isl_map_is_equal(map
, map2
));
2235 str
= "{[0] -> [1]; [2] -> [3]}";
2236 map
= isl_map_read_from_str(ctx
, str
);
2237 map
= isl_map_transitive_closure(map
, &exact
);
2239 map2
= isl_map_read_from_str(ctx
, str
);
2240 assert(isl_map_is_equal(map
, map2
));
2244 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
2245 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
2246 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
2247 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2248 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2249 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
2250 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
2251 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
2252 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2253 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2254 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
2255 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
2256 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
2257 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2258 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2259 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
2260 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
2261 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
2262 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2263 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
2264 map
= isl_map_read_from_str(ctx
, str
);
2265 map
= isl_map_transitive_closure(map
, NULL
);
2272 static int test_lex(struct isl_ctx
*ctx
)
2278 dim
= isl_space_set_alloc(ctx
, 0, 0);
2279 map
= isl_map_lex_le(dim
);
2280 empty
= isl_map_is_empty(map
);
2286 isl_die(ctx
, isl_error_unknown
,
2287 "expecting non-empty result", return -1);
2292 /* Inputs for isl_map_lexmin tests.
2293 * "map" is the input and "lexmin" is the expected result.
2298 } lexmin_tests
[] = {
2299 { "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }",
2300 "{ [x] -> [5] : 6 <= x <= 8; "
2301 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }" },
2302 { "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }",
2303 "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }" },
2304 { "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }",
2305 "{ [x] -> [y] : (4y = x and x >= 0) or "
2306 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
2307 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
2308 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }" },
2309 { "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }",
2310 "{ T[a] -> S[b, c] : 2b = a and 2c = a }" },
2311 /* Check that empty pieces are properly combined. */
2312 { "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
2313 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
2314 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }",
2315 "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
2316 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
2318 { "{ [i, k, j] -> [a, b, c, d] : 8*floor((b)/8) = b and k <= 255 and "
2319 "a <= 255 and c <= 255 and d <= 255 - j and "
2320 "255 - j <= 7d <= 7 - i and 240d <= 239 + a and "
2321 "247d <= 247 + k - j and 247d <= 247 + k - b and "
2322 "247d <= 247 + i and 248 - b <= 248d <= c and "
2323 "254d >= i - a + b and 254d >= -a + b and "
2324 "255d >= -i + a - b and 1792d >= -63736 + 257b }",
2326 "[-127762 + i + 502j, -62992 + 248j, 63240 - 248j, 255 - j] : "
2327 "k <= 255 and 7j >= 1778 + i and 246j >= 62738 - k and "
2328 "247j >= 62738 - i and 509j <= 129795 + i and "
2329 "742j >= 188724 - i; "
2330 "[0, k, j] -> [1, 0, 248, 1] : k <= 255 and 248 <= j <= 254, k }" },
2331 { "{ [a] -> [b] : 0 <= b <= 255 and -509 + a <= 512b < a and "
2332 "16*floor((8 + b)/16) <= 7 + b; "
2334 "{ [a] -> [b = 1] : a >= 510 or a <= 0; "
2335 "[a] -> [b = 0] : 0 < a <= 509 }" },
2336 { "{ rat: [i] : 1 <= 2i <= 9 }", "{ rat: [i] : 2i = 1 }" },
2337 { "{ rat: [i] : 1 <= 2i <= 9 or i >= 10 }", "{ rat: [i] : 2i = 1 }" },
2340 static int test_lexmin(struct isl_ctx
*ctx
)
2345 isl_basic_map
*bmap
;
2346 isl_map
*map
, *map2
;
2349 isl_pw_multi_aff
*pma
;
2351 str
= "[p0, p1] -> { [] -> [] : "
2352 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
2353 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
2354 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
2355 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
2356 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
2357 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
2358 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
2359 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
2360 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
2361 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
2362 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
2363 map
= isl_map_read_from_str(ctx
, str
);
2364 map
= isl_map_lexmin(map
);
2367 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
2368 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
2369 set
= isl_set_read_from_str(ctx
, str
);
2370 set
= isl_set_lexmax(set
);
2371 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
2372 set2
= isl_set_read_from_str(ctx
, str
);
2373 set
= isl_set_intersect(set
, set2
);
2374 assert(!isl_set_is_empty(set
));
2377 for (i
= 0; i
< ARRAY_SIZE(lexmin_tests
); ++i
) {
2378 map
= isl_map_read_from_str(ctx
, lexmin_tests
[i
].map
);
2379 map
= isl_map_lexmin(map
);
2380 map2
= isl_map_read_from_str(ctx
, lexmin_tests
[i
].lexmin
);
2381 equal
= isl_map_is_equal(map
, map2
);
2388 isl_die(ctx
, isl_error_unknown
,
2389 "unexpected result", return -1);
2392 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2393 " 8i' <= i and 8i' >= -7 + i }";
2394 bmap
= isl_basic_map_read_from_str(ctx
, str
);
2395 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
2396 map2
= isl_map_from_pw_multi_aff(pma
);
2397 map
= isl_map_from_basic_map(bmap
);
2398 assert(isl_map_is_equal(map
, map2
));
2402 str
= "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2403 " 8i' <= i and 8i' >= -7 + i }";
2404 set
= isl_set_read_from_str(ctx
, str
);
2405 pma
= isl_set_lexmin_pw_multi_aff(isl_set_copy(set
));
2406 set2
= isl_set_from_pw_multi_aff(pma
);
2407 equal
= isl_set_is_equal(set
, set2
);
2413 isl_die(ctx
, isl_error_unknown
,
2414 "unexpected difference between set and "
2415 "piecewise affine expression", return -1);
2420 /* A specialized isl_set_min_val test case that would return the wrong result
2421 * in earlier versions of isl.
2422 * The explicit call to isl_basic_set_union prevents the second basic set
2423 * from being determined to be empty prior to the call to isl_set_min_val,
2424 * at least at the point where this test case was introduced.
2426 static int test_min_special(isl_ctx
*ctx
)
2429 isl_basic_set
*bset1
, *bset2
;
2435 str
= "{ [a, b] : a >= 2 and b >= 0 and 14 - a <= b <= 9 }";
2436 bset1
= isl_basic_set_read_from_str(ctx
, str
);
2437 str
= "{ [a, b] : 1 <= a, b and a + b <= 1 }";
2438 bset2
= isl_basic_set_read_from_str(ctx
, str
);
2439 set
= isl_basic_set_union(bset1
, bset2
);
2440 obj
= isl_aff_read_from_str(ctx
, "{ [a, b] -> [a] }");
2442 res
= isl_set_min_val(set
, obj
);
2443 ok
= isl_val_cmp_si(res
, 5) == 0;
2452 isl_die(ctx
, isl_error_unknown
, "unexpected minimum",
2458 /* A specialized isl_set_min_val test case that would return an error
2459 * in earlier versions of isl.
2461 static int test_min_special2(isl_ctx
*ctx
)
2464 isl_basic_set
*bset
;
2468 str
= "{ [i, j, k] : 2j = i and 2k = i + 1 and i >= 2 }";
2469 bset
= isl_basic_set_read_from_str(ctx
, str
);
2471 obj
= isl_aff_read_from_str(ctx
, "{ [i, j, k] -> [i] }");
2473 res
= isl_basic_set_max_val(bset
, obj
);
2475 isl_basic_set_free(bset
);
2488 __isl_give isl_val
*(*fn
)(__isl_keep isl_set
*set
,
2489 __isl_keep isl_aff
*obj
);
2492 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_min_val
, "-1" },
2493 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_max_val
, "1" },
2494 { "{ [a, b] : 0 <= a, b <= 100 and b mod 2 = 0}",
2495 "{ [a, b] -> [floor((b - 2*floor((-a)/4))/5)] }",
2496 &isl_set_max_val
, "30" },
2500 /* Perform basic isl_set_min_val and isl_set_max_val tests.
2501 * In particular, check the results on non-convex inputs.
2503 static int test_min(struct isl_ctx
*ctx
)
2511 for (i
= 0; i
< ARRAY_SIZE(opt_tests
); ++i
) {
2512 set
= isl_set_read_from_str(ctx
, opt_tests
[i
].set
);
2513 obj
= isl_aff_read_from_str(ctx
, opt_tests
[i
].obj
);
2514 res
= isl_val_read_from_str(ctx
, opt_tests
[i
].res
);
2515 val
= opt_tests
[i
].fn(set
, obj
);
2516 ok
= isl_val_eq(res
, val
);
2525 isl_die(ctx
, isl_error_unknown
,
2526 "unexpected optimum", return -1);
2529 if (test_min_special(ctx
) < 0)
2531 if (test_min_special2(ctx
) < 0)
2542 static isl_stat
collect_must_may(__isl_take isl_map
*dep
, int must
,
2543 void *dep_user
, void *user
)
2545 struct must_may
*mm
= (struct must_may
*)user
;
2548 mm
->must
= isl_map_union(mm
->must
, dep
);
2550 mm
->may
= isl_map_union(mm
->may
, dep
);
2555 static int common_space(void *first
, void *second
)
2557 int depth
= *(int *)first
;
2561 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
2569 map2
= isl_map_read_from_str(map
->ctx
, str
);
2570 equal
= isl_map_is_equal(map
, map2
);
2576 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
2580 equal
= map_is_equal(map
, str
);
2584 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
2585 "result not as expected", return -1);
2589 static int test_dep(struct isl_ctx
*ctx
)
2594 isl_access_info
*ai
;
2601 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2602 map
= isl_map_read_from_str(ctx
, str
);
2603 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2605 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2606 map
= isl_map_read_from_str(ctx
, str
);
2607 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2609 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2610 map
= isl_map_read_from_str(ctx
, str
);
2611 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2613 flow
= isl_access_info_compute_flow(ai
);
2614 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2615 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2616 mm
.may
= isl_map_empty(dim
);
2618 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2620 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
2621 " [1,10,0] -> [2,5,0] }";
2622 assert(map_is_equal(mm
.must
, str
));
2623 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2624 assert(map_is_equal(mm
.may
, str
));
2626 isl_map_free(mm
.must
);
2627 isl_map_free(mm
.may
);
2628 isl_flow_free(flow
);
2631 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2632 map
= isl_map_read_from_str(ctx
, str
);
2633 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2635 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2636 map
= isl_map_read_from_str(ctx
, str
);
2637 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2639 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2640 map
= isl_map_read_from_str(ctx
, str
);
2641 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2643 flow
= isl_access_info_compute_flow(ai
);
2644 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2645 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2646 mm
.may
= isl_map_empty(dim
);
2648 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2650 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
2651 assert(map_is_equal(mm
.must
, str
));
2652 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2653 assert(map_is_equal(mm
.may
, str
));
2655 isl_map_free(mm
.must
);
2656 isl_map_free(mm
.may
);
2657 isl_flow_free(flow
);
2660 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2661 map
= isl_map_read_from_str(ctx
, str
);
2662 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2664 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2665 map
= isl_map_read_from_str(ctx
, str
);
2666 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2668 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2669 map
= isl_map_read_from_str(ctx
, str
);
2670 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2672 flow
= isl_access_info_compute_flow(ai
);
2673 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2674 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2675 mm
.may
= isl_map_empty(dim
);
2677 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2679 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2680 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2681 assert(map_is_equal(mm
.may
, str
));
2682 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2683 assert(map_is_equal(mm
.must
, str
));
2685 isl_map_free(mm
.must
);
2686 isl_map_free(mm
.may
);
2687 isl_flow_free(flow
);
2690 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2691 map
= isl_map_read_from_str(ctx
, str
);
2692 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2694 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2695 map
= isl_map_read_from_str(ctx
, str
);
2696 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2698 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2699 map
= isl_map_read_from_str(ctx
, str
);
2700 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2702 flow
= isl_access_info_compute_flow(ai
);
2703 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2704 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2705 mm
.may
= isl_map_empty(dim
);
2707 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2709 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2710 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2711 assert(map_is_equal(mm
.may
, str
));
2712 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2713 assert(map_is_equal(mm
.must
, str
));
2715 isl_map_free(mm
.must
);
2716 isl_map_free(mm
.may
);
2717 isl_flow_free(flow
);
2720 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2721 map
= isl_map_read_from_str(ctx
, str
);
2722 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2724 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2725 map
= isl_map_read_from_str(ctx
, str
);
2726 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2728 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2729 map
= isl_map_read_from_str(ctx
, str
);
2730 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2732 flow
= isl_access_info_compute_flow(ai
);
2733 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2734 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2735 mm
.may
= isl_map_empty(dim
);
2737 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2739 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2740 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2741 assert(map_is_equal(mm
.may
, str
));
2742 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2743 assert(map_is_equal(mm
.must
, str
));
2745 isl_map_free(mm
.must
);
2746 isl_map_free(mm
.may
);
2747 isl_flow_free(flow
);
2752 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2753 map
= isl_map_read_from_str(ctx
, str
);
2754 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
2756 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2757 map
= isl_map_read_from_str(ctx
, str
);
2758 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2760 flow
= isl_access_info_compute_flow(ai
);
2761 dim
= isl_space_alloc(ctx
, 0, 5, 5);
2762 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2763 mm
.may
= isl_map_empty(dim
);
2765 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2767 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
2768 assert(map_is_equal(mm
.must
, str
));
2769 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
2770 assert(map_is_equal(mm
.may
, str
));
2772 isl_map_free(mm
.must
);
2773 isl_map_free(mm
.may
);
2774 isl_flow_free(flow
);
2779 /* Check that the dependence analysis proceeds without errors.
2780 * Earlier versions of isl would break down during the analysis
2781 * due to the use of the wrong spaces.
2783 static int test_flow(isl_ctx
*ctx
)
2786 isl_union_map
*access
, *schedule
;
2787 isl_union_map
*must_dep
, *may_dep
;
2790 str
= "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
2791 access
= isl_union_map_read_from_str(ctx
, str
);
2792 str
= "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
2793 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
2794 "S2[] -> [1,0,0,0]; "
2795 "S3[] -> [-1,0,0,0] }";
2796 schedule
= isl_union_map_read_from_str(ctx
, str
);
2797 r
= isl_union_map_compute_flow(access
, isl_union_map_copy(access
),
2798 isl_union_map_copy(access
), schedule
,
2799 &must_dep
, &may_dep
, NULL
, NULL
);
2800 isl_union_map_free(may_dep
);
2801 isl_union_map_free(must_dep
);
2810 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
2811 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
2812 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
2813 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
2814 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
2815 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
2816 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2817 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2818 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
2821 int test_sv(isl_ctx
*ctx
)
2823 isl_union_map
*umap
;
2827 for (i
= 0; i
< ARRAY_SIZE(sv_tests
); ++i
) {
2828 umap
= isl_union_map_read_from_str(ctx
, sv_tests
[i
].map
);
2829 sv
= isl_union_map_is_single_valued(umap
);
2830 isl_union_map_free(umap
);
2833 if (sv_tests
[i
].sv
&& !sv
)
2834 isl_die(ctx
, isl_error_internal
,
2835 "map not detected as single valued", return -1);
2836 if (!sv_tests
[i
].sv
&& sv
)
2837 isl_die(ctx
, isl_error_internal
,
2838 "map detected as single valued", return -1);
2847 } bijective_tests
[] = {
2848 { "[N,M]->{[i,j] -> [i]}", 0 },
2849 { "[N,M]->{[i,j] -> [i] : j=i}", 1 },
2850 { "[N,M]->{[i,j] -> [i] : j=0}", 1 },
2851 { "[N,M]->{[i,j] -> [i] : j=N}", 1 },
2852 { "[N,M]->{[i,j] -> [j,i]}", 1 },
2853 { "[N,M]->{[i,j] -> [i+j]}", 0 },
2854 { "[N,M]->{[i,j] -> []}", 0 },
2855 { "[N,M]->{[i,j] -> [i,j,N]}", 1 },
2856 { "[N,M]->{[i,j] -> [2i]}", 0 },
2857 { "[N,M]->{[i,j] -> [i,i]}", 0 },
2858 { "[N,M]->{[i,j] -> [2i,i]}", 0 },
2859 { "[N,M]->{[i,j] -> [2i,j]}", 1 },
2860 { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 },
2863 static int test_bijective(struct isl_ctx
*ctx
)
2869 for (i
= 0; i
< ARRAY_SIZE(bijective_tests
); ++i
) {
2870 map
= isl_map_read_from_str(ctx
, bijective_tests
[i
].str
);
2871 bijective
= isl_map_is_bijective(map
);
2875 if (bijective_tests
[i
].bijective
&& !bijective
)
2876 isl_die(ctx
, isl_error_internal
,
2877 "map not detected as bijective", return -1);
2878 if (!bijective_tests
[i
].bijective
&& bijective
)
2879 isl_die(ctx
, isl_error_internal
,
2880 "map detected as bijective", return -1);
2886 /* Inputs for isl_pw_qpolynomial_gist tests.
2887 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
2893 } pwqp_gist_tests
[] = {
2894 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
2895 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
2896 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
2897 "{ [i] -> -1/2 + 1/2 * i }" },
2898 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
2901 static int test_pwqp(struct isl_ctx
*ctx
)
2906 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
2909 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2910 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2912 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
2915 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2916 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2918 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2920 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2922 isl_pw_qpolynomial_free(pwqp1
);
2924 for (i
= 0; i
< ARRAY_SIZE(pwqp_gist_tests
); ++i
) {
2925 str
= pwqp_gist_tests
[i
].pwqp
;
2926 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2927 str
= pwqp_gist_tests
[i
].set
;
2928 set
= isl_set_read_from_str(ctx
, str
);
2929 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
2930 str
= pwqp_gist_tests
[i
].gist
;
2931 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2932 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2933 equal
= isl_pw_qpolynomial_is_zero(pwqp1
);
2934 isl_pw_qpolynomial_free(pwqp1
);
2939 isl_die(ctx
, isl_error_unknown
,
2940 "unexpected result", return -1);
2943 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
2944 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2945 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
2946 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2948 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2950 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2952 isl_pw_qpolynomial_free(pwqp1
);
2954 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
2955 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2956 str
= "{ [x] -> x }";
2957 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2959 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2961 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2963 isl_pw_qpolynomial_free(pwqp1
);
2965 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
2966 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2967 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2968 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
2969 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2970 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2971 isl_pw_qpolynomial_free(pwqp1
);
2973 str
= "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
2974 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2975 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2976 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2977 set
= isl_set_read_from_str(ctx
, "{ [a,b,a] }");
2978 pwqp1
= isl_pw_qpolynomial_intersect_domain(pwqp1
, set
);
2979 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2980 isl_pw_qpolynomial_free(pwqp1
);
2981 isl_pw_qpolynomial_free(pwqp2
);
2985 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2987 str
= "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
2988 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2989 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2990 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2991 pwqp1
= isl_pw_qpolynomial_fix_val(pwqp1
, isl_dim_set
, 1,
2993 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2994 isl_pw_qpolynomial_free(pwqp1
);
2995 isl_pw_qpolynomial_free(pwqp2
);
2999 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3004 static int test_split_periods(isl_ctx
*ctx
)
3007 isl_pw_qpolynomial
*pwqp
;
3009 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
3010 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
3011 "U >= 0; [U,V] -> U^2 : U >= 100 }";
3012 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3014 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
3016 isl_pw_qpolynomial_free(pwqp
);
3024 static int test_union(isl_ctx
*ctx
)
3027 isl_union_set
*uset1
, *uset2
;
3028 isl_union_map
*umap1
, *umap2
;
3031 str
= "{ [i] : 0 <= i <= 1 }";
3032 uset1
= isl_union_set_read_from_str(ctx
, str
);
3033 str
= "{ [1] -> [0] }";
3034 umap1
= isl_union_map_read_from_str(ctx
, str
);
3036 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
3037 equal
= isl_union_map_is_equal(umap1
, umap2
);
3039 isl_union_map_free(umap1
);
3040 isl_union_map_free(umap2
);
3045 isl_die(ctx
, isl_error_unknown
, "union maps not equal",
3048 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
3049 umap1
= isl_union_map_read_from_str(ctx
, str
);
3050 str
= "{ A[i]; B[i] }";
3051 uset1
= isl_union_set_read_from_str(ctx
, str
);
3053 uset2
= isl_union_map_domain(umap1
);
3055 equal
= isl_union_set_is_equal(uset1
, uset2
);
3057 isl_union_set_free(uset1
);
3058 isl_union_set_free(uset2
);
3063 isl_die(ctx
, isl_error_unknown
, "union sets not equal",
3069 /* Check that computing a bound of a non-zero polynomial over an unbounded
3070 * domain does not produce a rational value.
3071 * In particular, check that the upper bound is infinity.
3073 static int test_bound_unbounded_domain(isl_ctx
*ctx
)
3076 isl_pw_qpolynomial
*pwqp
;
3077 isl_pw_qpolynomial_fold
*pwf
, *pwf2
;
3080 str
= "{ [m,n] -> -m * n }";
3081 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3082 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3084 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3085 pwf2
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3086 equal
= isl_pw_qpolynomial_fold_plain_is_equal(pwf
, pwf2
);
3087 isl_pw_qpolynomial_fold_free(pwf
);
3088 isl_pw_qpolynomial_fold_free(pwf2
);
3093 isl_die(ctx
, isl_error_unknown
,
3094 "expecting infinite polynomial bound", return -1);
3099 static int test_bound(isl_ctx
*ctx
)
3103 isl_pw_qpolynomial
*pwqp
;
3104 isl_pw_qpolynomial_fold
*pwf
;
3106 if (test_bound_unbounded_domain(ctx
) < 0)
3109 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
3110 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3111 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3112 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
3113 isl_pw_qpolynomial_fold_free(pwf
);
3115 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
3118 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
3119 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
3120 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
3121 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
3122 isl_pw_qpolynomial_fold_free(pwf
);
3124 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
3130 static int test_lift(isl_ctx
*ctx
)
3133 isl_basic_map
*bmap
;
3134 isl_basic_set
*bset
;
3136 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
3137 bset
= isl_basic_set_read_from_str(ctx
, str
);
3138 bset
= isl_basic_set_lift(bset
);
3139 bmap
= isl_basic_map_from_range(bset
);
3140 bset
= isl_basic_map_domain(bmap
);
3141 isl_basic_set_free(bset
);
3150 } subset_tests
[] = {
3152 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
3153 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
3154 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
3156 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
3157 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
3158 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
3159 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
3160 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
3161 "256e0 <= 255i and 256e0 >= -255 + 255i and "
3162 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
3163 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
3164 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
3165 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
3166 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
3167 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
3168 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
3169 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
3170 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
3171 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
3172 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
3173 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
3174 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
3175 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
3176 "4e0 <= -57 + i0 + i1)) or "
3177 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
3178 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
3179 "4e0 >= -61 + i0 + i1)) or "
3180 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
3181 { "[a, b] -> { : a = 0 and b = -1 }", "[b, a] -> { : b >= -10 }", 1 },
3184 static int test_subset(isl_ctx
*ctx
)
3187 isl_set
*set1
, *set2
;
3190 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
3191 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
3192 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
3193 subset
= isl_set_is_subset(set1
, set2
);
3198 if (subset
!= subset_tests
[i
].subset
)
3199 isl_die(ctx
, isl_error_unknown
,
3200 "incorrect subset result", return -1);
3207 const char *minuend
;
3208 const char *subtrahend
;
3209 const char *difference
;
3210 } subtract_domain_tests
[] = {
3211 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
3212 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
3213 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
3216 static int test_subtract(isl_ctx
*ctx
)
3219 isl_union_map
*umap1
, *umap2
;
3220 isl_union_pw_multi_aff
*upma1
, *upma2
;
3221 isl_union_set
*uset
;
3224 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3225 umap1
= isl_union_map_read_from_str(ctx
,
3226 subtract_domain_tests
[i
].minuend
);
3227 uset
= isl_union_set_read_from_str(ctx
,
3228 subtract_domain_tests
[i
].subtrahend
);
3229 umap2
= isl_union_map_read_from_str(ctx
,
3230 subtract_domain_tests
[i
].difference
);
3231 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
3232 equal
= isl_union_map_is_equal(umap1
, umap2
);
3233 isl_union_map_free(umap1
);
3234 isl_union_map_free(umap2
);
3238 isl_die(ctx
, isl_error_unknown
,
3239 "incorrect subtract domain result", return -1);
3242 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3243 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
3244 subtract_domain_tests
[i
].minuend
);
3245 uset
= isl_union_set_read_from_str(ctx
,
3246 subtract_domain_tests
[i
].subtrahend
);
3247 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
3248 subtract_domain_tests
[i
].difference
);
3249 upma1
= isl_union_pw_multi_aff_subtract_domain(upma1
, uset
);
3250 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
3251 isl_union_pw_multi_aff_free(upma1
);
3252 isl_union_pw_multi_aff_free(upma2
);
3256 isl_die(ctx
, isl_error_unknown
,
3257 "incorrect subtract domain result", return -1);
3263 /* Check that intersecting the empty basic set with another basic set
3264 * does not increase the number of constraints. In particular,
3265 * the empty basic set should maintain its canonical representation.
3267 static int test_intersect(isl_ctx
*ctx
)
3270 isl_basic_set
*bset1
, *bset2
;
3272 bset1
= isl_basic_set_read_from_str(ctx
, "{ [a,b,c] : 1 = 0 }");
3273 bset2
= isl_basic_set_read_from_str(ctx
, "{ [1,2,3] }");
3274 n1
= isl_basic_set_n_constraint(bset1
);
3275 bset1
= isl_basic_set_intersect(bset1
, bset2
);
3276 n2
= isl_basic_set_n_constraint(bset1
);
3277 isl_basic_set_free(bset1
);
3281 isl_die(ctx
, isl_error_unknown
,
3282 "number of constraints of empty set changed",
3288 int test_factorize(isl_ctx
*ctx
)
3291 isl_basic_set
*bset
;
3294 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
3295 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
3296 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
3297 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
3298 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
3299 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
3300 "3i5 >= -2i0 - i2 + 3i4 }";
3301 bset
= isl_basic_set_read_from_str(ctx
, str
);
3302 f
= isl_basic_set_factorizer(bset
);
3303 isl_basic_set_free(bset
);
3304 isl_factorizer_free(f
);
3306 isl_die(ctx
, isl_error_unknown
,
3307 "failed to construct factorizer", return -1);
3309 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
3310 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
3311 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
3312 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
3313 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
3314 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
3315 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
3316 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
3317 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
3318 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
3319 bset
= isl_basic_set_read_from_str(ctx
, str
);
3320 f
= isl_basic_set_factorizer(bset
);
3321 isl_basic_set_free(bset
);
3322 isl_factorizer_free(f
);
3324 isl_die(ctx
, isl_error_unknown
,
3325 "failed to construct factorizer", return -1);
3330 static isl_stat
check_injective(__isl_take isl_map
*map
, void *user
)
3332 int *injective
= user
;
3334 *injective
= isl_map_is_injective(map
);
3337 if (*injective
< 0 || !*injective
)
3338 return isl_stat_error
;
3343 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
3344 const char *r
, const char *s
, int tilable
, int parallel
)
3348 isl_union_map
*W
, *R
, *S
;
3349 isl_union_map
*empty
;
3350 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
3351 isl_union_map
*validity
, *proximity
, *coincidence
;
3352 isl_union_map
*schedule
;
3353 isl_union_map
*test
;
3354 isl_union_set
*delta
;
3355 isl_union_set
*domain
;
3359 isl_schedule_constraints
*sc
;
3360 isl_schedule
*sched
;
3361 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
3363 D
= isl_union_set_read_from_str(ctx
, d
);
3364 W
= isl_union_map_read_from_str(ctx
, w
);
3365 R
= isl_union_map_read_from_str(ctx
, r
);
3366 S
= isl_union_map_read_from_str(ctx
, s
);
3368 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
3369 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
3371 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
3372 isl_union_map_compute_flow(isl_union_map_copy(R
),
3373 isl_union_map_copy(W
), empty
,
3374 isl_union_map_copy(S
),
3375 &dep_raw
, NULL
, NULL
, NULL
);
3376 isl_union_map_compute_flow(isl_union_map_copy(W
),
3377 isl_union_map_copy(W
),
3378 isl_union_map_copy(R
),
3379 isl_union_map_copy(S
),
3380 &dep_waw
, &dep_war
, NULL
, NULL
);
3382 dep
= isl_union_map_union(dep_waw
, dep_war
);
3383 dep
= isl_union_map_union(dep
, dep_raw
);
3384 validity
= isl_union_map_copy(dep
);
3385 coincidence
= isl_union_map_copy(dep
);
3386 proximity
= isl_union_map_copy(dep
);
3388 sc
= isl_schedule_constraints_on_domain(isl_union_set_copy(D
));
3389 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3390 sc
= isl_schedule_constraints_set_coincidence(sc
, coincidence
);
3391 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3392 sched
= isl_schedule_constraints_compute_schedule(sc
);
3393 schedule
= isl_schedule_get_map(sched
);
3394 isl_schedule_free(sched
);
3395 isl_union_map_free(W
);
3396 isl_union_map_free(R
);
3397 isl_union_map_free(S
);
3400 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
3402 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
3403 is_complete
= isl_union_set_is_subset(D
, domain
);
3404 isl_union_set_free(D
);
3405 isl_union_set_free(domain
);
3407 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
3408 test
= isl_union_map_apply_range(test
, dep
);
3409 test
= isl_union_map_apply_range(test
, schedule
);
3411 delta
= isl_union_map_deltas(test
);
3412 if (isl_union_set_n_set(delta
) == 0) {
3416 isl_union_set_free(delta
);
3418 delta_set
= isl_set_from_union_set(delta
);
3420 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3421 for (i
= 0; i
< tilable
; ++i
)
3422 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
3423 is_tilable
= isl_set_is_subset(delta_set
, slice
);
3424 isl_set_free(slice
);
3426 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3427 for (i
= 0; i
< parallel
; ++i
)
3428 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
3429 is_parallel
= isl_set_is_subset(delta_set
, slice
);
3430 isl_set_free(slice
);
3432 origin
= isl_set_universe(isl_set_get_space(delta_set
));
3433 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
3434 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
3436 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
3437 delta_set
= isl_set_lexmin(delta_set
);
3439 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
3441 isl_set_free(origin
);
3442 isl_set_free(delta_set
);
3445 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
3446 is_injection
< 0 || is_complete
< 0)
3449 isl_die(ctx
, isl_error_unknown
,
3450 "generated schedule incomplete", return -1);
3452 isl_die(ctx
, isl_error_unknown
,
3453 "generated schedule not injective on each statement",
3456 isl_die(ctx
, isl_error_unknown
,
3457 "negative dependences in generated schedule",
3460 isl_die(ctx
, isl_error_unknown
,
3461 "generated schedule not as tilable as expected",
3464 isl_die(ctx
, isl_error_unknown
,
3465 "generated schedule not as parallel as expected",
3471 /* Compute a schedule for the given instance set, validity constraints,
3472 * proximity constraints and context and return a corresponding union map
3475 static __isl_give isl_union_map
*compute_schedule_with_context(isl_ctx
*ctx
,
3476 const char *domain
, const char *validity
, const char *proximity
,
3477 const char *context
)
3482 isl_union_map
*prox
;
3483 isl_schedule_constraints
*sc
;
3484 isl_schedule
*schedule
;
3485 isl_union_map
*sched
;
3487 con
= isl_set_read_from_str(ctx
, context
);
3488 dom
= isl_union_set_read_from_str(ctx
, domain
);
3489 dep
= isl_union_map_read_from_str(ctx
, validity
);
3490 prox
= isl_union_map_read_from_str(ctx
, proximity
);
3491 sc
= isl_schedule_constraints_on_domain(dom
);
3492 sc
= isl_schedule_constraints_set_context(sc
, con
);
3493 sc
= isl_schedule_constraints_set_validity(sc
, dep
);
3494 sc
= isl_schedule_constraints_set_proximity(sc
, prox
);
3495 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3496 sched
= isl_schedule_get_map(schedule
);
3497 isl_schedule_free(schedule
);
3502 /* Compute a schedule for the given instance set, validity constraints and
3503 * proximity constraints and return a corresponding union map representation.
3505 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
3506 const char *domain
, const char *validity
, const char *proximity
)
3508 return compute_schedule_with_context(ctx
, domain
, validity
, proximity
,
3512 /* Check that a schedule can be constructed on the given domain
3513 * with the given validity and proximity constraints.
3515 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
3516 const char *validity
, const char *proximity
)
3518 isl_union_map
*sched
;
3520 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
3524 isl_union_map_free(sched
);
3528 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
3529 const char *validity
, const char *proximity
, const char *expected_sched
)
3531 isl_union_map
*sched1
, *sched2
;
3534 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
3535 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
3537 equal
= isl_union_map_is_equal(sched1
, sched2
);
3538 isl_union_map_free(sched1
);
3539 isl_union_map_free(sched2
);
3544 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
3550 /* Check that the schedule map is properly padded, even after being
3551 * reconstructed from the band forest.
3553 static int test_padded_schedule(isl_ctx
*ctx
)
3557 isl_union_map
*validity
, *proximity
;
3558 isl_schedule_constraints
*sc
;
3559 isl_schedule
*sched
;
3560 isl_union_map
*map1
, *map2
;
3561 isl_band_list
*list
;
3564 str
= "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
3565 D
= isl_union_set_read_from_str(ctx
, str
);
3566 validity
= isl_union_map_empty(isl_union_set_get_space(D
));
3567 proximity
= isl_union_map_copy(validity
);
3568 sc
= isl_schedule_constraints_on_domain(D
);
3569 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3570 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3571 sched
= isl_schedule_constraints_compute_schedule(sc
);
3572 map1
= isl_schedule_get_map(sched
);
3573 list
= isl_schedule_get_band_forest(sched
);
3574 isl_band_list_free(list
);
3575 map2
= isl_schedule_get_map(sched
);
3576 isl_schedule_free(sched
);
3577 equal
= isl_union_map_is_equal(map1
, map2
);
3578 isl_union_map_free(map1
);
3579 isl_union_map_free(map2
);
3584 isl_die(ctx
, isl_error_unknown
,
3585 "reconstructed schedule map not the same as original",
3591 /* Check that conditional validity constraints are also taken into
3592 * account across bands.
3593 * In particular, try to make sure that live ranges D[1,0]->C[2,1] and
3594 * D[2,0]->C[3,0] are not local in the outer band of the generated schedule
3595 * and then check that the adjacent order constraint C[2,1]->D[2,0]
3596 * is enforced by the rest of the schedule.
3598 static int test_special_conditional_schedule_constraints(isl_ctx
*ctx
)
3601 isl_union_set
*domain
;
3602 isl_union_map
*validity
, *proximity
, *condition
;
3603 isl_union_map
*sink
, *source
, *dep
;
3604 isl_schedule_constraints
*sc
;
3605 isl_schedule
*schedule
;
3606 isl_union_access_info
*access
;
3607 isl_union_flow
*flow
;
3610 str
= "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3611 "A[k] : k >= 1 and k <= -1 + n; "
3612 "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3613 "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }";
3614 domain
= isl_union_set_read_from_str(ctx
, str
);
3615 sc
= isl_schedule_constraints_on_domain(domain
);
3616 str
= "[n] -> { D[k, i] -> C[1 + k, k - i] : "
3617 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3618 "D[k, i] -> C[1 + k, i] : "
3619 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3620 "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; "
3621 "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }";
3622 validity
= isl_union_map_read_from_str(ctx
, str
);
3623 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3624 str
= "[n] -> { C[k, i] -> D[k, i] : "
3625 "0 <= i <= -1 + k and k <= -1 + n }";
3626 proximity
= isl_union_map_read_from_str(ctx
, str
);
3627 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3628 str
= "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : "
3629 "i <= -1 + k and i >= 1 and k <= -2 + n; "
3630 "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : "
3631 "k <= -1 + n and i >= 0 and i <= -2 + k }";
3632 condition
= isl_union_map_read_from_str(ctx
, str
);
3633 str
= "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : "
3634 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3635 "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : "
3636 "i >= 0 and i <= -1 + k and k <= -1 + n and "
3637 "k' <= -1 + n and k' >= k - i and k' >= 1 + k; "
3638 "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : "
3639 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3640 "[B[k, i] -> c[]] -> [A[k'] -> d[]] : "
3641 "k <= -1 + n and i >= 0 and i <= -1 + k and "
3642 "k' >= 1 and k' <= -1 + n and k' >= 1 + k }";
3643 validity
= isl_union_map_read_from_str(ctx
, str
);
3644 sc
= isl_schedule_constraints_set_conditional_validity(sc
, condition
,
3646 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3647 str
= "{ D[2,0] -> [] }";
3648 sink
= isl_union_map_read_from_str(ctx
, str
);
3649 access
= isl_union_access_info_from_sink(sink
);
3650 str
= "{ C[2,1] -> [] }";
3651 source
= isl_union_map_read_from_str(ctx
, str
);
3652 access
= isl_union_access_info_set_must_source(access
, source
);
3653 access
= isl_union_access_info_set_schedule(access
, schedule
);
3654 flow
= isl_union_access_info_compute_flow(access
);
3655 dep
= isl_union_flow_get_must_dependence(flow
);
3656 isl_union_flow_free(flow
);
3657 empty
= isl_union_map_is_empty(dep
);
3658 isl_union_map_free(dep
);
3663 isl_die(ctx
, isl_error_unknown
,
3664 "conditional validity not respected", return -1);
3669 /* Input for testing of schedule construction based on
3670 * conditional constraints.
3672 * domain is the iteration domain
3673 * flow are the flow dependences, which determine the validity and
3674 * proximity constraints
3675 * condition are the conditions on the conditional validity constraints
3676 * conditional_validity are the conditional validity constraints
3677 * outer_band_n is the expected number of members in the outer band
3682 const char *condition
;
3683 const char *conditional_validity
;
3685 } live_range_tests
[] = {
3686 /* Contrived example that illustrates that we need to keep
3687 * track of tagged condition dependences and
3688 * tagged conditional validity dependences
3689 * in isl_sched_edge separately.
3690 * In particular, the conditional validity constraints on A
3691 * cannot be satisfied,
3692 * but they can be ignored because there are no corresponding
3693 * condition constraints. However, we do have an additional
3694 * conditional validity constraint that maps to the same
3695 * dependence relation
3696 * as the condition constraint on B. If we did not make a distinction
3697 * between tagged condition and tagged conditional validity
3698 * dependences, then we
3699 * could end up treating this shared dependence as an condition
3700 * constraint on A, forcing a localization of the conditions,
3701 * which is impossible.
3703 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
3704 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
3705 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
3706 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3707 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3708 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
3711 /* TACO 2013 Fig. 7 */
3712 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3713 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3714 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3715 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
3716 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
3717 "0 <= i < n and 0 <= j < n - 1 }",
3718 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
3719 "0 <= i < n and 0 <= j < j' < n;"
3720 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
3721 "0 <= i < i' < n and 0 <= j,j' < n;"
3722 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
3723 "0 <= i,j,j' < n and j < j' }",
3726 /* TACO 2013 Fig. 7, without tags */
3727 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3728 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3729 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3730 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3731 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3732 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
3733 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
3734 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
3737 /* TACO 2013 Fig. 12 */
3738 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
3739 "S3[i,3] : 0 <= i <= 1 }",
3740 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
3741 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
3742 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
3743 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
3744 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3745 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
3746 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3747 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
3748 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
3749 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
3750 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
3755 /* Test schedule construction based on conditional constraints.
3756 * In particular, check the number of members in the outer band node
3757 * as an indication of whether tiling is possible or not.
3759 static int test_conditional_schedule_constraints(isl_ctx
*ctx
)
3762 isl_union_set
*domain
;
3763 isl_union_map
*condition
;
3764 isl_union_map
*flow
;
3765 isl_union_map
*validity
;
3766 isl_schedule_constraints
*sc
;
3767 isl_schedule
*schedule
;
3768 isl_schedule_node
*node
;
3771 if (test_special_conditional_schedule_constraints(ctx
) < 0)
3774 for (i
= 0; i
< ARRAY_SIZE(live_range_tests
); ++i
) {
3775 domain
= isl_union_set_read_from_str(ctx
,
3776 live_range_tests
[i
].domain
);
3777 flow
= isl_union_map_read_from_str(ctx
,
3778 live_range_tests
[i
].flow
);
3779 condition
= isl_union_map_read_from_str(ctx
,
3780 live_range_tests
[i
].condition
);
3781 validity
= isl_union_map_read_from_str(ctx
,
3782 live_range_tests
[i
].conditional_validity
);
3783 sc
= isl_schedule_constraints_on_domain(domain
);
3784 sc
= isl_schedule_constraints_set_validity(sc
,
3785 isl_union_map_copy(flow
));
3786 sc
= isl_schedule_constraints_set_proximity(sc
, flow
);
3787 sc
= isl_schedule_constraints_set_conditional_validity(sc
,
3788 condition
, validity
);
3789 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3790 node
= isl_schedule_get_root(schedule
);
3792 isl_schedule_node_get_type(node
) != isl_schedule_node_band
)
3793 node
= isl_schedule_node_first_child(node
);
3794 n_member
= isl_schedule_node_band_n_member(node
);
3795 isl_schedule_node_free(node
);
3796 isl_schedule_free(schedule
);
3800 if (n_member
!= live_range_tests
[i
].outer_band_n
)
3801 isl_die(ctx
, isl_error_unknown
,
3802 "unexpected number of members in outer band",
3808 /* Check that the schedule computed for the given instance set and
3809 * dependence relation strongly satisfies the dependences.
3810 * In particular, check that no instance is scheduled before
3811 * or together with an instance on which it depends.
3812 * Earlier versions of isl would produce a schedule that
3813 * only weakly satisfies the dependences.
3815 static int test_strongly_satisfying_schedule(isl_ctx
*ctx
)
3817 const char *domain
, *dep
;
3818 isl_union_map
*D
, *schedule
;
3822 domain
= "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; "
3823 "A[i0] : 0 <= i0 <= 1 }";
3824 dep
= "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; "
3825 "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }";
3826 schedule
= compute_schedule(ctx
, domain
, dep
, dep
);
3827 D
= isl_union_map_read_from_str(ctx
, dep
);
3828 D
= isl_union_map_apply_domain(D
, isl_union_map_copy(schedule
));
3829 D
= isl_union_map_apply_range(D
, schedule
);
3830 map
= isl_map_from_union_map(D
);
3831 ge
= isl_map_lex_ge(isl_space_domain(isl_map_get_space(map
)));
3832 map
= isl_map_intersect(map
, ge
);
3833 empty
= isl_map_is_empty(map
);
3839 isl_die(ctx
, isl_error_unknown
,
3840 "dependences not strongly satisfied", return -1);
3845 /* Compute a schedule for input where the instance set constraints
3846 * conflict with the context constraints.
3847 * Earlier versions of isl did not properly handle this situation.
3849 static int test_conflicting_context_schedule(isl_ctx
*ctx
)
3851 isl_union_map
*schedule
;
3852 const char *domain
, *context
;
3854 domain
= "[n] -> { A[] : n >= 0 }";
3855 context
= "[n] -> { : n < 0 }";
3856 schedule
= compute_schedule_with_context(ctx
,
3857 domain
, "{}", "{}", context
);
3858 isl_union_map_free(schedule
);
3866 /* Check that the dependence carrying step is not confused by
3867 * a bound on the coefficient size.
3868 * In particular, force the scheduler to move to a dependence carrying
3869 * step by demanding outer coincidence and bound the size of
3870 * the coefficients. Earlier versions of isl would take this
3871 * bound into account while carrying dependences, breaking
3872 * fundamental assumptions.
3873 * On the other hand, the dependence carrying step now tries
3874 * to prevent loop coalescing by default, so check that indeed
3875 * no loop coalescing occurs by comparing the computed schedule
3876 * to the expected non-coalescing schedule.
3878 static int test_bounded_coefficients_schedule(isl_ctx
*ctx
)
3880 const char *domain
, *dep
;
3883 isl_schedule_constraints
*sc
;
3884 isl_schedule
*schedule
;
3885 isl_union_map
*sched1
, *sched2
;
3888 domain
= "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }";
3889 dep
= "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and "
3891 "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }";
3892 I
= isl_union_set_read_from_str(ctx
, domain
);
3893 D
= isl_union_map_read_from_str(ctx
, dep
);
3894 sc
= isl_schedule_constraints_on_domain(I
);
3895 sc
= isl_schedule_constraints_set_validity(sc
, isl_union_map_copy(D
));
3896 sc
= isl_schedule_constraints_set_coincidence(sc
, D
);
3897 isl_options_set_schedule_outer_coincidence(ctx
, 1);
3898 isl_options_set_schedule_max_coefficient(ctx
, 20);
3899 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3900 isl_options_set_schedule_max_coefficient(ctx
, -1);
3901 isl_options_set_schedule_outer_coincidence(ctx
, 0);
3902 sched1
= isl_schedule_get_map(schedule
);
3903 isl_schedule_free(schedule
);
3905 sched2
= isl_union_map_read_from_str(ctx
, "{ C[x,y] -> [x,y] }");
3906 equal
= isl_union_map_is_equal(sched1
, sched2
);
3907 isl_union_map_free(sched1
);
3908 isl_union_map_free(sched2
);
3913 isl_die(ctx
, isl_error_unknown
,
3914 "unexpected schedule", return -1);
3919 /* Check that a set of schedule constraints that only allow for
3920 * a coalescing schedule still produces a schedule even if the user
3921 * request a non-coalescing schedule. Earlier versions of isl
3922 * would not handle this case correctly.
3924 static int test_coalescing_schedule(isl_ctx
*ctx
)
3926 const char *domain
, *dep
;
3929 isl_schedule_constraints
*sc
;
3930 isl_schedule
*schedule
;
3931 int treat_coalescing
;
3933 domain
= "{ S[a, b] : 0 <= a <= 1 and 0 <= b <= 1 }";
3934 dep
= "{ S[a, b] -> S[a + b, 1 - b] }";
3935 I
= isl_union_set_read_from_str(ctx
, domain
);
3936 D
= isl_union_map_read_from_str(ctx
, dep
);
3937 sc
= isl_schedule_constraints_on_domain(I
);
3938 sc
= isl_schedule_constraints_set_validity(sc
, D
);
3939 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
3940 isl_options_set_schedule_treat_coalescing(ctx
, 1);
3941 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3942 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
3943 isl_schedule_free(schedule
);
3949 int test_schedule(isl_ctx
*ctx
)
3951 const char *D
, *W
, *R
, *V
, *P
, *S
;
3952 int max_coincidence
;
3953 int treat_coalescing
;
3955 /* Handle resulting schedule with zero bands. */
3956 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
3960 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
3961 W
= "{ S1[t,i] -> a[t,i] }";
3962 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
3963 "S1[t,i] -> a[t-1,i+1] }";
3964 S
= "{ S1[t,i] -> [t,i] }";
3965 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3968 /* Fig. 5 of CC2008 */
3969 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
3971 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
3972 "j >= 2 and j <= -1 + N }";
3973 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
3974 "j >= 2 and j <= -1 + N; "
3975 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
3976 "j >= 2 and j <= -1 + N }";
3977 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3978 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3981 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
3982 W
= "{ S1[i] -> a[i] }";
3983 R
= "{ S2[i] -> a[i+1] }";
3984 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3985 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3988 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
3989 W
= "{ S1[i] -> a[i] }";
3990 R
= "{ S2[i] -> a[9-i] }";
3991 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3992 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3995 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
3996 W
= "{ S1[i] -> a[i] }";
3997 R
= "[N] -> { S2[i] -> a[N-1-i] }";
3998 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3999 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
4002 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
4003 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
4004 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
4005 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
4006 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4009 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4010 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
4011 R
= "{ S2[i,j] -> a[i-1,j] }";
4012 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4013 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4016 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4017 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
4018 R
= "{ S2[i,j] -> a[i,j-1] }";
4019 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4020 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4023 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
4024 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
4025 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
4026 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
4027 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
4028 "S_0[] -> [0, 0, 0] }";
4029 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
4031 ctx
->opt
->schedule_parametric
= 0;
4032 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4034 ctx
->opt
->schedule_parametric
= 1;
4036 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
4037 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
4038 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
4039 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
4040 "S4[i] -> a[i,N] }";
4041 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
4042 "S4[i] -> [4,i,0] }";
4043 max_coincidence
= isl_options_get_schedule_maximize_coincidence(ctx
);
4044 isl_options_set_schedule_maximize_coincidence(ctx
, 0);
4045 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
4047 isl_options_set_schedule_maximize_coincidence(ctx
, max_coincidence
);
4049 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
4050 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4052 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4054 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
4056 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
4057 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4060 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
4061 " S_2[t] : t >= 0 and t <= -1 + N; "
4062 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
4064 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
4065 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
4066 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
4067 "i >= 0 and i <= -1 + N }";
4068 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
4069 "i >= 0 and i <= -1 + N; "
4070 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
4071 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
4072 " S_0[t] -> [0, t, 0] }";
4074 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
4076 ctx
->opt
->schedule_parametric
= 0;
4077 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4079 ctx
->opt
->schedule_parametric
= 1;
4081 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
4082 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
4083 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
4086 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
4087 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
4088 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
4089 "j >= 0 and j <= -1 + N; "
4090 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4091 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
4092 "j >= 0 and j <= -1 + N; "
4093 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4094 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
4095 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4098 D
= "{ S_0[i] : i >= 0 }";
4099 W
= "{ S_0[i] -> a[i] : i >= 0 }";
4100 R
= "{ S_0[i] -> a[0] : i >= 0 }";
4101 S
= "{ S_0[i] -> [0, i, 0] }";
4102 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4105 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
4106 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
4107 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
4108 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
4109 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4112 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
4113 "k <= -1 + n and k >= 0 }";
4114 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
4115 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
4116 "k <= -1 + n and k >= 0; "
4117 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
4118 "k <= -1 + n and k >= 0; "
4119 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
4120 "k <= -1 + n and k >= 0 }";
4121 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
4122 ctx
->opt
->schedule_outer_coincidence
= 1;
4123 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
4125 ctx
->opt
->schedule_outer_coincidence
= 0;
4127 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
4128 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
4129 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
4130 "Stmt_for_body24[i0, i1, 1, 0]:"
4131 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
4132 "Stmt_for_body7[i0, i1, i2]:"
4133 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
4136 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
4137 "Stmt_for_body24[1, i1, i2, i3]:"
4138 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
4140 "Stmt_for_body24[0, i1, i2, i3] -> "
4141 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
4142 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
4144 "Stmt_for_body24[0, i1, i2, i3] ->"
4145 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
4146 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
4147 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
4148 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
4149 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
4150 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
4151 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
4152 "i1 <= 6 and i1 >= 0;"
4153 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
4154 "Stmt_for_body7[i0, i1, i2] -> "
4155 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
4156 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
4157 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
4158 "Stmt_for_body7[i0, i1, i2] -> "
4159 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
4160 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
4161 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
4163 S
= "{ Stmt_for_body24[i0, i1, i2, i3] -> "
4164 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
4165 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
4167 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
4168 isl_options_set_schedule_treat_coalescing(ctx
, 0);
4169 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4171 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
4173 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
4174 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
4175 "j >= 1 and j <= 7;"
4176 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
4177 "j >= 1 and j <= 8 }";
4179 S
= "{ S_0[i, j] -> [i + j, j] }";
4180 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4181 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4183 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4185 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
4186 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
4187 "j >= 0 and j <= -1 + i }";
4188 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
4189 "i <= -1 + N and j >= 0;"
4190 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
4193 S
= "{ S_0[i, j] -> [i, j] }";
4194 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4195 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4197 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4199 /* Test both algorithms on a case with only proximity dependences. */
4200 D
= "{ S[i,j] : 0 <= i <= 10 }";
4202 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
4203 S
= "{ S[i, j] -> [j, i] }";
4204 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4205 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4207 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4208 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4211 D
= "{ A[a]; B[] }";
4213 P
= "{ A[a] -> B[] }";
4214 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4217 if (test_padded_schedule(ctx
) < 0)
4220 /* Check that check for progress is not confused by rational
4223 D
= "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
4224 V
= "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
4226 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
4227 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
4229 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4230 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4232 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4234 /* Check that we allow schedule rows that are only non-trivial
4235 * on some full-dimensional domains.
4237 D
= "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
4238 V
= "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
4239 "S1[j] -> S2[1] : 0 <= j <= 1 }";
4241 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4242 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4244 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4246 if (test_conditional_schedule_constraints(ctx
) < 0)
4249 if (test_strongly_satisfying_schedule(ctx
) < 0)
4252 if (test_conflicting_context_schedule(ctx
) < 0)
4255 if (test_bounded_coefficients_schedule(ctx
) < 0)
4257 if (test_coalescing_schedule(ctx
) < 0)
4263 /* Perform scheduling tests using the whole component scheduler.
4265 static int test_schedule_whole(isl_ctx
*ctx
)
4270 whole
= isl_options_get_schedule_whole_component(ctx
);
4271 isl_options_set_schedule_whole_component(ctx
, 1);
4272 r
= test_schedule(ctx
);
4273 isl_options_set_schedule_whole_component(ctx
, whole
);
4278 /* Perform scheduling tests using the incremental scheduler.
4280 static int test_schedule_incremental(isl_ctx
*ctx
)
4285 whole
= isl_options_get_schedule_whole_component(ctx
);
4286 isl_options_set_schedule_whole_component(ctx
, 0);
4287 r
= test_schedule(ctx
);
4288 isl_options_set_schedule_whole_component(ctx
, whole
);
4293 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
4295 isl_union_map
*umap
;
4298 umap
= isl_union_map_read_from_str(ctx
, str
);
4299 test
= isl_union_map_plain_is_injective(umap
);
4300 isl_union_map_free(umap
);
4303 if (test
== injective
)
4306 isl_die(ctx
, isl_error_unknown
,
4307 "map not detected as injective", return -1);
4309 isl_die(ctx
, isl_error_unknown
,
4310 "map detected as injective", return -1);
4313 int test_injective(isl_ctx
*ctx
)
4317 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
4319 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
4321 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
4323 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
4325 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
4327 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
4329 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
4331 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
4334 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
4335 if (test_plain_injective(ctx
, str
, 1))
4337 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
4338 if (test_plain_injective(ctx
, str
, 0))
4344 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
4352 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
4353 equal
= isl_aff_plain_is_equal(aff
, aff2
);
4359 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
4363 equal
= aff_plain_is_equal(aff
, str
);
4367 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
4368 "result not as expected", return -1);
4373 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4374 __isl_take isl_aff
*aff2
);
4376 ['+'] = { &isl_aff_add
},
4377 ['-'] = { &isl_aff_sub
},
4378 ['*'] = { &isl_aff_mul
},
4379 ['/'] = { &isl_aff_div
},
4387 } aff_bin_tests
[] = {
4388 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
4389 "{ [i] -> [2i] }" },
4390 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
4392 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
4393 "{ [i] -> [2i] }" },
4394 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
4395 "{ [i] -> [2i] }" },
4396 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
4397 "{ [i] -> [i/2] }" },
4398 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
4400 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
4401 "{ [i] -> [NaN] }" },
4402 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
4403 "{ [i] -> [NaN] }" },
4404 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
4405 "{ [i] -> [NaN] }" },
4406 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
4407 "{ [i] -> [NaN] }" },
4408 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
4409 "{ [i] -> [NaN] }" },
4410 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
4411 "{ [i] -> [NaN] }" },
4412 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
4413 "{ [i] -> [NaN] }" },
4414 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
4415 "{ [i] -> [NaN] }" },
4416 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
4417 "{ [i] -> [NaN] }" },
4418 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
4419 "{ [i] -> [NaN] }" },
4420 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
4421 "{ [i] -> [NaN] }" },
4422 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
4423 "{ [i] -> [NaN] }" },
4426 /* Perform some basic tests of binary operations on isl_aff objects.
4428 static int test_bin_aff(isl_ctx
*ctx
)
4431 isl_aff
*aff1
, *aff2
, *res
;
4432 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4433 __isl_take isl_aff
*aff2
);
4436 for (i
= 0; i
< ARRAY_SIZE(aff_bin_tests
); ++i
) {
4437 aff1
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg1
);
4438 aff2
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg2
);
4439 res
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].res
);
4440 fn
= aff_bin_op
[aff_bin_tests
[i
].op
].fn
;
4441 aff1
= fn(aff1
, aff2
);
4442 if (isl_aff_is_nan(res
))
4443 ok
= isl_aff_is_nan(aff1
);
4445 ok
= isl_aff_plain_is_equal(aff1
, res
);
4451 isl_die(ctx
, isl_error_unknown
,
4452 "unexpected result", return -1);
4459 __isl_give isl_union_pw_multi_aff
*(*fn
)(
4460 __isl_take isl_union_pw_multi_aff
*upma1
,
4461 __isl_take isl_union_pw_multi_aff
*upma2
);
4465 } upma_bin_tests
[] = {
4466 { &isl_union_pw_multi_aff_add
, "{ A[] -> [0]; B[0] -> [1] }",
4467 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
4468 { &isl_union_pw_multi_aff_union_add
, "{ A[] -> [0]; B[0] -> [1] }",
4469 "{ B[x] -> [2] : x >= 0 }",
4470 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
4471 { &isl_union_pw_multi_aff_pullback_union_pw_multi_aff
,
4472 "{ A[] -> B[0]; C[x] -> B[1] : x < 10; C[y] -> B[2] : y >= 10 }",
4473 "{ D[i] -> A[] : i < 0; D[i] -> C[i + 5] : i >= 0 }",
4474 "{ D[i] -> B[0] : i < 0; D[i] -> B[1] : 0 <= i < 5; "
4475 "D[i] -> B[2] : i >= 5 }" },
4476 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4477 "{ B[x] -> C[2] : x > 0 }",
4478 "{ B[x] -> A[1] : x <= 0; B[x] -> C[2] : x > 0 }" },
4479 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4480 "{ B[x] -> A[2] : x >= 0 }",
4481 "{ B[x] -> A[1] : x < 0; B[x] -> A[2] : x > 0; B[0] -> A[3] }" },
4484 /* Perform some basic tests of binary operations on
4485 * isl_union_pw_multi_aff objects.
4487 static int test_bin_upma(isl_ctx
*ctx
)
4490 isl_union_pw_multi_aff
*upma1
, *upma2
, *res
;
4493 for (i
= 0; i
< ARRAY_SIZE(upma_bin_tests
); ++i
) {
4494 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
4495 upma_bin_tests
[i
].arg1
);
4496 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
4497 upma_bin_tests
[i
].arg2
);
4498 res
= isl_union_pw_multi_aff_read_from_str(ctx
,
4499 upma_bin_tests
[i
].res
);
4500 upma1
= upma_bin_tests
[i
].fn(upma1
, upma2
);
4501 ok
= isl_union_pw_multi_aff_plain_is_equal(upma1
, res
);
4502 isl_union_pw_multi_aff_free(upma1
);
4503 isl_union_pw_multi_aff_free(res
);
4507 isl_die(ctx
, isl_error_unknown
,
4508 "unexpected result", return -1);
4515 __isl_give isl_union_pw_multi_aff
*(*fn
)(
4516 __isl_take isl_union_pw_multi_aff
*upma1
,
4517 __isl_take isl_union_pw_multi_aff
*upma2
);
4520 } upma_bin_fail_tests
[] = {
4521 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4522 "{ B[x] -> C[2] : x >= 0 }" },
4525 /* Perform some basic tests of binary operations on
4526 * isl_union_pw_multi_aff objects that are expected to fail.
4528 static int test_bin_upma_fail(isl_ctx
*ctx
)
4531 isl_union_pw_multi_aff
*upma1
, *upma2
;
4534 on_error
= isl_options_get_on_error(ctx
);
4535 isl_options_set_on_error(ctx
, ISL_ON_ERROR_CONTINUE
);
4536 n
= ARRAY_SIZE(upma_bin_fail_tests
);
4537 for (i
= 0; i
< n
; ++i
) {
4538 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
4539 upma_bin_fail_tests
[i
].arg1
);
4540 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
4541 upma_bin_fail_tests
[i
].arg2
);
4542 upma1
= upma_bin_fail_tests
[i
].fn(upma1
, upma2
);
4543 isl_union_pw_multi_aff_free(upma1
);
4547 isl_options_set_on_error(ctx
, on_error
);
4549 isl_die(ctx
, isl_error_unknown
,
4550 "operation not expected to succeed", return -1);
4555 int test_aff(isl_ctx
*ctx
)
4560 isl_local_space
*ls
;
4564 if (test_bin_aff(ctx
) < 0)
4566 if (test_bin_upma(ctx
) < 0)
4568 if (test_bin_upma_fail(ctx
) < 0)
4571 space
= isl_space_set_alloc(ctx
, 0, 1);
4572 ls
= isl_local_space_from_space(space
);
4573 aff
= isl_aff_zero_on_domain(ls
);
4575 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4576 aff
= isl_aff_scale_down_ui(aff
, 3);
4577 aff
= isl_aff_floor(aff
);
4578 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4579 aff
= isl_aff_scale_down_ui(aff
, 2);
4580 aff
= isl_aff_floor(aff
);
4581 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4584 set
= isl_set_read_from_str(ctx
, str
);
4585 aff
= isl_aff_gist(aff
, set
);
4587 aff
= isl_aff_add_constant_si(aff
, -16);
4588 zero
= isl_aff_plain_is_zero(aff
);
4594 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4596 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
4597 aff
= isl_aff_scale_down_ui(aff
, 64);
4598 aff
= isl_aff_floor(aff
);
4599 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
4607 /* Check that the computation below results in a single expression.
4608 * One or two expressions may result depending on which constraint
4609 * ends up being considered as redundant with respect to the other
4610 * constraints after the projection that is performed internally
4611 * by isl_set_dim_min.
4613 static int test_dim_max_1(isl_ctx
*ctx
)
4620 str
= "[n] -> { [a, b] : n >= 0 and 4a >= -4 + n and b >= 0 and "
4621 "-4a <= b <= 3 and b < n - 4a }";
4622 set
= isl_set_read_from_str(ctx
, str
);
4623 pa
= isl_set_dim_min(set
, 0);
4624 n
= isl_pw_aff_n_piece(pa
);
4625 isl_pw_aff_free(pa
);
4630 isl_die(ctx
, isl_error_unknown
, "expecting single expression",
4636 int test_dim_max(isl_ctx
*ctx
)
4640 isl_set
*set1
, *set2
;
4645 if (test_dim_max_1(ctx
) < 0)
4648 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
4649 set
= isl_set_read_from_str(ctx
, str
);
4650 pwaff
= isl_set_dim_max(set
, 0);
4651 set1
= isl_set_from_pw_aff(pwaff
);
4652 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
4653 set2
= isl_set_read_from_str(ctx
, str
);
4654 equal
= isl_set_is_equal(set1
, set2
);
4660 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4662 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
4663 set
= isl_set_read_from_str(ctx
, str
);
4664 pwaff
= isl_set_dim_max(set
, 0);
4665 set1
= isl_set_from_pw_aff(pwaff
);
4666 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4667 set2
= isl_set_read_from_str(ctx
, str
);
4668 equal
= isl_set_is_equal(set1
, set2
);
4674 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4676 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
4677 set
= isl_set_read_from_str(ctx
, str
);
4678 pwaff
= isl_set_dim_max(set
, 0);
4679 set1
= isl_set_from_pw_aff(pwaff
);
4680 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4681 set2
= isl_set_read_from_str(ctx
, str
);
4682 equal
= isl_set_is_equal(set1
, set2
);
4688 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4690 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
4691 "0 <= i < N and 0 <= j < M }";
4692 map
= isl_map_read_from_str(ctx
, str
);
4693 set
= isl_map_range(map
);
4695 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
4696 set1
= isl_set_from_pw_aff(pwaff
);
4697 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
4698 set2
= isl_set_read_from_str(ctx
, str
);
4699 equal
= isl_set_is_equal(set1
, set2
);
4703 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
4704 set1
= isl_set_from_pw_aff(pwaff
);
4705 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
4706 set2
= isl_set_read_from_str(ctx
, str
);
4707 if (equal
>= 0 && equal
)
4708 equal
= isl_set_is_equal(set1
, set2
);
4717 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4719 /* Check that solutions are properly merged. */
4720 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
4721 "c <= -1 + n - 4a - 2b and c >= -2b and "
4722 "4a >= -4 + n and c >= 0 }";
4723 set
= isl_set_read_from_str(ctx
, str
);
4724 pwaff
= isl_set_dim_min(set
, 2);
4725 set1
= isl_set_from_pw_aff(pwaff
);
4726 str
= "[n] -> { [(0)] : n >= 1 }";
4727 set2
= isl_set_read_from_str(ctx
, str
);
4728 equal
= isl_set_is_equal(set1
, set2
);
4735 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4737 /* Check that empty solution lie in the right space. */
4738 str
= "[n] -> { [t,a] : 1 = 0 }";
4739 set
= isl_set_read_from_str(ctx
, str
);
4740 pwaff
= isl_set_dim_max(set
, 0);
4741 set1
= isl_set_from_pw_aff(pwaff
);
4742 str
= "[n] -> { [t] : 1 = 0 }";
4743 set2
= isl_set_read_from_str(ctx
, str
);
4744 equal
= isl_set_is_equal(set1
, set2
);
4751 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4756 /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
4758 static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff
*pma
,
4762 isl_pw_multi_aff
*pma2
;
4768 ctx
= isl_pw_multi_aff_get_ctx(pma
);
4769 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4770 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma2
);
4771 isl_pw_multi_aff_free(pma2
);
4776 /* Check that "pma" is obviously equal to the isl_pw_multi_aff
4777 * represented by "str".
4779 static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff
*pma
,
4784 equal
= pw_multi_aff_plain_is_equal(pma
, str
);
4788 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_unknown
,
4789 "result not as expected", return -1);
4793 /* Basic test for isl_pw_multi_aff_product.
4795 * Check that multiple pieces are properly handled.
4797 static int test_product_pma(isl_ctx
*ctx
)
4801 isl_pw_multi_aff
*pma1
, *pma2
;
4803 str
= "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
4804 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4805 str
= "{ C[] -> D[] }";
4806 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4807 pma1
= isl_pw_multi_aff_product(pma1
, pma2
);
4808 str
= "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
4809 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
4810 equal
= pw_multi_aff_check_plain_equal(pma1
, str
);
4811 isl_pw_multi_aff_free(pma1
);
4818 int test_product(isl_ctx
*ctx
)
4822 isl_union_set
*uset1
, *uset2
;
4826 set
= isl_set_read_from_str(ctx
, str
);
4827 set
= isl_set_product(set
, isl_set_copy(set
));
4828 ok
= isl_set_is_wrapping(set
);
4833 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4836 uset1
= isl_union_set_read_from_str(ctx
, str
);
4837 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
4838 str
= "{ [[] -> []] }";
4839 uset2
= isl_union_set_read_from_str(ctx
, str
);
4840 ok
= isl_union_set_is_equal(uset1
, uset2
);
4841 isl_union_set_free(uset1
);
4842 isl_union_set_free(uset2
);
4846 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4848 if (test_product_pma(ctx
) < 0)
4854 /* Check that two sets are not considered disjoint just because
4855 * they have a different set of (named) parameters.
4857 static int test_disjoint(isl_ctx
*ctx
)
4860 isl_set
*set
, *set2
;
4863 str
= "[n] -> { [[]->[]] }";
4864 set
= isl_set_read_from_str(ctx
, str
);
4865 str
= "{ [[]->[]] }";
4866 set2
= isl_set_read_from_str(ctx
, str
);
4867 disjoint
= isl_set_is_disjoint(set
, set2
);
4873 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4878 int test_equal(isl_ctx
*ctx
)
4881 isl_set
*set
, *set2
;
4885 set
= isl_set_read_from_str(ctx
, str
);
4887 set2
= isl_set_read_from_str(ctx
, str
);
4888 equal
= isl_set_is_equal(set
, set2
);
4894 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4899 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
4900 enum isl_dim_type type
, unsigned pos
, int fixed
)
4904 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
4911 isl_die(ctx
, isl_error_unknown
,
4912 "map not detected as fixed", return -1);
4914 isl_die(ctx
, isl_error_unknown
,
4915 "map detected as fixed", return -1);
4918 int test_fixed(isl_ctx
*ctx
)
4923 str
= "{ [i] -> [i] }";
4924 map
= isl_map_read_from_str(ctx
, str
);
4925 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
4927 str
= "{ [i] -> [1] }";
4928 map
= isl_map_read_from_str(ctx
, str
);
4929 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4931 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
4932 map
= isl_map_read_from_str(ctx
, str
);
4933 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4935 map
= isl_map_read_from_str(ctx
, str
);
4936 map
= isl_map_neg(map
);
4937 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4943 struct isl_vertices_test_data
{
4946 const char *vertex
[6];
4947 } vertices_tests
[] = {
4948 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
4949 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
4950 { "{ A[t, i] : t = 14 and i = 1 }",
4951 1, { "{ A[14, 1] }" } },
4952 { "[n, m] -> { [a, b, c] : b <= a and a <= n and b > 0 and c >= b and "
4953 "c <= m and m <= n and m > 0 }",
4955 "[n, m] -> { [n, m, m] : 0 < m <= n }",
4956 "[n, m] -> { [n, 1, m] : 0 < m <= n }",
4957 "[n, m] -> { [n, 1, 1] : 0 < m <= n }",
4958 "[n, m] -> { [m, m, m] : 0 < m <= n }",
4959 "[n, m] -> { [1, 1, m] : 0 < m <= n }",
4960 "[n, m] -> { [1, 1, 1] : 0 < m <= n }"
4964 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
4966 static isl_stat
find_vertex(__isl_take isl_vertex
*vertex
, void *user
)
4968 struct isl_vertices_test_data
*data
= user
;
4971 isl_basic_set
*bset
;
4972 isl_pw_multi_aff
*pma
;
4976 ctx
= isl_vertex_get_ctx(vertex
);
4977 bset
= isl_vertex_get_domain(vertex
);
4978 ma
= isl_vertex_get_expr(vertex
);
4979 pma
= isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset
), ma
);
4981 for (i
= 0; i
< data
->n
; ++i
) {
4982 isl_pw_multi_aff
*pma_i
;
4984 pma_i
= isl_pw_multi_aff_read_from_str(ctx
, data
->vertex
[i
]);
4985 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma_i
);
4986 isl_pw_multi_aff_free(pma_i
);
4988 if (equal
< 0 || equal
)
4992 isl_pw_multi_aff_free(pma
);
4993 isl_vertex_free(vertex
);
4996 return isl_stat_error
;
4998 return equal
? isl_stat_ok
: isl_stat_error
;
5001 int test_vertices(isl_ctx
*ctx
)
5005 for (i
= 0; i
< ARRAY_SIZE(vertices_tests
); ++i
) {
5006 isl_basic_set
*bset
;
5007 isl_vertices
*vertices
;
5011 bset
= isl_basic_set_read_from_str(ctx
, vertices_tests
[i
].set
);
5012 vertices
= isl_basic_set_compute_vertices(bset
);
5013 n
= isl_vertices_get_n_vertices(vertices
);
5014 if (vertices_tests
[i
].n
!= n
)
5016 if (isl_vertices_foreach_vertex(vertices
, &find_vertex
,
5017 &vertices_tests
[i
]) < 0)
5019 isl_vertices_free(vertices
);
5020 isl_basic_set_free(bset
);
5025 isl_die(ctx
, isl_error_unknown
, "unexpected vertices",
5032 int test_union_pw(isl_ctx
*ctx
)
5036 isl_union_set
*uset
;
5037 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
5039 str
= "{ [x] -> x^2 }";
5040 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
5041 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
5042 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
5043 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
5044 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
5045 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
5046 isl_union_pw_qpolynomial_free(upwqp1
);
5047 isl_union_pw_qpolynomial_free(upwqp2
);
5051 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
5056 /* Test that isl_union_pw_qpolynomial_eval picks up the function
5057 * defined over the correct domain space.
5059 static int test_eval_1(isl_ctx
*ctx
)
5064 isl_union_pw_qpolynomial
*upwqp
;
5068 str
= "{ A[x] -> x^2; B[x] -> -x^2 }";
5069 upwqp
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
5071 set
= isl_set_read_from_str(ctx
, str
);
5072 pnt
= isl_set_sample_point(set
);
5073 v
= isl_union_pw_qpolynomial_eval(upwqp
, pnt
);
5074 cmp
= isl_val_cmp_si(v
, 36);
5080 isl_die(ctx
, isl_error_unknown
, "unexpected value", return -1);
5085 /* Check that isl_qpolynomial_eval handles getting called on a void point.
5087 static int test_eval_2(isl_ctx
*ctx
)
5092 isl_qpolynomial
*qp
;
5096 str
= "{ A[x] -> [x] }";
5097 qp
= isl_qpolynomial_from_aff(isl_aff_read_from_str(ctx
, str
));
5098 str
= "{ A[x] : false }";
5099 set
= isl_set_read_from_str(ctx
, str
);
5100 pnt
= isl_set_sample_point(set
);
5101 v
= isl_qpolynomial_eval(qp
, pnt
);
5102 ok
= isl_val_is_nan(v
);
5108 isl_die(ctx
, isl_error_unknown
, "expecting NaN", return -1);
5113 /* Perform basic polynomial evaluation tests.
5115 static int test_eval(isl_ctx
*ctx
)
5117 if (test_eval_1(ctx
) < 0)
5119 if (test_eval_2(ctx
) < 0)
5124 /* Descriptions of sets that are tested for reparsing after printing.
5126 const char *output_tests
[] = {
5127 "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }",
5130 /* Check that printing a set and reparsing a set from the printed output
5131 * results in the same set.
5133 static int test_output_set(isl_ctx
*ctx
)
5137 isl_set
*set1
, *set2
;
5140 for (i
= 0; i
< ARRAY_SIZE(output_tests
); ++i
) {
5141 set1
= isl_set_read_from_str(ctx
, output_tests
[i
]);
5142 str
= isl_set_to_str(set1
);
5143 set2
= isl_set_read_from_str(ctx
, str
);
5145 equal
= isl_set_is_equal(set1
, set2
);
5151 isl_die(ctx
, isl_error_unknown
,
5152 "parsed output not the same", return -1);
5158 int test_output(isl_ctx
*ctx
)
5166 if (test_output_set(ctx
) < 0)
5169 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
5170 pa
= isl_pw_aff_read_from_str(ctx
, str
);
5172 p
= isl_printer_to_str(ctx
);
5173 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
5174 p
= isl_printer_print_pw_aff(p
, pa
);
5175 s
= isl_printer_get_str(p
);
5176 isl_printer_free(p
);
5177 isl_pw_aff_free(pa
);
5181 equal
= !strcmp(s
, "4 * floord(x, 4) + 2 >= x ? 1 : 2");
5186 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
5191 int test_sample(isl_ctx
*ctx
)
5194 isl_basic_set
*bset1
, *bset2
;
5197 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
5198 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
5199 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
5200 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
5201 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
5202 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
5203 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
5204 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
5205 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
5206 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
5207 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
5208 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
5209 "d - 1073741821e and "
5210 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
5211 "3j >= 1 - a + b + 2e and "
5212 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
5213 "3i <= 4 - a + 4b - e and "
5214 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
5215 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
5216 "c <= -1 + a and 3i >= -2 - a + 3e and "
5217 "1073741822e <= 1073741823 - a + 1073741822b + c and "
5218 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
5219 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
5220 "1073741823e >= 1 + 1073741823b - d and "
5221 "3i >= 1073741823b + c - 1073741823e - f and "
5222 "3i >= 1 + 2b + e + 3g }";
5223 bset1
= isl_basic_set_read_from_str(ctx
, str
);
5224 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
5225 empty
= isl_basic_set_is_empty(bset2
);
5226 subset
= isl_basic_set_is_subset(bset2
, bset1
);
5227 isl_basic_set_free(bset1
);
5228 isl_basic_set_free(bset2
);
5229 if (empty
< 0 || subset
< 0)
5232 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
5234 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
5239 int test_fixed_power(isl_ctx
*ctx
)
5247 str
= "{ [i] -> [i + 1] }";
5248 map
= isl_map_read_from_str(ctx
, str
);
5249 isl_int_set_si(exp
, 23);
5250 map
= isl_map_fixed_power(map
, exp
);
5251 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
5260 int test_slice(isl_ctx
*ctx
)
5266 str
= "{ [i] -> [j] }";
5267 map
= isl_map_read_from_str(ctx
, str
);
5268 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5269 equal
= map_check_equal(map
, "{ [i] -> [i] }");
5274 str
= "{ [i] -> [j] }";
5275 map
= isl_map_read_from_str(ctx
, str
);
5276 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5277 equal
= map_check_equal(map
, "{ [i] -> [j] }");
5282 str
= "{ [i] -> [j] }";
5283 map
= isl_map_read_from_str(ctx
, str
);
5284 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5285 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
5290 str
= "{ [i] -> [j] }";
5291 map
= isl_map_read_from_str(ctx
, str
);
5292 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5293 equal
= map_check_equal(map
, "{ [0] -> [j] }");
5298 str
= "{ [i] -> [j] }";
5299 map
= isl_map_read_from_str(ctx
, str
);
5300 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5301 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
5306 str
= "{ [i] -> [j] }";
5307 map
= isl_map_read_from_str(ctx
, str
);
5308 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5309 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
5317 int test_eliminate(isl_ctx
*ctx
)
5323 str
= "{ [i] -> [j] : i = 2j }";
5324 map
= isl_map_read_from_str(ctx
, str
);
5325 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
5326 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
5334 /* Check that isl_set_dim_residue_class detects that the values of j
5335 * in the set below are all odd and that it does not detect any spurious
5338 static int test_residue_class(isl_ctx
*ctx
)
5345 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
5346 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
5347 set
= isl_set_read_from_str(ctx
, str
);
5350 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
5352 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
5353 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
5362 int test_align_parameters(isl_ctx
*ctx
)
5366 isl_multi_aff
*ma1
, *ma2
;
5369 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
5370 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
5372 space
= isl_space_params_alloc(ctx
, 1);
5373 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
5374 ma1
= isl_multi_aff_align_params(ma1
, space
);
5376 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
5377 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
5379 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
5381 isl_multi_aff_free(ma1
);
5382 isl_multi_aff_free(ma2
);
5387 isl_die(ctx
, isl_error_unknown
,
5388 "result not as expected", return -1);
5393 static int test_list(isl_ctx
*ctx
)
5395 isl_id
*a
, *b
, *c
, *d
, *id
;
5399 a
= isl_id_alloc(ctx
, "a", NULL
);
5400 b
= isl_id_alloc(ctx
, "b", NULL
);
5401 c
= isl_id_alloc(ctx
, "c", NULL
);
5402 d
= isl_id_alloc(ctx
, "d", NULL
);
5404 list
= isl_id_list_alloc(ctx
, 4);
5405 list
= isl_id_list_add(list
, a
);
5406 list
= isl_id_list_add(list
, b
);
5407 list
= isl_id_list_add(list
, c
);
5408 list
= isl_id_list_add(list
, d
);
5409 list
= isl_id_list_drop(list
, 1, 1);
5411 if (isl_id_list_n_id(list
) != 3) {
5412 isl_id_list_free(list
);
5413 isl_die(ctx
, isl_error_unknown
,
5414 "unexpected number of elements in list", return -1);
5417 id
= isl_id_list_get_id(list
, 0);
5420 id
= isl_id_list_get_id(list
, 1);
5423 id
= isl_id_list_get_id(list
, 2);
5427 isl_id_list_free(list
);
5430 isl_die(ctx
, isl_error_unknown
,
5431 "unexpected elements in list", return -1);
5436 const char *set_conversion_tests
[] = {
5437 "[N] -> { [i] : N - 1 <= 2 i <= N }",
5438 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
5439 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5440 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5441 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
5442 "[a, b] -> { [c, d] : (4*floor((-a + c)/4) = -a + c and "
5443 "32*floor((-b + d)/32) = -b + d and 5 <= c <= 8 and "
5444 "-3 + c <= d <= 28 + c) }",
5447 /* Check that converting from isl_set to isl_pw_multi_aff and back
5448 * to isl_set produces the original isl_set.
5450 static int test_set_conversion(isl_ctx
*ctx
)
5454 isl_set
*set1
, *set2
;
5455 isl_pw_multi_aff
*pma
;
5458 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
5459 str
= set_conversion_tests
[i
];
5460 set1
= isl_set_read_from_str(ctx
, str
);
5461 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
5462 set2
= isl_set_from_pw_multi_aff(pma
);
5463 equal
= isl_set_is_equal(set1
, set2
);
5470 isl_die(ctx
, isl_error_unknown
, "bad conversion",
5477 const char *conversion_tests
[] = {
5478 "{ [a, b, c, d] -> s0[a, b, e, f] : "
5479 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
5480 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
5481 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
5483 "{ [a, b] -> [c] : exists (e0 = floor((-a - b + c)/5): "
5484 "5e0 = -a - b + c and c >= -a and c <= 4 - a) }",
5485 "{ [a, b] -> [c] : exists d : 18 * d = -3 - a + 2c and 1 <= c <= 3 }",
5488 /* Check that converting from isl_map to isl_pw_multi_aff and back
5489 * to isl_map produces the original isl_map.
5491 static int test_map_conversion(isl_ctx
*ctx
)
5494 isl_map
*map1
, *map2
;
5495 isl_pw_multi_aff
*pma
;
5498 for (i
= 0; i
< ARRAY_SIZE(conversion_tests
); ++i
) {
5499 map1
= isl_map_read_from_str(ctx
, conversion_tests
[i
]);
5500 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
5501 map2
= isl_map_from_pw_multi_aff(pma
);
5502 equal
= isl_map_is_equal(map1
, map2
);
5509 isl_die(ctx
, isl_error_unknown
, "bad conversion",
5516 static int test_conversion(isl_ctx
*ctx
)
5518 if (test_set_conversion(ctx
) < 0)
5520 if (test_map_conversion(ctx
) < 0)
5525 /* Check that isl_basic_map_curry does not modify input.
5527 static int test_curry(isl_ctx
*ctx
)
5530 isl_basic_map
*bmap1
, *bmap2
;
5533 str
= "{ [A[] -> B[]] -> C[] }";
5534 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
5535 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
5536 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
5537 isl_basic_map_free(bmap1
);
5538 isl_basic_map_free(bmap2
);
5543 isl_die(ctx
, isl_error_unknown
,
5544 "curried map should not be equal to original",
5554 } preimage_tests
[] = {
5555 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
5556 "{ A[j,i] -> B[i,j] }",
5557 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
5558 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5559 "{ A[a,b] -> B[a/2,b/6] }",
5560 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
5561 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5562 "{ A[a,b] -> B[a/2,b/6] }",
5563 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
5564 "exists i,j : a = 2 i and b = 6 j }" },
5565 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
5566 "[n] -> { : 0 <= n <= 100 }" },
5567 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5568 "{ A[a] -> B[2a] }",
5569 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
5570 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5571 "{ A[a] -> B[([a/2])] }",
5572 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
5573 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
5574 "{ A[a] -> B[a,a,a/3] }",
5575 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
5576 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
5577 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
5580 static int test_preimage_basic_set(isl_ctx
*ctx
)
5583 isl_basic_set
*bset1
, *bset2
;
5587 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
5588 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
5589 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
5590 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
5591 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
5592 equal
= isl_basic_set_is_equal(bset1
, bset2
);
5593 isl_basic_set_free(bset1
);
5594 isl_basic_set_free(bset2
);
5598 isl_die(ctx
, isl_error_unknown
, "bad preimage",
5609 } preimage_domain_tests
[] = {
5610 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
5611 "{ A[j,i] -> B[i,j] }",
5612 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
5613 { "{ B[i] -> C[i]; D[i] -> E[i] }",
5614 "{ A[i] -> B[i + 1] }",
5615 "{ A[i] -> C[i + 1] }" },
5616 { "{ B[i] -> C[i]; B[i] -> E[i] }",
5617 "{ A[i] -> B[i + 1] }",
5618 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
5619 { "{ B[i] -> C[([i/2])] }",
5620 "{ A[i] -> B[2i] }",
5621 "{ A[i] -> C[i] }" },
5622 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
5623 "{ A[i] -> B[([i/5]), ([i/7])] }",
5624 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
5625 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
5626 "[N] -> { A[] -> B[([N/5])] }",
5627 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
5628 { "{ B[i] -> C[i] : exists a : i = 5 a }",
5629 "{ A[i] -> B[2i] }",
5630 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
5631 { "{ B[i] -> C[i] : exists a : i = 2 a; "
5632 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
5633 "{ A[i] -> B[2i] }",
5634 "{ A[i] -> C[2i] }" },
5635 { "{ A[i] -> B[i] }", "{ C[i] -> A[(i + floor(i/3))/2] }",
5636 "{ C[i] -> B[j] : 2j = i + floor(i/3) }" },
5639 static int test_preimage_union_map(isl_ctx
*ctx
)
5642 isl_union_map
*umap1
, *umap2
;
5646 for (i
= 0; i
< ARRAY_SIZE(preimage_domain_tests
); ++i
) {
5647 umap1
= isl_union_map_read_from_str(ctx
,
5648 preimage_domain_tests
[i
].map
);
5649 ma
= isl_multi_aff_read_from_str(ctx
,
5650 preimage_domain_tests
[i
].ma
);
5651 umap2
= isl_union_map_read_from_str(ctx
,
5652 preimage_domain_tests
[i
].res
);
5653 umap1
= isl_union_map_preimage_domain_multi_aff(umap1
, ma
);
5654 equal
= isl_union_map_is_equal(umap1
, umap2
);
5655 isl_union_map_free(umap1
);
5656 isl_union_map_free(umap2
);
5660 isl_die(ctx
, isl_error_unknown
, "bad preimage",
5667 static int test_preimage(isl_ctx
*ctx
)
5669 if (test_preimage_basic_set(ctx
) < 0)
5671 if (test_preimage_union_map(ctx
) < 0)
5681 } pullback_tests
[] = {
5682 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
5683 "{ A[a,b] -> C[b + 2a] }" },
5684 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
5685 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
5686 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
5687 "{ A[a] -> C[(a)/6] }" },
5688 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
5689 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
5690 "{ A[a] -> C[(2a)/3] }" },
5691 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
5692 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
5693 "{ A[i,j] -> C[i + j, i + j] }"},
5694 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
5695 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
5696 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
5697 { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }",
5698 "{ [i, j] -> [floor((i)/3), j] }",
5699 "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" },
5702 static int test_pullback(isl_ctx
*ctx
)
5705 isl_multi_aff
*ma1
, *ma2
;
5709 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
5710 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
5711 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
5712 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
5713 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
5714 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
5715 isl_multi_aff_free(ma1
);
5716 isl_multi_aff_free(ma2
);
5720 isl_die(ctx
, isl_error_unknown
, "bad pullback",
5727 /* Check that negation is printed correctly and that equal expressions
5728 * are correctly identified.
5730 static int test_ast(isl_ctx
*ctx
)
5732 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
5736 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
5737 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
5738 expr
= isl_ast_expr_add(expr1
, expr2
);
5739 expr2
= isl_ast_expr_copy(expr
);
5740 expr
= isl_ast_expr_neg(expr
);
5741 expr2
= isl_ast_expr_neg(expr2
);
5742 equal
= isl_ast_expr_is_equal(expr
, expr2
);
5743 str
= isl_ast_expr_to_C_str(expr
);
5744 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
5746 isl_ast_expr_free(expr
);
5747 isl_ast_expr_free(expr2
);
5749 if (ok
< 0 || equal
< 0)
5752 isl_die(ctx
, isl_error_unknown
,
5753 "equal expressions not considered equal", return -1);
5755 isl_die(ctx
, isl_error_unknown
,
5756 "isl_ast_expr printed incorrectly", return -1);
5758 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
5759 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
5760 expr
= isl_ast_expr_add(expr1
, expr2
);
5761 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
5762 expr
= isl_ast_expr_sub(expr3
, expr
);
5763 str
= isl_ast_expr_to_C_str(expr
);
5764 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
5766 isl_ast_expr_free(expr
);
5771 isl_die(ctx
, isl_error_unknown
,
5772 "isl_ast_expr printed incorrectly", return -1);
5777 /* Check that isl_ast_build_expr_from_set returns a valid expression
5778 * for an empty set. Note that isl_ast_build_expr_from_set getting
5779 * called on an empty set probably indicates a bug in the caller.
5781 static int test_ast_build(isl_ctx
*ctx
)
5784 isl_ast_build
*build
;
5787 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5788 build
= isl_ast_build_from_context(set
);
5790 set
= isl_set_empty(isl_space_params_alloc(ctx
, 0));
5791 expr
= isl_ast_build_expr_from_set(build
, set
);
5793 isl_ast_expr_free(expr
);
5794 isl_ast_build_free(build
);
5802 /* Internal data structure for before_for and after_for callbacks.
5804 * depth is the current depth
5805 * before is the number of times before_for has been called
5806 * after is the number of times after_for has been called
5808 struct isl_test_codegen_data
{
5814 /* This function is called before each for loop in the AST generated
5815 * from test_ast_gen1.
5817 * Increment the number of calls and the depth.
5818 * Check that the space returned by isl_ast_build_get_schedule_space
5819 * matches the target space of the schedule returned by
5820 * isl_ast_build_get_schedule.
5821 * Return an isl_id that is checked by the corresponding call
5824 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
5827 struct isl_test_codegen_data
*data
= user
;
5830 isl_union_map
*schedule
;
5831 isl_union_set
*uset
;
5836 ctx
= isl_ast_build_get_ctx(build
);
5838 if (data
->before
>= 3)
5839 isl_die(ctx
, isl_error_unknown
,
5840 "unexpected number of for nodes", return NULL
);
5841 if (data
->depth
>= 2)
5842 isl_die(ctx
, isl_error_unknown
,
5843 "unexpected depth", return NULL
);
5845 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
5849 schedule
= isl_ast_build_get_schedule(build
);
5850 uset
= isl_union_map_range(schedule
);
5853 if (isl_union_set_n_set(uset
) != 1) {
5854 isl_union_set_free(uset
);
5855 isl_die(ctx
, isl_error_unknown
,
5856 "expecting single range space", return NULL
);
5859 space
= isl_ast_build_get_schedule_space(build
);
5860 set
= isl_union_set_extract_set(uset
, space
);
5861 isl_union_set_free(uset
);
5862 empty
= isl_set_is_empty(set
);
5868 isl_die(ctx
, isl_error_unknown
,
5869 "spaces don't match", return NULL
);
5871 return isl_id_alloc(ctx
, name
, NULL
);
5874 /* This function is called after each for loop in the AST generated
5875 * from test_ast_gen1.
5877 * Increment the number of calls and decrement the depth.
5878 * Check that the annotation attached to the node matches
5879 * the isl_id returned by the corresponding call to before_for.
5881 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
5882 __isl_keep isl_ast_build
*build
, void *user
)
5884 struct isl_test_codegen_data
*data
= user
;
5892 if (data
->after
> data
->before
)
5893 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5894 "mismatch in number of for nodes",
5895 return isl_ast_node_free(node
));
5897 id
= isl_ast_node_get_annotation(node
);
5899 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5900 "missing annotation", return isl_ast_node_free(node
));
5902 name
= isl_id_get_name(id
);
5903 valid
= name
&& atoi(name
+ 1) == data
->depth
;
5907 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5908 "wrong annotation", return isl_ast_node_free(node
));
5913 /* Check that the before_each_for and after_each_for callbacks
5914 * are called for each for loop in the generated code,
5915 * that they are called in the right order and that the isl_id
5916 * returned from the before_each_for callback is attached to
5917 * the isl_ast_node passed to the corresponding after_each_for call.
5919 static int test_ast_gen1(isl_ctx
*ctx
)
5923 isl_union_map
*schedule
;
5924 isl_ast_build
*build
;
5926 struct isl_test_codegen_data data
;
5928 str
= "[N] -> { : N >= 10 }";
5929 set
= isl_set_read_from_str(ctx
, str
);
5930 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
5931 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
5932 schedule
= isl_union_map_read_from_str(ctx
, str
);
5937 build
= isl_ast_build_from_context(set
);
5938 build
= isl_ast_build_set_before_each_for(build
,
5939 &before_for
, &data
);
5940 build
= isl_ast_build_set_after_each_for(build
,
5942 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5943 isl_ast_build_free(build
);
5947 isl_ast_node_free(tree
);
5949 if (data
.before
!= 3 || data
.after
!= 3)
5950 isl_die(ctx
, isl_error_unknown
,
5951 "unexpected number of for nodes", return -1);
5956 /* Check that the AST generator handles domains that are integrally disjoint
5957 * but not rationally disjoint.
5959 static int test_ast_gen2(isl_ctx
*ctx
)
5963 isl_union_map
*schedule
;
5964 isl_union_map
*options
;
5965 isl_ast_build
*build
;
5968 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
5969 schedule
= isl_union_map_read_from_str(ctx
, str
);
5970 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5971 build
= isl_ast_build_from_context(set
);
5973 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
5974 options
= isl_union_map_read_from_str(ctx
, str
);
5975 build
= isl_ast_build_set_options(build
, options
);
5976 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5977 isl_ast_build_free(build
);
5980 isl_ast_node_free(tree
);
5985 /* Increment *user on each call.
5987 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
5988 __isl_keep isl_ast_build
*build
, void *user
)
5997 /* Test that unrolling tries to minimize the number of instances.
5998 * In particular, for the schedule given below, make sure it generates
5999 * 3 nodes (rather than 101).
6001 static int test_ast_gen3(isl_ctx
*ctx
)
6005 isl_union_map
*schedule
;
6006 isl_union_map
*options
;
6007 isl_ast_build
*build
;
6011 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
6012 schedule
= isl_union_map_read_from_str(ctx
, str
);
6013 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
6015 str
= "{ [i] -> unroll[0] }";
6016 options
= isl_union_map_read_from_str(ctx
, str
);
6018 build
= isl_ast_build_from_context(set
);
6019 build
= isl_ast_build_set_options(build
, options
);
6020 build
= isl_ast_build_set_at_each_domain(build
,
6021 &count_domains
, &n_domain
);
6022 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
6023 isl_ast_build_free(build
);
6027 isl_ast_node_free(tree
);
6030 isl_die(ctx
, isl_error_unknown
,
6031 "unexpected number of for nodes", return -1);
6036 /* Check that if the ast_build_exploit_nested_bounds options is set,
6037 * we do not get an outer if node in the generated AST,
6038 * while we do get such an outer if node if the options is not set.
6040 static int test_ast_gen4(isl_ctx
*ctx
)
6044 isl_union_map
*schedule
;
6045 isl_ast_build
*build
;
6047 enum isl_ast_node_type type
;
6050 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
6051 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
6053 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
6055 schedule
= isl_union_map_read_from_str(ctx
, str
);
6056 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
6057 build
= isl_ast_build_from_context(set
);
6058 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
6059 isl_ast_build_free(build
);
6063 type
= isl_ast_node_get_type(tree
);
6064 isl_ast_node_free(tree
);
6066 if (type
== isl_ast_node_if
)
6067 isl_die(ctx
, isl_error_unknown
,
6068 "not expecting if node", return -1);
6070 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
6072 schedule
= isl_union_map_read_from_str(ctx
, str
);
6073 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
6074 build
= isl_ast_build_from_context(set
);
6075 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
6076 isl_ast_build_free(build
);
6080 type
= isl_ast_node_get_type(tree
);
6081 isl_ast_node_free(tree
);
6083 if (type
!= isl_ast_node_if
)
6084 isl_die(ctx
, isl_error_unknown
,
6085 "expecting if node", return -1);
6087 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
6092 /* This function is called for each leaf in the AST generated
6093 * from test_ast_gen5.
6095 * We finalize the AST generation by extending the outer schedule
6096 * with a zero-dimensional schedule. If this results in any for loops,
6097 * then this means that we did not pass along enough information
6098 * about the outer schedule to the inner AST generation.
6100 static __isl_give isl_ast_node
*create_leaf(__isl_take isl_ast_build
*build
,
6103 isl_union_map
*schedule
, *extra
;
6106 schedule
= isl_ast_build_get_schedule(build
);
6107 extra
= isl_union_map_copy(schedule
);
6108 extra
= isl_union_map_from_domain(isl_union_map_domain(extra
));
6109 schedule
= isl_union_map_range_product(schedule
, extra
);
6110 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
6111 isl_ast_build_free(build
);
6116 if (isl_ast_node_get_type(tree
) == isl_ast_node_for
)
6117 isl_die(isl_ast_node_get_ctx(tree
), isl_error_unknown
,
6118 "code should not contain any for loop",
6119 return isl_ast_node_free(tree
));
6124 /* Check that we do not lose any information when going back and
6125 * forth between internal and external schedule.
6127 * In particular, we create an AST where we unroll the only
6128 * non-constant dimension in the schedule. We therefore do
6129 * not expect any for loops in the AST. However, older versions
6130 * of isl would not pass along enough information about the outer
6131 * schedule when performing an inner code generation from a create_leaf
6132 * callback, resulting in the inner code generation producing a for loop.
6134 static int test_ast_gen5(isl_ctx
*ctx
)
6138 isl_union_map
*schedule
, *options
;
6139 isl_ast_build
*build
;
6142 str
= "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
6143 schedule
= isl_union_map_read_from_str(ctx
, str
);
6145 str
= "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
6146 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
6147 options
= isl_union_map_read_from_str(ctx
, str
);
6149 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
6150 build
= isl_ast_build_from_context(set
);
6151 build
= isl_ast_build_set_options(build
, options
);
6152 build
= isl_ast_build_set_create_leaf(build
, &create_leaf
, NULL
);
6153 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
6154 isl_ast_build_free(build
);
6155 isl_ast_node_free(tree
);
6162 /* Check that the expression
6164 * [n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }
6166 * is not combined into
6170 * as this would result in n/2 being evaluated in parts of
6171 * the definition domain where n is not a multiple of 2.
6173 static int test_ast_expr(isl_ctx
*ctx
)
6177 isl_ast_build
*build
;
6182 min_max
= isl_options_get_ast_build_detect_min_max(ctx
);
6183 isl_options_set_ast_build_detect_min_max(ctx
, 1);
6185 str
= "[n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }";
6186 pa
= isl_pw_aff_read_from_str(ctx
, str
);
6187 build
= isl_ast_build_alloc(ctx
);
6188 expr
= isl_ast_build_expr_from_pw_aff(build
, pa
);
6189 is_min
= isl_ast_expr_get_type(expr
) == isl_ast_expr_op
&&
6190 isl_ast_expr_get_op_type(expr
) == isl_ast_op_min
;
6191 isl_ast_build_free(build
);
6192 isl_ast_expr_free(expr
);
6194 isl_options_set_ast_build_detect_min_max(ctx
, min_max
);
6199 isl_die(ctx
, isl_error_unknown
,
6200 "expressions should not be combined", return -1);
6205 static int test_ast_gen(isl_ctx
*ctx
)
6207 if (test_ast_gen1(ctx
) < 0)
6209 if (test_ast_gen2(ctx
) < 0)
6211 if (test_ast_gen3(ctx
) < 0)
6213 if (test_ast_gen4(ctx
) < 0)
6215 if (test_ast_gen5(ctx
) < 0)
6217 if (test_ast_expr(ctx
) < 0)
6222 /* Check if dropping output dimensions from an isl_pw_multi_aff
6225 static int test_pw_multi_aff(isl_ctx
*ctx
)
6228 isl_pw_multi_aff
*pma1
, *pma2
;
6231 str
= "{ [i,j] -> [i+j, 4i-j] }";
6232 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
6233 str
= "{ [i,j] -> [4i-j] }";
6234 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
6236 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
6238 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
6240 isl_pw_multi_aff_free(pma1
);
6241 isl_pw_multi_aff_free(pma2
);
6245 isl_die(ctx
, isl_error_unknown
,
6246 "expressions not equal", return -1);
6251 /* Check that we can properly parse multi piecewise affine expressions
6252 * where the piecewise affine expressions have different domains.
6254 static int test_multi_pw_aff(isl_ctx
*ctx
)
6257 isl_set
*dom
, *dom2
;
6258 isl_multi_pw_aff
*mpa1
, *mpa2
;
6263 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [i] }");
6264 dom
= isl_set_read_from_str(ctx
, "{ [i] : i > 0 }");
6265 mpa1
= isl_multi_pw_aff_intersect_domain(mpa1
, dom
);
6266 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [2i] }");
6267 mpa2
= isl_multi_pw_aff_flat_range_product(mpa1
, mpa2
);
6268 str
= "{ [i] -> [(i : i > 0), 2i] }";
6269 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, str
);
6271 equal
= isl_multi_pw_aff_plain_is_equal(mpa1
, mpa2
);
6273 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 0);
6274 dom
= isl_pw_aff_domain(pa
);
6275 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 1);
6276 dom2
= isl_pw_aff_domain(pa
);
6277 equal_domain
= isl_set_is_equal(dom
, dom2
);
6281 isl_multi_pw_aff_free(mpa1
);
6282 isl_multi_pw_aff_free(mpa2
);
6287 isl_die(ctx
, isl_error_unknown
,
6288 "expressions not equal", return -1);
6290 if (equal_domain
< 0)
6293 isl_die(ctx
, isl_error_unknown
,
6294 "domains unexpectedly equal", return -1);
6299 /* This is a regression test for a bug where isl_basic_map_simplify
6300 * would end up in an infinite loop. In particular, we construct
6301 * an empty basic set that is not obviously empty.
6302 * isl_basic_set_is_empty marks the basic set as empty.
6303 * After projecting out i3, the variable can be dropped completely,
6304 * but isl_basic_map_simplify refrains from doing so if the basic set
6305 * is empty and would end up in an infinite loop if it didn't test
6306 * explicitly for empty basic maps in the outer loop.
6308 static int test_simplify_1(isl_ctx
*ctx
)
6311 isl_basic_set
*bset
;
6314 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
6315 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
6316 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
6318 bset
= isl_basic_set_read_from_str(ctx
, str
);
6319 empty
= isl_basic_set_is_empty(bset
);
6320 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
6321 isl_basic_set_free(bset
);
6325 isl_die(ctx
, isl_error_unknown
,
6326 "basic set should be empty", return -1);
6331 /* Check that the equality in the set description below
6332 * is simplified away.
6334 static int test_simplify_2(isl_ctx
*ctx
)
6337 isl_basic_set
*bset
;
6340 str
= "{ [a] : exists e0, e1: 32e1 = 31 + 31a + 31e0 }";
6341 bset
= isl_basic_set_read_from_str(ctx
, str
);
6342 universe
= isl_basic_set_plain_is_universe(bset
);
6343 isl_basic_set_free(bset
);
6348 isl_die(ctx
, isl_error_unknown
,
6349 "equality not simplified away", return -1);
6353 /* Some simplification tests.
6355 static int test_simplify(isl_ctx
*ctx
)
6357 if (test_simplify_1(ctx
) < 0)
6359 if (test_simplify_2(ctx
) < 0)
6364 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
6365 * with gbr context would fail to disable the use of the shifted tableau
6366 * when transferring equalities for the input to the context, resulting
6367 * in invalid sample values.
6369 static int test_partial_lexmin(isl_ctx
*ctx
)
6372 isl_basic_set
*bset
;
6373 isl_basic_map
*bmap
;
6376 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
6377 bmap
= isl_basic_map_read_from_str(ctx
, str
);
6378 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
6379 bset
= isl_basic_set_read_from_str(ctx
, str
);
6380 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
6389 /* Check that the variable compression performed on the existentially
6390 * quantified variables inside isl_basic_set_compute_divs is not confused
6391 * by the implicit equalities among the parameters.
6393 static int test_compute_divs(isl_ctx
*ctx
)
6396 isl_basic_set
*bset
;
6399 str
= "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
6400 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
6401 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
6402 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
6403 bset
= isl_basic_set_read_from_str(ctx
, str
);
6404 set
= isl_basic_set_compute_divs(bset
);
6412 /* Check that the reaching domain elements and the prefix schedule
6413 * at a leaf node are the same before and after grouping.
6415 static int test_schedule_tree_group_1(isl_ctx
*ctx
)
6420 isl_union_set
*uset
;
6421 isl_multi_union_pw_aff
*mupa
;
6422 isl_union_pw_multi_aff
*upma1
, *upma2
;
6423 isl_union_set
*domain1
, *domain2
;
6424 isl_union_map
*umap1
, *umap2
;
6425 isl_schedule_node
*node
;
6427 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
6428 uset
= isl_union_set_read_from_str(ctx
, str
);
6429 node
= isl_schedule_node_from_domain(uset
);
6430 node
= isl_schedule_node_child(node
, 0);
6431 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]";
6432 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6433 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6434 node
= isl_schedule_node_child(node
, 0);
6435 str
= "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]";
6436 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6437 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6438 node
= isl_schedule_node_child(node
, 0);
6439 umap1
= isl_schedule_node_get_prefix_schedule_union_map(node
);
6440 upma1
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
6441 domain1
= isl_schedule_node_get_domain(node
);
6442 id
= isl_id_alloc(ctx
, "group", NULL
);
6443 node
= isl_schedule_node_parent(node
);
6444 node
= isl_schedule_node_group(node
, id
);
6445 node
= isl_schedule_node_child(node
, 0);
6446 umap2
= isl_schedule_node_get_prefix_schedule_union_map(node
);
6447 upma2
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
6448 domain2
= isl_schedule_node_get_domain(node
);
6449 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
6450 if (equal
>= 0 && equal
)
6451 equal
= isl_union_set_is_equal(domain1
, domain2
);
6452 if (equal
>= 0 && equal
)
6453 equal
= isl_union_map_is_equal(umap1
, umap2
);
6454 isl_union_map_free(umap1
);
6455 isl_union_map_free(umap2
);
6456 isl_union_set_free(domain1
);
6457 isl_union_set_free(domain2
);
6458 isl_union_pw_multi_aff_free(upma1
);
6459 isl_union_pw_multi_aff_free(upma2
);
6460 isl_schedule_node_free(node
);
6465 isl_die(ctx
, isl_error_unknown
,
6466 "expressions not equal", return -1);
6471 /* Check that we can have nested groupings and that the union map
6472 * schedule representation is the same before and after the grouping.
6473 * Note that after the grouping, the union map representation contains
6474 * the domain constraints from the ranges of the expansion nodes,
6475 * while they are missing from the union map representation of
6476 * the tree without expansion nodes.
6478 * Also check that the global expansion is as expected.
6480 static int test_schedule_tree_group_2(isl_ctx
*ctx
)
6482 int equal
, equal_expansion
;
6485 isl_union_set
*uset
;
6486 isl_union_map
*umap1
, *umap2
;
6487 isl_union_map
*expansion1
, *expansion2
;
6488 isl_union_set_list
*filters
;
6489 isl_multi_union_pw_aff
*mupa
;
6490 isl_schedule
*schedule
;
6491 isl_schedule_node
*node
;
6493 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; "
6494 "S3[i,j] : 0 <= i,j < 10 }";
6495 uset
= isl_union_set_read_from_str(ctx
, str
);
6496 node
= isl_schedule_node_from_domain(uset
);
6497 node
= isl_schedule_node_child(node
, 0);
6498 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]";
6499 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6500 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6501 node
= isl_schedule_node_child(node
, 0);
6502 str
= "{ S1[i,j] }";
6503 uset
= isl_union_set_read_from_str(ctx
, str
);
6504 filters
= isl_union_set_list_from_union_set(uset
);
6505 str
= "{ S2[i,j]; S3[i,j] }";
6506 uset
= isl_union_set_read_from_str(ctx
, str
);
6507 filters
= isl_union_set_list_add(filters
, uset
);
6508 node
= isl_schedule_node_insert_sequence(node
, filters
);
6509 node
= isl_schedule_node_child(node
, 1);
6510 node
= isl_schedule_node_child(node
, 0);
6511 str
= "{ S2[i,j] }";
6512 uset
= isl_union_set_read_from_str(ctx
, str
);
6513 filters
= isl_union_set_list_from_union_set(uset
);
6514 str
= "{ S3[i,j] }";
6515 uset
= isl_union_set_read_from_str(ctx
, str
);
6516 filters
= isl_union_set_list_add(filters
, uset
);
6517 node
= isl_schedule_node_insert_sequence(node
, filters
);
6519 schedule
= isl_schedule_node_get_schedule(node
);
6520 umap1
= isl_schedule_get_map(schedule
);
6521 uset
= isl_schedule_get_domain(schedule
);
6522 umap1
= isl_union_map_intersect_domain(umap1
, uset
);
6523 isl_schedule_free(schedule
);
6525 node
= isl_schedule_node_parent(node
);
6526 node
= isl_schedule_node_parent(node
);
6527 id
= isl_id_alloc(ctx
, "group1", NULL
);
6528 node
= isl_schedule_node_group(node
, id
);
6529 node
= isl_schedule_node_child(node
, 1);
6530 node
= isl_schedule_node_child(node
, 0);
6531 id
= isl_id_alloc(ctx
, "group2", NULL
);
6532 node
= isl_schedule_node_group(node
, id
);
6534 schedule
= isl_schedule_node_get_schedule(node
);
6535 umap2
= isl_schedule_get_map(schedule
);
6536 isl_schedule_free(schedule
);
6538 node
= isl_schedule_node_root(node
);
6539 node
= isl_schedule_node_child(node
, 0);
6540 expansion1
= isl_schedule_node_get_subtree_expansion(node
);
6541 isl_schedule_node_free(node
);
6543 str
= "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; "
6544 "group1[i] -> S2[i,j] : 0 <= i,j < 10; "
6545 "group1[i] -> S3[i,j] : 0 <= i,j < 10 }";
6547 expansion2
= isl_union_map_read_from_str(ctx
, str
);
6549 equal
= isl_union_map_is_equal(umap1
, umap2
);
6550 equal_expansion
= isl_union_map_is_equal(expansion1
, expansion2
);
6552 isl_union_map_free(umap1
);
6553 isl_union_map_free(umap2
);
6554 isl_union_map_free(expansion1
);
6555 isl_union_map_free(expansion2
);
6557 if (equal
< 0 || equal_expansion
< 0)
6560 isl_die(ctx
, isl_error_unknown
,
6561 "expressions not equal", return -1);
6562 if (!equal_expansion
)
6563 isl_die(ctx
, isl_error_unknown
,
6564 "unexpected expansion", return -1);
6569 /* Some tests for the isl_schedule_node_group function.
6571 static int test_schedule_tree_group(isl_ctx
*ctx
)
6573 if (test_schedule_tree_group_1(ctx
) < 0)
6575 if (test_schedule_tree_group_2(ctx
) < 0)
6584 { "{ rat: [i] : 0 <= i <= 10 }",
6585 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
6586 { "{ rat: [i] : FALSE }",
6587 "{ rat: coefficients[[cst] -> [a]] }" },
6589 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
6596 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
6597 "{ rat: [i] : 0 <= i <= 10 }" },
6598 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
6600 { "{ rat: coefficients[[cst] -> [a]] }",
6601 "{ rat: [i] : FALSE }" },
6604 /* Test the basic functionality of isl_basic_set_coefficients and
6605 * isl_basic_set_solutions.
6607 static int test_dual(isl_ctx
*ctx
)
6611 for (i
= 0; i
< ARRAY_SIZE(coef_tests
); ++i
) {
6613 isl_basic_set
*bset1
, *bset2
;
6615 bset1
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].set
);
6616 bset2
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].dual
);
6617 bset1
= isl_basic_set_coefficients(bset1
);
6618 equal
= isl_basic_set_is_equal(bset1
, bset2
);
6619 isl_basic_set_free(bset1
);
6620 isl_basic_set_free(bset2
);
6624 isl_die(ctx
, isl_error_unknown
,
6625 "incorrect dual", return -1);
6628 for (i
= 0; i
< ARRAY_SIZE(sol_tests
); ++i
) {
6630 isl_basic_set
*bset1
, *bset2
;
6632 bset1
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].set
);
6633 bset2
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].dual
);
6634 bset1
= isl_basic_set_solutions(bset1
);
6635 equal
= isl_basic_set_is_equal(bset1
, bset2
);
6636 isl_basic_set_free(bset1
);
6637 isl_basic_set_free(bset2
);
6641 isl_die(ctx
, isl_error_unknown
,
6642 "incorrect dual", return -1);
6652 const char *schedule
;
6657 { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6658 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6660 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6661 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6663 { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6664 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6666 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6667 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6669 { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6670 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6672 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6673 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6675 { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6676 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6678 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6679 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6683 /* Basic tiling tests. Create a schedule tree with a domain and a band node,
6684 * tile the band and then check if the tile and point bands have the
6685 * expected partial schedule.
6687 static int test_tile(isl_ctx
*ctx
)
6693 scale
= isl_options_get_tile_scale_tile_loops(ctx
);
6694 shift
= isl_options_get_tile_shift_point_loops(ctx
);
6696 for (i
= 0; i
< ARRAY_SIZE(tile_tests
); ++i
) {
6700 isl_union_set
*domain
;
6701 isl_multi_union_pw_aff
*mupa
, *mupa2
;
6702 isl_schedule_node
*node
;
6703 isl_multi_val
*sizes
;
6705 opt
= tile_tests
[i
].scale_tile
;
6706 isl_options_set_tile_scale_tile_loops(ctx
, opt
);
6707 opt
= tile_tests
[i
].shift_point
;
6708 isl_options_set_tile_shift_point_loops(ctx
, opt
);
6710 str
= tile_tests
[i
].domain
;
6711 domain
= isl_union_set_read_from_str(ctx
, str
);
6712 node
= isl_schedule_node_from_domain(domain
);
6713 node
= isl_schedule_node_child(node
, 0);
6714 str
= tile_tests
[i
].schedule
;
6715 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6716 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6717 str
= tile_tests
[i
].sizes
;
6718 sizes
= isl_multi_val_read_from_str(ctx
, str
);
6719 node
= isl_schedule_node_band_tile(node
, sizes
);
6721 str
= tile_tests
[i
].tile
;
6722 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6723 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
6724 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
, mupa2
);
6725 isl_multi_union_pw_aff_free(mupa
);
6726 isl_multi_union_pw_aff_free(mupa2
);
6728 node
= isl_schedule_node_child(node
, 0);
6730 str
= tile_tests
[i
].point
;
6731 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6732 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
6733 if (equal
>= 0 && equal
)
6734 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
,
6736 isl_multi_union_pw_aff_free(mupa
);
6737 isl_multi_union_pw_aff_free(mupa2
);
6739 isl_schedule_node_free(node
);
6744 isl_die(ctx
, isl_error_unknown
,
6745 "unexpected result", return -1);
6748 isl_options_set_tile_scale_tile_loops(ctx
, scale
);
6749 isl_options_set_tile_shift_point_loops(ctx
, shift
);
6754 /* Check that the domain hash of a space is equal to the hash
6755 * of the domain of the space.
6757 static int test_domain_hash(isl_ctx
*ctx
)
6761 uint32_t hash1
, hash2
;
6763 map
= isl_map_read_from_str(ctx
, "[n] -> { A[B[x] -> C[]] -> D[] }");
6764 space
= isl_map_get_space(map
);
6766 hash1
= isl_space_get_domain_hash(space
);
6767 space
= isl_space_domain(space
);
6768 hash2
= isl_space_get_hash(space
);
6769 isl_space_free(space
);
6774 isl_die(ctx
, isl_error_unknown
,
6775 "domain hash not equal to hash of domain", return -1);
6780 /* Check that a universe basic set that is not obviously equal to the universe
6781 * is still recognized as being equal to the universe.
6783 static int test_universe(isl_ctx
*ctx
)
6786 isl_basic_set
*bset
;
6789 s
= "{ [] : exists x, y : 3y <= 2x and y >= -3 + 2x and 2y >= 2 - x }";
6790 bset
= isl_basic_set_read_from_str(ctx
, s
);
6791 is_univ
= isl_basic_set_is_universe(bset
);
6792 isl_basic_set_free(bset
);
6797 isl_die(ctx
, isl_error_unknown
,
6798 "not recognized as universe set", return -1);
6803 /* Sets for which chambers are computed and checked.
6805 const char *chambers_tests
[] = {
6806 "[A, B, C] -> { [x, y, z] : x >= 0 and y >= 0 and y <= A - x and "
6807 "z >= 0 and z <= C - y and z <= B - x - y }",
6810 /* Add the domain of "cell" to "cells".
6812 static int add_cell(__isl_take isl_cell
*cell
, void *user
)
6814 isl_basic_set_list
**cells
= user
;
6817 dom
= isl_cell_get_domain(cell
);
6818 isl_cell_free(cell
);
6819 *cells
= isl_basic_set_list_add(*cells
, dom
);
6821 return *cells
? 0 : -1;
6824 /* Check that the elements of "list" are pairwise disjoint.
6826 static isl_stat
check_pairwise_disjoint(__isl_keep isl_basic_set_list
*list
)
6831 return isl_stat_error
;
6833 n
= isl_basic_set_list_n_basic_set(list
);
6834 for (i
= 0; i
< n
; ++i
) {
6835 isl_basic_set
*bset_i
;
6837 bset_i
= isl_basic_set_list_get_basic_set(list
, i
);
6838 for (j
= i
+ 1; j
< n
; ++j
) {
6839 isl_basic_set
*bset_j
;
6842 bset_j
= isl_basic_set_list_get_basic_set(list
, j
);
6843 disjoint
= isl_basic_set_is_disjoint(bset_i
, bset_j
);
6844 isl_basic_set_free(bset_j
);
6846 isl_die(isl_basic_set_list_get_ctx(list
),
6847 isl_error_unknown
, "not disjoint",
6849 if (disjoint
< 0 || !disjoint
)
6852 isl_basic_set_free(bset_i
);
6854 return isl_stat_error
;
6860 /* Check that the chambers computed by isl_vertices_foreach_disjoint_cell
6861 * are pairwise disjoint.
6863 static int test_chambers(isl_ctx
*ctx
)
6867 for (i
= 0; i
< ARRAY_SIZE(chambers_tests
); ++i
) {
6868 isl_basic_set
*bset
;
6869 isl_vertices
*vertices
;
6870 isl_basic_set_list
*cells
;
6873 bset
= isl_basic_set_read_from_str(ctx
, chambers_tests
[i
]);
6874 vertices
= isl_basic_set_compute_vertices(bset
);
6875 cells
= isl_basic_set_list_alloc(ctx
, 0);
6876 if (isl_vertices_foreach_disjoint_cell(vertices
, &add_cell
,
6878 cells
= isl_basic_set_list_free(cells
);
6879 ok
= check_pairwise_disjoint(cells
);
6880 isl_basic_set_list_free(cells
);
6881 isl_vertices_free(vertices
);
6882 isl_basic_set_free(bset
);
6893 int (*fn
)(isl_ctx
*ctx
);
6895 { "universe", &test_universe
},
6896 { "domain hash", &test_domain_hash
},
6897 { "dual", &test_dual
},
6898 { "dependence analysis", &test_flow
},
6899 { "val", &test_val
},
6900 { "compute divs", &test_compute_divs
},
6901 { "partial lexmin", &test_partial_lexmin
},
6902 { "simplify", &test_simplify
},
6903 { "curry", &test_curry
},
6904 { "piecewise multi affine expressions", &test_pw_multi_aff
},
6905 { "multi piecewise affine expressions", &test_multi_pw_aff
},
6906 { "conversion", &test_conversion
},
6907 { "list", &test_list
},
6908 { "align parameters", &test_align_parameters
},
6909 { "preimage", &test_preimage
},
6910 { "pullback", &test_pullback
},
6911 { "AST", &test_ast
},
6912 { "AST build", &test_ast_build
},
6913 { "AST generation", &test_ast_gen
},
6914 { "eliminate", &test_eliminate
},
6915 { "residue class", &test_residue_class
},
6916 { "div", &test_div
},
6917 { "slice", &test_slice
},
6918 { "fixed power", &test_fixed_power
},
6919 { "sample", &test_sample
},
6920 { "output", &test_output
},
6921 { "vertices", &test_vertices
},
6922 { "chambers", &test_chambers
},
6923 { "fixed", &test_fixed
},
6924 { "equal", &test_equal
},
6925 { "disjoint", &test_disjoint
},
6926 { "product", &test_product
},
6927 { "dim_max", &test_dim_max
},
6928 { "affine", &test_aff
},
6929 { "injective", &test_injective
},
6930 { "schedule (whole component)", &test_schedule_whole
},
6931 { "schedule (incremental)", &test_schedule_incremental
},
6932 { "schedule tree grouping", &test_schedule_tree_group
},
6933 { "tile", &test_tile
},
6934 { "union_pw", &test_union_pw
},
6935 { "eval", &test_eval
},
6936 { "parse", &test_parse
},
6937 { "single-valued", &test_sv
},
6938 { "affine hull", &test_affine_hull
},
6939 { "simple_hull", &test_simple_hull
},
6940 { "coalesce", &test_coalesce
},
6941 { "factorize", &test_factorize
},
6942 { "subset", &test_subset
},
6943 { "subtract", &test_subtract
},
6944 { "intersect", &test_intersect
},
6945 { "lexmin", &test_lexmin
},
6946 { "min", &test_min
},
6947 { "gist", &test_gist
},
6948 { "piecewise quasi-polynomials", &test_pwqp
},
6949 { "lift", &test_lift
},
6950 { "bound", &test_bound
},
6951 { "union", &test_union
},
6952 { "split periods", &test_split_periods
},
6953 { "lexicographic order", &test_lex
},
6954 { "bijectivity", &test_bijective
},
6955 { "dataflow analysis", &test_dep
},
6956 { "reading", &test_read
},
6957 { "bounded", &test_bounded
},
6958 { "construction", &test_construction
},
6959 { "dimension manipulation", &test_dim
},
6960 { "map application", &test_application
},
6961 { "convex hull", &test_convex_hull
},
6962 { "transitive closure", &test_closure
},
6965 int main(int argc
, char **argv
)
6968 struct isl_ctx
*ctx
;
6969 struct isl_options
*options
;
6971 options
= isl_options_new_with_defaults();
6973 argc
= isl_options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
6975 ctx
= isl_ctx_alloc_with_options(&isl_options_args
, options
);
6976 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
6977 printf("%s\n", tests
[i
].name
);
6978 if (tests
[i
].fn(ctx
) < 0)