Bug Summary

File:tools/polly/lib/External/isl/isl_test.c
Warning:line 5141, column 12
The left operand of '<' is a garbage value

Annotated Source Code

1/*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 *
7 * Use of this software is governed by the MIT license
8 *
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
15 * B.P. 105 - 78153 Le Chesnay, France
16 */
17
18#include <assert.h>
19#include <stdio.h>
20#include <limits.h>
21#include <isl_ctx_private.h>
22#include <isl_map_private.h>
23#include <isl_aff_private.h>
24#include <isl_space_private.h>
25#include <isl/set.h>
26#include <isl/flow.h>
27#include <isl_constraint_private.h>
28#include <isl/polynomial.h>
29#include <isl/union_set.h>
30#include <isl/union_map.h>
31#include <isl_factorization.h>
32#include <isl/schedule.h>
33#include <isl/schedule_node.h>
34#include <isl_options_private.h>
35#include <isl_vertices_private.h>
36#include <isl/ast_build.h>
37#include <isl/val.h>
38#include <isl/ilp.h>
39#include <isl_ast_build_expr.h>
40#include <isl/options.h>
41
42#include "isl_srcdir.c"
43
44#define ARRAY_SIZE(array)(sizeof(array)/sizeof(*array)) (sizeof(array)/sizeof(*array))
45
46static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) {
47 char *filename;
48 int length;
49 char *pattern = "%s/test_inputs/%s.%s";
50
51 length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name)
52 + strlen(suffix) + 1;
53 filename = isl_alloc_array(ctx, char, length)((char *)isl_malloc_or_die(ctx, (length)*sizeof(char)));
54
55 if (!filename)
56 return NULL((void*)0);
57
58 sprintf(filename, pattern, srcdir, name, suffix);
59
60 return filename;
61}
62
63void test_parse_map(isl_ctx *ctx, const char *str)
64{
65 isl_map *map;
66
67 map = isl_map_read_from_str(ctx, str);
68 assert(map)((map) ? (void) (0) : __assert_fail ("map", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 68, __PRETTY_FUNCTION__))
;
69 isl_map_free(map);
70}
71
72int test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2)
73{
74 isl_map *map, *map2;
75 int equal;
76
77 map = isl_map_read_from_str(ctx, str);
78 map2 = isl_map_read_from_str(ctx, str2);
79 equal = isl_map_is_equal(map, map2);
80 isl_map_free(map);
81 isl_map_free(map2);
82
83 if (equal < 0)
84 return -1;
85 if (!equal)
86 isl_die(ctx, isl_error_unknown, "maps not equal",do { isl_handle_error(ctx, isl_error_unknown, "maps not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 87); return -1; } while (0)
87 return -1)do { isl_handle_error(ctx, isl_error_unknown, "maps not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 87); return -1; } while (0)
;
88
89 return 0;
90}
91
92void test_parse_pwqp(isl_ctx *ctx, const char *str)
93{
94 isl_pw_qpolynomial *pwqp;
95
96 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
97 assert(pwqp)((pwqp) ? (void) (0) : __assert_fail ("pwqp", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 97, __PRETTY_FUNCTION__))
;
98 isl_pw_qpolynomial_free(pwqp);
99}
100
101static void test_parse_pwaff(isl_ctx *ctx, const char *str)
102{
103 isl_pw_aff *pwaff;
104
105 pwaff = isl_pw_aff_read_from_str(ctx, str);
106 assert(pwaff)((pwaff) ? (void) (0) : __assert_fail ("pwaff", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 106, __PRETTY_FUNCTION__))
;
107 isl_pw_aff_free(pwaff);
108}
109
110/* Check that we can read an isl_multi_val from "str" without errors.
111 */
112static int test_parse_multi_val(isl_ctx *ctx, const char *str)
113{
114 isl_multi_val *mv;
115
116 mv = isl_multi_val_read_from_str(ctx, str);
117 isl_multi_val_free(mv);
118
119 return mv ? 0 : -1;
120}
121
122/* Pairs of binary relation representations that should represent
123 * the same binary relations.
124 */
125struct {
126 const char *map1;
127 const char *map2;
128} parse_map_equal_tests[] = {
129 { "{ [x,y] : [([x/2]+y)/3] >= 1 }",
130 "{ [x, y] : 2y >= 6 - x }" },
131 { "{ [x,y] : x <= min(y, 2*y+3) }",
132 "{ [x,y] : x <= y, 2*y + 3 }" },
133 { "{ [x,y] : x >= min(y, 2*y+3) }",
134 "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }" },
135 { "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }",
136 "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }" },
137 { "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }",
138 "{ [i,j] -> [min(i,j)] }" },
139 { "{ [i,j] : i != j }",
140 "{ [i,j] : i < j or i > j }" },
141 { "{ [i,j] : (i+1)*2 >= j }",
142 "{ [i, j] : j <= 2 + 2i }" },
143 { "{ [i] -> [i > 0 ? 4 : 5] }",
144 "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }" },
145 { "[N=2,M] -> { [i=[(M+N)/4]] }",
146 "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }" },
147 { "{ [x] : x >= 0 }",
148 "{ [x] : x-0 >= 0 }" },
149 { "{ [i] : ((i > 10)) }",
150 "{ [i] : i >= 11 }" },
151 { "{ [i] -> [0] }",
152 "{ [i] -> [0 * i] }" },
153 { "{ [a] -> [b] : (not false) }",
154 "{ [a] -> [b] : true }" },
155 { "{ [i] : i/2 <= 5 }",
156 "{ [i] : i <= 10 }" },
157 { "{Sym=[n] [i] : i <= n }",
158 "[n] -> { [i] : i <= n }" },
159 { "{ [*] }",
160 "{ [a] }" },
161 { "{ [i] : 2*floor(i/2) = i }",
162 "{ [i] : exists a : i = 2 a }" },
163 { "{ [a] -> [b] : a = 5 implies b = 5 }",
164 "{ [a] -> [b] : a != 5 or b = 5 }" },
165 { "{ [a] -> [a - 1 : a > 0] }",
166 "{ [a] -> [a - 1] : a > 0 }" },
167 { "{ [a] -> [a - 1 : a > 0; a : a <= 0] }",
168 "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }" },
169 { "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }",
170 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
171 { "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }",
172 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
173 { "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }",
174 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
175 { "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }",
176 "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }" },
177 { "{ [a,b] -> [i,j] : a,b << i,j }",
178 "{ [a,b] -> [i,j] : a < i or (a = i and b < j) }" },
179 { "{ [a,b] -> [i,j] : a,b <<= i,j }",
180 "{ [a,b] -> [i,j] : a < i or (a = i and b <= j) }" },
181 { "{ [a,b] -> [i,j] : a,b >> i,j }",
182 "{ [a,b] -> [i,j] : a > i or (a = i and b > j) }" },
183 { "{ [a,b] -> [i,j] : a,b >>= i,j }",
184 "{ [a,b] -> [i,j] : a > i or (a = i and b >= j) }" },
185 { "{ [n] -> [i] : exists (a, b, c: 8b <= i - 32a and "
186 "8b >= -7 + i - 32 a and b >= 0 and b <= 3 and "
187 "8c < n - 32a and i < n and c >= 0 and "
188 "c <= 3 and c >= -4a) }",
189 "{ [n] -> [i] : 0 <= i < n }" },
190 { "{ [x] -> [] : exists (a, b: 0 <= a <= 1 and 0 <= b <= 3 and "
191 "2b <= x - 8a and 2b >= -1 + x - 8a) }",
192 "{ [x] -> [] : 0 <= x <= 15 }" },
193};
194
195int test_parse(struct isl_ctx *ctx)
196{
197 int i;
198 isl_map *map, *map2;
199 const char *str, *str2;
200
201 if (test_parse_multi_val(ctx, "{ A[B[2] -> C[5, 7]] }") < 0)
202 return -1;
203 if (test_parse_multi_val(ctx, "[n] -> { [2] }") < 0)
204 return -1;
205 if (test_parse_multi_val(ctx, "{ A[4, infty, NaN, -1/2, 2/3] }") < 0)
206 return -1;
207
208 str = "{ [i] -> [-i] }";
209 map = isl_map_read_from_str(ctx, str);
210 assert(map)((map) ? (void) (0) : __assert_fail ("map", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 210, __PRETTY_FUNCTION__))
;
211 isl_map_free(map);
212
213 str = "{ A[i] -> L[([i/3])] }";
214 map = isl_map_read_from_str(ctx, str);
215 assert(map)((map) ? (void) (0) : __assert_fail ("map", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 215, __PRETTY_FUNCTION__))
;
216 isl_map_free(map);
217
218 test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}");
219 test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : "
220 "p1 = 1 && (y1 <= y2 || y2 = 0) }");
221
222 for (i = 0; i < ARRAY_SIZE(parse_map_equal_tests)(sizeof(parse_map_equal_tests)/sizeof(*parse_map_equal_tests)
)
; ++i) {
223 str = parse_map_equal_tests[i].map1;
224 str2 = parse_map_equal_tests[i].map2;
225 if (test_parse_map_equal(ctx, str, str2) < 0)
226 return -1;
227 }
228
229 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
230 map = isl_map_read_from_str(ctx, str);
231 str = "{ [new, old] -> [o0, o1] : "
232 "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: "
233 "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and "
234 "o0 <= 1 and o1 >= 0 and o1 <= 1) }";
235 map2 = isl_map_read_from_str(ctx, str);
236 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 236, __PRETTY_FUNCTION__))
;
237 isl_map_free(map);
238 isl_map_free(map2);
239
240 str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}";
241 map = isl_map_read_from_str(ctx, str);
242 str = "{[new,old] -> [(new+1)%2,(old+1)%2]}";
243 map2 = isl_map_read_from_str(ctx, str);
244 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 244, __PRETTY_FUNCTION__))
;
245 isl_map_free(map);
246 isl_map_free(map2);
247
248 test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }");
249 test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }");
250 test_parse_pwaff(ctx, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }");
251 test_parse_pwqp(ctx, "{ [x] -> ([(x)/2] * [(x)/3]) }");
252 test_parse_pwaff(ctx, "{ [] -> [(100)] }");
253
254 return 0;
255}
256
257static int test_read(isl_ctx *ctx)
258{
259 char *filename;
260 FILE *input;
261 isl_basic_setisl_basic_map *bset1, *bset2;
262 const char *str = "{[y]: Exists ( alpha : 2alpha = y)}";
263 int equal;
264
265 filename = get_filename(ctx, "set", "omega");
266 assert(filename)((filename) ? (void) (0) : __assert_fail ("filename", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 266, __PRETTY_FUNCTION__))
;
267 input = fopen(filename, "r");
268 assert(input)((input) ? (void) (0) : __assert_fail ("input", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 268, __PRETTY_FUNCTION__))
;
269
270 bset1 = isl_basic_set_read_from_file(ctx, input);
271 bset2 = isl_basic_set_read_from_str(ctx, str);
272
273 equal = isl_basic_set_is_equal(bset1, bset2);
274
275 isl_basic_set_free(bset1);
276 isl_basic_set_free(bset2);
277 free(filename);
278
279 fclose(input);
280
281 if (equal < 0)
282 return -1;
283 if (!equal)
284 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "read sets not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 285); return -1; } while (0)
285 "read sets not equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "read sets not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 285); return -1; } while (0)
;
286
287 return 0;
288}
289
290static int test_bounded(isl_ctx *ctx)
291{
292 isl_setisl_map *set;
293 isl_bool bounded;
294
295 set = isl_set_read_from_str(ctx, "[n] -> {[i] : 0 <= i <= n }");
296 bounded = isl_set_is_bounded(set);
297 isl_set_free(set);
298
299 if (bounded < 0)
300 return -1;
301 if (!bounded)
302 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "set not considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 303); return -1; } while (0)
303 "set not considered bounded", return -1)do { isl_handle_error(ctx, isl_error_unknown, "set not considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 303); return -1; } while (0)
;
304
305 set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }");
306 bounded = isl_set_is_bounded(set);
307 assert(!bounded)((!bounded) ? (void) (0) : __assert_fail ("!bounded", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 307, __PRETTY_FUNCTION__))
;
308 isl_set_free(set);
309
310 if (bounded < 0)
311 return -1;
312 if (bounded)
313 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "set considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 314); return -1; } while (0)
314 "set considered bounded", return -1)do { isl_handle_error(ctx, isl_error_unknown, "set considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 314); return -1; } while (0)
;
315
316 set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }");
317 bounded = isl_set_is_bounded(set);
318 isl_set_free(set);
319
320 if (bounded < 0)
321 return -1;
322 if (bounded)
323 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "set considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 324); return -1; } while (0)
324 "set considered bounded", return -1)do { isl_handle_error(ctx, isl_error_unknown, "set considered bounded"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 324); return -1; } while (0)
;
325
326 return 0;
327}
328
329/* Construct the basic set { [i] : 5 <= i <= N } */
330static int test_construction(isl_ctx *ctx)
331{
332 isl_int v;
333 isl_space *dim;
334 isl_local_space *ls;
335 isl_basic_setisl_basic_map *bset;
336 isl_constraint *c;
337
338 isl_int_init(v)isl_sioimath_init((v));
339
340 dim = isl_space_set_alloc(ctx, 1, 1);
341 bset = isl_basic_set_universe(isl_space_copy(dim));
342 ls = isl_local_space_from_space(dim);
343
344 c = isl_constraint_alloc_inequality(isl_local_space_copy(ls));
345 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
346 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
347 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
348 c = isl_constraint_set_coefficient(c, isl_dim_param, 0, v);
349 bset = isl_basic_set_add_constraint(bset, c);
350
351 c = isl_constraint_alloc_inequality(isl_local_space_copy(ls));
352 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
353 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
354 isl_int_set_si(v, -5)isl_sioimath_set_si((v), -5);
355 c = isl_constraint_set_constant(c, v);
356 bset = isl_basic_set_add_constraint(bset, c);
357
358 isl_local_space_free(ls);
359 isl_basic_set_free(bset);
360
361 isl_int_clear(v)isl_sioimath_clear((v));
362
363 return 0;
364}
365
366static int test_dim(isl_ctx *ctx)
367{
368 const char *str;
369 isl_map *map1, *map2;
370 int equal;
371
372 map1 = isl_map_read_from_str(ctx,
373 "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
374 map1 = isl_map_add_dims(map1, isl_dim_in, 1);
375 map2 = isl_map_read_from_str(ctx,
376 "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }");
377 equal = isl_map_is_equal(map1, map2);
378 isl_map_free(map2);
379
380 map1 = isl_map_project_out(map1, isl_dim_in, 0, 1);
381 map2 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : n >= 0 }");
382 if (equal >= 0 && equal)
383 equal = isl_map_is_equal(map1, map2);
384
385 isl_map_free(map1);
386 isl_map_free(map2);
387
388 if (equal < 0)
389 return -1;
390 if (!equal)
391 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 392); return -1; } while (0)
392 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 392); return -1; } while (0)
;
393
394 str = "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }";
395 map1 = isl_map_read_from_str(ctx, str);
396 str = "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }";
397 map2 = isl_map_read_from_str(ctx, str);
398 map1 = isl_map_move_dims(map1, isl_dim_out, 0, isl_dim_param, 0, 1);
399 equal = isl_map_is_equal(map1, map2);
400 isl_map_free(map1);
401 isl_map_free(map2);
402
403 if (equal < 0)
404 return -1;
405 if (!equal)
406 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 407); return -1; } while (0)
407 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 407); return -1; } while (0)
;
408
409 return 0;
410}
411
412struct {
413 __isl_give isl_val *(*op)(__isl_take isl_val *v);
414 const char *arg;
415 const char *res;
416} val_un_tests[] = {
417 { &isl_val_neg, "0", "0" },
418 { &isl_val_abs, "0", "0" },
419 { &isl_val_2exp, "0", "1" },
420 { &isl_val_floor, "0", "0" },
421 { &isl_val_ceil, "0", "0" },
422 { &isl_val_neg, "1", "-1" },
423 { &isl_val_neg, "-1", "1" },
424 { &isl_val_neg, "1/2", "-1/2" },
425 { &isl_val_neg, "-1/2", "1/2" },
426 { &isl_val_neg, "infty", "-infty" },
427 { &isl_val_neg, "-infty", "infty" },
428 { &isl_val_neg, "NaN", "NaN" },
429 { &isl_val_abs, "1", "1" },
430 { &isl_val_abs, "-1", "1" },
431 { &isl_val_abs, "1/2", "1/2" },
432 { &isl_val_abs, "-1/2", "1/2" },
433 { &isl_val_abs, "infty", "infty" },
434 { &isl_val_abs, "-infty", "infty" },
435 { &isl_val_abs, "NaN", "NaN" },
436 { &isl_val_floor, "1", "1" },
437 { &isl_val_floor, "-1", "-1" },
438 { &isl_val_floor, "1/2", "0" },
439 { &isl_val_floor, "-1/2", "-1" },
440 { &isl_val_floor, "infty", "infty" },
441 { &isl_val_floor, "-infty", "-infty" },
442 { &isl_val_floor, "NaN", "NaN" },
443 { &isl_val_ceil, "1", "1" },
444 { &isl_val_ceil, "-1", "-1" },
445 { &isl_val_ceil, "1/2", "1" },
446 { &isl_val_ceil, "-1/2", "0" },
447 { &isl_val_ceil, "infty", "infty" },
448 { &isl_val_ceil, "-infty", "-infty" },
449 { &isl_val_ceil, "NaN", "NaN" },
450 { &isl_val_2exp, "-3", "1/8" },
451 { &isl_val_2exp, "-1", "1/2" },
452 { &isl_val_2exp, "1", "2" },
453 { &isl_val_2exp, "2", "4" },
454 { &isl_val_2exp, "3", "8" },
455 { &isl_val_inv, "1", "1" },
456 { &isl_val_inv, "2", "1/2" },
457 { &isl_val_inv, "1/2", "2" },
458 { &isl_val_inv, "-2", "-1/2" },
459 { &isl_val_inv, "-1/2", "-2" },
460 { &isl_val_inv, "0", "NaN" },
461 { &isl_val_inv, "NaN", "NaN" },
462 { &isl_val_inv, "infty", "0" },
463 { &isl_val_inv, "-infty", "0" },
464};
465
466/* Perform some basic tests of unary operations on isl_val objects.
467 */
468static int test_un_val(isl_ctx *ctx)
469{
470 int i;
471 isl_val *v, *res;
472 __isl_give isl_val *(*fn)(__isl_take isl_val *v);
473 int ok;
474
475 for (i = 0; i < ARRAY_SIZE(val_un_tests)(sizeof(val_un_tests)/sizeof(*val_un_tests)); ++i) {
476 v = isl_val_read_from_str(ctx, val_un_tests[i].arg);
477 res = isl_val_read_from_str(ctx, val_un_tests[i].res);
478 fn = val_un_tests[i].op;
479 v = fn(v);
480 if (isl_val_is_nan(res))
481 ok = isl_val_is_nan(v);
482 else
483 ok = isl_val_eq(v, res);
484 isl_val_free(v);
485 isl_val_free(res);
486 if (ok < 0)
487 return -1;
488 if (!ok)
489 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 490); return -1; } while (0)
490 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 490); return -1; } while (0)
;
491 }
492
493 return 0;
494}
495
496struct {
497 __isl_give isl_val *(*fn)(__isl_take isl_val *v1,
498 __isl_take isl_val *v2);
499} val_bin_op[] = {
500 ['+'] = { &isl_val_add },
501 ['-'] = { &isl_val_sub },
502 ['*'] = { &isl_val_mul },
503 ['/'] = { &isl_val_div },
504 ['g'] = { &isl_val_gcd },
505 ['m'] = { &isl_val_min },
506 ['M'] = { &isl_val_max },
507};
508
509struct {
510 const char *arg1;
511 unsigned char op;
512 const char *arg2;
513 const char *res;
514} val_bin_tests[] = {
515 { "0", '+', "0", "0" },
516 { "1", '+', "0", "1" },
517 { "1", '+', "1", "2" },
518 { "1", '-', "1", "0" },
519 { "1", '*', "1", "1" },
520 { "1", '/', "1", "1" },
521 { "2", '*', "3", "6" },
522 { "2", '*', "1/2", "1" },
523 { "2", '*', "1/3", "2/3" },
524 { "2/3", '*', "3/5", "2/5" },
525 { "2/3", '*', "7/5", "14/15" },
526 { "2", '/', "1/2", "4" },
527 { "-2", '/', "-1/2", "4" },
528 { "-2", '/', "1/2", "-4" },
529 { "2", '/', "-1/2", "-4" },
530 { "2", '/', "2", "1" },
531 { "2", '/', "3", "2/3" },
532 { "2/3", '/', "5/3", "2/5" },
533 { "2/3", '/', "5/7", "14/15" },
534 { "0", '/', "0", "NaN" },
535 { "42", '/', "0", "NaN" },
536 { "-42", '/', "0", "NaN" },
537 { "infty", '/', "0", "NaN" },
538 { "-infty", '/', "0", "NaN" },
539 { "NaN", '/', "0", "NaN" },
540 { "0", '/', "NaN", "NaN" },
541 { "42", '/', "NaN", "NaN" },
542 { "-42", '/', "NaN", "NaN" },
543 { "infty", '/', "NaN", "NaN" },
544 { "-infty", '/', "NaN", "NaN" },
545 { "NaN", '/', "NaN", "NaN" },
546 { "0", '/', "infty", "0" },
547 { "42", '/', "infty", "0" },
548 { "-42", '/', "infty", "0" },
549 { "infty", '/', "infty", "NaN" },
550 { "-infty", '/', "infty", "NaN" },
551 { "NaN", '/', "infty", "NaN" },
552 { "0", '/', "-infty", "0" },
553 { "42", '/', "-infty", "0" },
554 { "-42", '/', "-infty", "0" },
555 { "infty", '/', "-infty", "NaN" },
556 { "-infty", '/', "-infty", "NaN" },
557 { "NaN", '/', "-infty", "NaN" },
558 { "1", '-', "1/3", "2/3" },
559 { "1/3", '+', "1/2", "5/6" },
560 { "1/2", '+', "1/2", "1" },
561 { "3/4", '-', "1/4", "1/2" },
562 { "1/2", '-', "1/3", "1/6" },
563 { "infty", '+', "42", "infty" },
564 { "infty", '+', "infty", "infty" },
565 { "42", '+', "infty", "infty" },
566 { "infty", '-', "infty", "NaN" },
567 { "infty", '*', "infty", "infty" },
568 { "infty", '*', "-infty", "-infty" },
569 { "-infty", '*', "infty", "-infty" },
570 { "-infty", '*', "-infty", "infty" },
571 { "0", '*', "infty", "NaN" },
572 { "1", '*', "infty", "infty" },
573 { "infty", '*', "0", "NaN" },
574 { "infty", '*', "42", "infty" },
575 { "42", '-', "infty", "-infty" },
576 { "infty", '+', "-infty", "NaN" },
577 { "4", 'g', "6", "2" },
578 { "5", 'g', "6", "1" },
579 { "42", 'm', "3", "3" },
580 { "42", 'M', "3", "42" },
581 { "3", 'm', "42", "3" },
582 { "3", 'M', "42", "42" },
583 { "42", 'm', "infty", "42" },
584 { "42", 'M', "infty", "infty" },
585 { "42", 'm', "-infty", "-infty" },
586 { "42", 'M', "-infty", "42" },
587 { "42", 'm', "NaN", "NaN" },
588 { "42", 'M', "NaN", "NaN" },
589 { "infty", 'm', "-infty", "-infty" },
590 { "infty", 'M', "-infty", "infty" },
591};
592
593/* Perform some basic tests of binary operations on isl_val objects.
594 */
595static int test_bin_val(isl_ctx *ctx)
596{
597 int i;
598 isl_val *v1, *v2, *res;
599 __isl_give isl_val *(*fn)(__isl_take isl_val *v1,
600 __isl_take isl_val *v2);
601 int ok;
602
603 for (i = 0; i < ARRAY_SIZE(val_bin_tests)(sizeof(val_bin_tests)/sizeof(*val_bin_tests)); ++i) {
604 v1 = isl_val_read_from_str(ctx, val_bin_tests[i].arg1);
605 v2 = isl_val_read_from_str(ctx, val_bin_tests[i].arg2);
606 res = isl_val_read_from_str(ctx, val_bin_tests[i].res);
607 fn = val_bin_op[val_bin_tests[i].op].fn;
608 v1 = fn(v1, v2);
609 if (isl_val_is_nan(res))
610 ok = isl_val_is_nan(v1);
611 else
612 ok = isl_val_eq(v1, res);
613 isl_val_free(v1);
614 isl_val_free(res);
615 if (ok < 0)
616 return -1;
617 if (!ok)
618 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 619); return -1; } while (0)
619 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 619); return -1; } while (0)
;
620 }
621
622 return 0;
623}
624
625/* Perform some basic tests on isl_val objects.
626 */
627static int test_val(isl_ctx *ctx)
628{
629 if (test_un_val(ctx) < 0)
630 return -1;
631 if (test_bin_val(ctx) < 0)
632 return -1;
633 return 0;
634}
635
636/* Sets described using existentially quantified variables that
637 * can also be described without.
638 */
639static const char *elimination_tests[] = {
640 "{ [i,j] : 2 * [i/2] + 3 * [j/4] <= 10 and 2 i = j }",
641 "{ [m, w] : exists a : w - 2m - 5 <= 3a <= m - 2w }",
642 "{ [m, w] : exists a : w >= 0 and a < m and -1 + w <= a <= 2m - w }",
643};
644
645/* Check that redundant existentially quantified variables are
646 * getting removed.
647 */
648static int test_elimination(isl_ctx *ctx)
649{
650 int i;
651 unsigned n;
652 isl_basic_setisl_basic_map *bset;
653
654 for (i = 0; i < ARRAY_SIZE(elimination_tests)(sizeof(elimination_tests)/sizeof(*elimination_tests)); ++i) {
655 bset = isl_basic_set_read_from_str(ctx, elimination_tests[i]);
656 n = isl_basic_set_dim(bset, isl_dim_div);
657 isl_basic_set_free(bset);
658 if (!bset)
659 return -1;
660 if (n != 0)
661 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expecting no existentials"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 662); return -1; } while (0)
662 "expecting no existentials", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting no existentials"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 662); return -1; } while (0)
;
663 }
664
665 return 0;
666}
667
668static int test_div(isl_ctx *ctx)
669{
670 const char *str;
671 int empty;
672 isl_int v;
673 isl_space *dim;
674 isl_setisl_map *set;
675 isl_local_space *ls;
676 struct isl_basic_setisl_basic_map *bset;
677 struct isl_constraint *c;
678
679 isl_int_init(v)isl_sioimath_init((v));
680
681 /* test 1 */
682 dim = isl_space_set_alloc(ctx, 0, 3);
683 bset = isl_basic_set_universe(isl_space_copy(dim));
684 ls = isl_local_space_from_space(dim);
685
686 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
687 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
688 c = isl_constraint_set_constant(c, v);
689 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
690 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
691 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
692 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
693 bset = isl_basic_set_add_constraint(bset, c);
694
695 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
696 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
697 c = isl_constraint_set_constant(c, v);
698 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
699 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
700 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
701 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
702 bset = isl_basic_set_add_constraint(bset, c);
703
704 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
705
706 assert(bset && bset->n_div == 1)((bset && bset->n_div == 1) ? (void) (0) : __assert_fail
("bset && bset->n_div == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 706, __PRETTY_FUNCTION__))
;
707 isl_local_space_free(ls);
708 isl_basic_set_free(bset);
709
710 /* test 2 */
711 dim = isl_space_set_alloc(ctx, 0, 3);
712 bset = isl_basic_set_universe(isl_space_copy(dim));
713 ls = isl_local_space_from_space(dim);
714
715 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
716 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
717 c = isl_constraint_set_constant(c, v);
718 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
719 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
720 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
721 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
722 bset = isl_basic_set_add_constraint(bset, c);
723
724 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
725 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
726 c = isl_constraint_set_constant(c, v);
727 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
728 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
729 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
730 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
731 bset = isl_basic_set_add_constraint(bset, c);
732
733 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
734
735 assert(bset && bset->n_div == 1)((bset && bset->n_div == 1) ? (void) (0) : __assert_fail
("bset && bset->n_div == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 735, __PRETTY_FUNCTION__))
;
736 isl_local_space_free(ls);
737 isl_basic_set_free(bset);
738
739 /* test 3 */
740 dim = isl_space_set_alloc(ctx, 0, 3);
741 bset = isl_basic_set_universe(isl_space_copy(dim));
742 ls = isl_local_space_from_space(dim);
743
744 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
745 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
746 c = isl_constraint_set_constant(c, v);
747 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
748 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
749 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
750 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
751 bset = isl_basic_set_add_constraint(bset, c);
752
753 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
754 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
755 c = isl_constraint_set_constant(c, v);
756 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
757 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
758 isl_int_set_si(v, 4)isl_sioimath_set_si((v), 4);
759 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
760 bset = isl_basic_set_add_constraint(bset, c);
761
762 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
763
764 assert(bset && bset->n_div == 1)((bset && bset->n_div == 1) ? (void) (0) : __assert_fail
("bset && bset->n_div == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 764, __PRETTY_FUNCTION__))
;
765 isl_local_space_free(ls);
766 isl_basic_set_free(bset);
767
768 /* test 4 */
769 dim = isl_space_set_alloc(ctx, 0, 3);
770 bset = isl_basic_set_universe(isl_space_copy(dim));
771 ls = isl_local_space_from_space(dim);
772
773 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
774 isl_int_set_si(v, 2)isl_sioimath_set_si((v), 2);
775 c = isl_constraint_set_constant(c, v);
776 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
777 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
778 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
779 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
780 bset = isl_basic_set_add_constraint(bset, c);
781
782 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
783 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
784 c = isl_constraint_set_constant(c, v);
785 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
786 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
787 isl_int_set_si(v, 6)isl_sioimath_set_si((v), 6);
788 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
789 bset = isl_basic_set_add_constraint(bset, c);
790
791 bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2);
792
793 assert(isl_basic_set_is_empty(bset))((isl_basic_set_is_empty(bset)) ? (void) (0) : __assert_fail (
"isl_basic_set_is_empty(bset)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 793, __PRETTY_FUNCTION__))
;
794 isl_local_space_free(ls);
795 isl_basic_set_free(bset);
796
797 /* test 5 */
798 dim = isl_space_set_alloc(ctx, 0, 3);
799 bset = isl_basic_set_universe(isl_space_copy(dim));
800 ls = isl_local_space_from_space(dim);
801
802 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
803 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
804 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
805 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
806 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
807 bset = isl_basic_set_add_constraint(bset, c);
808
809 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
810 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
811 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
812 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
813 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
814 bset = isl_basic_set_add_constraint(bset, c);
815
816 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
817
818 assert(bset && bset->n_div == 0)((bset && bset->n_div == 0) ? (void) (0) : __assert_fail
("bset && bset->n_div == 0", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 818, __PRETTY_FUNCTION__))
;
819 isl_basic_set_free(bset);
820 isl_local_space_free(ls);
821
822 /* test 6 */
823 dim = isl_space_set_alloc(ctx, 0, 3);
824 bset = isl_basic_set_universe(isl_space_copy(dim));
825 ls = isl_local_space_from_space(dim);
826
827 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
828 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
829 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
830 isl_int_set_si(v, 6)isl_sioimath_set_si((v), 6);
831 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
832 bset = isl_basic_set_add_constraint(bset, c);
833
834 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
835 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
836 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
837 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
838 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
839 bset = isl_basic_set_add_constraint(bset, c);
840
841 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
842
843 assert(bset && bset->n_div == 1)((bset && bset->n_div == 1) ? (void) (0) : __assert_fail
("bset && bset->n_div == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 843, __PRETTY_FUNCTION__))
;
844 isl_basic_set_free(bset);
845 isl_local_space_free(ls);
846
847 /* test 7 */
848 /* This test is a bit tricky. We set up an equality
849 * a + 3b + 3c = 6 e0
850 * Normalization of divs creates _two_ divs
851 * a = 3 e0
852 * c - b - e0 = 2 e1
853 * Afterwards e0 is removed again because it has coefficient -1
854 * and we end up with the original equality and div again.
855 * Perhaps we can avoid the introduction of this temporary div.
856 */
857 dim = isl_space_set_alloc(ctx, 0, 4);
858 bset = isl_basic_set_universe(isl_space_copy(dim));
859 ls = isl_local_space_from_space(dim);
860
861 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
862 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
863 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
864 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
865 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
866 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
867 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
868 isl_int_set_si(v, 6)isl_sioimath_set_si((v), 6);
869 c = isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
870 bset = isl_basic_set_add_constraint(bset, c);
871
872 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
873
874 /* Test disabled for now */
875 /*
876 assert(bset && bset->n_div == 1);
877 */
878 isl_local_space_free(ls);
879 isl_basic_set_free(bset);
880
881 /* test 8 */
882 dim = isl_space_set_alloc(ctx, 0, 5);
883 bset = isl_basic_set_universe(isl_space_copy(dim));
884 ls = isl_local_space_from_space(dim);
885
886 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
887 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
888 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
889 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
890 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
891 isl_int_set_si(v, -3)isl_sioimath_set_si((v), -3);
892 c = isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
893 isl_int_set_si(v, 6)isl_sioimath_set_si((v), 6);
894 c = isl_constraint_set_coefficient(c, isl_dim_set, 4, v);
895 bset = isl_basic_set_add_constraint(bset, c);
896
897 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
898 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
899 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
900 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
901 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
902 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
903 c = isl_constraint_set_constant(c, v);
904 bset = isl_basic_set_add_constraint(bset, c);
905
906 bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1);
907
908 /* Test disabled for now */
909 /*
910 assert(bset && bset->n_div == 1);
911 */
912 isl_local_space_free(ls);
913 isl_basic_set_free(bset);
914
915 /* test 9 */
916 dim = isl_space_set_alloc(ctx, 0, 4);
917 bset = isl_basic_set_universe(isl_space_copy(dim));
918 ls = isl_local_space_from_space(dim);
919
920 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
921 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
922 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
923 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
924 c = isl_constraint_set_coefficient(c, isl_dim_set, 1, v);
925 isl_int_set_si(v, -2)isl_sioimath_set_si((v), -2);
926 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
927 bset = isl_basic_set_add_constraint(bset, c);
928
929 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
930 isl_int_set_si(v, -1)isl_sioimath_set_si((v), -1);
931 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
932 isl_int_set_si(v, 3)isl_sioimath_set_si((v), 3);
933 c = isl_constraint_set_coefficient(c, isl_dim_set, 3, v);
934 isl_int_set_si(v, 2)isl_sioimath_set_si((v), 2);
935 c = isl_constraint_set_constant(c, v);
936 bset = isl_basic_set_add_constraint(bset, c);
937
938 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2);
939
940 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
941
942 assert(!isl_basic_set_is_empty(bset))((!isl_basic_set_is_empty(bset)) ? (void) (0) : __assert_fail
("!isl_basic_set_is_empty(bset)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 942, __PRETTY_FUNCTION__))
;
943
944 isl_local_space_free(ls);
945 isl_basic_set_free(bset);
946
947 /* test 10 */
948 dim = isl_space_set_alloc(ctx, 0, 3);
949 bset = isl_basic_set_universe(isl_space_copy(dim));
950 ls = isl_local_space_from_space(dim);
951
952 c = isl_constraint_alloc_equality(isl_local_space_copy(ls));
953 isl_int_set_si(v, 1)isl_sioimath_set_si((v), 1);
954 c = isl_constraint_set_coefficient(c, isl_dim_set, 0, v);
955 isl_int_set_si(v, -2)isl_sioimath_set_si((v), -2);
956 c = isl_constraint_set_coefficient(c, isl_dim_set, 2, v);
957 bset = isl_basic_set_add_constraint(bset, c);
958
959 bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1);
960
961 bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2);
962
963 isl_local_space_free(ls);
964 isl_basic_set_free(bset);
965
966 isl_int_clear(v)isl_sioimath_clear((v));
967
968 str = "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and "
969 "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }";
970 set = isl_set_read_from_str(ctx, str);
971 set = isl_set_compute_divs(set);
972 isl_set_free(set);
973 if (!set)
974 return -1;
975
976 if (test_elimination(ctx) < 0)
977 return -1;
978
979 str = "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }";
980 set = isl_set_read_from_str(ctx, str);
981 set = isl_set_remove_divs_involving_dims(set, isl_dim_set, 0, 2);
982 set = isl_set_fix_si(set, isl_dim_set, 2, -3);
983 empty = isl_set_is_empty(set);
984 isl_set_free(set);
985 if (empty < 0)
986 return -1;
987 if (!empty)
988 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "result not as accurate as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 989); return -1; } while (0)
989 "result not as accurate as expected", return -1)do { isl_handle_error(ctx, isl_error_unknown, "result not as accurate as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 989); return -1; } while (0)
;
990
991 return 0;
992}
993
994void test_application_case(struct isl_ctx *ctx, const char *name)
995{
996 char *filename;
997 FILE *input;
998 struct isl_basic_setisl_basic_map *bset1, *bset2;
999 struct isl_basic_map *bmap;
1000
1001 filename = get_filename(ctx, name, "omega");
1002 assert(filename)((filename) ? (void) (0) : __assert_fail ("filename", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1002, __PRETTY_FUNCTION__))
;
1003 input = fopen(filename, "r");
1004 assert(input)((input) ? (void) (0) : __assert_fail ("input", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1004, __PRETTY_FUNCTION__))
;
1005
1006 bset1 = isl_basic_set_read_from_file(ctx, input);
1007 bmap = isl_basic_map_read_from_file(ctx, input);
1008
1009 bset1 = isl_basic_set_apply(bset1, bmap);
1010
1011 bset2 = isl_basic_set_read_from_file(ctx, input);
1012
1013 assert(isl_basic_set_is_equal(bset1, bset2) == 1)((isl_basic_set_is_equal(bset1, bset2) == 1) ? (void) (0) : __assert_fail
("isl_basic_set_is_equal(bset1, bset2) == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1013, __PRETTY_FUNCTION__))
;
1014
1015 isl_basic_set_free(bset1);
1016 isl_basic_set_free(bset2);
1017 free(filename);
1018
1019 fclose(input);
1020}
1021
1022static int test_application(isl_ctx *ctx)
1023{
1024 test_application_case(ctx, "application");
1025 test_application_case(ctx, "application2");
1026
1027 return 0;
1028}
1029
1030void test_affine_hull_case(struct isl_ctx *ctx, const char *name)
1031{
1032 char *filename;
1033 FILE *input;
1034 struct isl_basic_setisl_basic_map *bset1, *bset2;
1035
1036 filename = get_filename(ctx, name, "polylib");
1037 assert(filename)((filename) ? (void) (0) : __assert_fail ("filename", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1037, __PRETTY_FUNCTION__))
;
1038 input = fopen(filename, "r");
1039 assert(input)((input) ? (void) (0) : __assert_fail ("input", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1039, __PRETTY_FUNCTION__))
;
1040
1041 bset1 = isl_basic_set_read_from_file(ctx, input);
1042 bset2 = isl_basic_set_read_from_file(ctx, input);
1043
1044 bset1 = isl_basic_set_affine_hull(bset1);
1045
1046 assert(isl_basic_set_is_equal(bset1, bset2) == 1)((isl_basic_set_is_equal(bset1, bset2) == 1) ? (void) (0) : __assert_fail
("isl_basic_set_is_equal(bset1, bset2) == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1046, __PRETTY_FUNCTION__))
;
1047
1048 isl_basic_set_free(bset1);
1049 isl_basic_set_free(bset2);
1050 free(filename);
1051
1052 fclose(input);
1053}
1054
1055int test_affine_hull(struct isl_ctx *ctx)
1056{
1057 const char *str;
1058 isl_setisl_map *set;
1059 isl_basic_setisl_basic_map *bset, *bset2;
1060 int n;
1061 int subset;
1062
1063 test_affine_hull_case(ctx, "affine2");
1064 test_affine_hull_case(ctx, "affine");
1065 test_affine_hull_case(ctx, "affine3");
1066
1067 str = "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and "
1068 "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and "
1069 "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and "
1070 "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }";
1071 set = isl_set_read_from_str(ctx, str);
1072 bset = isl_set_affine_hull(set);
1073 n = isl_basic_set_dim(bset, isl_dim_div);
1074 isl_basic_set_free(bset);
1075 if (n != 0)
1076 isl_die(ctx, isl_error_unknown, "not expecting any divs",do { isl_handle_error(ctx, isl_error_unknown, "not expecting any divs"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1077); return -1; } while (0)
1077 return -1)do { isl_handle_error(ctx, isl_error_unknown, "not expecting any divs"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1077); return -1; } while (0)
;
1078
1079 /* Check that isl_map_affine_hull is not confused by
1080 * the reordering of divs in isl_map_align_divs.
1081 */
1082 str = "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: "
1083 "32e0 = b and 32e1 = c); "
1084 "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }";
1085 set = isl_set_read_from_str(ctx, str);
1086 bset = isl_set_affine_hull(set);
1087 isl_basic_set_free(bset);
1088 if (!bset)
1089 return -1;
1090
1091 str = "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and "
1092 "32e2 = 31 + 31e0 }";
1093 set = isl_set_read_from_str(ctx, str);
1094 bset = isl_set_affine_hull(set);
1095 str = "{ [a] : exists e : a = 32 e }";
1096 bset2 = isl_basic_set_read_from_str(ctx, str);
1097 subset = isl_basic_set_is_subset(bset, bset2);
1098 isl_basic_set_free(bset);
1099 isl_basic_set_free(bset2);
1100 if (subset < 0)
1101 return -1;
1102 if (!subset)
1103 isl_die(ctx, isl_error_unknown, "not as accurate as expected",do { isl_handle_error(ctx, isl_error_unknown, "not as accurate as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1104); return -1; } while (0)
1104 return -1)do { isl_handle_error(ctx, isl_error_unknown, "not as accurate as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1104); return -1; } while (0)
;
1105
1106 return 0;
1107}
1108
1109/* Pairs of maps and the corresponding expected results of
1110 * isl_map_plain_unshifted_simple_hull.
1111 */
1112struct {
1113 const char *map;
1114 const char *hull;
1115} plain_unshifted_simple_hull_tests[] = {
1116 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1117 "{ [i] -> [j] : i >= 1 }" },
1118 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1119 "(j mod 4 = 2 and k mod 6 = n) }",
1120 "{ [n] -> [i,j,k] : j mod 4 = 2 }" },
1121};
1122
1123/* Basic tests for isl_map_plain_unshifted_simple_hull.
1124 */
1125static int test_plain_unshifted_simple_hull(isl_ctx *ctx)
1126{
1127 int i;
1128 isl_map *map;
1129 isl_basic_map *hull, *expected;
1130 isl_bool equal;
1131
1132 for (i = 0; i < ARRAY_SIZE(plain_unshifted_simple_hull_tests)(sizeof(plain_unshifted_simple_hull_tests)/sizeof(*plain_unshifted_simple_hull_tests
))
; ++i) {
1133 const char *str;
1134 str = plain_unshifted_simple_hull_tests[i].map;
1135 map = isl_map_read_from_str(ctx, str);
1136 str = plain_unshifted_simple_hull_tests[i].hull;
1137 expected = isl_basic_map_read_from_str(ctx, str);
1138 hull = isl_map_plain_unshifted_simple_hull(map);
1139 equal = isl_basic_map_is_equal(hull, expected);
1140 isl_basic_map_free(hull);
1141 isl_basic_map_free(expected);
1142 if (equal < 0)
1143 return -1;
1144 if (!equal)
1145 isl_die(ctx, isl_error_unknown, "unexpected hull",do { isl_handle_error(ctx, isl_error_unknown, "unexpected hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1146); return -1; } while (0)
1146 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1146); return -1; } while (0)
;
1147 }
1148
1149 return 0;
1150}
1151
1152/* Pairs of sets and the corresponding expected results of
1153 * isl_set_unshifted_simple_hull.
1154 */
1155struct {
1156 const char *set;
1157 const char *hull;
1158} unshifted_simple_hull_tests[] = {
1159 { "{ [0,x,y] : x <= -1; [1,x,y] : x <= y <= -x; [2,x,y] : x <= 1 }",
1160 "{ [t,x,y] : 0 <= t <= 2 and x <= 1 }" },
1161};
1162
1163/* Basic tests for isl_set_unshifted_simple_hull.
1164 */
1165static int test_unshifted_simple_hull(isl_ctx *ctx)
1166{
1167 int i;
1168 isl_setisl_map *set;
1169 isl_basic_setisl_basic_map *hull, *expected;
1170 isl_bool equal;
1171
1172 for (i = 0; i < ARRAY_SIZE(unshifted_simple_hull_tests)(sizeof(unshifted_simple_hull_tests)/sizeof(*unshifted_simple_hull_tests
))
; ++i) {
1173 const char *str;
1174 str = unshifted_simple_hull_tests[i].set;
1175 set = isl_set_read_from_str(ctx, str);
1176 str = unshifted_simple_hull_tests[i].hull;
1177 expected = isl_basic_set_read_from_str(ctx, str);
1178 hull = isl_set_unshifted_simple_hull(set);
1179 equal = isl_basic_set_is_equal(hull, expected);
1180 isl_basic_set_free(hull);
1181 isl_basic_set_free(expected);
1182 if (equal < 0)
1183 return -1;
1184 if (!equal)
1185 isl_die(ctx, isl_error_unknown, "unexpected hull",do { isl_handle_error(ctx, isl_error_unknown, "unexpected hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1186); return -1; } while (0)
1186 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1186); return -1; } while (0)
;
1187 }
1188
1189 return 0;
1190}
1191
1192static int test_simple_hull(struct isl_ctx *ctx)
1193{
1194 const char *str;
1195 isl_setisl_map *set;
1196 isl_basic_setisl_basic_map *bset;
1197 isl_bool is_empty;
1198
1199 str = "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x;"
1200 "[y, x] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }";
1201 set = isl_set_read_from_str(ctx, str);
1202 bset = isl_set_simple_hull(set);
1203 is_empty = isl_basic_set_is_empty(bset);
1204 isl_basic_set_free(bset);
1205
1206 if (is_empty == isl_bool_error)
1207 return -1;
1208
1209 if (is_empty == isl_bool_false)
1210 isl_die(ctx, isl_error_unknown, "Empty set should be detected",do { isl_handle_error(ctx, isl_error_unknown, "Empty set should be detected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1211); return -1; } while (0)
1211 return -1)do { isl_handle_error(ctx, isl_error_unknown, "Empty set should be detected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1211); return -1; } while (0)
;
1212
1213 if (test_plain_unshifted_simple_hull(ctx) < 0)
1214 return -1;
1215 if (test_unshifted_simple_hull(ctx) < 0)
1216 return -1;
1217
1218 return 0;
1219}
1220
1221void test_convex_hull_case(struct isl_ctx *ctx, const char *name)
1222{
1223 char *filename;
1224 FILE *input;
1225 struct isl_basic_setisl_basic_map *bset1, *bset2;
1226 struct isl_setisl_map *set;
1227
1228 filename = get_filename(ctx, name, "polylib");
1229 assert(filename)((filename) ? (void) (0) : __assert_fail ("filename", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1229, __PRETTY_FUNCTION__))
;
1230 input = fopen(filename, "r");
1231 assert(input)((input) ? (void) (0) : __assert_fail ("input", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1231, __PRETTY_FUNCTION__))
;
1232
1233 bset1 = isl_basic_set_read_from_file(ctx, input);
1234 bset2 = isl_basic_set_read_from_file(ctx, input);
1235
1236 set = isl_basic_set_union(bset1, bset2);
1237 bset1 = isl_set_convex_hull(set);
1238
1239 bset2 = isl_basic_set_read_from_file(ctx, input);
1240
1241 assert(isl_basic_set_is_equal(bset1, bset2) == 1)((isl_basic_set_is_equal(bset1, bset2) == 1) ? (void) (0) : __assert_fail
("isl_basic_set_is_equal(bset1, bset2) == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1241, __PRETTY_FUNCTION__))
;
1242
1243 isl_basic_set_free(bset1);
1244 isl_basic_set_free(bset2);
1245 free(filename);
1246
1247 fclose(input);
1248}
1249
1250struct {
1251 const char *set;
1252 const char *hull;
1253} convex_hull_tests[] = {
1254 { "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or "
1255 "(i0 = 1 and i1 = 0 and i2 = 1) or "
1256 "(i0 = 0 and i1 = 0 and i2 = 0) }",
1257 "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" },
1258 { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; "
1259 "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and "
1260 "i2 <= 5 and i2 >= 4; "
1261 "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }",
1262 "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and "
1263 "i2 <= 5 + i0 and i2 >= i0 }" },
1264 { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }",
1265 "{ [x, y] : 1 = 0 }" },
1266 { "{ [x, y, z] : 0 <= x, y, z <= 10; [x, y, 0] : x >= 0 and y > 0; "
1267 "[x, y, 0] : x >= 0 and y < 0 }",
1268 "{ [x, y, z] : x >= 0 and 0 <= z <= 10 }" },
1269};
1270
1271static int test_convex_hull_algo(isl_ctx *ctx, int convex)
1272{
1273 int i;
1274 int orig_convex = ctx->opt->convex;
1275 ctx->opt->convex = convex;
1276
1277 test_convex_hull_case(ctx, "convex0");
1278 test_convex_hull_case(ctx, "convex1");
1279 test_convex_hull_case(ctx, "convex2");
1280 test_convex_hull_case(ctx, "convex3");
1281 test_convex_hull_case(ctx, "convex4");
1282 test_convex_hull_case(ctx, "convex5");
1283 test_convex_hull_case(ctx, "convex6");
1284 test_convex_hull_case(ctx, "convex7");
1285 test_convex_hull_case(ctx, "convex8");
1286 test_convex_hull_case(ctx, "convex9");
1287 test_convex_hull_case(ctx, "convex10");
1288 test_convex_hull_case(ctx, "convex11");
1289 test_convex_hull_case(ctx, "convex12");
1290 test_convex_hull_case(ctx, "convex13");
1291 test_convex_hull_case(ctx, "convex14");
1292 test_convex_hull_case(ctx, "convex15");
1293
1294 for (i = 0; i < ARRAY_SIZE(convex_hull_tests)(sizeof(convex_hull_tests)/sizeof(*convex_hull_tests)); ++i) {
1295 isl_setisl_map *set1, *set2;
1296 int equal;
1297
1298 set1 = isl_set_read_from_str(ctx, convex_hull_tests[i].set);
1299 set2 = isl_set_read_from_str(ctx, convex_hull_tests[i].hull);
1300 set1 = isl_set_from_basic_set(isl_set_convex_hull(set1));
1301 equal = isl_set_is_equal(set1, set2);
1302 isl_set_free(set1);
1303 isl_set_free(set2);
1304
1305 if (equal < 0)
1306 return -1;
1307 if (!equal)
1308 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected convex hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1309); return -1; } while (0)
1309 "unexpected convex hull", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected convex hull"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1309); return -1; } while (0)
;
1310 }
1311
1312 ctx->opt->convex = orig_convex;
1313
1314 return 0;
1315}
1316
1317static int test_convex_hull(isl_ctx *ctx)
1318{
1319 if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM1) < 0)
1320 return -1;
1321 if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP0) < 0)
1322 return -1;
1323 return 0;
1324}
1325
1326void test_gist_case(struct isl_ctx *ctx, const char *name)
1327{
1328 char *filename;
1329 FILE *input;
1330 struct isl_basic_setisl_basic_map *bset1, *bset2;
1331
1332 filename = get_filename(ctx, name, "polylib");
1333 assert(filename)((filename) ? (void) (0) : __assert_fail ("filename", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1333, __PRETTY_FUNCTION__))
;
1334 input = fopen(filename, "r");
1335 assert(input)((input) ? (void) (0) : __assert_fail ("input", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1335, __PRETTY_FUNCTION__))
;
1336
1337 bset1 = isl_basic_set_read_from_file(ctx, input);
1338 bset2 = isl_basic_set_read_from_file(ctx, input);
1339
1340 bset1 = isl_basic_set_gist(bset1, bset2);
1341
1342 bset2 = isl_basic_set_read_from_file(ctx, input);
1343
1344 assert(isl_basic_set_is_equal(bset1, bset2) == 1)((isl_basic_set_is_equal(bset1, bset2) == 1) ? (void) (0) : __assert_fail
("isl_basic_set_is_equal(bset1, bset2) == 1", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1344, __PRETTY_FUNCTION__))
;
1345
1346 isl_basic_set_free(bset1);
1347 isl_basic_set_free(bset2);
1348 free(filename);
1349
1350 fclose(input);
1351}
1352
1353/* Inputs to isl_map_plain_gist_basic_map, along with the expected output.
1354 */
1355struct {
1356 const char *map;
1357 const char *context;
1358 const char *gist;
1359} plain_gist_tests[] = {
1360 { "{ [i] -> [j] : i >= 1 and j >= 1 or i >= 2 and j <= 10 }",
1361 "{ [i] -> [j] : i >= 1 }",
1362 "{ [i] -> [j] : j >= 1 or i >= 2 and j <= 10 }" },
1363 { "{ [n] -> [i,j,k] : (i mod 3 = 2 and j mod 4 = 2) or "
1364 "(j mod 4 = 2 and k mod 6 = n) }",
1365 "{ [n] -> [i,j,k] : j mod 4 = 2 }",
1366 "{ [n] -> [i,j,k] : (i mod 3 = 2) or (k mod 6 = n) }" },
1367 { "{ [i] -> [j] : i > j and (exists a,b : i <= 2a + 5b <= 2) }",
1368 "{ [i] -> [j] : i > j }",
1369 "{ [i] -> [j] : exists a,b : i <= 2a + 5b <= 2 }" },
1370};
1371
1372/* Basic tests for isl_map_plain_gist_basic_map.
1373 */
1374static int test_plain_gist(isl_ctx *ctx)
1375{
1376 int i;
1377
1378 for (i = 0; i < ARRAY_SIZE(plain_gist_tests)(sizeof(plain_gist_tests)/sizeof(*plain_gist_tests)); ++i) {
1379 const char *str;
1380 int equal;
1381 isl_map *map, *gist;
1382 isl_basic_map *context;
1383
1384 map = isl_map_read_from_str(ctx, plain_gist_tests[i].map);
1385 str = plain_gist_tests[i].context;
1386 context = isl_basic_map_read_from_str(ctx, str);
1387 map = isl_map_plain_gist_basic_map(map, context);
1388 gist = isl_map_read_from_str(ctx, plain_gist_tests[i].gist);
1389 equal = isl_map_is_equal(map, gist);
1390 isl_map_free(map);
1391 isl_map_free(gist);
1392 if (equal < 0)
1393 return -1;
1394 if (!equal)
1395 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect gist result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1396); return -1; } while (0)
1396 "incorrect gist result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect gist result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1396); return -1; } while (0)
;
1397 }
1398
1399 return 0;
1400}
1401
1402struct {
1403 const char *set;
1404 const char *context;
1405 const char *gist;
1406} gist_tests[] = {
1407 { "{ [a, b, c] : a <= 15 and a >= 1 }",
1408 "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and "
1409 "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }",
1410 "{ [a, b, c] : a <= 15 }" },
1411 { "{ : }", "{ : 1 = 0 }", "{ : }" },
1412 { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" },
1413 { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }",
1414 "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" },
1415 { "{ [m, n, a, b] : a <= 2147 + n }",
1416 "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and "
1417 "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or "
1418 "(n >= 1 and a >= 0 and b <= 2148 - n - a and "
1419 "b >= 0) }",
1420 "{ [m, n, ku, kl] }" },
1421 { "{ [a, a, b] : a >= 10 }",
1422 "{ [a, b, c] : c >= a and c <= b and c >= 2 }",
1423 "{ [a, a, b] : a >= 10 }" },
1424 { "{ [i, j] : i >= 0 and i + j >= 0 }", "{ [i, j] : i <= 0 }",
1425 "{ [0, j] : j >= 0 }" },
1426 /* Check that no constraints on i6 are introduced in the gist */
1427 { "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1428 "20e0 <= 1530 - 4t1 - 5i4 and 20e0 >= 1511 - 4t1 - 5i4 and "
1429 "5e0 <= 381 - t1 and i4 <= 1) }",
1430 "[t1] -> { [i4, i6] : exists (e0 = floor((-t1 + i6)/5): "
1431 "5e0 = -t1 + i6 and i6 <= 6 and i6 >= 3) }",
1432 "[t1] -> { [i4, i6] : exists (e0 = floor((1530 - 4t1 - 5i4)/20): "
1433 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 <= 1530 - 4t1 - 5i4 and "
1434 "20e0 >= 1511 - 4t1 - 5i4) }" },
1435 /* Check that no constraints on i6 are introduced in the gist */
1436 { "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((1 + i4)/2), "
1437 "e1 = floor((1530 - 4t1 - 5i4)/20), "
1438 "e2 = floor((-4t1 - 5i4 + 10*floor((1 + i4)/2))/20), "
1439 "e3 = floor((-1 + i4)/2): t2 = 0 and 2e3 = -1 + i4 and "
1440 "20e2 >= -19 - 4t1 - 5i4 + 10e0 and 5e2 <= 1 - t1 and "
1441 "2e0 <= 1 + i4 and 2e0 >= i4 and "
1442 "20e1 <= 1530 - 4t1 - 5i4 and "
1443 "20e1 >= 1511 - 4t1 - 5i4 and i4 <= 1 and "
1444 "5e1 <= 381 - t1 and 20e2 <= -4t1 - 5i4 + 10e0) }",
1445 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((-17 + i4)/2), "
1446 "e1 = floor((-t1 + i6)/5): 5e1 = -t1 + i6 and "
1447 "2e0 <= -17 + i4 and 2e0 >= -18 + i4 and "
1448 "10e0 <= -91 + 5i4 + 4i6 and "
1449 "10e0 >= -105 + 5i4 + 4i6) }",
1450 "[t1, t2] -> { [i4, i5, i6] : exists (e0 = floor((381 - t1)/5), "
1451 "e1 = floor((-1 + i4)/2): t2 = 0 and 2e1 = -1 + i4 and "
1452 "i4 <= 1 and 5e0 <= 381 - t1 and 20e0 >= 1511 - 4t1 - 5i4) }" },
1453 { "{ [0, 0, q, p] : -5 <= q <= 5 and p >= 0 }",
1454 "{ [a, b, q, p] : b >= 1 + a }",
1455 "{ [a, b, q, p] : false }" },
1456 { "[n] -> { [x] : x = n && x mod 32 = 0 }",
1457 "[n] -> { [x] : x mod 32 = 0 }",
1458 "[n] -> { [x = n] }" },
1459 { "{ [x] : x mod 6 = 0 }", "{ [x] : x mod 3 = 0 }",
1460 "{ [x] : x mod 2 = 0 }" },
1461 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10000 = 0 }",
1462 "{ [x] : x mod 128 = 0 }" },
1463 { "{ [x] : x mod 3200 = 0 }", "{ [x] : x mod 10 = 0 }",
1464 "{ [x] : x mod 3200 = 0 }" },
1465 { "{ [a, b, c] : a mod 2 = 0 and a = c }",
1466 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1467 "{ [a, b, c = a] }" },
1468 { "{ [a, b, c] : a mod 6 = 0 and a = c }",
1469 "{ [a, b, c] : b mod 2 = 0 and b = c }",
1470 "{ [a, b, c = a] : a mod 3 = 0 }" },
1471 { "{ [x] : 0 <= x <= 4 or 6 <= x <= 9 }",
1472 "{ [x] : 1 <= x <= 3 or 7 <= x <= 8 }",
1473 "{ [x] }" },
1474 { "{ [x,y] : x < 0 and 0 <= y <= 4 or x >= -2 and -x <= y <= 10 + x }",
1475 "{ [x,y] : 1 <= y <= 3 }",
1476 "{ [x,y] }" },
1477};
1478
1479/* Check that isl_set_gist behaves as expected.
1480 *
1481 * For the test cases in gist_tests, besides checking that the result
1482 * is as expected, also check that applying the gist operation does
1483 * not modify the input set (an earlier version of isl would do that) and
1484 * that the test case is consistent, i.e., that the gist has the same
1485 * intersection with the context as the input set.
1486 */
1487static int test_gist(struct isl_ctx *ctx)
1488{
1489 int i;
1490 const char *str;
1491 isl_basic_setisl_basic_map *bset1, *bset2;
1492 isl_map *map1, *map2;
1493 int equal;
1494
1495 for (i = 0; i < ARRAY_SIZE(gist_tests)(sizeof(gist_tests)/sizeof(*gist_tests)); ++i) {
1496 int equal_input, equal_intersection;
1497 isl_setisl_map *set1, *set2, *copy, *context;
1498
1499 set1 = isl_set_read_from_str(ctx, gist_tests[i].set);
1500 context = isl_set_read_from_str(ctx, gist_tests[i].context);
1501 copy = isl_set_copy(set1);
1502 set1 = isl_set_gist(set1, isl_set_copy(context));
1503 set2 = isl_set_read_from_str(ctx, gist_tests[i].gist);
1504 equal = isl_set_is_equal(set1, set2);
1505 isl_set_free(set1);
1506 set1 = isl_set_read_from_str(ctx, gist_tests[i].set);
1507 equal_input = isl_set_is_equal(set1, copy);
1508 isl_set_free(copy);
1509 set1 = isl_set_intersect(set1, isl_set_copy(context));
1510 set2 = isl_set_intersect(set2, context);
1511 equal_intersection = isl_set_is_equal(set1, set2);
1512 isl_set_free(set2);
1513 isl_set_free(set1);
1514 if (equal < 0 || equal_input < 0 || equal_intersection < 0)
1515 return -1;
1516 if (!equal)
1517 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect gist result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1518); return -1; } while (0)
1518 "incorrect gist result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect gist result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1518); return -1; } while (0)
;
1519 if (!equal_input)
1520 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "gist modified input"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1521); return -1; } while (0)
1521 "gist modified input", return -1)do { isl_handle_error(ctx, isl_error_unknown, "gist modified input"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1521); return -1; } while (0)
;
1522 if (!equal_input)
1523 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "inconsistent gist test case"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1524); return -1; } while (0)
1524 "inconsistent gist test case", return -1)do { isl_handle_error(ctx, isl_error_unknown, "inconsistent gist test case"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1524); return -1; } while (0)
;
1525 }
1526
1527 test_gist_case(ctx, "gist1");
1528
1529 str = "[p0, p2, p3, p5, p6, p10] -> { [] : "
1530 "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], "
1531 "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], "
1532 "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and "
1533 "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and "
1534 "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and "
1535 "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and "
1536 "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and "
1537 "p10 <= 15 and p10 <= -1 + p0 - p6) }";
1538 bset1 = isl_basic_set_read_from_str(ctx, str);
1539 str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], "
1540 "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], "
1541 "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and "
1542 "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and "
1543 "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and "
1544 "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and "
1545 "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and "
1546 "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }";
1547 bset2 = isl_basic_set_read_from_str(ctx, str);
1548 bset1 = isl_basic_set_gist(bset1, bset2);
1549 assert(bset1 && bset1->n_div == 0)((bset1 && bset1->n_div == 0) ? (void) (0) : __assert_fail
("bset1 && bset1->n_div == 0", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1549, __PRETTY_FUNCTION__))
;
1550 isl_basic_set_free(bset1);
1551
1552 /* Check that the integer divisions of the second disjunct
1553 * do not spread to the first disjunct.
1554 */
1555 str = "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: "
1556 "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or "
1557 "(exists (e0 = [(-1 + t1)/16], "
1558 "e1 = [(-16 + t1 - 16e0)/4294967296]: "
1559 "4294967296e1 = -16 + t1 - o0 - 16e0 and "
1560 "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and "
1561 "o0 <= 4294967295 and t1 <= -1)) }";
1562 map1 = isl_map_read_from_str(ctx, str);
1563 str = "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }";
1564 map2 = isl_map_read_from_str(ctx, str);
1565 map1 = isl_map_gist(map1, map2);
1566 if (!map1)
1567 return -1;
1568 if (map1->n != 1)
1569 isl_die(ctx, isl_error_unknown, "expecting single disjunct",do { isl_handle_error(ctx, isl_error_unknown, "expecting single disjunct"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1570); isl_map_free(map1); return -1; } while (0)
1570 isl_map_free(map1); return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting single disjunct"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1570); isl_map_free(map1); return -1; } while (0)
;
1571 if (isl_basic_map_dim(map1->p[0], isl_dim_div) != 1)
1572 isl_die(ctx, isl_error_unknown, "expecting single div",do { isl_handle_error(ctx, isl_error_unknown, "expecting single div"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1573); isl_map_free(map1); return -1; } while (0)
1573 isl_map_free(map1); return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting single div"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1573); isl_map_free(map1); return -1; } while (0)
;
1574 isl_map_free(map1);
1575
1576 if (test_plain_gist(ctx) < 0)
1577 return -1;
1578
1579 return 0;
1580}
1581
1582int test_coalesce_set(isl_ctx *ctx, const char *str, int check_one)
1583{
1584 isl_setisl_map *set, *set2;
1585 int equal;
1586 int one;
1587
1588 set = isl_set_read_from_str(ctx, str);
1589 set = isl_set_coalesce(set);
1590 set2 = isl_set_read_from_str(ctx, str);
1591 equal = isl_set_is_equal(set, set2);
1592 one = set && set->n == 1;
1593 isl_set_free(set);
1594 isl_set_free(set2);
1595
1596 if (equal < 0)
1597 return -1;
1598 if (!equal)
1599 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "coalesced set not equal to input"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1600); return -1; } while (0)
1600 "coalesced set not equal to input", return -1)do { isl_handle_error(ctx, isl_error_unknown, "coalesced set not equal to input"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1600); return -1; } while (0)
;
1601 if (check_one && !one)
1602 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "coalesced set should not be a union"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1603); return -1; } while (0)
1603 "coalesced set should not be a union", return -1)do { isl_handle_error(ctx, isl_error_unknown, "coalesced set should not be a union"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 1603); return -1; } while (0)
;
1604
1605 return 0;
1606}
1607
1608/* Inputs for coalescing tests with unbounded wrapping.
1609 * "str" is a string representation of the input set.
1610 * "single_disjunct" is set if we expect the result to consist of
1611 * a single disjunct.
1612 */
1613struct {
1614 int single_disjunct;
1615 const char *str;
1616} coalesce_unbounded_tests[] = {
1617 { 1, "{ [x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and "
1618 "-x - y + 1 >= 0 and -3 <= z <= 3;"
1619 "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and "
1620 "x-z + 20 >= 0 and x+z + 20 >= 0 and "
1621 "-10 <= y <= 0}" },
1622 { 1, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" },
1623 { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" },
1624 { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" },
1625 { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" },
1626};
1627
1628/* Test the functionality of isl_set_coalesce with the bounded wrapping
1629 * option turned off.
1630 */
1631int test_coalesce_unbounded_wrapping(isl_ctx *ctx)
1632{
1633 int i;
1634 int r = 0;
1635 int bounded;
1636
1637 bounded = isl_options_get_coalesce_bounded_wrapping(ctx);
1638 isl_options_set_coalesce_bounded_wrapping(ctx, 0);
1639
1640 for (i = 0; i < ARRAY_SIZE(coalesce_unbounded_tests)(sizeof(coalesce_unbounded_tests)/sizeof(*coalesce_unbounded_tests
))
; ++i) {
1641 const char *str = coalesce_unbounded_tests[i].str;
1642 int check_one = coalesce_unbounded_tests[i].single_disjunct;
1643 if (test_coalesce_set(ctx, str, check_one) >= 0)
1644 continue;
1645 r = -1;
1646 break;
1647 }
1648
1649 isl_options_set_coalesce_bounded_wrapping(ctx, bounded);
1650
1651 return r;
1652}
1653
1654/* Inputs for coalescing tests.
1655 * "str" is a string representation of the input set.
1656 * "single_disjunct" is set if we expect the result to consist of
1657 * a single disjunct.
1658 */
1659struct {
1660 int single_disjunct;
1661 const char *str;
1662} coalesce_tests[] = {
1663 { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or "
1664 "y >= x & x >= 2 & 5 >= y }" },
1665 { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1666 "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" },
1667 { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or "
1668 "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" },
1669 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1670 "y >= 0 & x >= 6 & x <= 10 & y <= x}" },
1671 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1672 "y >= 0 & x >= 7 & x <= 10 & y <= x}" },
1673 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or "
1674 "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" },
1675 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" },
1676 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" },
1677 { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" },
1678 { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" },
1679 { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" },
1680 { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" },
1681 { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" },
1682 { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1683 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1684 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1685 "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and "
1686 "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and "
1687 "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and "
1688 "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and "
1689 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);"
1690 "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], "
1691 "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], "
1692 "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and "
1693 "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and "
1694 "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and "
1695 "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and "
1696 "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and "
1697 "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and "
1698 "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and "
1699 "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" },
1700 { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and "
1701 "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or "
1702 "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and "
1703 "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" },
1704 { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> "
1705 "[o0, o1, o2, o3, o4, o5, o6]] : "
1706 "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and "
1707 "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and "
1708 "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and "
1709 "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 "
1710 "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and "
1711 "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 "
1712 "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and "
1713 "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 "
1714 "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or "
1715 "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and "
1716 "o6 >= i3 + i6 - o3 and M >= 0 and "
1717 "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and "
1718 "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" },
1719 { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or "
1720 "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or "
1721 "(o0 = 0 and M >= 2 and N >= 3) or "
1722 "(M = 0 and o0 = 0 and N >= 3) }" },
1723 { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and "
1724 "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or "
1725 "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and "
1726 "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" },
1727 { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" },
1728 { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" },
1729 { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or "
1730 "(y = 3 and x = 1) }" },
1731 { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and "
1732 "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and "
1733 "i1 <= M and i3 <= M and i4 <= M) or "
1734 "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and "
1735 "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and "
1736 "i4 <= -1 + M) }" },
1737 { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or "
1738 "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" },
1739 { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" },
1740 { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" },
1741 { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" },
1742 { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" },
1743 { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" },
1744 { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" },
1745 { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" },
1746 { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" },
1747 { 0, "{ [a, b] : exists e : 2e = a and "
1748 "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" },
1749 { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and "
1750 "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and "
1751 "j >= 1 and j' <= i + j - i' and i >= 1; "
1752 "[1, 1, 1, 1] }" },
1753 { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; "
1754 "[i,j] : exists a : j = 3a }" },
1755 { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and "
1756 "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and "
1757 "a >= 3) or "
1758 "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and "
1759 "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" },
1760 { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and "
1761 "c <= 6 + 8a and a >= 3; "
1762 "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and "
1763 "c <= 7 + 8a and a >= 3 and a <= 4 }" },
1764 { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1765 "[x,0] : 3 <= x <= 4 }" },
1766 { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; "
1767 "[x,0] : 4 <= x <= 5 }" },
1768 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; "
1769 "[x,0] : 3 <= x <= 5 }" },
1770 { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; "
1771 "[x,0] : 3 <= x <= 4 }" },
1772 { 1, "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and "
1773 "i1 <= 0; "
1774 "[i0, 0] : i0 >= 123 and i0 <= 124 }" },
1775 { 1, "{ [0,0]; [1,1] }" },
1776 { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" },
1777 { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and "
1778 "ii <= k;"
1779 "[k, 0, k] : k <= 6 and k >= 1 }" },
1780 { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;"
1781 "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" },
1782 { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" },
1783 { 1, "[n] -> { [1] : n >= 0;"
1784 "[x] : exists (e0 = floor((x)/2): x >= 2 and "
1785 "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" },
1786 { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): "
1787 "3e1 = y and x >= 2 and 2e0 >= -1 + x and "
1788 "2e0 <= x and 2e0 <= n);"
1789 "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and "
1790 "n >= 0) }" },
1791 { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): "
1792 "128e0 >= -134 + 127t1 and t1 >= 2 and "
1793 "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or "
1794 "t1 = 1 }" },
1795 { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and "
1796 "3e0 >= -1 + 2i and i <= 9 and i >= 1);"
1797 "[0, 0] }" },
1798 { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and "
1799 "t1 >= 13 and t1 <= 16);"
1800 "[t1] : t1 <= 15 and t1 >= 12 }" },
1801 { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" },
1802 { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" },
1803 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" },
1804 { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" },
1805 { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;"
1806 "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and "
1807 "i <= 4j + 2 }" },
1808 { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or "
1809 "(exists (e0 : 3e0 = -2 + c0)) }" },
1810 { 0, "[n, b0, t0] -> "
1811 "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
1812 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1813 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1814 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1815 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and "
1816 "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and "
1817 "i8 >= -157 + i0 - 4i4 and i8 >= 0 and "
1818 "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or "
1819 "(exists (e0 = floor((-32b0 + i4)/1048576), "
1820 "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and "
1821 "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and "
1822 "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and "
1823 "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and "
1824 "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and "
1825 "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));"
1826 "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : "
1827 "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and "
1828 "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and "
1829 "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and "
1830 "i8 >= -40 + i0 and i8 <= -10 + i0)) }" },
1831 { 0, "{ [i0, i1, i2] : "
1832 "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): "
1833 "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and "
1834 "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and "
1835 "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and "
1836 "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and "
1837 "32e0 <= 31 + i0)) or "
1838 "i0 >= 0 }" },
1839 { 1, "{ [a, b, c] : 2b = 1 + a and 2c = 2 + a; [0, 0, 0] }" },
1840 { 1, "{ [a, a, b, c] : 32*floor((a)/32) = a and 2*floor((b)/2) = b and "
1841 "2*floor((c)/2) = c and 0 <= a <= 192;"
1842 "[224, 224, b, c] : 2*floor((b)/2) = b and 2*floor((c)/2) = c }"
1843 },
1844 { 1, "[n] -> { [a,b] : (exists e : 1 <= a <= 7e and 9e <= b <= n) or "
1845 "(0 <= a <= b <= n) }" },
1846 { 1, "{ [a, b] : 0 <= a <= 2 and b >= 0 and "
1847 "((0 < b <= 13) or (2*floor((a + b)/2) >= -5 + a + 2b)) }" },
1848 { 1, "{ [a] : (2 <= a <= 5) or (a mod 2 = 1 and 1 <= a <= 5) }" },
1849 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
1850 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1851 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
1852 "b = 3 and 9e0 <= -19 + 2c)) }" },
1853 { 1, "{ [a, b, c] : (b = -1 + a and 0 < a <= 3 and "
1854 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1855 "(a = 4 and b = 3 and "
1856 "9*floor((-16 + 2c)/9) <= -19 + 2c) }" },
1857 { 0, "{ [a, b, c] : (b <= 2 and b <= -2 + a) or "
1858 "(b = -1 + a and 0 < a <= 3 and "
1859 "9*floor((-4a + 2c)/9) <= -3 - 4a + 2c) or "
1860 "(exists (e0 = floor((-16 + 2c)/9): a = 4 and "
1861 "b = 3 and 9e0 <= -19 + 2c)) }" },
1862 { 1, "{ [y, x] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
1863 "[1, 0] }" },
1864 { 1, "{ [x, y] : (x - y) mod 3 = 2 and 2 <= y <= 200 and 0 <= x <= 2;"
1865 "[0, 1] }" },
1866 { 1, "{ [1, y] : -1 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
1867 { 1, "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }" },
1868 { 1, "{ [x, y] : 0 <= x <= 10 and x - 4*floor(x/4) <= 1 and y <= 0; "
1869 "[x, y] : 0 <= x <= 10 and x - 4*floor(x/4) > 1 and y <= 0; "
1870 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) <= 1 and 0 < y; "
1871 "[x, y] : 0 <= x <= 10 and x - 5*floor(x/5) > 1 and 0 < y }" },
1872 { 1, "{ [x, 0] : 0 <= x <= 10 and x mod 2 = 0; "
1873 "[x, 0] : 0 <= x <= 10 and x mod 2 = 1; "
1874 "[x, y] : 0 <= x <= 10 and 1 <= y <= 10 }" },
1875 { 1, "{ [a] : a <= 8 and "
1876 "(a mod 10 = 7 or a mod 10 = 8 or a mod 10 = 9) }" },
1877 { 1, "{ [x, y] : 2y = -x and x <= 0 or "
1878 "x <= -1 and 2y <= -x - 1 and 2y >= x - 1 }" },
1879 { 0, "{ [x, y] : 2y = -x and x <= 0 or "
1880 "x <= -2 and 2y <= -x - 1 and 2y >= x - 1 }" },
1881 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
1882 "(a < 0 and 3*floor((a)/3) < a) }" },
1883 { 1, "{ [a] : (a <= 0 and 3*floor((a)/3) = a) or "
1884 "(a < -1 and 3*floor((a)/3) < a) }" },
1885 { 1, "{ [a, b] : a <= 1024 and b >= 0 and "
1886 "((-31 - a + b <= 32*floor((-1 - a)/32) <= -33 + b and "
1887 "32*floor((-1 - a)/32) <= -16 + b + 16*floor((-1 - a)/16))"
1888 "or (2 <= a <= 15 and b < a)) }" },
1889 { 1, "{ [a] : a > 0 and ((16*floor((a)/16) < a and "
1890 "32*floor((a)/32) < a) or a <= 15) }" },
1891 { 1, "{ [a, b, c, d] : (-a + d) mod 64 = 0 and a <= 8 and b <= 1 and "
1892 "10 - a <= c <= 3 and d >= 5 and 9 - 64b <= d <= 70;"
1893 "[a, b = 1, c, d] : (-a + d) mod 64 = 0 and a <= 8 and c >= 4 and "
1894 "10 - a <= c <= 5 and 5 <= d <= 73 - c }" },
1895 { 1, "[n, m] -> { S_0[i] : (-n + i) mod 3 = 0 and m >= 3 + n and "
1896 "i >= n and 3*floor((2 + n + 2m)/3) <= n + 3m - i; "
1897 "S_0[n] : n <= m <= 2 + n }" },
1898 { 1, "{ [a, b] : exists (e0: 0 <= a <= 1 and b >= 0 and "
1899 "2e0 >= -5 + a + 2b and 2e0 >= -1 + a + b and "
1900 "2e0 <= a + b); "
1901 "[a, b] : exists (e0: 0 <= a <= 1 and 2e0 >= -5 + a + 2b and "
1902 "2e0 >= -1 - a + b and 2e0 <= -a + b and "
1903 "2e0 < -a + 2b) }" },
1904 { 1, "{ [i, j, i - 8j] : 8 <= i <= 63 and -7 + i <= 8j <= i; "
1905 "[i, 0, i] : 0 <= i <= 7 }" },
1906};
1907
1908/* A specialized coalescing test case that would result
1909 * in a segmentation fault or a failed assertion in earlier versions of isl.
1910 */
1911static int test_coalesce_special(struct isl_ctx *ctx)
1912{
1913 const char *str;
1914 isl_map *map1, *map2;
1915
1916 str = "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1917 "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : "
1918 "(y = 201 and o1 <= 239 and o1 >= 212) or "
1919 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and "
1920 "o1 <= 239 and o1 >= 212)) or "
1921 "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and "
1922 "o1 <= 241 and o1 >= 240));"
1923 "[S_L220_OUT[] -> T7[]] -> "
1924 "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : "
1925 "(y = 2 and o1 <= 241 and o1 >= 212) or "
1926 "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and "
1927 "y >= 5 and o1 <= 241 and o1 >= 212)) }";
1928 map1 = isl_map_read_from_str(ctx, str);
1929 map1 = isl_map_align_divs_internal(map1);
1930 map1 = isl_map_coalesce(map1);
1931 str = "[y] -> { [S_L220_OUT[] -> T7[]] -> "
1932 "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : "
1933 "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and "
1934 "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and "
1935 "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }";
1936 map2 = isl_map_read_from_str(ctx, str);
1937 map2 = isl_map_union(map2, map1);
1938 map2 = isl_map_align_divs_internal(map2);
1939 map2 = isl_map_coalesce(map2);
1940 isl_map_free(map2);
1941 if (!map2)
1942 return -1;
1943
1944 return 0;
1945}
1946
1947/* A specialized coalescing test case that would result in an assertion
1948 * in an earlier version of isl.
1949 * The explicit call to isl_basic_set_union prevents the implicit
1950 * equality constraints in the first basic map from being detected prior
1951 * to the call to isl_set_coalesce, at least at the point
1952 * where this test case was introduced.
1953 */
1954static int test_coalesce_special2(struct isl_ctx *ctx)
1955{
1956 const char *str;
1957 isl_basic_setisl_basic_map *bset1, *bset2;
1958 isl_setisl_map *set;
1959
1960 str = "{ [x, y] : x, y >= 0 and x + 2y <= 1 and 2x + y <= 1 }";
1961 bset1 = isl_basic_set_read_from_str(ctx, str);
1962 str = "{ [x,0] : -1 <= x <= 1 and x mod 2 = 1 }" ;
1963 bset2 = isl_basic_set_read_from_str(ctx, str);
1964 set = isl_basic_set_union(bset1, bset2);
1965 set = isl_set_coalesce(set);
1966 isl_set_free(set);
1967
1968 if (!set)
1969 return -1;
1970 return 0;
1971}
1972
1973/* Check that calling isl_set_coalesce does not leave other sets
1974 * that may share some information with the input to isl_set_coalesce
1975 * in an inconsistent state.
1976 * In particular, older versions of isl would modify all copies
1977 * of the basic sets in the isl_set_coalesce input in a way
1978 * that could leave them in an inconsistent state.
1979 * The result of printing any other set containing one of these
1980 * basic sets would then result in an invalid set description.
1981 */
1982static int test_coalesce_special3(isl_ctx *ctx)
1983{
1984 const char *str;
1985 char *s;
1986 isl_setisl_map *set1, *set2;
1987 isl_printer *p;
1988
1989 set1 = isl_set_read_from_str(ctx, "{ [0, 0, 0] }");
1990 str = "{ [a, b, a + b] : a >= 0 and b >= 0 and 0 < a + b }";
1991 set2 = isl_set_read_from_str(ctx, str);
1992 set1 = isl_set_union(set1, isl_set_copy(set2));
1993 set1 = isl_set_coalesce(set1);
1994 isl_set_free(set1);
1995
1996 p = isl_printer_to_str(ctx);
1997 p = isl_printer_print_set(p, set2);
1998 isl_set_free(set2);
1999 s = isl_printer_get_str(p);
2000 isl_printer_free(p);
2001 set1 = isl_set_read_from_str(ctx, s);
2002 free(s);
2003 isl_set_free(set1);
2004
2005 if (!set1)
2006 return -1;
2007
2008 return 0;
2009}
2010
2011/* Test the functionality of isl_set_coalesce.
2012 * That is, check that the output is always equal to the input
2013 * and in some cases that the result consists of a single disjunct.
2014 */
2015static int test_coalesce(struct isl_ctx *ctx)
2016{
2017 int i;
2018
2019 for (i = 0; i < ARRAY_SIZE(coalesce_tests)(sizeof(coalesce_tests)/sizeof(*coalesce_tests)); ++i) {
2020 const char *str = coalesce_tests[i].str;
2021 int check_one = coalesce_tests[i].single_disjunct;
2022 if (test_coalesce_set(ctx, str, check_one) < 0)
2023 return -1;
2024 }
2025
2026 if (test_coalesce_unbounded_wrapping(ctx) < 0)
2027 return -1;
2028 if (test_coalesce_special(ctx) < 0)
2029 return -1;
2030 if (test_coalesce_special2(ctx) < 0)
2031 return -1;
2032 if (test_coalesce_special3(ctx) < 0)
2033 return -1;
2034
2035 return 0;
2036}
2037
2038/* Construct a representation of the graph on the right of Figure 1
2039 * in "Computing the Transitive Closure of a Union of
2040 * Affine Integer Tuple Relations".
2041 */
2042static __isl_give isl_map *cocoa_fig_1_right_graph(isl_ctx *ctx)
2043{
2044 isl_setisl_map *dom;
2045 isl_map *up, *right;
2046
2047 dom = isl_set_read_from_str(ctx,
2048 "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and "
2049 "2 x - 3 y + 3 >= 0 }");
2050 right = isl_map_read_from_str(ctx,
2051 "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }");
2052 up = isl_map_read_from_str(ctx,
2053 "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }");
2054 right = isl_map_intersect_domain(right, isl_set_copy(dom));
2055 right = isl_map_intersect_range(right, isl_set_copy(dom));
2056 up = isl_map_intersect_domain(up, isl_set_copy(dom));
2057 up = isl_map_intersect_range(up, dom);
2058 return isl_map_union(up, right);
2059}
2060
2061/* Construct a representation of the power of the graph
2062 * on the right of Figure 1 in "Computing the Transitive Closure of
2063 * a Union of Affine Integer Tuple Relations".
2064 */
2065static __isl_give isl_map *cocoa_fig_1_right_power(isl_ctx *ctx)
2066{
2067 return isl_map_read_from_str(ctx,
2068 "{ [1] -> [[0,0] -> [0,1]]; [2] -> [[0,0] -> [1,1]]; "
2069 " [1] -> [[0,1] -> [1,1]]; [1] -> [[2,2] -> [3,2]]; "
2070 " [2] -> [[2,2] -> [3,3]]; [1] -> [[3,2] -> [3,3]] }");
2071}
2072
2073/* Construct a representation of the transitive closure of the graph
2074 * on the right of Figure 1 in "Computing the Transitive Closure of
2075 * a Union of Affine Integer Tuple Relations".
2076 */
2077static __isl_give isl_map *cocoa_fig_1_right_tc(isl_ctx *ctx)
2078{
2079 return isl_set_unwrap(isl_map_range(cocoa_fig_1_right_power(ctx)));
2080}
2081
2082static int test_closure(isl_ctx *ctx)
2083{
2084 const char *str;
2085 isl_map *map, *map2;
2086 int exact, equal;
2087
2088 /* COCOA example 1 */
2089 map = isl_map_read_from_str(ctx,
2090 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2091 "1 <= i and i < n and 1 <= j and j < n or "
2092 "i2 = i + 1 and j2 = j - 1 and "
2093 "1 <= i and i < n and 2 <= j and j <= n }");
2094 map = isl_map_power(map, &exact);
2095 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2095, __PRETTY_FUNCTION__))
;
2096 isl_map_free(map);
2097
2098 /* COCOA example 1 */
2099 map = isl_map_read_from_str(ctx,
2100 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and "
2101 "1 <= i and i < n and 1 <= j and j < n or "
2102 "i2 = i + 1 and j2 = j - 1 and "
2103 "1 <= i and i < n and 2 <= j and j <= n }");
2104 map = isl_map_transitive_closure(map, &exact);
2105 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2105, __PRETTY_FUNCTION__))
;
2106 map2 = isl_map_read_from_str(ctx,
2107 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2108 "1 <= i and i < n and 1 <= j and j <= n and "
2109 "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2110 "i2 = i + k1 + k2 and j2 = j + k1 - k2 and "
2111 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}");
2112 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2112, __PRETTY_FUNCTION__))
;
2113 isl_map_free(map2);
2114 isl_map_free(map);
2115
2116 map = isl_map_read_from_str(ctx,
2117 "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and "
2118 " 0 <= y and y <= n }");
2119 map = isl_map_transitive_closure(map, &exact);
2120 map2 = isl_map_read_from_str(ctx,
2121 "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and "
2122 " 0 <= y and y <= n }");
2123 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2123, __PRETTY_FUNCTION__))
;
2124 isl_map_free(map2);
2125 isl_map_free(map);
2126
2127 /* COCOA example 2 */
2128 map = isl_map_read_from_str(ctx,
2129 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and "
2130 "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or "
2131 "i2 = i + 2 and j2 = j - 2 and "
2132 "1 <= i and i < n - 1 and 3 <= j and j <= n }");
2133 map = isl_map_transitive_closure(map, &exact);
2134 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2134, __PRETTY_FUNCTION__))
;
2135 map2 = isl_map_read_from_str(ctx,
2136 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : "
2137 "1 <= i and i < n - 1 and 1 <= j and j <= n and "
2138 "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and "
2139 "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and "
2140 "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }");
2141 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2141, __PRETTY_FUNCTION__))
;
2142 isl_map_free(map);
2143 isl_map_free(map2);
2144
2145 /* COCOA Fig.2 left */
2146 map = isl_map_read_from_str(ctx,
2147 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and "
2148 "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and "
2149 "j <= n or "
2150 "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and "
2151 "j <= 2 i - 3 and j <= n - 2 or "
2152 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2153 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2154 map = isl_map_transitive_closure(map, &exact);
2155 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2155, __PRETTY_FUNCTION__))
;
2156 isl_map_free(map);
2157
2158 /* COCOA Fig.2 right */
2159 map = isl_map_read_from_str(ctx,
2160 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2161 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2162 "j <= n or "
2163 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2164 "j <= 2 i - 4 and j <= n - 3 or "
2165 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2166 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2167 map = isl_map_power(map, &exact);
2168 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2168, __PRETTY_FUNCTION__))
;
2169 isl_map_free(map);
2170
2171 /* COCOA Fig.2 right */
2172 map = isl_map_read_from_str(ctx,
2173 "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and "
2174 "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and "
2175 "j <= n or "
2176 "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and "
2177 "j <= 2 i - 4 and j <= n - 3 or "
2178 "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and "
2179 "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }");
2180 map = isl_map_transitive_closure(map, &exact);
2181 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2181, __PRETTY_FUNCTION__))
;
2182 map2 = isl_map_read_from_str(ctx,
2183 "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : "
2184 "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and "
2185 "j <= n and 3 + i + 2 j <= 3 n and "
2186 "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and "
2187 "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and "
2188 "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and "
2189 "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and "
2190 "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }");
2191 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2191, __PRETTY_FUNCTION__))
;
2192 isl_map_free(map2);
2193 isl_map_free(map);
2194
2195 map = cocoa_fig_1_right_graph(ctx);
2196 map = isl_map_transitive_closure(map, &exact);
2197 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2197, __PRETTY_FUNCTION__))
;
2198 map2 = cocoa_fig_1_right_tc(ctx);
2199 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2199, __PRETTY_FUNCTION__))
;
2200 isl_map_free(map2);
2201 isl_map_free(map);
2202
2203 map = cocoa_fig_1_right_graph(ctx);
2204 map = isl_map_power(map, &exact);
2205 map2 = cocoa_fig_1_right_power(ctx);
2206 equal = isl_map_is_equal(map, map2);
2207 isl_map_free(map2);
2208 isl_map_free(map);
2209 if (equal < 0)
2210 return -1;
2211 if (!exact)
2212 isl_die(ctx, isl_error_unknown, "power not exact", return -1)do { isl_handle_error(ctx, isl_error_unknown, "power not exact"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2212); return -1; } while (0)
;
2213 if (!equal)
2214 isl_die(ctx, isl_error_unknown, "unexpected power", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected power"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2214); return -1; } while (0)
;
2215
2216 /* COCOA Theorem 1 counter example */
2217 map = isl_map_read_from_str(ctx,
2218 "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and "
2219 "i2 = 1 and j2 = j or "
2220 "i = 0 and j = 0 and i2 = 0 and j2 = 1 }");
2221 map = isl_map_transitive_closure(map, &exact);
2222 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2222, __PRETTY_FUNCTION__))
;
2223 isl_map_free(map);
2224
2225 map = isl_map_read_from_str(ctx,
2226 "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and "
2227 "1 <= i,i2 <= n and 1 <= j,j2 <= m or "
2228 "i2 = i + 1 and 3 <= j2 - j <= 4 and "
2229 "1 <= i,i2 <= n and 1 <= j,j2 <= m }");
2230 map = isl_map_transitive_closure(map, &exact);
2231 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2231, __PRETTY_FUNCTION__))
;
2232 isl_map_free(map);
2233
2234 /* Kelly et al 1996, fig 12 */
2235 map = isl_map_read_from_str(ctx,
2236 "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and "
2237 "1 <= i,j,j+1 <= n or "
2238 "j = n and j2 = 1 and i2 = i + 1 and "
2239 "1 <= i,i+1 <= n }");
2240 map = isl_map_transitive_closure(map, &exact);
2241 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2241, __PRETTY_FUNCTION__))
;
2242 map2 = isl_map_read_from_str(ctx,
2243 "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and "
2244 "1 <= i <= n and i = i2 or "
2245 "1 <= i < i2 <= n and 1 <= j <= n and "
2246 "1 <= j2 <= n }");
2247 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2247, __PRETTY_FUNCTION__))
;
2248 isl_map_free(map2);
2249 isl_map_free(map);
2250
2251 /* Omega's closure4 */
2252 map = isl_map_read_from_str(ctx,
2253 "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and "
2254 "1 <= x,y <= 10 or "
2255 "x2 = x + 1 and y2 = y and "
2256 "1 <= x <= 20 && 5 <= y <= 15 }");
2257 map = isl_map_transitive_closure(map, &exact);
2258 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2258, __PRETTY_FUNCTION__))
;
2259 isl_map_free(map);
2260
2261 map = isl_map_read_from_str(ctx,
2262 "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }");
2263 map = isl_map_transitive_closure(map, &exact);
2264 assert(!exact)((!exact) ? (void) (0) : __assert_fail ("!exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2264, __PRETTY_FUNCTION__))
;
2265 map2 = isl_map_read_from_str(ctx,
2266 "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }");
2267 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2267, __PRETTY_FUNCTION__))
;
2268 isl_map_free(map);
2269 isl_map_free(map2);
2270
2271 str = "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : "
2272 "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and "
2273 "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and "
2274 "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }";
2275 map = isl_map_read_from_str(ctx, str);
2276 map = isl_map_transitive_closure(map, &exact);
2277 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2277, __PRETTY_FUNCTION__))
;
2278 map2 = isl_map_read_from_str(ctx, str);
2279 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2279, __PRETTY_FUNCTION__))
;
2280 isl_map_free(map);
2281 isl_map_free(map2);
2282
2283 str = "{[0] -> [1]; [2] -> [3]}";
2284 map = isl_map_read_from_str(ctx, str);
2285 map = isl_map_transitive_closure(map, &exact);
2286 assert(exact)((exact) ? (void) (0) : __assert_fail ("exact", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2286, __PRETTY_FUNCTION__))
;
2287 map2 = isl_map_read_from_str(ctx, str);
2288 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2288, __PRETTY_FUNCTION__))
;
2289 isl_map_free(map);
2290 isl_map_free(map2);
2291
2292 str = "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> "
2293 "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : "
2294 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and "
2295 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2296 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2297 "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> "
2298 "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : "
2299 "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and "
2300 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2301 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2302 "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> "
2303 "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : "
2304 "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and "
2305 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2306 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); "
2307 "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> "
2308 "[[i0, i1, 1, 0, i0] -> [i5, 1]] : "
2309 "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and "
2310 "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and "
2311 "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }";
2312 map = isl_map_read_from_str(ctx, str);
2313 map = isl_map_transitive_closure(map, NULL((void*)0));
2314 assert(map)((map) ? (void) (0) : __assert_fail ("map", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2314, __PRETTY_FUNCTION__))
;
2315 isl_map_free(map);
2316
2317 return 0;
2318}
2319
2320static int test_lex(struct isl_ctx *ctx)
2321{
2322 isl_space *dim;
2323 isl_map *map;
2324 int empty;
2325
2326 dim = isl_space_set_alloc(ctx, 0, 0);
2327 map = isl_map_lex_le(dim);
2328 empty = isl_map_is_empty(map);
2329 isl_map_free(map);
2330
2331 if (empty < 0)
2332 return -1;
2333 if (empty)
2334 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expecting non-empty result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2335); return -1; } while (0)
2335 "expecting non-empty result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting non-empty result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2335); return -1; } while (0)
;
2336
2337 return 0;
2338}
2339
2340/* Inputs for isl_map_lexmin tests.
2341 * "map" is the input and "lexmin" is the expected result.
2342 */
2343struct {
2344 const char *map;
2345 const char *lexmin;
2346} lexmin_tests [] = {
2347 { "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }",
2348 "{ [x] -> [5] : 6 <= x <= 8; "
2349 "[x] -> [x] : x <= 5 or (9 <= x <= 10) }" },
2350 { "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }",
2351 "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }" },
2352 { "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }",
2353 "{ [x] -> [y] : (4y = x and x >= 0) or "
2354 "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and "
2355 "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or "
2356 "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }" },
2357 { "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }",
2358 "{ T[a] -> S[b, c] : 2b = a and 2c = a }" },
2359 /* Check that empty pieces are properly combined. */
2360 { "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and "
2361 "2N-6<=x<K+N and N-1<=a<=K+N-1 and N+b-6<=a<=2N-4 and "
2362 "b<=2N-3K+a and 3b<=4N-K+1 and b>=N and a>=x+1 }",
2363 "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and "
2364 "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and "
2365 "x >= 4 }" },
2366 { "{ [i, k, j] -> [a, b, c, d] : 8*floor((b)/8) = b and k <= 255 and "
2367 "a <= 255 and c <= 255 and d <= 255 - j and "
2368 "255 - j <= 7d <= 7 - i and 240d <= 239 + a and "
2369 "247d <= 247 + k - j and 247d <= 247 + k - b and "
2370 "247d <= 247 + i and 248 - b <= 248d <= c and "
2371 "254d >= i - a + b and 254d >= -a + b and "
2372 "255d >= -i + a - b and 1792d >= -63736 + 257b }",
2373 "{ [i, k, j] -> "
2374 "[-127762 + i + 502j, -62992 + 248j, 63240 - 248j, 255 - j] : "
2375 "k <= 255 and 7j >= 1778 + i and 246j >= 62738 - k and "
2376 "247j >= 62738 - i and 509j <= 129795 + i and "
2377 "742j >= 188724 - i; "
2378 "[0, k, j] -> [1, 0, 248, 1] : k <= 255 and 248 <= j <= 254, k }" },
2379 { "{ [a] -> [b] : 0 <= b <= 255 and -509 + a <= 512b < a and "
2380 "16*floor((8 + b)/16) <= 7 + b; "
2381 "[a] -> [1] }",
2382 "{ [a] -> [b = 1] : a >= 510 or a <= 0; "
2383 "[a] -> [b = 0] : 0 < a <= 509 }" },
2384 { "{ rat: [i] : 1 <= 2i <= 9 }", "{ rat: [i] : 2i = 1 }" },
2385 { "{ rat: [i] : 1 <= 2i <= 9 or i >= 10 }", "{ rat: [i] : 2i = 1 }" },
2386};
2387
2388static int test_lexmin(struct isl_ctx *ctx)
2389{
2390 int i;
2391 int equal;
2392 const char *str;
2393 isl_basic_map *bmap;
2394 isl_map *map, *map2;
2395 isl_setisl_map *set;
2396 isl_setisl_map *set2;
2397 isl_pw_multi_aff *pma;
2398
2399 str = "[p0, p1] -> { [] -> [] : "
2400 "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], "
2401 "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: "
2402 "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and "
2403 "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and "
2404 "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and "
2405 "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and "
2406 "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and "
2407 "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and "
2408 "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and "
2409 "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and "
2410 "e2 <= e1 and e3 >= 1 and e4 <= e2) }";
2411 map = isl_map_read_from_str(ctx, str);
2412 map = isl_map_lexmin(map);
2413 isl_map_free(map);
2414
2415 str = "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and "
2416 "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }";
2417 set = isl_set_read_from_str(ctx, str);
2418 set = isl_set_lexmax(set);
2419 str = "[C] -> { [obj,a,b,c] : C = 8 }";
2420 set2 = isl_set_read_from_str(ctx, str);
2421 set = isl_set_intersect(set, set2);
2422 assert(!isl_set_is_empty(set))((!isl_set_is_empty(set)) ? (void) (0) : __assert_fail ("!isl_set_is_empty(set)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2422, __PRETTY_FUNCTION__))
;
2423 isl_set_free(set);
2424
2425 for (i = 0; i < ARRAY_SIZE(lexmin_tests)(sizeof(lexmin_tests)/sizeof(*lexmin_tests)); ++i) {
2426 map = isl_map_read_from_str(ctx, lexmin_tests[i].map);
2427 map = isl_map_lexmin(map);
2428 map2 = isl_map_read_from_str(ctx, lexmin_tests[i].lexmin);
2429 equal = isl_map_is_equal(map, map2);
2430 isl_map_free(map);
2431 isl_map_free(map2);
2432
2433 if (equal < 0)
2434 return -1;
2435 if (!equal)
2436 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2437); return -1; } while (0)
2437 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2437); return -1; } while (0)
;
2438 }
2439
2440 str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2441 " 8i' <= i and 8i' >= -7 + i }";
2442 bmap = isl_basic_map_read_from_str(ctx, str);
2443 pma = isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap));
2444 map2 = isl_map_from_pw_multi_aff(pma);
2445 map = isl_map_from_basic_map(bmap);
2446 assert(isl_map_is_equal(map, map2))((isl_map_is_equal(map, map2)) ? (void) (0) : __assert_fail (
"isl_map_is_equal(map, map2)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2446, __PRETTY_FUNCTION__))
;
2447 isl_map_free(map);
2448 isl_map_free(map2);
2449
2450 str = "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and "
2451 " 8i' <= i and 8i' >= -7 + i }";
2452 set = isl_set_read_from_str(ctx, str);
2453 pma = isl_set_lexmin_pw_multi_aff(isl_set_copy(set));
2454 set2 = isl_set_from_pw_multi_aff(pma);
2455 equal = isl_set_is_equal(set, set2);
2456 isl_set_free(set);
2457 isl_set_free(set2);
2458 if (equal < 0)
2459 return -1;
2460 if (!equal)
2461 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected difference between set and "
"piecewise affine expression", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2463); return -1; } while (0)
2462 "unexpected difference between set and "do { isl_handle_error(ctx, isl_error_unknown, "unexpected difference between set and "
"piecewise affine expression", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2463); return -1; } while (0)
2463 "piecewise affine expression", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected difference between set and "
"piecewise affine expression", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2463); return -1; } while (0)
;
2464
2465 return 0;
2466}
2467
2468/* A specialized isl_set_min_val test case that would return the wrong result
2469 * in earlier versions of isl.
2470 * The explicit call to isl_basic_set_union prevents the second basic set
2471 * from being determined to be empty prior to the call to isl_set_min_val,
2472 * at least at the point where this test case was introduced.
2473 */
2474static int test_min_special(isl_ctx *ctx)
2475{
2476 const char *str;
2477 isl_basic_setisl_basic_map *bset1, *bset2;
2478 isl_setisl_map *set;
2479 isl_aff *obj;
2480 isl_val *res;
2481 int ok;
2482
2483 str = "{ [a, b] : a >= 2 and b >= 0 and 14 - a <= b <= 9 }";
2484 bset1 = isl_basic_set_read_from_str(ctx, str);
2485 str = "{ [a, b] : 1 <= a, b and a + b <= 1 }";
2486 bset2 = isl_basic_set_read_from_str(ctx, str);
2487 set = isl_basic_set_union(bset1, bset2);
2488 obj = isl_aff_read_from_str(ctx, "{ [a, b] -> [a] }");
2489
2490 res = isl_set_min_val(set, obj);
2491 ok = isl_val_cmp_si(res, 5) == 0;
2492
2493 isl_aff_free(obj);
2494 isl_set_free(set);
2495 isl_val_free(res);
2496
2497 if (!res)
2498 return -1;
2499 if (!ok)
2500 isl_die(ctx, isl_error_unknown, "unexpected minimum",do { isl_handle_error(ctx, isl_error_unknown, "unexpected minimum"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2501); return -1; } while (0)
2501 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected minimum"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2501); return -1; } while (0)
;
2502
2503 return 0;
2504}
2505
2506/* A specialized isl_set_min_val test case that would return an error
2507 * in earlier versions of isl.
2508 */
2509static int test_min_special2(isl_ctx *ctx)
2510{
2511 const char *str;
2512 isl_basic_setisl_basic_map *bset;
2513 isl_aff *obj;
2514 isl_val *res;
2515
2516 str = "{ [i, j, k] : 2j = i and 2k = i + 1 and i >= 2 }";
2517 bset = isl_basic_set_read_from_str(ctx, str);
2518
2519 obj = isl_aff_read_from_str(ctx, "{ [i, j, k] -> [i] }");
2520
2521 res = isl_basic_set_max_val(bset, obj);
2522
2523 isl_basic_set_free(bset);
2524 isl_aff_free(obj);
2525 isl_val_free(res);
2526
2527 if (!res)
2528 return -1;
2529
2530 return 0;
2531}
2532
2533struct {
2534 const char *set;
2535 const char *obj;
2536 __isl_give isl_val *(*fn)(__isl_keep isl_setisl_map *set,
2537 __isl_keep isl_aff *obj);
2538 const char *res;
2539} opt_tests[] = {
2540 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_min_val, "-1" },
2541 { "{ [-1]; [1] }", "{ [x] -> [x] }", &isl_set_max_val, "1" },
2542 { "{ [a, b] : 0 <= a, b <= 100 and b mod 2 = 0}",
2543 "{ [a, b] -> [floor((b - 2*floor((-a)/4))/5)] }",
2544 &isl_set_max_val, "30" },
2545
2546};
2547
2548/* Perform basic isl_set_min_val and isl_set_max_val tests.
2549 * In particular, check the results on non-convex inputs.
2550 */
2551static int test_min(struct isl_ctx *ctx)
2552{
2553 int i;
2554 isl_setisl_map *set;
2555 isl_aff *obj;
2556 isl_val *val, *res;
2557 isl_bool ok;
2558
2559 for (i = 0; i < ARRAY_SIZE(opt_tests)(sizeof(opt_tests)/sizeof(*opt_tests)); ++i) {
2560 set = isl_set_read_from_str(ctx, opt_tests[i].set);
2561 obj = isl_aff_read_from_str(ctx, opt_tests[i].obj);
2562 res = isl_val_read_from_str(ctx, opt_tests[i].res);
2563 val = opt_tests[i].fn(set, obj);
2564 ok = isl_val_eq(res, val);
2565 isl_val_free(res);
2566 isl_val_free(val);
2567 isl_aff_free(obj);
2568 isl_set_free(set);
2569
2570 if (ok < 0)
2571 return -1;
2572 if (!ok)
2573 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected optimum"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2574); return -1; } while (0)
2574 "unexpected optimum", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected optimum"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2574); return -1; } while (0)
;
2575 }
2576
2577 if (test_min_special(ctx) < 0)
2578 return -1;
2579 if (test_min_special2(ctx) < 0)
2580 return -1;
2581
2582 return 0;
2583}
2584
2585struct must_may {
2586 isl_map *must;
2587 isl_map *may;
2588};
2589
2590static isl_stat collect_must_may(__isl_take isl_map *dep, int must,
2591 void *dep_user, void *user)
2592{
2593 struct must_may *mm = (struct must_may *)user;
2594
2595 if (must)
2596 mm->must = isl_map_union(mm->must, dep);
2597 else
2598 mm->may = isl_map_union(mm->may, dep);
2599
2600 return isl_stat_ok;
2601}
2602
2603static int common_space(void *first, void *second)
2604{
2605 int depth = *(int *)first;
2606 return 2 * depth;
2607}
2608
2609static int map_is_equal(__isl_keep isl_map *map, const char *str)
2610{
2611 isl_map *map2;
2612 int equal;
2613
2614 if (!map)
2615 return -1;
2616
2617 map2 = isl_map_read_from_str(map->ctx, str);
2618 equal = isl_map_is_equal(map, map2);
2619 isl_map_free(map2);
2620
2621 return equal;
2622}
2623
2624static int map_check_equal(__isl_keep isl_map *map, const char *str)
2625{
2626 int equal;
2627
2628 equal = map_is_equal(map, str);
2629 if (equal < 0)
2630 return -1;
2631 if (!equal)
2632 isl_die(isl_map_get_ctx(map), isl_error_unknown,do { isl_handle_error(isl_map_get_ctx(map), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2633); return -1; } while (0)
2633 "result not as expected", return -1)do { isl_handle_error(isl_map_get_ctx(map), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2633); return -1; } while (0)
;
2634 return 0;
2635}
2636
2637static int test_dep(struct isl_ctx *ctx)
2638{
2639 const char *str;
2640 isl_space *dim;
2641 isl_map *map;
2642 isl_access_info *ai;
2643 isl_flow *flow;
2644 int depth;
2645 struct must_may mm;
2646
2647 depth = 3;
2648
2649 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2650 map = isl_map_read_from_str(ctx, str);
2651 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2652
2653 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2654 map = isl_map_read_from_str(ctx, str);
2655 ai = isl_access_info_add_source(ai, map, 1, &depth);
2656
2657 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2658 map = isl_map_read_from_str(ctx, str);
2659 ai = isl_access_info_add_source(ai, map, 1, &depth);
2660
2661 flow = isl_access_info_compute_flow(ai);
2662 dim = isl_space_alloc(ctx, 0, 3, 3);
2663 mm.must = isl_map_empty(isl_space_copy(dim));
2664 mm.may = isl_map_empty(dim);
2665
2666 isl_flow_foreach(flow, collect_must_may, &mm);
2667
2668 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); "
2669 " [1,10,0] -> [2,5,0] }";
2670 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2670, __PRETTY_FUNCTION__))
;
2671 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2672 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2672, __PRETTY_FUNCTION__))
;
2673
2674 isl_map_free(mm.must);
2675 isl_map_free(mm.may);
2676 isl_flow_free(flow);
2677
2678
2679 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2680 map = isl_map_read_from_str(ctx, str);
2681 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2682
2683 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2684 map = isl_map_read_from_str(ctx, str);
2685 ai = isl_access_info_add_source(ai, map, 1, &depth);
2686
2687 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2688 map = isl_map_read_from_str(ctx, str);
2689 ai = isl_access_info_add_source(ai, map, 0, &depth);
2690
2691 flow = isl_access_info_compute_flow(ai);
2692 dim = isl_space_alloc(ctx, 0, 3, 3);
2693 mm.must = isl_map_empty(isl_space_copy(dim));
2694 mm.may = isl_map_empty(dim);
2695
2696 isl_flow_foreach(flow, collect_must_may, &mm);
2697
2698 str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }";
2699 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2699, __PRETTY_FUNCTION__))
;
2700 str = "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2701 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2701, __PRETTY_FUNCTION__))
;
2702
2703 isl_map_free(mm.must);
2704 isl_map_free(mm.may);
2705 isl_flow_free(flow);
2706
2707
2708 str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }";
2709 map = isl_map_read_from_str(ctx, str);
2710 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2711
2712 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2713 map = isl_map_read_from_str(ctx, str);
2714 ai = isl_access_info_add_source(ai, map, 0, &depth);
2715
2716 str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }";
2717 map = isl_map_read_from_str(ctx, str);
2718 ai = isl_access_info_add_source(ai, map, 0, &depth);
2719
2720 flow = isl_access_info_compute_flow(ai);
2721 dim = isl_space_alloc(ctx, 0, 3, 3);
2722 mm.must = isl_map_empty(isl_space_copy(dim));
2723 mm.may = isl_map_empty(dim);
2724
2725 isl_flow_foreach(flow, collect_must_may, &mm);
2726
2727 str = "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; "
2728 " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }";
2729 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2729, __PRETTY_FUNCTION__))
;
2730 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2731 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2731, __PRETTY_FUNCTION__))
;
2732
2733 isl_map_free(mm.must);
2734 isl_map_free(mm.may);
2735 isl_flow_free(flow);
2736
2737
2738 str = "{ [0,i,2] -> [i] : 0 <= i <= 10 }";
2739 map = isl_map_read_from_str(ctx, str);
2740 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2741
2742 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2743 map = isl_map_read_from_str(ctx, str);
2744 ai = isl_access_info_add_source(ai, map, 0, &depth);
2745
2746 str = "{ [0,i,1] -> [5] : 0 <= i <= 10 }";
2747 map = isl_map_read_from_str(ctx, str);
2748 ai = isl_access_info_add_source(ai, map, 0, &depth);
2749
2750 flow = isl_access_info_compute_flow(ai);
2751 dim = isl_space_alloc(ctx, 0, 3, 3);
2752 mm.must = isl_map_empty(isl_space_copy(dim));
2753 mm.may = isl_map_empty(dim);
2754
2755 isl_flow_foreach(flow, collect_must_may, &mm);
2756
2757 str = "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; "
2758 " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }";
2759 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2759, __PRETTY_FUNCTION__))
;
2760 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2761 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2761, __PRETTY_FUNCTION__))
;
2762
2763 isl_map_free(mm.must);
2764 isl_map_free(mm.may);
2765 isl_flow_free(flow);
2766
2767
2768 str = "{ [0,i,1] -> [i] : 0 <= i <= 10 }";
2769 map = isl_map_read_from_str(ctx, str);
2770 ai = isl_access_info_alloc(map, &depth, &common_space, 2);
2771
2772 str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }";
2773 map = isl_map_read_from_str(ctx, str);
2774 ai = isl_access_info_add_source(ai, map, 0, &depth);
2775
2776 str = "{ [0,i,2] -> [5] : 0 <= i <= 10 }";
2777 map = isl_map_read_from_str(ctx, str);
2778 ai = isl_access_info_add_source(ai, map, 0, &depth);
2779
2780 flow = isl_access_info_compute_flow(ai);
2781 dim = isl_space_alloc(ctx, 0, 3, 3);
2782 mm.must = isl_map_empty(isl_space_copy(dim));
2783 mm.may = isl_map_empty(dim);
2784
2785 isl_flow_foreach(flow, collect_must_may, &mm);
2786
2787 str = "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; "
2788 " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }";
2789 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2789, __PRETTY_FUNCTION__))
;
2790 str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }";
2791 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2791, __PRETTY_FUNCTION__))
;
2792
2793 isl_map_free(mm.must);
2794 isl_map_free(mm.may);
2795 isl_flow_free(flow);
2796
2797
2798 depth = 5;
2799
2800 str = "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2801 map = isl_map_read_from_str(ctx, str);
2802 ai = isl_access_info_alloc(map, &depth, &common_space, 1);
2803
2804 str = "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }";
2805 map = isl_map_read_from_str(ctx, str);
2806 ai = isl_access_info_add_source(ai, map, 1, &depth);
2807
2808 flow = isl_access_info_compute_flow(ai);
2809 dim = isl_space_alloc(ctx, 0, 5, 5);
2810 mm.must = isl_map_empty(isl_space_copy(dim));
2811 mm.may = isl_map_empty(dim);
2812
2813 isl_flow_foreach(flow, collect_must_may, &mm);
2814
2815 str = "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }";
2816 assert(map_is_equal(mm.must, str))((map_is_equal(mm.must, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.must, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2816, __PRETTY_FUNCTION__))
;
2817 str = "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }";
2818 assert(map_is_equal(mm.may, str))((map_is_equal(mm.may, str)) ? (void) (0) : __assert_fail ("map_is_equal(mm.may, str)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2818, __PRETTY_FUNCTION__))
;
2819
2820 isl_map_free(mm.must);
2821 isl_map_free(mm.may);
2822 isl_flow_free(flow);
2823
2824 return 0;
2825}
2826
2827/* Check that the dependence analysis proceeds without errors.
2828 * Earlier versions of isl would break down during the analysis
2829 * due to the use of the wrong spaces.
2830 */
2831static int test_flow(isl_ctx *ctx)
2832{
2833 const char *str;
2834 isl_union_map *access, *schedule;
2835 isl_union_map *must_dep, *may_dep;
2836 int r;
2837
2838 str = "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }";
2839 access = isl_union_map_read_from_str(ctx, str);
2840 str = "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; "
2841 "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; "
2842 "S2[] -> [1,0,0,0]; "
2843 "S3[] -> [-1,0,0,0] }";
2844 schedule = isl_union_map_read_from_str(ctx, str);
2845 r = isl_union_map_compute_flow(access, isl_union_map_copy(access),
2846 isl_union_map_copy(access), schedule,
2847 &must_dep, &may_dep, NULL((void*)0), NULL((void*)0));
2848 isl_union_map_free(may_dep);
2849 isl_union_map_free(must_dep);
2850
2851 return r;
2852}
2853
2854struct {
2855 const char *map;
2856 int sv;
2857} sv_tests[] = {
2858 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 },
2859 { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 },
2860 { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 },
2861 { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 },
2862 { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 },
2863 { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 },
2864 { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2865 { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 },
2866 { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 },
2867};
2868
2869int test_sv(isl_ctx *ctx)
2870{
2871 isl_union_map *umap;
2872 int i;
2873 int sv;
2874
2875 for (i = 0; i < ARRAY_SIZE(sv_tests)(sizeof(sv_tests)/sizeof(*sv_tests)); ++i) {
2876 umap = isl_union_map_read_from_str(ctx, sv_tests[i].map);
2877 sv = isl_union_map_is_single_valued(umap);
2878 isl_union_map_free(umap);
2879 if (sv < 0)
2880 return -1;
2881 if (sv_tests[i].sv && !sv)
2882 isl_die(ctx, isl_error_internal,do { isl_handle_error(ctx, isl_error_internal, "map not detected as single valued"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2883); return -1; } while (0)
2883 "map not detected as single valued", return -1)do { isl_handle_error(ctx, isl_error_internal, "map not detected as single valued"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2883); return -1; } while (0)
;
2884 if (!sv_tests[i].sv && sv)
2885 isl_die(ctx, isl_error_internal,do { isl_handle_error(ctx, isl_error_internal, "map detected as single valued"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2886); return -1; } while (0)
2886 "map detected as single valued", return -1)do { isl_handle_error(ctx, isl_error_internal, "map detected as single valued"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2886); return -1; } while (0)
;
2887 }
2888
2889 return 0;
2890}
2891
2892struct {
2893 const char *str;
2894 int bijective;
2895} bijective_tests[] = {
2896 { "[N,M]->{[i,j] -> [i]}", 0 },
2897 { "[N,M]->{[i,j] -> [i] : j=i}", 1 },
2898 { "[N,M]->{[i,j] -> [i] : j=0}", 1 },
2899 { "[N,M]->{[i,j] -> [i] : j=N}", 1 },
2900 { "[N,M]->{[i,j] -> [j,i]}", 1 },
2901 { "[N,M]->{[i,j] -> [i+j]}", 0 },
2902 { "[N,M]->{[i,j] -> []}", 0 },
2903 { "[N,M]->{[i,j] -> [i,j,N]}", 1 },
2904 { "[N,M]->{[i,j] -> [2i]}", 0 },
2905 { "[N,M]->{[i,j] -> [i,i]}", 0 },
2906 { "[N,M]->{[i,j] -> [2i,i]}", 0 },
2907 { "[N,M]->{[i,j] -> [2i,j]}", 1 },
2908 { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 },
2909};
2910
2911static int test_bijective(struct isl_ctx *ctx)
2912{
2913 isl_map *map;
2914 int i;
2915 int bijective;
2916
2917 for (i = 0; i < ARRAY_SIZE(bijective_tests)(sizeof(bijective_tests)/sizeof(*bijective_tests)); ++i) {
2918 map = isl_map_read_from_str(ctx, bijective_tests[i].str);
2919 bijective = isl_map_is_bijective(map);
2920 isl_map_free(map);
2921 if (bijective < 0)
2922 return -1;
2923 if (bijective_tests[i].bijective && !bijective)
2924 isl_die(ctx, isl_error_internal,do { isl_handle_error(ctx, isl_error_internal, "map not detected as bijective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2925); return -1; } while (0)
2925 "map not detected as bijective", return -1)do { isl_handle_error(ctx, isl_error_internal, "map not detected as bijective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2925); return -1; } while (0)
;
2926 if (!bijective_tests[i].bijective && bijective)
2927 isl_die(ctx, isl_error_internal,do { isl_handle_error(ctx, isl_error_internal, "map detected as bijective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2928); return -1; } while (0)
2928 "map detected as bijective", return -1)do { isl_handle_error(ctx, isl_error_internal, "map detected as bijective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2928); return -1; } while (0)
;
2929 }
2930
2931 return 0;
2932}
2933
2934/* Inputs for isl_pw_qpolynomial_gist tests.
2935 * "pwqp" is the input, "set" is the context and "gist" is the expected result.
2936 */
2937struct {
2938 const char *pwqp;
2939 const char *set;
2940 const char *gist;
2941} pwqp_gist_tests[] = {
2942 { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" },
2943 { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" },
2944 { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }",
2945 "{ [i] -> -1/2 + 1/2 * i }" },
2946 { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" },
2947};
2948
2949static int test_pwqp(struct isl_ctx *ctx)
2950{
2951 int i;
2952 const char *str;
2953 isl_setisl_map *set;
2954 isl_pw_qpolynomial *pwqp1, *pwqp2;
2955 int equal;
2956
2957 str = "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2958 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2959
2960 pwqp1 = isl_pw_qpolynomial_move_dims(pwqp1, isl_dim_param, 0,
2961 isl_dim_in, 1, 1);
2962
2963 str = "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }";
2964 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2965
2966 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2967
2968 assert(isl_pw_qpolynomial_is_zero(pwqp1))((isl_pw_qpolynomial_is_zero(pwqp1)) ? (void) (0) : __assert_fail
("isl_pw_qpolynomial_is_zero(pwqp1)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2968, __PRETTY_FUNCTION__))
;
2969
2970 isl_pw_qpolynomial_free(pwqp1);
2971
2972 for (i = 0; i < ARRAY_SIZE(pwqp_gist_tests)(sizeof(pwqp_gist_tests)/sizeof(*pwqp_gist_tests)); ++i) {
2973 str = pwqp_gist_tests[i].pwqp;
2974 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2975 str = pwqp_gist_tests[i].set;
2976 set = isl_set_read_from_str(ctx, str);
2977 pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set);
2978 str = pwqp_gist_tests[i].gist;
2979 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2980 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2981 equal = isl_pw_qpolynomial_is_zero(pwqp1);
2982 isl_pw_qpolynomial_free(pwqp1);
2983
2984 if (equal < 0)
2985 return -1;
2986 if (!equal)
2987 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2988); return -1; } while (0)
2988 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2988); return -1; } while (0)
;
2989 }
2990
2991 str = "{ [i] -> ([([i/2] + [i/2])/5]) }";
2992 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
2993 str = "{ [i] -> ([(2 * [i/2])/5]) }";
2994 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
2995
2996 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
2997
2998 assert(isl_pw_qpolynomial_is_zero(pwqp1))((isl_pw_qpolynomial_is_zero(pwqp1)) ? (void) (0) : __assert_fail
("isl_pw_qpolynomial_is_zero(pwqp1)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 2998, __PRETTY_FUNCTION__))
;
2999
3000 isl_pw_qpolynomial_free(pwqp1);
3001
3002 str = "{ [x] -> ([x/2] + [(x+1)/2]) }";
3003 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
3004 str = "{ [x] -> x }";
3005 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
3006
3007 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
3008
3009 assert(isl_pw_qpolynomial_is_zero(pwqp1))((isl_pw_qpolynomial_is_zero(pwqp1)) ? (void) (0) : __assert_fail
("isl_pw_qpolynomial_is_zero(pwqp1)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3009, __PRETTY_FUNCTION__))
;
3010
3011 isl_pw_qpolynomial_free(pwqp1);
3012
3013 str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }";
3014 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
3015 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
3016 pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1);
3017 pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2);
3018 assert(isl_pw_qpolynomial_is_zero(pwqp1))((isl_pw_qpolynomial_is_zero(pwqp1)) ? (void) (0) : __assert_fail
("isl_pw_qpolynomial_is_zero(pwqp1)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3018, __PRETTY_FUNCTION__))
;
3019 isl_pw_qpolynomial_free(pwqp1);
3020
3021 str = "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }";
3022 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
3023 str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
3024 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
3025 set = isl_set_read_from_str(ctx, "{ [a,b,a] }");
3026 pwqp1 = isl_pw_qpolynomial_intersect_domain(pwqp1, set);
3027 equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2);
3028 isl_pw_qpolynomial_free(pwqp1);
3029 isl_pw_qpolynomial_free(pwqp2);
3030 if (equal < 0)
3031 return -1;
3032 if (!equal)
3033 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3033); return -1; } while (0)
;
3034
3035 str = "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }";
3036 pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str);
3037 str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }";
3038 pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str);
3039 pwqp1 = isl_pw_qpolynomial_fix_val(pwqp1, isl_dim_set, 1,
3040 isl_val_one(ctx));
3041 equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2);
3042 isl_pw_qpolynomial_free(pwqp1);
3043 isl_pw_qpolynomial_free(pwqp2);
3044 if (equal < 0)
3045 return -1;
3046 if (!equal)
3047 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3047); return -1; } while (0)
;
3048
3049 return 0;
3050}
3051
3052static int test_split_periods(isl_ctx *ctx)
3053{
3054 const char *str;
3055 isl_pw_qpolynomial *pwqp;
3056
3057 str = "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : "
3058 "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and "
3059 "U >= 0; [U,V] -> U^2 : U >= 100 }";
3060 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
3061
3062 pwqp = isl_pw_qpolynomial_split_periods(pwqp, 2);
3063
3064 isl_pw_qpolynomial_free(pwqp);
3065
3066 if (!pwqp)
3067 return -1;
3068
3069 return 0;
3070}
3071
3072static int test_union(isl_ctx *ctx)
3073{
3074 const char *str;
3075 isl_union_set *uset1, *uset2;
3076 isl_union_map *umap1, *umap2;
3077 int equal;
3078
3079 str = "{ [i] : 0 <= i <= 1 }";
3080 uset1 = isl_union_set_read_from_str(ctx, str);
3081 str = "{ [1] -> [0] }";
3082 umap1 = isl_union_map_read_from_str(ctx, str);
3083
3084 umap2 = isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1), uset1);
3085 equal = isl_union_map_is_equal(umap1, umap2);
3086
3087 isl_union_map_free(umap1);
3088 isl_union_map_free(umap2);
3089
3090 if (equal < 0)
3091 return -1;
3092 if (!equal)
3093 isl_die(ctx, isl_error_unknown, "union maps not equal",do { isl_handle_error(ctx, isl_error_unknown, "union maps not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3094); return -1; } while (0)
3094 return -1)do { isl_handle_error(ctx, isl_error_unknown, "union maps not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3094); return -1; } while (0)
;
3095
3096 str = "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }";
3097 umap1 = isl_union_map_read_from_str(ctx, str);
3098 str = "{ A[i]; B[i] }";
3099 uset1 = isl_union_set_read_from_str(ctx, str);
3100
3101 uset2 = isl_union_map_domain(umap1);
3102
3103 equal = isl_union_set_is_equal(uset1, uset2);
3104
3105 isl_union_set_free(uset1);
3106 isl_union_set_free(uset2);
3107
3108 if (equal < 0)
3109 return -1;
3110 if (!equal)
3111 isl_die(ctx, isl_error_unknown, "union sets not equal",do { isl_handle_error(ctx, isl_error_unknown, "union sets not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3112); return -1; } while (0)
3112 return -1)do { isl_handle_error(ctx, isl_error_unknown, "union sets not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3112); return -1; } while (0)
;
3113
3114 return 0;
3115}
3116
3117/* Check that computing a bound of a non-zero polynomial over an unbounded
3118 * domain does not produce a rational value.
3119 * In particular, check that the upper bound is infinity.
3120 */
3121static int test_bound_unbounded_domain(isl_ctx *ctx)
3122{
3123 const char *str;
3124 isl_pw_qpolynomial *pwqp;
3125 isl_pw_qpolynomial_fold *pwf, *pwf2;
3126 isl_bool equal;
3127
3128 str = "{ [m,n] -> -m * n }";
3129 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
3130 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL((void*)0));
3131 str = "{ infty }";
3132 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
3133 pwf2 = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL((void*)0));
3134 equal = isl_pw_qpolynomial_fold_plain_is_equal(pwf, pwf2);
3135 isl_pw_qpolynomial_fold_free(pwf);
3136 isl_pw_qpolynomial_fold_free(pwf2);
3137
3138 if (equal < 0)
3139 return -1;
3140 if (!equal)
3141 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expecting infinite polynomial bound"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3142); return -1; } while (0)
3142 "expecting infinite polynomial bound", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting infinite polynomial bound"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3142); return -1; } while (0)
;
3143
3144 return 0;
3145}
3146
3147static int test_bound(isl_ctx *ctx)
3148{
3149 const char *str;
3150 unsigned dim;
3151 isl_pw_qpolynomial *pwqp;
3152 isl_pw_qpolynomial_fold *pwf;
3153
3154 if (test_bound_unbounded_domain(ctx) < 0)
3155 return -1;
3156
3157 str = "{ [[a, b, c, d] -> [e]] -> 0 }";
3158 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
3159 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL((void*)0));
3160 dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in);
3161 isl_pw_qpolynomial_fold_free(pwf);
3162 if (dim != 4)
3163 isl_die(ctx, isl_error_unknown, "unexpected input dimension",do { isl_handle_error(ctx, isl_error_unknown, "unexpected input dimension"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3164); return -1; } while (0)
3164 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected input dimension"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3164); return -1; } while (0)
;
3165
3166 str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }";
3167 pwqp = isl_pw_qpolynomial_read_from_str(ctx, str);
3168 pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL((void*)0));
3169 dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in);
3170 isl_pw_qpolynomial_fold_free(pwf);
3171 if (dim != 1)
3172 isl_die(ctx, isl_error_unknown, "unexpected input dimension",do { isl_handle_error(ctx, isl_error_unknown, "unexpected input dimension"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3173); return -1; } while (0)
3173 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected input dimension"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3173); return -1; } while (0)
;
3174
3175 return 0;
3176}
3177
3178static int test_lift(isl_ctx *ctx)
3179{
3180 const char *str;
3181 isl_basic_map *bmap;
3182 isl_basic_setisl_basic_map *bset;
3183
3184 str = "{ [i0] : exists e0 : i0 = 4e0 }";
3185 bset = isl_basic_set_read_from_str(ctx, str);
3186 bset = isl_basic_set_lift(bset);
3187 bmap = isl_basic_map_from_range(bset);
3188 bset = isl_basic_map_domain(bmap);
3189 isl_basic_set_free(bset);
3190
3191 return 0;
3192}
3193
3194struct {
3195 const char *set1;
3196 const char *set2;
3197 int subset;
3198} subset_tests[] = {
3199 { "{ [112, 0] }",
3200 "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: "
3201 "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and "
3202 "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 },
3203 { "{ [65] }",
3204 "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], "
3205 "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], "
3206 "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: "
3207 "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and "
3208 "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and "
3209 "256e0 <= 255i and 256e0 >= -255 + 255i and "
3210 "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and "
3211 "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and "
3212 "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 },
3213 { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 },
3214 { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 },
3215 { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 },
3216 { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 },
3217 { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and "
3218 "4e0 >= -1 + t and i >= 57 and i <= 62 and "
3219 "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and "
3220 "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and "
3221 "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }",
3222 "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and "
3223 "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and "
3224 "4e0 <= -57 + i0 + i1)) or "
3225 "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and "
3226 "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and "
3227 "4e0 >= -61 + i0 + i1)) or "
3228 "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 },
3229 { "[a, b] -> { : a = 0 and b = -1 }", "[b, a] -> { : b >= -10 }", 1 },
3230};
3231
3232static int test_subset(isl_ctx *ctx)
3233{
3234 int i;
3235 isl_setisl_map *set1, *set2;
3236 int subset;
3237
3238 for (i = 0; i < ARRAY_SIZE(subset_tests)(sizeof(subset_tests)/sizeof(*subset_tests)); ++i) {
3239 set1 = isl_set_read_from_str(ctx, subset_tests[i].set1);
3240 set2 = isl_set_read_from_str(ctx, subset_tests[i].set2);
3241 subset = isl_set_is_subset(set1, set2);
3242 isl_set_free(set1);
3243 isl_set_free(set2);
3244 if (subset < 0)
3245 return -1;
3246 if (subset != subset_tests[i].subset)
3247 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect subset result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3248); return -1; } while (0)
3248 "incorrect subset result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect subset result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3248); return -1; } while (0)
;
3249 }
3250
3251 return 0;
3252}
3253
3254struct {
3255 const char *minuend;
3256 const char *subtrahend;
3257 const char *difference;
3258} subtract_domain_tests[] = {
3259 { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" },
3260 { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" },
3261 { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" },
3262};
3263
3264static int test_subtract(isl_ctx *ctx)
3265{
3266 int i;
3267 isl_union_map *umap1, *umap2;
3268 isl_union_pw_multi_aff *upma1, *upma2;
3269 isl_union_set *uset;
3270 int equal;
3271
3272 for (i = 0; i < ARRAY_SIZE(subtract_domain_tests)(sizeof(subtract_domain_tests)/sizeof(*subtract_domain_tests)
)
; ++i) {
3273 umap1 = isl_union_map_read_from_str(ctx,
3274 subtract_domain_tests[i].minuend);
3275 uset = isl_union_set_read_from_str(ctx,
3276 subtract_domain_tests[i].subtrahend);
3277 umap2 = isl_union_map_read_from_str(ctx,
3278 subtract_domain_tests[i].difference);
3279 umap1 = isl_union_map_subtract_domain(umap1, uset);
3280 equal = isl_union_map_is_equal(umap1, umap2);
3281 isl_union_map_free(umap1);
3282 isl_union_map_free(umap2);
3283 if (equal < 0)
3284 return -1;
3285 if (!equal)
3286 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect subtract domain result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3287); return -1; } while (0)
3287 "incorrect subtract domain result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect subtract domain result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3287); return -1; } while (0)
;
3288 }
3289
3290 for (i = 0; i < ARRAY_SIZE(subtract_domain_tests)(sizeof(subtract_domain_tests)/sizeof(*subtract_domain_tests)
)
; ++i) {
3291 upma1 = isl_union_pw_multi_aff_read_from_str(ctx,
3292 subtract_domain_tests[i].minuend);
3293 uset = isl_union_set_read_from_str(ctx,
3294 subtract_domain_tests[i].subtrahend);
3295 upma2 = isl_union_pw_multi_aff_read_from_str(ctx,
3296 subtract_domain_tests[i].difference);
3297 upma1 = isl_union_pw_multi_aff_subtract_domain(upma1, uset);
3298 equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2);
3299 isl_union_pw_multi_aff_free(upma1);
3300 isl_union_pw_multi_aff_free(upma2);
3301 if (equal < 0)
3302 return -1;
3303 if (!equal)
3304 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect subtract domain result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3305); return -1; } while (0)
3305 "incorrect subtract domain result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect subtract domain result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3305); return -1; } while (0)
;
3306 }
3307
3308 return 0;
3309}
3310
3311/* Check that intersecting the empty basic set with another basic set
3312 * does not increase the number of constraints. In particular,
3313 * the empty basic set should maintain its canonical representation.
3314 */
3315static int test_intersect(isl_ctx *ctx)
3316{
3317 int n1, n2;
3318 isl_basic_setisl_basic_map *bset1, *bset2;
3319
3320 bset1 = isl_basic_set_read_from_str(ctx, "{ [a,b,c] : 1 = 0 }");
3321 bset2 = isl_basic_set_read_from_str(ctx, "{ [1,2,3] }");
3322 n1 = isl_basic_set_n_constraint(bset1);
3323 bset1 = isl_basic_set_intersect(bset1, bset2);
3324 n2 = isl_basic_set_n_constraint(bset1);
3325 isl_basic_set_free(bset1);
3326 if (!bset1)
3327 return -1;
3328 if (n1 != n2)
3329 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "number of constraints of empty set changed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3331); return -1; } while (0)
3330 "number of constraints of empty set changed",do { isl_handle_error(ctx, isl_error_unknown, "number of constraints of empty set changed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3331); return -1; } while (0)
3331 return -1)do { isl_handle_error(ctx, isl_error_unknown, "number of constraints of empty set changed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3331); return -1; } while (0)
;
3332
3333 return 0;
3334}
3335
3336int test_factorize(isl_ctx *ctx)
3337{
3338 const char *str;
3339 isl_basic_setisl_basic_map *bset;
3340 isl_factorizer *f;
3341
3342 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and "
3343 "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and "
3344 "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and "
3345 "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and "
3346 "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and "
3347 "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and "
3348 "3i5 >= -2i0 - i2 + 3i4 }";
3349 bset = isl_basic_set_read_from_str(ctx, str);
3350 f = isl_basic_set_factorizer(bset);
3351 isl_basic_set_free(bset);
3352 isl_factorizer_free(f);
3353 if (!f)
3354 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "failed to construct factorizer"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3355); return -1; } while (0)
3355 "failed to construct factorizer", return -1)do { isl_handle_error(ctx, isl_error_unknown, "failed to construct factorizer"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3355); return -1; } while (0)
;
3356
3357 str = "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : "
3358 "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and "
3359 "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and "
3360 "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and "
3361 "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and "
3362 "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and "
3363 "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and "
3364 "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and "
3365 "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and "
3366 "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }";
3367 bset = isl_basic_set_read_from_str(ctx, str);
3368 f = isl_basic_set_factorizer(bset);
3369 isl_basic_set_free(bset);
3370 isl_factorizer_free(f);
3371 if (!f)
3372 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "failed to construct factorizer"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3373); return -1; } while (0)
3373 "failed to construct factorizer", return -1)do { isl_handle_error(ctx, isl_error_unknown, "failed to construct factorizer"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3373); return -1; } while (0)
;
3374
3375 return 0;
3376}
3377
3378static isl_stat check_injective(__isl_take isl_map *map, void *user)
3379{
3380 int *injective = user;
3381
3382 *injective = isl_map_is_injective(map);
3383 isl_map_free(map);
3384
3385 if (*injective < 0 || !*injective)
3386 return isl_stat_error;
3387
3388 return isl_stat_ok;
3389}
3390
3391int test_one_schedule(isl_ctx *ctx, const char *d, const char *w,
3392 const char *r, const char *s, int tilable, int parallel)
3393{
3394 int i;
3395 isl_union_set *D;
3396 isl_union_map *W, *R, *S;
3397 isl_union_map *empty;
3398 isl_union_map *dep_raw, *dep_war, *dep_waw, *dep;
3399 isl_union_map *validity, *proximity, *coincidence;
3400 isl_union_map *schedule;
3401 isl_union_map *test;
3402 isl_union_set *delta;
3403 isl_union_set *domain;
3404 isl_setisl_map *delta_set;
3405 isl_setisl_map *slice;
3406 isl_setisl_map *origin;
3407 isl_schedule_constraints *sc;
3408 isl_schedule *sched;
3409 int is_nonneg, is_parallel, is_tilable, is_injection, is_complete;
3410
3411 D = isl_union_set_read_from_str(ctx, d);
3412 W = isl_union_map_read_from_str(ctx, w);
3413 R = isl_union_map_read_from_str(ctx, r);
3414 S = isl_union_map_read_from_str(ctx, s);
3415
3416 W = isl_union_map_intersect_domain(W, isl_union_set_copy(D));
3417 R = isl_union_map_intersect_domain(R, isl_union_set_copy(D));
3418
3419 empty = isl_union_map_empty(isl_union_map_get_space(S));
3420 isl_union_map_compute_flow(isl_union_map_copy(R),
3421 isl_union_map_copy(W), empty,
3422 isl_union_map_copy(S),
3423 &dep_raw, NULL((void*)0), NULL((void*)0), NULL((void*)0));
3424 isl_union_map_compute_flow(isl_union_map_copy(W),
3425 isl_union_map_copy(W),
3426 isl_union_map_copy(R),
3427 isl_union_map_copy(S),
3428 &dep_waw, &dep_war, NULL((void*)0), NULL((void*)0));
3429
3430 dep = isl_union_map_union(dep_waw, dep_war);
3431 dep = isl_union_map_union(dep, dep_raw);
3432 validity = isl_union_map_copy(dep);
3433 coincidence = isl_union_map_copy(dep);
3434 proximity = isl_union_map_copy(dep);
3435
3436 sc = isl_schedule_constraints_on_domain(isl_union_set_copy(D));
3437 sc = isl_schedule_constraints_set_validity(sc, validity);
3438 sc = isl_schedule_constraints_set_coincidence(sc, coincidence);
3439 sc = isl_schedule_constraints_set_proximity(sc, proximity);
3440 sched = isl_schedule_constraints_compute_schedule(sc);
3441 schedule = isl_schedule_get_map(sched);
3442 isl_schedule_free(sched);
3443 isl_union_map_free(W);
3444 isl_union_map_free(R);
3445 isl_union_map_free(S);
3446
3447 is_injection = 1;
3448 isl_union_map_foreach_map(schedule, &check_injective, &is_injection);
3449
3450 domain = isl_union_map_domain(isl_union_map_copy(schedule));
3451 is_complete = isl_union_set_is_subset(D, domain);
3452 isl_union_set_free(D);
3453 isl_union_set_free(domain);
3454
3455 test = isl_union_map_reverse(isl_union_map_copy(schedule));
3456 test = isl_union_map_apply_range(test, dep);
3457 test = isl_union_map_apply_range(test, schedule);
3458
3459 delta = isl_union_map_deltas(test);
3460 if (isl_union_set_n_set(delta) == 0) {
3461 is_tilable = 1;
3462 is_parallel = 1;
3463 is_nonneg = 1;
3464 isl_union_set_free(delta);
3465 } else {
3466 delta_set = isl_set_from_union_set(delta);
3467
3468 slice = isl_set_universe(isl_set_get_space(delta_set));
3469 for (i = 0; i < tilable; ++i)
3470 slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0);
3471 is_tilable = isl_set_is_subset(delta_set, slice);
3472 isl_set_free(slice);
3473
3474 slice = isl_set_universe(isl_set_get_space(delta_set));
3475 for (i = 0; i < parallel; ++i)
3476 slice = isl_set_fix_si(slice, isl_dim_set, i, 0);
3477 is_parallel = isl_set_is_subset(delta_set, slice);
3478 isl_set_free(slice);
3479
3480 origin = isl_set_universe(isl_set_get_space(delta_set));
3481 for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i)
3482 origin = isl_set_fix_si(origin, isl_dim_set, i, 0);
3483
3484 delta_set = isl_set_union(delta_set, isl_set_copy(origin));
3485 delta_set = isl_set_lexmin(delta_set);
3486
3487 is_nonneg = isl_set_is_equal(delta_set, origin);
3488
3489 isl_set_free(origin);
3490 isl_set_free(delta_set);
3491 }
3492
3493 if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 ||
3494 is_injection < 0 || is_complete < 0)
3495 return -1;
3496 if (!is_complete)
3497 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "generated schedule incomplete"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3498); return -1; } while (0)
3498 "generated schedule incomplete", return -1)do { isl_handle_error(ctx, isl_error_unknown, "generated schedule incomplete"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3498); return -1; } while (0)
;
3499 if (!is_injection)
3500 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not injective on each statement"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3502); return -1; } while (0)
3501 "generated schedule not injective on each statement",do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not injective on each statement"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3502); return -1; } while (0)
3502 return -1)do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not injective on each statement"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3502); return -1; } while (0)
;
3503 if (!is_nonneg)
3504 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "negative dependences in generated schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3506); return -1; } while (0)
3505 "negative dependences in generated schedule",do { isl_handle_error(ctx, isl_error_unknown, "negative dependences in generated schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3506); return -1; } while (0)
3506 return -1)do { isl_handle_error(ctx, isl_error_unknown, "negative dependences in generated schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3506); return -1; } while (0)
;
3507 if (!is_tilable)
3508 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as tilable as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3510); return -1; } while (0)
3509 "generated schedule not as tilable as expected",do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as tilable as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3510); return -1; } while (0)
3510 return -1)do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as tilable as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3510); return -1; } while (0)
;
3511 if (!is_parallel)
3512 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as parallel as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3514); return -1; } while (0)
3513 "generated schedule not as parallel as expected",do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as parallel as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3514); return -1; } while (0)
3514 return -1)do { isl_handle_error(ctx, isl_error_unknown, "generated schedule not as parallel as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3514); return -1; } while (0)
;
3515
3516 return 0;
3517}
3518
3519/* Compute a schedule for the given instance set, validity constraints,
3520 * proximity constraints and context and return a corresponding union map
3521 * representation.
3522 */
3523static __isl_give isl_union_map *compute_schedule_with_context(isl_ctx *ctx,
3524 const char *domain, const char *validity, const char *proximity,
3525 const char *context)
3526{
3527 isl_setisl_map *con;
3528 isl_union_set *dom;
3529 isl_union_map *dep;
3530 isl_union_map *prox;
3531 isl_schedule_constraints *sc;
3532 isl_schedule *schedule;
3533 isl_union_map *sched;
3534
3535 con = isl_set_read_from_str(ctx, context);
3536 dom = isl_union_set_read_from_str(ctx, domain);
3537 dep = isl_union_map_read_from_str(ctx, validity);
3538 prox = isl_union_map_read_from_str(ctx, proximity);
3539 sc = isl_schedule_constraints_on_domain(dom);
3540 sc = isl_schedule_constraints_set_context(sc, con);
3541 sc = isl_schedule_constraints_set_validity(sc, dep);
3542 sc = isl_schedule_constraints_set_proximity(sc, prox);
3543 schedule = isl_schedule_constraints_compute_schedule(sc);
3544 sched = isl_schedule_get_map(schedule);
3545 isl_schedule_free(schedule);
3546
3547 return sched;
3548}
3549
3550/* Compute a schedule for the given instance set, validity constraints and
3551 * proximity constraints and return a corresponding union map representation.
3552 */
3553static __isl_give isl_union_map *compute_schedule(isl_ctx *ctx,
3554 const char *domain, const char *validity, const char *proximity)
3555{
3556 return compute_schedule_with_context(ctx, domain, validity, proximity,
3557 "{ : }");
3558}
3559
3560/* Check that a schedule can be constructed on the given domain
3561 * with the given validity and proximity constraints.
3562 */
3563static int test_has_schedule(isl_ctx *ctx, const char *domain,
3564 const char *validity, const char *proximity)
3565{
3566 isl_union_map *sched;
3567
3568 sched = compute_schedule(ctx, domain, validity, proximity);
3569 if (!sched)
3570 return -1;
3571
3572 isl_union_map_free(sched);
3573 return 0;
3574}
3575
3576int test_special_schedule(isl_ctx *ctx, const char *domain,
3577 const char *validity, const char *proximity, const char *expected_sched)
3578{
3579 isl_union_map *sched1, *sched2;
3580 int equal;
3581
3582 sched1 = compute_schedule(ctx, domain, validity, proximity);
3583 sched2 = isl_union_map_read_from_str(ctx, expected_sched);
3584
3585 equal = isl_union_map_is_equal(sched1, sched2);
3586 isl_union_map_free(sched1);
3587 isl_union_map_free(sched2);
3588
3589 if (equal < 0)
3590 return -1;
3591 if (!equal)
3592 isl_die(ctx, isl_error_unknown, "unexpected schedule",do { isl_handle_error(ctx, isl_error_unknown, "unexpected schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3593); return -1; } while (0)
3593 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3593); return -1; } while (0)
;
3594
3595 return 0;
3596}
3597
3598/* Check that the schedule map is properly padded, even after being
3599 * reconstructed from the band forest.
3600 */
3601static int test_padded_schedule(isl_ctx *ctx)
3602{
3603 const char *str;
3604 isl_union_set *D;
3605 isl_union_map *validity, *proximity;
3606 isl_schedule_constraints *sc;
3607 isl_schedule *sched;
3608 isl_union_map *map1, *map2;
3609 isl_band_list *list;
3610 int equal;
3611
3612 str = "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }";
3613 D = isl_union_set_read_from_str(ctx, str);
3614 validity = isl_union_map_empty(isl_union_set_get_space(D));
3615 proximity = isl_union_map_copy(validity);
3616 sc = isl_schedule_constraints_on_domain(D);
3617 sc = isl_schedule_constraints_set_validity(sc, validity);
3618 sc = isl_schedule_constraints_set_proximity(sc, proximity);
3619 sched = isl_schedule_constraints_compute_schedule(sc);
3620 map1 = isl_schedule_get_map(sched);
3621 list = isl_schedule_get_band_forest(sched);
3622 isl_band_list_free(list);
3623 map2 = isl_schedule_get_map(sched);
3624 isl_schedule_free(sched);
3625 equal = isl_union_map_is_equal(map1, map2);
3626 isl_union_map_free(map1);
3627 isl_union_map_free(map2);
3628
3629 if (equal < 0)
3630 return -1;
3631 if (!equal)
3632 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "reconstructed schedule map not the same as original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3634); return -1; } while (0)
3633 "reconstructed schedule map not the same as original",do { isl_handle_error(ctx, isl_error_unknown, "reconstructed schedule map not the same as original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3634); return -1; } while (0)
3634 return -1)do { isl_handle_error(ctx, isl_error_unknown, "reconstructed schedule map not the same as original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3634); return -1; } while (0)
;
3635
3636 return 0;
3637}
3638
3639/* Check that conditional validity constraints are also taken into
3640 * account across bands.
3641 * In particular, try to make sure that live ranges D[1,0]->C[2,1] and
3642 * D[2,0]->C[3,0] are not local in the outer band of the generated schedule
3643 * and then check that the adjacent order constraint C[2,1]->D[2,0]
3644 * is enforced by the rest of the schedule.
3645 */
3646static int test_special_conditional_schedule_constraints(isl_ctx *ctx)
3647{
3648 const char *str;
3649 isl_union_set *domain;
3650 isl_union_map *validity, *proximity, *condition;
3651 isl_union_map *sink, *source, *dep;
3652 isl_schedule_constraints *sc;
3653 isl_schedule *schedule;
3654 isl_union_access_info *access;
3655 isl_union_flow *flow;
3656 int empty;
3657
3658 str = "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3659 "A[k] : k >= 1 and k <= -1 + n; "
3660 "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; "
3661 "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }";
3662 domain = isl_union_set_read_from_str(ctx, str);
3663 sc = isl_schedule_constraints_on_domain(domain);
3664 str = "[n] -> { D[k, i] -> C[1 + k, k - i] : "
3665 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3666 "D[k, i] -> C[1 + k, i] : "
3667 "k <= -2 + n and i >= 1 and i <= -1 + k; "
3668 "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; "
3669 "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }";
3670 validity = isl_union_map_read_from_str(ctx, str);
3671 sc = isl_schedule_constraints_set_validity(sc, validity);
3672 str = "[n] -> { C[k, i] -> D[k, i] : "
3673 "0 <= i <= -1 + k and k <= -1 + n }";
3674 proximity = isl_union_map_read_from_str(ctx, str);
3675 sc = isl_schedule_constraints_set_proximity(sc, proximity);
3676 str = "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : "
3677 "i <= -1 + k and i >= 1 and k <= -2 + n; "
3678 "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : "
3679 "k <= -1 + n and i >= 0 and i <= -2 + k }";
3680 condition = isl_union_map_read_from_str(ctx, str);
3681 str = "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : "
3682 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3683 "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : "
3684 "i >= 0 and i <= -1 + k and k <= -1 + n and "
3685 "k' <= -1 + n and k' >= k - i and k' >= 1 + k; "
3686 "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : "
3687 "i >= 0 and i <= -1 + k and k <= -1 + n; "
3688 "[B[k, i] -> c[]] -> [A[k'] -> d[]] : "
3689 "k <= -1 + n and i >= 0 and i <= -1 + k and "
3690 "k' >= 1 and k' <= -1 + n and k' >= 1 + k }";
3691 validity = isl_union_map_read_from_str(ctx, str);
3692 sc = isl_schedule_constraints_set_conditional_validity(sc, condition,
3693 validity);
3694 schedule = isl_schedule_constraints_compute_schedule(sc);
3695 str = "{ D[2,0] -> [] }";
3696 sink = isl_union_map_read_from_str(ctx, str);
3697 access = isl_union_access_info_from_sink(sink);
3698 str = "{ C[2,1] -> [] }";
3699 source = isl_union_map_read_from_str(ctx, str);
3700 access = isl_union_access_info_set_must_source(access, source);
3701 access = isl_union_access_info_set_schedule(access, schedule);
3702 flow = isl_union_access_info_compute_flow(access);
3703 dep = isl_union_flow_get_must_dependence(flow);
3704 isl_union_flow_free(flow);
3705 empty = isl_union_map_is_empty(dep);
3706 isl_union_map_free(dep);
3707
3708 if (empty < 0)
3709 return -1;
3710 if (empty)
3711 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "conditional validity not respected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3712); return -1; } while (0)
3712 "conditional validity not respected", return -1)do { isl_handle_error(ctx, isl_error_unknown, "conditional validity not respected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3712); return -1; } while (0)
;
3713
3714 return 0;
3715}
3716
3717/* Input for testing of schedule construction based on
3718 * conditional constraints.
3719 *
3720 * domain is the iteration domain
3721 * flow are the flow dependences, which determine the validity and
3722 * proximity constraints
3723 * condition are the conditions on the conditional validity constraints
3724 * conditional_validity are the conditional validity constraints
3725 * outer_band_n is the expected number of members in the outer band
3726 */
3727struct {
3728 const char *domain;
3729 const char *flow;
3730 const char *condition;
3731 const char *conditional_validity;
3732 int outer_band_n;
3733} live_range_tests[] = {
3734 /* Contrived example that illustrates that we need to keep
3735 * track of tagged condition dependences and
3736 * tagged conditional validity dependences
3737 * in isl_sched_edge separately.
3738 * In particular, the conditional validity constraints on A
3739 * cannot be satisfied,
3740 * but they can be ignored because there are no corresponding
3741 * condition constraints. However, we do have an additional
3742 * conditional validity constraint that maps to the same
3743 * dependence relation
3744 * as the condition constraint on B. If we did not make a distinction
3745 * between tagged condition and tagged conditional validity
3746 * dependences, then we
3747 * could end up treating this shared dependence as an condition
3748 * constraint on A, forcing a localization of the conditions,
3749 * which is impossible.
3750 */
3751 { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }",
3752 "{ S[i] -> S[i+1] : 0 <= i < 99 }",
3753 "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }",
3754 "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3755 "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';"
3756 "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }",
3757 1
3758 },
3759 /* TACO 2013 Fig. 7 */
3760 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3761 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3762 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3763 "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;"
3764 "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : "
3765 "0 <= i < n and 0 <= j < n - 1 }",
3766 "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : "
3767 "0 <= i < n and 0 <= j < j' < n;"
3768 "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : "
3769 "0 <= i < i' < n and 0 <= j,j' < n;"
3770 "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : "
3771 "0 <= i,j,j' < n and j < j' }",
3772 2
3773 },
3774 /* TACO 2013 Fig. 7, without tags */
3775 { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }",
3776 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3777 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3778 "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;"
3779 "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }",
3780 "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;"
3781 "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;"
3782 "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }",
3783 1
3784 },
3785 /* TACO 2013 Fig. 12 */
3786 { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;"
3787 "S3[i,3] : 0 <= i <= 1 }",
3788 "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;"
3789 "S2[i,1] -> S2[i,2] : 0 <= i <= 1;"
3790 "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }",
3791 "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;"
3792 "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3793 "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }",
3794 "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;"
3795 "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;"
3796 "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;"
3797 "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;"
3798 "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }",
3799 1
3800 }
3801};
3802
3803/* Test schedule construction based on conditional constraints.
3804 * In particular, check the number of members in the outer band node
3805 * as an indication of whether tiling is possible or not.
3806 */
3807static int test_conditional_schedule_constraints(isl_ctx *ctx)
3808{
3809 int i;
3810 isl_union_set *domain;
3811 isl_union_map *condition;
3812 isl_union_map *flow;
3813 isl_union_map *validity;
3814 isl_schedule_constraints *sc;
3815 isl_schedule *schedule;
3816 isl_schedule_node *node;
3817 int n_member;
3818
3819 if (test_special_conditional_schedule_constraints(ctx) < 0)
3820 return -1;
3821
3822 for (i = 0; i < ARRAY_SIZE(live_range_tests)(sizeof(live_range_tests)/sizeof(*live_range_tests)); ++i) {
3823 domain = isl_union_set_read_from_str(ctx,
3824 live_range_tests[i].domain);
3825 flow = isl_union_map_read_from_str(ctx,
3826 live_range_tests[i].flow);
3827 condition = isl_union_map_read_from_str(ctx,
3828 live_range_tests[i].condition);
3829 validity = isl_union_map_read_from_str(ctx,
3830 live_range_tests[i].conditional_validity);
3831 sc = isl_schedule_constraints_on_domain(domain);
3832 sc = isl_schedule_constraints_set_validity(sc,
3833 isl_union_map_copy(flow));
3834 sc = isl_schedule_constraints_set_proximity(sc, flow);
3835 sc = isl_schedule_constraints_set_conditional_validity(sc,
3836 condition, validity);
3837 schedule = isl_schedule_constraints_compute_schedule(sc);
3838 node = isl_schedule_get_root(schedule);
3839 while (node &&
3840 isl_schedule_node_get_type(node) != isl_schedule_node_band)
3841 node = isl_schedule_node_first_child(node);
3842 n_member = isl_schedule_node_band_n_member(node);
3843 isl_schedule_node_free(node);
3844 isl_schedule_free(schedule);
3845
3846 if (!schedule)
3847 return -1;
3848 if (n_member != live_range_tests[i].outer_band_n)
3849 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of members in outer band"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3851); return -1; } while (0)
3850 "unexpected number of members in outer band",do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of members in outer band"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3851); return -1; } while (0)
3851 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of members in outer band"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3851); return -1; } while (0)
;
3852 }
3853 return 0;
3854}
3855
3856/* Check that the schedule computed for the given instance set and
3857 * dependence relation strongly satisfies the dependences.
3858 * In particular, check that no instance is scheduled before
3859 * or together with an instance on which it depends.
3860 * Earlier versions of isl would produce a schedule that
3861 * only weakly satisfies the dependences.
3862 */
3863static int test_strongly_satisfying_schedule(isl_ctx *ctx)
3864{
3865 const char *domain, *dep;
3866 isl_union_map *D, *schedule;
3867 isl_map *map, *ge;
3868 int empty;
3869
3870 domain = "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; "
3871 "A[i0] : 0 <= i0 <= 1 }";
3872 dep = "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; "
3873 "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }";
3874 schedule = compute_schedule(ctx, domain, dep, dep);
3875 D = isl_union_map_read_from_str(ctx, dep);
3876 D = isl_union_map_apply_domain(D, isl_union_map_copy(schedule));
3877 D = isl_union_map_apply_range(D, schedule);
3878 map = isl_map_from_union_map(D);
3879 ge = isl_map_lex_ge(isl_space_domain(isl_map_get_space(map)));
3880 map = isl_map_intersect(map, ge);
3881 empty = isl_map_is_empty(map);
3882 isl_map_free(map);
3883
3884 if (empty < 0)
3885 return -1;
3886 if (!empty)
3887 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "dependences not strongly satisfied"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3888); return -1; } while (0)
3888 "dependences not strongly satisfied", return -1)do { isl_handle_error(ctx, isl_error_unknown, "dependences not strongly satisfied"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3888); return -1; } while (0)
;
3889
3890 return 0;
3891}
3892
3893/* Compute a schedule for input where the instance set constraints
3894 * conflict with the context constraints.
3895 * Earlier versions of isl did not properly handle this situation.
3896 */
3897static int test_conflicting_context_schedule(isl_ctx *ctx)
3898{
3899 isl_union_map *schedule;
3900 const char *domain, *context;
3901
3902 domain = "[n] -> { A[] : n >= 0 }";
3903 context = "[n] -> { : n < 0 }";
3904 schedule = compute_schedule_with_context(ctx,
3905 domain, "{}", "{}", context);
3906 isl_union_map_free(schedule);
3907
3908 if (!schedule)
3909 return -1;
3910
3911 return 0;
3912}
3913
3914/* Check that the dependence carrying step is not confused by
3915 * a bound on the coefficient size.
3916 * In particular, force the scheduler to move to a dependence carrying
3917 * step by demanding outer coincidence and bound the size of
3918 * the coefficients. Earlier versions of isl would take this
3919 * bound into account while carrying dependences, breaking
3920 * fundamental assumptions.
3921 * On the other hand, the dependence carrying step now tries
3922 * to prevent loop coalescing by default, so check that indeed
3923 * no loop coalescing occurs by comparing the computed schedule
3924 * to the expected non-coalescing schedule.
3925 */
3926static int test_bounded_coefficients_schedule(isl_ctx *ctx)
3927{
3928 const char *domain, *dep;
3929 isl_union_set *I;
3930 isl_union_map *D;
3931 isl_schedule_constraints *sc;
3932 isl_schedule *schedule;
3933 isl_union_map *sched1, *sched2;
3934 isl_bool equal;
3935
3936 domain = "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }";
3937 dep = "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and "
3938 "i1 <= -2 + i0; "
3939 "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }";
3940 I = isl_union_set_read_from_str(ctx, domain);
3941 D = isl_union_map_read_from_str(ctx, dep);
3942 sc = isl_schedule_constraints_on_domain(I);
3943 sc = isl_schedule_constraints_set_validity(sc, isl_union_map_copy(D));
3944 sc = isl_schedule_constraints_set_coincidence(sc, D);
3945 isl_options_set_schedule_outer_coincidence(ctx, 1);
3946 isl_options_set_schedule_max_coefficient(ctx, 20);
3947 schedule = isl_schedule_constraints_compute_schedule(sc);
3948 isl_options_set_schedule_max_coefficient(ctx, -1);
3949 isl_options_set_schedule_outer_coincidence(ctx, 0);
3950 sched1 = isl_schedule_get_map(schedule);
3951 isl_schedule_free(schedule);
3952
3953 sched2 = isl_union_map_read_from_str(ctx, "{ C[x,y] -> [x,y] }");
3954 equal = isl_union_map_is_equal(sched1, sched2);
3955 isl_union_map_free(sched1);
3956 isl_union_map_free(sched2);
3957
3958 if (equal < 0)
3959 return -1;
3960 if (!equal)
3961 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3962); return -1; } while (0)
3962 "unexpected schedule", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected schedule"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 3962); return -1; } while (0)
;
3963
3964 return 0;
3965}
3966
3967/* Check that a set of schedule constraints that only allow for
3968 * a coalescing schedule still produces a schedule even if the user
3969 * request a non-coalescing schedule. Earlier versions of isl
3970 * would not handle this case correctly.
3971 */
3972static int test_coalescing_schedule(isl_ctx *ctx)
3973{
3974 const char *domain, *dep;
3975 isl_union_set *I;
3976 isl_union_map *D;
3977 isl_schedule_constraints *sc;
3978 isl_schedule *schedule;
3979 int treat_coalescing;
3980
3981 domain = "{ S[a, b] : 0 <= a <= 1 and 0 <= b <= 1 }";
3982 dep = "{ S[a, b] -> S[a + b, 1 - b] }";
3983 I = isl_union_set_read_from_str(ctx, domain);
3984 D = isl_union_map_read_from_str(ctx, dep);
3985 sc = isl_schedule_constraints_on_domain(I);
3986 sc = isl_schedule_constraints_set_validity(sc, D);
3987 treat_coalescing = isl_options_get_schedule_treat_coalescing(ctx);
3988 isl_options_set_schedule_treat_coalescing(ctx, 1);
3989 schedule = isl_schedule_constraints_compute_schedule(sc);
3990 isl_options_set_schedule_treat_coalescing(ctx, treat_coalescing);
3991 isl_schedule_free(schedule);
3992 if (!schedule)
3993 return -1;
3994 return 0;
3995}
3996
3997int test_schedule(isl_ctx *ctx)
3998{
3999 const char *D, *W, *R, *V, *P, *S;
4000 int max_coincidence;
4001 int treat_coalescing;
4002
4003 /* Handle resulting schedule with zero bands. */
4004 if (test_one_schedule(ctx, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0)
4005 return -1;
4006
4007 /* Jacobi */
4008 D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }";
4009 W = "{ S1[t,i] -> a[t,i] }";
4010 R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; "
4011 "S1[t,i] -> a[t-1,i+1] }";
4012 S = "{ S1[t,i] -> [t,i] }";
4013 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
4014 return -1;
4015
4016 /* Fig. 5 of CC2008 */
4017 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and "
4018 "j <= -1 + N }";
4019 W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and "
4020 "j >= 2 and j <= -1 + N }";
4021 R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and "
4022 "j >= 2 and j <= -1 + N; "
4023 "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and "
4024 "j >= 2 and j <= -1 + N }";
4025 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
4026 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
4027 return -1;
4028
4029 D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }";
4030 W = "{ S1[i] -> a[i] }";
4031 R = "{ S2[i] -> a[i+1] }";
4032 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4033 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
4034 return -1;
4035
4036 D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }";
4037 W = "{ S1[i] -> a[i] }";
4038 R = "{ S2[i] -> a[9-i] }";
4039 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4040 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
4041 return -1;
4042
4043 D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }";
4044 W = "{ S1[i] -> a[i] }";
4045 R = "[N] -> { S2[i] -> a[N-1-i] }";
4046 S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }";
4047 if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0)
4048 return -1;
4049
4050 D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }";
4051 W = "{ S1[i] -> a[i]; S2[i] -> b[i] }";
4052 R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }";
4053 S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }";
4054 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4055 return -1;
4056
4057 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4058 W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }";
4059 R = "{ S2[i,j] -> a[i-1,j] }";
4060 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4061 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
4062 return -1;
4063
4064 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }";
4065 W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }";
4066 R = "{ S2[i,j] -> a[i,j-1] }";
4067 S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }";
4068 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
4069 return -1;
4070
4071 D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }";
4072 W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; "
4073 "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }";
4074 R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }";
4075 S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; "
4076 "S_0[] -> [0, 0, 0] }";
4077 if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0)
4078 return -1;
4079 ctx->opt->schedule_parametric = 0;
4080 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4081 return -1;
4082 ctx->opt->schedule_parametric = 1;
4083
4084 D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; "
4085 "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }";
4086 W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }";
4087 R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; "
4088 "S4[i] -> a[i,N] }";
4089 S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; "
4090 "S4[i] -> [4,i,0] }";
4091 max_coincidence = isl_options_get_schedule_maximize_coincidence(ctx);
4092 isl_options_set_schedule_maximize_coincidence(ctx, 0);
4093 if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0)
4094 return -1;
4095 isl_options_set_schedule_maximize_coincidence(ctx, max_coincidence);
4096
4097 D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }";
4098 W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4099 "j <= N }";
4100 R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and "
4101 "j <= N; "
4102 "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and "
4103 "j <= N }";
4104 S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }";
4105 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4106 return -1;
4107
4108 D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; "
4109 " S_2[t] : t >= 0 and t <= -1 + N; "
4110 " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and "
4111 "i <= -1 + N }";
4112 W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; "
4113 " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; "
4114 " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and "
4115 "i >= 0 and i <= -1 + N }";
4116 R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and "
4117 "i >= 0 and i <= -1 + N; "
4118 " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }";
4119 S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; "
4120 " S_0[t] -> [0, t, 0] }";
4121
4122 if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0)
4123 return -1;
4124 ctx->opt->schedule_parametric = 0;
4125 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4126 return -1;
4127 ctx->opt->schedule_parametric = 1;
4128
4129 D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }";
4130 S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }";
4131 if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0)
4132 return -1;
4133
4134 D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; "
4135 "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }";
4136 W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and "
4137 "j >= 0 and j <= -1 + N; "
4138 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4139 R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and "
4140 "j >= 0 and j <= -1 + N; "
4141 "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }";
4142 S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }";
4143 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4144 return -1;
4145
4146 D = "{ S_0[i] : i >= 0 }";
4147 W = "{ S_0[i] -> a[i] : i >= 0 }";
4148 R = "{ S_0[i] -> a[0] : i >= 0 }";
4149 S = "{ S_0[i] -> [0, i, 0] }";
4150 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4151 return -1;
4152
4153 D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }";
4154 W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }";
4155 R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }";
4156 S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }";
4157 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4158 return -1;
4159
4160 D = "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and "
4161 "k <= -1 + n and k >= 0 }";
4162 W = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }";
4163 R = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and "
4164 "k <= -1 + n and k >= 0; "
4165 "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and "
4166 "k <= -1 + n and k >= 0; "
4167 "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and "
4168 "k <= -1 + n and k >= 0 }";
4169 S = "[n] -> { S_0[j, k] -> [2, j, k] }";
4170 ctx->opt->schedule_outer_coincidence = 1;
4171 if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0)
4172 return -1;
4173 ctx->opt->schedule_outer_coincidence = 0;
4174
4175 D = "{Stmt_for_body24[i0, i1, i2, i3]:"
4176 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and "
4177 "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;"
4178 "Stmt_for_body24[i0, i1, 1, 0]:"
4179 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;"
4180 "Stmt_for_body7[i0, i1, i2]:"
4181 "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and "
4182 "i2 <= 7 }";
4183
4184 V = "{Stmt_for_body24[0, i1, i2, i3] -> "
4185 "Stmt_for_body24[1, i1, i2, i3]:"
4186 "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and "
4187 "i2 >= 1;"
4188 "Stmt_for_body24[0, i1, i2, i3] -> "
4189 "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:"
4190 "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and "
4191 "i3 >= 0;"
4192 "Stmt_for_body24[0, i1, i2, i3] ->"
4193 "Stmt_for_body7[1, i1, 1 + i1 + i3]:"
4194 "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;"
4195 "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:"
4196 "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or "
4197 "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or "
4198 "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);"
4199 "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:"
4200 "i1 <= 6 and i1 >= 0;"
4201 "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];"
4202 "Stmt_for_body7[i0, i1, i2] -> "
4203 "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:"
4204 "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and "
4205 "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;"
4206 "Stmt_for_body7[i0, i1, i2] -> "
4207 "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:"
4208 "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and "
4209 "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }";
4210 P = V;
4211 S = "{ Stmt_for_body24[i0, i1, i2, i3] -> "
4212 "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];"
4213 "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }";
4214
4215 treat_coalescing = isl_options_get_schedule_treat_coalescing(ctx);
4216 isl_options_set_schedule_treat_coalescing(ctx, 0);
4217 if (test_special_schedule(ctx, D, V, P, S) < 0)
4218 return -1;
4219 isl_options_set_schedule_treat_coalescing(ctx, treat_coalescing);
4220
4221 D = "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }";
4222 V = "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and "
4223 "j >= 1 and j <= 7;"
4224 "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and "
4225 "j >= 1 and j <= 8 }";
4226 P = "{ }";
4227 S = "{ S_0[i, j] -> [i + j, j] }";
4228 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER1;
4229 if (test_special_schedule(ctx, D, V, P, S) < 0)
4230 return -1;
4231 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL0;
4232
4233 /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */
4234 D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and "
4235 "j >= 0 and j <= -1 + i }";
4236 V = "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and "
4237 "i <= -1 + N and j >= 0;"
4238 "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and "
4239 "i <= -2 + N }";
4240 P = "{ }";
4241 S = "{ S_0[i, j] -> [i, j] }";
4242 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER1;
4243 if (test_special_schedule(ctx, D, V, P, S) < 0)
4244 return -1;
4245 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL0;
4246
4247 /* Test both algorithms on a case with only proximity dependences. */
4248 D = "{ S[i,j] : 0 <= i <= 10 }";
4249 V = "{ }";
4250 P = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }";
4251 S = "{ S[i, j] -> [j, i] }";
4252 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER1;
4253 if (test_special_schedule(ctx, D, V, P, S) < 0)
4254 return -1;
4255 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL0;
4256 if (test_special_schedule(ctx, D, V, P, S) < 0)
4257 return -1;
4258
4259 D = "{ A[a]; B[] }";
4260 V = "{}";
4261 P = "{ A[a] -> B[] }";
4262 if (test_has_schedule(ctx, D, V, P) < 0)
4263 return -1;
4264
4265 if (test_padded_schedule(ctx) < 0)
4266 return -1;
4267
4268 /* Check that check for progress is not confused by rational
4269 * solution.
4270 */
4271 D = "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }";
4272 V = "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and "
4273 "i0 <= -2 + N; "
4274 "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and "
4275 "i0 <= N and i1 >= 0 and i1 <= -1 + N }";
4276 P = "{}";
4277 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER1;
4278 if (test_has_schedule(ctx, D, V, P) < 0)
4279 return -1;
4280 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL0;
4281
4282 /* Check that we allow schedule rows that are only non-trivial
4283 * on some full-dimensional domains.
4284 */
4285 D = "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }";
4286 V = "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];"
4287 "S1[j] -> S2[1] : 0 <= j <= 1 }";
4288 P = "{}";
4289 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER1;
4290 if (test_has_schedule(ctx, D, V, P) < 0)
4291 return -1;
4292 ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL0;
4293
4294 if (test_conditional_schedule_constraints(ctx) < 0)
4295 return -1;
4296
4297 if (test_strongly_satisfying_schedule(ctx) < 0)
4298 return -1;
4299
4300 if (test_conflicting_context_schedule(ctx) < 0)
4301 return -1;
4302
4303 if (test_bounded_coefficients_schedule(ctx) < 0)
4304 return -1;
4305 if (test_coalescing_schedule(ctx) < 0)
4306 return -1;
4307
4308 return 0;
4309}
4310
4311/* Perform scheduling tests using the whole component scheduler.
4312 */
4313static int test_schedule_whole(isl_ctx *ctx)
4314{
4315 int whole;
4316 int r;
4317
4318 whole = isl_options_get_schedule_whole_component(ctx);
4319 isl_options_set_schedule_whole_component(ctx, 1);
4320 r = test_schedule(ctx);
4321 isl_options_set_schedule_whole_component(ctx, whole);
4322
4323 return r;
4324}
4325
4326/* Perform scheduling tests using the incremental scheduler.
4327 */
4328static int test_schedule_incremental(isl_ctx *ctx)
4329{
4330 int whole;
4331 int r;
4332
4333 whole = isl_options_get_schedule_whole_component(ctx);
4334 isl_options_set_schedule_whole_component(ctx, 0);
4335 r = test_schedule(ctx);
4336 isl_options_set_schedule_whole_component(ctx, whole);
4337
4338 return r;
4339}
4340
4341int test_plain_injective(isl_ctx *ctx, const char *str, int injective)
4342{
4343 isl_union_map *umap;
4344 int test;
4345
4346 umap = isl_union_map_read_from_str(ctx, str);
4347 test = isl_union_map_plain_is_injective(umap);
4348 isl_union_map_free(umap);
4349 if (test < 0)
4350 return -1;
4351 if (test == injective)
4352 return 0;
4353 if (injective)
4354 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "map not detected as injective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4355); return -1; } while (0)
4355 "map not detected as injective", return -1)do { isl_handle_error(ctx, isl_error_unknown, "map not detected as injective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4355); return -1; } while (0)
;
4356 else
4357 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "map detected as injective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4358); return -1; } while (0)
4358 "map detected as injective", return -1)do { isl_handle_error(ctx, isl_error_unknown, "map detected as injective"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4358); return -1; } while (0)
;
4359}
4360
4361int test_injective(isl_ctx *ctx)
4362{
4363 const char *str;
4364
4365 if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0))
4366 return -1;
4367 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1))
4368 return -1;
4369 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1))
4370 return -1;
4371 if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0))
4372 return -1;
4373 if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1))
4374 return -1;
4375 if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0))
4376 return -1;
4377 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1))
4378 return -1;
4379 if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1))
4380 return -1;
4381
4382 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}";
4383 if (test_plain_injective(ctx, str, 1))
4384 return -1;
4385 str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}";
4386 if (test_plain_injective(ctx, str, 0))
4387 return -1;
4388
4389 return 0;
4390}
4391
4392static int aff_plain_is_equal(__isl_keep isl_aff *aff, const char *str)
4393{
4394 isl_aff *aff2;
4395 int equal;
4396
4397 if (!aff)
4398 return -1;
4399
4400 aff2 = isl_aff_read_from_str(isl_aff_get_ctx(aff), str);
4401 equal = isl_aff_plain_is_equal(aff, aff2);
4402 isl_aff_free(aff2);
4403
4404 return equal;
4405}
4406
4407static int aff_check_plain_equal(__isl_keep isl_aff *aff, const char *str)
4408{
4409 int equal;
4410
4411 equal = aff_plain_is_equal(aff, str);
4412 if (equal < 0)
4413 return -1;
4414 if (!equal)
4415 isl_die(isl_aff_get_ctx(aff), isl_error_unknown,do { isl_handle_error(isl_aff_get_ctx(aff), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4416); return -1; } while (0)
4416 "result not as expected", return -1)do { isl_handle_error(isl_aff_get_ctx(aff), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4416); return -1; } while (0)
;
4417 return 0;
4418}
4419
4420struct {
4421 __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1,
4422 __isl_take isl_aff *aff2);
4423} aff_bin_op[] = {
4424 ['+'] = { &isl_aff_add },
4425 ['-'] = { &isl_aff_sub },
4426 ['*'] = { &isl_aff_mul },
4427 ['/'] = { &isl_aff_div },
4428};
4429
4430struct {
4431 const char *arg1;
4432 unsigned char op;
4433 const char *arg2;
4434 const char *res;
4435} aff_bin_tests[] = {
4436 { "{ [i] -> [i] }", '+', "{ [i] -> [i] }",
4437 "{ [i] -> [2i] }" },
4438 { "{ [i] -> [i] }", '-', "{ [i] -> [i] }",
4439 "{ [i] -> [0] }" },
4440 { "{ [i] -> [i] }", '*', "{ [i] -> [2] }",
4441 "{ [i] -> [2i] }" },
4442 { "{ [i] -> [2] }", '*', "{ [i] -> [i] }",
4443 "{ [i] -> [2i] }" },
4444 { "{ [i] -> [i] }", '/', "{ [i] -> [2] }",
4445 "{ [i] -> [i/2] }" },
4446 { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }",
4447 "{ [i] -> [i] }" },
4448 { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }",
4449 "{ [i] -> [NaN] }" },
4450 { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }",
4451 "{ [i] -> [NaN] }" },
4452 { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }",
4453 "{ [i] -> [NaN] }" },
4454 { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }",
4455 "{ [i] -> [NaN] }" },
4456 { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }",
4457 "{ [i] -> [NaN] }" },
4458 { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }",
4459 "{ [i] -> [NaN] }" },
4460 { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }",
4461 "{ [i] -> [NaN] }" },
4462 { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }",
4463 "{ [i] -> [NaN] }" },
4464 { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }",
4465 "{ [i] -> [NaN] }" },
4466 { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }",
4467 "{ [i] -> [NaN] }" },
4468 { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }",
4469 "{ [i] -> [NaN] }" },
4470 { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }",
4471 "{ [i] -> [NaN] }" },
4472};
4473
4474/* Perform some basic tests of binary operations on isl_aff objects.
4475 */
4476static int test_bin_aff(isl_ctx *ctx)
4477{
4478 int i;
4479 isl_aff *aff1, *aff2, *res;
4480 __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1,
4481 __isl_take isl_aff *aff2);
4482 int ok;
4483
4484 for (i = 0; i < ARRAY_SIZE(aff_bin_tests)(sizeof(aff_bin_tests)/sizeof(*aff_bin_tests)); ++i) {
4485 aff1 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg1);
4486 aff2 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg2);
4487 res = isl_aff_read_from_str(ctx, aff_bin_tests[i].res);
4488 fn = aff_bin_op[aff_bin_tests[i].op].fn;
4489 aff1 = fn(aff1, aff2);
4490 if (isl_aff_is_nan(res))
4491 ok = isl_aff_is_nan(aff1);
4492 else
4493 ok = isl_aff_plain_is_equal(aff1, res);
4494 isl_aff_free(aff1);
4495 isl_aff_free(res);
4496 if (ok < 0)
4497 return -1;
4498 if (!ok)
4499 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4500); return -1; } while (0)
4500 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4500); return -1; } while (0)
;
4501 }
4502
4503 return 0;
4504}
4505
4506struct {
4507 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pa1,
4508 __isl_take isl_pw_aff *pa2);
4509} pw_aff_bin_op[] = {
4510 ['m'] = { &isl_pw_aff_min },
4511 ['M'] = { &isl_pw_aff_max },
4512};
4513
4514/* Inputs for binary isl_pw_aff operation tests.
4515 * "arg1" and "arg2" are the two arguments, "op" identifies the operation
4516 * defined by pw_aff_bin_op, and "res" is the expected result.
4517 */
4518struct {
4519 const char *arg1;
4520 unsigned char op;
4521 const char *arg2;
4522 const char *res;
4523} pw_aff_bin_tests[] = {
4524 { "{ [i] -> [i] }", 'm', "{ [i] -> [i] }",
4525 "{ [i] -> [i] }" },
4526 { "{ [i] -> [i] }", 'M', "{ [i] -> [i] }",
4527 "{ [i] -> [i] }" },
4528 { "{ [i] -> [i] }", 'm', "{ [i] -> [0] }",
4529 "{ [i] -> [i] : i <= 0; [i] -> [0] : i > 0 }" },
4530 { "{ [i] -> [i] }", 'M', "{ [i] -> [0] }",
4531 "{ [i] -> [i] : i >= 0; [i] -> [0] : i < 0 }" },
4532 { "{ [i] -> [i] }", 'm', "{ [i] -> [NaN] }",
4533 "{ [i] -> [NaN] }" },
4534 { "{ [i] -> [NaN] }", 'm', "{ [i] -> [i] }",
4535 "{ [i] -> [NaN] }" },
4536};
4537
4538/* Perform some basic tests of binary operations on isl_pw_aff objects.
4539 */
4540static int test_bin_pw_aff(isl_ctx *ctx)
4541{
4542 int i;
4543 isl_bool ok;
4544 isl_pw_aff *pa1, *pa2, *res;
4545
4546 for (i = 0; i < ARRAY_SIZE(pw_aff_bin_tests)(sizeof(pw_aff_bin_tests)/sizeof(*pw_aff_bin_tests)); ++i) {
4547 pa1 = isl_pw_aff_read_from_str(ctx, pw_aff_bin_tests[i].arg1);
4548 pa2 = isl_pw_aff_read_from_str(ctx, pw_aff_bin_tests[i].arg2);
4549 res = isl_pw_aff_read_from_str(ctx, pw_aff_bin_tests[i].res);
4550 pa1 = pw_aff_bin_op[pw_aff_bin_tests[i].op].fn(pa1, pa2);
4551 if (isl_pw_aff_involves_nan(res))
4552 ok = isl_pw_aff_involves_nan(pa1);
4553 else
4554 ok = isl_pw_aff_plain_is_equal(pa1, res);
4555 isl_pw_aff_free(pa1);
4556 isl_pw_aff_free(res);
4557 if (ok < 0)
4558 return -1;
4559 if (!ok)
4560 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4561); return -1; } while (0)
4561 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4561); return -1; } while (0)
;
4562 }
4563
4564 return 0;
4565}
4566
4567struct {
4568 __isl_give isl_union_pw_multi_aff *(*fn)(
4569 __isl_take isl_union_pw_multi_aff *upma1,
4570 __isl_take isl_union_pw_multi_aff *upma2);
4571 const char *arg1;
4572 const char *arg2;
4573 const char *res;
4574} upma_bin_tests[] = {
4575 { &isl_union_pw_multi_aff_add, "{ A[] -> [0]; B[0] -> [1] }",
4576 "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" },
4577 { &isl_union_pw_multi_aff_union_add, "{ A[] -> [0]; B[0] -> [1] }",
4578 "{ B[x] -> [2] : x >= 0 }",
4579 "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" },
4580 { &isl_union_pw_multi_aff_pullback_union_pw_multi_aff,
4581 "{ A[] -> B[0]; C[x] -> B[1] : x < 10; C[y] -> B[2] : y >= 10 }",
4582 "{ D[i] -> A[] : i < 0; D[i] -> C[i + 5] : i >= 0 }",
4583 "{ D[i] -> B[0] : i < 0; D[i] -> B[1] : 0 <= i < 5; "
4584 "D[i] -> B[2] : i >= 5 }" },
4585 { &isl_union_pw_multi_aff_union_add, "{ B[x] -> A[1] : x <= 0 }",
4586 "{ B[x] -> C[2] : x > 0 }",
4587 "{ B[x] -> A[1] : x <= 0; B[x] -> C[2] : x > 0 }" },
4588 { &isl_union_pw_multi_aff_union_add, "{ B[x] -> A[1] : x <= 0 }",
4589 "{ B[x] -> A[2] : x >= 0 }",
4590 "{ B[x] -> A[1] : x < 0; B[x] -> A[2] : x > 0; B[0] -> A[3] }" },
4591};
4592
4593/* Perform some basic tests of binary operations on
4594 * isl_union_pw_multi_aff objects.
4595 */
4596static int test_bin_upma(isl_ctx *ctx)
4597{
4598 int i;
4599 isl_union_pw_multi_aff *upma1, *upma2, *res;
4600 int ok;
4601
4602 for (i = 0; i < ARRAY_SIZE(upma_bin_tests)(sizeof(upma_bin_tests)/sizeof(*upma_bin_tests)); ++i) {
4603 upma1 = isl_union_pw_multi_aff_read_from_str(ctx,
4604 upma_bin_tests[i].arg1);
4605 upma2 = isl_union_pw_multi_aff_read_from_str(ctx,
4606 upma_bin_tests[i].arg2);
4607 res = isl_union_pw_multi_aff_read_from_str(ctx,
4608 upma_bin_tests[i].res);
4609 upma1 = upma_bin_tests[i].fn(upma1, upma2);
4610 ok = isl_union_pw_multi_aff_plain_is_equal(upma1, res);
4611 isl_union_pw_multi_aff_free(upma1);
4612 isl_union_pw_multi_aff_free(res);
4613 if (ok < 0)
4614 return -1;
4615 if (!ok)
4616 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4617); return -1; } while (0)
4617 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4617); return -1; } while (0)
;
4618 }
4619
4620 return 0;
4621}
4622
4623struct {
4624 __isl_give isl_union_pw_multi_aff *(*fn)(
4625 __isl_take isl_union_pw_multi_aff *upma1,
4626 __isl_take isl_union_pw_multi_aff *upma2);
4627 const char *arg1;
4628 const char *arg2;
4629} upma_bin_fail_tests[] = {
4630 { &isl_union_pw_multi_aff_union_add, "{ B[x] -> A[1] : x <= 0 }",
4631 "{ B[x] -> C[2] : x >= 0 }" },
4632};
4633
4634/* Perform some basic tests of binary operations on
4635 * isl_union_pw_multi_aff objects that are expected to fail.
4636 */
4637static int test_bin_upma_fail(isl_ctx *ctx)
4638{
4639 int i, n;
4640 isl_union_pw_multi_aff *upma1, *upma2;
4641 int on_error;
4642
4643 on_error = isl_options_get_on_error(ctx);
4644 isl_options_set_on_error(ctx, ISL_ON_ERROR_CONTINUE1);
4645 n = ARRAY_SIZE(upma_bin_fail_tests)(sizeof(upma_bin_fail_tests)/sizeof(*upma_bin_fail_tests));
4646 for (i = 0; i < n; ++i) {
4647 upma1 = isl_union_pw_multi_aff_read_from_str(ctx,
4648 upma_bin_fail_tests[i].arg1);
4649 upma2 = isl_union_pw_multi_aff_read_from_str(ctx,
4650 upma_bin_fail_tests[i].arg2);
4651 upma1 = upma_bin_fail_tests[i].fn(upma1, upma2);
4652 isl_union_pw_multi_aff_free(upma1);
4653 if (upma1)
4654 break;
4655 }
4656 isl_options_set_on_error(ctx, on_error);
4657 if (i < n)
4658 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "operation not expected to succeed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4659); return -1; } while (0)
4659 "operation not expected to succeed", return -1)do { isl_handle_error(ctx, isl_error_unknown, "operation not expected to succeed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4659); return -1; } while (0)
;
4660
4661 return 0;
4662}
4663
4664int test_aff(isl_ctx *ctx)
4665{
4666 const char *str;
4667 isl_setisl_map *set;
4668 isl_space *space;
4669 isl_local_space *ls;
4670 isl_aff *aff;
4671 int zero, equal;
4672
4673 if (test_bin_aff(ctx) < 0)
4674 return -1;
4675 if (test_bin_pw_aff(ctx) < 0)
4676 return -1;
4677 if (test_bin_upma(ctx) < 0)
4678 return -1;
4679 if (test_bin_upma_fail(ctx) < 0)
4680 return -1;
4681
4682 space = isl_space_set_alloc(ctx, 0, 1);
4683 ls = isl_local_space_from_space(space);
4684 aff = isl_aff_zero_on_domain(ls);
4685
4686 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
4687 aff = isl_aff_scale_down_ui(aff, 3);
4688 aff = isl_aff_floor(aff);
4689 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
4690 aff = isl_aff_scale_down_ui(aff, 2);
4691 aff = isl_aff_floor(aff);
4692 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1);
4693
4694 str = "{ [10] }";
4695 set = isl_set_read_from_str(ctx, str);
4696 aff = isl_aff_gist(aff, set);
4697
4698 aff = isl_aff_add_constant_si(aff, -16);
4699 zero = isl_aff_plain_is_zero(aff);
4700 isl_aff_free(aff);
4701
4702 if (zero < 0)
4703 return -1;
4704 if (!zero)
4705 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4705); return -1; } while (0)
;
4706
4707 aff = isl_aff_read_from_str(ctx, "{ [-1] }");
4708 aff = isl_aff_scale_down_ui(aff, 64);
4709 aff = isl_aff_floor(aff);
4710 equal = aff_check_plain_equal(aff, "{ [-1] }");
4711 isl_aff_free(aff);
4712 if (equal < 0)
4713 return -1;
4714
4715 return 0;
4716}
4717
4718/* Check that the computation below results in a single expression.
4719 * One or two expressions may result depending on which constraint
4720 * ends up being considered as redundant with respect to the other
4721 * constraints after the projection that is performed internally
4722 * by isl_set_dim_min.
4723 */
4724static int test_dim_max_1(isl_ctx *ctx)
4725{
4726 const char *str;
4727 isl_setisl_map *set;
4728 isl_pw_aff *pa;
4729 int n;
4730
4731 str = "[n] -> { [a, b] : n >= 0 and 4a >= -4 + n and b >= 0 and "
4732 "-4a <= b <= 3 and b < n - 4a }";
4733 set = isl_set_read_from_str(ctx, str);
4734 pa = isl_set_dim_min(set, 0);
4735 n = isl_pw_aff_n_piece(pa);
4736 isl_pw_aff_free(pa);
4737
4738 if (!pa)
4739 return -1;
4740 if (n != 1)
4741 isl_die(ctx, isl_error_unknown, "expecting single expression",do { isl_handle_error(ctx, isl_error_unknown, "expecting single expression"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4742); return -1; } while (0)
4742 return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting single expression"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4742); return -1; } while (0)
;
4743
4744 return 0;
4745}
4746
4747int test_dim_max(isl_ctx *ctx)
4748{
4749 int equal;
4750 const char *str;
4751 isl_setisl_map *set1, *set2;
4752 isl_setisl_map *set;
4753 isl_map *map;
4754 isl_pw_aff *pwaff;
4755
4756 if (test_dim_max_1(ctx) < 0)
4757 return -1;
4758
4759 str = "[N] -> { [i] : 0 <= i <= min(N,10) }";
4760 set = isl_set_read_from_str(ctx, str);
4761 pwaff = isl_set_dim_max(set, 0);
4762 set1 = isl_set_from_pw_aff(pwaff);
4763 str = "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }";
4764 set2 = isl_set_read_from_str(ctx, str);
4765 equal = isl_set_is_equal(set1, set2);
4766 isl_set_free(set1);
4767 isl_set_free(set2);
4768 if (equal < 0)
4769 return -1;
4770 if (!equal)
4771 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4771); return -1; } while (0)
;
4772
4773 str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }";
4774 set = isl_set_read_from_str(ctx, str);
4775 pwaff = isl_set_dim_max(set, 0);
4776 set1 = isl_set_from_pw_aff(pwaff);
4777 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4778 set2 = isl_set_read_from_str(ctx, str);
4779 equal = isl_set_is_equal(set1, set2);
4780 isl_set_free(set1);
4781 isl_set_free(set2);
4782 if (equal < 0)
4783 return -1;
4784 if (!equal)
4785 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4785); return -1; } while (0)
;
4786
4787 str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }";
4788 set = isl_set_read_from_str(ctx, str);
4789 pwaff = isl_set_dim_max(set, 0);
4790 set1 = isl_set_from_pw_aff(pwaff);
4791 str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }";
4792 set2 = isl_set_read_from_str(ctx, str);
4793 equal = isl_set_is_equal(set1, set2);
4794 isl_set_free(set1);
4795 isl_set_free(set2);
4796 if (equal < 0)
4797 return -1;
4798 if (!equal)
4799 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4799); return -1; } while (0)
;
4800
4801 str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : "
4802 "0 <= i < N and 0 <= j < M }";
4803 map = isl_map_read_from_str(ctx, str);
4804 set = isl_map_range(map);
4805
4806 pwaff = isl_set_dim_max(isl_set_copy(set), 0);
4807 set1 = isl_set_from_pw_aff(pwaff);
4808 str = "[N,M] -> { [([(N-1)/16])] : M,N > 0 }";
4809 set2 = isl_set_read_from_str(ctx, str);
4810 equal = isl_set_is_equal(set1, set2);
4811 isl_set_free(set1);
4812 isl_set_free(set2);
4813
4814 pwaff = isl_set_dim_max(isl_set_copy(set), 3);
4815 set1 = isl_set_from_pw_aff(pwaff);
4816 str = "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }";
4817 set2 = isl_set_read_from_str(ctx, str);
4818 if (equal >= 0 && equal)
4819 equal = isl_set_is_equal(set1, set2);
4820 isl_set_free(set1);
4821 isl_set_free(set2);
4822
4823 isl_set_free(set);
4824
4825 if (equal < 0)
4826 return -1;
4827 if (!equal)
4828 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4828); return -1; } while (0)
;
4829
4830 /* Check that solutions are properly merged. */
4831 str = "[n] -> { [a, b, c] : c >= -4a - 2b and "
4832 "c <= -1 + n - 4a - 2b and c >= -2b and "
4833 "4a >= -4 + n and c >= 0 }";
4834 set = isl_set_read_from_str(ctx, str);
4835 pwaff = isl_set_dim_min(set, 2);
4836 set1 = isl_set_from_pw_aff(pwaff);
4837 str = "[n] -> { [(0)] : n >= 1 }";
4838 set2 = isl_set_read_from_str(ctx, str);
4839 equal = isl_set_is_equal(set1, set2);
4840 isl_set_free(set1);
4841 isl_set_free(set2);
4842
4843 if (equal < 0)
4844 return -1;
4845 if (!equal)
4846 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4846); return -1; } while (0)
;
4847
4848 /* Check that empty solution lie in the right space. */
4849 str = "[n] -> { [t,a] : 1 = 0 }";
4850 set = isl_set_read_from_str(ctx, str);
4851 pwaff = isl_set_dim_max(set, 0);
4852 set1 = isl_set_from_pw_aff(pwaff);
4853 str = "[n] -> { [t] : 1 = 0 }";
4854 set2 = isl_set_read_from_str(ctx, str);
4855 equal = isl_set_is_equal(set1, set2);
4856 isl_set_free(set1);
4857 isl_set_free(set2);
4858
4859 if (equal < 0)
4860 return -1;
4861 if (!equal)
4862 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4862); return -1; } while (0)
;
4863
4864 return 0;
4865}
4866
4867/* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"?
4868 */
4869static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff *pma,
4870 const char *str)
4871{
4872 isl_ctx *ctx;
4873 isl_pw_multi_aff *pma2;
4874 int equal;
4875
4876 if (!pma)
4877 return -1;
4878
4879 ctx = isl_pw_multi_aff_get_ctx(pma);
4880 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
4881 equal = isl_pw_multi_aff_plain_is_equal(pma, pma2);
4882 isl_pw_multi_aff_free(pma2);
4883
4884 return equal;
4885}
4886
4887/* Check that "pma" is obviously equal to the isl_pw_multi_aff
4888 * represented by "str".
4889 */
4890static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff *pma,
4891 const char *str)
4892{
4893 int equal;
4894
4895 equal = pw_multi_aff_plain_is_equal(pma, str);
4896 if (equal < 0)
4897 return -1;
4898 if (!equal)
4899 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_unknown,do { isl_handle_error(isl_pw_multi_aff_get_ctx(pma), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4900); return -1; } while (0)
4900 "result not as expected", return -1)do { isl_handle_error(isl_pw_multi_aff_get_ctx(pma), isl_error_unknown
, "result not as expected", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4900); return -1; } while (0)
;
4901 return 0;
4902}
4903
4904/* Basic test for isl_pw_multi_aff_product.
4905 *
4906 * Check that multiple pieces are properly handled.
4907 */
4908static int test_product_pma(isl_ctx *ctx)
4909{
4910 int equal;
4911 const char *str;
4912 isl_pw_multi_aff *pma1, *pma2;
4913
4914 str = "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }";
4915 pma1 = isl_pw_multi_aff_read_from_str(ctx, str);
4916 str = "{ C[] -> D[] }";
4917 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
4918 pma1 = isl_pw_multi_aff_product(pma1, pma2);
4919 str = "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;"
4920 "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }";
4921 equal = pw_multi_aff_check_plain_equal(pma1, str);
4922 isl_pw_multi_aff_free(pma1);
4923 if (equal < 0)
4924 return -1;
4925
4926 return 0;
4927}
4928
4929int test_product(isl_ctx *ctx)
4930{
4931 const char *str;
4932 isl_setisl_map *set;
4933 isl_union_set *uset1, *uset2;
4934 int ok;
4935
4936 str = "{ A[i] }";
4937 set = isl_set_read_from_str(ctx, str);
4938 set = isl_set_product(set, isl_set_copy(set));
4939 ok = isl_set_is_wrapping(set);
4940 isl_set_free(set);
4941 if (ok < 0)
4942 return -1;
4943 if (!ok)
4944 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4944); return -1; } while (0)
;
4945
4946 str = "{ [] }";
4947 uset1 = isl_union_set_read_from_str(ctx, str);
4948 uset1 = isl_union_set_product(uset1, isl_union_set_copy(uset1));
4949 str = "{ [[] -> []] }";
4950 uset2 = isl_union_set_read_from_str(ctx, str);
4951 ok = isl_union_set_is_equal(uset1, uset2);
4952 isl_union_set_free(uset1);
4953 isl_union_set_free(uset2);
4954 if (ok < 0)
4955 return -1;
4956 if (!ok)
4957 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4957); return -1; } while (0)
;
4958
4959 if (test_product_pma(ctx) < 0)
4960 return -1;
4961
4962 return 0;
4963}
4964
4965/* Check that two sets are not considered disjoint just because
4966 * they have a different set of (named) parameters.
4967 */
4968static int test_disjoint(isl_ctx *ctx)
4969{
4970 const char *str;
4971 isl_setisl_map *set, *set2;
4972 int disjoint;
4973
4974 str = "[n] -> { [[]->[]] }";
4975 set = isl_set_read_from_str(ctx, str);
4976 str = "{ [[]->[]] }";
4977 set2 = isl_set_read_from_str(ctx, str);
4978 disjoint = isl_set_is_disjoint(set, set2);
4979 isl_set_free(set);
4980 isl_set_free(set2);
4981 if (disjoint < 0)
4982 return -1;
4983 if (disjoint)
4984 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 4984); return -1; } while (0)
;
4985
4986 return 0;
4987}
4988
4989/* Inputs for isl_pw_multi_aff_is_equal tests.
4990 * "f1" and "f2" are the two function that need to be compared.
4991 * "equal" is the expected result.
4992 */
4993struct {
4994 int equal;
4995 const char *f1;
4996 const char *f2;
4997} pma_equal_tests[] = {
4998 { 1, "[N] -> { [floor(N/2)] : 0 <= N <= 1 }",
4999 "[N] -> { [0] : 0 <= N <= 1 }" },
5000 { 1, "[N] -> { [floor(N/2)] : 0 <= N <= 2 }",
5001 "[N] -> { [0] : 0 <= N <= 1; [1] : N = 2 }" },
5002 { 0, "[N] -> { [floor(N/2)] : 0 <= N <= 2 }",
5003 "[N] -> { [0] : 0 <= N <= 1 }" },
5004 { 0, "{ [NaN] }", "{ [NaN] }" },
5005};
5006
5007int test_equal(isl_ctx *ctx)
5008{
5009 int i;
5010 const char *str;
5011 isl_setisl_map *set, *set2;
5012 int equal;
5013
5014 str = "{ S_6[i] }";
5015 set = isl_set_read_from_str(ctx, str);
5016 str = "{ S_7[i] }";
5017 set2 = isl_set_read_from_str(ctx, str);
5018 equal = isl_set_is_equal(set, set2);
5019 isl_set_free(set);
5020 isl_set_free(set2);
5021 if (equal < 0)
5022 return -1;
5023 if (equal)
5024 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5024); return -1; } while (0)
;
5025
5026 for (i = 0; i < ARRAY_SIZE(pma_equal_tests)(sizeof(pma_equal_tests)/sizeof(*pma_equal_tests)); ++i) {
5027 int expected = pma_equal_tests[i].equal;
5028 isl_pw_multi_aff *f1, *f2;
5029
5030 f1 = isl_pw_multi_aff_read_from_str(ctx, pma_equal_tests[i].f1);
5031 f2 = isl_pw_multi_aff_read_from_str(ctx, pma_equal_tests[i].f2);
5032 equal = isl_pw_multi_aff_is_equal(f1, f2);
5033 isl_pw_multi_aff_free(f1);
5034 isl_pw_multi_aff_free(f2);
5035 if (equal < 0)
5036 return -1;
5037 if (equal != expected)
5038 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected equality result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5039); return -1; } while (0)
5039 "unexpected equality result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected equality result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5039); return -1; } while (0)
;
5040 }
5041
5042 return 0;
5043}
5044
5045static int test_plain_fixed(isl_ctx *ctx, __isl_take isl_map *map,
5046 enum isl_dim_type type, unsigned pos, int fixed)
5047{
5048 isl_bool test;
5049
5050 test = isl_map_plain_is_fixed(map, type, pos, NULL((void*)0));
5051 isl_map_free(map);
5052 if (test < 0)
5053 return -1;
5054 if (test == fixed)
5055 return 0;
5056 if (fixed)
5057 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "map not detected as fixed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5058); return -1; } while (0)
5058 "map not detected as fixed", return -1)do { isl_handle_error(ctx, isl_error_unknown, "map not detected as fixed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5058); return -1; } while (0)
;
5059 else
5060 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "map detected as fixed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5061); return -1; } while (0)
5061 "map detected as fixed", return -1)do { isl_handle_error(ctx, isl_error_unknown, "map detected as fixed"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5061); return -1; } while (0)
;
5062}
5063
5064int test_fixed(isl_ctx *ctx)
5065{
5066 const char *str;
5067 isl_map *map;
5068
5069 str = "{ [i] -> [i] }";
5070 map = isl_map_read_from_str(ctx, str);
5071 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 0))
5072 return -1;
5073 str = "{ [i] -> [1] }";
5074 map = isl_map_read_from_str(ctx, str);
5075 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
5076 return -1;
5077 str = "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }";
5078 map = isl_map_read_from_str(ctx, str);
5079 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
5080 return -1;
5081 map = isl_map_read_from_str(ctx, str);
5082 map = isl_map_neg(map);
5083 if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1))
5084 return -1;
5085
5086 return 0;
5087}
5088
5089struct isl_vertices_test_data {
5090 const char *set;
5091 int n;
5092 const char *vertex[6];
5093} vertices_tests[] = {
5094 { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }",
5095 2, { "{ A[12, 4] }", "{ A[12, 12] }" } },
5096 { "{ A[t, i] : t = 14 and i = 1 }",
5097 1, { "{ A[14, 1] }" } },
5098 { "[n, m] -> { [a, b, c] : b <= a and a <= n and b > 0 and c >= b and "
5099 "c <= m and m <= n and m > 0 }",
5100 6, {
5101 "[n, m] -> { [n, m, m] : 0 < m <= n }",
5102 "[n, m] -> { [n, 1, m] : 0 < m <= n }",
5103 "[n, m] -> { [n, 1, 1] : 0 < m <= n }",
5104 "[n, m] -> { [m, m, m] : 0 < m <= n }",
5105 "[n, m] -> { [1, 1, m] : 0 < m <= n }",
5106 "[n, m] -> { [1, 1, 1] : 0 < m <= n }"
5107 } },
5108};
5109
5110/* Check that "vertex" corresponds to one of the vertices in data->vertex.
5111 */
5112static isl_stat find_vertex(__isl_take isl_vertex *vertex, void *user)
5113{
5114 struct isl_vertices_test_data *data = user;
5115 isl_ctx *ctx;
5116 isl_multi_aff *ma;
5117 isl_basic_setisl_basic_map *bset;
5118 isl_pw_multi_aff *pma;
5119 int i;
5120 isl_bool equal;
1
'equal' declared without an initial value
5121
5122 ctx = isl_vertex_get_ctx(vertex);
5123 bset = isl_vertex_get_domain(vertex);
5124 ma = isl_vertex_get_expr(vertex);
5125 pma = isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset), ma);
5126
5127 for (i = 0; i < data->n; ++i) {
2
Assuming the condition is false
3
Loop condition is false. Execution continues on line 5138
5128 isl_pw_multi_aff *pma_i;
5129
5130 pma_i = isl_pw_multi_aff_read_from_str(ctx, data->vertex[i]);
5131 equal = isl_pw_multi_aff_plain_is_equal(pma, pma_i);
5132 isl_pw_multi_aff_free(pma_i);
5133
5134 if (equal < 0 || equal)
5135 break;
5136 }
5137
5138 isl_pw_multi_aff_free(pma);
5139 isl_vertex_free(vertex);
5140
5141 if (equal < 0)
4
The left operand of '<' is a garbage value
5142 return isl_stat_error;
5143
5144 return equal ? isl_stat_ok : isl_stat_error;
5145}
5146
5147int test_vertices(isl_ctx *ctx)
5148{
5149 int i;
5150
5151 for (i = 0; i < ARRAY_SIZE(vertices_tests)(sizeof(vertices_tests)/sizeof(*vertices_tests)); ++i) {
5152 isl_basic_setisl_basic_map *bset;
5153 isl_vertices *vertices;
5154 int ok = 1;
5155 int n;
5156
5157 bset = isl_basic_set_read_from_str(ctx, vertices_tests[i].set);
5158 vertices = isl_basic_set_compute_vertices(bset);
5159 n = isl_vertices_get_n_vertices(vertices);
5160 if (vertices_tests[i].n != n)
5161 ok = 0;
5162 if (isl_vertices_foreach_vertex(vertices, &find_vertex,
5163 &vertices_tests[i]) < 0)
5164 ok = 0;
5165 isl_vertices_free(vertices);
5166 isl_basic_set_free(bset);
5167
5168 if (!vertices)
5169 return -1;
5170 if (!ok)
5171 isl_die(ctx, isl_error_unknown, "unexpected vertices",do { isl_handle_error(ctx, isl_error_unknown, "unexpected vertices"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5172); return -1; } while (0)
5172 return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected vertices"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5172); return -1; } while (0)
;
5173 }
5174
5175 return 0;
5176}
5177
5178int test_union_pw(isl_ctx *ctx)
5179{
5180 int equal;
5181 const char *str;
5182 isl_union_set *uset;
5183 isl_union_pw_qpolynomial *upwqp1, *upwqp2;
5184
5185 str = "{ [x] -> x^2 }";
5186 upwqp1 = isl_union_pw_qpolynomial_read_from_str(ctx, str);
5187 upwqp2 = isl_union_pw_qpolynomial_copy(upwqp1);
5188 uset = isl_union_pw_qpolynomial_domain(upwqp1);
5189 upwqp1 = isl_union_pw_qpolynomial_copy(upwqp2);
5190 upwqp1 = isl_union_pw_qpolynomial_intersect_domain(upwqp1, uset);
5191 equal = isl_union_pw_qpolynomial_plain_is_equal(upwqp1, upwqp2);
5192 isl_union_pw_qpolynomial_free(upwqp1);
5193 isl_union_pw_qpolynomial_free(upwqp2);
5194 if (equal < 0)
5195 return -1;
5196 if (!equal)
5197 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5197); return -1; } while (0)
;
5198
5199 return 0;
5200}
5201
5202/* Test that isl_union_pw_qpolynomial_eval picks up the function
5203 * defined over the correct domain space.
5204 */
5205static int test_eval_1(isl_ctx *ctx)
5206{
5207 const char *str;
5208 isl_point *pnt;
5209 isl_setisl_map *set;
5210 isl_union_pw_qpolynomial *upwqp;
5211 isl_val *v;
5212 int cmp;
5213
5214 str = "{ A[x] -> x^2; B[x] -> -x^2 }";
5215 upwqp = isl_union_pw_qpolynomial_read_from_str(ctx, str);
5216 str = "{ A[6] }";
5217 set = isl_set_read_from_str(ctx, str);
5218 pnt = isl_set_sample_point(set);
5219 v = isl_union_pw_qpolynomial_eval(upwqp, pnt);
5220 cmp = isl_val_cmp_si(v, 36);
5221 isl_val_free(v);
5222
5223 if (!v)
5224 return -1;
5225 if (cmp != 0)
5226 isl_die(ctx, isl_error_unknown, "unexpected value", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected value"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5226); return -1; } while (0)
;
5227
5228 return 0;
5229}
5230
5231/* Check that isl_qpolynomial_eval handles getting called on a void point.
5232 */
5233static int test_eval_2(isl_ctx *ctx)
5234{
5235 const char *str;
5236 isl_point *pnt;
5237 isl_setisl_map *set;
5238 isl_qpolynomial *qp;
5239 isl_val *v;
5240 isl_bool ok;
5241
5242 str = "{ A[x] -> [x] }";
5243 qp = isl_qpolynomial_from_aff(isl_aff_read_from_str(ctx, str));
5244 str = "{ A[x] : false }";
5245 set = isl_set_read_from_str(ctx, str);
5246 pnt = isl_set_sample_point(set);
5247 v = isl_qpolynomial_eval(qp, pnt);
5248 ok = isl_val_is_nan(v);
5249 isl_val_free(v);
5250
5251 if (ok < 0)
5252 return -1;
5253 if (!ok)
5254 isl_die(ctx, isl_error_unknown, "expecting NaN", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting NaN"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5254); return -1; } while (0)
;
5255
5256 return 0;
5257}
5258
5259/* Perform basic polynomial evaluation tests.
5260 */
5261static int test_eval(isl_ctx *ctx)
5262{
5263 if (test_eval_1(ctx) < 0)
5264 return -1;
5265 if (test_eval_2(ctx) < 0)
5266 return -1;
5267 return 0;
5268}
5269
5270/* Descriptions of sets that are tested for reparsing after printing.
5271 */
5272const char *output_tests[] = {
5273 "{ [1, y] : 0 <= y <= 1; [x, -x] : 0 <= x <= 1 }",
5274};
5275
5276/* Check that printing a set and reparsing a set from the printed output
5277 * results in the same set.
5278 */
5279static int test_output_set(isl_ctx *ctx)
5280{
5281 int i;
5282 char *str;
5283 isl_setisl_map *set1, *set2;
5284 isl_bool equal;
5285
5286 for (i = 0; i < ARRAY_SIZE(output_tests)(sizeof(output_tests)/sizeof(*output_tests)); ++i) {
5287 set1 = isl_set_read_from_str(ctx, output_tests[i]);
5288 str = isl_set_to_str(set1);
5289 set2 = isl_set_read_from_str(ctx, str);
5290 free(str);
5291 equal = isl_set_is_equal(set1, set2);
5292 isl_set_free(set1);
5293 isl_set_free(set2);
5294 if (equal < 0)
5295 return -1;
5296 if (!equal)
5297 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "parsed output not the same"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5298); return -1; } while (0)
5298 "parsed output not the same", return -1)do { isl_handle_error(ctx, isl_error_unknown, "parsed output not the same"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5298); return -1; } while (0)
;
5299 }
5300
5301 return 0;
5302}
5303
5304int test_output(isl_ctx *ctx)
5305{
5306 char *s;
5307 const char *str;
5308 isl_pw_aff *pa;
5309 isl_printer *p;
5310 int equal;
5311
5312 if (test_output_set(ctx) < 0)
5313 return -1;
5314
5315 str = "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }";
5316 pa = isl_pw_aff_read_from_str(ctx, str);
5317
5318 p = isl_printer_to_str(ctx);
5319 p = isl_printer_set_output_format(p, ISL_FORMAT_C4);
5320 p = isl_printer_print_pw_aff(p, pa);
5321 s = isl_printer_get_str(p);
5322 isl_printer_free(p);
5323 isl_pw_aff_free(pa);
5324 if (!s)
5325 equal = -1;
5326 else
5327 equal = !strcmp(s, "4 * floord(x, 4) + 2 >= x ? 1 : 2")__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p
(s) && __builtin_constant_p ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) && (__s1_len = __builtin_strlen (s), __s2_len = __builtin_strlen
("4 * floord(x, 4) + 2 >= x ? 1 : 2"), (!((size_t)(const void
*)((s) + 1) - (size_t)(const void *)(s) == 1) || __s1_len >=
4) && (!((size_t)(const void *)(("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) + 1) - (size_t)(const void *)("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) == 1) || __s2_len >= 4)) ? __builtin_strcmp (s, "4 * floord(x, 4) + 2 >= x ? 1 : 2"
) : (__builtin_constant_p (s) && ((size_t)(const void
*)((s) + 1) - (size_t)(const void *)(s) == 1) && (__s1_len
= __builtin_strlen (s), __s1_len < 4) ? (__builtin_constant_p
("4 * floord(x, 4) + 2 >= x ? 1 : 2") && ((size_t
)(const void *)(("4 * floord(x, 4) + 2 >= x ? 1 : 2") + 1)
- (size_t)(const void *)("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) == 1) ? __builtin_strcmp (s, "4 * floord(x, 4) + 2 >= x ? 1 : 2"
) : (__extension__ ({ const unsigned char *__s2 = (const unsigned
char *) (const char *) ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
); int __result = (((const unsigned char *) (const char *) (s
))[0] - __s2[0]); if (__s1_len > 0 && __result == 0
) { __result = (((const unsigned char *) (const char *) (s))[
1] - __s2[1]); if (__s1_len > 1 && __result == 0) {
__result = (((const unsigned char *) (const char *) (s))[2] -
__s2[2]); if (__s1_len > 2 && __result == 0) __result
= (((const unsigned char *) (const char *) (s))[3] - __s2[3]
); } } __result; }))) : (__builtin_constant_p ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) && ((size_t)(const void *)(("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) + 1) - (size_t)(const void *)("4 * floord(x, 4) + 2 >= x ? 1 : 2"
) == 1) && (__s2_len = __builtin_strlen ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
), __s2_len < 4) ? (__builtin_constant_p (s) && ((
size_t)(const void *)((s) + 1) - (size_t)(const void *)(s) ==
1) ? __builtin_strcmp (s, "4 * floord(x, 4) + 2 >= x ? 1 : 2"
) : -(__extension__ ({ const unsigned char *__s2 = (const unsigned
char *) (const char *) (s); int __result = (((const unsigned
char *) (const char *) ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
))[0] - __s2[0]); if (__s2_len > 0 && __result == 0
) { __result = (((const unsigned char *) (const char *) ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
))[1] - __s2[1]); if (__s2_len > 1 && __result == 0
) { __result = (((const unsigned char *) (const char *) ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
))[2] - __s2[2]); if (__s2_len > 2 && __result == 0
) __result = (((const unsigned char *) (const char *) ("4 * floord(x, 4) + 2 >= x ? 1 : 2"
))[3] - __s2[3]); } } __result; }))) : __builtin_strcmp (s, "4 * floord(x, 4) + 2 >= x ? 1 : 2"
)))); })
;
5328 free(s);
5329 if (equal < 0)
5330 return -1;
5331 if (!equal)
5332 isl_die(ctx, isl_error_unknown, "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5332); return -1; } while (0)
;
5333
5334 return 0;
5335}
5336
5337int test_sample(isl_ctx *ctx)
5338{
5339 const char *str;
5340 isl_basic_setisl_basic_map *bset1, *bset2;
5341 int empty, subset;
5342
5343 str = "{ [a, b, c, d, e, f, g, h, i, j, k] : "
5344 "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and "
5345 "3i >= -1 + 3221225466b + c + d - 3221225466e - f and "
5346 "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and "
5347 "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and "
5348 "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and "
5349 "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and "
5350 "3h >= a + 2147483646b + 2c - 2147483646e - 2f and "
5351 "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and "
5352 "f >= 1 - a + 1073741822b + c + d - 1073741822e and "
5353 "3i >= 1 + 2b - 2c + e + 2f + 3g and "
5354 "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +"
5355 "d - 1073741821e and "
5356 "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and "
5357 "3j >= 1 - a + b + 2e and "
5358 "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and "
5359 "3i <= 4 - a + 4b - e and "
5360 "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and "
5361 "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and "
5362 "c <= -1 + a and 3i >= -2 - a + 3e and "
5363 "1073741822e <= 1073741823 - a + 1073741822b + c and "
5364 "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and "
5365 "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and "
5366 "1073741823e >= 1 + 1073741823b - d and "
5367 "3i >= 1073741823b + c - 1073741823e - f and "
5368 "3i >= 1 + 2b + e + 3g }";
5369 bset1 = isl_basic_set_read_from_str(ctx, str);
5370 bset2 = isl_basic_set_sample(isl_basic_set_copy(bset1));
5371 empty = isl_basic_set_is_empty(bset2);
5372 subset = isl_basic_set_is_subset(bset2, bset1);
5373 isl_basic_set_free(bset1);
5374 isl_basic_set_free(bset2);
5375 if (empty < 0 || subset < 0)
5376 return -1;
5377 if (empty)
5378 isl_die(ctx, isl_error_unknown, "point not found", return -1)do { isl_handle_error(ctx, isl_error_unknown, "point not found"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5378); return -1; } while (0)
;
5379 if (!subset)
5380 isl_die(ctx, isl_error_unknown, "bad point found", return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad point found"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5380); return -1; } while (0)
;
5381
5382 return 0;
5383}
5384
5385int test_fixed_power(isl_ctx *ctx)
5386{
5387 const char *str;
5388 isl_map *map;
5389 isl_int exp;
5390 int equal;
5391
5392 isl_int_init(exp)isl_sioimath_init((exp));
5393 str = "{ [i] -> [i + 1] }";
5394 map = isl_map_read_from_str(ctx, str);
5395 isl_int_set_si(exp, 23)isl_sioimath_set_si((exp), 23);
5396 map = isl_map_fixed_power(map, exp);
5397 equal = map_check_equal(map, "{ [i] -> [i + 23] }");
5398 isl_int_clear(exp)isl_sioimath_clear((exp));
5399 isl_map_free(map);
5400 if (equal < 0)
5401 return -1;
5402
5403 return 0;
5404}
5405
5406int test_slice(isl_ctx *ctx)
5407{
5408 const char *str;
5409 isl_map *map;
5410 int equal;
5411
5412 str = "{ [i] -> [j] }";
5413 map = isl_map_read_from_str(ctx, str);
5414 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_out, 0);
5415 equal = map_check_equal(map, "{ [i] -> [i] }");
5416 isl_map_free(map);
5417 if (equal < 0)
5418 return -1;
5419
5420 str = "{ [i] -> [j] }";
5421 map = isl_map_read_from_str(ctx, str);
5422 map = isl_map_equate(map, isl_dim_in, 0, isl_dim_in, 0);
5423 equal = map_check_equal(map, "{ [i] -> [j] }");
5424 isl_map_free(map);
5425 if (equal < 0)
5426 return -1;
5427
5428 str = "{ [i] -> [j] }";
5429 map = isl_map_read_from_str(ctx, str);
5430 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_out, 0);
5431 equal = map_check_equal(map, "{ [i] -> [-i] }");
5432 isl_map_free(map);
5433 if (equal < 0)
5434 return -1;
5435
5436 str = "{ [i] -> [j] }";
5437 map = isl_map_read_from_str(ctx, str);
5438 map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_in, 0);
5439 equal = map_check_equal(map, "{ [0] -> [j] }");
5440 isl_map_free(map);
5441 if (equal < 0)
5442 return -1;
5443
5444 str = "{ [i] -> [j] }";
5445 map = isl_map_read_from_str(ctx, str);
5446 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_out, 0);
5447 equal = map_check_equal(map, "{ [i] -> [j] : i > j }");
5448 isl_map_free(map);
5449 if (equal < 0)
5450 return -1;
5451
5452 str = "{ [i] -> [j] }";
5453 map = isl_map_read_from_str(ctx, str);
5454 map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_in, 0);
5455 equal = map_check_equal(map, "{ [i] -> [j] : false }");
5456 isl_map_free(map);
5457 if (equal < 0)
5458 return -1;
5459
5460 return 0;
5461}
5462
5463int test_eliminate(isl_ctx *ctx)
5464{
5465 const char *str;
5466 isl_map *map;
5467 int equal;
5468
5469 str = "{ [i] -> [j] : i = 2j }";
5470 map = isl_map_read_from_str(ctx, str);
5471 map = isl_map_eliminate(map, isl_dim_out, 0, 1);
5472 equal = map_check_equal(map, "{ [i] -> [j] : exists a : i = 2a }");
5473 isl_map_free(map);
5474 if (equal < 0)
5475 return -1;
5476
5477 return 0;
5478}
5479
5480/* Check that isl_set_dim_residue_class detects that the values of j
5481 * in the set below are all odd and that it does not detect any spurious
5482 * strides.
5483 */
5484static int test_residue_class(isl_ctx *ctx)
5485{
5486 const char *str;
5487 isl_setisl_map *set;
5488 isl_int m, r;
5489 isl_stat res;
5490
5491 str = "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; "
5492 "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }";
5493 set = isl_set_read_from_str(ctx, str);
5494 isl_int_init(m)isl_sioimath_init((m));
5495 isl_int_init(r)isl_sioimath_init((r));
5496 res = isl_set_dim_residue_class(set, 1, &m, &r);
5497 if (res >= 0 &&
5498 (isl_int_cmp_si(m, 2)isl_sioimath_cmp_si(*(m), 2) != 0 || isl_int_cmp_si(r, 1)isl_sioimath_cmp_si(*(r), 1) != 0))
5499 isl_die(ctx, isl_error_unknown, "incorrect residue class",do { isl_handle_error(ctx, isl_error_unknown, "incorrect residue class"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5500); res = isl_stat_error; } while (0)
5500 res = isl_stat_error)do { isl_handle_error(ctx, isl_error_unknown, "incorrect residue class"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5500); res = isl_stat_error; } while (0)
;
5501 isl_int_clear(r)isl_sioimath_clear((r));
5502 isl_int_clear(m)isl_sioimath_clear((m));
5503 isl_set_free(set);
5504
5505 return res;
5506}
5507
5508int test_align_parameters(isl_ctx *ctx)
5509{
5510 const char *str;
5511 isl_space *space;
5512 isl_multi_aff *ma1, *ma2;
5513 int equal;
5514
5515 str = "{ A[B[] -> C[]] -> D[E[] -> F[]] }";
5516 ma1 = isl_multi_aff_read_from_str(ctx, str);
5517
5518 space = isl_space_params_alloc(ctx, 1);
5519 space = isl_space_set_dim_name(space, isl_dim_param, 0, "N");
5520 ma1 = isl_multi_aff_align_params(ma1, space);
5521
5522 str = "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }";
5523 ma2 = isl_multi_aff_read_from_str(ctx, str);
5524
5525 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
5526
5527 isl_multi_aff_free(ma1);
5528 isl_multi_aff_free(ma2);
5529
5530 if (equal < 0)
5531 return -1;
5532 if (!equal)
5533 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "result not as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5534); return -1; } while (0)
5534 "result not as expected", return -1)do { isl_handle_error(ctx, isl_error_unknown, "result not as expected"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5534); return -1; } while (0)
;
5535
5536 return 0;
5537}
5538
5539static int test_list(isl_ctx *ctx)
5540{
5541 isl_id *a, *b, *c, *d, *id;
5542 isl_id_list *list;
5543 int ok;
5544
5545 a = isl_id_alloc(ctx, "a", NULL((void*)0));
5546 b = isl_id_alloc(ctx, "b", NULL((void*)0));
5547 c = isl_id_alloc(ctx, "c", NULL((void*)0));
5548 d = isl_id_alloc(ctx, "d", NULL((void*)0));
5549
5550 list = isl_id_list_alloc(ctx, 4);
5551 list = isl_id_list_add(list, b);
5552 list = isl_id_list_insert(list, 0, a);
5553 list = isl_id_list_add(list, c);
5554 list = isl_id_list_add(list, d);
5555 list = isl_id_list_drop(list, 1, 1);
5556
5557 if (isl_id_list_n_id(list) != 3) {
5558 isl_id_list_free(list);
5559 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of elements in list"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5560); return -1; } while (0)
5560 "unexpected number of elements in list", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of elements in list"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5560); return -1; } while (0)
;
5561 }
5562
5563 id = isl_id_list_get_id(list, 0);
5564 ok = id == a;
5565 isl_id_free(id);
5566 id = isl_id_list_get_id(list, 1);
5567 ok = ok && id == c;
5568 isl_id_free(id);
5569 id = isl_id_list_get_id(list, 2);
5570 ok = ok && id == d;
5571 isl_id_free(id);
5572
5573 isl_id_list_free(list);
5574
5575 if (!ok)
5576 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected elements in list"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5577); return -1; } while (0)
5577 "unexpected elements in list", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected elements in list"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5577); return -1; } while (0)
;
5578
5579 return 0;
5580}
5581
5582const char *set_conversion_tests[] = {
5583 "[N] -> { [i] : N - 1 <= 2 i <= N }",
5584 "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }",
5585 "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5586 "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }",
5587 "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }",
5588 "[a, b] -> { [c, d] : (4*floor((-a + c)/4) = -a + c and "
5589 "32*floor((-b + d)/32) = -b + d and 5 <= c <= 8 and "
5590 "-3 + c <= d <= 28 + c) }",
5591};
5592
5593/* Check that converting from isl_set to isl_pw_multi_aff and back
5594 * to isl_set produces the original isl_set.
5595 */
5596static int test_set_conversion(isl_ctx *ctx)
5597{
5598 int i;
5599 const char *str;
5600 isl_setisl_map *set1, *set2;
5601 isl_pw_multi_aff *pma;
5602 int equal;
5603
5604 for (i = 0; i < ARRAY_SIZE(set_conversion_tests)(sizeof(set_conversion_tests)/sizeof(*set_conversion_tests)); ++i) {
5605 str = set_conversion_tests[i];
5606 set1 = isl_set_read_from_str(ctx, str);
5607 pma = isl_pw_multi_aff_from_set(isl_set_copy(set1));
5608 set2 = isl_set_from_pw_multi_aff(pma);
5609 equal = isl_set_is_equal(set1, set2);
5610 isl_set_free(set1);
5611 isl_set_free(set2);
5612
5613 if (equal < 0)
5614 return -1;
5615 if (!equal)
5616 isl_die(ctx, isl_error_unknown, "bad conversion",do { isl_handle_error(ctx, isl_error_unknown, "bad conversion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5617); return -1; } while (0)
5617 return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad conversion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5617); return -1; } while (0)
;
5618 }
5619
5620 return 0;
5621}
5622
5623const char *conversion_tests[] = {
5624 "{ [a, b, c, d] -> s0[a, b, e, f] : "
5625 "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], "
5626 "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and "
5627 "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and "
5628 "9e <= -2 - 2a) }",
5629 "{ [a, b] -> [c] : exists (e0 = floor((-a - b + c)/5): "
5630 "5e0 = -a - b + c and c >= -a and c <= 4 - a) }",
5631 "{ [a, b] -> [c] : exists d : 18 * d = -3 - a + 2c and 1 <= c <= 3 }",
5632};
5633
5634/* Check that converting from isl_map to isl_pw_multi_aff and back
5635 * to isl_map produces the original isl_map.
5636 */
5637static int test_map_conversion(isl_ctx *ctx)
5638{
5639 int i;
5640 isl_map *map1, *map2;
5641 isl_pw_multi_aff *pma;
5642 int equal;
5643
5644 for (i = 0; i < ARRAY_SIZE(conversion_tests)(sizeof(conversion_tests)/sizeof(*conversion_tests)); ++i) {
5645 map1 = isl_map_read_from_str(ctx, conversion_tests[i]);
5646 pma = isl_pw_multi_aff_from_map(isl_map_copy(map1));
5647 map2 = isl_map_from_pw_multi_aff(pma);
5648 equal = isl_map_is_equal(map1, map2);
5649 isl_map_free(map1);
5650 isl_map_free(map2);
5651
5652 if (equal < 0)
5653 return -1;
5654 if (!equal)
5655 isl_die(ctx, isl_error_unknown, "bad conversion",do { isl_handle_error(ctx, isl_error_unknown, "bad conversion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5656); return -1; } while (0)
5656 return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad conversion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5656); return -1; } while (0)
;
5657 }
5658
5659 return 0;
5660}
5661
5662static int test_conversion(isl_ctx *ctx)
5663{
5664 if (test_set_conversion(ctx) < 0)
5665 return -1;
5666 if (test_map_conversion(ctx) < 0)
5667 return -1;
5668 return 0;
5669}
5670
5671/* Check that isl_basic_map_curry does not modify input.
5672 */
5673static int test_curry(isl_ctx *ctx)
5674{
5675 const char *str;
5676 isl_basic_map *bmap1, *bmap2;
5677 int equal;
5678
5679 str = "{ [A[] -> B[]] -> C[] }";
5680 bmap1 = isl_basic_map_read_from_str(ctx, str);
5681 bmap2 = isl_basic_map_curry(isl_basic_map_copy(bmap1));
5682 equal = isl_basic_map_is_equal(bmap1, bmap2);
5683 isl_basic_map_free(bmap1);
5684 isl_basic_map_free(bmap2);
5685
5686 if (equal < 0)
5687 return -1;
5688 if (equal)
5689 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "curried map should not be equal to original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5691); return -1; } while (0)
5690 "curried map should not be equal to original",do { isl_handle_error(ctx, isl_error_unknown, "curried map should not be equal to original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5691); return -1; } while (0)
5691 return -1)do { isl_handle_error(ctx, isl_error_unknown, "curried map should not be equal to original"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5691); return -1; } while (0)
;
5692
5693 return 0;
5694}
5695
5696struct {
5697 const char *set;
5698 const char *ma;
5699 const char *res;
5700} preimage_tests[] = {
5701 { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }",
5702 "{ A[j,i] -> B[i,j] }",
5703 "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" },
5704 { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5705 "{ A[a,b] -> B[a/2,b/6] }",
5706 "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" },
5707 { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }",
5708 "{ A[a,b] -> B[a/2,b/6] }",
5709 "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and "
5710 "exists i,j : a = 2 i and b = 6 j }" },
5711 { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }",
5712 "[n] -> { : 0 <= n <= 100 }" },
5713 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5714 "{ A[a] -> B[2a] }",
5715 "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" },
5716 { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }",
5717 "{ A[a] -> B[([a/2])] }",
5718 "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" },
5719 { "{ B[i,j,k] : 0 <= i,j,k <= 100 }",
5720 "{ A[a] -> B[a,a,a/3] }",
5721 "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" },
5722 { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }",
5723 "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" },
5724};
5725
5726static int test_preimage_basic_set(isl_ctx *ctx)
5727{
5728 int i;
5729 isl_basic_setisl_basic_map *bset1, *bset2;
5730 isl_multi_aff *ma;
5731 int equal;
5732
5733 for (i = 0; i < ARRAY_SIZE(preimage_tests)(sizeof(preimage_tests)/sizeof(*preimage_tests)); ++i) {
5734 bset1 = isl_basic_set_read_from_str(ctx, preimage_tests[i].set);
5735 ma = isl_multi_aff_read_from_str(ctx, preimage_tests[i].ma);
5736 bset2 = isl_basic_set_read_from_str(ctx, preimage_tests[i].res);
5737 bset1 = isl_basic_set_preimage_multi_aff(bset1, ma);
5738 equal = isl_basic_set_is_equal(bset1, bset2);
5739 isl_basic_set_free(bset1);
5740 isl_basic_set_free(bset2);
5741 if (equal < 0)
5742 return -1;
5743 if (!equal)
5744 isl_die(ctx, isl_error_unknown, "bad preimage",do { isl_handle_error(ctx, isl_error_unknown, "bad preimage",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5745); return -1; } while (0)
5745 return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad preimage",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5745); return -1; } while (0)
;
5746 }
5747
5748 return 0;
5749}
5750
5751struct {
5752 const char *map;
5753 const char *ma;
5754 const char *res;
5755} preimage_domain_tests[] = {
5756 { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }",
5757 "{ A[j,i] -> B[i,j] }",
5758 "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" },
5759 { "{ B[i] -> C[i]; D[i] -> E[i] }",
5760 "{ A[i] -> B[i + 1] }",
5761 "{ A[i] -> C[i + 1] }" },
5762 { "{ B[i] -> C[i]; B[i] -> E[i] }",
5763 "{ A[i] -> B[i + 1] }",
5764 "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" },
5765 { "{ B[i] -> C[([i/2])] }",
5766 "{ A[i] -> B[2i] }",
5767 "{ A[i] -> C[i] }" },
5768 { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }",
5769 "{ A[i] -> B[([i/5]), ([i/7])] }",
5770 "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" },
5771 { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }",
5772 "[N] -> { A[] -> B[([N/5])] }",
5773 "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" },
5774 { "{ B[i] -> C[i] : exists a : i = 5 a }",
5775 "{ A[i] -> B[2i] }",
5776 "{ A[i] -> C[2i] : exists a : 2i = 5 a }" },
5777 { "{ B[i] -> C[i] : exists a : i = 2 a; "
5778 "B[i] -> D[i] : exists a : i = 2 a + 1 }",
5779 "{ A[i] -> B[2i] }",
5780 "{ A[i] -> C[2i] }" },
5781 { "{ A[i] -> B[i] }", "{ C[i] -> A[(i + floor(i/3))/2] }",
5782 "{ C[i] -> B[j] : 2j = i + floor(i/3) }" },
5783};
5784
5785static int test_preimage_union_map(isl_ctx *ctx)
5786{
5787 int i;
5788 isl_union_map *umap1, *umap2;
5789 isl_multi_aff *ma;
5790 int equal;
5791
5792 for (i = 0; i < ARRAY_SIZE(preimage_domain_tests)(sizeof(preimage_domain_tests)/sizeof(*preimage_domain_tests)
)
; ++i) {
5793 umap1 = isl_union_map_read_from_str(ctx,
5794 preimage_domain_tests[i].map);
5795 ma = isl_multi_aff_read_from_str(ctx,
5796 preimage_domain_tests[i].ma);
5797 umap2 = isl_union_map_read_from_str(ctx,
5798 preimage_domain_tests[i].res);
5799 umap1 = isl_union_map_preimage_domain_multi_aff(umap1, ma);
5800 equal = isl_union_map_is_equal(umap1, umap2);
5801 isl_union_map_free(umap1);
5802 isl_union_map_free(umap2);
5803 if (equal < 0)
5804 return -1;
5805 if (!equal)
5806 isl_die(ctx, isl_error_unknown, "bad preimage",do { isl_handle_error(ctx, isl_error_unknown, "bad preimage",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5807); return -1; } while (0)
5807 return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad preimage",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5807); return -1; } while (0)
;
5808 }
5809
5810 return 0;
5811}
5812
5813static int test_preimage(isl_ctx *ctx)
5814{
5815 if (test_preimage_basic_set(ctx) < 0)
5816 return -1;
5817 if (test_preimage_union_map(ctx) < 0)
5818 return -1;
5819
5820 return 0;
5821}
5822
5823struct {
5824 const char *ma1;
5825 const char *ma;
5826 const char *res;
5827} pullback_tests[] = {
5828 { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }",
5829 "{ A[a,b] -> C[b + 2a] }" },
5830 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" },
5831 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" },
5832 { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }",
5833 "{ A[a] -> C[(a)/6] }" },
5834 { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" },
5835 { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }",
5836 "{ A[a] -> C[(2a)/3] }" },
5837 { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"},
5838 { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }",
5839 "{ A[i,j] -> C[i + j, i + j] }"},
5840 { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" },
5841 { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }",
5842 "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", },
5843 { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }",
5844 "{ [i, j] -> [floor((i)/3), j] }",
5845 "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" },
5846};
5847
5848static int test_pullback(isl_ctx *ctx)
5849{
5850 int i;
5851 isl_multi_aff *ma1, *ma2;
5852 isl_multi_aff *ma;
5853 int equal;
5854
5855 for (i = 0; i < ARRAY_SIZE(pullback_tests)(sizeof(pullback_tests)/sizeof(*pullback_tests)); ++i) {
5856 ma1 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma1);
5857 ma = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma);
5858 ma2 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].res);
5859 ma1 = isl_multi_aff_pullback_multi_aff(ma1, ma);
5860 equal = isl_multi_aff_plain_is_equal(ma1, ma2);
5861 isl_multi_aff_free(ma1);
5862 isl_multi_aff_free(ma2);
5863 if (equal < 0)
5864 return -1;
5865 if (!equal)
5866 isl_die(ctx, isl_error_unknown, "bad pullback",do { isl_handle_error(ctx, isl_error_unknown, "bad pullback",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5867); return -1; } while (0)
5867 return -1)do { isl_handle_error(ctx, isl_error_unknown, "bad pullback",
"/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5867); return -1; } while (0)
;
5868 }
5869
5870 return 0;
5871}
5872
5873/* Check that negation is printed correctly and that equal expressions
5874 * are correctly identified.
5875 */
5876static int test_ast(isl_ctx *ctx)
5877{
5878 isl_ast_expr *expr, *expr1, *expr2, *expr3;
5879 char *str;
5880 int ok, equal;
5881
5882 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL((void*)0)));
5883 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL((void*)0)));
5884 expr = isl_ast_expr_add(expr1, expr2);
5885 expr2 = isl_ast_expr_copy(expr);
5886 expr = isl_ast_expr_neg(expr);
5887 expr2 = isl_ast_expr_neg(expr2);
5888 equal = isl_ast_expr_is_equal(expr, expr2);
5889 str = isl_ast_expr_to_C_str(expr);
5890 ok = str ? !strcmp(str, "-(A + B)")__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p
(str) && __builtin_constant_p ("-(A + B)") &&
(__s1_len = __builtin_strlen (str), __s2_len = __builtin_strlen
("-(A + B)"), (!((size_t)(const void *)((str) + 1) - (size_t
)(const void *)(str) == 1) || __s1_len >= 4) && (!
((size_t)(const void *)(("-(A + B)") + 1) - (size_t)(const void
*)("-(A + B)") == 1) || __s2_len >= 4)) ? __builtin_strcmp
(str, "-(A + B)") : (__builtin_constant_p (str) && (
(size_t)(const void *)((str) + 1) - (size_t)(const void *)(str
) == 1) && (__s1_len = __builtin_strlen (str), __s1_len
< 4) ? (__builtin_constant_p ("-(A + B)") && ((size_t
)(const void *)(("-(A + B)") + 1) - (size_t)(const void *)("-(A + B)"
) == 1) ? __builtin_strcmp (str, "-(A + B)") : (__extension__
({ const unsigned char *__s2 = (const unsigned char *) (const
char *) ("-(A + B)"); int __result = (((const unsigned char *
) (const char *) (str))[0] - __s2[0]); if (__s1_len > 0 &&
__result == 0) { __result = (((const unsigned char *) (const
char *) (str))[1] - __s2[1]); if (__s1_len > 1 &&
__result == 0) { __result = (((const unsigned char *) (const
char *) (str))[2] - __s2[2]); if (__s1_len > 2 &&
__result == 0) __result = (((const unsigned char *) (const char
*) (str))[3] - __s2[3]); } } __result; }))) : (__builtin_constant_p
("-(A + B)") && ((size_t)(const void *)(("-(A + B)")
+ 1) - (size_t)(const void *)("-(A + B)") == 1) && (
__s2_len = __builtin_strlen ("-(A + B)"), __s2_len < 4) ? (
__builtin_constant_p (str) && ((size_t)(const void *)
((str) + 1) - (size_t)(const void *)(str) == 1) ? __builtin_strcmp
(str, "-(A + B)") : -(__extension__ ({ const unsigned char *
__s2 = (const unsigned char *) (const char *) (str); int __result
= (((const unsigned char *) (const char *) ("-(A + B)"))[0] -
__s2[0]); if (__s2_len > 0 && __result == 0) { __result
= (((const unsigned char *) (const char *) ("-(A + B)"))[1] -
__s2[1]); if (__s2_len > 1 && __result == 0) { __result
= (((const unsigned char *) (const char *) ("-(A + B)"))[2] -
__s2[2]); if (__s2_len > 2 && __result == 0) __result
= (((const unsigned char *) (const char *) ("-(A + B)"))[3] -
__s2[3]); } } __result; }))) : __builtin_strcmp (str, "-(A + B)"
)))); })
: -1;
5891 free(str);
5892 isl_ast_expr_free(expr);
5893 isl_ast_expr_free(expr2);
5894
5895 if (ok < 0 || equal < 0)
5896 return -1;
5897 if (!equal)
5898 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "equal expressions not considered equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5899); return -1; } while (0)
5899 "equal expressions not considered equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "equal expressions not considered equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5899); return -1; } while (0)
;
5900 if (!ok)
5901 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5902); return -1; } while (0)
5902 "isl_ast_expr printed incorrectly", return -1)do { isl_handle_error(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5902); return -1; } while (0)
;
5903
5904 expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL((void*)0)));
5905 expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL((void*)0)));
5906 expr = isl_ast_expr_add(expr1, expr2);
5907 expr3 = isl_ast_expr_from_id(isl_id_alloc(ctx, "C", NULL((void*)0)));
5908 expr = isl_ast_expr_sub(expr3, expr);
5909 str = isl_ast_expr_to_C_str(expr);
5910 ok = str ? !strcmp(str, "C - (A + B)")__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p
(str) && __builtin_constant_p ("C - (A + B)") &&
(__s1_len = __builtin_strlen (str), __s2_len = __builtin_strlen
("C - (A + B)"), (!((size_t)(const void *)((str) + 1) - (size_t
)(const void *)(str) == 1) || __s1_len >= 4) && (!
((size_t)(const void *)(("C - (A + B)") + 1) - (size_t)(const
void *)("C - (A + B)") == 1) || __s2_len >= 4)) ? __builtin_strcmp
(str, "C - (A + B)") : (__builtin_constant_p (str) &&
((size_t)(const void *)((str) + 1) - (size_t)(const void *)(
str) == 1) && (__s1_len = __builtin_strlen (str), __s1_len
< 4) ? (__builtin_constant_p ("C - (A + B)") && (
(size_t)(const void *)(("C - (A + B)") + 1) - (size_t)(const void
*)("C - (A + B)") == 1) ? __builtin_strcmp (str, "C - (A + B)"
) : (__extension__ ({ const unsigned char *__s2 = (const unsigned
char *) (const char *) ("C - (A + B)"); int __result = (((const
unsigned char *) (const char *) (str))[0] - __s2[0]); if (__s1_len
> 0 && __result == 0) { __result = (((const unsigned
char *) (const char *) (str))[1] - __s2[1]); if (__s1_len >
1 && __result == 0) { __result = (((const unsigned char
*) (const char *) (str))[2] - __s2[2]); if (__s1_len > 2 &&
__result == 0) __result = (((const unsigned char *) (const char
*) (str))[3] - __s2[3]); } } __result; }))) : (__builtin_constant_p
("C - (A + B)") && ((size_t)(const void *)(("C - (A + B)"
) + 1) - (size_t)(const void *)("C - (A + B)") == 1) &&
(__s2_len = __builtin_strlen ("C - (A + B)"), __s2_len < 4
) ? (__builtin_constant_p (str) && ((size_t)(const void
*)((str) + 1) - (size_t)(const void *)(str) == 1) ? __builtin_strcmp
(str, "C - (A + B)") : -(__extension__ ({ const unsigned char
*__s2 = (const unsigned char *) (const char *) (str); int __result
= (((const unsigned char *) (const char *) ("C - (A + B)"))[
0] - __s2[0]); if (__s2_len > 0 && __result == 0) {
__result = (((const unsigned char *) (const char *) ("C - (A + B)"
))[1] - __s2[1]); if (__s2_len > 1 && __result == 0
) { __result = (((const unsigned char *) (const char *) ("C - (A + B)"
))[2] - __s2[2]); if (__s2_len > 2 && __result == 0
) __result = (((const unsigned char *) (const char *) ("C - (A + B)"
))[3] - __s2[3]); } } __result; }))) : __builtin_strcmp (str,
"C - (A + B)")))); })
: -1;
5911 free(str);
5912 isl_ast_expr_free(expr);
5913
5914 if (ok < 0)
5915 return -1;
5916 if (!ok)
5917 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5918); return -1; } while (0)
5918 "isl_ast_expr printed incorrectly", return -1)do { isl_handle_error(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5918); return -1; } while (0)
;
5919
5920 return 0;
5921}
5922
5923/* Check that isl_ast_build_expr_from_set returns a valid expression
5924 * for an empty set. Note that isl_ast_build_expr_from_set getting
5925 * called on an empty set probably indicates a bug in the caller.
5926 */
5927static int test_ast_build(isl_ctx *ctx)
5928{
5929 isl_setisl_map *set;
5930 isl_ast_build *build;
5931 isl_ast_expr *expr;
5932
5933 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
5934 build = isl_ast_build_from_context(set);
5935
5936 set = isl_set_empty(isl_space_params_alloc(ctx, 0));
5937 expr = isl_ast_build_expr_from_set(build, set);
5938
5939 isl_ast_expr_free(expr);
5940 isl_ast_build_free(build);
5941
5942 if (!expr)
5943 return -1;
5944
5945 return 0;
5946}
5947
5948/* Internal data structure for before_for and after_for callbacks.
5949 *
5950 * depth is the current depth
5951 * before is the number of times before_for has been called
5952 * after is the number of times after_for has been called
5953 */
5954struct isl_test_codegen_data {
5955 int depth;
5956 int before;
5957 int after;
5958};
5959
5960/* This function is called before each for loop in the AST generated
5961 * from test_ast_gen1.
5962 *
5963 * Increment the number of calls and the depth.
5964 * Check that the space returned by isl_ast_build_get_schedule_space
5965 * matches the target space of the schedule returned by
5966 * isl_ast_build_get_schedule.
5967 * Return an isl_id that is checked by the corresponding call
5968 * to after_for.
5969 */
5970static __isl_give isl_id *before_for(__isl_keep isl_ast_build *build,
5971 void *user)
5972{
5973 struct isl_test_codegen_data *data = user;
5974 isl_ctx *ctx;
5975 isl_space *space;
5976 isl_union_map *schedule;
5977 isl_union_set *uset;
5978 isl_setisl_map *set;
5979 int empty;
5980 char name[] = "d0";
5981
5982 ctx = isl_ast_build_get_ctx(build);
5983
5984 if (data->before >= 3)
5985 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5986); return ((void*)0); } while (0)
5986 "unexpected number of for nodes", return NULL)do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5986); return ((void*)0); } while (0)
;
5987 if (data->depth >= 2)
5988 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected depth"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5989); return ((void*)0); } while (0)
5989 "unexpected depth", return NULL)do { isl_handle_error(ctx, isl_error_unknown, "unexpected depth"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 5989); return ((void*)0); } while (0)
;
5990
5991 snprintf(name, sizeof(name), "d%d", data->depth);
5992 data->before++;
5993 data->depth++;
5994
5995 schedule = isl_ast_build_get_schedule(build);
5996 uset = isl_union_map_range(schedule);
5997 if (!uset)
5998 return NULL((void*)0);
5999 if (isl_union_set_n_set(uset) != 1) {
6000 isl_union_set_free(uset);
6001 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expecting single range space"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6002); return ((void*)0); } while (0)
6002 "expecting single range space", return NULL)do { isl_handle_error(ctx, isl_error_unknown, "expecting single range space"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6002); return ((void*)0); } while (0)
;
6003 }
6004
6005 space = isl_ast_build_get_schedule_space(build);
6006 set = isl_union_set_extract_set(uset, space);
6007 isl_union_set_free(uset);
6008 empty = isl_set_is_empty(set);
6009 isl_set_free(set);
6010
6011 if (empty < 0)
6012 return NULL((void*)0);
6013 if (empty)
6014 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "spaces don't match"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6015); return ((void*)0); } while (0)
6015 "spaces don't match", return NULL)do { isl_handle_error(ctx, isl_error_unknown, "spaces don't match"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6015); return ((void*)0); } while (0)
;
6016
6017 return isl_id_alloc(ctx, name, NULL((void*)0));
6018}
6019
6020/* This function is called after each for loop in the AST generated
6021 * from test_ast_gen1.
6022 *
6023 * Increment the number of calls and decrement the depth.
6024 * Check that the annotation attached to the node matches
6025 * the isl_id returned by the corresponding call to before_for.
6026 */
6027static __isl_give isl_ast_node *after_for(__isl_take isl_ast_node *node,
6028 __isl_keep isl_ast_build *build, void *user)
6029{
6030 struct isl_test_codegen_data *data = user;
6031 isl_id *id;
6032 const char *name;
6033 int valid;
6034
6035 data->after++;
6036 data->depth--;
6037
6038 if (data->after > data->before)
6039 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "mismatch in number of for nodes", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6041); return isl_ast_node_free(node); } while (0)
6040 "mismatch in number of for nodes",do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "mismatch in number of for nodes", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6041); return isl_ast_node_free(node); } while (0)
6041 return isl_ast_node_free(node))do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "mismatch in number of for nodes", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6041); return isl_ast_node_free(node); } while (0)
;
6042
6043 id = isl_ast_node_get_annotation(node);
6044 if (!id)
6045 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "missing annotation", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6046); return isl_ast_node_free(node); } while (0)
6046 "missing annotation", return isl_ast_node_free(node))do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "missing annotation", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6046); return isl_ast_node_free(node); } while (0)
;
6047
6048 name = isl_id_get_name(id);
6049 valid = name && atoi(name + 1) == data->depth;
6050 isl_id_free(id);
6051
6052 if (!valid)
6053 isl_die(isl_ast_node_get_ctx(node), isl_error_unknown,do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "wrong annotation", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6054); return isl_ast_node_free(node); } while (0)
6054 "wrong annotation", return isl_ast_node_free(node))do { isl_handle_error(isl_ast_node_get_ctx(node), isl_error_unknown
, "wrong annotation", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6054); return isl_ast_node_free(node); } while (0)
;
6055
6056 return node;
6057}
6058
6059/* Check that the before_each_for and after_each_for callbacks
6060 * are called for each for loop in the generated code,
6061 * that they are called in the right order and that the isl_id
6062 * returned from the before_each_for callback is attached to
6063 * the isl_ast_node passed to the corresponding after_each_for call.
6064 */
6065static int test_ast_gen1(isl_ctx *ctx)
6066{
6067 const char *str;
6068 isl_setisl_map *set;
6069 isl_union_map *schedule;
6070 isl_ast_build *build;
6071 isl_ast_node *tree;
6072 struct isl_test_codegen_data data;
6073
6074 str = "[N] -> { : N >= 10 }";
6075 set = isl_set_read_from_str(ctx, str);
6076 str = "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; "
6077 "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }";
6078 schedule = isl_union_map_read_from_str(ctx, str);
6079
6080 data.before = 0;
6081 data.after = 0;
6082 data.depth = 0;
6083 build = isl_ast_build_from_context(set);
6084 build = isl_ast_build_set_before_each_for(build,
6085 &before_for, &data);
6086 build = isl_ast_build_set_after_each_for(build,
6087 &after_for, &data);
6088 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6089 isl_ast_build_free(build);
6090 if (!tree)
6091 return -1;
6092
6093 isl_ast_node_free(tree);
6094
6095 if (data.before != 3 || data.after != 3)
6096 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6097); return -1; } while (0)
6097 "unexpected number of for nodes", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6097); return -1; } while (0)
;
6098
6099 return 0;
6100}
6101
6102/* Check that the AST generator handles domains that are integrally disjoint
6103 * but not rationally disjoint.
6104 */
6105static int test_ast_gen2(isl_ctx *ctx)
6106{
6107 const char *str;
6108 isl_setisl_map *set;
6109 isl_union_map *schedule;
6110 isl_union_map *options;
6111 isl_ast_build *build;
6112 isl_ast_node *tree;
6113
6114 str = "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }";
6115 schedule = isl_union_map_read_from_str(ctx, str);
6116 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
6117 build = isl_ast_build_from_context(set);
6118
6119 str = "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }";
6120 options = isl_union_map_read_from_str(ctx, str);
6121 build = isl_ast_build_set_options(build, options);
6122 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6123 isl_ast_build_free(build);
6124 if (!tree)
6125 return -1;
6126 isl_ast_node_free(tree);
6127
6128 return 0;
6129}
6130
6131/* Increment *user on each call.
6132 */
6133static __isl_give isl_ast_node *count_domains(__isl_take isl_ast_node *node,
6134 __isl_keep isl_ast_build *build, void *user)
6135{
6136 int *n = user;
6137
6138 (*n)++;
6139
6140 return node;
6141}
6142
6143/* Test that unrolling tries to minimize the number of instances.
6144 * In particular, for the schedule given below, make sure it generates
6145 * 3 nodes (rather than 101).
6146 */
6147static int test_ast_gen3(isl_ctx *ctx)
6148{
6149 const char *str;
6150 isl_setisl_map *set;
6151 isl_union_map *schedule;
6152 isl_union_map *options;
6153 isl_ast_build *build;
6154 isl_ast_node *tree;
6155 int n_domain = 0;
6156
6157 str = "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }";
6158 schedule = isl_union_map_read_from_str(ctx, str);
6159 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
6160
6161 str = "{ [i] -> unroll[0] }";
6162 options = isl_union_map_read_from_str(ctx, str);
6163
6164 build = isl_ast_build_from_context(set);
6165 build = isl_ast_build_set_options(build, options);
6166 build = isl_ast_build_set_at_each_domain(build,
6167 &count_domains, &n_domain);
6168 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6169 isl_ast_build_free(build);
6170 if (!tree)
6171 return -1;
6172
6173 isl_ast_node_free(tree);
6174
6175 if (n_domain != 3)
6176 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6177); return -1; } while (0)
6177 "unexpected number of for nodes", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected number of for nodes"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6177); return -1; } while (0)
;
6178
6179 return 0;
6180}
6181
6182/* Check that if the ast_build_exploit_nested_bounds options is set,
6183 * we do not get an outer if node in the generated AST,
6184 * while we do get such an outer if node if the options is not set.
6185 */
6186static int test_ast_gen4(isl_ctx *ctx)
6187{
6188 const char *str;
6189 isl_setisl_map *set;
6190 isl_union_map *schedule;
6191 isl_ast_build *build;
6192 isl_ast_node *tree;
6193 enum isl_ast_node_type type;
6194 int enb;
6195
6196 enb = isl_options_get_ast_build_exploit_nested_bounds(ctx);
6197 str = "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }";
6198
6199 isl_options_set_ast_build_exploit_nested_bounds(ctx, 1);
6200
6201 schedule = isl_union_map_read_from_str(ctx, str);
6202 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
6203 build = isl_ast_build_from_context(set);
6204 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6205 isl_ast_build_free(build);
6206 if (!tree)
6207 return -1;
6208
6209 type = isl_ast_node_get_type(tree);
6210 isl_ast_node_free(tree);
6211
6212 if (type == isl_ast_node_if)
6213 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "not expecting if node"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6214); return -1; } while (0)
6214 "not expecting if node", return -1)do { isl_handle_error(ctx, isl_error_unknown, "not expecting if node"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6214); return -1; } while (0)
;
6215
6216 isl_options_set_ast_build_exploit_nested_bounds(ctx, 0);
6217
6218 schedule = isl_union_map_read_from_str(ctx, str);
6219 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
6220 build = isl_ast_build_from_context(set);
6221 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6222 isl_ast_build_free(build);
6223 if (!tree)
6224 return -1;
6225
6226 type = isl_ast_node_get_type(tree);
6227 isl_ast_node_free(tree);
6228
6229 if (type != isl_ast_node_if)
6230 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expecting if node"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6231); return -1; } while (0)
6231 "expecting if node", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expecting if node"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6231); return -1; } while (0)
;
6232
6233 isl_options_set_ast_build_exploit_nested_bounds(ctx, enb);
6234
6235 return 0;
6236}
6237
6238/* This function is called for each leaf in the AST generated
6239 * from test_ast_gen5.
6240 *
6241 * We finalize the AST generation by extending the outer schedule
6242 * with a zero-dimensional schedule. If this results in any for loops,
6243 * then this means that we did not pass along enough information
6244 * about the outer schedule to the inner AST generation.
6245 */
6246static __isl_give isl_ast_node *create_leaf(__isl_take isl_ast_build *build,
6247 void *user)
6248{
6249 isl_union_map *schedule, *extra;
6250 isl_ast_node *tree;
6251
6252 schedule = isl_ast_build_get_schedule(build);
6253 extra = isl_union_map_copy(schedule);
6254 extra = isl_union_map_from_domain(isl_union_map_domain(extra));
6255 schedule = isl_union_map_range_product(schedule, extra);
6256 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6257 isl_ast_build_free(build);
6258
6259 if (!tree)
6260 return NULL((void*)0);
6261
6262 if (isl_ast_node_get_type(tree) == isl_ast_node_for)
6263 isl_die(isl_ast_node_get_ctx(tree), isl_error_unknown,do { isl_handle_error(isl_ast_node_get_ctx(tree), isl_error_unknown
, "code should not contain any for loop", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6265); return isl_ast_node_free(tree); } while (0)
6264 "code should not contain any for loop",do { isl_handle_error(isl_ast_node_get_ctx(tree), isl_error_unknown
, "code should not contain any for loop", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6265); return isl_ast_node_free(tree); } while (0)
6265 return isl_ast_node_free(tree))do { isl_handle_error(isl_ast_node_get_ctx(tree), isl_error_unknown
, "code should not contain any for loop", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6265); return isl_ast_node_free(tree); } while (0)
;
6266
6267 return tree;
6268}
6269
6270/* Check that we do not lose any information when going back and
6271 * forth between internal and external schedule.
6272 *
6273 * In particular, we create an AST where we unroll the only
6274 * non-constant dimension in the schedule. We therefore do
6275 * not expect any for loops in the AST. However, older versions
6276 * of isl would not pass along enough information about the outer
6277 * schedule when performing an inner code generation from a create_leaf
6278 * callback, resulting in the inner code generation producing a for loop.
6279 */
6280static int test_ast_gen5(isl_ctx *ctx)
6281{
6282 const char *str;
6283 isl_setisl_map *set;
6284 isl_union_map *schedule, *options;
6285 isl_ast_build *build;
6286 isl_ast_node *tree;
6287
6288 str = "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }";
6289 schedule = isl_union_map_read_from_str(ctx, str);
6290
6291 str = "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: "
6292 "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }";
6293 options = isl_union_map_read_from_str(ctx, str);
6294
6295 set = isl_set_universe(isl_space_params_alloc(ctx, 0));
6296 build = isl_ast_build_from_context(set);
6297 build = isl_ast_build_set_options(build, options);
6298 build = isl_ast_build_set_create_leaf(build, &create_leaf, NULL((void*)0));
6299 tree = isl_ast_build_node_from_schedule_map(build, schedule);
6300 isl_ast_build_free(build);
6301 isl_ast_node_free(tree);
6302 if (!tree)
6303 return -1;
6304
6305 return 0;
6306}
6307
6308/* Check that the expression
6309 *
6310 * [n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }
6311 *
6312 * is not combined into
6313 *
6314 * min(n/2, 0)
6315 *
6316 * as this would result in n/2 being evaluated in parts of
6317 * the definition domain where n is not a multiple of 2.
6318 */
6319static int test_ast_expr(isl_ctx *ctx)
6320{
6321 const char *str;
6322 isl_pw_aff *pa;
6323 isl_ast_build *build;
6324 isl_ast_expr *expr;
6325 int min_max;
6326 int is_min;
6327
6328 min_max = isl_options_get_ast_build_detect_min_max(ctx);
6329 isl_options_set_ast_build_detect_min_max(ctx, 1);
6330
6331 str = "[n] -> { [n/2] : n <= 0 and n % 2 = 0; [0] : n > 0 }";
6332 pa = isl_pw_aff_read_from_str(ctx, str);
6333 build = isl_ast_build_alloc(ctx);
6334 expr = isl_ast_build_expr_from_pw_aff(build, pa);
6335 is_min = isl_ast_expr_get_type(expr) == isl_ast_expr_op &&
6336 isl_ast_expr_get_op_type(expr) == isl_ast_op_min;
6337 isl_ast_build_free(build);
6338 isl_ast_expr_free(expr);
6339
6340 isl_options_set_ast_build_detect_min_max(ctx, min_max);
6341
6342 if (!expr)
6343 return -1;
6344 if (is_min)
6345 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expressions should not be combined"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6346); return -1; } while (0)
6346 "expressions should not be combined", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expressions should not be combined"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6346); return -1; } while (0)
;
6347
6348 return 0;
6349}
6350
6351static int test_ast_gen(isl_ctx *ctx)
6352{
6353 if (test_ast_gen1(ctx) < 0)
6354 return -1;
6355 if (test_ast_gen2(ctx) < 0)
6356 return -1;
6357 if (test_ast_gen3(ctx) < 0)
6358 return -1;
6359 if (test_ast_gen4(ctx) < 0)
6360 return -1;
6361 if (test_ast_gen5(ctx) < 0)
6362 return -1;
6363 if (test_ast_expr(ctx) < 0)
6364 return -1;
6365 return 0;
6366}
6367
6368/* Check if dropping output dimensions from an isl_pw_multi_aff
6369 * works properly.
6370 */
6371static int test_pw_multi_aff(isl_ctx *ctx)
6372{
6373 const char *str;
6374 isl_pw_multi_aff *pma1, *pma2;
6375 int equal;
6376
6377 str = "{ [i,j] -> [i+j, 4i-j] }";
6378 pma1 = isl_pw_multi_aff_read_from_str(ctx, str);
6379 str = "{ [i,j] -> [4i-j] }";
6380 pma2 = isl_pw_multi_aff_read_from_str(ctx, str);
6381
6382 pma1 = isl_pw_multi_aff_drop_dims(pma1, isl_dim_out, 0, 1);
6383
6384 equal = isl_pw_multi_aff_plain_is_equal(pma1, pma2);
6385
6386 isl_pw_multi_aff_free(pma1);
6387 isl_pw_multi_aff_free(pma2);
6388 if (equal < 0)
6389 return -1;
6390 if (!equal)
6391 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6392); return -1; } while (0)
6392 "expressions not equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6392); return -1; } while (0)
;
6393
6394 return 0;
6395}
6396
6397/* Check that we can properly parse multi piecewise affine expressions
6398 * where the piecewise affine expressions have different domains.
6399 */
6400static int test_multi_pw_aff(isl_ctx *ctx)
6401{
6402 const char *str;
6403 isl_setisl_map *dom, *dom2;
6404 isl_multi_pw_aff *mpa1, *mpa2;
6405 isl_pw_aff *pa;
6406 int equal;
6407 int equal_domain;
6408
6409 mpa1 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [i] }");
6410 dom = isl_set_read_from_str(ctx, "{ [i] : i > 0 }");
6411 mpa1 = isl_multi_pw_aff_intersect_domain(mpa1, dom);
6412 mpa2 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [2i] }");
6413 mpa2 = isl_multi_pw_aff_flat_range_product(mpa1, mpa2);
6414 str = "{ [i] -> [(i : i > 0), 2i] }";
6415 mpa1 = isl_multi_pw_aff_read_from_str(ctx, str);
6416
6417 equal = isl_multi_pw_aff_plain_is_equal(mpa1, mpa2);
6418
6419 pa = isl_multi_pw_aff_get_pw_aff(mpa1, 0);
6420 dom = isl_pw_aff_domain(pa);
6421 pa = isl_multi_pw_aff_get_pw_aff(mpa1, 1);
6422 dom2 = isl_pw_aff_domain(pa);
6423 equal_domain = isl_set_is_equal(dom, dom2);
6424
6425 isl_set_free(dom);
6426 isl_set_free(dom2);
6427 isl_multi_pw_aff_free(mpa1);
6428 isl_multi_pw_aff_free(mpa2);
6429
6430 if (equal < 0)
6431 return -1;
6432 if (!equal)
6433 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6434); return -1; } while (0)
6434 "expressions not equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6434); return -1; } while (0)
;
6435
6436 if (equal_domain < 0)
6437 return -1;
6438 if (equal_domain)
6439 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "domains unexpectedly equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6440); return -1; } while (0)
6440 "domains unexpectedly equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "domains unexpectedly equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6440); return -1; } while (0)
;
6441
6442 return 0;
6443}
6444
6445/* This is a regression test for a bug where isl_basic_map_simplify
6446 * would end up in an infinite loop. In particular, we construct
6447 * an empty basic set that is not obviously empty.
6448 * isl_basic_set_is_empty marks the basic set as empty.
6449 * After projecting out i3, the variable can be dropped completely,
6450 * but isl_basic_map_simplify refrains from doing so if the basic set
6451 * is empty and would end up in an infinite loop if it didn't test
6452 * explicitly for empty basic maps in the outer loop.
6453 */
6454static int test_simplify_1(isl_ctx *ctx)
6455{
6456 const char *str;
6457 isl_basic_setisl_basic_map *bset;
6458 int empty;
6459
6460 str = "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and "
6461 "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and "
6462 "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and "
6463 "i3 >= i2 }";
6464 bset = isl_basic_set_read_from_str(ctx, str);
6465 empty = isl_basic_set_is_empty(bset);
6466 bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1);
6467 isl_basic_set_free(bset);
6468 if (!bset)
6469 return -1;
6470 if (!empty)
6471 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "basic set should be empty"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6472); return -1; } while (0)
6472 "basic set should be empty", return -1)do { isl_handle_error(ctx, isl_error_unknown, "basic set should be empty"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6472); return -1; } while (0)
;
6473
6474 return 0;
6475}
6476
6477/* Check that the equality in the set description below
6478 * is simplified away.
6479 */
6480static int test_simplify_2(isl_ctx *ctx)
6481{
6482 const char *str;
6483 isl_basic_setisl_basic_map *bset;
6484 isl_bool universe;
6485
6486 str = "{ [a] : exists e0, e1: 32e1 = 31 + 31a + 31e0 }";
6487 bset = isl_basic_set_read_from_str(ctx, str);
6488 universe = isl_basic_set_plain_is_universe(bset);
6489 isl_basic_set_free(bset);
6490
6491 if (universe < 0)
6492 return -1;
6493 if (!universe)
6494 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "equality not simplified away"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6495); return -1; } while (0)
6495 "equality not simplified away", return -1)do { isl_handle_error(ctx, isl_error_unknown, "equality not simplified away"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6495); return -1; } while (0)
;
6496 return 0;
6497}
6498
6499/* Some simplification tests.
6500 */
6501static int test_simplify(isl_ctx *ctx)
6502{
6503 if (test_simplify_1(ctx) < 0)
6504 return -1;
6505 if (test_simplify_2(ctx) < 0)
6506 return -1;
6507 return 0;
6508}
6509
6510/* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt
6511 * with gbr context would fail to disable the use of the shifted tableau
6512 * when transferring equalities for the input to the context, resulting
6513 * in invalid sample values.
6514 */
6515static int test_partial_lexmin(isl_ctx *ctx)
6516{
6517 const char *str;
6518 isl_basic_setisl_basic_map *bset;
6519 isl_basic_map *bmap;
6520 isl_map *map;
6521
6522 str = "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }";
6523 bmap = isl_basic_map_read_from_str(ctx, str);
6524 str = "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }";
6525 bset = isl_basic_set_read_from_str(ctx, str);
6526 map = isl_basic_map_partial_lexmin(bmap, bset, NULL((void*)0));
6527 isl_map_free(map);
6528
6529 if (!map)
6530 return -1;
6531
6532 return 0;
6533}
6534
6535/* Check that the variable compression performed on the existentially
6536 * quantified variables inside isl_basic_set_compute_divs is not confused
6537 * by the implicit equalities among the parameters.
6538 */
6539static int test_compute_divs(isl_ctx *ctx)
6540{
6541 const char *str;
6542 isl_basic_setisl_basic_map *bset;
6543 isl_setisl_map *set;
6544
6545 str = "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and "
6546 "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and "
6547 "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and "
6548 "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }";
6549 bset = isl_basic_set_read_from_str(ctx, str);
6550 set = isl_basic_set_compute_divs(bset);
6551 isl_set_free(set);
6552 if (!set)
6553 return -1;
6554
6555 return 0;
6556}
6557
6558/* Check that the reaching domain elements and the prefix schedule
6559 * at a leaf node are the same before and after grouping.
6560 */
6561static int test_schedule_tree_group_1(isl_ctx *ctx)
6562{
6563 int equal;
6564 const char *str;
6565 isl_id *id;
6566 isl_union_set *uset;
6567 isl_multi_union_pw_aff *mupa;
6568 isl_union_pw_multi_aff *upma1, *upma2;
6569 isl_union_set *domain1, *domain2;
6570 isl_union_map *umap1, *umap2;
6571 isl_schedule_node *node;
6572
6573 str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }";
6574 uset = isl_union_set_read_from_str(ctx, str);
6575 node = isl_schedule_node_from_domain(uset);
6576 node = isl_schedule_node_child(node, 0);
6577 str = "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]";
6578 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6579 node = isl_schedule_node_insert_partial_schedule(node, mupa);
6580 node = isl_schedule_node_child(node, 0);
6581 str = "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]";
6582 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6583 node = isl_schedule_node_insert_partial_schedule(node, mupa);
6584 node = isl_schedule_node_child(node, 0);
6585 umap1 = isl_schedule_node_get_prefix_schedule_union_map(node);
6586 upma1 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node);
6587 domain1 = isl_schedule_node_get_domain(node);
6588 id = isl_id_alloc(ctx, "group", NULL((void*)0));
6589 node = isl_schedule_node_parent(node);
6590 node = isl_schedule_node_group(node, id);
6591 node = isl_schedule_node_child(node, 0);
6592 umap2 = isl_schedule_node_get_prefix_schedule_union_map(node);
6593 upma2 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node);
6594 domain2 = isl_schedule_node_get_domain(node);
6595 equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2);
6596 if (equal >= 0 && equal)
6597 equal = isl_union_set_is_equal(domain1, domain2);
6598 if (equal >= 0 && equal)
6599 equal = isl_union_map_is_equal(umap1, umap2);
6600 isl_union_map_free(umap1);
6601 isl_union_map_free(umap2);
6602 isl_union_set_free(domain1);
6603 isl_union_set_free(domain2);
6604 isl_union_pw_multi_aff_free(upma1);
6605 isl_union_pw_multi_aff_free(upma2);
6606 isl_schedule_node_free(node);
6607
6608 if (equal < 0)
6609 return -1;
6610 if (!equal)
6611 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6612); return -1; } while (0)
6612 "expressions not equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6612); return -1; } while (0)
;
6613
6614 return 0;
6615}
6616
6617/* Check that we can have nested groupings and that the union map
6618 * schedule representation is the same before and after the grouping.
6619 * Note that after the grouping, the union map representation contains
6620 * the domain constraints from the ranges of the expansion nodes,
6621 * while they are missing from the union map representation of
6622 * the tree without expansion nodes.
6623 *
6624 * Also check that the global expansion is as expected.
6625 */
6626static int test_schedule_tree_group_2(isl_ctx *ctx)
6627{
6628 int equal, equal_expansion;
6629 const char *str;
6630 isl_id *id;
6631 isl_union_set *uset;
6632 isl_union_map *umap1, *umap2;
6633 isl_union_map *expansion1, *expansion2;
6634 isl_union_set_list *filters;
6635 isl_multi_union_pw_aff *mupa;
6636 isl_schedule *schedule;
6637 isl_schedule_node *node;
6638
6639 str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; "
6640 "S3[i,j] : 0 <= i,j < 10 }";
6641 uset = isl_union_set_read_from_str(ctx, str);
6642 node = isl_schedule_node_from_domain(uset);
6643 node = isl_schedule_node_child(node, 0);
6644 str = "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]";
6645 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6646 node = isl_schedule_node_insert_partial_schedule(node, mupa);
6647 node = isl_schedule_node_child(node, 0);
6648 str = "{ S1[i,j] }";
6649 uset = isl_union_set_read_from_str(ctx, str);
6650 filters = isl_union_set_list_from_union_set(uset);
6651 str = "{ S2[i,j]; S3[i,j] }";
6652 uset = isl_union_set_read_from_str(ctx, str);
6653 filters = isl_union_set_list_add(filters, uset);
6654 node = isl_schedule_node_insert_sequence(node, filters);
6655 node = isl_schedule_node_child(node, 1);
6656 node = isl_schedule_node_child(node, 0);
6657 str = "{ S2[i,j] }";
6658 uset = isl_union_set_read_from_str(ctx, str);
6659 filters = isl_union_set_list_from_union_set(uset);
6660 str = "{ S3[i,j] }";
6661 uset = isl_union_set_read_from_str(ctx, str);
6662 filters = isl_union_set_list_add(filters, uset);
6663 node = isl_schedule_node_insert_sequence(node, filters);
6664
6665 schedule = isl_schedule_node_get_schedule(node);
6666 umap1 = isl_schedule_get_map(schedule);
6667 uset = isl_schedule_get_domain(schedule);
6668 umap1 = isl_union_map_intersect_domain(umap1, uset);
6669 isl_schedule_free(schedule);
6670
6671 node = isl_schedule_node_parent(node);
6672 node = isl_schedule_node_parent(node);
6673 id = isl_id_alloc(ctx, "group1", NULL((void*)0));
6674 node = isl_schedule_node_group(node, id);
6675 node = isl_schedule_node_child(node, 1);
6676 node = isl_schedule_node_child(node, 0);
6677 id = isl_id_alloc(ctx, "group2", NULL((void*)0));
6678 node = isl_schedule_node_group(node, id);
6679
6680 schedule = isl_schedule_node_get_schedule(node);
6681 umap2 = isl_schedule_get_map(schedule);
6682 isl_schedule_free(schedule);
6683
6684 node = isl_schedule_node_root(node);
6685 node = isl_schedule_node_child(node, 0);
6686 expansion1 = isl_schedule_node_get_subtree_expansion(node);
6687 isl_schedule_node_free(node);
6688
6689 str = "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; "
6690 "group1[i] -> S2[i,j] : 0 <= i,j < 10; "
6691 "group1[i] -> S3[i,j] : 0 <= i,j < 10 }";
6692
6693 expansion2 = isl_union_map_read_from_str(ctx, str);
6694
6695 equal = isl_union_map_is_equal(umap1, umap2);
6696 equal_expansion = isl_union_map_is_equal(expansion1, expansion2);
6697
6698 isl_union_map_free(umap1);
6699 isl_union_map_free(umap2);
6700 isl_union_map_free(expansion1);
6701 isl_union_map_free(expansion2);
6702
6703 if (equal < 0 || equal_expansion < 0)
6704 return -1;
6705 if (!equal)
6706 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6707); return -1; } while (0)
6707 "expressions not equal", return -1)do { isl_handle_error(ctx, isl_error_unknown, "expressions not equal"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6707); return -1; } while (0)
;
6708 if (!equal_expansion)
6709 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected expansion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6710); return -1; } while (0)
6710 "unexpected expansion", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected expansion"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6710); return -1; } while (0)
;
6711
6712 return 0;
6713}
6714
6715/* Some tests for the isl_schedule_node_group function.
6716 */
6717static int test_schedule_tree_group(isl_ctx *ctx)
6718{
6719 if (test_schedule_tree_group_1(ctx) < 0)
6720 return -1;
6721 if (test_schedule_tree_group_2(ctx) < 0)
6722 return -1;
6723 return 0;
6724}
6725
6726struct {
6727 const char *set;
6728 const char *dual;
6729} coef_tests[] = {
6730 { "{ rat: [i] : 0 <= i <= 10 }",
6731 "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" },
6732 { "{ rat: [i] : FALSE }",
6733 "{ rat: coefficients[[cst] -> [a]] }" },
6734 { "{ rat: [i] : }",
6735 "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" },
6736};
6737
6738struct {
6739 const char *set;
6740 const char *dual;
6741} sol_tests[] = {
6742 { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }",
6743 "{ rat: [i] : 0 <= i <= 10 }" },
6744 { "{ rat: coefficients[[cst] -> [a]] : FALSE }",
6745 "{ rat: [i] }" },
6746 { "{ rat: coefficients[[cst] -> [a]] }",
6747 "{ rat: [i] : FALSE }" },
6748};
6749
6750/* Test the basic functionality of isl_basic_set_coefficients and
6751 * isl_basic_set_solutions.
6752 */
6753static int test_dual(isl_ctx *ctx)
6754{
6755 int i;
6756
6757 for (i = 0; i < ARRAY_SIZE(coef_tests)(sizeof(coef_tests)/sizeof(*coef_tests)); ++i) {
6758 int equal;
6759 isl_basic_setisl_basic_map *bset1, *bset2;
6760
6761 bset1 = isl_basic_set_read_from_str(ctx, coef_tests[i].set);
6762 bset2 = isl_basic_set_read_from_str(ctx, coef_tests[i].dual);
6763 bset1 = isl_basic_set_coefficients(bset1);
6764 equal = isl_basic_set_is_equal(bset1, bset2);
6765 isl_basic_set_free(bset1);
6766 isl_basic_set_free(bset2);
6767 if (equal < 0)
6768 return -1;
6769 if (!equal)
6770 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect dual"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6771); return -1; } while (0)
6771 "incorrect dual", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect dual"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6771); return -1; } while (0)
;
6772 }
6773
6774 for (i = 0; i < ARRAY_SIZE(sol_tests)(sizeof(sol_tests)/sizeof(*sol_tests)); ++i) {
6775 int equal;
6776 isl_basic_setisl_basic_map *bset1, *bset2;
6777
6778 bset1 = isl_basic_set_read_from_str(ctx, sol_tests[i].set);
6779 bset2 = isl_basic_set_read_from_str(ctx, sol_tests[i].dual);
6780 bset1 = isl_basic_set_solutions(bset1);
6781 equal = isl_basic_set_is_equal(bset1, bset2);
6782 isl_basic_set_free(bset1);
6783 isl_basic_set_free(bset2);
6784 if (equal < 0)
6785 return -1;
6786 if (!equal)
6787 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "incorrect dual"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6788); return -1; } while (0)
6788 "incorrect dual", return -1)do { isl_handle_error(ctx, isl_error_unknown, "incorrect dual"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6788); return -1; } while (0)
;
6789 }
6790
6791 return 0;
6792}
6793
6794struct {
6795 int scale_tile;
6796 int shift_point;
6797 const char *domain;
6798 const char *schedule;
6799 const char *sizes;
6800 const char *tile;
6801 const char *point;
6802} tile_tests[] = {
6803 { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6804 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6805 "{ [32,32] }",
6806 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6807 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6808 },
6809 { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }",
6810 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6811 "{ [32,32] }",
6812 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6813 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6814 },
6815 { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6816 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6817 "{ [32,32] }",
6818 "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]",
6819 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6820 },
6821 { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }",
6822 "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]",
6823 "{ [32,32] }",
6824 "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]",
6825 "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]",
6826 },
6827};
6828
6829/* Basic tiling tests. Create a schedule tree with a domain and a band node,
6830 * tile the band and then check if the tile and point bands have the
6831 * expected partial schedule.
6832 */
6833static int test_tile(isl_ctx *ctx)
6834{
6835 int i;
6836 int scale;
6837 int shift;
6838
6839 scale = isl_options_get_tile_scale_tile_loops(ctx);
6840 shift = isl_options_get_tile_shift_point_loops(ctx);
6841
6842 for (i = 0; i < ARRAY_SIZE(tile_tests)(sizeof(tile_tests)/sizeof(*tile_tests)); ++i) {
6843 int opt;
6844 int equal;
6845 const char *str;
6846 isl_union_set *domain;
6847 isl_multi_union_pw_aff *mupa, *mupa2;
6848 isl_schedule_node *node;
6849 isl_multi_val *sizes;
6850
6851 opt = tile_tests[i].scale_tile;
6852 isl_options_set_tile_scale_tile_loops(ctx, opt);
6853 opt = tile_tests[i].shift_point;
6854 isl_options_set_tile_shift_point_loops(ctx, opt);
6855
6856 str = tile_tests[i].domain;
6857 domain = isl_union_set_read_from_str(ctx, str);
6858 node = isl_schedule_node_from_domain(domain);
6859 node = isl_schedule_node_child(node, 0);
6860 str = tile_tests[i].schedule;
6861 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6862 node = isl_schedule_node_insert_partial_schedule(node, mupa);
6863 str = tile_tests[i].sizes;
6864 sizes = isl_multi_val_read_from_str(ctx, str);
6865 node = isl_schedule_node_band_tile(node, sizes);
6866
6867 str = tile_tests[i].tile;
6868 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6869 mupa2 = isl_schedule_node_band_get_partial_schedule(node);
6870 equal = isl_multi_union_pw_aff_plain_is_equal(mupa, mupa2);
6871 isl_multi_union_pw_aff_free(mupa);
6872 isl_multi_union_pw_aff_free(mupa2);
6873
6874 node = isl_schedule_node_child(node, 0);
6875
6876 str = tile_tests[i].point;
6877 mupa = isl_multi_union_pw_aff_read_from_str(ctx, str);
6878 mupa2 = isl_schedule_node_band_get_partial_schedule(node);
6879 if (equal >= 0 && equal)
6880 equal = isl_multi_union_pw_aff_plain_is_equal(mupa,
6881 mupa2);
6882 isl_multi_union_pw_aff_free(mupa);
6883 isl_multi_union_pw_aff_free(mupa2);
6884
6885 isl_schedule_node_free(node);
6886
6887 if (equal < 0)
6888 return -1;
6889 if (!equal)
6890 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6891); return -1; } while (0)
6891 "unexpected result", return -1)do { isl_handle_error(ctx, isl_error_unknown, "unexpected result"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6891); return -1; } while (0)
;
6892 }
6893
6894 isl_options_set_tile_scale_tile_loops(ctx, scale);
6895 isl_options_set_tile_shift_point_loops(ctx, shift);
6896
6897 return 0;
6898}
6899
6900/* Check that the domain hash of a space is equal to the hash
6901 * of the domain of the space.
6902 */
6903static int test_domain_hash(isl_ctx *ctx)
6904{
6905 isl_map *map;
6906 isl_space *space;
6907 uint32_t hash1, hash2;
6908
6909 map = isl_map_read_from_str(ctx, "[n] -> { A[B[x] -> C[]] -> D[] }");
6910 space = isl_map_get_space(map);
6911 isl_map_free(map);
6912 hash1 = isl_space_get_domain_hash(space);
6913 space = isl_space_domain(space);
6914 hash2 = isl_space_get_hash(space);
6915 isl_space_free(space);
6916
6917 if (!space)
6918 return -1;
6919 if (hash1 != hash2)
6920 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "domain hash not equal to hash of domain"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6921); return -1; } while (0)
6921 "domain hash not equal to hash of domain", return -1)do { isl_handle_error(ctx, isl_error_unknown, "domain hash not equal to hash of domain"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6921); return -1; } while (0)
;
6922
6923 return 0;
6924}
6925
6926/* Check that a universe basic set that is not obviously equal to the universe
6927 * is still recognized as being equal to the universe.
6928 */
6929static int test_universe(isl_ctx *ctx)
6930{
6931 const char *s;
6932 isl_basic_setisl_basic_map *bset;
6933 isl_bool is_univ;
6934
6935 s = "{ [] : exists x, y : 3y <= 2x and y >= -3 + 2x and 2y >= 2 - x }";
6936 bset = isl_basic_set_read_from_str(ctx, s);
6937 is_univ = isl_basic_set_is_universe(bset);
6938 isl_basic_set_free(bset);
6939
6940 if (is_univ < 0)
6941 return -1;
6942 if (!is_univ)
6943 isl_die(ctx, isl_error_unknown,do { isl_handle_error(ctx, isl_error_unknown, "not recognized as universe set"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6944); return -1; } while (0)
6944 "not recognized as universe set", return -1)do { isl_handle_error(ctx, isl_error_unknown, "not recognized as universe set"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6944); return -1; } while (0)
;
6945
6946 return 0;
6947}
6948
6949/* Sets for which chambers are computed and checked.
6950 */
6951const char *chambers_tests[] = {
6952 "[A, B, C] -> { [x, y, z] : x >= 0 and y >= 0 and y <= A - x and "
6953 "z >= 0 and z <= C - y and z <= B - x - y }",
6954};
6955
6956/* Add the domain of "cell" to "cells".
6957 */
6958static isl_stat add_cell(__isl_take isl_cell *cell, void *user)
6959{
6960 isl_basic_set_listisl_basic_map_list **cells = user;
6961 isl_basic_setisl_basic_map *dom;
6962
6963 dom = isl_cell_get_domain(cell);
6964 isl_cell_free(cell);
6965 *cells = isl_basic_set_list_add(*cells, dom);
6966
6967 return *cells ? isl_stat_ok : isl_stat_error;
6968}
6969
6970/* Check that the elements of "list" are pairwise disjoint.
6971 */
6972static isl_stat check_pairwise_disjoint(__isl_keep isl_basic_set_listisl_basic_map_list *list)
6973{
6974 int i, j, n;
6975
6976 if (!list)
6977 return isl_stat_error;
6978
6979 n = isl_basic_set_list_n_basic_set(list);
6980 for (i = 0; i < n; ++i) {
6981 isl_basic_setisl_basic_map *bset_i;
6982
6983 bset_i = isl_basic_set_list_get_basic_set(list, i);
6984 for (j = i + 1; j < n; ++j) {
6985 isl_basic_setisl_basic_map *bset_j;
6986 isl_bool disjoint;
6987
6988 bset_j = isl_basic_set_list_get_basic_set(list, j);
6989 disjoint = isl_basic_set_is_disjoint(bset_i, bset_j);
6990 isl_basic_set_free(bset_j);
6991 if (!disjoint)
6992 isl_die(isl_basic_set_list_get_ctx(list),do { isl_handle_error(isl_basic_set_list_get_ctx(list), isl_error_unknown
, "not disjoint", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6994); break; } while (0)
6993 isl_error_unknown, "not disjoint",do { isl_handle_error(isl_basic_set_list_get_ctx(list), isl_error_unknown
, "not disjoint", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6994); break; } while (0)
6994 break)do { isl_handle_error(isl_basic_set_list_get_ctx(list), isl_error_unknown
, "not disjoint", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 6994); break; } while (0)
;
6995 if (disjoint < 0 || !disjoint)
6996 break;
6997 }
6998 isl_basic_set_free(bset_i);
6999 if (j < n)
7000 return isl_stat_error;
7001 }
7002
7003 return isl_stat_ok;
7004}
7005
7006/* Check that the chambers computed by isl_vertices_foreach_disjoint_cell
7007 * are pairwise disjoint.
7008 */
7009static int test_chambers(isl_ctx *ctx)
7010{
7011 int i;
7012
7013 for (i = 0; i < ARRAY_SIZE(chambers_tests)(sizeof(chambers_tests)/sizeof(*chambers_tests)); ++i) {
7014 isl_basic_setisl_basic_map *bset;
7015 isl_vertices *vertices;
7016 isl_basic_set_listisl_basic_map_list *cells;
7017 isl_stat ok;
7018
7019 bset = isl_basic_set_read_from_str(ctx, chambers_tests[i]);
7020 vertices = isl_basic_set_compute_vertices(bset);
7021 cells = isl_basic_set_list_alloc(ctx, 0);
7022 if (isl_vertices_foreach_disjoint_cell(vertices, &add_cell,
7023 &cells) < 0)
7024 cells = isl_basic_set_list_free(cells);
7025 ok = check_pairwise_disjoint(cells);
7026 isl_basic_set_list_free(cells);
7027 isl_vertices_free(vertices);
7028 isl_basic_set_free(bset);
7029
7030 if (ok < 0)
7031 return -1;
7032 }
7033
7034 return 0;
7035}
7036
7037struct {
7038 const char *name;
7039 int (*fn)(isl_ctx *ctx);
7040} tests [] = {
7041 { "universe", &test_universe },
7042 { "domain hash", &test_domain_hash },
7043 { "dual", &test_dual },
7044 { "dependence analysis", &test_flow },
7045 { "val", &test_val },
7046 { "compute divs", &test_compute_divs },
7047 { "partial lexmin", &test_partial_lexmin },
7048 { "simplify", &test_simplify },
7049 { "curry", &test_curry },
7050 { "piecewise multi affine expressions", &test_pw_multi_aff },
7051 { "multi piecewise affine expressions", &test_multi_pw_aff },
7052 { "conversion", &test_conversion },
7053 { "list", &test_list },
7054 { "align parameters", &test_align_parameters },
7055 { "preimage", &test_preimage },
7056 { "pullback", &test_pullback },
7057 { "AST", &test_ast },
7058 { "AST build", &test_ast_build },
7059 { "AST generation", &test_ast_gen },
7060 { "eliminate", &test_eliminate },
7061 { "residue class", &test_residue_class },
7062 { "div", &test_div },
7063 { "slice", &test_slice },
7064 { "fixed power", &test_fixed_power },
7065 { "sample", &test_sample },
7066 { "output", &test_output },
7067 { "vertices", &test_vertices },
7068 { "chambers", &test_chambers },
7069 { "fixed", &test_fixed },
7070 { "equal", &test_equal },
7071 { "disjoint", &test_disjoint },
7072 { "product", &test_product },
7073 { "dim_max", &test_dim_max },
7074 { "affine", &test_aff },
7075 { "injective", &test_injective },
7076 { "schedule (whole component)", &test_schedule_whole },
7077 { "schedule (incremental)", &test_schedule_incremental },
7078 { "schedule tree grouping", &test_schedule_tree_group },
7079 { "tile", &test_tile },
7080 { "union_pw", &test_union_pw },
7081 { "eval", &test_eval },
7082 { "parse", &test_parse },
7083 { "single-valued", &test_sv },
7084 { "affine hull", &test_affine_hull },
7085 { "simple_hull", &test_simple_hull },
7086 { "coalesce", &test_coalesce },
7087 { "factorize", &test_factorize },
7088 { "subset", &test_subset },
7089 { "subtract", &test_subtract },
7090 { "intersect", &test_intersect },
7091 { "lexmin", &test_lexmin },
7092 { "min", &test_min },
7093 { "gist", &test_gist },
7094 { "piecewise quasi-polynomials", &test_pwqp },
7095 { "lift", &test_lift },
7096 { "bound", &test_bound },
7097 { "union", &test_union },
7098 { "split periods", &test_split_periods },
7099 { "lexicographic order", &test_lex },
7100 { "bijectivity", &test_bijective },
7101 { "dataflow analysis", &test_dep },
7102 { "reading", &test_read },
7103 { "bounded", &test_bounded },
7104 { "construction", &test_construction },
7105 { "dimension manipulation", &test_dim },
7106 { "map application", &test_application },
7107 { "convex hull", &test_convex_hull },
7108 { "transitive closure", &test_closure },
7109};
7110
7111int main(int argc, char **argv)
7112{
7113 int i;
7114 struct isl_ctx *ctx;
7115 struct isl_options *options;
7116
7117 options = isl_options_new_with_defaults();
7118 assert(options)((options) ? (void) (0) : __assert_fail ("options", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn301389/tools/polly/lib/External/isl/isl_test.c"
, 7118, __PRETTY_FUNCTION__))
;
7119 argc = isl_options_parse(options, argc, argv, ISL_ARG_ALL(1 << 0));
7120
7121 ctx = isl_ctx_alloc_with_options(&isl_options_args, options);
7122 for (i = 0; i < ARRAY_SIZE(tests)(sizeof(tests)/sizeof(*tests)); ++i) {
7123 printf("%s\n", tests[i].name);
7124 if (tests[i].fn(ctx) < 0)
7125 goto error;
7126 }
7127 isl_ctx_free(ctx);
7128 return 0;
7129error:
7130 isl_ctx_free(ctx);
7131 return -1;
7132}