?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
update isl for change in isl_basic_set_read_from_file
[barvinok.git] / iscc.c
blob04d046a921c33eb98a4d51ac72c1b84f4cd4d6d7
1 #include <assert.h>
2 #include <ctype.h>
3 #include <stdio.h>
4 #include <string.h>
5 #include <unistd.h>
6 #include <isl/obj.h>
7 #include <isl/stream.h>
8 #include <isl/vertices.h>
9 #include <isl/flow.h>
10 #include <isl/band.h>
11 #include <isl/schedule.h>
12 #include <isl_obj_list.h>
13 #include <isl_obj_str.h>
14 #include <barvinok/isl.h>
15 #include <barvinok/options.h>
16 #include "lattice_width.h"
17
18 #include "config.h"
19
20 #ifdef HAVE_SIGACTION
21 #include <signal.h>
22
23 static isl_ctx *main_ctx;
24
25 static void handler(int signum)
26 {
27 if (isl_ctx_aborted(main_ctx))
28 exit(EXIT_FAILURE);
29 isl_ctx_abort(main_ctx);
30 }
31
32 static struct sigaction sa_old;
33
34 static void install_signal_handler(isl_ctx *ctx)
35 {
36 struct sigaction sa;
37
38 main_ctx = ctx;
39
40 memset(&sa, 0, sizeof(struct sigaction));
41 sa.sa_handler = &handler;
42 sa.sa_flags = SA_RESTART;
43 sigaction(SIGINT, &sa, &sa_old);
44 }
45
46 static void remove_signal_handler(isl_ctx *ctx)
47 {
48 sigaction(SIGINT, &sa_old, NULL);
49 }
50
51 #else
52
53 static void install_signal_handler(isl_ctx *ctx)
54 {
55 }
56
57 static void remove_signal_handler(isl_ctx *ctx)
58 {
59 }
60
61 #endif
62
63 #ifdef HAVE_CLOOG
64 #include <cloog/isl/cloog.h>
65 #endif
66
67 #ifdef HAVE_PET
68 #include <pet.h>
69 #endif
70
71 static int isl_bool_false = 0;
72 static int isl_bool_true = 1;
73 static int isl_bool_error = -1;
74
75 enum iscc_op { ISCC_READ, ISCC_WRITE, ISCC_SOURCE, ISCC_VERTICES,
76 ISCC_LAST, ISCC_ANY, ISCC_BEFORE, ISCC_UNDER,
77 ISCC_SCHEDULE, ISCC_SCHEDULE_FOREST,
78 ISCC_MINIMIZING, ISCC_RESPECTING,
79 ISCC_TYPEOF, ISCC_PRINT,
80 ISCC_N_OP };
81 static const char *op_name[ISCC_N_OP] = {
82 [ISCC_READ] = "read",
83 [ISCC_WRITE] = "write",
84 [ISCC_PRINT] = "print",
85 [ISCC_SOURCE] = "source",
86 [ISCC_VERTICES] = "vertices",
87 [ISCC_LAST] = "last",
88 [ISCC_ANY] = "any",
89 [ISCC_BEFORE] = "before",
90 [ISCC_UNDER] = "under",
91 [ISCC_SCHEDULE] = "schedule",
92 [ISCC_SCHEDULE_FOREST] = "schedule_forest",
93 [ISCC_MINIMIZING] = "minimizing",
94 [ISCC_RESPECTING] = "respecting",
95 [ISCC_TYPEOF] = "typeof"
96 };
97 static enum isl_token_type iscc_op[ISCC_N_OP];
98
99 struct isl_arg_choice iscc_format[] = {
100 {"isl", ISL_FORMAT_ISL},
101 {"omega", ISL_FORMAT_OMEGA},
102 {"polylib", ISL_FORMAT_POLYLIB},
103 {"ext-polylib", ISL_FORMAT_EXT_POLYLIB},
104 {"latex", ISL_FORMAT_LATEX},
105 {"C", ISL_FORMAT_C},
106 {0}
107 };
108
109 struct iscc_options {
110 struct barvinok_options *barvinok;
111 unsigned format;
112 int io;
113 };
114
115 struct isl_arg iscc_options_arg[] = {
116 ISL_ARG_CHILD(struct iscc_options, barvinok, "barvinok", barvinok_options_arg,
117 "barvinok options")
118 ISL_ARG_CHOICE(struct iscc_options, format, 0, "format", \
119 iscc_format, ISL_FORMAT_ISL, "output format")
120 ISL_ARG_BOOL(struct iscc_options, io, 0, "io", 1,
121 "allow read and write operations")
122 ISL_ARG_END
123 };
124
125 ISL_ARG_DEF(iscc_options, struct iscc_options, iscc_options_arg)
126 ISL_ARG_CTX_DEF(iscc_options, struct iscc_options, iscc_options_arg)
127
128 static void *isl_obj_bool_copy(void *v)
129 {
130 return v;
131 }
132
133 static void isl_obj_bool_free(void *v)
134 {
135 }
136
137 static __isl_give isl_printer *isl_obj_bool_print(__isl_take isl_printer *p,
138 void *v)
139 {
140 if (v == &isl_bool_true)
141 return isl_printer_print_str(p, "True");
142 else if (v == &isl_bool_false)
143 return isl_printer_print_str(p, "False");
144 else
145 return isl_printer_print_str(p, "Error");
146 }
147
148 static void *isl_obj_bool_add(void *v1, void *v2)
149 {
150 return v1;
151 }
152
153 struct isl_obj_vtable isl_obj_bool_vtable = {
154 isl_obj_bool_copy,
155 isl_obj_bool_add,
156 isl_obj_bool_print,
157 isl_obj_bool_free
158 };
159 #define isl_obj_bool (&isl_obj_bool_vtable)
160
161 int *isl_bool_from_int(int res)
162 {
163 return res < 0 ? &isl_bool_error : res ? &isl_bool_true : &isl_bool_false;
164 }
165
166 int *union_map_is_equal(__isl_take isl_union_map *map1,
167 __isl_take isl_union_map *map2)
168 {
169 int res = isl_union_map_is_equal(map1, map2);
170 isl_union_map_free(map1);
171 isl_union_map_free(map2);
172 return isl_bool_from_int(res);
173 }
174 int *union_set_is_equal(__isl_take isl_union_set *set1,
175 __isl_take isl_union_set *set2)
176 {
177 return union_map_is_equal((isl_union_map *)set1, (isl_union_map *)set2);
178 }
179
180 int *union_map_is_subset(__isl_take isl_union_map *map1,
181 __isl_take isl_union_map *map2)
182 {
183 int res = isl_union_map_is_subset(map1, map2);
184 isl_union_map_free(map1);
185 isl_union_map_free(map2);
186 return isl_bool_from_int(res);
187 }
188 int *union_set_is_subset(__isl_take isl_union_set *set1,
189 __isl_take isl_union_set *set2)
190 {
191 return union_map_is_subset((isl_union_map *)set1, (isl_union_map *)set2);
192 }
193
194 int *union_map_is_strict_subset(__isl_take isl_union_map *map1,
195 __isl_take isl_union_map *map2)
196 {
197 int res = isl_union_map_is_strict_subset(map1, map2);
198 isl_union_map_free(map1);
199 isl_union_map_free(map2);
200 return isl_bool_from_int(res);
201 }
202 int *union_set_is_strict_subset(__isl_take isl_union_set *set1,
203 __isl_take isl_union_set *set2)
204 {
205 return union_map_is_strict_subset((isl_union_map *)set1,
206 (isl_union_map *)set2);
207 }
208
209 int *union_map_is_superset(__isl_take isl_union_map *map1,
210 __isl_take isl_union_map *map2)
211 {
212 return union_map_is_subset(map2, map1);
213 }
214 int *union_set_is_superset(__isl_take isl_union_set *set1,
215 __isl_take isl_union_set *set2)
216 {
217 return union_set_is_subset(set2, set1);
218 }
219
220 int *union_map_is_strict_superset(__isl_take isl_union_map *map1,
221 __isl_take isl_union_map *map2)
222 {
223 return union_map_is_strict_subset(map2, map1);
224 }
225 int *union_set_is_strict_superset(__isl_take isl_union_set *set1,
226 __isl_take isl_union_set *set2)
227 {
228 return union_set_is_strict_subset(set2, set1);
229 }
230
231 extern struct isl_obj_vtable isl_obj_list_vtable;
232 #define isl_obj_list (&isl_obj_list_vtable)
233
234 typedef void *(*isc_bin_op_fn)(void *lhs, void *rhs);
235 struct isc_bin_op {
236 enum isl_token_type op;
237 isl_obj_type lhs;
238 isl_obj_type rhs;
239 isl_obj_type res;
240 isc_bin_op_fn fn;
241 };
242 struct isc_named_bin_op {
243 char *name;
244 struct isc_bin_op op;
245 };
246
247 struct iscc_at {
248 isl_union_pw_qpolynomial *upwqp;
249 isl_union_pw_qpolynomial *res;
250 };
251
252 static int eval_at(__isl_take isl_point *pnt, void *user)
253 {
254 struct iscc_at *at = (struct iscc_at *) user;
255 isl_qpolynomial *qp;
256 isl_set *set;
257
258 set = isl_set_from_point(isl_point_copy(pnt));
259 qp = isl_union_pw_qpolynomial_eval(
260 isl_union_pw_qpolynomial_copy(at->upwqp), pnt);
261
262 at->res = isl_union_pw_qpolynomial_add(at->res,
263 isl_union_pw_qpolynomial_from_pw_qpolynomial(
264 isl_pw_qpolynomial_alloc(set, qp)));
265
266 return 0;
267 }
268
269 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_at(
270 __isl_take isl_union_pw_qpolynomial *upwqp,
271 __isl_take isl_union_set *uset)
272 {
273 struct iscc_at at;
274
275 at.upwqp = upwqp;
276 at.res = isl_union_pw_qpolynomial_zero(isl_union_set_get_space(uset));
277
278 isl_union_set_foreach_point(uset, eval_at, &at);
279
280 isl_union_pw_qpolynomial_free(upwqp);
281 isl_union_set_free(uset);
282
283 return at.res;
284 }
285
286 struct iscc_fold_at {
287 isl_union_pw_qpolynomial_fold *upwf;
288 isl_union_pw_qpolynomial *res;
289 };
290
291 static int eval_fold_at(__isl_take isl_point *pnt, void *user)
292 {
293 struct iscc_fold_at *at = (struct iscc_fold_at *) user;
294 isl_qpolynomial *qp;
295 isl_set *set;
296
297 set = isl_set_from_point(isl_point_copy(pnt));
298 qp = isl_union_pw_qpolynomial_fold_eval(
299 isl_union_pw_qpolynomial_fold_copy(at->upwf), pnt);
300
301 at->res = isl_union_pw_qpolynomial_add(at->res,
302 isl_union_pw_qpolynomial_from_pw_qpolynomial(
303 isl_pw_qpolynomial_alloc(set, qp)));
304
305 return 0;
306 }
307
308 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_fold_at(
309 __isl_take isl_union_pw_qpolynomial_fold *upwf,
310 __isl_take isl_union_set *uset)
311 {
312 struct iscc_fold_at at;
313
314 at.upwf = upwf;
315 at.res = isl_union_pw_qpolynomial_zero(isl_union_set_get_space(uset));
316
317 isl_union_set_foreach_point(uset, eval_fold_at, &at);
318
319 isl_union_pw_qpolynomial_fold_free(upwf);
320 isl_union_set_free(uset);
321
322 return at.res;
323 }
324
325 static __isl_give isl_union_pw_qpolynomial_fold *union_pw_qpolynomial_add_union_pw_qpolynomial_fold(
326 __isl_take isl_union_pw_qpolynomial *upwqp,
327 __isl_take isl_union_pw_qpolynomial_fold *upwf)
328 {
329 return isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial(upwf,
330 upwqp);
331 }
332
333 static __isl_give struct isl_list *union_map_apply_union_pw_qpolynomial_fold(
334 __isl_take isl_union_map *umap,
335 __isl_take isl_union_pw_qpolynomial_fold *upwf)
336 {
337 isl_ctx *ctx;
338 struct isl_list *list;
339 int tight;
340
341 ctx = isl_union_map_get_ctx(umap);
342 list = isl_list_alloc(ctx, 2);
343 if (!list)
344 goto error2;
345
346 list->obj[0].type = isl_obj_union_pw_qpolynomial_fold;
347 list->obj[0].v = isl_union_map_apply_union_pw_qpolynomial_fold(umap,
348 upwf, &tight);
349 list->obj[1].type = isl_obj_bool;
350 list->obj[1].v = tight ? &isl_bool_true : &isl_bool_false;
351 if (tight < 0 || !list->obj[0].v)
352 goto error;
353
354 return list;
355 error2:
356 isl_union_map_free(umap);
357 isl_union_pw_qpolynomial_fold_free(upwf);
358 error:
359 isl_list_free(list);
360 return NULL;
361 }
362
363 static __isl_give struct isl_list *union_set_apply_union_pw_qpolynomial_fold(
364 __isl_take isl_union_set *uset,
365 __isl_take isl_union_pw_qpolynomial_fold *upwf)
366 {
367 isl_ctx *ctx;
368 struct isl_list *list;
369 int tight;
370
371 ctx = isl_union_set_get_ctx(uset);
372 list = isl_list_alloc(ctx, 2);
373 if (!list)
374 goto error2;
375
376 list->obj[0].type = isl_obj_union_pw_qpolynomial_fold;
377 list->obj[0].v = isl_union_set_apply_union_pw_qpolynomial_fold(uset,
378 upwf, &tight);
379 list->obj[1].type = isl_obj_bool;
380 list->obj[1].v = tight ? &isl_bool_true : &isl_bool_false;
381 if (tight < 0 || !list->obj[0].v)
382 goto error;
383
384 return list;
385 error2:
386 isl_union_set_free(uset);
387 isl_union_pw_qpolynomial_fold_free(upwf);
388 error:
389 isl_list_free(list);
390 return NULL;
391 }
392
393 static __isl_give isl_union_pw_qpolynomial *union_pw_qpolynomial_int_mul(
394 __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_int_obj *i)
395 {
396 isl_int v;
397
398 if (!i)
399 goto error;
400
401 isl_int_init(v);
402 isl_int_obj_get_int(i, &v);
403 upwqp = isl_union_pw_qpolynomial_mul_isl_int(upwqp, v);
404 isl_int_clear(v);
405
406 isl_int_obj_free(i);
407
408 return upwqp;
409 error:
410 isl_union_pw_qpolynomial_free(upwqp);
411 return NULL;
412 }
413
414 static __isl_give isl_union_pw_qpolynomial *int_union_pw_qpolynomial_mul(
415 __isl_take isl_int_obj *i, __isl_take isl_union_pw_qpolynomial *upwqp)
416 {
417 return union_pw_qpolynomial_int_mul(upwqp, i);
418 }
419
420 static __isl_give isl_union_pw_qpolynomial_fold *union_pw_qpolynomial_fold_int_mul(
421 __isl_take isl_union_pw_qpolynomial_fold *upwf,
422 __isl_take isl_int_obj *i)
423 {
424 isl_int v;
425
426 if (!i)
427 goto error;
428
429 isl_int_init(v);
430 isl_int_obj_get_int(i, &v);
431 upwf = isl_union_pw_qpolynomial_fold_mul_isl_int(upwf, v);
432 isl_int_clear(v);
433
434 isl_int_obj_free(i);
435
436 return upwf;
437 error:
438 isl_union_pw_qpolynomial_fold_free(upwf);
439 return NULL;
440 }
441
442 static __isl_give isl_union_pw_qpolynomial_fold *int_union_pw_qpolynomial_fold_mul(
443 __isl_take isl_int_obj *i,
444 __isl_take isl_union_pw_qpolynomial_fold *upwf)
445 {
446 return union_pw_qpolynomial_fold_int_mul(upwf, i);
447 }
448
449 struct isc_bin_op bin_ops[] = {
450 { '+', isl_obj_int, isl_obj_int, isl_obj_int,
451 (isc_bin_op_fn) &isl_int_obj_add },
452 { '-', isl_obj_int, isl_obj_int, isl_obj_int,
453 (isc_bin_op_fn) &isl_int_obj_sub },
454 { '*', isl_obj_int, isl_obj_int, isl_obj_int,
455 (isc_bin_op_fn) &isl_int_obj_mul },
456 { '+', isl_obj_union_set, isl_obj_union_set,
457 isl_obj_union_set,
458 (isc_bin_op_fn) &isl_union_set_union },
459 { '+', isl_obj_union_map, isl_obj_union_map,
460 isl_obj_union_map,
461 (isc_bin_op_fn) &isl_union_map_union },
462 { '-', isl_obj_union_set, isl_obj_union_set,
463 isl_obj_union_set,
464 (isc_bin_op_fn) &isl_union_set_subtract },
465 { '-', isl_obj_union_map, isl_obj_union_map,
466 isl_obj_union_map,
467 (isc_bin_op_fn) &isl_union_map_subtract },
468 { '*', isl_obj_union_set, isl_obj_union_set,
469 isl_obj_union_set,
470 (isc_bin_op_fn) &isl_union_set_intersect },
471 { '*', isl_obj_union_map, isl_obj_union_map,
472 isl_obj_union_map,
473 (isc_bin_op_fn) &isl_union_map_intersect },
474 { '*', isl_obj_union_map, isl_obj_union_set,
475 isl_obj_union_map,
476 (isc_bin_op_fn) &isl_union_map_intersect_domain },
477 { '.', isl_obj_union_map, isl_obj_union_map,
478 isl_obj_union_map,
479 (isc_bin_op_fn) &isl_union_map_apply_range },
480 { '.', isl_obj_union_map, isl_obj_union_pw_qpolynomial,
481 isl_obj_union_pw_qpolynomial,
482 (isc_bin_op_fn) &isl_union_map_apply_union_pw_qpolynomial },
483 { '.', isl_obj_union_map, isl_obj_union_pw_qpolynomial_fold,
484 isl_obj_list,
485 (isc_bin_op_fn) &union_map_apply_union_pw_qpolynomial_fold },
486 { ISL_TOKEN_TO, isl_obj_union_set, isl_obj_union_set,
487 isl_obj_union_map,
488 (isc_bin_op_fn) &isl_union_map_from_domain_and_range },
489 { '=', isl_obj_union_set, isl_obj_union_set, isl_obj_bool,
490 (isc_bin_op_fn) &union_set_is_equal },
491 { '=', isl_obj_union_map, isl_obj_union_map, isl_obj_bool,
492 (isc_bin_op_fn) &union_map_is_equal },
493 { ISL_TOKEN_LE, isl_obj_union_set, isl_obj_union_set,
494 isl_obj_bool, (isc_bin_op_fn) &union_set_is_subset },
495 { ISL_TOKEN_LE, isl_obj_union_map, isl_obj_union_map,
496 isl_obj_bool, (isc_bin_op_fn) &union_map_is_subset },
497 { ISL_TOKEN_LT, isl_obj_union_set, isl_obj_union_set,
498 isl_obj_bool, (isc_bin_op_fn) &union_set_is_strict_subset },
499 { ISL_TOKEN_LT, isl_obj_union_map, isl_obj_union_map,
500 isl_obj_bool, (isc_bin_op_fn) &union_map_is_strict_subset },
501 { ISL_TOKEN_GE, isl_obj_union_set, isl_obj_union_set,
502 isl_obj_bool, (isc_bin_op_fn) &union_set_is_superset },
503 { ISL_TOKEN_GE, isl_obj_union_map, isl_obj_union_map,
504 isl_obj_bool, (isc_bin_op_fn) &union_map_is_superset },
505 { ISL_TOKEN_GT, isl_obj_union_set, isl_obj_union_set,
506 isl_obj_bool, (isc_bin_op_fn) &union_set_is_strict_superset },
507 { ISL_TOKEN_GT, isl_obj_union_map, isl_obj_union_map,
508 isl_obj_bool, (isc_bin_op_fn) &union_map_is_strict_superset },
509 { ISL_TOKEN_LEX_LE, isl_obj_union_set, isl_obj_union_set,
510 isl_obj_union_map,
511 (isc_bin_op_fn) &isl_union_set_lex_le_union_set },
512 { ISL_TOKEN_LEX_LT, isl_obj_union_set, isl_obj_union_set,
513 isl_obj_union_map,
514 (isc_bin_op_fn) &isl_union_set_lex_lt_union_set },
515 { ISL_TOKEN_LEX_GE, isl_obj_union_set, isl_obj_union_set,
516 isl_obj_union_map,
517 (isc_bin_op_fn) &isl_union_set_lex_ge_union_set },
518 { ISL_TOKEN_LEX_GT, isl_obj_union_set, isl_obj_union_set,
519 isl_obj_union_map,
520 (isc_bin_op_fn) &isl_union_set_lex_gt_union_set },
521 { ISL_TOKEN_LEX_LE, isl_obj_union_map, isl_obj_union_map,
522 isl_obj_union_map,
523 (isc_bin_op_fn) &isl_union_map_lex_le_union_map },
524 { ISL_TOKEN_LEX_LT, isl_obj_union_map, isl_obj_union_map,
525 isl_obj_union_map,
526 (isc_bin_op_fn) &isl_union_map_lex_lt_union_map },
527 { ISL_TOKEN_LEX_GE, isl_obj_union_map, isl_obj_union_map,
528 isl_obj_union_map,
529 (isc_bin_op_fn) &isl_union_map_lex_ge_union_map },
530 { ISL_TOKEN_LEX_GT, isl_obj_union_map, isl_obj_union_map,
531 isl_obj_union_map,
532 (isc_bin_op_fn) &isl_union_map_lex_gt_union_map },
533 { '.', isl_obj_union_pw_qpolynomial_fold,
534 isl_obj_union_pw_qpolynomial_fold,
535 isl_obj_union_pw_qpolynomial_fold,
536 (isc_bin_op_fn) &isl_union_pw_qpolynomial_fold_fold },
537 { '+', isl_obj_union_pw_qpolynomial, isl_obj_union_pw_qpolynomial,
538 isl_obj_union_pw_qpolynomial,
539 (isc_bin_op_fn) &isl_union_pw_qpolynomial_add },
540 { '+', isl_obj_union_pw_qpolynomial,
541 isl_obj_union_pw_qpolynomial_fold,
542 isl_obj_union_pw_qpolynomial_fold,
543 (isc_bin_op_fn) &union_pw_qpolynomial_add_union_pw_qpolynomial_fold },
544 { '+', isl_obj_union_pw_qpolynomial_fold,
545 isl_obj_union_pw_qpolynomial,
546 isl_obj_union_pw_qpolynomial_fold,
547 (isc_bin_op_fn) &isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial },
548 { '-', isl_obj_union_pw_qpolynomial, isl_obj_union_pw_qpolynomial,
549 isl_obj_union_pw_qpolynomial,
550 (isc_bin_op_fn) &isl_union_pw_qpolynomial_sub },
551 { '*', isl_obj_int, isl_obj_union_pw_qpolynomial,
552 isl_obj_union_pw_qpolynomial,
553 (isc_bin_op_fn) &int_union_pw_qpolynomial_mul },
554 { '*', isl_obj_union_pw_qpolynomial, isl_obj_int,
555 isl_obj_union_pw_qpolynomial,
556 (isc_bin_op_fn) &union_pw_qpolynomial_int_mul },
557 { '*', isl_obj_int, isl_obj_union_pw_qpolynomial_fold,
558 isl_obj_union_pw_qpolynomial_fold,
559 (isc_bin_op_fn) &int_union_pw_qpolynomial_fold_mul },
560 { '*', isl_obj_union_pw_qpolynomial_fold, isl_obj_int,
561 isl_obj_union_pw_qpolynomial_fold,
562 (isc_bin_op_fn) &union_pw_qpolynomial_fold_int_mul },
563 { '*', isl_obj_union_pw_qpolynomial, isl_obj_union_pw_qpolynomial,
564 isl_obj_union_pw_qpolynomial,
565 (isc_bin_op_fn) &isl_union_pw_qpolynomial_mul },
566 { '*', isl_obj_union_pw_qpolynomial, isl_obj_union_set,
567 isl_obj_union_pw_qpolynomial,
568 (isc_bin_op_fn) &isl_union_pw_qpolynomial_intersect_domain },
569 { '*', isl_obj_union_pw_qpolynomial_fold, isl_obj_union_set,
570 isl_obj_union_pw_qpolynomial_fold,
571 (isc_bin_op_fn) &isl_union_pw_qpolynomial_fold_intersect_domain },
572 { '@', isl_obj_union_pw_qpolynomial, isl_obj_union_set,
573 isl_obj_union_pw_qpolynomial,
574 (isc_bin_op_fn) &isl_union_pw_qpolynomial_at },
575 { '@', isl_obj_union_pw_qpolynomial_fold, isl_obj_union_set,
576 isl_obj_union_pw_qpolynomial,
577 (isc_bin_op_fn) &isl_union_pw_qpolynomial_fold_at },
578 { '%', isl_obj_union_set, isl_obj_union_set,
579 isl_obj_union_set,
580 (isc_bin_op_fn) &isl_union_set_gist },
581 { '%', isl_obj_union_map, isl_obj_union_map,
582 isl_obj_union_map,
583 (isc_bin_op_fn) &isl_union_map_gist },
584 { '%', isl_obj_union_pw_qpolynomial, isl_obj_union_set,
585 isl_obj_union_pw_qpolynomial,
586 (isc_bin_op_fn) &isl_union_pw_qpolynomial_gist },
587 { '%', isl_obj_union_pw_qpolynomial_fold, isl_obj_union_set,
588 isl_obj_union_pw_qpolynomial_fold,
589 (isc_bin_op_fn) &isl_union_pw_qpolynomial_fold_gist },
590 { '+', isl_obj_str, isl_obj_str, isl_obj_str,
591 (isc_bin_op_fn) &isl_str_concat },
592 0
593 };
594
595 static __isl_give isl_union_map *map_after_map(__isl_take isl_union_map *umap1,
596 __isl_take isl_union_map *umap2)
597 {
598 return isl_union_map_apply_range(umap2, umap1);
599 }
600
601 static __isl_give isl_union_pw_qpolynomial *qpolynomial_after_map(
602 __isl_take isl_union_pw_qpolynomial *upwqp,
603 __isl_take isl_union_map *umap)
604 {
605 return isl_union_map_apply_union_pw_qpolynomial(umap, upwqp);
606 }
607
608 static __isl_give struct isl_list *qpolynomial_fold_after_map(
609 __isl_take isl_union_pw_qpolynomial_fold *upwf,
610 __isl_take isl_union_map *umap)
611 {
612 return union_map_apply_union_pw_qpolynomial_fold(umap, upwf);
613 }
614
615 struct isc_named_bin_op named_bin_ops[] = {
616 { "after", { -1, isl_obj_union_map, isl_obj_union_map,
617 isl_obj_union_map,
618 (isc_bin_op_fn) &map_after_map } },
619 { "after", { -1, isl_obj_union_pw_qpolynomial,
620 isl_obj_union_map, isl_obj_union_pw_qpolynomial,
621 (isc_bin_op_fn) &qpolynomial_after_map } },
622 { "after", { -1, isl_obj_union_pw_qpolynomial_fold,
623 isl_obj_union_map, isl_obj_list,
624 (isc_bin_op_fn) &qpolynomial_fold_after_map } },
625 { "before", { -1, isl_obj_union_map, isl_obj_union_map,
626 isl_obj_union_map,
627 (isc_bin_op_fn) &isl_union_map_apply_range } },
628 { "before", { -1, isl_obj_union_map,
629 isl_obj_union_pw_qpolynomial, isl_obj_union_pw_qpolynomial,
630 (isc_bin_op_fn) &isl_union_map_apply_union_pw_qpolynomial } },
631 { "before", { -1, isl_obj_union_map,
632 isl_obj_union_pw_qpolynomial_fold, isl_obj_list,
633 (isc_bin_op_fn) &union_map_apply_union_pw_qpolynomial_fold } },
634 { "cross", { -1, isl_obj_union_set, isl_obj_union_set,
635 isl_obj_union_set,
636 (isc_bin_op_fn) &isl_union_set_product } },
637 { "cross", { -1, isl_obj_union_map, isl_obj_union_map,
638 isl_obj_union_map,
639 (isc_bin_op_fn) &isl_union_map_product } },
640 NULL
641 };
642
643 __isl_give isl_set *union_set_sample(__isl_take isl_union_set *uset)
644 {
645 return isl_set_from_basic_set(isl_union_set_sample(uset));
646 }
647
648 __isl_give isl_map *union_map_sample(__isl_take isl_union_map *umap)
649 {
650 return isl_map_from_basic_map(isl_union_map_sample(umap));
651 }
652
653 static __isl_give struct isl_list *union_map_power(
654 __isl_take isl_union_map *umap)
655 {
656 isl_ctx *ctx;
657 struct isl_list *list;
658 int exact;
659
660 ctx = isl_union_map_get_ctx(umap);
661 list = isl_list_alloc(ctx, 2);
662 if (!list)
663 goto error2;
664
665 list->obj[0].type = isl_obj_union_map;
666 list->obj[0].v = isl_union_map_power(umap, &exact);
667 list->obj[1].type = isl_obj_bool;
668 list->obj[1].v = exact ? &isl_bool_true : &isl_bool_false;
669 if (exact < 0 || !list->obj[0].v)
670 goto error;
671
672 return list;
673 error2:
674 isl_union_map_free(umap);
675 error:
676 isl_list_free(list);
677 return NULL;
678 }
679
680 static __isl_give struct isl_list *union_pw_qpolynomial_upper_bound(
681 __isl_take isl_union_pw_qpolynomial *upwqp)
682 {
683 isl_ctx *ctx;
684 struct isl_list *list;
685 int tight;
686
687 ctx = isl_union_pw_qpolynomial_get_ctx(upwqp);
688 list = isl_list_alloc(ctx, 2);
689 if (!list)
690 goto error2;
691
692 list->obj[0].type = isl_obj_union_pw_qpolynomial_fold;
693 list->obj[0].v = isl_union_pw_qpolynomial_bound(upwqp,
694 isl_fold_max, &tight);
695 list->obj[1].type = isl_obj_bool;
696 list->obj[1].v = tight ? &isl_bool_true : &isl_bool_false;
697 if (tight < 0 || !list->obj[0].v)
698 goto error;
699
700 return list;
701 error2:
702 isl_union_pw_qpolynomial_free(upwqp);
703 error:
704 isl_list_free(list);
705 return NULL;
706 }
707
708 #ifdef HAVE_CLOOG
709 void *map_codegen(void *arg)
710 {
711 isl_space *dim;
712 isl_union_map *umap = (isl_union_map *)arg;
713 isl_ctx *ctx = isl_union_map_get_ctx(umap);
714 CloogState *state;
715 CloogOptions *options;
716 CloogDomain *context;
717 CloogUnionDomain *ud;
718 CloogInput *input;
719 struct clast_stmt *stmt;
720
721 state = cloog_isl_state_malloc(ctx);
722 options = cloog_options_malloc(state);
723 options->language = LANGUAGE_C;
724 options->strides = 1;
725 options->sh = 1;
726
727 ud = cloog_union_domain_from_isl_union_map(isl_union_map_copy(umap));
728
729 dim = isl_union_map_get_space(umap);
730 context = cloog_domain_from_isl_set(isl_set_universe(dim));
731
732 input = cloog_input_alloc(context, ud);
733
734 stmt = cloog_clast_create_from_input(input, options);
735 clast_pprint(stdout, stmt, 0, options);
736 cloog_clast_free(stmt);
737
738 error:
739 cloog_options_free(options);
740 cloog_state_free(state);
741 isl_union_map_free(umap);
742 return NULL;
743 }
744
745 void *set_codegen(void *arg)
746 {
747 isl_space *dim;
748 isl_union_set *uset = (isl_union_set *)arg;
749 isl_ctx *ctx = isl_union_set_get_ctx(uset);
750 CloogState *state;
751 CloogOptions *options;
752 CloogDomain *context;
753 CloogUnionDomain *ud;
754 CloogInput *input;
755 struct clast_stmt *stmt;
756
757 if (isl_union_set_n_set(uset) > 1)
758 isl_die(ctx, isl_error_invalid,
759 "code generation for more than one domain "
760 "requires a schedule", goto error);
761
762 state = cloog_isl_state_malloc(ctx);
763 options = cloog_options_malloc(state);
764 options->language = LANGUAGE_C;
765 options->strides = 1;
766 options->sh = 1;
767
768 ud = cloog_union_domain_from_isl_union_set(isl_union_set_copy(uset));
769
770 dim = isl_union_set_get_space(uset);
771 context = cloog_domain_from_isl_set(isl_set_universe(dim));
772
773 input = cloog_input_alloc(context, ud);
774
775 stmt = cloog_clast_create_from_input(input, options);
776 clast_pprint(stdout, stmt, 0, options);
777 cloog_clast_free(stmt);
778
779 cloog_options_free(options);
780 cloog_state_free(state);
781 error:
782 isl_union_set_free(uset);
783 return NULL;
784 }
785 #endif
786
787 #ifdef HAVE_PET
788 static __isl_give isl_list *parse(__isl_take isl_str *str)
789 {
790 isl_ctx *ctx;
791 struct isl_list *list;
792 struct pet_scop *scop;
793 isl_union_map *sched, *reads, *writes;
794 isl_union_set *domain;
795 struct iscc_options *options;
796
797 if (!str)
798 return NULL;
799 ctx = str->ctx;
800
801 options = isl_ctx_peek_iscc_options(ctx);
802 if (!options || !options->io) {
803 isl_str_free(str);
804 isl_die(ctx, isl_error_invalid,
805 "parse_file operation not allowed", return NULL);
806 }
807
808 list = isl_list_alloc(ctx, 4);
809 if (!list)
810 goto error;
811
812 scop = pet_scop_extract_from_C_source(ctx, str->s, NULL, 1);
813 domain = pet_scop_collect_domains(scop);
814 sched = pet_scop_collect_schedule(scop);
815 reads = pet_scop_collect_reads(scop);
816 writes = pet_scop_collect_writes(scop);
817 pet_scop_free(scop);
818
819 list->obj[0].type = isl_obj_union_set;
820 list->obj[0].v = domain;
821 list->obj[1].type = isl_obj_union_map;
822 list->obj[1].v = writes;
823 list->obj[2].type = isl_obj_union_map;
824 list->obj[2].v = reads;
825 list->obj[3].type = isl_obj_union_map;
826 list->obj[3].v = sched;
827
828 if (!list->obj[0].v || !list->obj[1].v ||
829 !list->obj[2].v || !list->obj[3].v)
830 goto error;
831
832 isl_str_free(str);
833 return list;
834 error:
835 isl_list_free(list);
836 isl_str_free(str);
837 return NULL;
838 }
839 #endif
840
841 static int add_point(__isl_take isl_point *pnt, void *user)
842 {
843 isl_union_set **scan = (isl_union_set **) user;
844
845 *scan = isl_union_set_add_set(*scan, isl_set_from_point(pnt));
846
847 return 0;
848 }
849
850 static __isl_give isl_union_set *union_set_scan(__isl_take isl_union_set *uset)
851 {
852 isl_union_set *scan;
853
854 scan = isl_union_set_empty(isl_union_set_get_space(uset));
855
856 if (isl_union_set_foreach_point(uset, add_point, &scan) < 0) {
857 isl_union_set_free(scan);
858 return uset;
859 }
860
861 isl_union_set_free(uset);
862 return scan;
863 }
864
865 static __isl_give isl_union_map *union_map_scan(__isl_take isl_union_map *umap)
866 {
867 return isl_union_set_unwrap(union_set_scan(isl_union_map_wrap(umap)));
868 }
869
870 static __isl_give isl_union_pw_qpolynomial *union_pw_qpolynomial_poly(
871 __isl_take isl_union_pw_qpolynomial *upwqp)
872 {
873 return isl_union_pw_qpolynomial_to_polynomial(upwqp, 0);
874 }
875
876 static __isl_give isl_union_pw_qpolynomial *union_pw_qpolynomial_lpoly(
877 __isl_take isl_union_pw_qpolynomial *upwqp)
878 {
879 return isl_union_pw_qpolynomial_to_polynomial(upwqp, -1);
880 }
881
882 static __isl_give isl_union_pw_qpolynomial *union_pw_qpolynomial_upoly(
883 __isl_take isl_union_pw_qpolynomial *upwqp)
884 {
885 return isl_union_pw_qpolynomial_to_polynomial(upwqp, 1);
886 }
887
888 typedef void *(*isc_un_op_fn)(void *arg);
889 struct isc_un_op {
890 enum isl_token_type op;
891 isl_obj_type arg;
892 isl_obj_type res;
893 isc_un_op_fn fn;
894 };
895 struct isc_named_un_op {
896 char *name;
897 struct isc_un_op op;
898 };
899 struct isc_named_un_op named_un_ops[] = {
900 {"aff", { -1, isl_obj_union_map, isl_obj_union_map,
901 (isc_un_op_fn) &isl_union_map_affine_hull } },
902 {"aff", { -1, isl_obj_union_set, isl_obj_union_set,
903 (isc_un_op_fn) &isl_union_set_affine_hull } },
904 {"card", { -1, isl_obj_union_set,
905 isl_obj_union_pw_qpolynomial,
906 (isc_un_op_fn) &isl_union_set_card } },
907 {"card", { -1, isl_obj_union_map,
908 isl_obj_union_pw_qpolynomial,
909 (isc_un_op_fn) &isl_union_map_card } },
910 {"coalesce", { -1, isl_obj_union_set, isl_obj_union_set,
911 (isc_un_op_fn) &isl_union_set_coalesce } },
912 {"coalesce", { -1, isl_obj_union_map, isl_obj_union_map,
913 (isc_un_op_fn) &isl_union_map_coalesce } },
914 {"coalesce", { -1, isl_obj_union_pw_qpolynomial,
915 isl_obj_union_pw_qpolynomial,
916 (isc_un_op_fn) &isl_union_pw_qpolynomial_coalesce } },
917 {"coalesce", { -1, isl_obj_union_pw_qpolynomial_fold,
918 isl_obj_union_pw_qpolynomial_fold,
919 (isc_un_op_fn) &isl_union_pw_qpolynomial_fold_coalesce } },
920 #ifdef HAVE_CLOOG
921 {"codegen", { -1, isl_obj_union_set, isl_obj_none,
922 &set_codegen } },
923 {"codegen", { -1, isl_obj_union_map, isl_obj_none,
924 &map_codegen } },
925 #endif
926 {"coefficients", { -1, isl_obj_union_set,
927 isl_obj_union_set,
928 (isc_un_op_fn) &isl_union_set_coefficients } },
929 {"solutions", { -1, isl_obj_union_set, isl_obj_union_set,
930 (isc_un_op_fn) &isl_union_set_solutions } },
931 {"deltas", { -1, isl_obj_union_map, isl_obj_union_set,
932 (isc_un_op_fn) &isl_union_map_deltas } },
933 {"deltas_map", { -1, isl_obj_union_map, isl_obj_union_map,
934 (isc_un_op_fn) &isl_union_map_deltas_map } },
935 {"dom", { -1, isl_obj_union_map, isl_obj_union_set,
936 (isc_un_op_fn) &isl_union_map_domain } },
937 {"dom", { -1, isl_obj_union_pw_qpolynomial, isl_obj_union_set,
938 (isc_un_op_fn) &isl_union_pw_qpolynomial_domain } },
939 {"dom", { -1, isl_obj_union_pw_qpolynomial_fold,
940 isl_obj_union_set,
941 (isc_un_op_fn) &isl_union_pw_qpolynomial_fold_domain } },
942 {"domain", { -1, isl_obj_union_map, isl_obj_union_set,
943 (isc_un_op_fn) &isl_union_map_domain } },
944 {"domain", { -1, isl_obj_union_pw_qpolynomial,
945 isl_obj_union_set,
946 (isc_un_op_fn) &isl_union_pw_qpolynomial_domain } },
947 {"domain", { -1, isl_obj_union_pw_qpolynomial_fold,
948 isl_obj_union_set,
949 (isc_un_op_fn) &isl_union_pw_qpolynomial_fold_domain } },
950 {"domain_map", { -1, isl_obj_union_map, isl_obj_union_map,
951 (isc_un_op_fn) &isl_union_map_domain_map } },
952 {"ran", { -1, isl_obj_union_map, isl_obj_union_set,
953 (isc_un_op_fn) &isl_union_map_range } },
954 {"range", { -1, isl_obj_union_map, isl_obj_union_set,
955 (isc_un_op_fn) &isl_union_map_range } },
956 {"range_map", { -1, isl_obj_union_map, isl_obj_union_map,
957 (isc_un_op_fn) &isl_union_map_range_map } },
958 {"identity", { -1, isl_obj_union_set, isl_obj_union_map,
959 (isc_un_op_fn) &isl_union_set_identity } },
960 {"lattice_width", { -1, isl_obj_union_set,
961 isl_obj_union_pw_qpolynomial,
962 (isc_un_op_fn) &isl_union_set_lattice_width } },
963 {"lexmin", { -1, isl_obj_union_map, isl_obj_union_map,
964 (isc_un_op_fn) &isl_union_map_lexmin } },
965 {"lexmax", { -1, isl_obj_union_map, isl_obj_union_map,
966 (isc_un_op_fn) &isl_union_map_lexmax } },
967 {"lexmin", { -1, isl_obj_union_set, isl_obj_union_set,
968 (isc_un_op_fn) &isl_union_set_lexmin } },
969 {"lexmax", { -1, isl_obj_union_set, isl_obj_union_set,
970 (isc_un_op_fn) &isl_union_set_lexmax } },
971 {"lift", { -1, isl_obj_union_set, isl_obj_union_set,
972 (isc_un_op_fn) &isl_union_set_lift } },
973 {"poly", { -1, isl_obj_union_map, isl_obj_union_map,
974 (isc_un_op_fn) &isl_union_map_polyhedral_hull } },
975 {"poly", { -1, isl_obj_union_set, isl_obj_union_set,
976 (isc_un_op_fn) &isl_union_set_polyhedral_hull } },
977 {"poly", { -1, isl_obj_union_pw_qpolynomial,
978 isl_obj_union_pw_qpolynomial,
979 (isc_un_op_fn) &union_pw_qpolynomial_poly } },
980 {"lpoly", { -1, isl_obj_union_pw_qpolynomial,
981 isl_obj_union_pw_qpolynomial,
982 (isc_un_op_fn) &union_pw_qpolynomial_lpoly } },
983 {"upoly", { -1, isl_obj_union_pw_qpolynomial,
984 isl_obj_union_pw_qpolynomial,
985 (isc_un_op_fn) &union_pw_qpolynomial_upoly } },
986 #ifdef HAVE_PET
987 {"parse_file", { -1, isl_obj_str, isl_obj_list,
988 (isc_un_op_fn) &parse } },
989 #endif
990 {"pow", { -1, isl_obj_union_map, isl_obj_list,
991 (isc_un_op_fn) &union_map_power } },
992 {"sample", { -1, isl_obj_union_set, isl_obj_set,
993 (isc_un_op_fn) &union_set_sample } },
994 {"sample", { -1, isl_obj_union_map, isl_obj_map,
995 (isc_un_op_fn) &union_map_sample } },
996 {"scan", { -1, isl_obj_union_set, isl_obj_union_set,
997 (isc_un_op_fn) &union_set_scan } },
998 {"scan", { -1, isl_obj_union_map, isl_obj_union_map,
999 (isc_un_op_fn) &union_map_scan } },
1000 {"sum", { -1, isl_obj_union_pw_qpolynomial,
1001 isl_obj_union_pw_qpolynomial,
1002 (isc_un_op_fn) &isl_union_pw_qpolynomial_sum } },
1003 {"ub", { -1, isl_obj_union_pw_qpolynomial, isl_obj_list,
1004 (isc_un_op_fn) &union_pw_qpolynomial_upper_bound } },
1005 {"unwrap", { -1, isl_obj_union_set, isl_obj_union_map,
1006 (isc_un_op_fn) &isl_union_set_unwrap } },
1007 {"wrap", { -1, isl_obj_union_map, isl_obj_union_set,
1008 (isc_un_op_fn) &isl_union_map_wrap } },
1009 {"zip", { -1, isl_obj_union_map, isl_obj_union_map,
1010 (isc_un_op_fn) &isl_union_map_zip } },
1011 NULL
1012 };
1013
1014 struct isl_named_obj {
1015 char *name;
1016 struct isl_obj obj;
1017 };
1018
1019 static void free_obj(struct isl_obj obj)
1020 {
1021 obj.type->free(obj.v);
1022 }
1023
1024 static int same_name(const void *entry, const void *val)
1025 {
1026 const struct isl_named_obj *named = (const struct isl_named_obj *)entry;
1027
1028 return !strcmp(named->name, val);
1029 }
1030
1031 static int do_assign(struct isl_ctx *ctx, struct isl_hash_table *table,
1032 char *name, struct isl_obj obj)
1033 {
1034 struct isl_hash_table_entry *entry;
1035 uint32_t name_hash;
1036 struct isl_named_obj *named;
1037
1038 name_hash = isl_hash_string(isl_hash_init(), name);
1039 entry = isl_hash_table_find(ctx, table, name_hash, same_name, name, 1);
1040 if (!entry)
1041 goto error;
1042 if (entry->data) {
1043 named = entry->data;
1044 free_obj(named->obj);
1045 free(name);
1046 } else {
1047 named = isl_alloc_type(ctx, struct isl_named_obj);
1048 if (!named)
1049 goto error;
1050 named->name = name;
1051 entry->data = named;
1052 }
1053 named->obj = obj;
1054
1055 return 0;
1056 error:
1057 free_obj(obj);
1058 free(name);
1059 return -1;
1060 }
1061
1062 static struct isl_obj stored_obj(struct isl_ctx *ctx,
1063 struct isl_hash_table *table, char *name)
1064 {
1065 struct isl_obj obj = { isl_obj_none, NULL };
1066 struct isl_hash_table_entry *entry;
1067 uint32_t name_hash;
1068
1069 name_hash = isl_hash_string(isl_hash_init(), name);
1070 entry = isl_hash_table_find(ctx, table, name_hash, same_name, name, 0);
1071 if (entry) {
1072 struct isl_named_obj *named;
1073 named = entry->data;
1074 obj = named->obj;
1075 } else if (isdigit(name[0]))
1076 fprintf(stderr, "unknown identifier '$%s'\n", name);
1077 else
1078 fprintf(stderr, "unknown identifier '%s'\n", name);
1079
1080 free(name);
1081 obj.v = obj.type->copy(obj.v);
1082 return obj;
1083 }
1084
1085 static int is_subtype(struct isl_obj obj, isl_obj_type super)
1086 {
1087 if (obj.type == super)
1088 return 1;
1089 if (obj.type == isl_obj_map && super == isl_obj_union_map)
1090 return 1;
1091 if (obj.type == isl_obj_set && super == isl_obj_union_set)
1092 return 1;
1093 if (obj.type == isl_obj_pw_qpolynomial &&
1094 super == isl_obj_union_pw_qpolynomial)
1095 return 1;
1096 if (obj.type == isl_obj_pw_qpolynomial_fold &&
1097 super == isl_obj_union_pw_qpolynomial_fold)
1098 return 1;
1099 if (obj.type == isl_obj_union_set && isl_union_set_is_empty(obj.v))
1100 return 1;
1101 if (obj.type == isl_obj_list) {
1102 struct isl_list *list = obj.v;
1103 if (list->n == 2 && list->obj[1].type == isl_obj_bool)
1104 return is_subtype(list->obj[0], super);
1105 }
1106 if (super == isl_obj_str)
1107 return 1;
1108 return 0;
1109 }
1110
1111 static struct isl_obj obj_at(struct isl_obj obj, int i)
1112 {
1113 struct isl_list *list = obj.v;
1114
1115 obj = list->obj[i];
1116 obj.v = obj.type->copy(obj.v);
1117
1118 isl_list_free(list);
1119
1120 return obj;
1121 }
1122
1123 static struct isl_obj convert(isl_ctx *ctx, struct isl_obj obj,
1124 isl_obj_type type)
1125 {
1126 if (obj.type == type)
1127 return obj;
1128 if (obj.type == isl_obj_map && type == isl_obj_union_map) {
1129 obj.type = isl_obj_union_map;
1130 obj.v = isl_union_map_from_map(obj.v);
1131 return obj;
1132 }
1133 if (obj.type == isl_obj_set && type == isl_obj_union_set) {
1134 obj.type = isl_obj_union_set;
1135 obj.v = isl_union_set_from_set(obj.v);
1136 return obj;
1137 }
1138 if (obj.type == isl_obj_pw_qpolynomial &&
1139 type == isl_obj_union_pw_qpolynomial) {
1140 obj.type = isl_obj_union_pw_qpolynomial;
1141 obj.v = isl_union_pw_qpolynomial_from_pw_qpolynomial(obj.v);
1142 return obj;
1143 }
1144 if (obj.type == isl_obj_pw_qpolynomial_fold &&
1145 type == isl_obj_union_pw_qpolynomial_fold) {
1146 obj.type = isl_obj_union_pw_qpolynomial_fold;
1147 obj.v = isl_union_pw_qpolynomial_fold_from_pw_qpolynomial_fold(obj.v);
1148 return obj;
1149 }
1150 if (obj.type == isl_obj_union_set && isl_union_set_is_empty(obj.v)) {
1151 if (type == isl_obj_union_map) {
1152 obj.type = isl_obj_union_map;
1153 return obj;
1154 }
1155 if (type == isl_obj_union_pw_qpolynomial) {
1156 isl_space *dim = isl_union_set_get_space(obj.v);
1157 isl_union_set_free(obj.v);
1158 obj.v = isl_union_pw_qpolynomial_zero(dim);
1159 obj.type = isl_obj_union_pw_qpolynomial;
1160 return obj;
1161 }
1162 if (type == isl_obj_union_pw_qpolynomial_fold) {
1163 isl_space *dim = isl_union_set_get_space(obj.v);
1164 isl_union_set_free(obj.v);
1165 obj.v = isl_union_pw_qpolynomial_fold_zero(dim,
1166 isl_fold_list);
1167 obj.type = isl_obj_union_pw_qpolynomial_fold;
1168 return obj;
1169 }
1170 }
1171 if (obj.type == isl_obj_list) {
1172 struct isl_list *list = obj.v;
1173 if (list->n == 2 && list->obj[1].type == isl_obj_bool)
1174 return convert(ctx, obj_at(obj, 0), type);
1175 }
1176 if (type == isl_obj_str) {
1177 isl_str *str;
1178 isl_printer *p;
1179 char *s;
1180
1181 p = isl_printer_to_str(ctx);
1182 if (!p)
1183 goto error;
1184 p = obj.type->print(p, obj.v);
1185 s = isl_printer_get_str(p);
1186 isl_printer_free(p);
1187
1188 str = isl_str_from_string(ctx, s);
1189 if (!str)
1190 goto error;
1191 free_obj(obj);
1192 obj.v = str;
1193 obj.type = isl_obj_str;
1194 return obj;
1195
1196 }
1197 error:
1198 free_obj(obj);
1199 obj.type = isl_obj_none;
1200 obj.v = NULL;
1201 return obj;
1202 }
1203
1204 static struct isc_bin_op *read_bin_op_if_available(struct isl_stream *s,
1205 struct isl_obj lhs)
1206 {
1207 int i;
1208 struct isl_token *tok;
1209
1210 tok = isl_stream_next_token(s);
1211 if (!tok)
1212 return NULL;
1213
1214 for (i = 0; ; ++i) {
1215 if (!bin_ops[i].op)
1216 break;
1217 if (bin_ops[i].op != tok->type)
1218 continue;
1219 if (!is_subtype(lhs, bin_ops[i].lhs))
1220 continue;
1221
1222 isl_token_free(tok);
1223 return &bin_ops[i];
1224 }
1225
1226 for (i = 0; ; ++i) {
1227 if (!named_bin_ops[i].name)
1228 break;
1229 if (named_bin_ops[i].op.op != tok->type)
1230 continue;
1231 if (!is_subtype(lhs, named_bin_ops[i].op.lhs))
1232 continue;
1233
1234 isl_token_free(tok);
1235 return &named_bin_ops[i].op;
1236 }
1237
1238 isl_stream_push_token(s, tok);
1239
1240 return NULL;
1241 }
1242
1243 static struct isc_un_op *read_prefix_un_op_if_available(struct isl_stream *s)
1244 {
1245 int i;
1246 struct isl_token *tok;
1247
1248 tok = isl_stream_next_token(s);
1249 if (!tok)
1250 return NULL;
1251
1252 for (i = 0; ; ++i) {
1253 if (!named_un_ops[i].name)
1254 break;
1255 if (named_un_ops[i].op.op != tok->type)
1256 continue;
1257
1258 isl_token_free(tok);
1259 return &named_un_ops[i].op;
1260 }
1261
1262 isl_stream_push_token(s, tok);
1263
1264 return NULL;
1265 }
1266
1267 static struct isc_un_op *find_matching_un_op(struct isc_un_op *like,
1268 struct isl_obj arg)
1269 {
1270 int i;
1271
1272 for (i = 0; ; ++i) {
1273 if (!named_un_ops[i].name)
1274 break;
1275 if (named_un_ops[i].op.op != like->op)
1276 continue;
1277 if (!is_subtype(arg, named_un_ops[i].op.arg))
1278 continue;
1279
1280 return &named_un_ops[i].op;
1281 }
1282
1283 return NULL;
1284 }
1285
1286 static int is_assign(struct isl_stream *s)
1287 {
1288 struct isl_token *tok;
1289 struct isl_token *tok2;
1290 int assign;
1291
1292 tok = isl_stream_next_token(s);
1293 if (!tok)
1294 return 0;
1295 if (tok->type != ISL_TOKEN_IDENT) {
1296 isl_stream_push_token(s, tok);
1297 return 0;
1298 }
1299
1300 tok2 = isl_stream_next_token(s);
1301 if (!tok2) {
1302 isl_stream_push_token(s, tok);
1303 return 0;
1304 }
1305 assign = tok2->type == ISL_TOKEN_DEF;
1306 isl_stream_push_token(s, tok2);
1307 isl_stream_push_token(s, tok);
1308
1309 return assign;
1310 }
1311
1312 static struct isl_obj read_obj(struct isl_stream *s,
1313 struct isl_hash_table *table);
1314 static struct isl_obj read_expr(struct isl_stream *s,
1315 struct isl_hash_table *table);
1316
1317 static struct isl_obj read_un_op_expr(struct isl_stream *s,
1318 struct isl_hash_table *table, struct isc_un_op *op)
1319 {
1320 struct isl_obj obj = { isl_obj_none, NULL };
1321
1322 obj = read_obj(s, table);
1323 if (!obj.v)
1324 goto error;
1325
1326 op = find_matching_un_op(op, obj);
1327
1328 if (!op)
1329 isl_die(s->ctx, isl_error_invalid,
1330 "no such unary operator defined on given operand",
1331 goto error);
1332
1333 obj = convert(s->ctx, obj, op->arg);
1334 obj.v = op->fn(obj.v);
1335 obj.type = op->res;
1336
1337 return obj;
1338 error:
1339 free_obj(obj);
1340 obj.type = isl_obj_none;
1341 obj.v = NULL;
1342 return obj;
1343 }
1344
1345 static struct isl_obj transitive_closure(struct isl_ctx *ctx, struct isl_obj obj)
1346 {
1347 struct isl_list *list;
1348 int exact;
1349
1350 if (obj.type != isl_obj_union_map)
1351 obj = convert(ctx, obj, isl_obj_union_map);
1352 isl_assert(ctx, obj.type == isl_obj_union_map, goto error);
1353 list = isl_list_alloc(ctx, 2);
1354 if (!list)
1355 goto error;
1356
1357 list->obj[0].type = isl_obj_union_map;
1358 list->obj[0].v = isl_union_map_transitive_closure(obj.v, &exact);
1359 list->obj[1].type = isl_obj_bool;
1360 list->obj[1].v = exact ? &isl_bool_true : &isl_bool_false;
1361 obj.v = list;
1362 obj.type = isl_obj_list;
1363 if (exact < 0 || !list->obj[0].v)
1364 goto error;
1365
1366 return obj;
1367 error:
1368 free_obj(obj);
1369 obj.type = isl_obj_none;
1370 obj.v = NULL;
1371 return obj;
1372 }
1373
1374 static struct isl_obj obj_at_index(struct isl_stream *s, struct isl_obj obj)
1375 {
1376 struct isl_list *list = obj.v;
1377 struct isl_token *tok;
1378 int i;
1379
1380 tok = isl_stream_next_token(s);
1381 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1382 isl_stream_error(s, tok, "expecting index");
1383 if (tok)
1384 isl_stream_push_token(s, tok);
1385 goto error;
1386 }
1387 i = isl_int_get_si(tok->u.v);
1388 isl_token_free(tok);
1389 isl_assert(s->ctx, i < list->n, goto error);
1390 if (isl_stream_eat(s, ']'))
1391 goto error;
1392
1393 return obj_at(obj, i);
1394 error:
1395 free_obj(obj);
1396 obj.type = isl_obj_none;
1397 obj.v = NULL;
1398 return obj;
1399 }
1400
1401 static struct isl_obj apply(struct isl_stream *s, __isl_take isl_union_map *umap,
1402 struct isl_hash_table *table)
1403 {
1404 struct isl_obj obj;
1405
1406 obj = read_expr(s, table);
1407 isl_assert(s->ctx, is_subtype(obj, isl_obj_union_set) ||
1408 is_subtype(obj, isl_obj_union_map), goto error);
1409
1410 if (obj.type == isl_obj_list) {
1411 struct isl_list *list = obj.v;
1412 if (list->n == 2 && list->obj[1].type == isl_obj_bool)
1413 obj = obj_at(obj, 0);
1414 }
1415 if (obj.type == isl_obj_set)
1416 obj = convert(s->ctx, obj, isl_obj_union_set);
1417 else if (obj.type == isl_obj_map)
1418 obj = convert(s->ctx, obj, isl_obj_union_map);
1419 if (obj.type == isl_obj_union_set) {
1420 obj.v = isl_union_set_apply(obj.v, umap);
1421 } else
1422 obj.v = isl_union_map_apply_range(obj.v, umap);
1423 if (!obj.v)
1424 goto error2;
1425
1426 if (isl_stream_eat(s, ')'))
1427 goto error2;
1428
1429 return obj;
1430 error:
1431 isl_union_map_free(umap);
1432 error2:
1433 free_obj(obj);
1434 obj.type = isl_obj_none;
1435 obj.v = NULL;
1436 return obj;
1437 }
1438
1439 static struct isl_obj apply_fun_set(struct isl_obj obj,
1440 __isl_take isl_union_set *uset)
1441 {
1442 if (obj.type == isl_obj_union_pw_qpolynomial) {
1443 obj.v = isl_union_set_apply_union_pw_qpolynomial(uset, obj.v);
1444 } else {
1445 obj.type = isl_obj_list;
1446 obj.v = union_set_apply_union_pw_qpolynomial_fold(uset, obj.v);
1447 }
1448 return obj;
1449 }
1450
1451 static struct isl_obj apply_fun_map(struct isl_obj obj,
1452 __isl_take isl_union_map *umap)
1453 {
1454 if (obj.type == isl_obj_union_pw_qpolynomial) {
1455 obj.v = isl_union_map_apply_union_pw_qpolynomial(umap, obj.v);
1456 } else {
1457 obj.type = isl_obj_list;
1458 obj.v = union_map_apply_union_pw_qpolynomial_fold(umap, obj.v);
1459 }
1460 return obj;
1461 }
1462
1463 static struct isl_obj apply_fun(struct isl_stream *s,
1464 struct isl_obj obj, struct isl_hash_table *table)
1465 {
1466 struct isl_obj arg;
1467
1468 arg = read_expr(s, table);
1469 if (!is_subtype(arg, isl_obj_union_map) &&
1470 !is_subtype(arg, isl_obj_union_set))
1471 isl_die(s->ctx, isl_error_invalid,
1472 "expecting set of map argument", goto error);
1473
1474 if (arg.type == isl_obj_list) {
1475 struct isl_list *list = arg.v;
1476 if (list->n == 2 && list->obj[1].type == isl_obj_bool)
1477 arg = obj_at(arg, 0);
1478 }
1479 if (arg.type == isl_obj_set)
1480 arg = convert(s->ctx, arg, isl_obj_union_set);
1481 else if (arg.type == isl_obj_map)
1482 arg = convert(s->ctx, arg, isl_obj_union_map);
1483 if (arg.type == isl_obj_union_set)
1484 obj = apply_fun_set(obj, arg.v);
1485 else
1486 obj = apply_fun_map(obj, arg.v);
1487 if (!obj.v)
1488 goto error2;
1489
1490 if (isl_stream_eat(s, ')'))
1491 goto error2;
1492
1493 return obj;
1494 error:
1495 free_obj(arg);
1496 error2:
1497 free_obj(obj);
1498 obj.type = isl_obj_none;
1499 obj.v = NULL;
1500 return obj;
1501 }
1502
1503 struct add_vertex_data {
1504 struct isl_list *list;
1505 int i;
1506 };
1507
1508 static int add_vertex(__isl_take isl_vertex *vertex, void *user)
1509 {
1510 struct add_vertex_data *data = (struct add_vertex_data *)user;
1511 isl_basic_set *expr;
1512
1513 expr = isl_vertex_get_expr(vertex);
1514
1515 data->list->obj[data->i].type = isl_obj_set;
1516 data->list->obj[data->i].v = isl_set_from_basic_set(expr);
1517 data->i++;
1518
1519 isl_vertex_free(vertex);
1520
1521 return 0;
1522 }
1523
1524 static int set_vertices(__isl_take isl_set *set, void *user)
1525 {
1526 isl_ctx *ctx;
1527 isl_basic_set *hull;
1528 isl_vertices *vertices = NULL;
1529 struct isl_list *list = NULL;
1530 int r;
1531 struct add_vertex_data *data = (struct add_vertex_data *)user;
1532
1533 set = isl_set_remove_divs(set);
1534 hull = isl_set_convex_hull(set);
1535 vertices = isl_basic_set_compute_vertices(hull);
1536 isl_basic_set_free(hull);
1537
1538 list = data->list;
1539
1540 ctx = isl_vertices_get_ctx(vertices);
1541 data->list = isl_list_alloc(ctx, isl_vertices_get_n_vertices(vertices));
1542 if (!data->list)
1543 goto error;
1544
1545 data->i = 0;
1546 r = isl_vertices_foreach_vertex(vertices, &add_vertex, user);
1547
1548 data->list = isl_list_concat(list, data->list);
1549
1550 isl_vertices_free(vertices);
1551
1552 return r;
1553 error:
1554 data->list = list;
1555 isl_vertices_free(vertices);
1556 return -1;
1557 }
1558
1559 static struct isl_obj vertices(struct isl_stream *s,
1560 struct isl_hash_table *table)
1561 {
1562 isl_ctx *ctx;
1563 struct isl_obj obj;
1564 struct isl_list *list = NULL;
1565 isl_union_set *uset;
1566 struct add_vertex_data data = { NULL };
1567
1568 obj = read_expr(s, table);
1569 obj = convert(s->ctx, obj, isl_obj_union_set);
1570 isl_assert(s->ctx, obj.type == isl_obj_union_set, goto error);
1571 uset = obj.v;
1572 obj.v = NULL;
1573
1574 ctx = isl_union_set_get_ctx(uset);
1575 list = isl_list_alloc(ctx, 0);
1576 if (!list)
1577 goto error;
1578
1579 data.list = list;
1580
1581 if (isl_union_set_foreach_set(uset, &set_vertices, &data) < 0)
1582 goto error;
1583
1584 isl_union_set_free(uset);
1585
1586 obj.type = isl_obj_list;
1587 obj.v = data.list;
1588
1589 return obj;
1590 error:
1591 isl_union_set_free(uset);
1592 isl_list_free(data.list);
1593 free_obj(obj);
1594 obj.type = isl_obj_none;
1595 obj.v = NULL;
1596 return obj;
1597 }
1598
1599 static struct isl_obj type_of(struct isl_stream *s,
1600 struct isl_hash_table *table)
1601 {
1602 isl_ctx *ctx;
1603 struct isl_obj obj;
1604 const char *type = "unknown";
1605
1606 obj = read_expr(s, table);
1607
1608 if (obj.type == isl_obj_map ||
1609 obj.type == isl_obj_union_map)
1610 type = "map";
1611 if (obj.type == isl_obj_set ||
1612 obj.type == isl_obj_union_set)
1613 type = "set";
1614 if (obj.type == isl_obj_pw_qpolynomial ||
1615 obj.type == isl_obj_union_pw_qpolynomial)
1616 type = "piecewise quasipolynomial";
1617 if (obj.type == isl_obj_pw_qpolynomial_fold ||
1618 obj.type == isl_obj_union_pw_qpolynomial_fold)
1619 type = "piecewise quasipolynomial fold";
1620 if (obj.type == isl_obj_list)
1621 type = "list";
1622 if (obj.type == isl_obj_bool)
1623 type = "boolean";
1624 if (obj.type == isl_obj_str)
1625 type = "string";
1626 if (obj.type == isl_obj_int)
1627 type = "int";
1628
1629 free_obj(obj);
1630 obj.type = isl_obj_str;
1631 obj.v = isl_str_from_string(s->ctx, strdup(type));
1632
1633 return obj;
1634 }
1635
1636 static __isl_give isl_union_set *read_set(struct isl_stream *s,
1637 struct isl_hash_table *table)
1638 {
1639 struct isl_obj obj;
1640
1641 obj = read_obj(s, table);
1642 obj = convert(s->ctx, obj, isl_obj_union_set);
1643 isl_assert(s->ctx, obj.type == isl_obj_union_set, goto error);
1644 return obj.v;
1645 error:
1646 free_obj(obj);
1647 return NULL;
1648 }
1649
1650 static __isl_give isl_union_map *read_map(struct isl_stream *s,
1651 struct isl_hash_table *table)
1652 {
1653 struct isl_obj obj;
1654
1655 obj = read_obj(s, table);
1656 obj = convert(s->ctx, obj, isl_obj_union_map);
1657 isl_assert(s->ctx, obj.type == isl_obj_union_map, goto error);
1658 return obj.v;
1659 error:
1660 free_obj(obj);
1661 return NULL;
1662 }
1663
1664 static struct isl_obj last_any(struct isl_stream *s,
1665 struct isl_hash_table *table, __isl_take isl_union_map *must_source,
1666 __isl_take isl_union_map *may_source)
1667 {
1668 struct isl_obj obj = { isl_obj_none, NULL };
1669 isl_union_map *sink = NULL;
1670 isl_union_map *schedule = NULL;
1671 isl_union_map *may_dep;
1672 isl_union_map *must_dep;
1673
1674 if (isl_stream_eat(s, iscc_op[ISCC_BEFORE]))
1675 goto error;
1676
1677 sink = read_map(s, table);
1678 if (!sink)
1679 goto error;
1680
1681 if (isl_stream_eat(s, iscc_op[ISCC_UNDER]))
1682 goto error;
1683
1684 schedule = read_map(s, table);
1685 if (!schedule)
1686 goto error;
1687
1688 if (isl_union_map_compute_flow(sink, must_source, may_source,
1689 schedule, &must_dep, &may_dep,
1690 NULL, NULL) < 0)
1691 return obj;
1692
1693 obj.type = isl_obj_union_map;
1694 obj.v = isl_union_map_union(must_dep, may_dep);
1695
1696 return obj;
1697 error:
1698 isl_union_map_free(may_source);
1699 isl_union_map_free(must_source);
1700 isl_union_map_free(sink);
1701 isl_union_map_free(schedule);
1702 free_obj(obj);
1703 obj.type = isl_obj_none;
1704 obj.v = NULL;
1705 return obj;
1706 }
1707
1708 static struct isl_obj any(struct isl_stream *s, struct isl_hash_table *table)
1709 {
1710 struct isl_obj obj = { isl_obj_none, NULL };
1711 isl_union_map *must_source = NULL;
1712 isl_union_map *may_source = NULL;
1713 isl_union_map *sink = NULL;
1714 isl_union_map *schedule = NULL;
1715 isl_union_map *may_dep;
1716
1717 may_source = read_map(s, table);
1718 if (!may_source)
1719 goto error;
1720
1721 if (isl_stream_eat_if_available(s, iscc_op[ISCC_LAST])) {
1722 must_source = read_map(s, table);
1723 if (!must_source)
1724 goto error;
1725 return last_any(s, table, must_source, may_source);
1726 }
1727
1728 if (isl_stream_eat(s, iscc_op[ISCC_BEFORE]))
1729 goto error;
1730
1731 sink = read_map(s, table);
1732 if (!sink)
1733 goto error;
1734
1735 if (isl_stream_eat(s, iscc_op[ISCC_UNDER]))
1736 goto error;
1737
1738 schedule = read_map(s, table);
1739 if (!schedule)
1740 goto error;
1741
1742 must_source = isl_union_map_empty(isl_union_map_get_space(sink));
1743 if (isl_union_map_compute_flow(sink, must_source, may_source,
1744 schedule, NULL, &may_dep,
1745 NULL, NULL) < 0)
1746 return obj;
1747
1748 obj.type = isl_obj_union_map;
1749 obj.v = may_dep;
1750
1751 return obj;
1752 error:
1753 isl_union_map_free(may_source);
1754 isl_union_map_free(must_source);
1755 isl_union_map_free(sink);
1756 isl_union_map_free(schedule);
1757 free_obj(obj);
1758 obj.type = isl_obj_none;
1759 obj.v = NULL;
1760 return obj;
1761 }
1762
1763 static struct isl_obj last(struct isl_stream *s, struct isl_hash_table *table)
1764 {
1765 struct isl_obj obj = { isl_obj_none, NULL };
1766 struct isl_list *list = NULL;
1767 isl_union_map *must_source = NULL;
1768 isl_union_map *may_source = NULL;
1769 isl_union_map *sink = NULL;
1770 isl_union_map *schedule = NULL;
1771 isl_union_map *must_dep;
1772 isl_union_map *must_no_source;
1773
1774 must_source = read_map(s, table);
1775 if (!must_source)
1776 goto error;
1777
1778 if (isl_stream_eat_if_available(s, iscc_op[ISCC_ANY])) {
1779 may_source = read_map(s, table);
1780 if (!may_source)
1781 goto error;
1782 return last_any(s, table, must_source, may_source);
1783 }
1784
1785 list = isl_list_alloc(s->ctx, 2);
1786 if (!list)
1787 goto error;
1788
1789 if (isl_stream_eat(s, iscc_op[ISCC_BEFORE]))
1790 goto error;
1791
1792 sink = read_map(s, table);
1793 if (!sink)
1794 goto error;
1795
1796 if (isl_stream_eat(s, iscc_op[ISCC_UNDER]))
1797 goto error;
1798
1799 schedule = read_map(s, table);
1800 if (!schedule)
1801 goto error;
1802
1803 may_source = isl_union_map_empty(isl_union_map_get_space(sink));
1804 if (isl_union_map_compute_flow(sink, must_source, may_source,
1805 schedule, &must_dep, NULL,
1806 &must_no_source, NULL) < 0) {
1807 isl_list_free(list);
1808 return obj;
1809 }
1810
1811 list->obj[0].type = isl_obj_union_map;
1812 list->obj[0].v = must_dep;
1813 list->obj[1].type = isl_obj_union_map;
1814 list->obj[1].v = must_no_source;
1815
1816 obj.v = list;
1817 obj.type = isl_obj_list;
1818
1819 return obj;
1820 error:
1821 isl_list_free(list);
1822 isl_union_map_free(may_source);
1823 isl_union_map_free(must_source);
1824 isl_union_map_free(sink);
1825 isl_union_map_free(schedule);
1826 free_obj(obj);
1827 obj.type = isl_obj_none;
1828 obj.v = NULL;
1829 return obj;
1830 }
1831
1832 static __isl_give isl_schedule *get_schedule(struct isl_stream *s,
1833 struct isl_hash_table *table)
1834 {
1835 isl_union_set *domain;
1836 isl_union_map *validity;
1837 isl_union_map *proximity;
1838
1839 domain = read_set(s, table);
1840 if (!domain)
1841 return NULL;
1842
1843 validity = isl_union_map_empty(isl_union_set_get_space(domain));
1844 proximity = isl_union_map_empty(isl_union_set_get_space(domain));
1845
1846 for (;;) {
1847 isl_union_map *umap;
1848 if (isl_stream_eat_if_available(s, iscc_op[ISCC_RESPECTING])) {
1849 umap = read_map(s, table);
1850 validity = isl_union_map_union(validity, umap);
1851 } else if (isl_stream_eat_if_available(s, iscc_op[ISCC_MINIMIZING])) {
1852 umap = read_map(s, table);
1853 proximity = isl_union_map_union(proximity, umap);
1854 } else
1855 break;
1856 }
1857
1858 return isl_union_set_compute_schedule(domain, validity, proximity);
1859 }
1860
1861 static struct isl_obj schedule(struct isl_stream *s,
1862 struct isl_hash_table *table)
1863 {
1864 struct isl_obj obj = { isl_obj_none, NULL };
1865 isl_schedule *schedule;
1866
1867 schedule = get_schedule(s, table);
1868
1869 obj.v = isl_schedule_get_map(schedule);
1870 obj.type = isl_obj_union_map;
1871
1872 isl_schedule_free(schedule);
1873
1874 return obj;
1875 }
1876
1877 static struct isl_obj band_list_to_obj_list(__isl_take isl_band_list *bands);
1878
1879 static struct isl_obj band_to_obj_list(__isl_take isl_band *band)
1880 {
1881 struct isl_obj obj = { isl_obj_none, NULL };
1882 isl_ctx *ctx = isl_band_get_ctx(band);
1883 struct isl_list *list;
1884
1885 list = isl_list_alloc(ctx, 2);
1886 if (!list)
1887 goto error;
1888
1889 obj.v = list;
1890 obj.type = isl_obj_list;
1891
1892 list->obj[0].type = isl_obj_union_map;
1893 list->obj[0].v = isl_band_get_partial_schedule(band);
1894
1895 if (isl_band_has_children(band)) {
1896 isl_band_list *children;
1897
1898 children = isl_band_get_children(band);
1899 list->obj[1] = band_list_to_obj_list(children);
1900 } else {
1901 list->obj[1].type = isl_obj_list;
1902 list->obj[1].v = isl_list_alloc(ctx, 0);
1903 }
1904
1905 if (!list->obj[0].v || !list->obj[1].v)
1906 goto error;
1907
1908 isl_band_free(band);
1909
1910 return obj;
1911 error:
1912 isl_band_free(band);
1913 free_obj(obj);
1914 obj.type = isl_obj_none;
1915 obj.v = NULL;
1916 return obj;
1917 }
1918
1919 static struct isl_obj band_list_to_obj_list(__isl_take isl_band_list *bands)
1920 {
1921 struct isl_obj obj = { isl_obj_none, NULL };
1922 isl_ctx *ctx = isl_band_list_get_ctx(bands);
1923 struct isl_list *list;
1924 int i, n;
1925
1926 n = isl_band_list_n_band(bands);
1927 list = isl_list_alloc(ctx, n);
1928 if (!list)
1929 goto error;
1930
1931 obj.v = list;
1932 obj.type = isl_obj_list;
1933
1934 for (i = 0; i < n; ++i) {
1935 isl_band *band;
1936
1937 band = isl_band_list_get_band(bands, i);
1938 list->obj[i] = band_to_obj_list(band);
1939 if (!list->obj[i].v)
1940 goto error;
1941 }
1942
1943 isl_band_list_free(bands);
1944
1945 return obj;
1946 error:
1947 isl_band_list_free(bands);
1948 free_obj(obj);
1949 obj.type = isl_obj_none;
1950 obj.v = NULL;
1951 return obj;
1952 }
1953
1954 static struct isl_obj schedule_forest(struct isl_stream *s,
1955 struct isl_hash_table *table)
1956 {
1957 struct isl_obj obj = { isl_obj_none, NULL };
1958 isl_schedule *schedule;
1959 isl_band_list *roots;
1960
1961 schedule = get_schedule(s, table);
1962 if (!schedule)
1963 return obj;
1964
1965 roots = isl_schedule_get_band_forest(schedule);
1966 isl_schedule_free(schedule);
1967
1968 return band_list_to_obj_list(roots);
1969 }
1970
1971 static struct isl_obj power(struct isl_stream *s, struct isl_obj obj)
1972 {
1973 struct isl_token *tok;
1974
1975 if (isl_stream_eat_if_available(s, '+'))
1976 return transitive_closure(s->ctx, obj);
1977
1978 tok = isl_stream_next_token(s);
1979 if (!tok || tok->type != ISL_TOKEN_VALUE || isl_int_cmp_si(tok->u.v, -1)) {
1980 isl_stream_error(s, tok, "expecting -1");
1981 if (tok)
1982 isl_stream_push_token(s, tok);
1983 goto error;
1984 }
1985 isl_token_free(tok);
1986 isl_assert(s->ctx, is_subtype(obj, isl_obj_union_map), goto error);
1987 if (obj.type != isl_obj_union_map)
1988 obj = convert(s->ctx, obj, isl_obj_union_map);
1989
1990 obj.v = isl_union_map_reverse(obj.v);
1991 if (!obj.v)
1992 goto error;
1993
1994 return obj;
1995 error:
1996 free_obj(obj);
1997 obj.type = isl_obj_none;
1998 obj.v = NULL;
1999 return obj;
2000 }
2001
2002 static struct isl_obj read_from_file(struct isl_stream *s)
2003 {
2004 struct isl_obj obj;
2005 struct isl_token *tok;
2006 struct isl_stream *s_file;
2007 struct iscc_options *options;
2008 FILE *file;
2009
2010 tok = isl_stream_next_token(s);
2011 if (!tok || tok->type != ISL_TOKEN_STRING) {
2012 isl_stream_error(s, tok, "expecting filename");
2013 isl_token_free(tok);
2014 goto error;
2015 }
2016
2017 options = isl_ctx_peek_iscc_options(s->ctx);
2018 if (!options || !options->io) {
2019 isl_token_free(tok);
2020 isl_die(s->ctx, isl_error_invalid,
2021 "read operation not allowed", goto error);
2022 }
2023
2024 file = fopen(tok->u.s, "r");
2025 isl_token_free(tok);
2026 isl_assert(s->ctx, file, goto error);
2027
2028 s_file = isl_stream_new_file(s->ctx, file);
2029 if (!s_file) {
2030 fclose(file);
2031 goto error;
2032 }
2033
2034 obj = isl_stream_read_obj(s_file);
2035
2036 isl_stream_free(s_file);
2037 fclose(file);
2038
2039 return obj;
2040 error:
2041 obj.type = isl_obj_none;
2042 obj.v = NULL;
2043 return obj;
2044 }
2045
2046 static struct isl_obj write_to_file(struct isl_stream *s,
2047 struct isl_hash_table *table)
2048 {
2049 struct isl_obj obj;
2050 struct isl_token *tok;
2051 struct isl_stream *s_file;
2052 struct iscc_options *options;
2053 FILE *file;
2054 isl_printer *p;
2055
2056 tok = isl_stream_next_token(s);
2057 if (!tok || tok->type != ISL_TOKEN_STRING) {
2058 isl_stream_error(s, tok, "expecting filename");
2059 isl_token_free(tok);
2060 goto error;
2061 }
2062
2063 obj = read_expr(s, table);
2064
2065 options = isl_ctx_peek_iscc_options(s->ctx);
2066 if (!options || !options->io) {
2067 isl_token_free(tok);
2068 isl_die(s->ctx, isl_error_invalid,
2069 "write operation not allowed", goto error);
2070 }
2071
2072 file = fopen(tok->u.s, "w");
2073 isl_token_free(tok);
2074 if (!file)
2075 isl_die(s->ctx, isl_error_unknown,
2076 "could not open file for writing", goto error);
2077
2078 p = isl_printer_to_file(s->ctx, file);
2079 p = isl_printer_set_output_format(p, options->format);
2080 p = obj.type->print(p, obj.v);
2081 p = isl_printer_end_line(p);
2082 isl_printer_free(p);
2083
2084 fclose(file);
2085 error:
2086 free_obj(obj);
2087 obj.type = isl_obj_none;
2088 obj.v = NULL;
2089 return obj;
2090 }
2091
2092 static struct isl_obj read_string_if_available(struct isl_stream *s)
2093 {
2094 struct isl_token *tok;
2095 struct isl_obj obj = { isl_obj_none, NULL };
2096
2097 tok = isl_stream_next_token(s);
2098 if (!tok)
2099 return obj;
2100 if (tok->type == ISL_TOKEN_STRING) {
2101 isl_str *str;
2102 str = isl_str_alloc(s->ctx);
2103 if (!str)
2104 goto error;
2105 str->s = strdup(tok->u.s);
2106 isl_token_free(tok);
2107 obj.v = str;
2108 obj.type = isl_obj_str;
2109 } else
2110 isl_stream_push_token(s, tok);
2111 return obj;
2112 error:
2113 isl_token_free(tok);
2114 return obj;
2115 }
2116
2117 static struct isl_obj read_bool_if_available(struct isl_stream *s)
2118 {
2119 struct isl_token *tok;
2120 struct isl_obj obj = { isl_obj_none, NULL };
2121
2122 tok = isl_stream_next_token(s);
2123 if (!tok)
2124 return obj;
2125 if (tok->type == ISL_TOKEN_FALSE || tok->type == ISL_TOKEN_TRUE) {
2126 int is_true = tok->type == ISL_TOKEN_TRUE;
2127 isl_token_free(tok);
2128 obj.v = is_true ? &isl_bool_true : &isl_bool_false;
2129 obj.type = isl_obj_bool;
2130 } else
2131 isl_stream_push_token(s, tok);
2132 return obj;
2133 error:
2134 isl_token_free(tok);
2135 return obj;
2136 }
2137
2138 static __isl_give char *read_ident(struct isl_stream *s)
2139 {
2140 char *name;
2141 struct isl_token *tok, *tok2;
2142
2143 name = isl_stream_read_ident_if_available(s);
2144 if (name)
2145 return name;
2146
2147 tok = isl_stream_next_token(s);
2148 if (!tok)
2149 return NULL;
2150 if (tok->type != '$') {
2151 isl_stream_push_token(s, tok);
2152 return NULL;
2153 }
2154 tok2 = isl_stream_next_token(s);
2155 if (!tok2 || tok2->type != ISL_TOKEN_VALUE) {
2156 if (tok2)
2157 isl_stream_push_token(s, tok2);
2158 isl_stream_push_token(s, tok);
2159 return NULL;
2160 }
2161
2162 name = isl_int_get_str(tok2->u.v);
2163 isl_token_free(tok);
2164 isl_token_free(tok2);
2165
2166 return name;
2167 }
2168
2169 static struct isl_obj read_list(struct isl_stream *s,
2170 struct isl_hash_table *table, struct isl_obj obj)
2171 {
2172 struct isl_list *list;
2173
2174 list = isl_list_alloc(s->ctx, 2);
2175 if (!list)
2176 goto error;
2177 list->obj[0] = obj;
2178 list->obj[1] = read_obj(s, table);
2179 obj.v = list;
2180 obj.type = isl_obj_list;
2181
2182 if (!list->obj[1].v)
2183 goto error;
2184
2185 while (isl_stream_eat_if_available(s, ',')) {
2186 obj.v = list = isl_list_add_obj(list, read_obj(s, table));
2187 if (!obj.v)
2188 goto error;
2189 }
2190
2191 return obj;
2192 error:
2193 free_obj(obj);
2194 obj.type = isl_obj_none;
2195 obj.v = NULL;
2196 return obj;
2197 }
2198
2199 static struct isl_obj read_obj(struct isl_stream *s,
2200 struct isl_hash_table *table)
2201 {
2202 struct isl_obj obj = { isl_obj_none, NULL };
2203 char *name = NULL;
2204 struct isc_un_op *op = NULL;
2205
2206 obj = read_string_if_available(s);
2207 if (obj.v)
2208 return obj;
2209 obj = read_bool_if_available(s);
2210 if (obj.v)
2211 return obj;
2212 if (isl_stream_eat_if_available(s, '(')) {
2213 if (isl_stream_next_token_is(s, ')')) {
2214 obj.type = isl_obj_list;
2215 obj.v = isl_list_alloc(s->ctx, 0);
2216 } else {
2217 obj = read_expr(s, table);
2218 if (obj.v && isl_stream_eat_if_available(s, ','))
2219 obj = read_list(s, table, obj);
2220 }
2221 if (!obj.v || isl_stream_eat(s, ')'))
2222 goto error;
2223 } else {
2224 op = read_prefix_un_op_if_available(s);
2225 if (op)
2226 return read_un_op_expr(s, table, op);
2227
2228 if (isl_stream_eat_if_available(s, iscc_op[ISCC_READ]))
2229 return read_from_file(s);
2230 if (isl_stream_eat_if_available(s, iscc_op[ISCC_WRITE]))
2231 return write_to_file(s, table);
2232 if (isl_stream_eat_if_available(s, iscc_op[ISCC_VERTICES]))
2233 return vertices(s, table);
2234 if (isl_stream_eat_if_available(s, iscc_op[ISCC_ANY]))
2235 return any(s, table);
2236 if (isl_stream_eat_if_available(s, iscc_op[ISCC_LAST]))
2237 return last(s, table);
2238 if (isl_stream_eat_if_available(s, iscc_op[ISCC_SCHEDULE]))
2239 return schedule(s, table);
2240 if (isl_stream_eat_if_available(s, iscc_op[ISCC_SCHEDULE_FOREST]))
2241 return schedule_forest(s, table);
2242 if (isl_stream_eat_if_available(s, iscc_op[ISCC_TYPEOF]))
2243 return type_of(s, table);
2244
2245 name = read_ident(s);
2246 if (name)
2247 obj = stored_obj(s->ctx, table, name);
2248 else
2249 obj = isl_stream_read_obj(s);
2250 if (!obj.v)
2251 goto error;
2252 }
2253
2254 if (isl_stream_eat_if_available(s, '^'))
2255 obj = power(s, obj);
2256 else if (obj.type == isl_obj_list && isl_stream_eat_if_available(s, '['))
2257 obj = obj_at_index(s, obj);
2258 else if (is_subtype(obj, isl_obj_union_map) &&
2259 isl_stream_eat_if_available(s, '(')) {
2260 obj = convert(s->ctx, obj, isl_obj_union_map);
2261 obj = apply(s, obj.v, table);
2262 } else if (is_subtype(obj, isl_obj_union_pw_qpolynomial) &&
2263 isl_stream_eat_if_available(s, '(')) {
2264 obj = convert(s->ctx, obj, isl_obj_union_pw_qpolynomial);
2265 obj = apply_fun(s, obj, table);
2266 } else if (is_subtype(obj, isl_obj_union_pw_qpolynomial_fold) &&
2267 isl_stream_eat_if_available(s, '(')) {
2268 obj = convert(s->ctx, obj, isl_obj_union_pw_qpolynomial_fold);
2269 obj = apply_fun(s, obj, table);
2270 }
2271
2272 return obj;
2273 error:
2274 free_obj(obj);
2275 obj.type = isl_obj_none;
2276 obj.v = NULL;
2277 return obj;
2278 }
2279
2280 static struct isc_bin_op *find_matching_bin_op(struct isc_bin_op *like,
2281 struct isl_obj lhs, struct isl_obj rhs)
2282 {
2283 int i;
2284
2285 for (i = 0; ; ++i) {
2286 if (!bin_ops[i].op)
2287 break;
2288 if (bin_ops[i].op != like->op)
2289 continue;
2290 if (!is_subtype(lhs, bin_ops[i].lhs))
2291 continue;
2292 if (!is_subtype(rhs, bin_ops[i].rhs))
2293 continue;
2294
2295 return &bin_ops[i];
2296 }
2297
2298 for (i = 0; ; ++i) {
2299 if (!named_bin_ops[i].name)
2300 break;
2301 if (named_bin_ops[i].op.op != like->op)
2302 continue;
2303 if (!is_subtype(lhs, named_bin_ops[i].op.lhs))
2304 continue;
2305 if (!is_subtype(rhs, named_bin_ops[i].op.rhs))
2306 continue;
2307
2308 return &named_bin_ops[i].op;
2309 }
2310
2311 return NULL;
2312 }
2313
2314 static int next_is_neg_int(struct isl_stream *s)
2315 {
2316 struct isl_token *tok;
2317 int ret;
2318
2319 tok = isl_stream_next_token(s);
2320 ret = tok && tok->type == ISL_TOKEN_VALUE && isl_int_is_neg(tok->u.v);
2321 isl_stream_push_token(s, tok);
2322
2323 return ret;
2324 }
2325
2326 static struct isl_obj read_expr(struct isl_stream *s,
2327 struct isl_hash_table *table)
2328 {
2329 struct isl_obj obj = { isl_obj_none, NULL };
2330 struct isl_obj right_obj = { isl_obj_none, NULL };
2331
2332 obj = read_obj(s, table);
2333 for (; obj.v;) {
2334 struct isc_bin_op *op = NULL;
2335
2336 op = read_bin_op_if_available(s, obj);
2337 if (!op)
2338 break;
2339
2340 right_obj = read_obj(s, table);
2341
2342 op = find_matching_bin_op(op, obj, right_obj);
2343
2344 if (!op)
2345 isl_die(s->ctx, isl_error_invalid,
2346 "no such binary operator defined on given operands",
2347 goto error);
2348
2349 obj = convert(s->ctx, obj, op->lhs);
2350 right_obj = convert(s->ctx, right_obj, op->rhs);
2351 obj.v = op->fn(obj.v, right_obj.v);
2352 obj.type = op->res;
2353 }
2354
2355 if (obj.type == isl_obj_int && next_is_neg_int(s)) {
2356 right_obj = read_obj(s, table);
2357 obj.v = isl_int_obj_add(obj.v, right_obj.v);
2358 }
2359
2360 return obj;
2361 error:
2362 free_obj(right_obj);
2363 free_obj(obj);
2364 obj.type = isl_obj_none;
2365 obj.v = NULL;
2366 return obj;
2367 }
2368
2369 static __isl_give isl_printer *source_file(struct isl_stream *s,
2370 struct isl_hash_table *table, __isl_take isl_printer *p);
2371
2372 static __isl_give isl_printer *read_line(struct isl_stream *s,
2373 struct isl_hash_table *table, __isl_take isl_printer *p, int tty)
2374 {
2375 struct isl_obj obj = { isl_obj_none, NULL };
2376 char *lhs = NULL;
2377 int assign = 0;
2378 int only_print = 0;
2379 struct isc_bin_op *op = NULL;
2380 char buf[30];
2381
2382 if (!p)
2383 return NULL;
2384 if (isl_stream_is_empty(s))
2385 return p;
2386
2387 if (isl_stream_eat_if_available(s, iscc_op[ISCC_SOURCE]))
2388 return source_file(s, table, p);
2389
2390 assign = is_assign(s);
2391 if (assign) {
2392 lhs = isl_stream_read_ident_if_available(s);
2393 if (isl_stream_eat(s, ISL_TOKEN_DEF))
2394 goto error;
2395 } else if (isl_stream_eat_if_available(s, iscc_op[ISCC_PRINT]))
2396 only_print = 1;
2397 else if (!tty)
2398 only_print = 1;
2399
2400 obj = read_expr(s, table);
2401 if (isl_ctx_last_error(s->ctx) == isl_error_abort) {
2402 fprintf(stderr, "Interrupted\n");
2403 isl_ctx_reset_error(s->ctx);
2404 }
2405 if (isl_stream_eat(s, ';'))
2406 goto error;
2407
2408 if (only_print) {
2409 if (obj.type != isl_obj_none && obj.v != NULL)
2410 p = obj.type->print(p, obj.v);
2411 p = isl_printer_end_line(p);
2412 free_obj(obj);
2413 return p;
2414 }
2415 if (!assign && obj.type != isl_obj_none && obj.v != NULL) {
2416 static int count = 0;
2417 snprintf(buf, sizeof(buf), "$%d", count++);
2418 lhs = strdup(buf + 1);
2419
2420 p = isl_printer_print_str(p, buf);
2421 p = isl_printer_print_str(p, " := ");
2422 p = obj.type->print(p, obj.v);
2423 p = isl_printer_end_line(p);
2424 }
2425 if (lhs && do_assign(s->ctx, table, lhs, obj))
2426 return p;
2427
2428 return p;
2429 error:
2430 isl_stream_flush_tokens(s);
2431 isl_stream_skip_line(s);
2432 free(lhs);
2433 free_obj(obj);
2434 return p;
2435 }
2436
2437 int free_cb(void **entry, void *user)
2438 {
2439 struct isl_named_obj *named = *entry;
2440
2441 free_obj(named->obj);
2442 free(named->name);
2443 free(named);
2444
2445 return 0;
2446 }
2447
2448 static void register_named_ops(struct isl_stream *s)
2449 {
2450 int i;
2451
2452 for (i = 0; i < ISCC_N_OP; ++i) {
2453 iscc_op[i] = isl_stream_register_keyword(s, op_name[i]);
2454 assert(iscc_op[i] != ISL_TOKEN_ERROR);
2455 }
2456
2457 for (i = 0; ; ++i) {
2458 if (!named_un_ops[i].name)
2459 break;
2460 named_un_ops[i].op.op = isl_stream_register_keyword(s,
2461 named_un_ops[i].name);
2462 assert(named_un_ops[i].op.op != ISL_TOKEN_ERROR);
2463 }
2464
2465 for (i = 0; ; ++i) {
2466 if (!named_bin_ops[i].name)
2467 break;
2468 named_bin_ops[i].op.op = isl_stream_register_keyword(s,
2469 named_bin_ops[i].name);
2470 assert(named_bin_ops[i].op.op != ISL_TOKEN_ERROR);
2471 }
2472 }
2473
2474 static __isl_give isl_printer *source_file(struct isl_stream *s,
2475 struct isl_hash_table *table, __isl_take isl_printer *p)
2476 {
2477 struct isl_token *tok;
2478 struct isl_stream *s_file;
2479 FILE *file;
2480
2481 tok = isl_stream_next_token(s);
2482 if (!tok || tok->type != ISL_TOKEN_STRING) {
2483 isl_stream_error(s, tok, "expecting filename");
2484 isl_token_free(tok);
2485 return p;
2486 }
2487
2488 file = fopen(tok->u.s, "r");
2489 isl_token_free(tok);
2490 isl_assert(s->ctx, file, return p);
2491
2492 s_file = isl_stream_new_file(s->ctx, file);
2493 if (!s_file) {
2494 fclose(file);
2495 return p;
2496 }
2497
2498 register_named_ops(s_file);
2499
2500 while (!s_file->eof)
2501 p = read_line(s_file, table, p, 0);
2502
2503 isl_stream_free(s_file);
2504 fclose(file);
2505
2506 isl_stream_eat(s, ';');
2507
2508 return p;
2509 }
2510
2511 int main(int argc, char **argv)
2512 {
2513 struct isl_ctx *ctx;
2514 struct isl_stream *s;
2515 struct isl_hash_table *table;
2516 struct iscc_options *options;
2517 isl_printer *p;
2518 int tty = isatty(0);
2519
2520 options = iscc_options_new_with_defaults();
2521 assert(options);
2522 argc = iscc_options_parse(options, argc, argv, ISL_ARG_ALL);
2523
2524 ctx = isl_ctx_alloc_with_options(iscc_options_arg, options);
2525 s = isl_stream_new_file(ctx, stdin);
2526 assert(s);
2527 table = isl_hash_table_alloc(ctx, 10);
2528 assert(table);
2529 p = isl_printer_to_file(ctx, stdout);
2530 p = isl_printer_set_output_format(p, options->format);
2531 assert(p);
2532
2533 register_named_ops(s);
2534
2535 install_signal_handler(ctx);
2536
2537 while (p && !s->eof) {
2538 isl_ctx_resume(ctx);
2539 p = read_line(s, table, p, tty);
2540 }
2541
2542 remove_signal_handler(ctx);
2543
2544 isl_printer_free(p);
2545 isl_hash_table_foreach(ctx, table, free_cb, NULL);
2546 isl_hash_table_free(ctx, table);
2547 isl_stream_free(s);
2548 isl_ctx_free(ctx);
2549
2550 return 0;
2551 }
lattice point enumeration library