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.h>
36 #include <isl/ast_build.h>
39 #include <isl_ast_build_expr.h>
40 #include <isl/options.h>
42 #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 static int test_div(isl_ctx
*ctx
)
645 struct isl_basic_set
*bset
;
646 struct isl_constraint
*c
;
651 dim
= isl_space_set_alloc(ctx
, 0, 3);
652 bset
= isl_basic_set_universe(isl_space_copy(dim
));
653 ls
= isl_local_space_from_space(dim
);
655 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
656 isl_int_set_si(v
, -1);
657 isl_constraint_set_constant(c
, v
);
658 isl_int_set_si(v
, 1);
659 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
660 isl_int_set_si(v
, 3);
661 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
662 bset
= isl_basic_set_add_constraint(bset
, c
);
664 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
665 isl_int_set_si(v
, 1);
666 isl_constraint_set_constant(c
, v
);
667 isl_int_set_si(v
, -1);
668 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
669 isl_int_set_si(v
, 3);
670 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
671 bset
= isl_basic_set_add_constraint(bset
, c
);
673 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
675 assert(bset
&& bset
->n_div
== 1);
676 isl_local_space_free(ls
);
677 isl_basic_set_free(bset
);
680 dim
= isl_space_set_alloc(ctx
, 0, 3);
681 bset
= isl_basic_set_universe(isl_space_copy(dim
));
682 ls
= isl_local_space_from_space(dim
);
684 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
685 isl_int_set_si(v
, 1);
686 isl_constraint_set_constant(c
, v
);
687 isl_int_set_si(v
, -1);
688 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
689 isl_int_set_si(v
, 3);
690 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
691 bset
= isl_basic_set_add_constraint(bset
, c
);
693 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
694 isl_int_set_si(v
, -1);
695 isl_constraint_set_constant(c
, v
);
696 isl_int_set_si(v
, 1);
697 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
698 isl_int_set_si(v
, 3);
699 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
700 bset
= isl_basic_set_add_constraint(bset
, c
);
702 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
704 assert(bset
&& bset
->n_div
== 1);
705 isl_local_space_free(ls
);
706 isl_basic_set_free(bset
);
709 dim
= isl_space_set_alloc(ctx
, 0, 3);
710 bset
= isl_basic_set_universe(isl_space_copy(dim
));
711 ls
= isl_local_space_from_space(dim
);
713 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
714 isl_int_set_si(v
, 1);
715 isl_constraint_set_constant(c
, v
);
716 isl_int_set_si(v
, -1);
717 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
718 isl_int_set_si(v
, 3);
719 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
720 bset
= isl_basic_set_add_constraint(bset
, c
);
722 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
723 isl_int_set_si(v
, -3);
724 isl_constraint_set_constant(c
, v
);
725 isl_int_set_si(v
, 1);
726 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
727 isl_int_set_si(v
, 4);
728 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
729 bset
= isl_basic_set_add_constraint(bset
, c
);
731 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
733 assert(bset
&& bset
->n_div
== 1);
734 isl_local_space_free(ls
);
735 isl_basic_set_free(bset
);
738 dim
= isl_space_set_alloc(ctx
, 0, 3);
739 bset
= isl_basic_set_universe(isl_space_copy(dim
));
740 ls
= isl_local_space_from_space(dim
);
742 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
743 isl_int_set_si(v
, 2);
744 isl_constraint_set_constant(c
, v
);
745 isl_int_set_si(v
, -1);
746 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
747 isl_int_set_si(v
, 3);
748 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
749 bset
= isl_basic_set_add_constraint(bset
, c
);
751 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
752 isl_int_set_si(v
, -1);
753 isl_constraint_set_constant(c
, v
);
754 isl_int_set_si(v
, 1);
755 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
756 isl_int_set_si(v
, 6);
757 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
758 bset
= isl_basic_set_add_constraint(bset
, c
);
760 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
762 assert(isl_basic_set_is_empty(bset
));
763 isl_local_space_free(ls
);
764 isl_basic_set_free(bset
);
767 dim
= isl_space_set_alloc(ctx
, 0, 3);
768 bset
= isl_basic_set_universe(isl_space_copy(dim
));
769 ls
= isl_local_space_from_space(dim
);
771 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
772 isl_int_set_si(v
, -1);
773 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
774 isl_int_set_si(v
, 3);
775 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
776 bset
= isl_basic_set_add_constraint(bset
, c
);
778 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
779 isl_int_set_si(v
, 1);
780 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
781 isl_int_set_si(v
, -3);
782 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
783 bset
= isl_basic_set_add_constraint(bset
, c
);
785 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
787 assert(bset
&& bset
->n_div
== 0);
788 isl_basic_set_free(bset
);
789 isl_local_space_free(ls
);
792 dim
= isl_space_set_alloc(ctx
, 0, 3);
793 bset
= isl_basic_set_universe(isl_space_copy(dim
));
794 ls
= isl_local_space_from_space(dim
);
796 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
797 isl_int_set_si(v
, -1);
798 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
799 isl_int_set_si(v
, 6);
800 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
801 bset
= isl_basic_set_add_constraint(bset
, c
);
803 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
804 isl_int_set_si(v
, 1);
805 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
806 isl_int_set_si(v
, -3);
807 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
808 bset
= isl_basic_set_add_constraint(bset
, c
);
810 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
812 assert(bset
&& bset
->n_div
== 1);
813 isl_basic_set_free(bset
);
814 isl_local_space_free(ls
);
817 /* This test is a bit tricky. We set up an equality
819 * Normalization of divs creates _two_ divs
822 * Afterwards e0 is removed again because it has coefficient -1
823 * and we end up with the original equality and div again.
824 * Perhaps we can avoid the introduction of this temporary div.
826 dim
= isl_space_set_alloc(ctx
, 0, 4);
827 bset
= isl_basic_set_universe(isl_space_copy(dim
));
828 ls
= isl_local_space_from_space(dim
);
830 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
831 isl_int_set_si(v
, -1);
832 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
833 isl_int_set_si(v
, -3);
834 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
835 isl_int_set_si(v
, -3);
836 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
837 isl_int_set_si(v
, 6);
838 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
839 bset
= isl_basic_set_add_constraint(bset
, c
);
841 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
843 /* Test disabled for now */
845 assert(bset && bset->n_div == 1);
847 isl_local_space_free(ls
);
848 isl_basic_set_free(bset
);
851 dim
= isl_space_set_alloc(ctx
, 0, 5);
852 bset
= isl_basic_set_universe(isl_space_copy(dim
));
853 ls
= isl_local_space_from_space(dim
);
855 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
856 isl_int_set_si(v
, -1);
857 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
858 isl_int_set_si(v
, -3);
859 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
860 isl_int_set_si(v
, -3);
861 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
862 isl_int_set_si(v
, 6);
863 isl_constraint_set_coefficient(c
, isl_dim_set
, 4, v
);
864 bset
= isl_basic_set_add_constraint(bset
, c
);
866 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
867 isl_int_set_si(v
, -1);
868 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
869 isl_int_set_si(v
, 1);
870 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
871 isl_int_set_si(v
, 1);
872 isl_constraint_set_constant(c
, v
);
873 bset
= isl_basic_set_add_constraint(bset
, c
);
875 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
877 /* Test disabled for now */
879 assert(bset && bset->n_div == 1);
881 isl_local_space_free(ls
);
882 isl_basic_set_free(bset
);
885 dim
= isl_space_set_alloc(ctx
, 0, 4);
886 bset
= isl_basic_set_universe(isl_space_copy(dim
));
887 ls
= isl_local_space_from_space(dim
);
889 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
890 isl_int_set_si(v
, 1);
891 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
892 isl_int_set_si(v
, -1);
893 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
894 isl_int_set_si(v
, -2);
895 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
896 bset
= isl_basic_set_add_constraint(bset
, c
);
898 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
899 isl_int_set_si(v
, -1);
900 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
901 isl_int_set_si(v
, 3);
902 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
903 isl_int_set_si(v
, 2);
904 isl_constraint_set_constant(c
, v
);
905 bset
= isl_basic_set_add_constraint(bset
, c
);
907 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
909 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
911 assert(!isl_basic_set_is_empty(bset
));
913 isl_local_space_free(ls
);
914 isl_basic_set_free(bset
);
917 dim
= isl_space_set_alloc(ctx
, 0, 3);
918 bset
= isl_basic_set_universe(isl_space_copy(dim
));
919 ls
= isl_local_space_from_space(dim
);
921 c
= isl_constraint_alloc_equality(isl_local_space_copy(ls
));
922 isl_int_set_si(v
, 1);
923 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
924 isl_int_set_si(v
, -2);
925 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
926 bset
= isl_basic_set_add_constraint(bset
, c
);
928 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
930 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
932 isl_local_space_free(ls
);
933 isl_basic_set_free(bset
);
937 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
938 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
939 set
= isl_set_read_from_str(ctx
, str
);
940 set
= isl_set_compute_divs(set
);
945 str
= "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
946 bset
= isl_basic_set_read_from_str(ctx
, str
);
947 n
= isl_basic_set_dim(bset
, isl_dim_div
);
948 isl_basic_set_free(bset
);
952 isl_die(ctx
, isl_error_unknown
,
953 "expecting no existentials", return -1);
955 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
956 set
= isl_set_read_from_str(ctx
, str
);
957 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
958 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
959 empty
= isl_set_is_empty(set
);
964 isl_die(ctx
, isl_error_unknown
,
965 "result not as accurate as expected", return -1);
970 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
974 struct isl_basic_set
*bset1
, *bset2
;
975 struct isl_basic_map
*bmap
;
977 filename
= get_filename(ctx
, name
, "omega");
979 input
= fopen(filename
, "r");
982 bset1
= isl_basic_set_read_from_file(ctx
, input
);
983 bmap
= isl_basic_map_read_from_file(ctx
, input
);
985 bset1
= isl_basic_set_apply(bset1
, bmap
);
987 bset2
= isl_basic_set_read_from_file(ctx
, input
);
989 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
991 isl_basic_set_free(bset1
);
992 isl_basic_set_free(bset2
);
998 static int test_application(isl_ctx
*ctx
)
1000 test_application_case(ctx
, "application");
1001 test_application_case(ctx
, "application2");
1006 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
1010 struct isl_basic_set
*bset1
, *bset2
;
1012 filename
= get_filename(ctx
, name
, "polylib");
1014 input
= fopen(filename
, "r");
1017 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1018 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1020 bset1
= isl_basic_set_affine_hull(bset1
);
1022 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1024 isl_basic_set_free(bset1
);
1025 isl_basic_set_free(bset2
);
1031 int test_affine_hull(struct isl_ctx
*ctx
)
1035 isl_basic_set
*bset
, *bset2
;
1039 test_affine_hull_case(ctx
, "affine2");
1040 test_affine_hull_case(ctx
, "affine");
1041 test_affine_hull_case(ctx
, "affine3");
1043 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
1044 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1045 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1046 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1047 set
= isl_set_read_from_str(ctx
, str
);
1048 bset
= isl_set_affine_hull(set
);
1049 n
= isl_basic_set_dim(bset
, isl_dim_div
);
1050 isl_basic_set_free(bset
);
1052 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
1055 /* Check that isl_map_affine_hull is not confused by
1056 * the reordering of divs in isl_map_align_divs.
1058 str
= "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1059 "32e0 = b and 32e1 = c); "
1060 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1061 set
= isl_set_read_from_str(ctx
, str
);
1062 bset
= isl_set_affine_hull(set
);
1063 isl_basic_set_free(bset
);
1067 str
= "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1068 "32e2 = 31 + 31e0 }";
1069 set
= isl_set_read_from_str(ctx
, str
);
1070 bset
= isl_set_affine_hull(set
);
1071 str
= "{ [a] : exists e : a = 32 e }";
1072 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1073 subset
= isl_basic_set_is_subset(bset
, bset2
);
1074 isl_basic_set_free(bset
);
1075 isl_basic_set_free(bset2
);
1079 isl_die(ctx
, isl_error_unknown
, "not as accurate as expected",
1085 /* Pairs of maps and the corresponding expected results of
1086 * isl_map_plain_unshifted_simple_hull.
1091 } plain_unshifted_simple_hull_tests
[] = {
1092 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1093 "{ [i] -> [j] : i >= 1 }" },
1094 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1095 "(j mod 4 = 2 and k mod 6 = n) }",
1096 "{ [n] -> [i,j,k] : j mod 4 = 2 }" },
1099 /* Basic tests for isl_map_plain_unshifted_simple_hull.
1101 static int test_plain_unshifted_simple_hull(isl_ctx
*ctx
)
1105 isl_basic_map
*hull
, *expected
;
1108 for (i
= 0; i
< ARRAY_SIZE(plain_unshifted_simple_hull_tests
); ++i
) {
1110 str
= plain_unshifted_simple_hull_tests
[i
].map
;
1111 map
= isl_map_read_from_str(ctx
, str
);
1112 str
= plain_unshifted_simple_hull_tests
[i
].hull
;
1113 expected
= isl_basic_map_read_from_str(ctx
, str
);
1114 hull
= isl_map_plain_unshifted_simple_hull(map
);
1115 equal
= isl_basic_map_is_equal(hull
, expected
);
1116 isl_basic_map_free(hull
);
1117 isl_basic_map_free(expected
);
1121 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1128 /* Pairs of sets and the corresponding expected results of
1129 * isl_set_unshifted_simple_hull.
1134 } unshifted_simple_hull_tests
[] = {
1135 { "{ [0,x,y] : x <= -1; [1,x,y] : x <= y <= -x; [2,x,y] : x <= 1 }",
1136 "{ [t,x,y] : 0 <= t <= 2 and x <= 1 }" },
1139 /* Basic tests for isl_set_unshifted_simple_hull.
1141 static int test_unshifted_simple_hull(isl_ctx
*ctx
)
1145 isl_basic_set
*hull
, *expected
;
1148 for (i
= 0; i
< ARRAY_SIZE(unshifted_simple_hull_tests
); ++i
) {
1150 str
= unshifted_simple_hull_tests
[i
].set
;
1151 set
= isl_set_read_from_str(ctx
, str
);
1152 str
= unshifted_simple_hull_tests
[i
].hull
;
1153 expected
= isl_basic_set_read_from_str(ctx
, str
);
1154 hull
= isl_set_unshifted_simple_hull(set
);
1155 equal
= isl_basic_set_is_equal(hull
, expected
);
1156 isl_basic_set_free(hull
);
1157 isl_basic_set_free(expected
);
1161 isl_die(ctx
, isl_error_unknown
, "unexpected hull",
1168 static int test_simple_hull(struct isl_ctx
*ctx
)
1172 isl_basic_set
*bset
;
1175 str
= "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x;"
1176 "[y, x] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }";
1177 set
= isl_set_read_from_str(ctx
, str
);
1178 bset
= isl_set_simple_hull(set
);
1179 is_empty
= isl_basic_set_is_empty(bset
);
1180 isl_basic_set_free(bset
);
1182 if (is_empty
== isl_bool_error
)
1185 if (is_empty
== isl_bool_false
)
1186 isl_die(ctx
, isl_error_unknown
, "Empty set should be detected",
1189 if (test_plain_unshifted_simple_hull(ctx
) < 0)
1191 if (test_unshifted_simple_hull(ctx
) < 0)
1197 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
1201 struct isl_basic_set
*bset1
, *bset2
;
1202 struct isl_set
*set
;
1204 filename
= get_filename(ctx
, name
, "polylib");
1206 input
= fopen(filename
, "r");
1209 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1210 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1212 set
= isl_basic_set_union(bset1
, bset2
);
1213 bset1
= isl_set_convex_hull(set
);
1215 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1217 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1219 isl_basic_set_free(bset1
);
1220 isl_basic_set_free(bset2
);
1229 } convex_hull_tests
[] = {
1230 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1231 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1232 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1233 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1234 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1235 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1236 "i2 <= 5 and i2 >= 4; "
1237 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1238 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1239 "i2 <= 5 + i0 and i2 >= i0 }" },
1240 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1241 "{ [x, y] : 1 = 0 }" },
1244 static int test_convex_hull_algo(isl_ctx
*ctx
, int convex
)
1247 int orig_convex
= ctx
->opt
->convex
;
1248 ctx
->opt
->convex
= convex
;
1250 test_convex_hull_case(ctx
, "convex0");
1251 test_convex_hull_case(ctx
, "convex1");
1252 test_convex_hull_case(ctx
, "convex2");
1253 test_convex_hull_case(ctx
, "convex3");
1254 test_convex_hull_case(ctx
, "convex4");
1255 test_convex_hull_case(ctx
, "convex5");
1256 test_convex_hull_case(ctx
, "convex6");
1257 test_convex_hull_case(ctx
, "convex7");
1258 test_convex_hull_case(ctx
, "convex8");
1259 test_convex_hull_case(ctx
, "convex9");
1260 test_convex_hull_case(ctx
, "convex10");
1261 test_convex_hull_case(ctx
, "convex11");
1262 test_convex_hull_case(ctx
, "convex12");
1263 test_convex_hull_case(ctx
, "convex13");
1264 test_convex_hull_case(ctx
, "convex14");
1265 test_convex_hull_case(ctx
, "convex15");
1267 for (i
= 0; i
< ARRAY_SIZE(convex_hull_tests
); ++i
) {
1268 isl_set
*set1
, *set2
;
1271 set1
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].set
);
1272 set2
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].hull
);
1273 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
1274 equal
= isl_set_is_equal(set1
, set2
);
1281 isl_die(ctx
, isl_error_unknown
,
1282 "unexpected convex hull", return -1);
1285 ctx
->opt
->convex
= orig_convex
;
1290 static int test_convex_hull(isl_ctx
*ctx
)
1292 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
) < 0)
1294 if (test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
) < 0)
1299 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
1303 struct isl_basic_set
*bset1
, *bset2
;
1305 filename
= get_filename(ctx
, name
, "polylib");
1307 input
= fopen(filename
, "r");
1310 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1311 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1313 bset1
= isl_basic_set_gist(bset1
, bset2
);
1315 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1317 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1319 isl_basic_set_free(bset1
);
1320 isl_basic_set_free(bset2
);
1326 /* Inputs to isl_map_plain_gist_basic_map, along with the expected output.
1330 const char *context
;
1332 } plain_gist_tests
[] = {
1333 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1334 "{ [i] -> [j] : i >= 1 }",
1335 "{ [i] -> [j] : j >= 1 or i >= 2 and j <= 10 }" },
1336 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1337 "(j mod 4 = 2 and k mod 6 = n) }",
1338 "{ [n] -> [i,j,k] : j mod 4 = 2 }",
1339 "{ [n] -> [i,j,k] : (i mod 3 = 2) or (k mod 6 = n) }" },
1340 { "{ [i] -> [j] : i > j and (exists a,b : i <= 2a + 5b <= 2) }",
1341 "{ [i] -> [j] : i > j }",
1342 "{ [i] -> [j] : exists a,b : i <= 2a + 5b <= 2 }" },
1345 /* Basic tests for isl_map_plain_gist_basic_map.
1347 static int test_plain_gist(isl_ctx
*ctx
)
1351 for (i
= 0; i
< ARRAY_SIZE(plain_gist_tests
); ++i
) {
1354 isl_map
*map
, *gist
;
1355 isl_basic_map
*context
;
1357 map
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].map
);
1358 str
= plain_gist_tests
[i
].context
;
1359 context
= isl_basic_map_read_from_str(ctx
, str
);
1360 map
= isl_map_plain_gist_basic_map(map
, context
);
1361 gist
= isl_map_read_from_str(ctx
, plain_gist_tests
[i
].gist
);
1362 equal
= isl_map_is_equal(map
, gist
);
1368 isl_die(ctx
, isl_error_unknown
,
1369 "incorrect gist result", return -1);
1377 const char *context
;
1380 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1381 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1382 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1383 "{ [a, b, c] : a <= 15 }" },
1384 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1385 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1386 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1387 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1388 { "{ [m, n, a, b] : a <= 2147 + n }",
1389 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1390 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1391 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1393 "{ [m, n, ku, kl] }" },
1394 { "{ [a, a, b] : a >= 10 }",
1395 "{ [a, b, c] : c >= a and c <= b and c >= 2 }",
1396 "{ [a, a, b] : a >= 10 }" },
1397 { "{ [i, j] : i >= 0 and i + j >= 0 }", "{ [i, j] : i <= 0 }",
1398 "{ [0, j] : j >= 0 }" },
1399 /* Check that no constraints on i6 are introduced in the gist */
1400 { "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1401 "20e0 <= 1530 - 4t1 - 5i4 and 20e0 >= 1511 - 4t1 - 5i4 and "
1402 "5e0 <= 381 - t1 and i4 <= 1) }",
1403 "[t1] -> { [i4, i6] : exists (e0 = floor((-t1 + i6)/5): "
1404 "5e0 = -t1 + i6 and i6 <= 6 and i6 >= 3) }",
1405 "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1406 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 <= 1530 - 4t1 - 5i4 and "
1407 "20e0 >= 1511 - 4t1 - 5i4) }" },
1408 /* Check that no constraints on i6 are introduced in the gist */
1409 { "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((1 + i4)/2), "
1410 "e1 = floor((1530 - 4t1 - 5i4)/20), "
1411 "e2 = floor((-4t1 - 5i4 + 10*floor((1 + i4)/2))/20), "
1412 "e3 = floor((-1 + i4)/2): t2 = 0 and 2e3 = -1 + i4 and "
1413 "20e2 >= -19 - 4t1 - 5i4 + 10e0 and 5e2 <= 1 - t1 and "
1414 "2e0 <= 1 + i4 and 2e0 >= i4 and "
1415 "20e1 <= 1530 - 4t1 - 5i4 and "
1416 "20e1 >= 1511 - 4t1 - 5i4 and i4 <= 1 and "
1417 "5e1 <= 381 - t1 and 20e2 <= -4t1 - 5i4 + 10e0) }",
1418 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((-17 + i4)/2), "
1419 "e1 = floor((-t1 + i6)/5): 5e1 = -t1 + i6 and "
1420 "2e0 <= -17 + i4 and 2e0 >= -18 + i4 and "
1421 "10e0 <= -91 + 5i4 + 4i6 and "
1422 "10e0 >= -105 + 5i4 + 4i6) }",
1423 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((381 - t1)/5), "
1424 "e1 = floor((-1 + i4)/2): t2 = 0 and 2e1 = -1 + i4 and "
1425 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 >= 1511 - 4t1 - 5i4) }" },
1426 { "{ [0, 0, q, p] : -5 <= q <= 5 and p >= 0 }",
1427 "{ [a, b, q, p] : b >= 1 + a }",
1428 "{ [a, b, q, p] : false }" },
1429 { "[n] -> { [x] : x = n && x mod 32 = 0 }",
1430 "[n] -> { [x] : x mod 32 = 0 }",
1431 "[n] -> { [x = n] }" },
1432 { "{ [x] : x mod 6 = 0 }", "{ [x] : x mod 3 = 0 }",
1433 "{ [x] : x mod 2 = 0 }" },
1434 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10000 = 0 }",
1435 "{ [x] : x mod 128 = 0 }" },
1436 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10 = 0 }",
1437 "{ [x] : x mod 3200 = 0 }" },
1438 { "{ [a, b, c] : a mod 2 = 0 and a = c }",
1439 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1440 "{ [a, b, c = a] }" },
1441 { "{ [a, b, c] : a mod 6 = 0 and a = c }",
1442 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1443 "{ [a, b, c = a] : a mod 3 = 0 }" },
1444 { "{ [x] : 0 <= x <= 4 or 6 <= x <= 9 }",
1445 "{ [x] : 1 <= x <= 3 or 7 <= x <= 8 }",
1447 { "{ [x,y] : x < 0 and 0 <= y <= 4 or x >= -2 and -x <= y <= 10 + x }",
1448 "{ [x,y] : 1 <= y <= 3 }",
1452 /* Check that isl_set_gist behaves as expected.
1454 * For the test cases in gist_tests, besides checking that the result
1455 * is as expected, also check that applying the gist operation does
1456 * not modify the input set (an earlier version of isl would do that) and
1457 * that the test case is consistent, i.e., that the gist has the same
1458 * intersection with the context as the input set.
1460 static int test_gist(struct isl_ctx
*ctx
)
1464 isl_basic_set
*bset1
, *bset2
;
1465 isl_map
*map1
, *map2
;
1468 for (i
= 0; i
< ARRAY_SIZE(gist_tests
); ++i
) {
1469 int equal_input
, equal_intersection
;
1470 isl_set
*set1
, *set2
, *copy
, *context
;
1472 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1473 context
= isl_set_read_from_str(ctx
, gist_tests
[i
].context
);
1474 copy
= isl_set_copy(set1
);
1475 set1
= isl_set_gist(set1
, isl_set_copy(context
));
1476 set2
= isl_set_read_from_str(ctx
, gist_tests
[i
].gist
);
1477 equal
= isl_set_is_equal(set1
, set2
);
1479 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1480 equal_input
= isl_set_is_equal(set1
, copy
);
1482 set1
= isl_set_intersect(set1
, isl_set_copy(context
));
1483 set2
= isl_set_intersect(set2
, context
);
1484 equal_intersection
= isl_set_is_equal(set1
, set2
);
1487 if (equal
< 0 || equal_input
< 0 || equal_intersection
< 0)
1490 isl_die(ctx
, isl_error_unknown
,
1491 "incorrect gist result", return -1);
1493 isl_die(ctx
, isl_error_unknown
,
1494 "gist modified input", return -1);
1496 isl_die(ctx
, isl_error_unknown
,
1497 "inconsistent gist test case", return -1);
1500 test_gist_case(ctx
, "gist1");
1502 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
1503 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1504 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1505 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1506 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1507 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1508 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1509 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1510 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1511 bset1
= isl_basic_set_read_from_str(ctx
, str
);
1512 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1513 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1514 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1515 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1516 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1517 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1518 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1519 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1520 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1521 bset1
= isl_basic_set_gist(bset1
, bset2
);
1522 assert(bset1
&& bset1
->n_div
== 0);
1523 isl_basic_set_free(bset1
);
1525 /* Check that the integer divisions of the second disjunct
1526 * do not spread to the first disjunct.
1528 str
= "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1529 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1530 "(exists (e0 = [(-1 + t1)/16], "
1531 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1532 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1533 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1534 "o0 <= 4294967295 and t1 <= -1)) }";
1535 map1
= isl_map_read_from_str(ctx
, str
);
1536 str
= "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1537 map2
= isl_map_read_from_str(ctx
, str
);
1538 map1
= isl_map_gist(map1
, map2
);
1542 isl_die(ctx
, isl_error_unknown
, "expecting single disjunct",
1543 isl_map_free(map1
); return -1);
1544 if (isl_basic_map_dim(map1
->p
[0], isl_dim_div
) != 1)
1545 isl_die(ctx
, isl_error_unknown
, "expecting single div",
1546 isl_map_free(map1
); return -1);
1549 if (test_plain_gist(ctx
) < 0)
1555 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
1557 isl_set
*set
, *set2
;
1561 set
= isl_set_read_from_str(ctx
, str
);
1562 set
= isl_set_coalesce(set
);
1563 set2
= isl_set_read_from_str(ctx
, str
);
1564 equal
= isl_set_is_equal(set
, set2
);
1565 one
= set
&& set
->n
== 1;
1572 isl_die(ctx
, isl_error_unknown
,
1573 "coalesced set not equal to input", return -1);
1574 if (check_one
&& !one
)
1575 isl_die(ctx
, isl_error_unknown
,
1576 "coalesced set should not be a union", return -1);
1581 /* Inputs for coalescing tests with unbounded wrapping.
1582 * "str" is a string representation of the input set.
1583 * "single_disjunct" is set if we expect the result to consist of
1584 * a single disjunct.
1587 int single_disjunct
;
1589 } coalesce_unbounded_tests
[] = {
1590 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1591 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1592 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1593 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1595 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1596 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1597 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1598 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1601 /* Test the functionality of isl_set_coalesce with the bounded wrapping
1602 * option turned off.
1604 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
1610 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
1611 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
1613 for (i
= 0; i
< ARRAY_SIZE(coalesce_unbounded_tests
); ++i
) {
1614 const char *str
= coalesce_unbounded_tests
[i
].str
;
1615 int check_one
= coalesce_unbounded_tests
[i
].single_disjunct
;
1616 if (test_coalesce_set(ctx
, str
, check_one
) >= 0)
1622 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
1627 /* Inputs for coalescing tests.
1628 * "str" is a string representation of the input set.
1629 * "single_disjunct" is set if we expect the result to consist of
1630 * a single disjunct.
1633 int single_disjunct
;
1635 } coalesce_tests
[] = {
1636 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1637 "y >= x & x >= 2 & 5 >= y }" },
1638 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1639 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1640 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1641 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1642 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1643 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1644 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1645 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1646 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1647 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1648 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1649 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1650 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1651 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1652 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1653 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1654 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1655 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1656 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1657 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1658 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1659 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1660 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1661 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1662 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1663 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1664 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1665 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1666 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1667 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1668 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1669 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1670 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1671 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1672 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1673 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1674 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1675 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1676 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1677 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1678 "[o0, o1, o2, o3, o4, o5, o6]] : "
1679 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1680 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1681 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1682 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1683 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1684 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1685 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1686 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1687 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1688 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1689 "o6 >= i3 + i6 - o3 and M >= 0 and "
1690 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1691 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1692 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1693 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1694 "(o0 = 0 and M >= 2 and N >= 3) or "
1695 "(M = 0 and o0 = 0 and N >= 3) }" },
1696 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1697 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1698 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1699 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1700 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1701 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1702 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1703 "(y = 3 and x = 1) }" },
1704 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1705 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1706 "i1 <= M and i3 <= M and i4 <= M) or "
1707 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1708 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1709 "i4 <= -1 + M) }" },
1710 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1711 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1712 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1713 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1714 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1715 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1716 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1717 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1718 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1719 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1720 { 0, "{ [a, b] : exists e : 2e = a and "
1721 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1722 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1723 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1724 "j >= 1 and j' <= i + j - i' and i >= 1; "
1726 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1727 "[i,j] : exists a : j = 3a }" },
1728 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1729 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1731 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1732 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1733 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1734 "c <= 6 + 8a and a >= 3; "
1735 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1736 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1737 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1738 "[x,0] : 3 <= x <= 4 }" },
1739 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1740 "[x,0] : 4 <= x <= 5 }" },
1741 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1742 "[x,0] : 3 <= x <= 5 }" },
1743 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1744 "[x,0] : 3 <= x <= 4 }" },
1745 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1747 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1748 { 1, "{ [0,0]; [1,1] }" },
1749 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1750 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1752 "[k, 0, k] : k <= 6 and k >= 1 }" },
1753 { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;"
1754 "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" },
1755 { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" },
1756 { 1, "[n] -> { [1] : n >= 0;"
1757 "[x] : exists (e0 = floor((x)/2): x >= 2 and "
1758 "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" },
1759 { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): "
1760 "3e1 = y and x >= 2 and 2e0 >= -1 + x and "
1761 "2e0 <= x and 2e0 <= n);"
1762 "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and "
1764 { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): "
1765 "128e0 >= -134 + 127t1 and t1 >= 2 and "
1766 "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or "
1768 { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and "
1769 "3e0 >= -1 + 2i and i <= 9 and i >= 1);"
1771 { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and "
1772 "t1 >= 13 and t1 <= 16);"
1773 "[t1] : t1 <= 15 and t1 >= 12 }" },
1774 { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" },
1775 { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" },
1776 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" },
1777 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" },
1778 { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;"
1779 "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and "
1781 { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or "
1782 "(exists (e0 : 3e0 = -2 + c0)) }" },
1783 { 0, "[n, b0, t0] -> "
1784 "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
1785 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1786 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1787 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1788 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and "
1789 "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and "
1790 "i8 >= -157 + i0 - 4i4 and i8 >= 0 and "
1791 "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or "
1792 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1793 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1794 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1795 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and "
1796 "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and "
1797 "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and "
1798 "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));"
1799 "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : "
1800 "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and "
1801 "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and "
1802 "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and "
1803 "i8 >= -40 + i0 and i8 <= -10 + i0)) }" },
1804 { 0, "{ [i0, i1, i2] : "
1805 "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): "
1806 "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and "
1807 "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and "
1808 "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and "
1809 "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and "
1810 "32e0 <= 31 + i0)) or "
1812 { 1, "{ [a, b, c] : 2b = 1 + a and 2c = 2 + a; [0, 0, 0] }" },
1813 { 1, "{ [a, a, b, c] : 32*floor((a)/32) = a and 2*floor((b)/2) = b and "
1814 "2*floor((c)/2) = c and 0 <= a <= 192;"
1815 "[224, 224, b, c] : 2*floor((b)/2) = b and 2*floor((c)/2) = c }"
1817 { 1, "[n] -> { [a,b] : (exists e : 1 <= a <= 7e and 9e <= b <= n) or "
1818 "(0 <= a <= b <= n) }" },
1821 /* A specialized coalescing test case that would result
1822 * in a segmentation fault or a failed assertion in earlier versions of isl.
1824 static int test_coalesce_special(struct isl_ctx
*ctx
)
1827 isl_map
*map1
, *map2
;
1829 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1830 "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : "
1831 "(y = 201 and o1 <= 239 and o1 >= 212) or "
1832 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and "
1833 "o1 <= 239 and o1 >= 212)) or "
1834 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and "
1835 "o1 <= 241 and o1 >= 240));"
1836 "[S_L220_OUT[] -> T7[]] -> "
1837 "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : "
1838 "(y = 2 and o1 <= 241 and o1 >= 212) or "
1839 "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and "
1840 "y >= 5 and o1 <= 241 and o1 >= 212)) }";
1841 map1
= isl_map_read_from_str(ctx
, str
);
1842 map1
= isl_map_align_divs(map1
);
1843 map1
= isl_map_coalesce(map1
);
1844 str
= "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1845 "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : "
1846 "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and "
1847 "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and "
1848 "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }";
1849 map2
= isl_map_read_from_str(ctx
, str
);
1850 map2
= isl_map_union(map2
, map1
);
1851 map2
= isl_map_align_divs(map2
);
1852 map2
= isl_map_coalesce(map2
);
1860 /* Test the functionality of isl_set_coalesce.
1861 * That is, check that the output is always equal to the input
1862 * and in some cases that the result consists of a single disjunct.
1864 static int test_coalesce(struct isl_ctx
*ctx
)
1868 for (i
= 0; i
< ARRAY_SIZE(coalesce_tests
); ++i
) {
1869 const char *str
= coalesce_tests
[i
].str
;
1870 int check_one
= coalesce_tests
[i
].single_disjunct
;
1871 if (test_coalesce_set(ctx
, str
, check_one
) < 0)
1875 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
1877 if (test_coalesce_special(ctx
) < 0)
1883 /* Construct a representation of the graph on the right of Figure 1
1884 * in "Computing the Transitive Closure of a Union of
1885 * Affine Integer Tuple Relations".
1887 static __isl_give isl_map
*cocoa_fig_1_right_graph(isl_ctx
*ctx
)
1890 isl_map
*up
, *right
;
1892 dom
= isl_set_read_from_str(ctx
,
1893 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1894 "2 x - 3 y + 3 >= 0 }");
1895 right
= isl_map_read_from_str(ctx
,
1896 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1897 up
= isl_map_read_from_str(ctx
,
1898 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1899 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
1900 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
1901 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
1902 up
= isl_map_intersect_range(up
, dom
);
1903 return isl_map_union(up
, right
);
1906 /* Construct a representation of the power of the graph
1907 * on the right of Figure 1 in "Computing the Transitive Closure of
1908 * a Union of Affine Integer Tuple Relations".
1910 static __isl_give isl_map
*cocoa_fig_1_right_power(isl_ctx
*ctx
)
1912 return isl_map_read_from_str(ctx
,
1913 "{ [1] -> [[0,0] -> [0,1]]; [2] -> [[0,0] -> [1,1]]; "
1914 " [1] -> [[0,1] -> [1,1]]; [1] -> [[2,2] -> [3,2]]; "
1915 " [2] -> [[2,2] -> [3,3]]; [1] -> [[3,2] -> [3,3]] }");
1918 /* Construct a representation of the transitive closure of the graph
1919 * on the right of Figure 1 in "Computing the Transitive Closure of
1920 * a Union of Affine Integer Tuple Relations".
1922 static __isl_give isl_map
*cocoa_fig_1_right_tc(isl_ctx
*ctx
)
1924 return isl_set_unwrap(isl_map_range(cocoa_fig_1_right_power(ctx
)));
1927 static int test_closure(isl_ctx
*ctx
)
1930 isl_map
*map
, *map2
;
1933 /* COCOA example 1 */
1934 map
= isl_map_read_from_str(ctx
,
1935 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1936 "1 <= i and i < n and 1 <= j and j < n or "
1937 "i2 = i + 1 and j2 = j - 1 and "
1938 "1 <= i and i < n and 2 <= j and j <= n }");
1939 map
= isl_map_power(map
, &exact
);
1943 /* COCOA example 1 */
1944 map
= isl_map_read_from_str(ctx
,
1945 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1946 "1 <= i and i < n and 1 <= j and j < n or "
1947 "i2 = i + 1 and j2 = j - 1 and "
1948 "1 <= i and i < n and 2 <= j and j <= n }");
1949 map
= isl_map_transitive_closure(map
, &exact
);
1951 map2
= isl_map_read_from_str(ctx
,
1952 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1953 "1 <= i and i < n and 1 <= j and j <= n and "
1954 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1955 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1956 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1957 assert(isl_map_is_equal(map
, map2
));
1961 map
= isl_map_read_from_str(ctx
,
1962 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1963 " 0 <= y and y <= n }");
1964 map
= isl_map_transitive_closure(map
, &exact
);
1965 map2
= isl_map_read_from_str(ctx
,
1966 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1967 " 0 <= y and y <= n }");
1968 assert(isl_map_is_equal(map
, map2
));
1972 /* COCOA example 2 */
1973 map
= isl_map_read_from_str(ctx
,
1974 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1975 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1976 "i2 = i + 2 and j2 = j - 2 and "
1977 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1978 map
= isl_map_transitive_closure(map
, &exact
);
1980 map2
= isl_map_read_from_str(ctx
,
1981 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1982 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1983 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1984 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1985 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1986 assert(isl_map_is_equal(map
, map2
));
1990 /* COCOA Fig.2 left */
1991 map
= isl_map_read_from_str(ctx
,
1992 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1993 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1995 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1996 "j <= 2 i - 3 and j <= n - 2 or "
1997 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1998 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1999 map
= isl_map_transitive_closure(map
, &exact
);
2003 /* COCOA Fig.2 right */
2004 map
= isl_map_read_from_str(ctx
,
2005 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2006 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2008 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2009 "j <= 2 i - 4 and j <= n - 3 or "
2010 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2011 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2012 map
= isl_map_power(map
, &exact
);
2016 /* COCOA Fig.2 right */
2017 map
= isl_map_read_from_str(ctx
,
2018 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2019 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2021 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2022 "j <= 2 i - 4 and j <= n - 3 or "
2023 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2024 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2025 map
= isl_map_transitive_closure(map
, &exact
);
2027 map2
= isl_map_read_from_str(ctx
,
2028 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
2029 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
2030 "j <= n and 3 + i + 2 j <= 3 n and "
2031 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
2032 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
2033 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
2034 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
2035 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
2036 assert(isl_map_is_equal(map
, map2
));
2040 map
= cocoa_fig_1_right_graph(ctx
);
2041 map
= isl_map_transitive_closure(map
, &exact
);
2043 map2
= cocoa_fig_1_right_tc(ctx
);
2044 assert(isl_map_is_equal(map
, map2
));
2048 map
= cocoa_fig_1_right_graph(ctx
);
2049 map
= isl_map_power(map
, &exact
);
2050 map2
= cocoa_fig_1_right_power(ctx
);
2051 equal
= isl_map_is_equal(map
, map2
);
2057 isl_die(ctx
, isl_error_unknown
, "power not exact", return -1);
2059 isl_die(ctx
, isl_error_unknown
, "unexpected power", return -1);
2061 /* COCOA Theorem 1 counter example */
2062 map
= isl_map_read_from_str(ctx
,
2063 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
2064 "i2 = 1 and j2 = j or "
2065 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
2066 map
= isl_map_transitive_closure(map
, &exact
);
2070 map
= isl_map_read_from_str(ctx
,
2071 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
2072 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
2073 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
2074 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
2075 map
= isl_map_transitive_closure(map
, &exact
);
2079 /* Kelly et al 1996, fig 12 */
2080 map
= isl_map_read_from_str(ctx
,
2081 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
2082 "1 <= i,j,j+1 <= n or "
2083 "j = n and j2 = 1 and i2 = i + 1 and "
2084 "1 <= i,i+1 <= n }");
2085 map
= isl_map_transitive_closure(map
, &exact
);
2087 map2
= isl_map_read_from_str(ctx
,
2088 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
2089 "1 <= i <= n and i = i2 or "
2090 "1 <= i < i2 <= n and 1 <= j <= n and "
2092 assert(isl_map_is_equal(map
, map2
));
2096 /* Omega's closure4 */
2097 map
= isl_map_read_from_str(ctx
,
2098 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
2099 "1 <= x,y <= 10 or "
2100 "x2 = x + 1 and y2 = y and "
2101 "1 <= x <= 20 && 5 <= y <= 15 }");
2102 map
= isl_map_transitive_closure(map
, &exact
);
2106 map
= isl_map_read_from_str(ctx
,
2107 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
2108 map
= isl_map_transitive_closure(map
, &exact
);
2110 map2
= isl_map_read_from_str(ctx
,
2111 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
2112 assert(isl_map_is_equal(map
, map2
));
2116 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
2117 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
2118 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
2119 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
2120 map
= isl_map_read_from_str(ctx
, str
);
2121 map
= isl_map_transitive_closure(map
, &exact
);
2123 map2
= isl_map_read_from_str(ctx
, str
);
2124 assert(isl_map_is_equal(map
, map2
));
2128 str
= "{[0] -> [1]; [2] -> [3]}";
2129 map
= isl_map_read_from_str(ctx
, str
);
2130 map
= isl_map_transitive_closure(map
, &exact
);
2132 map2
= isl_map_read_from_str(ctx
, str
);
2133 assert(isl_map_is_equal(map
, map2
));
2137 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
2138 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
2139 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
2140 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2141 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2142 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
2143 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
2144 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
2145 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2146 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2147 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
2148 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
2149 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
2150 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2151 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2152 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
2153 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
2154 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
2155 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2156 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
2157 map
= isl_map_read_from_str(ctx
, str
);
2158 map
= isl_map_transitive_closure(map
, NULL
);
2165 static int test_lex(struct isl_ctx
*ctx
)
2171 dim
= isl_space_set_alloc(ctx
, 0, 0);
2172 map
= isl_map_lex_le(dim
);
2173 empty
= isl_map_is_empty(map
);
2179 isl_die(ctx
, isl_error_unknown
,
2180 "expecting non-empty result", return -1);
2185 static int test_lexmin(struct isl_ctx
*ctx
)
2189 isl_basic_map
*bmap
;
2190 isl_map
*map
, *map2
;
2193 isl_pw_multi_aff
*pma
;
2195 str
= "[p0, p1] -> { [] -> [] : "
2196 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
2197 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
2198 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
2199 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
2200 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
2201 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
2202 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
2203 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
2204 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
2205 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
2206 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
2207 map
= isl_map_read_from_str(ctx
, str
);
2208 map
= isl_map_lexmin(map
);
2211 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
2212 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
2213 set
= isl_set_read_from_str(ctx
, str
);
2214 set
= isl_set_lexmax(set
);
2215 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
2216 set2
= isl_set_read_from_str(ctx
, str
);
2217 set
= isl_set_intersect(set
, set2
);
2218 assert(!isl_set_is_empty(set
));
2221 str
= "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
2222 map
= isl_map_read_from_str(ctx
, str
);
2223 map
= isl_map_lexmin(map
);
2224 str
= "{ [x] -> [5] : 6 <= x <= 8; "
2225 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
2226 map2
= isl_map_read_from_str(ctx
, str
);
2227 assert(isl_map_is_equal(map
, map2
));
2231 str
= "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
2232 map
= isl_map_read_from_str(ctx
, str
);
2233 map2
= isl_map_copy(map
);
2234 map
= isl_map_lexmin(map
);
2235 assert(isl_map_is_equal(map
, map2
));
2239 str
= "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
2240 map
= isl_map_read_from_str(ctx
, str
);
2241 map
= isl_map_lexmin(map
);
2242 str
= "{ [x] -> [y] : (4y = x and x >= 0) or "
2243 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
2244 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
2245 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
2246 map2
= isl_map_read_from_str(ctx
, str
);
2247 assert(isl_map_is_equal(map
, map2
));
2251 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2252 " 8i' <= i and 8i' >= -7 + i }";
2253 bmap
= isl_basic_map_read_from_str(ctx
, str
);
2254 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
2255 map2
= isl_map_from_pw_multi_aff(pma
);
2256 map
= isl_map_from_basic_map(bmap
);
2257 assert(isl_map_is_equal(map
, map2
));
2261 str
= "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
2262 map
= isl_map_read_from_str(ctx
, str
);
2263 map
= isl_map_lexmin(map
);
2264 str
= "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
2265 map2
= isl_map_read_from_str(ctx
, str
);
2266 assert(isl_map_is_equal(map
, map2
));
2270 /* Check that empty pieces are properly combined. */
2271 str
= "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
2272 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
2273 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }";
2274 map
= isl_map_read_from_str(ctx
, str
);
2275 map
= isl_map_lexmin(map
);
2276 str
= "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
2277 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
2279 map2
= isl_map_read_from_str(ctx
, str
);
2280 assert(isl_map_is_equal(map
, map2
));
2284 str
= "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2285 " 8i' <= i and 8i' >= -7 + i }";
2286 set
= isl_set_read_from_str(ctx
, str
);
2287 pma
= isl_set_lexmin_pw_multi_aff(isl_set_copy(set
));
2288 set2
= isl_set_from_pw_multi_aff(pma
);
2289 equal
= isl_set_is_equal(set
, set2
);
2295 isl_die(ctx
, isl_error_unknown
,
2296 "unexpected difference between set and "
2297 "piecewise affine expression", return -1);
2305 __isl_give isl_val
*(*fn
)(__isl_keep isl_set
*set
,
2306 __isl_keep isl_aff
*obj
);
2309 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_min_val
, "-1" },
2310 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_max_val
, "1" },
2311 { "{ [a, b] : 0 <= a, b <= 100 and b mod 2 = 0}",
2312 "{ [a, b] -> [floor((b - 2*floor((-a)/4))/5)] }",
2313 &isl_set_max_val
, "30" },
2317 /* Perform basic isl_set_min_val and isl_set_max_val tests.
2318 * In particular, check the results on non-convex inputs.
2320 static int test_min(struct isl_ctx
*ctx
)
2328 for (i
= 0; i
< ARRAY_SIZE(opt_tests
); ++i
) {
2329 set
= isl_set_read_from_str(ctx
, opt_tests
[i
].set
);
2330 obj
= isl_aff_read_from_str(ctx
, opt_tests
[i
].obj
);
2331 res
= isl_val_read_from_str(ctx
, opt_tests
[i
].res
);
2332 val
= opt_tests
[i
].fn(set
, obj
);
2333 ok
= isl_val_eq(res
, val
);
2342 isl_die(ctx
, isl_error_unknown
,
2343 "unexpected optimum", return -1);
2354 static isl_stat
collect_must_may(__isl_take isl_map
*dep
, int must
,
2355 void *dep_user
, void *user
)
2357 struct must_may
*mm
= (struct must_may
*)user
;
2360 mm
->must
= isl_map_union(mm
->must
, dep
);
2362 mm
->may
= isl_map_union(mm
->may
, dep
);
2367 static int common_space(void *first
, void *second
)
2369 int depth
= *(int *)first
;
2373 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
2381 map2
= isl_map_read_from_str(map
->ctx
, str
);
2382 equal
= isl_map_is_equal(map
, map2
);
2388 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
2392 equal
= map_is_equal(map
, str
);
2396 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
2397 "result not as expected", return -1);
2401 static int test_dep(struct isl_ctx
*ctx
)
2406 isl_access_info
*ai
;
2413 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2414 map
= isl_map_read_from_str(ctx
, str
);
2415 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2417 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2418 map
= isl_map_read_from_str(ctx
, str
);
2419 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2421 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2422 map
= isl_map_read_from_str(ctx
, str
);
2423 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2425 flow
= isl_access_info_compute_flow(ai
);
2426 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2427 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2428 mm
.may
= isl_map_empty(dim
);
2430 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2432 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
2433 " [1,10,0] -> [2,5,0] }";
2434 assert(map_is_equal(mm
.must
, str
));
2435 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2436 assert(map_is_equal(mm
.may
, str
));
2438 isl_map_free(mm
.must
);
2439 isl_map_free(mm
.may
);
2440 isl_flow_free(flow
);
2443 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2444 map
= isl_map_read_from_str(ctx
, str
);
2445 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2447 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2448 map
= isl_map_read_from_str(ctx
, str
);
2449 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2451 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2452 map
= isl_map_read_from_str(ctx
, str
);
2453 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2455 flow
= isl_access_info_compute_flow(ai
);
2456 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2457 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2458 mm
.may
= isl_map_empty(dim
);
2460 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2462 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
2463 assert(map_is_equal(mm
.must
, str
));
2464 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2465 assert(map_is_equal(mm
.may
, str
));
2467 isl_map_free(mm
.must
);
2468 isl_map_free(mm
.may
);
2469 isl_flow_free(flow
);
2472 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2473 map
= isl_map_read_from_str(ctx
, str
);
2474 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2476 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2477 map
= isl_map_read_from_str(ctx
, str
);
2478 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2480 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2481 map
= isl_map_read_from_str(ctx
, str
);
2482 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2484 flow
= isl_access_info_compute_flow(ai
);
2485 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2486 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2487 mm
.may
= isl_map_empty(dim
);
2489 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2491 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2492 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2493 assert(map_is_equal(mm
.may
, str
));
2494 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2495 assert(map_is_equal(mm
.must
, str
));
2497 isl_map_free(mm
.must
);
2498 isl_map_free(mm
.may
);
2499 isl_flow_free(flow
);
2502 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2503 map
= isl_map_read_from_str(ctx
, str
);
2504 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2506 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2507 map
= isl_map_read_from_str(ctx
, str
);
2508 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2510 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2511 map
= isl_map_read_from_str(ctx
, str
);
2512 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2514 flow
= isl_access_info_compute_flow(ai
);
2515 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2516 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2517 mm
.may
= isl_map_empty(dim
);
2519 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2521 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2522 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2523 assert(map_is_equal(mm
.may
, str
));
2524 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2525 assert(map_is_equal(mm
.must
, str
));
2527 isl_map_free(mm
.must
);
2528 isl_map_free(mm
.may
);
2529 isl_flow_free(flow
);
2532 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2533 map
= isl_map_read_from_str(ctx
, str
);
2534 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2536 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2537 map
= isl_map_read_from_str(ctx
, str
);
2538 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2540 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2541 map
= isl_map_read_from_str(ctx
, str
);
2542 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2544 flow
= isl_access_info_compute_flow(ai
);
2545 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2546 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2547 mm
.may
= isl_map_empty(dim
);
2549 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2551 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2552 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2553 assert(map_is_equal(mm
.may
, str
));
2554 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2555 assert(map_is_equal(mm
.must
, str
));
2557 isl_map_free(mm
.must
);
2558 isl_map_free(mm
.may
);
2559 isl_flow_free(flow
);
2564 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2565 map
= isl_map_read_from_str(ctx
, str
);
2566 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
2568 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2569 map
= isl_map_read_from_str(ctx
, str
);
2570 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2572 flow
= isl_access_info_compute_flow(ai
);
2573 dim
= isl_space_alloc(ctx
, 0, 5, 5);
2574 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2575 mm
.may
= isl_map_empty(dim
);
2577 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2579 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
2580 assert(map_is_equal(mm
.must
, str
));
2581 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
2582 assert(map_is_equal(mm
.may
, str
));
2584 isl_map_free(mm
.must
);
2585 isl_map_free(mm
.may
);
2586 isl_flow_free(flow
);
2591 /* Check that the dependence analysis proceeds without errors.
2592 * Earlier versions of isl would break down during the analysis
2593 * due to the use of the wrong spaces.
2595 static int test_flow(isl_ctx
*ctx
)
2598 isl_union_map
*access
, *schedule
;
2599 isl_union_map
*must_dep
, *may_dep
;
2602 str
= "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
2603 access
= isl_union_map_read_from_str(ctx
, str
);
2604 str
= "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
2605 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
2606 "S2[] -> [1,0,0,0]; "
2607 "S3[] -> [-1,0,0,0] }";
2608 schedule
= isl_union_map_read_from_str(ctx
, str
);
2609 r
= isl_union_map_compute_flow(access
, isl_union_map_copy(access
),
2610 isl_union_map_copy(access
), schedule
,
2611 &must_dep
, &may_dep
, NULL
, NULL
);
2612 isl_union_map_free(may_dep
);
2613 isl_union_map_free(must_dep
);
2622 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
2623 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
2624 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
2625 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
2626 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
2627 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
2628 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2629 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2630 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
2633 int test_sv(isl_ctx
*ctx
)
2635 isl_union_map
*umap
;
2639 for (i
= 0; i
< ARRAY_SIZE(sv_tests
); ++i
) {
2640 umap
= isl_union_map_read_from_str(ctx
, sv_tests
[i
].map
);
2641 sv
= isl_union_map_is_single_valued(umap
);
2642 isl_union_map_free(umap
);
2645 if (sv_tests
[i
].sv
&& !sv
)
2646 isl_die(ctx
, isl_error_internal
,
2647 "map not detected as single valued", return -1);
2648 if (!sv_tests
[i
].sv
&& sv
)
2649 isl_die(ctx
, isl_error_internal
,
2650 "map detected as single valued", return -1);
2659 } bijective_tests
[] = {
2660 { "[N,M]->{[i,j] -> [i]}", 0 },
2661 { "[N,M]->{[i,j] -> [i] : j=i}", 1 },
2662 { "[N,M]->{[i,j] -> [i] : j=0}", 1 },
2663 { "[N,M]->{[i,j] -> [i] : j=N}", 1 },
2664 { "[N,M]->{[i,j] -> [j,i]}", 1 },
2665 { "[N,M]->{[i,j] -> [i+j]}", 0 },
2666 { "[N,M]->{[i,j] -> []}", 0 },
2667 { "[N,M]->{[i,j] -> [i,j,N]}", 1 },
2668 { "[N,M]->{[i,j] -> [2i]}", 0 },
2669 { "[N,M]->{[i,j] -> [i,i]}", 0 },
2670 { "[N,M]->{[i,j] -> [2i,i]}", 0 },
2671 { "[N,M]->{[i,j] -> [2i,j]}", 1 },
2672 { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 },
2675 static int test_bijective(struct isl_ctx
*ctx
)
2681 for (i
= 0; i
< ARRAY_SIZE(bijective_tests
); ++i
) {
2682 map
= isl_map_read_from_str(ctx
, bijective_tests
[i
].str
);
2683 bijective
= isl_map_is_bijective(map
);
2687 if (bijective_tests
[i
].bijective
&& !bijective
)
2688 isl_die(ctx
, isl_error_internal
,
2689 "map not detected as bijective", return -1);
2690 if (!bijective_tests
[i
].bijective
&& bijective
)
2691 isl_die(ctx
, isl_error_internal
,
2692 "map detected as bijective", return -1);
2698 /* Inputs for isl_pw_qpolynomial_gist tests.
2699 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
2705 } pwqp_gist_tests
[] = {
2706 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
2707 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
2708 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
2709 "{ [i] -> -1/2 + 1/2 * i }" },
2710 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
2713 static int test_pwqp(struct isl_ctx
*ctx
)
2718 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
2721 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2722 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2724 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
2727 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2728 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2730 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2732 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2734 isl_pw_qpolynomial_free(pwqp1
);
2736 for (i
= 0; i
< ARRAY_SIZE(pwqp_gist_tests
); ++i
) {
2737 str
= pwqp_gist_tests
[i
].pwqp
;
2738 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2739 str
= pwqp_gist_tests
[i
].set
;
2740 set
= isl_set_read_from_str(ctx
, str
);
2741 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
2742 str
= pwqp_gist_tests
[i
].gist
;
2743 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2744 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2745 equal
= isl_pw_qpolynomial_is_zero(pwqp1
);
2746 isl_pw_qpolynomial_free(pwqp1
);
2751 isl_die(ctx
, isl_error_unknown
,
2752 "unexpected result", return -1);
2755 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
2756 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2757 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
2758 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2760 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2762 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2764 isl_pw_qpolynomial_free(pwqp1
);
2766 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
2767 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2768 str
= "{ [x] -> x }";
2769 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2771 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2773 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2775 isl_pw_qpolynomial_free(pwqp1
);
2777 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
2778 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2779 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2780 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
2781 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2782 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2783 isl_pw_qpolynomial_free(pwqp1
);
2785 str
= "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
2786 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2787 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2788 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2789 set
= isl_set_read_from_str(ctx
, "{ [a,b,a] }");
2790 pwqp1
= isl_pw_qpolynomial_intersect_domain(pwqp1
, set
);
2791 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2792 isl_pw_qpolynomial_free(pwqp1
);
2793 isl_pw_qpolynomial_free(pwqp2
);
2797 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2799 str
= "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
2800 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2801 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2802 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2803 pwqp1
= isl_pw_qpolynomial_fix_val(pwqp1
, isl_dim_set
, 1,
2805 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2806 isl_pw_qpolynomial_free(pwqp1
);
2807 isl_pw_qpolynomial_free(pwqp2
);
2811 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2816 static int test_split_periods(isl_ctx
*ctx
)
2819 isl_pw_qpolynomial
*pwqp
;
2821 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
2822 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
2823 "U >= 0; [U,V] -> U^2 : U >= 100 }";
2824 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2826 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
2828 isl_pw_qpolynomial_free(pwqp
);
2836 static int test_union(isl_ctx
*ctx
)
2839 isl_union_set
*uset1
, *uset2
;
2840 isl_union_map
*umap1
, *umap2
;
2843 str
= "{ [i] : 0 <= i <= 1 }";
2844 uset1
= isl_union_set_read_from_str(ctx
, str
);
2845 str
= "{ [1] -> [0] }";
2846 umap1
= isl_union_map_read_from_str(ctx
, str
);
2848 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
2849 equal
= isl_union_map_is_equal(umap1
, umap2
);
2851 isl_union_map_free(umap1
);
2852 isl_union_map_free(umap2
);
2857 isl_die(ctx
, isl_error_unknown
, "union maps not equal",
2860 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
2861 umap1
= isl_union_map_read_from_str(ctx
, str
);
2862 str
= "{ A[i]; B[i] }";
2863 uset1
= isl_union_set_read_from_str(ctx
, str
);
2865 uset2
= isl_union_map_domain(umap1
);
2867 equal
= isl_union_set_is_equal(uset1
, uset2
);
2869 isl_union_set_free(uset1
);
2870 isl_union_set_free(uset2
);
2875 isl_die(ctx
, isl_error_unknown
, "union sets not equal",
2881 /* Check that computing a bound of a non-zero polynomial over an unbounded
2882 * domain does not produce a rational value.
2883 * In particular, check that the upper bound is infinity.
2885 static int test_bound_unbounded_domain(isl_ctx
*ctx
)
2888 isl_pw_qpolynomial
*pwqp
;
2889 isl_pw_qpolynomial_fold
*pwf
, *pwf2
;
2892 str
= "{ [m,n] -> -m * n }";
2893 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2894 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2896 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2897 pwf2
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2898 equal
= isl_pw_qpolynomial_fold_plain_is_equal(pwf
, pwf2
);
2899 isl_pw_qpolynomial_fold_free(pwf
);
2900 isl_pw_qpolynomial_fold_free(pwf2
);
2905 isl_die(ctx
, isl_error_unknown
,
2906 "expecting infinite polynomial bound", return -1);
2911 static int test_bound(isl_ctx
*ctx
)
2915 isl_pw_qpolynomial
*pwqp
;
2916 isl_pw_qpolynomial_fold
*pwf
;
2918 if (test_bound_unbounded_domain(ctx
) < 0)
2921 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
2922 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2923 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2924 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
2925 isl_pw_qpolynomial_fold_free(pwf
);
2927 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
2930 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
2931 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2932 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2933 dim
= isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
);
2934 isl_pw_qpolynomial_fold_free(pwf
);
2936 isl_die(ctx
, isl_error_unknown
, "unexpected input dimension",
2942 static int test_lift(isl_ctx
*ctx
)
2945 isl_basic_map
*bmap
;
2946 isl_basic_set
*bset
;
2948 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
2949 bset
= isl_basic_set_read_from_str(ctx
, str
);
2950 bset
= isl_basic_set_lift(bset
);
2951 bmap
= isl_basic_map_from_range(bset
);
2952 bset
= isl_basic_map_domain(bmap
);
2953 isl_basic_set_free(bset
);
2962 } subset_tests
[] = {
2964 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
2965 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
2966 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
2968 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
2969 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
2970 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
2971 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
2972 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
2973 "256e0 <= 255i and 256e0 >= -255 + 255i and "
2974 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
2975 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
2976 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
2977 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
2978 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
2979 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
2980 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
2981 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
2982 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
2983 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
2984 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
2985 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
2986 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
2987 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
2988 "4e0 <= -57 + i0 + i1)) or "
2989 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
2990 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
2991 "4e0 >= -61 + i0 + i1)) or "
2992 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
2993 { "[a, b] -> { : a = 0 and b = -1 }", "[b, a] -> { : b >= -10 }", 1 },
2996 static int test_subset(isl_ctx
*ctx
)
2999 isl_set
*set1
, *set2
;
3002 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
3003 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
3004 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
3005 subset
= isl_set_is_subset(set1
, set2
);
3010 if (subset
!= subset_tests
[i
].subset
)
3011 isl_die(ctx
, isl_error_unknown
,
3012 "incorrect subset result", return -1);
3019 const char *minuend
;
3020 const char *subtrahend
;
3021 const char *difference
;
3022 } subtract_domain_tests
[] = {
3023 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
3024 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
3025 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
3028 static int test_subtract(isl_ctx
*ctx
)
3031 isl_union_map
*umap1
, *umap2
;
3032 isl_union_pw_multi_aff
*upma1
, *upma2
;
3033 isl_union_set
*uset
;
3036 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3037 umap1
= isl_union_map_read_from_str(ctx
,
3038 subtract_domain_tests
[i
].minuend
);
3039 uset
= isl_union_set_read_from_str(ctx
,
3040 subtract_domain_tests
[i
].subtrahend
);
3041 umap2
= isl_union_map_read_from_str(ctx
,
3042 subtract_domain_tests
[i
].difference
);
3043 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
3044 equal
= isl_union_map_is_equal(umap1
, umap2
);
3045 isl_union_map_free(umap1
);
3046 isl_union_map_free(umap2
);
3050 isl_die(ctx
, isl_error_unknown
,
3051 "incorrect subtract domain result", return -1);
3054 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
3055 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
3056 subtract_domain_tests
[i
].minuend
);
3057 uset
= isl_union_set_read_from_str(ctx
,
3058 subtract_domain_tests
[i
].subtrahend
);
3059 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
3060 subtract_domain_tests
[i
].difference
);
3061 upma1
= isl_union_pw_multi_aff_subtract_domain(upma1
, uset
);
3062 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
3063 isl_union_pw_multi_aff_free(upma1
);
3064 isl_union_pw_multi_aff_free(upma2
);
3068 isl_die(ctx
, isl_error_unknown
,
3069 "incorrect subtract domain result", return -1);
3075 /* Check that intersecting the empty basic set with another basic set
3076 * does not increase the number of constraints. In particular,
3077 * the empty basic set should maintain its canonical representation.
3079 static int test_intersect(isl_ctx
*ctx
)
3082 isl_basic_set
*bset1
, *bset2
;
3084 bset1
= isl_basic_set_read_from_str(ctx
, "{ [a,b,c] : 1 = 0 }");
3085 bset2
= isl_basic_set_read_from_str(ctx
, "{ [1,2,3] }");
3086 n1
= isl_basic_set_n_constraint(bset1
);
3087 bset1
= isl_basic_set_intersect(bset1
, bset2
);
3088 n2
= isl_basic_set_n_constraint(bset1
);
3089 isl_basic_set_free(bset1
);
3093 isl_die(ctx
, isl_error_unknown
,
3094 "number of constraints of empty set changed",
3100 int test_factorize(isl_ctx
*ctx
)
3103 isl_basic_set
*bset
;
3106 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
3107 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
3108 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
3109 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
3110 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
3111 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
3112 "3i5 >= -2i0 - i2 + 3i4 }";
3113 bset
= isl_basic_set_read_from_str(ctx
, str
);
3114 f
= isl_basic_set_factorizer(bset
);
3115 isl_basic_set_free(bset
);
3116 isl_factorizer_free(f
);
3118 isl_die(ctx
, isl_error_unknown
,
3119 "failed to construct factorizer", return -1);
3121 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
3122 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
3123 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
3124 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
3125 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
3126 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
3127 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
3128 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
3129 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
3130 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
3131 bset
= isl_basic_set_read_from_str(ctx
, str
);
3132 f
= isl_basic_set_factorizer(bset
);
3133 isl_basic_set_free(bset
);
3134 isl_factorizer_free(f
);
3136 isl_die(ctx
, isl_error_unknown
,
3137 "failed to construct factorizer", return -1);
3142 static isl_stat
check_injective(__isl_take isl_map
*map
, void *user
)
3144 int *injective
= user
;
3146 *injective
= isl_map_is_injective(map
);
3149 if (*injective
< 0 || !*injective
)
3150 return isl_stat_error
;
3155 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
3156 const char *r
, const char *s
, int tilable
, int parallel
)
3160 isl_union_map
*W
, *R
, *S
;
3161 isl_union_map
*empty
;
3162 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
3163 isl_union_map
*validity
, *proximity
, *coincidence
;
3164 isl_union_map
*schedule
;
3165 isl_union_map
*test
;
3166 isl_union_set
*delta
;
3167 isl_union_set
*domain
;
3171 isl_schedule_constraints
*sc
;
3172 isl_schedule
*sched
;
3173 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
3175 D
= isl_union_set_read_from_str(ctx
, d
);
3176 W
= isl_union_map_read_from_str(ctx
, w
);
3177 R
= isl_union_map_read_from_str(ctx
, r
);
3178 S
= isl_union_map_read_from_str(ctx
, s
);
3180 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
3181 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
3183 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
3184 isl_union_map_compute_flow(isl_union_map_copy(R
),
3185 isl_union_map_copy(W
), empty
,
3186 isl_union_map_copy(S
),
3187 &dep_raw
, NULL
, NULL
, NULL
);
3188 isl_union_map_compute_flow(isl_union_map_copy(W
),
3189 isl_union_map_copy(W
),
3190 isl_union_map_copy(R
),
3191 isl_union_map_copy(S
),
3192 &dep_waw
, &dep_war
, NULL
, NULL
);
3194 dep
= isl_union_map_union(dep_waw
, dep_war
);
3195 dep
= isl_union_map_union(dep
, dep_raw
);
3196 validity
= isl_union_map_copy(dep
);
3197 coincidence
= isl_union_map_copy(dep
);
3198 proximity
= isl_union_map_copy(dep
);
3200 sc
= isl_schedule_constraints_on_domain(isl_union_set_copy(D
));
3201 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3202 sc
= isl_schedule_constraints_set_coincidence(sc
, coincidence
);
3203 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3204 sched
= isl_schedule_constraints_compute_schedule(sc
);
3205 schedule
= isl_schedule_get_map(sched
);
3206 isl_schedule_free(sched
);
3207 isl_union_map_free(W
);
3208 isl_union_map_free(R
);
3209 isl_union_map_free(S
);
3212 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
3214 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
3215 is_complete
= isl_union_set_is_subset(D
, domain
);
3216 isl_union_set_free(D
);
3217 isl_union_set_free(domain
);
3219 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
3220 test
= isl_union_map_apply_range(test
, dep
);
3221 test
= isl_union_map_apply_range(test
, schedule
);
3223 delta
= isl_union_map_deltas(test
);
3224 if (isl_union_set_n_set(delta
) == 0) {
3228 isl_union_set_free(delta
);
3230 delta_set
= isl_set_from_union_set(delta
);
3232 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3233 for (i
= 0; i
< tilable
; ++i
)
3234 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
3235 is_tilable
= isl_set_is_subset(delta_set
, slice
);
3236 isl_set_free(slice
);
3238 slice
= isl_set_universe(isl_set_get_space(delta_set
));
3239 for (i
= 0; i
< parallel
; ++i
)
3240 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
3241 is_parallel
= isl_set_is_subset(delta_set
, slice
);
3242 isl_set_free(slice
);
3244 origin
= isl_set_universe(isl_set_get_space(delta_set
));
3245 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
3246 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
3248 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
3249 delta_set
= isl_set_lexmin(delta_set
);
3251 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
3253 isl_set_free(origin
);
3254 isl_set_free(delta_set
);
3257 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
3258 is_injection
< 0 || is_complete
< 0)
3261 isl_die(ctx
, isl_error_unknown
,
3262 "generated schedule incomplete", return -1);
3264 isl_die(ctx
, isl_error_unknown
,
3265 "generated schedule not injective on each statement",
3268 isl_die(ctx
, isl_error_unknown
,
3269 "negative dependences in generated schedule",
3272 isl_die(ctx
, isl_error_unknown
,
3273 "generated schedule not as tilable as expected",
3276 isl_die(ctx
, isl_error_unknown
,
3277 "generated schedule not as parallel as expected",
3283 /* Compute a schedule for the given instance set, validity constraints,
3284 * proximity constraints and context and return a corresponding union map
3287 static __isl_give isl_union_map
*compute_schedule_with_context(isl_ctx
*ctx
,
3288 const char *domain
, const char *validity
, const char *proximity
,
3289 const char *context
)
3294 isl_union_map
*prox
;
3295 isl_schedule_constraints
*sc
;
3296 isl_schedule
*schedule
;
3297 isl_union_map
*sched
;
3299 con
= isl_set_read_from_str(ctx
, context
);
3300 dom
= isl_union_set_read_from_str(ctx
, domain
);
3301 dep
= isl_union_map_read_from_str(ctx
, validity
);
3302 prox
= isl_union_map_read_from_str(ctx
, proximity
);
3303 sc
= isl_schedule_constraints_on_domain(dom
);
3304 sc
= isl_schedule_constraints_set_context(sc
, con
);
3305 sc
= isl_schedule_constraints_set_validity(sc
, dep
);
3306 sc
= isl_schedule_constraints_set_proximity(sc
, prox
);
3307 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3308 sched
= isl_schedule_get_map(schedule
);
3309 isl_schedule_free(schedule
);
3314 /* Compute a schedule for the given instance set, validity constraints and
3315 * proximity constraints and return a corresponding union map representation.
3317 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
3318 const char *domain
, const char *validity
, const char *proximity
)
3320 return compute_schedule_with_context(ctx
, domain
, validity
, proximity
,
3324 /* Check that a schedule can be constructed on the given domain
3325 * with the given validity and proximity constraints.
3327 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
3328 const char *validity
, const char *proximity
)
3330 isl_union_map
*sched
;
3332 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
3336 isl_union_map_free(sched
);
3340 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
3341 const char *validity
, const char *proximity
, const char *expected_sched
)
3343 isl_union_map
*sched1
, *sched2
;
3346 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
3347 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
3349 equal
= isl_union_map_is_equal(sched1
, sched2
);
3350 isl_union_map_free(sched1
);
3351 isl_union_map_free(sched2
);
3356 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
3362 /* Check that the schedule map is properly padded, even after being
3363 * reconstructed from the band forest.
3365 static int test_padded_schedule(isl_ctx
*ctx
)
3369 isl_union_map
*validity
, *proximity
;
3370 isl_schedule_constraints
*sc
;
3371 isl_schedule
*sched
;
3372 isl_union_map
*map1
, *map2
;
3373 isl_band_list
*list
;
3376 str
= "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
3377 D
= isl_union_set_read_from_str(ctx
, str
);
3378 validity
= isl_union_map_empty(isl_union_set_get_space(D
));
3379 proximity
= isl_union_map_copy(validity
);
3380 sc
= isl_schedule_constraints_on_domain(D
);
3381 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3382 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3383 sched
= isl_schedule_constraints_compute_schedule(sc
);
3384 map1
= isl_schedule_get_map(sched
);
3385 list
= isl_schedule_get_band_forest(sched
);
3386 isl_band_list_free(list
);
3387 map2
= isl_schedule_get_map(sched
);
3388 isl_schedule_free(sched
);
3389 equal
= isl_union_map_is_equal(map1
, map2
);
3390 isl_union_map_free(map1
);
3391 isl_union_map_free(map2
);
3396 isl_die(ctx
, isl_error_unknown
,
3397 "reconstructed schedule map not the same as original",
3403 /* Check that conditional validity constraints are also taken into
3404 * account across bands.
3405 * In particular, try to make sure that live ranges D[1,0]->C[2,1] and
3406 * D[2,0]->C[3,0] are not local in the outer band of the generated schedule
3407 * and then check that the adjacent order constraint C[2,1]->D[2,0]
3408 * is enforced by the rest of the schedule.
3410 static int test_special_conditional_schedule_constraints(isl_ctx
*ctx
)
3413 isl_union_set
*domain
;
3414 isl_union_map
*validity
, *proximity
, *condition
;
3415 isl_union_map
*sink
, *source
, *dep
;
3416 isl_schedule_constraints
*sc
;
3417 isl_schedule
*schedule
;
3418 isl_union_access_info
*access
;
3419 isl_union_flow
*flow
;
3422 str
= "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3423 "A[k] : k >= 1 and k <= -1 + n; "
3424 "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3425 "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }";
3426 domain
= isl_union_set_read_from_str(ctx
, str
);
3427 sc
= isl_schedule_constraints_on_domain(domain
);
3428 str
= "[n] -> { D[k, i] -> C[1 + k, k - i] : "
3429 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3430 "D[k, i] -> C[1 + k, i] : "
3431 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3432 "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; "
3433 "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }";
3434 validity
= isl_union_map_read_from_str(ctx
, str
);
3435 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
3436 str
= "[n] -> { C[k, i] -> D[k, i] : "
3437 "0 <= i <= -1 + k and k <= -1 + n }";
3438 proximity
= isl_union_map_read_from_str(ctx
, str
);
3439 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
3440 str
= "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : "
3441 "i <= -1 + k and i >= 1 and k <= -2 + n; "
3442 "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : "
3443 "k <= -1 + n and i >= 0 and i <= -2 + k }";
3444 condition
= isl_union_map_read_from_str(ctx
, str
);
3445 str
= "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : "
3446 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3447 "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : "
3448 "i >= 0 and i <= -1 + k and k <= -1 + n and "
3449 "k' <= -1 + n and k' >= k - i and k' >= 1 + k; "
3450 "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : "
3451 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3452 "[B[k, i] -> c[]] -> [A[k'] -> d[]] : "
3453 "k <= -1 + n and i >= 0 and i <= -1 + k and "
3454 "k' >= 1 and k' <= -1 + n and k' >= 1 + k }";
3455 validity
= isl_union_map_read_from_str(ctx
, str
);
3456 sc
= isl_schedule_constraints_set_conditional_validity(sc
, condition
,
3458 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3459 str
= "{ D[2,0] -> [] }";
3460 sink
= isl_union_map_read_from_str(ctx
, str
);
3461 access
= isl_union_access_info_from_sink(sink
);
3462 str
= "{ C[2,1] -> [] }";
3463 source
= isl_union_map_read_from_str(ctx
, str
);
3464 access
= isl_union_access_info_set_must_source(access
, source
);
3465 access
= isl_union_access_info_set_schedule(access
, schedule
);
3466 flow
= isl_union_access_info_compute_flow(access
);
3467 dep
= isl_union_flow_get_must_dependence(flow
);
3468 isl_union_flow_free(flow
);
3469 empty
= isl_union_map_is_empty(dep
);
3470 isl_union_map_free(dep
);
3475 isl_die(ctx
, isl_error_unknown
,
3476 "conditional validity not respected", return -1);
3481 /* Input for testing of schedule construction based on
3482 * conditional constraints.
3484 * domain is the iteration domain
3485 * flow are the flow dependences, which determine the validity and
3486 * proximity constraints
3487 * condition are the conditions on the conditional validity constraints
3488 * conditional_validity are the conditional validity constraints
3489 * outer_band_n is the expected number of members in the outer band
3494 const char *condition
;
3495 const char *conditional_validity
;
3497 } live_range_tests
[] = {
3498 /* Contrived example that illustrates that we need to keep
3499 * track of tagged condition dependences and
3500 * tagged conditional validity dependences
3501 * in isl_sched_edge separately.
3502 * In particular, the conditional validity constraints on A
3503 * cannot be satisfied,
3504 * but they can be ignored because there are no corresponding
3505 * condition constraints. However, we do have an additional
3506 * conditional validity constraint that maps to the same
3507 * dependence relation
3508 * as the condition constraint on B. If we did not make a distinction
3509 * between tagged condition and tagged conditional validity
3510 * dependences, then we
3511 * could end up treating this shared dependence as an condition
3512 * constraint on A, forcing a localization of the conditions,
3513 * which is impossible.
3515 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
3516 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
3517 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
3518 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3519 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3520 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
3523 /* TACO 2013 Fig. 7 */
3524 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3525 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3526 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3527 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
3528 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
3529 "0 <= i < n and 0 <= j < n - 1 }",
3530 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
3531 "0 <= i < n and 0 <= j < j' < n;"
3532 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
3533 "0 <= i < i' < n and 0 <= j,j' < n;"
3534 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
3535 "0 <= i,j,j' < n and j < j' }",
3538 /* TACO 2013 Fig. 7, without tags */
3539 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3540 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3541 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3542 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3543 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3544 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
3545 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
3546 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
3549 /* TACO 2013 Fig. 12 */
3550 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
3551 "S3[i,3] : 0 <= i <= 1 }",
3552 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
3553 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
3554 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
3555 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
3556 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3557 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
3558 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3559 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
3560 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
3561 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
3562 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
3567 /* Test schedule construction based on conditional constraints.
3568 * In particular, check the number of members in the outer band node
3569 * as an indication of whether tiling is possible or not.
3571 static int test_conditional_schedule_constraints(isl_ctx
*ctx
)
3574 isl_union_set
*domain
;
3575 isl_union_map
*condition
;
3576 isl_union_map
*flow
;
3577 isl_union_map
*validity
;
3578 isl_schedule_constraints
*sc
;
3579 isl_schedule
*schedule
;
3580 isl_schedule_node
*node
;
3583 if (test_special_conditional_schedule_constraints(ctx
) < 0)
3586 for (i
= 0; i
< ARRAY_SIZE(live_range_tests
); ++i
) {
3587 domain
= isl_union_set_read_from_str(ctx
,
3588 live_range_tests
[i
].domain
);
3589 flow
= isl_union_map_read_from_str(ctx
,
3590 live_range_tests
[i
].flow
);
3591 condition
= isl_union_map_read_from_str(ctx
,
3592 live_range_tests
[i
].condition
);
3593 validity
= isl_union_map_read_from_str(ctx
,
3594 live_range_tests
[i
].conditional_validity
);
3595 sc
= isl_schedule_constraints_on_domain(domain
);
3596 sc
= isl_schedule_constraints_set_validity(sc
,
3597 isl_union_map_copy(flow
));
3598 sc
= isl_schedule_constraints_set_proximity(sc
, flow
);
3599 sc
= isl_schedule_constraints_set_conditional_validity(sc
,
3600 condition
, validity
);
3601 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3602 node
= isl_schedule_get_root(schedule
);
3604 isl_schedule_node_get_type(node
) != isl_schedule_node_band
)
3605 node
= isl_schedule_node_first_child(node
);
3606 n_member
= isl_schedule_node_band_n_member(node
);
3607 isl_schedule_node_free(node
);
3608 isl_schedule_free(schedule
);
3612 if (n_member
!= live_range_tests
[i
].outer_band_n
)
3613 isl_die(ctx
, isl_error_unknown
,
3614 "unexpected number of members in outer band",
3620 /* Check that the schedule computed for the given instance set and
3621 * dependence relation strongly satisfies the dependences.
3622 * In particular, check that no instance is scheduled before
3623 * or together with an instance on which it depends.
3624 * Earlier versions of isl would produce a schedule that
3625 * only weakly satisfies the dependences.
3627 static int test_strongly_satisfying_schedule(isl_ctx
*ctx
)
3629 const char *domain
, *dep
;
3630 isl_union_map
*D
, *schedule
;
3634 domain
= "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; "
3635 "A[i0] : 0 <= i0 <= 1 }";
3636 dep
= "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; "
3637 "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }";
3638 schedule
= compute_schedule(ctx
, domain
, dep
, dep
);
3639 D
= isl_union_map_read_from_str(ctx
, dep
);
3640 D
= isl_union_map_apply_domain(D
, isl_union_map_copy(schedule
));
3641 D
= isl_union_map_apply_range(D
, schedule
);
3642 map
= isl_map_from_union_map(D
);
3643 ge
= isl_map_lex_ge(isl_space_domain(isl_map_get_space(map
)));
3644 map
= isl_map_intersect(map
, ge
);
3645 empty
= isl_map_is_empty(map
);
3651 isl_die(ctx
, isl_error_unknown
,
3652 "dependences not strongly satisfied", return -1);
3657 /* Compute a schedule for input where the instance set constraints
3658 * conflict with the context constraints.
3659 * Earlier versions of isl did not properly handle this situation.
3661 static int test_conflicting_context_schedule(isl_ctx
*ctx
)
3663 isl_union_map
*schedule
;
3664 const char *domain
, *context
;
3666 domain
= "[n] -> { A[] : n >= 0 }";
3667 context
= "[n] -> { : n < 0 }";
3668 schedule
= compute_schedule_with_context(ctx
,
3669 domain
, "{}", "{}", context
);
3670 isl_union_map_free(schedule
);
3678 /* Check that the dependence carrying step is not confused by
3679 * a bound on the coefficient size.
3680 * In particular, force the scheduler to move to a dependence carrying
3681 * step by demanding outer coincidence and bound the size of
3682 * the coefficients. Earlier versions of isl would take this
3683 * bound into account while carrying dependences, breaking
3684 * fundamental assumptions.
3685 * On the other hand, the dependence carrying step now tries
3686 * to prevent loop coalescing by default, so check that indeed
3687 * no loop coalescing occurs by comparing the computed schedule
3688 * to the expected non-coalescing schedule.
3690 static int test_bounded_coefficients_schedule(isl_ctx
*ctx
)
3692 const char *domain
, *dep
;
3695 isl_schedule_constraints
*sc
;
3696 isl_schedule
*schedule
;
3697 isl_union_map
*sched1
, *sched2
;
3700 domain
= "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }";
3701 dep
= "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and "
3703 "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }";
3704 I
= isl_union_set_read_from_str(ctx
, domain
);
3705 D
= isl_union_map_read_from_str(ctx
, dep
);
3706 sc
= isl_schedule_constraints_on_domain(I
);
3707 sc
= isl_schedule_constraints_set_validity(sc
, isl_union_map_copy(D
));
3708 sc
= isl_schedule_constraints_set_coincidence(sc
, D
);
3709 isl_options_set_schedule_outer_coincidence(ctx
, 1);
3710 isl_options_set_schedule_max_coefficient(ctx
, 20);
3711 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3712 isl_options_set_schedule_max_coefficient(ctx
, -1);
3713 isl_options_set_schedule_outer_coincidence(ctx
, 0);
3714 sched1
= isl_schedule_get_map(schedule
);
3715 isl_schedule_free(schedule
);
3717 sched2
= isl_union_map_read_from_str(ctx
, "{ C[x,y] -> [x,y] }");
3718 equal
= isl_union_map_is_equal(sched1
, sched2
);
3719 isl_union_map_free(sched1
);
3720 isl_union_map_free(sched2
);
3725 isl_die(ctx
, isl_error_unknown
,
3726 "unexpected schedule", return -1);
3731 /* Check that a set of schedule constraints that only allow for
3732 * a coalescing schedule still produces a schedule even if the user
3733 * request a non-coalescing schedule. Earlier versions of isl
3734 * would not handle this case correctly.
3736 static int test_coalescing_schedule(isl_ctx
*ctx
)
3738 const char *domain
, *dep
;
3741 isl_schedule_constraints
*sc
;
3742 isl_schedule
*schedule
;
3743 int treat_coalescing
;
3745 domain
= "{ S[a, b] : 0 <= a <= 1 and 0 <= b <= 1 }";
3746 dep
= "{ S[a, b] -> S[a + b, 1 - b] }";
3747 I
= isl_union_set_read_from_str(ctx
, domain
);
3748 D
= isl_union_map_read_from_str(ctx
, dep
);
3749 sc
= isl_schedule_constraints_on_domain(I
);
3750 sc
= isl_schedule_constraints_set_validity(sc
, D
);
3751 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
3752 isl_options_set_schedule_treat_coalescing(ctx
, 1);
3753 schedule
= isl_schedule_constraints_compute_schedule(sc
);
3754 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
3755 isl_schedule_free(schedule
);
3761 int test_schedule(isl_ctx
*ctx
)
3763 const char *D
, *W
, *R
, *V
, *P
, *S
;
3764 int max_coincidence
;
3765 int treat_coalescing
;
3767 /* Handle resulting schedule with zero bands. */
3768 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
3772 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
3773 W
= "{ S1[t,i] -> a[t,i] }";
3774 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
3775 "S1[t,i] -> a[t-1,i+1] }";
3776 S
= "{ S1[t,i] -> [t,i] }";
3777 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3780 /* Fig. 5 of CC2008 */
3781 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
3783 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
3784 "j >= 2 and j <= -1 + N }";
3785 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
3786 "j >= 2 and j <= -1 + N; "
3787 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
3788 "j >= 2 and j <= -1 + N }";
3789 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3790 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3793 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
3794 W
= "{ S1[i] -> a[i] }";
3795 R
= "{ S2[i] -> a[i+1] }";
3796 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3797 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3800 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
3801 W
= "{ S1[i] -> a[i] }";
3802 R
= "{ S2[i] -> a[9-i] }";
3803 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3804 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3807 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
3808 W
= "{ S1[i] -> a[i] }";
3809 R
= "[N] -> { S2[i] -> a[N-1-i] }";
3810 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3811 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3814 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
3815 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
3816 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
3817 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
3818 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3821 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3822 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
3823 R
= "{ S2[i,j] -> a[i-1,j] }";
3824 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3825 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3828 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3829 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
3830 R
= "{ S2[i,j] -> a[i,j-1] }";
3831 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3832 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3835 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
3836 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
3837 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
3838 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
3839 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
3840 "S_0[] -> [0, 0, 0] }";
3841 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
3843 ctx
->opt
->schedule_parametric
= 0;
3844 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3846 ctx
->opt
->schedule_parametric
= 1;
3848 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
3849 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
3850 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
3851 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
3852 "S4[i] -> a[i,N] }";
3853 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
3854 "S4[i] -> [4,i,0] }";
3855 max_coincidence
= isl_options_get_schedule_maximize_coincidence(ctx
);
3856 isl_options_set_schedule_maximize_coincidence(ctx
, 0);
3857 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3859 isl_options_set_schedule_maximize_coincidence(ctx
, max_coincidence
);
3861 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
3862 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3864 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3866 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
3868 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3869 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3872 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
3873 " S_2[t] : t >= 0 and t <= -1 + N; "
3874 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
3876 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
3877 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
3878 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
3879 "i >= 0 and i <= -1 + N }";
3880 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
3881 "i >= 0 and i <= -1 + N; "
3882 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
3883 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
3884 " S_0[t] -> [0, t, 0] }";
3886 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3888 ctx
->opt
->schedule_parametric
= 0;
3889 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3891 ctx
->opt
->schedule_parametric
= 1;
3893 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
3894 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
3895 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
3898 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
3899 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
3900 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
3901 "j >= 0 and j <= -1 + N; "
3902 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3903 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
3904 "j >= 0 and j <= -1 + N; "
3905 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3906 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
3907 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3910 D
= "{ S_0[i] : i >= 0 }";
3911 W
= "{ S_0[i] -> a[i] : i >= 0 }";
3912 R
= "{ S_0[i] -> a[0] : i >= 0 }";
3913 S
= "{ S_0[i] -> [0, i, 0] }";
3914 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3917 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
3918 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
3919 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
3920 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
3921 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3924 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
3925 "k <= -1 + n and k >= 0 }";
3926 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
3927 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
3928 "k <= -1 + n and k >= 0; "
3929 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
3930 "k <= -1 + n and k >= 0; "
3931 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
3932 "k <= -1 + n and k >= 0 }";
3933 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
3934 ctx
->opt
->schedule_outer_coincidence
= 1;
3935 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3937 ctx
->opt
->schedule_outer_coincidence
= 0;
3939 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
3940 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
3941 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
3942 "Stmt_for_body24[i0, i1, 1, 0]:"
3943 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
3944 "Stmt_for_body7[i0, i1, i2]:"
3945 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
3948 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
3949 "Stmt_for_body24[1, i1, i2, i3]:"
3950 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
3952 "Stmt_for_body24[0, i1, i2, i3] -> "
3953 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
3954 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
3956 "Stmt_for_body24[0, i1, i2, i3] ->"
3957 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
3958 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
3959 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
3960 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
3961 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
3962 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
3963 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
3964 "i1 <= 6 and i1 >= 0;"
3965 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
3966 "Stmt_for_body7[i0, i1, i2] -> "
3967 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
3968 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
3969 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
3970 "Stmt_for_body7[i0, i1, i2] -> "
3971 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
3972 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
3973 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
3975 S
= "{ Stmt_for_body24[i0, i1, i2, i3] -> "
3976 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
3977 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
3979 treat_coalescing
= isl_options_get_schedule_treat_coalescing(ctx
);
3980 isl_options_set_schedule_treat_coalescing(ctx
, 0);
3981 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3983 isl_options_set_schedule_treat_coalescing(ctx
, treat_coalescing
);
3985 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
3986 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
3987 "j >= 1 and j <= 7;"
3988 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
3989 "j >= 1 and j <= 8 }";
3991 S
= "{ S_0[i, j] -> [i + j, j] }";
3992 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3993 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3995 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3997 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
3998 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
3999 "j >= 0 and j <= -1 + i }";
4000 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
4001 "i <= -1 + N and j >= 0;"
4002 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
4005 S
= "{ S_0[i, j] -> [i, j] }";
4006 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4007 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4009 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4011 /* Test both algorithms on a case with only proximity dependences. */
4012 D
= "{ S[i,j] : 0 <= i <= 10 }";
4014 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
4015 S
= "{ S[i, j] -> [j, i] }";
4016 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4017 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4019 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4020 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
4023 D
= "{ A[a]; B[] }";
4025 P
= "{ A[a] -> B[] }";
4026 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4029 if (test_padded_schedule(ctx
) < 0)
4032 /* Check that check for progress is not confused by rational
4035 D
= "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
4036 V
= "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
4038 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
4039 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
4041 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4042 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4044 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4046 /* Check that we allow schedule rows that are only non-trivial
4047 * on some full-dimensional domains.
4049 D
= "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
4050 V
= "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
4051 "S1[j] -> S2[1] : 0 <= j <= 1 }";
4053 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
4054 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
4056 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
4058 if (test_conditional_schedule_constraints(ctx
) < 0)
4061 if (test_strongly_satisfying_schedule(ctx
) < 0)
4064 if (test_conflicting_context_schedule(ctx
) < 0)
4067 if (test_bounded_coefficients_schedule(ctx
) < 0)
4069 if (test_coalescing_schedule(ctx
) < 0)
4075 /* Perform scheduling tests using the whole component scheduler.
4077 static int test_schedule_whole(isl_ctx
*ctx
)
4082 whole
= isl_options_get_schedule_whole_component(ctx
);
4083 isl_options_set_schedule_whole_component(ctx
, 1);
4084 r
= test_schedule(ctx
);
4085 isl_options_set_schedule_whole_component(ctx
, whole
);
4090 /* Perform scheduling tests using the incremental scheduler.
4092 static int test_schedule_incremental(isl_ctx
*ctx
)
4097 whole
= isl_options_get_schedule_whole_component(ctx
);
4098 isl_options_set_schedule_whole_component(ctx
, 0);
4099 r
= test_schedule(ctx
);
4100 isl_options_set_schedule_whole_component(ctx
, whole
);
4105 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
4107 isl_union_map
*umap
;
4110 umap
= isl_union_map_read_from_str(ctx
, str
);
4111 test
= isl_union_map_plain_is_injective(umap
);
4112 isl_union_map_free(umap
);
4115 if (test
== injective
)
4118 isl_die(ctx
, isl_error_unknown
,
4119 "map not detected as injective", return -1);
4121 isl_die(ctx
, isl_error_unknown
,
4122 "map detected as injective", return -1);
4125 int test_injective(isl_ctx
*ctx
)
4129 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
4131 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
4133 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
4135 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
4137 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
4139 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
4141 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
4143 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
4146 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
4147 if (test_plain_injective(ctx
, str
, 1))
4149 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
4150 if (test_plain_injective(ctx
, str
, 0))
4156 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
4164 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
4165 equal
= isl_aff_plain_is_equal(aff
, aff2
);
4171 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
4175 equal
= aff_plain_is_equal(aff
, str
);
4179 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
4180 "result not as expected", return -1);
4185 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4186 __isl_take isl_aff
*aff2
);
4188 ['+'] = { &isl_aff_add
},
4189 ['-'] = { &isl_aff_sub
},
4190 ['*'] = { &isl_aff_mul
},
4191 ['/'] = { &isl_aff_div
},
4199 } aff_bin_tests
[] = {
4200 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
4201 "{ [i] -> [2i] }" },
4202 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
4204 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
4205 "{ [i] -> [2i] }" },
4206 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
4207 "{ [i] -> [2i] }" },
4208 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
4209 "{ [i] -> [i/2] }" },
4210 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
4212 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
4213 "{ [i] -> [NaN] }" },
4214 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
4215 "{ [i] -> [NaN] }" },
4216 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
4217 "{ [i] -> [NaN] }" },
4218 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
4219 "{ [i] -> [NaN] }" },
4220 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
4221 "{ [i] -> [NaN] }" },
4222 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
4223 "{ [i] -> [NaN] }" },
4224 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
4225 "{ [i] -> [NaN] }" },
4226 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
4227 "{ [i] -> [NaN] }" },
4228 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
4229 "{ [i] -> [NaN] }" },
4230 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
4231 "{ [i] -> [NaN] }" },
4232 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
4233 "{ [i] -> [NaN] }" },
4234 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
4235 "{ [i] -> [NaN] }" },
4238 /* Perform some basic tests of binary operations on isl_aff objects.
4240 static int test_bin_aff(isl_ctx
*ctx
)
4243 isl_aff
*aff1
, *aff2
, *res
;
4244 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
4245 __isl_take isl_aff
*aff2
);
4248 for (i
= 0; i
< ARRAY_SIZE(aff_bin_tests
); ++i
) {
4249 aff1
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg1
);
4250 aff2
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg2
);
4251 res
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].res
);
4252 fn
= aff_bin_op
[aff_bin_tests
[i
].op
].fn
;
4253 aff1
= fn(aff1
, aff2
);
4254 if (isl_aff_is_nan(res
))
4255 ok
= isl_aff_is_nan(aff1
);
4257 ok
= isl_aff_plain_is_equal(aff1
, res
);
4263 isl_die(ctx
, isl_error_unknown
,
4264 "unexpected result", return -1);
4271 __isl_give isl_union_pw_multi_aff
*(*fn
)(
4272 __isl_take isl_union_pw_multi_aff
*upma1
,
4273 __isl_take isl_union_pw_multi_aff
*upma2
);
4277 } upma_bin_tests
[] = {
4278 { &isl_union_pw_multi_aff_add
, "{ A[] -> [0]; B[0] -> [1] }",
4279 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
4280 { &isl_union_pw_multi_aff_union_add
, "{ A[] -> [0]; B[0] -> [1] }",
4281 "{ B[x] -> [2] : x >= 0 }",
4282 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
4283 { &isl_union_pw_multi_aff_pullback_union_pw_multi_aff
,
4284 "{ A[] -> B[0]; C[x] -> B[1] : x < 10; C[y] -> B[2] : y >= 10 }",
4285 "{ D[i] -> A[] : i < 0; D[i] -> C[i + 5] : i >= 0 }",
4286 "{ D[i] -> B[0] : i < 0; D[i] -> B[1] : 0 <= i < 5; "
4287 "D[i] -> B[2] : i >= 5 }" },
4288 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4289 "{ B[x] -> C[2] : x > 0 }",
4290 "{ B[x] -> A[1] : x <= 0; B[x] -> C[2] : x > 0 }" },
4291 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4292 "{ B[x] -> A[2] : x >= 0 }",
4293 "{ B[x] -> A[1] : x < 0; B[x] -> A[2] : x > 0; B[0] -> A[3] }" },
4296 /* Perform some basic tests of binary operations on
4297 * isl_union_pw_multi_aff objects.
4299 static int test_bin_upma(isl_ctx
*ctx
)
4302 isl_union_pw_multi_aff
*upma1
, *upma2
, *res
;
4305 for (i
= 0; i
< ARRAY_SIZE(upma_bin_tests
); ++i
) {
4306 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
4307 upma_bin_tests
[i
].arg1
);
4308 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
4309 upma_bin_tests
[i
].arg2
);
4310 res
= isl_union_pw_multi_aff_read_from_str(ctx
,
4311 upma_bin_tests
[i
].res
);
4312 upma1
= upma_bin_tests
[i
].fn(upma1
, upma2
);
4313 ok
= isl_union_pw_multi_aff_plain_is_equal(upma1
, res
);
4314 isl_union_pw_multi_aff_free(upma1
);
4315 isl_union_pw_multi_aff_free(res
);
4319 isl_die(ctx
, isl_error_unknown
,
4320 "unexpected result", return -1);
4327 __isl_give isl_union_pw_multi_aff
*(*fn
)(
4328 __isl_take isl_union_pw_multi_aff
*upma1
,
4329 __isl_take isl_union_pw_multi_aff
*upma2
);
4332 } upma_bin_fail_tests
[] = {
4333 { &isl_union_pw_multi_aff_union_add
, "{ B[x] -> A[1] : x <= 0 }",
4334 "{ B[x] -> C[2] : x >= 0 }" },
4337 /* Perform some basic tests of binary operations on
4338 * isl_union_pw_multi_aff objects that are expected to fail.
4340 static int test_bin_upma_fail(isl_ctx
*ctx
)
4343 isl_union_pw_multi_aff
*upma1
, *upma2
;
4346 on_error
= isl_options_get_on_error(ctx
);
4347 isl_options_set_on_error(ctx
, ISL_ON_ERROR_CONTINUE
);
4348 n
= ARRAY_SIZE(upma_bin_fail_tests
);
4349 for (i
= 0; i
< n
; ++i
) {
4350 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
4351 upma_bin_fail_tests
[i
].arg1
);
4352 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
4353 upma_bin_fail_tests
[i
].arg2
);
4354 upma1
= upma_bin_fail_tests
[i
].fn(upma1
, upma2
);
4355 isl_union_pw_multi_aff_free(upma1
);
4359 isl_options_set_on_error(ctx
, on_error
);
4361 isl_die(ctx
, isl_error_unknown
,
4362 "operation not expected to succeed", return -1);
4367 int test_aff(isl_ctx
*ctx
)
4372 isl_local_space
*ls
;
4376 if (test_bin_aff(ctx
) < 0)
4378 if (test_bin_upma(ctx
) < 0)
4380 if (test_bin_upma_fail(ctx
) < 0)
4383 space
= isl_space_set_alloc(ctx
, 0, 1);
4384 ls
= isl_local_space_from_space(space
);
4385 aff
= isl_aff_zero_on_domain(ls
);
4387 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4388 aff
= isl_aff_scale_down_ui(aff
, 3);
4389 aff
= isl_aff_floor(aff
);
4390 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4391 aff
= isl_aff_scale_down_ui(aff
, 2);
4392 aff
= isl_aff_floor(aff
);
4393 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
4396 set
= isl_set_read_from_str(ctx
, str
);
4397 aff
= isl_aff_gist(aff
, set
);
4399 aff
= isl_aff_add_constant_si(aff
, -16);
4400 zero
= isl_aff_plain_is_zero(aff
);
4406 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4408 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
4409 aff
= isl_aff_scale_down_ui(aff
, 64);
4410 aff
= isl_aff_floor(aff
);
4411 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
4419 int test_dim_max(isl_ctx
*ctx
)
4423 isl_set
*set1
, *set2
;
4428 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
4429 set
= isl_set_read_from_str(ctx
, str
);
4430 pwaff
= isl_set_dim_max(set
, 0);
4431 set1
= isl_set_from_pw_aff(pwaff
);
4432 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
4433 set2
= isl_set_read_from_str(ctx
, str
);
4434 equal
= isl_set_is_equal(set1
, set2
);
4440 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4442 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
4443 set
= isl_set_read_from_str(ctx
, str
);
4444 pwaff
= isl_set_dim_max(set
, 0);
4445 set1
= isl_set_from_pw_aff(pwaff
);
4446 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4447 set2
= isl_set_read_from_str(ctx
, str
);
4448 equal
= isl_set_is_equal(set1
, set2
);
4454 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4456 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
4457 set
= isl_set_read_from_str(ctx
, str
);
4458 pwaff
= isl_set_dim_max(set
, 0);
4459 set1
= isl_set_from_pw_aff(pwaff
);
4460 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4461 set2
= isl_set_read_from_str(ctx
, str
);
4462 equal
= isl_set_is_equal(set1
, set2
);
4468 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4470 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
4471 "0 <= i < N and 0 <= j < M }";
4472 map
= isl_map_read_from_str(ctx
, str
);
4473 set
= isl_map_range(map
);
4475 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
4476 set1
= isl_set_from_pw_aff(pwaff
);
4477 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
4478 set2
= isl_set_read_from_str(ctx
, str
);
4479 equal
= isl_set_is_equal(set1
, set2
);
4483 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
4484 set1
= isl_set_from_pw_aff(pwaff
);
4485 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
4486 set2
= isl_set_read_from_str(ctx
, str
);
4487 if (equal
>= 0 && equal
)
4488 equal
= isl_set_is_equal(set1
, set2
);
4497 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4499 /* Check that solutions are properly merged. */
4500 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
4501 "c <= -1 + n - 4a - 2b and c >= -2b and "
4502 "4a >= -4 + n and c >= 0 }";
4503 set
= isl_set_read_from_str(ctx
, str
);
4504 pwaff
= isl_set_dim_min(set
, 2);
4505 set1
= isl_set_from_pw_aff(pwaff
);
4506 str
= "[n] -> { [(0)] : n >= 1 }";
4507 set2
= isl_set_read_from_str(ctx
, str
);
4508 equal
= isl_set_is_equal(set1
, set2
);
4515 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4517 /* Check that empty solution lie in the right space. */
4518 str
= "[n] -> { [t,a] : 1 = 0 }";
4519 set
= isl_set_read_from_str(ctx
, str
);
4520 pwaff
= isl_set_dim_max(set
, 0);
4521 set1
= isl_set_from_pw_aff(pwaff
);
4522 str
= "[n] -> { [t] : 1 = 0 }";
4523 set2
= isl_set_read_from_str(ctx
, str
);
4524 equal
= isl_set_is_equal(set1
, set2
);
4531 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4536 /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
4538 static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff
*pma
,
4542 isl_pw_multi_aff
*pma2
;
4548 ctx
= isl_pw_multi_aff_get_ctx(pma
);
4549 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4550 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma2
);
4551 isl_pw_multi_aff_free(pma2
);
4556 /* Check that "pma" is obviously equal to the isl_pw_multi_aff
4557 * represented by "str".
4559 static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff
*pma
,
4564 equal
= pw_multi_aff_plain_is_equal(pma
, str
);
4568 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_unknown
,
4569 "result not as expected", return -1);
4573 /* Basic test for isl_pw_multi_aff_product.
4575 * Check that multiple pieces are properly handled.
4577 static int test_product_pma(isl_ctx
*ctx
)
4581 isl_pw_multi_aff
*pma1
, *pma2
;
4583 str
= "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
4584 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4585 str
= "{ C[] -> D[] }";
4586 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4587 pma1
= isl_pw_multi_aff_product(pma1
, pma2
);
4588 str
= "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
4589 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
4590 equal
= pw_multi_aff_check_plain_equal(pma1
, str
);
4591 isl_pw_multi_aff_free(pma1
);
4598 int test_product(isl_ctx
*ctx
)
4602 isl_union_set
*uset1
, *uset2
;
4606 set
= isl_set_read_from_str(ctx
, str
);
4607 set
= isl_set_product(set
, isl_set_copy(set
));
4608 ok
= isl_set_is_wrapping(set
);
4613 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4616 uset1
= isl_union_set_read_from_str(ctx
, str
);
4617 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
4618 str
= "{ [[] -> []] }";
4619 uset2
= isl_union_set_read_from_str(ctx
, str
);
4620 ok
= isl_union_set_is_equal(uset1
, uset2
);
4621 isl_union_set_free(uset1
);
4622 isl_union_set_free(uset2
);
4626 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4628 if (test_product_pma(ctx
) < 0)
4634 /* Check that two sets are not considered disjoint just because
4635 * they have a different set of (named) parameters.
4637 static int test_disjoint(isl_ctx
*ctx
)
4640 isl_set
*set
, *set2
;
4643 str
= "[n] -> { [[]->[]] }";
4644 set
= isl_set_read_from_str(ctx
, str
);
4645 str
= "{ [[]->[]] }";
4646 set2
= isl_set_read_from_str(ctx
, str
);
4647 disjoint
= isl_set_is_disjoint(set
, set2
);
4653 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4658 int test_equal(isl_ctx
*ctx
)
4661 isl_set
*set
, *set2
;
4665 set
= isl_set_read_from_str(ctx
, str
);
4667 set2
= isl_set_read_from_str(ctx
, str
);
4668 equal
= isl_set_is_equal(set
, set2
);
4674 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4679 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
4680 enum isl_dim_type type
, unsigned pos
, int fixed
)
4684 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
4691 isl_die(ctx
, isl_error_unknown
,
4692 "map not detected as fixed", return -1);
4694 isl_die(ctx
, isl_error_unknown
,
4695 "map detected as fixed", return -1);
4698 int test_fixed(isl_ctx
*ctx
)
4703 str
= "{ [i] -> [i] }";
4704 map
= isl_map_read_from_str(ctx
, str
);
4705 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
4707 str
= "{ [i] -> [1] }";
4708 map
= isl_map_read_from_str(ctx
, str
);
4709 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4711 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
4712 map
= isl_map_read_from_str(ctx
, str
);
4713 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4715 map
= isl_map_read_from_str(ctx
, str
);
4716 map
= isl_map_neg(map
);
4717 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
4723 struct isl_vertices_test_data
{
4726 const char *vertex
[2];
4727 } vertices_tests
[] = {
4728 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
4729 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
4730 { "{ A[t, i] : t = 14 and i = 1 }",
4731 1, { "{ A[14, 1] }" } },
4734 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
4736 static isl_stat
find_vertex(__isl_take isl_vertex
*vertex
, void *user
)
4738 struct isl_vertices_test_data
*data
= user
;
4741 isl_basic_set
*bset
;
4742 isl_pw_multi_aff
*pma
;
4746 ctx
= isl_vertex_get_ctx(vertex
);
4747 bset
= isl_vertex_get_domain(vertex
);
4748 ma
= isl_vertex_get_expr(vertex
);
4749 pma
= isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset
), ma
);
4751 for (i
= 0; i
< data
->n
; ++i
) {
4752 isl_pw_multi_aff
*pma_i
;
4754 pma_i
= isl_pw_multi_aff_read_from_str(ctx
, data
->vertex
[i
]);
4755 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma_i
);
4756 isl_pw_multi_aff_free(pma_i
);
4758 if (equal
< 0 || equal
)
4762 isl_pw_multi_aff_free(pma
);
4763 isl_vertex_free(vertex
);
4766 return isl_stat_error
;
4768 return equal
? isl_stat_ok
: isl_stat_error
;
4771 int test_vertices(isl_ctx
*ctx
)
4775 for (i
= 0; i
< ARRAY_SIZE(vertices_tests
); ++i
) {
4776 isl_basic_set
*bset
;
4777 isl_vertices
*vertices
;
4781 bset
= isl_basic_set_read_from_str(ctx
, vertices_tests
[i
].set
);
4782 vertices
= isl_basic_set_compute_vertices(bset
);
4783 n
= isl_vertices_get_n_vertices(vertices
);
4784 if (vertices_tests
[i
].n
!= n
)
4786 if (isl_vertices_foreach_vertex(vertices
, &find_vertex
,
4787 &vertices_tests
[i
]) < 0)
4789 isl_vertices_free(vertices
);
4790 isl_basic_set_free(bset
);
4795 isl_die(ctx
, isl_error_unknown
, "unexpected vertices",
4802 int test_union_pw(isl_ctx
*ctx
)
4806 isl_union_set
*uset
;
4807 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
4809 str
= "{ [x] -> x^2 }";
4810 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
4811 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
4812 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
4813 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
4814 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
4815 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
4816 isl_union_pw_qpolynomial_free(upwqp1
);
4817 isl_union_pw_qpolynomial_free(upwqp2
);
4821 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4826 /* Test that isl_union_pw_qpolynomial_eval picks up the function
4827 * defined over the correct domain space.
4829 static int test_eval(isl_ctx
*ctx
)
4834 isl_union_pw_qpolynomial
*upwqp
;
4838 str
= "{ A[x] -> x^2; B[x] -> -x^2 }";
4839 upwqp
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
4841 set
= isl_set_read_from_str(ctx
, str
);
4842 pnt
= isl_set_sample_point(set
);
4843 v
= isl_union_pw_qpolynomial_eval(upwqp
, pnt
);
4844 cmp
= isl_val_cmp_si(v
, 36);
4850 isl_die(ctx
, isl_error_unknown
, "unexpected value", return -1);
4855 /* Descriptions of sets that are tested for reparsing after printing.
4857 const char *output_tests
[] = {
4858 "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }",
4861 /* Check that printing a set and reparsing a set from the printed output
4862 * results in the same set.
4864 static int test_output_set(isl_ctx
*ctx
)
4868 isl_set
*set1
, *set2
;
4871 for (i
= 0; i
< ARRAY_SIZE(output_tests
); ++i
) {
4872 set1
= isl_set_read_from_str(ctx
, output_tests
[i
]);
4873 str
= isl_set_to_str(set1
);
4874 set2
= isl_set_read_from_str(ctx
, str
);
4876 equal
= isl_set_is_equal(set1
, set2
);
4882 isl_die(ctx
, isl_error_unknown
,
4883 "parsed output not the same", return -1);
4889 int test_output(isl_ctx
*ctx
)
4897 if (test_output_set(ctx
) < 0)
4900 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
4901 pa
= isl_pw_aff_read_from_str(ctx
, str
);
4903 p
= isl_printer_to_str(ctx
);
4904 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
4905 p
= isl_printer_print_pw_aff(p
, pa
);
4906 s
= isl_printer_get_str(p
);
4907 isl_printer_free(p
);
4908 isl_pw_aff_free(pa
);
4912 equal
= !strcmp(s
, "4 * floord(x, 4) + 2 >= x ? 1 : 2");
4917 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
4922 int test_sample(isl_ctx
*ctx
)
4925 isl_basic_set
*bset1
, *bset2
;
4928 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
4929 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
4930 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
4931 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
4932 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
4933 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
4934 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
4935 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
4936 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
4937 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
4938 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
4939 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
4940 "d - 1073741821e and "
4941 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
4942 "3j >= 1 - a + b + 2e and "
4943 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
4944 "3i <= 4 - a + 4b - e and "
4945 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
4946 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
4947 "c <= -1 + a and 3i >= -2 - a + 3e and "
4948 "1073741822e <= 1073741823 - a + 1073741822b + c and "
4949 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
4950 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
4951 "1073741823e >= 1 + 1073741823b - d and "
4952 "3i >= 1073741823b + c - 1073741823e - f and "
4953 "3i >= 1 + 2b + e + 3g }";
4954 bset1
= isl_basic_set_read_from_str(ctx
, str
);
4955 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
4956 empty
= isl_basic_set_is_empty(bset2
);
4957 subset
= isl_basic_set_is_subset(bset2
, bset1
);
4958 isl_basic_set_free(bset1
);
4959 isl_basic_set_free(bset2
);
4960 if (empty
< 0 || subset
< 0)
4963 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
4965 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
4970 int test_fixed_power(isl_ctx
*ctx
)
4978 str
= "{ [i] -> [i + 1] }";
4979 map
= isl_map_read_from_str(ctx
, str
);
4980 isl_int_set_si(exp
, 23);
4981 map
= isl_map_fixed_power(map
, exp
);
4982 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
4991 int test_slice(isl_ctx
*ctx
)
4997 str
= "{ [i] -> [j] }";
4998 map
= isl_map_read_from_str(ctx
, str
);
4999 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5000 equal
= map_check_equal(map
, "{ [i] -> [i] }");
5005 str
= "{ [i] -> [j] }";
5006 map
= isl_map_read_from_str(ctx
, str
);
5007 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5008 equal
= map_check_equal(map
, "{ [i] -> [j] }");
5013 str
= "{ [i] -> [j] }";
5014 map
= isl_map_read_from_str(ctx
, str
);
5015 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5016 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
5021 str
= "{ [i] -> [j] }";
5022 map
= isl_map_read_from_str(ctx
, str
);
5023 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5024 equal
= map_check_equal(map
, "{ [0] -> [j] }");
5029 str
= "{ [i] -> [j] }";
5030 map
= isl_map_read_from_str(ctx
, str
);
5031 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
5032 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
5037 str
= "{ [i] -> [j] }";
5038 map
= isl_map_read_from_str(ctx
, str
);
5039 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
5040 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
5048 int test_eliminate(isl_ctx
*ctx
)
5054 str
= "{ [i] -> [j] : i = 2j }";
5055 map
= isl_map_read_from_str(ctx
, str
);
5056 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
5057 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
5065 /* Check that isl_set_dim_residue_class detects that the values of j
5066 * in the set below are all odd and that it does not detect any spurious
5069 static int test_residue_class(isl_ctx
*ctx
)
5076 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
5077 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
5078 set
= isl_set_read_from_str(ctx
, str
);
5081 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
5083 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
5084 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
5093 int test_align_parameters(isl_ctx
*ctx
)
5097 isl_multi_aff
*ma1
, *ma2
;
5100 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
5101 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
5103 space
= isl_space_params_alloc(ctx
, 1);
5104 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
5105 ma1
= isl_multi_aff_align_params(ma1
, space
);
5107 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
5108 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
5110 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
5112 isl_multi_aff_free(ma1
);
5113 isl_multi_aff_free(ma2
);
5118 isl_die(ctx
, isl_error_unknown
,
5119 "result not as expected", return -1);
5124 static int test_list(isl_ctx
*ctx
)
5126 isl_id
*a
, *b
, *c
, *d
, *id
;
5130 a
= isl_id_alloc(ctx
, "a", NULL
);
5131 b
= isl_id_alloc(ctx
, "b", NULL
);
5132 c
= isl_id_alloc(ctx
, "c", NULL
);
5133 d
= isl_id_alloc(ctx
, "d", NULL
);
5135 list
= isl_id_list_alloc(ctx
, 4);
5136 list
= isl_id_list_add(list
, a
);
5137 list
= isl_id_list_add(list
, b
);
5138 list
= isl_id_list_add(list
, c
);
5139 list
= isl_id_list_add(list
, d
);
5140 list
= isl_id_list_drop(list
, 1, 1);
5142 if (isl_id_list_n_id(list
) != 3) {
5143 isl_id_list_free(list
);
5144 isl_die(ctx
, isl_error_unknown
,
5145 "unexpected number of elements in list", return -1);
5148 id
= isl_id_list_get_id(list
, 0);
5151 id
= isl_id_list_get_id(list
, 1);
5154 id
= isl_id_list_get_id(list
, 2);
5158 isl_id_list_free(list
);
5161 isl_die(ctx
, isl_error_unknown
,
5162 "unexpected elements in list", return -1);
5167 const char *set_conversion_tests
[] = {
5168 "[N] -> { [i] : N - 1 <= 2 i <= N }",
5169 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
5170 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5171 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5172 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
5173 "[a, b] -> { [c, d] : (4*floor((-a + c)/4) = -a + c and "
5174 "32*floor((-b + d)/32) = -b + d and 5 <= c <= 8 and "
5175 "-3 + c <= d <= 28 + c) }",
5178 /* Check that converting from isl_set to isl_pw_multi_aff and back
5179 * to isl_set produces the original isl_set.
5181 static int test_set_conversion(isl_ctx
*ctx
)
5185 isl_set
*set1
, *set2
;
5186 isl_pw_multi_aff
*pma
;
5189 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
5190 str
= set_conversion_tests
[i
];
5191 set1
= isl_set_read_from_str(ctx
, str
);
5192 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
5193 set2
= isl_set_from_pw_multi_aff(pma
);
5194 equal
= isl_set_is_equal(set1
, set2
);
5201 isl_die(ctx
, isl_error_unknown
, "bad conversion",
5208 const char *conversion_tests
[] = {
5209 "{ [a, b, c, d] -> s0[a, b, e, f] : "
5210 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
5211 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
5212 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
5214 "{ [a, b] -> [c] : exists (e0 = floor((-a - b + c)/5): "
5215 "5e0 = -a - b + c and c >= -a and c <= 4 - a) }",
5216 "{ [a, b] -> [c] : exists d : 18 * d = -3 - a + 2c and 1 <= c <= 3 }",
5219 /* Check that converting from isl_map to isl_pw_multi_aff and back
5220 * to isl_map produces the original isl_map.
5222 static int test_map_conversion(isl_ctx
*ctx
)
5225 isl_map
*map1
, *map2
;
5226 isl_pw_multi_aff
*pma
;
5229 for (i
= 0; i
< ARRAY_SIZE(conversion_tests
); ++i
) {
5230 map1
= isl_map_read_from_str(ctx
, conversion_tests
[i
]);
5231 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
5232 map2
= isl_map_from_pw_multi_aff(pma
);
5233 equal
= isl_map_is_equal(map1
, map2
);
5240 isl_die(ctx
, isl_error_unknown
, "bad conversion",
5247 static int test_conversion(isl_ctx
*ctx
)
5249 if (test_set_conversion(ctx
) < 0)
5251 if (test_map_conversion(ctx
) < 0)
5256 /* Check that isl_basic_map_curry does not modify input.
5258 static int test_curry(isl_ctx
*ctx
)
5261 isl_basic_map
*bmap1
, *bmap2
;
5264 str
= "{ [A[] -> B[]] -> C[] }";
5265 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
5266 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
5267 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
5268 isl_basic_map_free(bmap1
);
5269 isl_basic_map_free(bmap2
);
5274 isl_die(ctx
, isl_error_unknown
,
5275 "curried map should not be equal to original",
5285 } preimage_tests
[] = {
5286 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
5287 "{ A[j,i] -> B[i,j] }",
5288 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
5289 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5290 "{ A[a,b] -> B[a/2,b/6] }",
5291 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
5292 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5293 "{ A[a,b] -> B[a/2,b/6] }",
5294 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
5295 "exists i,j : a = 2 i and b = 6 j }" },
5296 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
5297 "[n] -> { : 0 <= n <= 100 }" },
5298 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5299 "{ A[a] -> B[2a] }",
5300 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
5301 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5302 "{ A[a] -> B[([a/2])] }",
5303 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
5304 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
5305 "{ A[a] -> B[a,a,a/3] }",
5306 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
5307 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
5308 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
5311 static int test_preimage_basic_set(isl_ctx
*ctx
)
5314 isl_basic_set
*bset1
, *bset2
;
5318 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
5319 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
5320 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
5321 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
5322 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
5323 equal
= isl_basic_set_is_equal(bset1
, bset2
);
5324 isl_basic_set_free(bset1
);
5325 isl_basic_set_free(bset2
);
5329 isl_die(ctx
, isl_error_unknown
, "bad preimage",
5340 } preimage_domain_tests
[] = {
5341 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
5342 "{ A[j,i] -> B[i,j] }",
5343 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
5344 { "{ B[i] -> C[i]; D[i] -> E[i] }",
5345 "{ A[i] -> B[i + 1] }",
5346 "{ A[i] -> C[i + 1] }" },
5347 { "{ B[i] -> C[i]; B[i] -> E[i] }",
5348 "{ A[i] -> B[i + 1] }",
5349 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
5350 { "{ B[i] -> C[([i/2])] }",
5351 "{ A[i] -> B[2i] }",
5352 "{ A[i] -> C[i] }" },
5353 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
5354 "{ A[i] -> B[([i/5]), ([i/7])] }",
5355 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
5356 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
5357 "[N] -> { A[] -> B[([N/5])] }",
5358 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
5359 { "{ B[i] -> C[i] : exists a : i = 5 a }",
5360 "{ A[i] -> B[2i] }",
5361 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
5362 { "{ B[i] -> C[i] : exists a : i = 2 a; "
5363 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
5364 "{ A[i] -> B[2i] }",
5365 "{ A[i] -> C[2i] }" },
5366 { "{ A[i] -> B[i] }", "{ C[i] -> A[(i + floor(i/3))/2] }",
5367 "{ C[i] -> B[j] : 2j = i + floor(i/3) }" },
5370 static int test_preimage_union_map(isl_ctx
*ctx
)
5373 isl_union_map
*umap1
, *umap2
;
5377 for (i
= 0; i
< ARRAY_SIZE(preimage_domain_tests
); ++i
) {
5378 umap1
= isl_union_map_read_from_str(ctx
,
5379 preimage_domain_tests
[i
].map
);
5380 ma
= isl_multi_aff_read_from_str(ctx
,
5381 preimage_domain_tests
[i
].ma
);
5382 umap2
= isl_union_map_read_from_str(ctx
,
5383 preimage_domain_tests
[i
].res
);
5384 umap1
= isl_union_map_preimage_domain_multi_aff(umap1
, ma
);
5385 equal
= isl_union_map_is_equal(umap1
, umap2
);
5386 isl_union_map_free(umap1
);
5387 isl_union_map_free(umap2
);
5391 isl_die(ctx
, isl_error_unknown
, "bad preimage",
5398 static int test_preimage(isl_ctx
*ctx
)
5400 if (test_preimage_basic_set(ctx
) < 0)
5402 if (test_preimage_union_map(ctx
) < 0)
5412 } pullback_tests
[] = {
5413 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
5414 "{ A[a,b] -> C[b + 2a] }" },
5415 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
5416 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
5417 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
5418 "{ A[a] -> C[(a)/6] }" },
5419 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
5420 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
5421 "{ A[a] -> C[(2a)/3] }" },
5422 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
5423 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
5424 "{ A[i,j] -> C[i + j, i + j] }"},
5425 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
5426 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
5427 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
5428 { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }",
5429 "{ [i, j] -> [floor((i)/3), j] }",
5430 "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" },
5433 static int test_pullback(isl_ctx
*ctx
)
5436 isl_multi_aff
*ma1
, *ma2
;
5440 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
5441 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
5442 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
5443 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
5444 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
5445 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
5446 isl_multi_aff_free(ma1
);
5447 isl_multi_aff_free(ma2
);
5451 isl_die(ctx
, isl_error_unknown
, "bad pullback",
5458 /* Check that negation is printed correctly and that equal expressions
5459 * are correctly identified.
5461 static int test_ast(isl_ctx
*ctx
)
5463 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
5467 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
5468 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
5469 expr
= isl_ast_expr_add(expr1
, expr2
);
5470 expr2
= isl_ast_expr_copy(expr
);
5471 expr
= isl_ast_expr_neg(expr
);
5472 expr2
= isl_ast_expr_neg(expr2
);
5473 equal
= isl_ast_expr_is_equal(expr
, expr2
);
5474 str
= isl_ast_expr_to_str(expr
);
5475 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
5477 isl_ast_expr_free(expr
);
5478 isl_ast_expr_free(expr2
);
5480 if (ok
< 0 || equal
< 0)
5483 isl_die(ctx
, isl_error_unknown
,
5484 "equal expressions not considered equal", return -1);
5486 isl_die(ctx
, isl_error_unknown
,
5487 "isl_ast_expr printed incorrectly", return -1);
5489 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
5490 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
5491 expr
= isl_ast_expr_add(expr1
, expr2
);
5492 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
5493 expr
= isl_ast_expr_sub(expr3
, expr
);
5494 str
= isl_ast_expr_to_str(expr
);
5495 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
5497 isl_ast_expr_free(expr
);
5502 isl_die(ctx
, isl_error_unknown
,
5503 "isl_ast_expr printed incorrectly", return -1);
5508 /* Check that isl_ast_build_expr_from_set returns a valid expression
5509 * for an empty set. Note that isl_ast_build_expr_from_set getting
5510 * called on an empty set probably indicates a bug in the caller.
5512 static int test_ast_build(isl_ctx
*ctx
)
5515 isl_ast_build
*build
;
5518 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5519 build
= isl_ast_build_from_context(set
);
5521 set
= isl_set_empty(isl_space_params_alloc(ctx
, 0));
5522 expr
= isl_ast_build_expr_from_set(build
, set
);
5524 isl_ast_expr_free(expr
);
5525 isl_ast_build_free(build
);
5533 /* Internal data structure for before_for and after_for callbacks.
5535 * depth is the current depth
5536 * before is the number of times before_for has been called
5537 * after is the number of times after_for has been called
5539 struct isl_test_codegen_data
{
5545 /* This function is called before each for loop in the AST generated
5546 * from test_ast_gen1.
5548 * Increment the number of calls and the depth.
5549 * Check that the space returned by isl_ast_build_get_schedule_space
5550 * matches the target space of the schedule returned by
5551 * isl_ast_build_get_schedule.
5552 * Return an isl_id that is checked by the corresponding call
5555 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
5558 struct isl_test_codegen_data
*data
= user
;
5561 isl_union_map
*schedule
;
5562 isl_union_set
*uset
;
5567 ctx
= isl_ast_build_get_ctx(build
);
5569 if (data
->before
>= 3)
5570 isl_die(ctx
, isl_error_unknown
,
5571 "unexpected number of for nodes", return NULL
);
5572 if (data
->depth
>= 2)
5573 isl_die(ctx
, isl_error_unknown
,
5574 "unexpected depth", return NULL
);
5576 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
5580 schedule
= isl_ast_build_get_schedule(build
);
5581 uset
= isl_union_map_range(schedule
);
5584 if (isl_union_set_n_set(uset
) != 1) {
5585 isl_union_set_free(uset
);
5586 isl_die(ctx
, isl_error_unknown
,
5587 "expecting single range space", return NULL
);
5590 space
= isl_ast_build_get_schedule_space(build
);
5591 set
= isl_union_set_extract_set(uset
, space
);
5592 isl_union_set_free(uset
);
5593 empty
= isl_set_is_empty(set
);
5599 isl_die(ctx
, isl_error_unknown
,
5600 "spaces don't match", return NULL
);
5602 return isl_id_alloc(ctx
, name
, NULL
);
5605 /* This function is called after each for loop in the AST generated
5606 * from test_ast_gen1.
5608 * Increment the number of calls and decrement the depth.
5609 * Check that the annotation attached to the node matches
5610 * the isl_id returned by the corresponding call to before_for.
5612 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
5613 __isl_keep isl_ast_build
*build
, void *user
)
5615 struct isl_test_codegen_data
*data
= user
;
5623 if (data
->after
> data
->before
)
5624 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5625 "mismatch in number of for nodes",
5626 return isl_ast_node_free(node
));
5628 id
= isl_ast_node_get_annotation(node
);
5630 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5631 "missing annotation", return isl_ast_node_free(node
));
5633 name
= isl_id_get_name(id
);
5634 valid
= name
&& atoi(name
+ 1) == data
->depth
;
5638 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
5639 "wrong annotation", return isl_ast_node_free(node
));
5644 /* Check that the before_each_for and after_each_for callbacks
5645 * are called for each for loop in the generated code,
5646 * that they are called in the right order and that the isl_id
5647 * returned from the before_each_for callback is attached to
5648 * the isl_ast_node passed to the corresponding after_each_for call.
5650 static int test_ast_gen1(isl_ctx
*ctx
)
5654 isl_union_map
*schedule
;
5655 isl_ast_build
*build
;
5657 struct isl_test_codegen_data data
;
5659 str
= "[N] -> { : N >= 10 }";
5660 set
= isl_set_read_from_str(ctx
, str
);
5661 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
5662 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
5663 schedule
= isl_union_map_read_from_str(ctx
, str
);
5668 build
= isl_ast_build_from_context(set
);
5669 build
= isl_ast_build_set_before_each_for(build
,
5670 &before_for
, &data
);
5671 build
= isl_ast_build_set_after_each_for(build
,
5673 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5674 isl_ast_build_free(build
);
5678 isl_ast_node_free(tree
);
5680 if (data
.before
!= 3 || data
.after
!= 3)
5681 isl_die(ctx
, isl_error_unknown
,
5682 "unexpected number of for nodes", return -1);
5687 /* Check that the AST generator handles domains that are integrally disjoint
5688 * but not rationally disjoint.
5690 static int test_ast_gen2(isl_ctx
*ctx
)
5694 isl_union_map
*schedule
;
5695 isl_union_map
*options
;
5696 isl_ast_build
*build
;
5699 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
5700 schedule
= isl_union_map_read_from_str(ctx
, str
);
5701 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5702 build
= isl_ast_build_from_context(set
);
5704 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
5705 options
= isl_union_map_read_from_str(ctx
, str
);
5706 build
= isl_ast_build_set_options(build
, options
);
5707 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5708 isl_ast_build_free(build
);
5711 isl_ast_node_free(tree
);
5716 /* Increment *user on each call.
5718 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
5719 __isl_keep isl_ast_build
*build
, void *user
)
5728 /* Test that unrolling tries to minimize the number of instances.
5729 * In particular, for the schedule given below, make sure it generates
5730 * 3 nodes (rather than 101).
5732 static int test_ast_gen3(isl_ctx
*ctx
)
5736 isl_union_map
*schedule
;
5737 isl_union_map
*options
;
5738 isl_ast_build
*build
;
5742 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
5743 schedule
= isl_union_map_read_from_str(ctx
, str
);
5744 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5746 str
= "{ [i] -> unroll[0] }";
5747 options
= isl_union_map_read_from_str(ctx
, str
);
5749 build
= isl_ast_build_from_context(set
);
5750 build
= isl_ast_build_set_options(build
, options
);
5751 build
= isl_ast_build_set_at_each_domain(build
,
5752 &count_domains
, &n_domain
);
5753 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5754 isl_ast_build_free(build
);
5758 isl_ast_node_free(tree
);
5761 isl_die(ctx
, isl_error_unknown
,
5762 "unexpected number of for nodes", return -1);
5767 /* Check that if the ast_build_exploit_nested_bounds options is set,
5768 * we do not get an outer if node in the generated AST,
5769 * while we do get such an outer if node if the options is not set.
5771 static int test_ast_gen4(isl_ctx
*ctx
)
5775 isl_union_map
*schedule
;
5776 isl_ast_build
*build
;
5778 enum isl_ast_node_type type
;
5781 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
5782 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
5784 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
5786 schedule
= isl_union_map_read_from_str(ctx
, str
);
5787 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5788 build
= isl_ast_build_from_context(set
);
5789 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5790 isl_ast_build_free(build
);
5794 type
= isl_ast_node_get_type(tree
);
5795 isl_ast_node_free(tree
);
5797 if (type
== isl_ast_node_if
)
5798 isl_die(ctx
, isl_error_unknown
,
5799 "not expecting if node", return -1);
5801 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
5803 schedule
= isl_union_map_read_from_str(ctx
, str
);
5804 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5805 build
= isl_ast_build_from_context(set
);
5806 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5807 isl_ast_build_free(build
);
5811 type
= isl_ast_node_get_type(tree
);
5812 isl_ast_node_free(tree
);
5814 if (type
!= isl_ast_node_if
)
5815 isl_die(ctx
, isl_error_unknown
,
5816 "expecting if node", return -1);
5818 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
5823 /* This function is called for each leaf in the AST generated
5824 * from test_ast_gen5.
5826 * We finalize the AST generation by extending the outer schedule
5827 * with a zero-dimensional schedule. If this results in any for loops,
5828 * then this means that we did not pass along enough information
5829 * about the outer schedule to the inner AST generation.
5831 static __isl_give isl_ast_node
*create_leaf(__isl_take isl_ast_build
*build
,
5834 isl_union_map
*schedule
, *extra
;
5837 schedule
= isl_ast_build_get_schedule(build
);
5838 extra
= isl_union_map_copy(schedule
);
5839 extra
= isl_union_map_from_domain(isl_union_map_domain(extra
));
5840 schedule
= isl_union_map_range_product(schedule
, extra
);
5841 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5842 isl_ast_build_free(build
);
5847 if (isl_ast_node_get_type(tree
) == isl_ast_node_for
)
5848 isl_die(isl_ast_node_get_ctx(tree
), isl_error_unknown
,
5849 "code should not contain any for loop",
5850 return isl_ast_node_free(tree
));
5855 /* Check that we do not lose any information when going back and
5856 * forth between internal and external schedule.
5858 * In particular, we create an AST where we unroll the only
5859 * non-constant dimension in the schedule. We therefore do
5860 * not expect any for loops in the AST. However, older versions
5861 * of isl would not pass along enough information about the outer
5862 * schedule when performing an inner code generation from a create_leaf
5863 * callback, resulting in the inner code generation producing a for loop.
5865 static int test_ast_gen5(isl_ctx
*ctx
)
5869 isl_union_map
*schedule
, *options
;
5870 isl_ast_build
*build
;
5873 str
= "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
5874 schedule
= isl_union_map_read_from_str(ctx
, str
);
5876 str
= "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
5877 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
5878 options
= isl_union_map_read_from_str(ctx
, str
);
5880 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
5881 build
= isl_ast_build_from_context(set
);
5882 build
= isl_ast_build_set_options(build
, options
);
5883 build
= isl_ast_build_set_create_leaf(build
, &create_leaf
, NULL
);
5884 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
5885 isl_ast_build_free(build
);
5886 isl_ast_node_free(tree
);
5893 static int test_ast_gen(isl_ctx
*ctx
)
5895 if (test_ast_gen1(ctx
) < 0)
5897 if (test_ast_gen2(ctx
) < 0)
5899 if (test_ast_gen3(ctx
) < 0)
5901 if (test_ast_gen4(ctx
) < 0)
5903 if (test_ast_gen5(ctx
) < 0)
5908 /* Check if dropping output dimensions from an isl_pw_multi_aff
5911 static int test_pw_multi_aff(isl_ctx
*ctx
)
5914 isl_pw_multi_aff
*pma1
, *pma2
;
5917 str
= "{ [i,j] -> [i+j, 4i-j] }";
5918 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
5919 str
= "{ [i,j] -> [4i-j] }";
5920 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
5922 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
5924 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
5926 isl_pw_multi_aff_free(pma1
);
5927 isl_pw_multi_aff_free(pma2
);
5931 isl_die(ctx
, isl_error_unknown
,
5932 "expressions not equal", return -1);
5937 /* Check that we can properly parse multi piecewise affine expressions
5938 * where the piecewise affine expressions have different domains.
5940 static int test_multi_pw_aff(isl_ctx
*ctx
)
5943 isl_set
*dom
, *dom2
;
5944 isl_multi_pw_aff
*mpa1
, *mpa2
;
5949 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [i] }");
5950 dom
= isl_set_read_from_str(ctx
, "{ [i] : i > 0 }");
5951 mpa1
= isl_multi_pw_aff_intersect_domain(mpa1
, dom
);
5952 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [2i] }");
5953 mpa2
= isl_multi_pw_aff_flat_range_product(mpa1
, mpa2
);
5954 str
= "{ [i] -> [(i : i > 0), 2i] }";
5955 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, str
);
5957 equal
= isl_multi_pw_aff_plain_is_equal(mpa1
, mpa2
);
5959 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 0);
5960 dom
= isl_pw_aff_domain(pa
);
5961 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 1);
5962 dom2
= isl_pw_aff_domain(pa
);
5963 equal_domain
= isl_set_is_equal(dom
, dom2
);
5967 isl_multi_pw_aff_free(mpa1
);
5968 isl_multi_pw_aff_free(mpa2
);
5973 isl_die(ctx
, isl_error_unknown
,
5974 "expressions not equal", return -1);
5976 if (equal_domain
< 0)
5979 isl_die(ctx
, isl_error_unknown
,
5980 "domains unexpectedly equal", return -1);
5985 /* This is a regression test for a bug where isl_basic_map_simplify
5986 * would end up in an infinite loop. In particular, we construct
5987 * an empty basic set that is not obviously empty.
5988 * isl_basic_set_is_empty marks the basic set as empty.
5989 * After projecting out i3, the variable can be dropped completely,
5990 * but isl_basic_map_simplify refrains from doing so if the basic set
5991 * is empty and would end up in an infinite loop if it didn't test
5992 * explicitly for empty basic maps in the outer loop.
5994 static int test_simplify_1(isl_ctx
*ctx
)
5997 isl_basic_set
*bset
;
6000 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
6001 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
6002 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
6004 bset
= isl_basic_set_read_from_str(ctx
, str
);
6005 empty
= isl_basic_set_is_empty(bset
);
6006 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
6007 isl_basic_set_free(bset
);
6011 isl_die(ctx
, isl_error_unknown
,
6012 "basic set should be empty", return -1);
6017 /* Check that the equality in the set description below
6018 * is simplified away.
6020 static int test_simplify_2(isl_ctx
*ctx
)
6023 isl_basic_set
*bset
;
6026 str
= "{ [a] : exists e0, e1: 32e1 = 31 + 31a + 31e0 }";
6027 bset
= isl_basic_set_read_from_str(ctx
, str
);
6028 universe
= isl_basic_set_plain_is_universe(bset
);
6029 isl_basic_set_free(bset
);
6034 isl_die(ctx
, isl_error_unknown
,
6035 "equality not simplified away", return -1);
6039 /* Some simplification tests.
6041 static int test_simplify(isl_ctx
*ctx
)
6043 if (test_simplify_1(ctx
) < 0)
6045 if (test_simplify_2(ctx
) < 0)
6050 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
6051 * with gbr context would fail to disable the use of the shifted tableau
6052 * when transferring equalities for the input to the context, resulting
6053 * in invalid sample values.
6055 static int test_partial_lexmin(isl_ctx
*ctx
)
6058 isl_basic_set
*bset
;
6059 isl_basic_map
*bmap
;
6062 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
6063 bmap
= isl_basic_map_read_from_str(ctx
, str
);
6064 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
6065 bset
= isl_basic_set_read_from_str(ctx
, str
);
6066 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
6075 /* Check that the variable compression performed on the existentially
6076 * quantified variables inside isl_basic_set_compute_divs is not confused
6077 * by the implicit equalities among the parameters.
6079 static int test_compute_divs(isl_ctx
*ctx
)
6082 isl_basic_set
*bset
;
6085 str
= "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
6086 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
6087 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
6088 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
6089 bset
= isl_basic_set_read_from_str(ctx
, str
);
6090 set
= isl_basic_set_compute_divs(bset
);
6098 /* Check that the reaching domain elements and the prefix schedule
6099 * at a leaf node are the same before and after grouping.
6101 static int test_schedule_tree_group_1(isl_ctx
*ctx
)
6106 isl_union_set
*uset
;
6107 isl_multi_union_pw_aff
*mupa
;
6108 isl_union_pw_multi_aff
*upma1
, *upma2
;
6109 isl_union_set
*domain1
, *domain2
;
6110 isl_union_map
*umap1
, *umap2
;
6111 isl_schedule_node
*node
;
6113 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
6114 uset
= isl_union_set_read_from_str(ctx
, str
);
6115 node
= isl_schedule_node_from_domain(uset
);
6116 node
= isl_schedule_node_child(node
, 0);
6117 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]";
6118 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6119 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6120 node
= isl_schedule_node_child(node
, 0);
6121 str
= "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]";
6122 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6123 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6124 node
= isl_schedule_node_child(node
, 0);
6125 umap1
= isl_schedule_node_get_prefix_schedule_union_map(node
);
6126 upma1
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
6127 domain1
= isl_schedule_node_get_domain(node
);
6128 id
= isl_id_alloc(ctx
, "group", NULL
);
6129 node
= isl_schedule_node_parent(node
);
6130 node
= isl_schedule_node_group(node
, id
);
6131 node
= isl_schedule_node_child(node
, 0);
6132 umap2
= isl_schedule_node_get_prefix_schedule_union_map(node
);
6133 upma2
= isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node
);
6134 domain2
= isl_schedule_node_get_domain(node
);
6135 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
6136 if (equal
>= 0 && equal
)
6137 equal
= isl_union_set_is_equal(domain1
, domain2
);
6138 if (equal
>= 0 && equal
)
6139 equal
= isl_union_map_is_equal(umap1
, umap2
);
6140 isl_union_map_free(umap1
);
6141 isl_union_map_free(umap2
);
6142 isl_union_set_free(domain1
);
6143 isl_union_set_free(domain2
);
6144 isl_union_pw_multi_aff_free(upma1
);
6145 isl_union_pw_multi_aff_free(upma2
);
6146 isl_schedule_node_free(node
);
6151 isl_die(ctx
, isl_error_unknown
,
6152 "expressions not equal", return -1);
6157 /* Check that we can have nested groupings and that the union map
6158 * schedule representation is the same before and after the grouping.
6159 * Note that after the grouping, the union map representation contains
6160 * the domain constraints from the ranges of the expansion nodes,
6161 * while they are missing from the union map representation of
6162 * the tree without expansion nodes.
6164 * Also check that the global expansion is as expected.
6166 static int test_schedule_tree_group_2(isl_ctx
*ctx
)
6168 int equal
, equal_expansion
;
6171 isl_union_set
*uset
;
6172 isl_union_map
*umap1
, *umap2
;
6173 isl_union_map
*expansion1
, *expansion2
;
6174 isl_union_set_list
*filters
;
6175 isl_multi_union_pw_aff
*mupa
;
6176 isl_schedule
*schedule
;
6177 isl_schedule_node
*node
;
6179 str
= "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; "
6180 "S3[i,j] : 0 <= i,j < 10 }";
6181 uset
= isl_union_set_read_from_str(ctx
, str
);
6182 node
= isl_schedule_node_from_domain(uset
);
6183 node
= isl_schedule_node_child(node
, 0);
6184 str
= "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]";
6185 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6186 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6187 node
= isl_schedule_node_child(node
, 0);
6188 str
= "{ S1[i,j] }";
6189 uset
= isl_union_set_read_from_str(ctx
, str
);
6190 filters
= isl_union_set_list_from_union_set(uset
);
6191 str
= "{ S2[i,j]; S3[i,j] }";
6192 uset
= isl_union_set_read_from_str(ctx
, str
);
6193 filters
= isl_union_set_list_add(filters
, uset
);
6194 node
= isl_schedule_node_insert_sequence(node
, filters
);
6195 node
= isl_schedule_node_child(node
, 1);
6196 node
= isl_schedule_node_child(node
, 0);
6197 str
= "{ S2[i,j] }";
6198 uset
= isl_union_set_read_from_str(ctx
, str
);
6199 filters
= isl_union_set_list_from_union_set(uset
);
6200 str
= "{ S3[i,j] }";
6201 uset
= isl_union_set_read_from_str(ctx
, str
);
6202 filters
= isl_union_set_list_add(filters
, uset
);
6203 node
= isl_schedule_node_insert_sequence(node
, filters
);
6205 schedule
= isl_schedule_node_get_schedule(node
);
6206 umap1
= isl_schedule_get_map(schedule
);
6207 uset
= isl_schedule_get_domain(schedule
);
6208 umap1
= isl_union_map_intersect_domain(umap1
, uset
);
6209 isl_schedule_free(schedule
);
6211 node
= isl_schedule_node_parent(node
);
6212 node
= isl_schedule_node_parent(node
);
6213 id
= isl_id_alloc(ctx
, "group1", NULL
);
6214 node
= isl_schedule_node_group(node
, id
);
6215 node
= isl_schedule_node_child(node
, 1);
6216 node
= isl_schedule_node_child(node
, 0);
6217 id
= isl_id_alloc(ctx
, "group2", NULL
);
6218 node
= isl_schedule_node_group(node
, id
);
6220 schedule
= isl_schedule_node_get_schedule(node
);
6221 umap2
= isl_schedule_get_map(schedule
);
6222 isl_schedule_free(schedule
);
6224 node
= isl_schedule_node_root(node
);
6225 node
= isl_schedule_node_child(node
, 0);
6226 expansion1
= isl_schedule_node_get_subtree_expansion(node
);
6227 isl_schedule_node_free(node
);
6229 str
= "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; "
6230 "group1[i] -> S2[i,j] : 0 <= i,j < 10; "
6231 "group1[i] -> S3[i,j] : 0 <= i,j < 10 }";
6233 expansion2
= isl_union_map_read_from_str(ctx
, str
);
6235 equal
= isl_union_map_is_equal(umap1
, umap2
);
6236 equal_expansion
= isl_union_map_is_equal(expansion1
, expansion2
);
6238 isl_union_map_free(umap1
);
6239 isl_union_map_free(umap2
);
6240 isl_union_map_free(expansion1
);
6241 isl_union_map_free(expansion2
);
6243 if (equal
< 0 || equal_expansion
< 0)
6246 isl_die(ctx
, isl_error_unknown
,
6247 "expressions not equal", return -1);
6248 if (!equal_expansion
)
6249 isl_die(ctx
, isl_error_unknown
,
6250 "unexpected expansion", return -1);
6255 /* Some tests for the isl_schedule_node_group function.
6257 static int test_schedule_tree_group(isl_ctx
*ctx
)
6259 if (test_schedule_tree_group_1(ctx
) < 0)
6261 if (test_schedule_tree_group_2(ctx
) < 0)
6270 { "{ rat: [i] : 0 <= i <= 10 }",
6271 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
6272 { "{ rat: [i] : FALSE }",
6273 "{ rat: coefficients[[cst] -> [a]] }" },
6275 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
6282 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
6283 "{ rat: [i] : 0 <= i <= 10 }" },
6284 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
6286 { "{ rat: coefficients[[cst] -> [a]] }",
6287 "{ rat: [i] : FALSE }" },
6290 /* Test the basic functionality of isl_basic_set_coefficients and
6291 * isl_basic_set_solutions.
6293 static int test_dual(isl_ctx
*ctx
)
6297 for (i
= 0; i
< ARRAY_SIZE(coef_tests
); ++i
) {
6299 isl_basic_set
*bset1
, *bset2
;
6301 bset1
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].set
);
6302 bset2
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].dual
);
6303 bset1
= isl_basic_set_coefficients(bset1
);
6304 equal
= isl_basic_set_is_equal(bset1
, bset2
);
6305 isl_basic_set_free(bset1
);
6306 isl_basic_set_free(bset2
);
6310 isl_die(ctx
, isl_error_unknown
,
6311 "incorrect dual", return -1);
6314 for (i
= 0; i
< ARRAY_SIZE(sol_tests
); ++i
) {
6316 isl_basic_set
*bset1
, *bset2
;
6318 bset1
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].set
);
6319 bset2
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].dual
);
6320 bset1
= isl_basic_set_solutions(bset1
);
6321 equal
= isl_basic_set_is_equal(bset1
, bset2
);
6322 isl_basic_set_free(bset1
);
6323 isl_basic_set_free(bset2
);
6327 isl_die(ctx
, isl_error_unknown
,
6328 "incorrect dual", return -1);
6338 const char *schedule
;
6343 { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6344 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6346 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6347 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6349 { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6350 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6352 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6353 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6355 { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6356 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6358 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6359 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6361 { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6362 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6364 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6365 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6369 /* Basic tiling tests. Create a schedule tree with a domain and a band node,
6370 * tile the band and then check if the tile and point bands have the
6371 * expected partial schedule.
6373 static int test_tile(isl_ctx
*ctx
)
6379 scale
= isl_options_get_tile_scale_tile_loops(ctx
);
6380 shift
= isl_options_get_tile_shift_point_loops(ctx
);
6382 for (i
= 0; i
< ARRAY_SIZE(tile_tests
); ++i
) {
6386 isl_union_set
*domain
;
6387 isl_multi_union_pw_aff
*mupa
, *mupa2
;
6388 isl_schedule_node
*node
;
6389 isl_multi_val
*sizes
;
6391 opt
= tile_tests
[i
].scale_tile
;
6392 isl_options_set_tile_scale_tile_loops(ctx
, opt
);
6393 opt
= tile_tests
[i
].shift_point
;
6394 isl_options_set_tile_shift_point_loops(ctx
, opt
);
6396 str
= tile_tests
[i
].domain
;
6397 domain
= isl_union_set_read_from_str(ctx
, str
);
6398 node
= isl_schedule_node_from_domain(domain
);
6399 node
= isl_schedule_node_child(node
, 0);
6400 str
= tile_tests
[i
].schedule
;
6401 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6402 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
6403 str
= tile_tests
[i
].sizes
;
6404 sizes
= isl_multi_val_read_from_str(ctx
, str
);
6405 node
= isl_schedule_node_band_tile(node
, sizes
);
6407 str
= tile_tests
[i
].tile
;
6408 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6409 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
6410 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
, mupa2
);
6411 isl_multi_union_pw_aff_free(mupa
);
6412 isl_multi_union_pw_aff_free(mupa2
);
6414 node
= isl_schedule_node_child(node
, 0);
6416 str
= tile_tests
[i
].point
;
6417 mupa
= isl_multi_union_pw_aff_read_from_str(ctx
, str
);
6418 mupa2
= isl_schedule_node_band_get_partial_schedule(node
);
6419 if (equal
>= 0 && equal
)
6420 equal
= isl_multi_union_pw_aff_plain_is_equal(mupa
,
6422 isl_multi_union_pw_aff_free(mupa
);
6423 isl_multi_union_pw_aff_free(mupa2
);
6425 isl_schedule_node_free(node
);
6430 isl_die(ctx
, isl_error_unknown
,
6431 "unexpected result", return -1);
6434 isl_options_set_tile_scale_tile_loops(ctx
, scale
);
6435 isl_options_set_tile_shift_point_loops(ctx
, shift
);
6440 /* Check that the domain hash of a space is equal to the hash
6441 * of the domain of the space.
6443 static int test_domain_hash(isl_ctx
*ctx
)
6447 uint32_t hash1
, hash2
;
6449 map
= isl_map_read_from_str(ctx
, "[n] -> { A[B[x] -> C[]] -> D[] }");
6450 space
= isl_map_get_space(map
);
6452 hash1
= isl_space_get_domain_hash(space
);
6453 space
= isl_space_domain(space
);
6454 hash2
= isl_space_get_hash(space
);
6455 isl_space_free(space
);
6460 isl_die(ctx
, isl_error_unknown
,
6461 "domain hash not equal to hash of domain", return -1);
6466 /* Check that a universe basic set that is not obviously equal to the universe
6467 * is still recognized as being equal to the universe.
6469 static int test_universe(isl_ctx
*ctx
)
6472 isl_basic_set
*bset
;
6475 s
= "{ [] : exists x, y : 3y <= 2x and y >= -3 + 2x and 2y >= 2 - x }";
6476 bset
= isl_basic_set_read_from_str(ctx
, s
);
6477 is_univ
= isl_basic_set_is_universe(bset
);
6478 isl_basic_set_free(bset
);
6483 isl_die(ctx
, isl_error_unknown
,
6484 "not recognized as universe set", return -1);
6491 int (*fn
)(isl_ctx
*ctx
);
6493 { "universe", &test_universe
},
6494 { "domain hash", &test_domain_hash
},
6495 { "dual", &test_dual
},
6496 { "dependence analysis", &test_flow
},
6497 { "val", &test_val
},
6498 { "compute divs", &test_compute_divs
},
6499 { "partial lexmin", &test_partial_lexmin
},
6500 { "simplify", &test_simplify
},
6501 { "curry", &test_curry
},
6502 { "piecewise multi affine expressions", &test_pw_multi_aff
},
6503 { "multi piecewise affine expressions", &test_multi_pw_aff
},
6504 { "conversion", &test_conversion
},
6505 { "list", &test_list
},
6506 { "align parameters", &test_align_parameters
},
6507 { "preimage", &test_preimage
},
6508 { "pullback", &test_pullback
},
6509 { "AST", &test_ast
},
6510 { "AST build", &test_ast_build
},
6511 { "AST generation", &test_ast_gen
},
6512 { "eliminate", &test_eliminate
},
6513 { "residue class", &test_residue_class
},
6514 { "div", &test_div
},
6515 { "slice", &test_slice
},
6516 { "fixed power", &test_fixed_power
},
6517 { "sample", &test_sample
},
6518 { "output", &test_output
},
6519 { "vertices", &test_vertices
},
6520 { "fixed", &test_fixed
},
6521 { "equal", &test_equal
},
6522 { "disjoint", &test_disjoint
},
6523 { "product", &test_product
},
6524 { "dim_max", &test_dim_max
},
6525 { "affine", &test_aff
},
6526 { "injective", &test_injective
},
6527 { "schedule (whole component)", &test_schedule_whole
},
6528 { "schedule (incremental)", &test_schedule_incremental
},
6529 { "schedule tree grouping", &test_schedule_tree_group
},
6530 { "tile", &test_tile
},
6531 { "union_pw", &test_union_pw
},
6532 { "eval", &test_eval
},
6533 { "parse", &test_parse
},
6534 { "single-valued", &test_sv
},
6535 { "affine hull", &test_affine_hull
},
6536 { "simple_hull", &test_simple_hull
},
6537 { "coalesce", &test_coalesce
},
6538 { "factorize", &test_factorize
},
6539 { "subset", &test_subset
},
6540 { "subtract", &test_subtract
},
6541 { "intersect", &test_intersect
},
6542 { "lexmin", &test_lexmin
},
6543 { "min", &test_min
},
6544 { "gist", &test_gist
},
6545 { "piecewise quasi-polynomials", &test_pwqp
},
6546 { "lift", &test_lift
},
6547 { "bound", &test_bound
},
6548 { "union", &test_union
},
6549 { "split periods", &test_split_periods
},
6550 { "lexicographic order", &test_lex
},
6551 { "bijectivity", &test_bijective
},
6552 { "dataflow analysis", &test_dep
},
6553 { "reading", &test_read
},
6554 { "bounded", &test_bounded
},
6555 { "construction", &test_construction
},
6556 { "dimension manipulation", &test_dim
},
6557 { "map application", &test_application
},
6558 { "convex hull", &test_convex_hull
},
6559 { "transitive closure", &test_closure
},
6562 int main(int argc
, char **argv
)
6565 struct isl_ctx
*ctx
;
6566 struct isl_options
*options
;
6568 srcdir
= getenv("srcdir");
6571 options
= isl_options_new_with_defaults();
6573 argc
= isl_options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
6575 ctx
= isl_ctx_alloc_with_options(&isl_options_args
, options
);
6576 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
6577 printf("%s\n", tests
[i
].name
);
6578 if (tests
[i
].fn(ctx
) < 0)