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)
211 void test_read(struct isl_ctx
*ctx
)
215 struct isl_basic_set
*bset1
, *bset2
;
216 const char *str
= "{[y]: Exists ( alpha : 2alpha = y)}";
218 filename
= get_filename(ctx
, "set", "omega");
220 input
= fopen(filename
, "r");
223 bset1
= isl_basic_set_read_from_file(ctx
, input
);
224 bset2
= isl_basic_set_read_from_str(ctx
, str
);
226 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
228 isl_basic_set_free(bset1
);
229 isl_basic_set_free(bset2
);
235 void test_bounded(struct isl_ctx
*ctx
)
240 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : 0 <= i <= n }");
241 bounded
= isl_set_is_bounded(set
);
245 set
= isl_set_read_from_str(ctx
, "{[n, i] : 0 <= i <= n }");
246 bounded
= isl_set_is_bounded(set
);
250 set
= isl_set_read_from_str(ctx
, "[n] -> {[i] : i <= n }");
251 bounded
= isl_set_is_bounded(set
);
256 /* Construct the basic set { [i] : 5 <= i <= N } */
257 void test_construction(struct isl_ctx
*ctx
)
262 struct isl_basic_set
*bset
;
263 struct isl_constraint
*c
;
267 dim
= isl_space_set_alloc(ctx
, 1, 1);
268 bset
= isl_basic_set_universe(isl_space_copy(dim
));
269 ls
= isl_local_space_from_space(dim
);
271 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
272 isl_int_set_si(v
, -1);
273 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
274 isl_int_set_si(v
, 1);
275 isl_constraint_set_coefficient(c
, isl_dim_param
, 0, v
);
276 bset
= isl_basic_set_add_constraint(bset
, c
);
278 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
279 isl_int_set_si(v
, 1);
280 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
281 isl_int_set_si(v
, -5);
282 isl_constraint_set_constant(c
, v
);
283 bset
= isl_basic_set_add_constraint(bset
, c
);
285 isl_local_space_free(ls
);
286 isl_basic_set_free(bset
);
291 void test_dim(struct isl_ctx
*ctx
)
294 isl_map
*map1
, *map2
;
296 map1
= isl_map_read_from_str(ctx
,
297 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
298 map1
= isl_map_add_dims(map1
, isl_dim_in
, 1);
299 map2
= isl_map_read_from_str(ctx
,
300 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
301 assert(isl_map_is_equal(map1
, map2
));
304 map1
= isl_map_project_out(map1
, isl_dim_in
, 0, 1);
305 map2
= isl_map_read_from_str(ctx
, "[n] -> { [i] -> [j] : n >= 0 }");
306 assert(isl_map_is_equal(map1
, map2
));
311 str
= "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
312 map1
= isl_map_read_from_str(ctx
, str
);
313 str
= "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
314 map2
= isl_map_read_from_str(ctx
, str
);
315 map1
= isl_map_move_dims(map1
, isl_dim_out
, 0, isl_dim_param
, 0, 1);
316 assert(isl_map_is_equal(map1
, map2
));
322 static int test_div(isl_ctx
*ctx
)
331 struct isl_basic_set
*bset
;
332 struct isl_constraint
*c
;
337 dim
= isl_space_set_alloc(ctx
, 0, 3);
338 bset
= isl_basic_set_universe(isl_space_copy(dim
));
339 ls
= isl_local_space_from_space(dim
);
341 c
= isl_equality_alloc(isl_local_space_copy(ls
));
342 isl_int_set_si(v
, -1);
343 isl_constraint_set_constant(c
, v
);
344 isl_int_set_si(v
, 1);
345 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
346 isl_int_set_si(v
, 3);
347 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
348 bset
= isl_basic_set_add_constraint(bset
, c
);
350 c
= isl_equality_alloc(isl_local_space_copy(ls
));
351 isl_int_set_si(v
, 1);
352 isl_constraint_set_constant(c
, v
);
353 isl_int_set_si(v
, -1);
354 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
355 isl_int_set_si(v
, 3);
356 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
357 bset
= isl_basic_set_add_constraint(bset
, c
);
359 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
361 assert(bset
&& bset
->n_div
== 1);
362 isl_local_space_free(ls
);
363 isl_basic_set_free(bset
);
366 dim
= isl_space_set_alloc(ctx
, 0, 3);
367 bset
= isl_basic_set_universe(isl_space_copy(dim
));
368 ls
= isl_local_space_from_space(dim
);
370 c
= isl_equality_alloc(isl_local_space_copy(ls
));
371 isl_int_set_si(v
, 1);
372 isl_constraint_set_constant(c
, v
);
373 isl_int_set_si(v
, -1);
374 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
375 isl_int_set_si(v
, 3);
376 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
377 bset
= isl_basic_set_add_constraint(bset
, c
);
379 c
= isl_equality_alloc(isl_local_space_copy(ls
));
380 isl_int_set_si(v
, -1);
381 isl_constraint_set_constant(c
, v
);
382 isl_int_set_si(v
, 1);
383 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
384 isl_int_set_si(v
, 3);
385 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
386 bset
= isl_basic_set_add_constraint(bset
, c
);
388 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
390 assert(bset
&& bset
->n_div
== 1);
391 isl_local_space_free(ls
);
392 isl_basic_set_free(bset
);
395 dim
= isl_space_set_alloc(ctx
, 0, 3);
396 bset
= isl_basic_set_universe(isl_space_copy(dim
));
397 ls
= isl_local_space_from_space(dim
);
399 c
= isl_equality_alloc(isl_local_space_copy(ls
));
400 isl_int_set_si(v
, 1);
401 isl_constraint_set_constant(c
, v
);
402 isl_int_set_si(v
, -1);
403 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
404 isl_int_set_si(v
, 3);
405 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
406 bset
= isl_basic_set_add_constraint(bset
, c
);
408 c
= isl_equality_alloc(isl_local_space_copy(ls
));
409 isl_int_set_si(v
, -3);
410 isl_constraint_set_constant(c
, v
);
411 isl_int_set_si(v
, 1);
412 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
413 isl_int_set_si(v
, 4);
414 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
415 bset
= isl_basic_set_add_constraint(bset
, c
);
417 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
419 assert(bset
&& bset
->n_div
== 1);
420 isl_local_space_free(ls
);
421 isl_basic_set_free(bset
);
424 dim
= isl_space_set_alloc(ctx
, 0, 3);
425 bset
= isl_basic_set_universe(isl_space_copy(dim
));
426 ls
= isl_local_space_from_space(dim
);
428 c
= isl_equality_alloc(isl_local_space_copy(ls
));
429 isl_int_set_si(v
, 2);
430 isl_constraint_set_constant(c
, v
);
431 isl_int_set_si(v
, -1);
432 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
433 isl_int_set_si(v
, 3);
434 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
435 bset
= isl_basic_set_add_constraint(bset
, c
);
437 c
= isl_equality_alloc(isl_local_space_copy(ls
));
438 isl_int_set_si(v
, -1);
439 isl_constraint_set_constant(c
, v
);
440 isl_int_set_si(v
, 1);
441 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
442 isl_int_set_si(v
, 6);
443 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
444 bset
= isl_basic_set_add_constraint(bset
, c
);
446 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 1, 2);
448 assert(isl_basic_set_is_empty(bset
));
449 isl_local_space_free(ls
);
450 isl_basic_set_free(bset
);
453 dim
= isl_space_set_alloc(ctx
, 0, 3);
454 bset
= isl_basic_set_universe(isl_space_copy(dim
));
455 ls
= isl_local_space_from_space(dim
);
457 c
= isl_equality_alloc(isl_local_space_copy(ls
));
458 isl_int_set_si(v
, -1);
459 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
460 isl_int_set_si(v
, 3);
461 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
462 bset
= isl_basic_set_add_constraint(bset
, c
);
464 c
= isl_equality_alloc(isl_local_space_copy(ls
));
465 isl_int_set_si(v
, 1);
466 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
467 isl_int_set_si(v
, -3);
468 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
469 bset
= isl_basic_set_add_constraint(bset
, c
);
471 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
473 assert(bset
&& bset
->n_div
== 0);
474 isl_basic_set_free(bset
);
475 isl_local_space_free(ls
);
478 dim
= isl_space_set_alloc(ctx
, 0, 3);
479 bset
= isl_basic_set_universe(isl_space_copy(dim
));
480 ls
= isl_local_space_from_space(dim
);
482 c
= isl_equality_alloc(isl_local_space_copy(ls
));
483 isl_int_set_si(v
, -1);
484 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
485 isl_int_set_si(v
, 6);
486 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
487 bset
= isl_basic_set_add_constraint(bset
, c
);
489 c
= isl_equality_alloc(isl_local_space_copy(ls
));
490 isl_int_set_si(v
, 1);
491 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
492 isl_int_set_si(v
, -3);
493 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
494 bset
= isl_basic_set_add_constraint(bset
, c
);
496 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
498 assert(bset
&& bset
->n_div
== 1);
499 isl_basic_set_free(bset
);
500 isl_local_space_free(ls
);
503 /* This test is a bit tricky. We set up an equality
505 * Normalization of divs creates _two_ divs
508 * Afterwards e0 is removed again because it has coefficient -1
509 * and we end up with the original equality and div again.
510 * Perhaps we can avoid the introduction of this temporary div.
512 dim
= isl_space_set_alloc(ctx
, 0, 4);
513 bset
= isl_basic_set_universe(isl_space_copy(dim
));
514 ls
= isl_local_space_from_space(dim
);
516 c
= isl_equality_alloc(isl_local_space_copy(ls
));
517 isl_int_set_si(v
, -1);
518 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
519 isl_int_set_si(v
, -3);
520 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
521 isl_int_set_si(v
, -3);
522 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
523 isl_int_set_si(v
, 6);
524 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
525 bset
= isl_basic_set_add_constraint(bset
, c
);
527 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
529 /* Test disabled for now */
531 assert(bset && bset->n_div == 1);
533 isl_local_space_free(ls
);
534 isl_basic_set_free(bset
);
537 dim
= isl_space_set_alloc(ctx
, 0, 5);
538 bset
= isl_basic_set_universe(isl_space_copy(dim
));
539 ls
= isl_local_space_from_space(dim
);
541 c
= isl_equality_alloc(isl_local_space_copy(ls
));
542 isl_int_set_si(v
, -1);
543 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
544 isl_int_set_si(v
, -3);
545 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
546 isl_int_set_si(v
, -3);
547 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
548 isl_int_set_si(v
, 6);
549 isl_constraint_set_coefficient(c
, isl_dim_set
, 4, v
);
550 bset
= isl_basic_set_add_constraint(bset
, c
);
552 c
= isl_equality_alloc(isl_local_space_copy(ls
));
553 isl_int_set_si(v
, -1);
554 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
555 isl_int_set_si(v
, 1);
556 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
557 isl_int_set_si(v
, 1);
558 isl_constraint_set_constant(c
, v
);
559 bset
= isl_basic_set_add_constraint(bset
, c
);
561 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 4, 1);
563 /* Test disabled for now */
565 assert(bset && bset->n_div == 1);
567 isl_local_space_free(ls
);
568 isl_basic_set_free(bset
);
571 dim
= isl_space_set_alloc(ctx
, 0, 4);
572 bset
= isl_basic_set_universe(isl_space_copy(dim
));
573 ls
= isl_local_space_from_space(dim
);
575 c
= isl_equality_alloc(isl_local_space_copy(ls
));
576 isl_int_set_si(v
, 1);
577 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
578 isl_int_set_si(v
, -1);
579 isl_constraint_set_coefficient(c
, isl_dim_set
, 1, v
);
580 isl_int_set_si(v
, -2);
581 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
582 bset
= isl_basic_set_add_constraint(bset
, c
);
584 c
= isl_equality_alloc(isl_local_space_copy(ls
));
585 isl_int_set_si(v
, -1);
586 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
587 isl_int_set_si(v
, 3);
588 isl_constraint_set_coefficient(c
, isl_dim_set
, 3, v
);
589 isl_int_set_si(v
, 2);
590 isl_constraint_set_constant(c
, v
);
591 bset
= isl_basic_set_add_constraint(bset
, c
);
593 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 2);
595 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
597 assert(!isl_basic_set_is_empty(bset
));
599 isl_local_space_free(ls
);
600 isl_basic_set_free(bset
);
603 dim
= isl_space_set_alloc(ctx
, 0, 3);
604 bset
= isl_basic_set_universe(isl_space_copy(dim
));
605 ls
= isl_local_space_from_space(dim
);
607 c
= isl_equality_alloc(isl_local_space_copy(ls
));
608 isl_int_set_si(v
, 1);
609 isl_constraint_set_coefficient(c
, isl_dim_set
, 0, v
);
610 isl_int_set_si(v
, -2);
611 isl_constraint_set_coefficient(c
, isl_dim_set
, 2, v
);
612 bset
= isl_basic_set_add_constraint(bset
, c
);
614 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 2, 1);
616 bset
= isl_basic_set_fix_si(bset
, isl_dim_set
, 0, 2);
618 isl_local_space_free(ls
);
619 isl_basic_set_free(bset
);
623 str
= "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
624 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
625 set
= isl_set_read_from_str(ctx
, str
);
626 set
= isl_set_compute_divs(set
);
631 str
= "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
632 bset
= isl_basic_set_read_from_str(ctx
, str
);
633 n
= isl_basic_set_dim(bset
, isl_dim_div
);
634 isl_basic_set_free(bset
);
638 isl_die(ctx
, isl_error_unknown
,
639 "expecting no existentials", return -1);
641 str
= "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
642 set
= isl_set_read_from_str(ctx
, str
);
643 set
= isl_set_remove_divs_involving_dims(set
, isl_dim_set
, 0, 2);
644 set
= isl_set_fix_si(set
, isl_dim_set
, 2, -3);
645 empty
= isl_set_is_empty(set
);
650 isl_die(ctx
, isl_error_unknown
,
651 "result not as accurate as expected", return -1);
656 void test_application_case(struct isl_ctx
*ctx
, const char *name
)
660 struct isl_basic_set
*bset1
, *bset2
;
661 struct isl_basic_map
*bmap
;
663 filename
= get_filename(ctx
, name
, "omega");
665 input
= fopen(filename
, "r");
668 bset1
= isl_basic_set_read_from_file(ctx
, input
);
669 bmap
= isl_basic_map_read_from_file(ctx
, input
);
671 bset1
= isl_basic_set_apply(bset1
, bmap
);
673 bset2
= isl_basic_set_read_from_file(ctx
, input
);
675 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
677 isl_basic_set_free(bset1
);
678 isl_basic_set_free(bset2
);
684 void test_application(struct isl_ctx
*ctx
)
686 test_application_case(ctx
, "application");
687 test_application_case(ctx
, "application2");
690 void test_affine_hull_case(struct isl_ctx
*ctx
, const char *name
)
694 struct isl_basic_set
*bset1
, *bset2
;
696 filename
= get_filename(ctx
, name
, "polylib");
698 input
= fopen(filename
, "r");
701 bset1
= isl_basic_set_read_from_file(ctx
, input
);
702 bset2
= isl_basic_set_read_from_file(ctx
, input
);
704 bset1
= isl_basic_set_affine_hull(bset1
);
706 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
708 isl_basic_set_free(bset1
);
709 isl_basic_set_free(bset2
);
715 int test_affine_hull(struct isl_ctx
*ctx
)
722 test_affine_hull_case(ctx
, "affine2");
723 test_affine_hull_case(ctx
, "affine");
724 test_affine_hull_case(ctx
, "affine3");
726 str
= "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
727 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
728 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
729 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
730 set
= isl_set_read_from_str(ctx
, str
);
731 bset
= isl_set_affine_hull(set
);
732 n
= isl_basic_set_dim(bset
, isl_dim_div
);
733 isl_basic_set_free(bset
);
735 isl_die(ctx
, isl_error_unknown
, "not expecting any divs",
741 void test_convex_hull_case(struct isl_ctx
*ctx
, const char *name
)
745 struct isl_basic_set
*bset1
, *bset2
;
748 filename
= get_filename(ctx
, name
, "polylib");
750 input
= fopen(filename
, "r");
753 bset1
= isl_basic_set_read_from_file(ctx
, input
);
754 bset2
= isl_basic_set_read_from_file(ctx
, input
);
756 set
= isl_basic_set_union(bset1
, bset2
);
757 bset1
= isl_set_convex_hull(set
);
759 bset2
= isl_basic_set_read_from_file(ctx
, input
);
761 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
763 isl_basic_set_free(bset1
);
764 isl_basic_set_free(bset2
);
770 void test_convex_hull_algo(struct isl_ctx
*ctx
, int convex
)
772 const char *str1
, *str2
;
773 isl_set
*set1
, *set2
;
774 int orig_convex
= ctx
->opt
->convex
;
775 ctx
->opt
->convex
= convex
;
777 test_convex_hull_case(ctx
, "convex0");
778 test_convex_hull_case(ctx
, "convex1");
779 test_convex_hull_case(ctx
, "convex2");
780 test_convex_hull_case(ctx
, "convex3");
781 test_convex_hull_case(ctx
, "convex4");
782 test_convex_hull_case(ctx
, "convex5");
783 test_convex_hull_case(ctx
, "convex6");
784 test_convex_hull_case(ctx
, "convex7");
785 test_convex_hull_case(ctx
, "convex8");
786 test_convex_hull_case(ctx
, "convex9");
787 test_convex_hull_case(ctx
, "convex10");
788 test_convex_hull_case(ctx
, "convex11");
789 test_convex_hull_case(ctx
, "convex12");
790 test_convex_hull_case(ctx
, "convex13");
791 test_convex_hull_case(ctx
, "convex14");
792 test_convex_hull_case(ctx
, "convex15");
794 str1
= "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
795 "(i0 = 1 and i1 = 0 and i2 = 1) or "
796 "(i0 = 0 and i1 = 0 and i2 = 0) }";
797 str2
= "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }";
798 set1
= isl_set_read_from_str(ctx
, str1
);
799 set2
= isl_set_read_from_str(ctx
, str2
);
800 set1
= isl_set_from_basic_set(isl_set_convex_hull(set1
));
801 assert(isl_set_is_equal(set1
, set2
));
805 ctx
->opt
->convex
= orig_convex
;
808 void test_convex_hull(struct isl_ctx
*ctx
)
810 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_FM
);
811 test_convex_hull_algo(ctx
, ISL_CONVEX_HULL_WRAP
);
814 void test_gist_case(struct isl_ctx
*ctx
, const char *name
)
818 struct isl_basic_set
*bset1
, *bset2
;
820 filename
= get_filename(ctx
, name
, "polylib");
822 input
= fopen(filename
, "r");
825 bset1
= isl_basic_set_read_from_file(ctx
, input
);
826 bset2
= isl_basic_set_read_from_file(ctx
, input
);
828 bset1
= isl_basic_set_gist(bset1
, bset2
);
830 bset2
= isl_basic_set_read_from_file(ctx
, input
);
832 assert(isl_basic_set_is_equal(bset1
, bset2
) == 1);
834 isl_basic_set_free(bset1
);
835 isl_basic_set_free(bset2
);
841 void test_gist(struct isl_ctx
*ctx
)
844 isl_basic_set
*bset1
, *bset2
;
846 test_gist_case(ctx
, "gist1");
848 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : "
849 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
850 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
851 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
852 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
853 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
854 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
855 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
856 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
857 bset1
= isl_basic_set_read_from_str(ctx
, str
);
858 str
= "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
859 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
860 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
861 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
862 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
863 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
864 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
865 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
866 bset2
= isl_basic_set_read_from_str(ctx
, str
);
867 bset1
= isl_basic_set_gist(bset1
, bset2
);
868 assert(bset1
&& bset1
->n_div
== 0);
869 isl_basic_set_free(bset1
);
872 int test_coalesce_set(isl_ctx
*ctx
, const char *str
, int check_one
)
878 set
= isl_set_read_from_str(ctx
, str
);
879 set
= isl_set_coalesce(set
);
880 set2
= isl_set_read_from_str(ctx
, str
);
881 equal
= isl_set_is_equal(set
, set2
);
882 one
= set
&& set
->n
== 1;
889 isl_die(ctx
, isl_error_unknown
,
890 "coalesced set not equal to input", return -1);
891 if (check_one
&& !one
)
892 isl_die(ctx
, isl_error_unknown
,
893 "coalesced set should not be a union", return -1);
898 int test_coalesce_unbounded_wrapping(isl_ctx
*ctx
)
903 bounded
= isl_options_get_coalesce_bounded_wrapping(ctx
);
904 isl_options_set_coalesce_bounded_wrapping(ctx
, 0);
906 if (test_coalesce_set(ctx
,
907 "{[x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
908 "-x - y + 1 >= 0 and -3 <= z <= 3;"
909 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
910 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
911 "-10 <= y <= 0}", 1) < 0)
913 if (test_coalesce_set(ctx
,
914 "{[x,y] : 0 <= x,y <= 10; [5,y]: 4 <=y <= 11}", 1) < 0)
916 if (test_coalesce_set(ctx
,
917 "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1) < 0)
925 isl_options_set_coalesce_bounded_wrapping(ctx
, bounded
);
930 int test_coalesce(struct isl_ctx
*ctx
)
933 struct isl_set
*set
, *set2
;
934 struct isl_map
*map
, *map2
;
936 set
= isl_set_read_from_str(ctx
,
937 "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
938 "y >= x & x >= 2 & 5 >= y }");
939 set
= isl_set_coalesce(set
);
940 assert(set
&& set
->n
== 1);
943 set
= isl_set_read_from_str(ctx
,
944 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
945 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}");
946 set
= isl_set_coalesce(set
);
947 assert(set
&& set
->n
== 1);
950 set
= isl_set_read_from_str(ctx
,
951 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
952 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}");
953 set
= isl_set_coalesce(set
);
954 assert(set
&& set
->n
== 2);
957 set
= isl_set_read_from_str(ctx
,
958 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
959 "y >= 0 & x >= 6 & x <= 10 & y <= x}");
960 set
= isl_set_coalesce(set
);
961 assert(set
&& set
->n
== 1);
964 set
= isl_set_read_from_str(ctx
,
965 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
966 "y >= 0 & x >= 7 & x <= 10 & y <= x}");
967 set
= isl_set_coalesce(set
);
968 assert(set
&& set
->n
== 2);
971 set
= isl_set_read_from_str(ctx
,
972 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
973 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}");
974 set
= isl_set_coalesce(set
);
975 assert(set
&& set
->n
== 2);
978 set
= isl_set_read_from_str(ctx
,
979 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
980 "y >= 0 & x = 6 & y <= 6}");
981 set
= isl_set_coalesce(set
);
982 assert(set
&& set
->n
== 1);
985 set
= isl_set_read_from_str(ctx
,
986 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
987 "y >= 0 & x = 7 & y <= 6}");
988 set
= isl_set_coalesce(set
);
989 assert(set
&& set
->n
== 2);
992 set
= isl_set_read_from_str(ctx
,
993 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
994 "y >= 0 & x = 6 & y <= 5}");
995 set
= isl_set_coalesce(set
);
996 assert(set
&& set
->n
== 1);
997 set2
= isl_set_read_from_str(ctx
,
998 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
999 "y >= 0 & x = 6 & y <= 5}");
1000 assert(isl_set_is_equal(set
, set2
));
1004 set
= isl_set_read_from_str(ctx
,
1005 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1006 "y >= 0 & x = 6 & y <= 7}");
1007 set
= isl_set_coalesce(set
);
1008 assert(set
&& set
->n
== 2);
1011 set
= isl_set_read_from_str(ctx
,
1012 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
1013 set
= isl_set_coalesce(set
);
1014 assert(set
&& set
->n
== 1);
1015 set2
= isl_set_read_from_str(ctx
,
1016 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
1017 assert(isl_set_is_equal(set
, set2
));
1021 set
= isl_set_read_from_str(ctx
,
1022 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
1023 set
= isl_set_coalesce(set
);
1024 set2
= isl_set_read_from_str(ctx
,
1025 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
1026 assert(isl_set_is_equal(set
, set2
));
1030 set
= isl_set_read_from_str(ctx
,
1031 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
1032 "2 <= i and i <= n }");
1033 set
= isl_set_coalesce(set
);
1034 assert(set
&& set
->n
== 1);
1035 set2
= isl_set_read_from_str(ctx
,
1036 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
1037 "2 <= i and i <= n }");
1038 assert(isl_set_is_equal(set
, set2
));
1042 map
= isl_map_read_from_str(ctx
,
1043 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1044 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1045 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1046 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1047 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1048 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1049 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1050 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1051 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1052 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1053 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1054 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1055 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1056 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1057 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1058 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1059 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1060 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
1061 map
= isl_map_coalesce(map
);
1062 map2
= isl_map_read_from_str(ctx
,
1063 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1064 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1065 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1066 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1067 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1068 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1069 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1070 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1071 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1072 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1073 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1074 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1075 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1076 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1077 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1078 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1079 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1080 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
1081 assert(isl_map_is_equal(map
, map2
));
1085 str
= "[n, m] -> { [] -> [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1086 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1087 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1088 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }";
1089 map
= isl_map_read_from_str(ctx
, str
);
1090 map
= isl_map_coalesce(map
);
1091 map2
= isl_map_read_from_str(ctx
, str
);
1092 assert(isl_map_is_equal(map
, map2
));
1096 str
= "[M, N] -> { [i0, i1, i2, i3, i4, i5, i6] -> "
1097 "[o0, o1, o2, o3, o4, o5, o6] : "
1098 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1099 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1100 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1101 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1102 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1103 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1104 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1105 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1106 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1107 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1108 "o6 >= i3 + i6 - o3 and M >= 0 and "
1109 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1110 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }";
1111 map
= isl_map_read_from_str(ctx
, str
);
1112 map
= isl_map_coalesce(map
);
1113 map2
= isl_map_read_from_str(ctx
, str
);
1114 assert(isl_map_is_equal(map
, map2
));
1118 str
= "[M, N] -> { [] -> [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1119 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1120 "(o0 = 0 and M >= 2 and N >= 3) or "
1121 "(M = 0 and o0 = 0 and N >= 3) }";
1122 map
= isl_map_read_from_str(ctx
, str
);
1123 map
= isl_map_coalesce(map
);
1124 map2
= isl_map_read_from_str(ctx
, str
);
1125 assert(isl_map_is_equal(map
, map2
));
1129 str
= "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1130 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1131 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1132 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }";
1133 map
= isl_map_read_from_str(ctx
, str
);
1134 map
= isl_map_coalesce(map
);
1135 map2
= isl_map_read_from_str(ctx
, str
);
1136 assert(isl_map_is_equal(map
, map2
));
1140 test_coalesce_set(ctx
,
1141 "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or "
1142 "(i1 = M and M >= 1) }", 0);
1143 test_coalesce_set(ctx
,
1144 "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }", 0);
1145 test_coalesce_set(ctx
,
1146 "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1147 "(y = 3 and x = 1) }", 1);
1148 test_coalesce_set(ctx
,
1149 "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1150 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1151 "i1 <= M and i3 <= M and i4 <= M) or "
1152 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1153 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1154 "i4 <= -1 + M) }", 1);
1155 test_coalesce_set(ctx
,
1156 "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1157 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }", 1);
1158 if (test_coalesce_unbounded_wrapping(ctx
) < 0)
1160 if (test_coalesce_set(ctx
, "{[x,0] : x >= 0; [x,1] : x <= 20}", 0) < 0)
1162 if (test_coalesce_set(ctx
, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }", 1) < 0)
1164 if (test_coalesce_set(ctx
, "{ [0,0]; [i,i] : 1 <= i <= 10 }", 1) < 0)
1166 if (test_coalesce_set(ctx
, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }", 0) < 0)
1168 if (test_coalesce_set(ctx
, "{ [0,0]; [i,2i] : 1 <= i <= 10 }", 1) < 0)
1170 if (test_coalesce_set(ctx
, "{ [0,0]; [i,2i] : 2 <= i <= 10 }", 0) < 0)
1172 if (test_coalesce_set(ctx
, "{ [1,0]; [i,2i] : 1 <= i <= 10 }", 0) < 0)
1174 if (test_coalesce_set(ctx
, "{ [0,1]; [i,2i] : 1 <= i <= 10 }", 0) < 0)
1176 if (test_coalesce_set(ctx
, "{ [a, b] : exists e : 2e = a and "
1177 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }", 0) < 0)
1179 if (test_coalesce_set(ctx
,
1180 "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1181 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1182 "j >= 1 and j' <= i + j - i' and i >= 1; "
1183 "[1, 1, 1, 1] }", 0) < 0)
1185 if (test_coalesce_set(ctx
, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1186 "[i,j] : exists a : j = 3a }", 1) < 0)
1188 if (test_coalesce_set(ctx
,
1189 "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1190 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1192 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1193 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }", 1) < 0)
1195 if (test_coalesce_set(ctx
,
1196 "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1197 "c <= 6 + 8a and a >= 3; "
1198 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1199 "c <= 7 + 8a and a >= 3 and a <= 4 }", 1) < 0)
1204 void test_closure(struct isl_ctx
*ctx
)
1208 isl_map
*up
, *right
;
1209 isl_map
*map
, *map2
;
1212 /* COCOA example 1 */
1213 map
= isl_map_read_from_str(ctx
,
1214 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1215 "1 <= i and i < n and 1 <= j and j < n or "
1216 "i2 = i + 1 and j2 = j - 1 and "
1217 "1 <= i and i < n and 2 <= j and j <= n }");
1218 map
= isl_map_power(map
, &exact
);
1222 /* COCOA example 1 */
1223 map
= isl_map_read_from_str(ctx
,
1224 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1225 "1 <= i and i < n and 1 <= j and j < n or "
1226 "i2 = i + 1 and j2 = j - 1 and "
1227 "1 <= i and i < n and 2 <= j and j <= n }");
1228 map
= isl_map_transitive_closure(map
, &exact
);
1230 map2
= isl_map_read_from_str(ctx
,
1231 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1232 "1 <= i and i < n and 1 <= j and j <= n and "
1233 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1234 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1235 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1236 assert(isl_map_is_equal(map
, map2
));
1240 map
= isl_map_read_from_str(ctx
,
1241 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1242 " 0 <= y and y <= n }");
1243 map
= isl_map_transitive_closure(map
, &exact
);
1244 map2
= isl_map_read_from_str(ctx
,
1245 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1246 " 0 <= y and y <= n }");
1247 assert(isl_map_is_equal(map
, map2
));
1251 /* COCOA example 2 */
1252 map
= isl_map_read_from_str(ctx
,
1253 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1254 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1255 "i2 = i + 2 and j2 = j - 2 and "
1256 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1257 map
= isl_map_transitive_closure(map
, &exact
);
1259 map2
= isl_map_read_from_str(ctx
,
1260 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1261 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1262 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1263 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1264 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1265 assert(isl_map_is_equal(map
, map2
));
1269 /* COCOA Fig.2 left */
1270 map
= isl_map_read_from_str(ctx
,
1271 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1272 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1274 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1275 "j <= 2 i - 3 and j <= n - 2 or "
1276 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1277 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1278 map
= isl_map_transitive_closure(map
, &exact
);
1282 /* COCOA Fig.2 right */
1283 map
= isl_map_read_from_str(ctx
,
1284 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1285 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1287 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1288 "j <= 2 i - 4 and j <= n - 3 or "
1289 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1290 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1291 map
= isl_map_power(map
, &exact
);
1295 /* COCOA Fig.2 right */
1296 map
= isl_map_read_from_str(ctx
,
1297 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1298 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1300 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1301 "j <= 2 i - 4 and j <= n - 3 or "
1302 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1303 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1304 map
= isl_map_transitive_closure(map
, &exact
);
1306 map2
= isl_map_read_from_str(ctx
,
1307 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1308 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1309 "j <= n and 3 + i + 2 j <= 3 n and "
1310 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1311 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1312 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1313 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1314 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1315 assert(isl_map_is_equal(map
, map2
));
1319 /* COCOA Fig.1 right */
1320 dom
= isl_set_read_from_str(ctx
,
1321 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1322 "2 x - 3 y + 3 >= 0 }");
1323 right
= isl_map_read_from_str(ctx
,
1324 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1325 up
= isl_map_read_from_str(ctx
,
1326 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1327 right
= isl_map_intersect_domain(right
, isl_set_copy(dom
));
1328 right
= isl_map_intersect_range(right
, isl_set_copy(dom
));
1329 up
= isl_map_intersect_domain(up
, isl_set_copy(dom
));
1330 up
= isl_map_intersect_range(up
, dom
);
1331 map
= isl_map_union(up
, right
);
1332 map
= isl_map_transitive_closure(map
, &exact
);
1334 map2
= isl_map_read_from_str(ctx
,
1335 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1336 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1337 assert(isl_map_is_equal(map
, map2
));
1341 /* COCOA Theorem 1 counter example */
1342 map
= isl_map_read_from_str(ctx
,
1343 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1344 "i2 = 1 and j2 = j or "
1345 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1346 map
= isl_map_transitive_closure(map
, &exact
);
1350 map
= isl_map_read_from_str(ctx
,
1351 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1352 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1353 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1354 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1355 map
= isl_map_transitive_closure(map
, &exact
);
1359 /* Kelly et al 1996, fig 12 */
1360 map
= isl_map_read_from_str(ctx
,
1361 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1362 "1 <= i,j,j+1 <= n or "
1363 "j = n and j2 = 1 and i2 = i + 1 and "
1364 "1 <= i,i+1 <= n }");
1365 map
= isl_map_transitive_closure(map
, &exact
);
1367 map2
= isl_map_read_from_str(ctx
,
1368 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1369 "1 <= i <= n and i = i2 or "
1370 "1 <= i < i2 <= n and 1 <= j <= n and "
1372 assert(isl_map_is_equal(map
, map2
));
1376 /* Omega's closure4 */
1377 map
= isl_map_read_from_str(ctx
,
1378 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1379 "1 <= x,y <= 10 or "
1380 "x2 = x + 1 and y2 = y and "
1381 "1 <= x <= 20 && 5 <= y <= 15 }");
1382 map
= isl_map_transitive_closure(map
, &exact
);
1386 map
= isl_map_read_from_str(ctx
,
1387 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1388 map
= isl_map_transitive_closure(map
, &exact
);
1390 map2
= isl_map_read_from_str(ctx
,
1391 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1392 assert(isl_map_is_equal(map
, map2
));
1396 str
= "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1397 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1398 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1399 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1400 map
= isl_map_read_from_str(ctx
, str
);
1401 map
= isl_map_transitive_closure(map
, &exact
);
1403 map2
= isl_map_read_from_str(ctx
, str
);
1404 assert(isl_map_is_equal(map
, map2
));
1408 str
= "{[0] -> [1]; [2] -> [3]}";
1409 map
= isl_map_read_from_str(ctx
, str
);
1410 map
= isl_map_transitive_closure(map
, &exact
);
1412 map2
= isl_map_read_from_str(ctx
, str
);
1413 assert(isl_map_is_equal(map
, map2
));
1417 str
= "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1418 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1419 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1420 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1421 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1422 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1423 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1424 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1425 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1426 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1427 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1428 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1429 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1430 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1431 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1432 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1433 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1434 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1435 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1436 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1437 map
= isl_map_read_from_str(ctx
, str
);
1438 map
= isl_map_transitive_closure(map
, NULL
);
1443 void test_lex(struct isl_ctx
*ctx
)
1448 dim
= isl_space_set_alloc(ctx
, 0, 0);
1449 map
= isl_map_lex_le(dim
);
1450 assert(!isl_map_is_empty(map
));
1454 void test_lexmin(struct isl_ctx
*ctx
)
1457 isl_basic_map
*bmap
;
1458 isl_map
*map
, *map2
;
1461 isl_pw_multi_aff
*pma
;
1463 str
= "[p0, p1] -> { [] -> [] : "
1464 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1465 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1466 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1467 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1468 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1469 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1470 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1471 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1472 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1473 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1474 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1475 map
= isl_map_read_from_str(ctx
, str
);
1476 map
= isl_map_lexmin(map
);
1479 str
= "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1480 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1481 set
= isl_set_read_from_str(ctx
, str
);
1482 set
= isl_set_lexmax(set
);
1483 str
= "[C] -> { [obj,a,b,c] : C = 8 }";
1484 set2
= isl_set_read_from_str(ctx
, str
);
1485 set
= isl_set_intersect(set
, set2
);
1486 assert(!isl_set_is_empty(set
));
1489 str
= "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1490 map
= isl_map_read_from_str(ctx
, str
);
1491 map
= isl_map_lexmin(map
);
1492 str
= "{ [x] -> [5] : 6 <= x <= 8; "
1493 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1494 map2
= isl_map_read_from_str(ctx
, str
);
1495 assert(isl_map_is_equal(map
, map2
));
1499 str
= "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1500 map
= isl_map_read_from_str(ctx
, str
);
1501 map2
= isl_map_copy(map
);
1502 map
= isl_map_lexmin(map
);
1503 assert(isl_map_is_equal(map
, map2
));
1507 str
= "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1508 map
= isl_map_read_from_str(ctx
, str
);
1509 map
= isl_map_lexmin(map
);
1510 str
= "{ [x] -> [y] : (4y = x and x >= 0) or "
1511 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1512 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1513 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1514 map2
= isl_map_read_from_str(ctx
, str
);
1515 assert(isl_map_is_equal(map
, map2
));
1519 str
= "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1520 " 8i' <= i and 8i' >= -7 + i }";
1521 bmap
= isl_basic_map_read_from_str(ctx
, str
);
1522 pma
= isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap
));
1523 map2
= isl_map_from_pw_multi_aff(pma
);
1524 map
= isl_map_from_basic_map(bmap
);
1525 assert(isl_map_is_equal(map
, map2
));
1529 str
= "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
1530 map
= isl_map_read_from_str(ctx
, str
);
1531 map
= isl_map_lexmin(map
);
1532 str
= "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
1533 map2
= isl_map_read_from_str(ctx
, str
);
1534 assert(isl_map_is_equal(map
, map2
));
1538 /* Check that empty pieces are properly combined. */
1539 str
= "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
1540 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
1541 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }";
1542 map
= isl_map_read_from_str(ctx
, str
);
1543 map
= isl_map_lexmin(map
);
1544 str
= "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
1545 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
1547 map2
= isl_map_read_from_str(ctx
, str
);
1548 assert(isl_map_is_equal(map
, map2
));
1558 static int collect_must_may(__isl_take isl_map
*dep
, int must
,
1559 void *dep_user
, void *user
)
1561 struct must_may
*mm
= (struct must_may
*)user
;
1564 mm
->must
= isl_map_union(mm
->must
, dep
);
1566 mm
->may
= isl_map_union(mm
->may
, dep
);
1571 static int common_space(void *first
, void *second
)
1573 int depth
= *(int *)first
;
1577 static int map_is_equal(__isl_keep isl_map
*map
, const char *str
)
1585 map2
= isl_map_read_from_str(map
->ctx
, str
);
1586 equal
= isl_map_is_equal(map
, map2
);
1592 static int map_check_equal(__isl_keep isl_map
*map
, const char *str
)
1596 equal
= map_is_equal(map
, str
);
1600 isl_die(isl_map_get_ctx(map
), isl_error_unknown
,
1601 "result not as expected", return -1);
1605 void test_dep(struct isl_ctx
*ctx
)
1610 isl_access_info
*ai
;
1617 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1618 map
= isl_map_read_from_str(ctx
, str
);
1619 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1621 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1622 map
= isl_map_read_from_str(ctx
, str
);
1623 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1625 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1626 map
= isl_map_read_from_str(ctx
, str
);
1627 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1629 flow
= isl_access_info_compute_flow(ai
);
1630 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1631 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1632 mm
.may
= isl_map_empty(dim
);
1634 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1636 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
1637 " [1,10,0] -> [2,5,0] }";
1638 assert(map_is_equal(mm
.must
, str
));
1639 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1640 assert(map_is_equal(mm
.may
, str
));
1642 isl_map_free(mm
.must
);
1643 isl_map_free(mm
.may
);
1644 isl_flow_free(flow
);
1647 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1648 map
= isl_map_read_from_str(ctx
, str
);
1649 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1651 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1652 map
= isl_map_read_from_str(ctx
, str
);
1653 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1655 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1656 map
= isl_map_read_from_str(ctx
, str
);
1657 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1659 flow
= isl_access_info_compute_flow(ai
);
1660 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1661 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1662 mm
.may
= isl_map_empty(dim
);
1664 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1666 str
= "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
1667 assert(map_is_equal(mm
.must
, str
));
1668 str
= "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1669 assert(map_is_equal(mm
.may
, str
));
1671 isl_map_free(mm
.must
);
1672 isl_map_free(mm
.may
);
1673 isl_flow_free(flow
);
1676 str
= "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1677 map
= isl_map_read_from_str(ctx
, str
);
1678 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1680 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1681 map
= isl_map_read_from_str(ctx
, str
);
1682 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1684 str
= "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1685 map
= isl_map_read_from_str(ctx
, str
);
1686 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1688 flow
= isl_access_info_compute_flow(ai
);
1689 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1690 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1691 mm
.may
= isl_map_empty(dim
);
1693 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1695 str
= "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
1696 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1697 assert(map_is_equal(mm
.may
, str
));
1698 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1699 assert(map_is_equal(mm
.must
, str
));
1701 isl_map_free(mm
.must
);
1702 isl_map_free(mm
.may
);
1703 isl_flow_free(flow
);
1706 str
= "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
1707 map
= isl_map_read_from_str(ctx
, str
);
1708 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1710 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1711 map
= isl_map_read_from_str(ctx
, str
);
1712 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1714 str
= "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
1715 map
= isl_map_read_from_str(ctx
, str
);
1716 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1718 flow
= isl_access_info_compute_flow(ai
);
1719 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1720 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1721 mm
.may
= isl_map_empty(dim
);
1723 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1725 str
= "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
1726 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
1727 assert(map_is_equal(mm
.may
, str
));
1728 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1729 assert(map_is_equal(mm
.must
, str
));
1731 isl_map_free(mm
.must
);
1732 isl_map_free(mm
.may
);
1733 isl_flow_free(flow
);
1736 str
= "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
1737 map
= isl_map_read_from_str(ctx
, str
);
1738 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 2);
1740 str
= "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1741 map
= isl_map_read_from_str(ctx
, str
);
1742 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1744 str
= "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
1745 map
= isl_map_read_from_str(ctx
, str
);
1746 ai
= isl_access_info_add_source(ai
, map
, 0, &depth
);
1748 flow
= isl_access_info_compute_flow(ai
);
1749 dim
= isl_space_alloc(ctx
, 0, 3, 3);
1750 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1751 mm
.may
= isl_map_empty(dim
);
1753 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1755 str
= "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
1756 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
1757 assert(map_is_equal(mm
.may
, str
));
1758 str
= "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1759 assert(map_is_equal(mm
.must
, str
));
1761 isl_map_free(mm
.must
);
1762 isl_map_free(mm
.may
);
1763 isl_flow_free(flow
);
1768 str
= "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1769 map
= isl_map_read_from_str(ctx
, str
);
1770 ai
= isl_access_info_alloc(map
, &depth
, &common_space
, 1);
1772 str
= "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1773 map
= isl_map_read_from_str(ctx
, str
);
1774 ai
= isl_access_info_add_source(ai
, map
, 1, &depth
);
1776 flow
= isl_access_info_compute_flow(ai
);
1777 dim
= isl_space_alloc(ctx
, 0, 5, 5);
1778 mm
.must
= isl_map_empty(isl_space_copy(dim
));
1779 mm
.may
= isl_map_empty(dim
);
1781 isl_flow_foreach(flow
, collect_must_may
, &mm
);
1783 str
= "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
1784 assert(map_is_equal(mm
.must
, str
));
1785 str
= "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
1786 assert(map_is_equal(mm
.may
, str
));
1788 isl_map_free(mm
.must
);
1789 isl_map_free(mm
.may
);
1790 isl_flow_free(flow
);
1793 int test_sv(isl_ctx
*ctx
)
1797 isl_union_map
*umap
;
1800 str
= "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }";
1801 map
= isl_map_read_from_str(ctx
, str
);
1802 sv
= isl_map_is_single_valued(map
);
1807 isl_die(ctx
, isl_error_internal
,
1808 "map not detected as single valued", return -1);
1810 str
= "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }";
1811 map
= isl_map_read_from_str(ctx
, str
);
1812 sv
= isl_map_is_single_valued(map
);
1817 isl_die(ctx
, isl_error_internal
,
1818 "map detected as single valued", return -1);
1820 str
= "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }";
1821 umap
= isl_union_map_read_from_str(ctx
, str
);
1822 sv
= isl_union_map_is_single_valued(umap
);
1823 isl_union_map_free(umap
);
1827 isl_die(ctx
, isl_error_internal
,
1828 "map not detected as single valued", return -1);
1830 str
= "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }";
1831 umap
= isl_union_map_read_from_str(ctx
, str
);
1832 sv
= isl_union_map_is_single_valued(umap
);
1833 isl_union_map_free(umap
);
1837 isl_die(ctx
, isl_error_internal
,
1838 "map detected as single valued", return -1);
1843 void test_bijective_case(struct isl_ctx
*ctx
, const char *str
, int bijective
)
1847 map
= isl_map_read_from_str(ctx
, str
);
1849 assert(isl_map_is_bijective(map
));
1851 assert(!isl_map_is_bijective(map
));
1855 void test_bijective(struct isl_ctx
*ctx
)
1857 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i]}", 0);
1858 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=i}", 1);
1859 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=0}", 1);
1860 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i] : j=N}", 1);
1861 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [j,i]}", 1);
1862 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i+j]}", 0);
1863 test_bijective_case(ctx
, "[N,M]->{[i,j] -> []}", 0);
1864 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,j,N]}", 1);
1865 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i]}", 0);
1866 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [i,i]}", 0);
1867 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,i]}", 0);
1868 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [2i,j]}", 1);
1869 test_bijective_case(ctx
, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1);
1872 void test_pwqp(struct isl_ctx
*ctx
)
1876 isl_pw_qpolynomial
*pwqp1
, *pwqp2
;
1878 str
= "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1879 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1881 pwqp1
= isl_pw_qpolynomial_move_dims(pwqp1
, isl_dim_param
, 0,
1884 str
= "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1885 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1887 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1889 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1891 isl_pw_qpolynomial_free(pwqp1
);
1893 str
= "{ [i] -> i }";
1894 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1895 str
= "{ [k] : exists a : k = 2a }";
1896 set
= isl_set_read_from_str(ctx
, str
);
1897 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1898 str
= "{ [i] -> i }";
1899 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1901 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1903 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1905 isl_pw_qpolynomial_free(pwqp1
);
1907 str
= "{ [i] -> i + [ (i + [i/3])/2 ] }";
1908 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1910 set
= isl_set_read_from_str(ctx
, str
);
1911 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1912 str
= "{ [i] -> 16 }";
1913 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1915 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1917 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1919 isl_pw_qpolynomial_free(pwqp1
);
1921 str
= "{ [i] -> ([(i)/2]) }";
1922 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1923 str
= "{ [k] : exists a : k = 2a+1 }";
1924 set
= isl_set_read_from_str(ctx
, str
);
1925 pwqp1
= isl_pw_qpolynomial_gist(pwqp1
, set
);
1926 str
= "{ [i] -> -1/2 + 1/2 * i }";
1927 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1929 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1931 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1933 isl_pw_qpolynomial_free(pwqp1
);
1935 str
= "{ [i] -> ([([i/2] + [i/2])/5]) }";
1936 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1937 str
= "{ [i] -> ([(2 * [i/2])/5]) }";
1938 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1940 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1942 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1944 isl_pw_qpolynomial_free(pwqp1
);
1946 str
= "{ [x] -> ([x/2] + [(x+1)/2]) }";
1947 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1948 str
= "{ [x] -> x }";
1949 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1951 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1953 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1955 isl_pw_qpolynomial_free(pwqp1
);
1957 str
= "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
1958 pwqp1
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1959 pwqp2
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1960 pwqp1
= isl_pw_qpolynomial_coalesce(pwqp1
);
1961 pwqp1
= isl_pw_qpolynomial_sub(pwqp1
, pwqp2
);
1962 assert(isl_pw_qpolynomial_is_zero(pwqp1
));
1963 isl_pw_qpolynomial_free(pwqp1
);
1966 void test_split_periods(isl_ctx
*ctx
)
1969 isl_pw_qpolynomial
*pwqp
;
1971 str
= "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
1972 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
1973 "U >= 0; [U,V] -> U^2 : U >= 100 }";
1974 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
1976 pwqp
= isl_pw_qpolynomial_split_periods(pwqp
, 2);
1979 isl_pw_qpolynomial_free(pwqp
);
1982 void test_union(isl_ctx
*ctx
)
1985 isl_union_set
*uset1
, *uset2
;
1986 isl_union_map
*umap1
, *umap2
;
1988 str
= "{ [i] : 0 <= i <= 1 }";
1989 uset1
= isl_union_set_read_from_str(ctx
, str
);
1990 str
= "{ [1] -> [0] }";
1991 umap1
= isl_union_map_read_from_str(ctx
, str
);
1993 umap2
= isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1
), uset1
);
1994 assert(isl_union_map_is_equal(umap1
, umap2
));
1996 isl_union_map_free(umap1
);
1997 isl_union_map_free(umap2
);
1999 str
= "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
2000 umap1
= isl_union_map_read_from_str(ctx
, str
);
2001 str
= "{ A[i]; B[i] }";
2002 uset1
= isl_union_set_read_from_str(ctx
, str
);
2004 uset2
= isl_union_map_domain(umap1
);
2006 assert(isl_union_set_is_equal(uset1
, uset2
));
2008 isl_union_set_free(uset1
);
2009 isl_union_set_free(uset2
);
2012 void test_bound(isl_ctx
*ctx
)
2015 isl_pw_qpolynomial
*pwqp
;
2016 isl_pw_qpolynomial_fold
*pwf
;
2018 str
= "{ [[a, b, c, d] -> [e]] -> 0 }";
2019 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2020 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2021 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 4);
2022 isl_pw_qpolynomial_fold_free(pwf
);
2024 str
= "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
2025 pwqp
= isl_pw_qpolynomial_read_from_str(ctx
, str
);
2026 pwf
= isl_pw_qpolynomial_bound(pwqp
, isl_fold_max
, NULL
);
2027 assert(isl_pw_qpolynomial_fold_dim(pwf
, isl_dim_in
) == 1);
2028 isl_pw_qpolynomial_fold_free(pwf
);
2031 void test_lift(isl_ctx
*ctx
)
2034 isl_basic_map
*bmap
;
2035 isl_basic_set
*bset
;
2037 str
= "{ [i0] : exists e0 : i0 = 4e0 }";
2038 bset
= isl_basic_set_read_from_str(ctx
, str
);
2039 bset
= isl_basic_set_lift(bset
);
2040 bmap
= isl_basic_map_from_range(bset
);
2041 bset
= isl_basic_map_domain(bmap
);
2042 isl_basic_set_free(bset
);
2049 } subset_tests
[] = {
2051 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
2052 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
2053 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
2055 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
2056 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
2057 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
2058 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
2059 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
2060 "256e0 <= 255i and 256e0 >= -255 + 255i and "
2061 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
2062 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
2063 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
2064 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
2065 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
2066 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
2067 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
2070 static int test_subset(isl_ctx
*ctx
)
2073 isl_set
*set1
, *set2
;
2076 for (i
= 0; i
< ARRAY_SIZE(subset_tests
); ++i
) {
2077 set1
= isl_set_read_from_str(ctx
, subset_tests
[i
].set1
);
2078 set2
= isl_set_read_from_str(ctx
, subset_tests
[i
].set2
);
2079 subset
= isl_set_is_subset(set1
, set2
);
2084 if (subset
!= subset_tests
[i
].subset
)
2085 isl_die(ctx
, isl_error_unknown
,
2086 "incorrect subset result", return -1);
2093 const char *minuend
;
2094 const char *subtrahend
;
2095 const char *difference
;
2096 } subtract_domain_tests
[] = {
2097 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
2098 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
2099 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
2102 static int test_subtract(isl_ctx
*ctx
)
2105 isl_union_map
*umap1
, *umap2
;
2106 isl_union_set
*uset
;
2109 for (i
= 0; i
< ARRAY_SIZE(subtract_domain_tests
); ++i
) {
2110 umap1
= isl_union_map_read_from_str(ctx
,
2111 subtract_domain_tests
[i
].minuend
);
2112 uset
= isl_union_set_read_from_str(ctx
,
2113 subtract_domain_tests
[i
].subtrahend
);
2114 umap2
= isl_union_map_read_from_str(ctx
,
2115 subtract_domain_tests
[i
].difference
);
2116 umap1
= isl_union_map_subtract_domain(umap1
, uset
);
2117 equal
= isl_union_map_is_equal(umap1
, umap2
);
2118 isl_union_map_free(umap1
);
2119 isl_union_map_free(umap2
);
2123 isl_die(ctx
, isl_error_unknown
,
2124 "incorrect subtract domain result", return -1);
2130 int test_factorize(isl_ctx
*ctx
)
2133 isl_basic_set
*bset
;
2136 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
2137 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
2138 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
2139 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
2140 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
2141 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
2142 "3i5 >= -2i0 - i2 + 3i4 }";
2143 bset
= isl_basic_set_read_from_str(ctx
, str
);
2144 f
= isl_basic_set_factorizer(bset
);
2145 isl_basic_set_free(bset
);
2146 isl_factorizer_free(f
);
2148 isl_die(ctx
, isl_error_unknown
,
2149 "failed to construct factorizer", return -1);
2151 str
= "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2152 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
2153 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
2154 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
2155 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
2156 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
2157 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
2158 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
2159 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
2160 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
2161 bset
= isl_basic_set_read_from_str(ctx
, str
);
2162 f
= isl_basic_set_factorizer(bset
);
2163 isl_basic_set_free(bset
);
2164 isl_factorizer_free(f
);
2166 isl_die(ctx
, isl_error_unknown
,
2167 "failed to construct factorizer", return -1);
2172 static int check_injective(__isl_take isl_map
*map
, void *user
)
2174 int *injective
= user
;
2176 *injective
= isl_map_is_injective(map
);
2179 if (*injective
< 0 || !*injective
)
2185 int test_one_schedule(isl_ctx
*ctx
, const char *d
, const char *w
,
2186 const char *r
, const char *s
, int tilable
, int parallel
)
2190 isl_union_map
*W
, *R
, *S
;
2191 isl_union_map
*empty
;
2192 isl_union_map
*dep_raw
, *dep_war
, *dep_waw
, *dep
;
2193 isl_union_map
*validity
, *proximity
;
2194 isl_union_map
*schedule
;
2195 isl_union_map
*test
;
2196 isl_union_set
*delta
;
2197 isl_union_set
*domain
;
2201 isl_schedule
*sched
;
2202 int is_nonneg
, is_parallel
, is_tilable
, is_injection
, is_complete
;
2204 D
= isl_union_set_read_from_str(ctx
, d
);
2205 W
= isl_union_map_read_from_str(ctx
, w
);
2206 R
= isl_union_map_read_from_str(ctx
, r
);
2207 S
= isl_union_map_read_from_str(ctx
, s
);
2209 W
= isl_union_map_intersect_domain(W
, isl_union_set_copy(D
));
2210 R
= isl_union_map_intersect_domain(R
, isl_union_set_copy(D
));
2212 empty
= isl_union_map_empty(isl_union_map_get_space(S
));
2213 isl_union_map_compute_flow(isl_union_map_copy(R
),
2214 isl_union_map_copy(W
), empty
,
2215 isl_union_map_copy(S
),
2216 &dep_raw
, NULL
, NULL
, NULL
);
2217 isl_union_map_compute_flow(isl_union_map_copy(W
),
2218 isl_union_map_copy(W
),
2219 isl_union_map_copy(R
),
2220 isl_union_map_copy(S
),
2221 &dep_waw
, &dep_war
, NULL
, NULL
);
2223 dep
= isl_union_map_union(dep_waw
, dep_war
);
2224 dep
= isl_union_map_union(dep
, dep_raw
);
2225 validity
= isl_union_map_copy(dep
);
2226 proximity
= isl_union_map_copy(dep
);
2228 sched
= isl_union_set_compute_schedule(isl_union_set_copy(D
),
2229 validity
, proximity
);
2230 schedule
= isl_schedule_get_map(sched
);
2231 isl_schedule_free(sched
);
2232 isl_union_map_free(W
);
2233 isl_union_map_free(R
);
2234 isl_union_map_free(S
);
2237 isl_union_map_foreach_map(schedule
, &check_injective
, &is_injection
);
2239 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
2240 is_complete
= isl_union_set_is_subset(D
, domain
);
2241 isl_union_set_free(D
);
2242 isl_union_set_free(domain
);
2244 test
= isl_union_map_reverse(isl_union_map_copy(schedule
));
2245 test
= isl_union_map_apply_range(test
, dep
);
2246 test
= isl_union_map_apply_range(test
, schedule
);
2248 delta
= isl_union_map_deltas(test
);
2249 if (isl_union_set_n_set(delta
) == 0) {
2253 isl_union_set_free(delta
);
2255 delta_set
= isl_set_from_union_set(delta
);
2257 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2258 for (i
= 0; i
< tilable
; ++i
)
2259 slice
= isl_set_lower_bound_si(slice
, isl_dim_set
, i
, 0);
2260 is_tilable
= isl_set_is_subset(delta_set
, slice
);
2261 isl_set_free(slice
);
2263 slice
= isl_set_universe(isl_set_get_space(delta_set
));
2264 for (i
= 0; i
< parallel
; ++i
)
2265 slice
= isl_set_fix_si(slice
, isl_dim_set
, i
, 0);
2266 is_parallel
= isl_set_is_subset(delta_set
, slice
);
2267 isl_set_free(slice
);
2269 origin
= isl_set_universe(isl_set_get_space(delta_set
));
2270 for (i
= 0; i
< isl_set_dim(origin
, isl_dim_set
); ++i
)
2271 origin
= isl_set_fix_si(origin
, isl_dim_set
, i
, 0);
2273 delta_set
= isl_set_union(delta_set
, isl_set_copy(origin
));
2274 delta_set
= isl_set_lexmin(delta_set
);
2276 is_nonneg
= isl_set_is_equal(delta_set
, origin
);
2278 isl_set_free(origin
);
2279 isl_set_free(delta_set
);
2282 if (is_nonneg
< 0 || is_parallel
< 0 || is_tilable
< 0 ||
2283 is_injection
< 0 || is_complete
< 0)
2286 isl_die(ctx
, isl_error_unknown
,
2287 "generated schedule incomplete", return -1);
2289 isl_die(ctx
, isl_error_unknown
,
2290 "generated schedule not injective on each statement",
2293 isl_die(ctx
, isl_error_unknown
,
2294 "negative dependences in generated schedule",
2297 isl_die(ctx
, isl_error_unknown
,
2298 "generated schedule not as tilable as expected",
2301 isl_die(ctx
, isl_error_unknown
,
2302 "generated schedule not as parallel as expected",
2308 static __isl_give isl_union_map
*compute_schedule(isl_ctx
*ctx
,
2309 const char *domain
, const char *validity
, const char *proximity
)
2313 isl_union_map
*prox
;
2314 isl_schedule
*schedule
;
2315 isl_union_map
*sched
;
2317 dom
= isl_union_set_read_from_str(ctx
, domain
);
2318 dep
= isl_union_map_read_from_str(ctx
, validity
);
2319 prox
= isl_union_map_read_from_str(ctx
, proximity
);
2320 schedule
= isl_union_set_compute_schedule(dom
, dep
, prox
);
2321 sched
= isl_schedule_get_map(schedule
);
2322 isl_schedule_free(schedule
);
2327 /* Check that a schedule can be constructed on the given domain
2328 * with the given validity and proximity constraints.
2330 static int test_has_schedule(isl_ctx
*ctx
, const char *domain
,
2331 const char *validity
, const char *proximity
)
2333 isl_union_map
*sched
;
2335 sched
= compute_schedule(ctx
, domain
, validity
, proximity
);
2339 isl_union_map_free(sched
);
2343 int test_special_schedule(isl_ctx
*ctx
, const char *domain
,
2344 const char *validity
, const char *proximity
, const char *expected_sched
)
2346 isl_union_map
*sched1
, *sched2
;
2349 sched1
= compute_schedule(ctx
, domain
, validity
, proximity
);
2350 sched2
= isl_union_map_read_from_str(ctx
, expected_sched
);
2352 equal
= isl_union_map_is_equal(sched1
, sched2
);
2353 isl_union_map_free(sched1
);
2354 isl_union_map_free(sched2
);
2359 isl_die(ctx
, isl_error_unknown
, "unexpected schedule",
2365 /* Check that the schedule map is properly padded, even after being
2366 * reconstructed from the band forest.
2368 static int test_padded_schedule(isl_ctx
*ctx
)
2372 isl_union_map
*validity
, *proximity
;
2373 isl_schedule
*sched
;
2374 isl_union_map
*map1
, *map2
;
2375 isl_band_list
*list
;
2378 str
= "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
2379 D
= isl_union_set_read_from_str(ctx
, str
);
2380 validity
= isl_union_map_empty(isl_union_set_get_space(D
));
2381 proximity
= isl_union_map_copy(validity
);
2382 sched
= isl_union_set_compute_schedule(D
, validity
, proximity
);
2383 map1
= isl_schedule_get_map(sched
);
2384 list
= isl_schedule_get_band_forest(sched
);
2385 isl_band_list_free(list
);
2386 map2
= isl_schedule_get_map(sched
);
2387 isl_schedule_free(sched
);
2388 equal
= isl_union_map_is_equal(map1
, map2
);
2389 isl_union_map_free(map1
);
2390 isl_union_map_free(map2
);
2395 isl_die(ctx
, isl_error_unknown
,
2396 "reconstructed schedule map not the same as original",
2402 int test_schedule(isl_ctx
*ctx
)
2404 const char *D
, *W
, *R
, *V
, *P
, *S
;
2406 /* Handle resulting schedule with zero bands. */
2407 if (test_one_schedule(ctx
, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
2411 D
= "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
2412 W
= "{ S1[t,i] -> a[t,i] }";
2413 R
= "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
2414 "S1[t,i] -> a[t-1,i+1] }";
2415 S
= "{ S1[t,i] -> [t,i] }";
2416 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2419 /* Fig. 5 of CC2008 */
2420 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
2422 W
= "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
2423 "j >= 2 and j <= -1 + N }";
2424 R
= "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
2425 "j >= 2 and j <= -1 + N; "
2426 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
2427 "j >= 2 and j <= -1 + N }";
2428 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2429 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2432 D
= "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
2433 W
= "{ S1[i] -> a[i] }";
2434 R
= "{ S2[i] -> a[i+1] }";
2435 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2436 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2439 D
= "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
2440 W
= "{ S1[i] -> a[i] }";
2441 R
= "{ S2[i] -> a[9-i] }";
2442 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2443 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2446 D
= "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
2447 W
= "{ S1[i] -> a[i] }";
2448 R
= "[N] -> { S2[i] -> a[N-1-i] }";
2449 S
= "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2450 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 1) < 0)
2453 D
= "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
2454 W
= "{ S1[i] -> a[i]; S2[i] -> b[i] }";
2455 R
= "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
2456 S
= "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
2457 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2460 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2461 W
= "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
2462 R
= "{ S2[i,j] -> a[i-1,j] }";
2463 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2464 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2467 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2468 W
= "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
2469 R
= "{ S2[i,j] -> a[i,j-1] }";
2470 S
= "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2471 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2474 D
= "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
2475 W
= "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
2476 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
2477 R
= "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
2478 S
= "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
2479 "S_0[] -> [0, 0, 0] }";
2480 if (test_one_schedule(ctx
, D
, W
, R
, S
, 1, 0) < 0)
2482 ctx
->opt
->schedule_parametric
= 0;
2483 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2485 ctx
->opt
->schedule_parametric
= 1;
2487 D
= "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
2488 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
2489 W
= "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
2490 R
= "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
2491 "S4[i] -> a[i,N] }";
2492 S
= "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
2493 "S4[i] -> [4,i,0] }";
2494 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 0) < 0)
2497 D
= "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
2498 W
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2500 R
= "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2502 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
2504 S
= "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2505 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2508 D
= "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
2509 " S_2[t] : t >= 0 and t <= -1 + N; "
2510 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
2512 W
= "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
2513 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
2514 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
2515 "i >= 0 and i <= -1 + N }";
2516 R
= "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
2517 "i >= 0 and i <= -1 + N; "
2518 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
2519 S
= "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
2520 " S_0[t] -> [0, t, 0] }";
2522 if (test_one_schedule(ctx
, D
, W
, R
, S
, 2, 1) < 0)
2524 ctx
->opt
->schedule_parametric
= 0;
2525 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2527 ctx
->opt
->schedule_parametric
= 1;
2529 D
= "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
2530 S
= "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
2531 if (test_one_schedule(ctx
, D
, "{}", "{}", S
, 2, 2) < 0)
2534 D
= "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
2535 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
2536 W
= "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
2537 "j >= 0 and j <= -1 + N; "
2538 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2539 R
= "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
2540 "j >= 0 and j <= -1 + N; "
2541 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2542 S
= "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
2543 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2546 D
= "{ S_0[i] : i >= 0 }";
2547 W
= "{ S_0[i] -> a[i] : i >= 0 }";
2548 R
= "{ S_0[i] -> a[0] : i >= 0 }";
2549 S
= "{ S_0[i] -> [0, i, 0] }";
2550 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2553 D
= "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
2554 W
= "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
2555 R
= "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
2556 S
= "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
2557 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2560 D
= "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
2561 "k <= -1 + n and k >= 0 }";
2562 W
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
2563 R
= "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
2564 "k <= -1 + n and k >= 0; "
2565 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
2566 "k <= -1 + n and k >= 0; "
2567 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
2568 "k <= -1 + n and k >= 0 }";
2569 S
= "[n] -> { S_0[j, k] -> [2, j, k] }";
2570 ctx
->opt
->schedule_outer_zero_distance
= 1;
2571 if (test_one_schedule(ctx
, D
, W
, R
, S
, 0, 0) < 0)
2573 ctx
->opt
->schedule_outer_zero_distance
= 0;
2575 D
= "{Stmt_for_body24[i0, i1, i2, i3]:"
2576 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
2577 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
2578 "Stmt_for_body24[i0, i1, 1, 0]:"
2579 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
2580 "Stmt_for_body7[i0, i1, i2]:"
2581 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
2584 V
= "{Stmt_for_body24[0, i1, i2, i3] -> "
2585 "Stmt_for_body24[1, i1, i2, i3]:"
2586 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
2588 "Stmt_for_body24[0, i1, i2, i3] -> "
2589 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
2590 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
2592 "Stmt_for_body24[0, i1, i2, i3] ->"
2593 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
2594 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
2595 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
2596 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
2597 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
2598 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
2599 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
2600 "i1 <= 6 and i1 >= 0;"
2601 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
2602 "Stmt_for_body7[i0, i1, i2] -> "
2603 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
2604 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
2605 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
2606 "Stmt_for_body7[i0, i1, i2] -> "
2607 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
2608 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
2609 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
2611 S
= "{ Stmt_for_body24[i0, i1, i2, i3] -> "
2612 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
2613 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
2615 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2618 D
= "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
2619 V
= "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
2620 "j >= 1 and j <= 7;"
2621 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
2622 "j >= 1 and j <= 8 }";
2624 S
= "{ S_0[i, j] -> [i + j, j] }";
2625 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2626 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2628 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2630 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
2631 D
= "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
2632 "j >= 0 and j <= -1 + i }";
2633 V
= "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
2634 "i <= -1 + N and j >= 0;"
2635 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
2638 S
= "{ S_0[i, j] -> [i, j] }";
2639 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2640 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2642 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2644 /* Test both algorithms on a case with only proximity dependences. */
2645 D
= "{ S[i,j] : 0 <= i <= 10 }";
2647 P
= "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
2648 S
= "{ S[i, j] -> [j, i] }";
2649 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2650 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2652 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2653 if (test_special_schedule(ctx
, D
, V
, P
, S
) < 0)
2656 D
= "{ A[a]; B[] }";
2658 P
= "{ A[a] -> B[] }";
2659 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
2662 if (test_padded_schedule(ctx
) < 0)
2665 /* Check that check for progress is not confused by rational
2668 D
= "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
2669 V
= "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
2671 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
2672 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
2674 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_FEAUTRIER
;
2675 if (test_has_schedule(ctx
, D
, V
, P
) < 0)
2677 ctx
->opt
->schedule_algorithm
= ISL_SCHEDULE_ALGORITHM_ISL
;
2682 int test_plain_injective(isl_ctx
*ctx
, const char *str
, int injective
)
2684 isl_union_map
*umap
;
2687 umap
= isl_union_map_read_from_str(ctx
, str
);
2688 test
= isl_union_map_plain_is_injective(umap
);
2689 isl_union_map_free(umap
);
2692 if (test
== injective
)
2695 isl_die(ctx
, isl_error_unknown
,
2696 "map not detected as injective", return -1);
2698 isl_die(ctx
, isl_error_unknown
,
2699 "map detected as injective", return -1);
2702 int test_injective(isl_ctx
*ctx
)
2706 if (test_plain_injective(ctx
, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
2708 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> B[0]}", 1))
2710 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[1]}", 1))
2712 if (test_plain_injective(ctx
, "{S[] -> A[0]; T[] -> A[0]}", 0))
2714 if (test_plain_injective(ctx
, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
2716 if (test_plain_injective(ctx
, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
2718 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
2720 if (test_plain_injective(ctx
, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
2723 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
2724 if (test_plain_injective(ctx
, str
, 1))
2726 str
= "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
2727 if (test_plain_injective(ctx
, str
, 0))
2733 static int aff_plain_is_equal(__isl_keep isl_aff
*aff
, const char *str
)
2741 aff2
= isl_aff_read_from_str(isl_aff_get_ctx(aff
), str
);
2742 equal
= isl_aff_plain_is_equal(aff
, aff2
);
2748 static int aff_check_plain_equal(__isl_keep isl_aff
*aff
, const char *str
)
2752 equal
= aff_plain_is_equal(aff
, str
);
2756 isl_die(isl_aff_get_ctx(aff
), isl_error_unknown
,
2757 "result not as expected", return -1);
2761 int test_aff(isl_ctx
*ctx
)
2766 isl_local_space
*ls
;
2770 space
= isl_space_set_alloc(ctx
, 0, 1);
2771 ls
= isl_local_space_from_space(space
);
2772 aff
= isl_aff_zero_on_domain(ls
);
2774 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2775 aff
= isl_aff_scale_down_ui(aff
, 3);
2776 aff
= isl_aff_floor(aff
);
2777 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2778 aff
= isl_aff_scale_down_ui(aff
, 2);
2779 aff
= isl_aff_floor(aff
);
2780 aff
= isl_aff_add_coefficient_si(aff
, isl_dim_in
, 0, 1);
2783 set
= isl_set_read_from_str(ctx
, str
);
2784 aff
= isl_aff_gist(aff
, set
);
2786 aff
= isl_aff_add_constant_si(aff
, -16);
2787 zero
= isl_aff_plain_is_zero(aff
);
2793 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2795 aff
= isl_aff_read_from_str(ctx
, "{ [-1] }");
2796 aff
= isl_aff_scale_down_ui(aff
, 64);
2797 aff
= isl_aff_floor(aff
);
2798 equal
= aff_check_plain_equal(aff
, "{ [-1] }");
2806 int test_dim_max(isl_ctx
*ctx
)
2810 isl_set
*set1
, *set2
;
2815 str
= "[N] -> { [i] : 0 <= i <= min(N,10) }";
2816 set
= isl_set_read_from_str(ctx
, str
);
2817 pwaff
= isl_set_dim_max(set
, 0);
2818 set1
= isl_set_from_pw_aff(pwaff
);
2819 str
= "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
2820 set2
= isl_set_read_from_str(ctx
, str
);
2821 equal
= isl_set_is_equal(set1
, set2
);
2827 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2829 str
= "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
2830 set
= isl_set_read_from_str(ctx
, str
);
2831 pwaff
= isl_set_dim_max(set
, 0);
2832 set1
= isl_set_from_pw_aff(pwaff
);
2833 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2834 set2
= isl_set_read_from_str(ctx
, str
);
2835 equal
= isl_set_is_equal(set1
, set2
);
2841 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2843 str
= "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
2844 set
= isl_set_read_from_str(ctx
, str
);
2845 pwaff
= isl_set_dim_max(set
, 0);
2846 set1
= isl_set_from_pw_aff(pwaff
);
2847 str
= "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2848 set2
= isl_set_read_from_str(ctx
, str
);
2849 equal
= isl_set_is_equal(set1
, set2
);
2855 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2857 str
= "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
2858 "0 <= i < N and 0 <= j < M }";
2859 map
= isl_map_read_from_str(ctx
, str
);
2860 set
= isl_map_range(map
);
2862 pwaff
= isl_set_dim_max(isl_set_copy(set
), 0);
2863 set1
= isl_set_from_pw_aff(pwaff
);
2864 str
= "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
2865 set2
= isl_set_read_from_str(ctx
, str
);
2866 equal
= isl_set_is_equal(set1
, set2
);
2870 pwaff
= isl_set_dim_max(isl_set_copy(set
), 3);
2871 set1
= isl_set_from_pw_aff(pwaff
);
2872 str
= "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
2873 set2
= isl_set_read_from_str(ctx
, str
);
2874 if (equal
>= 0 && equal
)
2875 equal
= isl_set_is_equal(set1
, set2
);
2884 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2886 /* Check that solutions are properly merged. */
2887 str
= "[n] -> { [a, b, c] : c >= -4a - 2b and "
2888 "c <= -1 + n - 4a - 2b and c >= -2b and "
2889 "4a >= -4 + n and c >= 0 }";
2890 set
= isl_set_read_from_str(ctx
, str
);
2891 pwaff
= isl_set_dim_min(set
, 2);
2892 set1
= isl_set_from_pw_aff(pwaff
);
2893 str
= "[n] -> { [(0)] : n >= 1 }";
2894 set2
= isl_set_read_from_str(ctx
, str
);
2895 equal
= isl_set_is_equal(set1
, set2
);
2902 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2907 int test_product(isl_ctx
*ctx
)
2911 isl_union_set
*uset1
, *uset2
;
2915 set
= isl_set_read_from_str(ctx
, str
);
2916 set
= isl_set_product(set
, isl_set_copy(set
));
2917 ok
= isl_set_is_wrapping(set
);
2922 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2925 uset1
= isl_union_set_read_from_str(ctx
, str
);
2926 uset1
= isl_union_set_product(uset1
, isl_union_set_copy(uset1
));
2927 str
= "{ [[] -> []] }";
2928 uset2
= isl_union_set_read_from_str(ctx
, str
);
2929 ok
= isl_union_set_is_equal(uset1
, uset2
);
2930 isl_union_set_free(uset1
);
2931 isl_union_set_free(uset2
);
2935 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2940 int test_equal(isl_ctx
*ctx
)
2943 isl_set
*set
, *set2
;
2947 set
= isl_set_read_from_str(ctx
, str
);
2949 set2
= isl_set_read_from_str(ctx
, str
);
2950 equal
= isl_set_is_equal(set
, set2
);
2956 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
2961 static int test_plain_fixed(isl_ctx
*ctx
, __isl_take isl_map
*map
,
2962 enum isl_dim_type type
, unsigned pos
, int fixed
)
2966 test
= isl_map_plain_is_fixed(map
, type
, pos
, NULL
);
2973 isl_die(ctx
, isl_error_unknown
,
2974 "map not detected as fixed", return -1);
2976 isl_die(ctx
, isl_error_unknown
,
2977 "map detected as fixed", return -1);
2980 int test_fixed(isl_ctx
*ctx
)
2985 str
= "{ [i] -> [i] }";
2986 map
= isl_map_read_from_str(ctx
, str
);
2987 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 0))
2989 str
= "{ [i] -> [1] }";
2990 map
= isl_map_read_from_str(ctx
, str
);
2991 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
2993 str
= "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
2994 map
= isl_map_read_from_str(ctx
, str
);
2995 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
2997 map
= isl_map_read_from_str(ctx
, str
);
2998 map
= isl_map_neg(map
);
2999 if (test_plain_fixed(ctx
, map
, isl_dim_out
, 0, 1))
3005 int test_vertices(isl_ctx
*ctx
)
3008 isl_basic_set
*bset
;
3009 isl_vertices
*vertices
;
3011 str
= "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }";
3012 bset
= isl_basic_set_read_from_str(ctx
, str
);
3013 vertices
= isl_basic_set_compute_vertices(bset
);
3014 isl_basic_set_free(bset
);
3015 isl_vertices_free(vertices
);
3019 str
= "{ A[t, i] : t = 14 and i = 1 }";
3020 bset
= isl_basic_set_read_from_str(ctx
, str
);
3021 vertices
= isl_basic_set_compute_vertices(bset
);
3022 isl_basic_set_free(bset
);
3023 isl_vertices_free(vertices
);
3030 int test_union_pw(isl_ctx
*ctx
)
3034 isl_union_set
*uset
;
3035 isl_union_pw_qpolynomial
*upwqp1
, *upwqp2
;
3037 str
= "{ [x] -> x^2 }";
3038 upwqp1
= isl_union_pw_qpolynomial_read_from_str(ctx
, str
);
3039 upwqp2
= isl_union_pw_qpolynomial_copy(upwqp1
);
3040 uset
= isl_union_pw_qpolynomial_domain(upwqp1
);
3041 upwqp1
= isl_union_pw_qpolynomial_copy(upwqp2
);
3042 upwqp1
= isl_union_pw_qpolynomial_intersect_domain(upwqp1
, uset
);
3043 equal
= isl_union_pw_qpolynomial_plain_is_equal(upwqp1
, upwqp2
);
3044 isl_union_pw_qpolynomial_free(upwqp1
);
3045 isl_union_pw_qpolynomial_free(upwqp2
);
3049 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3054 int test_output(isl_ctx
*ctx
)
3062 str
= "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
3063 pa
= isl_pw_aff_read_from_str(ctx
, str
);
3065 p
= isl_printer_to_str(ctx
);
3066 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
3067 p
= isl_printer_print_pw_aff(p
, pa
);
3068 s
= isl_printer_get_str(p
);
3069 isl_printer_free(p
);
3070 isl_pw_aff_free(pa
);
3074 equal
= !strcmp(s
, "(2 - x + 4*floord(x, 4) >= 0) ? (1) : 2");
3079 isl_die(ctx
, isl_error_unknown
, "unexpected result", return -1);
3084 int test_sample(isl_ctx
*ctx
)
3087 isl_basic_set
*bset1
, *bset2
;
3090 str
= "{ [a, b, c, d, e, f, g, h, i, j, k] : "
3091 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
3092 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
3093 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
3094 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
3095 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
3096 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
3097 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
3098 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
3099 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
3100 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
3101 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
3102 "d - 1073741821e and "
3103 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
3104 "3j >= 1 - a + b + 2e and "
3105 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
3106 "3i <= 4 - a + 4b - e and "
3107 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
3108 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
3109 "c <= -1 + a and 3i >= -2 - a + 3e and "
3110 "1073741822e <= 1073741823 - a + 1073741822b + c and "
3111 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
3112 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
3113 "1073741823e >= 1 + 1073741823b - d and "
3114 "3i >= 1073741823b + c - 1073741823e - f and "
3115 "3i >= 1 + 2b + e + 3g }";
3116 bset1
= isl_basic_set_read_from_str(ctx
, str
);
3117 bset2
= isl_basic_set_sample(isl_basic_set_copy(bset1
));
3118 empty
= isl_basic_set_is_empty(bset2
);
3119 subset
= isl_basic_set_is_subset(bset2
, bset1
);
3120 isl_basic_set_free(bset1
);
3121 isl_basic_set_free(bset2
);
3122 if (empty
< 0 || subset
< 0)
3125 isl_die(ctx
, isl_error_unknown
, "point not found", return -1);
3127 isl_die(ctx
, isl_error_unknown
, "bad point found", return -1);
3132 int test_fixed_power(isl_ctx
*ctx
)
3140 str
= "{ [i] -> [i + 1] }";
3141 map
= isl_map_read_from_str(ctx
, str
);
3142 isl_int_set_si(exp
, 23);
3143 map
= isl_map_fixed_power(map
, exp
);
3144 equal
= map_check_equal(map
, "{ [i] -> [i + 23] }");
3153 int test_slice(isl_ctx
*ctx
)
3159 str
= "{ [i] -> [j] }";
3160 map
= isl_map_read_from_str(ctx
, str
);
3161 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_out
, 0);
3162 equal
= map_check_equal(map
, "{ [i] -> [i] }");
3167 str
= "{ [i] -> [j] }";
3168 map
= isl_map_read_from_str(ctx
, str
);
3169 map
= isl_map_equate(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3170 equal
= map_check_equal(map
, "{ [i] -> [j] }");
3175 str
= "{ [i] -> [j] }";
3176 map
= isl_map_read_from_str(ctx
, str
);
3177 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_out
, 0);
3178 equal
= map_check_equal(map
, "{ [i] -> [-i] }");
3183 str
= "{ [i] -> [j] }";
3184 map
= isl_map_read_from_str(ctx
, str
);
3185 map
= isl_map_oppose(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3186 equal
= map_check_equal(map
, "{ [0] -> [j] }");
3191 str
= "{ [i] -> [j] }";
3192 map
= isl_map_read_from_str(ctx
, str
);
3193 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_out
, 0);
3194 equal
= map_check_equal(map
, "{ [i] -> [j] : i > j }");
3199 str
= "{ [i] -> [j] }";
3200 map
= isl_map_read_from_str(ctx
, str
);
3201 map
= isl_map_order_gt(map
, isl_dim_in
, 0, isl_dim_in
, 0);
3202 equal
= map_check_equal(map
, "{ [i] -> [j] : false }");
3210 int test_eliminate(isl_ctx
*ctx
)
3216 str
= "{ [i] -> [j] : i = 2j }";
3217 map
= isl_map_read_from_str(ctx
, str
);
3218 map
= isl_map_eliminate(map
, isl_dim_out
, 0, 1);
3219 equal
= map_check_equal(map
, "{ [i] -> [j] : exists a : i = 2a }");
3227 /* Check that isl_set_dim_residue_class detects that the values of j
3228 * in the set below are all odd and that it does not detect any spurious
3231 static int test_residue_class(isl_ctx
*ctx
)
3238 str
= "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
3239 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
3240 set
= isl_set_read_from_str(ctx
, str
);
3243 res
= isl_set_dim_residue_class(set
, 1, &m
, &r
);
3245 (isl_int_cmp_si(m
, 2) != 0 || isl_int_cmp_si(r
, 1) != 0))
3246 isl_die(ctx
, isl_error_unknown
, "incorrect residue class",
3255 int test_align_parameters(isl_ctx
*ctx
)
3259 isl_multi_aff
*ma1
, *ma2
;
3262 str
= "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
3263 ma1
= isl_multi_aff_read_from_str(ctx
, str
);
3265 space
= isl_space_params_alloc(ctx
, 1);
3266 space
= isl_space_set_dim_name(space
, isl_dim_param
, 0, "N");
3267 ma1
= isl_multi_aff_align_params(ma1
, space
);
3269 str
= "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
3270 ma2
= isl_multi_aff_read_from_str(ctx
, str
);
3272 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
3274 isl_multi_aff_free(ma1
);
3275 isl_multi_aff_free(ma2
);
3280 isl_die(ctx
, isl_error_unknown
,
3281 "result not as expected", return -1);
3286 static int test_list(isl_ctx
*ctx
)
3288 isl_id
*a
, *b
, *c
, *d
, *id
;
3292 a
= isl_id_alloc(ctx
, "a", NULL
);
3293 b
= isl_id_alloc(ctx
, "b", NULL
);
3294 c
= isl_id_alloc(ctx
, "c", NULL
);
3295 d
= isl_id_alloc(ctx
, "d", NULL
);
3297 list
= isl_id_list_alloc(ctx
, 4);
3298 list
= isl_id_list_add(list
, a
);
3299 list
= isl_id_list_add(list
, b
);
3300 list
= isl_id_list_add(list
, c
);
3301 list
= isl_id_list_add(list
, d
);
3302 list
= isl_id_list_drop(list
, 1, 1);
3304 if (isl_id_list_n_id(list
) != 3) {
3305 isl_id_list_free(list
);
3306 isl_die(ctx
, isl_error_unknown
,
3307 "unexpected number of elements in list", return -1);
3310 id
= isl_id_list_get_id(list
, 0);
3313 id
= isl_id_list_get_id(list
, 1);
3316 id
= isl_id_list_get_id(list
, 2);
3320 isl_id_list_free(list
);
3323 isl_die(ctx
, isl_error_unknown
,
3324 "unexpected elements in list", return -1);
3329 const char *set_conversion_tests
[] = {
3330 "[N] -> { [i] : N - 1 <= 2 i <= N }",
3331 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
3332 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3333 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3336 /* Check that converting from isl_set to isl_pw_multi_aff and back
3337 * to isl_set produces the original isl_set.
3339 static int test_set_conversion(isl_ctx
*ctx
)
3343 isl_set
*set1
, *set2
;
3344 isl_pw_multi_aff
*pma
;
3347 for (i
= 0; i
< ARRAY_SIZE(set_conversion_tests
); ++i
) {
3348 str
= set_conversion_tests
[i
];
3349 set1
= isl_set_read_from_str(ctx
, str
);
3350 pma
= isl_pw_multi_aff_from_set(isl_set_copy(set1
));
3351 set2
= isl_set_from_pw_multi_aff(pma
);
3352 equal
= isl_set_is_equal(set1
, set2
);
3359 isl_die(ctx
, isl_error_unknown
, "bad conversion",
3366 /* Check that converting from isl_map to isl_pw_multi_aff and back
3367 * to isl_map produces the original isl_map.
3369 static int test_map_conversion(isl_ctx
*ctx
)
3372 isl_map
*map1
, *map2
;
3373 isl_pw_multi_aff
*pma
;
3376 str
= "{ [a, b, c, d] -> s0[a, b, e, f] : "
3377 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
3378 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
3379 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
3381 map1
= isl_map_read_from_str(ctx
, str
);
3382 pma
= isl_pw_multi_aff_from_map(isl_map_copy(map1
));
3383 map2
= isl_map_from_pw_multi_aff(pma
);
3384 equal
= isl_map_is_equal(map1
, map2
);
3391 isl_die(ctx
, isl_error_unknown
, "bad conversion", return -1);
3396 static int test_conversion(isl_ctx
*ctx
)
3398 if (test_set_conversion(ctx
) < 0)
3400 if (test_map_conversion(ctx
) < 0)
3405 /* Check that isl_basic_map_curry does not modify input.
3407 static int test_curry(isl_ctx
*ctx
)
3410 isl_basic_map
*bmap1
, *bmap2
;
3413 str
= "{ [A[] -> B[]] -> C[] }";
3414 bmap1
= isl_basic_map_read_from_str(ctx
, str
);
3415 bmap2
= isl_basic_map_curry(isl_basic_map_copy(bmap1
));
3416 equal
= isl_basic_map_is_equal(bmap1
, bmap2
);
3417 isl_basic_map_free(bmap1
);
3418 isl_basic_map_free(bmap2
);
3423 isl_die(ctx
, isl_error_unknown
,
3424 "curried map should not be equal to original",
3434 } preimage_tests
[] = {
3435 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
3436 "{ A[j,i] -> B[i,j] }",
3437 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
3438 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3439 "{ A[a,b] -> B[a/2,b/6] }",
3440 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
3441 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3442 "{ A[a,b] -> B[a/2,b/6] }",
3443 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
3444 "exists i,j : a = 2 i and b = 6 j }" },
3445 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
3446 "[n] -> { : 0 <= n <= 100 }" },
3447 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3448 "{ A[a] -> B[2a] }",
3449 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
3450 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3451 "{ A[a] -> B[([a/2])] }",
3452 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
3453 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
3454 "{ A[a] -> B[a,a,a/3] }",
3455 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
3456 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
3457 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
3460 int test_preimage(isl_ctx
*ctx
)
3463 isl_basic_set
*bset1
, *bset2
;
3467 for (i
= 0; i
< ARRAY_SIZE(preimage_tests
); ++i
) {
3468 bset1
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].set
);
3469 ma
= isl_multi_aff_read_from_str(ctx
, preimage_tests
[i
].ma
);
3470 bset2
= isl_basic_set_read_from_str(ctx
, preimage_tests
[i
].res
);
3471 bset1
= isl_basic_set_preimage_multi_aff(bset1
, ma
);
3472 equal
= isl_basic_set_is_equal(bset1
, bset2
);
3473 isl_basic_set_free(bset1
);
3474 isl_basic_set_free(bset2
);
3478 isl_die(ctx
, isl_error_unknown
, "bad preimage",
3489 } pullback_tests
[] = {
3490 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
3491 "{ A[a,b] -> C[b + 2a] }" },
3492 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
3493 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
3494 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
3495 "{ A[a] -> C[(a)/6] }" },
3496 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
3497 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
3498 "{ A[a] -> C[(2a)/3] }" },
3499 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
3500 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
3501 "{ A[i,j] -> C[i + j, i + j] }"},
3502 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
3503 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
3504 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
3507 static int test_pullback(isl_ctx
*ctx
)
3510 isl_multi_aff
*ma1
, *ma2
;
3514 for (i
= 0; i
< ARRAY_SIZE(pullback_tests
); ++i
) {
3515 ma1
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma1
);
3516 ma
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].ma
);
3517 ma2
= isl_multi_aff_read_from_str(ctx
, pullback_tests
[i
].res
);
3518 ma1
= isl_multi_aff_pullback_multi_aff(ma1
, ma
);
3519 equal
= isl_multi_aff_plain_is_equal(ma1
, ma2
);
3520 isl_multi_aff_free(ma1
);
3521 isl_multi_aff_free(ma2
);
3525 isl_die(ctx
, isl_error_unknown
, "bad pullback",
3532 /* Check that negation is printed correctly.
3534 static int test_ast(isl_ctx
*ctx
)
3536 isl_ast_expr
*expr
, *expr1
, *expr2
, *expr3
;
3540 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
3541 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
3542 expr
= isl_ast_expr_add(expr1
, expr2
);
3543 expr
= isl_ast_expr_neg(expr
);
3544 str
= isl_ast_expr_to_str(expr
);
3545 ok
= str
? !strcmp(str
, "-(A + B)") : -1;
3547 isl_ast_expr_free(expr
);
3552 isl_die(ctx
, isl_error_unknown
,
3553 "isl_ast_expr printed incorrectly", return -1);
3555 expr1
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "A", NULL
));
3556 expr2
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "B", NULL
));
3557 expr
= isl_ast_expr_add(expr1
, expr2
);
3558 expr3
= isl_ast_expr_from_id(isl_id_alloc(ctx
, "C", NULL
));
3559 expr
= isl_ast_expr_sub(expr3
, expr
);
3560 str
= isl_ast_expr_to_str(expr
);
3561 ok
= str
? !strcmp(str
, "C - (A + B)") : -1;
3563 isl_ast_expr_free(expr
);
3568 isl_die(ctx
, isl_error_unknown
,
3569 "isl_ast_expr printed incorrectly", return -1);
3574 /* Internal data structure for before_for and after_for callbacks.
3576 * depth is the current depth
3577 * before is the number of times before_for has been called
3578 * after is the number of times after_for has been called
3580 struct isl_test_codegen_data
{
3586 /* This function is called before each for loop in the AST generated
3587 * from test_ast_gen1.
3589 * Increment the number of calls and the depth.
3590 * Check that the space returned by isl_ast_build_get_schedule_space
3591 * matches the target space of the schedule returned by
3592 * isl_ast_build_get_schedule.
3593 * Return an isl_id that is checked by the corresponding call
3596 static __isl_give isl_id
*before_for(__isl_keep isl_ast_build
*build
,
3599 struct isl_test_codegen_data
*data
= user
;
3602 isl_union_map
*schedule
;
3603 isl_union_set
*uset
;
3608 ctx
= isl_ast_build_get_ctx(build
);
3610 if (data
->before
>= 3)
3611 isl_die(ctx
, isl_error_unknown
,
3612 "unexpected number of for nodes", return NULL
);
3613 if (data
->depth
>= 2)
3614 isl_die(ctx
, isl_error_unknown
,
3615 "unexpected depth", return NULL
);
3617 snprintf(name
, sizeof(name
), "d%d", data
->depth
);
3621 schedule
= isl_ast_build_get_schedule(build
);
3622 uset
= isl_union_map_range(schedule
);
3625 if (isl_union_set_n_set(uset
) != 1) {
3626 isl_union_set_free(uset
);
3627 isl_die(ctx
, isl_error_unknown
,
3628 "expecting single range space", return NULL
);
3631 space
= isl_ast_build_get_schedule_space(build
);
3632 set
= isl_union_set_extract_set(uset
, space
);
3633 isl_union_set_free(uset
);
3634 empty
= isl_set_is_empty(set
);
3640 isl_die(ctx
, isl_error_unknown
,
3641 "spaces don't match", return NULL
);
3643 return isl_id_alloc(ctx
, name
, NULL
);
3646 /* This function is called after each for loop in the AST generated
3647 * from test_ast_gen1.
3649 * Increment the number of calls and decrement the depth.
3650 * Check that the annotation attached to the node matches
3651 * the isl_id returned by the corresponding call to before_for.
3653 static __isl_give isl_ast_node
*after_for(__isl_take isl_ast_node
*node
,
3654 __isl_keep isl_ast_build
*build
, void *user
)
3656 struct isl_test_codegen_data
*data
= user
;
3664 if (data
->after
> data
->before
)
3665 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3666 "mismatch in number of for nodes",
3667 return isl_ast_node_free(node
));
3669 id
= isl_ast_node_get_annotation(node
);
3671 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3672 "missing annotation", return isl_ast_node_free(node
));
3674 name
= isl_id_get_name(id
);
3675 valid
= name
&& atoi(name
+ 1) == data
->depth
;
3679 isl_die(isl_ast_node_get_ctx(node
), isl_error_unknown
,
3680 "wrong annotation", return isl_ast_node_free(node
));
3685 /* Check that the before_each_for and after_each_for callbacks
3686 * are called for each for loop in the generated code,
3687 * that they are called in the right order and that the isl_id
3688 * returned from the before_each_for callback is attached to
3689 * the isl_ast_node passed to the corresponding after_each_for call.
3691 static int test_ast_gen1(isl_ctx
*ctx
)
3695 isl_union_map
*schedule
;
3696 isl_ast_build
*build
;
3698 struct isl_test_codegen_data data
;
3700 str
= "[N] -> { : N >= 10 }";
3701 set
= isl_set_read_from_str(ctx
, str
);
3702 str
= "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
3703 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
3704 schedule
= isl_union_map_read_from_str(ctx
, str
);
3709 build
= isl_ast_build_from_context(set
);
3710 build
= isl_ast_build_set_before_each_for(build
,
3711 &before_for
, &data
);
3712 build
= isl_ast_build_set_after_each_for(build
,
3714 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3715 isl_ast_build_free(build
);
3719 isl_ast_node_free(tree
);
3721 if (data
.before
!= 3 || data
.after
!= 3)
3722 isl_die(ctx
, isl_error_unknown
,
3723 "unexpected number of for nodes", return -1);
3728 /* Check that the AST generator handles domains that are integrally disjoint
3729 * but not ratinoally disjoint.
3731 static int test_ast_gen2(isl_ctx
*ctx
)
3735 isl_union_map
*schedule
;
3736 isl_union_map
*options
;
3737 isl_ast_build
*build
;
3740 str
= "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
3741 schedule
= isl_union_map_read_from_str(ctx
, str
);
3742 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3743 build
= isl_ast_build_from_context(set
);
3745 str
= "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
3746 options
= isl_union_map_read_from_str(ctx
, str
);
3747 build
= isl_ast_build_set_options(build
, options
);
3748 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3749 isl_ast_build_free(build
);
3752 isl_ast_node_free(tree
);
3757 /* Increment *user on each call.
3759 static __isl_give isl_ast_node
*count_domains(__isl_take isl_ast_node
*node
,
3760 __isl_keep isl_ast_build
*build
, void *user
)
3769 /* Test that unrolling tries to minimize the number of instances.
3770 * In particular, for the schedule given below, make sure it generates
3771 * 3 nodes (rather than 101).
3773 static int test_ast_gen3(isl_ctx
*ctx
)
3777 isl_union_map
*schedule
;
3778 isl_union_map
*options
;
3779 isl_ast_build
*build
;
3783 str
= "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
3784 schedule
= isl_union_map_read_from_str(ctx
, str
);
3785 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3787 str
= "{ [i] -> unroll[0] }";
3788 options
= isl_union_map_read_from_str(ctx
, str
);
3790 build
= isl_ast_build_from_context(set
);
3791 build
= isl_ast_build_set_options(build
, options
);
3792 build
= isl_ast_build_set_at_each_domain(build
,
3793 &count_domains
, &n_domain
);
3794 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3795 isl_ast_build_free(build
);
3799 isl_ast_node_free(tree
);
3802 isl_die(ctx
, isl_error_unknown
,
3803 "unexpected number of for nodes", return -1);
3808 /* Check that if the ast_build_exploit_nested_bounds options is set,
3809 * we do not get an outer if node in the generated AST,
3810 * while we do get such an outer if node if the options is not set.
3812 static int test_ast_gen4(isl_ctx
*ctx
)
3816 isl_union_map
*schedule
;
3817 isl_ast_build
*build
;
3819 enum isl_ast_node_type type
;
3822 enb
= isl_options_get_ast_build_exploit_nested_bounds(ctx
);
3823 str
= "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
3825 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 1);
3827 schedule
= isl_union_map_read_from_str(ctx
, str
);
3828 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3829 build
= isl_ast_build_from_context(set
);
3830 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3831 isl_ast_build_free(build
);
3835 type
= isl_ast_node_get_type(tree
);
3836 isl_ast_node_free(tree
);
3838 if (type
== isl_ast_node_if
)
3839 isl_die(ctx
, isl_error_unknown
,
3840 "not expecting if node", return -1);
3842 isl_options_set_ast_build_exploit_nested_bounds(ctx
, 0);
3844 schedule
= isl_union_map_read_from_str(ctx
, str
);
3845 set
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
3846 build
= isl_ast_build_from_context(set
);
3847 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
3848 isl_ast_build_free(build
);
3852 type
= isl_ast_node_get_type(tree
);
3853 isl_ast_node_free(tree
);
3855 if (type
!= isl_ast_node_if
)
3856 isl_die(ctx
, isl_error_unknown
,
3857 "expecting if node", return -1);
3859 isl_options_set_ast_build_exploit_nested_bounds(ctx
, enb
);
3864 static int test_ast_gen(isl_ctx
*ctx
)
3866 if (test_ast_gen1(ctx
) < 0)
3868 if (test_ast_gen2(ctx
) < 0)
3870 if (test_ast_gen3(ctx
) < 0)
3872 if (test_ast_gen4(ctx
) < 0)
3877 /* Check if dropping output dimensions from an isl_pw_multi_aff
3880 static int test_pw_multi_aff(isl_ctx
*ctx
)
3883 isl_pw_multi_aff
*pma1
, *pma2
;
3886 str
= "{ [i,j] -> [i+j, 4i-j] }";
3887 pma1
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3888 str
= "{ [i,j] -> [4i-j] }";
3889 pma2
= isl_pw_multi_aff_read_from_str(ctx
, str
);
3891 pma1
= isl_pw_multi_aff_drop_dims(pma1
, isl_dim_out
, 0, 1);
3893 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
3895 isl_pw_multi_aff_free(pma1
);
3896 isl_pw_multi_aff_free(pma2
);
3900 isl_die(ctx
, isl_error_unknown
,
3901 "expressions not equal", return -1);
3906 /* This is a regression test for a bug where isl_basic_map_simplify
3907 * would end up in an infinite loop. In particular, we construct
3908 * an empty basic set that is not obviously empty.
3909 * isl_basic_set_is_empty marks the basic set as empty.
3910 * After projecting out i3, the variable can be dropped completely,
3911 * but isl_basic_map_simplify refrains from doing so if the basic set
3912 * is empty and would end up in an infinite loop if it didn't test
3913 * explicitly for empty basic maps in the outer loop.
3915 static int test_simplify(isl_ctx
*ctx
)
3918 isl_basic_set
*bset
;
3921 str
= "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
3922 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
3923 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
3925 bset
= isl_basic_set_read_from_str(ctx
, str
);
3926 empty
= isl_basic_set_is_empty(bset
);
3927 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 3, 1);
3928 isl_basic_set_free(bset
);
3932 isl_die(ctx
, isl_error_unknown
,
3933 "basic set should be empty", return -1);
3938 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
3939 * with gbr context would fail to disable the use of the shifted tableau
3940 * when transferring equalities for the input to the context, resulting
3941 * in invalid sample values.
3943 static int test_partial_lexmin(isl_ctx
*ctx
)
3946 isl_basic_set
*bset
;
3947 isl_basic_map
*bmap
;
3950 str
= "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
3951 bmap
= isl_basic_map_read_from_str(ctx
, str
);
3952 str
= "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
3953 bset
= isl_basic_set_read_from_str(ctx
, str
);
3954 map
= isl_basic_map_partial_lexmin(bmap
, bset
, NULL
);
3965 int (*fn
)(isl_ctx
*ctx
);
3967 { "partial lexmin", &test_partial_lexmin
},
3968 { "simplify", &test_simplify
},
3969 { "curry", &test_curry
},
3970 { "piecewise multi affine expressions", &test_pw_multi_aff
},
3971 { "conversion", &test_conversion
},
3972 { "list", &test_list
},
3973 { "align parameters", &test_align_parameters
},
3974 { "preimage", &test_preimage
},
3975 { "pullback", &test_pullback
},
3976 { "AST", &test_ast
},
3977 { "AST generation", &test_ast_gen
},
3978 { "eliminate", &test_eliminate
},
3979 { "residue class", &test_residue_class
},
3980 { "div", &test_div
},
3981 { "slice", &test_slice
},
3982 { "fixed power", &test_fixed_power
},
3983 { "sample", &test_sample
},
3984 { "output", &test_output
},
3985 { "vertices", &test_vertices
},
3986 { "fixed", &test_fixed
},
3987 { "equal", &test_equal
},
3988 { "product", &test_product
},
3989 { "dim_max", &test_dim_max
},
3990 { "affine", &test_aff
},
3991 { "injective", &test_injective
},
3992 { "schedule", &test_schedule
},
3993 { "union_pw", &test_union_pw
},
3994 { "parse", &test_parse
},
3995 { "single-valued", &test_sv
},
3996 { "affine hull", &test_affine_hull
},
3997 { "coalesce", &test_coalesce
},
3998 { "factorize", &test_factorize
},
3999 { "subset", &test_subset
},
4000 { "subtract", &test_subtract
},
4006 struct isl_ctx
*ctx
;
4008 srcdir
= getenv("srcdir");
4011 ctx
= isl_ctx_alloc();
4012 for (i
= 0; i
< ARRAY_SIZE(tests
); ++i
) {
4013 printf("%s\n", tests
[i
].name
);
4014 if (tests
[i
].fn(ctx
) < 0)
4020 test_split_periods(ctx
);
4023 test_bijective(ctx
);
4027 test_construction(ctx
);
4029 test_application(ctx
);
4030 test_convex_hull(ctx
);