?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
isl_ast_build_node_from_schedule: generate disjunctions outside isolated part
[isl.git] / isl_test.c
blob5eed5d26cca45ffff9c209344f2478f74177abb7
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 *
7 * Use of this software is governed by the MIT license
8 *
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
15 * B.P. 105 - 78153 Le Chesnay, France
16 */
17
18 #include <assert.h>
19 #include <stdio.h>
20 #include <limits.h>
21 #include <isl_ctx_private.h>
22 #include <isl_map_private.h>
23 #include <isl_aff_private.h>
24 #include <isl/set.h>
25 #include <isl/flow.h>
26 #include <isl_constraint_private.h>
27 #include <isl/polynomial.h>
28 #include <isl/union_set.h>
29 #include <isl/union_map.h>
30 #include <isl_factorization.h>
31 #include <isl/schedule.h>
32 #include <isl/schedule_node.h>
33 #include <isl_options_private.h>
34 #include <isl/vertices.h>
35 #include <isl/ast_build.h>
36 #include <isl/val.h>
37 #include <isl/ilp.h>
38 #include <isl_ast_build_expr.h>
39 #include <isl/options.h>
40
41 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
42
43 static char *srcdir;
44
45 static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) {
46 char *filename;
47 int length;
48 char *pattern = "%s/test_inputs/%s.%s";
49
50 length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name)
51 + strlen(suffix) + 1;
52 filename = isl_alloc_array(ctx, char, length);
53
54 if (!filename)
55 return NULL;
56
57 sprintf(filename, pattern, srcdir, name, suffix);
58
59 return filename;
60 }
61
62 void test_parse_map(isl_ctx *ctx, const char *str)
63 {
64 isl_map *map;
65
66 map = isl_map_read_from_str(ctx, str);
67 assert(map);
68 isl_map_free(map);
69 }
70
71 int test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2)
72 {
73 isl_map *map, *map2;
74 int equal;
75
76 map = isl_map_read_from_str(ctx, str);
77 map2 = isl_map_read_from_str(ctx, str2);
78 equal = isl_map_is_equal(map, map2);
79 isl_map_free(map);
80 isl_map_free(map2);
81
82 if (equal < 0)
83 return -1;
84 if (!equal)
85 isl_die(ctx, isl_error_unknown, "maps not equal",
86 return -1);
87
88 return 0;
89 }
90
91 void test_parse_pwqp(isl_ctx *ctx, const char *str)
92 {
93 isl_pw_qpolynomial *pwqp;
94
95 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
96 assert(pwqp);
97 isl_pw_qpolynomial_free(pwqp);
98 }
99
100 static void test_parse_pwaff(isl_ctx *ctx, const char *str)
101 {
102 isl_pw_aff *pwaff;
103
104 pwaff = isl_pw_aff_read_from_str(ctx, str);
105 assert(pwaff);
106 isl_pw_aff_free(pwaff);
107 }
108
109 /* Check that we can read an isl_multi_val from "str" without errors.
110 */
111 static int test_parse_multi_val(isl_ctx *ctx, const char *str)
112 {
113 isl_multi_val *mv;
114
115 mv = isl_multi_val_read_from_str(ctx, str);
116 isl_multi_val_free(mv);
117
118 return mv ? 0 : -1;
119 }
120
121 int test_parse(struct isl_ctx *ctx)
122 {
123 isl_map *map, *map2;
124 const char *str, *str2;
125
126 if (test_parse_multi_val(ctx, "{ A[B[2] -> C[5, 7]] }") < 0)
127 return -1;
128 if (test_parse_multi_val(ctx, "[n] -> { [2] }") < 0)
129 return -1;
130 if (test_parse_multi_val(ctx, "{ A[4, infty, NaN, -1/2, 2/3] }") < 0)
131 return -1;
132
133 str = "{ [i] -> [-i] }";
134 map = isl_map_read_from_str(ctx, str);
135 assert(map);
136 isl_map_free(map);
137
138 str = "{ A[i] -> L[([i/3])] }";
139 map = isl_map_read_from_str(ctx, str);
140 assert(map);
141 isl_map_free(map);
142
143 test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
144 test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : "
145 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
146
147 str = "{ [x,y] : [([x/2]+y)/3] >= 1 }";
148 str2 = "{ [x, y] : 2y >= 6 - x }";
149 if (test_parse_map_equal(ctx, str, str2) < 0)
150 return -1;
151
152 if (test_parse_map_equal(ctx, "{ [x,y] : x <= min(y, 2*y+3) }",
153 "{ [x,y] : x <= y, 2*y + 3 }") < 0)
154 return -1;
155 str = "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }";
156 if (test_parse_map_equal(ctx, "{ [x,y] : x >= min(y, 2*y+3) }",
157 str) < 0)
158 return -1;
159
160 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
161 map = isl_map_read_from_str(ctx, str);
162 str = "{ [new, old] -> [o0, o1] : "
163 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
164 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
165 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
166 map2 = isl_map_read_from_str(ctx, str);
167 assert(isl_map_is_equal(map, map2));
168 isl_map_free(map);
169 isl_map_free(map2);
170
171 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
172 map = isl_map_read_from_str(ctx, str);
173 str = "{[new,old] -> [(new+1)%2,(old+1)%2]}";
174 map2 = isl_map_read_from_str(ctx, str);
175 assert(isl_map_is_equal(map, map2));
176 isl_map_free(map);
177 isl_map_free(map2);
178
179 str = "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }";
180 str2 = "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }";
181 if (test_parse_map_equal(ctx, str, str2) < 0)
182 return -1;
183
184 str = "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }";
185 str2 = "{ [i,j] -> [min(i,j)] }";
186 if (test_parse_map_equal(ctx, str, str2) < 0)
187 return -1;
188
189 str = "{ [i,j] : i != j }";
190 str2 = "{ [i,j] : i < j or i > j }";
191 if (test_parse_map_equal(ctx, str, str2) < 0)
192 return -1;
193
194 str = "{ [i,j] : (i+1)*2 >= j }";
195 str2 = "{ [i, j] : j <= 2 + 2i }";
196 if (test_parse_map_equal(ctx, str, str2) < 0)
197 return -1;
198
199 str = "{ [i] -> [i > 0 ? 4 : 5] }";
200 str2 = "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }";
201 if (test_parse_map_equal(ctx, str, str2) < 0)
202 return -1;
203
204 str = "[N=2,M] -> { [i=[(M+N)/4]] }";
205 str2 = "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }";
206 if (test_parse_map_equal(ctx, str, str2) < 0)
207 return -1;
208
209 str = "{ [x] : x >= 0 }";
210 str2 = "{ [x] : x-0 >= 0 }";
211 if (test_parse_map_equal(ctx, str, str2) < 0)
212 return -1;
213
214 str = "{ [i] : ((i > 10)) }";
215 str2 = "{ [i] : i >= 11 }";
216 if (test_parse_map_equal(ctx, str, str2) < 0)
217 return -1;
218
219 str = "{ [i] -> [0] }";
220 str2 = "{ [i] -> [0 * i] }";
221 if (test_parse_map_equal(ctx, str, str2) < 0)
222 return -1;
223
224 test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }");
225 test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
226 test_parse_pwaff(ctx, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
227 test_parse_pwqp(ctx, "{ [x] -> ([(x)/2] * [(x)/3]) }");
228
229 if (test_parse_map_equal(ctx, "{ [a] -> [b] : (not false) }",
230 "{ [a] -> [b] : true }") < 0)
231 return -1;
232
233 if (test_parse_map_equal(ctx, "{ [i] : i/2 <= 5 }",
234 "{ [i] : i <= 10 }") < 0)
235 return -1;
236
237 if (test_parse_map_equal(ctx, "{Sym=[n] [i] : i <= n }",
238 "[n] -> { [i] : i <= n }") < 0)
239 return -1;
240
241 if (test_parse_map_equal(ctx, "{ [*] }", "{ [a] }") < 0)
242 return -1;
243
244 if (test_parse_map_equal(ctx, "{ [i] : 2*floor(i/2) = i }",
245 "{ [i] : exists a : i = 2 a }") < 0)
246 return -1;
247
248 if (test_parse_map_equal(ctx, "{ [a] -> [b] : a = 5 implies b = 5 }",
249 "{ [a] -> [b] : a != 5 or b = 5 }") < 0)
250 return -1;
251
252 if (test_parse_map_equal(ctx, "{ [a] -> [a - 1 : a > 0] }",
253 "{ [a] -> [a - 1] : a > 0 }") < 0)
254 return -1;
255 if (test_parse_map_equal(ctx,
256 "{ [a] -> [a - 1 : a > 0; a : a <= 0] }",
257 "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }") < 0)
258 return -1;
259 if (test_parse_map_equal(ctx,
260 "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }",
261 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
262 return -1;
263 if (test_parse_map_equal(ctx,
264 "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }",
265 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
266 return -1;
267 if (test_parse_map_equal(ctx,
268 "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }",
269 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
270 return -1;
271 if (test_parse_map_equal(ctx,
272 "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }",
273 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0)
274 return -1;
275
276 return 0;
277 }
278
279 static int test_read(isl_ctx *ctx)
280 {
281 char *filename;
282 FILE *input;
283 isl_basic_set *bset1, *bset2;
284 const char *str = "{[y]: Exists ( alpha : 2alpha = y)}";
285 int equal;
286
287 filename = get_filename(ctx, "set", "omega");
288 assert(filename);
289 input = fopen(filename, "r");
290 assert(input);
291
292 bset1 = isl_basic_set_read_from_file(ctx, input);
293 bset2 = isl_basic_set_read_from_str(ctx, str);
294
295 equal = isl_basic_set_is_equal(bset1, bset2);
296
297 isl_basic_set_free(bset1);
298 isl_basic_set_free(bset2);
299 free(filename);
300
301 fclose(input);
302
303 if (equal < 0)
304 return -1;
305 if (!equal)
306 isl_die(ctx, isl_error_unknown,
307 "read sets not equal", return -1);
308
309 return 0;
310 }
311
312 static int test_bounded(isl_ctx *ctx)
313 {
314 isl_set *set;
315 int bounded;
316
317 set = isl_set_read_from_str(ctx, "[n] -> {[i] : 0 <= i <= n }");
318 bounded = isl_set_is_bounded(set);
319 isl_set_free(set);
320
321 if (bounded < 0)
322 return -1;
323 if (!bounded)
324 isl_die(ctx, isl_error_unknown,
325 "set not considered bounded", return -1);
326
327 set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }");
328 bounded = isl_set_is_bounded(set);
329 assert(!bounded);
330 isl_set_free(set);
331
332 if (bounded < 0)
333 return -1;
334 if (bounded)
335 isl_die(ctx, isl_error_unknown,
336 "set considered bounded", return -1);
337
338 set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }");
339 bounded = isl_set_is_bounded(set);
340 isl_set_free(set);
341
342 if (bounded < 0)
343 return -1;
344 if (bounded)
345 isl_die(ctx, isl_error_unknown,
346 "set considered bounded", return -1);
347
348 return 0;
349 }
350
351 /* Construct the basic set { [i] : 5 <= i <= N } */
352 static int test_construction(isl_ctx *ctx)
353 {
354 isl_int v;
355 isl_space *dim;
356 isl_local_space *ls;
357 isl_basic_set *bset;
358 isl_constraint *c;
359
360 isl_int_init(v);
361
362 dim = isl_space_set_alloc(ctx, 1, 1);
363 bset = isl_basic_set_universe(isl_space_copy(dim));
364 ls = isl_local_space_from_space(dim);
365
366 c = isl_constraint_alloc_inequality(isl_local_space_copy(ls));
367 isl_int_set_si(v, -1);
368 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
369 isl_int_set_si(v, 1);
370 isl_constraint_set_coefficient(c, isl_dim_param, 0, v);
371 bset = isl_basic_set_add_constraint(bset, c);
372
373 c = isl_constraint_alloc_inequality(isl_local_space_copy(ls));
374 isl_int_set_si(v, 1);
375 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
376 isl_int_set_si(v, -5);
377 isl_constraint_set_constant(c, v);
378 bset = isl_basic_set_add_constraint(bset, c);
379
380 isl_local_space_free(ls);
381 isl_basic_set_free(bset);
382
383 isl_int_clear(v);
384
385 return 0;
386 }
387
388 static int test_dim(isl_ctx *ctx)
389 {
390 const char *str;
391 isl_map *map1, *map2;
392 int equal;
393
394 map1 = isl_map_read_from_str(ctx,
395 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
396 map1 = isl_map_add_dims(map1, isl_dim_in, 1);
397 map2 = isl_map_read_from_str(ctx,
398 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
399 equal = isl_map_is_equal(map1, map2);
400 isl_map_free(map2);
401
402 map1 = isl_map_project_out(map1, isl_dim_in, 0, 1);
403 map2 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : n >= 0 }");
404 if (equal >= 0 && equal)
405 equal = isl_map_is_equal(map1, map2);
406
407 isl_map_free(map1);
408 isl_map_free(map2);
409
410 if (equal < 0)
411 return -1;
412 if (!equal)
413 isl_die(ctx, isl_error_unknown,
414 "unexpected result", return -1);
415
416 str = "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
417 map1 = isl_map_read_from_str(ctx, str);
418 str = "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
419 map2 = isl_map_read_from_str(ctx, str);
420 map1 = isl_map_move_dims(map1, isl_dim_out, 0, isl_dim_param, 0, 1);
421 equal = isl_map_is_equal(map1, map2);
422 isl_map_free(map1);
423 isl_map_free(map2);
424
425 if (equal < 0)
426 return -1;
427 if (!equal)
428 isl_die(ctx, isl_error_unknown,
429 "unexpected result", return -1);
430
431 return 0;
432 }
433
434 struct {
435 __isl_give isl_val *(*op)(__isl_take isl_val *v);
436 const char *arg;
437 const char *res;
438 } val_un_tests[] = {
439 { &isl_val_neg, "0", "0" },
440 { &isl_val_abs, "0", "0" },
441 { &isl_val_2exp, "0", "1" },
442 { &isl_val_floor, "0", "0" },
443 { &isl_val_ceil, "0", "0" },
444 { &isl_val_neg, "1", "-1" },
445 { &isl_val_neg, "-1", "1" },
446 { &isl_val_neg, "1/2", "-1/2" },
447 { &isl_val_neg, "-1/2", "1/2" },
448 { &isl_val_neg, "infty", "-infty" },
449 { &isl_val_neg, "-infty", "infty" },
450 { &isl_val_neg, "NaN", "NaN" },
451 { &isl_val_abs, "1", "1" },
452 { &isl_val_abs, "-1", "1" },
453 { &isl_val_abs, "1/2", "1/2" },
454 { &isl_val_abs, "-1/2", "1/2" },
455 { &isl_val_abs, "infty", "infty" },
456 { &isl_val_abs, "-infty", "infty" },
457 { &isl_val_abs, "NaN", "NaN" },
458 { &isl_val_floor, "1", "1" },
459 { &isl_val_floor, "-1", "-1" },
460 { &isl_val_floor, "1/2", "0" },
461 { &isl_val_floor, "-1/2", "-1" },
462 { &isl_val_floor, "infty", "infty" },
463 { &isl_val_floor, "-infty", "-infty" },
464 { &isl_val_floor, "NaN", "NaN" },
465 { &isl_val_ceil, "1", "1" },
466 { &isl_val_ceil, "-1", "-1" },
467 { &isl_val_ceil, "1/2", "1" },
468 { &isl_val_ceil, "-1/2", "0" },
469 { &isl_val_ceil, "infty", "infty" },
470 { &isl_val_ceil, "-infty", "-infty" },
471 { &isl_val_ceil, "NaN", "NaN" },
472 { &isl_val_2exp, "-3", "1/8" },
473 { &isl_val_2exp, "-1", "1/2" },
474 { &isl_val_2exp, "1", "2" },
475 { &isl_val_2exp, "2", "4" },
476 { &isl_val_2exp, "3", "8" },
477 { &isl_val_inv, "1", "1" },
478 { &isl_val_inv, "2", "1/2" },
479 { &isl_val_inv, "1/2", "2" },
480 { &isl_val_inv, "-2", "-1/2" },
481 { &isl_val_inv, "-1/2", "-2" },
482 { &isl_val_inv, "0", "NaN" },
483 { &isl_val_inv, "NaN", "NaN" },
484 { &isl_val_inv, "infty", "0" },
485 { &isl_val_inv, "-infty", "0" },
486 };
487
488 /* Perform some basic tests of unary operations on isl_val objects.
489 */
490 static int test_un_val(isl_ctx *ctx)
491 {
492 int i;
493 isl_val *v, *res;
494 __isl_give isl_val *(*fn)(__isl_take isl_val *v);
495 int ok;
496
497 for (i = 0; i < ARRAY_SIZE(val_un_tests); ++i) {
498 v = isl_val_read_from_str(ctx, val_un_tests[i].arg);
499 res = isl_val_read_from_str(ctx, val_un_tests[i].res);
500 fn = val_un_tests[i].op;
501 v = fn(v);
502 if (isl_val_is_nan(res))
503 ok = isl_val_is_nan(v);
504 else
505 ok = isl_val_eq(v, res);
506 isl_val_free(v);
507 isl_val_free(res);
508 if (ok < 0)
509 return -1;
510 if (!ok)
511 isl_die(ctx, isl_error_unknown,
512 "unexpected result", return -1);
513 }
514
515 return 0;
516 }
517
518 struct {
519 __isl_give isl_val *(*fn)(__isl_take isl_val *v1,
520 __isl_take isl_val *v2);
521 } val_bin_op[] = {
522 ['+'] = { &isl_val_add },
523 ['-'] = { &isl_val_sub },
524 ['*'] = { &isl_val_mul },
525 ['/'] = { &isl_val_div },
526 ['g'] = { &isl_val_gcd },
527 ['m'] = { &isl_val_min },
528 ['M'] = { &isl_val_max },
529 };
530
531 struct {
532 const char *arg1;
533 unsigned char op;
534 const char *arg2;
535 const char *res;
536 } val_bin_tests[] = {
537 { "0", '+', "0", "0" },
538 { "1", '+', "0", "1" },
539 { "1", '+', "1", "2" },
540 { "1", '-', "1", "0" },
541 { "1", '*', "1", "1" },
542 { "1", '/', "1", "1" },
543 { "2", '*', "3", "6" },
544 { "2", '*', "1/2", "1" },
545 { "2", '*', "1/3", "2/3" },
546 { "2/3", '*', "3/5", "2/5" },
547 { "2/3", '*', "7/5", "14/15" },
548 { "2", '/', "1/2", "4" },
549 { "-2", '/', "-1/2", "4" },
550 { "-2", '/', "1/2", "-4" },
551 { "2", '/', "-1/2", "-4" },
552 { "2", '/', "2", "1" },
553 { "2", '/', "3", "2/3" },
554 { "2/3", '/', "5/3", "2/5" },
555 { "2/3", '/', "5/7", "14/15" },
556 { "0", '/', "0", "NaN" },
557 { "42", '/', "0", "NaN" },
558 { "-42", '/', "0", "NaN" },
559 { "infty", '/', "0", "NaN" },
560 { "-infty", '/', "0", "NaN" },
561 { "NaN", '/', "0", "NaN" },
562 { "0", '/', "NaN", "NaN" },
563 { "42", '/', "NaN", "NaN" },
564 { "-42", '/', "NaN", "NaN" },
565 { "infty", '/', "NaN", "NaN" },
566 { "-infty", '/', "NaN", "NaN" },
567 { "NaN", '/', "NaN", "NaN" },
568 { "0", '/', "infty", "0" },
569 { "42", '/', "infty", "0" },
570 { "-42", '/', "infty", "0" },
571 { "infty", '/', "infty", "NaN" },
572 { "-infty", '/', "infty", "NaN" },
573 { "NaN", '/', "infty", "NaN" },
574 { "0", '/', "-infty", "0" },
575 { "42", '/', "-infty", "0" },
576 { "-42", '/', "-infty", "0" },
577 { "infty", '/', "-infty", "NaN" },
578 { "-infty", '/', "-infty", "NaN" },
579 { "NaN", '/', "-infty", "NaN" },
580 { "1", '-', "1/3", "2/3" },
581 { "1/3", '+', "1/2", "5/6" },
582 { "1/2", '+', "1/2", "1" },
583 { "3/4", '-', "1/4", "1/2" },
584 { "1/2", '-', "1/3", "1/6" },
585 { "infty", '+', "42", "infty" },
586 { "infty", '+', "infty", "infty" },
587 { "42", '+', "infty", "infty" },
588 { "infty", '-', "infty", "NaN" },
589 { "infty", '*', "infty", "infty" },
590 { "infty", '*', "-infty", "-infty" },
591 { "-infty", '*', "infty", "-infty" },
592 { "-infty", '*', "-infty", "infty" },
593 { "0", '*', "infty", "NaN" },
594 { "1", '*', "infty", "infty" },
595 { "infty", '*', "0", "NaN" },
596 { "infty", '*', "42", "infty" },
597 { "42", '-', "infty", "-infty" },
598 { "infty", '+', "-infty", "NaN" },
599 { "4", 'g', "6", "2" },
600 { "5", 'g', "6", "1" },
601 { "42", 'm', "3", "3" },
602 { "42", 'M', "3", "42" },
603 { "3", 'm', "42", "3" },
604 { "3", 'M', "42", "42" },
605 { "42", 'm', "infty", "42" },
606 { "42", 'M', "infty", "infty" },
607 { "42", 'm', "-infty", "-infty" },
608 { "42", 'M', "-infty", "42" },
609 { "42", 'm', "NaN", "NaN" },
610 { "42", 'M', "NaN", "NaN" },
611 { "infty", 'm', "-infty", "-infty" },
612 { "infty", 'M', "-infty", "infty" },
613 };
614
615 /* Perform some basic tests of binary operations on isl_val objects.
616 */
617 static int test_bin_val(isl_ctx *ctx)
618 {
619 int i;
620 isl_val *v1, *v2, *res;
621 __isl_give isl_val *(*fn)(__isl_take isl_val *v1,
622 __isl_take isl_val *v2);
623 int ok;
624
625 for (i = 0; i < ARRAY_SIZE(val_bin_tests); ++i) {
626 v1 = isl_val_read_from_str(ctx, val_bin_tests[i].arg1);
627 v2 = isl_val_read_from_str(ctx, val_bin_tests[i].arg2);
628 res = isl_val_read_from_str(ctx, val_bin_tests[i].res);
629 fn = val_bin_op[val_bin_tests[i].op].fn;
630 v1 = fn(v1, v2);
631 if (isl_val_is_nan(res))
632 ok = isl_val_is_nan(v1);
633 else
634 ok = isl_val_eq(v1, res);
635 isl_val_free(v1);
636 isl_val_free(res);
637 if (ok < 0)
638 return -1;
639 if (!ok)
640 isl_die(ctx, isl_error_unknown,
641 "unexpected result", return -1);
642 }
643
644 return 0;
645 }
646
647 /* Perform some basic tests on isl_val objects.
648 */
649 static int test_val(isl_ctx *ctx)
650 {
651 if (test_un_val(ctx) < 0)
652 return -1;
653 if (test_bin_val(ctx) < 0)
654 return -1;
655 return 0;
656 }
657
658 static int test_div(isl_ctx *ctx)
659 {
660 unsigned n;
661 const char *str;
662 int empty;
663 isl_int v;
664 isl_space *dim;
665 isl_set *set;
666 isl_local_space *ls;
667 struct isl_basic_set *bset;
668 struct isl_constraint *c;
669
670 isl_int_init(v);
671
672 /* test 1 */
673 dim = isl_space_set_alloc(ctx, 0, 3);
674 bset = isl_basic_set_universe(isl_space_copy(dim));
675 ls = isl_local_space_from_space(dim);
676
677 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
678 isl_int_set_si(v, -1);
679 isl_constraint_set_constant(c, v);
680 isl_int_set_si(v, 1);
681 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
682 isl_int_set_si(v, 3);
683 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
684 bset = isl_basic_set_add_constraint(bset, c);
685
686 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
687 isl_int_set_si(v, 1);
688 isl_constraint_set_constant(c, v);
689 isl_int_set_si(v, -1);
690 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
691 isl_int_set_si(v, 3);
692 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
693 bset = isl_basic_set_add_constraint(bset, c);
694
695 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
696
697 assert(bset && bset->n_div == 1);
698 isl_local_space_free(ls);
699 isl_basic_set_free(bset);
700
701 /* test 2 */
702 dim = isl_space_set_alloc(ctx, 0, 3);
703 bset = isl_basic_set_universe(isl_space_copy(dim));
704 ls = isl_local_space_from_space(dim);
705
706 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
707 isl_int_set_si(v, 1);
708 isl_constraint_set_constant(c, v);
709 isl_int_set_si(v, -1);
710 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
711 isl_int_set_si(v, 3);
712 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
713 bset = isl_basic_set_add_constraint(bset, c);
714
715 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
716 isl_int_set_si(v, -1);
717 isl_constraint_set_constant(c, v);
718 isl_int_set_si(v, 1);
719 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
720 isl_int_set_si(v, 3);
721 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
722 bset = isl_basic_set_add_constraint(bset, c);
723
724 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
725
726 assert(bset && bset->n_div == 1);
727 isl_local_space_free(ls);
728 isl_basic_set_free(bset);
729
730 /* test 3 */
731 dim = isl_space_set_alloc(ctx, 0, 3);
732 bset = isl_basic_set_universe(isl_space_copy(dim));
733 ls = isl_local_space_from_space(dim);
734
735 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
736 isl_int_set_si(v, 1);
737 isl_constraint_set_constant(c, v);
738 isl_int_set_si(v, -1);
739 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
740 isl_int_set_si(v, 3);
741 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
742 bset = isl_basic_set_add_constraint(bset, c);
743
744 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
745 isl_int_set_si(v, -3);
746 isl_constraint_set_constant(c, v);
747 isl_int_set_si(v, 1);
748 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
749 isl_int_set_si(v, 4);
750 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
751 bset = isl_basic_set_add_constraint(bset, c);
752
753 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
754
755 assert(bset && bset->n_div == 1);
756 isl_local_space_free(ls);
757 isl_basic_set_free(bset);
758
759 /* test 4 */
760 dim = isl_space_set_alloc(ctx, 0, 3);
761 bset = isl_basic_set_universe(isl_space_copy(dim));
762 ls = isl_local_space_from_space(dim);
763
764 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
765 isl_int_set_si(v, 2);
766 isl_constraint_set_constant(c, v);
767 isl_int_set_si(v, -1);
768 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
769 isl_int_set_si(v, 3);
770 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
771 bset = isl_basic_set_add_constraint(bset, c);
772
773 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
774 isl_int_set_si(v, -1);
775 isl_constraint_set_constant(c, v);
776 isl_int_set_si(v, 1);
777 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
778 isl_int_set_si(v, 6);
779 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
780 bset = isl_basic_set_add_constraint(bset, c);
781
782 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
783
784 assert(isl_basic_set_is_empty(bset));
785 isl_local_space_free(ls);
786 isl_basic_set_free(bset);
787
788 /* test 5 */
789 dim = isl_space_set_alloc(ctx, 0, 3);
790 bset = isl_basic_set_universe(isl_space_copy(dim));
791 ls = isl_local_space_from_space(dim);
792
793 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
794 isl_int_set_si(v, -1);
795 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
796 isl_int_set_si(v, 3);
797 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
798 bset = isl_basic_set_add_constraint(bset, c);
799
800 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
801 isl_int_set_si(v, 1);
802 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
803 isl_int_set_si(v, -3);
804 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
805 bset = isl_basic_set_add_constraint(bset, c);
806
807 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
808
809 assert(bset && bset->n_div == 0);
810 isl_basic_set_free(bset);
811 isl_local_space_free(ls);
812
813 /* test 6 */
814 dim = isl_space_set_alloc(ctx, 0, 3);
815 bset = isl_basic_set_universe(isl_space_copy(dim));
816 ls = isl_local_space_from_space(dim);
817
818 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
819 isl_int_set_si(v, -1);
820 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
821 isl_int_set_si(v, 6);
822 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
823 bset = isl_basic_set_add_constraint(bset, c);
824
825 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
826 isl_int_set_si(v, 1);
827 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
828 isl_int_set_si(v, -3);
829 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
830 bset = isl_basic_set_add_constraint(bset, c);
831
832 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
833
834 assert(bset && bset->n_div == 1);
835 isl_basic_set_free(bset);
836 isl_local_space_free(ls);
837
838 /* test 7 */
839 /* This test is a bit tricky. We set up an equality
840 * a + 3b + 3c = 6 e0
841 * Normalization of divs creates _two_ divs
842 * a = 3 e0
843 * c - b - e0 = 2 e1
844 * Afterwards e0 is removed again because it has coefficient -1
845 * and we end up with the original equality and div again.
846 * Perhaps we can avoid the introduction of this temporary div.
847 */
848 dim = isl_space_set_alloc(ctx, 0, 4);
849 bset = isl_basic_set_universe(isl_space_copy(dim));
850 ls = isl_local_space_from_space(dim);
851
852 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
853 isl_int_set_si(v, -1);
854 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
855 isl_int_set_si(v, -3);
856 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
857 isl_int_set_si(v, -3);
858 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
859 isl_int_set_si(v, 6);
860 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
861 bset = isl_basic_set_add_constraint(bset, c);
862
863 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
864
865 /* Test disabled for now */
866 /*
867 assert(bset && bset->n_div == 1);
868 */
869 isl_local_space_free(ls);
870 isl_basic_set_free(bset);
871
872 /* test 8 */
873 dim = isl_space_set_alloc(ctx, 0, 5);
874 bset = isl_basic_set_universe(isl_space_copy(dim));
875 ls = isl_local_space_from_space(dim);
876
877 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
878 isl_int_set_si(v, -1);
879 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
880 isl_int_set_si(v, -3);
881 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
882 isl_int_set_si(v, -3);
883 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
884 isl_int_set_si(v, 6);
885 isl_constraint_set_coefficient(c, isl_dim_set, 4, v);
886 bset = isl_basic_set_add_constraint(bset, c);
887
888 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
889 isl_int_set_si(v, -1);
890 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
891 isl_int_set_si(v, 1);
892 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
893 isl_int_set_si(v, 1);
894 isl_constraint_set_constant(c, v);
895 bset = isl_basic_set_add_constraint(bset, c);
896
897 bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1);
898
899 /* Test disabled for now */
900 /*
901 assert(bset && bset->n_div == 1);
902 */
903 isl_local_space_free(ls);
904 isl_basic_set_free(bset);
905
906 /* test 9 */
907 dim = isl_space_set_alloc(ctx, 0, 4);
908 bset = isl_basic_set_universe(isl_space_copy(dim));
909 ls = isl_local_space_from_space(dim);
910
911 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
912 isl_int_set_si(v, 1);
913 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
914 isl_int_set_si(v, -1);
915 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
916 isl_int_set_si(v, -2);
917 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
918 bset = isl_basic_set_add_constraint(bset, c);
919
920 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
921 isl_int_set_si(v, -1);
922 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
923 isl_int_set_si(v, 3);
924 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
925 isl_int_set_si(v, 2);
926 isl_constraint_set_constant(c, v);
927 bset = isl_basic_set_add_constraint(bset, c);
928
929 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2);
930
931 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
932
933 assert(!isl_basic_set_is_empty(bset));
934
935 isl_local_space_free(ls);
936 isl_basic_set_free(bset);
937
938 /* test 10 */
939 dim = isl_space_set_alloc(ctx, 0, 3);
940 bset = isl_basic_set_universe(isl_space_copy(dim));
941 ls = isl_local_space_from_space(dim);
942
943 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
944 isl_int_set_si(v, 1);
945 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
946 isl_int_set_si(v, -2);
947 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
948 bset = isl_basic_set_add_constraint(bset, c);
949
950 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
951
952 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
953
954 isl_local_space_free(ls);
955 isl_basic_set_free(bset);
956
957 isl_int_clear(v);
958
959 str = "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
960 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
961 set = isl_set_read_from_str(ctx, str);
962 set = isl_set_compute_divs(set);
963 isl_set_free(set);
964 if (!set)
965 return -1;
966
967 str = "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
968 bset = isl_basic_set_read_from_str(ctx, str);
969 n = isl_basic_set_dim(bset, isl_dim_div);
970 isl_basic_set_free(bset);
971 if (!bset)
972 return -1;
973 if (n != 0)
974 isl_die(ctx, isl_error_unknown,
975 "expecting no existentials", return -1);
976
977 str = "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
978 set = isl_set_read_from_str(ctx, str);
979 set = isl_set_remove_divs_involving_dims(set, isl_dim_set, 0, 2);
980 set = isl_set_fix_si(set, isl_dim_set, 2, -3);
981 empty = isl_set_is_empty(set);
982 isl_set_free(set);
983 if (empty < 0)
984 return -1;
985 if (!empty)
986 isl_die(ctx, isl_error_unknown,
987 "result not as accurate as expected", return -1);
988
989 return 0;
990 }
991
992 void test_application_case(struct isl_ctx *ctx, const char *name)
993 {
994 char *filename;
995 FILE *input;
996 struct isl_basic_set *bset1, *bset2;
997 struct isl_basic_map *bmap;
998
999 filename = get_filename(ctx, name, "omega");
1000 assert(filename);
1001 input = fopen(filename, "r");
1002 assert(input);
1003
1004 bset1 = isl_basic_set_read_from_file(ctx, input);
1005 bmap = isl_basic_map_read_from_file(ctx, input);
1006
1007 bset1 = isl_basic_set_apply(bset1, bmap);
1008
1009 bset2 = isl_basic_set_read_from_file(ctx, input);
1010
1011 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
1012
1013 isl_basic_set_free(bset1);
1014 isl_basic_set_free(bset2);
1015 free(filename);
1016
1017 fclose(input);
1018 }
1019
1020 static int test_application(isl_ctx *ctx)
1021 {
1022 test_application_case(ctx, "application");
1023 test_application_case(ctx, "application2");
1024
1025 return 0;
1026 }
1027
1028 void test_affine_hull_case(struct isl_ctx *ctx, const char *name)
1029 {
1030 char *filename;
1031 FILE *input;
1032 struct isl_basic_set *bset1, *bset2;
1033
1034 filename = get_filename(ctx, name, "polylib");
1035 assert(filename);
1036 input = fopen(filename, "r");
1037 assert(input);
1038
1039 bset1 = isl_basic_set_read_from_file(ctx, input);
1040 bset2 = isl_basic_set_read_from_file(ctx, input);
1041
1042 bset1 = isl_basic_set_affine_hull(bset1);
1043
1044 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
1045
1046 isl_basic_set_free(bset1);
1047 isl_basic_set_free(bset2);
1048 free(filename);
1049
1050 fclose(input);
1051 }
1052
1053 int test_affine_hull(struct isl_ctx *ctx)
1054 {
1055 const char *str;
1056 isl_set *set;
1057 isl_basic_set *bset, *bset2;
1058 int n;
1059 int subset;
1060
1061 test_affine_hull_case(ctx, "affine2");
1062 test_affine_hull_case(ctx, "affine");
1063 test_affine_hull_case(ctx, "affine3");
1064
1065 str = "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
1066 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1067 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1068 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1069 set = isl_set_read_from_str(ctx, str);
1070 bset = isl_set_affine_hull(set);
1071 n = isl_basic_set_dim(bset, isl_dim_div);
1072 isl_basic_set_free(bset);
1073 if (n != 0)
1074 isl_die(ctx, isl_error_unknown, "not expecting any divs",
1075 return -1);
1076
1077 /* Check that isl_map_affine_hull is not confused by
1078 * the reordering of divs in isl_map_align_divs.
1079 */
1080 str = "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1081 "32e0 = b and 32e1 = c); "
1082 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1083 set = isl_set_read_from_str(ctx, str);
1084 bset = isl_set_affine_hull(set);
1085 isl_basic_set_free(bset);
1086 if (!bset)
1087 return -1;
1088
1089 str = "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1090 "32e2 = 31 + 31e0 }";
1091 set = isl_set_read_from_str(ctx, str);
1092 bset = isl_set_affine_hull(set);
1093 str = "{ [a] : exists e : a = 32 e }";
1094 bset2 = isl_basic_set_read_from_str(ctx, str);
1095 subset = isl_basic_set_is_subset(bset, bset2);
1096 isl_basic_set_free(bset);
1097 isl_basic_set_free(bset2);
1098 if (subset < 0)
1099 return -1;
1100 if (!subset)
1101 isl_die(ctx, isl_error_unknown, "not as accurate as expected",
1102 return -1);
1103
1104 return 0;
1105 }
1106
1107 void test_convex_hull_case(struct isl_ctx *ctx, const char *name)
1108 {
1109 char *filename;
1110 FILE *input;
1111 struct isl_basic_set *bset1, *bset2;
1112 struct isl_set *set;
1113
1114 filename = get_filename(ctx, name, "polylib");
1115 assert(filename);
1116 input = fopen(filename, "r");
1117 assert(input);
1118
1119 bset1 = isl_basic_set_read_from_file(ctx, input);
1120 bset2 = isl_basic_set_read_from_file(ctx, input);
1121
1122 set = isl_basic_set_union(bset1, bset2);
1123 bset1 = isl_set_convex_hull(set);
1124
1125 bset2 = isl_basic_set_read_from_file(ctx, input);
1126
1127 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
1128
1129 isl_basic_set_free(bset1);
1130 isl_basic_set_free(bset2);
1131 free(filename);
1132
1133 fclose(input);
1134 }
1135
1136 struct {
1137 const char *set;
1138 const char *hull;
1139 } convex_hull_tests[] = {
1140 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1141 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1142 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1143 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1144 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1145 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1146 "i2 <= 5 and i2 >= 4; "
1147 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1148 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1149 "i2 <= 5 + i0 and i2 >= i0 }" },
1150 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1151 "{ [x, y] : 1 = 0 }" },
1152 };
1153
1154 static int test_convex_hull_algo(isl_ctx *ctx, int convex)
1155 {
1156 int i;
1157 int orig_convex = ctx->opt->convex;
1158 ctx->opt->convex = convex;
1159
1160 test_convex_hull_case(ctx, "convex0");
1161 test_convex_hull_case(ctx, "convex1");
1162 test_convex_hull_case(ctx, "convex2");
1163 test_convex_hull_case(ctx, "convex3");
1164 test_convex_hull_case(ctx, "convex4");
1165 test_convex_hull_case(ctx, "convex5");
1166 test_convex_hull_case(ctx, "convex6");
1167 test_convex_hull_case(ctx, "convex7");
1168 test_convex_hull_case(ctx, "convex8");
1169 test_convex_hull_case(ctx, "convex9");
1170 test_convex_hull_case(ctx, "convex10");
1171 test_convex_hull_case(ctx, "convex11");
1172 test_convex_hull_case(ctx, "convex12");
1173 test_convex_hull_case(ctx, "convex13");
1174 test_convex_hull_case(ctx, "convex14");
1175 test_convex_hull_case(ctx, "convex15");
1176
1177 for (i = 0; i < ARRAY_SIZE(convex_hull_tests); ++i) {
1178 isl_set *set1, *set2;
1179 int equal;
1180
1181 set1 = isl_set_read_from_str(ctx, convex_hull_tests[i].set);
1182 set2 = isl_set_read_from_str(ctx, convex_hull_tests[i].hull);
1183 set1 = isl_set_from_basic_set(isl_set_convex_hull(set1));
1184 equal = isl_set_is_equal(set1, set2);
1185 isl_set_free(set1);
1186 isl_set_free(set2);
1187
1188 if (equal < 0)
1189 return -1;
1190 if (!equal)
1191 isl_die(ctx, isl_error_unknown,
1192 "unexpected convex hull", return -1);
1193 }
1194
1195 ctx->opt->convex = orig_convex;
1196
1197 return 0;
1198 }
1199
1200 static int test_convex_hull(isl_ctx *ctx)
1201 {
1202 if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM) < 0)
1203 return -1;
1204 if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP) < 0)
1205 return -1;
1206 return 0;
1207 }
1208
1209 void test_gist_case(struct isl_ctx *ctx, const char *name)
1210 {
1211 char *filename;
1212 FILE *input;
1213 struct isl_basic_set *bset1, *bset2;
1214
1215 filename = get_filename(ctx, name, "polylib");
1216 assert(filename);
1217 input = fopen(filename, "r");
1218 assert(input);
1219
1220 bset1 = isl_basic_set_read_from_file(ctx, input);
1221 bset2 = isl_basic_set_read_from_file(ctx, input);
1222
1223 bset1 = isl_basic_set_gist(bset1, bset2);
1224
1225 bset2 = isl_basic_set_read_from_file(ctx, input);
1226
1227 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
1228
1229 isl_basic_set_free(bset1);
1230 isl_basic_set_free(bset2);
1231 free(filename);
1232
1233 fclose(input);
1234 }
1235
1236 struct {
1237 const char *set;
1238 const char *context;
1239 const char *gist;
1240 } gist_tests[] = {
1241 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1242 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1243 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1244 "{ [a, b, c] : a <= 15 }" },
1245 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1246 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1247 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1248 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1249 { "{ [m, n, a, b] : a <= 2147 + n }",
1250 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1251 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1252 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1253 "b >= 0) }",
1254 "{ [m, n, ku, kl] }" },
1255 };
1256
1257 static int test_gist(struct isl_ctx *ctx)
1258 {
1259 int i;
1260 const char *str;
1261 isl_basic_set *bset1, *bset2;
1262 isl_map *map1, *map2;
1263 int equal;
1264
1265 for (i = 0; i < ARRAY_SIZE(gist_tests); ++i) {
1266 int equal_input;
1267 isl_set *set1, *set2, *copy;
1268
1269 set1 = isl_set_read_from_str(ctx, gist_tests[i].set);
1270 set2 = isl_set_read_from_str(ctx, gist_tests[i].context);
1271 copy = isl_set_copy(set1);
1272 set1 = isl_set_gist(set1, set2);
1273 set2 = isl_set_read_from_str(ctx, gist_tests[i].gist);
1274 equal = isl_set_is_equal(set1, set2);
1275 isl_set_free(set1);
1276 isl_set_free(set2);
1277 set1 = isl_set_read_from_str(ctx, gist_tests[i].set);
1278 equal_input = isl_set_is_equal(set1, copy);
1279 isl_set_free(set1);
1280 isl_set_free(copy);
1281 if (equal < 0 || equal_input < 0)
1282 return -1;
1283 if (!equal)
1284 isl_die(ctx, isl_error_unknown,
1285 "incorrect gist result", return -1);
1286 if (!equal_input)
1287 isl_die(ctx, isl_error_unknown,
1288 "gist modified input", return -1);
1289 }
1290
1291 test_gist_case(ctx, "gist1");
1292
1293 str = "[p0, p2, p3, p5, p6, p10] -> { [] : "
1294 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1295 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1296 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1297 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1298 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1299 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1300 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1301 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1302 bset1 = isl_basic_set_read_from_str(ctx, str);
1303 str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1304 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1305 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1306 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1307 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1308 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1309 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1310 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1311 bset2 = isl_basic_set_read_from_str(ctx, str);
1312 bset1 = isl_basic_set_gist(bset1, bset2);
1313 assert(bset1 && bset1->n_div == 0);
1314 isl_basic_set_free(bset1);
1315
1316 /* Check that the integer divisions of the second disjunct
1317 * do not spread to the first disjunct.
1318 */
1319 str = "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1320 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1321 "(exists (e0 = [(-1 + t1)/16], "
1322 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1323 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1324 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1325 "o0 <= 4294967295 and t1 <= -1)) }";
1326 map1 = isl_map_read_from_str(ctx, str);
1327 str = "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1328 map2 = isl_map_read_from_str(ctx, str);
1329 map1 = isl_map_gist(map1, map2);
1330 if (!map1)
1331 return -1;
1332 if (map1->n != 1)
1333 isl_die(ctx, isl_error_unknown, "expecting single disjunct",
1334 isl_map_free(map1); return -1);
1335 if (isl_basic_map_dim(map1->p[0], isl_dim_div) != 1)
1336 isl_die(ctx, isl_error_unknown, "expecting single div",
1337 isl_map_free(map1); return -1);
1338 isl_map_free(map1);
1339
1340 return 0;
1341 }
1342
1343 int test_coalesce_set(isl_ctx *ctx, const char *str, int check_one)
1344 {
1345 isl_set *set, *set2;
1346 int equal;
1347 int one;
1348
1349 set = isl_set_read_from_str(ctx, str);
1350 set = isl_set_coalesce(set);
1351 set2 = isl_set_read_from_str(ctx, str);
1352 equal = isl_set_is_equal(set, set2);
1353 one = set && set->n == 1;
1354 isl_set_free(set);
1355 isl_set_free(set2);
1356
1357 if (equal < 0)
1358 return -1;
1359 if (!equal)
1360 isl_die(ctx, isl_error_unknown,
1361 "coalesced set not equal to input", return -1);
1362 if (check_one && !one)
1363 isl_die(ctx, isl_error_unknown,
1364 "coalesced set should not be a union", return -1);
1365
1366 return 0;
1367 }
1368
1369 /* Inputs for coalescing tests with unbounded wrapping.
1370 * "str" is a string representation of the input set.
1371 * "single_disjunct" is set if we expect the result to consist of
1372 * a single disjunct.
1373 */
1374 struct {
1375 int single_disjunct;
1376 const char *str;
1377 } coalesce_unbounded_tests[] = {
1378 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1379 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1380 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1381 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1382 "-10 <= y <= 0}" },
1383 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1384 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1385 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1386 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1387 };
1388
1389 /* Test the functionality of isl_set_coalesce with the bounded wrapping
1390 * option turned off.
1391 */
1392 int test_coalesce_unbounded_wrapping(isl_ctx *ctx)
1393 {
1394 int i;
1395 int r = 0;
1396 int bounded;
1397
1398 bounded = isl_options_get_coalesce_bounded_wrapping(ctx);
1399 isl_options_set_coalesce_bounded_wrapping(ctx, 0);
1400
1401 for (i = 0; i < ARRAY_SIZE(coalesce_unbounded_tests); ++i) {
1402 const char *str = coalesce_unbounded_tests[i].str;
1403 int check_one = coalesce_unbounded_tests[i].single_disjunct;
1404 if (test_coalesce_set(ctx, str, check_one) >= 0)
1405 continue;
1406 r = -1;
1407 break;
1408 }
1409
1410 isl_options_set_coalesce_bounded_wrapping(ctx, bounded);
1411
1412 return r;
1413 }
1414
1415 /* Inputs for coalescing tests.
1416 * "str" is a string representation of the input set.
1417 * "single_disjunct" is set if we expect the result to consist of
1418 * a single disjunct.
1419 */
1420 struct {
1421 int single_disjunct;
1422 const char *str;
1423 } coalesce_tests[] = {
1424 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1425 "y >= x & x >= 2 & 5 >= y }" },
1426 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1427 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1428 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1429 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1430 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1431 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1432 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1433 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1434 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1435 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1436 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1437 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1438 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1439 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1440 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1441 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1442 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1443 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1444 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1445 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1446 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1447 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1448 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1449 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1450 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1451 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1452 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1453 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1454 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1455 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1456 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1457 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1458 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1459 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1460 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1461 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1462 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1463 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1464 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1465 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1466 "[o0, o1, o2, o3, o4, o5, o6]] : "
1467 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1468 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1469 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1470 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1471 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1472 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1473 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1474 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1475 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1476 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1477 "o6 >= i3 + i6 - o3 and M >= 0 and "
1478 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1479 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1480 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1481 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1482 "(o0 = 0 and M >= 2 and N >= 3) or "
1483 "(M = 0 and o0 = 0 and N >= 3) }" },
1484 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1485 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1486 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1487 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1488 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1489 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1490 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1491 "(y = 3 and x = 1) }" },
1492 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1493 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1494 "i1 <= M and i3 <= M and i4 <= M) or "
1495 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1496 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1497 "i4 <= -1 + M) }" },
1498 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1499 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1500 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1501 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1502 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1503 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1504 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1505 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1506 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1507 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1508 { 0, "{ [a, b] : exists e : 2e = a and "
1509 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1510 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1511 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1512 "j >= 1 and j' <= i + j - i' and i >= 1; "
1513 "[1, 1, 1, 1] }" },
1514 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1515 "[i,j] : exists a : j = 3a }" },
1516 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1517 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1518 "a >= 3) or "
1519 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1520 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1521 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1522 "c <= 6 + 8a and a >= 3; "
1523 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1524 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1525 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1526 "[x,0] : 3 <= x <= 4 }" },
1527 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1528 "[x,0] : 4 <= x <= 5 }" },
1529 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1530 "[x,0] : 3 <= x <= 5 }" },
1531 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1532 "[x,0] : 3 <= x <= 4 }" },
1533 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1534 "i1 <= 0; "
1535 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1536 { 1, "{ [0,0]; [1,1] }" },
1537 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1538 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1539 "ii <= k;"
1540 "[k, 0, k] : k <= 6 and k >= 1 }" },
1541 { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;"
1542 "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" },
1543 { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" },
1544 { 1, "[n] -> { [1] : n >= 0;"
1545 "[x] : exists (e0 = floor((x)/2): x >= 2 and "
1546 "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" },
1547 { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): "
1548 "3e1 = y and x >= 2 and 2e0 >= -1 + x and "
1549 "2e0 <= x and 2e0 <= n);"
1550 "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and "
1551 "n >= 0) }" },
1552 { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): "
1553 "128e0 >= -134 + 127t1 and t1 >= 2 and "
1554 "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or "
1555 "t1 = 1 }" },
1556 { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and "
1557 "3e0 >= -1 + 2i and i <= 9 and i >= 1);"
1558 "[0, 0] }" },
1559 { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and "
1560 "t1 >= 13 and t1 <= 16);"
1561 "[t1] : t1 <= 15 and t1 >= 12 }" },
1562 { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" },
1563 { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" },
1564 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" },
1565 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" },
1566 { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;"
1567 "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and "
1568 "i <= 4j + 2 }" },
1569 { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or "
1570 "(exists (e0 : 3e0 = -2 + c0)) }" },
1571 { 0, "[n, b0, t0] -> "
1572 "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
1573 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1574 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1575 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1576 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and "
1577 "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and "
1578 "i8 >= -157 + i0 - 4i4 and i8 >= 0 and "
1579 "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or "
1580 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1581 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1582 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1583 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and "
1584 "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and "
1585 "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and "
1586 "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));"
1587 "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : "
1588 "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and "
1589 "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and "
1590 "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and "
1591 "i8 >= -40 + i0 and i8 <= -10 + i0)) }" },
1592 { 0, "{ [i0, i1, i2] : "
1593 "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): "
1594 "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and "
1595 "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and "
1596 "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and "
1597 "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and "
1598 "32e0 <= 31 + i0)) or "
1599 "i0 >= 0 }" },
1600 };
1601
1602 /* A specialized coalescing test case that would result
1603 * in a segmentation fault or a failed assertion in earlier versions of isl.
1604 */
1605 static int test_coalesce_special(struct isl_ctx *ctx)
1606 {
1607 const char *str;
1608 isl_map *map1, *map2;
1609
1610 str = "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1611 "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : "
1612 "(y = 201 and o1 <= 239 and o1 >= 212) or "
1613 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and "
1614 "o1 <= 239 and o1 >= 212)) or "
1615 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and "
1616 "o1 <= 241 and o1 >= 240));"
1617 "[S_L220_OUT[] -> T7[]] -> "
1618 "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : "
1619 "(y = 2 and o1 <= 241 and o1 >= 212) or "
1620 "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and "
1621 "y >= 5 and o1 <= 241 and o1 >= 212)) }";
1622 map1 = isl_map_read_from_str(ctx, str);
1623 map1 = isl_map_align_divs(map1);
1624 map1 = isl_map_coalesce(map1);
1625 str = "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1626 "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : "
1627 "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and "
1628 "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and "
1629 "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }";
1630 map2 = isl_map_read_from_str(ctx, str);
1631 map2 = isl_map_union(map2, map1);
1632 map2 = isl_map_align_divs(map2);
1633 map2 = isl_map_coalesce(map2);
1634 isl_map_free(map2);
1635 if (!map2)
1636 return -1;
1637
1638 return 0;
1639 }
1640
1641 /* Test the functionality of isl_set_coalesce.
1642 * That is, check that the output is always equal to the input
1643 * and in some cases that the result consists of a single disjunct.
1644 */
1645 static int test_coalesce(struct isl_ctx *ctx)
1646 {
1647 int i;
1648
1649 for (i = 0; i < ARRAY_SIZE(coalesce_tests); ++i) {
1650 const char *str = coalesce_tests[i].str;
1651 int check_one = coalesce_tests[i].single_disjunct;
1652 if (test_coalesce_set(ctx, str, check_one) < 0)
1653 return -1;
1654 }
1655
1656 if (test_coalesce_unbounded_wrapping(ctx) < 0)
1657 return -1;
1658 if (test_coalesce_special(ctx) < 0)
1659 return -1;
1660
1661 return 0;
1662 }
1663
1664 static int test_closure(isl_ctx *ctx)
1665 {
1666 const char *str;
1667 isl_set *dom;
1668 isl_map *up, *right;
1669 isl_map *map, *map2;
1670 int exact;
1671
1672 /* COCOA example 1 */
1673 map = isl_map_read_from_str(ctx,
1674 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1675 "1 <= i and i < n and 1 <= j and j < n or "
1676 "i2 = i + 1 and j2 = j - 1 and "
1677 "1 <= i and i < n and 2 <= j and j <= n }");
1678 map = isl_map_power(map, &exact);
1679 assert(exact);
1680 isl_map_free(map);
1681
1682 /* COCOA example 1 */
1683 map = isl_map_read_from_str(ctx,
1684 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1685 "1 <= i and i < n and 1 <= j and j < n or "
1686 "i2 = i + 1 and j2 = j - 1 and "
1687 "1 <= i and i < n and 2 <= j and j <= n }");
1688 map = isl_map_transitive_closure(map, &exact);
1689 assert(exact);
1690 map2 = isl_map_read_from_str(ctx,
1691 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1692 "1 <= i and i < n and 1 <= j and j <= n and "
1693 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1694 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1695 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1696 assert(isl_map_is_equal(map, map2));
1697 isl_map_free(map2);
1698 isl_map_free(map);
1699
1700 map = isl_map_read_from_str(ctx,
1701 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1702 " 0 <= y and y <= n }");
1703 map = isl_map_transitive_closure(map, &exact);
1704 map2 = isl_map_read_from_str(ctx,
1705 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1706 " 0 <= y and y <= n }");
1707 assert(isl_map_is_equal(map, map2));
1708 isl_map_free(map2);
1709 isl_map_free(map);
1710
1711 /* COCOA example 2 */
1712 map = isl_map_read_from_str(ctx,
1713 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1714 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1715 "i2 = i + 2 and j2 = j - 2 and "
1716 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1717 map = isl_map_transitive_closure(map, &exact);
1718 assert(exact);
1719 map2 = isl_map_read_from_str(ctx,
1720 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1721 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1722 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1723 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1724 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1725 assert(isl_map_is_equal(map, map2));
1726 isl_map_free(map);
1727 isl_map_free(map2);
1728
1729 /* COCOA Fig.2 left */
1730 map = isl_map_read_from_str(ctx,
1731 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1732 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1733 "j <= n or "
1734 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1735 "j <= 2 i - 3 and j <= n - 2 or "
1736 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1737 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1738 map = isl_map_transitive_closure(map, &exact);
1739 assert(exact);
1740 isl_map_free(map);
1741
1742 /* COCOA Fig.2 right */
1743 map = isl_map_read_from_str(ctx,
1744 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1745 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1746 "j <= n or "
1747 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1748 "j <= 2 i - 4 and j <= n - 3 or "
1749 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1750 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1751 map = isl_map_power(map, &exact);
1752 assert(exact);
1753 isl_map_free(map);
1754
1755 /* COCOA Fig.2 right */
1756 map = isl_map_read_from_str(ctx,
1757 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1758 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1759 "j <= n or "
1760 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1761 "j <= 2 i - 4 and j <= n - 3 or "
1762 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1763 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1764 map = isl_map_transitive_closure(map, &exact);
1765 assert(exact);
1766 map2 = isl_map_read_from_str(ctx,
1767 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1768 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1769 "j <= n and 3 + i + 2 j <= 3 n and "
1770 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1771 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1772 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1773 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1774 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1775 assert(isl_map_is_equal(map, map2));
1776 isl_map_free(map2);
1777 isl_map_free(map);
1778
1779 /* COCOA Fig.1 right */
1780 dom = isl_set_read_from_str(ctx,
1781 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1782 "2 x - 3 y + 3 >= 0 }");
1783 right = isl_map_read_from_str(ctx,
1784 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1785 up = isl_map_read_from_str(ctx,
1786 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1787 right = isl_map_intersect_domain(right, isl_set_copy(dom));
1788 right = isl_map_intersect_range(right, isl_set_copy(dom));
1789 up = isl_map_intersect_domain(up, isl_set_copy(dom));
1790 up = isl_map_intersect_range(up, dom);
1791 map = isl_map_union(up, right);
1792 map = isl_map_transitive_closure(map, &exact);
1793 assert(exact);
1794 map2 = isl_map_read_from_str(ctx,
1795 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1796 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1797 assert(isl_map_is_equal(map, map2));
1798 isl_map_free(map2);
1799 isl_map_free(map);
1800
1801 /* COCOA Theorem 1 counter example */
1802 map = isl_map_read_from_str(ctx,
1803 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1804 "i2 = 1 and j2 = j or "
1805 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1806 map = isl_map_transitive_closure(map, &exact);
1807 assert(exact);
1808 isl_map_free(map);
1809
1810 map = isl_map_read_from_str(ctx,
1811 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1812 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1813 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1814 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1815 map = isl_map_transitive_closure(map, &exact);
1816 assert(exact);
1817 isl_map_free(map);
1818
1819 /* Kelly et al 1996, fig 12 */
1820 map = isl_map_read_from_str(ctx,
1821 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1822 "1 <= i,j,j+1 <= n or "
1823 "j = n and j2 = 1 and i2 = i + 1 and "
1824 "1 <= i,i+1 <= n }");
1825 map = isl_map_transitive_closure(map, &exact);
1826 assert(exact);
1827 map2 = isl_map_read_from_str(ctx,
1828 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1829 "1 <= i <= n and i = i2 or "
1830 "1 <= i < i2 <= n and 1 <= j <= n and "
1831 "1 <= j2 <= n }");
1832 assert(isl_map_is_equal(map, map2));
1833 isl_map_free(map2);
1834 isl_map_free(map);
1835
1836 /* Omega's closure4 */
1837 map = isl_map_read_from_str(ctx,
1838 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1839 "1 <= x,y <= 10 or "
1840 "x2 = x + 1 and y2 = y and "
1841 "1 <= x <= 20 && 5 <= y <= 15 }");
1842 map = isl_map_transitive_closure(map, &exact);
1843 assert(exact);
1844 isl_map_free(map);
1845
1846 map = isl_map_read_from_str(ctx,
1847 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1848 map = isl_map_transitive_closure(map, &exact);
1849 assert(!exact);
1850 map2 = isl_map_read_from_str(ctx,
1851 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1852 assert(isl_map_is_equal(map, map2));
1853 isl_map_free(map);
1854 isl_map_free(map2);
1855
1856 str = "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1857 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1858 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1859 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1860 map = isl_map_read_from_str(ctx, str);
1861 map = isl_map_transitive_closure(map, &exact);
1862 assert(exact);
1863 map2 = isl_map_read_from_str(ctx, str);
1864 assert(isl_map_is_equal(map, map2));
1865 isl_map_free(map);
1866 isl_map_free(map2);
1867
1868 str = "{[0] -> [1]; [2] -> [3]}";
1869 map = isl_map_read_from_str(ctx, str);
1870 map = isl_map_transitive_closure(map, &exact);
1871 assert(exact);
1872 map2 = isl_map_read_from_str(ctx, str);
1873 assert(isl_map_is_equal(map, map2));
1874 isl_map_free(map);
1875 isl_map_free(map2);
1876
1877 str = "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1878 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1879 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1880 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1881 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1882 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1883 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1884 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1885 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1886 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1887 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1888 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1889 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1890 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1891 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1892 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1893 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1894 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1895 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1896 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1897 map = isl_map_read_from_str(ctx, str);
1898 map = isl_map_transitive_closure(map, NULL);
1899 assert(map);
1900 isl_map_free(map);
1901
1902 return 0;
1903 }
1904
1905 static int test_lex(struct isl_ctx *ctx)
1906 {
1907 isl_space *dim;
1908 isl_map *map;
1909 int empty;
1910
1911 dim = isl_space_set_alloc(ctx, 0, 0);
1912 map = isl_map_lex_le(dim);
1913 empty = isl_map_is_empty(map);
1914 isl_map_free(map);
1915
1916 if (empty < 0)
1917 return -1;
1918 if (empty)
1919 isl_die(ctx, isl_error_unknown,
1920 "expecting non-empty result", return -1);
1921
1922 return 0;
1923 }
1924
1925 static int test_lexmin(struct isl_ctx *ctx)
1926 {
1927 int equal;
1928 const char *str;
1929 isl_basic_map *bmap;
1930 isl_map *map, *map2;
1931 isl_set *set;
1932 isl_set *set2;
1933 isl_pw_multi_aff *pma;
1934
1935 str = "[p0, p1] -> { [] -> [] : "
1936 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1937 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1938 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1939 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1940 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1941 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1942 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1943 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1944 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1945 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1946 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1947 map = isl_map_read_from_str(ctx, str);
1948 map = isl_map_lexmin(map);
1949 isl_map_free(map);
1950
1951 str = "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1952 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1953 set = isl_set_read_from_str(ctx, str);
1954 set = isl_set_lexmax(set);
1955 str = "[C] -> { [obj,a,b,c] : C = 8 }";
1956 set2 = isl_set_read_from_str(ctx, str);
1957 set = isl_set_intersect(set, set2);
1958 assert(!isl_set_is_empty(set));
1959 isl_set_free(set);
1960
1961 str = "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1962 map = isl_map_read_from_str(ctx, str);
1963 map = isl_map_lexmin(map);
1964 str = "{ [x] -> [5] : 6 <= x <= 8; "
1965 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1966 map2 = isl_map_read_from_str(ctx, str);
1967 assert(isl_map_is_equal(map, map2));
1968 isl_map_free(map);
1969 isl_map_free(map2);
1970
1971 str = "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1972 map = isl_map_read_from_str(ctx, str);
1973 map2 = isl_map_copy(map);
1974 map = isl_map_lexmin(map);
1975 assert(isl_map_is_equal(map, map2));
1976 isl_map_free(map);
1977 isl_map_free(map2);
1978
1979 str = "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1980 map = isl_map_read_from_str(ctx, str);
1981 map = isl_map_lexmin(map);
1982 str = "{ [x] -> [y] : (4y = x and x >= 0) or "
1983 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1984 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1985 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1986 map2 = isl_map_read_from_str(ctx, str);
1987 assert(isl_map_is_equal(map, map2));
1988 isl_map_free(map);
1989 isl_map_free(map2);
1990
1991 str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1992 " 8i' <= i and 8i' >= -7 + i }";
1993 bmap = isl_basic_map_read_from_str(ctx, str);
1994 pma = isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap));
1995 map2 = isl_map_from_pw_multi_aff(pma);
1996 map = isl_map_from_basic_map(bmap);
1997 assert(isl_map_is_equal(map, map2));
1998 isl_map_free(map);
1999 isl_map_free(map2);
2000
2001 str = "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
2002 map = isl_map_read_from_str(ctx, str);
2003 map = isl_map_lexmin(map);
2004 str = "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
2005 map2 = isl_map_read_from_str(ctx, str);
2006 assert(isl_map_is_equal(map, map2));
2007 isl_map_free(map);
2008 isl_map_free(map2);
2009
2010 /* Check that empty pieces are properly combined. */
2011 str = "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
2012 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
2013 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }";
2014 map = isl_map_read_from_str(ctx, str);
2015 map = isl_map_lexmin(map);
2016 str = "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
2017 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
2018 "x >= 4 }";
2019 map2 = isl_map_read_from_str(ctx, str);
2020 assert(isl_map_is_equal(map, map2));
2021 isl_map_free(map);
2022 isl_map_free(map2);
2023
2024 str = "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2025 " 8i' <= i and 8i' >= -7 + i }";
2026 set = isl_set_read_from_str(ctx, str);
2027 pma = isl_set_lexmin_pw_multi_aff(isl_set_copy(set));
2028 set2 = isl_set_from_pw_multi_aff(pma);
2029 equal = isl_set_is_equal(set, set2);
2030 isl_set_free(set);
2031 isl_set_free(set2);
2032 if (equal < 0)
2033 return -1;
2034 if (!equal)
2035 isl_die(ctx, isl_error_unknown,
2036 "unexpected difference between set and "
2037 "piecewise affine expression", return -1);
2038
2039 return 0;
2040 }
2041
2042 /* Check that isl_set_min_val and isl_set_max_val compute the correct
2043 * result on non-convex inputs.
2044 */
2045 static int test_min(struct isl_ctx *ctx)
2046 {
2047 isl_set *set;
2048 isl_aff *aff;
2049 isl_val *val;
2050 int min_ok, max_ok;
2051
2052 set = isl_set_read_from_str(ctx, "{ [-1]; [1] }");
2053 aff = isl_aff_read_from_str(ctx, "{ [x] -> [x] }");
2054 val = isl_set_min_val(set, aff);
2055 min_ok = isl_val_is_negone(val);
2056 isl_val_free(val);
2057 val = isl_set_max_val(set, aff);
2058 max_ok = isl_val_is_one(val);
2059 isl_val_free(val);
2060 isl_aff_free(aff);
2061 isl_set_free(set);
2062
2063 if (min_ok < 0 || max_ok < 0)
2064 return -1;
2065 if (!min_ok)
2066 isl_die(ctx, isl_error_unknown,
2067 "unexpected minimum", return -1);
2068 if (!max_ok)
2069 isl_die(ctx, isl_error_unknown,
2070 "unexpected maximum", return -1);
2071
2072 return 0;
2073 }
2074
2075 struct must_may {
2076 isl_map *must;
2077 isl_map *may;
2078 };
2079
2080 static isl_stat collect_must_may(__isl_take isl_map *dep, int must,
2081 void *dep_user, void *user)
2082 {
2083 struct must_may *mm = (struct must_may *)user;
2084
2085 if (must)
2086 mm->must = isl_map_union(mm->must, dep);
2087 else
2088 mm->may = isl_map_union(mm->may, dep);
2089
2090 return isl_stat_ok;
2091 }
2092
2093 static int common_space(void *first, void *second)
2094 {
2095 int depth = *(int *)first;
2096 return 2 * depth;
2097 }
2098
2099 static int map_is_equal(__isl_keep isl_map *map, const char *str)
2100 {
2101 isl_map *map2;
2102 int equal;
2103
2104 if (!map)
2105 return -1;
2106
2107 map2 = isl_map_read_from_str(map->ctx, str);
2108 equal = isl_map_is_equal(map, map2);
2109 isl_map_free(map2);
2110
2111 return equal;
2112 }
2113
2114 static int map_check_equal(__isl_keep isl_map *map, const char *str)
2115 {
2116 int equal;
2117
2118 equal = map_is_equal(map, str);
2119 if (equal < 0)
2120 return -1;
2121 if (!equal)
2122 isl_die(isl_map_get_ctx(map), isl_error_unknown,
2123 "result not as expected", return -1);
2124 return 0;
2125 }
2126
2127 static int test_dep(struct isl_ctx *ctx)
2128 {
2129 const char *str;
2130 isl_space *dim;
2131 isl_map *map;
2132 isl_access_info *ai;
2133 isl_flow *flow;
2134 int depth;
2135 struct must_may mm;
2136
2137 depth = 3;
2138
2139 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2140 map = isl_map_read_from_str(ctx, str);
2141 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2142
2143 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2144 map = isl_map_read_from_str(ctx, str);
2145 ai = isl_access_info_add_source(ai, map, 1, &depth);
2146
2147 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2148 map = isl_map_read_from_str(ctx, str);
2149 ai = isl_access_info_add_source(ai, map, 1, &depth);
2150
2151 flow = isl_access_info_compute_flow(ai);
2152 dim = isl_space_alloc(ctx, 0, 3, 3);
2153 mm.must = isl_map_empty(isl_space_copy(dim));
2154 mm.may = isl_map_empty(dim);
2155
2156 isl_flow_foreach(flow, collect_must_may, &mm);
2157
2158 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
2159 " [1,10,0] -> [2,5,0] }";
2160 assert(map_is_equal(mm.must, str));
2161 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2162 assert(map_is_equal(mm.may, str));
2163
2164 isl_map_free(mm.must);
2165 isl_map_free(mm.may);
2166 isl_flow_free(flow);
2167
2168
2169 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2170 map = isl_map_read_from_str(ctx, str);
2171 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2172
2173 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2174 map = isl_map_read_from_str(ctx, str);
2175 ai = isl_access_info_add_source(ai, map, 1, &depth);
2176
2177 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2178 map = isl_map_read_from_str(ctx, str);
2179 ai = isl_access_info_add_source(ai, map, 0, &depth);
2180
2181 flow = isl_access_info_compute_flow(ai);
2182 dim = isl_space_alloc(ctx, 0, 3, 3);
2183 mm.must = isl_map_empty(isl_space_copy(dim));
2184 mm.may = isl_map_empty(dim);
2185
2186 isl_flow_foreach(flow, collect_must_may, &mm);
2187
2188 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
2189 assert(map_is_equal(mm.must, str));
2190 str = "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2191 assert(map_is_equal(mm.may, str));
2192
2193 isl_map_free(mm.must);
2194 isl_map_free(mm.may);
2195 isl_flow_free(flow);
2196
2197
2198 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2199 map = isl_map_read_from_str(ctx, str);
2200 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2201
2202 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2203 map = isl_map_read_from_str(ctx, str);
2204 ai = isl_access_info_add_source(ai, map, 0, &depth);
2205
2206 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2207 map = isl_map_read_from_str(ctx, str);
2208 ai = isl_access_info_add_source(ai, map, 0, &depth);
2209
2210 flow = isl_access_info_compute_flow(ai);
2211 dim = isl_space_alloc(ctx, 0, 3, 3);
2212 mm.must = isl_map_empty(isl_space_copy(dim));
2213 mm.may = isl_map_empty(dim);
2214
2215 isl_flow_foreach(flow, collect_must_may, &mm);
2216
2217 str = "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2218 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2219 assert(map_is_equal(mm.may, str));
2220 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2221 assert(map_is_equal(mm.must, str));
2222
2223 isl_map_free(mm.must);
2224 isl_map_free(mm.may);
2225 isl_flow_free(flow);
2226
2227
2228 str = "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2229 map = isl_map_read_from_str(ctx, str);
2230 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2231
2232 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2233 map = isl_map_read_from_str(ctx, str);
2234 ai = isl_access_info_add_source(ai, map, 0, &depth);
2235
2236 str = "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2237 map = isl_map_read_from_str(ctx, str);
2238 ai = isl_access_info_add_source(ai, map, 0, &depth);
2239
2240 flow = isl_access_info_compute_flow(ai);
2241 dim = isl_space_alloc(ctx, 0, 3, 3);
2242 mm.must = isl_map_empty(isl_space_copy(dim));
2243 mm.may = isl_map_empty(dim);
2244
2245 isl_flow_foreach(flow, collect_must_may, &mm);
2246
2247 str = "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2248 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2249 assert(map_is_equal(mm.may, str));
2250 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2251 assert(map_is_equal(mm.must, str));
2252
2253 isl_map_free(mm.must);
2254 isl_map_free(mm.may);
2255 isl_flow_free(flow);
2256
2257
2258 str = "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2259 map = isl_map_read_from_str(ctx, str);
2260 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2261
2262 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2263 map = isl_map_read_from_str(ctx, str);
2264 ai = isl_access_info_add_source(ai, map, 0, &depth);
2265
2266 str = "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2267 map = isl_map_read_from_str(ctx, str);
2268 ai = isl_access_info_add_source(ai, map, 0, &depth);
2269
2270 flow = isl_access_info_compute_flow(ai);
2271 dim = isl_space_alloc(ctx, 0, 3, 3);
2272 mm.must = isl_map_empty(isl_space_copy(dim));
2273 mm.may = isl_map_empty(dim);
2274
2275 isl_flow_foreach(flow, collect_must_may, &mm);
2276
2277 str = "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2278 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2279 assert(map_is_equal(mm.may, str));
2280 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2281 assert(map_is_equal(mm.must, str));
2282
2283 isl_map_free(mm.must);
2284 isl_map_free(mm.may);
2285 isl_flow_free(flow);
2286
2287
2288 depth = 5;
2289
2290 str = "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2291 map = isl_map_read_from_str(ctx, str);
2292 ai = isl_access_info_alloc(map, &depth, &common_space, 1);
2293
2294 str = "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2295 map = isl_map_read_from_str(ctx, str);
2296 ai = isl_access_info_add_source(ai, map, 1, &depth);
2297
2298 flow = isl_access_info_compute_flow(ai);
2299 dim = isl_space_alloc(ctx, 0, 5, 5);
2300 mm.must = isl_map_empty(isl_space_copy(dim));
2301 mm.may = isl_map_empty(dim);
2302
2303 isl_flow_foreach(flow, collect_must_may, &mm);
2304
2305 str = "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
2306 assert(map_is_equal(mm.must, str));
2307 str = "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
2308 assert(map_is_equal(mm.may, str));
2309
2310 isl_map_free(mm.must);
2311 isl_map_free(mm.may);
2312 isl_flow_free(flow);
2313
2314 return 0;
2315 }
2316
2317 /* Check that the dependence analysis proceeds without errors.
2318 * Earlier versions of isl would break down during the analysis
2319 * due to the use of the wrong spaces.
2320 */
2321 static int test_flow(isl_ctx *ctx)
2322 {
2323 const char *str;
2324 isl_union_map *access, *schedule;
2325 isl_union_map *must_dep, *may_dep;
2326 int r;
2327
2328 str = "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
2329 access = isl_union_map_read_from_str(ctx, str);
2330 str = "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
2331 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
2332 "S2[] -> [1,0,0,0]; "
2333 "S3[] -> [-1,0,0,0] }";
2334 schedule = isl_union_map_read_from_str(ctx, str);
2335 r = isl_union_map_compute_flow(access, isl_union_map_copy(access),
2336 isl_union_map_copy(access), schedule,
2337 &must_dep, &may_dep, NULL, NULL);
2338 isl_union_map_free(may_dep);
2339 isl_union_map_free(must_dep);
2340
2341 return r;
2342 }
2343
2344 struct {
2345 const char *map;
2346 int sv;
2347 } sv_tests[] = {
2348 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
2349 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
2350 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
2351 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
2352 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
2353 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
2354 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2355 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2356 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
2357 };
2358
2359 int test_sv(isl_ctx *ctx)
2360 {
2361 isl_union_map *umap;
2362 int i;
2363 int sv;
2364
2365 for (i = 0; i < ARRAY_SIZE(sv_tests); ++i) {
2366 umap = isl_union_map_read_from_str(ctx, sv_tests[i].map);
2367 sv = isl_union_map_is_single_valued(umap);
2368 isl_union_map_free(umap);
2369 if (sv < 0)
2370 return -1;
2371 if (sv_tests[i].sv && !sv)
2372 isl_die(ctx, isl_error_internal,
2373 "map not detected as single valued", return -1);
2374 if (!sv_tests[i].sv && sv)
2375 isl_die(ctx, isl_error_internal,
2376 "map detected as single valued", return -1);
2377 }
2378
2379 return 0;
2380 }
2381
2382 struct {
2383 const char *str;
2384 int bijective;
2385 } bijective_tests[] = {
2386 { "[N,M]->{[i,j] -> [i]}", 0 },
2387 { "[N,M]->{[i,j] -> [i] : j=i}", 1 },
2388 { "[N,M]->{[i,j] -> [i] : j=0}", 1 },
2389 { "[N,M]->{[i,j] -> [i] : j=N}", 1 },
2390 { "[N,M]->{[i,j] -> [j,i]}", 1 },
2391 { "[N,M]->{[i,j] -> [i+j]}", 0 },
2392 { "[N,M]->{[i,j] -> []}", 0 },
2393 { "[N,M]->{[i,j] -> [i,j,N]}", 1 },
2394 { "[N,M]->{[i,j] -> [2i]}", 0 },
2395 { "[N,M]->{[i,j] -> [i,i]}", 0 },
2396 { "[N,M]->{[i,j] -> [2i,i]}", 0 },
2397 { "[N,M]->{[i,j] -> [2i,j]}", 1 },
2398 { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 },
2399 };
2400
2401 static int test_bijective(struct isl_ctx *ctx)
2402 {
2403 isl_map *map;
2404 int i;
2405 int bijective;
2406
2407 for (i = 0; i < ARRAY_SIZE(bijective_tests); ++i) {
2408 map = isl_map_read_from_str(ctx, bijective_tests[i].str);
2409 bijective = isl_map_is_bijective(map);
2410 isl_map_free(map);
2411 if (bijective < 0)
2412 return -1;
2413 if (bijective_tests[i].bijective && !bijective)
2414 isl_die(ctx, isl_error_internal,
2415 "map not detected as bijective", return -1);
2416 if (!bijective_tests[i].bijective && bijective)
2417 isl_die(ctx, isl_error_internal,
2418 "map detected as bijective", return -1);
2419 }
2420
2421 return 0;
2422 }
2423
2424 /* Inputs for isl_pw_qpolynomial_gist tests.
2425 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
2426 */
2427 struct {
2428 const char *pwqp;
2429 const char *set;
2430 const char *gist;
2431 } pwqp_gist_tests[] = {
2432 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
2433 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
2434 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
2435 "{ [i] -> -1/2 + 1/2 * i }" },
2436 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
2437 };
2438
2439 static int test_pwqp(struct isl_ctx *ctx)
2440 {
2441 int i;
2442 const char *str;
2443 isl_set *set;
2444 isl_pw_qpolynomial *pwqp1, *pwqp2;
2445 int equal;
2446
2447 str = "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2448 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2449
2450 pwqp1 = isl_pw_qpolynomial_move_dims(pwqp1, isl_dim_param, 0,
2451 isl_dim_in, 1, 1);
2452
2453 str = "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2454 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2455
2456 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2457
2458 assert(isl_pw_qpolynomial_is_zero(pwqp1));
2459
2460 isl_pw_qpolynomial_free(pwqp1);
2461
2462 for (i = 0; i < ARRAY_SIZE(pwqp_gist_tests); ++i) {
2463 str = pwqp_gist_tests[i].pwqp;
2464 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2465 str = pwqp_gist_tests[i].set;
2466 set = isl_set_read_from_str(ctx, str);
2467 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
2468 str = pwqp_gist_tests[i].gist;
2469 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2470 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2471 equal = isl_pw_qpolynomial_is_zero(pwqp1);
2472 isl_pw_qpolynomial_free(pwqp1);
2473
2474 if (equal < 0)
2475 return -1;
2476 if (!equal)
2477 isl_die(ctx, isl_error_unknown,
2478 "unexpected result", return -1);
2479 }
2480
2481 str = "{ [i] -> ([([i/2] + [i/2])/5]) }";
2482 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2483 str = "{ [i] -> ([(2 * [i/2])/5]) }";
2484 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2485
2486 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2487
2488 assert(isl_pw_qpolynomial_is_zero(pwqp1));
2489
2490 isl_pw_qpolynomial_free(pwqp1);
2491
2492 str = "{ [x] -> ([x/2] + [(x+1)/2]) }";
2493 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2494 str = "{ [x] -> x }";
2495 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2496
2497 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2498
2499 assert(isl_pw_qpolynomial_is_zero(pwqp1));
2500
2501 isl_pw_qpolynomial_free(pwqp1);
2502
2503 str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
2504 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2505 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2506 pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1);
2507 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2508 assert(isl_pw_qpolynomial_is_zero(pwqp1));
2509 isl_pw_qpolynomial_free(pwqp1);
2510
2511 str = "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
2512 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2513 str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2514 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2515 set = isl_set_read_from_str(ctx, "{ [a,b,a] }");
2516 pwqp1 = isl_pw_qpolynomial_intersect_domain(pwqp1, set);
2517 equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2);
2518 isl_pw_qpolynomial_free(pwqp1);
2519 isl_pw_qpolynomial_free(pwqp2);
2520 if (equal < 0)
2521 return -1;
2522 if (!equal)
2523 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2524
2525 str = "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
2526 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2527 str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
2528 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2529 pwqp1 = isl_pw_qpolynomial_fix_val(pwqp1, isl_dim_set, 1,
2530 isl_val_one(ctx));
2531 equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2);
2532 isl_pw_qpolynomial_free(pwqp1);
2533 isl_pw_qpolynomial_free(pwqp2);
2534 if (equal < 0)
2535 return -1;
2536 if (!equal)
2537 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2538
2539 return 0;
2540 }
2541
2542 static int test_split_periods(isl_ctx *ctx)
2543 {
2544 const char *str;
2545 isl_pw_qpolynomial *pwqp;
2546
2547 str = "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
2548 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
2549 "U >= 0; [U,V] -> U^2 : U >= 100 }";
2550 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2551
2552 pwqp = isl_pw_qpolynomial_split_periods(pwqp, 2);
2553
2554 isl_pw_qpolynomial_free(pwqp);
2555
2556 if (!pwqp)
2557 return -1;
2558
2559 return 0;
2560 }
2561
2562 static int test_union(isl_ctx *ctx)
2563 {
2564 const char *str;
2565 isl_union_set *uset1, *uset2;
2566 isl_union_map *umap1, *umap2;
2567 int equal;
2568
2569 str = "{ [i] : 0 <= i <= 1 }";
2570 uset1 = isl_union_set_read_from_str(ctx, str);
2571 str = "{ [1] -> [0] }";
2572 umap1 = isl_union_map_read_from_str(ctx, str);
2573
2574 umap2 = isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1), uset1);
2575 equal = isl_union_map_is_equal(umap1, umap2);
2576
2577 isl_union_map_free(umap1);
2578 isl_union_map_free(umap2);
2579
2580 if (equal < 0)
2581 return -1;
2582 if (!equal)
2583 isl_die(ctx, isl_error_unknown, "union maps not equal",
2584 return -1);
2585
2586 str = "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
2587 umap1 = isl_union_map_read_from_str(ctx, str);
2588 str = "{ A[i]; B[i] }";
2589 uset1 = isl_union_set_read_from_str(ctx, str);
2590
2591 uset2 = isl_union_map_domain(umap1);
2592
2593 equal = isl_union_set_is_equal(uset1, uset2);
2594
2595 isl_union_set_free(uset1);
2596 isl_union_set_free(uset2);
2597
2598 if (equal < 0)
2599 return -1;
2600 if (!equal)
2601 isl_die(ctx, isl_error_unknown, "union sets not equal",
2602 return -1);
2603
2604 return 0;
2605 }
2606
2607 /* Check that computing a bound of a non-zero polynomial over an unbounded
2608 * domain does not produce a rational value.
2609 * In particular, check that the upper bound is infinity.
2610 */
2611 static int test_bound_unbounded_domain(isl_ctx *ctx)
2612 {
2613 const char *str;
2614 isl_pw_qpolynomial *pwqp;
2615 isl_pw_qpolynomial_fold *pwf, *pwf2;
2616 isl_bool equal;
2617
2618 str = "{ [m,n] -> -m * n }";
2619 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2620 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
2621 str = "{ infty }";
2622 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2623 pwf2 = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
2624 equal = isl_pw_qpolynomial_fold_plain_is_equal(pwf, pwf2);
2625 isl_pw_qpolynomial_fold_free(pwf);
2626 isl_pw_qpolynomial_fold_free(pwf2);
2627
2628 if (equal < 0)
2629 return -1;
2630 if (!equal)
2631 isl_die(ctx, isl_error_unknown,
2632 "expecting infinite polynomial bound", return -1);
2633
2634 return 0;
2635 }
2636
2637 static int test_bound(isl_ctx *ctx)
2638 {
2639 const char *str;
2640 unsigned dim;
2641 isl_pw_qpolynomial *pwqp;
2642 isl_pw_qpolynomial_fold *pwf;
2643
2644 if (test_bound_unbounded_domain(ctx) < 0)
2645 return -1;
2646
2647 str = "{ [[a, b, c, d] -> [e]] -> 0 }";
2648 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2649 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
2650 dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in);
2651 isl_pw_qpolynomial_fold_free(pwf);
2652 if (dim != 4)
2653 isl_die(ctx, isl_error_unknown, "unexpected input dimension",
2654 return -1);
2655
2656 str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
2657 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2658 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
2659 dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in);
2660 isl_pw_qpolynomial_fold_free(pwf);
2661 if (dim != 1)
2662 isl_die(ctx, isl_error_unknown, "unexpected input dimension",
2663 return -1);
2664
2665 return 0;
2666 }
2667
2668 static int test_lift(isl_ctx *ctx)
2669 {
2670 const char *str;
2671 isl_basic_map *bmap;
2672 isl_basic_set *bset;
2673
2674 str = "{ [i0] : exists e0 : i0 = 4e0 }";
2675 bset = isl_basic_set_read_from_str(ctx, str);
2676 bset = isl_basic_set_lift(bset);
2677 bmap = isl_basic_map_from_range(bset);
2678 bset = isl_basic_map_domain(bmap);
2679 isl_basic_set_free(bset);
2680
2681 return 0;
2682 }
2683
2684 struct {
2685 const char *set1;
2686 const char *set2;
2687 int subset;
2688 } subset_tests[] = {
2689 { "{ [112, 0] }",
2690 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
2691 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
2692 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
2693 { "{ [65] }",
2694 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
2695 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
2696 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
2697 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
2698 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
2699 "256e0 <= 255i and 256e0 >= -255 + 255i and "
2700 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
2701 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
2702 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
2703 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
2704 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
2705 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
2706 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
2707 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
2708 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
2709 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
2710 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
2711 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
2712 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
2713 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
2714 "4e0 <= -57 + i0 + i1)) or "
2715 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
2716 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
2717 "4e0 >= -61 + i0 + i1)) or "
2718 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
2719 };
2720
2721 static int test_subset(isl_ctx *ctx)
2722 {
2723 int i;
2724 isl_set *set1, *set2;
2725 int subset;
2726
2727 for (i = 0; i < ARRAY_SIZE(subset_tests); ++i) {
2728 set1 = isl_set_read_from_str(ctx, subset_tests[i].set1);
2729 set2 = isl_set_read_from_str(ctx, subset_tests[i].set2);
2730 subset = isl_set_is_subset(set1, set2);
2731 isl_set_free(set1);
2732 isl_set_free(set2);
2733 if (subset < 0)
2734 return -1;
2735 if (subset != subset_tests[i].subset)
2736 isl_die(ctx, isl_error_unknown,
2737 "incorrect subset result", return -1);
2738 }
2739
2740 return 0;
2741 }
2742
2743 struct {
2744 const char *minuend;
2745 const char *subtrahend;
2746 const char *difference;
2747 } subtract_domain_tests[] = {
2748 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
2749 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
2750 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
2751 };
2752
2753 static int test_subtract(isl_ctx *ctx)
2754 {
2755 int i;
2756 isl_union_map *umap1, *umap2;
2757 isl_union_pw_multi_aff *upma1, *upma2;
2758 isl_union_set *uset;
2759 int equal;
2760
2761 for (i = 0; i < ARRAY_SIZE(subtract_domain_tests); ++i) {
2762 umap1 = isl_union_map_read_from_str(ctx,
2763 subtract_domain_tests[i].minuend);
2764 uset = isl_union_set_read_from_str(ctx,
2765 subtract_domain_tests[i].subtrahend);
2766 umap2 = isl_union_map_read_from_str(ctx,
2767 subtract_domain_tests[i].difference);
2768 umap1 = isl_union_map_subtract_domain(umap1, uset);
2769 equal = isl_union_map_is_equal(umap1, umap2);
2770 isl_union_map_free(umap1);
2771 isl_union_map_free(umap2);
2772 if (equal < 0)
2773 return -1;
2774 if (!equal)
2775 isl_die(ctx, isl_error_unknown,
2776 "incorrect subtract domain result", return -1);
2777 }
2778
2779 for (i = 0; i < ARRAY_SIZE(subtract_domain_tests); ++i) {
2780 upma1 = isl_union_pw_multi_aff_read_from_str(ctx,
2781 subtract_domain_tests[i].minuend);
2782 uset = isl_union_set_read_from_str(ctx,
2783 subtract_domain_tests[i].subtrahend);
2784 upma2 = isl_union_pw_multi_aff_read_from_str(ctx,
2785 subtract_domain_tests[i].difference);
2786 upma1 = isl_union_pw_multi_aff_subtract_domain(upma1, uset);
2787 equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2);
2788 isl_union_pw_multi_aff_free(upma1);
2789 isl_union_pw_multi_aff_free(upma2);
2790 if (equal < 0)
2791 return -1;
2792 if (!equal)
2793 isl_die(ctx, isl_error_unknown,
2794 "incorrect subtract domain result", return -1);
2795 }
2796
2797 return 0;
2798 }
2799
2800 int test_factorize(isl_ctx *ctx)
2801 {
2802 const char *str;
2803 isl_basic_set *bset;
2804 isl_factorizer *f;
2805
2806 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
2807 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
2808 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
2809 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
2810 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
2811 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
2812 "3i5 >= -2i0 - i2 + 3i4 }";
2813 bset = isl_basic_set_read_from_str(ctx, str);
2814 f = isl_basic_set_factorizer(bset);
2815 isl_basic_set_free(bset);
2816 isl_factorizer_free(f);
2817 if (!f)
2818 isl_die(ctx, isl_error_unknown,
2819 "failed to construct factorizer", return -1);
2820
2821 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2822 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
2823 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
2824 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
2825 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
2826 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
2827 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
2828 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
2829 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
2830 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
2831 bset = isl_basic_set_read_from_str(ctx, str);
2832 f = isl_basic_set_factorizer(bset);
2833 isl_basic_set_free(bset);
2834 isl_factorizer_free(f);
2835 if (!f)
2836 isl_die(ctx, isl_error_unknown,
2837 "failed to construct factorizer", return -1);
2838
2839 return 0;
2840 }
2841
2842 static isl_stat check_injective(__isl_take isl_map *map, void *user)
2843 {
2844 int *injective = user;
2845
2846 *injective = isl_map_is_injective(map);
2847 isl_map_free(map);
2848
2849 if (*injective < 0 || !*injective)
2850 return isl_stat_error;
2851
2852 return isl_stat_ok;
2853 }
2854
2855 int test_one_schedule(isl_ctx *ctx, const char *d, const char *w,
2856 const char *r, const char *s, int tilable, int parallel)
2857 {
2858 int i;
2859 isl_union_set *D;
2860 isl_union_map *W, *R, *S;
2861 isl_union_map *empty;
2862 isl_union_map *dep_raw, *dep_war, *dep_waw, *dep;
2863 isl_union_map *validity, *proximity, *coincidence;
2864 isl_union_map *schedule;
2865 isl_union_map *test;
2866 isl_union_set *delta;
2867 isl_union_set *domain;
2868 isl_set *delta_set;
2869 isl_set *slice;
2870 isl_set *origin;
2871 isl_schedule_constraints *sc;
2872 isl_schedule *sched;
2873 int is_nonneg, is_parallel, is_tilable, is_injection, is_complete;
2874
2875 D = isl_union_set_read_from_str(ctx, d);
2876 W = isl_union_map_read_from_str(ctx, w);
2877 R = isl_union_map_read_from_str(ctx, r);
2878 S = isl_union_map_read_from_str(ctx, s);
2879
2880 W = isl_union_map_intersect_domain(W, isl_union_set_copy(D));
2881 R = isl_union_map_intersect_domain(R, isl_union_set_copy(D));
2882
2883 empty = isl_union_map_empty(isl_union_map_get_space(S));
2884 isl_union_map_compute_flow(isl_union_map_copy(R),
2885 isl_union_map_copy(W), empty,
2886 isl_union_map_copy(S),
2887 &dep_raw, NULL, NULL, NULL);
2888 isl_union_map_compute_flow(isl_union_map_copy(W),
2889 isl_union_map_copy(W),
2890 isl_union_map_copy(R),
2891 isl_union_map_copy(S),
2892 &dep_waw, &dep_war, NULL, NULL);
2893
2894 dep = isl_union_map_union(dep_waw, dep_war);
2895 dep = isl_union_map_union(dep, dep_raw);
2896 validity = isl_union_map_copy(dep);
2897 coincidence = isl_union_map_copy(dep);
2898 proximity = isl_union_map_copy(dep);
2899
2900 sc = isl_schedule_constraints_on_domain(isl_union_set_copy(D));
2901 sc = isl_schedule_constraints_set_validity(sc, validity);
2902 sc = isl_schedule_constraints_set_coincidence(sc, coincidence);
2903 sc = isl_schedule_constraints_set_proximity(sc, proximity);
2904 sched = isl_schedule_constraints_compute_schedule(sc);
2905 schedule = isl_schedule_get_map(sched);
2906 isl_schedule_free(sched);
2907 isl_union_map_free(W);
2908 isl_union_map_free(R);
2909 isl_union_map_free(S);
2910
2911 is_injection = 1;
2912 isl_union_map_foreach_map(schedule, &check_injective, &is_injection);
2913
2914 domain = isl_union_map_domain(isl_union_map_copy(schedule));
2915 is_complete = isl_union_set_is_subset(D, domain);
2916 isl_union_set_free(D);
2917 isl_union_set_free(domain);
2918
2919 test = isl_union_map_reverse(isl_union_map_copy(schedule));
2920 test = isl_union_map_apply_range(test, dep);
2921 test = isl_union_map_apply_range(test, schedule);
2922
2923 delta = isl_union_map_deltas(test);
2924 if (isl_union_set_n_set(delta) == 0) {
2925 is_tilable = 1;
2926 is_parallel = 1;
2927 is_nonneg = 1;
2928 isl_union_set_free(delta);
2929 } else {
2930 delta_set = isl_set_from_union_set(delta);
2931
2932 slice = isl_set_universe(isl_set_get_space(delta_set));
2933 for (i = 0; i < tilable; ++i)
2934 slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0);
2935 is_tilable = isl_set_is_subset(delta_set, slice);
2936 isl_set_free(slice);
2937
2938 slice = isl_set_universe(isl_set_get_space(delta_set));
2939 for (i = 0; i < parallel; ++i)
2940 slice = isl_set_fix_si(slice, isl_dim_set, i, 0);
2941 is_parallel = isl_set_is_subset(delta_set, slice);
2942 isl_set_free(slice);
2943
2944 origin = isl_set_universe(isl_set_get_space(delta_set));
2945 for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i)
2946 origin = isl_set_fix_si(origin, isl_dim_set, i, 0);
2947
2948 delta_set = isl_set_union(delta_set, isl_set_copy(origin));
2949 delta_set = isl_set_lexmin(delta_set);
2950
2951 is_nonneg = isl_set_is_equal(delta_set, origin);
2952
2953 isl_set_free(origin);
2954 isl_set_free(delta_set);
2955 }
2956
2957 if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 ||
2958 is_injection < 0 || is_complete < 0)
2959 return -1;
2960 if (!is_complete)
2961 isl_die(ctx, isl_error_unknown,
2962 "generated schedule incomplete", return -1);
2963 if (!is_injection)
2964 isl_die(ctx, isl_error_unknown,
2965 "generated schedule not injective on each statement",
2966 return -1);
2967 if (!is_nonneg)
2968 isl_die(ctx, isl_error_unknown,
2969 "negative dependences in generated schedule",
2970 return -1);
2971 if (!is_tilable)
2972 isl_die(ctx, isl_error_unknown,
2973 "generated schedule not as tilable as expected",
2974 return -1);
2975 if (!is_parallel)
2976 isl_die(ctx, isl_error_unknown,
2977 "generated schedule not as parallel as expected",
2978 return -1);
2979
2980 return 0;
2981 }
2982
2983 /* Compute a schedule for the given instance set, validity constraints,
2984 * proximity constraints and context and return a corresponding union map
2985 * representation.
2986 */
2987 static __isl_give isl_union_map *compute_schedule_with_context(isl_ctx *ctx,
2988 const char *domain, const char *validity, const char *proximity,
2989 const char *context)
2990 {
2991 isl_set *con;
2992 isl_union_set *dom;
2993 isl_union_map *dep;
2994 isl_union_map *prox;
2995 isl_schedule_constraints *sc;
2996 isl_schedule *schedule;
2997 isl_union_map *sched;
2998
2999 con = isl_set_read_from_str(ctx, context);
3000 dom = isl_union_set_read_from_str(ctx, domain);
3001 dep = isl_union_map_read_from_str(ctx, validity);
3002 prox = isl_union_map_read_from_str(ctx, proximity);
3003 sc = isl_schedule_constraints_on_domain(dom);
3004 sc = isl_schedule_constraints_set_context(sc, con);
3005 sc = isl_schedule_constraints_set_validity(sc, dep);
3006 sc = isl_schedule_constraints_set_proximity(sc, prox);
3007 schedule = isl_schedule_constraints_compute_schedule(sc);
3008 sched = isl_schedule_get_map(schedule);
3009 isl_schedule_free(schedule);
3010
3011 return sched;
3012 }
3013
3014 /* Compute a schedule for the given instance set, validity constraints and
3015 * proximity constraints and return a corresponding union map representation.
3016 */
3017 static __isl_give isl_union_map *compute_schedule(isl_ctx *ctx,
3018 const char *domain, const char *validity, const char *proximity)
3019 {
3020 return compute_schedule_with_context(ctx, domain, validity, proximity,
3021 "{ : }");
3022 }
3023
3024 /* Check that a schedule can be constructed on the given domain
3025 * with the given validity and proximity constraints.
3026 */
3027 static int test_has_schedule(isl_ctx *ctx, const char *domain,
3028 const char *validity, const char *proximity)
3029 {
3030 isl_union_map *sched;
3031
3032 sched = compute_schedule(ctx, domain, validity, proximity);
3033 if (!sched)
3034 return -1;
3035
3036 isl_union_map_free(sched);
3037 return 0;
3038 }
3039
3040 int test_special_schedule(isl_ctx *ctx, const char *domain,
3041 const char *validity, const char *proximity, const char *expected_sched)
3042 {
3043 isl_union_map *sched1, *sched2;
3044 int equal;
3045
3046 sched1 = compute_schedule(ctx, domain, validity, proximity);
3047 sched2 = isl_union_map_read_from_str(ctx, expected_sched);
3048
3049 equal = isl_union_map_is_equal(sched1, sched2);
3050 isl_union_map_free(sched1);
3051 isl_union_map_free(sched2);
3052
3053 if (equal < 0)
3054 return -1;
3055 if (!equal)
3056 isl_die(ctx, isl_error_unknown, "unexpected schedule",
3057 return -1);
3058
3059 return 0;
3060 }
3061
3062 /* Check that the schedule map is properly padded, even after being
3063 * reconstructed from the band forest.
3064 */
3065 static int test_padded_schedule(isl_ctx *ctx)
3066 {
3067 const char *str;
3068 isl_union_set *D;
3069 isl_union_map *validity, *proximity;
3070 isl_schedule_constraints *sc;
3071 isl_schedule *sched;
3072 isl_union_map *map1, *map2;
3073 isl_band_list *list;
3074 int equal;
3075
3076 str = "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
3077 D = isl_union_set_read_from_str(ctx, str);
3078 validity = isl_union_map_empty(isl_union_set_get_space(D));
3079 proximity = isl_union_map_copy(validity);
3080 sc = isl_schedule_constraints_on_domain(D);
3081 sc = isl_schedule_constraints_set_validity(sc, validity);
3082 sc = isl_schedule_constraints_set_proximity(sc, proximity);
3083 sched = isl_schedule_constraints_compute_schedule(sc);
3084 map1 = isl_schedule_get_map(sched);
3085 list = isl_schedule_get_band_forest(sched);
3086 isl_band_list_free(list);
3087 map2 = isl_schedule_get_map(sched);
3088 isl_schedule_free(sched);
3089 equal = isl_union_map_is_equal(map1, map2);
3090 isl_union_map_free(map1);
3091 isl_union_map_free(map2);
3092
3093 if (equal < 0)
3094 return -1;
3095 if (!equal)
3096 isl_die(ctx, isl_error_unknown,
3097 "reconstructed schedule map not the same as original",
3098 return -1);
3099
3100 return 0;
3101 }
3102
3103 /* Check that conditional validity constraints are also taken into
3104 * account across bands.
3105 * In particular, try to make sure that live ranges D[1,0]->C[2,1] and
3106 * D[2,0]->C[3,0] are not local in the outer band of the generated schedule
3107 * and then check that the adjacent order constraint C[2,1]->D[2,0]
3108 * is enforced by the rest of the schedule.
3109 */
3110 static int test_special_conditional_schedule_constraints(isl_ctx *ctx)
3111 {
3112 const char *str;
3113 isl_union_set *domain;
3114 isl_union_map *validity, *proximity, *condition;
3115 isl_union_map *sink, *source, *dep;
3116 isl_schedule_constraints *sc;
3117 isl_schedule *schedule;
3118 isl_union_access_info *access;
3119 isl_union_flow *flow;
3120 int empty;
3121
3122 str = "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3123 "A[k] : k >= 1 and k <= -1 + n; "
3124 "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3125 "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }";
3126 domain = isl_union_set_read_from_str(ctx, str);
3127 sc = isl_schedule_constraints_on_domain(domain);
3128 str = "[n] -> { D[k, i] -> C[1 + k, k - i] : "
3129 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3130 "D[k, i] -> C[1 + k, i] : "
3131 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3132 "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; "
3133 "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }";
3134 validity = isl_union_map_read_from_str(ctx, str);
3135 sc = isl_schedule_constraints_set_validity(sc, validity);
3136 str = "[n] -> { C[k, i] -> D[k, i] : "
3137 "0 <= i <= -1 + k and k <= -1 + n }";
3138 proximity = isl_union_map_read_from_str(ctx, str);
3139 sc = isl_schedule_constraints_set_proximity(sc, proximity);
3140 str = "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : "
3141 "i <= -1 + k and i >= 1 and k <= -2 + n; "
3142 "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : "
3143 "k <= -1 + n and i >= 0 and i <= -2 + k }";
3144 condition = isl_union_map_read_from_str(ctx, str);
3145 str = "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : "
3146 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3147 "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : "
3148 "i >= 0 and i <= -1 + k and k <= -1 + n and "
3149 "k' <= -1 + n and k' >= k - i and k' >= 1 + k; "
3150 "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : "
3151 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3152 "[B[k, i] -> c[]] -> [A[k'] -> d[]] : "
3153 "k <= -1 + n and i >= 0 and i <= -1 + k and "
3154 "k' >= 1 and k' <= -1 + n and k' >= 1 + k }";
3155 validity = isl_union_map_read_from_str(ctx, str);
3156 sc = isl_schedule_constraints_set_conditional_validity(sc, condition,
3157 validity);
3158 schedule = isl_schedule_constraints_compute_schedule(sc);
3159 str = "{ D[2,0] -> [] }";
3160 sink = isl_union_map_read_from_str(ctx, str);
3161 access = isl_union_access_info_from_sink(sink);
3162 str = "{ C[2,1] -> [] }";
3163 source = isl_union_map_read_from_str(ctx, str);
3164 access = isl_union_access_info_set_must_source(access, source);
3165 access = isl_union_access_info_set_schedule(access, schedule);
3166 flow = isl_union_access_info_compute_flow(access);
3167 dep = isl_union_flow_get_must_dependence(flow);
3168 isl_union_flow_free(flow);
3169 empty = isl_union_map_is_empty(dep);
3170 isl_union_map_free(dep);
3171
3172 if (empty < 0)
3173 return -1;
3174 if (empty)
3175 isl_die(ctx, isl_error_unknown,
3176 "conditional validity not respected", return -1);
3177
3178 return 0;
3179 }
3180
3181 /* Input for testing of schedule construction based on
3182 * conditional constraints.
3183 *
3184 * domain is the iteration domain
3185 * flow are the flow dependences, which determine the validity and
3186 * proximity constraints
3187 * condition are the conditions on the conditional validity constraints
3188 * conditional_validity are the conditional validity constraints
3189 * outer_band_n is the expected number of members in the outer band
3190 */
3191 struct {
3192 const char *domain;
3193 const char *flow;
3194 const char *condition;
3195 const char *conditional_validity;
3196 int outer_band_n;
3197 } live_range_tests[] = {
3198 /* Contrived example that illustrates that we need to keep
3199 * track of tagged condition dependences and
3200 * tagged conditional validity dependences
3201 * in isl_sched_edge separately.
3202 * In particular, the conditional validity constraints on A
3203 * cannot be satisfied,
3204 * but they can be ignored because there are no corresponding
3205 * condition constraints. However, we do have an additional
3206 * conditional validity constraint that maps to the same
3207 * dependence relation
3208 * as the condition constraint on B. If we did not make a distinction
3209 * between tagged condition and tagged conditional validity
3210 * dependences, then we
3211 * could end up treating this shared dependence as an condition
3212 * constraint on A, forcing a localization of the conditions,
3213 * which is impossible.
3214 */
3215 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
3216 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
3217 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
3218 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3219 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3220 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
3221 1
3222 },
3223 /* TACO 2013 Fig. 7 */
3224 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3225 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3226 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3227 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
3228 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
3229 "0 <= i < n and 0 <= j < n - 1 }",
3230 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
3231 "0 <= i < n and 0 <= j < j' < n;"
3232 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
3233 "0 <= i < i' < n and 0 <= j,j' < n;"
3234 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
3235 "0 <= i,j,j' < n and j < j' }",
3236 2
3237 },
3238 /* TACO 2013 Fig. 7, without tags */
3239 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3240 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3241 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3242 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3243 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3244 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
3245 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
3246 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
3247 1
3248 },
3249 /* TACO 2013 Fig. 12 */
3250 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
3251 "S3[i,3] : 0 <= i <= 1 }",
3252 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
3253 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
3254 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
3255 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
3256 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3257 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
3258 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3259 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
3260 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
3261 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
3262 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
3263 1
3264 }
3265 };
3266
3267 /* Test schedule construction based on conditional constraints.
3268 * In particular, check the number of members in the outer band node
3269 * as an indication of whether tiling is possible or not.
3270 */
3271 static int test_conditional_schedule_constraints(isl_ctx *ctx)
3272 {
3273 int i;
3274 isl_union_set *domain;
3275 isl_union_map *condition;
3276 isl_union_map *flow;
3277 isl_union_map *validity;
3278 isl_schedule_constraints *sc;
3279 isl_schedule *schedule;
3280 isl_schedule_node *node;
3281 int n_member;
3282
3283 if (test_special_conditional_schedule_constraints(ctx) < 0)
3284 return -1;
3285
3286 for (i = 0; i < ARRAY_SIZE(live_range_tests); ++i) {
3287 domain = isl_union_set_read_from_str(ctx,
3288 live_range_tests[i].domain);
3289 flow = isl_union_map_read_from_str(ctx,
3290 live_range_tests[i].flow);
3291 condition = isl_union_map_read_from_str(ctx,
3292 live_range_tests[i].condition);
3293 validity = isl_union_map_read_from_str(ctx,
3294 live_range_tests[i].conditional_validity);
3295 sc = isl_schedule_constraints_on_domain(domain);
3296 sc = isl_schedule_constraints_set_validity(sc,
3297 isl_union_map_copy(flow));
3298 sc = isl_schedule_constraints_set_proximity(sc, flow);
3299 sc = isl_schedule_constraints_set_conditional_validity(sc,
3300 condition, validity);
3301 schedule = isl_schedule_constraints_compute_schedule(sc);
3302 node = isl_schedule_get_root(schedule);
3303 while (node &&
3304 isl_schedule_node_get_type(node) != isl_schedule_node_band)
3305 node = isl_schedule_node_first_child(node);
3306 n_member = isl_schedule_node_band_n_member(node);
3307 isl_schedule_node_free(node);
3308 isl_schedule_free(schedule);
3309
3310 if (!schedule)
3311 return -1;
3312 if (n_member != live_range_tests[i].outer_band_n)
3313 isl_die(ctx, isl_error_unknown,
3314 "unexpected number of members in outer band",
3315 return -1);
3316 }
3317 return 0;
3318 }
3319
3320 /* Check that the schedule computed for the given instance set and
3321 * dependence relation strongly satisfies the dependences.
3322 * In particular, check that no instance is scheduled before
3323 * or together with an instance on which it depends.
3324 * Earlier versions of isl would produce a schedule that
3325 * only weakly satisfies the dependences.
3326 */
3327 static int test_strongly_satisfying_schedule(isl_ctx *ctx)
3328 {
3329 const char *domain, *dep;
3330 isl_union_map *D, *schedule;
3331 isl_map *map, *ge;
3332 int empty;
3333
3334 domain = "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; "
3335 "A[i0] : 0 <= i0 <= 1 }";
3336 dep = "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; "
3337 "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }";
3338 schedule = compute_schedule(ctx, domain, dep, dep);
3339 D = isl_union_map_read_from_str(ctx, dep);
3340 D = isl_union_map_apply_domain(D, isl_union_map_copy(schedule));
3341 D = isl_union_map_apply_range(D, schedule);
3342 map = isl_map_from_union_map(D);
3343 ge = isl_map_lex_ge(isl_space_domain(isl_map_get_space(map)));
3344 map = isl_map_intersect(map, ge);
3345 empty = isl_map_is_empty(map);
3346 isl_map_free(map);
3347
3348 if (empty < 0)
3349 return -1;
3350 if (!empty)
3351 isl_die(ctx, isl_error_unknown,
3352 "dependences not strongly satisfied", return -1);
3353
3354 return 0;
3355 }
3356
3357 /* Compute a schedule for input where the instance set constraints
3358 * conflict with the context constraints.
3359 * Earlier versions of isl did not properly handle this situation.
3360 */
3361 static int test_conflicting_context_schedule(isl_ctx *ctx)
3362 {
3363 isl_union_map *schedule;
3364 const char *domain, *context;
3365
3366 domain = "[n] -> { A[] : n >= 0 }";
3367 context = "[n] -> { : n < 0 }";
3368 schedule = compute_schedule_with_context(ctx,
3369 domain, "{}", "{}", context);
3370 isl_union_map_free(schedule);
3371
3372 if (!schedule)
3373 return -1;
3374
3375 return 0;
3376 }
3377
3378 /* Check that the dependence carrying step is not confused by
3379 * a bound on the coefficient size.
3380 * In particular, force the scheduler to move to a dependence carrying
3381 * step by demanding outer coincidence and bound the size of
3382 * the coefficients. Earlier versions of isl would take this
3383 * bound into account while carrying dependences, breaking
3384 * fundamental assumptions.
3385 */
3386 static int test_bounded_coefficients_schedule(isl_ctx *ctx)
3387 {
3388 const char *domain, *dep;
3389 isl_union_set *I;
3390 isl_union_map *D;
3391 isl_schedule_constraints *sc;
3392 isl_schedule *schedule;
3393
3394 domain = "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }";
3395 dep = "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and "
3396 "i1 <= -2 + i0; "
3397 "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }";
3398 I = isl_union_set_read_from_str(ctx, domain);
3399 D = isl_union_map_read_from_str(ctx, dep);
3400 sc = isl_schedule_constraints_on_domain(I);
3401 sc = isl_schedule_constraints_set_validity(sc, isl_union_map_copy(D));
3402 sc = isl_schedule_constraints_set_coincidence(sc, D);
3403 isl_options_set_schedule_outer_coincidence(ctx, 1);
3404 isl_options_set_schedule_max_coefficient(ctx, 20);
3405 schedule = isl_schedule_constraints_compute_schedule(sc);
3406 isl_options_set_schedule_max_coefficient(ctx, -1);
3407 isl_options_set_schedule_outer_coincidence(ctx, 0);
3408 isl_schedule_free(schedule);
3409
3410 if (!schedule)
3411 return -1;
3412
3413 return 0;
3414 }
3415
3416 int test_schedule(isl_ctx *ctx)
3417 {
3418 const char *D, *W, *R, *V, *P, *S;
3419
3420 /* Handle resulting schedule with zero bands. */
3421 if (test_one_schedule(ctx, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
3422 return -1;
3423
3424 /* Jacobi */
3425 D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
3426 W = "{ S1[t,i] -> a[t,i] }";
3427 R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
3428 "S1[t,i] -> a[t-1,i+1] }";
3429 S = "{ S1[t,i] -> [t,i] }";
3430 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
3431 return -1;
3432
3433 /* Fig. 5 of CC2008 */
3434 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
3435 "j <= -1 + N }";
3436 W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
3437 "j >= 2 and j <= -1 + N }";
3438 R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
3439 "j >= 2 and j <= -1 + N; "
3440 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
3441 "j >= 2 and j <= -1 + N }";
3442 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3443 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
3444 return -1;
3445
3446 D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
3447 W = "{ S1[i] -> a[i] }";
3448 R = "{ S2[i] -> a[i+1] }";
3449 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3450 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
3451 return -1;
3452
3453 D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
3454 W = "{ S1[i] -> a[i] }";
3455 R = "{ S2[i] -> a[9-i] }";
3456 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3457 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
3458 return -1;
3459
3460 D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
3461 W = "{ S1[i] -> a[i] }";
3462 R = "[N] -> { S2[i] -> a[N-1-i] }";
3463 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
3464 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
3465 return -1;
3466
3467 D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
3468 W = "{ S1[i] -> a[i]; S2[i] -> b[i] }";
3469 R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
3470 S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
3471 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3472 return -1;
3473
3474 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3475 W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
3476 R = "{ S2[i,j] -> a[i-1,j] }";
3477 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3478 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
3479 return -1;
3480
3481 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
3482 W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
3483 R = "{ S2[i,j] -> a[i,j-1] }";
3484 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
3485 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
3486 return -1;
3487
3488 D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
3489 W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
3490 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
3491 R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
3492 S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
3493 "S_0[] -> [0, 0, 0] }";
3494 if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0)
3495 return -1;
3496 ctx->opt->schedule_parametric = 0;
3497 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3498 return -1;
3499 ctx->opt->schedule_parametric = 1;
3500
3501 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
3502 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
3503 W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
3504 R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
3505 "S4[i] -> a[i,N] }";
3506 S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
3507 "S4[i] -> [4,i,0] }";
3508 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
3509 return -1;
3510
3511 D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
3512 W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3513 "j <= N }";
3514 R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
3515 "j <= N; "
3516 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
3517 "j <= N }";
3518 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
3519 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3520 return -1;
3521
3522 D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
3523 " S_2[t] : t >= 0 and t <= -1 + N; "
3524 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
3525 "i <= -1 + N }";
3526 W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
3527 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
3528 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
3529 "i >= 0 and i <= -1 + N }";
3530 R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
3531 "i >= 0 and i <= -1 + N; "
3532 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
3533 S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
3534 " S_0[t] -> [0, t, 0] }";
3535
3536 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
3537 return -1;
3538 ctx->opt->schedule_parametric = 0;
3539 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3540 return -1;
3541 ctx->opt->schedule_parametric = 1;
3542
3543 D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
3544 S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
3545 if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0)
3546 return -1;
3547
3548 D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
3549 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
3550 W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
3551 "j >= 0 and j <= -1 + N; "
3552 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3553 R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
3554 "j >= 0 and j <= -1 + N; "
3555 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
3556 S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
3557 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3558 return -1;
3559
3560 D = "{ S_0[i] : i >= 0 }";
3561 W = "{ S_0[i] -> a[i] : i >= 0 }";
3562 R = "{ S_0[i] -> a[0] : i >= 0 }";
3563 S = "{ S_0[i] -> [0, i, 0] }";
3564 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3565 return -1;
3566
3567 D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
3568 W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
3569 R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
3570 S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
3571 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3572 return -1;
3573
3574 D = "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
3575 "k <= -1 + n and k >= 0 }";
3576 W = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
3577 R = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
3578 "k <= -1 + n and k >= 0; "
3579 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
3580 "k <= -1 + n and k >= 0; "
3581 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
3582 "k <= -1 + n and k >= 0 }";
3583 S = "[n] -> { S_0[j, k] -> [2, j, k] }";
3584 ctx->opt->schedule_outer_coincidence = 1;
3585 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
3586 return -1;
3587 ctx->opt->schedule_outer_coincidence = 0;
3588
3589 D = "{Stmt_for_body24[i0, i1, i2, i3]:"
3590 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
3591 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
3592 "Stmt_for_body24[i0, i1, 1, 0]:"
3593 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
3594 "Stmt_for_body7[i0, i1, i2]:"
3595 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
3596 "i2 <= 7 }";
3597
3598 V = "{Stmt_for_body24[0, i1, i2, i3] -> "
3599 "Stmt_for_body24[1, i1, i2, i3]:"
3600 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
3601 "i2 >= 1;"
3602 "Stmt_for_body24[0, i1, i2, i3] -> "
3603 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
3604 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
3605 "i3 >= 0;"
3606 "Stmt_for_body24[0, i1, i2, i3] ->"
3607 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
3608 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
3609 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
3610 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
3611 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
3612 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
3613 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
3614 "i1 <= 6 and i1 >= 0;"
3615 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
3616 "Stmt_for_body7[i0, i1, i2] -> "
3617 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
3618 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
3619 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
3620 "Stmt_for_body7[i0, i1, i2] -> "
3621 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
3622 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
3623 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
3624 P = V;
3625 S = "{ Stmt_for_body24[i0, i1, i2, i3] -> "
3626 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
3627 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
3628
3629 if (test_special_schedule(ctx, D, V, P, S) < 0)
3630 return -1;
3631
3632 D = "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
3633 V = "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
3634 "j >= 1 and j <= 7;"
3635 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
3636 "j >= 1 and j <= 8 }";
3637 P = "{ }";
3638 S = "{ S_0[i, j] -> [i + j, j] }";
3639 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
3640 if (test_special_schedule(ctx, D, V, P, S) < 0)
3641 return -1;
3642 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
3643
3644 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
3645 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
3646 "j >= 0 and j <= -1 + i }";
3647 V = "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
3648 "i <= -1 + N and j >= 0;"
3649 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
3650 "i <= -2 + N }";
3651 P = "{ }";
3652 S = "{ S_0[i, j] -> [i, j] }";
3653 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
3654 if (test_special_schedule(ctx, D, V, P, S) < 0)
3655 return -1;
3656 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
3657
3658 /* Test both algorithms on a case with only proximity dependences. */
3659 D = "{ S[i,j] : 0 <= i <= 10 }";
3660 V = "{ }";
3661 P = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
3662 S = "{ S[i, j] -> [j, i] }";
3663 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
3664 if (test_special_schedule(ctx, D, V, P, S) < 0)
3665 return -1;
3666 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
3667 if (test_special_schedule(ctx, D, V, P, S) < 0)
3668 return -1;
3669
3670 D = "{ A[a]; B[] }";
3671 V = "{}";
3672 P = "{ A[a] -> B[] }";
3673 if (test_has_schedule(ctx, D, V, P) < 0)
3674 return -1;
3675
3676 if (test_padded_schedule(ctx) < 0)
3677 return -1;
3678
3679 /* Check that check for progress is not confused by rational
3680 * solution.
3681 */
3682 D = "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
3683 V = "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
3684 "i0 <= -2 + N; "
3685 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
3686 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
3687 P = "{}";
3688 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
3689 if (test_has_schedule(ctx, D, V, P) < 0)
3690 return -1;
3691 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
3692
3693 /* Check that we allow schedule rows that are only non-trivial
3694 * on some full-dimensional domains.
3695 */
3696 D = "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
3697 V = "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
3698 "S1[j] -> S2[1] : 0 <= j <= 1 }";
3699 P = "{}";
3700 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
3701 if (test_has_schedule(ctx, D, V, P) < 0)
3702 return -1;
3703 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
3704
3705 if (test_conditional_schedule_constraints(ctx) < 0)
3706 return -1;
3707
3708 if (test_strongly_satisfying_schedule(ctx) < 0)
3709 return -1;
3710
3711 if (test_conflicting_context_schedule(ctx) < 0)
3712 return -1;
3713
3714 if (test_bounded_coefficients_schedule(ctx) < 0)
3715 return -1;
3716
3717 return 0;
3718 }
3719
3720 int test_plain_injective(isl_ctx *ctx, const char *str, int injective)
3721 {
3722 isl_union_map *umap;
3723 int test;
3724
3725 umap = isl_union_map_read_from_str(ctx, str);
3726 test = isl_union_map_plain_is_injective(umap);
3727 isl_union_map_free(umap);
3728 if (test < 0)
3729 return -1;
3730 if (test == injective)
3731 return 0;
3732 if (injective)
3733 isl_die(ctx, isl_error_unknown,
3734 "map not detected as injective", return -1);
3735 else
3736 isl_die(ctx, isl_error_unknown,
3737 "map detected as injective", return -1);
3738 }
3739
3740 int test_injective(isl_ctx *ctx)
3741 {
3742 const char *str;
3743
3744 if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
3745 return -1;
3746 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1))
3747 return -1;
3748 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1))
3749 return -1;
3750 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0))
3751 return -1;
3752 if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
3753 return -1;
3754 if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
3755 return -1;
3756 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
3757 return -1;
3758 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
3759 return -1;
3760
3761 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
3762 if (test_plain_injective(ctx, str, 1))
3763 return -1;
3764 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
3765 if (test_plain_injective(ctx, str, 0))
3766 return -1;
3767
3768 return 0;
3769 }
3770
3771 static int aff_plain_is_equal(__isl_keep isl_aff *aff, const char *str)
3772 {
3773 isl_aff *aff2;
3774 int equal;
3775
3776 if (!aff)
3777 return -1;
3778
3779 aff2 = isl_aff_read_from_str(isl_aff_get_ctx(aff), str);
3780 equal = isl_aff_plain_is_equal(aff, aff2);
3781 isl_aff_free(aff2);
3782
3783 return equal;
3784 }
3785
3786 static int aff_check_plain_equal(__isl_keep isl_aff *aff, const char *str)
3787 {
3788 int equal;
3789
3790 equal = aff_plain_is_equal(aff, str);
3791 if (equal < 0)
3792 return -1;
3793 if (!equal)
3794 isl_die(isl_aff_get_ctx(aff), isl_error_unknown,
3795 "result not as expected", return -1);
3796 return 0;
3797 }
3798
3799 struct {
3800 __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1,
3801 __isl_take isl_aff *aff2);
3802 } aff_bin_op[] = {
3803 ['+'] = { &isl_aff_add },
3804 ['-'] = { &isl_aff_sub },
3805 ['*'] = { &isl_aff_mul },
3806 ['/'] = { &isl_aff_div },
3807 };
3808
3809 struct {
3810 const char *arg1;
3811 unsigned char op;
3812 const char *arg2;
3813 const char *res;
3814 } aff_bin_tests[] = {
3815 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
3816 "{ [i] -> [2i] }" },
3817 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
3818 "{ [i] -> [0] }" },
3819 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
3820 "{ [i] -> [2i] }" },
3821 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
3822 "{ [i] -> [2i] }" },
3823 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
3824 "{ [i] -> [i/2] }" },
3825 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
3826 "{ [i] -> [i] }" },
3827 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
3828 "{ [i] -> [NaN] }" },
3829 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
3830 "{ [i] -> [NaN] }" },
3831 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
3832 "{ [i] -> [NaN] }" },
3833 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
3834 "{ [i] -> [NaN] }" },
3835 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
3836 "{ [i] -> [NaN] }" },
3837 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
3838 "{ [i] -> [NaN] }" },
3839 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
3840 "{ [i] -> [NaN] }" },
3841 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
3842 "{ [i] -> [NaN] }" },
3843 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
3844 "{ [i] -> [NaN] }" },
3845 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
3846 "{ [i] -> [NaN] }" },
3847 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
3848 "{ [i] -> [NaN] }" },
3849 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
3850 "{ [i] -> [NaN] }" },
3851 };
3852
3853 /* Perform some basic tests of binary operations on isl_aff objects.
3854 */
3855 static int test_bin_aff(isl_ctx *ctx)
3856 {
3857 int i;
3858 isl_aff *aff1, *aff2, *res;
3859 __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1,
3860 __isl_take isl_aff *aff2);
3861 int ok;
3862
3863 for (i = 0; i < ARRAY_SIZE(aff_bin_tests); ++i) {
3864 aff1 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg1);
3865 aff2 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg2);
3866 res = isl_aff_read_from_str(ctx, aff_bin_tests[i].res);
3867 fn = aff_bin_op[aff_bin_tests[i].op].fn;
3868 aff1 = fn(aff1, aff2);
3869 if (isl_aff_is_nan(res))
3870 ok = isl_aff_is_nan(aff1);
3871 else
3872 ok = isl_aff_plain_is_equal(aff1, res);
3873 isl_aff_free(aff1);
3874 isl_aff_free(res);
3875 if (ok < 0)
3876 return -1;
3877 if (!ok)
3878 isl_die(ctx, isl_error_unknown,
3879 "unexpected result", return -1);
3880 }
3881
3882 return 0;
3883 }
3884
3885 struct {
3886 __isl_give isl_union_pw_multi_aff *(*fn)(
3887 __isl_take isl_union_pw_multi_aff *upma1,
3888 __isl_take isl_union_pw_multi_aff *upma2);
3889 const char *arg1;
3890 const char *arg2;
3891 const char *res;
3892 } upma_bin_tests[] = {
3893 { &isl_union_pw_multi_aff_add, "{ A[] -> [0]; B[0] -> [1] }",
3894 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
3895 { &isl_union_pw_multi_aff_union_add, "{ A[] -> [0]; B[0] -> [1] }",
3896 "{ B[x] -> [2] : x >= 0 }",
3897 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
3898 };
3899
3900 /* Perform some basic tests of binary operations on
3901 * isl_union_pw_multi_aff objects.
3902 */
3903 static int test_bin_upma(isl_ctx *ctx)
3904 {
3905 int i;
3906 isl_union_pw_multi_aff *upma1, *upma2, *res;
3907 int ok;
3908
3909 for (i = 0; i < ARRAY_SIZE(upma_bin_tests); ++i) {
3910 upma1 = isl_union_pw_multi_aff_read_from_str(ctx,
3911 upma_bin_tests[i].arg1);
3912 upma2 = isl_union_pw_multi_aff_read_from_str(ctx,
3913 upma_bin_tests[i].arg2);
3914 res = isl_union_pw_multi_aff_read_from_str(ctx,
3915 upma_bin_tests[i].res);
3916 upma1 = upma_bin_tests[i].fn(upma1, upma2);
3917 ok = isl_union_pw_multi_aff_plain_is_equal(upma1, res);
3918 isl_union_pw_multi_aff_free(upma1);
3919 isl_union_pw_multi_aff_free(res);
3920 if (ok < 0)
3921 return -1;
3922 if (!ok)
3923 isl_die(ctx, isl_error_unknown,
3924 "unexpected result", return -1);
3925 }
3926
3927 return 0;
3928 }
3929
3930 int test_aff(isl_ctx *ctx)
3931 {
3932 const char *str;
3933 isl_set *set;
3934 isl_space *space;
3935 isl_local_space *ls;
3936 isl_aff *aff;
3937 int zero, equal;
3938
3939 if (test_bin_aff(ctx) < 0)
3940 return -1;
3941 if (test_bin_upma(ctx) < 0)
3942 return -1;
3943
3944 space = isl_space_set_alloc(ctx, 0, 1);
3945 ls = isl_local_space_from_space(space);
3946 aff = isl_aff_zero_on_domain(ls);
3947
3948 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
3949 aff = isl_aff_scale_down_ui(aff, 3);
3950 aff = isl_aff_floor(aff);
3951 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
3952 aff = isl_aff_scale_down_ui(aff, 2);
3953 aff = isl_aff_floor(aff);
3954 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
3955
3956 str = "{ [10] }";
3957 set = isl_set_read_from_str(ctx, str);
3958 aff = isl_aff_gist(aff, set);
3959
3960 aff = isl_aff_add_constant_si(aff, -16);
3961 zero = isl_aff_plain_is_zero(aff);
3962 isl_aff_free(aff);
3963
3964 if (zero < 0)
3965 return -1;
3966 if (!zero)
3967 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
3968
3969 aff = isl_aff_read_from_str(ctx, "{ [-1] }");
3970 aff = isl_aff_scale_down_ui(aff, 64);
3971 aff = isl_aff_floor(aff);
3972 equal = aff_check_plain_equal(aff, "{ [-1] }");
3973 isl_aff_free(aff);
3974 if (equal < 0)
3975 return -1;
3976
3977 return 0;
3978 }
3979
3980 int test_dim_max(isl_ctx *ctx)
3981 {
3982 int equal;
3983 const char *str;
3984 isl_set *set1, *set2;
3985 isl_set *set;
3986 isl_map *map;
3987 isl_pw_aff *pwaff;
3988
3989 str = "[N] -> { [i] : 0 <= i <= min(N,10) }";
3990 set = isl_set_read_from_str(ctx, str);
3991 pwaff = isl_set_dim_max(set, 0);
3992 set1 = isl_set_from_pw_aff(pwaff);
3993 str = "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
3994 set2 = isl_set_read_from_str(ctx, str);
3995 equal = isl_set_is_equal(set1, set2);
3996 isl_set_free(set1);
3997 isl_set_free(set2);
3998 if (equal < 0)
3999 return -1;
4000 if (!equal)
4001 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4002
4003 str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
4004 set = isl_set_read_from_str(ctx, str);
4005 pwaff = isl_set_dim_max(set, 0);
4006 set1 = isl_set_from_pw_aff(pwaff);
4007 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4008 set2 = isl_set_read_from_str(ctx, str);
4009 equal = isl_set_is_equal(set1, set2);
4010 isl_set_free(set1);
4011 isl_set_free(set2);
4012 if (equal < 0)
4013 return -1;
4014 if (!equal)
4015 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4016
4017 str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
4018 set = isl_set_read_from_str(ctx, str);
4019 pwaff = isl_set_dim_max(set, 0);
4020 set1 = isl_set_from_pw_aff(pwaff);
4021 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4022 set2 = isl_set_read_from_str(ctx, str);
4023 equal = isl_set_is_equal(set1, set2);
4024 isl_set_free(set1);
4025 isl_set_free(set2);
4026 if (equal < 0)
4027 return -1;
4028 if (!equal)
4029 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4030
4031 str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
4032 "0 <= i < N and 0 <= j < M }";
4033 map = isl_map_read_from_str(ctx, str);
4034 set = isl_map_range(map);
4035
4036 pwaff = isl_set_dim_max(isl_set_copy(set), 0);
4037 set1 = isl_set_from_pw_aff(pwaff);
4038 str = "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
4039 set2 = isl_set_read_from_str(ctx, str);
4040 equal = isl_set_is_equal(set1, set2);
4041 isl_set_free(set1);
4042 isl_set_free(set2);
4043
4044 pwaff = isl_set_dim_max(isl_set_copy(set), 3);
4045 set1 = isl_set_from_pw_aff(pwaff);
4046 str = "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
4047 set2 = isl_set_read_from_str(ctx, str);
4048 if (equal >= 0 && equal)
4049 equal = isl_set_is_equal(set1, set2);
4050 isl_set_free(set1);
4051 isl_set_free(set2);
4052
4053 isl_set_free(set);
4054
4055 if (equal < 0)
4056 return -1;
4057 if (!equal)
4058 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4059
4060 /* Check that solutions are properly merged. */
4061 str = "[n] -> { [a, b, c] : c >= -4a - 2b and "
4062 "c <= -1 + n - 4a - 2b and c >= -2b and "
4063 "4a >= -4 + n and c >= 0 }";
4064 set = isl_set_read_from_str(ctx, str);
4065 pwaff = isl_set_dim_min(set, 2);
4066 set1 = isl_set_from_pw_aff(pwaff);
4067 str = "[n] -> { [(0)] : n >= 1 }";
4068 set2 = isl_set_read_from_str(ctx, str);
4069 equal = isl_set_is_equal(set1, set2);
4070 isl_set_free(set1);
4071 isl_set_free(set2);
4072
4073 if (equal < 0)
4074 return -1;
4075 if (!equal)
4076 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4077
4078 /* Check that empty solution lie in the right space. */
4079 str = "[n] -> { [t,a] : 1 = 0 }";
4080 set = isl_set_read_from_str(ctx, str);
4081 pwaff = isl_set_dim_max(set, 0);
4082 set1 = isl_set_from_pw_aff(pwaff);
4083 str = "[n] -> { [t] : 1 = 0 }";
4084 set2 = isl_set_read_from_str(ctx, str);
4085 equal = isl_set_is_equal(set1, set2);
4086 isl_set_free(set1);
4087 isl_set_free(set2);
4088
4089 if (equal < 0)
4090 return -1;
4091 if (!equal)
4092 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4093
4094 return 0;
4095 }
4096
4097 /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
4098 */
4099 static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff *pma,
4100 const char *str)
4101 {
4102 isl_ctx *ctx;
4103 isl_pw_multi_aff *pma2;
4104 int equal;
4105
4106 if (!pma)
4107 return -1;
4108
4109 ctx = isl_pw_multi_aff_get_ctx(pma);
4110 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
4111 equal = isl_pw_multi_aff_plain_is_equal(pma, pma2);
4112 isl_pw_multi_aff_free(pma2);
4113
4114 return equal;
4115 }
4116
4117 /* Check that "pma" is obviously equal to the isl_pw_multi_aff
4118 * represented by "str".
4119 */
4120 static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff *pma,
4121 const char *str)
4122 {
4123 int equal;
4124
4125 equal = pw_multi_aff_plain_is_equal(pma, str);
4126 if (equal < 0)
4127 return -1;
4128 if (!equal)
4129 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_unknown,
4130 "result not as expected", return -1);
4131 return 0;
4132 }
4133
4134 /* Basic test for isl_pw_multi_aff_product.
4135 *
4136 * Check that multiple pieces are properly handled.
4137 */
4138 static int test_product_pma(isl_ctx *ctx)
4139 {
4140 int equal;
4141 const char *str;
4142 isl_pw_multi_aff *pma1, *pma2;
4143
4144 str = "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
4145 pma1 = isl_pw_multi_aff_read_from_str(ctx, str);
4146 str = "{ C[] -> D[] }";
4147 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
4148 pma1 = isl_pw_multi_aff_product(pma1, pma2);
4149 str = "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
4150 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
4151 equal = pw_multi_aff_check_plain_equal(pma1, str);
4152 isl_pw_multi_aff_free(pma1);
4153 if (equal < 0)
4154 return -1;
4155
4156 return 0;
4157 }
4158
4159 int test_product(isl_ctx *ctx)
4160 {
4161 const char *str;
4162 isl_set *set;
4163 isl_union_set *uset1, *uset2;
4164 int ok;
4165
4166 str = "{ A[i] }";
4167 set = isl_set_read_from_str(ctx, str);
4168 set = isl_set_product(set, isl_set_copy(set));
4169 ok = isl_set_is_wrapping(set);
4170 isl_set_free(set);
4171 if (ok < 0)
4172 return -1;
4173 if (!ok)
4174 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4175
4176 str = "{ [] }";
4177 uset1 = isl_union_set_read_from_str(ctx, str);
4178 uset1 = isl_union_set_product(uset1, isl_union_set_copy(uset1));
4179 str = "{ [[] -> []] }";
4180 uset2 = isl_union_set_read_from_str(ctx, str);
4181 ok = isl_union_set_is_equal(uset1, uset2);
4182 isl_union_set_free(uset1);
4183 isl_union_set_free(uset2);
4184 if (ok < 0)
4185 return -1;
4186 if (!ok)
4187 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4188
4189 if (test_product_pma(ctx) < 0)
4190 return -1;
4191
4192 return 0;
4193 }
4194
4195 /* Check that two sets are not considered disjoint just because
4196 * they have a different set of (named) parameters.
4197 */
4198 static int test_disjoint(isl_ctx *ctx)
4199 {
4200 const char *str;
4201 isl_set *set, *set2;
4202 int disjoint;
4203
4204 str = "[n] -> { [[]->[]] }";
4205 set = isl_set_read_from_str(ctx, str);
4206 str = "{ [[]->[]] }";
4207 set2 = isl_set_read_from_str(ctx, str);
4208 disjoint = isl_set_is_disjoint(set, set2);
4209 isl_set_free(set);
4210 isl_set_free(set2);
4211 if (disjoint < 0)
4212 return -1;
4213 if (disjoint)
4214 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4215
4216 return 0;
4217 }
4218
4219 int test_equal(isl_ctx *ctx)
4220 {
4221 const char *str;
4222 isl_set *set, *set2;
4223 int equal;
4224
4225 str = "{ S_6[i] }";
4226 set = isl_set_read_from_str(ctx, str);
4227 str = "{ S_7[i] }";
4228 set2 = isl_set_read_from_str(ctx, str);
4229 equal = isl_set_is_equal(set, set2);
4230 isl_set_free(set);
4231 isl_set_free(set2);
4232 if (equal < 0)
4233 return -1;
4234 if (equal)
4235 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4236
4237 return 0;
4238 }
4239
4240 static int test_plain_fixed(isl_ctx *ctx, __isl_take isl_map *map,
4241 enum isl_dim_type type, unsigned pos, int fixed)
4242 {
4243 int test;
4244
4245 test = isl_map_plain_is_fixed(map, type, pos, NULL);
4246 isl_map_free(map);
4247 if (test < 0)
4248 return -1;
4249 if (test == fixed)
4250 return 0;
4251 if (fixed)
4252 isl_die(ctx, isl_error_unknown,
4253 "map not detected as fixed", return -1);
4254 else
4255 isl_die(ctx, isl_error_unknown,
4256 "map detected as fixed", return -1);
4257 }
4258
4259 int test_fixed(isl_ctx *ctx)
4260 {
4261 const char *str;
4262 isl_map *map;
4263
4264 str = "{ [i] -> [i] }";
4265 map = isl_map_read_from_str(ctx, str);
4266 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 0))
4267 return -1;
4268 str = "{ [i] -> [1] }";
4269 map = isl_map_read_from_str(ctx, str);
4270 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
4271 return -1;
4272 str = "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
4273 map = isl_map_read_from_str(ctx, str);
4274 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
4275 return -1;
4276 map = isl_map_read_from_str(ctx, str);
4277 map = isl_map_neg(map);
4278 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
4279 return -1;
4280
4281 return 0;
4282 }
4283
4284 struct isl_vertices_test_data {
4285 const char *set;
4286 int n;
4287 const char *vertex[2];
4288 } vertices_tests[] = {
4289 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
4290 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
4291 { "{ A[t, i] : t = 14 and i = 1 }",
4292 1, { "{ A[14, 1] }" } },
4293 };
4294
4295 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
4296 */
4297 static isl_stat find_vertex(__isl_take isl_vertex *vertex, void *user)
4298 {
4299 struct isl_vertices_test_data *data = user;
4300 isl_ctx *ctx;
4301 isl_multi_aff *ma;
4302 isl_basic_set *bset;
4303 isl_pw_multi_aff *pma;
4304 int i;
4305 isl_bool equal;
4306
4307 ctx = isl_vertex_get_ctx(vertex);
4308 bset = isl_vertex_get_domain(vertex);
4309 ma = isl_vertex_get_expr(vertex);
4310 pma = isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset), ma);
4311
4312 for (i = 0; i < data->n; ++i) {
4313 isl_pw_multi_aff *pma_i;
4314
4315 pma_i = isl_pw_multi_aff_read_from_str(ctx, data->vertex[i]);
4316 equal = isl_pw_multi_aff_plain_is_equal(pma, pma_i);
4317 isl_pw_multi_aff_free(pma_i);
4318
4319 if (equal < 0 || equal)
4320 break;
4321 }
4322
4323 isl_pw_multi_aff_free(pma);
4324 isl_vertex_free(vertex);
4325
4326 if (equal < 0)
4327 return isl_stat_error;
4328
4329 return equal ? isl_stat_ok : isl_stat_error;
4330 }
4331
4332 int test_vertices(isl_ctx *ctx)
4333 {
4334 int i;
4335
4336 for (i = 0; i < ARRAY_SIZE(vertices_tests); ++i) {
4337 isl_basic_set *bset;
4338 isl_vertices *vertices;
4339 int ok = 1;
4340 int n;
4341
4342 bset = isl_basic_set_read_from_str(ctx, vertices_tests[i].set);
4343 vertices = isl_basic_set_compute_vertices(bset);
4344 n = isl_vertices_get_n_vertices(vertices);
4345 if (vertices_tests[i].n != n)
4346 ok = 0;
4347 if (isl_vertices_foreach_vertex(vertices, &find_vertex,
4348 &vertices_tests[i]) < 0)
4349 ok = 0;
4350 isl_vertices_free(vertices);
4351 isl_basic_set_free(bset);
4352
4353 if (!vertices)
4354 return -1;
4355 if (!ok)
4356 isl_die(ctx, isl_error_unknown, "unexpected vertices",
4357 return -1);
4358 }
4359
4360 return 0;
4361 }
4362
4363 int test_union_pw(isl_ctx *ctx)
4364 {
4365 int equal;
4366 const char *str;
4367 isl_union_set *uset;
4368 isl_union_pw_qpolynomial *upwqp1, *upwqp2;
4369
4370 str = "{ [x] -> x^2 }";
4371 upwqp1 = isl_union_pw_qpolynomial_read_from_str(ctx, str);
4372 upwqp2 = isl_union_pw_qpolynomial_copy(upwqp1);
4373 uset = isl_union_pw_qpolynomial_domain(upwqp1);
4374 upwqp1 = isl_union_pw_qpolynomial_copy(upwqp2);
4375 upwqp1 = isl_union_pw_qpolynomial_intersect_domain(upwqp1, uset);
4376 equal = isl_union_pw_qpolynomial_plain_is_equal(upwqp1, upwqp2);
4377 isl_union_pw_qpolynomial_free(upwqp1);
4378 isl_union_pw_qpolynomial_free(upwqp2);
4379 if (equal < 0)
4380 return -1;
4381 if (!equal)
4382 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4383
4384 return 0;
4385 }
4386
4387 int test_output(isl_ctx *ctx)
4388 {
4389 char *s;
4390 const char *str;
4391 isl_pw_aff *pa;
4392 isl_printer *p;
4393 int equal;
4394
4395 str = "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
4396 pa = isl_pw_aff_read_from_str(ctx, str);
4397
4398 p = isl_printer_to_str(ctx);
4399 p = isl_printer_set_output_format(p, ISL_FORMAT_C);
4400 p = isl_printer_print_pw_aff(p, pa);
4401 s = isl_printer_get_str(p);
4402 isl_printer_free(p);
4403 isl_pw_aff_free(pa);
4404 if (!s)
4405 equal = -1;
4406 else
4407 equal = !strcmp(s, "4 * floord(x, 4) + 2 >= x ? 1 : 2");
4408 free(s);
4409 if (equal < 0)
4410 return -1;
4411 if (!equal)
4412 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
4413
4414 return 0;
4415 }
4416
4417 int test_sample(isl_ctx *ctx)
4418 {
4419 const char *str;
4420 isl_basic_set *bset1, *bset2;
4421 int empty, subset;
4422
4423 str = "{ [a, b, c, d, e, f, g, h, i, j, k] : "
4424 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
4425 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
4426 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
4427 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
4428 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
4429 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
4430 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
4431 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
4432 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
4433 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
4434 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
4435 "d - 1073741821e and "
4436 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
4437 "3j >= 1 - a + b + 2e and "
4438 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
4439 "3i <= 4 - a + 4b - e and "
4440 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
4441 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
4442 "c <= -1 + a and 3i >= -2 - a + 3e and "
4443 "1073741822e <= 1073741823 - a + 1073741822b + c and "
4444 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
4445 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
4446 "1073741823e >= 1 + 1073741823b - d and "
4447 "3i >= 1073741823b + c - 1073741823e - f and "
4448 "3i >= 1 + 2b + e + 3g }";
4449 bset1 = isl_basic_set_read_from_str(ctx, str);
4450 bset2 = isl_basic_set_sample(isl_basic_set_copy(bset1));
4451 empty = isl_basic_set_is_empty(bset2);
4452 subset = isl_basic_set_is_subset(bset2, bset1);
4453 isl_basic_set_free(bset1);
4454 isl_basic_set_free(bset2);
4455 if (empty < 0 || subset < 0)
4456 return -1;
4457 if (empty)
4458 isl_die(ctx, isl_error_unknown, "point not found", return -1);
4459 if (!subset)
4460 isl_die(ctx, isl_error_unknown, "bad point found", return -1);
4461
4462 return 0;
4463 }
4464
4465 int test_fixed_power(isl_ctx *ctx)
4466 {
4467 const char *str;
4468 isl_map *map;
4469 isl_int exp;
4470 int equal;
4471
4472 isl_int_init(exp);
4473 str = "{ [i] -> [i + 1] }";
4474 map = isl_map_read_from_str(ctx, str);
4475 isl_int_set_si(exp, 23);
4476 map = isl_map_fixed_power(map, exp);
4477 equal = map_check_equal(map, "{ [i] -> [i + 23] }");
4478 isl_int_clear(exp);
4479 isl_map_free(map);
4480 if (equal < 0)
4481 return -1;
4482
4483 return 0;
4484 }
4485
4486 int test_slice(isl_ctx *ctx)
4487 {
4488 const char *str;
4489 isl_map *map;
4490 int equal;
4491
4492 str = "{ [i] -> [j] }";
4493 map = isl_map_read_from_str(ctx, str);
4494 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_out, 0);
4495 equal = map_check_equal(map, "{ [i] -> [i] }");
4496 isl_map_free(map);
4497 if (equal < 0)
4498 return -1;
4499
4500 str = "{ [i] -> [j] }";
4501 map = isl_map_read_from_str(ctx, str);
4502 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_in, 0);
4503 equal = map_check_equal(map, "{ [i] -> [j] }");
4504 isl_map_free(map);
4505 if (equal < 0)
4506 return -1;
4507
4508 str = "{ [i] -> [j] }";
4509 map = isl_map_read_from_str(ctx, str);
4510 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_out, 0);
4511 equal = map_check_equal(map, "{ [i] -> [-i] }");
4512 isl_map_free(map);
4513 if (equal < 0)
4514 return -1;
4515
4516 str = "{ [i] -> [j] }";
4517 map = isl_map_read_from_str(ctx, str);
4518 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_in, 0);
4519 equal = map_check_equal(map, "{ [0] -> [j] }");
4520 isl_map_free(map);
4521 if (equal < 0)
4522 return -1;
4523
4524 str = "{ [i] -> [j] }";
4525 map = isl_map_read_from_str(ctx, str);
4526 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_out, 0);
4527 equal = map_check_equal(map, "{ [i] -> [j] : i > j }");
4528 isl_map_free(map);
4529 if (equal < 0)
4530 return -1;
4531
4532 str = "{ [i] -> [j] }";
4533 map = isl_map_read_from_str(ctx, str);
4534 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_in, 0);
4535 equal = map_check_equal(map, "{ [i] -> [j] : false }");
4536 isl_map_free(map);
4537 if (equal < 0)
4538 return -1;
4539
4540 return 0;
4541 }
4542
4543 int test_eliminate(isl_ctx *ctx)
4544 {
4545 const char *str;
4546 isl_map *map;
4547 int equal;
4548
4549 str = "{ [i] -> [j] : i = 2j }";
4550 map = isl_map_read_from_str(ctx, str);
4551 map = isl_map_eliminate(map, isl_dim_out, 0, 1);
4552 equal = map_check_equal(map, "{ [i] -> [j] : exists a : i = 2a }");
4553 isl_map_free(map);
4554 if (equal < 0)
4555 return -1;
4556
4557 return 0;
4558 }
4559
4560 /* Check that isl_set_dim_residue_class detects that the values of j
4561 * in the set below are all odd and that it does not detect any spurious
4562 * strides.
4563 */
4564 static int test_residue_class(isl_ctx *ctx)
4565 {
4566 const char *str;
4567 isl_set *set;
4568 isl_int m, r;
4569 int res;
4570
4571 str = "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
4572 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
4573 set = isl_set_read_from_str(ctx, str);
4574 isl_int_init(m);
4575 isl_int_init(r);
4576 res = isl_set_dim_residue_class(set, 1, &m, &r);
4577 if (res >= 0 &&
4578 (isl_int_cmp_si(m, 2) != 0 || isl_int_cmp_si(r, 1) != 0))
4579 isl_die(ctx, isl_error_unknown, "incorrect residue class",
4580 res = -1);
4581 isl_int_clear(r);
4582 isl_int_clear(m);
4583 isl_set_free(set);
4584
4585 return res;
4586 }
4587
4588 int test_align_parameters(isl_ctx *ctx)
4589 {
4590 const char *str;
4591 isl_space *space;
4592 isl_multi_aff *ma1, *ma2;
4593 int equal;
4594
4595 str = "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
4596 ma1 = isl_multi_aff_read_from_str(ctx, str);
4597
4598 space = isl_space_params_alloc(ctx, 1);
4599 space = isl_space_set_dim_name(space, isl_dim_param, 0, "N");
4600 ma1 = isl_multi_aff_align_params(ma1, space);
4601
4602 str = "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
4603 ma2 = isl_multi_aff_read_from_str(ctx, str);
4604
4605 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
4606
4607 isl_multi_aff_free(ma1);
4608 isl_multi_aff_free(ma2);
4609
4610 if (equal < 0)
4611 return -1;
4612 if (!equal)
4613 isl_die(ctx, isl_error_unknown,
4614 "result not as expected", return -1);
4615
4616 return 0;
4617 }
4618
4619 static int test_list(isl_ctx *ctx)
4620 {
4621 isl_id *a, *b, *c, *d, *id;
4622 isl_id_list *list;
4623 int ok;
4624
4625 a = isl_id_alloc(ctx, "a", NULL);
4626 b = isl_id_alloc(ctx, "b", NULL);
4627 c = isl_id_alloc(ctx, "c", NULL);
4628 d = isl_id_alloc(ctx, "d", NULL);
4629
4630 list = isl_id_list_alloc(ctx, 4);
4631 list = isl_id_list_add(list, a);
4632 list = isl_id_list_add(list, b);
4633 list = isl_id_list_add(list, c);
4634 list = isl_id_list_add(list, d);
4635 list = isl_id_list_drop(list, 1, 1);
4636
4637 if (isl_id_list_n_id(list) != 3) {
4638 isl_id_list_free(list);
4639 isl_die(ctx, isl_error_unknown,
4640 "unexpected number of elements in list", return -1);
4641 }
4642
4643 id = isl_id_list_get_id(list, 0);
4644 ok = id == a;
4645 isl_id_free(id);
4646 id = isl_id_list_get_id(list, 1);
4647 ok = ok && id == c;
4648 isl_id_free(id);
4649 id = isl_id_list_get_id(list, 2);
4650 ok = ok && id == d;
4651 isl_id_free(id);
4652
4653 isl_id_list_free(list);
4654
4655 if (!ok)
4656 isl_die(ctx, isl_error_unknown,
4657 "unexpected elements in list", return -1);
4658
4659 return 0;
4660 }
4661
4662 const char *set_conversion_tests[] = {
4663 "[N] -> { [i] : N - 1 <= 2 i <= N }",
4664 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
4665 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
4666 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
4667 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
4668 };
4669
4670 /* Check that converting from isl_set to isl_pw_multi_aff and back
4671 * to isl_set produces the original isl_set.
4672 */
4673 static int test_set_conversion(isl_ctx *ctx)
4674 {
4675 int i;
4676 const char *str;
4677 isl_set *set1, *set2;
4678 isl_pw_multi_aff *pma;
4679 int equal;
4680
4681 for (i = 0; i < ARRAY_SIZE(set_conversion_tests); ++i) {
4682 str = set_conversion_tests[i];
4683 set1 = isl_set_read_from_str(ctx, str);
4684 pma = isl_pw_multi_aff_from_set(isl_set_copy(set1));
4685 set2 = isl_set_from_pw_multi_aff(pma);
4686 equal = isl_set_is_equal(set1, set2);
4687 isl_set_free(set1);
4688 isl_set_free(set2);
4689
4690 if (equal < 0)
4691 return -1;
4692 if (!equal)
4693 isl_die(ctx, isl_error_unknown, "bad conversion",
4694 return -1);
4695 }
4696
4697 return 0;
4698 }
4699
4700 /* Check that converting from isl_map to isl_pw_multi_aff and back
4701 * to isl_map produces the original isl_map.
4702 */
4703 static int test_map_conversion(isl_ctx *ctx)
4704 {
4705 const char *str;
4706 isl_map *map1, *map2;
4707 isl_pw_multi_aff *pma;
4708 int equal;
4709
4710 str = "{ [a, b, c, d] -> s0[a, b, e, f] : "
4711 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
4712 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
4713 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
4714 "9e <= -2 - 2a) }";
4715 map1 = isl_map_read_from_str(ctx, str);
4716 pma = isl_pw_multi_aff_from_map(isl_map_copy(map1));
4717 map2 = isl_map_from_pw_multi_aff(pma);
4718 equal = isl_map_is_equal(map1, map2);
4719 isl_map_free(map1);
4720 isl_map_free(map2);
4721
4722 if (equal < 0)
4723 return -1;
4724 if (!equal)
4725 isl_die(ctx, isl_error_unknown, "bad conversion", return -1);
4726
4727 return 0;
4728 }
4729
4730 static int test_conversion(isl_ctx *ctx)
4731 {
4732 if (test_set_conversion(ctx) < 0)
4733 return -1;
4734 if (test_map_conversion(ctx) < 0)
4735 return -1;
4736 return 0;
4737 }
4738
4739 /* Check that isl_basic_map_curry does not modify input.
4740 */
4741 static int test_curry(isl_ctx *ctx)
4742 {
4743 const char *str;
4744 isl_basic_map *bmap1, *bmap2;
4745 int equal;
4746
4747 str = "{ [A[] -> B[]] -> C[] }";
4748 bmap1 = isl_basic_map_read_from_str(ctx, str);
4749 bmap2 = isl_basic_map_curry(isl_basic_map_copy(bmap1));
4750 equal = isl_basic_map_is_equal(bmap1, bmap2);
4751 isl_basic_map_free(bmap1);
4752 isl_basic_map_free(bmap2);
4753
4754 if (equal < 0)
4755 return -1;
4756 if (equal)
4757 isl_die(ctx, isl_error_unknown,
4758 "curried map should not be equal to original",
4759 return -1);
4760
4761 return 0;
4762 }
4763
4764 struct {
4765 const char *set;
4766 const char *ma;
4767 const char *res;
4768 } preimage_tests[] = {
4769 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
4770 "{ A[j,i] -> B[i,j] }",
4771 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
4772 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
4773 "{ A[a,b] -> B[a/2,b/6] }",
4774 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
4775 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
4776 "{ A[a,b] -> B[a/2,b/6] }",
4777 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
4778 "exists i,j : a = 2 i and b = 6 j }" },
4779 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
4780 "[n] -> { : 0 <= n <= 100 }" },
4781 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
4782 "{ A[a] -> B[2a] }",
4783 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
4784 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
4785 "{ A[a] -> B[([a/2])] }",
4786 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
4787 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
4788 "{ A[a] -> B[a,a,a/3] }",
4789 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
4790 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
4791 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
4792 };
4793
4794 static int test_preimage_basic_set(isl_ctx *ctx)
4795 {
4796 int i;
4797 isl_basic_set *bset1, *bset2;
4798 isl_multi_aff *ma;
4799 int equal;
4800
4801 for (i = 0; i < ARRAY_SIZE(preimage_tests); ++i) {
4802 bset1 = isl_basic_set_read_from_str(ctx, preimage_tests[i].set);
4803 ma = isl_multi_aff_read_from_str(ctx, preimage_tests[i].ma);
4804 bset2 = isl_basic_set_read_from_str(ctx, preimage_tests[i].res);
4805 bset1 = isl_basic_set_preimage_multi_aff(bset1, ma);
4806 equal = isl_basic_set_is_equal(bset1, bset2);
4807 isl_basic_set_free(bset1);
4808 isl_basic_set_free(bset2);
4809 if (equal < 0)
4810 return -1;
4811 if (!equal)
4812 isl_die(ctx, isl_error_unknown, "bad preimage",
4813 return -1);
4814 }
4815
4816 return 0;
4817 }
4818
4819 struct {
4820 const char *map;
4821 const char *ma;
4822 const char *res;
4823 } preimage_domain_tests[] = {
4824 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
4825 "{ A[j,i] -> B[i,j] }",
4826 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
4827 { "{ B[i] -> C[i]; D[i] -> E[i] }",
4828 "{ A[i] -> B[i + 1] }",
4829 "{ A[i] -> C[i + 1] }" },
4830 { "{ B[i] -> C[i]; B[i] -> E[i] }",
4831 "{ A[i] -> B[i + 1] }",
4832 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
4833 { "{ B[i] -> C[([i/2])] }",
4834 "{ A[i] -> B[2i] }",
4835 "{ A[i] -> C[i] }" },
4836 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
4837 "{ A[i] -> B[([i/5]), ([i/7])] }",
4838 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
4839 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
4840 "[N] -> { A[] -> B[([N/5])] }",
4841 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
4842 { "{ B[i] -> C[i] : exists a : i = 5 a }",
4843 "{ A[i] -> B[2i] }",
4844 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
4845 { "{ B[i] -> C[i] : exists a : i = 2 a; "
4846 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
4847 "{ A[i] -> B[2i] }",
4848 "{ A[i] -> C[2i] }" },
4849 };
4850
4851 static int test_preimage_union_map(isl_ctx *ctx)
4852 {
4853 int i;
4854 isl_union_map *umap1, *umap2;
4855 isl_multi_aff *ma;
4856 int equal;
4857
4858 for (i = 0; i < ARRAY_SIZE(preimage_domain_tests); ++i) {
4859 umap1 = isl_union_map_read_from_str(ctx,
4860 preimage_domain_tests[i].map);
4861 ma = isl_multi_aff_read_from_str(ctx,
4862 preimage_domain_tests[i].ma);
4863 umap2 = isl_union_map_read_from_str(ctx,
4864 preimage_domain_tests[i].res);
4865 umap1 = isl_union_map_preimage_domain_multi_aff(umap1, ma);
4866 equal = isl_union_map_is_equal(umap1, umap2);
4867 isl_union_map_free(umap1);
4868 isl_union_map_free(umap2);
4869 if (equal < 0)
4870 return -1;
4871 if (!equal)
4872 isl_die(ctx, isl_error_unknown, "bad preimage",
4873 return -1);
4874 }
4875
4876 return 0;
4877 }
4878
4879 static int test_preimage(isl_ctx *ctx)
4880 {
4881 if (test_preimage_basic_set(ctx) < 0)
4882 return -1;
4883 if (test_preimage_union_map(ctx) < 0)
4884 return -1;
4885
4886 return 0;
4887 }
4888
4889 struct {
4890 const char *ma1;
4891 const char *ma;
4892 const char *res;
4893 } pullback_tests[] = {
4894 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
4895 "{ A[a,b] -> C[b + 2a] }" },
4896 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
4897 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
4898 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
4899 "{ A[a] -> C[(a)/6] }" },
4900 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
4901 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
4902 "{ A[a] -> C[(2a)/3] }" },
4903 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
4904 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
4905 "{ A[i,j] -> C[i + j, i + j] }"},
4906 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
4907 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
4908 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
4909 { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }",
4910 "{ [i, j] -> [floor((i)/3), j] }",
4911 "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" },
4912 };
4913
4914 static int test_pullback(isl_ctx *ctx)
4915 {
4916 int i;
4917 isl_multi_aff *ma1, *ma2;
4918 isl_multi_aff *ma;
4919 int equal;
4920
4921 for (i = 0; i < ARRAY_SIZE(pullback_tests); ++i) {
4922 ma1 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma1);
4923 ma = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma);
4924 ma2 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].res);
4925 ma1 = isl_multi_aff_pullback_multi_aff(ma1, ma);
4926 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
4927 isl_multi_aff_free(ma1);
4928 isl_multi_aff_free(ma2);
4929 if (equal < 0)
4930 return -1;
4931 if (!equal)
4932 isl_die(ctx, isl_error_unknown, "bad pullback",
4933 return -1);
4934 }
4935
4936 return 0;
4937 }
4938
4939 /* Check that negation is printed correctly and that equal expressions
4940 * are correctly identified.
4941 */
4942 static int test_ast(isl_ctx *ctx)
4943 {
4944 isl_ast_expr *expr, *expr1, *expr2, *expr3;
4945 char *str;
4946 int ok, equal;
4947
4948 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL));
4949 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL));
4950 expr = isl_ast_expr_add(expr1, expr2);
4951 expr2 = isl_ast_expr_copy(expr);
4952 expr = isl_ast_expr_neg(expr);
4953 expr2 = isl_ast_expr_neg(expr2);
4954 equal = isl_ast_expr_is_equal(expr, expr2);
4955 str = isl_ast_expr_to_str(expr);
4956 ok = str ? !strcmp(str, "-(A + B)") : -1;
4957 free(str);
4958 isl_ast_expr_free(expr);
4959 isl_ast_expr_free(expr2);
4960
4961 if (ok < 0 || equal < 0)
4962 return -1;
4963 if (!equal)
4964 isl_die(ctx, isl_error_unknown,
4965 "equal expressions not considered equal", return -1);
4966 if (!ok)
4967 isl_die(ctx, isl_error_unknown,
4968 "isl_ast_expr printed incorrectly", return -1);
4969
4970 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL));
4971 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL));
4972 expr = isl_ast_expr_add(expr1, expr2);
4973 expr3 = isl_ast_expr_from_id(isl_id_alloc(ctx, "C", NULL));
4974 expr = isl_ast_expr_sub(expr3, expr);
4975 str = isl_ast_expr_to_str(expr);
4976 ok = str ? !strcmp(str, "C - (A + B)") : -1;
4977 free(str);
4978 isl_ast_expr_free(expr);
4979
4980 if (ok < 0)
4981 return -1;
4982 if (!ok)
4983 isl_die(ctx, isl_error_unknown,
4984 "isl_ast_expr printed incorrectly", return -1);
4985
4986 return 0;
4987 }
4988
4989 /* Check that isl_ast_build_expr_from_set returns a valid expression
4990 * for an empty set. Note that isl_ast_build_expr_from_set getting
4991 * called on an empty set probably indicates a bug in the caller.
4992 */
4993 static int test_ast_build(isl_ctx *ctx)
4994 {
4995 isl_set *set;
4996 isl_ast_build *build;
4997 isl_ast_expr *expr;
4998
4999 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5000 build = isl_ast_build_from_context(set);
5001
5002 set = isl_set_empty(isl_space_params_alloc(ctx, 0));
5003 expr = isl_ast_build_expr_from_set(build, set);
5004
5005 isl_ast_expr_free(expr);
5006 isl_ast_build_free(build);
5007
5008 if (!expr)
5009 return -1;
5010
5011 return 0;
5012 }
5013
5014 /* Internal data structure for before_for and after_for callbacks.
5015 *
5016 * depth is the current depth
5017 * before is the number of times before_for has been called
5018 * after is the number of times after_for has been called
5019 */
5020 struct isl_test_codegen_data {
5021 int depth;
5022 int before;
5023 int after;
5024 };
5025
5026 /* This function is called before each for loop in the AST generated
5027 * from test_ast_gen1.
5028 *
5029 * Increment the number of calls and the depth.
5030 * Check that the space returned by isl_ast_build_get_schedule_space
5031 * matches the target space of the schedule returned by
5032 * isl_ast_build_get_schedule.
5033 * Return an isl_id that is checked by the corresponding call
5034 * to after_for.
5035 */
5036 static __isl_give isl_id *before_for(__isl_keep isl_ast_build *build,
5037 void *user)
5038 {
5039 struct isl_test_codegen_data *data = user;
5040 isl_ctx *ctx;
5041 isl_space *space;
5042 isl_union_map *schedule;
5043 isl_union_set *uset;
5044 isl_set *set;
5045 int empty;
5046 char name[] = "d0";
5047
5048 ctx = isl_ast_build_get_ctx(build);
5049
5050 if (data->before >= 3)
5051 isl_die(ctx, isl_error_unknown,
5052 "unexpected number of for nodes", return NULL);
5053 if (data->depth >= 2)
5054 isl_die(ctx, isl_error_unknown,
5055 "unexpected depth", return NULL);
5056
5057 snprintf(name, sizeof(name), "d%d", data->depth);
5058 data->before++;
5059 data->depth++;
5060
5061 schedule = isl_ast_build_get_schedule(build);
5062 uset = isl_union_map_range(schedule);
5063 if (!uset)
5064 return NULL;
5065 if (isl_union_set_n_set(uset) != 1) {
5066 isl_union_set_free(uset);
5067 isl_die(ctx, isl_error_unknown,
5068 "expecting single range space", return NULL);
5069 }
5070
5071 space = isl_ast_build_get_schedule_space(build);
5072 set = isl_union_set_extract_set(uset, space);
5073 isl_union_set_free(uset);
5074 empty = isl_set_is_empty(set);
5075 isl_set_free(set);
5076
5077 if (empty < 0)
5078 return NULL;
5079 if (empty)
5080 isl_die(ctx, isl_error_unknown,
5081 "spaces don't match", return NULL);
5082
5083 return isl_id_alloc(ctx, name, NULL);
5084 }
5085
5086 /* This function is called after each for loop in the AST generated
5087 * from test_ast_gen1.
5088 *
5089 * Increment the number of calls and decrement the depth.
5090 * Check that the annotation attached to the node matches
5091 * the isl_id returned by the corresponding call to before_for.
5092 */
5093 static __isl_give isl_ast_node *after_for(__isl_take isl_ast_node *node,
5094 __isl_keep isl_ast_build *build, void *user)
5095 {
5096 struct isl_test_codegen_data *data = user;
5097 isl_id *id;
5098 const char *name;
5099 int valid;
5100
5101 data->after++;
5102 data->depth--;
5103
5104 if (data->after > data->before)
5105 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
5106 "mismatch in number of for nodes",
5107 return isl_ast_node_free(node));
5108
5109 id = isl_ast_node_get_annotation(node);
5110 if (!id)
5111 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
5112 "missing annotation", return isl_ast_node_free(node));
5113
5114 name = isl_id_get_name(id);
5115 valid = name && atoi(name + 1) == data->depth;
5116 isl_id_free(id);
5117
5118 if (!valid)
5119 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
5120 "wrong annotation", return isl_ast_node_free(node));
5121
5122 return node;
5123 }
5124
5125 /* Check that the before_each_for and after_each_for callbacks
5126 * are called for each for loop in the generated code,
5127 * that they are called in the right order and that the isl_id
5128 * returned from the before_each_for callback is attached to
5129 * the isl_ast_node passed to the corresponding after_each_for call.
5130 */
5131 static int test_ast_gen1(isl_ctx *ctx)
5132 {
5133 const char *str;
5134 isl_set *set;
5135 isl_union_map *schedule;
5136 isl_ast_build *build;
5137 isl_ast_node *tree;
5138 struct isl_test_codegen_data data;
5139
5140 str = "[N] -> { : N >= 10 }";
5141 set = isl_set_read_from_str(ctx, str);
5142 str = "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
5143 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
5144 schedule = isl_union_map_read_from_str(ctx, str);
5145
5146 data.before = 0;
5147 data.after = 0;
5148 data.depth = 0;
5149 build = isl_ast_build_from_context(set);
5150 build = isl_ast_build_set_before_each_for(build,
5151 &before_for, &data);
5152 build = isl_ast_build_set_after_each_for(build,
5153 &after_for, &data);
5154 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5155 isl_ast_build_free(build);
5156 if (!tree)
5157 return -1;
5158
5159 isl_ast_node_free(tree);
5160
5161 if (data.before != 3 || data.after != 3)
5162 isl_die(ctx, isl_error_unknown,
5163 "unexpected number of for nodes", return -1);
5164
5165 return 0;
5166 }
5167
5168 /* Check that the AST generator handles domains that are integrally disjoint
5169 * but not rationally disjoint.
5170 */
5171 static int test_ast_gen2(isl_ctx *ctx)
5172 {
5173 const char *str;
5174 isl_set *set;
5175 isl_union_map *schedule;
5176 isl_union_map *options;
5177 isl_ast_build *build;
5178 isl_ast_node *tree;
5179
5180 str = "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
5181 schedule = isl_union_map_read_from_str(ctx, str);
5182 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5183 build = isl_ast_build_from_context(set);
5184
5185 str = "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
5186 options = isl_union_map_read_from_str(ctx, str);
5187 build = isl_ast_build_set_options(build, options);
5188 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5189 isl_ast_build_free(build);
5190 if (!tree)
5191 return -1;
5192 isl_ast_node_free(tree);
5193
5194 return 0;
5195 }
5196
5197 /* Increment *user on each call.
5198 */
5199 static __isl_give isl_ast_node *count_domains(__isl_take isl_ast_node *node,
5200 __isl_keep isl_ast_build *build, void *user)
5201 {
5202 int *n = user;
5203
5204 (*n)++;
5205
5206 return node;
5207 }
5208
5209 /* Test that unrolling tries to minimize the number of instances.
5210 * In particular, for the schedule given below, make sure it generates
5211 * 3 nodes (rather than 101).
5212 */
5213 static int test_ast_gen3(isl_ctx *ctx)
5214 {
5215 const char *str;
5216 isl_set *set;
5217 isl_union_map *schedule;
5218 isl_union_map *options;
5219 isl_ast_build *build;
5220 isl_ast_node *tree;
5221 int n_domain = 0;
5222
5223 str = "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
5224 schedule = isl_union_map_read_from_str(ctx, str);
5225 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5226
5227 str = "{ [i] -> unroll[0] }";
5228 options = isl_union_map_read_from_str(ctx, str);
5229
5230 build = isl_ast_build_from_context(set);
5231 build = isl_ast_build_set_options(build, options);
5232 build = isl_ast_build_set_at_each_domain(build,
5233 &count_domains, &n_domain);
5234 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5235 isl_ast_build_free(build);
5236 if (!tree)
5237 return -1;
5238
5239 isl_ast_node_free(tree);
5240
5241 if (n_domain != 3)
5242 isl_die(ctx, isl_error_unknown,
5243 "unexpected number of for nodes", return -1);
5244
5245 return 0;
5246 }
5247
5248 /* Check that if the ast_build_exploit_nested_bounds options is set,
5249 * we do not get an outer if node in the generated AST,
5250 * while we do get such an outer if node if the options is not set.
5251 */
5252 static int test_ast_gen4(isl_ctx *ctx)
5253 {
5254 const char *str;
5255 isl_set *set;
5256 isl_union_map *schedule;
5257 isl_ast_build *build;
5258 isl_ast_node *tree;
5259 enum isl_ast_node_type type;
5260 int enb;
5261
5262 enb = isl_options_get_ast_build_exploit_nested_bounds(ctx);
5263 str = "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
5264
5265 isl_options_set_ast_build_exploit_nested_bounds(ctx, 1);
5266
5267 schedule = isl_union_map_read_from_str(ctx, str);
5268 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5269 build = isl_ast_build_from_context(set);
5270 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5271 isl_ast_build_free(build);
5272 if (!tree)
5273 return -1;
5274
5275 type = isl_ast_node_get_type(tree);
5276 isl_ast_node_free(tree);
5277
5278 if (type == isl_ast_node_if)
5279 isl_die(ctx, isl_error_unknown,
5280 "not expecting if node", return -1);
5281
5282 isl_options_set_ast_build_exploit_nested_bounds(ctx, 0);
5283
5284 schedule = isl_union_map_read_from_str(ctx, str);
5285 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5286 build = isl_ast_build_from_context(set);
5287 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5288 isl_ast_build_free(build);
5289 if (!tree)
5290 return -1;
5291
5292 type = isl_ast_node_get_type(tree);
5293 isl_ast_node_free(tree);
5294
5295 if (type != isl_ast_node_if)
5296 isl_die(ctx, isl_error_unknown,
5297 "expecting if node", return -1);
5298
5299 isl_options_set_ast_build_exploit_nested_bounds(ctx, enb);
5300
5301 return 0;
5302 }
5303
5304 /* This function is called for each leaf in the AST generated
5305 * from test_ast_gen5.
5306 *
5307 * We finalize the AST generation by extending the outer schedule
5308 * with a zero-dimensional schedule. If this results in any for loops,
5309 * then this means that we did not pass along enough information
5310 * about the outer schedule to the inner AST generation.
5311 */
5312 static __isl_give isl_ast_node *create_leaf(__isl_take isl_ast_build *build,
5313 void *user)
5314 {
5315 isl_union_map *schedule, *extra;
5316 isl_ast_node *tree;
5317
5318 schedule = isl_ast_build_get_schedule(build);
5319 extra = isl_union_map_copy(schedule);
5320 extra = isl_union_map_from_domain(isl_union_map_domain(extra));
5321 schedule = isl_union_map_range_product(schedule, extra);
5322 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5323 isl_ast_build_free(build);
5324
5325 if (!tree)
5326 return NULL;
5327
5328 if (isl_ast_node_get_type(tree) == isl_ast_node_for)
5329 isl_die(isl_ast_node_get_ctx(tree), isl_error_unknown,
5330 "code should not contain any for loop",
5331 return isl_ast_node_free(tree));
5332
5333 return tree;
5334 }
5335
5336 /* Check that we do not lose any information when going back and
5337 * forth between internal and external schedule.
5338 *
5339 * In particular, we create an AST where we unroll the only
5340 * non-constant dimension in the schedule. We therefore do
5341 * not expect any for loops in the AST. However, older versions
5342 * of isl would not pass along enough information about the outer
5343 * schedule when performing an inner code generation from a create_leaf
5344 * callback, resulting in the inner code generation producing a for loop.
5345 */
5346 static int test_ast_gen5(isl_ctx *ctx)
5347 {
5348 const char *str;
5349 isl_set *set;
5350 isl_union_map *schedule, *options;
5351 isl_ast_build *build;
5352 isl_ast_node *tree;
5353
5354 str = "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
5355 schedule = isl_union_map_read_from_str(ctx, str);
5356
5357 str = "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
5358 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
5359 options = isl_union_map_read_from_str(ctx, str);
5360
5361 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5362 build = isl_ast_build_from_context(set);
5363 build = isl_ast_build_set_options(build, options);
5364 build = isl_ast_build_set_create_leaf(build, &create_leaf, NULL);
5365 tree = isl_ast_build_node_from_schedule_map(build, schedule);
5366 isl_ast_build_free(build);
5367 isl_ast_node_free(tree);
5368 if (!tree)
5369 return -1;
5370
5371 return 0;
5372 }
5373
5374 static int test_ast_gen(isl_ctx *ctx)
5375 {
5376 if (test_ast_gen1(ctx) < 0)
5377 return -1;
5378 if (test_ast_gen2(ctx) < 0)
5379 return -1;
5380 if (test_ast_gen3(ctx) < 0)
5381 return -1;
5382 if (test_ast_gen4(ctx) < 0)
5383 return -1;
5384 if (test_ast_gen5(ctx) < 0)
5385 return -1;
5386 return 0;
5387 }
5388
5389 /* Check if dropping output dimensions from an isl_pw_multi_aff
5390 * works properly.
5391 */
5392 static int test_pw_multi_aff(isl_ctx *ctx)
5393 {
5394 const char *str;
5395 isl_pw_multi_aff *pma1, *pma2;
5396 int equal;
5397
5398 str = "{ [i,j] -> [i+j, 4i-j] }";
5399 pma1 = isl_pw_multi_aff_read_from_str(ctx, str);
5400 str = "{ [i,j] -> [4i-j] }";
5401 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
5402
5403 pma1 = isl_pw_multi_aff_drop_dims(pma1, isl_dim_out, 0, 1);
5404
5405 equal = isl_pw_multi_aff_plain_is_equal(pma1, pma2);
5406
5407 isl_pw_multi_aff_free(pma1);
5408 isl_pw_multi_aff_free(pma2);
5409 if (equal < 0)
5410 return -1;
5411 if (!equal)
5412 isl_die(ctx, isl_error_unknown,
5413 "expressions not equal", return -1);
5414
5415 return 0;
5416 }
5417
5418 /* Check that we can properly parse multi piecewise affine expressions
5419 * where the piecewise affine expressions have different domains.
5420 */
5421 static int test_multi_pw_aff(isl_ctx *ctx)
5422 {
5423 const char *str;
5424 isl_set *dom, *dom2;
5425 isl_multi_pw_aff *mpa1, *mpa2;
5426 isl_pw_aff *pa;
5427 int equal;
5428 int equal_domain;
5429
5430 mpa1 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [i] }");
5431 dom = isl_set_read_from_str(ctx, "{ [i] : i > 0 }");
5432 mpa1 = isl_multi_pw_aff_intersect_domain(mpa1, dom);
5433 mpa2 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [2i] }");
5434 mpa2 = isl_multi_pw_aff_flat_range_product(mpa1, mpa2);
5435 str = "{ [i] -> [(i : i > 0), 2i] }";
5436 mpa1 = isl_multi_pw_aff_read_from_str(ctx, str);
5437
5438 equal = isl_multi_pw_aff_plain_is_equal(mpa1, mpa2);
5439
5440 pa = isl_multi_pw_aff_get_pw_aff(mpa1, 0);
5441 dom = isl_pw_aff_domain(pa);
5442 pa = isl_multi_pw_aff_get_pw_aff(mpa1, 1);
5443 dom2 = isl_pw_aff_domain(pa);
5444 equal_domain = isl_set_is_equal(dom, dom2);
5445
5446 isl_set_free(dom);
5447 isl_set_free(dom2);
5448 isl_multi_pw_aff_free(mpa1);
5449 isl_multi_pw_aff_free(mpa2);
5450
5451 if (equal < 0)
5452 return -1;
5453 if (!equal)
5454 isl_die(ctx, isl_error_unknown,
5455 "expressions not equal", return -1);
5456
5457 if (equal_domain < 0)
5458 return -1;
5459 if (equal_domain)
5460 isl_die(ctx, isl_error_unknown,
5461 "domains unexpectedly equal", return -1);
5462
5463 return 0;
5464 }
5465
5466 /* This is a regression test for a bug where isl_basic_map_simplify
5467 * would end up in an infinite loop. In particular, we construct
5468 * an empty basic set that is not obviously empty.
5469 * isl_basic_set_is_empty marks the basic set as empty.
5470 * After projecting out i3, the variable can be dropped completely,
5471 * but isl_basic_map_simplify refrains from doing so if the basic set
5472 * is empty and would end up in an infinite loop if it didn't test
5473 * explicitly for empty basic maps in the outer loop.
5474 */
5475 static int test_simplify(isl_ctx *ctx)
5476 {
5477 const char *str;
5478 isl_basic_set *bset;
5479 int empty;
5480
5481 str = "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
5482 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
5483 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
5484 "i3 >= i2 }";
5485 bset = isl_basic_set_read_from_str(ctx, str);
5486 empty = isl_basic_set_is_empty(bset);
5487 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
5488 isl_basic_set_free(bset);
5489 if (!bset)
5490 return -1;
5491 if (!empty)
5492 isl_die(ctx, isl_error_unknown,
5493 "basic set should be empty", return -1);
5494
5495 return 0;
5496 }
5497
5498 /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
5499 * with gbr context would fail to disable the use of the shifted tableau
5500 * when transferring equalities for the input to the context, resulting
5501 * in invalid sample values.
5502 */
5503 static int test_partial_lexmin(isl_ctx *ctx)
5504 {
5505 const char *str;
5506 isl_basic_set *bset;
5507 isl_basic_map *bmap;
5508 isl_map *map;
5509
5510 str = "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
5511 bmap = isl_basic_map_read_from_str(ctx, str);
5512 str = "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
5513 bset = isl_basic_set_read_from_str(ctx, str);
5514 map = isl_basic_map_partial_lexmin(bmap, bset, NULL);
5515 isl_map_free(map);
5516
5517 if (!map)
5518 return -1;
5519
5520 return 0;
5521 }
5522
5523 /* Check that the variable compression performed on the existentially
5524 * quantified variables inside isl_basic_set_compute_divs is not confused
5525 * by the implicit equalities among the parameters.
5526 */
5527 static int test_compute_divs(isl_ctx *ctx)
5528 {
5529 const char *str;
5530 isl_basic_set *bset;
5531 isl_set *set;
5532
5533 str = "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
5534 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
5535 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
5536 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
5537 bset = isl_basic_set_read_from_str(ctx, str);
5538 set = isl_basic_set_compute_divs(bset);
5539 isl_set_free(set);
5540 if (!set)
5541 return -1;
5542
5543 return 0;
5544 }
5545
5546 /* Check that the reaching domain elements and the prefix schedule
5547 * at a leaf node are the same before and after grouping.
5548 */
5549 static int test_schedule_tree_group_1(isl_ctx *ctx)
5550 {
5551 int equal;
5552 const char *str;
5553 isl_id *id;
5554 isl_union_set *uset;
5555 isl_multi_union_pw_aff *mupa;
5556 isl_union_pw_multi_aff *upma1, *upma2;
5557 isl_union_set *domain1, *domain2;
5558 isl_union_map *umap1, *umap2;
5559 isl_schedule_node *node;
5560
5561 str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
5562 uset = isl_union_set_read_from_str(ctx, str);
5563 node = isl_schedule_node_from_domain(uset);
5564 node = isl_schedule_node_child(node, 0);
5565 str = "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]";
5566 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5567 node = isl_schedule_node_insert_partial_schedule(node, mupa);
5568 node = isl_schedule_node_child(node, 0);
5569 str = "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]";
5570 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5571 node = isl_schedule_node_insert_partial_schedule(node, mupa);
5572 node = isl_schedule_node_child(node, 0);
5573 umap1 = isl_schedule_node_get_prefix_schedule_union_map(node);
5574 upma1 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node);
5575 domain1 = isl_schedule_node_get_domain(node);
5576 id = isl_id_alloc(ctx, "group", NULL);
5577 node = isl_schedule_node_parent(node);
5578 node = isl_schedule_node_group(node, id);
5579 node = isl_schedule_node_child(node, 0);
5580 umap2 = isl_schedule_node_get_prefix_schedule_union_map(node);
5581 upma2 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node);
5582 domain2 = isl_schedule_node_get_domain(node);
5583 equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2);
5584 if (equal >= 0 && equal)
5585 equal = isl_union_set_is_equal(domain1, domain2);
5586 if (equal >= 0 && equal)
5587 equal = isl_union_map_is_equal(umap1, umap2);
5588 isl_union_map_free(umap1);
5589 isl_union_map_free(umap2);
5590 isl_union_set_free(domain1);
5591 isl_union_set_free(domain2);
5592 isl_union_pw_multi_aff_free(upma1);
5593 isl_union_pw_multi_aff_free(upma2);
5594 isl_schedule_node_free(node);
5595
5596 if (equal < 0)
5597 return -1;
5598 if (!equal)
5599 isl_die(ctx, isl_error_unknown,
5600 "expressions not equal", return -1);
5601
5602 return 0;
5603 }
5604
5605 /* Check that we can have nested groupings and that the union map
5606 * schedule representation is the same before and after the grouping.
5607 * Note that after the grouping, the union map representation contains
5608 * the domain constraints from the ranges of the expansion nodes,
5609 * while they are missing from the union map representation of
5610 * the tree without expansion nodes.
5611 *
5612 * Also check that the global expansion is as expected.
5613 */
5614 static int test_schedule_tree_group_2(isl_ctx *ctx)
5615 {
5616 int equal, equal_expansion;
5617 const char *str;
5618 isl_id *id;
5619 isl_union_set *uset;
5620 isl_union_map *umap1, *umap2;
5621 isl_union_map *expansion1, *expansion2;
5622 isl_union_set_list *filters;
5623 isl_multi_union_pw_aff *mupa;
5624 isl_schedule *schedule;
5625 isl_schedule_node *node;
5626
5627 str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; "
5628 "S3[i,j] : 0 <= i,j < 10 }";
5629 uset = isl_union_set_read_from_str(ctx, str);
5630 node = isl_schedule_node_from_domain(uset);
5631 node = isl_schedule_node_child(node, 0);
5632 str = "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]";
5633 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5634 node = isl_schedule_node_insert_partial_schedule(node, mupa);
5635 node = isl_schedule_node_child(node, 0);
5636 str = "{ S1[i,j] }";
5637 uset = isl_union_set_read_from_str(ctx, str);
5638 filters = isl_union_set_list_from_union_set(uset);
5639 str = "{ S2[i,j]; S3[i,j] }";
5640 uset = isl_union_set_read_from_str(ctx, str);
5641 filters = isl_union_set_list_add(filters, uset);
5642 node = isl_schedule_node_insert_sequence(node, filters);
5643 node = isl_schedule_node_child(node, 1);
5644 node = isl_schedule_node_child(node, 0);
5645 str = "{ S2[i,j] }";
5646 uset = isl_union_set_read_from_str(ctx, str);
5647 filters = isl_union_set_list_from_union_set(uset);
5648 str = "{ S3[i,j] }";
5649 uset = isl_union_set_read_from_str(ctx, str);
5650 filters = isl_union_set_list_add(filters, uset);
5651 node = isl_schedule_node_insert_sequence(node, filters);
5652
5653 schedule = isl_schedule_node_get_schedule(node);
5654 umap1 = isl_schedule_get_map(schedule);
5655 uset = isl_schedule_get_domain(schedule);
5656 umap1 = isl_union_map_intersect_domain(umap1, uset);
5657 isl_schedule_free(schedule);
5658
5659 node = isl_schedule_node_parent(node);
5660 node = isl_schedule_node_parent(node);
5661 id = isl_id_alloc(ctx, "group1", NULL);
5662 node = isl_schedule_node_group(node, id);
5663 node = isl_schedule_node_child(node, 1);
5664 node = isl_schedule_node_child(node, 0);
5665 id = isl_id_alloc(ctx, "group2", NULL);
5666 node = isl_schedule_node_group(node, id);
5667
5668 schedule = isl_schedule_node_get_schedule(node);
5669 umap2 = isl_schedule_get_map(schedule);
5670 isl_schedule_free(schedule);
5671
5672 node = isl_schedule_node_root(node);
5673 node = isl_schedule_node_child(node, 0);
5674 expansion1 = isl_schedule_node_get_subtree_expansion(node);
5675 isl_schedule_node_free(node);
5676
5677 str = "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; "
5678 "group1[i] -> S2[i,j] : 0 <= i,j < 10; "
5679 "group1[i] -> S3[i,j] : 0 <= i,j < 10 }";
5680
5681 expansion2 = isl_union_map_read_from_str(ctx, str);
5682
5683 equal = isl_union_map_is_equal(umap1, umap2);
5684 equal_expansion = isl_union_map_is_equal(expansion1, expansion2);
5685
5686 isl_union_map_free(umap1);
5687 isl_union_map_free(umap2);
5688 isl_union_map_free(expansion1);
5689 isl_union_map_free(expansion2);
5690
5691 if (equal < 0 || equal_expansion < 0)
5692 return -1;
5693 if (!equal)
5694 isl_die(ctx, isl_error_unknown,
5695 "expressions not equal", return -1);
5696 if (!equal_expansion)
5697 isl_die(ctx, isl_error_unknown,
5698 "unexpected expansion", return -1);
5699
5700 return 0;
5701 }
5702
5703 /* Some tests for the isl_schedule_node_group function.
5704 */
5705 static int test_schedule_tree_group(isl_ctx *ctx)
5706 {
5707 if (test_schedule_tree_group_1(ctx) < 0)
5708 return -1;
5709 if (test_schedule_tree_group_2(ctx) < 0)
5710 return -1;
5711 return 0;
5712 }
5713
5714 struct {
5715 const char *set;
5716 const char *dual;
5717 } coef_tests[] = {
5718 { "{ rat: [i] : 0 <= i <= 10 }",
5719 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
5720 { "{ rat: [i] : FALSE }",
5721 "{ rat: coefficients[[cst] -> [a]] }" },
5722 { "{ rat: [i] : }",
5723 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
5724 };
5725
5726 struct {
5727 const char *set;
5728 const char *dual;
5729 } sol_tests[] = {
5730 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
5731 "{ rat: [i] : 0 <= i <= 10 }" },
5732 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
5733 "{ rat: [i] }" },
5734 { "{ rat: coefficients[[cst] -> [a]] }",
5735 "{ rat: [i] : FALSE }" },
5736 };
5737
5738 /* Test the basic functionality of isl_basic_set_coefficients and
5739 * isl_basic_set_solutions.
5740 */
5741 static int test_dual(isl_ctx *ctx)
5742 {
5743 int i;
5744
5745 for (i = 0; i < ARRAY_SIZE(coef_tests); ++i) {
5746 int equal;
5747 isl_basic_set *bset1, *bset2;
5748
5749 bset1 = isl_basic_set_read_from_str(ctx, coef_tests[i].set);
5750 bset2 = isl_basic_set_read_from_str(ctx, coef_tests[i].dual);
5751 bset1 = isl_basic_set_coefficients(bset1);
5752 equal = isl_basic_set_is_equal(bset1, bset2);
5753 isl_basic_set_free(bset1);
5754 isl_basic_set_free(bset2);
5755 if (equal < 0)
5756 return -1;
5757 if (!equal)
5758 isl_die(ctx, isl_error_unknown,
5759 "incorrect dual", return -1);
5760 }
5761
5762 for (i = 0; i < ARRAY_SIZE(sol_tests); ++i) {
5763 int equal;
5764 isl_basic_set *bset1, *bset2;
5765
5766 bset1 = isl_basic_set_read_from_str(ctx, sol_tests[i].set);
5767 bset2 = isl_basic_set_read_from_str(ctx, sol_tests[i].dual);
5768 bset1 = isl_basic_set_solutions(bset1);
5769 equal = isl_basic_set_is_equal(bset1, bset2);
5770 isl_basic_set_free(bset1);
5771 isl_basic_set_free(bset2);
5772 if (equal < 0)
5773 return -1;
5774 if (!equal)
5775 isl_die(ctx, isl_error_unknown,
5776 "incorrect dual", return -1);
5777 }
5778
5779 return 0;
5780 }
5781
5782 struct {
5783 int scale_tile;
5784 int shift_point;
5785 const char *domain;
5786 const char *schedule;
5787 const char *sizes;
5788 const char *tile;
5789 const char *point;
5790 } tile_tests[] = {
5791 { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
5792 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5793 "{ [32,32] }",
5794 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
5795 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5796 },
5797 { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
5798 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5799 "{ [32,32] }",
5800 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
5801 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5802 },
5803 { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
5804 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5805 "{ [32,32] }",
5806 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
5807 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
5808 },
5809 { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
5810 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
5811 "{ [32,32] }",
5812 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
5813 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
5814 },
5815 };
5816
5817 /* Basic tiling tests. Create a schedule tree with a domain and a band node,
5818 * tile the band and then check if the tile and point bands have the
5819 * expected partial schedule.
5820 */
5821 static int test_tile(isl_ctx *ctx)
5822 {
5823 int i;
5824 int scale;
5825 int shift;
5826
5827 scale = isl_options_get_tile_scale_tile_loops(ctx);
5828 shift = isl_options_get_tile_shift_point_loops(ctx);
5829
5830 for (i = 0; i < ARRAY_SIZE(tile_tests); ++i) {
5831 int opt;
5832 int equal;
5833 const char *str;
5834 isl_union_set *domain;
5835 isl_multi_union_pw_aff *mupa, *mupa2;
5836 isl_schedule_node *node;
5837 isl_multi_val *sizes;
5838
5839 opt = tile_tests[i].scale_tile;
5840 isl_options_set_tile_scale_tile_loops(ctx, opt);
5841 opt = tile_tests[i].shift_point;
5842 isl_options_set_tile_shift_point_loops(ctx, opt);
5843
5844 str = tile_tests[i].domain;
5845 domain = isl_union_set_read_from_str(ctx, str);
5846 node = isl_schedule_node_from_domain(domain);
5847 node = isl_schedule_node_child(node, 0);
5848 str = tile_tests[i].schedule;
5849 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5850 node = isl_schedule_node_insert_partial_schedule(node, mupa);
5851 str = tile_tests[i].sizes;
5852 sizes = isl_multi_val_read_from_str(ctx, str);
5853 node = isl_schedule_node_band_tile(node, sizes);
5854
5855 str = tile_tests[i].tile;
5856 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5857 mupa2 = isl_schedule_node_band_get_partial_schedule(node);
5858 equal = isl_multi_union_pw_aff_plain_is_equal(mupa, mupa2);
5859 isl_multi_union_pw_aff_free(mupa);
5860 isl_multi_union_pw_aff_free(mupa2);
5861
5862 node = isl_schedule_node_child(node, 0);
5863
5864 str = tile_tests[i].point;
5865 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
5866 mupa2 = isl_schedule_node_band_get_partial_schedule(node);
5867 if (equal >= 0 && equal)
5868 equal = isl_multi_union_pw_aff_plain_is_equal(mupa,
5869 mupa2);
5870 isl_multi_union_pw_aff_free(mupa);
5871 isl_multi_union_pw_aff_free(mupa2);
5872
5873 isl_schedule_node_free(node);
5874
5875 if (equal < 0)
5876 return -1;
5877 if (!equal)
5878 isl_die(ctx, isl_error_unknown,
5879 "unexpected result", return -1);
5880 }
5881
5882 isl_options_set_tile_scale_tile_loops(ctx, scale);
5883 isl_options_set_tile_shift_point_loops(ctx, shift);
5884
5885 return 0;
5886 }
5887
5888 struct {
5889 const char *name;
5890 int (*fn)(isl_ctx *ctx);
5891 } tests [] = {
5892 { "dual", &test_dual },
5893 { "dependence analysis", &test_flow },
5894 { "val", &test_val },
5895 { "compute divs", &test_compute_divs },
5896 { "partial lexmin", &test_partial_lexmin },
5897 { "simplify", &test_simplify },
5898 { "curry", &test_curry },
5899 { "piecewise multi affine expressions", &test_pw_multi_aff },
5900 { "multi piecewise affine expressions", &test_multi_pw_aff },
5901 { "conversion", &test_conversion },
5902 { "list", &test_list },
5903 { "align parameters", &test_align_parameters },
5904 { "preimage", &test_preimage },
5905 { "pullback", &test_pullback },
5906 { "AST", &test_ast },
5907 { "AST build", &test_ast_build },
5908 { "AST generation", &test_ast_gen },
5909 { "eliminate", &test_eliminate },
5910 { "residue class", &test_residue_class },
5911 { "div", &test_div },
5912 { "slice", &test_slice },
5913 { "fixed power", &test_fixed_power },
5914 { "sample", &test_sample },
5915 { "output", &test_output },
5916 { "vertices", &test_vertices },
5917 { "fixed", &test_fixed },
5918 { "equal", &test_equal },
5919 { "disjoint", &test_disjoint },
5920 { "product", &test_product },
5921 { "dim_max", &test_dim_max },
5922 { "affine", &test_aff },
5923 { "injective", &test_injective },
5924 { "schedule", &test_schedule },
5925 { "schedule tree grouping", &test_schedule_tree_group },
5926 { "tile", &test_tile },
5927 { "union_pw", &test_union_pw },
5928 { "parse", &test_parse },
5929 { "single-valued", &test_sv },
5930 { "affine hull", &test_affine_hull },
5931 { "coalesce", &test_coalesce },
5932 { "factorize", &test_factorize },
5933 { "subset", &test_subset },
5934 { "subtract", &test_subtract },
5935 { "lexmin", &test_lexmin },
5936 { "min", &test_min },
5937 { "gist", &test_gist },
5938 { "piecewise quasi-polynomials", &test_pwqp },
5939 { "lift", &test_lift },
5940 { "bound", &test_bound },
5941 { "union", &test_union },
5942 { "split periods", &test_split_periods },
5943 { "lexicographic order", &test_lex },
5944 { "bijectivity", &test_bijective },
5945 { "dataflow analysis", &test_dep },
5946 { "reading", &test_read },
5947 { "bounded", &test_bounded },
5948 { "construction", &test_construction },
5949 { "dimension manipulation", &test_dim },
5950 { "map application", &test_application },
5951 { "convex hull", &test_convex_hull },
5952 { "transitive closure", &test_closure },
5953 };
5954
5955 int main(int argc, char **argv)
5956 {
5957 int i;
5958 struct isl_ctx *ctx;
5959 struct isl_options *options;
5960
5961 srcdir = getenv("srcdir");
5962 assert(srcdir);
5963
5964 options = isl_options_new_with_defaults();
5965 assert(options);
5966 argc = isl_options_parse(options, argc, argv, ISL_ARG_ALL);
5967
5968 ctx = isl_ctx_alloc_with_options(&isl_options_args, options);
5969 for (i = 0; i < ARRAY_SIZE(tests); ++i) {
5970 printf("%s\n", tests[i].name);
5971 if (tests[i].fn(ctx) < 0)
5972 goto error;
5973 }
5974 isl_ctx_free(ctx);
5975 return 0;
5976 error:
5977 isl_ctx_free(ctx);
5978 return -1;
5979 }
Integer set library