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