?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
add isl_set_upper_bound_si
[isl.git] / isl_test.c
blobeb8b15114182da4b860c55d6dca3c6b10878d451
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 *
4 * Use of this software is governed by the GNU LGPLv2.1 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.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
24 static char *srcdir;
25
26 static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) {
27 char *filename;
28 int length;
29 char *pattern = "%s/test_inputs/%s.%s";
30
31 length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name)
32 + strlen(suffix) + 1;
33 filename = isl_alloc_array(ctx, char, length);
34
35 if (!filename)
36 return NULL;
37
38 sprintf(filename, pattern, srcdir, name, suffix);
39
40 return filename;
41 }
42
43 void test_parse_map(isl_ctx *ctx, const char *str)
44 {
45 isl_map *map;
46
47 map = isl_map_read_from_str(ctx, str);
48 assert(map);
49 isl_map_free(map);
50 }
51
52 void test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2)
53 {
54 isl_map *map, *map2;
55
56 map = isl_map_read_from_str(ctx, str);
57 map2 = isl_map_read_from_str(ctx, str2);
58 assert(map && map2 && isl_map_is_equal(map, map2));
59 isl_map_free(map);
60 isl_map_free(map2);
61 }
62
63 void test_parse_pwqp(isl_ctx *ctx, const char *str)
64 {
65 isl_pw_qpolynomial *pwqp;
66
67 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
68 assert(pwqp);
69 isl_pw_qpolynomial_free(pwqp);
70 }
71
72 static void test_parse_pwaff(isl_ctx *ctx, const char *str)
73 {
74 isl_pw_aff *pwaff;
75
76 pwaff = isl_pw_aff_read_from_str(ctx, str);
77 assert(pwaff);
78 isl_pw_aff_free(pwaff);
79 }
80
81 void test_parse(struct isl_ctx *ctx)
82 {
83 isl_map *map, *map2;
84 const char *str, *str2;
85
86 str = "{ [i] -> [-i] }";
87 map = isl_map_read_from_str(ctx, str);
88 assert(map);
89 isl_map_free(map);
90
91 str = "{ A[i] -> L[([i/3])] }";
92 map = isl_map_read_from_str(ctx, str);
93 assert(map);
94 isl_map_free(map);
95
96 test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
97 test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : "
98 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
99
100 str = "{ [x,y] : [([x/2]+y)/3] >= 1 }";
101 str2 = "{ [x, y] : 2y >= 6 - x }";
102 test_parse_map_equal(ctx, str, str2);
103
104 test_parse_map_equal(ctx, "{ [x,y] : x <= min(y, 2*y+3) }",
105 "{ [x,y] : x <= y, 2*y + 3 }");
106 str = "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }";
107 test_parse_map_equal(ctx, "{ [x,y] : x >= min(y, 2*y+3) }", str);
108
109 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
110 map = isl_map_read_from_str(ctx, str);
111 str = "{ [new, old] -> [o0, o1] : "
112 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
113 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
114 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
115 map2 = isl_map_read_from_str(ctx, str);
116 assert(isl_map_is_equal(map, map2));
117 isl_map_free(map);
118 isl_map_free(map2);
119
120 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
121 map = isl_map_read_from_str(ctx, str);
122 str = "{[new,old] -> [(new+1)%2,(old+1)%2]}";
123 map2 = isl_map_read_from_str(ctx, str);
124 assert(isl_map_is_equal(map, map2));
125 isl_map_free(map);
126 isl_map_free(map2);
127
128 str = "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }";
129 str2 = "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }";
130 test_parse_map_equal(ctx, str, str2);
131
132 str = "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }";
133 str2 = "{ [i,j] -> [min(i,j)] }";
134 test_parse_map_equal(ctx, str, str2);
135
136 str = "{ [i,j] : i != j }";
137 str2 = "{ [i,j] : i < j or i > j }";
138 test_parse_map_equal(ctx, str, str2);
139
140 str = "{ [i,j] : (i+1)*2 >= j }";
141 str2 = "{ [i, j] : j <= 2 + 2i }";
142 test_parse_map_equal(ctx, str, str2);
143
144 str = "{ [i] -> [i > 0 ? 4 : 5] }";
145 str2 = "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }";
146 test_parse_map_equal(ctx, str, str2);
147
148 str = "[N=2,M] -> { [i=[(M+N)/4]] }";
149 str2 = "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }";
150 test_parse_map_equal(ctx, str, str2);
151
152 str = "{ [x] : x >= 0 }";
153 str2 = "{ [x] : x-0 >= 0 }";
154 test_parse_map_equal(ctx, str, str2);
155
156 str = "{ [i] : ((i > 10)) }";
157 str2 = "{ [i] : i >= 11 }";
158 test_parse_map_equal(ctx, str, str2);
159
160 test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }");
161 test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
162 test_parse_pwaff(ctx, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
163 }
164
165 void test_read(struct isl_ctx *ctx)
166 {
167 char *filename;
168 FILE *input;
169 struct isl_basic_set *bset1, *bset2;
170 const char *str = "{[y]: Exists ( alpha : 2alpha = y)}";
171
172 filename = get_filename(ctx, "set", "omega");
173 assert(filename);
174 input = fopen(filename, "r");
175 assert(input);
176
177 bset1 = isl_basic_set_read_from_file(ctx, input);
178 bset2 = isl_basic_set_read_from_str(ctx, str);
179
180 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
181
182 isl_basic_set_free(bset1);
183 isl_basic_set_free(bset2);
184 free(filename);
185
186 fclose(input);
187 }
188
189 void test_bounded(struct isl_ctx *ctx)
190 {
191 isl_set *set;
192 int bounded;
193
194 set = isl_set_read_from_str(ctx, "[n] -> {[i] : 0 <= i <= n }");
195 bounded = isl_set_is_bounded(set);
196 assert(bounded);
197 isl_set_free(set);
198
199 set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }");
200 bounded = isl_set_is_bounded(set);
201 assert(!bounded);
202 isl_set_free(set);
203
204 set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }");
205 bounded = isl_set_is_bounded(set);
206 assert(!bounded);
207 isl_set_free(set);
208 }
209
210 /* Construct the basic set { [i] : 5 <= i <= N } */
211 void test_construction(struct isl_ctx *ctx)
212 {
213 isl_int v;
214 isl_space *dim;
215 isl_local_space *ls;
216 struct isl_basic_set *bset;
217 struct isl_constraint *c;
218
219 isl_int_init(v);
220
221 dim = isl_space_set_alloc(ctx, 1, 1);
222 bset = isl_basic_set_universe(isl_space_copy(dim));
223 ls = isl_local_space_from_space(dim);
224
225 c = isl_inequality_alloc(isl_local_space_copy(ls));
226 isl_int_set_si(v, -1);
227 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
228 isl_int_set_si(v, 1);
229 isl_constraint_set_coefficient(c, isl_dim_param, 0, v);
230 bset = isl_basic_set_add_constraint(bset, c);
231
232 c = isl_inequality_alloc(isl_local_space_copy(ls));
233 isl_int_set_si(v, 1);
234 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
235 isl_int_set_si(v, -5);
236 isl_constraint_set_constant(c, v);
237 bset = isl_basic_set_add_constraint(bset, c);
238
239 isl_local_space_free(ls);
240 isl_basic_set_free(bset);
241
242 isl_int_clear(v);
243 }
244
245 void test_dim(struct isl_ctx *ctx)
246 {
247 const char *str;
248 isl_map *map1, *map2;
249
250 map1 = isl_map_read_from_str(ctx,
251 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
252 map1 = isl_map_add_dims(map1, isl_dim_in, 1);
253 map2 = isl_map_read_from_str(ctx,
254 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
255 assert(isl_map_is_equal(map1, map2));
256 isl_map_free(map2);
257
258 map1 = isl_map_project_out(map1, isl_dim_in, 0, 1);
259 map2 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : n >= 0 }");
260 assert(isl_map_is_equal(map1, map2));
261
262 isl_map_free(map1);
263 isl_map_free(map2);
264
265 str = "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
266 map1 = isl_map_read_from_str(ctx, str);
267 str = "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
268 map2 = isl_map_read_from_str(ctx, str);
269 map1 = isl_map_move_dims(map1, isl_dim_out, 0, isl_dim_param, 0, 1);
270 assert(isl_map_is_equal(map1, map2));
271
272 isl_map_free(map1);
273 isl_map_free(map2);
274 }
275
276 void test_div(struct isl_ctx *ctx)
277 {
278 isl_int v;
279 isl_space *dim;
280 isl_local_space *ls;
281 struct isl_basic_set *bset;
282 struct isl_constraint *c;
283
284 isl_int_init(v);
285
286 /* test 1 */
287 dim = isl_space_set_alloc(ctx, 0, 3);
288 bset = isl_basic_set_universe(isl_space_copy(dim));
289 ls = isl_local_space_from_space(dim);
290
291 c = isl_equality_alloc(isl_local_space_copy(ls));
292 isl_int_set_si(v, -1);
293 isl_constraint_set_constant(c, v);
294 isl_int_set_si(v, 1);
295 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
296 isl_int_set_si(v, 3);
297 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
298 bset = isl_basic_set_add_constraint(bset, c);
299
300 c = isl_equality_alloc(isl_local_space_copy(ls));
301 isl_int_set_si(v, 1);
302 isl_constraint_set_constant(c, v);
303 isl_int_set_si(v, -1);
304 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
305 isl_int_set_si(v, 3);
306 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
307 bset = isl_basic_set_add_constraint(bset, c);
308
309 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
310
311 assert(bset && bset->n_div == 1);
312 isl_local_space_free(ls);
313 isl_basic_set_free(bset);
314
315 /* test 2 */
316 dim = isl_space_set_alloc(ctx, 0, 3);
317 bset = isl_basic_set_universe(isl_space_copy(dim));
318 ls = isl_local_space_from_space(dim);
319
320 c = isl_equality_alloc(isl_local_space_copy(ls));
321 isl_int_set_si(v, 1);
322 isl_constraint_set_constant(c, v);
323 isl_int_set_si(v, -1);
324 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
325 isl_int_set_si(v, 3);
326 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
327 bset = isl_basic_set_add_constraint(bset, c);
328
329 c = isl_equality_alloc(isl_local_space_copy(ls));
330 isl_int_set_si(v, -1);
331 isl_constraint_set_constant(c, v);
332 isl_int_set_si(v, 1);
333 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
334 isl_int_set_si(v, 3);
335 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
336 bset = isl_basic_set_add_constraint(bset, c);
337
338 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
339
340 assert(bset && bset->n_div == 1);
341 isl_local_space_free(ls);
342 isl_basic_set_free(bset);
343
344 /* test 3 */
345 dim = isl_space_set_alloc(ctx, 0, 3);
346 bset = isl_basic_set_universe(isl_space_copy(dim));
347 ls = isl_local_space_from_space(dim);
348
349 c = isl_equality_alloc(isl_local_space_copy(ls));
350 isl_int_set_si(v, 1);
351 isl_constraint_set_constant(c, v);
352 isl_int_set_si(v, -1);
353 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
354 isl_int_set_si(v, 3);
355 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
356 bset = isl_basic_set_add_constraint(bset, c);
357
358 c = isl_equality_alloc(isl_local_space_copy(ls));
359 isl_int_set_si(v, -3);
360 isl_constraint_set_constant(c, v);
361 isl_int_set_si(v, 1);
362 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
363 isl_int_set_si(v, 4);
364 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
365 bset = isl_basic_set_add_constraint(bset, c);
366
367 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
368
369 assert(bset && bset->n_div == 1);
370 isl_local_space_free(ls);
371 isl_basic_set_free(bset);
372
373 /* test 4 */
374 dim = isl_space_set_alloc(ctx, 0, 3);
375 bset = isl_basic_set_universe(isl_space_copy(dim));
376 ls = isl_local_space_from_space(dim);
377
378 c = isl_equality_alloc(isl_local_space_copy(ls));
379 isl_int_set_si(v, 2);
380 isl_constraint_set_constant(c, v);
381 isl_int_set_si(v, -1);
382 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
383 isl_int_set_si(v, 3);
384 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
385 bset = isl_basic_set_add_constraint(bset, c);
386
387 c = isl_equality_alloc(isl_local_space_copy(ls));
388 isl_int_set_si(v, -1);
389 isl_constraint_set_constant(c, v);
390 isl_int_set_si(v, 1);
391 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
392 isl_int_set_si(v, 6);
393 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
394 bset = isl_basic_set_add_constraint(bset, c);
395
396 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
397
398 assert(isl_basic_set_is_empty(bset));
399 isl_local_space_free(ls);
400 isl_basic_set_free(bset);
401
402 /* test 5 */
403 dim = isl_space_set_alloc(ctx, 0, 3);
404 bset = isl_basic_set_universe(isl_space_copy(dim));
405 ls = isl_local_space_from_space(dim);
406
407 c = isl_equality_alloc(isl_local_space_copy(ls));
408 isl_int_set_si(v, -1);
409 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
410 isl_int_set_si(v, 3);
411 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
412 bset = isl_basic_set_add_constraint(bset, c);
413
414 c = isl_equality_alloc(isl_local_space_copy(ls));
415 isl_int_set_si(v, 1);
416 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
417 isl_int_set_si(v, -3);
418 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
419 bset = isl_basic_set_add_constraint(bset, c);
420
421 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
422
423 assert(bset && bset->n_div == 0);
424 isl_basic_set_free(bset);
425 isl_local_space_free(ls);
426
427 /* test 6 */
428 dim = isl_space_set_alloc(ctx, 0, 3);
429 bset = isl_basic_set_universe(isl_space_copy(dim));
430 ls = isl_local_space_from_space(dim);
431
432 c = isl_equality_alloc(isl_local_space_copy(ls));
433 isl_int_set_si(v, -1);
434 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
435 isl_int_set_si(v, 6);
436 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
437 bset = isl_basic_set_add_constraint(bset, c);
438
439 c = isl_equality_alloc(isl_local_space_copy(ls));
440 isl_int_set_si(v, 1);
441 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
442 isl_int_set_si(v, -3);
443 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
444 bset = isl_basic_set_add_constraint(bset, c);
445
446 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
447
448 assert(bset && bset->n_div == 1);
449 isl_basic_set_free(bset);
450 isl_local_space_free(ls);
451
452 /* test 7 */
453 /* This test is a bit tricky. We set up an equality
454 * a + 3b + 3c = 6 e0
455 * Normalization of divs creates _two_ divs
456 * a = 3 e0
457 * c - b - e0 = 2 e1
458 * Afterwards e0 is removed again because it has coefficient -1
459 * and we end up with the original equality and div again.
460 * Perhaps we can avoid the introduction of this temporary div.
461 */
462 dim = isl_space_set_alloc(ctx, 0, 4);
463 bset = isl_basic_set_universe(isl_space_copy(dim));
464 ls = isl_local_space_from_space(dim);
465
466 c = isl_equality_alloc(isl_local_space_copy(ls));
467 isl_int_set_si(v, -1);
468 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
469 isl_int_set_si(v, -3);
470 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
471 isl_int_set_si(v, -3);
472 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
473 isl_int_set_si(v, 6);
474 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
475 bset = isl_basic_set_add_constraint(bset, c);
476
477 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
478
479 /* Test disabled for now */
480 /*
481 assert(bset && bset->n_div == 1);
482 */
483 isl_local_space_free(ls);
484 isl_basic_set_free(bset);
485
486 /* test 8 */
487 dim = isl_space_set_alloc(ctx, 0, 5);
488 bset = isl_basic_set_universe(isl_space_copy(dim));
489 ls = isl_local_space_from_space(dim);
490
491 c = isl_equality_alloc(isl_local_space_copy(ls));
492 isl_int_set_si(v, -1);
493 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
494 isl_int_set_si(v, -3);
495 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
496 isl_int_set_si(v, -3);
497 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
498 isl_int_set_si(v, 6);
499 isl_constraint_set_coefficient(c, isl_dim_set, 4, v);
500 bset = isl_basic_set_add_constraint(bset, c);
501
502 c = isl_equality_alloc(isl_local_space_copy(ls));
503 isl_int_set_si(v, -1);
504 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
505 isl_int_set_si(v, 1);
506 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
507 isl_int_set_si(v, 1);
508 isl_constraint_set_constant(c, v);
509 bset = isl_basic_set_add_constraint(bset, c);
510
511 bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1);
512
513 /* Test disabled for now */
514 /*
515 assert(bset && bset->n_div == 1);
516 */
517 isl_local_space_free(ls);
518 isl_basic_set_free(bset);
519
520 /* test 9 */
521 dim = isl_space_set_alloc(ctx, 0, 4);
522 bset = isl_basic_set_universe(isl_space_copy(dim));
523 ls = isl_local_space_from_space(dim);
524
525 c = isl_equality_alloc(isl_local_space_copy(ls));
526 isl_int_set_si(v, 1);
527 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
528 isl_int_set_si(v, -1);
529 isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
530 isl_int_set_si(v, -2);
531 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
532 bset = isl_basic_set_add_constraint(bset, c);
533
534 c = isl_equality_alloc(isl_local_space_copy(ls));
535 isl_int_set_si(v, -1);
536 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
537 isl_int_set_si(v, 3);
538 isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
539 isl_int_set_si(v, 2);
540 isl_constraint_set_constant(c, v);
541 bset = isl_basic_set_add_constraint(bset, c);
542
543 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2);
544
545 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
546
547 assert(!isl_basic_set_is_empty(bset));
548
549 isl_local_space_free(ls);
550 isl_basic_set_free(bset);
551
552 /* test 10 */
553 dim = isl_space_set_alloc(ctx, 0, 3);
554 bset = isl_basic_set_universe(isl_space_copy(dim));
555 ls = isl_local_space_from_space(dim);
556
557 c = isl_equality_alloc(isl_local_space_copy(ls));
558 isl_int_set_si(v, 1);
559 isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
560 isl_int_set_si(v, -2);
561 isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
562 bset = isl_basic_set_add_constraint(bset, c);
563
564 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
565
566 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
567
568 isl_local_space_free(ls);
569 isl_basic_set_free(bset);
570
571 isl_int_clear(v);
572 }
573
574 void test_application_case(struct isl_ctx *ctx, const char *name)
575 {
576 char *filename;
577 FILE *input;
578 struct isl_basic_set *bset1, *bset2;
579 struct isl_basic_map *bmap;
580
581 filename = get_filename(ctx, name, "omega");
582 assert(filename);
583 input = fopen(filename, "r");
584 assert(input);
585
586 bset1 = isl_basic_set_read_from_file(ctx, input);
587 bmap = isl_basic_map_read_from_file(ctx, input);
588
589 bset1 = isl_basic_set_apply(bset1, bmap);
590
591 bset2 = isl_basic_set_read_from_file(ctx, input);
592
593 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
594
595 isl_basic_set_free(bset1);
596 isl_basic_set_free(bset2);
597 free(filename);
598
599 fclose(input);
600 }
601
602 void test_application(struct isl_ctx *ctx)
603 {
604 test_application_case(ctx, "application");
605 test_application_case(ctx, "application2");
606 }
607
608 void test_affine_hull_case(struct isl_ctx *ctx, const char *name)
609 {
610 char *filename;
611 FILE *input;
612 struct isl_basic_set *bset1, *bset2;
613
614 filename = get_filename(ctx, name, "polylib");
615 assert(filename);
616 input = fopen(filename, "r");
617 assert(input);
618
619 bset1 = isl_basic_set_read_from_file(ctx, input);
620 bset2 = isl_basic_set_read_from_file(ctx, input);
621
622 bset1 = isl_basic_set_affine_hull(bset1);
623
624 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
625
626 isl_basic_set_free(bset1);
627 isl_basic_set_free(bset2);
628 free(filename);
629
630 fclose(input);
631 }
632
633 void test_affine_hull(struct isl_ctx *ctx)
634 {
635 test_affine_hull_case(ctx, "affine2");
636 test_affine_hull_case(ctx, "affine");
637 test_affine_hull_case(ctx, "affine3");
638 }
639
640 void test_convex_hull_case(struct isl_ctx *ctx, const char *name)
641 {
642 char *filename;
643 FILE *input;
644 struct isl_basic_set *bset1, *bset2;
645 struct isl_set *set;
646
647 filename = get_filename(ctx, name, "polylib");
648 assert(filename);
649 input = fopen(filename, "r");
650 assert(input);
651
652 bset1 = isl_basic_set_read_from_file(ctx, input);
653 bset2 = isl_basic_set_read_from_file(ctx, input);
654
655 set = isl_basic_set_union(bset1, bset2);
656 bset1 = isl_set_convex_hull(set);
657
658 bset2 = isl_basic_set_read_from_file(ctx, input);
659
660 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
661
662 isl_basic_set_free(bset1);
663 isl_basic_set_free(bset2);
664 free(filename);
665
666 fclose(input);
667 }
668
669 void test_convex_hull_algo(struct isl_ctx *ctx, int convex)
670 {
671 const char *str1, *str2;
672 isl_set *set1, *set2;
673 int orig_convex = ctx->opt->convex;
674 ctx->opt->convex = convex;
675
676 test_convex_hull_case(ctx, "convex0");
677 test_convex_hull_case(ctx, "convex1");
678 test_convex_hull_case(ctx, "convex2");
679 test_convex_hull_case(ctx, "convex3");
680 test_convex_hull_case(ctx, "convex4");
681 test_convex_hull_case(ctx, "convex5");
682 test_convex_hull_case(ctx, "convex6");
683 test_convex_hull_case(ctx, "convex7");
684 test_convex_hull_case(ctx, "convex8");
685 test_convex_hull_case(ctx, "convex9");
686 test_convex_hull_case(ctx, "convex10");
687 test_convex_hull_case(ctx, "convex11");
688 test_convex_hull_case(ctx, "convex12");
689 test_convex_hull_case(ctx, "convex13");
690 test_convex_hull_case(ctx, "convex14");
691 test_convex_hull_case(ctx, "convex15");
692
693 str1 = "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
694 "(i0 = 1 and i1 = 0 and i2 = 1) or "
695 "(i0 = 0 and i1 = 0 and i2 = 0) }";
696 str2 = "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }";
697 set1 = isl_set_read_from_str(ctx, str1);
698 set2 = isl_set_read_from_str(ctx, str2);
699 set1 = isl_set_from_basic_set(isl_set_convex_hull(set1));
700 assert(isl_set_is_equal(set1, set2));
701 isl_set_free(set1);
702 isl_set_free(set2);
703
704 ctx->opt->convex = orig_convex;
705 }
706
707 void test_convex_hull(struct isl_ctx *ctx)
708 {
709 test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM);
710 test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP);
711 }
712
713 void test_gist_case(struct isl_ctx *ctx, const char *name)
714 {
715 char *filename;
716 FILE *input;
717 struct isl_basic_set *bset1, *bset2;
718
719 filename = get_filename(ctx, name, "polylib");
720 assert(filename);
721 input = fopen(filename, "r");
722 assert(input);
723
724 bset1 = isl_basic_set_read_from_file(ctx, input);
725 bset2 = isl_basic_set_read_from_file(ctx, input);
726
727 bset1 = isl_basic_set_gist(bset1, bset2);
728
729 bset2 = isl_basic_set_read_from_file(ctx, input);
730
731 assert(isl_basic_set_is_equal(bset1, bset2) == 1);
732
733 isl_basic_set_free(bset1);
734 isl_basic_set_free(bset2);
735 free(filename);
736
737 fclose(input);
738 }
739
740 void test_gist(struct isl_ctx *ctx)
741 {
742 const char *str;
743 isl_basic_set *bset1, *bset2;
744
745 test_gist_case(ctx, "gist1");
746
747 str = "[p0, p2, p3, p5, p6, p10] -> { [] : "
748 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
749 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
750 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
751 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
752 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
753 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
754 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
755 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
756 bset1 = isl_basic_set_read_from_str(ctx, str);
757 str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
758 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
759 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
760 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
761 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
762 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
763 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
764 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
765 bset2 = isl_basic_set_read_from_str(ctx, str);
766 bset1 = isl_basic_set_gist(bset1, bset2);
767 assert(bset1 && bset1->n_div == 0);
768 isl_basic_set_free(bset1);
769 }
770
771 void test_coalesce_set(isl_ctx *ctx, const char *str, int check_one)
772 {
773 isl_set *set, *set2;
774
775 set = isl_set_read_from_str(ctx, str);
776 set = isl_set_coalesce(set);
777 set2 = isl_set_read_from_str(ctx, str);
778 assert(isl_set_is_equal(set, set2));
779 if (check_one)
780 assert(set && set->n == 1);
781 isl_set_free(set);
782 isl_set_free(set2);
783 }
784
785 void test_coalesce(struct isl_ctx *ctx)
786 {
787 const char *str;
788 struct isl_set *set, *set2;
789 struct isl_map *map, *map2;
790
791 set = isl_set_read_from_str(ctx,
792 "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
793 "y >= x & x >= 2 & 5 >= y }");
794 set = isl_set_coalesce(set);
795 assert(set && set->n == 1);
796 isl_set_free(set);
797
798 set = isl_set_read_from_str(ctx,
799 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
800 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}");
801 set = isl_set_coalesce(set);
802 assert(set && set->n == 1);
803 isl_set_free(set);
804
805 set = isl_set_read_from_str(ctx,
806 "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
807 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}");
808 set = isl_set_coalesce(set);
809 assert(set && set->n == 2);
810 isl_set_free(set);
811
812 set = isl_set_read_from_str(ctx,
813 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
814 "y >= 0 & x >= 6 & x <= 10 & y <= x}");
815 set = isl_set_coalesce(set);
816 assert(set && set->n == 1);
817 isl_set_free(set);
818
819 set = isl_set_read_from_str(ctx,
820 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
821 "y >= 0 & x >= 7 & x <= 10 & y <= x}");
822 set = isl_set_coalesce(set);
823 assert(set && set->n == 2);
824 isl_set_free(set);
825
826 set = isl_set_read_from_str(ctx,
827 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
828 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}");
829 set = isl_set_coalesce(set);
830 assert(set && set->n == 2);
831 isl_set_free(set);
832
833 set = isl_set_read_from_str(ctx,
834 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
835 "y >= 0 & x = 6 & y <= 6}");
836 set = isl_set_coalesce(set);
837 assert(set && set->n == 1);
838 isl_set_free(set);
839
840 set = isl_set_read_from_str(ctx,
841 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
842 "y >= 0 & x = 7 & y <= 6}");
843 set = isl_set_coalesce(set);
844 assert(set && set->n == 2);
845 isl_set_free(set);
846
847 set = isl_set_read_from_str(ctx,
848 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
849 "y >= 0 & x = 6 & y <= 5}");
850 set = isl_set_coalesce(set);
851 assert(set && set->n == 1);
852 set2 = isl_set_read_from_str(ctx,
853 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
854 "y >= 0 & x = 6 & y <= 5}");
855 assert(isl_set_is_equal(set, set2));
856 isl_set_free(set);
857 isl_set_free(set2);
858
859 set = isl_set_read_from_str(ctx,
860 "{[x,y]: y >= 0 & x <= 5 & y <= x or "
861 "y >= 0 & x = 6 & y <= 7}");
862 set = isl_set_coalesce(set);
863 assert(set && set->n == 2);
864 isl_set_free(set);
865
866 set = isl_set_read_from_str(ctx,
867 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
868 set = isl_set_coalesce(set);
869 assert(set && set->n == 1);
870 set2 = isl_set_read_from_str(ctx,
871 "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }");
872 assert(isl_set_is_equal(set, set2));
873 isl_set_free(set);
874 isl_set_free(set2);
875
876 set = isl_set_read_from_str(ctx,
877 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
878 set = isl_set_coalesce(set);
879 set2 = isl_set_read_from_str(ctx,
880 "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}");
881 assert(isl_set_is_equal(set, set2));
882 isl_set_free(set);
883 isl_set_free(set2);
884
885 set = isl_set_read_from_str(ctx,
886 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
887 "2 <= i and i <= n }");
888 set = isl_set_coalesce(set);
889 assert(set && set->n == 1);
890 set2 = isl_set_read_from_str(ctx,
891 "[n] -> { [i] : 1 <= i and i <= n - 1 or "
892 "2 <= i and i <= n }");
893 assert(isl_set_is_equal(set, set2));
894 isl_set_free(set);
895 isl_set_free(set2);
896
897 map = isl_map_read_from_str(ctx,
898 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
899 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
900 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
901 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
902 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
903 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
904 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
905 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
906 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
907 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
908 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
909 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
910 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
911 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
912 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
913 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
914 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
915 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
916 map = isl_map_coalesce(map);
917 map2 = isl_map_read_from_str(ctx,
918 "[n] -> { [i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
919 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
920 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
921 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
922 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
923 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
924 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
925 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
926 "[i0] -> [o0] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
927 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
928 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
929 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
930 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
931 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
932 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
933 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
934 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
935 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }");
936 assert(isl_map_is_equal(map, map2));
937 isl_map_free(map);
938 isl_map_free(map2);
939
940 str = "[n, m] -> { [] -> [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
941 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
942 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
943 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }";
944 map = isl_map_read_from_str(ctx, str);
945 map = isl_map_coalesce(map);
946 map2 = isl_map_read_from_str(ctx, str);
947 assert(isl_map_is_equal(map, map2));
948 isl_map_free(map);
949 isl_map_free(map2);
950
951 str = "[M, N] -> { [i0, i1, i2, i3, i4, i5, i6] -> "
952 "[o0, o1, o2, o3, o4, o5, o6] : "
953 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
954 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
955 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
956 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
957 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
958 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
959 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
960 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
961 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
962 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
963 "o6 >= i3 + i6 - o3 and M >= 0 and "
964 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
965 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }";
966 map = isl_map_read_from_str(ctx, str);
967 map = isl_map_coalesce(map);
968 map2 = isl_map_read_from_str(ctx, str);
969 assert(isl_map_is_equal(map, map2));
970 isl_map_free(map);
971 isl_map_free(map2);
972
973 str = "[M, N] -> { [] -> [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
974 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
975 "(o0 = 0 and M >= 2 and N >= 3) or "
976 "(M = 0 and o0 = 0 and N >= 3) }";
977 map = isl_map_read_from_str(ctx, str);
978 map = isl_map_coalesce(map);
979 map2 = isl_map_read_from_str(ctx, str);
980 assert(isl_map_is_equal(map, map2));
981 isl_map_free(map);
982 isl_map_free(map2);
983
984 str = "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
985 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
986 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
987 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }";
988 map = isl_map_read_from_str(ctx, str);
989 map = isl_map_coalesce(map);
990 map2 = isl_map_read_from_str(ctx, str);
991 assert(isl_map_is_equal(map, map2));
992 isl_map_free(map);
993 isl_map_free(map2);
994
995 test_coalesce_set(ctx,
996 "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or "
997 "(i1 = M and M >= 1) }", 0);
998 test_coalesce_set(ctx,
999 "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }", 0);
1000 test_coalesce_set(ctx,
1001 "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1002 "(y = 3 and x = 1) }", 1);
1003 test_coalesce_set(ctx,
1004 "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1005 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1006 "i1 <= M and i3 <= M and i4 <= M) or "
1007 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1008 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1009 "i4 <= -1 + M) }", 1);
1010 test_coalesce_set(ctx,
1011 "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1012 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }", 1);
1013 test_coalesce_set(ctx,
1014 "{[x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1015 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1016 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1017 "x-z + 20 >= 0 and x+z + 20 >= 0 and -10 <= y <= 0}", 1);
1018 test_coalesce_set(ctx,
1019 "{[x,y] : 0 <= x,y <= 10; [5,y]: 4 <=y <= 11}", 1);
1020 test_coalesce_set(ctx, "{[x,0] : x >= 0; [x,1] : x <= 20}", 0);
1021 test_coalesce_set(ctx,
1022 "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1);
1023 test_coalesce_set(ctx, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }", 1);
1024 test_coalesce_set(ctx, "{ [0,0]; [i,i] : 1 <= i <= 10 }", 1);
1025 test_coalesce_set(ctx, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }", 0);
1026 test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 1 <= i <= 10 }", 1);
1027 test_coalesce_set(ctx, "{ [0,0]; [i,2i] : 2 <= i <= 10 }", 0);
1028 test_coalesce_set(ctx, "{ [1,0]; [i,2i] : 1 <= i <= 10 }", 0);
1029 test_coalesce_set(ctx, "{ [0,1]; [i,2i] : 1 <= i <= 10 }", 0);
1030 }
1031
1032 void test_closure(struct isl_ctx *ctx)
1033 {
1034 const char *str;
1035 isl_set *dom;
1036 isl_map *up, *right;
1037 isl_map *map, *map2;
1038 int exact;
1039
1040 /* COCOA example 1 */
1041 map = isl_map_read_from_str(ctx,
1042 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1043 "1 <= i and i < n and 1 <= j and j < n or "
1044 "i2 = i + 1 and j2 = j - 1 and "
1045 "1 <= i and i < n and 2 <= j and j <= n }");
1046 map = isl_map_power(map, &exact);
1047 assert(exact);
1048 isl_map_free(map);
1049
1050 /* COCOA example 1 */
1051 map = isl_map_read_from_str(ctx,
1052 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
1053 "1 <= i and i < n and 1 <= j and j < n or "
1054 "i2 = i + 1 and j2 = j - 1 and "
1055 "1 <= i and i < n and 2 <= j and j <= n }");
1056 map = isl_map_transitive_closure(map, &exact);
1057 assert(exact);
1058 map2 = isl_map_read_from_str(ctx,
1059 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1060 "1 <= i and i < n and 1 <= j and j <= n and "
1061 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1062 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
1063 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
1064 assert(isl_map_is_equal(map, map2));
1065 isl_map_free(map2);
1066 isl_map_free(map);
1067
1068 map = isl_map_read_from_str(ctx,
1069 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
1070 " 0 <= y and y <= n }");
1071 map = isl_map_transitive_closure(map, &exact);
1072 map2 = isl_map_read_from_str(ctx,
1073 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
1074 " 0 <= y and y <= n }");
1075 assert(isl_map_is_equal(map, map2));
1076 isl_map_free(map2);
1077 isl_map_free(map);
1078
1079 /* COCOA example 2 */
1080 map = isl_map_read_from_str(ctx,
1081 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
1082 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
1083 "i2 = i + 2 and j2 = j - 2 and "
1084 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
1085 map = isl_map_transitive_closure(map, &exact);
1086 assert(exact);
1087 map2 = isl_map_read_from_str(ctx,
1088 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
1089 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
1090 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
1091 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
1092 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
1093 assert(isl_map_is_equal(map, map2));
1094 isl_map_free(map);
1095 isl_map_free(map2);
1096
1097 /* COCOA Fig.2 left */
1098 map = isl_map_read_from_str(ctx,
1099 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
1100 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
1101 "j <= n or "
1102 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
1103 "j <= 2 i - 3 and j <= n - 2 or "
1104 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1105 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1106 map = isl_map_transitive_closure(map, &exact);
1107 assert(exact);
1108 isl_map_free(map);
1109
1110 /* COCOA Fig.2 right */
1111 map = isl_map_read_from_str(ctx,
1112 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1113 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1114 "j <= n or "
1115 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1116 "j <= 2 i - 4 and j <= n - 3 or "
1117 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1118 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1119 map = isl_map_power(map, &exact);
1120 assert(exact);
1121 isl_map_free(map);
1122
1123 /* COCOA Fig.2 right */
1124 map = isl_map_read_from_str(ctx,
1125 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
1126 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
1127 "j <= n or "
1128 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
1129 "j <= 2 i - 4 and j <= n - 3 or "
1130 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
1131 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
1132 map = isl_map_transitive_closure(map, &exact);
1133 assert(exact);
1134 map2 = isl_map_read_from_str(ctx,
1135 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
1136 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
1137 "j <= n and 3 + i + 2 j <= 3 n and "
1138 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
1139 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
1140 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
1141 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
1142 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
1143 assert(isl_map_is_equal(map, map2));
1144 isl_map_free(map2);
1145 isl_map_free(map);
1146
1147 /* COCOA Fig.1 right */
1148 dom = isl_set_read_from_str(ctx,
1149 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
1150 "2 x - 3 y + 3 >= 0 }");
1151 right = isl_map_read_from_str(ctx,
1152 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
1153 up = isl_map_read_from_str(ctx,
1154 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
1155 right = isl_map_intersect_domain(right, isl_set_copy(dom));
1156 right = isl_map_intersect_range(right, isl_set_copy(dom));
1157 up = isl_map_intersect_domain(up, isl_set_copy(dom));
1158 up = isl_map_intersect_range(up, dom);
1159 map = isl_map_union(up, right);
1160 map = isl_map_transitive_closure(map, &exact);
1161 assert(exact);
1162 map2 = isl_map_read_from_str(ctx,
1163 "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; "
1164 " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }");
1165 assert(isl_map_is_equal(map, map2));
1166 isl_map_free(map2);
1167 isl_map_free(map);
1168
1169 /* COCOA Theorem 1 counter example */
1170 map = isl_map_read_from_str(ctx,
1171 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
1172 "i2 = 1 and j2 = j or "
1173 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
1174 map = isl_map_transitive_closure(map, &exact);
1175 assert(exact);
1176 isl_map_free(map);
1177
1178 map = isl_map_read_from_str(ctx,
1179 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
1180 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
1181 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
1182 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
1183 map = isl_map_transitive_closure(map, &exact);
1184 assert(exact);
1185 isl_map_free(map);
1186
1187 /* Kelly et al 1996, fig 12 */
1188 map = isl_map_read_from_str(ctx,
1189 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
1190 "1 <= i,j,j+1 <= n or "
1191 "j = n and j2 = 1 and i2 = i + 1 and "
1192 "1 <= i,i+1 <= n }");
1193 map = isl_map_transitive_closure(map, &exact);
1194 assert(exact);
1195 map2 = isl_map_read_from_str(ctx,
1196 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
1197 "1 <= i <= n and i = i2 or "
1198 "1 <= i < i2 <= n and 1 <= j <= n and "
1199 "1 <= j2 <= n }");
1200 assert(isl_map_is_equal(map, map2));
1201 isl_map_free(map2);
1202 isl_map_free(map);
1203
1204 /* Omega's closure4 */
1205 map = isl_map_read_from_str(ctx,
1206 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
1207 "1 <= x,y <= 10 or "
1208 "x2 = x + 1 and y2 = y and "
1209 "1 <= x <= 20 && 5 <= y <= 15 }");
1210 map = isl_map_transitive_closure(map, &exact);
1211 assert(exact);
1212 isl_map_free(map);
1213
1214 map = isl_map_read_from_str(ctx,
1215 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
1216 map = isl_map_transitive_closure(map, &exact);
1217 assert(!exact);
1218 map2 = isl_map_read_from_str(ctx,
1219 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
1220 assert(isl_map_is_equal(map, map2));
1221 isl_map_free(map);
1222 isl_map_free(map2);
1223
1224 str = "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
1225 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
1226 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
1227 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
1228 map = isl_map_read_from_str(ctx, str);
1229 map = isl_map_transitive_closure(map, &exact);
1230 assert(exact);
1231 map2 = isl_map_read_from_str(ctx, str);
1232 assert(isl_map_is_equal(map, map2));
1233 isl_map_free(map);
1234 isl_map_free(map2);
1235
1236 str = "{[0] -> [1]; [2] -> [3]}";
1237 map = isl_map_read_from_str(ctx, str);
1238 map = isl_map_transitive_closure(map, &exact);
1239 assert(exact);
1240 map2 = isl_map_read_from_str(ctx, str);
1241 assert(isl_map_is_equal(map, map2));
1242 isl_map_free(map);
1243 isl_map_free(map2);
1244
1245 str = "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
1246 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
1247 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
1248 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1249 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1250 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
1251 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
1252 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
1253 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1254 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1255 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
1256 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
1257 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
1258 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1259 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
1260 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
1261 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
1262 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
1263 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
1264 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
1265 map = isl_map_read_from_str(ctx, str);
1266 map = isl_map_transitive_closure(map, NULL);
1267 assert(map);
1268 isl_map_free(map);
1269 }
1270
1271 void test_lex(struct isl_ctx *ctx)
1272 {
1273 isl_space *dim;
1274 isl_map *map;
1275
1276 dim = isl_space_set_alloc(ctx, 0, 0);
1277 map = isl_map_lex_le(dim);
1278 assert(!isl_map_is_empty(map));
1279 isl_map_free(map);
1280 }
1281
1282 void test_lexmin(struct isl_ctx *ctx)
1283 {
1284 const char *str;
1285 isl_basic_map *bmap;
1286 isl_map *map, *map2;
1287 isl_set *set;
1288 isl_set *set2;
1289 isl_pw_multi_aff *pma;
1290
1291 str = "[p0, p1] -> { [] -> [] : "
1292 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
1293 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
1294 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
1295 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
1296 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
1297 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
1298 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
1299 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
1300 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
1301 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
1302 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
1303 map = isl_map_read_from_str(ctx, str);
1304 map = isl_map_lexmin(map);
1305 isl_map_free(map);
1306
1307 str = "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
1308 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
1309 set = isl_set_read_from_str(ctx, str);
1310 set = isl_set_lexmax(set);
1311 str = "[C] -> { [obj,a,b,c] : C = 8 }";
1312 set2 = isl_set_read_from_str(ctx, str);
1313 set = isl_set_intersect(set, set2);
1314 assert(!isl_set_is_empty(set));
1315 isl_set_free(set);
1316
1317 str = "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }";
1318 map = isl_map_read_from_str(ctx, str);
1319 map = isl_map_lexmin(map);
1320 str = "{ [x] -> [5] : 6 <= x <= 8; "
1321 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }";
1322 map2 = isl_map_read_from_str(ctx, str);
1323 assert(isl_map_is_equal(map, map2));
1324 isl_map_free(map);
1325 isl_map_free(map2);
1326
1327 str = "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }";
1328 map = isl_map_read_from_str(ctx, str);
1329 map2 = isl_map_copy(map);
1330 map = isl_map_lexmin(map);
1331 assert(isl_map_is_equal(map, map2));
1332 isl_map_free(map);
1333 isl_map_free(map2);
1334
1335 str = "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }";
1336 map = isl_map_read_from_str(ctx, str);
1337 map = isl_map_lexmin(map);
1338 str = "{ [x] -> [y] : (4y = x and x >= 0) or "
1339 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
1340 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
1341 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }";
1342 map2 = isl_map_read_from_str(ctx, str);
1343 assert(isl_map_is_equal(map, map2));
1344 isl_map_free(map);
1345 isl_map_free(map2);
1346
1347 str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
1348 " 8i' <= i and 8i' >= -7 + i }";
1349 bmap = isl_basic_map_read_from_str(ctx, str);
1350 pma = isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap));
1351 map2 = isl_map_from_pw_multi_aff(pma);
1352 map = isl_map_from_basic_map(bmap);
1353 assert(isl_map_is_equal(map, map2));
1354 isl_map_free(map);
1355 isl_map_free(map2);
1356
1357 str = "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }";
1358 map = isl_map_read_from_str(ctx, str);
1359 map = isl_map_lexmin(map);
1360 str = "{ T[a] -> S[b, c] : 2b = a and 2c = a }";
1361 map2 = isl_map_read_from_str(ctx, str);
1362 assert(isl_map_is_equal(map, map2));
1363 isl_map_free(map);
1364 isl_map_free(map2);
1365 }
1366
1367 struct must_may {
1368 isl_map *must;
1369 isl_map *may;
1370 };
1371
1372 static int collect_must_may(__isl_take isl_map *dep, int must,
1373 void *dep_user, void *user)
1374 {
1375 struct must_may *mm = (struct must_may *)user;
1376
1377 if (must)
1378 mm->must = isl_map_union(mm->must, dep);
1379 else
1380 mm->may = isl_map_union(mm->may, dep);
1381
1382 return 0;
1383 }
1384
1385 static int common_space(void *first, void *second)
1386 {
1387 int depth = *(int *)first;
1388 return 2 * depth;
1389 }
1390
1391 static int map_is_equal(__isl_keep isl_map *map, const char *str)
1392 {
1393 isl_map *map2;
1394 int equal;
1395
1396 if (!map)
1397 return -1;
1398
1399 map2 = isl_map_read_from_str(map->ctx, str);
1400 equal = isl_map_is_equal(map, map2);
1401 isl_map_free(map2);
1402
1403 return equal;
1404 }
1405
1406 void test_dep(struct isl_ctx *ctx)
1407 {
1408 const char *str;
1409 isl_space *dim;
1410 isl_map *map;
1411 isl_access_info *ai;
1412 isl_flow *flow;
1413 int depth;
1414 struct must_may mm;
1415
1416 depth = 3;
1417
1418 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1419 map = isl_map_read_from_str(ctx, str);
1420 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1421
1422 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1423 map = isl_map_read_from_str(ctx, str);
1424 ai = isl_access_info_add_source(ai, map, 1, &depth);
1425
1426 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1427 map = isl_map_read_from_str(ctx, str);
1428 ai = isl_access_info_add_source(ai, map, 1, &depth);
1429
1430 flow = isl_access_info_compute_flow(ai);
1431 dim = isl_space_alloc(ctx, 0, 3, 3);
1432 mm.must = isl_map_empty(isl_space_copy(dim));
1433 mm.may = isl_map_empty(dim);
1434
1435 isl_flow_foreach(flow, collect_must_may, &mm);
1436
1437 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
1438 " [1,10,0] -> [2,5,0] }";
1439 assert(map_is_equal(mm.must, str));
1440 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1441 assert(map_is_equal(mm.may, str));
1442
1443 isl_map_free(mm.must);
1444 isl_map_free(mm.may);
1445 isl_flow_free(flow);
1446
1447
1448 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1449 map = isl_map_read_from_str(ctx, str);
1450 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1451
1452 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1453 map = isl_map_read_from_str(ctx, str);
1454 ai = isl_access_info_add_source(ai, map, 1, &depth);
1455
1456 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1457 map = isl_map_read_from_str(ctx, str);
1458 ai = isl_access_info_add_source(ai, map, 0, &depth);
1459
1460 flow = isl_access_info_compute_flow(ai);
1461 dim = isl_space_alloc(ctx, 0, 3, 3);
1462 mm.must = isl_map_empty(isl_space_copy(dim));
1463 mm.may = isl_map_empty(dim);
1464
1465 isl_flow_foreach(flow, collect_must_may, &mm);
1466
1467 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
1468 assert(map_is_equal(mm.must, str));
1469 str = "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1470 assert(map_is_equal(mm.may, str));
1471
1472 isl_map_free(mm.must);
1473 isl_map_free(mm.may);
1474 isl_flow_free(flow);
1475
1476
1477 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
1478 map = isl_map_read_from_str(ctx, str);
1479 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1480
1481 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1482 map = isl_map_read_from_str(ctx, str);
1483 ai = isl_access_info_add_source(ai, map, 0, &depth);
1484
1485 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
1486 map = isl_map_read_from_str(ctx, str);
1487 ai = isl_access_info_add_source(ai, map, 0, &depth);
1488
1489 flow = isl_access_info_compute_flow(ai);
1490 dim = isl_space_alloc(ctx, 0, 3, 3);
1491 mm.must = isl_map_empty(isl_space_copy(dim));
1492 mm.may = isl_map_empty(dim);
1493
1494 isl_flow_foreach(flow, collect_must_may, &mm);
1495
1496 str = "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
1497 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
1498 assert(map_is_equal(mm.may, str));
1499 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1500 assert(map_is_equal(mm.must, str));
1501
1502 isl_map_free(mm.must);
1503 isl_map_free(mm.may);
1504 isl_flow_free(flow);
1505
1506
1507 str = "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
1508 map = isl_map_read_from_str(ctx, str);
1509 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1510
1511 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1512 map = isl_map_read_from_str(ctx, str);
1513 ai = isl_access_info_add_source(ai, map, 0, &depth);
1514
1515 str = "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
1516 map = isl_map_read_from_str(ctx, str);
1517 ai = isl_access_info_add_source(ai, map, 0, &depth);
1518
1519 flow = isl_access_info_compute_flow(ai);
1520 dim = isl_space_alloc(ctx, 0, 3, 3);
1521 mm.must = isl_map_empty(isl_space_copy(dim));
1522 mm.may = isl_map_empty(dim);
1523
1524 isl_flow_foreach(flow, collect_must_may, &mm);
1525
1526 str = "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
1527 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
1528 assert(map_is_equal(mm.may, str));
1529 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1530 assert(map_is_equal(mm.must, str));
1531
1532 isl_map_free(mm.must);
1533 isl_map_free(mm.may);
1534 isl_flow_free(flow);
1535
1536
1537 str = "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
1538 map = isl_map_read_from_str(ctx, str);
1539 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
1540
1541 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
1542 map = isl_map_read_from_str(ctx, str);
1543 ai = isl_access_info_add_source(ai, map, 0, &depth);
1544
1545 str = "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
1546 map = isl_map_read_from_str(ctx, str);
1547 ai = isl_access_info_add_source(ai, map, 0, &depth);
1548
1549 flow = isl_access_info_compute_flow(ai);
1550 dim = isl_space_alloc(ctx, 0, 3, 3);
1551 mm.must = isl_map_empty(isl_space_copy(dim));
1552 mm.may = isl_map_empty(dim);
1553
1554 isl_flow_foreach(flow, collect_must_may, &mm);
1555
1556 str = "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
1557 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
1558 assert(map_is_equal(mm.may, str));
1559 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
1560 assert(map_is_equal(mm.must, str));
1561
1562 isl_map_free(mm.must);
1563 isl_map_free(mm.may);
1564 isl_flow_free(flow);
1565
1566
1567 depth = 5;
1568
1569 str = "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1570 map = isl_map_read_from_str(ctx, str);
1571 ai = isl_access_info_alloc(map, &depth, &common_space, 1);
1572
1573 str = "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
1574 map = isl_map_read_from_str(ctx, str);
1575 ai = isl_access_info_add_source(ai, map, 1, &depth);
1576
1577 flow = isl_access_info_compute_flow(ai);
1578 dim = isl_space_alloc(ctx, 0, 5, 5);
1579 mm.must = isl_map_empty(isl_space_copy(dim));
1580 mm.may = isl_map_empty(dim);
1581
1582 isl_flow_foreach(flow, collect_must_may, &mm);
1583
1584 str = "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
1585 assert(map_is_equal(mm.must, str));
1586 str = "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
1587 assert(map_is_equal(mm.may, str));
1588
1589 isl_map_free(mm.must);
1590 isl_map_free(mm.may);
1591 isl_flow_free(flow);
1592 }
1593
1594 int test_sv(isl_ctx *ctx)
1595 {
1596 const char *str;
1597 isl_map *map;
1598 isl_union_map *umap;
1599 int sv;
1600
1601 str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }";
1602 map = isl_map_read_from_str(ctx, str);
1603 sv = isl_map_is_single_valued(map);
1604 isl_map_free(map);
1605 if (sv < 0)
1606 return -1;
1607 if (!sv)
1608 isl_die(ctx, isl_error_internal,
1609 "map not detected as single valued", return -1);
1610
1611 str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }";
1612 map = isl_map_read_from_str(ctx, str);
1613 sv = isl_map_is_single_valued(map);
1614 isl_map_free(map);
1615 if (sv < 0)
1616 return -1;
1617 if (sv)
1618 isl_die(ctx, isl_error_internal,
1619 "map detected as single valued", return -1);
1620
1621 str = "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }";
1622 umap = isl_union_map_read_from_str(ctx, str);
1623 sv = isl_union_map_is_single_valued(umap);
1624 isl_union_map_free(umap);
1625 if (sv < 0)
1626 return -1;
1627 if (!sv)
1628 isl_die(ctx, isl_error_internal,
1629 "map not detected as single valued", return -1);
1630
1631 str = "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }";
1632 umap = isl_union_map_read_from_str(ctx, str);
1633 sv = isl_union_map_is_single_valued(umap);
1634 isl_union_map_free(umap);
1635 if (sv < 0)
1636 return -1;
1637 if (sv)
1638 isl_die(ctx, isl_error_internal,
1639 "map detected as single valued", return -1);
1640
1641 return 0;
1642 }
1643
1644 void test_bijective_case(struct isl_ctx *ctx, const char *str, int bijective)
1645 {
1646 isl_map *map;
1647
1648 map = isl_map_read_from_str(ctx, str);
1649 if (bijective)
1650 assert(isl_map_is_bijective(map));
1651 else
1652 assert(!isl_map_is_bijective(map));
1653 isl_map_free(map);
1654 }
1655
1656 void test_bijective(struct isl_ctx *ctx)
1657 {
1658 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i]}", 0);
1659 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=i}", 1);
1660 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=0}", 1);
1661 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=N}", 1);
1662 test_bijective_case(ctx, "[N,M]->{[i,j] -> [j,i]}", 1);
1663 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i+j]}", 0);
1664 test_bijective_case(ctx, "[N,M]->{[i,j] -> []}", 0);
1665 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,j,N]}", 1);
1666 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i]}", 0);
1667 test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,i]}", 0);
1668 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,i]}", 0);
1669 test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,j]}", 1);
1670 test_bijective_case(ctx, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1);
1671 }
1672
1673 void test_pwqp(struct isl_ctx *ctx)
1674 {
1675 const char *str;
1676 isl_set *set;
1677 isl_pw_qpolynomial *pwqp1, *pwqp2;
1678
1679 str = "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1680 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1681
1682 pwqp1 = isl_pw_qpolynomial_move_dims(pwqp1, isl_dim_param, 0,
1683 isl_dim_in, 1, 1);
1684
1685 str = "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
1686 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1687
1688 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1689
1690 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1691
1692 isl_pw_qpolynomial_free(pwqp1);
1693
1694 str = "{ [i] -> i }";
1695 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1696 str = "{ [k] : exists a : k = 2a }";
1697 set = isl_set_read_from_str(ctx, str);
1698 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1699 str = "{ [i] -> i }";
1700 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1701
1702 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1703
1704 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1705
1706 isl_pw_qpolynomial_free(pwqp1);
1707
1708 str = "{ [i] -> i + [ (i + [i/3])/2 ] }";
1709 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1710 str = "{ [10] }";
1711 set = isl_set_read_from_str(ctx, str);
1712 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1713 str = "{ [i] -> 16 }";
1714 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1715
1716 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1717
1718 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1719
1720 isl_pw_qpolynomial_free(pwqp1);
1721
1722 str = "{ [i] -> ([(i)/2]) }";
1723 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1724 str = "{ [k] : exists a : k = 2a+1 }";
1725 set = isl_set_read_from_str(ctx, str);
1726 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
1727 str = "{ [i] -> -1/2 + 1/2 * i }";
1728 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1729
1730 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1731
1732 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1733
1734 isl_pw_qpolynomial_free(pwqp1);
1735
1736 str = "{ [i] -> ([([i/2] + [i/2])/5]) }";
1737 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1738 str = "{ [i] -> ([(2 * [i/2])/5]) }";
1739 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1740
1741 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1742
1743 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1744
1745 isl_pw_qpolynomial_free(pwqp1);
1746
1747 str = "{ [x] -> ([x/2] + [(x+1)/2]) }";
1748 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1749 str = "{ [x] -> x }";
1750 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1751
1752 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1753
1754 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1755
1756 isl_pw_qpolynomial_free(pwqp1);
1757
1758 str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
1759 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
1760 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
1761 pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1);
1762 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
1763 assert(isl_pw_qpolynomial_is_zero(pwqp1));
1764 isl_pw_qpolynomial_free(pwqp1);
1765 }
1766
1767 void test_split_periods(isl_ctx *ctx)
1768 {
1769 const char *str;
1770 isl_pw_qpolynomial *pwqp;
1771
1772 str = "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
1773 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
1774 "U >= 0; [U,V] -> U^2 : U >= 100 }";
1775 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
1776
1777 pwqp = isl_pw_qpolynomial_split_periods(pwqp, 2);
1778 assert(pwqp);
1779
1780 isl_pw_qpolynomial_free(pwqp);
1781 }
1782
1783 void test_union(isl_ctx *ctx)
1784 {
1785 const char *str;
1786 isl_union_set *uset1, *uset2;
1787 isl_union_map *umap1, *umap2;
1788
1789 str = "{ [i] : 0 <= i <= 1 }";
1790 uset1 = isl_union_set_read_from_str(ctx, str);
1791 str = "{ [1] -> [0] }";
1792 umap1 = isl_union_map_read_from_str(ctx, str);
1793
1794 umap2 = isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1), uset1);
1795 assert(isl_union_map_is_equal(umap1, umap2));
1796
1797 isl_union_map_free(umap1);
1798 isl_union_map_free(umap2);
1799
1800 str = "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
1801 umap1 = isl_union_map_read_from_str(ctx, str);
1802 str = "{ A[i]; B[i] }";
1803 uset1 = isl_union_set_read_from_str(ctx, str);
1804
1805 uset2 = isl_union_map_domain(umap1);
1806
1807 assert(isl_union_set_is_equal(uset1, uset2));
1808
1809 isl_union_set_free(uset1);
1810 isl_union_set_free(uset2);
1811 }
1812
1813 void test_bound(isl_ctx *ctx)
1814 {
1815 const char *str;
1816 isl_pw_qpolynomial *pwqp;
1817 isl_pw_qpolynomial_fold *pwf;
1818
1819 str = "{ [[a, b, c, d] -> [e]] -> 0 }";
1820 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
1821 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
1822 assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 4);
1823 isl_pw_qpolynomial_fold_free(pwf);
1824
1825 str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
1826 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
1827 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL);
1828 assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 1);
1829 isl_pw_qpolynomial_fold_free(pwf);
1830 }
1831
1832 void test_lift(isl_ctx *ctx)
1833 {
1834 const char *str;
1835 isl_basic_map *bmap;
1836 isl_basic_set *bset;
1837
1838 str = "{ [i0] : exists e0 : i0 = 4e0 }";
1839 bset = isl_basic_set_read_from_str(ctx, str);
1840 bset = isl_basic_set_lift(bset);
1841 bmap = isl_basic_map_from_range(bset);
1842 bset = isl_basic_map_domain(bmap);
1843 isl_basic_set_free(bset);
1844 }
1845
1846 void test_subset(isl_ctx *ctx)
1847 {
1848 const char *str;
1849 isl_set *set1, *set2;
1850
1851 str = "{ [112, 0] }";
1852 set1 = isl_set_read_from_str(ctx, str);
1853 str = "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
1854 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
1855 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }";
1856 set2 = isl_set_read_from_str(ctx, str);
1857 assert(isl_set_is_subset(set1, set2));
1858 isl_set_free(set1);
1859 isl_set_free(set2);
1860 }
1861
1862 void test_factorize(isl_ctx *ctx)
1863 {
1864 const char *str;
1865 isl_basic_set *bset;
1866 isl_factorizer *f;
1867
1868 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
1869 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
1870 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
1871 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
1872 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
1873 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
1874 "3i5 >= -2i0 - i2 + 3i4 }";
1875 bset = isl_basic_set_read_from_str(ctx, str);
1876 f = isl_basic_set_factorizer(bset);
1877 assert(f);
1878 isl_basic_set_free(bset);
1879 isl_factorizer_free(f);
1880
1881 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
1882 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
1883 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
1884 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
1885 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
1886 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
1887 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
1888 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
1889 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
1890 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
1891 bset = isl_basic_set_read_from_str(ctx, str);
1892 f = isl_basic_set_factorizer(bset);
1893 assert(f);
1894 isl_basic_set_free(bset);
1895 isl_factorizer_free(f);
1896 }
1897
1898 static int check_injective(__isl_take isl_map *map, void *user)
1899 {
1900 int *injective = user;
1901
1902 *injective = isl_map_is_injective(map);
1903 isl_map_free(map);
1904
1905 if (*injective < 0 || !*injective)
1906 return -1;
1907
1908 return 0;
1909 }
1910
1911 int test_one_schedule(isl_ctx *ctx, const char *d, const char *w,
1912 const char *r, const char *s, int tilable, int parallel)
1913 {
1914 int i;
1915 isl_union_set *D;
1916 isl_union_map *W, *R, *S;
1917 isl_union_map *empty;
1918 isl_union_map *dep_raw, *dep_war, *dep_waw, *dep;
1919 isl_union_map *validity, *proximity;
1920 isl_union_map *schedule;
1921 isl_union_map *test;
1922 isl_union_set *delta;
1923 isl_union_set *domain;
1924 isl_set *delta_set;
1925 isl_set *slice;
1926 isl_set *origin;
1927 isl_schedule *sched;
1928 int is_nonneg, is_parallel, is_tilable, is_injection, is_complete;
1929
1930 D = isl_union_set_read_from_str(ctx, d);
1931 W = isl_union_map_read_from_str(ctx, w);
1932 R = isl_union_map_read_from_str(ctx, r);
1933 S = isl_union_map_read_from_str(ctx, s);
1934
1935 W = isl_union_map_intersect_domain(W, isl_union_set_copy(D));
1936 R = isl_union_map_intersect_domain(R, isl_union_set_copy(D));
1937
1938 empty = isl_union_map_empty(isl_union_map_get_space(S));
1939 isl_union_map_compute_flow(isl_union_map_copy(R),
1940 isl_union_map_copy(W), empty,
1941 isl_union_map_copy(S),
1942 &dep_raw, NULL, NULL, NULL);
1943 isl_union_map_compute_flow(isl_union_map_copy(W),
1944 isl_union_map_copy(W),
1945 isl_union_map_copy(R),
1946 isl_union_map_copy(S),
1947 &dep_waw, &dep_war, NULL, NULL);
1948
1949 dep = isl_union_map_union(dep_waw, dep_war);
1950 dep = isl_union_map_union(dep, dep_raw);
1951 validity = isl_union_map_copy(dep);
1952 proximity = isl_union_map_copy(dep);
1953
1954 sched = isl_union_set_compute_schedule(isl_union_set_copy(D),
1955 validity, proximity);
1956 schedule = isl_schedule_get_map(sched);
1957 isl_schedule_free(sched);
1958 isl_union_map_free(W);
1959 isl_union_map_free(R);
1960 isl_union_map_free(S);
1961
1962 is_injection = 1;
1963 isl_union_map_foreach_map(schedule, &check_injective, &is_injection);
1964
1965 domain = isl_union_map_domain(isl_union_map_copy(schedule));
1966 is_complete = isl_union_set_is_subset(D, domain);
1967 isl_union_set_free(D);
1968 isl_union_set_free(domain);
1969
1970 test = isl_union_map_reverse(isl_union_map_copy(schedule));
1971 test = isl_union_map_apply_range(test, dep);
1972 test = isl_union_map_apply_range(test, schedule);
1973
1974 delta = isl_union_map_deltas(test);
1975 if (isl_union_set_n_set(delta) == 0) {
1976 is_tilable = 1;
1977 is_parallel = 1;
1978 is_nonneg = 1;
1979 isl_union_set_free(delta);
1980 } else {
1981 delta_set = isl_set_from_union_set(delta);
1982
1983 slice = isl_set_universe(isl_set_get_space(delta_set));
1984 for (i = 0; i < tilable; ++i)
1985 slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0);
1986 is_tilable = isl_set_is_subset(delta_set, slice);
1987 isl_set_free(slice);
1988
1989 slice = isl_set_universe(isl_set_get_space(delta_set));
1990 for (i = 0; i < parallel; ++i)
1991 slice = isl_set_fix_si(slice, isl_dim_set, i, 0);
1992 is_parallel = isl_set_is_subset(delta_set, slice);
1993 isl_set_free(slice);
1994
1995 origin = isl_set_universe(isl_set_get_space(delta_set));
1996 for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i)
1997 origin = isl_set_fix_si(origin, isl_dim_set, i, 0);
1998
1999 delta_set = isl_set_union(delta_set, isl_set_copy(origin));
2000 delta_set = isl_set_lexmin(delta_set);
2001
2002 is_nonneg = isl_set_is_equal(delta_set, origin);
2003
2004 isl_set_free(origin);
2005 isl_set_free(delta_set);
2006 }
2007
2008 if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 ||
2009 is_injection < 0 || is_complete < 0)
2010 return -1;
2011 if (!is_complete)
2012 isl_die(ctx, isl_error_unknown,
2013 "generated schedule incomplete", return -1);
2014 if (!is_injection)
2015 isl_die(ctx, isl_error_unknown,
2016 "generated schedule not injective on each statement",
2017 return -1);
2018 if (!is_nonneg)
2019 isl_die(ctx, isl_error_unknown,
2020 "negative dependences in generated schedule",
2021 return -1);
2022 if (!is_tilable)
2023 isl_die(ctx, isl_error_unknown,
2024 "generated schedule not as tilable as expected",
2025 return -1);
2026 if (!is_parallel)
2027 isl_die(ctx, isl_error_unknown,
2028 "generated schedule not as parallel as expected",
2029 return -1);
2030
2031 return 0;
2032 }
2033
2034 int test_special_schedule(isl_ctx *ctx)
2035 {
2036 const char *str;
2037 isl_union_set *dom;
2038 isl_union_map *empty;
2039 isl_union_map *dep;
2040 isl_union_map *sched1, *sched2;
2041 isl_schedule *schedule;
2042 int equal;
2043
2044 str = "{ S[i,j] : 0 <= i <= 10 }";
2045 dom = isl_union_set_read_from_str(ctx, str);
2046 str = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
2047 dep = isl_union_map_read_from_str(ctx, str);
2048 empty = isl_union_map_read_from_str(ctx, "{}");
2049 schedule = isl_union_set_compute_schedule(dom, empty, dep);
2050 sched1 = isl_schedule_get_map(schedule);
2051 isl_schedule_free(schedule);
2052
2053 str = "{ S[i, j] -> [j, i] }";
2054 sched2 = isl_union_map_read_from_str(ctx, str);
2055
2056 equal = isl_union_map_is_equal(sched1, sched2);
2057 isl_union_map_free(sched1);
2058 isl_union_map_free(sched2);
2059
2060 if (equal < 0)
2061 return -1;
2062 if (!equal)
2063 isl_die(ctx, isl_error_unknown, "unexpected schedule",
2064 return -1);
2065
2066 return 0;
2067 }
2068
2069 int test_schedule(isl_ctx *ctx)
2070 {
2071 const char *D, *W, *R, *S;
2072
2073 /* Jacobi */
2074 D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
2075 W = "{ S1[t,i] -> a[t,i] }";
2076 R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
2077 "S1[t,i] -> a[t-1,i+1] }";
2078 S = "{ S1[t,i] -> [t,i] }";
2079 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2080 return -1;
2081
2082 /* Fig. 5 of CC2008 */
2083 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
2084 "j <= -1 + N }";
2085 W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
2086 "j >= 2 and j <= -1 + N }";
2087 R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
2088 "j >= 2 and j <= -1 + N; "
2089 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
2090 "j >= 2 and j <= -1 + N }";
2091 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2092 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2093 return -1;
2094
2095 D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
2096 W = "{ S1[i] -> a[i] }";
2097 R = "{ S2[i] -> a[i+1] }";
2098 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2099 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2100 return -1;
2101
2102 D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
2103 W = "{ S1[i] -> a[i] }";
2104 R = "{ S2[i] -> a[9-i] }";
2105 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2106 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2107 return -1;
2108
2109 D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
2110 W = "{ S1[i] -> a[i] }";
2111 R = "[N] -> { S2[i] -> a[N-1-i] }";
2112 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
2113 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
2114 return -1;
2115
2116 D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
2117 W = "{ S1[i] -> a[i]; S2[i] -> b[i] }";
2118 R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
2119 S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
2120 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2121 return -1;
2122
2123 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2124 W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
2125 R = "{ S2[i,j] -> a[i-1,j] }";
2126 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2127 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2128 return -1;
2129
2130 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
2131 W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
2132 R = "{ S2[i,j] -> a[i,j-1] }";
2133 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
2134 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2135 return -1;
2136
2137 D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
2138 W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
2139 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
2140 R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
2141 S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
2142 "S_0[] -> [0, 0, 0] }";
2143 if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0)
2144 return -1;
2145 ctx->opt->schedule_parametric = 0;
2146 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2147 return -1;
2148 ctx->opt->schedule_parametric = 1;
2149
2150 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
2151 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
2152 W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
2153 R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
2154 "S4[i] -> a[i,N] }";
2155 S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
2156 "S4[i] -> [4,i,0] }";
2157 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
2158 return -1;
2159
2160 D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
2161 W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2162 "j <= N }";
2163 R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
2164 "j <= N; "
2165 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
2166 "j <= N }";
2167 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
2168 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2169 return -1;
2170
2171 D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
2172 " S_2[t] : t >= 0 and t <= -1 + N; "
2173 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
2174 "i <= -1 + N }";
2175 W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
2176 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
2177 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
2178 "i >= 0 and i <= -1 + N }";
2179 R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
2180 "i >= 0 and i <= -1 + N; "
2181 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
2182 S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
2183 " S_0[t] -> [0, t, 0] }";
2184
2185 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
2186 return -1;
2187 ctx->opt->schedule_parametric = 0;
2188 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2189 return -1;
2190 ctx->opt->schedule_parametric = 1;
2191
2192 D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
2193 S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
2194 if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0)
2195 return -1;
2196
2197 D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
2198 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
2199 W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
2200 "j >= 0 and j <= -1 + N; "
2201 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2202 R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
2203 "j >= 0 and j <= -1 + N; "
2204 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
2205 S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
2206 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2207 return -1;
2208
2209 D = "{ S_0[i] : i >= 0 }";
2210 W = "{ S_0[i] -> a[i] : i >= 0 }";
2211 R = "{ S_0[i] -> a[0] : i >= 0 }";
2212 S = "{ S_0[i] -> [0, i, 0] }";
2213 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2214 return -1;
2215
2216 D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
2217 W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
2218 R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
2219 S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
2220 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2221 return -1;
2222
2223 D = "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
2224 "k <= -1 + n and k >= 0 }";
2225 W = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
2226 R = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
2227 "k <= -1 + n and k >= 0; "
2228 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
2229 "k <= -1 + n and k >= 0; "
2230 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
2231 "k <= -1 + n and k >= 0 }";
2232 S = "[n] -> { S_0[j, k] -> [2, j, k] }";
2233 ctx->opt->schedule_outer_zero_distance = 1;
2234 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
2235 return -1;
2236 ctx->opt->schedule_outer_zero_distance = 0;
2237
2238 return test_special_schedule(ctx);
2239 }
2240
2241 int test_plain_injective(isl_ctx *ctx, const char *str, int injective)
2242 {
2243 isl_union_map *umap;
2244 int test;
2245
2246 umap = isl_union_map_read_from_str(ctx, str);
2247 test = isl_union_map_plain_is_injective(umap);
2248 isl_union_map_free(umap);
2249 if (test < 0)
2250 return -1;
2251 if (test == injective)
2252 return 0;
2253 if (injective)
2254 isl_die(ctx, isl_error_unknown,
2255 "map not detected as injective", return -1);
2256 else
2257 isl_die(ctx, isl_error_unknown,
2258 "map detected as injective", return -1);
2259 }
2260
2261 int test_injective(isl_ctx *ctx)
2262 {
2263 const char *str;
2264
2265 if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
2266 return -1;
2267 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1))
2268 return -1;
2269 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1))
2270 return -1;
2271 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0))
2272 return -1;
2273 if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
2274 return -1;
2275 if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
2276 return -1;
2277 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
2278 return -1;
2279 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
2280 return -1;
2281
2282 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
2283 if (test_plain_injective(ctx, str, 1))
2284 return -1;
2285 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
2286 if (test_plain_injective(ctx, str, 0))
2287 return -1;
2288
2289 return 0;
2290 }
2291
2292 int test_aff(isl_ctx *ctx)
2293 {
2294 const char *str;
2295 isl_set *set;
2296 isl_space *dim;
2297 isl_local_space *ls;
2298 isl_aff *aff;
2299 int zero;
2300
2301 dim = isl_space_set_alloc(ctx, 0, 1);
2302 ls = isl_local_space_from_space(dim);
2303 aff = isl_aff_zero_on_domain(ls);
2304
2305 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2306 aff = isl_aff_scale_down_ui(aff, 3);
2307 aff = isl_aff_floor(aff);
2308 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2309 aff = isl_aff_scale_down_ui(aff, 2);
2310 aff = isl_aff_floor(aff);
2311 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
2312
2313 str = "{ [10] }";
2314 set = isl_set_read_from_str(ctx, str);
2315 aff = isl_aff_gist(aff, set);
2316
2317 aff = isl_aff_add_constant_si(aff, -16);
2318 zero = isl_aff_plain_is_zero(aff);
2319 isl_aff_free(aff);
2320
2321 if (zero < 0)
2322 return -1;
2323 if (!zero)
2324 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2325
2326 return 0;
2327 }
2328
2329 int test_dim_max(isl_ctx *ctx)
2330 {
2331 int equal;
2332 const char *str;
2333 isl_set *set1, *set2;
2334 isl_set *set;
2335 isl_map *map;
2336 isl_pw_aff *pwaff;
2337
2338 str = "[N] -> { [i] : 0 <= i <= min(N,10) }";
2339 set = isl_set_read_from_str(ctx, str);
2340 pwaff = isl_set_dim_max(set, 0);
2341 set1 = isl_set_from_pw_aff(pwaff);
2342 str = "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
2343 set2 = isl_set_read_from_str(ctx, str);
2344 equal = isl_set_is_equal(set1, set2);
2345 isl_set_free(set1);
2346 isl_set_free(set2);
2347 if (equal < 0)
2348 return -1;
2349 if (!equal)
2350 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2351
2352 str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
2353 set = isl_set_read_from_str(ctx, str);
2354 pwaff = isl_set_dim_max(set, 0);
2355 set1 = isl_set_from_pw_aff(pwaff);
2356 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2357 set2 = isl_set_read_from_str(ctx, str);
2358 equal = isl_set_is_equal(set1, set2);
2359 isl_set_free(set1);
2360 isl_set_free(set2);
2361 if (equal < 0)
2362 return -1;
2363 if (!equal)
2364 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2365
2366 str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
2367 set = isl_set_read_from_str(ctx, str);
2368 pwaff = isl_set_dim_max(set, 0);
2369 set1 = isl_set_from_pw_aff(pwaff);
2370 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
2371 set2 = isl_set_read_from_str(ctx, str);
2372 equal = isl_set_is_equal(set1, set2);
2373 isl_set_free(set1);
2374 isl_set_free(set2);
2375 if (equal < 0)
2376 return -1;
2377 if (!equal)
2378 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2379
2380 str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
2381 "0 <= i < N and 0 <= j < M }";
2382 map = isl_map_read_from_str(ctx, str);
2383 set = isl_map_range(map);
2384
2385 pwaff = isl_set_dim_max(isl_set_copy(set), 0);
2386 set1 = isl_set_from_pw_aff(pwaff);
2387 str = "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
2388 set2 = isl_set_read_from_str(ctx, str);
2389 equal = isl_set_is_equal(set1, set2);
2390 isl_set_free(set1);
2391 isl_set_free(set2);
2392
2393 pwaff = isl_set_dim_max(isl_set_copy(set), 3);
2394 set1 = isl_set_from_pw_aff(pwaff);
2395 str = "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
2396 set2 = isl_set_read_from_str(ctx, str);
2397 if (equal >= 0 && equal)
2398 equal = isl_set_is_equal(set1, set2);
2399 isl_set_free(set1);
2400 isl_set_free(set2);
2401
2402 isl_set_free(set);
2403
2404 if (equal < 0)
2405 return -1;
2406 if (!equal)
2407 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2408
2409 return 0;
2410 }
2411
2412 int test_product(isl_ctx *ctx)
2413 {
2414 const char *str;
2415 isl_set *set;
2416 int ok;
2417
2418 str = "{ A[i] }";
2419 set = isl_set_read_from_str(ctx, str);
2420 set = isl_set_product(set, isl_set_copy(set));
2421 ok = isl_set_is_wrapping(set);
2422 isl_set_free(set);
2423 if (ok < 0)
2424 return -1;
2425 if (!ok)
2426 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2427
2428 return 0;
2429 }
2430
2431 int test_equal(isl_ctx *ctx)
2432 {
2433 const char *str;
2434 isl_set *set, *set2;
2435 int equal;
2436
2437 str = "{ S_6[i] }";
2438 set = isl_set_read_from_str(ctx, str);
2439 str = "{ S_7[i] }";
2440 set2 = isl_set_read_from_str(ctx, str);
2441 equal = isl_set_is_equal(set, set2);
2442 isl_set_free(set);
2443 isl_set_free(set2);
2444 if (equal < 0)
2445 return -1;
2446 if (equal)
2447 isl_die(ctx, isl_error_unknown, "unexpected result", return -1);
2448
2449 return 0;
2450 }
2451
2452 static int test_plain_fixed(isl_ctx *ctx, __isl_take isl_map *map,
2453 enum isl_dim_type type, unsigned pos, int fixed)
2454 {
2455 int test;
2456
2457 test = isl_map_plain_is_fixed(map, type, pos, NULL);
2458 isl_map_free(map);
2459 if (test < 0)
2460 return -1;
2461 if (test == fixed)
2462 return 0;
2463 if (fixed)
2464 isl_die(ctx, isl_error_unknown,
2465 "map not detected as fixed", return -1);
2466 else
2467 isl_die(ctx, isl_error_unknown,
2468 "map detected as fixed", return -1);
2469 }
2470
2471 int test_fixed(isl_ctx *ctx)
2472 {
2473 const char *str;
2474 isl_map *map;
2475
2476 str = "{ [i] -> [i] }";
2477 map = isl_map_read_from_str(ctx, str);
2478 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 0))
2479 return -1;
2480 str = "{ [i] -> [1] }";
2481 map = isl_map_read_from_str(ctx, str);
2482 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2483 return -1;
2484 str = "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
2485 map = isl_map_read_from_str(ctx, str);
2486 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2487 return -1;
2488 map = isl_map_read_from_str(ctx, str);
2489 map = isl_map_neg(map);
2490 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
2491 return -1;
2492
2493 return 0;
2494 }
2495
2496 int main()
2497 {
2498 struct isl_ctx *ctx;
2499
2500 srcdir = getenv("srcdir");
2501 assert(srcdir);
2502
2503 ctx = isl_ctx_alloc();
2504 if (test_fixed(ctx) < 0)
2505 goto error;
2506 if (test_equal(ctx) < 0)
2507 goto error;
2508 if (test_product(ctx) < 0)
2509 goto error;
2510 if (test_dim_max(ctx) < 0)
2511 goto error;
2512 if (test_aff(ctx) < 0)
2513 goto error;
2514 if (test_injective(ctx) < 0)
2515 goto error;
2516 if (test_schedule(ctx) < 0)
2517 goto error;
2518 test_factorize(ctx);
2519 test_subset(ctx);
2520 test_lift(ctx);
2521 test_bound(ctx);
2522 test_union(ctx);
2523 test_split_periods(ctx);
2524 test_parse(ctx);
2525 test_pwqp(ctx);
2526 test_lex(ctx);
2527 if (test_sv(ctx) < 0)
2528 goto error;
2529 test_bijective(ctx);
2530 test_dep(ctx);
2531 test_read(ctx);
2532 test_bounded(ctx);
2533 test_construction(ctx);
2534 test_dim(ctx);
2535 test_div(ctx);
2536 test_application(ctx);
2537 test_affine_hull(ctx);
2538 test_convex_hull(ctx);
2539 test_gist(ctx);
2540 test_coalesce(ctx);
2541 test_closure(ctx);
2542 test_lexmin(ctx);
2543 isl_ctx_free(ctx);
2544 return 0;
2545 error:
2546 isl_ctx_free(ctx);
2547 return -1;
2548 }
Integer set library