2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_aff_private.h>
18 #include <isl/constraint.h>
19 #include <isl/polynomial.h>
20 #include <isl/union_map.h>
21 #include <isl_factorization.h>
22 #include <isl/schedule.h>
23 #include <isl_options_private.h>
24 #include <isl/vertices.h>
25 #include <isl/ast_build.h>
27 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
31 static char *get_filename(isl_ctx
*ctx
, const char *name
, const char *suffix
) {
34 char *pattern
= "%s/test_inputs/%s.%s";
36 length
= strlen(pattern
) - 6 + strlen(srcdir
) + strlen(name
)
38 filename
= isl_alloc_array(ctx
, char, length
);
43 sprintf(filename
, pattern
, srcdir
, name
, suffix
);
48 void test_parse_map(isl_ctx
*ctx
, const char *str
)
52 map
= isl_map_read_from_str(ctx
, str
);
57 int test_parse_map_equal(isl_ctx
*ctx
, const char *str
, const char *str2
)
62 map
= isl_map_read_from_str(ctx
, str
);
63 map2
= isl_map_read_from_str(ctx
, str2
);
64 equal
= isl_map_is_equal(map
, map2
);
71 isl_die(ctx
, isl_error_unknown
, "maps not equal",
77 void test_parse_pwqp(isl_ctx
*ctx
, const char *str
)
79 isl_pw_qpolynomial
*pwqp
;
81 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
83 isl_pw_qpolynomial_free(pwqp
);
86 static void test_parse_pwaff(isl_ctx
*ctx
, const char *str
)
90 pwaff
= isl_pw_aff_read_from_str(ctx
, str
);
92 isl_pw_aff_free(pwaff
);
95 int test_parse(struct isl_ctx
*ctx
)
98 const char *str
, *str2
;
100 str
= "{ [i] -> [-i] }";
101 map
= isl_map_read_from_str(ctx
, str
);
105 str
= "{ A[i] -> L[([i/3])] }";
106 map
= isl_map_read_from_str(ctx
, str
);
110 test_parse_map(ctx
, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
111 test_parse_map(ctx
, "{ [p1, y1, y2] -> [2, y1, y2] : "
112 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
114 str
= "{ [x,y] : [([x/2]+y)/3] >= 1 }";
115 str2
= "{ [x, y] : 2y >= 6 - x }";
116 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
119 if (test_parse_map_equal(ctx
, "{ [x,y] : x <= min(y, 2*y+3) }",
120 "{ [x,y] : x <= y, 2*y + 3 }") < 0)
122 str
= "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }";
123 if (test_parse_map_equal(ctx
, "{ [x,y] : x >= min(y, 2*y+3) }",
127 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
128 map
= isl_map_read_from_str(ctx
, str
);
129 str
= "{ [new, old] -> [o0, o1] : "
130 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
131 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
132 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
133 map2
= isl_map_read_from_str(ctx
, str
);
134 assert(isl_map_is_equal(map
, map2
));
138 str
= "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
139 map
= isl_map_read_from_str(ctx
, str
);
140 str
= "{[new,old] -> [(new+1)%2,(old+1)%2]}";
141 map2
= isl_map_read_from_str(ctx
, str
);
142 assert(isl_map_is_equal(map
, map2
));
146 str
= "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }";
147 str2
= "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }";
148 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
151 str
= "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }";
152 str2
= "{ [i,j] -> [min(i,j)] }";
153 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
156 str
= "{ [i,j] : i != j }";
157 str2
= "{ [i,j] : i < j or i > j }";
158 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
161 str
= "{ [i,j] : (i+1)*2 >= j }";
162 str2
= "{ [i, j] : j <= 2 + 2i }";
163 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
166 str
= "{ [i] -> [i > 0 ? 4 : 5] }";
167 str2
= "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }";
168 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
171 str
= "[N=2,M] -> { [i=[(M+N)/4]] }";
172 str2
= "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }";
173 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
176 str
= "{ [x] : x >= 0 }";
177 str2
= "{ [x] : x-0 >= 0 }";
178 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
181 str
= "{ [i] : ((i > 10)) }";
182 str2
= "{ [i] : i >= 11 }";
183 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
186 str
= "{ [i] -> [0] }";
187 str2
= "{ [i] -> [0 * i] }";
188 if (test_parse_map_equal(ctx
, str
, str2
) < 0)
191 test_parse_pwqp(ctx
, "{ [i] -> i + [ (i + [i/3])/2 ] }");
192 test_parse_map(ctx
, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
193 test_parse_pwaff(ctx
, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
194 test_parse_pwqp(ctx
, "{ [x] -> ([(x)/2] * [(x)/3]) }");
196 if (test_parse_map_equal(ctx
, "{ [a] -> [b] : (not false) }",
197 "{ [a] -> [b] : true }") < 0)
200 if (test_parse_map_equal(ctx
, "{ [i] : i/2 <= 5 }",
201 "{ [i] : i <= 10 }") < 0)
204 if (test_parse_map_equal(ctx
, "{Sym=[n] [i] : i <= n }",
205 "[n] -> { [i] : i <= n }") < 0)
208 if (test_parse_map_equal(ctx
, "{ [*] }", "{ [a] }") < 0)
214 void test_read(struct isl_ctx
*ctx
)
218 struct isl_basic_set
*bset1
, *bset2
;
219 const char *str
= "{[y]: Exists ( alpha : 2alpha = y)}";
221 filename
= get_filename(ctx
, "set", "omega");
223 input
= fopen(filename
, "r");
226 bset1
= isl_basic_set_read_from_file(ctx
, input
);
227 bset2
= isl_basic_set_read_from_str(ctx
, str
);
229 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
231 isl_basic_set_free(bset1
);
232 isl_basic_set_free(bset2
);
238 void test_bounded(struct isl_ctx
*ctx
)
243 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : 0 <= i <= n }");
244 bounded
= isl_set_is_bounded(set
);
248 set
= isl_set_read_from_str(ctx
, "{[n, i] : 0 <= i <= n }");
249 bounded
= isl_set_is_bounded(set
);
253 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : i <= n }");
254 bounded
= isl_set_is_bounded(set
);
259 /* Construct the basic set { [i] : 5 <= i <= N } */
260 void test_construction(struct isl_ctx
*ctx
)
265 struct isl_basic_set
*bset
;
266 struct isl_constraint
*c
;
270 dim
= isl_space_set_alloc(ctx
, 1, 1);
271 bset
= isl_basic_set_universe(isl_space_copy(dim
));
272 ls
= isl_local_space_from_space(dim
);
274 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
275 isl_int_set_si(v
, -1);
276 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
277 isl_int_set_si(v
, 1);
278 isl_constraint_set_coefficient(c
, isl_dim_param
, 0, v
);
279 bset
= isl_basic_set_add_constraint(bset
, c
);
281 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
282 isl_int_set_si(v
, 1);
283 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
284 isl_int_set_si(v
, -5);
285 isl_constraint_set_constant(c
, v
);
286 bset
= isl_basic_set_add_constraint(bset
, c
);
288 isl_local_space_free(ls
);
289 isl_basic_set_free(bset
);
294 void test_dim(struct isl_ctx
*ctx
)
297 isl_map
*map1
, *map2
;
299 map1
= isl_map_read_from_str(ctx
,
300 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
301 map1
= isl_map_add_dims(map1
, isl_dim_in
, 1);
302 map2
= isl_map_read_from_str(ctx
,
303 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
304 assert(isl_map_is_equal(map1
, map2
));
307 map1
= isl_map_project_out(map1
, isl_dim_in
, 0, 1);
308 map2
= isl_map_read_from_str(ctx
, "[n] -> { [i] -> [j] : n >= 0 }");
309 assert(isl_map_is_equal(map1
, map2
));
314 str
= "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
315 map1
= isl_map_read_from_str(ctx
, str
);
316 str
= "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
317 map2
= isl_map_read_from_str(ctx
, str
);
318 map1
= isl_map_move_dims(map1
, isl_dim_out
, 0, isl_dim_param
, 0, 1);
319 assert(isl_map_is_equal(map1
, map2
));
325 static int test_div(isl_ctx
*ctx
)
334 struct isl_basic_set
*bset
;
335 struct isl_constraint
*c
;
340 dim
= isl_space_set_alloc(ctx
, 0, 3);
341 bset
= isl_basic_set_universe(isl_space_copy(dim
));
342 ls
= isl_local_space_from_space(dim
);
344 c
= isl_equality_alloc(isl_local_space_copy(ls
));
345 isl_int_set_si(v
, -1);
346 isl_constraint_set_constant(c
, v
);
347 isl_int_set_si(v
, 1);
348 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
349 isl_int_set_si(v
, 3);
350 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
351 bset
= isl_basic_set_add_constraint(bset
, c
);
353 c
= isl_equality_alloc(isl_local_space_copy(ls
));
354 isl_int_set_si(v
, 1);
355 isl_constraint_set_constant(c
, v
);
356 isl_int_set_si(v
, -1);
357 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
358 isl_int_set_si(v
, 3);
359 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
360 bset
= isl_basic_set_add_constraint(bset
, c
);
362 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
364 assert(bset
&& bset
->n_div
== 1);
365 isl_local_space_free(ls
);
366 isl_basic_set_free(bset
);
369 dim
= isl_space_set_alloc(ctx
, 0, 3);
370 bset
= isl_basic_set_universe(isl_space_copy(dim
));
371 ls
= isl_local_space_from_space(dim
);
373 c
= isl_equality_alloc(isl_local_space_copy(ls
));
374 isl_int_set_si(v
, 1);
375 isl_constraint_set_constant(c
, v
);
376 isl_int_set_si(v
, -1);
377 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
378 isl_int_set_si(v
, 3);
379 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
380 bset
= isl_basic_set_add_constraint(bset
, c
);
382 c
= isl_equality_alloc(isl_local_space_copy(ls
));
383 isl_int_set_si(v
, -1);
384 isl_constraint_set_constant(c
, v
);
385 isl_int_set_si(v
, 1);
386 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
387 isl_int_set_si(v
, 3);
388 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
389 bset
= isl_basic_set_add_constraint(bset
, c
);
391 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
393 assert(bset
&& bset
->n_div
== 1);
394 isl_local_space_free(ls
);
395 isl_basic_set_free(bset
);
398 dim
= isl_space_set_alloc(ctx
, 0, 3);
399 bset
= isl_basic_set_universe(isl_space_copy(dim
));
400 ls
= isl_local_space_from_space(dim
);
402 c
= isl_equality_alloc(isl_local_space_copy(ls
));
403 isl_int_set_si(v
, 1);
404 isl_constraint_set_constant(c
, v
);
405 isl_int_set_si(v
, -1);
406 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
407 isl_int_set_si(v
, 3);
408 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
409 bset
= isl_basic_set_add_constraint(bset
, c
);
411 c
= isl_equality_alloc(isl_local_space_copy(ls
));
412 isl_int_set_si(v
, -3);
413 isl_constraint_set_constant(c
, v
);
414 isl_int_set_si(v
, 1);
415 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
416 isl_int_set_si(v
, 4);
417 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
418 bset
= isl_basic_set_add_constraint(bset
, c
);
420 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
422 assert(bset
&& bset
->n_div
== 1);
423 isl_local_space_free(ls
);
424 isl_basic_set_free(bset
);
427 dim
= isl_space_set_alloc(ctx
, 0, 3);
428 bset
= isl_basic_set_universe(isl_space_copy(dim
));
429 ls
= isl_local_space_from_space(dim
);
431 c
= isl_equality_alloc(isl_local_space_copy(ls
));
432 isl_int_set_si(v
, 2);
433 isl_constraint_set_constant(c
, v
);
434 isl_int_set_si(v
, -1);
435 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
436 isl_int_set_si(v
, 3);
437 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
438 bset
= isl_basic_set_add_constraint(bset
, c
);
440 c
= isl_equality_alloc(isl_local_space_copy(ls
));
441 isl_int_set_si(v
, -1);
442 isl_constraint_set_constant(c
, v
);
443 isl_int_set_si(v
, 1);
444 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
445 isl_int_set_si(v
, 6);
446 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
447 bset
= isl_basic_set_add_constraint(bset
, c
);
449 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
451 assert(isl_basic_set_is_empty(bset
));
452 isl_local_space_free(ls
);
453 isl_basic_set_free(bset
);
456 dim
= isl_space_set_alloc(ctx
, 0, 3);
457 bset
= isl_basic_set_universe(isl_space_copy(dim
));
458 ls
= isl_local_space_from_space(dim
);
460 c
= isl_equality_alloc(isl_local_space_copy(ls
));
461 isl_int_set_si(v
, -1);
462 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
463 isl_int_set_si(v
, 3);
464 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
465 bset
= isl_basic_set_add_constraint(bset
, c
);
467 c
= isl_equality_alloc(isl_local_space_copy(ls
));
468 isl_int_set_si(v
, 1);
469 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
470 isl_int_set_si(v
, -3);
471 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
472 bset
= isl_basic_set_add_constraint(bset
, c
);
474 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
476 assert(bset
&& bset
->n_div
== 0);
477 isl_basic_set_free(bset
);
478 isl_local_space_free(ls
);
481 dim
= isl_space_set_alloc(ctx
, 0, 3);
482 bset
= isl_basic_set_universe(isl_space_copy(dim
));
483 ls
= isl_local_space_from_space(dim
);
485 c
= isl_equality_alloc(isl_local_space_copy(ls
));
486 isl_int_set_si(v
, -1);
487 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
488 isl_int_set_si(v
, 6);
489 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
490 bset
= isl_basic_set_add_constraint(bset
, c
);
492 c
= isl_equality_alloc(isl_local_space_copy(ls
));
493 isl_int_set_si(v
, 1);
494 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
495 isl_int_set_si(v
, -3);
496 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
497 bset
= isl_basic_set_add_constraint(bset
, c
);
499 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
501 assert(bset
&& bset
->n_div
== 1);
502 isl_basic_set_free(bset
);
503 isl_local_space_free(ls
);
506 /* This test is a bit tricky. We set up an equality
508 * Normalization of divs creates _two_ divs
511 * Afterwards e0 is removed again because it has coefficient -1
512 * and we end up with the original equality and div again.
513 * Perhaps we can avoid the introduction of this temporary div.
515 dim
= isl_space_set_alloc(ctx
, 0, 4);
516 bset
= isl_basic_set_universe(isl_space_copy(dim
));
517 ls
= isl_local_space_from_space(dim
);
519 c
= isl_equality_alloc(isl_local_space_copy(ls
));
520 isl_int_set_si(v
, -1);
521 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
522 isl_int_set_si(v
, -3);
523 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
524 isl_int_set_si(v
, -3);
525 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
526 isl_int_set_si(v
, 6);
527 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
528 bset
= isl_basic_set_add_constraint(bset
, c
);
530 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
532 /* Test disabled for now */
534 assert(bset && bset->n_div == 1);
536 isl_local_space_free(ls
);
537 isl_basic_set_free(bset
);
540 dim
= isl_space_set_alloc(ctx
, 0, 5);
541 bset
= isl_basic_set_universe(isl_space_copy(dim
));
542 ls
= isl_local_space_from_space(dim
);
544 c
= isl_equality_alloc(isl_local_space_copy(ls
));
545 isl_int_set_si(v
, -1);
546 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
547 isl_int_set_si(v
, -3);
548 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
549 isl_int_set_si(v
, -3);
550 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
551 isl_int_set_si(v
, 6);
552 isl_constraint_set_coefficient(c
, isl_dim_set
, 4, v
);
553 bset
= isl_basic_set_add_constraint(bset
, c
);
555 c
= isl_equality_alloc(isl_local_space_copy(ls
));
556 isl_int_set_si(v
, -1);
557 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
558 isl_int_set_si(v
, 1);
559 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
560 isl_int_set_si(v
, 1);
561 isl_constraint_set_constant(c
, v
);
562 bset
= isl_basic_set_add_constraint(bset
, c
);
564 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
566 /* Test disabled for now */
568 assert(bset && bset->n_div == 1);
570 isl_local_space_free(ls
);
571 isl_basic_set_free(bset
);
574 dim
= isl_space_set_alloc(ctx
, 0, 4);
575 bset
= isl_basic_set_universe(isl_space_copy(dim
));
576 ls
= isl_local_space_from_space(dim
);
578 c
= isl_equality_alloc(isl_local_space_copy(ls
));
579 isl_int_set_si(v
, 1);
580 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
581 isl_int_set_si(v
, -1);
582 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
583 isl_int_set_si(v
, -2);
584 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
585 bset
= isl_basic_set_add_constraint(bset
, c
);
587 c
= isl_equality_alloc(isl_local_space_copy(ls
));
588 isl_int_set_si(v
, -1);
589 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
590 isl_int_set_si(v
, 3);
591 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
592 isl_int_set_si(v
, 2);
593 isl_constraint_set_constant(c
, v
);
594 bset
= isl_basic_set_add_constraint(bset
, c
);
596 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
598 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
600 assert(!isl_basic_set_is_empty(bset
));
602 isl_local_space_free(ls
);
603 isl_basic_set_free(bset
);
606 dim
= isl_space_set_alloc(ctx
, 0, 3);
607 bset
= isl_basic_set_universe(isl_space_copy(dim
));
608 ls
= isl_local_space_from_space(dim
);
610 c
= isl_equality_alloc(isl_local_space_copy(ls
));
611 isl_int_set_si(v
, 1);
612 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
613 isl_int_set_si(v
, -2);
614 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
615 bset
= isl_basic_set_add_constraint(bset
, c
);
617 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
619 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
621 isl_local_space_free(ls
);
622 isl_basic_set_free(bset
);
626 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
627 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
628 set
= isl_set_read_from_str(ctx
, str
);
629 set
= isl_set_compute_divs(set
);
634 str
= "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
635 bset
= isl_basic_set_read_from_str(ctx
, str
);
636 n
= isl_basic_set_dim(bset
, isl_dim_div
);
637 isl_basic_set_free(bset
);
641 isl_die(ctx
, isl_error_unknown
,
642 "expecting no existentials", return -1);
644 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
645 set
= isl_set_read_from_str(ctx
, str
);
646 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
647 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
648 empty
= isl_set_is_empty(set
);
653 isl_die(ctx
, isl_error_unknown
,
654 "result not as accurate as expected", return -1);
659 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
663 struct isl_basic_set
*bset1
, *bset2
;
664 struct isl_basic_map
*bmap
;
666 filename
= get_filename(ctx
, name
, "omega");
668 input
= fopen(filename
, "r");
671 bset1
= isl_basic_set_read_from_file(ctx
, input
);
672 bmap
= isl_basic_map_read_from_file(ctx
, input
);
674 bset1
= isl_basic_set_apply(bset1
, bmap
);
676 bset2
= isl_basic_set_read_from_file(ctx
, input
);
678 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
680 isl_basic_set_free(bset1
);
681 isl_basic_set_free(bset2
);
687 void test_application(struct isl_ctx
*ctx
)
689 test_application_case(ctx
, "application");
690 test_application_case(ctx
, "application2");
693 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
697 struct isl_basic_set
*bset1
, *bset2
;
699 filename
= get_filename(ctx
, name
, "polylib");
701 input
= fopen(filename
, "r");
704 bset1
= isl_basic_set_read_from_file(ctx
, input
);
705 bset2
= isl_basic_set_read_from_file(ctx
, input
);
707 bset1
= isl_basic_set_affine_hull(bset1
);
709 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
711 isl_basic_set_free(bset1
);
712 isl_basic_set_free(bset2
);
718 int test_affine_hull(struct isl_ctx
*ctx
)
725 test_affine_hull_case(ctx
, "affine2");
726 test_affine_hull_case(ctx
, "affine");
727 test_affine_hull_case(ctx
, "affine3");
729 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
730 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
731 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
732 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
733 set
= isl_set_read_from_str(ctx
, str
);
734 bset
= isl_set_affine_hull(set
);
735 n
= isl_basic_set_dim(bset
, isl_dim_div
);
736 isl_basic_set_free(bset
);
738 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
741 /* Check that isl_map_affine_hull is not confused by
742 * the reordering of divs in isl_map_align_divs.
744 str
= "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
745 "32e0 = b and 32e1 = c); "
746 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
747 set
= isl_set_read_from_str(ctx
, str
);
748 bset
= isl_set_affine_hull(set
);
749 isl_basic_set_free(bset
);
756 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
760 struct isl_basic_set
*bset1
, *bset2
;
763 filename
= get_filename(ctx
, name
, "polylib");
765 input
= fopen(filename
, "r");
768 bset1
= isl_basic_set_read_from_file(ctx
, input
);
769 bset2
= isl_basic_set_read_from_file(ctx
, input
);
771 set
= isl_basic_set_union(bset1
, bset2
);
772 bset1
= isl_set_convex_hull(set
);
774 bset2
= isl_basic_set_read_from_file(ctx
, input
);
776 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
778 isl_basic_set_free(bset1
);
779 isl_basic_set_free(bset2
);
785 void test_convex_hull_algo(struct isl_ctx
*ctx
, int convex
)
787 const char *str1
, *str2
;
788 isl_set
*set1
, *set2
;
789 int orig_convex
= ctx
->opt
->convex
;
790 ctx
->opt
->convex
= convex
;
792 test_convex_hull_case(ctx
, "convex0");
793 test_convex_hull_case(ctx
, "convex1");
794 test_convex_hull_case(ctx
, "convex2");
795 test_convex_hull_case(ctx
, "convex3");
796 test_convex_hull_case(ctx
, "convex4");
797 test_convex_hull_case(ctx
, "convex5");
798 test_convex_hull_case(ctx
, "convex6");
799 test_convex_hull_case(ctx
, "convex7");
800 test_convex_hull_case(ctx
, "convex8");
801 test_convex_hull_case(ctx
, "convex9");
802 test_convex_hull_case(ctx
, "convex10");
803 test_convex_hull_case(ctx
, "convex11");
804 test_convex_hull_case(ctx
, "convex12");
805 test_convex_hull_case(ctx
, "convex13");
806 test_convex_hull_case(ctx
, "convex14");
807 test_convex_hull_case(ctx
, "convex15");
809 str1
= "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
810 "(i0 = 1 and i1 = 0 and i2 = 1) or "
811 "(i0 = 0 and i1 = 0 and i2 = 0) }";
812 str2
= "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }";
813 set1
= isl_set_read_from_str(ctx
, str1
);
814 set2
= isl_set_read_from_str(ctx
, str2
);
815 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
816 assert(isl_set_is_equal(set1
, set2
));
820 ctx
->opt
->convex
= orig_convex
;
823 void test_convex_hull(struct isl_ctx
*ctx
)
825 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
);
826 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
);
829 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
833 struct isl_basic_set
*bset1
, *bset2
;
835 filename
= get_filename(ctx
, name
, "polylib");
837 input
= fopen(filename
, "r");
840 bset1
= isl_basic_set_read_from_file(ctx
, input
);
841 bset2
= isl_basic_set_read_from_file(ctx
, input
);
843 bset1
= isl_basic_set_gist(bset1
, bset2
);
845 bset2
= isl_basic_set_read_from_file(ctx
, input
);
847 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
849 isl_basic_set_free(bset1
);
850 isl_basic_set_free(bset2
);
856 void test_gist(struct isl_ctx
*ctx
)
859 isl_basic_set
*bset1
, *bset2
;
861 test_gist_case(ctx
, "gist1");
863 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
864 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
865 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
866 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
867 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
868 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
869 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
870 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
871 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
872 bset1
= isl_basic_set_read_from_str(ctx
, str
);
873 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
874 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
875 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
876 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
877 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
878 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
879 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
880 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
881 bset2
= isl_basic_set_read_from_str(ctx
, str
);
882 bset1
= isl_basic_set_gist(bset1
, bset2
);
883 assert(bset1
&& bset1
->n_div
== 0);
884 isl_basic_set_free(bset1
);
887 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
893 set
= isl_set_read_from_str(ctx
, str
);
894 set
= isl_set_coalesce(set
);
895 set2
= isl_set_read_from_str(ctx
, str
);
896 equal
= isl_set_is_equal(set
, set2
);
897 one
= set
&& set
->n
== 1;
904 isl_die(ctx
, isl_error_unknown
,
905 "coalesced set not equal to input", return -1);
906 if (check_one
&& !one
)
907 isl_die(ctx
, isl_error_unknown
,
908 "coalesced set should not be a union", return -1);
913 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
918 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
919 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
921 if (test_coalesce_set(ctx
,
922 "{[x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
923 "-x - y + 1 >= 0 and -3 <= z <= 3;"
924 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
925 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
926 "-10 <= y <= 0}", 1) < 0)
928 if (test_coalesce_set(ctx
,
929 "{[x,y] : 0 <= x,y <= 10; [5,y]: 4 <=y <= 11}", 1) < 0)
931 if (test_coalesce_set(ctx
,
932 "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1) < 0)
940 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
945 /* Inputs for coalescing tests.
946 * "str" is a string representation of the input set.
947 * "single_disjunct" is set if we expect the result to consist of
953 } coalesce_tests
[] = {
954 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
955 "y >= x & x >= 2 & 5 >= y }" },
956 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
957 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
958 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
959 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
960 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
961 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
962 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
963 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
964 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
965 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
966 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
967 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
968 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
969 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
970 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
971 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
972 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
973 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
974 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
975 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
976 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
977 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
978 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
979 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
980 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
981 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
982 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
983 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
984 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
985 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
986 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
987 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
988 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
989 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
990 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
991 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
992 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
993 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
994 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
995 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
996 "[o0, o1, o2, o3, o4, o5, o6]] : "
997 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
998 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
999 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1000 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1001 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1002 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1003 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1004 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1005 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1006 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1007 "o6 >= i3 + i6 - o3 and M >= 0 and "
1008 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1009 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1010 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1011 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1012 "(o0 = 0 and M >= 2 and N >= 3) or "
1013 "(M = 0 and o0 = 0 and N >= 3) }" },
1014 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1015 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1016 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1017 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1018 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1019 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1020 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1021 "(y = 3 and x = 1) }" },
1022 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1023 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1024 "i1 <= M and i3 <= M and i4 <= M) or "
1025 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1026 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1027 "i4 <= -1 + M) }" },
1028 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1029 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1030 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1031 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1032 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1033 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1034 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1035 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1036 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1037 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1038 { 0, "{ [a, b] : exists e : 2e = a and "
1039 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1040 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1041 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1042 "j >= 1 and j' <= i + j - i' and i >= 1; "
1044 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1045 "[i,j] : exists a : j = 3a }" },
1046 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1047 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1049 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1050 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1051 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1052 "c <= 6 + 8a and a >= 3; "
1053 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1054 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1055 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1056 "[x,0] : 3 <= x <= 4 }" },
1057 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1058 "[x,0] : 4 <= x <= 5 }" },
1059 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1060 "[x,0] : 3 <= x <= 5 }" },
1061 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1062 "[x,0] : 3 <= x <= 4 }" },
1063 { 1 , "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1065 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1068 /* Test the functionality of isl_set_coalesce.
1069 * That is, check that the output is always equal to the input
1070 * and in some cases that the result consists of a single disjunct.
1072 static int test_coalesce(struct isl_ctx
*ctx
)
1076 for (i
= 0; i
< ARRAY_SIZE(coalesce_tests
); ++i
) {
1077 const char *str
= coalesce_tests
[i
].str
;
1078 int check_one
= coalesce_tests
[i
].single_disjunct
;
1079 if (test_coalesce_set(ctx
, str
, check_one
) < 0)
1083 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
1089 void test_closure(struct isl_ctx
*ctx
)
1093 isl_map
*up
, *right
;
1094 isl_map
*map
, *map2
;
1097 /* COCOA example 1 */
1098 map
= isl_map_read_from_str(ctx
,
1099 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1100 "1 <= i and i < n and 1 <= j and j < n or "
1101 "i2 = i + 1 and j2 = j - 1 and "
1102 "1 <= i and i < n and 2 <= j and j <= n }");
1103 map
= isl_map_power(map
, &exact
);
1107 /* COCOA example 1 */
1108 map
= isl_map_read_from_str(ctx
,
1109 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1110 "1 <= i and i < n and 1 <= j and j < n or "
1111 "i2 = i + 1 and j2 = j - 1 and "
1112 "1 <= i and i < n and 2 <= j and j <= n }");
1113 map
= isl_map_transitive_closure(map
, &exact
);
1115 map2
= isl_map_read_from_str(ctx
,
1116 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1117 "1 <= i and i < n and 1 <= j and j <= n and "
1118 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1119 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1120 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1121 assert(isl_map_is_equal(map
, map2
));
1125 map
= isl_map_read_from_str(ctx
,
1126 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1127 " 0 <= y and y <= n }");
1128 map
= isl_map_transitive_closure(map
, &exact
);
1129 map2
= isl_map_read_from_str(ctx
,
1130 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1131 " 0 <= y and y <= n }");
1132 assert(isl_map_is_equal(map
, map2
));
1136 /* COCOA example 2 */
1137 map
= isl_map_read_from_str(ctx
,
1138 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1139 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1140 "i2 = i + 2 and j2 = j - 2 and "
1141 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1142 map
= isl_map_transitive_closure(map
, &exact
);
1144 map2
= isl_map_read_from_str(ctx
,
1145 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1146 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1147 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1148 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1149 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1150 assert(isl_map_is_equal(map
, map2
));
1154 /* COCOA Fig.2 left */
1155 map
= isl_map_read_from_str(ctx
,
1156 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1157 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1159 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1160 "j <= 2 i - 3 and j <= n - 2 or "
1161 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1162 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1163 map
= isl_map_transitive_closure(map
, &exact
);
1167 /* COCOA Fig.2 right */
1168 map
= isl_map_read_from_str(ctx
,
1169 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1170 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1172 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1173 "j <= 2 i - 4 and j <= n - 3 or "
1174 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1175 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1176 map
= isl_map_power(map
, &exact
);
1180 /* COCOA Fig.2 right */
1181 map
= isl_map_read_from_str(ctx
,
1182 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1183 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1185 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1186 "j <= 2 i - 4 and j <= n - 3 or "
1187 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1188 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1189 map
= isl_map_transitive_closure(map
, &exact
);
1191 map2
= isl_map_read_from_str(ctx
,
1192 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1193 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1194 "j <= n and 3 + i + 2 j <= 3 n and "
1195 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1196 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1197 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1198 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1199 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1200 assert(isl_map_is_equal(map
, map2
));
1204 /* COCOA Fig.1 right */
1205 dom
= isl_set_read_from_str(ctx
,
1206 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1207 "2 x - 3 y + 3 >= 0 }");
1208 right
= isl_map_read_from_str(ctx
,
1209 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1210 up
= isl_map_read_from_str(ctx
,
1211 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1212 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
1213 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
1214 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
1215 up
= isl_map_intersect_range(up
, dom
);
1216 map
= isl_map_union(up
, right
);
1217 map
= isl_map_transitive_closure(map
, &exact
);
1219 map2
= isl_map_read_from_str(ctx
,
1220 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1221 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1222 assert(isl_map_is_equal(map
, map2
));
1226 /* COCOA Theorem 1 counter example */
1227 map
= isl_map_read_from_str(ctx
,
1228 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1229 "i2 = 1 and j2 = j or "
1230 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1231 map
= isl_map_transitive_closure(map
, &exact
);
1235 map
= isl_map_read_from_str(ctx
,
1236 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1237 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1238 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1239 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1240 map
= isl_map_transitive_closure(map
, &exact
);
1244 /* Kelly et al 1996, fig 12 */
1245 map
= isl_map_read_from_str(ctx
,
1246 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1247 "1 <= i,j,j+1 <= n or "
1248 "j = n and j2 = 1 and i2 = i + 1 and "
1249 "1 <= i,i+1 <= n }");
1250 map
= isl_map_transitive_closure(map
, &exact
);
1252 map2
= isl_map_read_from_str(ctx
,
1253 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1254 "1 <= i <= n and i = i2 or "
1255 "1 <= i < i2 <= n and 1 <= j <= n and "
1257 assert(isl_map_is_equal(map
, map2
));
1261 /* Omega's closure4 */
1262 map
= isl_map_read_from_str(ctx
,
1263 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1264 "1 <= x,y <= 10 or "
1265 "x2 = x + 1 and y2 = y and "
1266 "1 <= x <= 20 && 5 <= y <= 15 }");
1267 map
= isl_map_transitive_closure(map
, &exact
);
1271 map
= isl_map_read_from_str(ctx
,
1272 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1273 map
= isl_map_transitive_closure(map
, &exact
);
1275 map2
= isl_map_read_from_str(ctx
,
1276 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1277 assert(isl_map_is_equal(map
, map2
));
1281 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1282 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1283 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1284 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1285 map
= isl_map_read_from_str(ctx
, str
);
1286 map
= isl_map_transitive_closure(map
, &exact
);
1288 map2
= isl_map_read_from_str(ctx
, str
);
1289 assert(isl_map_is_equal(map
, map2
));
1293 str
= "{[0] -> [1]; [2] -> [3]}";
1294 map
= isl_map_read_from_str(ctx
, str
);
1295 map
= isl_map_transitive_closure(map
, &exact
);
1297 map2
= isl_map_read_from_str(ctx
, str
);
1298 assert(isl_map_is_equal(map
, map2
));
1302 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1303 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1304 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1305 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1306 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1307 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1308 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1309 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1310 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1311 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1312 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1313 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1314 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1315 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1316 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1317 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1318 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1319 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1320 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1321 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1322 map
= isl_map_read_from_str(ctx
, str
);
1323 map
= isl_map_transitive_closure(map
, NULL
);
1328 void test_lex(struct isl_ctx
*ctx
)
1333 dim
= isl_space_set_alloc(ctx
, 0, 0);
1334 map
= isl_map_lex_le(dim
);
1335 assert(!isl_map_is_empty(map
));
1339 static int test_lexmin(struct isl_ctx
*ctx
)
1343 isl_basic_map
*bmap
;
1344 isl_map
*map
, *map2
;
1347 isl_pw_multi_aff
*pma
;
1349 str
= "[p0, p1] -> { [] -> [] : "
1350 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1351 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1352 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1353 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1354 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1355 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1356 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1357 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1358 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1359 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1360 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1361 map
= isl_map_read_from_str(ctx
, str
);
1362 map
= isl_map_lexmin(map
);
1365 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1366 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1367 set
= isl_set_read_from_str(ctx
, str
);
1368 set
= isl_set_lexmax(set
);
1369 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
1370 set2
= isl_set_read_from_str(ctx
, str
);
1371 set
= isl_set_intersect(set
, set2
);
1372 assert(!isl_set_is_empty(set
));
1375 str
= "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1376 map
= isl_map_read_from_str(ctx
, str
);
1377 map
= isl_map_lexmin(map
);
1378 str
= "{ [x] -> [5] : 6 <= x <= 8; "
1379 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1380 map2
= isl_map_read_from_str(ctx
, str
);
1381 assert(isl_map_is_equal(map
, map2
));
1385 str
= "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1386 map
= isl_map_read_from_str(ctx
, str
);
1387 map2
= isl_map_copy(map
);
1388 map
= isl_map_lexmin(map
);
1389 assert(isl_map_is_equal(map
, map2
));
1393 str
= "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1394 map
= isl_map_read_from_str(ctx
, str
);
1395 map
= isl_map_lexmin(map
);
1396 str
= "{ [x] -> [y] : (4y = x and x >= 0) or "
1397 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1398 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1399 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1400 map2
= isl_map_read_from_str(ctx
, str
);
1401 assert(isl_map_is_equal(map
, map2
));
1405 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1406 " 8i' <= i and 8i' >= -7 + i }";
1407 bmap
= isl_basic_map_read_from_str(ctx
, str
);
1408 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
1409 map2
= isl_map_from_pw_multi_aff(pma
);
1410 map
= isl_map_from_basic_map(bmap
);
1411 assert(isl_map_is_equal(map
, map2
));
1415 str
= "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
1416 map
= isl_map_read_from_str(ctx
, str
);
1417 map
= isl_map_lexmin(map
);
1418 str
= "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
1419 map2
= isl_map_read_from_str(ctx
, str
);
1420 assert(isl_map_is_equal(map
, map2
));
1424 str
= "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1425 " 8i' <= i and 8i' >= -7 + i }";
1426 set
= isl_set_read_from_str(ctx
, str
);
1427 pma
= isl_set_lexmin_pw_multi_aff(isl_set_copy(set
));
1428 set2
= isl_set_from_pw_multi_aff(pma
);
1429 equal
= isl_set_is_equal(set
, set2
);
1435 isl_die(ctx
, isl_error_unknown
,
1436 "unexpected difference between set and "
1437 "piecewise affine expression", return -1);
1447 static int collect_must_may(__isl_take isl_map
*dep
, int must
,
1448 void *dep_user
, void *user
)
1450 struct must_may
*mm
= (struct must_may
*)user
;
1453 mm
->must
= isl_map_union(mm
->must
, dep
);
1455 mm
->may
= isl_map_union(mm
->may
, dep
);
1460 static int common_space(void *first
, void *second
)
1462 int depth
= *(int *)first
;
1466 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
1474 map2
= isl_map_read_from_str(map
->ctx
, str
);
1475 equal
= isl_map_is_equal(map
, map2
);
1481 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
1485 equal
= map_is_equal(map
, str
);
1489 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
1490 "result not as expected", return -1);
1494 void test_dep(struct isl_ctx
*ctx
)
1499 isl_access_info
*ai
;
1506 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1507 map
= isl_map_read_from_str(ctx
, str
);
1508 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1510 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1511 map
= isl_map_read_from_str(ctx
, str
);
1512 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1514 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1515 map
= isl_map_read_from_str(ctx
, str
);
1516 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1518 flow
= isl_access_info_compute_flow(ai
);
1519 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1520 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1521 mm
.may
= isl_map_empty(dim
);
1523 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1525 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
1526 " [1,10,0] -> [2,5,0] }";
1527 assert(map_is_equal(mm
.must
, str
));
1528 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1529 assert(map_is_equal(mm
.may
, str
));
1531 isl_map_free(mm
.must
);
1532 isl_map_free(mm
.may
);
1533 isl_flow_free(flow
);
1536 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1537 map
= isl_map_read_from_str(ctx
, str
);
1538 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1540 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1541 map
= isl_map_read_from_str(ctx
, str
);
1542 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1544 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1545 map
= isl_map_read_from_str(ctx
, str
);
1546 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1548 flow
= isl_access_info_compute_flow(ai
);
1549 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1550 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1551 mm
.may
= isl_map_empty(dim
);
1553 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1555 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
1556 assert(map_is_equal(mm
.must
, str
));
1557 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1558 assert(map_is_equal(mm
.may
, str
));
1560 isl_map_free(mm
.must
);
1561 isl_map_free(mm
.may
);
1562 isl_flow_free(flow
);
1565 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1566 map
= isl_map_read_from_str(ctx
, str
);
1567 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1569 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1570 map
= isl_map_read_from_str(ctx
, str
);
1571 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1573 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1574 map
= isl_map_read_from_str(ctx
, str
);
1575 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1577 flow
= isl_access_info_compute_flow(ai
);
1578 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1579 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1580 mm
.may
= isl_map_empty(dim
);
1582 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1584 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
1585 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1586 assert(map_is_equal(mm
.may
, str
));
1587 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1588 assert(map_is_equal(mm
.must
, str
));
1590 isl_map_free(mm
.must
);
1591 isl_map_free(mm
.may
);
1592 isl_flow_free(flow
);
1595 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
1596 map
= isl_map_read_from_str(ctx
, str
);
1597 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1599 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1600 map
= isl_map_read_from_str(ctx
, str
);
1601 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1603 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
1604 map
= isl_map_read_from_str(ctx
, str
);
1605 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1607 flow
= isl_access_info_compute_flow(ai
);
1608 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1609 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1610 mm
.may
= isl_map_empty(dim
);
1612 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1614 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
1615 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
1616 assert(map_is_equal(mm
.may
, str
));
1617 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1618 assert(map_is_equal(mm
.must
, str
));
1620 isl_map_free(mm
.must
);
1621 isl_map_free(mm
.may
);
1622 isl_flow_free(flow
);
1625 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
1626 map
= isl_map_read_from_str(ctx
, str
);
1627 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1629 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1630 map
= isl_map_read_from_str(ctx
, str
);
1631 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1633 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
1634 map
= isl_map_read_from_str(ctx
, str
);
1635 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1637 flow
= isl_access_info_compute_flow(ai
);
1638 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1639 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1640 mm
.may
= isl_map_empty(dim
);
1642 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1644 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
1645 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
1646 assert(map_is_equal(mm
.may
, str
));
1647 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1648 assert(map_is_equal(mm
.must
, str
));
1650 isl_map_free(mm
.must
);
1651 isl_map_free(mm
.may
);
1652 isl_flow_free(flow
);
1657 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1658 map
= isl_map_read_from_str(ctx
, str
);
1659 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
1661 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1662 map
= isl_map_read_from_str(ctx
, str
);
1663 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1665 flow
= isl_access_info_compute_flow(ai
);
1666 dim
= isl_space_alloc(ctx
, 0, 5, 5);
1667 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1668 mm
.may
= isl_map_empty(dim
);
1670 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1672 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
1673 assert(map_is_equal(mm
.must
, str
));
1674 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
1675 assert(map_is_equal(mm
.may
, str
));
1677 isl_map_free(mm
.must
);
1678 isl_map_free(mm
.may
);
1679 isl_flow_free(flow
);
1682 int test_sv(isl_ctx
*ctx
)
1686 isl_union_map
*umap
;
1689 str
= "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }";
1690 map
= isl_map_read_from_str(ctx
, str
);
1691 sv
= isl_map_is_single_valued(map
);
1696 isl_die(ctx
, isl_error_internal
,
1697 "map not detected as single valued", return -1);
1699 str
= "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }";
1700 map
= isl_map_read_from_str(ctx
, str
);
1701 sv
= isl_map_is_single_valued(map
);
1706 isl_die(ctx
, isl_error_internal
,
1707 "map detected as single valued", return -1);
1709 str
= "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }";
1710 umap
= isl_union_map_read_from_str(ctx
, str
);
1711 sv
= isl_union_map_is_single_valued(umap
);
1712 isl_union_map_free(umap
);
1716 isl_die(ctx
, isl_error_internal
,
1717 "map not detected as single valued", return -1);
1719 str
= "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }";
1720 umap
= isl_union_map_read_from_str(ctx
, str
);
1721 sv
= isl_union_map_is_single_valued(umap
);
1722 isl_union_map_free(umap
);
1726 isl_die(ctx
, isl_error_internal
,
1727 "map detected as single valued", return -1);
1732 void test_bijective_case(struct isl_ctx
*ctx
, const char *str
, int bijective
)
1736 map
= isl_map_read_from_str(ctx
, str
);
1738 assert(isl_map_is_bijective(map
));
1740 assert(!isl_map_is_bijective(map
));
1744 void test_bijective(struct isl_ctx
*ctx
)
1746 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i]}", 0);
1747 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=i}", 1);
1748 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=0}", 1);
1749 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=N}", 1);
1750 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [j,i]}", 1);
1751 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i+j]}", 0);
1752 test_bijective_case(ctx
, "[N,M]->{[i,j] -> []}", 0);
1753 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,j,N]}", 1);
1754 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i]}", 0);
1755 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,i]}", 0);
1756 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,i]}", 0);
1757 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,j]}", 1);
1758 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1);
1761 void test_pwqp(struct isl_ctx
*ctx
)
1765 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
1767 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1768 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1770 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
1773 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1774 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1776 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1778 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1780 isl_pw_qpolynomial_free(pwqp1
);
1782 str
= "{ [i] -> i }";
1783 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1784 str
= "{ [k] : exists a : k = 2a }";
1785 set
= isl_set_read_from_str(ctx
, str
);
1786 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1787 str
= "{ [i] -> i }";
1788 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1790 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1792 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1794 isl_pw_qpolynomial_free(pwqp1
);
1796 str
= "{ [i] -> i + [ (i + [i/3])/2 ] }";
1797 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1799 set
= isl_set_read_from_str(ctx
, str
);
1800 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1801 str
= "{ [i] -> 16 }";
1802 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1804 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1806 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1808 isl_pw_qpolynomial_free(pwqp1
);
1810 str
= "{ [i] -> ([(i)/2]) }";
1811 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1812 str
= "{ [k] : exists a : k = 2a+1 }";
1813 set
= isl_set_read_from_str(ctx
, str
);
1814 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1815 str
= "{ [i] -> -1/2 + 1/2 * i }";
1816 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1818 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1820 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1822 isl_pw_qpolynomial_free(pwqp1
);
1824 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
1825 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1826 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
1827 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1829 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1831 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1833 isl_pw_qpolynomial_free(pwqp1
);
1835 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
1836 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1837 str
= "{ [x] -> x }";
1838 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1840 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1842 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1844 isl_pw_qpolynomial_free(pwqp1
);
1846 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
1847 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1848 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1849 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
1850 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1851 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1852 isl_pw_qpolynomial_free(pwqp1
);
1855 void test_split_periods(isl_ctx
*ctx
)
1858 isl_pw_qpolynomial
*pwqp
;
1860 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
1861 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
1862 "U >= 0; [U,V] -> U^2 : U >= 100 }";
1863 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1865 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
1868 isl_pw_qpolynomial_free(pwqp
);
1871 void test_union(isl_ctx
*ctx
)
1874 isl_union_set
*uset1
, *uset2
;
1875 isl_union_map
*umap1
, *umap2
;
1877 str
= "{ [i] : 0 <= i <= 1 }";
1878 uset1
= isl_union_set_read_from_str(ctx
, str
);
1879 str
= "{ [1] -> [0] }";
1880 umap1
= isl_union_map_read_from_str(ctx
, str
);
1882 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
1883 assert(isl_union_map_is_equal(umap1
, umap2
));
1885 isl_union_map_free(umap1
);
1886 isl_union_map_free(umap2
);
1888 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
1889 umap1
= isl_union_map_read_from_str(ctx
, str
);
1890 str
= "{ A[i]; B[i] }";
1891 uset1
= isl_union_set_read_from_str(ctx
, str
);
1893 uset2
= isl_union_map_domain(umap1
);
1895 assert(isl_union_set_is_equal(uset1
, uset2
));
1897 isl_union_set_free(uset1
);
1898 isl_union_set_free(uset2
);
1901 void test_bound(isl_ctx
*ctx
)
1904 isl_pw_qpolynomial
*pwqp
;
1905 isl_pw_qpolynomial_fold
*pwf
;
1907 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
1908 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1909 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
1910 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 4);
1911 isl_pw_qpolynomial_fold_free(pwf
);
1913 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
1914 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1915 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
1916 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 1);
1917 isl_pw_qpolynomial_fold_free(pwf
);
1920 void test_lift(isl_ctx
*ctx
)
1923 isl_basic_map
*bmap
;
1924 isl_basic_set
*bset
;
1926 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
1927 bset
= isl_basic_set_read_from_str(ctx
, str
);
1928 bset
= isl_basic_set_lift(bset
);
1929 bmap
= isl_basic_map_from_range(bset
);
1930 bset
= isl_basic_map_domain(bmap
);
1931 isl_basic_set_free(bset
);
1938 } subset_tests
[] = {
1940 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
1941 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
1942 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
1944 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
1945 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
1946 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
1947 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
1948 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
1949 "256e0 <= 255i and 256e0 >= -255 + 255i and "
1950 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
1951 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
1952 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
1953 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
1954 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
1955 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
1956 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
1959 static int test_subset(isl_ctx
*ctx
)
1962 isl_set
*set1
, *set2
;
1965 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
1966 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
1967 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
1968 subset
= isl_set_is_subset(set1
, set2
);
1973 if (subset
!= subset_tests
[i
].subset
)
1974 isl_die(ctx
, isl_error_unknown
,
1975 "incorrect subset result", return -1);
1982 const char *minuend
;
1983 const char *subtrahend
;
1984 const char *difference
;
1985 } subtract_domain_tests
[] = {
1986 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
1987 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
1988 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
1991 static int test_subtract(isl_ctx
*ctx
)
1994 isl_union_map
*umap1
, *umap2
;
1995 isl_union_set
*uset
;
1998 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
1999 umap1
= isl_union_map_read_from_str(ctx
,
2000 subtract_domain_tests
[i
].minuend
);
2001 uset
= isl_union_set_read_from_str(ctx
,
2002 subtract_domain_tests
[i
].subtrahend
);
2003 umap2
= isl_union_map_read_from_str(ctx
,
2004 subtract_domain_tests
[i
].difference
);
2005 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
2006 equal
= isl_union_map_is_equal(umap1
, umap2
);
2007 isl_union_map_free(umap1
);
2008 isl_union_map_free(umap2
);
2012 isl_die(ctx
, isl_error_unknown
,
2013 "incorrect subtract domain result", return -1);
2019 int test_factorize(isl_ctx
*ctx
)
2022 isl_basic_set
*bset
;
2025 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
2026 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
2027 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
2028 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
2029 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
2030 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
2031 "3i5 >= -2i0 - i2 + 3i4 }";
2032 bset
= isl_basic_set_read_from_str(ctx
, str
);
2033 f
= isl_basic_set_factorizer(bset
);
2034 isl_basic_set_free(bset
);
2035 isl_factorizer_free(f
);
2037 isl_die(ctx
, isl_error_unknown
,
2038 "failed to construct factorizer", return -1);
2040 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2041 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
2042 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
2043 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
2044 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
2045 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
2046 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
2047 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
2048 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
2049 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
2050 bset
= isl_basic_set_read_from_str(ctx
, str
);
2051 f
= isl_basic_set_factorizer(bset
);
2052 isl_basic_set_free(bset
);
2053 isl_factorizer_free(f
);
2055 isl_die(ctx
, isl_error_unknown
,
2056 "failed to construct factorizer", return -1);
2061 static int check_injective(__isl_take isl_map
*map
, void *user
)
2063 int *injective
= user
;
2065 *injective
= isl_map_is_injective(map
);
2068 if (*injective
< 0 || !*injective
)
2074 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
2075 const char *r
, const char *s
, int tilable
, int parallel
)
2079 isl_union_map
*W
, *R
, *S
;
2080 isl_union_map
*empty
;
2081 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
2082 isl_union_map
*validity
, *proximity
;
2083 isl_union_map
*schedule
;
2084 isl_union_map
*test
;
2085 isl_union_set
*delta
;
2086 isl_union_set
*domain
;
2090 isl_schedule
*sched
;
2091 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
2093 D
= isl_union_set_read_from_str(ctx
, d
);
2094 W
= isl_union_map_read_from_str(ctx
, w
);
2095 R
= isl_union_map_read_from_str(ctx
, r
);
2096 S
= isl_union_map_read_from_str(ctx
, s
);
2098 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
2099 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
2101 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
2102 isl_union_map_compute_flow(isl_union_map_copy(R
),
2103 isl_union_map_copy(W
), empty
,
2104 isl_union_map_copy(S
),
2105 &dep_raw
, NULL
, NULL
, NULL
);
2106 isl_union_map_compute_flow(isl_union_map_copy(W
),
2107 isl_union_map_copy(W
),
2108 isl_union_map_copy(R
),
2109 isl_union_map_copy(S
),
2110 &dep_waw
, &dep_war
, NULL
, NULL
);
2112 dep
= isl_union_map_union(dep_waw
, dep_war
);
2113 dep
= isl_union_map_union(dep
, dep_raw
);
2114 validity
= isl_union_map_copy(dep
);
2115 proximity
= isl_union_map_copy(dep
);
2117 sched
= isl_union_set_compute_schedule(isl_union_set_copy(D
),
2118 validity
, proximity
);
2119 schedule
= isl_schedule_get_map(sched
);
2120 isl_schedule_free(sched
);
2121 isl_union_map_free(W
);
2122 isl_union_map_free(R
);
2123 isl_union_map_free(S
);
2126 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
2128 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
2129 is_complete
= isl_union_set_is_subset(D
, domain
);
2130 isl_union_set_free(D
);
2131 isl_union_set_free(domain
);
2133 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
2134 test
= isl_union_map_apply_range(test
, dep
);
2135 test
= isl_union_map_apply_range(test
, schedule
);
2137 delta
= isl_union_map_deltas(test
);
2138 if (isl_union_set_n_set(delta
) == 0) {
2142 isl_union_set_free(delta
);
2144 delta_set
= isl_set_from_union_set(delta
);
2146 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2147 for (i
= 0; i
< tilable
; ++i
)
2148 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
2149 is_tilable
= isl_set_is_subset(delta_set
, slice
);
2150 isl_set_free(slice
);
2152 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2153 for (i
= 0; i
< parallel
; ++i
)
2154 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
2155 is_parallel
= isl_set_is_subset(delta_set
, slice
);
2156 isl_set_free(slice
);
2158 origin
= isl_set_universe(isl_set_get_space(delta_set
));
2159 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
2160 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
2162 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
2163 delta_set
= isl_set_lexmin(delta_set
);
2165 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
2167 isl_set_free(origin
);
2168 isl_set_free(delta_set
);
2171 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
2172 is_injection
< 0 || is_complete
< 0)
2175 isl_die(ctx
, isl_error_unknown
,
2176 "generated schedule incomplete", return -1);
2178 isl_die(ctx
, isl_error_unknown
,
2179 "generated schedule not injective on each statement",
2182 isl_die(ctx
, isl_error_unknown
,
2183 "negative dependences in generated schedule",
2186 isl_die(ctx
, isl_error_unknown
,
2187 "generated schedule not as tilable as expected",
2190 isl_die(ctx
, isl_error_unknown
,
2191 "generated schedule not as parallel as expected",
2197 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
2198 const char *domain
, const char *validity
, const char *proximity
)
2202 isl_union_map
*prox
;
2203 isl_schedule
*schedule
;
2204 isl_union_map
*sched
;
2206 dom
= isl_union_set_read_from_str(ctx
, domain
);
2207 dep
= isl_union_map_read_from_str(ctx
, validity
);
2208 prox
= isl_union_map_read_from_str(ctx
, proximity
);
2209 schedule
= isl_union_set_compute_schedule(dom
, dep
, prox
);
2210 sched
= isl_schedule_get_map(schedule
);
2211 isl_schedule_free(schedule
);
2216 /* Check that a schedule can be constructed on the given domain
2217 * with the given validity and proximity constraints.
2219 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
2220 const char *validity
, const char *proximity
)
2222 isl_union_map
*sched
;
2224 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
2228 isl_union_map_free(sched
);
2232 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
2233 const char *validity
, const char *proximity
, const char *expected_sched
)
2235 isl_union_map
*sched1
, *sched2
;
2238 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
2239 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
2241 equal
= isl_union_map_is_equal(sched1
, sched2
);
2242 isl_union_map_free(sched1
);
2243 isl_union_map_free(sched2
);
2248 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
2254 int test_schedule(isl_ctx
*ctx
)
2256 const char *D
, *W
, *R
, *V
, *P
, *S
;
2258 /* Handle resulting schedule with zero bands. */
2259 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
2263 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
2264 W
= "{ S1[t,i] -> a[t,i] }";
2265 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
2266 "S1[t,i] -> a[t-1,i+1] }";
2267 S
= "{ S1[t,i] -> [t,i] }";
2268 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2271 /* Fig. 5 of CC2008 */
2272 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
2274 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
2275 "j >= 2 and j <= -1 + N }";
2276 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
2277 "j >= 2 and j <= -1 + N; "
2278 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
2279 "j >= 2 and j <= -1 + N }";
2280 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2281 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2284 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
2285 W
= "{ S1[i] -> a[i] }";
2286 R
= "{ S2[i] -> a[i+1] }";
2287 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2288 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2291 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
2292 W
= "{ S1[i] -> a[i] }";
2293 R
= "{ S2[i] -> a[9-i] }";
2294 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2295 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2298 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
2299 W
= "{ S1[i] -> a[i] }";
2300 R
= "[N] -> { S2[i] -> a[N-1-i] }";
2301 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2302 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2305 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
2306 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
2307 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
2308 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
2309 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2312 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2313 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
2314 R
= "{ S2[i,j] -> a[i-1,j] }";
2315 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2316 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2319 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2320 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
2321 R
= "{ S2[i,j] -> a[i,j-1] }";
2322 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2323 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2326 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
2327 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
2328 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
2329 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
2330 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
2331 "S_0[] -> [0, 0, 0] }";
2332 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
2334 ctx
->opt
->schedule_parametric
= 0;
2335 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2337 ctx
->opt
->schedule_parametric
= 1;
2339 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
2340 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
2341 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
2342 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
2343 "S4[i] -> a[i,N] }";
2344 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
2345 "S4[i] -> [4,i,0] }";
2346 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2349 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
2350 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2352 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2354 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
2356 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2357 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2360 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
2361 " S_2[t] : t >= 0 and t <= -1 + N; "
2362 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
2364 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
2365 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
2366 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
2367 "i >= 0 and i <= -1 + N }";
2368 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
2369 "i >= 0 and i <= -1 + N; "
2370 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
2371 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
2372 " S_0[t] -> [0, t, 0] }";
2374 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2376 ctx
->opt
->schedule_parametric
= 0;
2377 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2379 ctx
->opt
->schedule_parametric
= 1;
2381 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
2382 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
2383 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
2386 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
2387 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
2388 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
2389 "j >= 0 and j <= -1 + N; "
2390 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2391 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
2392 "j >= 0 and j <= -1 + N; "
2393 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2394 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
2395 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2398 D
= "{ S_0[i] : i >= 0 }";
2399 W
= "{ S_0[i] -> a[i] : i >= 0 }";
2400 R
= "{ S_0[i] -> a[0] : i >= 0 }";
2401 S
= "{ S_0[i] -> [0, i, 0] }";
2402 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2405 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
2406 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
2407 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
2408 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
2409 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2412 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
2413 "k <= -1 + n and k >= 0 }";
2414 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
2415 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
2416 "k <= -1 + n and k >= 0; "
2417 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
2418 "k <= -1 + n and k >= 0; "
2419 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
2420 "k <= -1 + n and k >= 0 }";
2421 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
2422 ctx
->opt
->schedule_outer_zero_distance
= 1;
2423 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2425 ctx
->opt
->schedule_outer_zero_distance
= 0;
2427 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
2428 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
2429 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
2430 "Stmt_for_body24[i0, i1, 1, 0]:"
2431 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
2432 "Stmt_for_body7[i0, i1, i2]:"
2433 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
2436 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
2437 "Stmt_for_body24[1, i1, i2, i3]:"
2438 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
2440 "Stmt_for_body24[0, i1, i2, i3] -> "
2441 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
2442 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
2444 "Stmt_for_body24[0, i1, i2, i3] ->"
2445 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
2446 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
2447 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
2448 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
2449 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
2450 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
2451 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
2452 "i1 <= 6 and i1 >= 0;"
2453 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
2454 "Stmt_for_body7[i0, i1, i2] -> "
2455 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
2456 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
2457 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
2458 "Stmt_for_body7[i0, i1, i2] -> "
2459 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
2460 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
2461 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
2463 S
= "{ Stmt_for_body24[i0, i1, i2, i3] -> "
2464 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
2465 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
2467 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2470 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
2471 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
2472 "j >= 1 and j <= 7;"
2473 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
2474 "j >= 1 and j <= 8 }";
2476 S
= "{ S_0[i, j] -> [i + j, j] }";
2477 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2478 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2480 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2482 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
2483 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
2484 "j >= 0 and j <= -1 + i }";
2485 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
2486 "i <= -1 + N and j >= 0;"
2487 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
2490 S
= "{ S_0[i, j] -> [i, j] }";
2491 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2492 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2494 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2496 /* Test both algorithms on a case with only proximity dependences. */
2497 D
= "{ S[i,j] : 0 <= i <= 10 }";
2499 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
2500 S
= "{ S[i, j] -> [j, i] }";
2501 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2502 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2504 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2505 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2508 D
= "{ A[a]; B[] }";
2510 P
= "{ A[a] -> B[] }";
2511 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
2517 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
2519 isl_union_map
*umap
;
2522 umap
= isl_union_map_read_from_str(ctx
, str
);
2523 test
= isl_union_map_plain_is_injective(umap
);
2524 isl_union_map_free(umap
);
2527 if (test
== injective
)
2530 isl_die(ctx
, isl_error_unknown
,
2531 "map not detected as injective", return -1);
2533 isl_die(ctx
, isl_error_unknown
,
2534 "map detected as injective", return -1);
2537 int test_injective(isl_ctx
*ctx
)
2541 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
2543 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
2545 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
2547 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
2549 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
2551 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
2553 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
2555 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
2558 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
2559 if (test_plain_injective(ctx
, str
, 1))
2561 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
2562 if (test_plain_injective(ctx
, str
, 0))
2568 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
2576 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
2577 equal
= isl_aff_plain_is_equal(aff
, aff2
);
2583 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
2587 equal
= aff_plain_is_equal(aff
, str
);
2591 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
2592 "result not as expected", return -1);
2596 int test_aff(isl_ctx
*ctx
)
2601 isl_local_space
*ls
;
2605 space
= isl_space_set_alloc(ctx
, 0, 1);
2606 ls
= isl_local_space_from_space(space
);
2607 aff
= isl_aff_zero_on_domain(ls
);
2609 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2610 aff
= isl_aff_scale_down_ui(aff
, 3);
2611 aff
= isl_aff_floor(aff
);
2612 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2613 aff
= isl_aff_scale_down_ui(aff
, 2);
2614 aff
= isl_aff_floor(aff
);
2615 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2618 set
= isl_set_read_from_str(ctx
, str
);
2619 aff
= isl_aff_gist(aff
, set
);
2621 aff
= isl_aff_add_constant_si(aff
, -16);
2622 zero
= isl_aff_plain_is_zero(aff
);
2628 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2630 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
2631 aff
= isl_aff_scale_down_ui(aff
, 64);
2632 aff
= isl_aff_floor(aff
);
2633 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
2641 int test_dim_max(isl_ctx
*ctx
)
2645 isl_set
*set1
, *set2
;
2650 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
2651 set
= isl_set_read_from_str(ctx
, str
);
2652 pwaff
= isl_set_dim_max(set
, 0);
2653 set1
= isl_set_from_pw_aff(pwaff
);
2654 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
2655 set2
= isl_set_read_from_str(ctx
, str
);
2656 equal
= isl_set_is_equal(set1
, set2
);
2662 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2664 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
2665 set
= isl_set_read_from_str(ctx
, str
);
2666 pwaff
= isl_set_dim_max(set
, 0);
2667 set1
= isl_set_from_pw_aff(pwaff
);
2668 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2669 set2
= isl_set_read_from_str(ctx
, str
);
2670 equal
= isl_set_is_equal(set1
, set2
);
2676 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2678 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
2679 set
= isl_set_read_from_str(ctx
, str
);
2680 pwaff
= isl_set_dim_max(set
, 0);
2681 set1
= isl_set_from_pw_aff(pwaff
);
2682 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2683 set2
= isl_set_read_from_str(ctx
, str
);
2684 equal
= isl_set_is_equal(set1
, set2
);
2690 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2692 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
2693 "0 <= i < N and 0 <= j < M }";
2694 map
= isl_map_read_from_str(ctx
, str
);
2695 set
= isl_map_range(map
);
2697 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
2698 set1
= isl_set_from_pw_aff(pwaff
);
2699 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
2700 set2
= isl_set_read_from_str(ctx
, str
);
2701 equal
= isl_set_is_equal(set1
, set2
);
2705 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
2706 set1
= isl_set_from_pw_aff(pwaff
);
2707 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
2708 set2
= isl_set_read_from_str(ctx
, str
);
2709 if (equal
>= 0 && equal
)
2710 equal
= isl_set_is_equal(set1
, set2
);
2719 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2721 /* Check that solutions are properly merged. */
2722 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
2723 "c <= -1 + n - 4a - 2b and c >= -2b and "
2724 "4a >= -4 + n and c >= 0 }";
2725 set
= isl_set_read_from_str(ctx
, str
);
2726 pwaff
= isl_set_dim_min(set
, 2);
2727 set1
= isl_set_from_pw_aff(pwaff
);
2728 str
= "[n] -> { [(0)] : n >= 1 }";
2729 set2
= isl_set_read_from_str(ctx
, str
);
2730 equal
= isl_set_is_equal(set1
, set2
);
2737 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2742 int test_product(isl_ctx
*ctx
)
2746 isl_union_set
*uset1
, *uset2
;
2750 set
= isl_set_read_from_str(ctx
, str
);
2751 set
= isl_set_product(set
, isl_set_copy(set
));
2752 ok
= isl_set_is_wrapping(set
);
2757 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2760 uset1
= isl_union_set_read_from_str(ctx
, str
);
2761 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
2762 str
= "{ [[] -> []] }";
2763 uset2
= isl_union_set_read_from_str(ctx
, str
);
2764 ok
= isl_union_set_is_equal(uset1
, uset2
);
2765 isl_union_set_free(uset1
);
2766 isl_union_set_free(uset2
);
2770 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2775 int test_equal(isl_ctx
*ctx
)
2778 isl_set
*set
, *set2
;
2782 set
= isl_set_read_from_str(ctx
, str
);
2784 set2
= isl_set_read_from_str(ctx
, str
);
2785 equal
= isl_set_is_equal(set
, set2
);
2791 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2796 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
2797 enum isl_dim_type type
, unsigned pos
, int fixed
)
2801 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
2808 isl_die(ctx
, isl_error_unknown
,
2809 "map not detected as fixed", return -1);
2811 isl_die(ctx
, isl_error_unknown
,
2812 "map detected as fixed", return -1);
2815 int test_fixed(isl_ctx
*ctx
)
2820 str
= "{ [i] -> [i] }";
2821 map
= isl_map_read_from_str(ctx
, str
);
2822 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
2824 str
= "{ [i] -> [1] }";
2825 map
= isl_map_read_from_str(ctx
, str
);
2826 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
2828 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
2829 map
= isl_map_read_from_str(ctx
, str
);
2830 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
2832 map
= isl_map_read_from_str(ctx
, str
);
2833 map
= isl_map_neg(map
);
2834 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
2840 int test_vertices(isl_ctx
*ctx
)
2843 isl_basic_set
*bset
;
2844 isl_vertices
*vertices
;
2846 str
= "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }";
2847 bset
= isl_basic_set_read_from_str(ctx
, str
);
2848 vertices
= isl_basic_set_compute_vertices(bset
);
2849 isl_basic_set_free(bset
);
2850 isl_vertices_free(vertices
);
2854 str
= "{ A[t, i] : t = 14 and i = 1 }";
2855 bset
= isl_basic_set_read_from_str(ctx
, str
);
2856 vertices
= isl_basic_set_compute_vertices(bset
);
2857 isl_basic_set_free(bset
);
2858 isl_vertices_free(vertices
);
2865 int test_union_pw(isl_ctx
*ctx
)
2869 isl_union_set
*uset
;
2870 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
2872 str
= "{ [x] -> x^2 }";
2873 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
2874 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
2875 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
2876 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
2877 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
2878 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
2879 isl_union_pw_qpolynomial_free(upwqp1
);
2880 isl_union_pw_qpolynomial_free(upwqp2
);
2884 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2889 int test_output(isl_ctx
*ctx
)
2897 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
2898 pa
= isl_pw_aff_read_from_str(ctx
, str
);
2900 p
= isl_printer_to_str(ctx
);
2901 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
2902 p
= isl_printer_print_pw_aff(p
, pa
);
2903 s
= isl_printer_get_str(p
);
2904 isl_printer_free(p
);
2905 isl_pw_aff_free(pa
);
2909 equal
= !strcmp(s
, "(2 - x + 4*floord(x, 4) >= 0) ? (1) : 2");
2914 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2919 int test_sample(isl_ctx
*ctx
)
2922 isl_basic_set
*bset1
, *bset2
;
2925 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
2926 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
2927 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
2928 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
2929 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
2930 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
2931 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
2932 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
2933 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
2934 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
2935 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
2936 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
2937 "d - 1073741821e and "
2938 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
2939 "3j >= 1 - a + b + 2e and "
2940 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
2941 "3i <= 4 - a + 4b - e and "
2942 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
2943 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
2944 "c <= -1 + a and 3i >= -2 - a + 3e and "
2945 "1073741822e <= 1073741823 - a + 1073741822b + c and "
2946 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
2947 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
2948 "1073741823e >= 1 + 1073741823b - d and "
2949 "3i >= 1073741823b + c - 1073741823e - f and "
2950 "3i >= 1 + 2b + e + 3g }";
2951 bset1
= isl_basic_set_read_from_str(ctx
, str
);
2952 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
2953 empty
= isl_basic_set_is_empty(bset2
);
2954 subset
= isl_basic_set_is_subset(bset2
, bset1
);
2955 isl_basic_set_free(bset1
);
2956 isl_basic_set_free(bset2
);
2957 if (empty
< 0 || subset
< 0)
2960 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
2962 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
2967 int test_fixed_power(isl_ctx
*ctx
)
2975 str
= "{ [i] -> [i + 1] }";
2976 map
= isl_map_read_from_str(ctx
, str
);
2977 isl_int_set_si(exp
, 23);
2978 map
= isl_map_fixed_power(map
, exp
);
2979 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
2988 int test_slice(isl_ctx
*ctx
)
2994 str
= "{ [i] -> [j] }";
2995 map
= isl_map_read_from_str(ctx
, str
);
2996 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
2997 equal
= map_check_equal(map
, "{ [i] -> [i] }");
3002 str
= "{ [i] -> [j] }";
3003 map
= isl_map_read_from_str(ctx
, str
);
3004 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3005 equal
= map_check_equal(map
, "{ [i] -> [j] }");
3010 str
= "{ [i] -> [j] }";
3011 map
= isl_map_read_from_str(ctx
, str
);
3012 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
3013 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
3018 str
= "{ [i] -> [j] }";
3019 map
= isl_map_read_from_str(ctx
, str
);
3020 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3021 equal
= map_check_equal(map
, "{ [0] -> [j] }");
3026 str
= "{ [i] -> [j] }";
3027 map
= isl_map_read_from_str(ctx
, str
);
3028 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
3029 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
3034 str
= "{ [i] -> [j] }";
3035 map
= isl_map_read_from_str(ctx
, str
);
3036 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3037 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
3045 int test_eliminate(isl_ctx
*ctx
)
3051 str
= "{ [i] -> [j] : i = 2j }";
3052 map
= isl_map_read_from_str(ctx
, str
);
3053 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
3054 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
3062 /* Check that isl_set_dim_residue_class detects that the values of j
3063 * in the set below are all odd and that it does not detect any spurious
3066 static int test_residue_class(isl_ctx
*ctx
)
3073 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
3074 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
3075 set
= isl_set_read_from_str(ctx
, str
);
3078 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
3080 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
3081 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
3090 int test_align_parameters(isl_ctx
*ctx
)
3094 isl_multi_aff
*ma1
, *ma2
;
3097 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
3098 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
3100 space
= isl_space_params_alloc(ctx
, 1);
3101 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
3102 ma1
= isl_multi_aff_align_params(ma1
, space
);
3104 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
3105 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
3107 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
3109 isl_multi_aff_free(ma1
);
3110 isl_multi_aff_free(ma2
);
3115 isl_die(ctx
, isl_error_unknown
,
3116 "result not as expected", return -1);
3121 static int test_list(isl_ctx
*ctx
)
3123 isl_id
*a
, *b
, *c
, *d
, *id
;
3127 a
= isl_id_alloc(ctx
, "a", NULL
);
3128 b
= isl_id_alloc(ctx
, "b", NULL
);
3129 c
= isl_id_alloc(ctx
, "c", NULL
);
3130 d
= isl_id_alloc(ctx
, "d", NULL
);
3132 list
= isl_id_list_alloc(ctx
, 4);
3133 list
= isl_id_list_add(list
, a
);
3134 list
= isl_id_list_add(list
, b
);
3135 list
= isl_id_list_add(list
, c
);
3136 list
= isl_id_list_add(list
, d
);
3137 list
= isl_id_list_drop(list
, 1, 1);
3139 if (isl_id_list_n_id(list
) != 3) {
3140 isl_id_list_free(list
);
3141 isl_die(ctx
, isl_error_unknown
,
3142 "unexpected number of elements in list", return -1);
3145 id
= isl_id_list_get_id(list
, 0);
3148 id
= isl_id_list_get_id(list
, 1);
3151 id
= isl_id_list_get_id(list
, 2);
3155 isl_id_list_free(list
);
3158 isl_die(ctx
, isl_error_unknown
,
3159 "unexpected elements in list", return -1);
3164 const char *set_conversion_tests
[] = {
3165 "[N] -> { [i] : N - 1 <= 2 i <= N }",
3166 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
3167 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3168 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3171 /* Check that converting from isl_set to isl_pw_multi_aff and back
3172 * to isl_set produces the original isl_set.
3174 static int test_set_conversion(isl_ctx
*ctx
)
3178 isl_set
*set1
, *set2
;
3179 isl_pw_multi_aff
*pma
;
3182 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
3183 str
= set_conversion_tests
[i
];
3184 set1
= isl_set_read_from_str(ctx
, str
);
3185 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
3186 set2
= isl_set_from_pw_multi_aff(pma
);
3187 equal
= isl_set_is_equal(set1
, set2
);
3194 isl_die(ctx
, isl_error_unknown
, "bad conversion",
3201 /* Check that converting from isl_map to isl_pw_multi_aff and back
3202 * to isl_map produces the original isl_map.
3204 static int test_map_conversion(isl_ctx
*ctx
)
3207 isl_map
*map1
, *map2
;
3208 isl_pw_multi_aff
*pma
;
3211 str
= "{ [a, b, c, d] -> s0[a, b, e, f] : "
3212 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
3213 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
3214 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
3216 map1
= isl_map_read_from_str(ctx
, str
);
3217 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
3218 map2
= isl_map_from_pw_multi_aff(pma
);
3219 equal
= isl_map_is_equal(map1
, map2
);
3226 isl_die(ctx
, isl_error_unknown
, "bad conversion", return -1);
3231 static int test_conversion(isl_ctx
*ctx
)
3233 if (test_set_conversion(ctx
) < 0)
3235 if (test_map_conversion(ctx
) < 0)
3240 /* Check that isl_basic_map_curry does not modify input.
3242 static int test_curry(isl_ctx
*ctx
)
3245 isl_basic_map
*bmap1
, *bmap2
;
3248 str
= "{ [A[] -> B[]] -> C[] }";
3249 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
3250 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
3251 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
3252 isl_basic_map_free(bmap1
);
3253 isl_basic_map_free(bmap2
);
3258 isl_die(ctx
, isl_error_unknown
,
3259 "curried map should not be equal to original",
3269 } preimage_tests
[] = {
3270 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
3271 "{ A[j,i] -> B[i,j] }",
3272 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
3273 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3274 "{ A[a,b] -> B[a/2,b/6] }",
3275 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
3276 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3277 "{ A[a,b] -> B[a/2,b/6] }",
3278 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
3279 "exists i,j : a = 2 i and b = 6 j }" },
3280 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
3281 "[n] -> { : 0 <= n <= 100 }" },
3282 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3283 "{ A[a] -> B[2a] }",
3284 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
3285 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3286 "{ A[a] -> B[([a/2])] }",
3287 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
3288 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
3289 "{ A[a] -> B[a,a,a/3] }",
3290 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
3291 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
3292 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
3295 int test_preimage(isl_ctx
*ctx
)
3298 isl_basic_set
*bset1
, *bset2
;
3302 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
3303 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
3304 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
3305 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
3306 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
3307 equal
= isl_basic_set_is_equal(bset1
, bset2
);
3308 isl_basic_set_free(bset1
);
3309 isl_basic_set_free(bset2
);
3313 isl_die(ctx
, isl_error_unknown
, "bad preimage",
3324 } pullback_tests
[] = {
3325 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
3326 "{ A[a,b] -> C[b + 2a] }" },
3327 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
3328 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
3329 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
3330 "{ A[a] -> C[(a)/6] }" },
3331 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
3332 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
3333 "{ A[a] -> C[(2a)/3] }" },
3334 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
3335 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
3336 "{ A[i,j] -> C[i + j, i + j] }"},
3337 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
3338 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
3339 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
3342 static int test_pullback(isl_ctx
*ctx
)
3345 isl_multi_aff
*ma1
, *ma2
;
3349 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
3350 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
3351 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
3352 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
3353 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
3354 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
3355 isl_multi_aff_free(ma1
);
3356 isl_multi_aff_free(ma2
);
3360 isl_die(ctx
, isl_error_unknown
, "bad pullback",
3367 /* Check that negation is printed correctly.
3369 static int test_ast(isl_ctx
*ctx
)
3371 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
3375 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
3376 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
3377 expr
= isl_ast_expr_add(expr1
, expr2
);
3378 expr
= isl_ast_expr_neg(expr
);
3379 str
= isl_ast_expr_to_str(expr
);
3380 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
3382 isl_ast_expr_free(expr
);
3387 isl_die(ctx
, isl_error_unknown
,
3388 "isl_ast_expr printed incorrectly", return -1);
3390 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
3391 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
3392 expr
= isl_ast_expr_add(expr1
, expr2
);
3393 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
3394 expr
= isl_ast_expr_sub(expr3
, expr
);
3395 str
= isl_ast_expr_to_str(expr
);
3396 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
3398 isl_ast_expr_free(expr
);
3403 isl_die(ctx
, isl_error_unknown
,
3404 "isl_ast_expr printed incorrectly", return -1);
3409 /* Internal data structure for before_for and after_for callbacks.
3411 * depth is the current depth
3412 * before is the number of times before_for has been called
3413 * after is the number of times after_for has been called
3415 struct isl_test_codegen_data
{
3421 /* This function is called before each for loop in the AST generated
3422 * from test_ast_gen1.
3424 * Increment the number of calls and the depth.
3425 * Check that the space returned by isl_ast_build_get_schedule_space
3426 * matches the target space of the schedule returned by
3427 * isl_ast_build_get_schedule.
3428 * Return an isl_id that is checked by the corresponding call
3431 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
3434 struct isl_test_codegen_data
*data
= user
;
3437 isl_union_map
*schedule
;
3438 isl_union_set
*uset
;
3443 ctx
= isl_ast_build_get_ctx(build
);
3445 if (data
->before
>= 3)
3446 isl_die(ctx
, isl_error_unknown
,
3447 "unexpected number of for nodes", return NULL
);
3448 if (data
->depth
>= 2)
3449 isl_die(ctx
, isl_error_unknown
,
3450 "unexpected depth", return NULL
);
3452 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
3456 schedule
= isl_ast_build_get_schedule(build
);
3457 uset
= isl_union_map_range(schedule
);
3460 if (isl_union_set_n_set(uset
) != 1) {
3461 isl_union_set_free(uset
);
3462 isl_die(ctx
, isl_error_unknown
,
3463 "expecting single range space", return NULL
);
3466 space
= isl_ast_build_get_schedule_space(build
);
3467 set
= isl_union_set_extract_set(uset
, space
);
3468 isl_union_set_free(uset
);
3469 empty
= isl_set_is_empty(set
);
3475 isl_die(ctx
, isl_error_unknown
,
3476 "spaces don't match", return NULL
);
3478 return isl_id_alloc(ctx
, name
, NULL
);
3481 /* This function is called after each for loop in the AST generated
3482 * from test_ast_gen1.
3484 * Increment the number of calls and decrement the depth.
3485 * Check that the annotation attached to the node matches
3486 * the isl_id returned by the corresponding call to before_for.
3488 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
3489 __isl_keep isl_ast_build
*build
, void *user
)
3491 struct isl_test_codegen_data
*data
= user
;
3499 if (data
->after
> data
->before
)
3500 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3501 "mismatch in number of for nodes",
3502 return isl_ast_node_free(node
));
3504 id
= isl_ast_node_get_annotation(node
);
3506 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3507 "missing annotation", return isl_ast_node_free(node
));
3509 name
= isl_id_get_name(id
);
3510 valid
= name
&& atoi(name
+ 1) == data
->depth
;
3514 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3515 "wrong annotation", return isl_ast_node_free(node
));
3520 /* Check that the before_each_for and after_each_for callbacks
3521 * are called for each for loop in the generated code,
3522 * that they are called in the right order and that the isl_id
3523 * returned from the before_each_for callback is attached to
3524 * the isl_ast_node passed to the corresponding after_each_for call.
3526 static int test_ast_gen1(isl_ctx
*ctx
)
3530 isl_union_map
*schedule
;
3531 isl_ast_build
*build
;
3533 struct isl_test_codegen_data data
;
3535 str
= "[N] -> { : N >= 10 }";
3536 set
= isl_set_read_from_str(ctx
, str
);
3537 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
3538 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
3539 schedule
= isl_union_map_read_from_str(ctx
, str
);
3544 build
= isl_ast_build_from_context(set
);
3545 build
= isl_ast_build_set_before_each_for(build
,
3546 &before_for
, &data
);
3547 build
= isl_ast_build_set_after_each_for(build
,
3549 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3550 isl_ast_build_free(build
);
3554 isl_ast_node_free(tree
);
3556 if (data
.before
!= 3 || data
.after
!= 3)
3557 isl_die(ctx
, isl_error_unknown
,
3558 "unexpected number of for nodes", return -1);
3563 /* Check that the AST generator handles domains that are integrally disjoint
3564 * but not ratinoally disjoint.
3566 static int test_ast_gen2(isl_ctx
*ctx
)
3570 isl_union_map
*schedule
;
3571 isl_union_map
*options
;
3572 isl_ast_build
*build
;
3575 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
3576 schedule
= isl_union_map_read_from_str(ctx
, str
);
3577 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3578 build
= isl_ast_build_from_context(set
);
3580 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
3581 options
= isl_union_map_read_from_str(ctx
, str
);
3582 build
= isl_ast_build_set_options(build
, options
);
3583 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3584 isl_ast_build_free(build
);
3587 isl_ast_node_free(tree
);
3592 /* Increment *user on each call.
3594 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
3595 __isl_keep isl_ast_build
*build
, void *user
)
3604 /* Test that unrolling tries to minimize the number of instances.
3605 * In particular, for the schedule given below, make sure it generates
3606 * 3 nodes (rather than 101).
3608 static int test_ast_gen3(isl_ctx
*ctx
)
3612 isl_union_map
*schedule
;
3613 isl_union_map
*options
;
3614 isl_ast_build
*build
;
3618 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
3619 schedule
= isl_union_map_read_from_str(ctx
, str
);
3620 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3622 str
= "{ [i] -> unroll[0] }";
3623 options
= isl_union_map_read_from_str(ctx
, str
);
3625 build
= isl_ast_build_from_context(set
);
3626 build
= isl_ast_build_set_options(build
, options
);
3627 build
= isl_ast_build_set_at_each_domain(build
,
3628 &count_domains
, &n_domain
);
3629 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3630 isl_ast_build_free(build
);
3634 isl_ast_node_free(tree
);
3637 isl_die(ctx
, isl_error_unknown
,
3638 "unexpected number of for nodes", return -1);
3643 /* Check that if the ast_build_exploit_nested_bounds options is set,
3644 * we do not get an outer if node in the generated AST,
3645 * while we do get such an outer if node if the options is not set.
3647 static int test_ast_gen4(isl_ctx
*ctx
)
3651 isl_union_map
*schedule
;
3652 isl_ast_build
*build
;
3654 enum isl_ast_node_type type
;
3657 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
3658 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
3660 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
3662 schedule
= isl_union_map_read_from_str(ctx
, str
);
3663 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3664 build
= isl_ast_build_from_context(set
);
3665 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3666 isl_ast_build_free(build
);
3670 type
= isl_ast_node_get_type(tree
);
3671 isl_ast_node_free(tree
);
3673 if (type
== isl_ast_node_if
)
3674 isl_die(ctx
, isl_error_unknown
,
3675 "not expecting if node", return -1);
3677 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
3679 schedule
= isl_union_map_read_from_str(ctx
, str
);
3680 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3681 build
= isl_ast_build_from_context(set
);
3682 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3683 isl_ast_build_free(build
);
3687 type
= isl_ast_node_get_type(tree
);
3688 isl_ast_node_free(tree
);
3690 if (type
!= isl_ast_node_if
)
3691 isl_die(ctx
, isl_error_unknown
,
3692 "expecting if node", return -1);
3694 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
3699 static int test_ast_gen(isl_ctx
*ctx
)
3701 if (test_ast_gen1(ctx
) < 0)
3703 if (test_ast_gen2(ctx
) < 0)
3705 if (test_ast_gen3(ctx
) < 0)
3707 if (test_ast_gen4(ctx
) < 0)
3712 /* Check if dropping output dimensions from an isl_pw_multi_aff
3715 static int test_pw_multi_aff(isl_ctx
*ctx
)
3718 isl_pw_multi_aff
*pma1
, *pma2
;
3721 str
= "{ [i,j] -> [i+j, 4i-j] }";
3722 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3723 str
= "{ [i,j] -> [4i-j] }";
3724 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3726 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
3728 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
3730 isl_pw_multi_aff_free(pma1
);
3731 isl_pw_multi_aff_free(pma2
);
3735 isl_die(ctx
, isl_error_unknown
,
3736 "expressions not equal", return -1);
3741 /* This is a regression test for a bug where isl_basic_map_simplify
3742 * would end up in an infinite loop. In particular, we construct
3743 * an empty basic set that is not obviously empty.
3744 * isl_basic_set_is_empty marks the basic set as empty.
3745 * After projecting out i3, the variable can be dropped completely,
3746 * but isl_basic_map_simplify refrains from doing so if the basic set
3747 * is empty and would end up in an infinite loop if it didn't test
3748 * explicitly for empty basic maps in the outer loop.
3750 static int test_simplify(isl_ctx
*ctx
)
3753 isl_basic_set
*bset
;
3756 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
3757 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
3758 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
3760 bset
= isl_basic_set_read_from_str(ctx
, str
);
3761 empty
= isl_basic_set_is_empty(bset
);
3762 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
3763 isl_basic_set_free(bset
);
3767 isl_die(ctx
, isl_error_unknown
,
3768 "basic set should be empty", return -1);
3773 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
3774 * with gbr context would fail to disable the use of the shifted tableau
3775 * when transferring equalities for the input to the context, resulting
3776 * in invalid sample values.
3778 static int test_partial_lexmin(isl_ctx
*ctx
)
3781 isl_basic_set
*bset
;
3782 isl_basic_map
*bmap
;
3785 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
3786 bmap
= isl_basic_map_read_from_str(ctx
, str
);
3787 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
3788 bset
= isl_basic_set_read_from_str(ctx
, str
);
3789 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
3798 /* Check that the variable compression performed on the existentially
3799 * quantified variables inside isl_basic_set_compute_divs is not confused
3800 * by the implicit equalities among the parameters.
3802 static int test_compute_divs(isl_ctx
*ctx
)
3805 isl_basic_set
*bset
;
3808 str
= "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
3809 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
3810 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
3811 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
3812 bset
= isl_basic_set_read_from_str(ctx
, str
);
3813 set
= isl_basic_set_compute_divs(bset
);
3823 int (*fn
)(isl_ctx
*ctx
);
3825 { "compute divs", &test_compute_divs
},
3826 { "partial lexmin", &test_partial_lexmin
},
3827 { "simplify", &test_simplify
},
3828 { "curry", &test_curry
},
3829 { "piecewise multi affine expressions", &test_pw_multi_aff
},
3830 { "conversion", &test_conversion
},
3831 { "list", &test_list
},
3832 { "align parameters", &test_align_parameters
},
3833 { "preimage", &test_preimage
},
3834 { "pullback", &test_pullback
},
3835 { "AST", &test_ast
},
3836 { "AST generation", &test_ast_gen
},
3837 { "eliminate", &test_eliminate
},
3838 { "residue class", &test_residue_class
},
3839 { "div", &test_div
},
3840 { "slice", &test_slice
},
3841 { "fixed power", &test_fixed_power
},
3842 { "sample", &test_sample
},
3843 { "output", &test_output
},
3844 { "vertices", &test_vertices
},
3845 { "fixed", &test_fixed
},
3846 { "equal", &test_equal
},
3847 { "product", &test_product
},
3848 { "dim_max", &test_dim_max
},
3849 { "affine", &test_aff
},
3850 { "injective", &test_injective
},
3851 { "schedule", &test_schedule
},
3852 { "union_pw", &test_union_pw
},
3853 { "parse", &test_parse
},
3854 { "single-valued", &test_sv
},
3855 { "affine hull", &test_affine_hull
},
3856 { "coalesce", &test_coalesce
},
3857 { "factorize", &test_factorize
},
3858 { "subset", &test_subset
},
3859 { "subtract", &test_subtract
},
3860 { "lexmin", &test_lexmin
},
3866 struct isl_ctx
*ctx
;
3868 srcdir
= getenv("srcdir");
3871 ctx
= isl_ctx_alloc();
3872 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
3873 printf("%s\n", tests
[i
].name
);
3874 if (tests
[i
].fn(ctx
) < 0)
3880 test_split_periods(ctx
);
3883 test_bijective(ctx
);
3887 test_construction(ctx
);
3889 test_application(ctx
);
3890 test_convex_hull(ctx
);