?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
document that isl_local_space_get_div cannot be used on map spaces
[isl.git] / isl_test.c
blobe086b93847bb7d39a91db7490855e06155add1f3
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 *
4 * Use of this software is governed by the MIT license
5 *
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
8 */
9
10 #include <assert.h>
11 #include <stdio.h>
12 #include <limits.h>
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_aff_private.h>
16 #include <isl/set.h>
17 #include <isl/flow.h>
18 #include <isl/constraint.h>
19 #include <isl/polynomial.h>
20 #include <isl/union_map.h>
21 #include <isl_factorization.h>
22 #include <isl/schedule.h>
23 #include <isl_options_private.h>
24 #include <isl/vertices.h>
25 #include <isl/ast_build.h>
26
27 #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array))
28
29 static char *srcdir;
30
31 static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) {
32 char *filename;
33 int length;
34 char *pattern = "%s/test_inputs/%s.%s";
35
36 length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name)
37 + strlen(suffix) + 1;
38 filename = isl_alloc_array(ctx, char, length);
39
40 if (!filename)
41 return NULL;
42
43 sprintf(filename, pattern, srcdir, name, suffix);
44
45 return filename;
46 }
47
48 void test_parse_map(isl_ctx *ctx, const char *str)
49 {
50 isl_map *map;
51
52 map = isl_map_read_from_str(ctx, str);
53 assert(map);
54 isl_map_free(map);
55 }
56
57 int test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2)
58 {
59 isl_map *map, *map2;
60 int equal;
61
62 map = isl_map_read_from_str(ctx, str);
63 map2 = isl_map_read_from_str(ctx, str2);
64 equal = isl_map_is_equal(map, map2);
65 isl_map_free(map);
66 isl_map_free(map2);
67
68 if (equal < 0)
69 return -1;
70 if (!equal)
71 isl_die(ctx, isl_error_unknown, "maps not equal",
72 return -1);
73
74 return 0;
75 }
76
77 void test_parse_pwqp(isl_ctx *ctx, const char *str)
78 {
79 isl_pw_qpolynomial *pwqp;
80
81 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
82 assert(pwqp);
83 isl_pw_qpolynomial_free(pwqp);
84 }
85
86 static void test_parse_pwaff(isl_ctx *ctx, const char *str)
87 {
88 isl_pw_aff *pwaff;
89
90 pwaff = isl_pw_aff_read_from_str(ctx, str);
91 assert(pwaff);
92 isl_pw_aff_free(pwaff);
93 }
94
95 int test_parse(struct isl_ctx *ctx)
96 {
97 isl_map *map, *map2;
98 const char *str, *str2;
99
100 str = "{ [i] -> [-i] }";
101 map = isl_map_read_from_str(ctx, str);
102 assert(map);
103 isl_map_free(map);
104
105 str = "{ A[i] -> L[([i/3])] }";
106 map = isl_map_read_from_str(ctx, str);
107 assert(map);
108 isl_map_free(map);
109
110 test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
111 test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : "
112 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
113
114 str = "{ [x,y] : [([x/2]+y)/3] >= 1 }";
115 str2 = "{ [x, y] : 2y >= 6 - x }";
116 if (test_parse_map_equal(ctx, str, str2) < 0)
117 return -1;
118
119 if (test_parse_map_equal(ctx, "{ [x,y] : x <= min(y, 2*y+3) }",
120 "{ [x,y] : x <= y, 2*y + 3 }") < 0)
121 return -1;
122 str = "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }";
123 if (test_parse_map_equal(ctx, "{ [x,y] : x >= min(y, 2*y+3) }",
124 str) < 0)
125 return -1;
126
127 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
128 map = isl_map_read_from_str(ctx, str);
129 str = "{ [new, old] -> [o0, o1] : "
130 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
131 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
132 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
133 map2 = isl_map_read_from_str(ctx, str);
134 assert(isl_map_is_equal(map, map2));
135 isl_map_free(map);
136 isl_map_free(map2);
137
138 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
139 map = isl_map_read_from_str(ctx, str);
140 str = "{[new,old] -> [(new+1)%2,(old+1)%2]}";
141 map2 = isl_map_read_from_str(ctx, str);
142 assert(isl_map_is_equal(map, map2));
143 isl_map_free(map);
144 isl_map_free(map2);
145
146 str = "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }";
147 str2 = "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }";
148 if (test_parse_map_equal(ctx, str, str2) < 0)
149 return -1;
150
151 str = "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }";
152 str2 = "{ [i,j] -> [min(i,j)] }";
153 if (test_parse_map_equal(ctx, str, str2) < 0)
154 return -1;
155
156 str = "{ [i,j] : i != j }";
157 str2 = "{ [i,j] : i < j or i > j }";
158 if (test_parse_map_equal(ctx, str, str2) < 0)
159 return -1;
160
161 str = "{ [i,j] : (i+1)*2 >= j }";
162 str2 = "{ [i, j] : j <= 2 + 2i }";
163 if (test_parse_map_equal(ctx, str, str2) < 0)
164 return -1;
165
166 str = "{ [i] -> [i > 0 ? 4 : 5] }";
167 str2 = "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }";
168 if (test_parse_map_equal(ctx, str, str2) < 0)
169 return -1;
170
171 str = "[N=2,M] -> { [i=[(M+N)/4]] }";
172 str2 = "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }";
173 if (test_parse_map_equal(ctx, str, str2) < 0)
174 return -1;
175
176 str = "{ [x] : x >= 0 }";
177 str2 = "{ [x] : x-0 >= 0 }";
178 if (test_parse_map_equal(ctx, str, str2) < 0)
179 return -1;
180
181 str = "{ [i] : ((i > 10)) }";
182 str2 = "{ [i] : i >= 11 }";
183 if (test_parse_map_equal(ctx, str, str2) < 0)
184 return -1;
185
186 str = "{ [i] -> [0] }";
187 str2 = "{ [i] -> [0 * i] }";
188 if (test_parse_map_equal(ctx, str, str2) < 0)
189 return -1;
190
191 test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }");
192 test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
193 test_parse_pwaff(ctx, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
194 test_parse_pwqp(ctx, "{ [x] -> ([(x)/2] * [(x)/3]) }");
195
196 if (test_parse_map_equal(ctx, "{ [a] -> [b] : (not false) }",
197 "{ [a] -> [b] : true }") < 0)
198 return -1;
199
200 if (test_parse_map_equal(ctx, "{ [i] : i/2 <= 5 }",
201 "{ [i] : i <= 10 }") < 0)
202 return -1;
203
204 if (test_parse_map_equal(ctx, "{Sym=[n] [i] : i <= n }",
205 "[n] -> { [i] : i <= n }") < 0)
206 return -1;
207
208 if (test_parse_map_equal(ctx, "{ [*] }", "{ [a] }") < 0)
209 return -1;
210
211 return 0;
212 }
213
214 void test_read(struct isl_ctx *ctx)
215 {
216 char *filename;
217 FILE *input;
218 struct isl_basic_set *bset1, *bset2;
219 const char *str = "{[y]: Exists ( alpha : 2alpha = y)}";
220
221 filename = get_filename(ctx, "set", "omega");
222 assert(filename);
223 input = fopen(filename, "r");
224 assert(input);
225
226 bset1 = isl_basic_set_read_from_file(ctx, input);
227 bset2 = isl_basic_set_read_from_str(ctx, str);
228
229 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
230
231 isl_basic_set_free(bset1);
232 isl_basic_set_free(bset2);
233 free(filename);
234
235 fclose(input);
236 }
237
238 void test_bounded(struct isl_ctx *ctx)
239 {
240 isl_set *set;
241 int bounded;
242
243 set = isl_set_read_from_str(ctx, "[n] -> {[i] : 0 <= i <= n }");
244 bounded = isl_set_is_bounded(set);
245 assert(bounded);
246 isl_set_free(set);
247
248 set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }");
249 bounded = isl_set_is_bounded(set);
250 assert(!bounded);
251 isl_set_free(set);
252
253 set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }");
254 bounded = isl_set_is_bounded(set);
255 assert(!bounded);
256 isl_set_free(set);
257 }
258
259 /* Construct the basic set { [i] : 5 <= i <= N } */
260 void test_construction(struct isl_ctx *ctx)
261 {
262 isl_int v;
263 isl_space *dim;
264 isl_local_space *ls;
265 struct isl_basic_set *bset;
266 struct isl_constraint *c;
267
268 isl_int_init(v);
269
270 dim = isl_space_set_alloc(ctx, 1, 1);
271 bset = isl_basic_set_universe(isl_space_copy(dim));
272 ls = isl_local_space_from_space(dim);
273
274 c = isl_inequality_alloc(isl_local_space_copy(ls));
275 isl_int_set_si(v, -1);
276 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
277 isl_int_set_si(v, 1);
278 isl_constraint_set_coefficient(c, isl_dim_param, 0, v);
279 bset = isl_basic_set_add_constraint(bset, c);
280
281 c = isl_inequality_alloc(isl_local_space_copy(ls));
282 isl_int_set_si(v, 1);
283 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
284 isl_int_set_si(v, -5);
285 isl_constraint_set_constant(c, v);
286 bset = isl_basic_set_add_constraint(bset, c);
287
288 isl_local_space_free(ls);
289 isl_basic_set_free(bset);
290
291 isl_int_clear(v);
292 }
293
294 void test_dim(struct isl_ctx *ctx)
295 {
296 const char *str;
297 isl_map *map1, *map2;
298
299 map1 = isl_map_read_from_str(ctx,
300 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
301 map1 = isl_map_add_dims(map1, isl_dim_in, 1);
302 map2 = isl_map_read_from_str(ctx,
303 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
304 assert(isl_map_is_equal(map1, map2));
305 isl_map_free(map2);
306
307 map1 = isl_map_project_out(map1, isl_dim_in, 0, 1);
308 map2 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : n >= 0 }");
309 assert(isl_map_is_equal(map1, map2));
310
311 isl_map_free(map1);
312 isl_map_free(map2);
313
314 str = "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
315 map1 = isl_map_read_from_str(ctx, str);
316 str = "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
317 map2 = isl_map_read_from_str(ctx, str);
318 map1 = isl_map_move_dims(map1, isl_dim_out, 0, isl_dim_param, 0, 1);
319 assert(isl_map_is_equal(map1, map2));
320
321 isl_map_free(map1);
322 isl_map_free(map2);
323 }
324
325 static int test_div(isl_ctx *ctx)
326 {
327 unsigned n;
328 const char *str;
329 int empty;
330 isl_int v;
331 isl_space *dim;
332 isl_set *set;
333 isl_local_space *ls;
334 struct isl_basic_set *bset;
335 struct isl_constraint *c;
336
337 isl_int_init(v);
338
339 /* test 1 */
340 dim = isl_space_set_alloc(ctx, 0, 3);
341 bset = isl_basic_set_universe(isl_space_copy(dim));
342 ls = isl_local_space_from_space(dim);
343
344 c = isl_equality_alloc(isl_local_space_copy(ls));
345 isl_int_set_si(v, -1);
346 isl_constraint_set_constant(c, v);
347 isl_int_set_si(v, 1);
348 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
349 isl_int_set_si(v, 3);
350 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
351 bset = isl_basic_set_add_constraint(bset, c);
352
353 c = isl_equality_alloc(isl_local_space_copy(ls));
354 isl_int_set_si(v, 1);
355 isl_constraint_set_constant(c, v);
356 isl_int_set_si(v, -1);
357 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
358 isl_int_set_si(v, 3);
359 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
360 bset = isl_basic_set_add_constraint(bset, c);
361
362 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
363
364 assert(bset && bset->n_div == 1);
365 isl_local_space_free(ls);
366 isl_basic_set_free(bset);
367
368 /* test 2 */
369 dim = isl_space_set_alloc(ctx, 0, 3);
370 bset = isl_basic_set_universe(isl_space_copy(dim));
371 ls = isl_local_space_from_space(dim);
372
373 c = isl_equality_alloc(isl_local_space_copy(ls));
374 isl_int_set_si(v, 1);
375 isl_constraint_set_constant(c, v);
376 isl_int_set_si(v, -1);
377 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
378 isl_int_set_si(v, 3);
379 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
380 bset = isl_basic_set_add_constraint(bset, c);
381
382 c = isl_equality_alloc(isl_local_space_copy(ls));
383 isl_int_set_si(v, -1);
384 isl_constraint_set_constant(c, v);
385 isl_int_set_si(v, 1);
386 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
387 isl_int_set_si(v, 3);
388 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
389 bset = isl_basic_set_add_constraint(bset, c);
390
391 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
392
393 assert(bset && bset->n_div == 1);
394 isl_local_space_free(ls);
395 isl_basic_set_free(bset);
396
397 /* test 3 */
398 dim = isl_space_set_alloc(ctx, 0, 3);
399 bset = isl_basic_set_universe(isl_space_copy(dim));
400 ls = isl_local_space_from_space(dim);
401
402 c = isl_equality_alloc(isl_local_space_copy(ls));
403 isl_int_set_si(v, 1);
404 isl_constraint_set_constant(c, v);
405 isl_int_set_si(v, -1);
406 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
407 isl_int_set_si(v, 3);
408 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
409 bset = isl_basic_set_add_constraint(bset, c);
410
411 c = isl_equality_alloc(isl_local_space_copy(ls));
412 isl_int_set_si(v, -3);
413 isl_constraint_set_constant(c, v);
414 isl_int_set_si(v, 1);
415 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
416 isl_int_set_si(v, 4);
417 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
418 bset = isl_basic_set_add_constraint(bset, c);
419
420 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
421
422 assert(bset && bset->n_div == 1);
423 isl_local_space_free(ls);
424 isl_basic_set_free(bset);
425
426 /* test 4 */
427 dim = isl_space_set_alloc(ctx, 0, 3);
428 bset = isl_basic_set_universe(isl_space_copy(dim));
429 ls = isl_local_space_from_space(dim);
430
431 c = isl_equality_alloc(isl_local_space_copy(ls));
432 isl_int_set_si(v, 2);
433 isl_constraint_set_constant(c, v);
434 isl_int_set_si(v, -1);
435 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
436 isl_int_set_si(v, 3);
437 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
438 bset = isl_basic_set_add_constraint(bset, c);
439
440 c = isl_equality_alloc(isl_local_space_copy(ls));
441 isl_int_set_si(v, -1);
442 isl_constraint_set_constant(c, v);
443 isl_int_set_si(v, 1);
444 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
445 isl_int_set_si(v, 6);
446 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
447 bset = isl_basic_set_add_constraint(bset, c);
448
449 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
450
451 assert(isl_basic_set_is_empty(bset));
452 isl_local_space_free(ls);
453 isl_basic_set_free(bset);
454
455 /* test 5 */
456 dim = isl_space_set_alloc(ctx, 0, 3);
457 bset = isl_basic_set_universe(isl_space_copy(dim));
458 ls = isl_local_space_from_space(dim);
459
460 c = isl_equality_alloc(isl_local_space_copy(ls));
461 isl_int_set_si(v, -1);
462 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
463 isl_int_set_si(v, 3);
464 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
465 bset = isl_basic_set_add_constraint(bset, c);
466
467 c = isl_equality_alloc(isl_local_space_copy(ls));
468 isl_int_set_si(v, 1);
469 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
470 isl_int_set_si(v, -3);
471 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
472 bset = isl_basic_set_add_constraint(bset, c);
473
474 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
475
476 assert(bset && bset->n_div == 0);
477 isl_basic_set_free(bset);
478 isl_local_space_free(ls);
479
480 /* test 6 */
481 dim = isl_space_set_alloc(ctx, 0, 3);
482 bset = isl_basic_set_universe(isl_space_copy(dim));
483 ls = isl_local_space_from_space(dim);
484
485 c = isl_equality_alloc(isl_local_space_copy(ls));
486 isl_int_set_si(v, -1);
487 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
488 isl_int_set_si(v, 6);
489 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
490 bset = isl_basic_set_add_constraint(bset, c);
491
492 c = isl_equality_alloc(isl_local_space_copy(ls));
493 isl_int_set_si(v, 1);
494 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
495 isl_int_set_si(v, -3);
496 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
497 bset = isl_basic_set_add_constraint(bset, c);
498
499 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
500
501 assert(bset && bset->n_div == 1);
502 isl_basic_set_free(bset);
503 isl_local_space_free(ls);
504
505 /* test 7 */
506 /* This test is a bit tricky. We set up an equality
507 * a + 3b + 3c = 6 e0
508 * Normalization of divs creates _two_ divs
509 * a = 3 e0
510 * c - b - e0 = 2 e1
511 * Afterwards e0 is removed again because it has coefficient -1
512 * and we end up with the original equality and div again.
513 * Perhaps we can avoid the introduction of this temporary div.
514 */
515 dim = isl_space_set_alloc(ctx, 0, 4);
516 bset = isl_basic_set_universe(isl_space_copy(dim));
517 ls = isl_local_space_from_space(dim);
518
519 c = isl_equality_alloc(isl_local_space_copy(ls));
520 isl_int_set_si(v, -1);
521 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
522 isl_int_set_si(v, -3);
523 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
524 isl_int_set_si(v, -3);
525 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
526 isl_int_set_si(v, 6);
527 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
528 bset = isl_basic_set_add_constraint(bset, c);
529
530 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
531
532 /* Test disabled for now */
533 /*
534 assert(bset && bset->n_div == 1);
535 */
536 isl_local_space_free(ls);
537 isl_basic_set_free(bset);
538
539 /* test 8 */
540 dim = isl_space_set_alloc(ctx, 0, 5);
541 bset = isl_basic_set_universe(isl_space_copy(dim));
542 ls = isl_local_space_from_space(dim);
543
544 c = isl_equality_alloc(isl_local_space_copy(ls));
545 isl_int_set_si(v, -1);
546 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
547 isl_int_set_si(v, -3);
548 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
549 isl_int_set_si(v, -3);
550 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
551 isl_int_set_si(v, 6);
552 isl_constraint_set_coefficient(c, isl_dim_set, 4, v);
553 bset = isl_basic_set_add_constraint(bset, c);
554
555 c = isl_equality_alloc(isl_local_space_copy(ls));
556 isl_int_set_si(v, -1);
557 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
558 isl_int_set_si(v, 1);
559 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
560 isl_int_set_si(v, 1);
561 isl_constraint_set_constant(c, v);
562 bset = isl_basic_set_add_constraint(bset, c);
563
564 bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1);
565
566 /* Test disabled for now */
567 /*
568 assert(bset && bset->n_div == 1);
569 */
570 isl_local_space_free(ls);
571 isl_basic_set_free(bset);
572
573 /* test 9 */
574 dim = isl_space_set_alloc(ctx, 0, 4);
575 bset = isl_basic_set_universe(isl_space_copy(dim));
576 ls = isl_local_space_from_space(dim);
577
578 c = isl_equality_alloc(isl_local_space_copy(ls));
579 isl_int_set_si(v, 1);
580 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
581 isl_int_set_si(v, -1);
582 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
583 isl_int_set_si(v, -2);
584 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
585 bset = isl_basic_set_add_constraint(bset, c);
586
587 c = isl_equality_alloc(isl_local_space_copy(ls));
588 isl_int_set_si(v, -1);
589 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
590 isl_int_set_si(v, 3);
591 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
592 isl_int_set_si(v, 2);
593 isl_constraint_set_constant(c, v);
594 bset = isl_basic_set_add_constraint(bset, c);
595
596 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2);
597
598 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
599
600 assert(!isl_basic_set_is_empty(bset));
601
602 isl_local_space_free(ls);
603 isl_basic_set_free(bset);
604
605 /* test 10 */
606 dim = isl_space_set_alloc(ctx, 0, 3);
607 bset = isl_basic_set_universe(isl_space_copy(dim));
608 ls = isl_local_space_from_space(dim);
609
610 c = isl_equality_alloc(isl_local_space_copy(ls));
611 isl_int_set_si(v, 1);
612 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
613 isl_int_set_si(v, -2);
614 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
615 bset = isl_basic_set_add_constraint(bset, c);
616
617 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
618
619 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
620
621 isl_local_space_free(ls);
622 isl_basic_set_free(bset);
623
624 isl_int_clear(v);
625
626 str = "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
627 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
628 set = isl_set_read_from_str(ctx, str);
629 set = isl_set_compute_divs(set);
630 isl_set_free(set);
631 if (!set)
632 return -1;
633
634 str = "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }";
635 bset = isl_basic_set_read_from_str(ctx, str);
636 n = isl_basic_set_dim(bset, isl_dim_div);
637 isl_basic_set_free(bset);
638 if (!bset)
639 return -1;
640 if (n != 0)
641 isl_die(ctx, isl_error_unknown,
642 "expecting no existentials", return -1);
643
644 str = "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
645 set = isl_set_read_from_str(ctx, str);
646 set = isl_set_remove_divs_involving_dims(set, isl_dim_set, 0, 2);
647 set = isl_set_fix_si(set, isl_dim_set, 2, -3);
648 empty = isl_set_is_empty(set);
649 isl_set_free(set);
650 if (empty < 0)
651 return -1;
652 if (!empty)
653 isl_die(ctx, isl_error_unknown,
654 "result not as accurate as expected", return -1);
655
656 return 0;
657 }
658
659 void test_application_case(struct isl_ctx *ctx, const char *name)
660 {
661 char *filename;
662 FILE *input;
663 struct isl_basic_set *bset1, *bset2;
664 struct isl_basic_map *bmap;
665
666 filename = get_filename(ctx, name, "omega");
667 assert(filename);
668 input = fopen(filename, "r");
669 assert(input);
670
671 bset1 = isl_basic_set_read_from_file(ctx, input);
672 bmap = isl_basic_map_read_from_file(ctx, input);
673
674 bset1 = isl_basic_set_apply(bset1, bmap);
675
676 bset2 = isl_basic_set_read_from_file(ctx, input);
677
678 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
679
680 isl_basic_set_free(bset1);
681 isl_basic_set_free(bset2);
682 free(filename);
683
684 fclose(input);
685 }
686
687 void test_application(struct isl_ctx *ctx)
688 {
689 test_application_case(ctx, "application");
690 test_application_case(ctx, "application2");
691 }
692
693 void test_affine_hull_case(struct isl_ctx *ctx, const char *name)
694 {
695 char *filename;
696 FILE *input;
697 struct isl_basic_set *bset1, *bset2;
698
699 filename = get_filename(ctx, name, "polylib");
700 assert(filename);
701 input = fopen(filename, "r");
702 assert(input);
703
704 bset1 = isl_basic_set_read_from_file(ctx, input);
705 bset2 = isl_basic_set_read_from_file(ctx, input);
706
707 bset1 = isl_basic_set_affine_hull(bset1);
708
709 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
710
711 isl_basic_set_free(bset1);
712 isl_basic_set_free(bset2);
713 free(filename);
714
715 fclose(input);
716 }
717
718 int test_affine_hull(struct isl_ctx *ctx)
719 {
720 const char *str;
721 isl_set *set;
722 isl_basic_set *bset;
723 int n;
724
725 test_affine_hull_case(ctx, "affine2");
726 test_affine_hull_case(ctx, "affine");
727 test_affine_hull_case(ctx, "affine3");
728
729 str = "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
730 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
731 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
732 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
733 set = isl_set_read_from_str(ctx, str);
734 bset = isl_set_affine_hull(set);
735 n = isl_basic_set_dim(bset, isl_dim_div);
736 isl_basic_set_free(bset);
737 if (n != 0)
738 isl_die(ctx, isl_error_unknown, "not expecting any divs",
739 return -1);
740
741 return 0;
742 }
743
744 void test_convex_hull_case(struct isl_ctx *ctx, const char *name)
745 {
746 char *filename;
747 FILE *input;
748 struct isl_basic_set *bset1, *bset2;
749 struct isl_set *set;
750
751 filename = get_filename(ctx, name, "polylib");
752 assert(filename);
753 input = fopen(filename, "r");
754 assert(input);
755
756 bset1 = isl_basic_set_read_from_file(ctx, input);
757 bset2 = isl_basic_set_read_from_file(ctx, input);
758
759 set = isl_basic_set_union(bset1, bset2);
760 bset1 = isl_set_convex_hull(set);
761
762 bset2 = isl_basic_set_read_from_file(ctx, input);
763
764 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
765
766 isl_basic_set_free(bset1);
767 isl_basic_set_free(bset2);
768 free(filename);
769
770 fclose(input);
771 }
772
773 void test_convex_hull_algo(struct isl_ctx *ctx, int convex)
774 {
775 const char *str1, *str2;
776 isl_set *set1, *set2;
777 int orig_convex = ctx->opt->convex;
778 ctx->opt->convex = convex;
779
780 test_convex_hull_case(ctx, "convex0");
781 test_convex_hull_case(ctx, "convex1");
782 test_convex_hull_case(ctx, "convex2");
783 test_convex_hull_case(ctx, "convex3");
784 test_convex_hull_case(ctx, "convex4");
785 test_convex_hull_case(ctx, "convex5");
786 test_convex_hull_case(ctx, "convex6");
787 test_convex_hull_case(ctx, "convex7");
788 test_convex_hull_case(ctx, "convex8");
789 test_convex_hull_case(ctx, "convex9");
790 test_convex_hull_case(ctx, "convex10");
791 test_convex_hull_case(ctx, "convex11");
792 test_convex_hull_case(ctx, "convex12");
793 test_convex_hull_case(ctx, "convex13");
794 test_convex_hull_case(ctx, "convex14");
795 test_convex_hull_case(ctx, "convex15");
796
797 str1 = "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
798 "(i0 = 1 and i1 = 0 and i2 = 1) or "
799 "(i0 = 0 and i1 = 0 and i2 = 0) }";
800 str2 = "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }";
801 set1 = isl_set_read_from_str(ctx, str1);
802 set2 = isl_set_read_from_str(ctx, str2);
803 set1 = isl_set_from_basic_set(isl_set_convex_hull(set1));
804 assert(isl_set_is_equal(set1, set2));
805 isl_set_free(set1);
806 isl_set_free(set2);
807
808 ctx->opt->convex = orig_convex;
809 }
810
811 void test_convex_hull(struct isl_ctx *ctx)
812 {
813 test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM);
814 test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP);
815 }
816
817 void test_gist_case(struct isl_ctx *ctx, const char *name)
818 {
819 char *filename;
820 FILE *input;
821 struct isl_basic_set *bset1, *bset2;
822
823 filename = get_filename(ctx, name, "polylib");
824 assert(filename);
825 input = fopen(filename, "r");
826 assert(input);
827
828 bset1 = isl_basic_set_read_from_file(ctx, input);
829 bset2 = isl_basic_set_read_from_file(ctx, input);
830
831 bset1 = isl_basic_set_gist(bset1, bset2);
832
833 bset2 = isl_basic_set_read_from_file(ctx, input);
834
835 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
836
837 isl_basic_set_free(bset1);
838 isl_basic_set_free(bset2);
839 free(filename);
840
841 fclose(input);
842 }
843
844 void test_gist(struct isl_ctx *ctx)
845 {
846 const char *str;
847 isl_basic_set *bset1, *bset2;
848
849 test_gist_case(ctx, "gist1");
850
851 str = "[p0, p2, p3, p5, p6, p10] -> { [] : "
852 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
853 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
854 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
855 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
856 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
857 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
858 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
859 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
860 bset1 = isl_basic_set_read_from_str(ctx, str);
861 str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
862 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
863 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
864 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
865 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
866 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
867 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
868 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
869 bset2 = isl_basic_set_read_from_str(ctx, str);
870 bset1 = isl_basic_set_gist(bset1, bset2);
871 assert(bset1 && bset1->n_div == 0);
872 isl_basic_set_free(bset1);
873 }
874
875 int test_coalesce_set(isl_ctx *ctx, const char *str, int check_one)
876 {
877 isl_set *set, *set2;
878 int equal;
879 int one;
880
881 set = isl_set_read_from_str(ctx, str);
882 set = isl_set_coalesce(set);
883 set2 = isl_set_read_from_str(ctx, str);
884 equal = isl_set_is_equal(set, set2);
885 one = set && set->n == 1;
886 isl_set_free(set);
887 isl_set_free(set2);
888
889 if (equal < 0)
890 return -1;
891 if (!equal)
892 isl_die(ctx, isl_error_unknown,
893 "coalesced set not equal to input", return -1);
894 if (check_one && !one)
895 isl_die(ctx, isl_error_unknown,
896 "coalesced set should not be a union", return -1);
897
898 return 0;
899 }
900
901 int test_coalesce_unbounded_wrapping(isl_ctx *ctx)
902 {
903 int r = 0;
904 int bounded;
905
906 bounded = isl_options_get_coalesce_bounded_wrapping(ctx);
907 isl_options_set_coalesce_bounded_wrapping(ctx, 0);
908
909 if (test_coalesce_set(ctx,
910 "{[x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
911 "-x - y + 1 >= 0 and -3 <= z <= 3;"
912 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
913 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
914 "-10 <= y <= 0}", 1) < 0)
915 goto error;
916 if (test_coalesce_set(ctx,
917 "{[x,y] : 0 <= x,y <= 10; [5,y]: 4 <=y <= 11}", 1) < 0)
918 goto error;
919 if (test_coalesce_set(ctx,
920 "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1) < 0)
921 goto error;
922
923 if (0) {
924 error:
925 r = -1;
926 }
927
928 isl_options_set_coalesce_bounded_wrapping(ctx, bounded);
929
930 return r;
931 }
932
933 int test_coalesce(struct isl_ctx *ctx)
934 {
935 const char *str;
936 struct isl_set *set, *set2;
937 struct isl_map *map, *map2;
938
939 set = isl_set_read_from_str(ctx,
940 "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
941 "y >= x & x >= 2 & 5 >= y }");
942 set = isl_set_coalesce(set);
943 assert(set && set->n == 1);
944 isl_set_free(set);
945
946 set = isl_set_read_from_str(ctx,
947 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
948 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}");
949 set = isl_set_coalesce(set);
950 assert(set && set->n == 1);
951 isl_set_free(set);
952
953 set = isl_set_read_from_str(ctx,
954 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
955 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}");
956 set = isl_set_coalesce(set);
957 assert(set && set->n == 2);
958 isl_set_free(set);
959
960 set = isl_set_read_from_str(ctx,
961 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
962 "y >= 0 & x >= 6 & x <= 10 & y <= x}");
963 set = isl_set_coalesce(set);
964 assert(set && set->n == 1);
965 isl_set_free(set);
966
967 set = isl_set_read_from_str(ctx,
968 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
969 "y >= 0 & x >= 7 & x <= 10 & y <= x}");
970 set = isl_set_coalesce(set);
971 assert(set && set->n == 2);
972 isl_set_free(set);
973
974 set = isl_set_read_from_str(ctx,
975 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
976 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}");
977 set = isl_set_coalesce(set);
978 assert(set && set->n == 2);
979 isl_set_free(set);
980
981 set = isl_set_read_from_str(ctx,
982 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
983 "y >= 0 & x = 6 & y <= 6}");
984 set = isl_set_coalesce(set);
985 assert(set && set->n == 1);
986 isl_set_free(set);
987
988 set = isl_set_read_from_str(ctx,
989 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
990 "y >= 0 & x = 7 & y <= 6}");
991 set = isl_set_coalesce(set);
992 assert(set && set->n == 2);
993 isl_set_free(set);
994
995 set = isl_set_read_from_str(ctx,
996 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
997 "y >= 0 & x = 6 & y <= 5}");
998 set = isl_set_coalesce(set);
999 assert(set && set->n == 1);
1000 set2 = isl_set_read_from_str(ctx,
1001 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1002 "y >= 0 & x = 6 & y <= 5}");
1003 assert(isl_set_is_equal(set, set2));
1004 isl_set_free(set);
1005 isl_set_free(set2);
1006
1007 set = isl_set_read_from_str(ctx,
1008 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1009 "y >= 0 & x = 6 & y <= 7}");
1010 set = isl_set_coalesce(set);
1011 assert(set && set->n == 2);
1012 isl_set_free(set);
1013
1014 set = isl_set_read_from_str(ctx,
1015 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
1016 set = isl_set_coalesce(set);
1017 assert(set && set->n == 1);
1018 set2 = isl_set_read_from_str(ctx,
1019 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
1020 assert(isl_set_is_equal(set, set2));
1021 isl_set_free(set);
1022 isl_set_free(set2);
1023
1024 set = isl_set_read_from_str(ctx,
1025 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
1026 set = isl_set_coalesce(set);
1027 set2 = isl_set_read_from_str(ctx,
1028 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
1029 assert(isl_set_is_equal(set, set2));
1030 isl_set_free(set);
1031 isl_set_free(set2);
1032
1033 set = isl_set_read_from_str(ctx,
1034 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
1035 "2 <= i and i <= n }");
1036 set = isl_set_coalesce(set);
1037 assert(set && set->n == 1);
1038 set2 = isl_set_read_from_str(ctx,
1039 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
1040 "2 <= i and i <= n }");
1041 assert(isl_set_is_equal(set, set2));
1042 isl_set_free(set);
1043 isl_set_free(set2);
1044
1045 map = isl_map_read_from_str(ctx,
1046 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1047 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1048 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1049 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1050 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1051 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1052 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1053 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1054 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1055 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1056 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1057 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1058 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1059 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1060 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1061 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1062 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1063 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
1064 map = isl_map_coalesce(map);
1065 map2 = isl_map_read_from_str(ctx,
1066 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1067 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1068 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1069 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1070 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1071 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1072 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1073 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1074 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1075 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1076 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1077 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1078 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1079 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1080 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1081 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1082 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1083 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
1084 assert(isl_map_is_equal(map, map2));
1085 isl_map_free(map);
1086 isl_map_free(map2);
1087
1088 str = "[n, m] -> { [] -> [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1089 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1090 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1091 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }";
1092 map = isl_map_read_from_str(ctx, str);
1093 map = isl_map_coalesce(map);
1094 map2 = isl_map_read_from_str(ctx, str);
1095 assert(isl_map_is_equal(map, map2));
1096 isl_map_free(map);
1097 isl_map_free(map2);
1098
1099 str = "[M, N] -> { [i0, i1, i2, i3, i4, i5, i6] -> "
1100 "[o0, o1, o2, o3, o4, o5, o6] : "
1101 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1102 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1103 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1104 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1105 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1106 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1107 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1108 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1109 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1110 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1111 "o6 >= i3 + i6 - o3 and M >= 0 and "
1112 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1113 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }";
1114 map = isl_map_read_from_str(ctx, str);
1115 map = isl_map_coalesce(map);
1116 map2 = isl_map_read_from_str(ctx, str);
1117 assert(isl_map_is_equal(map, map2));
1118 isl_map_free(map);
1119 isl_map_free(map2);
1120
1121 str = "[M, N] -> { [] -> [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1122 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1123 "(o0 = 0 and M >= 2 and N >= 3) or "
1124 "(M = 0 and o0 = 0 and N >= 3) }";
1125 map = isl_map_read_from_str(ctx, str);
1126 map = isl_map_coalesce(map);
1127 map2 = isl_map_read_from_str(ctx, str);
1128 assert(isl_map_is_equal(map, map2));
1129 isl_map_free(map);
1130 isl_map_free(map2);
1131
1132 str = "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1133 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1134 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1135 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }";
1136 map = isl_map_read_from_str(ctx, str);
1137 map = isl_map_coalesce(map);
1138 map2 = isl_map_read_from_str(ctx, str);
1139 assert(isl_map_is_equal(map, map2));
1140 isl_map_free(map);
1141 isl_map_free(map2);
1142
1143 test_coalesce_set(ctx,
1144 "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or "
1145 "(i1 = M and M >= 1) }", 0);
1146 test_coalesce_set(ctx,
1147 "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }", 0);
1148 test_coalesce_set(ctx,
1149 "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1150 "(y = 3 and x = 1) }", 1);
1151 test_coalesce_set(ctx,
1152 "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1153 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1154 "i1 <= M and i3 <= M and i4 <= M) or "
1155 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1156 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1157 "i4 <= -1 + M) }", 1);
1158 test_coalesce_set(ctx,
1159 "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1160 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }", 1);
1161 if (test_coalesce_unbounded_wrapping(ctx) < 0)
1162 return -1;
1163 if (test_coalesce_set(ctx, "{[x,0] : x >= 0; [x,1] : x <= 20}", 0) < 0)
1164 return -1;
1165 if (test_coalesce_set(ctx, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }", 1) < 0)
1166 return -1;
1167 if (test_coalesce_set(ctx, "{ [0,0]; [i,i] : 1 <= i <= 10 }", 1) < 0)
1168 return -1;
1169 if (test_coalesce_set(ctx, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }", 0) < 0)
1170 return -1;
1171 if (test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 1 <= i <= 10 }", 1) < 0)
1172 return -1;
1173 if (test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 2 <= i <= 10 }", 0) < 0)
1174 return -1;
1175 if (test_coalesce_set(ctx, "{ [1,0]; [i,2i] : 1 <= i <= 10 }", 0) < 0)
1176 return -1;
1177 if (test_coalesce_set(ctx, "{ [0,1]; [i,2i] : 1 <= i <= 10 }", 0) < 0)
1178 return -1;
1179 if (test_coalesce_set(ctx, "{ [a, b] : exists e : 2e = a and "
1180 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }", 0) < 0)
1181 return -1;
1182 if (test_coalesce_set(ctx,
1183 "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1184 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1185 "j >= 1 and j' <= i + j - i' and i >= 1; "
1186 "[1, 1, 1, 1] }", 0) < 0)
1187 return -1;
1188 if (test_coalesce_set(ctx, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1189 "[i,j] : exists a : j = 3a }", 1) < 0)
1190 return -1;
1191 return 0;
1192 }
1193
1194 void test_closure(struct isl_ctx *ctx)
1195 {
1196 const char *str;
1197 isl_set *dom;
1198 isl_map *up, *right;
1199 isl_map *map, *map2;
1200 int exact;
1201
1202 /* COCOA example 1 */
1203 map = isl_map_read_from_str(ctx,
1204 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1205 "1 <= i and i < n and 1 <= j and j < n or "
1206 "i2 = i + 1 and j2 = j - 1 and "
1207 "1 <= i and i < n and 2 <= j and j <= n }");
1208 map = isl_map_power(map, &exact);
1209 assert(exact);
1210 isl_map_free(map);
1211
1212 /* COCOA example 1 */
1213 map = isl_map_read_from_str(ctx,
1214 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1215 "1 <= i and i < n and 1 <= j and j < n or "
1216 "i2 = i + 1 and j2 = j - 1 and "
1217 "1 <= i and i < n and 2 <= j and j <= n }");
1218 map = isl_map_transitive_closure(map, &exact);
1219 assert(exact);
1220 map2 = isl_map_read_from_str(ctx,
1221 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1222 "1 <= i and i < n and 1 <= j and j <= n and "
1223 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1224 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1225 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1226 assert(isl_map_is_equal(map, map2));
1227 isl_map_free(map2);
1228 isl_map_free(map);
1229
1230 map = isl_map_read_from_str(ctx,
1231 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1232 " 0 <= y and y <= n }");
1233 map = isl_map_transitive_closure(map, &exact);
1234 map2 = isl_map_read_from_str(ctx,
1235 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1236 " 0 <= y and y <= n }");
1237 assert(isl_map_is_equal(map, map2));
1238 isl_map_free(map2);
1239 isl_map_free(map);
1240
1241 /* COCOA example 2 */
1242 map = isl_map_read_from_str(ctx,
1243 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1244 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1245 "i2 = i + 2 and j2 = j - 2 and "
1246 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1247 map = isl_map_transitive_closure(map, &exact);
1248 assert(exact);
1249 map2 = isl_map_read_from_str(ctx,
1250 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1251 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1252 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1253 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1254 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1255 assert(isl_map_is_equal(map, map2));
1256 isl_map_free(map);
1257 isl_map_free(map2);
1258
1259 /* COCOA Fig.2 left */
1260 map = isl_map_read_from_str(ctx,
1261 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1262 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1263 "j <= n or "
1264 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1265 "j <= 2 i - 3 and j <= n - 2 or "
1266 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1267 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1268 map = isl_map_transitive_closure(map, &exact);
1269 assert(exact);
1270 isl_map_free(map);
1271
1272 /* COCOA Fig.2 right */
1273 map = isl_map_read_from_str(ctx,
1274 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1275 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1276 "j <= n or "
1277 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1278 "j <= 2 i - 4 and j <= n - 3 or "
1279 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1280 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1281 map = isl_map_power(map, &exact);
1282 assert(exact);
1283 isl_map_free(map);
1284
1285 /* COCOA Fig.2 right */
1286 map = isl_map_read_from_str(ctx,
1287 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1288 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1289 "j <= n or "
1290 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1291 "j <= 2 i - 4 and j <= n - 3 or "
1292 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1293 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1294 map = isl_map_transitive_closure(map, &exact);
1295 assert(exact);
1296 map2 = isl_map_read_from_str(ctx,
1297 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1298 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1299 "j <= n and 3 + i + 2 j <= 3 n and "
1300 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1301 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1302 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1303 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1304 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1305 assert(isl_map_is_equal(map, map2));
1306 isl_map_free(map2);
1307 isl_map_free(map);
1308
1309 /* COCOA Fig.1 right */
1310 dom = isl_set_read_from_str(ctx,
1311 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1312 "2 x - 3 y + 3 >= 0 }");
1313 right = isl_map_read_from_str(ctx,
1314 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1315 up = isl_map_read_from_str(ctx,
1316 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1317 right = isl_map_intersect_domain(right, isl_set_copy(dom));
1318 right = isl_map_intersect_range(right, isl_set_copy(dom));
1319 up = isl_map_intersect_domain(up, isl_set_copy(dom));
1320 up = isl_map_intersect_range(up, dom);
1321 map = isl_map_union(up, right);
1322 map = isl_map_transitive_closure(map, &exact);
1323 assert(exact);
1324 map2 = isl_map_read_from_str(ctx,
1325 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1326 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1327 assert(isl_map_is_equal(map, map2));
1328 isl_map_free(map2);
1329 isl_map_free(map);
1330
1331 /* COCOA Theorem 1 counter example */
1332 map = isl_map_read_from_str(ctx,
1333 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1334 "i2 = 1 and j2 = j or "
1335 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1336 map = isl_map_transitive_closure(map, &exact);
1337 assert(exact);
1338 isl_map_free(map);
1339
1340 map = isl_map_read_from_str(ctx,
1341 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1342 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1343 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1344 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1345 map = isl_map_transitive_closure(map, &exact);
1346 assert(exact);
1347 isl_map_free(map);
1348
1349 /* Kelly et al 1996, fig 12 */
1350 map = isl_map_read_from_str(ctx,
1351 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1352 "1 <= i,j,j+1 <= n or "
1353 "j = n and j2 = 1 and i2 = i + 1 and "
1354 "1 <= i,i+1 <= n }");
1355 map = isl_map_transitive_closure(map, &exact);
1356 assert(exact);
1357 map2 = isl_map_read_from_str(ctx,
1358 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1359 "1 <= i <= n and i = i2 or "
1360 "1 <= i < i2 <= n and 1 <= j <= n and "
1361 "1 <= j2 <= n }");
1362 assert(isl_map_is_equal(map, map2));
1363 isl_map_free(map2);
1364 isl_map_free(map);
1365
1366 /* Omega's closure4 */
1367 map = isl_map_read_from_str(ctx,
1368 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1369 "1 <= x,y <= 10 or "
1370 "x2 = x + 1 and y2 = y and "
1371 "1 <= x <= 20 && 5 <= y <= 15 }");
1372 map = isl_map_transitive_closure(map, &exact);
1373 assert(exact);
1374 isl_map_free(map);
1375
1376 map = isl_map_read_from_str(ctx,
1377 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1378 map = isl_map_transitive_closure(map, &exact);
1379 assert(!exact);
1380 map2 = isl_map_read_from_str(ctx,
1381 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1382 assert(isl_map_is_equal(map, map2));
1383 isl_map_free(map);
1384 isl_map_free(map2);
1385
1386 str = "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1387 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1388 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1389 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1390 map = isl_map_read_from_str(ctx, str);
1391 map = isl_map_transitive_closure(map, &exact);
1392 assert(exact);
1393 map2 = isl_map_read_from_str(ctx, str);
1394 assert(isl_map_is_equal(map, map2));
1395 isl_map_free(map);
1396 isl_map_free(map2);
1397
1398 str = "{[0] -> [1]; [2] -> [3]}";
1399 map = isl_map_read_from_str(ctx, str);
1400 map = isl_map_transitive_closure(map, &exact);
1401 assert(exact);
1402 map2 = isl_map_read_from_str(ctx, str);
1403 assert(isl_map_is_equal(map, map2));
1404 isl_map_free(map);
1405 isl_map_free(map2);
1406
1407 str = "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1408 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1409 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1410 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1411 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1412 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1413 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1414 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1415 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1416 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1417 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1418 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1419 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1420 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1421 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1422 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1423 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1424 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1425 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1426 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1427 map = isl_map_read_from_str(ctx, str);
1428 map = isl_map_transitive_closure(map, NULL);
1429 assert(map);
1430 isl_map_free(map);
1431 }
1432
1433 void test_lex(struct isl_ctx *ctx)
1434 {
1435 isl_space *dim;
1436 isl_map *map;
1437
1438 dim = isl_space_set_alloc(ctx, 0, 0);
1439 map = isl_map_lex_le(dim);
1440 assert(!isl_map_is_empty(map));
1441 isl_map_free(map);
1442 }
1443
1444 void test_lexmin(struct isl_ctx *ctx)
1445 {
1446 const char *str;
1447 isl_basic_map *bmap;
1448 isl_map *map, *map2;
1449 isl_set *set;
1450 isl_set *set2;
1451 isl_pw_multi_aff *pma;
1452
1453 str = "[p0, p1] -> { [] -> [] : "
1454 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1455 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1456 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1457 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1458 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1459 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1460 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1461 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1462 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1463 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1464 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1465 map = isl_map_read_from_str(ctx, str);
1466 map = isl_map_lexmin(map);
1467 isl_map_free(map);
1468
1469 str = "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1470 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1471 set = isl_set_read_from_str(ctx, str);
1472 set = isl_set_lexmax(set);
1473 str = "[C] -> { [obj,a,b,c] : C = 8 }";
1474 set2 = isl_set_read_from_str(ctx, str);
1475 set = isl_set_intersect(set, set2);
1476 assert(!isl_set_is_empty(set));
1477 isl_set_free(set);
1478
1479 str = "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1480 map = isl_map_read_from_str(ctx, str);
1481 map = isl_map_lexmin(map);
1482 str = "{ [x] -> [5] : 6 <= x <= 8; "
1483 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1484 map2 = isl_map_read_from_str(ctx, str);
1485 assert(isl_map_is_equal(map, map2));
1486 isl_map_free(map);
1487 isl_map_free(map2);
1488
1489 str = "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1490 map = isl_map_read_from_str(ctx, str);
1491 map2 = isl_map_copy(map);
1492 map = isl_map_lexmin(map);
1493 assert(isl_map_is_equal(map, map2));
1494 isl_map_free(map);
1495 isl_map_free(map2);
1496
1497 str = "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1498 map = isl_map_read_from_str(ctx, str);
1499 map = isl_map_lexmin(map);
1500 str = "{ [x] -> [y] : (4y = x and x >= 0) or "
1501 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1502 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1503 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1504 map2 = isl_map_read_from_str(ctx, str);
1505 assert(isl_map_is_equal(map, map2));
1506 isl_map_free(map);
1507 isl_map_free(map2);
1508
1509 str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1510 " 8i' <= i and 8i' >= -7 + i }";
1511 bmap = isl_basic_map_read_from_str(ctx, str);
1512 pma = isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap));
1513 map2 = isl_map_from_pw_multi_aff(pma);
1514 map = isl_map_from_basic_map(bmap);
1515 assert(isl_map_is_equal(map, map2));
1516 isl_map_free(map);
1517 isl_map_free(map2);
1518
1519 str = "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
1520 map = isl_map_read_from_str(ctx, str);
1521 map = isl_map_lexmin(map);
1522 str = "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
1523 map2 = isl_map_read_from_str(ctx, str);
1524 assert(isl_map_is_equal(map, map2));
1525 isl_map_free(map);
1526 isl_map_free(map2);
1527 }
1528
1529 struct must_may {
1530 isl_map *must;
1531 isl_map *may;
1532 };
1533
1534 static int collect_must_may(__isl_take isl_map *dep, int must,
1535 void *dep_user, void *user)
1536 {
1537 struct must_may *mm = (struct must_may *)user;
1538
1539 if (must)
1540 mm->must = isl_map_union(mm->must, dep);
1541 else
1542 mm->may = isl_map_union(mm->may, dep);
1543
1544 return 0;
1545 }
1546
1547 static int common_space(void *first, void *second)
1548 {
1549 int depth = *(int *)first;
1550 return 2 * depth;
1551 }
1552
1553 static int map_is_equal(__isl_keep isl_map *map, const char *str)
1554 {
1555 isl_map *map2;
1556 int equal;
1557
1558 if (!map)
1559 return -1;
1560
1561 map2 = isl_map_read_from_str(map->ctx, str);
1562 equal = isl_map_is_equal(map, map2);
1563 isl_map_free(map2);
1564
1565 return equal;
1566 }
1567
1568 static int map_check_equal(__isl_keep isl_map *map, const char *str)
1569 {
1570 int equal;
1571
1572 equal = map_is_equal(map, str);
1573 if (equal < 0)
1574 return -1;
1575 if (!equal)
1576 isl_die(isl_map_get_ctx(map), isl_error_unknown,
1577 "result not as expected", return -1);
1578 return 0;
1579 }
1580
1581 void test_dep(struct isl_ctx *ctx)
1582 {
1583 const char *str;
1584 isl_space *dim;
1585 isl_map *map;
1586 isl_access_info *ai;
1587 isl_flow *flow;
1588 int depth;
1589 struct must_may mm;
1590
1591 depth = 3;
1592
1593 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1594 map = isl_map_read_from_str(ctx, str);
1595 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1596
1597 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1598 map = isl_map_read_from_str(ctx, str);
1599 ai = isl_access_info_add_source(ai, map, 1, &depth);
1600
1601 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1602 map = isl_map_read_from_str(ctx, str);
1603 ai = isl_access_info_add_source(ai, map, 1, &depth);
1604
1605 flow = isl_access_info_compute_flow(ai);
1606 dim = isl_space_alloc(ctx, 0, 3, 3);
1607 mm.must = isl_map_empty(isl_space_copy(dim));
1608 mm.may = isl_map_empty(dim);
1609
1610 isl_flow_foreach(flow, collect_must_may, &mm);
1611
1612 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
1613 " [1,10,0] -> [2,5,0] }";
1614 assert(map_is_equal(mm.must, str));
1615 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1616 assert(map_is_equal(mm.may, str));
1617
1618 isl_map_free(mm.must);
1619 isl_map_free(mm.may);
1620 isl_flow_free(flow);
1621
1622
1623 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1624 map = isl_map_read_from_str(ctx, str);
1625 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1626
1627 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1628 map = isl_map_read_from_str(ctx, str);
1629 ai = isl_access_info_add_source(ai, map, 1, &depth);
1630
1631 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1632 map = isl_map_read_from_str(ctx, str);
1633 ai = isl_access_info_add_source(ai, map, 0, &depth);
1634
1635 flow = isl_access_info_compute_flow(ai);
1636 dim = isl_space_alloc(ctx, 0, 3, 3);
1637 mm.must = isl_map_empty(isl_space_copy(dim));
1638 mm.may = isl_map_empty(dim);
1639
1640 isl_flow_foreach(flow, collect_must_may, &mm);
1641
1642 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
1643 assert(map_is_equal(mm.must, str));
1644 str = "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1645 assert(map_is_equal(mm.may, str));
1646
1647 isl_map_free(mm.must);
1648 isl_map_free(mm.may);
1649 isl_flow_free(flow);
1650
1651
1652 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1653 map = isl_map_read_from_str(ctx, str);
1654 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1655
1656 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1657 map = isl_map_read_from_str(ctx, str);
1658 ai = isl_access_info_add_source(ai, map, 0, &depth);
1659
1660 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1661 map = isl_map_read_from_str(ctx, str);
1662 ai = isl_access_info_add_source(ai, map, 0, &depth);
1663
1664 flow = isl_access_info_compute_flow(ai);
1665 dim = isl_space_alloc(ctx, 0, 3, 3);
1666 mm.must = isl_map_empty(isl_space_copy(dim));
1667 mm.may = isl_map_empty(dim);
1668
1669 isl_flow_foreach(flow, collect_must_may, &mm);
1670
1671 str = "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
1672 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1673 assert(map_is_equal(mm.may, str));
1674 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1675 assert(map_is_equal(mm.must, str));
1676
1677 isl_map_free(mm.must);
1678 isl_map_free(mm.may);
1679 isl_flow_free(flow);
1680
1681
1682 str = "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
1683 map = isl_map_read_from_str(ctx, str);
1684 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1685
1686 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1687 map = isl_map_read_from_str(ctx, str);
1688 ai = isl_access_info_add_source(ai, map, 0, &depth);
1689
1690 str = "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
1691 map = isl_map_read_from_str(ctx, str);
1692 ai = isl_access_info_add_source(ai, map, 0, &depth);
1693
1694 flow = isl_access_info_compute_flow(ai);
1695 dim = isl_space_alloc(ctx, 0, 3, 3);
1696 mm.must = isl_map_empty(isl_space_copy(dim));
1697 mm.may = isl_map_empty(dim);
1698
1699 isl_flow_foreach(flow, collect_must_may, &mm);
1700
1701 str = "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
1702 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
1703 assert(map_is_equal(mm.may, str));
1704 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1705 assert(map_is_equal(mm.must, str));
1706
1707 isl_map_free(mm.must);
1708 isl_map_free(mm.may);
1709 isl_flow_free(flow);
1710
1711
1712 str = "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
1713 map = isl_map_read_from_str(ctx, str);
1714 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1715
1716 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1717 map = isl_map_read_from_str(ctx, str);
1718 ai = isl_access_info_add_source(ai, map, 0, &depth);
1719
1720 str = "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
1721 map = isl_map_read_from_str(ctx, str);
1722 ai = isl_access_info_add_source(ai, map, 0, &depth);
1723
1724 flow = isl_access_info_compute_flow(ai);
1725 dim = isl_space_alloc(ctx, 0, 3, 3);
1726 mm.must = isl_map_empty(isl_space_copy(dim));
1727 mm.may = isl_map_empty(dim);
1728
1729 isl_flow_foreach(flow, collect_must_may, &mm);
1730
1731 str = "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
1732 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
1733 assert(map_is_equal(mm.may, str));
1734 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1735 assert(map_is_equal(mm.must, str));
1736
1737 isl_map_free(mm.must);
1738 isl_map_free(mm.may);
1739 isl_flow_free(flow);
1740
1741
1742 depth = 5;
1743
1744 str = "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1745 map = isl_map_read_from_str(ctx, str);
1746 ai = isl_access_info_alloc(map, &depth, &common_space, 1);
1747
1748 str = "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1749 map = isl_map_read_from_str(ctx, str);
1750 ai = isl_access_info_add_source(ai, map, 1, &depth);
1751
1752 flow = isl_access_info_compute_flow(ai);
1753 dim = isl_space_alloc(ctx, 0, 5, 5);
1754 mm.must = isl_map_empty(isl_space_copy(dim));
1755 mm.may = isl_map_empty(dim);
1756
1757 isl_flow_foreach(flow, collect_must_may, &mm);
1758
1759 str = "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
1760 assert(map_is_equal(mm.must, str));
1761 str = "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
1762 assert(map_is_equal(mm.may, str));
1763
1764 isl_map_free(mm.must);
1765 isl_map_free(mm.may);
1766 isl_flow_free(flow);
1767 }
1768
1769 int test_sv(isl_ctx *ctx)
1770 {
1771 const char *str;
1772 isl_map *map;
1773 isl_union_map *umap;
1774 int sv;
1775
1776 str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }";
1777 map = isl_map_read_from_str(ctx, str);
1778 sv = isl_map_is_single_valued(map);
1779 isl_map_free(map);
1780 if (sv < 0)
1781 return -1;
1782 if (!sv)
1783 isl_die(ctx, isl_error_internal,
1784 "map not detected as single valued", return -1);
1785
1786 str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }";
1787 map = isl_map_read_from_str(ctx, str);
1788 sv = isl_map_is_single_valued(map);
1789 isl_map_free(map);
1790 if (sv < 0)
1791 return -1;
1792 if (sv)
1793 isl_die(ctx, isl_error_internal,
1794 "map detected as single valued", return -1);
1795
1796 str = "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }";
1797 umap = isl_union_map_read_from_str(ctx, str);
1798 sv = isl_union_map_is_single_valued(umap);
1799 isl_union_map_free(umap);
1800 if (sv < 0)
1801 return -1;
1802 if (!sv)
1803 isl_die(ctx, isl_error_internal,
1804 "map not detected as single valued", return -1);
1805
1806 str = "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }";
1807 umap = isl_union_map_read_from_str(ctx, str);
1808 sv = isl_union_map_is_single_valued(umap);
1809 isl_union_map_free(umap);
1810 if (sv < 0)
1811 return -1;
1812 if (sv)
1813 isl_die(ctx, isl_error_internal,
1814 "map detected as single valued", return -1);
1815
1816 return 0;
1817 }
1818
1819 void test_bijective_case(struct isl_ctx *ctx, const char *str, int bijective)
1820 {
1821 isl_map *map;
1822
1823 map = isl_map_read_from_str(ctx, str);
1824 if (bijective)
1825 assert(isl_map_is_bijective(map));
1826 else
1827 assert(!isl_map_is_bijective(map));
1828 isl_map_free(map);
1829 }
1830
1831 void test_bijective(struct isl_ctx *ctx)
1832 {
1833 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i]}", 0);
1834 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=i}", 1);
1835 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=0}", 1);
1836 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=N}", 1);
1837 test_bijective_case(ctx, "[N,M]->{[i,j] -> [j,i]}", 1);
1838 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i+j]}", 0);
1839 test_bijective_case(ctx, "[N,M]->{[i,j] -> []}", 0);
1840 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,j,N]}", 1);
1841 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i]}", 0);
1842 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,i]}", 0);
1843 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,i]}", 0);
1844 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,j]}", 1);
1845 test_bijective_case(ctx, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1);
1846 }
1847
1848 void test_pwqp(struct isl_ctx *ctx)
1849 {
1850 const char *str;
1851 isl_set *set;
1852 isl_pw_qpolynomial *pwqp1, *pwqp2;
1853
1854 str = "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1855 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1856
1857 pwqp1 = isl_pw_qpolynomial_move_dims(pwqp1, isl_dim_param, 0,
1858 isl_dim_in, 1, 1);
1859
1860 str = "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1861 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1862
1863 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1864
1865 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1866
1867 isl_pw_qpolynomial_free(pwqp1);
1868
1869 str = "{ [i] -> i }";
1870 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1871 str = "{ [k] : exists a : k = 2a }";
1872 set = isl_set_read_from_str(ctx, str);
1873 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1874 str = "{ [i] -> i }";
1875 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1876
1877 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1878
1879 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1880
1881 isl_pw_qpolynomial_free(pwqp1);
1882
1883 str = "{ [i] -> i + [ (i + [i/3])/2 ] }";
1884 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1885 str = "{ [10] }";
1886 set = isl_set_read_from_str(ctx, str);
1887 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1888 str = "{ [i] -> 16 }";
1889 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1890
1891 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1892
1893 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1894
1895 isl_pw_qpolynomial_free(pwqp1);
1896
1897 str = "{ [i] -> ([(i)/2]) }";
1898 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1899 str = "{ [k] : exists a : k = 2a+1 }";
1900 set = isl_set_read_from_str(ctx, str);
1901 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1902 str = "{ [i] -> -1/2 + 1/2 * i }";
1903 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1904
1905 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1906
1907 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1908
1909 isl_pw_qpolynomial_free(pwqp1);
1910
1911 str = "{ [i] -> ([([i/2] + [i/2])/5]) }";
1912 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1913 str = "{ [i] -> ([(2 * [i/2])/5]) }";
1914 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1915
1916 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1917
1918 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1919
1920 isl_pw_qpolynomial_free(pwqp1);
1921
1922 str = "{ [x] -> ([x/2] + [(x+1)/2]) }";
1923 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1924 str = "{ [x] -> x }";
1925 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1926
1927 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1928
1929 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1930
1931 isl_pw_qpolynomial_free(pwqp1);
1932
1933 str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
1934 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1935 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1936 pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1);
1937 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1938 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1939 isl_pw_qpolynomial_free(pwqp1);
1940 }
1941
1942 void test_split_periods(isl_ctx *ctx)
1943 {
1944 const char *str;
1945 isl_pw_qpolynomial *pwqp;
1946
1947 str = "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
1948 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
1949 "U >= 0; [U,V] -> U^2 : U >= 100 }";
1950 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
1951
1952 pwqp = isl_pw_qpolynomial_split_periods(pwqp, 2);
1953 assert(pwqp);
1954
1955 isl_pw_qpolynomial_free(pwqp);
1956 }
1957
1958 void test_union(isl_ctx *ctx)
1959 {
1960 const char *str;
1961 isl_union_set *uset1, *uset2;
1962 isl_union_map *umap1, *umap2;
1963
1964 str = "{ [i] : 0 <= i <= 1 }";
1965 uset1 = isl_union_set_read_from_str(ctx, str);
1966 str = "{ [1] -> [0] }";
1967 umap1 = isl_union_map_read_from_str(ctx, str);
1968
1969 umap2 = isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1), uset1);
1970 assert(isl_union_map_is_equal(umap1, umap2));
1971
1972 isl_union_map_free(umap1);
1973 isl_union_map_free(umap2);
1974
1975 str = "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
1976 umap1 = isl_union_map_read_from_str(ctx, str);
1977 str = "{ A[i]; B[i] }";
1978 uset1 = isl_union_set_read_from_str(ctx, str);
1979
1980 uset2 = isl_union_map_domain(umap1);
1981
1982 assert(isl_union_set_is_equal(uset1, uset2));
1983
1984 isl_union_set_free(uset1);
1985 isl_union_set_free(uset2);
1986 }
1987
1988 void test_bound(isl_ctx *ctx)
1989 {
1990 const char *str;
1991 isl_pw_qpolynomial *pwqp;
1992 isl_pw_qpolynomial_fold *pwf;
1993
1994 str = "{ [[a, b, c, d] -> [e]] -> 0 }";
1995 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
1996 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
1997 assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 4);
1998 isl_pw_qpolynomial_fold_free(pwf);
1999
2000 str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
2001 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
2002 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
2003 assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 1);
2004 isl_pw_qpolynomial_fold_free(pwf);
2005 }
2006
2007 void test_lift(isl_ctx *ctx)
2008 {
2009 const char *str;
2010 isl_basic_map *bmap;
2011 isl_basic_set *bset;
2012
2013 str = "{ [i0] : exists e0 : i0 = 4e0 }";
2014 bset = isl_basic_set_read_from_str(ctx, str);
2015 bset = isl_basic_set_lift(bset);
2016 bmap = isl_basic_map_from_range(bset);
2017 bset = isl_basic_map_domain(bmap);
2018 isl_basic_set_free(bset);
2019 }
2020
2021 struct {
2022 const char *set1;
2023 const char *set2;
2024 int subset;
2025 } subset_tests[] = {
2026 { "{ [112, 0] }",
2027 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
2028 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
2029 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
2030 { "{ [65] }",
2031 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
2032 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
2033 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
2034 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
2035 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
2036 "256e0 <= 255i and 256e0 >= -255 + 255i and "
2037 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
2038 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
2039 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
2040 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
2041 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
2042 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
2043 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
2044 };
2045
2046 static int test_subset(isl_ctx *ctx)
2047 {
2048 int i;
2049 isl_set *set1, *set2;
2050 int subset;
2051
2052 for (i = 0; i < ARRAY_SIZE(subset_tests); ++i) {
2053 set1 = isl_set_read_from_str(ctx, subset_tests[i].set1);
2054 set2 = isl_set_read_from_str(ctx, subset_tests[i].set2);
2055 subset = isl_set_is_subset(set1, set2);
2056 isl_set_free(set1);
2057 isl_set_free(set2);
2058 if (subset < 0)
2059 return -1;
2060 if (subset != subset_tests[i].subset)
2061 isl_die(ctx, isl_error_unknown,
2062 "incorrect subset result", return -1);
2063 }
2064
2065 return 0;
2066 }
2067
2068 struct {
2069 const char *minuend;
2070 const char *subtrahend;
2071 const char *difference;
2072 } subtract_domain_tests[] = {
2073 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
2074 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
2075 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
2076 };
2077
2078 static int test_subtract(isl_ctx *ctx)
2079 {
2080 int i;
2081 isl_union_map *umap1, *umap2;
2082 isl_union_set *uset;
2083 int equal;
2084
2085 for (i = 0; i < ARRAY_SIZE(subtract_domain_tests); ++i) {
2086 umap1 = isl_union_map_read_from_str(ctx,
2087 subtract_domain_tests[i].minuend);
2088 uset = isl_union_set_read_from_str(ctx,
2089 subtract_domain_tests[i].subtrahend);
2090 umap2 = isl_union_map_read_from_str(ctx,
2091 subtract_domain_tests[i].difference);
2092 umap1 = isl_union_map_subtract_domain(umap1, uset);
2093 equal = isl_union_map_is_equal(umap1, umap2);
2094 isl_union_map_free(umap1);
2095 isl_union_map_free(umap2);
2096 if (equal < 0)
2097 return -1;
2098 if (!equal)
2099 isl_die(ctx, isl_error_unknown,
2100 "incorrect subtract domain result", return -1);
2101 }
2102
2103 return 0;
2104 }
2105
2106 int test_factorize(isl_ctx *ctx)
2107 {
2108 const char *str;
2109 isl_basic_set *bset;
2110 isl_factorizer *f;
2111
2112 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
2113 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
2114 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
2115 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
2116 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
2117 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
2118 "3i5 >= -2i0 - i2 + 3i4 }";
2119 bset = isl_basic_set_read_from_str(ctx, str);
2120 f = isl_basic_set_factorizer(bset);
2121 isl_basic_set_free(bset);
2122 isl_factorizer_free(f);
2123 if (!f)
2124 isl_die(ctx, isl_error_unknown,
2125 "failed to construct factorizer", return -1);
2126
2127 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
2128 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
2129 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
2130 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
2131 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
2132 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
2133 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
2134 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
2135 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
2136 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
2137 bset = isl_basic_set_read_from_str(ctx, str);
2138 f = isl_basic_set_factorizer(bset);
2139 isl_basic_set_free(bset);
2140 isl_factorizer_free(f);
2141 if (!f)
2142 isl_die(ctx, isl_error_unknown,
2143 "failed to construct factorizer", return -1);
2144
2145 return 0;
2146 }
2147
2148 static int check_injective(__isl_take isl_map *map, void *user)
2149 {
2150 int *injective = user;
2151
2152 *injective = isl_map_is_injective(map);
2153 isl_map_free(map);
2154
2155 if (*injective < 0 || !*injective)
2156 return -1;
2157
2158 return 0;
2159 }
2160
2161 int test_one_schedule(isl_ctx *ctx, const char *d, const char *w,
2162 const char *r, const char *s, int tilable, int parallel)
2163 {
2164 int i;
2165 isl_union_set *D;
2166 isl_union_map *W, *R, *S;
2167 isl_union_map *empty;
2168 isl_union_map *dep_raw, *dep_war, *dep_waw, *dep;
2169 isl_union_map *validity, *proximity;
2170 isl_union_map *schedule;
2171 isl_union_map *test;
2172 isl_union_set *delta;
2173 isl_union_set *domain;
2174 isl_set *delta_set;
2175 isl_set *slice;
2176 isl_set *origin;
2177 isl_schedule *sched;
2178 int is_nonneg, is_parallel, is_tilable, is_injection, is_complete;
2179
2180 D = isl_union_set_read_from_str(ctx, d);
2181 W = isl_union_map_read_from_str(ctx, w);
2182 R = isl_union_map_read_from_str(ctx, r);
2183 S = isl_union_map_read_from_str(ctx, s);
2184
2185 W = isl_union_map_intersect_domain(W, isl_union_set_copy(D));
2186 R = isl_union_map_intersect_domain(R, isl_union_set_copy(D));
2187
2188 empty = isl_union_map_empty(isl_union_map_get_space(S));
2189 isl_union_map_compute_flow(isl_union_map_copy(R),
2190 isl_union_map_copy(W), empty,
2191 isl_union_map_copy(S),
2192 &dep_raw, NULL, NULL, NULL);
2193 isl_union_map_compute_flow(isl_union_map_copy(W),
2194 isl_union_map_copy(W),
2195 isl_union_map_copy(R),
2196 isl_union_map_copy(S),
2197 &dep_waw, &dep_war, NULL, NULL);
2198
2199 dep = isl_union_map_union(dep_waw, dep_war);
2200 dep = isl_union_map_union(dep, dep_raw);
2201 validity = isl_union_map_copy(dep);
2202 proximity = isl_union_map_copy(dep);
2203
2204 sched = isl_union_set_compute_schedule(isl_union_set_copy(D),
2205 validity, proximity);
2206 schedule = isl_schedule_get_map(sched);
2207 isl_schedule_free(sched);
2208 isl_union_map_free(W);
2209 isl_union_map_free(R);
2210 isl_union_map_free(S);
2211
2212 is_injection = 1;
2213 isl_union_map_foreach_map(schedule, &check_injective, &is_injection);
2214
2215 domain = isl_union_map_domain(isl_union_map_copy(schedule));
2216 is_complete = isl_union_set_is_subset(D, domain);
2217 isl_union_set_free(D);
2218 isl_union_set_free(domain);
2219
2220 test = isl_union_map_reverse(isl_union_map_copy(schedule));
2221 test = isl_union_map_apply_range(test, dep);
2222 test = isl_union_map_apply_range(test, schedule);
2223
2224 delta = isl_union_map_deltas(test);
2225 if (isl_union_set_n_set(delta) == 0) {
2226 is_tilable = 1;
2227 is_parallel = 1;
2228 is_nonneg = 1;
2229 isl_union_set_free(delta);
2230 } else {
2231 delta_set = isl_set_from_union_set(delta);
2232
2233 slice = isl_set_universe(isl_set_get_space(delta_set));
2234 for (i = 0; i < tilable; ++i)
2235 slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0);
2236 is_tilable = isl_set_is_subset(delta_set, slice);
2237 isl_set_free(slice);
2238
2239 slice = isl_set_universe(isl_set_get_space(delta_set));
2240 for (i = 0; i < parallel; ++i)
2241 slice = isl_set_fix_si(slice, isl_dim_set, i, 0);
2242 is_parallel = isl_set_is_subset(delta_set, slice);
2243 isl_set_free(slice);
2244
2245 origin = isl_set_universe(isl_set_get_space(delta_set));
2246 for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i)
2247 origin = isl_set_fix_si(origin, isl_dim_set, i, 0);
2248
2249 delta_set = isl_set_union(delta_set, isl_set_copy(origin));
2250 delta_set = isl_set_lexmin(delta_set);
2251
2252 is_nonneg = isl_set_is_equal(delta_set, origin);
2253
2254 isl_set_free(origin);
2255 isl_set_free(delta_set);
2256 }
2257
2258 if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 ||
2259 is_injection < 0 || is_complete < 0)
2260 return -1;
2261 if (!is_complete)
2262 isl_die(ctx, isl_error_unknown,
2263 "generated schedule incomplete", return -1);
2264 if (!is_injection)
2265 isl_die(ctx, isl_error_unknown,
2266 "generated schedule not injective on each statement",
2267 return -1);
2268 if (!is_nonneg)
2269 isl_die(ctx, isl_error_unknown,
2270 "negative dependences in generated schedule",
2271 return -1);
2272 if (!is_tilable)
2273 isl_die(ctx, isl_error_unknown,
2274 "generated schedule not as tilable as expected",
2275 return -1);
2276 if (!is_parallel)
2277 isl_die(ctx, isl_error_unknown,
2278 "generated schedule not as parallel as expected",
2279 return -1);
2280
2281 return 0;
2282 }
2283
2284 static __isl_give isl_union_map *compute_schedule(isl_ctx *ctx,
2285 const char *domain, const char *validity, const char *proximity)
2286 {
2287 isl_union_set *dom;
2288 isl_union_map *dep;
2289 isl_union_map *prox;
2290 isl_schedule *schedule;
2291 isl_union_map *sched;
2292
2293 dom = isl_union_set_read_from_str(ctx, domain);
2294 dep = isl_union_map_read_from_str(ctx, validity);
2295 prox = isl_union_map_read_from_str(ctx, proximity);
2296 schedule = isl_union_set_compute_schedule(dom, dep, prox);
2297 sched = isl_schedule_get_map(schedule);
2298 isl_schedule_free(schedule);
2299
2300 return sched;
2301 }
2302
2303 /* Check that a schedule can be constructed on the given domain
2304 * with the given validity and proximity constraints.
2305 */
2306 static int test_has_schedule(isl_ctx *ctx, const char *domain,
2307 const char *validity, const char *proximity)
2308 {
2309 isl_union_map *sched;
2310
2311 sched = compute_schedule(ctx, domain, validity, proximity);
2312 if (!sched)
2313 return -1;
2314
2315 isl_union_map_free(sched);
2316 return 0;
2317 }
2318
2319 int test_special_schedule(isl_ctx *ctx, const char *domain,
2320 const char *validity, const char *proximity, const char *expected_sched)
2321 {
2322 isl_union_map *sched1, *sched2;
2323 int equal;
2324
2325 sched1 = compute_schedule(ctx, domain, validity, proximity);
2326 sched2 = isl_union_map_read_from_str(ctx, expected_sched);
2327
2328 equal = isl_union_map_is_equal(sched1, sched2);
2329 isl_union_map_free(sched1);
2330 isl_union_map_free(sched2);
2331
2332 if (equal < 0)
2333 return -1;
2334 if (!equal)
2335 isl_die(ctx, isl_error_unknown, "unexpected schedule",
2336 return -1);
2337
2338 return 0;
2339 }
2340
2341 int test_schedule(isl_ctx *ctx)
2342 {
2343 const char *D, *W, *R, *V, *P, *S;
2344
2345 /* Handle resulting schedule with zero bands. */
2346 if (test_one_schedule(ctx, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
2347 return -1;
2348
2349 /* Jacobi */
2350 D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
2351 W = "{ S1[t,i] -> a[t,i] }";
2352 R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
2353 "S1[t,i] -> a[t-1,i+1] }";
2354 S = "{ S1[t,i] -> [t,i] }";
2355 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2356 return -1;
2357
2358 /* Fig. 5 of CC2008 */
2359 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
2360 "j <= -1 + N }";
2361 W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
2362 "j >= 2 and j <= -1 + N }";
2363 R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
2364 "j >= 2 and j <= -1 + N; "
2365 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
2366 "j >= 2 and j <= -1 + N }";
2367 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2368 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2369 return -1;
2370
2371 D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
2372 W = "{ S1[i] -> a[i] }";
2373 R = "{ S2[i] -> a[i+1] }";
2374 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2375 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2376 return -1;
2377
2378 D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
2379 W = "{ S1[i] -> a[i] }";
2380 R = "{ S2[i] -> a[9-i] }";
2381 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2382 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2383 return -1;
2384
2385 D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
2386 W = "{ S1[i] -> a[i] }";
2387 R = "[N] -> { S2[i] -> a[N-1-i] }";
2388 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2389 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2390 return -1;
2391
2392 D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
2393 W = "{ S1[i] -> a[i]; S2[i] -> b[i] }";
2394 R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
2395 S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
2396 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2397 return -1;
2398
2399 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2400 W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
2401 R = "{ S2[i,j] -> a[i-1,j] }";
2402 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2403 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2404 return -1;
2405
2406 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2407 W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
2408 R = "{ S2[i,j] -> a[i,j-1] }";
2409 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2410 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2411 return -1;
2412
2413 D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
2414 W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
2415 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
2416 R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
2417 S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
2418 "S_0[] -> [0, 0, 0] }";
2419 if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0)
2420 return -1;
2421 ctx->opt->schedule_parametric = 0;
2422 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2423 return -1;
2424 ctx->opt->schedule_parametric = 1;
2425
2426 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
2427 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
2428 W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
2429 R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
2430 "S4[i] -> a[i,N] }";
2431 S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
2432 "S4[i] -> [4,i,0] }";
2433 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2434 return -1;
2435
2436 D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
2437 W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2438 "j <= N }";
2439 R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2440 "j <= N; "
2441 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
2442 "j <= N }";
2443 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2444 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2445 return -1;
2446
2447 D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
2448 " S_2[t] : t >= 0 and t <= -1 + N; "
2449 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
2450 "i <= -1 + N }";
2451 W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
2452 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
2453 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
2454 "i >= 0 and i <= -1 + N }";
2455 R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
2456 "i >= 0 and i <= -1 + N; "
2457 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
2458 S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
2459 " S_0[t] -> [0, t, 0] }";
2460
2461 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2462 return -1;
2463 ctx->opt->schedule_parametric = 0;
2464 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2465 return -1;
2466 ctx->opt->schedule_parametric = 1;
2467
2468 D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
2469 S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
2470 if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0)
2471 return -1;
2472
2473 D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
2474 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
2475 W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
2476 "j >= 0 and j <= -1 + N; "
2477 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2478 R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
2479 "j >= 0 and j <= -1 + N; "
2480 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2481 S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
2482 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2483 return -1;
2484
2485 D = "{ S_0[i] : i >= 0 }";
2486 W = "{ S_0[i] -> a[i] : i >= 0 }";
2487 R = "{ S_0[i] -> a[0] : i >= 0 }";
2488 S = "{ S_0[i] -> [0, i, 0] }";
2489 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2490 return -1;
2491
2492 D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
2493 W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
2494 R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
2495 S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
2496 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2497 return -1;
2498
2499 D = "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
2500 "k <= -1 + n and k >= 0 }";
2501 W = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
2502 R = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
2503 "k <= -1 + n and k >= 0; "
2504 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
2505 "k <= -1 + n and k >= 0; "
2506 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
2507 "k <= -1 + n and k >= 0 }";
2508 S = "[n] -> { S_0[j, k] -> [2, j, k] }";
2509 ctx->opt->schedule_outer_zero_distance = 1;
2510 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2511 return -1;
2512 ctx->opt->schedule_outer_zero_distance = 0;
2513
2514 D = "{Stmt_for_body24[i0, i1, i2, i3]:"
2515 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
2516 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
2517 "Stmt_for_body24[i0, i1, 1, 0]:"
2518 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
2519 "Stmt_for_body7[i0, i1, i2]:"
2520 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
2521 "i2 <= 7 }";
2522
2523 V = "{Stmt_for_body24[0, i1, i2, i3] -> "
2524 "Stmt_for_body24[1, i1, i2, i3]:"
2525 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
2526 "i2 >= 1;"
2527 "Stmt_for_body24[0, i1, i2, i3] -> "
2528 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
2529 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
2530 "i3 >= 0;"
2531 "Stmt_for_body24[0, i1, i2, i3] ->"
2532 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
2533 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
2534 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
2535 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
2536 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
2537 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
2538 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
2539 "i1 <= 6 and i1 >= 0;"
2540 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
2541 "Stmt_for_body7[i0, i1, i2] -> "
2542 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
2543 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
2544 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
2545 "Stmt_for_body7[i0, i1, i2] -> "
2546 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
2547 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
2548 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
2549 P = V;
2550 S = "{ Stmt_for_body24[i0, i1, i2, i3] -> "
2551 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
2552 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
2553
2554 if (test_special_schedule(ctx, D, V, P, S) < 0)
2555 return -1;
2556
2557 D = "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
2558 V = "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
2559 "j >= 1 and j <= 7;"
2560 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
2561 "j >= 1 and j <= 8 }";
2562 P = "{ }";
2563 S = "{ S_0[i, j] -> [i + j, j] }";
2564 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
2565 if (test_special_schedule(ctx, D, V, P, S) < 0)
2566 return -1;
2567 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
2568
2569 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
2570 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
2571 "j >= 0 and j <= -1 + i }";
2572 V = "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
2573 "i <= -1 + N and j >= 0;"
2574 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
2575 "i <= -2 + N }";
2576 P = "{ }";
2577 S = "{ S_0[i, j] -> [i, j] }";
2578 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
2579 if (test_special_schedule(ctx, D, V, P, S) < 0)
2580 return -1;
2581 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
2582
2583 /* Test both algorithms on a case with only proximity dependences. */
2584 D = "{ S[i,j] : 0 <= i <= 10 }";
2585 V = "{ }";
2586 P = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
2587 S = "{ S[i, j] -> [j, i] }";
2588 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER;
2589 if (test_special_schedule(ctx, D, V, P, S) < 0)
2590 return -1;
2591 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL;
2592 if (test_special_schedule(ctx, D, V, P, S) < 0)
2593 return -1;
2594
2595 D = "{ A[a]; B[] }";
2596 V = "{}";
2597 P = "{ A[a] -> B[] }";
2598 if (test_has_schedule(ctx, D, V, P) < 0)
2599 return -1;
2600
2601 return 0;
2602 }
2603
2604 int test_plain_injective(isl_ctx *ctx, const char *str, int injective)
2605 {
2606 isl_union_map *umap;
2607 int test;
2608
2609 umap = isl_union_map_read_from_str(ctx, str);
2610 test = isl_union_map_plain_is_injective(umap);
2611 isl_union_map_free(umap);
2612 if (test < 0)
2613 return -1;
2614 if (test == injective)
2615 return 0;
2616 if (injective)
2617 isl_die(ctx, isl_error_unknown,
2618 "map not detected as injective", return -1);
2619 else
2620 isl_die(ctx, isl_error_unknown,
2621 "map detected as injective", return -1);
2622 }
2623
2624 int test_injective(isl_ctx *ctx)
2625 {
2626 const char *str;
2627
2628 if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
2629 return -1;
2630 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1))
2631 return -1;
2632 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1))
2633 return -1;
2634 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0))
2635 return -1;
2636 if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
2637 return -1;
2638 if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
2639 return -1;
2640 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
2641 return -1;
2642 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
2643 return -1;
2644
2645 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
2646 if (test_plain_injective(ctx, str, 1))
2647 return -1;
2648 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
2649 if (test_plain_injective(ctx, str, 0))
2650 return -1;
2651
2652 return 0;
2653 }
2654
2655 static int aff_plain_is_equal(__isl_keep isl_aff *aff, const char *str)
2656 {
2657 isl_aff *aff2;
2658 int equal;
2659
2660 if (!aff)
2661 return -1;
2662
2663 aff2 = isl_aff_read_from_str(isl_aff_get_ctx(aff), str);
2664 equal = isl_aff_plain_is_equal(aff, aff2);
2665 isl_aff_free(aff2);
2666
2667 return equal;
2668 }
2669
2670 static int aff_check_plain_equal(__isl_keep isl_aff *aff, const char *str)
2671 {
2672 int equal;
2673
2674 equal = aff_plain_is_equal(aff, str);
2675 if (equal < 0)
2676 return -1;
2677 if (!equal)
2678 isl_die(isl_aff_get_ctx(aff), isl_error_unknown,
2679 "result not as expected", return -1);
2680 return 0;
2681 }
2682
2683 int test_aff(isl_ctx *ctx)
2684 {
2685 const char *str;
2686 isl_set *set;
2687 isl_space *space;
2688 isl_local_space *ls;
2689 isl_aff *aff;
2690 int zero, equal;
2691
2692 space = isl_space_set_alloc(ctx, 0, 1);
2693 ls = isl_local_space_from_space(space);
2694 aff = isl_aff_zero_on_domain(ls);
2695
2696 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2697 aff = isl_aff_scale_down_ui(aff, 3);
2698 aff = isl_aff_floor(aff);
2699 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2700 aff = isl_aff_scale_down_ui(aff, 2);
2701 aff = isl_aff_floor(aff);
2702 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2703
2704 str = "{ [10] }";
2705 set = isl_set_read_from_str(ctx, str);
2706 aff = isl_aff_gist(aff, set);
2707
2708 aff = isl_aff_add_constant_si(aff, -16);
2709 zero = isl_aff_plain_is_zero(aff);
2710 isl_aff_free(aff);
2711
2712 if (zero < 0)
2713 return -1;
2714 if (!zero)
2715 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2716
2717 aff = isl_aff_read_from_str(ctx, "{ [-1] }");
2718 aff = isl_aff_scale_down_ui(aff, 64);
2719 aff = isl_aff_floor(aff);
2720 equal = aff_check_plain_equal(aff, "{ [-1] }");
2721 isl_aff_free(aff);
2722 if (equal < 0)
2723 return -1;
2724
2725 return 0;
2726 }
2727
2728 int test_dim_max(isl_ctx *ctx)
2729 {
2730 int equal;
2731 const char *str;
2732 isl_set *set1, *set2;
2733 isl_set *set;
2734 isl_map *map;
2735 isl_pw_aff *pwaff;
2736
2737 str = "[N] -> { [i] : 0 <= i <= min(N,10) }";
2738 set = isl_set_read_from_str(ctx, str);
2739 pwaff = isl_set_dim_max(set, 0);
2740 set1 = isl_set_from_pw_aff(pwaff);
2741 str = "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
2742 set2 = isl_set_read_from_str(ctx, str);
2743 equal = isl_set_is_equal(set1, set2);
2744 isl_set_free(set1);
2745 isl_set_free(set2);
2746 if (equal < 0)
2747 return -1;
2748 if (!equal)
2749 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2750
2751 str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
2752 set = isl_set_read_from_str(ctx, str);
2753 pwaff = isl_set_dim_max(set, 0);
2754 set1 = isl_set_from_pw_aff(pwaff);
2755 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2756 set2 = isl_set_read_from_str(ctx, str);
2757 equal = isl_set_is_equal(set1, set2);
2758 isl_set_free(set1);
2759 isl_set_free(set2);
2760 if (equal < 0)
2761 return -1;
2762 if (!equal)
2763 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2764
2765 str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
2766 set = isl_set_read_from_str(ctx, str);
2767 pwaff = isl_set_dim_max(set, 0);
2768 set1 = isl_set_from_pw_aff(pwaff);
2769 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2770 set2 = isl_set_read_from_str(ctx, str);
2771 equal = isl_set_is_equal(set1, set2);
2772 isl_set_free(set1);
2773 isl_set_free(set2);
2774 if (equal < 0)
2775 return -1;
2776 if (!equal)
2777 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2778
2779 str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
2780 "0 <= i < N and 0 <= j < M }";
2781 map = isl_map_read_from_str(ctx, str);
2782 set = isl_map_range(map);
2783
2784 pwaff = isl_set_dim_max(isl_set_copy(set), 0);
2785 set1 = isl_set_from_pw_aff(pwaff);
2786 str = "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
2787 set2 = isl_set_read_from_str(ctx, str);
2788 equal = isl_set_is_equal(set1, set2);
2789 isl_set_free(set1);
2790 isl_set_free(set2);
2791
2792 pwaff = isl_set_dim_max(isl_set_copy(set), 3);
2793 set1 = isl_set_from_pw_aff(pwaff);
2794 str = "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
2795 set2 = isl_set_read_from_str(ctx, str);
2796 if (equal >= 0 && equal)
2797 equal = isl_set_is_equal(set1, set2);
2798 isl_set_free(set1);
2799 isl_set_free(set2);
2800
2801 isl_set_free(set);
2802
2803 if (equal < 0)
2804 return -1;
2805 if (!equal)
2806 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2807
2808 return 0;
2809 }
2810
2811 int test_product(isl_ctx *ctx)
2812 {
2813 const char *str;
2814 isl_set *set;
2815 isl_union_set *uset1, *uset2;
2816 int ok;
2817
2818 str = "{ A[i] }";
2819 set = isl_set_read_from_str(ctx, str);
2820 set = isl_set_product(set, isl_set_copy(set));
2821 ok = isl_set_is_wrapping(set);
2822 isl_set_free(set);
2823 if (ok < 0)
2824 return -1;
2825 if (!ok)
2826 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2827
2828 str = "{ [] }";
2829 uset1 = isl_union_set_read_from_str(ctx, str);
2830 uset1 = isl_union_set_product(uset1, isl_union_set_copy(uset1));
2831 str = "{ [[] -> []] }";
2832 uset2 = isl_union_set_read_from_str(ctx, str);
2833 ok = isl_union_set_is_equal(uset1, uset2);
2834 isl_union_set_free(uset1);
2835 isl_union_set_free(uset2);
2836 if (ok < 0)
2837 return -1;
2838 if (!ok)
2839 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2840
2841 return 0;
2842 }
2843
2844 int test_equal(isl_ctx *ctx)
2845 {
2846 const char *str;
2847 isl_set *set, *set2;
2848 int equal;
2849
2850 str = "{ S_6[i] }";
2851 set = isl_set_read_from_str(ctx, str);
2852 str = "{ S_7[i] }";
2853 set2 = isl_set_read_from_str(ctx, str);
2854 equal = isl_set_is_equal(set, set2);
2855 isl_set_free(set);
2856 isl_set_free(set2);
2857 if (equal < 0)
2858 return -1;
2859 if (equal)
2860 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2861
2862 return 0;
2863 }
2864
2865 static int test_plain_fixed(isl_ctx *ctx, __isl_take isl_map *map,
2866 enum isl_dim_type type, unsigned pos, int fixed)
2867 {
2868 int test;
2869
2870 test = isl_map_plain_is_fixed(map, type, pos, NULL);
2871 isl_map_free(map);
2872 if (test < 0)
2873 return -1;
2874 if (test == fixed)
2875 return 0;
2876 if (fixed)
2877 isl_die(ctx, isl_error_unknown,
2878 "map not detected as fixed", return -1);
2879 else
2880 isl_die(ctx, isl_error_unknown,
2881 "map detected as fixed", return -1);
2882 }
2883
2884 int test_fixed(isl_ctx *ctx)
2885 {
2886 const char *str;
2887 isl_map *map;
2888
2889 str = "{ [i] -> [i] }";
2890 map = isl_map_read_from_str(ctx, str);
2891 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 0))
2892 return -1;
2893 str = "{ [i] -> [1] }";
2894 map = isl_map_read_from_str(ctx, str);
2895 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2896 return -1;
2897 str = "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
2898 map = isl_map_read_from_str(ctx, str);
2899 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2900 return -1;
2901 map = isl_map_read_from_str(ctx, str);
2902 map = isl_map_neg(map);
2903 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2904 return -1;
2905
2906 return 0;
2907 }
2908
2909 int test_vertices(isl_ctx *ctx)
2910 {
2911 const char *str;
2912 isl_basic_set *bset;
2913 isl_vertices *vertices;
2914
2915 str = "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }";
2916 bset = isl_basic_set_read_from_str(ctx, str);
2917 vertices = isl_basic_set_compute_vertices(bset);
2918 isl_basic_set_free(bset);
2919 isl_vertices_free(vertices);
2920 if (!vertices)
2921 return -1;
2922
2923 str = "{ A[t, i] : t = 14 and i = 1 }";
2924 bset = isl_basic_set_read_from_str(ctx, str);
2925 vertices = isl_basic_set_compute_vertices(bset);
2926 isl_basic_set_free(bset);
2927 isl_vertices_free(vertices);
2928 if (!vertices)
2929 return -1;
2930
2931 return 0;
2932 }
2933
2934 int test_union_pw(isl_ctx *ctx)
2935 {
2936 int equal;
2937 const char *str;
2938 isl_union_set *uset;
2939 isl_union_pw_qpolynomial *upwqp1, *upwqp2;
2940
2941 str = "{ [x] -> x^2 }";
2942 upwqp1 = isl_union_pw_qpolynomial_read_from_str(ctx, str);
2943 upwqp2 = isl_union_pw_qpolynomial_copy(upwqp1);
2944 uset = isl_union_pw_qpolynomial_domain(upwqp1);
2945 upwqp1 = isl_union_pw_qpolynomial_copy(upwqp2);
2946 upwqp1 = isl_union_pw_qpolynomial_intersect_domain(upwqp1, uset);
2947 equal = isl_union_pw_qpolynomial_plain_is_equal(upwqp1, upwqp2);
2948 isl_union_pw_qpolynomial_free(upwqp1);
2949 isl_union_pw_qpolynomial_free(upwqp2);
2950 if (equal < 0)
2951 return -1;
2952 if (!equal)
2953 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2954
2955 return 0;
2956 }
2957
2958 int test_output(isl_ctx *ctx)
2959 {
2960 char *s;
2961 const char *str;
2962 isl_pw_aff *pa;
2963 isl_printer *p;
2964 int equal;
2965
2966 str = "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
2967 pa = isl_pw_aff_read_from_str(ctx, str);
2968
2969 p = isl_printer_to_str(ctx);
2970 p = isl_printer_set_output_format(p, ISL_FORMAT_C);
2971 p = isl_printer_print_pw_aff(p, pa);
2972 s = isl_printer_get_str(p);
2973 isl_printer_free(p);
2974 isl_pw_aff_free(pa);
2975 if (!s)
2976 equal = -1;
2977 else
2978 equal = !strcmp(s, "(2 - x + 4*floord(x, 4) >= 0) ? (1) : 2");
2979 free(s);
2980 if (equal < 0)
2981 return -1;
2982 if (!equal)
2983 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2984
2985 return 0;
2986 }
2987
2988 int test_sample(isl_ctx *ctx)
2989 {
2990 const char *str;
2991 isl_basic_set *bset1, *bset2;
2992 int empty, subset;
2993
2994 str = "{ [a, b, c, d, e, f, g, h, i, j, k] : "
2995 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
2996 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
2997 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
2998 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
2999 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
3000 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
3001 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
3002 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
3003 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
3004 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
3005 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
3006 "d - 1073741821e and "
3007 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
3008 "3j >= 1 - a + b + 2e and "
3009 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
3010 "3i <= 4 - a + 4b - e and "
3011 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
3012 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
3013 "c <= -1 + a and 3i >= -2 - a + 3e and "
3014 "1073741822e <= 1073741823 - a + 1073741822b + c and "
3015 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
3016 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
3017 "1073741823e >= 1 + 1073741823b - d and "
3018 "3i >= 1073741823b + c - 1073741823e - f and "
3019 "3i >= 1 + 2b + e + 3g }";
3020 bset1 = isl_basic_set_read_from_str(ctx, str);
3021 bset2 = isl_basic_set_sample(isl_basic_set_copy(bset1));
3022 empty = isl_basic_set_is_empty(bset2);
3023 subset = isl_basic_set_is_subset(bset2, bset1);
3024 isl_basic_set_free(bset1);
3025 isl_basic_set_free(bset2);
3026 if (empty < 0 || subset < 0)
3027 return -1;
3028 if (empty)
3029 isl_die(ctx, isl_error_unknown, "point not found", return -1);
3030 if (!subset)
3031 isl_die(ctx, isl_error_unknown, "bad point found", return -1);
3032
3033 return 0;
3034 }
3035
3036 int test_fixed_power(isl_ctx *ctx)
3037 {
3038 const char *str;
3039 isl_map *map;
3040 isl_int exp;
3041 int equal;
3042
3043 isl_int_init(exp);
3044 str = "{ [i] -> [i + 1] }";
3045 map = isl_map_read_from_str(ctx, str);
3046 isl_int_set_si(exp, 23);
3047 map = isl_map_fixed_power(map, exp);
3048 equal = map_check_equal(map, "{ [i] -> [i + 23] }");
3049 isl_int_clear(exp);
3050 isl_map_free(map);
3051 if (equal < 0)
3052 return -1;
3053
3054 return 0;
3055 }
3056
3057 int test_slice(isl_ctx *ctx)
3058 {
3059 const char *str;
3060 isl_map *map;
3061 int equal;
3062
3063 str = "{ [i] -> [j] }";
3064 map = isl_map_read_from_str(ctx, str);
3065 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_out, 0);
3066 equal = map_check_equal(map, "{ [i] -> [i] }");
3067 isl_map_free(map);
3068 if (equal < 0)
3069 return -1;
3070
3071 str = "{ [i] -> [j] }";
3072 map = isl_map_read_from_str(ctx, str);
3073 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_in, 0);
3074 equal = map_check_equal(map, "{ [i] -> [j] }");
3075 isl_map_free(map);
3076 if (equal < 0)
3077 return -1;
3078
3079 str = "{ [i] -> [j] }";
3080 map = isl_map_read_from_str(ctx, str);
3081 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_out, 0);
3082 equal = map_check_equal(map, "{ [i] -> [-i] }");
3083 isl_map_free(map);
3084 if (equal < 0)
3085 return -1;
3086
3087 str = "{ [i] -> [j] }";
3088 map = isl_map_read_from_str(ctx, str);
3089 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_in, 0);
3090 equal = map_check_equal(map, "{ [0] -> [j] }");
3091 isl_map_free(map);
3092 if (equal < 0)
3093 return -1;
3094
3095 str = "{ [i] -> [j] }";
3096 map = isl_map_read_from_str(ctx, str);
3097 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_out, 0);
3098 equal = map_check_equal(map, "{ [i] -> [j] : i > j }");
3099 isl_map_free(map);
3100 if (equal < 0)
3101 return -1;
3102
3103 str = "{ [i] -> [j] }";
3104 map = isl_map_read_from_str(ctx, str);
3105 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_in, 0);
3106 equal = map_check_equal(map, "{ [i] -> [j] : false }");
3107 isl_map_free(map);
3108 if (equal < 0)
3109 return -1;
3110
3111 return 0;
3112 }
3113
3114 int test_eliminate(isl_ctx *ctx)
3115 {
3116 const char *str;
3117 isl_map *map;
3118 int equal;
3119
3120 str = "{ [i] -> [j] : i = 2j }";
3121 map = isl_map_read_from_str(ctx, str);
3122 map = isl_map_eliminate(map, isl_dim_out, 0, 1);
3123 equal = map_check_equal(map, "{ [i] -> [j] : exists a : i = 2a }");
3124 isl_map_free(map);
3125 if (equal < 0)
3126 return -1;
3127
3128 return 0;
3129 }
3130
3131 /* Check that isl_set_dim_residue_class detects that the values of j
3132 * in the set below are all odd and that it does not detect any spurious
3133 * strides.
3134 */
3135 static int test_residue_class(isl_ctx *ctx)
3136 {
3137 const char *str;
3138 isl_set *set;
3139 isl_int m, r;
3140 int res;
3141
3142 str = "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
3143 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
3144 set = isl_set_read_from_str(ctx, str);
3145 isl_int_init(m);
3146 isl_int_init(r);
3147 res = isl_set_dim_residue_class(set, 1, &m, &r);
3148 if (res >= 0 &&
3149 (isl_int_cmp_si(m, 2) != 0 || isl_int_cmp_si(r, 1) != 0))
3150 isl_die(ctx, isl_error_unknown, "incorrect residue class",
3151 res = -1);
3152 isl_int_clear(r);
3153 isl_int_clear(m);
3154 isl_set_free(set);
3155
3156 return res;
3157 }
3158
3159 int test_align_parameters(isl_ctx *ctx)
3160 {
3161 const char *str;
3162 isl_space *space;
3163 isl_multi_aff *ma1, *ma2;
3164 int equal;
3165
3166 str = "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
3167 ma1 = isl_multi_aff_read_from_str(ctx, str);
3168
3169 space = isl_space_params_alloc(ctx, 1);
3170 space = isl_space_set_dim_name(space, isl_dim_param, 0, "N");
3171 ma1 = isl_multi_aff_align_params(ma1, space);
3172
3173 str = "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
3174 ma2 = isl_multi_aff_read_from_str(ctx, str);
3175
3176 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
3177
3178 isl_multi_aff_free(ma1);
3179 isl_multi_aff_free(ma2);
3180
3181 if (equal < 0)
3182 return -1;
3183 if (!equal)
3184 isl_die(ctx, isl_error_unknown,
3185 "result not as expected", return -1);
3186
3187 return 0;
3188 }
3189
3190 static int test_list(isl_ctx *ctx)
3191 {
3192 isl_id *a, *b, *c, *d, *id;
3193 isl_id_list *list;
3194 int ok;
3195
3196 a = isl_id_alloc(ctx, "a", NULL);
3197 b = isl_id_alloc(ctx, "b", NULL);
3198 c = isl_id_alloc(ctx, "c", NULL);
3199 d = isl_id_alloc(ctx, "d", NULL);
3200
3201 list = isl_id_list_alloc(ctx, 4);
3202 list = isl_id_list_add(list, a);
3203 list = isl_id_list_add(list, b);
3204 list = isl_id_list_add(list, c);
3205 list = isl_id_list_add(list, d);
3206 list = isl_id_list_drop(list, 1, 1);
3207
3208 if (isl_id_list_n_id(list) != 3) {
3209 isl_id_list_free(list);
3210 isl_die(ctx, isl_error_unknown,
3211 "unexpected number of elements in list", return -1);
3212 }
3213
3214 id = isl_id_list_get_id(list, 0);
3215 ok = id == a;
3216 isl_id_free(id);
3217 id = isl_id_list_get_id(list, 1);
3218 ok = ok && id == c;
3219 isl_id_free(id);
3220 id = isl_id_list_get_id(list, 2);
3221 ok = ok && id == d;
3222 isl_id_free(id);
3223
3224 isl_id_list_free(list);
3225
3226 if (!ok)
3227 isl_die(ctx, isl_error_unknown,
3228 "unexpected elements in list", return -1);
3229
3230 return 0;
3231 }
3232
3233 const char *set_conversion_tests[] = {
3234 "[N] -> { [i] : N - 1 <= 2 i <= N }",
3235 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
3236 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3237 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
3238 };
3239
3240 /* Check that converting from isl_set to isl_pw_multi_aff and back
3241 * to isl_set produces the original isl_set.
3242 */
3243 static int test_set_conversion(isl_ctx *ctx)
3244 {
3245 int i;
3246 const char *str;
3247 isl_set *set1, *set2;
3248 isl_pw_multi_aff *pma;
3249 int equal;
3250
3251 for (i = 0; i < ARRAY_SIZE(set_conversion_tests); ++i) {
3252 str = set_conversion_tests[i];
3253 set1 = isl_set_read_from_str(ctx, str);
3254 pma = isl_pw_multi_aff_from_set(isl_set_copy(set1));
3255 set2 = isl_set_from_pw_multi_aff(pma);
3256 equal = isl_set_is_equal(set1, set2);
3257 isl_set_free(set1);
3258 isl_set_free(set2);
3259
3260 if (equal < 0)
3261 return -1;
3262 if (!equal)
3263 isl_die(ctx, isl_error_unknown, "bad conversion",
3264 return -1);
3265 }
3266
3267 return 0;
3268 }
3269
3270 /* Check that converting from isl_map to isl_pw_multi_aff and back
3271 * to isl_map produces the original isl_map.
3272 */
3273 static int test_map_conversion(isl_ctx *ctx)
3274 {
3275 const char *str;
3276 isl_map *map1, *map2;
3277 isl_pw_multi_aff *pma;
3278 int equal;
3279
3280 str = "{ [a, b, c, d] -> s0[a, b, e, f] : "
3281 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
3282 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
3283 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
3284 "9e <= -2 - 2a) }";
3285 map1 = isl_map_read_from_str(ctx, str);
3286 pma = isl_pw_multi_aff_from_map(isl_map_copy(map1));
3287 map2 = isl_map_from_pw_multi_aff(pma);
3288 equal = isl_map_is_equal(map1, map2);
3289 isl_map_free(map1);
3290 isl_map_free(map2);
3291
3292 if (equal < 0)
3293 return -1;
3294 if (!equal)
3295 isl_die(ctx, isl_error_unknown, "bad conversion", return -1);
3296
3297 return 0;
3298 }
3299
3300 static int test_conversion(isl_ctx *ctx)
3301 {
3302 if (test_set_conversion(ctx) < 0)
3303 return -1;
3304 if (test_map_conversion(ctx) < 0)
3305 return -1;
3306 return 0;
3307 }
3308
3309 struct {
3310 const char *set;
3311 const char *ma;
3312 const char *res;
3313 } preimage_tests[] = {
3314 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
3315 "{ A[j,i] -> B[i,j] }",
3316 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
3317 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3318 "{ A[a,b] -> B[a/2,b/6] }",
3319 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
3320 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
3321 "{ A[a,b] -> B[a/2,b/6] }",
3322 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
3323 "exists i,j : a = 2 i and b = 6 j }" },
3324 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
3325 "[n] -> { : 0 <= n <= 100 }" },
3326 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3327 "{ A[a] -> B[2a] }",
3328 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
3329 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
3330 "{ A[a] -> B[([a/2])] }",
3331 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
3332 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
3333 "{ A[a] -> B[a,a,a/3] }",
3334 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
3335 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
3336 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
3337 };
3338
3339 int test_preimage(isl_ctx *ctx)
3340 {
3341 int i;
3342 isl_basic_set *bset1, *bset2;
3343 isl_multi_aff *ma;
3344 int equal;
3345
3346 for (i = 0; i < ARRAY_SIZE(preimage_tests); ++i) {
3347 bset1 = isl_basic_set_read_from_str(ctx, preimage_tests[i].set);
3348 ma = isl_multi_aff_read_from_str(ctx, preimage_tests[i].ma);
3349 bset2 = isl_basic_set_read_from_str(ctx, preimage_tests[i].res);
3350 bset1 = isl_basic_set_preimage_multi_aff(bset1, ma);
3351 equal = isl_basic_set_is_equal(bset1, bset2);
3352 isl_basic_set_free(bset1);
3353 isl_basic_set_free(bset2);
3354 if (equal < 0)
3355 return -1;
3356 if (!equal)
3357 isl_die(ctx, isl_error_unknown, "bad preimage",
3358 return -1);
3359 }
3360
3361 return 0;
3362 }
3363
3364 struct {
3365 const char *ma1;
3366 const char *ma;
3367 const char *res;
3368 } pullback_tests[] = {
3369 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
3370 "{ A[a,b] -> C[b + 2a] }" },
3371 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
3372 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
3373 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
3374 "{ A[a] -> C[(a)/6] }" },
3375 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
3376 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
3377 "{ A[a] -> C[(2a)/3] }" },
3378 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
3379 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
3380 "{ A[i,j] -> C[i + j, i + j] }"},
3381 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
3382 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
3383 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
3384 };
3385
3386 static int test_pullback(isl_ctx *ctx)
3387 {
3388 int i;
3389 isl_multi_aff *ma1, *ma2;
3390 isl_multi_aff *ma;
3391 int equal;
3392
3393 for (i = 0; i < ARRAY_SIZE(pullback_tests); ++i) {
3394 ma1 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma1);
3395 ma = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma);
3396 ma2 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].res);
3397 ma1 = isl_multi_aff_pullback_multi_aff(ma1, ma);
3398 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
3399 isl_multi_aff_free(ma1);
3400 isl_multi_aff_free(ma2);
3401 if (equal < 0)
3402 return -1;
3403 if (!equal)
3404 isl_die(ctx, isl_error_unknown, "bad pullback",
3405 return -1);
3406 }
3407
3408 return 0;
3409 }
3410
3411 /* Check that negation is printed correctly.
3412 */
3413 static int test_ast(isl_ctx *ctx)
3414 {
3415 isl_ast_expr *expr, *expr1, *expr2, *expr3;
3416 char *str;
3417 int ok;
3418
3419 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL));
3420 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL));
3421 expr = isl_ast_expr_add(expr1, expr2);
3422 expr = isl_ast_expr_neg(expr);
3423 str = isl_ast_expr_to_str(expr);
3424 ok = str ? !strcmp(str, "-(A + B)") : -1;
3425 free(str);
3426 isl_ast_expr_free(expr);
3427
3428 if (ok < 0)
3429 return -1;
3430 if (!ok)
3431 isl_die(ctx, isl_error_unknown,
3432 "isl_ast_expr printed incorrectly", return -1);
3433
3434 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL));
3435 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL));
3436 expr = isl_ast_expr_add(expr1, expr2);
3437 expr3 = isl_ast_expr_from_id(isl_id_alloc(ctx, "C", NULL));
3438 expr = isl_ast_expr_sub(expr3, expr);
3439 str = isl_ast_expr_to_str(expr);
3440 ok = str ? !strcmp(str, "C - (A + B)") : -1;
3441 free(str);
3442 isl_ast_expr_free(expr);
3443
3444 if (ok < 0)
3445 return -1;
3446 if (!ok)
3447 isl_die(ctx, isl_error_unknown,
3448 "isl_ast_expr printed incorrectly", return -1);
3449
3450 return 0;
3451 }
3452
3453 /* Internal data structure for before_for and after_for callbacks.
3454 *
3455 * depth is the current depth
3456 * before is the number of times before_for has been called
3457 * after is the number of times after_for has been called
3458 */
3459 struct isl_test_codegen_data {
3460 int depth;
3461 int before;
3462 int after;
3463 };
3464
3465 /* This function is called before each for loop in the AST generated
3466 * from test_ast_gen1.
3467 *
3468 * Increment the number of calls and the depth.
3469 * Check that the space returned by isl_ast_build_get_schedule_space
3470 * matches the target space of the schedule returned by
3471 * isl_ast_build_get_schedule.
3472 * Return an isl_id that is checked by the corresponding call
3473 * to after_for.
3474 */
3475 static __isl_give isl_id *before_for(__isl_keep isl_ast_build *build,
3476 void *user)
3477 {
3478 struct isl_test_codegen_data *data = user;
3479 isl_ctx *ctx;
3480 isl_space *space;
3481 isl_union_map *schedule;
3482 isl_union_set *uset;
3483 isl_set *set;
3484 int empty;
3485 char name[] = "d0";
3486
3487 ctx = isl_ast_build_get_ctx(build);
3488
3489 if (data->before >= 3)
3490 isl_die(ctx, isl_error_unknown,
3491 "unexpected number of for nodes", return NULL);
3492 if (data->depth >= 2)
3493 isl_die(ctx, isl_error_unknown,
3494 "unexpected depth", return NULL);
3495
3496 snprintf(name, sizeof(name), "d%d", data->depth);
3497 data->before++;
3498 data->depth++;
3499
3500 schedule = isl_ast_build_get_schedule(build);
3501 uset = isl_union_map_range(schedule);
3502 if (!uset)
3503 return NULL;
3504 if (isl_union_set_n_set(uset) != 1) {
3505 isl_union_set_free(uset);
3506 isl_die(ctx, isl_error_unknown,
3507 "expecting single range space", return NULL);
3508 }
3509
3510 space = isl_ast_build_get_schedule_space(build);
3511 set = isl_union_set_extract_set(uset, space);
3512 isl_union_set_free(uset);
3513 empty = isl_set_is_empty(set);
3514 isl_set_free(set);
3515
3516 if (empty < 0)
3517 return NULL;
3518 if (empty)
3519 isl_die(ctx, isl_error_unknown,
3520 "spaces don't match", return NULL);
3521
3522 return isl_id_alloc(ctx, name, NULL);
3523 }
3524
3525 /* This function is called after each for loop in the AST generated
3526 * from test_ast_gen1.
3527 *
3528 * Increment the number of calls and decrement the depth.
3529 * Check that the annotation attached to the node matches
3530 * the isl_id returned by the corresponding call to before_for.
3531 */
3532 static __isl_give isl_ast_node *after_for(__isl_take isl_ast_node *node,
3533 __isl_keep isl_ast_build *build, void *user)
3534 {
3535 struct isl_test_codegen_data *data = user;
3536 isl_id *id;
3537 const char *name;
3538 int valid;
3539
3540 data->after++;
3541 data->depth--;
3542
3543 if (data->after > data->before)
3544 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
3545 "mismatch in number of for nodes",
3546 return isl_ast_node_free(node));
3547
3548 id = isl_ast_node_get_annotation(node);
3549 if (!id)
3550 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
3551 "missing annotation", return isl_ast_node_free(node));
3552
3553 name = isl_id_get_name(id);
3554 valid = name && atoi(name + 1) == data->depth;
3555 isl_id_free(id);
3556
3557 if (!valid)
3558 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,
3559 "wrong annotation", return isl_ast_node_free(node));
3560
3561 return node;
3562 }
3563
3564 /* Check that the before_each_for and after_each_for callbacks
3565 * are called for each for loop in the generated code,
3566 * that they are called in the right order and that the isl_id
3567 * returned from the before_each_for callback is attached to
3568 * the isl_ast_node passed to the corresponding after_each_for call.
3569 */
3570 static int test_ast_gen1(isl_ctx *ctx)
3571 {
3572 const char *str;
3573 isl_set *set;
3574 isl_union_map *schedule;
3575 isl_ast_build *build;
3576 isl_ast_node *tree;
3577 struct isl_test_codegen_data data;
3578
3579 str = "[N] -> { : N >= 10 }";
3580 set = isl_set_read_from_str(ctx, str);
3581 str = "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
3582 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
3583 schedule = isl_union_map_read_from_str(ctx, str);
3584
3585 data.before = 0;
3586 data.after = 0;
3587 data.depth = 0;
3588 build = isl_ast_build_from_context(set);
3589 build = isl_ast_build_set_before_each_for(build,
3590 &before_for, &data);
3591 build = isl_ast_build_set_after_each_for(build,
3592 &after_for, &data);
3593 tree = isl_ast_build_ast_from_schedule(build, schedule);
3594 isl_ast_build_free(build);
3595 if (!tree)
3596 return -1;
3597
3598 isl_ast_node_free(tree);
3599
3600 if (data.before != 3 || data.after != 3)
3601 isl_die(ctx, isl_error_unknown,
3602 "unexpected number of for nodes", return -1);
3603
3604 return 0;
3605 }
3606
3607 /* Check that the AST generator handles domains that are integrally disjoint
3608 * but not ratinoally disjoint.
3609 */
3610 static int test_ast_gen2(isl_ctx *ctx)
3611 {
3612 const char *str;
3613 isl_set *set;
3614 isl_union_map *schedule;
3615 isl_union_map *options;
3616 isl_ast_build *build;
3617 isl_ast_node *tree;
3618
3619 str = "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
3620 schedule = isl_union_map_read_from_str(ctx, str);
3621 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
3622 build = isl_ast_build_from_context(set);
3623
3624 str = "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
3625 options = isl_union_map_read_from_str(ctx, str);
3626 build = isl_ast_build_set_options(build, options);
3627 tree = isl_ast_build_ast_from_schedule(build, schedule);
3628 isl_ast_build_free(build);
3629 if (!tree)
3630 return -1;
3631 isl_ast_node_free(tree);
3632
3633 return 0;
3634 }
3635
3636 /* Increment *user on each call.
3637 */
3638 static __isl_give isl_ast_node *count_domains(__isl_take isl_ast_node *node,
3639 __isl_keep isl_ast_build *build, void *user)
3640 {
3641 int *n = user;
3642
3643 (*n)++;
3644
3645 return node;
3646 }
3647
3648 /* Test that unrolling tries to minimize the number of instances.
3649 * In particular, for the schedule given below, make sure it generates
3650 * 3 nodes (rather than 101).
3651 */
3652 static int test_ast_gen3(isl_ctx *ctx)
3653 {
3654 const char *str;
3655 isl_set *set;
3656 isl_union_map *schedule;
3657 isl_union_map *options;
3658 isl_ast_build *build;
3659 isl_ast_node *tree;
3660 int n_domain = 0;
3661
3662 str = "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
3663 schedule = isl_union_map_read_from_str(ctx, str);
3664 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
3665
3666 str = "{ [i] -> unroll[0] }";
3667 options = isl_union_map_read_from_str(ctx, str);
3668
3669 build = isl_ast_build_from_context(set);
3670 build = isl_ast_build_set_options(build, options);
3671 build = isl_ast_build_set_at_each_domain(build,
3672 &count_domains, &n_domain);
3673 tree = isl_ast_build_ast_from_schedule(build, schedule);
3674 isl_ast_build_free(build);
3675 if (!tree)
3676 return -1;
3677
3678 isl_ast_node_free(tree);
3679
3680 if (n_domain != 3)
3681 isl_die(ctx, isl_error_unknown,
3682 "unexpected number of for nodes", return -1);
3683
3684 return 0;
3685 }
3686
3687 /* Check that if the ast_build_exploit_nested_bounds options is set,
3688 * we do not get an outer if node in the generated AST,
3689 * while we do get such an outer if node if the options is not set.
3690 */
3691 static int test_ast_gen4(isl_ctx *ctx)
3692 {
3693 const char *str;
3694 isl_set *set;
3695 isl_union_map *schedule;
3696 isl_ast_build *build;
3697 isl_ast_node *tree;
3698 enum isl_ast_node_type type;
3699 int enb;
3700
3701 enb = isl_options_get_ast_build_exploit_nested_bounds(ctx);
3702 str = "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
3703
3704 isl_options_set_ast_build_exploit_nested_bounds(ctx, 1);
3705
3706 schedule = isl_union_map_read_from_str(ctx, str);
3707 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
3708 build = isl_ast_build_from_context(set);
3709 tree = isl_ast_build_ast_from_schedule(build, schedule);
3710 isl_ast_build_free(build);
3711 if (!tree)
3712 return -1;
3713
3714 type = isl_ast_node_get_type(tree);
3715 isl_ast_node_free(tree);
3716
3717 if (type == isl_ast_node_if)
3718 isl_die(ctx, isl_error_unknown,
3719 "not expecting if node", return -1);
3720
3721 isl_options_set_ast_build_exploit_nested_bounds(ctx, 0);
3722
3723 schedule = isl_union_map_read_from_str(ctx, str);
3724 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
3725 build = isl_ast_build_from_context(set);
3726 tree = isl_ast_build_ast_from_schedule(build, schedule);
3727 isl_ast_build_free(build);
3728 if (!tree)
3729 return -1;
3730
3731 type = isl_ast_node_get_type(tree);
3732 isl_ast_node_free(tree);
3733
3734 if (type != isl_ast_node_if)
3735 isl_die(ctx, isl_error_unknown,
3736 "expecting if node", return -1);
3737
3738 isl_options_set_ast_build_exploit_nested_bounds(ctx, enb);
3739
3740 return 0;
3741 }
3742
3743 static int test_ast_gen(isl_ctx *ctx)
3744 {
3745 if (test_ast_gen1(ctx) < 0)
3746 return -1;
3747 if (test_ast_gen2(ctx) < 0)
3748 return -1;
3749 if (test_ast_gen3(ctx) < 0)
3750 return -1;
3751 if (test_ast_gen4(ctx) < 0)
3752 return -1;
3753 return 0;
3754 }
3755
3756 /* Check if dropping output dimensions from an isl_pw_multi_aff
3757 * works properly.
3758 */
3759 static int test_pw_multi_aff(isl_ctx *ctx)
3760 {
3761 const char *str;
3762 isl_pw_multi_aff *pma1, *pma2;
3763 int equal;
3764
3765 str = "{ [i,j] -> [i+j, 4i-j] }";
3766 pma1 = isl_pw_multi_aff_read_from_str(ctx, str);
3767 str = "{ [i,j] -> [4i-j] }";
3768 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
3769
3770 pma1 = isl_pw_multi_aff_drop_dims(pma1, isl_dim_out, 0, 1);
3771
3772 equal = isl_pw_multi_aff_plain_is_equal(pma1, pma2);
3773
3774 isl_pw_multi_aff_free(pma1);
3775 isl_pw_multi_aff_free(pma2);
3776 if (equal < 0)
3777 return -1;
3778 if (!equal)
3779 isl_die(ctx, isl_error_unknown,
3780 "expressions not equal", return -1);
3781
3782 return 0;
3783 }
3784
3785 struct {
3786 const char *name;
3787 int (*fn)(isl_ctx *ctx);
3788 } tests [] = {
3789 { "piecewise multi affine expressions", &test_pw_multi_aff },
3790 { "conversion", &test_conversion },
3791 { "list", &test_list },
3792 { "align parameters", &test_align_parameters },
3793 { "preimage", &test_preimage },
3794 { "pullback", &test_pullback },
3795 { "AST", &test_ast },
3796 { "AST generation", &test_ast_gen },
3797 { "eliminate", &test_eliminate },
3798 { "residue class", &test_residue_class },
3799 { "div", &test_div },
3800 { "slice", &test_slice },
3801 { "fixed power", &test_fixed_power },
3802 { "sample", &test_sample },
3803 { "output", &test_output },
3804 { "vertices", &test_vertices },
3805 { "fixed", &test_fixed },
3806 { "equal", &test_equal },
3807 { "product", &test_product },
3808 { "dim_max", &test_dim_max },
3809 { "affine", &test_aff },
3810 { "injective", &test_injective },
3811 { "schedule", &test_schedule },
3812 { "union_pw", &test_union_pw },
3813 { "parse", &test_parse },
3814 { "single-valued", &test_sv },
3815 { "affine hull", &test_affine_hull },
3816 { "coalesce", &test_coalesce },
3817 { "factorize", &test_factorize },
3818 { "subset", &test_subset },
3819 { "subtract", &test_subtract },
3820 };
3821
3822 int main()
3823 {
3824 int i;
3825 struct isl_ctx *ctx;
3826
3827 srcdir = getenv("srcdir");
3828 assert(srcdir);
3829
3830 ctx = isl_ctx_alloc();
3831 for (i = 0; i < ARRAY_SIZE(tests); ++i) {
3832 printf("%s\n", tests[i].name);
3833 if (tests[i].fn(ctx) < 0)
3834 goto error;
3835 }
3836 test_lift(ctx);
3837 test_bound(ctx);
3838 test_union(ctx);
3839 test_split_periods(ctx);
3840 test_pwqp(ctx);
3841 test_lex(ctx);
3842 test_bijective(ctx);
3843 test_dep(ctx);
3844 test_read(ctx);
3845 test_bounded(ctx);
3846 test_construction(ctx);
3847 test_dim(ctx);
3848 test_application(ctx);
3849 test_convex_hull(ctx);
3850 test_gist(ctx);
3851 test_closure(ctx);
3852 test_lexmin(ctx);
3853 isl_ctx_free(ctx);
3854 return 0;
3855 error:
3856 isl_ctx_free(ctx);
3857 return -1;
3858 }
Integer set library