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>
26 #include <isl_constraint_private.h>
27 #include <isl/polynomial.h>
28 #include <isl/union_map.h>
29 #include <isl_factorization.h>
30 #include <isl/schedule.h>
31 #include <isl_options_private.h>
32 #include <isl/vertices.h>
33 #include <isl/ast_build.h>
36 #include <isl_ast_build_expr.h>
37 #include <isl/options.h>
39 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
43 static char *get_filename(isl_ctx
*ctx
, const char *name
, const char *suffix
) {
46 char *pattern
= "%s/test_inputs/%s.%s";
48 length
= strlen(pattern
) - 6 + strlen(srcdir
) + strlen(name
)
50 filename
= isl_alloc_array(ctx
, char, length
);
55 sprintf(filename
, pattern
, srcdir
, name
, suffix
);
60 void test_parse_map(isl_ctx
*ctx
, const char *str
)
64 map
= isl_map_read_from_str(ctx
, str
);
69 int test_parse_map_equal(isl_ctx
*ctx
, const char *str
, const char *str2
)
74 map
= isl_map_read_from_str(ctx
, str
);
75 map2
= isl_map_read_from_str(ctx
, str2
);
76 equal
= isl_map_is_equal(map
, map2
);
83 isl_die(ctx
, isl_error_unknown
, "maps not equal",
89 void test_parse_pwqp(isl_ctx
*ctx
, const char *str
)
91 isl_pw_qpolynomial
*pwqp
;
93 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
95 isl_pw_qpolynomial_free(pwqp
);
98 static void test_parse_pwaff(isl_ctx
*ctx
, const char *str
)
102 pwaff
= isl_pw_aff_read_from_str(ctx
, str
);
104 isl_pw_aff_free(pwaff
);
107 int test_parse(struct isl_ctx
*ctx
)
110 const char *str
, *str2
;
112 str
= "{ [i] -> [-i] }";
113 map
= isl_map_read_from_str(ctx
, str
);
117 str
= "{ A[i] -> L[([i/3])] }";
118 map
= isl_map_read_from_str(ctx
, str
);
122 test_parse_map(ctx
, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
123 test_parse_map(ctx
, "{ [p1, y1, y2] -> [2, y1, y2] : "
124 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
126 str
= "{ [x,y] : [([x/2]+y)/3] >= 1 }";
127 str2
= "{ [x, y] : 2y >= 6 - x }";
128 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
131 if (test_parse_map_equal(ctx
, "{ [x,y] : x <= min(y, 2*y+3) }",
132 "{ [x,y] : x <= y, 2*y + 3 }") < 0)
134 str
= "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }";
135 if (test_parse_map_equal(ctx
, "{ [x,y] : x >= min(y, 2*y+3) }",
139 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
140 map
= isl_map_read_from_str(ctx
, str
);
141 str
= "{ [new, old] -> [o0, o1] : "
142 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
143 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
144 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
145 map2
= isl_map_read_from_str(ctx
, str
);
146 assert(isl_map_is_equal(map
, map2
));
150 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
151 map
= isl_map_read_from_str(ctx
, str
);
152 str
= "{[new,old] -> [(new+1)%2,(old+1)%2]}";
153 map2
= isl_map_read_from_str(ctx
, str
);
154 assert(isl_map_is_equal(map
, map2
));
158 str
= "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }";
159 str2
= "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }";
160 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
163 str
= "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }";
164 str2
= "{ [i,j] -> [min(i,j)] }";
165 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
168 str
= "{ [i,j] : i != j }";
169 str2
= "{ [i,j] : i < j or i > j }";
170 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
173 str
= "{ [i,j] : (i+1)*2 >= j }";
174 str2
= "{ [i, j] : j <= 2 + 2i }";
175 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
178 str
= "{ [i] -> [i > 0 ? 4 : 5] }";
179 str2
= "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }";
180 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
183 str
= "[N=2,M] -> { [i=[(M+N)/4]] }";
184 str2
= "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }";
185 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
188 str
= "{ [x] : x >= 0 }";
189 str2
= "{ [x] : x-0 >= 0 }";
190 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
193 str
= "{ [i] : ((i > 10)) }";
194 str2
= "{ [i] : i >= 11 }";
195 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
198 str
= "{ [i] -> [0] }";
199 str2
= "{ [i] -> [0 * i] }";
200 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
203 test_parse_pwqp(ctx
, "{ [i] -> i + [ (i + [i/3])/2 ] }");
204 test_parse_map(ctx
, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
205 test_parse_pwaff(ctx
, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
206 test_parse_pwqp(ctx
, "{ [x] -> ([(x)/2] * [(x)/3]) }");
208 if (test_parse_map_equal(ctx
, "{ [a] -> [b] : (not false) }",
209 "{ [a] -> [b] : true }") < 0)
212 if (test_parse_map_equal(ctx
, "{ [i] : i/2 <= 5 }",
213 "{ [i] : i <= 10 }") < 0)
216 if (test_parse_map_equal(ctx
, "{Sym=[n] [i] : i <= n }",
217 "[n] -> { [i] : i <= n }") < 0)
220 if (test_parse_map_equal(ctx
, "{ [*] }", "{ [a] }") < 0)
223 if (test_parse_map_equal(ctx
, "{ [i] : 2*floor(i/2) = i }",
224 "{ [i] : exists a : i = 2 a }") < 0)
227 if (test_parse_map_equal(ctx
, "{ [a] -> [b] : a = 5 implies b = 5 }",
228 "{ [a] -> [b] : a != 5 or b = 5 }") < 0)
231 if (test_parse_map_equal(ctx
, "{ [a] -> [a - 1 : a > 0] }",
232 "{ [a] -> [a - 1] : a > 0 }") < 0)
234 if (test_parse_map_equal(ctx
,
235 "{ [a] -> [a - 1 : a > 0; a : a <= 0] }",
236 "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }") < 0)
238 if (test_parse_map_equal(ctx
,
239 "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }",
240 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
242 if (test_parse_map_equal(ctx
,
243 "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }",
244 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
246 if (test_parse_map_equal(ctx
,
247 "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }",
248 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
250 if (test_parse_map_equal(ctx
,
251 "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }",
252 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
258 void test_read(struct isl_ctx
*ctx
)
262 struct isl_basic_set
*bset1
, *bset2
;
263 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 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
275 isl_basic_set_free(bset1
);
276 isl_basic_set_free(bset2
);
282 void test_bounded(struct isl_ctx
*ctx
)
287 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : 0 <= i <= n }");
288 bounded
= isl_set_is_bounded(set
);
292 set
= isl_set_read_from_str(ctx
, "{[n, i] : 0 <= i <= n }");
293 bounded
= isl_set_is_bounded(set
);
297 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : i <= n }");
298 bounded
= isl_set_is_bounded(set
);
303 /* Construct the basic set { [i] : 5 <= i <= N } */
304 void test_construction(struct isl_ctx
*ctx
)
309 struct isl_basic_set
*bset
;
310 struct isl_constraint
*c
;
314 dim
= isl_space_set_alloc(ctx
, 1, 1);
315 bset
= isl_basic_set_universe(isl_space_copy(dim
));
316 ls
= isl_local_space_from_space(dim
);
318 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
319 isl_int_set_si(v
, -1);
320 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
321 isl_int_set_si(v
, 1);
322 isl_constraint_set_coefficient(c
, isl_dim_param
, 0, v
);
323 bset
= isl_basic_set_add_constraint(bset
, c
);
325 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
326 isl_int_set_si(v
, 1);
327 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
328 isl_int_set_si(v
, -5);
329 isl_constraint_set_constant(c
, v
);
330 bset
= isl_basic_set_add_constraint(bset
, c
);
332 isl_local_space_free(ls
);
333 isl_basic_set_free(bset
);
338 void test_dim(struct isl_ctx
*ctx
)
341 isl_map
*map1
, *map2
;
343 map1
= isl_map_read_from_str(ctx
,
344 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
345 map1
= isl_map_add_dims(map1
, isl_dim_in
, 1);
346 map2
= isl_map_read_from_str(ctx
,
347 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
348 assert(isl_map_is_equal(map1
, map2
));
351 map1
= isl_map_project_out(map1
, isl_dim_in
, 0, 1);
352 map2
= isl_map_read_from_str(ctx
, "[n] -> { [i] -> [j] : n >= 0 }");
353 assert(isl_map_is_equal(map1
, map2
));
358 str
= "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
359 map1
= isl_map_read_from_str(ctx
, str
);
360 str
= "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
361 map2
= isl_map_read_from_str(ctx
, str
);
362 map1
= isl_map_move_dims(map1
, isl_dim_out
, 0, isl_dim_param
, 0, 1);
363 assert(isl_map_is_equal(map1
, map2
));
370 __isl_give isl_val
*(*op
)(__isl_take isl_val
*v
);
374 { &isl_val_neg
, "0", "0" },
375 { &isl_val_abs
, "0", "0" },
376 { &isl_val_2exp
, "0", "1" },
377 { &isl_val_floor
, "0", "0" },
378 { &isl_val_ceil
, "0", "0" },
379 { &isl_val_neg
, "1", "-1" },
380 { &isl_val_neg
, "-1", "1" },
381 { &isl_val_neg
, "1/2", "-1/2" },
382 { &isl_val_neg
, "-1/2", "1/2" },
383 { &isl_val_neg
, "infty", "-infty" },
384 { &isl_val_neg
, "-infty", "infty" },
385 { &isl_val_neg
, "NaN", "NaN" },
386 { &isl_val_abs
, "1", "1" },
387 { &isl_val_abs
, "-1", "1" },
388 { &isl_val_abs
, "1/2", "1/2" },
389 { &isl_val_abs
, "-1/2", "1/2" },
390 { &isl_val_abs
, "infty", "infty" },
391 { &isl_val_abs
, "-infty", "infty" },
392 { &isl_val_abs
, "NaN", "NaN" },
393 { &isl_val_floor
, "1", "1" },
394 { &isl_val_floor
, "-1", "-1" },
395 { &isl_val_floor
, "1/2", "0" },
396 { &isl_val_floor
, "-1/2", "-1" },
397 { &isl_val_floor
, "infty", "infty" },
398 { &isl_val_floor
, "-infty", "-infty" },
399 { &isl_val_floor
, "NaN", "NaN" },
400 { &isl_val_ceil
, "1", "1" },
401 { &isl_val_ceil
, "-1", "-1" },
402 { &isl_val_ceil
, "1/2", "1" },
403 { &isl_val_ceil
, "-1/2", "0" },
404 { &isl_val_ceil
, "infty", "infty" },
405 { &isl_val_ceil
, "-infty", "-infty" },
406 { &isl_val_ceil
, "NaN", "NaN" },
407 { &isl_val_2exp
, "-3", "1/8" },
408 { &isl_val_2exp
, "-1", "1/2" },
409 { &isl_val_2exp
, "1", "2" },
410 { &isl_val_2exp
, "2", "4" },
411 { &isl_val_2exp
, "3", "8" },
412 { &isl_val_inv
, "1", "1" },
413 { &isl_val_inv
, "2", "1/2" },
414 { &isl_val_inv
, "1/2", "2" },
415 { &isl_val_inv
, "-2", "-1/2" },
416 { &isl_val_inv
, "-1/2", "-2" },
417 { &isl_val_inv
, "0", "NaN" },
418 { &isl_val_inv
, "NaN", "NaN" },
419 { &isl_val_inv
, "infty", "0" },
420 { &isl_val_inv
, "-infty", "0" },
423 /* Perform some basic tests of unary operations on isl_val objects.
425 static int test_un_val(isl_ctx
*ctx
)
429 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v
);
432 for (i
= 0; i
< ARRAY_SIZE(val_un_tests
); ++i
) {
433 v
= isl_val_read_from_str(ctx
, val_un_tests
[i
].arg
);
434 res
= isl_val_read_from_str(ctx
, val_un_tests
[i
].res
);
435 fn
= val_un_tests
[i
].op
;
437 if (isl_val_is_nan(res
))
438 ok
= isl_val_is_nan(v
);
440 ok
= isl_val_eq(v
, res
);
446 isl_die(ctx
, isl_error_unknown
,
447 "unexpected result", return -1);
454 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
455 __isl_take isl_val
*v2
);
457 ['+'] = { &isl_val_add
},
458 ['-'] = { &isl_val_sub
},
459 ['*'] = { &isl_val_mul
},
460 ['/'] = { &isl_val_div
},
461 ['g'] = { &isl_val_gcd
},
462 ['m'] = { &isl_val_min
},
463 ['M'] = { &isl_val_max
},
471 } val_bin_tests
[] = {
472 { "0", '+', "0", "0" },
473 { "1", '+', "0", "1" },
474 { "1", '+', "1", "2" },
475 { "1", '-', "1", "0" },
476 { "1", '*', "1", "1" },
477 { "1", '/', "1", "1" },
478 { "2", '*', "3", "6" },
479 { "2", '*', "1/2", "1" },
480 { "2", '*', "1/3", "2/3" },
481 { "2/3", '*', "3/5", "2/5" },
482 { "2/3", '*', "7/5", "14/15" },
483 { "2", '/', "1/2", "4" },
484 { "-2", '/', "-1/2", "4" },
485 { "-2", '/', "1/2", "-4" },
486 { "2", '/', "-1/2", "-4" },
487 { "2", '/', "2", "1" },
488 { "2", '/', "3", "2/3" },
489 { "2/3", '/', "5/3", "2/5" },
490 { "2/3", '/', "5/7", "14/15" },
491 { "0", '/', "0", "NaN" },
492 { "42", '/', "0", "NaN" },
493 { "-42", '/', "0", "NaN" },
494 { "infty", '/', "0", "NaN" },
495 { "-infty", '/', "0", "NaN" },
496 { "NaN", '/', "0", "NaN" },
497 { "0", '/', "NaN", "NaN" },
498 { "42", '/', "NaN", "NaN" },
499 { "-42", '/', "NaN", "NaN" },
500 { "infty", '/', "NaN", "NaN" },
501 { "-infty", '/', "NaN", "NaN" },
502 { "NaN", '/', "NaN", "NaN" },
503 { "0", '/', "infty", "0" },
504 { "42", '/', "infty", "0" },
505 { "-42", '/', "infty", "0" },
506 { "infty", '/', "infty", "NaN" },
507 { "-infty", '/', "infty", "NaN" },
508 { "NaN", '/', "infty", "NaN" },
509 { "0", '/', "-infty", "0" },
510 { "42", '/', "-infty", "0" },
511 { "-42", '/', "-infty", "0" },
512 { "infty", '/', "-infty", "NaN" },
513 { "-infty", '/', "-infty", "NaN" },
514 { "NaN", '/', "-infty", "NaN" },
515 { "1", '-', "1/3", "2/3" },
516 { "1/3", '+', "1/2", "5/6" },
517 { "1/2", '+', "1/2", "1" },
518 { "3/4", '-', "1/4", "1/2" },
519 { "1/2", '-', "1/3", "1/6" },
520 { "infty", '+', "42", "infty" },
521 { "infty", '+', "infty", "infty" },
522 { "42", '+', "infty", "infty" },
523 { "infty", '-', "infty", "NaN" },
524 { "infty", '*', "infty", "infty" },
525 { "infty", '*', "-infty", "-infty" },
526 { "-infty", '*', "infty", "-infty" },
527 { "-infty", '*', "-infty", "infty" },
528 { "0", '*', "infty", "NaN" },
529 { "1", '*', "infty", "infty" },
530 { "infty", '*', "0", "NaN" },
531 { "infty", '*', "42", "infty" },
532 { "42", '-', "infty", "-infty" },
533 { "infty", '+', "-infty", "NaN" },
534 { "4", 'g', "6", "2" },
535 { "5", 'g', "6", "1" },
536 { "42", 'm', "3", "3" },
537 { "42", 'M', "3", "42" },
538 { "3", 'm', "42", "3" },
539 { "3", 'M', "42", "42" },
540 { "42", 'm', "infty", "42" },
541 { "42", 'M', "infty", "infty" },
542 { "42", 'm', "-infty", "-infty" },
543 { "42", 'M', "-infty", "42" },
544 { "42", 'm', "NaN", "NaN" },
545 { "42", 'M', "NaN", "NaN" },
546 { "infty", 'm', "-infty", "-infty" },
547 { "infty", 'M', "-infty", "infty" },
550 /* Perform some basic tests of binary operations on isl_val objects.
552 static int test_bin_val(isl_ctx
*ctx
)
555 isl_val
*v1
, *v2
, *res
;
556 __isl_give isl_val
*(*fn
)(__isl_take isl_val
*v1
,
557 __isl_take isl_val
*v2
);
560 for (i
= 0; i
< ARRAY_SIZE(val_bin_tests
); ++i
) {
561 v1
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg1
);
562 v2
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].arg2
);
563 res
= isl_val_read_from_str(ctx
, val_bin_tests
[i
].res
);
564 fn
= val_bin_op
[val_bin_tests
[i
].op
].fn
;
566 if (isl_val_is_nan(res
))
567 ok
= isl_val_is_nan(v1
);
569 ok
= isl_val_eq(v1
, res
);
575 isl_die(ctx
, isl_error_unknown
,
576 "unexpected result", return -1);
582 /* Perform some basic tests on isl_val objects.
584 static int test_val(isl_ctx
*ctx
)
586 if (test_un_val(ctx
) < 0)
588 if (test_bin_val(ctx
) < 0)
593 static int test_div(isl_ctx
*ctx
)
602 struct isl_basic_set
*bset
;
603 struct isl_constraint
*c
;
608 dim
= isl_space_set_alloc(ctx
, 0, 3);
609 bset
= isl_basic_set_universe(isl_space_copy(dim
));
610 ls
= isl_local_space_from_space(dim
);
612 c
= isl_equality_alloc(isl_local_space_copy(ls
));
613 isl_int_set_si(v
, -1);
614 isl_constraint_set_constant(c
, v
);
615 isl_int_set_si(v
, 1);
616 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
617 isl_int_set_si(v
, 3);
618 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
619 bset
= isl_basic_set_add_constraint(bset
, c
);
621 c
= isl_equality_alloc(isl_local_space_copy(ls
));
622 isl_int_set_si(v
, 1);
623 isl_constraint_set_constant(c
, v
);
624 isl_int_set_si(v
, -1);
625 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
626 isl_int_set_si(v
, 3);
627 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
628 bset
= isl_basic_set_add_constraint(bset
, c
);
630 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
632 assert(bset
&& bset
->n_div
== 1);
633 isl_local_space_free(ls
);
634 isl_basic_set_free(bset
);
637 dim
= isl_space_set_alloc(ctx
, 0, 3);
638 bset
= isl_basic_set_universe(isl_space_copy(dim
));
639 ls
= isl_local_space_from_space(dim
);
641 c
= isl_equality_alloc(isl_local_space_copy(ls
));
642 isl_int_set_si(v
, 1);
643 isl_constraint_set_constant(c
, v
);
644 isl_int_set_si(v
, -1);
645 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
646 isl_int_set_si(v
, 3);
647 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
648 bset
= isl_basic_set_add_constraint(bset
, c
);
650 c
= isl_equality_alloc(isl_local_space_copy(ls
));
651 isl_int_set_si(v
, -1);
652 isl_constraint_set_constant(c
, v
);
653 isl_int_set_si(v
, 1);
654 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
655 isl_int_set_si(v
, 3);
656 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
657 bset
= isl_basic_set_add_constraint(bset
, c
);
659 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
661 assert(bset
&& bset
->n_div
== 1);
662 isl_local_space_free(ls
);
663 isl_basic_set_free(bset
);
666 dim
= isl_space_set_alloc(ctx
, 0, 3);
667 bset
= isl_basic_set_universe(isl_space_copy(dim
));
668 ls
= isl_local_space_from_space(dim
);
670 c
= isl_equality_alloc(isl_local_space_copy(ls
));
671 isl_int_set_si(v
, 1);
672 isl_constraint_set_constant(c
, v
);
673 isl_int_set_si(v
, -1);
674 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
675 isl_int_set_si(v
, 3);
676 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
677 bset
= isl_basic_set_add_constraint(bset
, c
);
679 c
= isl_equality_alloc(isl_local_space_copy(ls
));
680 isl_int_set_si(v
, -3);
681 isl_constraint_set_constant(c
, v
);
682 isl_int_set_si(v
, 1);
683 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
684 isl_int_set_si(v
, 4);
685 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
686 bset
= isl_basic_set_add_constraint(bset
, c
);
688 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
690 assert(bset
&& bset
->n_div
== 1);
691 isl_local_space_free(ls
);
692 isl_basic_set_free(bset
);
695 dim
= isl_space_set_alloc(ctx
, 0, 3);
696 bset
= isl_basic_set_universe(isl_space_copy(dim
));
697 ls
= isl_local_space_from_space(dim
);
699 c
= isl_equality_alloc(isl_local_space_copy(ls
));
700 isl_int_set_si(v
, 2);
701 isl_constraint_set_constant(c
, v
);
702 isl_int_set_si(v
, -1);
703 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
704 isl_int_set_si(v
, 3);
705 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
706 bset
= isl_basic_set_add_constraint(bset
, c
);
708 c
= isl_equality_alloc(isl_local_space_copy(ls
));
709 isl_int_set_si(v
, -1);
710 isl_constraint_set_constant(c
, v
);
711 isl_int_set_si(v
, 1);
712 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
713 isl_int_set_si(v
, 6);
714 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
715 bset
= isl_basic_set_add_constraint(bset
, c
);
717 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
719 assert(isl_basic_set_is_empty(bset
));
720 isl_local_space_free(ls
);
721 isl_basic_set_free(bset
);
724 dim
= isl_space_set_alloc(ctx
, 0, 3);
725 bset
= isl_basic_set_universe(isl_space_copy(dim
));
726 ls
= isl_local_space_from_space(dim
);
728 c
= isl_equality_alloc(isl_local_space_copy(ls
));
729 isl_int_set_si(v
, -1);
730 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
731 isl_int_set_si(v
, 3);
732 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
733 bset
= isl_basic_set_add_constraint(bset
, c
);
735 c
= isl_equality_alloc(isl_local_space_copy(ls
));
736 isl_int_set_si(v
, 1);
737 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
738 isl_int_set_si(v
, -3);
739 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
740 bset
= isl_basic_set_add_constraint(bset
, c
);
742 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
744 assert(bset
&& bset
->n_div
== 0);
745 isl_basic_set_free(bset
);
746 isl_local_space_free(ls
);
749 dim
= isl_space_set_alloc(ctx
, 0, 3);
750 bset
= isl_basic_set_universe(isl_space_copy(dim
));
751 ls
= isl_local_space_from_space(dim
);
753 c
= isl_equality_alloc(isl_local_space_copy(ls
));
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 c
= isl_equality_alloc(isl_local_space_copy(ls
));
761 isl_int_set_si(v
, 1);
762 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
763 isl_int_set_si(v
, -3);
764 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
765 bset
= isl_basic_set_add_constraint(bset
, c
);
767 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
769 assert(bset
&& bset
->n_div
== 1);
770 isl_basic_set_free(bset
);
771 isl_local_space_free(ls
);
774 /* This test is a bit tricky. We set up an equality
776 * Normalization of divs creates _two_ divs
779 * Afterwards e0 is removed again because it has coefficient -1
780 * and we end up with the original equality and div again.
781 * Perhaps we can avoid the introduction of this temporary div.
783 dim
= isl_space_set_alloc(ctx
, 0, 4);
784 bset
= isl_basic_set_universe(isl_space_copy(dim
));
785 ls
= isl_local_space_from_space(dim
);
787 c
= isl_equality_alloc(isl_local_space_copy(ls
));
788 isl_int_set_si(v
, -1);
789 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
790 isl_int_set_si(v
, -3);
791 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
792 isl_int_set_si(v
, -3);
793 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
794 isl_int_set_si(v
, 6);
795 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
796 bset
= isl_basic_set_add_constraint(bset
, c
);
798 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
800 /* Test disabled for now */
802 assert(bset && bset->n_div == 1);
804 isl_local_space_free(ls
);
805 isl_basic_set_free(bset
);
808 dim
= isl_space_set_alloc(ctx
, 0, 5);
809 bset
= isl_basic_set_universe(isl_space_copy(dim
));
810 ls
= isl_local_space_from_space(dim
);
812 c
= isl_equality_alloc(isl_local_space_copy(ls
));
813 isl_int_set_si(v
, -1);
814 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
815 isl_int_set_si(v
, -3);
816 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
817 isl_int_set_si(v
, -3);
818 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
819 isl_int_set_si(v
, 6);
820 isl_constraint_set_coefficient(c
, isl_dim_set
, 4, v
);
821 bset
= isl_basic_set_add_constraint(bset
, c
);
823 c
= isl_equality_alloc(isl_local_space_copy(ls
));
824 isl_int_set_si(v
, -1);
825 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
826 isl_int_set_si(v
, 1);
827 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
828 isl_int_set_si(v
, 1);
829 isl_constraint_set_constant(c
, v
);
830 bset
= isl_basic_set_add_constraint(bset
, c
);
832 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
834 /* Test disabled for now */
836 assert(bset && bset->n_div == 1);
838 isl_local_space_free(ls
);
839 isl_basic_set_free(bset
);
842 dim
= isl_space_set_alloc(ctx
, 0, 4);
843 bset
= isl_basic_set_universe(isl_space_copy(dim
));
844 ls
= isl_local_space_from_space(dim
);
846 c
= isl_equality_alloc(isl_local_space_copy(ls
));
847 isl_int_set_si(v
, 1);
848 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
849 isl_int_set_si(v
, -1);
850 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
851 isl_int_set_si(v
, -2);
852 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
853 bset
= isl_basic_set_add_constraint(bset
, c
);
855 c
= isl_equality_alloc(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
, 3, v
);
860 isl_int_set_si(v
, 2);
861 isl_constraint_set_constant(c
, v
);
862 bset
= isl_basic_set_add_constraint(bset
, c
);
864 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
866 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
868 assert(!isl_basic_set_is_empty(bset
));
870 isl_local_space_free(ls
);
871 isl_basic_set_free(bset
);
874 dim
= isl_space_set_alloc(ctx
, 0, 3);
875 bset
= isl_basic_set_universe(isl_space_copy(dim
));
876 ls
= isl_local_space_from_space(dim
);
878 c
= isl_equality_alloc(isl_local_space_copy(ls
));
879 isl_int_set_si(v
, 1);
880 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
881 isl_int_set_si(v
, -2);
882 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
883 bset
= isl_basic_set_add_constraint(bset
, c
);
885 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
887 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
889 isl_local_space_free(ls
);
890 isl_basic_set_free(bset
);
894 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
895 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
896 set
= isl_set_read_from_str(ctx
, str
);
897 set
= isl_set_compute_divs(set
);
902 str
= "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
903 bset
= isl_basic_set_read_from_str(ctx
, str
);
904 n
= isl_basic_set_dim(bset
, isl_dim_div
);
905 isl_basic_set_free(bset
);
909 isl_die(ctx
, isl_error_unknown
,
910 "expecting no existentials", return -1);
912 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
913 set
= isl_set_read_from_str(ctx
, str
);
914 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
915 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
916 empty
= isl_set_is_empty(set
);
921 isl_die(ctx
, isl_error_unknown
,
922 "result not as accurate as expected", return -1);
927 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
931 struct isl_basic_set
*bset1
, *bset2
;
932 struct isl_basic_map
*bmap
;
934 filename
= get_filename(ctx
, name
, "omega");
936 input
= fopen(filename
, "r");
939 bset1
= isl_basic_set_read_from_file(ctx
, input
);
940 bmap
= isl_basic_map_read_from_file(ctx
, input
);
942 bset1
= isl_basic_set_apply(bset1
, bmap
);
944 bset2
= isl_basic_set_read_from_file(ctx
, input
);
946 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
948 isl_basic_set_free(bset1
);
949 isl_basic_set_free(bset2
);
955 void test_application(struct isl_ctx
*ctx
)
957 test_application_case(ctx
, "application");
958 test_application_case(ctx
, "application2");
961 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
965 struct isl_basic_set
*bset1
, *bset2
;
967 filename
= get_filename(ctx
, name
, "polylib");
969 input
= fopen(filename
, "r");
972 bset1
= isl_basic_set_read_from_file(ctx
, input
);
973 bset2
= isl_basic_set_read_from_file(ctx
, input
);
975 bset1
= isl_basic_set_affine_hull(bset1
);
977 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
979 isl_basic_set_free(bset1
);
980 isl_basic_set_free(bset2
);
986 int test_affine_hull(struct isl_ctx
*ctx
)
990 isl_basic_set
*bset
, *bset2
;
994 test_affine_hull_case(ctx
, "affine2");
995 test_affine_hull_case(ctx
, "affine");
996 test_affine_hull_case(ctx
, "affine3");
998 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
999 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1000 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1001 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1002 set
= isl_set_read_from_str(ctx
, str
);
1003 bset
= isl_set_affine_hull(set
);
1004 n
= isl_basic_set_dim(bset
, isl_dim_div
);
1005 isl_basic_set_free(bset
);
1007 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
1010 /* Check that isl_map_affine_hull is not confused by
1011 * the reordering of divs in isl_map_align_divs.
1013 str
= "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1014 "32e0 = b and 32e1 = c); "
1015 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1016 set
= isl_set_read_from_str(ctx
, str
);
1017 bset
= isl_set_affine_hull(set
);
1018 isl_basic_set_free(bset
);
1022 str
= "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1023 "32e2 = 31 + 31e0 }";
1024 set
= isl_set_read_from_str(ctx
, str
);
1025 bset
= isl_set_affine_hull(set
);
1026 str
= "{ [a] : exists e : a = 32 e }";
1027 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1028 subset
= isl_basic_set_is_subset(bset
, bset2
);
1029 isl_basic_set_free(bset
);
1030 isl_basic_set_free(bset2
);
1034 isl_die(ctx
, isl_error_unknown
, "not as accurate as expected",
1040 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
1044 struct isl_basic_set
*bset1
, *bset2
;
1045 struct isl_set
*set
;
1047 filename
= get_filename(ctx
, name
, "polylib");
1049 input
= fopen(filename
, "r");
1052 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1053 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1055 set
= isl_basic_set_union(bset1
, bset2
);
1056 bset1
= isl_set_convex_hull(set
);
1058 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1060 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1062 isl_basic_set_free(bset1
);
1063 isl_basic_set_free(bset2
);
1072 } convex_hull_tests
[] = {
1073 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1074 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1075 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1076 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1077 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1078 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1079 "i2 <= 5 and i2 >= 4; "
1080 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1081 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1082 "i2 <= 5 + i0 and i2 >= i0 }" },
1083 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1084 "{ [x, y] : 1 = 0 }" },
1087 void test_convex_hull_algo(struct isl_ctx
*ctx
, int convex
)
1090 int orig_convex
= ctx
->opt
->convex
;
1091 ctx
->opt
->convex
= convex
;
1093 test_convex_hull_case(ctx
, "convex0");
1094 test_convex_hull_case(ctx
, "convex1");
1095 test_convex_hull_case(ctx
, "convex2");
1096 test_convex_hull_case(ctx
, "convex3");
1097 test_convex_hull_case(ctx
, "convex4");
1098 test_convex_hull_case(ctx
, "convex5");
1099 test_convex_hull_case(ctx
, "convex6");
1100 test_convex_hull_case(ctx
, "convex7");
1101 test_convex_hull_case(ctx
, "convex8");
1102 test_convex_hull_case(ctx
, "convex9");
1103 test_convex_hull_case(ctx
, "convex10");
1104 test_convex_hull_case(ctx
, "convex11");
1105 test_convex_hull_case(ctx
, "convex12");
1106 test_convex_hull_case(ctx
, "convex13");
1107 test_convex_hull_case(ctx
, "convex14");
1108 test_convex_hull_case(ctx
, "convex15");
1110 for (i
= 0; i
< ARRAY_SIZE(convex_hull_tests
); ++i
) {
1111 isl_set
*set1
, *set2
;
1113 set1
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].set
);
1114 set2
= isl_set_read_from_str(ctx
, convex_hull_tests
[i
].hull
);
1115 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
1116 assert(isl_set_is_equal(set1
, set2
));
1121 ctx
->opt
->convex
= orig_convex
;
1124 void test_convex_hull(struct isl_ctx
*ctx
)
1126 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
);
1127 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
);
1130 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
1134 struct isl_basic_set
*bset1
, *bset2
;
1136 filename
= get_filename(ctx
, name
, "polylib");
1138 input
= fopen(filename
, "r");
1141 bset1
= isl_basic_set_read_from_file(ctx
, input
);
1142 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1144 bset1
= isl_basic_set_gist(bset1
, bset2
);
1146 bset2
= isl_basic_set_read_from_file(ctx
, input
);
1148 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
1150 isl_basic_set_free(bset1
);
1151 isl_basic_set_free(bset2
);
1159 const char *context
;
1162 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1163 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1164 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1165 "{ [a, b, c] : a <= 15 }" },
1166 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1167 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1168 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1169 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1170 { "{ [m, n, a, b] : a <= 2147 + n }",
1171 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1172 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1173 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1175 "{ [m, n, ku, kl] }" },
1178 static int test_gist(struct isl_ctx
*ctx
)
1182 isl_basic_set
*bset1
, *bset2
;
1183 isl_map
*map1
, *map2
;
1186 for (i
= 0; i
< ARRAY_SIZE(gist_tests
); ++i
) {
1188 isl_set
*set1
, *set2
, *copy
;
1190 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1191 set2
= isl_set_read_from_str(ctx
, gist_tests
[i
].context
);
1192 copy
= isl_set_copy(set1
);
1193 set1
= isl_set_gist(set1
, set2
);
1194 set2
= isl_set_read_from_str(ctx
, gist_tests
[i
].gist
);
1195 equal
= isl_set_is_equal(set1
, set2
);
1198 set1
= isl_set_read_from_str(ctx
, gist_tests
[i
].set
);
1199 equal_input
= isl_set_is_equal(set1
, copy
);
1202 if (equal
< 0 || equal_input
< 0)
1205 isl_die(ctx
, isl_error_unknown
,
1206 "incorrect gist result", return -1);
1208 isl_die(ctx
, isl_error_unknown
,
1209 "gist modified input", return -1);
1212 test_gist_case(ctx
, "gist1");
1214 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
1215 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1216 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1217 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1218 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1219 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1220 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1221 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1222 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1223 bset1
= isl_basic_set_read_from_str(ctx
, str
);
1224 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1225 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1226 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1227 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1228 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1229 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1230 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1231 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1232 bset2
= isl_basic_set_read_from_str(ctx
, str
);
1233 bset1
= isl_basic_set_gist(bset1
, bset2
);
1234 assert(bset1
&& bset1
->n_div
== 0);
1235 isl_basic_set_free(bset1
);
1237 /* Check that the integer divisions of the second disjunct
1238 * do not spread to the first disjunct.
1240 str
= "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1241 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1242 "(exists (e0 = [(-1 + t1)/16], "
1243 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1244 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1245 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1246 "o0 <= 4294967295 and t1 <= -1)) }";
1247 map1
= isl_map_read_from_str(ctx
, str
);
1248 str
= "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1249 map2
= isl_map_read_from_str(ctx
, str
);
1250 map1
= isl_map_gist(map1
, map2
);
1254 isl_die(ctx
, isl_error_unknown
, "expecting single disjunct",
1255 isl_map_free(map1
); return -1);
1256 if (isl_basic_map_dim(map1
->p
[0], isl_dim_div
) != 1)
1257 isl_die(ctx
, isl_error_unknown
, "expecting single div",
1258 isl_map_free(map1
); return -1);
1264 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
1266 isl_set
*set
, *set2
;
1270 set
= isl_set_read_from_str(ctx
, str
);
1271 set
= isl_set_coalesce(set
);
1272 set2
= isl_set_read_from_str(ctx
, str
);
1273 equal
= isl_set_is_equal(set
, set2
);
1274 one
= set
&& set
->n
== 1;
1281 isl_die(ctx
, isl_error_unknown
,
1282 "coalesced set not equal to input", return -1);
1283 if (check_one
&& !one
)
1284 isl_die(ctx
, isl_error_unknown
,
1285 "coalesced set should not be a union", return -1);
1290 /* Inputs for coalescing tests with unbounded wrapping.
1291 * "str" is a string representation of the input set.
1292 * "single_disjunct" is set if we expect the result to consist of
1293 * a single disjunct.
1296 int single_disjunct
;
1298 } coalesce_unbounded_tests
[] = {
1299 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1300 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1301 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1302 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1304 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1305 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1306 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1307 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1310 /* Test the functionality of isl_set_coalesce with the bounded wrapping
1311 * option turned off.
1313 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
1319 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
1320 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
1322 for (i
= 0; i
< ARRAY_SIZE(coalesce_unbounded_tests
); ++i
) {
1323 const char *str
= coalesce_unbounded_tests
[i
].str
;
1324 int check_one
= coalesce_unbounded_tests
[i
].single_disjunct
;
1325 if (test_coalesce_set(ctx
, str
, check_one
) >= 0)
1331 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
1336 /* Inputs for coalescing tests.
1337 * "str" is a string representation of the input set.
1338 * "single_disjunct" is set if we expect the result to consist of
1339 * a single disjunct.
1342 int single_disjunct
;
1344 } coalesce_tests
[] = {
1345 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1346 "y >= x & x >= 2 & 5 >= y }" },
1347 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1348 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1349 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1350 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1351 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1352 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1353 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1354 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1355 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1356 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1357 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1358 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1359 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1360 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1361 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1362 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1363 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1364 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1365 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1366 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1367 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1368 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1369 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1370 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1371 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1372 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1373 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1374 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1375 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1376 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1377 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1378 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1379 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1380 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1381 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1382 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1383 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1384 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1385 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1386 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1387 "[o0, o1, o2, o3, o4, o5, o6]] : "
1388 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1389 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1390 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1391 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1392 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1393 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1394 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1395 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1396 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1397 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1398 "o6 >= i3 + i6 - o3 and M >= 0 and "
1399 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1400 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1401 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1402 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1403 "(o0 = 0 and M >= 2 and N >= 3) or "
1404 "(M = 0 and o0 = 0 and N >= 3) }" },
1405 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1406 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1407 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1408 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1409 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1410 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1411 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1412 "(y = 3 and x = 1) }" },
1413 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1414 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1415 "i1 <= M and i3 <= M and i4 <= M) or "
1416 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1417 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1418 "i4 <= -1 + M) }" },
1419 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1420 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1421 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1422 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1423 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1424 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1425 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1426 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1427 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1428 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1429 { 0, "{ [a, b] : exists e : 2e = a and "
1430 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1431 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1432 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1433 "j >= 1 and j' <= i + j - i' and i >= 1; "
1435 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1436 "[i,j] : exists a : j = 3a }" },
1437 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1438 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1440 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1441 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1442 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1443 "c <= 6 + 8a and a >= 3; "
1444 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1445 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1446 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1447 "[x,0] : 3 <= x <= 4 }" },
1448 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1449 "[x,0] : 4 <= x <= 5 }" },
1450 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1451 "[x,0] : 3 <= x <= 5 }" },
1452 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1453 "[x,0] : 3 <= x <= 4 }" },
1454 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1456 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1457 { 1, "{ [0,0]; [1,1] }" },
1458 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1459 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1461 "[k, 0, k] : k <= 6 and k >= 1 }" },
1464 /* Test the functionality of isl_set_coalesce.
1465 * That is, check that the output is always equal to the input
1466 * and in some cases that the result consists of a single disjunct.
1468 static int test_coalesce(struct isl_ctx
*ctx
)
1472 for (i
= 0; i
< ARRAY_SIZE(coalesce_tests
); ++i
) {
1473 const char *str
= coalesce_tests
[i
].str
;
1474 int check_one
= coalesce_tests
[i
].single_disjunct
;
1475 if (test_coalesce_set(ctx
, str
, check_one
) < 0)
1479 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
1485 void test_closure(struct isl_ctx
*ctx
)
1489 isl_map
*up
, *right
;
1490 isl_map
*map
, *map2
;
1493 /* COCOA example 1 */
1494 map
= isl_map_read_from_str(ctx
,
1495 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1496 "1 <= i and i < n and 1 <= j and j < n or "
1497 "i2 = i + 1 and j2 = j - 1 and "
1498 "1 <= i and i < n and 2 <= j and j <= n }");
1499 map
= isl_map_power(map
, &exact
);
1503 /* COCOA example 1 */
1504 map
= isl_map_read_from_str(ctx
,
1505 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1506 "1 <= i and i < n and 1 <= j and j < n or "
1507 "i2 = i + 1 and j2 = j - 1 and "
1508 "1 <= i and i < n and 2 <= j and j <= n }");
1509 map
= isl_map_transitive_closure(map
, &exact
);
1511 map2
= isl_map_read_from_str(ctx
,
1512 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1513 "1 <= i and i < n and 1 <= j and j <= n and "
1514 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1515 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1516 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1517 assert(isl_map_is_equal(map
, map2
));
1521 map
= isl_map_read_from_str(ctx
,
1522 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1523 " 0 <= y and y <= n }");
1524 map
= isl_map_transitive_closure(map
, &exact
);
1525 map2
= isl_map_read_from_str(ctx
,
1526 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1527 " 0 <= y and y <= n }");
1528 assert(isl_map_is_equal(map
, map2
));
1532 /* COCOA example 2 */
1533 map
= isl_map_read_from_str(ctx
,
1534 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1535 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1536 "i2 = i + 2 and j2 = j - 2 and "
1537 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1538 map
= isl_map_transitive_closure(map
, &exact
);
1540 map2
= isl_map_read_from_str(ctx
,
1541 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1542 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1543 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1544 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1545 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1546 assert(isl_map_is_equal(map
, map2
));
1550 /* COCOA Fig.2 left */
1551 map
= isl_map_read_from_str(ctx
,
1552 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1553 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1555 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1556 "j <= 2 i - 3 and j <= n - 2 or "
1557 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1558 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1559 map
= isl_map_transitive_closure(map
, &exact
);
1563 /* COCOA Fig.2 right */
1564 map
= isl_map_read_from_str(ctx
,
1565 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1566 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1568 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1569 "j <= 2 i - 4 and j <= n - 3 or "
1570 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1571 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1572 map
= isl_map_power(map
, &exact
);
1576 /* COCOA Fig.2 right */
1577 map
= isl_map_read_from_str(ctx
,
1578 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1579 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1581 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1582 "j <= 2 i - 4 and j <= n - 3 or "
1583 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1584 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1585 map
= isl_map_transitive_closure(map
, &exact
);
1587 map2
= isl_map_read_from_str(ctx
,
1588 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1589 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1590 "j <= n and 3 + i + 2 j <= 3 n and "
1591 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1592 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1593 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1594 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1595 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1596 assert(isl_map_is_equal(map
, map2
));
1600 /* COCOA Fig.1 right */
1601 dom
= isl_set_read_from_str(ctx
,
1602 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1603 "2 x - 3 y + 3 >= 0 }");
1604 right
= isl_map_read_from_str(ctx
,
1605 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1606 up
= isl_map_read_from_str(ctx
,
1607 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1608 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
1609 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
1610 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
1611 up
= isl_map_intersect_range(up
, dom
);
1612 map
= isl_map_union(up
, right
);
1613 map
= isl_map_transitive_closure(map
, &exact
);
1615 map2
= isl_map_read_from_str(ctx
,
1616 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1617 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1618 assert(isl_map_is_equal(map
, map2
));
1622 /* COCOA Theorem 1 counter example */
1623 map
= isl_map_read_from_str(ctx
,
1624 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1625 "i2 = 1 and j2 = j or "
1626 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1627 map
= isl_map_transitive_closure(map
, &exact
);
1631 map
= isl_map_read_from_str(ctx
,
1632 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1633 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1634 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1635 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1636 map
= isl_map_transitive_closure(map
, &exact
);
1640 /* Kelly et al 1996, fig 12 */
1641 map
= isl_map_read_from_str(ctx
,
1642 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1643 "1 <= i,j,j+1 <= n or "
1644 "j = n and j2 = 1 and i2 = i + 1 and "
1645 "1 <= i,i+1 <= n }");
1646 map
= isl_map_transitive_closure(map
, &exact
);
1648 map2
= isl_map_read_from_str(ctx
,
1649 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1650 "1 <= i <= n and i = i2 or "
1651 "1 <= i < i2 <= n and 1 <= j <= n and "
1653 assert(isl_map_is_equal(map
, map2
));
1657 /* Omega's closure4 */
1658 map
= isl_map_read_from_str(ctx
,
1659 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1660 "1 <= x,y <= 10 or "
1661 "x2 = x + 1 and y2 = y and "
1662 "1 <= x <= 20 && 5 <= y <= 15 }");
1663 map
= isl_map_transitive_closure(map
, &exact
);
1667 map
= isl_map_read_from_str(ctx
,
1668 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1669 map
= isl_map_transitive_closure(map
, &exact
);
1671 map2
= isl_map_read_from_str(ctx
,
1672 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1673 assert(isl_map_is_equal(map
, map2
));
1677 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1678 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1679 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1680 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1681 map
= isl_map_read_from_str(ctx
, str
);
1682 map
= isl_map_transitive_closure(map
, &exact
);
1684 map2
= isl_map_read_from_str(ctx
, str
);
1685 assert(isl_map_is_equal(map
, map2
));
1689 str
= "{[0] -> [1]; [2] -> [3]}";
1690 map
= isl_map_read_from_str(ctx
, str
);
1691 map
= isl_map_transitive_closure(map
, &exact
);
1693 map2
= isl_map_read_from_str(ctx
, str
);
1694 assert(isl_map_is_equal(map
, map2
));
1698 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1699 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1700 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1701 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1702 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1703 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1704 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1705 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1706 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1707 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1708 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1709 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1710 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1711 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1712 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1713 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1714 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1715 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1716 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1717 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1718 map
= isl_map_read_from_str(ctx
, str
);
1719 map
= isl_map_transitive_closure(map
, NULL
);
1724 void test_lex(struct isl_ctx
*ctx
)
1729 dim
= isl_space_set_alloc(ctx
, 0, 0);
1730 map
= isl_map_lex_le(dim
);
1731 assert(!isl_map_is_empty(map
));
1735 static int test_lexmin(struct isl_ctx
*ctx
)
1739 isl_basic_map
*bmap
;
1740 isl_map
*map
, *map2
;
1743 isl_pw_multi_aff
*pma
;
1745 str
= "[p0, p1] -> { [] -> [] : "
1746 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1747 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1748 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1749 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1750 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1751 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1752 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1753 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1754 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1755 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1756 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1757 map
= isl_map_read_from_str(ctx
, str
);
1758 map
= isl_map_lexmin(map
);
1761 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1762 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1763 set
= isl_set_read_from_str(ctx
, str
);
1764 set
= isl_set_lexmax(set
);
1765 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
1766 set2
= isl_set_read_from_str(ctx
, str
);
1767 set
= isl_set_intersect(set
, set2
);
1768 assert(!isl_set_is_empty(set
));
1771 str
= "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1772 map
= isl_map_read_from_str(ctx
, str
);
1773 map
= isl_map_lexmin(map
);
1774 str
= "{ [x] -> [5] : 6 <= x <= 8; "
1775 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1776 map2
= isl_map_read_from_str(ctx
, str
);
1777 assert(isl_map_is_equal(map
, map2
));
1781 str
= "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1782 map
= isl_map_read_from_str(ctx
, str
);
1783 map2
= isl_map_copy(map
);
1784 map
= isl_map_lexmin(map
);
1785 assert(isl_map_is_equal(map
, map2
));
1789 str
= "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1790 map
= isl_map_read_from_str(ctx
, str
);
1791 map
= isl_map_lexmin(map
);
1792 str
= "{ [x] -> [y] : (4y = x and x >= 0) or "
1793 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1794 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1795 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1796 map2
= isl_map_read_from_str(ctx
, str
);
1797 assert(isl_map_is_equal(map
, map2
));
1801 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1802 " 8i' <= i and 8i' >= -7 + i }";
1803 bmap
= isl_basic_map_read_from_str(ctx
, str
);
1804 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
1805 map2
= isl_map_from_pw_multi_aff(pma
);
1806 map
= isl_map_from_basic_map(bmap
);
1807 assert(isl_map_is_equal(map
, map2
));
1811 str
= "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
1812 map
= isl_map_read_from_str(ctx
, str
);
1813 map
= isl_map_lexmin(map
);
1814 str
= "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
1815 map2
= isl_map_read_from_str(ctx
, str
);
1816 assert(isl_map_is_equal(map
, map2
));
1820 /* Check that empty pieces are properly combined. */
1821 str
= "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
1822 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
1823 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }";
1824 map
= isl_map_read_from_str(ctx
, str
);
1825 map
= isl_map_lexmin(map
);
1826 str
= "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
1827 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
1829 map2
= isl_map_read_from_str(ctx
, str
);
1830 assert(isl_map_is_equal(map
, map2
));
1834 str
= "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1835 " 8i' <= i and 8i' >= -7 + i }";
1836 set
= isl_set_read_from_str(ctx
, str
);
1837 pma
= isl_set_lexmin_pw_multi_aff(isl_set_copy(set
));
1838 set2
= isl_set_from_pw_multi_aff(pma
);
1839 equal
= isl_set_is_equal(set
, set2
);
1845 isl_die(ctx
, isl_error_unknown
,
1846 "unexpected difference between set and "
1847 "piecewise affine expression", return -1);
1852 /* Check that isl_set_min_val and isl_set_max_val compute the correct
1853 * result on non-convex inputs.
1855 static int test_min(struct isl_ctx
*ctx
)
1862 set
= isl_set_read_from_str(ctx
, "{ [-1]; [1] }");
1863 aff
= isl_aff_read_from_str(ctx
, "{ [x] -> [x] }");
1864 val
= isl_set_min_val(set
, aff
);
1865 min_ok
= isl_val_is_negone(val
);
1867 val
= isl_set_max_val(set
, aff
);
1868 max_ok
= isl_val_is_one(val
);
1873 if (min_ok
< 0 || max_ok
< 0)
1876 isl_die(ctx
, isl_error_unknown
,
1877 "unexpected minimum", return -1);
1879 isl_die(ctx
, isl_error_unknown
,
1880 "unexpected maximum", return -1);
1890 static int collect_must_may(__isl_take isl_map
*dep
, int must
,
1891 void *dep_user
, void *user
)
1893 struct must_may
*mm
= (struct must_may
*)user
;
1896 mm
->must
= isl_map_union(mm
->must
, dep
);
1898 mm
->may
= isl_map_union(mm
->may
, dep
);
1903 static int common_space(void *first
, void *second
)
1905 int depth
= *(int *)first
;
1909 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
1917 map2
= isl_map_read_from_str(map
->ctx
, str
);
1918 equal
= isl_map_is_equal(map
, map2
);
1924 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
1928 equal
= map_is_equal(map
, str
);
1932 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
1933 "result not as expected", return -1);
1937 void test_dep(struct isl_ctx
*ctx
)
1942 isl_access_info
*ai
;
1949 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1950 map
= isl_map_read_from_str(ctx
, str
);
1951 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1953 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1954 map
= isl_map_read_from_str(ctx
, str
);
1955 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1957 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1958 map
= isl_map_read_from_str(ctx
, str
);
1959 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1961 flow
= isl_access_info_compute_flow(ai
);
1962 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1963 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1964 mm
.may
= isl_map_empty(dim
);
1966 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1968 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
1969 " [1,10,0] -> [2,5,0] }";
1970 assert(map_is_equal(mm
.must
, str
));
1971 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1972 assert(map_is_equal(mm
.may
, str
));
1974 isl_map_free(mm
.must
);
1975 isl_map_free(mm
.may
);
1976 isl_flow_free(flow
);
1979 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1980 map
= isl_map_read_from_str(ctx
, str
);
1981 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1983 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1984 map
= isl_map_read_from_str(ctx
, str
);
1985 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1987 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1988 map
= isl_map_read_from_str(ctx
, str
);
1989 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1991 flow
= isl_access_info_compute_flow(ai
);
1992 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1993 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1994 mm
.may
= isl_map_empty(dim
);
1996 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1998 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
1999 assert(map_is_equal(mm
.must
, str
));
2000 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2001 assert(map_is_equal(mm
.may
, str
));
2003 isl_map_free(mm
.must
);
2004 isl_map_free(mm
.may
);
2005 isl_flow_free(flow
);
2008 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2009 map
= isl_map_read_from_str(ctx
, str
);
2010 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2012 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2013 map
= isl_map_read_from_str(ctx
, str
);
2014 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2016 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2017 map
= isl_map_read_from_str(ctx
, str
);
2018 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2020 flow
= isl_access_info_compute_flow(ai
);
2021 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2022 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2023 mm
.may
= isl_map_empty(dim
);
2025 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2027 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2028 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2029 assert(map_is_equal(mm
.may
, str
));
2030 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2031 assert(map_is_equal(mm
.must
, str
));
2033 isl_map_free(mm
.must
);
2034 isl_map_free(mm
.may
);
2035 isl_flow_free(flow
);
2038 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2039 map
= isl_map_read_from_str(ctx
, str
);
2040 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2042 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2043 map
= isl_map_read_from_str(ctx
, str
);
2044 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2046 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2047 map
= isl_map_read_from_str(ctx
, str
);
2048 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2050 flow
= isl_access_info_compute_flow(ai
);
2051 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2052 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2053 mm
.may
= isl_map_empty(dim
);
2055 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2057 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2058 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2059 assert(map_is_equal(mm
.may
, str
));
2060 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2061 assert(map_is_equal(mm
.must
, str
));
2063 isl_map_free(mm
.must
);
2064 isl_map_free(mm
.may
);
2065 isl_flow_free(flow
);
2068 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2069 map
= isl_map_read_from_str(ctx
, str
);
2070 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
2072 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2073 map
= isl_map_read_from_str(ctx
, str
);
2074 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2076 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2077 map
= isl_map_read_from_str(ctx
, str
);
2078 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
2080 flow
= isl_access_info_compute_flow(ai
);
2081 dim
= isl_space_alloc(ctx
, 0, 3, 3);
2082 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2083 mm
.may
= isl_map_empty(dim
);
2085 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2087 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2088 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2089 assert(map_is_equal(mm
.may
, str
));
2090 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2091 assert(map_is_equal(mm
.must
, str
));
2093 isl_map_free(mm
.must
);
2094 isl_map_free(mm
.may
);
2095 isl_flow_free(flow
);
2100 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2101 map
= isl_map_read_from_str(ctx
, str
);
2102 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
2104 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2105 map
= isl_map_read_from_str(ctx
, str
);
2106 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
2108 flow
= isl_access_info_compute_flow(ai
);
2109 dim
= isl_space_alloc(ctx
, 0, 5, 5);
2110 mm
.must
= isl_map_empty(isl_space_copy(dim
));
2111 mm
.may
= isl_map_empty(dim
);
2113 isl_flow_foreach(flow
, collect_must_may
, &mm
);
2115 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
2116 assert(map_is_equal(mm
.must
, str
));
2117 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
2118 assert(map_is_equal(mm
.may
, str
));
2120 isl_map_free(mm
.must
);
2121 isl_map_free(mm
.may
);
2122 isl_flow_free(flow
);
2125 /* Check that the dependence analysis proceeds without errors.
2126 * Earlier versions of isl would break down during the analysis
2127 * due to the use of the wrong spaces.
2129 static int test_flow(isl_ctx
*ctx
)
2132 isl_union_map
*access
, *schedule
;
2133 isl_union_map
*must_dep
, *may_dep
;
2136 str
= "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
2137 access
= isl_union_map_read_from_str(ctx
, str
);
2138 str
= "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
2139 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
2140 "S2[] -> [1,0,0,0]; "
2141 "S3[] -> [-1,0,0,0] }";
2142 schedule
= isl_union_map_read_from_str(ctx
, str
);
2143 r
= isl_union_map_compute_flow(access
, isl_union_map_copy(access
),
2144 isl_union_map_copy(access
), schedule
,
2145 &must_dep
, &may_dep
, NULL
, NULL
);
2146 isl_union_map_free(may_dep
);
2147 isl_union_map_free(must_dep
);
2156 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
2157 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
2158 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
2159 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
2160 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
2161 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
2162 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2163 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2164 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
2167 int test_sv(isl_ctx
*ctx
)
2169 isl_union_map
*umap
;
2173 for (i
= 0; i
< ARRAY_SIZE(sv_tests
); ++i
) {
2174 umap
= isl_union_map_read_from_str(ctx
, sv_tests
[i
].map
);
2175 sv
= isl_union_map_is_single_valued(umap
);
2176 isl_union_map_free(umap
);
2179 if (sv_tests
[i
].sv
&& !sv
)
2180 isl_die(ctx
, isl_error_internal
,
2181 "map not detected as single valued", return -1);
2182 if (!sv_tests
[i
].sv
&& sv
)
2183 isl_die(ctx
, isl_error_internal
,
2184 "map detected as single valued", return -1);
2190 void test_bijective_case(struct isl_ctx
*ctx
, const char *str
, int bijective
)
2194 map
= isl_map_read_from_str(ctx
, str
);
2196 assert(isl_map_is_bijective(map
));
2198 assert(!isl_map_is_bijective(map
));
2202 void test_bijective(struct isl_ctx
*ctx
)
2204 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i]}", 0);
2205 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=i}", 1);
2206 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=0}", 1);
2207 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=N}", 1);
2208 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [j,i]}", 1);
2209 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i+j]}", 0);
2210 test_bijective_case(ctx
, "[N,M]->{[i,j] -> []}", 0);
2211 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,j,N]}", 1);
2212 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i]}", 0);
2213 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,i]}", 0);
2214 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,i]}", 0);
2215 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,j]}", 1);
2216 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1);
2219 /* Inputs for isl_pw_qpolynomial_gist tests.
2220 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
2226 } pwqp_gist_tests
[] = {
2227 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
2228 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
2229 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
2230 "{ [i] -> -1/2 + 1/2 * i }" },
2231 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
2234 static int test_pwqp(struct isl_ctx
*ctx
)
2239 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
2242 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2243 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2245 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
2248 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2249 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2251 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2253 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2255 isl_pw_qpolynomial_free(pwqp1
);
2257 for (i
= 0; i
< ARRAY_SIZE(pwqp_gist_tests
); ++i
) {
2258 str
= pwqp_gist_tests
[i
].pwqp
;
2259 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2260 str
= pwqp_gist_tests
[i
].set
;
2261 set
= isl_set_read_from_str(ctx
, str
);
2262 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
2263 str
= pwqp_gist_tests
[i
].gist
;
2264 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2265 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2266 equal
= isl_pw_qpolynomial_is_zero(pwqp1
);
2267 isl_pw_qpolynomial_free(pwqp1
);
2272 isl_die(ctx
, isl_error_unknown
,
2273 "unexpected result", return -1);
2276 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
2277 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2278 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
2279 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2281 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2283 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2285 isl_pw_qpolynomial_free(pwqp1
);
2287 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
2288 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2289 str
= "{ [x] -> x }";
2290 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2292 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2294 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2296 isl_pw_qpolynomial_free(pwqp1
);
2298 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
2299 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2300 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2301 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
2302 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
2303 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
2304 isl_pw_qpolynomial_free(pwqp1
);
2306 str
= "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
2307 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2308 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2309 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2310 set
= isl_set_read_from_str(ctx
, "{ [a,b,a] }");
2311 pwqp1
= isl_pw_qpolynomial_intersect_domain(pwqp1
, set
);
2312 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2313 isl_pw_qpolynomial_free(pwqp1
);
2314 isl_pw_qpolynomial_free(pwqp2
);
2318 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2320 str
= "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
2321 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2322 str
= "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2323 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2324 pwqp1
= isl_pw_qpolynomial_fix_val(pwqp1
, isl_dim_set
, 1,
2326 equal
= isl_pw_qpolynomial_plain_is_equal(pwqp1
, pwqp2
);
2327 isl_pw_qpolynomial_free(pwqp1
);
2328 isl_pw_qpolynomial_free(pwqp2
);
2332 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2337 void test_split_periods(isl_ctx
*ctx
)
2340 isl_pw_qpolynomial
*pwqp
;
2342 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
2343 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
2344 "U >= 0; [U,V] -> U^2 : U >= 100 }";
2345 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2347 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
2350 isl_pw_qpolynomial_free(pwqp
);
2353 void test_union(isl_ctx
*ctx
)
2356 isl_union_set
*uset1
, *uset2
;
2357 isl_union_map
*umap1
, *umap2
;
2359 str
= "{ [i] : 0 <= i <= 1 }";
2360 uset1
= isl_union_set_read_from_str(ctx
, str
);
2361 str
= "{ [1] -> [0] }";
2362 umap1
= isl_union_map_read_from_str(ctx
, str
);
2364 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
2365 assert(isl_union_map_is_equal(umap1
, umap2
));
2367 isl_union_map_free(umap1
);
2368 isl_union_map_free(umap2
);
2370 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
2371 umap1
= isl_union_map_read_from_str(ctx
, str
);
2372 str
= "{ A[i]; B[i] }";
2373 uset1
= isl_union_set_read_from_str(ctx
, str
);
2375 uset2
= isl_union_map_domain(umap1
);
2377 assert(isl_union_set_is_equal(uset1
, uset2
));
2379 isl_union_set_free(uset1
);
2380 isl_union_set_free(uset2
);
2383 void test_bound(isl_ctx
*ctx
)
2386 isl_pw_qpolynomial
*pwqp
;
2387 isl_pw_qpolynomial_fold
*pwf
;
2389 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
2390 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2391 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2392 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 4);
2393 isl_pw_qpolynomial_fold_free(pwf
);
2395 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
2396 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2397 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2398 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 1);
2399 isl_pw_qpolynomial_fold_free(pwf
);
2402 void test_lift(isl_ctx
*ctx
)
2405 isl_basic_map
*bmap
;
2406 isl_basic_set
*bset
;
2408 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
2409 bset
= isl_basic_set_read_from_str(ctx
, str
);
2410 bset
= isl_basic_set_lift(bset
);
2411 bmap
= isl_basic_map_from_range(bset
);
2412 bset
= isl_basic_map_domain(bmap
);
2413 isl_basic_set_free(bset
);
2420 } subset_tests
[] = {
2422 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
2423 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
2424 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
2426 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
2427 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
2428 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
2429 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
2430 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
2431 "256e0 <= 255i and 256e0 >= -255 + 255i and "
2432 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
2433 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
2434 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
2435 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
2436 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
2437 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
2438 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
2439 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
2440 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
2441 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
2442 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
2443 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
2444 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
2445 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
2446 "4e0 <= -57 + i0 + i1)) or "
2447 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
2448 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
2449 "4e0 >= -61 + i0 + i1)) or "
2450 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
2453 static int test_subset(isl_ctx
*ctx
)
2456 isl_set
*set1
, *set2
;
2459 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
2460 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
2461 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
2462 subset
= isl_set_is_subset(set1
, set2
);
2467 if (subset
!= subset_tests
[i
].subset
)
2468 isl_die(ctx
, isl_error_unknown
,
2469 "incorrect subset result", return -1);
2476 const char *minuend
;
2477 const char *subtrahend
;
2478 const char *difference
;
2479 } subtract_domain_tests
[] = {
2480 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
2481 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
2482 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
2485 static int test_subtract(isl_ctx
*ctx
)
2488 isl_union_map
*umap1
, *umap2
;
2489 isl_union_pw_multi_aff
*upma1
, *upma2
;
2490 isl_union_set
*uset
;
2493 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
2494 umap1
= isl_union_map_read_from_str(ctx
,
2495 subtract_domain_tests
[i
].minuend
);
2496 uset
= isl_union_set_read_from_str(ctx
,
2497 subtract_domain_tests
[i
].subtrahend
);
2498 umap2
= isl_union_map_read_from_str(ctx
,
2499 subtract_domain_tests
[i
].difference
);
2500 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
2501 equal
= isl_union_map_is_equal(umap1
, umap2
);
2502 isl_union_map_free(umap1
);
2503 isl_union_map_free(umap2
);
2507 isl_die(ctx
, isl_error_unknown
,
2508 "incorrect subtract domain result", return -1);
2511 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
2512 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
2513 subtract_domain_tests
[i
].minuend
);
2514 uset
= isl_union_set_read_from_str(ctx
,
2515 subtract_domain_tests
[i
].subtrahend
);
2516 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
2517 subtract_domain_tests
[i
].difference
);
2518 upma1
= isl_union_pw_multi_aff_subtract_domain(upma1
, uset
);
2519 equal
= isl_union_pw_multi_aff_plain_is_equal(upma1
, upma2
);
2520 isl_union_pw_multi_aff_free(upma1
);
2521 isl_union_pw_multi_aff_free(upma2
);
2525 isl_die(ctx
, isl_error_unknown
,
2526 "incorrect subtract domain result", return -1);
2532 int test_factorize(isl_ctx
*ctx
)
2535 isl_basic_set
*bset
;
2538 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
2539 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
2540 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
2541 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
2542 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
2543 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
2544 "3i5 >= -2i0 - i2 + 3i4 }";
2545 bset
= isl_basic_set_read_from_str(ctx
, str
);
2546 f
= isl_basic_set_factorizer(bset
);
2547 isl_basic_set_free(bset
);
2548 isl_factorizer_free(f
);
2550 isl_die(ctx
, isl_error_unknown
,
2551 "failed to construct factorizer", return -1);
2553 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2554 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
2555 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
2556 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
2557 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
2558 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
2559 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
2560 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
2561 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
2562 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
2563 bset
= isl_basic_set_read_from_str(ctx
, str
);
2564 f
= isl_basic_set_factorizer(bset
);
2565 isl_basic_set_free(bset
);
2566 isl_factorizer_free(f
);
2568 isl_die(ctx
, isl_error_unknown
,
2569 "failed to construct factorizer", return -1);
2574 static int check_injective(__isl_take isl_map
*map
, void *user
)
2576 int *injective
= user
;
2578 *injective
= isl_map_is_injective(map
);
2581 if (*injective
< 0 || !*injective
)
2587 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
2588 const char *r
, const char *s
, int tilable
, int parallel
)
2592 isl_union_map
*W
, *R
, *S
;
2593 isl_union_map
*empty
;
2594 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
2595 isl_union_map
*validity
, *proximity
, *coincidence
;
2596 isl_union_map
*schedule
;
2597 isl_union_map
*test
;
2598 isl_union_set
*delta
;
2599 isl_union_set
*domain
;
2603 isl_schedule_constraints
*sc
;
2604 isl_schedule
*sched
;
2605 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
2607 D
= isl_union_set_read_from_str(ctx
, d
);
2608 W
= isl_union_map_read_from_str(ctx
, w
);
2609 R
= isl_union_map_read_from_str(ctx
, r
);
2610 S
= isl_union_map_read_from_str(ctx
, s
);
2612 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
2613 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
2615 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
2616 isl_union_map_compute_flow(isl_union_map_copy(R
),
2617 isl_union_map_copy(W
), empty
,
2618 isl_union_map_copy(S
),
2619 &dep_raw
, NULL
, NULL
, NULL
);
2620 isl_union_map_compute_flow(isl_union_map_copy(W
),
2621 isl_union_map_copy(W
),
2622 isl_union_map_copy(R
),
2623 isl_union_map_copy(S
),
2624 &dep_waw
, &dep_war
, NULL
, NULL
);
2626 dep
= isl_union_map_union(dep_waw
, dep_war
);
2627 dep
= isl_union_map_union(dep
, dep_raw
);
2628 validity
= isl_union_map_copy(dep
);
2629 coincidence
= isl_union_map_copy(dep
);
2630 proximity
= isl_union_map_copy(dep
);
2632 sc
= isl_schedule_constraints_on_domain(isl_union_set_copy(D
));
2633 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
2634 sc
= isl_schedule_constraints_set_coincidence(sc
, coincidence
);
2635 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
2636 sched
= isl_schedule_constraints_compute_schedule(sc
);
2637 schedule
= isl_schedule_get_map(sched
);
2638 isl_schedule_free(sched
);
2639 isl_union_map_free(W
);
2640 isl_union_map_free(R
);
2641 isl_union_map_free(S
);
2644 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
2646 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
2647 is_complete
= isl_union_set_is_subset(D
, domain
);
2648 isl_union_set_free(D
);
2649 isl_union_set_free(domain
);
2651 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
2652 test
= isl_union_map_apply_range(test
, dep
);
2653 test
= isl_union_map_apply_range(test
, schedule
);
2655 delta
= isl_union_map_deltas(test
);
2656 if (isl_union_set_n_set(delta
) == 0) {
2660 isl_union_set_free(delta
);
2662 delta_set
= isl_set_from_union_set(delta
);
2664 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2665 for (i
= 0; i
< tilable
; ++i
)
2666 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
2667 is_tilable
= isl_set_is_subset(delta_set
, slice
);
2668 isl_set_free(slice
);
2670 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2671 for (i
= 0; i
< parallel
; ++i
)
2672 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
2673 is_parallel
= isl_set_is_subset(delta_set
, slice
);
2674 isl_set_free(slice
);
2676 origin
= isl_set_universe(isl_set_get_space(delta_set
));
2677 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
2678 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
2680 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
2681 delta_set
= isl_set_lexmin(delta_set
);
2683 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
2685 isl_set_free(origin
);
2686 isl_set_free(delta_set
);
2689 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
2690 is_injection
< 0 || is_complete
< 0)
2693 isl_die(ctx
, isl_error_unknown
,
2694 "generated schedule incomplete", return -1);
2696 isl_die(ctx
, isl_error_unknown
,
2697 "generated schedule not injective on each statement",
2700 isl_die(ctx
, isl_error_unknown
,
2701 "negative dependences in generated schedule",
2704 isl_die(ctx
, isl_error_unknown
,
2705 "generated schedule not as tilable as expected",
2708 isl_die(ctx
, isl_error_unknown
,
2709 "generated schedule not as parallel as expected",
2715 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
2716 const char *domain
, const char *validity
, const char *proximity
)
2720 isl_union_map
*prox
;
2721 isl_schedule_constraints
*sc
;
2722 isl_schedule
*schedule
;
2723 isl_union_map
*sched
;
2725 dom
= isl_union_set_read_from_str(ctx
, domain
);
2726 dep
= isl_union_map_read_from_str(ctx
, validity
);
2727 prox
= isl_union_map_read_from_str(ctx
, proximity
);
2728 sc
= isl_schedule_constraints_on_domain(dom
);
2729 sc
= isl_schedule_constraints_set_validity(sc
, dep
);
2730 sc
= isl_schedule_constraints_set_proximity(sc
, prox
);
2731 schedule
= isl_schedule_constraints_compute_schedule(sc
);
2732 sched
= isl_schedule_get_map(schedule
);
2733 isl_schedule_free(schedule
);
2738 /* Check that a schedule can be constructed on the given domain
2739 * with the given validity and proximity constraints.
2741 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
2742 const char *validity
, const char *proximity
)
2744 isl_union_map
*sched
;
2746 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
2750 isl_union_map_free(sched
);
2754 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
2755 const char *validity
, const char *proximity
, const char *expected_sched
)
2757 isl_union_map
*sched1
, *sched2
;
2760 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
2761 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
2763 equal
= isl_union_map_is_equal(sched1
, sched2
);
2764 isl_union_map_free(sched1
);
2765 isl_union_map_free(sched2
);
2770 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
2776 /* Check that the schedule map is properly padded, even after being
2777 * reconstructed from the band forest.
2779 static int test_padded_schedule(isl_ctx
*ctx
)
2783 isl_union_map
*validity
, *proximity
;
2784 isl_schedule_constraints
*sc
;
2785 isl_schedule
*sched
;
2786 isl_union_map
*map1
, *map2
;
2787 isl_band_list
*list
;
2790 str
= "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
2791 D
= isl_union_set_read_from_str(ctx
, str
);
2792 validity
= isl_union_map_empty(isl_union_set_get_space(D
));
2793 proximity
= isl_union_map_copy(validity
);
2794 sc
= isl_schedule_constraints_on_domain(D
);
2795 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
2796 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
2797 sched
= isl_schedule_constraints_compute_schedule(sc
);
2798 map1
= isl_schedule_get_map(sched
);
2799 list
= isl_schedule_get_band_forest(sched
);
2800 isl_band_list_free(list
);
2801 map2
= isl_schedule_get_map(sched
);
2802 isl_schedule_free(sched
);
2803 equal
= isl_union_map_is_equal(map1
, map2
);
2804 isl_union_map_free(map1
);
2805 isl_union_map_free(map2
);
2810 isl_die(ctx
, isl_error_unknown
,
2811 "reconstructed schedule map not the same as original",
2817 /* Input for testing of schedule construction based on
2818 * conditional constraints.
2820 * domain is the iteration domain
2821 * flow are the flow dependences, which determine the validity and
2822 * proximity constraints
2823 * condition are the conditions on the conditional validity constraints
2824 * conditional_validity are the conditional validity constraints
2825 * outer_band_n is the expected number of members in the outer band
2830 const char *condition
;
2831 const char *conditional_validity
;
2833 } live_range_tests
[] = {
2834 /* Contrived example that illustrates that we need to keep
2835 * track of tagged condition dependences and
2836 * tagged conditional validity dependences
2837 * in isl_sched_edge separately.
2838 * In particular, the conditional validity constraints on A
2839 * cannot be satisfied,
2840 * but they can be ignored because there are no corresponding
2841 * condition constraints. However, we do have an additional
2842 * conditional validity constraint that maps to the same
2843 * dependence relation
2844 * as the condition constraint on B. If we did not make a distinction
2845 * between tagged condition and tagged conditional validity
2846 * dependences, then we
2847 * could end up treating this shared dependence as an condition
2848 * constraint on A, forcing a localization of the conditions,
2849 * which is impossible.
2851 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
2852 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
2853 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
2854 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
2855 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
2856 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
2859 /* TACO 2013 Fig. 7 */
2860 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
2861 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
2862 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
2863 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
2864 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
2865 "0 <= i < n and 0 <= j < n - 1 }",
2866 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
2867 "0 <= i < n and 0 <= j < j' < n;"
2868 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
2869 "0 <= i < i' < n and 0 <= j,j' < n;"
2870 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
2871 "0 <= i,j,j' < n and j < j' }",
2874 /* TACO 2013 Fig. 7, without tags */
2875 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
2876 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
2877 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
2878 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
2879 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
2880 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
2881 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
2882 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
2885 /* TACO 2013 Fig. 12 */
2886 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
2887 "S3[i,3] : 0 <= i <= 1 }",
2888 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
2889 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
2890 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
2891 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
2892 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
2893 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
2894 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
2895 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
2896 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
2897 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
2898 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
2903 /* Test schedule construction based on conditional constraints.
2904 * In particular, check the number of members in the outer band
2905 * as an indication of whether tiling is possible or not.
2907 static int test_conditional_schedule_constraints(isl_ctx
*ctx
)
2910 isl_union_set
*domain
;
2911 isl_union_map
*condition
;
2912 isl_union_map
*flow
;
2913 isl_union_map
*validity
;
2914 isl_schedule_constraints
*sc
;
2915 isl_schedule
*schedule
;
2916 isl_band_list
*list
;
2920 for (i
= 0; i
< ARRAY_SIZE(live_range_tests
); ++i
) {
2921 domain
= isl_union_set_read_from_str(ctx
,
2922 live_range_tests
[i
].domain
);
2923 flow
= isl_union_map_read_from_str(ctx
,
2924 live_range_tests
[i
].flow
);
2925 condition
= isl_union_map_read_from_str(ctx
,
2926 live_range_tests
[i
].condition
);
2927 validity
= isl_union_map_read_from_str(ctx
,
2928 live_range_tests
[i
].conditional_validity
);
2929 sc
= isl_schedule_constraints_on_domain(domain
);
2930 sc
= isl_schedule_constraints_set_validity(sc
,
2931 isl_union_map_copy(flow
));
2932 sc
= isl_schedule_constraints_set_proximity(sc
, flow
);
2933 sc
= isl_schedule_constraints_set_conditional_validity(sc
,
2934 condition
, validity
);
2935 schedule
= isl_schedule_constraints_compute_schedule(sc
);
2936 list
= isl_schedule_get_band_forest(schedule
);
2937 band
= isl_band_list_get_band(list
, 0);
2938 n_member
= isl_band_n_member(band
);
2939 isl_band_free(band
);
2940 isl_band_list_free(list
);
2941 isl_schedule_free(schedule
);
2945 if (n_member
!= live_range_tests
[i
].outer_band_n
)
2946 isl_die(ctx
, isl_error_unknown
,
2947 "unexpected number of members in outer band",
2953 int test_schedule(isl_ctx
*ctx
)
2955 const char *D
, *W
, *R
, *V
, *P
, *S
;
2957 /* Handle resulting schedule with zero bands. */
2958 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
2962 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
2963 W
= "{ S1[t,i] -> a[t,i] }";
2964 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
2965 "S1[t,i] -> a[t-1,i+1] }";
2966 S
= "{ S1[t,i] -> [t,i] }";
2967 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2970 /* Fig. 5 of CC2008 */
2971 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
2973 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
2974 "j >= 2 and j <= -1 + N }";
2975 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
2976 "j >= 2 and j <= -1 + N; "
2977 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
2978 "j >= 2 and j <= -1 + N }";
2979 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2980 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2983 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
2984 W
= "{ S1[i] -> a[i] }";
2985 R
= "{ S2[i] -> a[i+1] }";
2986 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2987 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2990 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
2991 W
= "{ S1[i] -> a[i] }";
2992 R
= "{ S2[i] -> a[9-i] }";
2993 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2994 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2997 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
2998 W
= "{ S1[i] -> a[i] }";
2999 R
= "[N] -> { S2[i] -> a[N-1-i] }";
3000 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3001 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
3004 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
3005 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
3006 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
3007 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
3008 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3011 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3012 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
3013 R
= "{ S2[i,j] -> a[i-1,j] }";
3014 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3015 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3018 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3019 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
3020 R
= "{ S2[i,j] -> a[i,j-1] }";
3021 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3022 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3025 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
3026 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
3027 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
3028 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
3029 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
3030 "S_0[] -> [0, 0, 0] }";
3031 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
3033 ctx
->opt
->schedule_parametric
= 0;
3034 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3036 ctx
->opt
->schedule_parametric
= 1;
3038 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
3039 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
3040 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
3041 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
3042 "S4[i] -> a[i,N] }";
3043 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
3044 "S4[i] -> [4,i,0] }";
3045 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
3048 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
3049 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3051 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3053 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
3055 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3056 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3059 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
3060 " S_2[t] : t >= 0 and t <= -1 + N; "
3061 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
3063 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
3064 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
3065 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
3066 "i >= 0 and i <= -1 + N }";
3067 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
3068 "i >= 0 and i <= -1 + N; "
3069 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
3070 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
3071 " S_0[t] -> [0, t, 0] }";
3073 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
3075 ctx
->opt
->schedule_parametric
= 0;
3076 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3078 ctx
->opt
->schedule_parametric
= 1;
3080 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
3081 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
3082 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
3085 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
3086 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
3087 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
3088 "j >= 0 and j <= -1 + N; "
3089 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3090 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
3091 "j >= 0 and j <= -1 + N; "
3092 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3093 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
3094 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3097 D
= "{ S_0[i] : i >= 0 }";
3098 W
= "{ S_0[i] -> a[i] : i >= 0 }";
3099 R
= "{ S_0[i] -> a[0] : i >= 0 }";
3100 S
= "{ S_0[i] -> [0, i, 0] }";
3101 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3104 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
3105 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
3106 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
3107 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
3108 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3111 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
3112 "k <= -1 + n and k >= 0 }";
3113 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
3114 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
3115 "k <= -1 + n and k >= 0; "
3116 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
3117 "k <= -1 + n and k >= 0; "
3118 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
3119 "k <= -1 + n and k >= 0 }";
3120 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
3121 ctx
->opt
->schedule_outer_coincidence
= 1;
3122 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
3124 ctx
->opt
->schedule_outer_coincidence
= 0;
3126 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
3127 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
3128 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
3129 "Stmt_for_body24[i0, i1, 1, 0]:"
3130 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
3131 "Stmt_for_body7[i0, i1, i2]:"
3132 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
3135 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
3136 "Stmt_for_body24[1, i1, i2, i3]:"
3137 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
3139 "Stmt_for_body24[0, i1, i2, i3] -> "
3140 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
3141 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
3143 "Stmt_for_body24[0, i1, i2, i3] ->"
3144 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
3145 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
3146 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
3147 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
3148 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
3149 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
3150 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
3151 "i1 <= 6 and i1 >= 0;"
3152 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
3153 "Stmt_for_body7[i0, i1, i2] -> "
3154 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
3155 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
3156 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
3157 "Stmt_for_body7[i0, i1, i2] -> "
3158 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
3159 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
3160 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
3162 S
= "{ Stmt_for_body24[i0, i1, i2, i3] -> "
3163 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
3164 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
3166 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3169 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
3170 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
3171 "j >= 1 and j <= 7;"
3172 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
3173 "j >= 1 and j <= 8 }";
3175 S
= "{ S_0[i, j] -> [i + j, j] }";
3176 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3177 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3179 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3181 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
3182 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
3183 "j >= 0 and j <= -1 + i }";
3184 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
3185 "i <= -1 + N and j >= 0;"
3186 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
3189 S
= "{ S_0[i, j] -> [i, j] }";
3190 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3191 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3193 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3195 /* Test both algorithms on a case with only proximity dependences. */
3196 D
= "{ S[i,j] : 0 <= i <= 10 }";
3198 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
3199 S
= "{ S[i, j] -> [j, i] }";
3200 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3201 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3203 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3204 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
3207 D
= "{ A[a]; B[] }";
3209 P
= "{ A[a] -> B[] }";
3210 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
3213 if (test_padded_schedule(ctx
) < 0)
3216 /* Check that check for progress is not confused by rational
3219 D
= "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
3220 V
= "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
3222 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
3223 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
3225 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3226 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
3228 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3230 /* Check that we allow schedule rows that are only non-trivial
3231 * on some full-dimensional domains.
3233 D
= "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
3234 V
= "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
3235 "S1[j] -> S2[1] : 0 <= j <= 1 }";
3237 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
3238 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
3240 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
3242 if (test_conditional_schedule_constraints(ctx
) < 0)
3248 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
3250 isl_union_map
*umap
;
3253 umap
= isl_union_map_read_from_str(ctx
, str
);
3254 test
= isl_union_map_plain_is_injective(umap
);
3255 isl_union_map_free(umap
);
3258 if (test
== injective
)
3261 isl_die(ctx
, isl_error_unknown
,
3262 "map not detected as injective", return -1);
3264 isl_die(ctx
, isl_error_unknown
,
3265 "map detected as injective", return -1);
3268 int test_injective(isl_ctx
*ctx
)
3272 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
3274 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
3276 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
3278 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
3280 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
3282 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
3284 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
3286 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
3289 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
3290 if (test_plain_injective(ctx
, str
, 1))
3292 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
3293 if (test_plain_injective(ctx
, str
, 0))
3299 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
3307 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
3308 equal
= isl_aff_plain_is_equal(aff
, aff2
);
3314 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
3318 equal
= aff_plain_is_equal(aff
, str
);
3322 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
3323 "result not as expected", return -1);
3328 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
3329 __isl_take isl_aff
*aff2
);
3331 ['+'] = { &isl_aff_add
},
3332 ['-'] = { &isl_aff_sub
},
3333 ['*'] = { &isl_aff_mul
},
3334 ['/'] = { &isl_aff_div
},
3342 } aff_bin_tests
[] = {
3343 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
3344 "{ [i] -> [2i] }" },
3345 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
3347 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
3348 "{ [i] -> [2i] }" },
3349 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
3350 "{ [i] -> [2i] }" },
3351 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
3352 "{ [i] -> [i/2] }" },
3353 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
3355 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
3356 "{ [i] -> [NaN] }" },
3357 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
3358 "{ [i] -> [NaN] }" },
3359 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
3360 "{ [i] -> [NaN] }" },
3361 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
3362 "{ [i] -> [NaN] }" },
3363 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
3364 "{ [i] -> [NaN] }" },
3365 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
3366 "{ [i] -> [NaN] }" },
3367 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
3368 "{ [i] -> [NaN] }" },
3369 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
3370 "{ [i] -> [NaN] }" },
3371 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
3372 "{ [i] -> [NaN] }" },
3373 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
3374 "{ [i] -> [NaN] }" },
3375 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
3376 "{ [i] -> [NaN] }" },
3377 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
3378 "{ [i] -> [NaN] }" },
3381 /* Perform some basic tests of binary operations on isl_aff objects.
3383 static int test_bin_aff(isl_ctx
*ctx
)
3386 isl_aff
*aff1
, *aff2
, *res
;
3387 __isl_give isl_aff
*(*fn
)(__isl_take isl_aff
*aff1
,
3388 __isl_take isl_aff
*aff2
);
3391 for (i
= 0; i
< ARRAY_SIZE(aff_bin_tests
); ++i
) {
3392 aff1
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg1
);
3393 aff2
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].arg2
);
3394 res
= isl_aff_read_from_str(ctx
, aff_bin_tests
[i
].res
);
3395 fn
= aff_bin_op
[aff_bin_tests
[i
].op
].fn
;
3396 aff1
= fn(aff1
, aff2
);
3397 if (isl_aff_is_nan(res
))
3398 ok
= isl_aff_is_nan(aff1
);
3400 ok
= isl_aff_plain_is_equal(aff1
, res
);
3406 isl_die(ctx
, isl_error_unknown
,
3407 "unexpected result", return -1);
3414 __isl_give isl_union_pw_multi_aff
*(*fn
)(
3415 __isl_take isl_union_pw_multi_aff
*upma1
,
3416 __isl_take isl_union_pw_multi_aff
*upma2
);
3420 } upma_bin_tests
[] = {
3421 { &isl_union_pw_multi_aff_add
, "{ A[] -> [0]; B[0] -> [1] }",
3422 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
3423 { &isl_union_pw_multi_aff_union_add
, "{ A[] -> [0]; B[0] -> [1] }",
3424 "{ B[x] -> [2] : x >= 0 }",
3425 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
3428 /* Perform some basic tests of binary operations on
3429 * isl_union_pw_multi_aff objects.
3431 static int test_bin_upma(isl_ctx
*ctx
)
3434 isl_union_pw_multi_aff
*upma1
, *upma2
, *res
;
3437 for (i
= 0; i
< ARRAY_SIZE(upma_bin_tests
); ++i
) {
3438 upma1
= isl_union_pw_multi_aff_read_from_str(ctx
,
3439 upma_bin_tests
[i
].arg1
);
3440 upma2
= isl_union_pw_multi_aff_read_from_str(ctx
,
3441 upma_bin_tests
[i
].arg2
);
3442 res
= isl_union_pw_multi_aff_read_from_str(ctx
,
3443 upma_bin_tests
[i
].res
);
3444 upma1
= upma_bin_tests
[i
].fn(upma1
, upma2
);
3445 ok
= isl_union_pw_multi_aff_plain_is_equal(upma1
, res
);
3446 isl_union_pw_multi_aff_free(upma1
);
3447 isl_union_pw_multi_aff_free(res
);
3451 isl_die(ctx
, isl_error_unknown
,
3452 "unexpected result", return -1);
3458 int test_aff(isl_ctx
*ctx
)
3463 isl_local_space
*ls
;
3467 if (test_bin_aff(ctx
) < 0)
3469 if (test_bin_upma(ctx
) < 0)
3472 space
= isl_space_set_alloc(ctx
, 0, 1);
3473 ls
= isl_local_space_from_space(space
);
3474 aff
= isl_aff_zero_on_domain(ls
);
3476 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
3477 aff
= isl_aff_scale_down_ui(aff
, 3);
3478 aff
= isl_aff_floor(aff
);
3479 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
3480 aff
= isl_aff_scale_down_ui(aff
, 2);
3481 aff
= isl_aff_floor(aff
);
3482 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
3485 set
= isl_set_read_from_str(ctx
, str
);
3486 aff
= isl_aff_gist(aff
, set
);
3488 aff
= isl_aff_add_constant_si(aff
, -16);
3489 zero
= isl_aff_plain_is_zero(aff
);
3495 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3497 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
3498 aff
= isl_aff_scale_down_ui(aff
, 64);
3499 aff
= isl_aff_floor(aff
);
3500 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
3508 int test_dim_max(isl_ctx
*ctx
)
3512 isl_set
*set1
, *set2
;
3517 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
3518 set
= isl_set_read_from_str(ctx
, str
);
3519 pwaff
= isl_set_dim_max(set
, 0);
3520 set1
= isl_set_from_pw_aff(pwaff
);
3521 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
3522 set2
= isl_set_read_from_str(ctx
, str
);
3523 equal
= isl_set_is_equal(set1
, set2
);
3529 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3531 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
3532 set
= isl_set_read_from_str(ctx
, str
);
3533 pwaff
= isl_set_dim_max(set
, 0);
3534 set1
= isl_set_from_pw_aff(pwaff
);
3535 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
3536 set2
= isl_set_read_from_str(ctx
, str
);
3537 equal
= isl_set_is_equal(set1
, set2
);
3543 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3545 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
3546 set
= isl_set_read_from_str(ctx
, str
);
3547 pwaff
= isl_set_dim_max(set
, 0);
3548 set1
= isl_set_from_pw_aff(pwaff
);
3549 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
3550 set2
= isl_set_read_from_str(ctx
, str
);
3551 equal
= isl_set_is_equal(set1
, set2
);
3557 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3559 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
3560 "0 <= i < N and 0 <= j < M }";
3561 map
= isl_map_read_from_str(ctx
, str
);
3562 set
= isl_map_range(map
);
3564 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
3565 set1
= isl_set_from_pw_aff(pwaff
);
3566 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
3567 set2
= isl_set_read_from_str(ctx
, str
);
3568 equal
= isl_set_is_equal(set1
, set2
);
3572 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
3573 set1
= isl_set_from_pw_aff(pwaff
);
3574 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
3575 set2
= isl_set_read_from_str(ctx
, str
);
3576 if (equal
>= 0 && equal
)
3577 equal
= isl_set_is_equal(set1
, set2
);
3586 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3588 /* Check that solutions are properly merged. */
3589 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
3590 "c <= -1 + n - 4a - 2b and c >= -2b and "
3591 "4a >= -4 + n and c >= 0 }";
3592 set
= isl_set_read_from_str(ctx
, str
);
3593 pwaff
= isl_set_dim_min(set
, 2);
3594 set1
= isl_set_from_pw_aff(pwaff
);
3595 str
= "[n] -> { [(0)] : n >= 1 }";
3596 set2
= isl_set_read_from_str(ctx
, str
);
3597 equal
= isl_set_is_equal(set1
, set2
);
3604 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3606 /* Check that empty solution lie in the right space. */
3607 str
= "[n] -> { [t,a] : 1 = 0 }";
3608 set
= isl_set_read_from_str(ctx
, str
);
3609 pwaff
= isl_set_dim_max(set
, 0);
3610 set1
= isl_set_from_pw_aff(pwaff
);
3611 str
= "[n] -> { [t] : 1 = 0 }";
3612 set2
= isl_set_read_from_str(ctx
, str
);
3613 equal
= isl_set_is_equal(set1
, set2
);
3620 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3625 /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
3627 static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff
*pma
,
3631 isl_pw_multi_aff
*pma2
;
3637 ctx
= isl_pw_multi_aff_get_ctx(pma
);
3638 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3639 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma2
);
3640 isl_pw_multi_aff_free(pma2
);
3645 /* Check that "pma" is obviously equal to the isl_pw_multi_aff
3646 * represented by "str".
3648 static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff
*pma
,
3653 equal
= pw_multi_aff_plain_is_equal(pma
, str
);
3657 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_unknown
,
3658 "result not as expected", return -1);
3662 /* Basic test for isl_pw_multi_aff_product.
3664 * Check that multiple pieces are properly handled.
3666 static int test_product_pma(isl_ctx
*ctx
)
3670 isl_pw_multi_aff
*pma1
, *pma2
;
3672 str
= "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
3673 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3674 str
= "{ C[] -> D[] }";
3675 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3676 pma1
= isl_pw_multi_aff_product(pma1
, pma2
);
3677 str
= "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
3678 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
3679 equal
= pw_multi_aff_check_plain_equal(pma1
, str
);
3680 isl_pw_multi_aff_free(pma1
);
3687 int test_product(isl_ctx
*ctx
)
3691 isl_union_set
*uset1
, *uset2
;
3695 set
= isl_set_read_from_str(ctx
, str
);
3696 set
= isl_set_product(set
, isl_set_copy(set
));
3697 ok
= isl_set_is_wrapping(set
);
3702 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3705 uset1
= isl_union_set_read_from_str(ctx
, str
);
3706 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
3707 str
= "{ [[] -> []] }";
3708 uset2
= isl_union_set_read_from_str(ctx
, str
);
3709 ok
= isl_union_set_is_equal(uset1
, uset2
);
3710 isl_union_set_free(uset1
);
3711 isl_union_set_free(uset2
);
3715 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3717 if (test_product_pma(ctx
) < 0)
3723 /* Check that two sets are not considered disjoint just because
3724 * they have a different set of (named) parameters.
3726 static int test_disjoint(isl_ctx
*ctx
)
3729 isl_set
*set
, *set2
;
3732 str
= "[n] -> { [[]->[]] }";
3733 set
= isl_set_read_from_str(ctx
, str
);
3734 str
= "{ [[]->[]] }";
3735 set2
= isl_set_read_from_str(ctx
, str
);
3736 disjoint
= isl_set_is_disjoint(set
, set2
);
3742 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3747 int test_equal(isl_ctx
*ctx
)
3750 isl_set
*set
, *set2
;
3754 set
= isl_set_read_from_str(ctx
, str
);
3756 set2
= isl_set_read_from_str(ctx
, str
);
3757 equal
= isl_set_is_equal(set
, set2
);
3763 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3768 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
3769 enum isl_dim_type type
, unsigned pos
, int fixed
)
3773 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
3780 isl_die(ctx
, isl_error_unknown
,
3781 "map not detected as fixed", return -1);
3783 isl_die(ctx
, isl_error_unknown
,
3784 "map detected as fixed", return -1);
3787 int test_fixed(isl_ctx
*ctx
)
3792 str
= "{ [i] -> [i] }";
3793 map
= isl_map_read_from_str(ctx
, str
);
3794 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
3796 str
= "{ [i] -> [1] }";
3797 map
= isl_map_read_from_str(ctx
, str
);
3798 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
3800 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
3801 map
= isl_map_read_from_str(ctx
, str
);
3802 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
3804 map
= isl_map_read_from_str(ctx
, str
);
3805 map
= isl_map_neg(map
);
3806 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
3812 struct isl_vertices_test_data
{
3815 const char *vertex
[2];
3816 } vertices_tests
[] = {
3817 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
3818 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
3819 { "{ A[t, i] : t = 14 and i = 1 }",
3820 1, { "{ A[14, 1] }" } },
3823 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
3825 static int find_vertex(__isl_take isl_vertex
*vertex
, void *user
)
3827 struct isl_vertices_test_data
*data
= user
;
3830 isl_basic_set
*bset
;
3831 isl_pw_multi_aff
*pma
;
3835 ctx
= isl_vertex_get_ctx(vertex
);
3836 bset
= isl_vertex_get_domain(vertex
);
3837 ma
= isl_vertex_get_expr(vertex
);
3838 pma
= isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset
), ma
);
3840 for (i
= 0; i
< data
->n
; ++i
) {
3841 isl_pw_multi_aff
*pma_i
;
3843 pma_i
= isl_pw_multi_aff_read_from_str(ctx
, data
->vertex
[i
]);
3844 equal
= isl_pw_multi_aff_plain_is_equal(pma
, pma_i
);
3845 isl_pw_multi_aff_free(pma_i
);
3847 if (equal
< 0 || equal
)
3851 isl_pw_multi_aff_free(pma
);
3852 isl_vertex_free(vertex
);
3857 return equal
? 0 : - 1;
3860 int test_vertices(isl_ctx
*ctx
)
3864 for (i
= 0; i
< ARRAY_SIZE(vertices_tests
); ++i
) {
3865 isl_basic_set
*bset
;
3866 isl_vertices
*vertices
;
3870 bset
= isl_basic_set_read_from_str(ctx
, vertices_tests
[i
].set
);
3871 vertices
= isl_basic_set_compute_vertices(bset
);
3872 n
= isl_vertices_get_n_vertices(vertices
);
3873 if (vertices_tests
[i
].n
!= n
)
3875 if (isl_vertices_foreach_vertex(vertices
, &find_vertex
,
3876 &vertices_tests
[i
]) < 0)
3878 isl_vertices_free(vertices
);
3879 isl_basic_set_free(bset
);
3884 isl_die(ctx
, isl_error_unknown
, "unexpected vertices",
3891 int test_union_pw(isl_ctx
*ctx
)
3895 isl_union_set
*uset
;
3896 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
3898 str
= "{ [x] -> x^2 }";
3899 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
3900 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
3901 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
3902 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
3903 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
3904 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
3905 isl_union_pw_qpolynomial_free(upwqp1
);
3906 isl_union_pw_qpolynomial_free(upwqp2
);
3910 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3915 int test_output(isl_ctx
*ctx
)
3923 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
3924 pa
= isl_pw_aff_read_from_str(ctx
, str
);
3926 p
= isl_printer_to_str(ctx
);
3927 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
3928 p
= isl_printer_print_pw_aff(p
, pa
);
3929 s
= isl_printer_get_str(p
);
3930 isl_printer_free(p
);
3931 isl_pw_aff_free(pa
);
3935 equal
= !strcmp(s
, "4 * floord(x, 4) + 2 >= x ? 1 : 2");
3940 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3945 int test_sample(isl_ctx
*ctx
)
3948 isl_basic_set
*bset1
, *bset2
;
3951 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
3952 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
3953 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
3954 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
3955 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
3956 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
3957 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
3958 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
3959 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
3960 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
3961 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
3962 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
3963 "d - 1073741821e and "
3964 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
3965 "3j >= 1 - a + b + 2e and "
3966 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
3967 "3i <= 4 - a + 4b - e and "
3968 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
3969 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
3970 "c <= -1 + a and 3i >= -2 - a + 3e and "
3971 "1073741822e <= 1073741823 - a + 1073741822b + c and "
3972 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
3973 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
3974 "1073741823e >= 1 + 1073741823b - d and "
3975 "3i >= 1073741823b + c - 1073741823e - f and "
3976 "3i >= 1 + 2b + e + 3g }";
3977 bset1
= isl_basic_set_read_from_str(ctx
, str
);
3978 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
3979 empty
= isl_basic_set_is_empty(bset2
);
3980 subset
= isl_basic_set_is_subset(bset2
, bset1
);
3981 isl_basic_set_free(bset1
);
3982 isl_basic_set_free(bset2
);
3983 if (empty
< 0 || subset
< 0)
3986 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
3988 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
3993 int test_fixed_power(isl_ctx
*ctx
)
4001 str
= "{ [i] -> [i + 1] }";
4002 map
= isl_map_read_from_str(ctx
, str
);
4003 isl_int_set_si(exp
, 23);
4004 map
= isl_map_fixed_power(map
, exp
);
4005 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
4014 int test_slice(isl_ctx
*ctx
)
4020 str
= "{ [i] -> [j] }";
4021 map
= isl_map_read_from_str(ctx
, str
);
4022 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
4023 equal
= map_check_equal(map
, "{ [i] -> [i] }");
4028 str
= "{ [i] -> [j] }";
4029 map
= isl_map_read_from_str(ctx
, str
);
4030 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
4031 equal
= map_check_equal(map
, "{ [i] -> [j] }");
4036 str
= "{ [i] -> [j] }";
4037 map
= isl_map_read_from_str(ctx
, str
);
4038 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
4039 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
4044 str
= "{ [i] -> [j] }";
4045 map
= isl_map_read_from_str(ctx
, str
);
4046 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
4047 equal
= map_check_equal(map
, "{ [0] -> [j] }");
4052 str
= "{ [i] -> [j] }";
4053 map
= isl_map_read_from_str(ctx
, str
);
4054 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
4055 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
4060 str
= "{ [i] -> [j] }";
4061 map
= isl_map_read_from_str(ctx
, str
);
4062 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
4063 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
4071 int test_eliminate(isl_ctx
*ctx
)
4077 str
= "{ [i] -> [j] : i = 2j }";
4078 map
= isl_map_read_from_str(ctx
, str
);
4079 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
4080 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
4088 /* Check that isl_set_dim_residue_class detects that the values of j
4089 * in the set below are all odd and that it does not detect any spurious
4092 static int test_residue_class(isl_ctx
*ctx
)
4099 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
4100 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
4101 set
= isl_set_read_from_str(ctx
, str
);
4104 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
4106 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
4107 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
4116 int test_align_parameters(isl_ctx
*ctx
)
4120 isl_multi_aff
*ma1
, *ma2
;
4123 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
4124 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
4126 space
= isl_space_params_alloc(ctx
, 1);
4127 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
4128 ma1
= isl_multi_aff_align_params(ma1
, space
);
4130 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
4131 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
4133 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
4135 isl_multi_aff_free(ma1
);
4136 isl_multi_aff_free(ma2
);
4141 isl_die(ctx
, isl_error_unknown
,
4142 "result not as expected", return -1);
4147 static int test_list(isl_ctx
*ctx
)
4149 isl_id
*a
, *b
, *c
, *d
, *id
;
4153 a
= isl_id_alloc(ctx
, "a", NULL
);
4154 b
= isl_id_alloc(ctx
, "b", NULL
);
4155 c
= isl_id_alloc(ctx
, "c", NULL
);
4156 d
= isl_id_alloc(ctx
, "d", NULL
);
4158 list
= isl_id_list_alloc(ctx
, 4);
4159 list
= isl_id_list_add(list
, a
);
4160 list
= isl_id_list_add(list
, b
);
4161 list
= isl_id_list_add(list
, c
);
4162 list
= isl_id_list_add(list
, d
);
4163 list
= isl_id_list_drop(list
, 1, 1);
4165 if (isl_id_list_n_id(list
) != 3) {
4166 isl_id_list_free(list
);
4167 isl_die(ctx
, isl_error_unknown
,
4168 "unexpected number of elements in list", return -1);
4171 id
= isl_id_list_get_id(list
, 0);
4174 id
= isl_id_list_get_id(list
, 1);
4177 id
= isl_id_list_get_id(list
, 2);
4181 isl_id_list_free(list
);
4184 isl_die(ctx
, isl_error_unknown
,
4185 "unexpected elements in list", return -1);
4190 const char *set_conversion_tests
[] = {
4191 "[N] -> { [i] : N - 1 <= 2 i <= N }",
4192 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
4193 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
4194 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
4195 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
4198 /* Check that converting from isl_set to isl_pw_multi_aff and back
4199 * to isl_set produces the original isl_set.
4201 static int test_set_conversion(isl_ctx
*ctx
)
4205 isl_set
*set1
, *set2
;
4206 isl_pw_multi_aff
*pma
;
4209 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
4210 str
= set_conversion_tests
[i
];
4211 set1
= isl_set_read_from_str(ctx
, str
);
4212 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
4213 set2
= isl_set_from_pw_multi_aff(pma
);
4214 equal
= isl_set_is_equal(set1
, set2
);
4221 isl_die(ctx
, isl_error_unknown
, "bad conversion",
4228 /* Check that converting from isl_map to isl_pw_multi_aff and back
4229 * to isl_map produces the original isl_map.
4231 static int test_map_conversion(isl_ctx
*ctx
)
4234 isl_map
*map1
, *map2
;
4235 isl_pw_multi_aff
*pma
;
4238 str
= "{ [a, b, c, d] -> s0[a, b, e, f] : "
4239 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
4240 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
4241 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
4243 map1
= isl_map_read_from_str(ctx
, str
);
4244 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
4245 map2
= isl_map_from_pw_multi_aff(pma
);
4246 equal
= isl_map_is_equal(map1
, map2
);
4253 isl_die(ctx
, isl_error_unknown
, "bad conversion", return -1);
4258 static int test_conversion(isl_ctx
*ctx
)
4260 if (test_set_conversion(ctx
) < 0)
4262 if (test_map_conversion(ctx
) < 0)
4267 /* Check that isl_basic_map_curry does not modify input.
4269 static int test_curry(isl_ctx
*ctx
)
4272 isl_basic_map
*bmap1
, *bmap2
;
4275 str
= "{ [A[] -> B[]] -> C[] }";
4276 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
4277 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
4278 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
4279 isl_basic_map_free(bmap1
);
4280 isl_basic_map_free(bmap2
);
4285 isl_die(ctx
, isl_error_unknown
,
4286 "curried map should not be equal to original",
4296 } preimage_tests
[] = {
4297 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
4298 "{ A[j,i] -> B[i,j] }",
4299 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
4300 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
4301 "{ A[a,b] -> B[a/2,b/6] }",
4302 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
4303 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
4304 "{ A[a,b] -> B[a/2,b/6] }",
4305 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
4306 "exists i,j : a = 2 i and b = 6 j }" },
4307 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
4308 "[n] -> { : 0 <= n <= 100 }" },
4309 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
4310 "{ A[a] -> B[2a] }",
4311 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
4312 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
4313 "{ A[a] -> B[([a/2])] }",
4314 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
4315 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
4316 "{ A[a] -> B[a,a,a/3] }",
4317 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
4318 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
4319 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
4322 static int test_preimage_basic_set(isl_ctx
*ctx
)
4325 isl_basic_set
*bset1
, *bset2
;
4329 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
4330 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
4331 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
4332 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
4333 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
4334 equal
= isl_basic_set_is_equal(bset1
, bset2
);
4335 isl_basic_set_free(bset1
);
4336 isl_basic_set_free(bset2
);
4340 isl_die(ctx
, isl_error_unknown
, "bad preimage",
4351 } preimage_domain_tests
[] = {
4352 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
4353 "{ A[j,i] -> B[i,j] }",
4354 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
4355 { "{ B[i] -> C[i]; D[i] -> E[i] }",
4356 "{ A[i] -> B[i + 1] }",
4357 "{ A[i] -> C[i + 1] }" },
4358 { "{ B[i] -> C[i]; B[i] -> E[i] }",
4359 "{ A[i] -> B[i + 1] }",
4360 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
4361 { "{ B[i] -> C[([i/2])] }",
4362 "{ A[i] -> B[2i] }",
4363 "{ A[i] -> C[i] }" },
4364 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
4365 "{ A[i] -> B[([i/5]), ([i/7])] }",
4366 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
4367 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
4368 "[N] -> { A[] -> B[([N/5])] }",
4369 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
4370 { "{ B[i] -> C[i] : exists a : i = 5 a }",
4371 "{ A[i] -> B[2i] }",
4372 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
4373 { "{ B[i] -> C[i] : exists a : i = 2 a; "
4374 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
4375 "{ A[i] -> B[2i] }",
4376 "{ A[i] -> C[2i] }" },
4379 static int test_preimage_union_map(isl_ctx
*ctx
)
4382 isl_union_map
*umap1
, *umap2
;
4386 for (i
= 0; i
< ARRAY_SIZE(preimage_domain_tests
); ++i
) {
4387 umap1
= isl_union_map_read_from_str(ctx
,
4388 preimage_domain_tests
[i
].map
);
4389 ma
= isl_multi_aff_read_from_str(ctx
,
4390 preimage_domain_tests
[i
].ma
);
4391 umap2
= isl_union_map_read_from_str(ctx
,
4392 preimage_domain_tests
[i
].res
);
4393 umap1
= isl_union_map_preimage_domain_multi_aff(umap1
, ma
);
4394 equal
= isl_union_map_is_equal(umap1
, umap2
);
4395 isl_union_map_free(umap1
);
4396 isl_union_map_free(umap2
);
4400 isl_die(ctx
, isl_error_unknown
, "bad preimage",
4407 static int test_preimage(isl_ctx
*ctx
)
4409 if (test_preimage_basic_set(ctx
) < 0)
4411 if (test_preimage_union_map(ctx
) < 0)
4421 } pullback_tests
[] = {
4422 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
4423 "{ A[a,b] -> C[b + 2a] }" },
4424 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
4425 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
4426 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
4427 "{ A[a] -> C[(a)/6] }" },
4428 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
4429 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
4430 "{ A[a] -> C[(2a)/3] }" },
4431 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
4432 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
4433 "{ A[i,j] -> C[i + j, i + j] }"},
4434 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
4435 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
4436 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
4439 static int test_pullback(isl_ctx
*ctx
)
4442 isl_multi_aff
*ma1
, *ma2
;
4446 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
4447 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
4448 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
4449 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
4450 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
4451 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
4452 isl_multi_aff_free(ma1
);
4453 isl_multi_aff_free(ma2
);
4457 isl_die(ctx
, isl_error_unknown
, "bad pullback",
4464 /* Check that negation is printed correctly.
4466 static int test_ast(isl_ctx
*ctx
)
4468 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
4472 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
4473 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
4474 expr
= isl_ast_expr_add(expr1
, expr2
);
4475 expr
= isl_ast_expr_neg(expr
);
4476 str
= isl_ast_expr_to_str(expr
);
4477 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
4479 isl_ast_expr_free(expr
);
4484 isl_die(ctx
, isl_error_unknown
,
4485 "isl_ast_expr printed incorrectly", return -1);
4487 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
4488 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
4489 expr
= isl_ast_expr_add(expr1
, expr2
);
4490 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
4491 expr
= isl_ast_expr_sub(expr3
, expr
);
4492 str
= isl_ast_expr_to_str(expr
);
4493 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
4495 isl_ast_expr_free(expr
);
4500 isl_die(ctx
, isl_error_unknown
,
4501 "isl_ast_expr printed incorrectly", return -1);
4506 /* Check that isl_ast_build_expr_from_set returns a valid expression
4507 * for an empty set. Note that isl_ast_build_expr_from_set getting
4508 * called on an empty set probably indicates a bug in the caller.
4510 static int test_ast_build(isl_ctx
*ctx
)
4513 isl_ast_build
*build
;
4516 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4517 build
= isl_ast_build_from_context(set
);
4519 set
= isl_set_empty(isl_space_params_alloc(ctx
, 0));
4520 expr
= isl_ast_build_expr_from_set(build
, set
);
4522 isl_ast_expr_free(expr
);
4523 isl_ast_build_free(build
);
4531 /* Internal data structure for before_for and after_for callbacks.
4533 * depth is the current depth
4534 * before is the number of times before_for has been called
4535 * after is the number of times after_for has been called
4537 struct isl_test_codegen_data
{
4543 /* This function is called before each for loop in the AST generated
4544 * from test_ast_gen1.
4546 * Increment the number of calls and the depth.
4547 * Check that the space returned by isl_ast_build_get_schedule_space
4548 * matches the target space of the schedule returned by
4549 * isl_ast_build_get_schedule.
4550 * Return an isl_id that is checked by the corresponding call
4553 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
4556 struct isl_test_codegen_data
*data
= user
;
4559 isl_union_map
*schedule
;
4560 isl_union_set
*uset
;
4565 ctx
= isl_ast_build_get_ctx(build
);
4567 if (data
->before
>= 3)
4568 isl_die(ctx
, isl_error_unknown
,
4569 "unexpected number of for nodes", return NULL
);
4570 if (data
->depth
>= 2)
4571 isl_die(ctx
, isl_error_unknown
,
4572 "unexpected depth", return NULL
);
4574 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
4578 schedule
= isl_ast_build_get_schedule(build
);
4579 uset
= isl_union_map_range(schedule
);
4582 if (isl_union_set_n_set(uset
) != 1) {
4583 isl_union_set_free(uset
);
4584 isl_die(ctx
, isl_error_unknown
,
4585 "expecting single range space", return NULL
);
4588 space
= isl_ast_build_get_schedule_space(build
);
4589 set
= isl_union_set_extract_set(uset
, space
);
4590 isl_union_set_free(uset
);
4591 empty
= isl_set_is_empty(set
);
4597 isl_die(ctx
, isl_error_unknown
,
4598 "spaces don't match", return NULL
);
4600 return isl_id_alloc(ctx
, name
, NULL
);
4603 /* This function is called after each for loop in the AST generated
4604 * from test_ast_gen1.
4606 * Increment the number of calls and decrement the depth.
4607 * Check that the annotation attached to the node matches
4608 * the isl_id returned by the corresponding call to before_for.
4610 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
4611 __isl_keep isl_ast_build
*build
, void *user
)
4613 struct isl_test_codegen_data
*data
= user
;
4621 if (data
->after
> data
->before
)
4622 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
4623 "mismatch in number of for nodes",
4624 return isl_ast_node_free(node
));
4626 id
= isl_ast_node_get_annotation(node
);
4628 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
4629 "missing annotation", return isl_ast_node_free(node
));
4631 name
= isl_id_get_name(id
);
4632 valid
= name
&& atoi(name
+ 1) == data
->depth
;
4636 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
4637 "wrong annotation", return isl_ast_node_free(node
));
4642 /* Check that the before_each_for and after_each_for callbacks
4643 * are called for each for loop in the generated code,
4644 * that they are called in the right order and that the isl_id
4645 * returned from the before_each_for callback is attached to
4646 * the isl_ast_node passed to the corresponding after_each_for call.
4648 static int test_ast_gen1(isl_ctx
*ctx
)
4652 isl_union_map
*schedule
;
4653 isl_ast_build
*build
;
4655 struct isl_test_codegen_data data
;
4657 str
= "[N] -> { : N >= 10 }";
4658 set
= isl_set_read_from_str(ctx
, str
);
4659 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
4660 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
4661 schedule
= isl_union_map_read_from_str(ctx
, str
);
4666 build
= isl_ast_build_from_context(set
);
4667 build
= isl_ast_build_set_before_each_for(build
,
4668 &before_for
, &data
);
4669 build
= isl_ast_build_set_after_each_for(build
,
4671 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4672 isl_ast_build_free(build
);
4676 isl_ast_node_free(tree
);
4678 if (data
.before
!= 3 || data
.after
!= 3)
4679 isl_die(ctx
, isl_error_unknown
,
4680 "unexpected number of for nodes", return -1);
4685 /* Check that the AST generator handles domains that are integrally disjoint
4686 * but not ratinoally disjoint.
4688 static int test_ast_gen2(isl_ctx
*ctx
)
4692 isl_union_map
*schedule
;
4693 isl_union_map
*options
;
4694 isl_ast_build
*build
;
4697 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
4698 schedule
= isl_union_map_read_from_str(ctx
, str
);
4699 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4700 build
= isl_ast_build_from_context(set
);
4702 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
4703 options
= isl_union_map_read_from_str(ctx
, str
);
4704 build
= isl_ast_build_set_options(build
, options
);
4705 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4706 isl_ast_build_free(build
);
4709 isl_ast_node_free(tree
);
4714 /* Increment *user on each call.
4716 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
4717 __isl_keep isl_ast_build
*build
, void *user
)
4726 /* Test that unrolling tries to minimize the number of instances.
4727 * In particular, for the schedule given below, make sure it generates
4728 * 3 nodes (rather than 101).
4730 static int test_ast_gen3(isl_ctx
*ctx
)
4734 isl_union_map
*schedule
;
4735 isl_union_map
*options
;
4736 isl_ast_build
*build
;
4740 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
4741 schedule
= isl_union_map_read_from_str(ctx
, str
);
4742 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4744 str
= "{ [i] -> unroll[0] }";
4745 options
= isl_union_map_read_from_str(ctx
, str
);
4747 build
= isl_ast_build_from_context(set
);
4748 build
= isl_ast_build_set_options(build
, options
);
4749 build
= isl_ast_build_set_at_each_domain(build
,
4750 &count_domains
, &n_domain
);
4751 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4752 isl_ast_build_free(build
);
4756 isl_ast_node_free(tree
);
4759 isl_die(ctx
, isl_error_unknown
,
4760 "unexpected number of for nodes", return -1);
4765 /* Check that if the ast_build_exploit_nested_bounds options is set,
4766 * we do not get an outer if node in the generated AST,
4767 * while we do get such an outer if node if the options is not set.
4769 static int test_ast_gen4(isl_ctx
*ctx
)
4773 isl_union_map
*schedule
;
4774 isl_ast_build
*build
;
4776 enum isl_ast_node_type type
;
4779 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
4780 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
4782 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
4784 schedule
= isl_union_map_read_from_str(ctx
, str
);
4785 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4786 build
= isl_ast_build_from_context(set
);
4787 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4788 isl_ast_build_free(build
);
4792 type
= isl_ast_node_get_type(tree
);
4793 isl_ast_node_free(tree
);
4795 if (type
== isl_ast_node_if
)
4796 isl_die(ctx
, isl_error_unknown
,
4797 "not expecting if node", return -1);
4799 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
4801 schedule
= isl_union_map_read_from_str(ctx
, str
);
4802 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4803 build
= isl_ast_build_from_context(set
);
4804 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4805 isl_ast_build_free(build
);
4809 type
= isl_ast_node_get_type(tree
);
4810 isl_ast_node_free(tree
);
4812 if (type
!= isl_ast_node_if
)
4813 isl_die(ctx
, isl_error_unknown
,
4814 "expecting if node", return -1);
4816 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
4821 /* This function is called for each leaf in the AST generated
4822 * from test_ast_gen5.
4824 * We finalize the AST generation by extending the outer schedule
4825 * with a zero-dimensional schedule. If this results in any for loops,
4826 * then this means that we did not pass along enough information
4827 * about the outer schedule to the inner AST generation.
4829 static __isl_give isl_ast_node
*create_leaf(__isl_take isl_ast_build
*build
,
4832 isl_union_map
*schedule
, *extra
;
4835 schedule
= isl_ast_build_get_schedule(build
);
4836 extra
= isl_union_map_copy(schedule
);
4837 extra
= isl_union_map_from_domain(isl_union_map_domain(extra
));
4838 schedule
= isl_union_map_range_product(schedule
, extra
);
4839 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4840 isl_ast_build_free(build
);
4845 if (isl_ast_node_get_type(tree
) == isl_ast_node_for
)
4846 isl_die(isl_ast_node_get_ctx(tree
), isl_error_unknown
,
4847 "code should not contain any for loop",
4848 return isl_ast_node_free(tree
));
4853 /* Check that we do not lose any information when going back and
4854 * forth between internal and external schedule.
4856 * In particular, we create an AST where we unroll the only
4857 * non-constant dimension in the schedule. We therefore do
4858 * not expect any for loops in the AST. However, older versions
4859 * of isl would not pass along enough information about the outer
4860 * schedule when performing an inner code generation from a create_leaf
4861 * callback, resulting in the inner code generation producing a for loop.
4863 static int test_ast_gen5(isl_ctx
*ctx
)
4867 isl_union_map
*schedule
, *options
;
4868 isl_ast_build
*build
;
4871 str
= "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
4872 schedule
= isl_union_map_read_from_str(ctx
, str
);
4874 str
= "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
4875 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
4876 options
= isl_union_map_read_from_str(ctx
, str
);
4878 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
4879 build
= isl_ast_build_from_context(set
);
4880 build
= isl_ast_build_set_options(build
, options
);
4881 build
= isl_ast_build_set_create_leaf(build
, &create_leaf
, NULL
);
4882 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
4883 isl_ast_build_free(build
);
4884 isl_ast_node_free(tree
);
4891 static int test_ast_gen(isl_ctx
*ctx
)
4893 if (test_ast_gen1(ctx
) < 0)
4895 if (test_ast_gen2(ctx
) < 0)
4897 if (test_ast_gen3(ctx
) < 0)
4899 if (test_ast_gen4(ctx
) < 0)
4901 if (test_ast_gen5(ctx
) < 0)
4906 /* Check if dropping output dimensions from an isl_pw_multi_aff
4909 static int test_pw_multi_aff(isl_ctx
*ctx
)
4912 isl_pw_multi_aff
*pma1
, *pma2
;
4915 str
= "{ [i,j] -> [i+j, 4i-j] }";
4916 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4917 str
= "{ [i,j] -> [4i-j] }";
4918 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
4920 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
4922 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
4924 isl_pw_multi_aff_free(pma1
);
4925 isl_pw_multi_aff_free(pma2
);
4929 isl_die(ctx
, isl_error_unknown
,
4930 "expressions not equal", return -1);
4935 /* Check that we can properly parse multi piecewise affine expressions
4936 * where the piecewise affine expressions have different domains.
4938 static int test_multi_pw_aff(isl_ctx
*ctx
)
4941 isl_set
*dom
, *dom2
;
4942 isl_multi_pw_aff
*mpa1
, *mpa2
;
4947 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [i] }");
4948 dom
= isl_set_read_from_str(ctx
, "{ [i] : i > 0 }");
4949 mpa1
= isl_multi_pw_aff_intersect_domain(mpa1
, dom
);
4950 mpa2
= isl_multi_pw_aff_read_from_str(ctx
, "{ [i] -> [2i] }");
4951 mpa2
= isl_multi_pw_aff_flat_range_product(mpa1
, mpa2
);
4952 str
= "{ [i] -> [(i : i > 0), 2i] }";
4953 mpa1
= isl_multi_pw_aff_read_from_str(ctx
, str
);
4955 equal
= isl_multi_pw_aff_plain_is_equal(mpa1
, mpa2
);
4957 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 0);
4958 dom
= isl_pw_aff_domain(pa
);
4959 pa
= isl_multi_pw_aff_get_pw_aff(mpa1
, 1);
4960 dom2
= isl_pw_aff_domain(pa
);
4961 equal_domain
= isl_set_is_equal(dom
, dom2
);
4965 isl_multi_pw_aff_free(mpa1
);
4966 isl_multi_pw_aff_free(mpa2
);
4971 isl_die(ctx
, isl_error_unknown
,
4972 "expressions not equal", return -1);
4974 if (equal_domain
< 0)
4977 isl_die(ctx
, isl_error_unknown
,
4978 "domains unexpectedly equal", return -1);
4983 /* This is a regression test for a bug where isl_basic_map_simplify
4984 * would end up in an infinite loop. In particular, we construct
4985 * an empty basic set that is not obviously empty.
4986 * isl_basic_set_is_empty marks the basic set as empty.
4987 * After projecting out i3, the variable can be dropped completely,
4988 * but isl_basic_map_simplify refrains from doing so if the basic set
4989 * is empty and would end up in an infinite loop if it didn't test
4990 * explicitly for empty basic maps in the outer loop.
4992 static int test_simplify(isl_ctx
*ctx
)
4995 isl_basic_set
*bset
;
4998 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
4999 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
5000 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
5002 bset
= isl_basic_set_read_from_str(ctx
, str
);
5003 empty
= isl_basic_set_is_empty(bset
);
5004 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
5005 isl_basic_set_free(bset
);
5009 isl_die(ctx
, isl_error_unknown
,
5010 "basic set should be empty", return -1);
5015 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
5016 * with gbr context would fail to disable the use of the shifted tableau
5017 * when transferring equalities for the input to the context, resulting
5018 * in invalid sample values.
5020 static int test_partial_lexmin(isl_ctx
*ctx
)
5023 isl_basic_set
*bset
;
5024 isl_basic_map
*bmap
;
5027 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
5028 bmap
= isl_basic_map_read_from_str(ctx
, str
);
5029 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
5030 bset
= isl_basic_set_read_from_str(ctx
, str
);
5031 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
5040 /* Check that the variable compression performed on the existentially
5041 * quantified variables inside isl_basic_set_compute_divs is not confused
5042 * by the implicit equalities among the parameters.
5044 static int test_compute_divs(isl_ctx
*ctx
)
5047 isl_basic_set
*bset
;
5050 str
= "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
5051 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
5052 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
5053 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
5054 bset
= isl_basic_set_read_from_str(ctx
, str
);
5055 set
= isl_basic_set_compute_divs(bset
);
5067 { "{ rat: [i] : 0 <= i <= 10 }",
5068 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
5069 { "{ rat: [i] : FALSE }",
5070 "{ rat: coefficients[[cst] -> [a]] }" },
5072 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
5079 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
5080 "{ rat: [i] : 0 <= i <= 10 }" },
5081 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
5083 { "{ rat: coefficients[[cst] -> [a]] }",
5084 "{ rat: [i] : FALSE }" },
5087 /* Test the basic functionality of isl_basic_set_coefficients and
5088 * isl_basic_set_solutions.
5090 static int test_dual(isl_ctx
*ctx
)
5094 for (i
= 0; i
< ARRAY_SIZE(coef_tests
); ++i
) {
5096 isl_basic_set
*bset1
, *bset2
;
5098 bset1
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].set
);
5099 bset2
= isl_basic_set_read_from_str(ctx
, coef_tests
[i
].dual
);
5100 bset1
= isl_basic_set_coefficients(bset1
);
5101 equal
= isl_basic_set_is_equal(bset1
, bset2
);
5102 isl_basic_set_free(bset1
);
5103 isl_basic_set_free(bset2
);
5107 isl_die(ctx
, isl_error_unknown
,
5108 "incorrect dual", return -1);
5111 for (i
= 0; i
< ARRAY_SIZE(sol_tests
); ++i
) {
5113 isl_basic_set
*bset1
, *bset2
;
5115 bset1
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].set
);
5116 bset2
= isl_basic_set_read_from_str(ctx
, sol_tests
[i
].dual
);
5117 bset1
= isl_basic_set_solutions(bset1
);
5118 equal
= isl_basic_set_is_equal(bset1
, bset2
);
5119 isl_basic_set_free(bset1
);
5120 isl_basic_set_free(bset2
);
5124 isl_die(ctx
, isl_error_unknown
,
5125 "incorrect dual", return -1);
5133 int (*fn
)(isl_ctx
*ctx
);
5135 { "dual", &test_dual
},
5136 { "dependence analysis", &test_flow
},
5137 { "val", &test_val
},
5138 { "compute divs", &test_compute_divs
},
5139 { "partial lexmin", &test_partial_lexmin
},
5140 { "simplify", &test_simplify
},
5141 { "curry", &test_curry
},
5142 { "piecewise multi affine expressions", &test_pw_multi_aff
},
5143 { "multi piecewise affine expressions", &test_multi_pw_aff
},
5144 { "conversion", &test_conversion
},
5145 { "list", &test_list
},
5146 { "align parameters", &test_align_parameters
},
5147 { "preimage", &test_preimage
},
5148 { "pullback", &test_pullback
},
5149 { "AST", &test_ast
},
5150 { "AST build", &test_ast_build
},
5151 { "AST generation", &test_ast_gen
},
5152 { "eliminate", &test_eliminate
},
5153 { "residue class", &test_residue_class
},
5154 { "div", &test_div
},
5155 { "slice", &test_slice
},
5156 { "fixed power", &test_fixed_power
},
5157 { "sample", &test_sample
},
5158 { "output", &test_output
},
5159 { "vertices", &test_vertices
},
5160 { "fixed", &test_fixed
},
5161 { "equal", &test_equal
},
5162 { "disjoint", &test_disjoint
},
5163 { "product", &test_product
},
5164 { "dim_max", &test_dim_max
},
5165 { "affine", &test_aff
},
5166 { "injective", &test_injective
},
5167 { "schedule", &test_schedule
},
5168 { "union_pw", &test_union_pw
},
5169 { "parse", &test_parse
},
5170 { "single-valued", &test_sv
},
5171 { "affine hull", &test_affine_hull
},
5172 { "coalesce", &test_coalesce
},
5173 { "factorize", &test_factorize
},
5174 { "subset", &test_subset
},
5175 { "subtract", &test_subtract
},
5176 { "lexmin", &test_lexmin
},
5177 { "min", &test_min
},
5178 { "gist", &test_gist
},
5179 { "piecewise quasi-polynomials", &test_pwqp
},
5182 int main(int argc
, char **argv
)
5185 struct isl_ctx
*ctx
;
5186 struct isl_options
*options
;
5188 srcdir
= getenv("srcdir");
5191 options
= isl_options_new_with_defaults();
5193 argc
= isl_options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
5195 ctx
= isl_ctx_alloc_with_options(&isl_options_args
, options
);
5196 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
5197 printf("%s\n", tests
[i
].name
);
5198 if (tests
[i
].fn(ctx
) < 0)
5204 test_split_periods(ctx
);
5206 test_bijective(ctx
);
5210 test_construction(ctx
);
5212 test_application(ctx
);
5213 test_convex_hull(ctx
);