?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
export isl_stream_read_val
[isl.git] / isl_input.c
blob3b2e4b10e31f625ab0db8718bfef898c99257582
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 *
6 * Use of this software is governed by the MIT license
7 *
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 */
14
15 #include <ctype.h>
16 #include <stdio.h>
17 #include <string.h>
18 #include <isl_ctx_private.h>
19 #include <isl_map_private.h>
20 #include <isl/set.h>
21 #include <isl_seq.h>
22 #include <isl_stream_private.h>
23 #include <isl/obj.h>
24 #include "isl_polynomial_private.h"
25 #include <isl/union_map.h>
26 #include <isl_mat_private.h>
27 #include <isl_aff_private.h>
28 #include <isl_vec_private.h>
29 #include <isl/list.h>
30 #include <isl_val_private.h>
31
32 struct variable {
33 char *name;
34 int pos;
35 struct variable *next;
36 };
37
38 struct vars {
39 struct isl_ctx *ctx;
40 int n;
41 struct variable *v;
42 };
43
44 static struct vars *vars_new(struct isl_ctx *ctx)
45 {
46 struct vars *v;
47 v = isl_alloc_type(ctx, struct vars);
48 if (!v)
49 return NULL;
50 v->ctx = ctx;
51 v->n = 0;
52 v->v = NULL;
53 return v;
54 }
55
56 static void variable_free(struct variable *var)
57 {
58 while (var) {
59 struct variable *next = var->next;
60 free(var->name);
61 free(var);
62 var = next;
63 }
64 }
65
66 static void vars_free(struct vars *v)
67 {
68 if (!v)
69 return;
70 variable_free(v->v);
71 free(v);
72 }
73
74 static void vars_drop(struct vars *v, int n)
75 {
76 struct variable *var;
77
78 if (!v || !v->v)
79 return;
80
81 v->n -= n;
82
83 var = v->v;
84 while (--n >= 0) {
85 struct variable *next = var->next;
86 free(var->name);
87 free(var);
88 var = next;
89 }
90 v->v = var;
91 }
92
93 static struct variable *variable_new(struct vars *v, const char *name, int len,
94 int pos)
95 {
96 struct variable *var;
97 var = isl_calloc_type(v->ctx, struct variable);
98 if (!var)
99 goto error;
100 var->name = strdup(name);
101 var->name[len] = '\0';
102 var->pos = pos;
103 var->next = v->v;
104 return var;
105 error:
106 variable_free(v->v);
107 return NULL;
108 }
109
110 static int vars_pos(struct vars *v, const char *s, int len)
111 {
112 int pos;
113 struct variable *q;
114
115 if (len == -1)
116 len = strlen(s);
117 for (q = v->v; q; q = q->next) {
118 if (strncmp(q->name, s, len) == 0 && q->name[len] == '\0')
119 break;
120 }
121 if (q)
122 pos = q->pos;
123 else {
124 pos = v->n;
125 v->v = variable_new(v, s, len, v->n);
126 if (!v->v)
127 return -1;
128 v->n++;
129 }
130 return pos;
131 }
132
133 static int vars_add_anon(struct vars *v)
134 {
135 v->v = variable_new(v, "", 0, v->n);
136
137 if (!v->v)
138 return -1;
139 v->n++;
140
141 return 0;
142 }
143
144 /* Obtain next token, with some preprocessing.
145 * In particular, evaluate expressions of the form x^y,
146 * with x and y values.
147 */
148 static struct isl_token *next_token(__isl_keep isl_stream *s)
149 {
150 struct isl_token *tok, *tok2;
151
152 tok = isl_stream_next_token(s);
153 if (!tok || tok->type != ISL_TOKEN_VALUE)
154 return tok;
155 if (!isl_stream_eat_if_available(s, '^'))
156 return tok;
157 tok2 = isl_stream_next_token(s);
158 if (!tok2 || tok2->type != ISL_TOKEN_VALUE) {
159 isl_stream_error(s, tok2, "expecting constant value");
160 goto error;
161 }
162
163 isl_int_pow_ui(tok->u.v, tok->u.v, isl_int_get_ui(tok2->u.v));
164
165 isl_token_free(tok2);
166 return tok;
167 error:
168 isl_token_free(tok);
169 isl_token_free(tok2);
170 return NULL;
171 }
172
173 /* Read an isl_val from "s".
174 *
175 * The following token sequences are recognized
176 *
177 * "infty" -> infty
178 * "-" "infty" -> -infty
179 * "NaN" -> NaN
180 * n "/" d -> n/d
181 * v -> v
182 *
183 * where n, d and v are integer constants.
184 */
185 __isl_give isl_val *isl_stream_read_val(__isl_keep isl_stream *s)
186 {
187 struct isl_token *tok = NULL;
188 struct isl_token *tok2 = NULL;
189 isl_val *val;
190
191 tok = next_token(s);
192 if (!tok) {
193 isl_stream_error(s, NULL, "unexpected EOF");
194 goto error;
195 }
196 if (tok->type == ISL_TOKEN_INFTY) {
197 isl_token_free(tok);
198 return isl_val_infty(s->ctx);
199 }
200 if (tok->type == '-' &&
201 isl_stream_eat_if_available(s, ISL_TOKEN_INFTY)) {
202 isl_token_free(tok);
203 return isl_val_neginfty(s->ctx);
204 }
205 if (tok->type == ISL_TOKEN_NAN) {
206 isl_token_free(tok);
207 return isl_val_nan(s->ctx);
208 }
209 if (tok->type != ISL_TOKEN_VALUE) {
210 isl_stream_error(s, tok, "expecting value");
211 goto error;
212 }
213
214 if (isl_stream_eat_if_available(s, '/')) {
215 tok2 = next_token(s);
216 if (!tok2) {
217 isl_stream_error(s, NULL, "unexpected EOF");
218 goto error;
219 }
220 if (tok2->type != ISL_TOKEN_VALUE) {
221 isl_stream_error(s, tok2, "expecting value");
222 goto error;
223 }
224 val = isl_val_rat_from_isl_int(s->ctx, tok->u.v, tok2->u.v);
225 val = isl_val_normalize(val);
226 } else {
227 val = isl_val_int_from_isl_int(s->ctx, tok->u.v);
228 }
229
230 isl_token_free(tok);
231 isl_token_free(tok2);
232 return val;
233 error:
234 isl_token_free(tok);
235 isl_token_free(tok2);
236 return NULL;
237 }
238
239 /* Read an isl_val from "str".
240 */
241 struct isl_val *isl_val_read_from_str(struct isl_ctx *ctx,
242 const char *str)
243 {
244 isl_val *val;
245 isl_stream *s = isl_stream_new_str(ctx, str);
246 if (!s)
247 return NULL;
248 val = isl_stream_read_val(s);
249 isl_stream_free(s);
250 return val;
251 }
252
253 static int accept_cst_factor(__isl_keep isl_stream *s, isl_int *f)
254 {
255 struct isl_token *tok;
256
257 tok = next_token(s);
258 if (!tok || tok->type != ISL_TOKEN_VALUE) {
259 isl_stream_error(s, tok, "expecting constant value");
260 goto error;
261 }
262
263 isl_int_mul(*f, *f, tok->u.v);
264
265 isl_token_free(tok);
266
267 if (isl_stream_eat_if_available(s, '*'))
268 return accept_cst_factor(s, f);
269
270 return 0;
271 error:
272 isl_token_free(tok);
273 return -1;
274 }
275
276 /* Given an affine expression aff, return an affine expression
277 * for aff % d, with d the next token on the stream, which is
278 * assumed to be a constant.
279 *
280 * We introduce an integer division q = [aff/d] and the result
281 * is set to aff - d q.
282 */
283 static __isl_give isl_pw_aff *affine_mod(__isl_keep isl_stream *s,
284 struct vars *v, __isl_take isl_pw_aff *aff)
285 {
286 struct isl_token *tok;
287 isl_pw_aff *q;
288
289 tok = next_token(s);
290 if (!tok || tok->type != ISL_TOKEN_VALUE) {
291 isl_stream_error(s, tok, "expecting constant value");
292 goto error;
293 }
294
295 q = isl_pw_aff_copy(aff);
296 q = isl_pw_aff_scale_down(q, tok->u.v);
297 q = isl_pw_aff_floor(q);
298 q = isl_pw_aff_scale(q, tok->u.v);
299
300 aff = isl_pw_aff_sub(aff, q);
301
302 isl_token_free(tok);
303 return aff;
304 error:
305 isl_pw_aff_free(aff);
306 isl_token_free(tok);
307 return NULL;
308 }
309
310 static __isl_give isl_pw_aff *accept_affine(__isl_keep isl_stream *s,
311 __isl_take isl_space *space, struct vars *v);
312 static __isl_give isl_pw_aff_list *accept_affine_list(__isl_keep isl_stream *s,
313 __isl_take isl_space *dim, struct vars *v);
314
315 static __isl_give isl_pw_aff *accept_minmax(__isl_keep isl_stream *s,
316 __isl_take isl_space *dim, struct vars *v)
317 {
318 struct isl_token *tok;
319 isl_pw_aff_list *list = NULL;
320 int min;
321
322 tok = isl_stream_next_token(s);
323 if (!tok)
324 goto error;
325 min = tok->type == ISL_TOKEN_MIN;
326 isl_token_free(tok);
327
328 if (isl_stream_eat(s, '('))
329 goto error;
330
331 list = accept_affine_list(s, isl_space_copy(dim), v);
332 if (!list)
333 goto error;
334
335 if (isl_stream_eat(s, ')'))
336 goto error;
337
338 isl_space_free(dim);
339 return min ? isl_pw_aff_list_min(list) : isl_pw_aff_list_max(list);
340 error:
341 isl_space_free(dim);
342 isl_pw_aff_list_free(list);
343 return NULL;
344 }
345
346 /* Is "tok" the start of an integer division?
347 */
348 static int is_start_of_div(struct isl_token *tok)
349 {
350 if (!tok)
351 return 0;
352 if (tok->type == '[')
353 return 1;
354 if (tok->type == ISL_TOKEN_FLOOR)
355 return 1;
356 if (tok->type == ISL_TOKEN_CEIL)
357 return 1;
358 if (tok->type == ISL_TOKEN_FLOORD)
359 return 1;
360 if (tok->type == ISL_TOKEN_CEILD)
361 return 1;
362 return 0;
363 }
364
365 /* Read an integer division from "s" and return it as an isl_pw_aff.
366 *
367 * The integer division can be of the form
368 *
369 * [<affine expression>]
370 * floor(<affine expression>)
371 * ceil(<affine expression>)
372 * floord(<affine expression>,<denominator>)
373 * ceild(<affine expression>,<denominator>)
374 */
375 static __isl_give isl_pw_aff *accept_div(__isl_keep isl_stream *s,
376 __isl_take isl_space *dim, struct vars *v)
377 {
378 struct isl_token *tok;
379 int f = 0;
380 int c = 0;
381 int extra = 0;
382 isl_pw_aff *pwaff = NULL;
383
384 if (isl_stream_eat_if_available(s, ISL_TOKEN_FLOORD))
385 extra = f = 1;
386 else if (isl_stream_eat_if_available(s, ISL_TOKEN_CEILD))
387 extra = c = 1;
388 else if (isl_stream_eat_if_available(s, ISL_TOKEN_FLOOR))
389 f = 1;
390 else if (isl_stream_eat_if_available(s, ISL_TOKEN_CEIL))
391 c = 1;
392 if (f || c) {
393 if (isl_stream_eat(s, '('))
394 goto error;
395 } else {
396 if (isl_stream_eat(s, '['))
397 goto error;
398 }
399
400 pwaff = accept_affine(s, isl_space_copy(dim), v);
401
402 if (extra) {
403 if (isl_stream_eat(s, ','))
404 goto error;
405
406 tok = next_token(s);
407 if (!tok)
408 goto error;
409 if (tok->type != ISL_TOKEN_VALUE) {
410 isl_stream_error(s, tok, "expected denominator");
411 isl_stream_push_token(s, tok);
412 goto error;
413 }
414 isl_pw_aff_scale_down(pwaff, tok->u.v);
415 isl_token_free(tok);
416 }
417
418 if (c)
419 pwaff = isl_pw_aff_ceil(pwaff);
420 else
421 pwaff = isl_pw_aff_floor(pwaff);
422
423 if (f || c) {
424 if (isl_stream_eat(s, ')'))
425 goto error;
426 } else {
427 if (isl_stream_eat(s, ']'))
428 goto error;
429 }
430
431 isl_space_free(dim);
432 return pwaff;
433 error:
434 isl_space_free(dim);
435 isl_pw_aff_free(pwaff);
436 return NULL;
437 }
438
439 static __isl_give isl_pw_aff *accept_affine_factor(__isl_keep isl_stream *s,
440 __isl_take isl_space *dim, struct vars *v)
441 {
442 struct isl_token *tok = NULL;
443 isl_pw_aff *res = NULL;
444
445 tok = next_token(s);
446 if (!tok) {
447 isl_stream_error(s, NULL, "unexpected EOF");
448 goto error;
449 }
450
451 if (tok->type == ISL_TOKEN_AFF) {
452 res = isl_pw_aff_copy(tok->u.pwaff);
453 isl_token_free(tok);
454 } else if (tok->type == ISL_TOKEN_IDENT) {
455 int n = v->n;
456 int pos = vars_pos(v, tok->u.s, -1);
457 isl_aff *aff;
458
459 if (pos < 0)
460 goto error;
461 if (pos >= n) {
462 vars_drop(v, v->n - n);
463 isl_stream_error(s, tok, "unknown identifier");
464 goto error;
465 }
466
467 aff = isl_aff_zero_on_domain(isl_local_space_from_space(isl_space_copy(dim)));
468 if (!aff)
469 goto error;
470 isl_int_set_si(aff->v->el[2 + pos], 1);
471 res = isl_pw_aff_from_aff(aff);
472 isl_token_free(tok);
473 } else if (tok->type == ISL_TOKEN_VALUE) {
474 if (isl_stream_eat_if_available(s, '*')) {
475 res = accept_affine_factor(s, isl_space_copy(dim), v);
476 res = isl_pw_aff_scale(res, tok->u.v);
477 } else {
478 isl_local_space *ls;
479 isl_aff *aff;
480 ls = isl_local_space_from_space(isl_space_copy(dim));
481 aff = isl_aff_zero_on_domain(ls);
482 aff = isl_aff_add_constant(aff, tok->u.v);
483 res = isl_pw_aff_from_aff(aff);
484 }
485 isl_token_free(tok);
486 } else if (tok->type == '(') {
487 isl_token_free(tok);
488 tok = NULL;
489 res = accept_affine(s, isl_space_copy(dim), v);
490 if (!res)
491 goto error;
492 if (isl_stream_eat(s, ')'))
493 goto error;
494 } else if (is_start_of_div(tok)) {
495 isl_stream_push_token(s, tok);
496 tok = NULL;
497 res = accept_div(s, isl_space_copy(dim), v);
498 } else if (tok->type == ISL_TOKEN_MIN || tok->type == ISL_TOKEN_MAX) {
499 isl_stream_push_token(s, tok);
500 tok = NULL;
501 res = accept_minmax(s, isl_space_copy(dim), v);
502 } else {
503 isl_stream_error(s, tok, "expecting factor");
504 goto error;
505 }
506 if (isl_stream_eat_if_available(s, '%') ||
507 isl_stream_eat_if_available(s, ISL_TOKEN_MOD)) {
508 isl_space_free(dim);
509 return affine_mod(s, v, res);
510 }
511 if (isl_stream_eat_if_available(s, '*')) {
512 isl_int f;
513 isl_int_init(f);
514 isl_int_set_si(f, 1);
515 if (accept_cst_factor(s, &f) < 0) {
516 isl_int_clear(f);
517 goto error2;
518 }
519 res = isl_pw_aff_scale(res, f);
520 isl_int_clear(f);
521 }
522 if (isl_stream_eat_if_available(s, '/')) {
523 isl_int f;
524 isl_int_init(f);
525 isl_int_set_si(f, 1);
526 if (accept_cst_factor(s, &f) < 0) {
527 isl_int_clear(f);
528 goto error2;
529 }
530 res = isl_pw_aff_scale_down(res, f);
531 isl_int_clear(f);
532 }
533
534 isl_space_free(dim);
535 return res;
536 error:
537 isl_token_free(tok);
538 error2:
539 isl_pw_aff_free(res);
540 isl_space_free(dim);
541 return NULL;
542 }
543
544 static __isl_give isl_pw_aff *add_cst(__isl_take isl_pw_aff *pwaff, isl_int v)
545 {
546 isl_aff *aff;
547 isl_space *space;
548
549 space = isl_pw_aff_get_domain_space(pwaff);
550 aff = isl_aff_zero_on_domain(isl_local_space_from_space(space));
551 aff = isl_aff_add_constant(aff, v);
552
553 return isl_pw_aff_add(pwaff, isl_pw_aff_from_aff(aff));
554 }
555
556 /* Return a piecewise affine expression defined on the specified domain
557 * that represents NaN.
558 */
559 static __isl_give isl_pw_aff *nan_on_domain(__isl_keep isl_space *space)
560 {
561 isl_local_space *ls;
562
563 ls = isl_local_space_from_space(isl_space_copy(space));
564 return isl_pw_aff_nan_on_domain(ls);
565 }
566
567 static __isl_give isl_pw_aff *accept_affine(__isl_keep isl_stream *s,
568 __isl_take isl_space *space, struct vars *v)
569 {
570 struct isl_token *tok = NULL;
571 isl_local_space *ls;
572 isl_pw_aff *res;
573 int sign = 1;
574
575 ls = isl_local_space_from_space(isl_space_copy(space));
576 res = isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls));
577 if (!res)
578 goto error;
579
580 for (;;) {
581 tok = next_token(s);
582 if (!tok) {
583 isl_stream_error(s, NULL, "unexpected EOF");
584 goto error;
585 }
586 if (tok->type == '-') {
587 sign = -sign;
588 isl_token_free(tok);
589 continue;
590 }
591 if (tok->type == '(' || is_start_of_div(tok) ||
592 tok->type == ISL_TOKEN_MIN || tok->type == ISL_TOKEN_MAX ||
593 tok->type == ISL_TOKEN_IDENT ||
594 tok->type == ISL_TOKEN_AFF) {
595 isl_pw_aff *term;
596 isl_stream_push_token(s, tok);
597 tok = NULL;
598 term = accept_affine_factor(s,
599 isl_space_copy(space), v);
600 if (sign < 0)
601 res = isl_pw_aff_sub(res, term);
602 else
603 res = isl_pw_aff_add(res, term);
604 if (!res)
605 goto error;
606 sign = 1;
607 } else if (tok->type == ISL_TOKEN_VALUE) {
608 if (sign < 0)
609 isl_int_neg(tok->u.v, tok->u.v);
610 if (isl_stream_eat_if_available(s, '*') ||
611 isl_stream_next_token_is(s, ISL_TOKEN_IDENT)) {
612 isl_pw_aff *term;
613 term = accept_affine_factor(s,
614 isl_space_copy(space), v);
615 term = isl_pw_aff_scale(term, tok->u.v);
616 res = isl_pw_aff_add(res, term);
617 if (!res)
618 goto error;
619 } else {
620 res = add_cst(res, tok->u.v);
621 }
622 sign = 1;
623 } else if (tok->type == ISL_TOKEN_NAN) {
624 res = isl_pw_aff_add(res, nan_on_domain(space));
625 } else {
626 isl_stream_error(s, tok, "unexpected isl_token");
627 isl_stream_push_token(s, tok);
628 isl_pw_aff_free(res);
629 isl_space_free(space);
630 return NULL;
631 }
632 isl_token_free(tok);
633
634 tok = next_token(s);
635 if (tok && tok->type == '-') {
636 sign = -sign;
637 isl_token_free(tok);
638 } else if (tok && tok->type == '+') {
639 /* nothing */
640 isl_token_free(tok);
641 } else if (tok && tok->type == ISL_TOKEN_VALUE &&
642 isl_int_is_neg(tok->u.v)) {
643 isl_stream_push_token(s, tok);
644 } else {
645 if (tok)
646 isl_stream_push_token(s, tok);
647 break;
648 }
649 }
650
651 isl_space_free(space);
652 return res;
653 error:
654 isl_space_free(space);
655 isl_token_free(tok);
656 isl_pw_aff_free(res);
657 return NULL;
658 }
659
660 static int is_comparator(struct isl_token *tok)
661 {
662 if (!tok)
663 return 0;
664
665 switch (tok->type) {
666 case ISL_TOKEN_LT:
667 case ISL_TOKEN_GT:
668 case ISL_TOKEN_LE:
669 case ISL_TOKEN_GE:
670 case ISL_TOKEN_NE:
671 case '=':
672 return 1;
673 default:
674 return 0;
675 }
676 }
677
678 static __isl_give isl_map *read_formula(__isl_keep isl_stream *s,
679 struct vars *v, __isl_take isl_map *map, int rational);
680 static __isl_give isl_pw_aff *accept_extended_affine(__isl_keep isl_stream *s,
681 __isl_take isl_space *dim, struct vars *v, int rational);
682
683 /* Accept a ternary operator, given the first argument.
684 */
685 static __isl_give isl_pw_aff *accept_ternary(__isl_keep isl_stream *s,
686 __isl_take isl_map *cond, struct vars *v, int rational)
687 {
688 isl_space *dim;
689 isl_pw_aff *pwaff1 = NULL, *pwaff2 = NULL, *pa_cond;
690
691 if (!cond)
692 return NULL;
693
694 if (isl_stream_eat(s, '?'))
695 goto error;
696
697 dim = isl_space_wrap(isl_map_get_space(cond));
698 pwaff1 = accept_extended_affine(s, dim, v, rational);
699 if (!pwaff1)
700 goto error;
701
702 if (isl_stream_eat(s, ':'))
703 goto error;
704
705 dim = isl_pw_aff_get_domain_space(pwaff1);
706 pwaff2 = accept_extended_affine(s, dim, v, rational);
707 if (!pwaff1)
708 goto error;
709
710 pa_cond = isl_set_indicator_function(isl_map_wrap(cond));
711 return isl_pw_aff_cond(pa_cond, pwaff1, pwaff2);
712 error:
713 isl_map_free(cond);
714 isl_pw_aff_free(pwaff1);
715 isl_pw_aff_free(pwaff2);
716 return NULL;
717 }
718
719 /* Set *line and *col to those of the next token, if any.
720 */
721 static void set_current_line_col(__isl_keep isl_stream *s, int *line, int *col)
722 {
723 struct isl_token *tok;
724
725 tok = isl_stream_next_token(s);
726 if (!tok)
727 return;
728
729 *line = tok->line;
730 *col = tok->col;
731 isl_stream_push_token(s, tok);
732 }
733
734 /* Push a token encapsulating "pa" onto "s", with the given
735 * line and column.
736 */
737 static int push_aff(__isl_keep isl_stream *s, int line, int col,
738 __isl_take isl_pw_aff *pa)
739 {
740 struct isl_token *tok;
741
742 tok = isl_token_new(s->ctx, line, col, 0);
743 if (!tok)
744 goto error;
745 tok->type = ISL_TOKEN_AFF;
746 tok->u.pwaff = pa;
747 isl_stream_push_token(s, tok);
748
749 return 0;
750 error:
751 isl_pw_aff_free(pa);
752 return -1;
753 }
754
755 /* Accept an affine expression that may involve ternary operators.
756 * We first read an affine expression.
757 * If it is not followed by a comparison operator, we simply return it.
758 * Otherwise, we assume the affine expression is part of the first
759 * argument of a ternary operator and try to parse that.
760 */
761 static __isl_give isl_pw_aff *accept_extended_affine(__isl_keep isl_stream *s,
762 __isl_take isl_space *dim, struct vars *v, int rational)
763 {
764 isl_space *space;
765 isl_map *cond;
766 isl_pw_aff *pwaff;
767 struct isl_token *tok;
768 int line = -1, col = -1;
769 int is_comp;
770
771 set_current_line_col(s, &line, &col);
772
773 pwaff = accept_affine(s, dim, v);
774 if (rational)
775 pwaff = isl_pw_aff_set_rational(pwaff);
776 if (!pwaff)
777 return NULL;
778
779 tok = isl_stream_next_token(s);
780 if (!tok)
781 return isl_pw_aff_free(pwaff);
782
783 is_comp = is_comparator(tok);
784 isl_stream_push_token(s, tok);
785 if (!is_comp)
786 return pwaff;
787
788 space = isl_pw_aff_get_domain_space(pwaff);
789 cond = isl_map_universe(isl_space_unwrap(space));
790
791 if (push_aff(s, line, col, pwaff) < 0)
792 cond = isl_map_free(cond);
793 if (!cond)
794 return NULL;
795
796 cond = read_formula(s, v, cond, rational);
797
798 return accept_ternary(s, cond, v, rational);
799 }
800
801 static __isl_give isl_map *read_var_def(__isl_keep isl_stream *s,
802 __isl_take isl_map *map, enum isl_dim_type type, struct vars *v,
803 int rational)
804 {
805 isl_pw_aff *def;
806 int pos;
807 isl_map *def_map;
808
809 if (type == isl_dim_param)
810 pos = isl_map_dim(map, isl_dim_param);
811 else {
812 pos = isl_map_dim(map, isl_dim_in);
813 if (type == isl_dim_out)
814 pos += isl_map_dim(map, isl_dim_out);
815 type = isl_dim_in;
816 }
817 --pos;
818
819 def = accept_extended_affine(s, isl_space_wrap(isl_map_get_space(map)),
820 v, rational);
821 def_map = isl_map_from_pw_aff(def);
822 def_map = isl_map_equate(def_map, type, pos, isl_dim_out, 0);
823 def_map = isl_set_unwrap(isl_map_domain(def_map));
824
825 map = isl_map_intersect(map, def_map);
826
827 return map;
828 }
829
830 static __isl_give isl_pw_aff_list *accept_affine_list(__isl_keep isl_stream *s,
831 __isl_take isl_space *dim, struct vars *v)
832 {
833 isl_pw_aff *pwaff;
834 isl_pw_aff_list *list;
835 struct isl_token *tok = NULL;
836
837 pwaff = accept_affine(s, isl_space_copy(dim), v);
838 list = isl_pw_aff_list_from_pw_aff(pwaff);
839 if (!list)
840 goto error;
841
842 for (;;) {
843 tok = isl_stream_next_token(s);
844 if (!tok) {
845 isl_stream_error(s, NULL, "unexpected EOF");
846 goto error;
847 }
848 if (tok->type != ',') {
849 isl_stream_push_token(s, tok);
850 break;
851 }
852 isl_token_free(tok);
853
854 pwaff = accept_affine(s, isl_space_copy(dim), v);
855 list = isl_pw_aff_list_concat(list,
856 isl_pw_aff_list_from_pw_aff(pwaff));
857 if (!list)
858 goto error;
859 }
860
861 isl_space_free(dim);
862 return list;
863 error:
864 isl_space_free(dim);
865 isl_pw_aff_list_free(list);
866 return NULL;
867 }
868
869 static __isl_give isl_map *read_defined_var_list(__isl_keep isl_stream *s,
870 struct vars *v, __isl_take isl_map *map, int rational)
871 {
872 struct isl_token *tok;
873
874 while ((tok = isl_stream_next_token(s)) != NULL) {
875 int p;
876 int n = v->n;
877
878 if (tok->type != ISL_TOKEN_IDENT)
879 break;
880
881 p = vars_pos(v, tok->u.s, -1);
882 if (p < 0)
883 goto error;
884 if (p < n) {
885 isl_stream_error(s, tok, "expecting unique identifier");
886 goto error;
887 }
888
889 map = isl_map_add_dims(map, isl_dim_out, 1);
890
891 isl_token_free(tok);
892 tok = isl_stream_next_token(s);
893 if (tok && tok->type == '=') {
894 isl_token_free(tok);
895 map = read_var_def(s, map, isl_dim_out, v, rational);
896 tok = isl_stream_next_token(s);
897 }
898
899 if (!tok || tok->type != ',')
900 break;
901
902 isl_token_free(tok);
903 }
904 if (tok)
905 isl_stream_push_token(s, tok);
906
907 return map;
908 error:
909 isl_token_free(tok);
910 isl_map_free(map);
911 return NULL;
912 }
913
914 static int next_is_tuple(__isl_keep isl_stream *s)
915 {
916 struct isl_token *tok;
917 int is_tuple;
918
919 tok = isl_stream_next_token(s);
920 if (!tok)
921 return 0;
922 if (tok->type == '[') {
923 isl_stream_push_token(s, tok);
924 return 1;
925 }
926 if (tok->type != ISL_TOKEN_IDENT && !tok->is_keyword) {
927 isl_stream_push_token(s, tok);
928 return 0;
929 }
930
931 is_tuple = isl_stream_next_token_is(s, '[');
932
933 isl_stream_push_token(s, tok);
934
935 return is_tuple;
936 }
937
938 /* Is "pa" an expression in term of earlier dimensions?
939 * The alternative is that the dimension is defined to be equal to itself,
940 * meaning that it has a universe domain and an expression that depends
941 * on itself. "i" is the position of the expression in a sequence
942 * of "n" expressions. The final dimensions of "pa" correspond to
943 * these "n" expressions.
944 */
945 static int pw_aff_is_expr(__isl_keep isl_pw_aff *pa, int i, int n)
946 {
947 isl_aff *aff;
948
949 if (!pa)
950 return -1;
951 if (pa->n != 1)
952 return 1;
953 if (!isl_set_plain_is_universe(pa->p[0].set))
954 return 1;
955
956 aff = pa->p[0].aff;
957 if (isl_int_is_zero(aff->v->el[aff->v->size - n + i]))
958 return 1;
959 return 0;
960 }
961
962 /* Does the tuple contain any dimensions that are defined
963 * in terms of earlier dimensions?
964 */
965 static int tuple_has_expr(__isl_keep isl_multi_pw_aff *tuple)
966 {
967 int i, n;
968 int has_expr = 0;
969 isl_pw_aff *pa;
970
971 if (!tuple)
972 return -1;
973 n = isl_multi_pw_aff_dim(tuple, isl_dim_out);
974 for (i = 0; i < n; ++i) {
975 pa = isl_multi_pw_aff_get_pw_aff(tuple, i);
976 has_expr = pw_aff_is_expr(pa, i, n);
977 isl_pw_aff_free(pa);
978 if (has_expr < 0 || has_expr)
979 break;
980 }
981
982 return has_expr;
983 }
984
985 /* Set the name of dimension "pos" in "space" to "name".
986 * During printing, we add primes if the same name appears more than once
987 * to distinguish the occurrences. Here, we remove those primes from "name"
988 * before setting the name of the dimension.
989 */
990 static __isl_give isl_space *space_set_dim_name(__isl_take isl_space *space,
991 int pos, char *name)
992 {
993 char *prime;
994
995 if (!name)
996 return space;
997
998 prime = strchr(name, '\'');
999 if (prime)
1000 *prime = '\0';
1001 space = isl_space_set_dim_name(space, isl_dim_out, pos, name);
1002 if (prime)
1003 *prime = '\'';
1004
1005 return space;
1006 }
1007
1008 /* Accept a piecewise affine expression.
1009 *
1010 * At the outer level, the piecewise affine expression may be of the form
1011 *
1012 * aff1 : condition1; aff2 : conditions2; ...
1013 *
1014 * or simply
1015 *
1016 * aff
1017 *
1018 * each of the affine expressions may in turn include ternary operators.
1019 *
1020 * There may be parentheses around some subexpression of "aff1"
1021 * around "aff1" itself, around "aff1 : condition1" and/or
1022 * around the entire piecewise affine expression.
1023 * We therefore remove the opening parenthesis (if any) from the stream
1024 * in case the closing parenthesis follows the colon, but if the closing
1025 * parenthesis is the first thing in the stream after the parsed affine
1026 * expression, we push the parsed expression onto the stream and parse
1027 * again in case the parentheses enclose some subexpression of "aff1".
1028 */
1029 static __isl_give isl_pw_aff *accept_piecewise_affine(__isl_keep isl_stream *s,
1030 __isl_take isl_space *space, struct vars *v, int rational)
1031 {
1032 isl_pw_aff *res;
1033 isl_space *res_space;
1034
1035 res_space = isl_space_from_domain(isl_space_copy(space));
1036 res_space = isl_space_add_dims(res_space, isl_dim_out, 1);
1037 res = isl_pw_aff_empty(res_space);
1038 do {
1039 isl_pw_aff *pa;
1040 int seen_paren;
1041 int line = -1, col = -1;
1042
1043 set_current_line_col(s, &line, &col);
1044 seen_paren = isl_stream_eat_if_available(s, '(');
1045 if (seen_paren)
1046 pa = accept_piecewise_affine(s, isl_space_copy(space),
1047 v, rational);
1048 else
1049 pa = accept_extended_affine(s, isl_space_copy(space),
1050 v, rational);
1051 if (seen_paren && isl_stream_eat_if_available(s, ')')) {
1052 seen_paren = 0;
1053 if (push_aff(s, line, col, pa) < 0)
1054 goto error;
1055 pa = accept_extended_affine(s, isl_space_copy(space),
1056 v, rational);
1057 }
1058 if (isl_stream_eat_if_available(s, ':')) {
1059 isl_space *dom_space;
1060 isl_set *dom;
1061
1062 dom_space = isl_pw_aff_get_domain_space(pa);
1063 dom = isl_set_universe(dom_space);
1064 dom = read_formula(s, v, dom, rational);
1065 pa = isl_pw_aff_intersect_domain(pa, dom);
1066 }
1067
1068 res = isl_pw_aff_union_add(res, pa);
1069
1070 if (seen_paren && isl_stream_eat(s, ')'))
1071 goto error;
1072 } while (isl_stream_eat_if_available(s, ';'));
1073
1074 isl_space_free(space);
1075
1076 return res;
1077 error:
1078 isl_space_free(space);
1079 return isl_pw_aff_free(res);
1080 }
1081
1082 /* Read an affine expression from "s" for use in read_tuple.
1083 *
1084 * accept_extended_affine requires a wrapped space as input.
1085 * read_tuple on the other hand expects each isl_pw_aff
1086 * to have an anonymous space. We therefore adjust the space
1087 * of the isl_pw_aff before returning it.
1088 */
1089 static __isl_give isl_pw_aff *read_tuple_var_def(__isl_keep isl_stream *s,
1090 struct vars *v, int rational)
1091 {
1092 isl_space *space;
1093 isl_pw_aff *def;
1094
1095 space = isl_space_wrap(isl_space_alloc(s->ctx, 0, v->n, 0));
1096
1097 def = accept_piecewise_affine(s, space, v, rational);
1098
1099 space = isl_space_set_alloc(s->ctx, 0, v->n);
1100 def = isl_pw_aff_reset_domain_space(def, space);
1101
1102 return def;
1103 }
1104
1105 /* Read a list of tuple elements by calling "read_el" on each of them and
1106 * return a space with the same number of set dimensions derived from
1107 * the parameter space "space" and possibly updated by "read_el".
1108 * The elements in the list are separated by either "," or "][".
1109 * If "comma" is set then only "," is allowed.
1110 */
1111 static __isl_give isl_space *read_tuple_list(__isl_keep isl_stream *s,
1112 struct vars *v, __isl_take isl_space *space, int rational, int comma,
1113 __isl_give isl_space *(*read_el)(__isl_keep isl_stream *s,
1114 struct vars *v, __isl_take isl_space *space, int rational,
1115 void *user),
1116 void *user)
1117 {
1118 if (!space)
1119 return NULL;
1120
1121 space = isl_space_set_from_params(space);
1122
1123 if (isl_stream_next_token_is(s, ']'))
1124 return space;
1125
1126 for (;;) {
1127 struct isl_token *tok;
1128
1129 space = isl_space_add_dims(space, isl_dim_set, 1);
1130
1131 space = read_el(s, v, space, rational, user);
1132 if (!space)
1133 return NULL;
1134
1135 tok = isl_stream_next_token(s);
1136 if (!comma && tok && tok->type == ']' &&
1137 isl_stream_next_token_is(s, '[')) {
1138 isl_token_free(tok);
1139 tok = isl_stream_next_token(s);
1140 } else if (!tok || tok->type != ',') {
1141 if (tok)
1142 isl_stream_push_token(s, tok);
1143 break;
1144 }
1145
1146 isl_token_free(tok);
1147 }
1148
1149 return space;
1150 }
1151
1152 /* Read a tuple space from "s" derived from the parameter space "space".
1153 * Call "read_el" on each element in the tuples.
1154 */
1155 static __isl_give isl_space *read_tuple_space(__isl_keep isl_stream *s,
1156 struct vars *v, __isl_take isl_space *space, int rational, int comma,
1157 __isl_give isl_space *(*read_el)(__isl_keep isl_stream *s,
1158 struct vars *v, __isl_take isl_space *space, int rational,
1159 void *user),
1160 void *user)
1161 {
1162 struct isl_token *tok;
1163 char *name = NULL;
1164 isl_space *res = NULL;
1165
1166 tok = isl_stream_next_token(s);
1167 if (!tok)
1168 goto error;
1169 if (tok->type == ISL_TOKEN_IDENT || tok->is_keyword) {
1170 name = strdup(tok->u.s);
1171 isl_token_free(tok);
1172 if (!name)
1173 goto error;
1174 } else
1175 isl_stream_push_token(s, tok);
1176 if (isl_stream_eat(s, '['))
1177 goto error;
1178 if (next_is_tuple(s)) {
1179 isl_space *out;
1180 res = read_tuple_space(s, v, isl_space_copy(space),
1181 rational, comma, read_el, user);
1182 if (isl_stream_eat(s, ISL_TOKEN_TO))
1183 goto error;
1184 out = read_tuple_space(s, v, isl_space_copy(space),
1185 rational, comma, read_el, user);
1186 res = isl_space_range_product(res, out);
1187 } else
1188 res = read_tuple_list(s, v, isl_space_copy(space),
1189 rational, comma, read_el, user);
1190 if (isl_stream_eat(s, ']'))
1191 goto error;
1192
1193 if (name) {
1194 res = isl_space_set_tuple_name(res, isl_dim_set, name);
1195 free(name);
1196 }
1197
1198 isl_space_free(space);
1199 return res;
1200 error:
1201 free(name);
1202 isl_space_free(res);
1203 isl_space_free(space);
1204 return NULL;
1205 }
1206
1207 /* Construct an isl_pw_aff defined on a space with v->n variables
1208 * that is equal to the last of those variables.
1209 */
1210 static __isl_give isl_pw_aff *identity_tuple_el(struct vars *v)
1211 {
1212 isl_space *space;
1213 isl_aff *aff;
1214
1215 space = isl_space_set_alloc(v->ctx, 0, v->n);
1216 aff = isl_aff_zero_on_domain(isl_local_space_from_space(space));
1217 aff = isl_aff_add_coefficient_si(aff, isl_dim_in, v->n - 1, 1);
1218 return isl_pw_aff_from_aff(aff);
1219 }
1220
1221 /* This function is called for each element in a tuple inside read_tuple.
1222 * Add a new variable to "v" and construct a corresponding isl_pw_aff defined
1223 * over a space containing all variables in "v" defined so far.
1224 * The isl_pw_aff expresses the new variable in terms of earlier variables
1225 * if a definition is provided. Otherwise, it is represented as being
1226 * equal to itself.
1227 * Add the isl_pw_aff to *list.
1228 * If the new variable was named, then adjust "space" accordingly and
1229 * return the updated space.
1230 */
1231 static __isl_give isl_space *read_tuple_pw_aff_el(__isl_keep isl_stream *s,
1232 struct vars *v, __isl_take isl_space *space, int rational, void *user)
1233 {
1234 isl_pw_aff_list **list = (isl_pw_aff_list **) user;
1235 isl_pw_aff *pa;
1236 struct isl_token *tok;
1237 int new_name = 0;
1238
1239 tok = next_token(s);
1240 if (!tok) {
1241 isl_stream_error(s, NULL, "unexpected EOF");
1242 return isl_space_free(space);
1243 }
1244
1245 if (tok->type == ISL_TOKEN_IDENT) {
1246 int n = v->n;
1247 int p = vars_pos(v, tok->u.s, -1);
1248 if (p < 0)
1249 goto error;
1250 new_name = p >= n;
1251 }
1252
1253 if (tok->type == '*') {
1254 if (vars_add_anon(v) < 0)
1255 goto error;
1256 isl_token_free(tok);
1257 pa = identity_tuple_el(v);
1258 } else if (new_name) {
1259 int pos = isl_space_dim(space, isl_dim_out) - 1;
1260 space = space_set_dim_name(space, pos, v->v->name);
1261 isl_token_free(tok);
1262 if (isl_stream_eat_if_available(s, '='))
1263 pa = read_tuple_var_def(s, v, rational);
1264 else
1265 pa = identity_tuple_el(v);
1266 } else {
1267 isl_stream_push_token(s, tok);
1268 tok = NULL;
1269 if (vars_add_anon(v) < 0)
1270 goto error;
1271 pa = read_tuple_var_def(s, v, rational);
1272 }
1273
1274 *list = isl_pw_aff_list_add(*list, pa);
1275 if (!*list)
1276 return isl_space_free(space);
1277
1278 return space;
1279 error:
1280 isl_token_free(tok);
1281 return isl_space_free(space);
1282 }
1283
1284 /* Read a tuple and represent it as an isl_multi_pw_aff.
1285 * The range space of the isl_multi_pw_aff is the space of the tuple.
1286 * The domain space is an anonymous space
1287 * with a dimension for each variable in the set of variables in "v",
1288 * including the variables in the range.
1289 * If a given dimension is not defined in terms of earlier dimensions in
1290 * the input, then the corresponding isl_pw_aff is set equal to one time
1291 * the variable corresponding to the dimension being defined.
1292 *
1293 * The elements in the tuple are collected in a list by read_tuple_pw_aff_el.
1294 * Each element in this list is defined over a space representing
1295 * the variables defined so far. We need to adjust the earlier
1296 * elements to have as many variables in the domain as the final
1297 * element in the list.
1298 */
1299 static __isl_give isl_multi_pw_aff *read_tuple(__isl_keep isl_stream *s,
1300 struct vars *v, int rational, int comma)
1301 {
1302 int i, n;
1303 isl_space *space;
1304 isl_pw_aff_list *list;
1305
1306 space = isl_space_params_alloc(v->ctx, 0);
1307 list = isl_pw_aff_list_alloc(s->ctx, 0);
1308 space = read_tuple_space(s, v, space, rational, comma,
1309 &read_tuple_pw_aff_el, &list);
1310 n = isl_space_dim(space, isl_dim_set);
1311 for (i = 0; i + 1 < n; ++i) {
1312 isl_pw_aff *pa;
1313
1314 pa = isl_pw_aff_list_get_pw_aff(list, i);
1315 pa = isl_pw_aff_add_dims(pa, isl_dim_in, n - (i + 1));
1316 list = isl_pw_aff_list_set_pw_aff(list, i, pa);
1317 }
1318
1319 space = isl_space_from_range(space);
1320 space = isl_space_add_dims(space, isl_dim_in, v->n);
1321 return isl_multi_pw_aff_from_pw_aff_list(space, list);
1322 }
1323
1324 /* Add the tuple represented by the isl_multi_pw_aff "tuple" to "map".
1325 * We first create the appropriate space in "map" based on the range
1326 * space of this isl_multi_pw_aff. Then, we add equalities based
1327 * on the affine expressions. These live in an anonymous space,
1328 * however, so we first need to reset the space to that of "map".
1329 */
1330 static __isl_give isl_map *map_from_tuple(__isl_take isl_multi_pw_aff *tuple,
1331 __isl_take isl_map *map, enum isl_dim_type type, struct vars *v,
1332 int rational)
1333 {
1334 int i, n;
1335 isl_ctx *ctx;
1336 isl_space *space = NULL;
1337
1338 if (!map || !tuple)
1339 goto error;
1340 ctx = isl_multi_pw_aff_get_ctx(tuple);
1341 n = isl_multi_pw_aff_dim(tuple, isl_dim_out);
1342 space = isl_space_range(isl_multi_pw_aff_get_space(tuple));
1343 if (!space)
1344 goto error;
1345
1346 if (type == isl_dim_param) {
1347 if (isl_space_has_tuple_name(space, isl_dim_set) ||
1348 isl_space_is_wrapping(space)) {
1349 isl_die(ctx, isl_error_invalid,
1350 "parameter tuples cannot be named or nested",
1351 goto error);
1352 }
1353 map = isl_map_add_dims(map, type, n);
1354 for (i = 0; i < n; ++i) {
1355 isl_id *id;
1356 if (!isl_space_has_dim_name(space, isl_dim_set, i))
1357 isl_die(ctx, isl_error_invalid,
1358 "parameters must be named",
1359 goto error);
1360 id = isl_space_get_dim_id(space, isl_dim_set, i);
1361 map = isl_map_set_dim_id(map, isl_dim_param, i, id);
1362 }
1363 } else if (type == isl_dim_in) {
1364 isl_set *set;
1365
1366 set = isl_set_universe(isl_space_copy(space));
1367 if (rational)
1368 set = isl_set_set_rational(set);
1369 set = isl_set_intersect_params(set, isl_map_params(map));
1370 map = isl_map_from_domain(set);
1371 } else {
1372 isl_set *set;
1373
1374 set = isl_set_universe(isl_space_copy(space));
1375 if (rational)
1376 set = isl_set_set_rational(set);
1377 map = isl_map_from_domain_and_range(isl_map_domain(map), set);
1378 }
1379
1380 for (i = 0; i < n; ++i) {
1381 isl_pw_aff *pa;
1382 isl_space *space;
1383 isl_aff *aff;
1384 isl_set *set;
1385 isl_map *map_i;
1386
1387 pa = isl_multi_pw_aff_get_pw_aff(tuple, i);
1388 space = isl_pw_aff_get_domain_space(pa);
1389 aff = isl_aff_zero_on_domain(isl_local_space_from_space(space));
1390 aff = isl_aff_add_coefficient_si(aff,
1391 isl_dim_in, v->n - n + i, -1);
1392 pa = isl_pw_aff_add(pa, isl_pw_aff_from_aff(aff));
1393 if (rational)
1394 pa = isl_pw_aff_set_rational(pa);
1395 set = isl_pw_aff_zero_set(pa);
1396 map_i = isl_map_from_range(set);
1397 map_i = isl_map_reset_space(map_i, isl_map_get_space(map));
1398 map = isl_map_intersect(map, map_i);
1399 }
1400
1401 isl_space_free(space);
1402 isl_multi_pw_aff_free(tuple);
1403 return map;
1404 error:
1405 isl_space_free(space);
1406 isl_multi_pw_aff_free(tuple);
1407 isl_map_free(map);
1408 return NULL;
1409 }
1410
1411 /* Read a tuple from "s" and add it to "map".
1412 * The tuple is initially represented as an isl_multi_pw_aff and
1413 * then added to "map".
1414 */
1415 static __isl_give isl_map *read_map_tuple(__isl_keep isl_stream *s,
1416 __isl_take isl_map *map, enum isl_dim_type type, struct vars *v,
1417 int rational, int comma)
1418 {
1419 isl_multi_pw_aff *tuple;
1420
1421 tuple = read_tuple(s, v, rational, comma);
1422 if (!tuple)
1423 return isl_map_free(map);
1424
1425 return map_from_tuple(tuple, map, type, v, rational);
1426 }
1427
1428 static __isl_give isl_set *construct_constraints(
1429 __isl_take isl_set *set, int type,
1430 __isl_keep isl_pw_aff_list *left, __isl_keep isl_pw_aff_list *right,
1431 int rational)
1432 {
1433 isl_set *cond;
1434
1435 left = isl_pw_aff_list_copy(left);
1436 right = isl_pw_aff_list_copy(right);
1437 if (rational) {
1438 left = isl_pw_aff_list_set_rational(left);
1439 right = isl_pw_aff_list_set_rational(right);
1440 }
1441 if (type == ISL_TOKEN_LE)
1442 cond = isl_pw_aff_list_le_set(left, right);
1443 else if (type == ISL_TOKEN_GE)
1444 cond = isl_pw_aff_list_ge_set(left, right);
1445 else if (type == ISL_TOKEN_LT)
1446 cond = isl_pw_aff_list_lt_set(left, right);
1447 else if (type == ISL_TOKEN_GT)
1448 cond = isl_pw_aff_list_gt_set(left, right);
1449 else if (type == ISL_TOKEN_NE)
1450 cond = isl_pw_aff_list_ne_set(left, right);
1451 else
1452 cond = isl_pw_aff_list_eq_set(left, right);
1453
1454 return isl_set_intersect(set, cond);
1455 }
1456
1457 static __isl_give isl_map *add_constraint(__isl_keep isl_stream *s,
1458 struct vars *v, __isl_take isl_map *map, int rational)
1459 {
1460 struct isl_token *tok = NULL;
1461 isl_pw_aff_list *list1 = NULL, *list2 = NULL;
1462 isl_set *set;
1463
1464 set = isl_map_wrap(map);
1465 list1 = accept_affine_list(s, isl_set_get_space(set), v);
1466 if (!list1)
1467 goto error;
1468 tok = isl_stream_next_token(s);
1469 if (!is_comparator(tok)) {
1470 isl_stream_error(s, tok, "missing operator");
1471 if (tok)
1472 isl_stream_push_token(s, tok);
1473 tok = NULL;
1474 goto error;
1475 }
1476 for (;;) {
1477 list2 = accept_affine_list(s, isl_set_get_space(set), v);
1478 if (!list2)
1479 goto error;
1480
1481 set = construct_constraints(set, tok->type, list1, list2,
1482 rational);
1483 isl_token_free(tok);
1484 isl_pw_aff_list_free(list1);
1485 list1 = list2;
1486
1487 tok = isl_stream_next_token(s);
1488 if (!is_comparator(tok)) {
1489 if (tok)
1490 isl_stream_push_token(s, tok);
1491 break;
1492 }
1493 }
1494 isl_pw_aff_list_free(list1);
1495
1496 return isl_set_unwrap(set);
1497 error:
1498 if (tok)
1499 isl_token_free(tok);
1500 isl_pw_aff_list_free(list1);
1501 isl_pw_aff_list_free(list2);
1502 isl_set_free(set);
1503 return NULL;
1504 }
1505
1506 static __isl_give isl_map *read_exists(__isl_keep isl_stream *s,
1507 struct vars *v, __isl_take isl_map *map, int rational)
1508 {
1509 int n = v->n;
1510 int seen_paren = isl_stream_eat_if_available(s, '(');
1511
1512 map = isl_map_from_domain(isl_map_wrap(map));
1513 map = read_defined_var_list(s, v, map, rational);
1514
1515 if (isl_stream_eat(s, ':'))
1516 goto error;
1517
1518 map = read_formula(s, v, map, rational);
1519 map = isl_set_unwrap(isl_map_domain(map));
1520
1521 vars_drop(v, v->n - n);
1522 if (seen_paren && isl_stream_eat(s, ')'))
1523 goto error;
1524
1525 return map;
1526 error:
1527 isl_map_free(map);
1528 return NULL;
1529 }
1530
1531 /* Parse an expression between parentheses and push the result
1532 * back on the stream.
1533 *
1534 * The parsed expression may be either an affine expression
1535 * or a condition. The first type is pushed onto the stream
1536 * as an isl_pw_aff, while the second is pushed as an isl_map.
1537 *
1538 * If the initial token indicates the start of a condition,
1539 * we parse it as such.
1540 * Otherwise, we first parse an affine expression and push
1541 * that onto the stream. If the affine expression covers the
1542 * entire expression between parentheses, we return.
1543 * Otherwise, we assume that the affine expression is the
1544 * start of a condition and continue parsing.
1545 */
1546 static int resolve_paren_expr(__isl_keep isl_stream *s,
1547 struct vars *v, __isl_take isl_map *map, int rational)
1548 {
1549 struct isl_token *tok, *tok2;
1550 int line, col;
1551 isl_pw_aff *pwaff;
1552
1553 tok = isl_stream_next_token(s);
1554 if (!tok || tok->type != '(')
1555 goto error;
1556
1557 if (isl_stream_next_token_is(s, '('))
1558 if (resolve_paren_expr(s, v, isl_map_copy(map), rational))
1559 goto error;
1560
1561 if (isl_stream_next_token_is(s, ISL_TOKEN_EXISTS) ||
1562 isl_stream_next_token_is(s, ISL_TOKEN_NOT) ||
1563 isl_stream_next_token_is(s, ISL_TOKEN_TRUE) ||
1564 isl_stream_next_token_is(s, ISL_TOKEN_FALSE) ||
1565 isl_stream_next_token_is(s, ISL_TOKEN_MAP)) {
1566 map = read_formula(s, v, map, rational);
1567 if (isl_stream_eat(s, ')'))
1568 goto error;
1569 tok->type = ISL_TOKEN_MAP;
1570 tok->u.map = map;
1571 isl_stream_push_token(s, tok);
1572 return 0;
1573 }
1574
1575 tok2 = isl_stream_next_token(s);
1576 if (!tok2)
1577 goto error;
1578 line = tok2->line;
1579 col = tok2->col;
1580 isl_stream_push_token(s, tok2);
1581
1582 pwaff = accept_affine(s, isl_space_wrap(isl_map_get_space(map)), v);
1583 if (!pwaff)
1584 goto error;
1585
1586 tok2 = isl_token_new(s->ctx, line, col, 0);
1587 if (!tok2)
1588 goto error2;
1589 tok2->type = ISL_TOKEN_AFF;
1590 tok2->u.pwaff = pwaff;
1591
1592 if (isl_stream_eat_if_available(s, ')')) {
1593 isl_stream_push_token(s, tok2);
1594 isl_token_free(tok);
1595 isl_map_free(map);
1596 return 0;
1597 }
1598
1599 isl_stream_push_token(s, tok2);
1600
1601 map = read_formula(s, v, map, rational);
1602 if (isl_stream_eat(s, ')'))
1603 goto error;
1604
1605 tok->type = ISL_TOKEN_MAP;
1606 tok->u.map = map;
1607 isl_stream_push_token(s, tok);
1608
1609 return 0;
1610 error2:
1611 isl_pw_aff_free(pwaff);
1612 error:
1613 isl_token_free(tok);
1614 isl_map_free(map);
1615 return -1;
1616 }
1617
1618 static __isl_give isl_map *read_conjunct(__isl_keep isl_stream *s,
1619 struct vars *v, __isl_take isl_map *map, int rational)
1620 {
1621 if (isl_stream_next_token_is(s, '('))
1622 if (resolve_paren_expr(s, v, isl_map_copy(map), rational))
1623 goto error;
1624
1625 if (isl_stream_next_token_is(s, ISL_TOKEN_MAP)) {
1626 struct isl_token *tok;
1627 tok = isl_stream_next_token(s);
1628 if (!tok)
1629 goto error;
1630 isl_map_free(map);
1631 map = isl_map_copy(tok->u.map);
1632 isl_token_free(tok);
1633 return map;
1634 }
1635
1636 if (isl_stream_eat_if_available(s, ISL_TOKEN_EXISTS))
1637 return read_exists(s, v, map, rational);
1638
1639 if (isl_stream_eat_if_available(s, ISL_TOKEN_TRUE))
1640 return map;
1641
1642 if (isl_stream_eat_if_available(s, ISL_TOKEN_FALSE)) {
1643 isl_space *dim = isl_map_get_space(map);
1644 isl_map_free(map);
1645 return isl_map_empty(dim);
1646 }
1647
1648 return add_constraint(s, v, map, rational);
1649 error:
1650 isl_map_free(map);
1651 return NULL;
1652 }
1653
1654 static __isl_give isl_map *read_conjuncts(__isl_keep isl_stream *s,
1655 struct vars *v, __isl_take isl_map *map, int rational)
1656 {
1657 isl_map *res;
1658 int negate;
1659
1660 negate = isl_stream_eat_if_available(s, ISL_TOKEN_NOT);
1661 res = read_conjunct(s, v, isl_map_copy(map), rational);
1662 if (negate)
1663 res = isl_map_subtract(isl_map_copy(map), res);
1664
1665 while (res && isl_stream_eat_if_available(s, ISL_TOKEN_AND)) {
1666 isl_map *res_i;
1667
1668 negate = isl_stream_eat_if_available(s, ISL_TOKEN_NOT);
1669 res_i = read_conjunct(s, v, isl_map_copy(map), rational);
1670 if (negate)
1671 res = isl_map_subtract(res, res_i);
1672 else
1673 res = isl_map_intersect(res, res_i);
1674 }
1675
1676 isl_map_free(map);
1677 return res;
1678 }
1679
1680 static struct isl_map *read_disjuncts(__isl_keep isl_stream *s,
1681 struct vars *v, __isl_take isl_map *map, int rational)
1682 {
1683 isl_map *res;
1684
1685 if (isl_stream_next_token_is(s, '}')) {
1686 isl_space *dim = isl_map_get_space(map);
1687 isl_map_free(map);
1688 return isl_map_universe(dim);
1689 }
1690
1691 res = read_conjuncts(s, v, isl_map_copy(map), rational);
1692 while (isl_stream_eat_if_available(s, ISL_TOKEN_OR)) {
1693 isl_map *res_i;
1694
1695 res_i = read_conjuncts(s, v, isl_map_copy(map), rational);
1696 res = isl_map_union(res, res_i);
1697 }
1698
1699 isl_map_free(map);
1700 return res;
1701 }
1702
1703 /* Read a first order formula from "s", add the corresponding
1704 * constraints to "map" and return the result.
1705 *
1706 * In particular, read a formula of the form
1707 *
1708 * a
1709 *
1710 * or
1711 *
1712 * a implies b
1713 *
1714 * where a and b are disjunctions.
1715 *
1716 * In the first case, map is replaced by
1717 *
1718 * map \cap { [..] : a }
1719 *
1720 * In the second case, it is replaced by
1721 *
1722 * (map \setminus { [..] : a}) \cup (map \cap { [..] : b })
1723 */
1724 static __isl_give isl_map *read_formula(__isl_keep isl_stream *s,
1725 struct vars *v, __isl_take isl_map *map, int rational)
1726 {
1727 isl_map *res;
1728
1729 res = read_disjuncts(s, v, isl_map_copy(map), rational);
1730
1731 if (isl_stream_eat_if_available(s, ISL_TOKEN_IMPLIES)) {
1732 isl_map *res2;
1733
1734 res = isl_map_subtract(isl_map_copy(map), res);
1735 res2 = read_disjuncts(s, v, map, rational);
1736 res = isl_map_union(res, res2);
1737 } else
1738 isl_map_free(map);
1739
1740 return res;
1741 }
1742
1743 static int polylib_pos_to_isl_pos(__isl_keep isl_basic_map *bmap, int pos)
1744 {
1745 if (pos < isl_basic_map_dim(bmap, isl_dim_out))
1746 return 1 + isl_basic_map_dim(bmap, isl_dim_param) +
1747 isl_basic_map_dim(bmap, isl_dim_in) + pos;
1748 pos -= isl_basic_map_dim(bmap, isl_dim_out);
1749
1750 if (pos < isl_basic_map_dim(bmap, isl_dim_in))
1751 return 1 + isl_basic_map_dim(bmap, isl_dim_param) + pos;
1752 pos -= isl_basic_map_dim(bmap, isl_dim_in);
1753
1754 if (pos < isl_basic_map_dim(bmap, isl_dim_div))
1755 return 1 + isl_basic_map_dim(bmap, isl_dim_param) +
1756 isl_basic_map_dim(bmap, isl_dim_in) +
1757 isl_basic_map_dim(bmap, isl_dim_out) + pos;
1758 pos -= isl_basic_map_dim(bmap, isl_dim_div);
1759
1760 if (pos < isl_basic_map_dim(bmap, isl_dim_param))
1761 return 1 + pos;
1762
1763 return 0;
1764 }
1765
1766 static __isl_give isl_basic_map *basic_map_read_polylib_constraint(
1767 __isl_keep isl_stream *s, __isl_take isl_basic_map *bmap)
1768 {
1769 int j;
1770 struct isl_token *tok;
1771 int type;
1772 int k;
1773 isl_int *c;
1774 unsigned nparam;
1775 unsigned dim;
1776
1777 if (!bmap)
1778 return NULL;
1779
1780 nparam = isl_basic_map_dim(bmap, isl_dim_param);
1781 dim = isl_basic_map_dim(bmap, isl_dim_out);
1782
1783 tok = isl_stream_next_token(s);
1784 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1785 isl_stream_error(s, tok, "expecting coefficient");
1786 if (tok)
1787 isl_stream_push_token(s, tok);
1788 goto error;
1789 }
1790 if (!tok->on_new_line) {
1791 isl_stream_error(s, tok, "coefficient should appear on new line");
1792 isl_stream_push_token(s, tok);
1793 goto error;
1794 }
1795
1796 type = isl_int_get_si(tok->u.v);
1797 isl_token_free(tok);
1798
1799 isl_assert(s->ctx, type == 0 || type == 1, goto error);
1800 if (type == 0) {
1801 k = isl_basic_map_alloc_equality(bmap);
1802 c = bmap->eq[k];
1803 } else {
1804 k = isl_basic_map_alloc_inequality(bmap);
1805 c = bmap->ineq[k];
1806 }
1807 if (k < 0)
1808 goto error;
1809
1810 for (j = 0; j < 1 + isl_basic_map_total_dim(bmap); ++j) {
1811 int pos;
1812 tok = isl_stream_next_token(s);
1813 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1814 isl_stream_error(s, tok, "expecting coefficient");
1815 if (tok)
1816 isl_stream_push_token(s, tok);
1817 goto error;
1818 }
1819 if (tok->on_new_line) {
1820 isl_stream_error(s, tok,
1821 "coefficient should not appear on new line");
1822 isl_stream_push_token(s, tok);
1823 goto error;
1824 }
1825 pos = polylib_pos_to_isl_pos(bmap, j);
1826 isl_int_set(c[pos], tok->u.v);
1827 isl_token_free(tok);
1828 }
1829
1830 return bmap;
1831 error:
1832 isl_basic_map_free(bmap);
1833 return NULL;
1834 }
1835
1836 static __isl_give isl_basic_map *basic_map_read_polylib(
1837 __isl_keep isl_stream *s)
1838 {
1839 int i;
1840 struct isl_token *tok;
1841 struct isl_token *tok2;
1842 int n_row, n_col;
1843 int on_new_line;
1844 unsigned in = 0, out, local = 0;
1845 struct isl_basic_map *bmap = NULL;
1846 int nparam = 0;
1847
1848 tok = isl_stream_next_token(s);
1849 if (!tok) {
1850 isl_stream_error(s, NULL, "unexpected EOF");
1851 return NULL;
1852 }
1853 tok2 = isl_stream_next_token(s);
1854 if (!tok2) {
1855 isl_token_free(tok);
1856 isl_stream_error(s, NULL, "unexpected EOF");
1857 return NULL;
1858 }
1859 if (tok->type != ISL_TOKEN_VALUE || tok2->type != ISL_TOKEN_VALUE) {
1860 isl_stream_push_token(s, tok2);
1861 isl_stream_push_token(s, tok);
1862 isl_stream_error(s, NULL,
1863 "expecting constraint matrix dimensions");
1864 return NULL;
1865 }
1866 n_row = isl_int_get_si(tok->u.v);
1867 n_col = isl_int_get_si(tok2->u.v);
1868 on_new_line = tok2->on_new_line;
1869 isl_token_free(tok2);
1870 isl_token_free(tok);
1871 isl_assert(s->ctx, !on_new_line, return NULL);
1872 isl_assert(s->ctx, n_row >= 0, return NULL);
1873 isl_assert(s->ctx, n_col >= 2 + nparam, return NULL);
1874 tok = isl_stream_next_token_on_same_line(s);
1875 if (tok) {
1876 if (tok->type != ISL_TOKEN_VALUE) {
1877 isl_stream_error(s, tok,
1878 "expecting number of output dimensions");
1879 isl_stream_push_token(s, tok);
1880 goto error;
1881 }
1882 out = isl_int_get_si(tok->u.v);
1883 isl_token_free(tok);
1884
1885 tok = isl_stream_next_token_on_same_line(s);
1886 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1887 isl_stream_error(s, tok,
1888 "expecting number of input dimensions");
1889 if (tok)
1890 isl_stream_push_token(s, tok);
1891 goto error;
1892 }
1893 in = isl_int_get_si(tok->u.v);
1894 isl_token_free(tok);
1895
1896 tok = isl_stream_next_token_on_same_line(s);
1897 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1898 isl_stream_error(s, tok,
1899 "expecting number of existentials");
1900 if (tok)
1901 isl_stream_push_token(s, tok);
1902 goto error;
1903 }
1904 local = isl_int_get_si(tok->u.v);
1905 isl_token_free(tok);
1906
1907 tok = isl_stream_next_token_on_same_line(s);
1908 if (!tok || tok->type != ISL_TOKEN_VALUE) {
1909 isl_stream_error(s, tok,
1910 "expecting number of parameters");
1911 if (tok)
1912 isl_stream_push_token(s, tok);
1913 goto error;
1914 }
1915 nparam = isl_int_get_si(tok->u.v);
1916 isl_token_free(tok);
1917 if (n_col != 1 + out + in + local + nparam + 1) {
1918 isl_stream_error(s, NULL,
1919 "dimensions don't match");
1920 goto error;
1921 }
1922 } else
1923 out = n_col - 2 - nparam;
1924 bmap = isl_basic_map_alloc(s->ctx, nparam, in, out, local, n_row, n_row);
1925 if (!bmap)
1926 return NULL;
1927
1928 for (i = 0; i < local; ++i) {
1929 int k = isl_basic_map_alloc_div(bmap);
1930 if (k < 0)
1931 goto error;
1932 isl_seq_clr(bmap->div[k], 1 + 1 + nparam + in + out + local);
1933 }
1934
1935 for (i = 0; i < n_row; ++i)
1936 bmap = basic_map_read_polylib_constraint(s, bmap);
1937
1938 tok = isl_stream_next_token_on_same_line(s);
1939 if (tok) {
1940 isl_stream_error(s, tok, "unexpected extra token on line");
1941 isl_stream_push_token(s, tok);
1942 goto error;
1943 }
1944
1945 bmap = isl_basic_map_simplify(bmap);
1946 bmap = isl_basic_map_finalize(bmap);
1947 return bmap;
1948 error:
1949 isl_basic_map_free(bmap);
1950 return NULL;
1951 }
1952
1953 static struct isl_map *map_read_polylib(__isl_keep isl_stream *s)
1954 {
1955 struct isl_token *tok;
1956 struct isl_token *tok2;
1957 int i, n;
1958 struct isl_map *map;
1959
1960 tok = isl_stream_next_token(s);
1961 if (!tok) {
1962 isl_stream_error(s, NULL, "unexpected EOF");
1963 return NULL;
1964 }
1965 tok2 = isl_stream_next_token_on_same_line(s);
1966 if (tok2 && tok2->type == ISL_TOKEN_VALUE) {
1967 isl_stream_push_token(s, tok2);
1968 isl_stream_push_token(s, tok);
1969 return isl_map_from_basic_map(basic_map_read_polylib(s));
1970 }
1971 if (tok2) {
1972 isl_stream_error(s, tok2, "unexpected token");
1973 isl_stream_push_token(s, tok2);
1974 isl_stream_push_token(s, tok);
1975 return NULL;
1976 }
1977 n = isl_int_get_si(tok->u.v);
1978 isl_token_free(tok);
1979
1980 isl_assert(s->ctx, n >= 1, return NULL);
1981
1982 map = isl_map_from_basic_map(basic_map_read_polylib(s));
1983
1984 for (i = 1; map && i < n; ++i)
1985 map = isl_map_union(map,
1986 isl_map_from_basic_map(basic_map_read_polylib(s)));
1987
1988 return map;
1989 }
1990
1991 static int optional_power(__isl_keep isl_stream *s)
1992 {
1993 int pow;
1994 struct isl_token *tok;
1995
1996 tok = isl_stream_next_token(s);
1997 if (!tok)
1998 return 1;
1999 if (tok->type != '^') {
2000 isl_stream_push_token(s, tok);
2001 return 1;
2002 }
2003 isl_token_free(tok);
2004 tok = isl_stream_next_token(s);
2005 if (!tok || tok->type != ISL_TOKEN_VALUE) {
2006 isl_stream_error(s, tok, "expecting exponent");
2007 if (tok)
2008 isl_stream_push_token(s, tok);
2009 return 1;
2010 }
2011 pow = isl_int_get_si(tok->u.v);
2012 isl_token_free(tok);
2013 return pow;
2014 }
2015
2016 static __isl_give isl_pw_qpolynomial *read_term(__isl_keep isl_stream *s,
2017 __isl_keep isl_map *map, struct vars *v);
2018
2019 static __isl_give isl_pw_qpolynomial *read_factor(__isl_keep isl_stream *s,
2020 __isl_keep isl_map *map, struct vars *v)
2021 {
2022 isl_pw_qpolynomial *pwqp;
2023 struct isl_token *tok;
2024
2025 tok = next_token(s);
2026 if (!tok) {
2027 isl_stream_error(s, NULL, "unexpected EOF");
2028 return NULL;
2029 }
2030 if (tok->type == '(') {
2031 int pow;
2032
2033 isl_token_free(tok);
2034 pwqp = read_term(s, map, v);
2035 if (!pwqp)
2036 return NULL;
2037 if (isl_stream_eat(s, ')'))
2038 goto error;
2039 pow = optional_power(s);
2040 pwqp = isl_pw_qpolynomial_pow(pwqp, pow);
2041 } else if (tok->type == ISL_TOKEN_VALUE) {
2042 struct isl_token *tok2;
2043 isl_qpolynomial *qp;
2044
2045 tok2 = isl_stream_next_token(s);
2046 if (tok2 && tok2->type == '/') {
2047 isl_token_free(tok2);
2048 tok2 = next_token(s);
2049 if (!tok2 || tok2->type != ISL_TOKEN_VALUE) {
2050 isl_stream_error(s, tok2, "expected denominator");
2051 isl_token_free(tok);
2052 isl_token_free(tok2);
2053 return NULL;
2054 }
2055 qp = isl_qpolynomial_rat_cst_on_domain(isl_map_get_space(map),
2056 tok->u.v, tok2->u.v);
2057 isl_token_free(tok2);
2058 } else {
2059 isl_stream_push_token(s, tok2);
2060 qp = isl_qpolynomial_cst_on_domain(isl_map_get_space(map),
2061 tok->u.v);
2062 }
2063 isl_token_free(tok);
2064 pwqp = isl_pw_qpolynomial_from_qpolynomial(qp);
2065 } else if (tok->type == ISL_TOKEN_INFTY) {
2066 isl_qpolynomial *qp;
2067 isl_token_free(tok);
2068 qp = isl_qpolynomial_infty_on_domain(isl_map_get_space(map));
2069 pwqp = isl_pw_qpolynomial_from_qpolynomial(qp);
2070 } else if (tok->type == ISL_TOKEN_NAN) {
2071 isl_qpolynomial *qp;
2072 isl_token_free(tok);
2073 qp = isl_qpolynomial_nan_on_domain(isl_map_get_space(map));
2074 pwqp = isl_pw_qpolynomial_from_qpolynomial(qp);
2075 } else if (tok->type == ISL_TOKEN_IDENT) {
2076 int n = v->n;
2077 int pos = vars_pos(v, tok->u.s, -1);
2078 int pow;
2079 isl_qpolynomial *qp;
2080 if (pos < 0) {
2081 isl_token_free(tok);
2082 return NULL;
2083 }
2084 if (pos >= n) {
2085 vars_drop(v, v->n - n);
2086 isl_stream_error(s, tok, "unknown identifier");
2087 isl_token_free(tok);
2088 return NULL;
2089 }
2090 isl_token_free(tok);
2091 pow = optional_power(s);
2092 qp = isl_qpolynomial_var_pow_on_domain(isl_map_get_space(map), pos, pow);
2093 pwqp = isl_pw_qpolynomial_from_qpolynomial(qp);
2094 } else if (is_start_of_div(tok)) {
2095 isl_pw_aff *pwaff;
2096 int pow;
2097
2098 isl_stream_push_token(s, tok);
2099 pwaff = accept_div(s, isl_map_get_space(map), v);
2100 pow = optional_power(s);
2101 pwqp = isl_pw_qpolynomial_from_pw_aff(pwaff);
2102 pwqp = isl_pw_qpolynomial_pow(pwqp, pow);
2103 } else if (tok->type == '-') {
2104 isl_token_free(tok);
2105 pwqp = read_factor(s, map, v);
2106 pwqp = isl_pw_qpolynomial_neg(pwqp);
2107 } else {
2108 isl_stream_error(s, tok, "unexpected isl_token");
2109 isl_stream_push_token(s, tok);
2110 return NULL;
2111 }
2112
2113 if (isl_stream_eat_if_available(s, '*') ||
2114 isl_stream_next_token_is(s, ISL_TOKEN_IDENT)) {
2115 isl_pw_qpolynomial *pwqp2;
2116
2117 pwqp2 = read_factor(s, map, v);
2118 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp2);
2119 }
2120
2121 return pwqp;
2122 error:
2123 isl_pw_qpolynomial_free(pwqp);
2124 return NULL;
2125 }
2126
2127 static __isl_give isl_pw_qpolynomial *read_term(__isl_keep isl_stream *s,
2128 __isl_keep isl_map *map, struct vars *v)
2129 {
2130 struct isl_token *tok;
2131 isl_pw_qpolynomial *pwqp;
2132
2133 pwqp = read_factor(s, map, v);
2134
2135 for (;;) {
2136 tok = next_token(s);
2137 if (!tok)
2138 return pwqp;
2139
2140 if (tok->type == '+') {
2141 isl_pw_qpolynomial *pwqp2;
2142
2143 isl_token_free(tok);
2144 pwqp2 = read_factor(s, map, v);
2145 pwqp = isl_pw_qpolynomial_add(pwqp, pwqp2);
2146 } else if (tok->type == '-') {
2147 isl_pw_qpolynomial *pwqp2;
2148
2149 isl_token_free(tok);
2150 pwqp2 = read_factor(s, map, v);
2151 pwqp = isl_pw_qpolynomial_sub(pwqp, pwqp2);
2152 } else if (tok->type == ISL_TOKEN_VALUE &&
2153 isl_int_is_neg(tok->u.v)) {
2154 isl_pw_qpolynomial *pwqp2;
2155
2156 isl_stream_push_token(s, tok);
2157 pwqp2 = read_factor(s, map, v);
2158 pwqp = isl_pw_qpolynomial_add(pwqp, pwqp2);
2159 } else {
2160 isl_stream_push_token(s, tok);
2161 break;
2162 }
2163 }
2164
2165 return pwqp;
2166 }
2167
2168 static __isl_give isl_map *read_optional_formula(__isl_keep isl_stream *s,
2169 __isl_take isl_map *map, struct vars *v, int rational)
2170 {
2171 struct isl_token *tok;
2172
2173 tok = isl_stream_next_token(s);
2174 if (!tok) {
2175 isl_stream_error(s, NULL, "unexpected EOF");
2176 goto error;
2177 }
2178 if (tok->type == ':' ||
2179 (tok->type == ISL_TOKEN_OR && !strcmp(tok->u.s, "|"))) {
2180 isl_token_free(tok);
2181 map = read_formula(s, v, map, rational);
2182 } else
2183 isl_stream_push_token(s, tok);
2184
2185 return map;
2186 error:
2187 isl_map_free(map);
2188 return NULL;
2189 }
2190
2191 static struct isl_obj obj_read_poly(__isl_keep isl_stream *s,
2192 __isl_take isl_map *map, struct vars *v, int n)
2193 {
2194 struct isl_obj obj = { isl_obj_pw_qpolynomial, NULL };
2195 isl_pw_qpolynomial *pwqp;
2196 struct isl_set *set;
2197
2198 pwqp = read_term(s, map, v);
2199 map = read_optional_formula(s, map, v, 0);
2200 set = isl_map_range(map);
2201
2202 pwqp = isl_pw_qpolynomial_intersect_domain(pwqp, set);
2203
2204 vars_drop(v, v->n - n);
2205
2206 obj.v = pwqp;
2207 return obj;
2208 }
2209
2210 static struct isl_obj obj_read_poly_or_fold(__isl_keep isl_stream *s,
2211 __isl_take isl_set *set, struct vars *v, int n)
2212 {
2213 struct isl_obj obj = { isl_obj_pw_qpolynomial_fold, NULL };
2214 isl_pw_qpolynomial *pwqp;
2215 isl_pw_qpolynomial_fold *pwf = NULL;
2216
2217 if (!isl_stream_eat_if_available(s, ISL_TOKEN_MAX))
2218 return obj_read_poly(s, set, v, n);
2219
2220 if (isl_stream_eat(s, '('))
2221 goto error;
2222
2223 pwqp = read_term(s, set, v);
2224 pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max, pwqp);
2225
2226 while (isl_stream_eat_if_available(s, ',')) {
2227 isl_pw_qpolynomial_fold *pwf_i;
2228 pwqp = read_term(s, set, v);
2229 pwf_i = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max,
2230 pwqp);
2231 pwf = isl_pw_qpolynomial_fold_fold(pwf, pwf_i);
2232 }
2233
2234 if (isl_stream_eat(s, ')'))
2235 goto error;
2236
2237 set = read_optional_formula(s, set, v, 0);
2238 pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, set);
2239
2240 vars_drop(v, v->n - n);
2241
2242 obj.v = pwf;
2243 return obj;
2244 error:
2245 isl_set_free(set);
2246 isl_pw_qpolynomial_fold_free(pwf);
2247 obj.type = isl_obj_none;
2248 return obj;
2249 }
2250
2251 static int is_rational(__isl_keep isl_stream *s)
2252 {
2253 struct isl_token *tok;
2254
2255 tok = isl_stream_next_token(s);
2256 if (!tok)
2257 return 0;
2258 if (tok->type == ISL_TOKEN_RAT && isl_stream_next_token_is(s, ':')) {
2259 isl_token_free(tok);
2260 isl_stream_eat(s, ':');
2261 return 1;
2262 }
2263
2264 isl_stream_push_token(s, tok);
2265
2266 return 0;
2267 }
2268
2269 static struct isl_obj obj_read_body(__isl_keep isl_stream *s,
2270 __isl_take isl_map *map, struct vars *v)
2271 {
2272 struct isl_token *tok;
2273 struct isl_obj obj = { isl_obj_set, NULL };
2274 int n = v->n;
2275 int rational;
2276
2277 rational = is_rational(s);
2278 if (rational)
2279 map = isl_map_set_rational(map);
2280
2281 if (isl_stream_next_token_is(s, ':')) {
2282 obj.type = isl_obj_set;
2283 obj.v = read_optional_formula(s, map, v, rational);
2284 return obj;
2285 }
2286
2287 if (!next_is_tuple(s))
2288 return obj_read_poly_or_fold(s, map, v, n);
2289
2290 map = read_map_tuple(s, map, isl_dim_in, v, rational, 0);
2291 if (!map)
2292 goto error;
2293 tok = isl_stream_next_token(s);
2294 if (!tok)
2295 goto error;
2296 if (tok->type == ISL_TOKEN_TO) {
2297 obj.type = isl_obj_map;
2298 isl_token_free(tok);
2299 if (!next_is_tuple(s)) {
2300 isl_set *set = isl_map_domain(map);
2301 return obj_read_poly_or_fold(s, set, v, n);
2302 }
2303 map = read_map_tuple(s, map, isl_dim_out, v, rational, 0);
2304 if (!map)
2305 goto error;
2306 } else {
2307 map = isl_map_domain(map);
2308 isl_stream_push_token(s, tok);
2309 }
2310
2311 map = read_optional_formula(s, map, v, rational);
2312
2313 vars_drop(v, v->n - n);
2314
2315 obj.v = map;
2316 return obj;
2317 error:
2318 isl_map_free(map);
2319 obj.type = isl_obj_none;
2320 return obj;
2321 }
2322
2323 static struct isl_obj to_union(isl_ctx *ctx, struct isl_obj obj)
2324 {
2325 if (obj.type == isl_obj_map) {
2326 obj.v = isl_union_map_from_map(obj.v);
2327 obj.type = isl_obj_union_map;
2328 } else if (obj.type == isl_obj_set) {
2329 obj.v = isl_union_set_from_set(obj.v);
2330 obj.type = isl_obj_union_set;
2331 } else if (obj.type == isl_obj_pw_qpolynomial) {
2332 obj.v = isl_union_pw_qpolynomial_from_pw_qpolynomial(obj.v);
2333 obj.type = isl_obj_union_pw_qpolynomial;
2334 } else if (obj.type == isl_obj_pw_qpolynomial_fold) {
2335 obj.v = isl_union_pw_qpolynomial_fold_from_pw_qpolynomial_fold(obj.v);
2336 obj.type = isl_obj_union_pw_qpolynomial_fold;
2337 } else
2338 isl_assert(ctx, 0, goto error);
2339 return obj;
2340 error:
2341 obj.type->free(obj.v);
2342 obj.type = isl_obj_none;
2343 return obj;
2344 }
2345
2346 static struct isl_obj obj_add(struct isl_ctx *ctx,
2347 struct isl_obj obj1, struct isl_obj obj2)
2348 {
2349 if (obj1.type == isl_obj_set && obj2.type == isl_obj_union_set)
2350 obj1 = to_union(ctx, obj1);
2351 if (obj1.type == isl_obj_union_set && obj2.type == isl_obj_set)
2352 obj2 = to_union(ctx, obj2);
2353 if (obj1.type == isl_obj_map && obj2.type == isl_obj_union_map)
2354 obj1 = to_union(ctx, obj1);
2355 if (obj1.type == isl_obj_union_map && obj2.type == isl_obj_map)
2356 obj2 = to_union(ctx, obj2);
2357 if (obj1.type == isl_obj_pw_qpolynomial &&
2358 obj2.type == isl_obj_union_pw_qpolynomial)
2359 obj1 = to_union(ctx, obj1);
2360 if (obj1.type == isl_obj_union_pw_qpolynomial &&
2361 obj2.type == isl_obj_pw_qpolynomial)
2362 obj2 = to_union(ctx, obj2);
2363 if (obj1.type == isl_obj_pw_qpolynomial_fold &&
2364 obj2.type == isl_obj_union_pw_qpolynomial_fold)
2365 obj1 = to_union(ctx, obj1);
2366 if (obj1.type == isl_obj_union_pw_qpolynomial_fold &&
2367 obj2.type == isl_obj_pw_qpolynomial_fold)
2368 obj2 = to_union(ctx, obj2);
2369 isl_assert(ctx, obj1.type == obj2.type, goto error);
2370 if (obj1.type == isl_obj_map && !isl_map_has_equal_space(obj1.v, obj2.v)) {
2371 obj1 = to_union(ctx, obj1);
2372 obj2 = to_union(ctx, obj2);
2373 }
2374 if (obj1.type == isl_obj_set && !isl_set_has_equal_space(obj1.v, obj2.v)) {
2375 obj1 = to_union(ctx, obj1);
2376 obj2 = to_union(ctx, obj2);
2377 }
2378 if (obj1.type == isl_obj_pw_qpolynomial &&
2379 !isl_pw_qpolynomial_has_equal_space(obj1.v, obj2.v)) {
2380 obj1 = to_union(ctx, obj1);
2381 obj2 = to_union(ctx, obj2);
2382 }
2383 if (obj1.type == isl_obj_pw_qpolynomial_fold &&
2384 !isl_pw_qpolynomial_fold_has_equal_space(obj1.v, obj2.v)) {
2385 obj1 = to_union(ctx, obj1);
2386 obj2 = to_union(ctx, obj2);
2387 }
2388 obj1.v = obj1.type->add(obj1.v, obj2.v);
2389 return obj1;
2390 error:
2391 obj1.type->free(obj1.v);
2392 obj2.type->free(obj2.v);
2393 obj1.type = isl_obj_none;
2394 obj1.v = NULL;
2395 return obj1;
2396 }
2397
2398 static struct isl_obj obj_read(__isl_keep isl_stream *s)
2399 {
2400 isl_map *map = NULL;
2401 struct isl_token *tok;
2402 struct vars *v = NULL;
2403 struct isl_obj obj = { isl_obj_set, NULL };
2404
2405 tok = next_token(s);
2406 if (!tok) {
2407 isl_stream_error(s, NULL, "unexpected EOF");
2408 goto error;
2409 }
2410 if (tok->type == ISL_TOKEN_VALUE) {
2411 struct isl_token *tok2;
2412 struct isl_map *map;
2413
2414 tok2 = isl_stream_next_token(s);
2415 if (!tok2 || tok2->type != ISL_TOKEN_VALUE ||
2416 isl_int_is_neg(tok2->u.v)) {
2417 if (tok2)
2418 isl_stream_push_token(s, tok2);
2419 obj.type = isl_obj_val;
2420 obj.v = isl_val_int_from_isl_int(s->ctx, tok->u.v);
2421 isl_token_free(tok);
2422 return obj;
2423 }
2424 isl_stream_push_token(s, tok2);
2425 isl_stream_push_token(s, tok);
2426 map = map_read_polylib(s);
2427 if (!map)
2428 goto error;
2429 if (isl_map_may_be_set(map))
2430 obj.v = isl_map_range(map);
2431 else {
2432 obj.type = isl_obj_map;
2433 obj.v = map;
2434 }
2435 return obj;
2436 }
2437 v = vars_new(s->ctx);
2438 if (!v) {
2439 isl_stream_push_token(s, tok);
2440 goto error;
2441 }
2442 map = isl_map_universe(isl_space_params_alloc(s->ctx, 0));
2443 if (tok->type == '[') {
2444 isl_stream_push_token(s, tok);
2445 map = read_map_tuple(s, map, isl_dim_param, v, 0, 0);
2446 if (!map)
2447 goto error;
2448 tok = isl_stream_next_token(s);
2449 if (!tok || tok->type != ISL_TOKEN_TO) {
2450 isl_stream_error(s, tok, "expecting '->'");
2451 if (tok)
2452 isl_stream_push_token(s, tok);
2453 goto error;
2454 }
2455 isl_token_free(tok);
2456 tok = isl_stream_next_token(s);
2457 }
2458 if (!tok || tok->type != '{') {
2459 isl_stream_error(s, tok, "expecting '{'");
2460 if (tok)
2461 isl_stream_push_token(s, tok);
2462 goto error;
2463 }
2464 isl_token_free(tok);
2465
2466 tok = isl_stream_next_token(s);
2467 if (!tok)
2468 ;
2469 else if (tok->type == ISL_TOKEN_IDENT && !strcmp(tok->u.s, "Sym")) {
2470 isl_token_free(tok);
2471 if (isl_stream_eat(s, '='))
2472 goto error;
2473 map = read_map_tuple(s, map, isl_dim_param, v, 0, 1);
2474 if (!map)
2475 goto error;
2476 } else if (tok->type == '}') {
2477 obj.type = isl_obj_union_set;
2478 obj.v = isl_union_set_empty(isl_map_get_space(map));
2479 isl_token_free(tok);
2480 goto done;
2481 } else
2482 isl_stream_push_token(s, tok);
2483
2484 for (;;) {
2485 struct isl_obj o;
2486 tok = NULL;
2487 o = obj_read_body(s, isl_map_copy(map), v);
2488 if (o.type == isl_obj_none || !o.v)
2489 goto error;
2490 if (!obj.v)
2491 obj = o;
2492 else {
2493 obj = obj_add(s->ctx, obj, o);
2494 if (obj.type == isl_obj_none || !obj.v)
2495 goto error;
2496 }
2497 tok = isl_stream_next_token(s);
2498 if (!tok || tok->type != ';')
2499 break;
2500 isl_token_free(tok);
2501 if (isl_stream_next_token_is(s, '}')) {
2502 tok = isl_stream_next_token(s);
2503 break;
2504 }
2505 }
2506
2507 if (tok && tok->type == '}') {
2508 isl_token_free(tok);
2509 } else {
2510 isl_stream_error(s, tok, "unexpected isl_token");
2511 if (tok)
2512 isl_token_free(tok);
2513 goto error;
2514 }
2515 done:
2516 vars_free(v);
2517 isl_map_free(map);
2518
2519 return obj;
2520 error:
2521 isl_map_free(map);
2522 obj.type->free(obj.v);
2523 if (v)
2524 vars_free(v);
2525 obj.v = NULL;
2526 return obj;
2527 }
2528
2529 struct isl_obj isl_stream_read_obj(__isl_keep isl_stream *s)
2530 {
2531 return obj_read(s);
2532 }
2533
2534 __isl_give isl_map *isl_stream_read_map(__isl_keep isl_stream *s)
2535 {
2536 struct isl_obj obj;
2537
2538 obj = obj_read(s);
2539 if (obj.v)
2540 isl_assert(s->ctx, obj.type == isl_obj_map ||
2541 obj.type == isl_obj_set, goto error);
2542
2543 if (obj.type == isl_obj_set)
2544 obj.v = isl_map_from_range(obj.v);
2545
2546 return obj.v;
2547 error:
2548 obj.type->free(obj.v);
2549 return NULL;
2550 }
2551
2552 __isl_give isl_set *isl_stream_read_set(__isl_keep isl_stream *s)
2553 {
2554 struct isl_obj obj;
2555
2556 obj = obj_read(s);
2557 if (obj.v) {
2558 if (obj.type == isl_obj_map && isl_map_may_be_set(obj.v)) {
2559 obj.v = isl_map_range(obj.v);
2560 obj.type = isl_obj_set;
2561 }
2562 isl_assert(s->ctx, obj.type == isl_obj_set, goto error);
2563 }
2564
2565 return obj.v;
2566 error:
2567 obj.type->free(obj.v);
2568 return NULL;
2569 }
2570
2571 __isl_give isl_union_map *isl_stream_read_union_map(__isl_keep isl_stream *s)
2572 {
2573 struct isl_obj obj;
2574
2575 obj = obj_read(s);
2576 if (obj.type == isl_obj_map) {
2577 obj.type = isl_obj_union_map;
2578 obj.v = isl_union_map_from_map(obj.v);
2579 }
2580 if (obj.type == isl_obj_set) {
2581 obj.type = isl_obj_union_set;
2582 obj.v = isl_union_set_from_set(obj.v);
2583 }
2584 if (obj.v && obj.type == isl_obj_union_set &&
2585 isl_union_set_is_empty(obj.v))
2586 obj.type = isl_obj_union_map;
2587 if (obj.v && obj.type != isl_obj_union_map)
2588 isl_die(s->ctx, isl_error_invalid, "invalid input", goto error);
2589
2590 return obj.v;
2591 error:
2592 obj.type->free(obj.v);
2593 return NULL;
2594 }
2595
2596 __isl_give isl_union_set *isl_stream_read_union_set(__isl_keep isl_stream *s)
2597 {
2598 struct isl_obj obj;
2599
2600 obj = obj_read(s);
2601 if (obj.type == isl_obj_set) {
2602 obj.type = isl_obj_union_set;
2603 obj.v = isl_union_set_from_set(obj.v);
2604 }
2605 if (obj.v)
2606 isl_assert(s->ctx, obj.type == isl_obj_union_set, goto error);
2607
2608 return obj.v;
2609 error:
2610 obj.type->free(obj.v);
2611 return NULL;
2612 }
2613
2614 static __isl_give isl_basic_map *basic_map_read(__isl_keep isl_stream *s)
2615 {
2616 struct isl_obj obj;
2617 struct isl_map *map;
2618 struct isl_basic_map *bmap;
2619
2620 obj = obj_read(s);
2621 if (obj.v && (obj.type != isl_obj_map && obj.type != isl_obj_set))
2622 isl_die(s->ctx, isl_error_invalid, "not a (basic) set or map",
2623 goto error);
2624 map = obj.v;
2625 if (!map)
2626 return NULL;
2627
2628 if (map->n > 1)
2629 isl_die(s->ctx, isl_error_invalid,
2630 "set or map description involves "
2631 "more than one disjunct", goto error);
2632
2633 if (map->n == 0)
2634 bmap = isl_basic_map_empty_like_map(map);
2635 else
2636 bmap = isl_basic_map_copy(map->p[0]);
2637
2638 isl_map_free(map);
2639
2640 return bmap;
2641 error:
2642 obj.type->free(obj.v);
2643 return NULL;
2644 }
2645
2646 static __isl_give isl_basic_set *basic_set_read(__isl_keep isl_stream *s)
2647 {
2648 isl_basic_map *bmap;
2649 bmap = basic_map_read(s);
2650 if (!bmap)
2651 return NULL;
2652 if (!isl_basic_map_may_be_set(bmap))
2653 isl_die(s->ctx, isl_error_invalid,
2654 "input is not a set", goto error);
2655 return isl_basic_map_range(bmap);
2656 error:
2657 isl_basic_map_free(bmap);
2658 return NULL;
2659 }
2660
2661 __isl_give isl_basic_map *isl_basic_map_read_from_file(isl_ctx *ctx,
2662 FILE *input)
2663 {
2664 struct isl_basic_map *bmap;
2665 isl_stream *s = isl_stream_new_file(ctx, input);
2666 if (!s)
2667 return NULL;
2668 bmap = basic_map_read(s);
2669 isl_stream_free(s);
2670 return bmap;
2671 }
2672
2673 __isl_give isl_basic_set *isl_basic_set_read_from_file(isl_ctx *ctx,
2674 FILE *input)
2675 {
2676 isl_basic_set *bset;
2677 isl_stream *s = isl_stream_new_file(ctx, input);
2678 if (!s)
2679 return NULL;
2680 bset = basic_set_read(s);
2681 isl_stream_free(s);
2682 return bset;
2683 }
2684
2685 struct isl_basic_map *isl_basic_map_read_from_str(struct isl_ctx *ctx,
2686 const char *str)
2687 {
2688 struct isl_basic_map *bmap;
2689 isl_stream *s = isl_stream_new_str(ctx, str);
2690 if (!s)
2691 return NULL;
2692 bmap = basic_map_read(s);
2693 isl_stream_free(s);
2694 return bmap;
2695 }
2696
2697 struct isl_basic_set *isl_basic_set_read_from_str(struct isl_ctx *ctx,
2698 const char *str)
2699 {
2700 isl_basic_set *bset;
2701 isl_stream *s = isl_stream_new_str(ctx, str);
2702 if (!s)
2703 return NULL;
2704 bset = basic_set_read(s);
2705 isl_stream_free(s);
2706 return bset;
2707 }
2708
2709 __isl_give isl_map *isl_map_read_from_file(struct isl_ctx *ctx,
2710 FILE *input)
2711 {
2712 struct isl_map *map;
2713 isl_stream *s = isl_stream_new_file(ctx, input);
2714 if (!s)
2715 return NULL;
2716 map = isl_stream_read_map(s);
2717 isl_stream_free(s);
2718 return map;
2719 }
2720
2721 __isl_give isl_map *isl_map_read_from_str(struct isl_ctx *ctx,
2722 const char *str)
2723 {
2724 struct isl_map *map;
2725 isl_stream *s = isl_stream_new_str(ctx, str);
2726 if (!s)
2727 return NULL;
2728 map = isl_stream_read_map(s);
2729 isl_stream_free(s);
2730 return map;
2731 }
2732
2733 __isl_give isl_set *isl_set_read_from_file(struct isl_ctx *ctx,
2734 FILE *input)
2735 {
2736 isl_set *set;
2737 isl_stream *s = isl_stream_new_file(ctx, input);
2738 if (!s)
2739 return NULL;
2740 set = isl_stream_read_set(s);
2741 isl_stream_free(s);
2742 return set;
2743 }
2744
2745 struct isl_set *isl_set_read_from_str(struct isl_ctx *ctx,
2746 const char *str)
2747 {
2748 isl_set *set;
2749 isl_stream *s = isl_stream_new_str(ctx, str);
2750 if (!s)
2751 return NULL;
2752 set = isl_stream_read_set(s);
2753 isl_stream_free(s);
2754 return set;
2755 }
2756
2757 __isl_give isl_union_map *isl_union_map_read_from_file(isl_ctx *ctx,
2758 FILE *input)
2759 {
2760 isl_union_map *umap;
2761 isl_stream *s = isl_stream_new_file(ctx, input);
2762 if (!s)
2763 return NULL;
2764 umap = isl_stream_read_union_map(s);
2765 isl_stream_free(s);
2766 return umap;
2767 }
2768
2769 __isl_give isl_union_map *isl_union_map_read_from_str(struct isl_ctx *ctx,
2770 const char *str)
2771 {
2772 isl_union_map *umap;
2773 isl_stream *s = isl_stream_new_str(ctx, str);
2774 if (!s)
2775 return NULL;
2776 umap = isl_stream_read_union_map(s);
2777 isl_stream_free(s);
2778 return umap;
2779 }
2780
2781 __isl_give isl_union_set *isl_union_set_read_from_file(isl_ctx *ctx,
2782 FILE *input)
2783 {
2784 isl_union_set *uset;
2785 isl_stream *s = isl_stream_new_file(ctx, input);
2786 if (!s)
2787 return NULL;
2788 uset = isl_stream_read_union_set(s);
2789 isl_stream_free(s);
2790 return uset;
2791 }
2792
2793 __isl_give isl_union_set *isl_union_set_read_from_str(struct isl_ctx *ctx,
2794 const char *str)
2795 {
2796 isl_union_set *uset;
2797 isl_stream *s = isl_stream_new_str(ctx, str);
2798 if (!s)
2799 return NULL;
2800 uset = isl_stream_read_union_set(s);
2801 isl_stream_free(s);
2802 return uset;
2803 }
2804
2805 static __isl_give isl_vec *isl_vec_read_polylib(__isl_keep isl_stream *s)
2806 {
2807 struct isl_vec *vec = NULL;
2808 struct isl_token *tok;
2809 unsigned size;
2810 int j;
2811
2812 tok = isl_stream_next_token(s);
2813 if (!tok || tok->type != ISL_TOKEN_VALUE) {
2814 isl_stream_error(s, tok, "expecting vector length");
2815 goto error;
2816 }
2817
2818 size = isl_int_get_si(tok->u.v);
2819 isl_token_free(tok);
2820
2821 vec = isl_vec_alloc(s->ctx, size);
2822
2823 for (j = 0; j < size; ++j) {
2824 tok = isl_stream_next_token(s);
2825 if (!tok || tok->type != ISL_TOKEN_VALUE) {
2826 isl_stream_error(s, tok, "expecting constant value");
2827 goto error;
2828 }
2829 isl_int_set(vec->el[j], tok->u.v);
2830 isl_token_free(tok);
2831 }
2832
2833 return vec;
2834 error:
2835 isl_token_free(tok);
2836 isl_vec_free(vec);
2837 return NULL;
2838 }
2839
2840 static __isl_give isl_vec *vec_read(__isl_keep isl_stream *s)
2841 {
2842 return isl_vec_read_polylib(s);
2843 }
2844
2845 __isl_give isl_vec *isl_vec_read_from_file(isl_ctx *ctx, FILE *input)
2846 {
2847 isl_vec *v;
2848 isl_stream *s = isl_stream_new_file(ctx, input);
2849 if (!s)
2850 return NULL;
2851 v = vec_read(s);
2852 isl_stream_free(s);
2853 return v;
2854 }
2855
2856 __isl_give isl_pw_qpolynomial *isl_stream_read_pw_qpolynomial(
2857 __isl_keep isl_stream *s)
2858 {
2859 struct isl_obj obj;
2860
2861 obj = obj_read(s);
2862 if (obj.v)
2863 isl_assert(s->ctx, obj.type == isl_obj_pw_qpolynomial,
2864 goto error);
2865
2866 return obj.v;
2867 error:
2868 obj.type->free(obj.v);
2869 return NULL;
2870 }
2871
2872 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_str(isl_ctx *ctx,
2873 const char *str)
2874 {
2875 isl_pw_qpolynomial *pwqp;
2876 isl_stream *s = isl_stream_new_str(ctx, str);
2877 if (!s)
2878 return NULL;
2879 pwqp = isl_stream_read_pw_qpolynomial(s);
2880 isl_stream_free(s);
2881 return pwqp;
2882 }
2883
2884 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_file(isl_ctx *ctx,
2885 FILE *input)
2886 {
2887 isl_pw_qpolynomial *pwqp;
2888 isl_stream *s = isl_stream_new_file(ctx, input);
2889 if (!s)
2890 return NULL;
2891 pwqp = isl_stream_read_pw_qpolynomial(s);
2892 isl_stream_free(s);
2893 return pwqp;
2894 }
2895
2896 /* Is the next token an identifer not in "v"?
2897 */
2898 static int next_is_fresh_ident(__isl_keep isl_stream *s, struct vars *v)
2899 {
2900 int n = v->n;
2901 int fresh;
2902 struct isl_token *tok;
2903
2904 tok = isl_stream_next_token(s);
2905 if (!tok)
2906 return 0;
2907 fresh = tok->type == ISL_TOKEN_IDENT && vars_pos(v, tok->u.s, -1) >= n;
2908 isl_stream_push_token(s, tok);
2909
2910 vars_drop(v, v->n - n);
2911
2912 return fresh;
2913 }
2914
2915 /* First read the domain of the affine expression, which may be
2916 * a parameter space or a set.
2917 * The tricky part is that we don't know if the domain is a set or not,
2918 * so when we are trying to read the domain, we may actually be reading
2919 * the affine expression itself (defined on a parameter domains)
2920 * If the tuple we are reading is named, we assume it's the domain.
2921 * Also, if inside the tuple, the first thing we find is a nested tuple
2922 * or a new identifier, we again assume it's the domain.
2923 * Otherwise, we assume we are reading an affine expression.
2924 */
2925 static __isl_give isl_set *read_aff_domain(__isl_keep isl_stream *s,
2926 __isl_take isl_set *dom, struct vars *v)
2927 {
2928 struct isl_token *tok;
2929
2930 tok = isl_stream_next_token(s);
2931 if (tok && (tok->type == ISL_TOKEN_IDENT || tok->is_keyword)) {
2932 isl_stream_push_token(s, tok);
2933 return read_map_tuple(s, dom, isl_dim_set, v, 1, 0);
2934 }
2935 if (!tok || tok->type != '[') {
2936 isl_stream_error(s, tok, "expecting '['");
2937 goto error;
2938 }
2939 if (next_is_tuple(s) || next_is_fresh_ident(s, v)) {
2940 isl_stream_push_token(s, tok);
2941 dom = read_map_tuple(s, dom, isl_dim_set, v, 1, 0);
2942 } else
2943 isl_stream_push_token(s, tok);
2944
2945 return dom;
2946 error:
2947 if (tok)
2948 isl_stream_push_token(s, tok);
2949 isl_set_free(dom);
2950 return NULL;
2951 }
2952
2953 /* Read an affine expression from "s".
2954 */
2955 __isl_give isl_aff *isl_stream_read_aff(__isl_keep isl_stream *s)
2956 {
2957 isl_aff *aff;
2958 isl_multi_aff *ma;
2959
2960 ma = isl_stream_read_multi_aff(s);
2961 if (!ma)
2962 return NULL;
2963 if (isl_multi_aff_dim(ma, isl_dim_out) != 1)
2964 isl_die(s->ctx, isl_error_invalid,
2965 "expecting single affine expression",
2966 goto error);
2967
2968 aff = isl_multi_aff_get_aff(ma, 0);
2969 isl_multi_aff_free(ma);
2970 return aff;
2971 error:
2972 isl_multi_aff_free(ma);
2973 return NULL;
2974 }
2975
2976 /* Read a piecewise affine expression from "s" with domain (space) "dom".
2977 */
2978 static __isl_give isl_pw_aff *read_pw_aff_with_dom(__isl_keep isl_stream *s,
2979 __isl_take isl_set *dom, struct vars *v)
2980 {
2981 isl_pw_aff *pwaff = NULL;
2982
2983 if (!isl_set_is_params(dom) && isl_stream_eat(s, ISL_TOKEN_TO))
2984 goto error;
2985
2986 if (isl_stream_eat(s, '['))
2987 goto error;
2988
2989 pwaff = accept_affine(s, isl_set_get_space(dom), v);
2990
2991 if (isl_stream_eat(s, ']'))
2992 goto error;
2993
2994 dom = read_optional_formula(s, dom, v, 0);
2995 pwaff = isl_pw_aff_intersect_domain(pwaff, dom);
2996
2997 return pwaff;
2998 error:
2999 isl_set_free(dom);
3000 isl_pw_aff_free(pwaff);
3001 return NULL;
3002 }
3003
3004 __isl_give isl_pw_aff *isl_stream_read_pw_aff(__isl_keep isl_stream *s)
3005 {
3006 struct vars *v;
3007 isl_set *dom = NULL;
3008 isl_set *aff_dom;
3009 isl_pw_aff *pa = NULL;
3010 int n;
3011
3012 v = vars_new(s->ctx);
3013 if (!v)
3014 return NULL;
3015
3016 dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0));
3017 if (next_is_tuple(s)) {
3018 dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0);
3019 if (isl_stream_eat(s, ISL_TOKEN_TO))
3020 goto error;
3021 }
3022 if (isl_stream_eat(s, '{'))
3023 goto error;
3024
3025 n = v->n;
3026 aff_dom = read_aff_domain(s, isl_set_copy(dom), v);
3027 pa = read_pw_aff_with_dom(s, aff_dom, v);
3028 vars_drop(v, v->n - n);
3029
3030 while (isl_stream_eat_if_available(s, ';')) {
3031 isl_pw_aff *pa_i;
3032
3033 n = v->n;
3034 aff_dom = read_aff_domain(s, isl_set_copy(dom), v);
3035 pa_i = read_pw_aff_with_dom(s, aff_dom, v);
3036 vars_drop(v, v->n - n);
3037
3038 pa = isl_pw_aff_union_add(pa, pa_i);
3039 }
3040
3041 if (isl_stream_eat(s, '}'))
3042 goto error;
3043
3044 vars_free(v);
3045 isl_set_free(dom);
3046 return pa;
3047 error:
3048 vars_free(v);
3049 isl_set_free(dom);
3050 isl_pw_aff_free(pa);
3051 return NULL;
3052 }
3053
3054 __isl_give isl_aff *isl_aff_read_from_str(isl_ctx *ctx, const char *str)
3055 {
3056 isl_aff *aff;
3057 isl_stream *s = isl_stream_new_str(ctx, str);
3058 if (!s)
3059 return NULL;
3060 aff = isl_stream_read_aff(s);
3061 isl_stream_free(s);
3062 return aff;
3063 }
3064
3065 __isl_give isl_pw_aff *isl_pw_aff_read_from_str(isl_ctx *ctx, const char *str)
3066 {
3067 isl_pw_aff *pa;
3068 isl_stream *s = isl_stream_new_str(ctx, str);
3069 if (!s)
3070 return NULL;
3071 pa = isl_stream_read_pw_aff(s);
3072 isl_stream_free(s);
3073 return pa;
3074 }
3075
3076 /* Read an isl_pw_multi_aff from "s".
3077 * We currently read a generic object and if it turns out to be a set or
3078 * a map, we convert that to an isl_pw_multi_aff.
3079 * It would be more efficient if we were to construct the isl_pw_multi_aff
3080 * directly.
3081 */
3082 __isl_give isl_pw_multi_aff *isl_stream_read_pw_multi_aff(
3083 __isl_keep isl_stream *s)
3084 {
3085 struct isl_obj obj;
3086
3087 obj = obj_read(s);
3088 if (!obj.v)
3089 return NULL;
3090
3091 if (obj.type == isl_obj_map)
3092 return isl_pw_multi_aff_from_map(obj.v);
3093 if (obj.type == isl_obj_set)
3094 return isl_pw_multi_aff_from_set(obj.v);
3095
3096 obj.type->free(obj.v);
3097 isl_die(s->ctx, isl_error_invalid, "unexpected object type",
3098 return NULL);
3099 }
3100
3101 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_read_from_str(isl_ctx *ctx,
3102 const char *str)
3103 {
3104 isl_pw_multi_aff *pma;
3105 isl_stream *s = isl_stream_new_str(ctx, str);
3106 if (!s)
3107 return NULL;
3108 pma = isl_stream_read_pw_multi_aff(s);
3109 isl_stream_free(s);
3110 return pma;
3111 }
3112
3113 /* Read an isl_union_pw_multi_aff from "s".
3114 * We currently read a generic object and if it turns out to be a set or
3115 * a map, we convert that to an isl_union_pw_multi_aff.
3116 * It would be more efficient if we were to construct
3117 * the isl_union_pw_multi_aff directly.
3118 */
3119 __isl_give isl_union_pw_multi_aff *isl_stream_read_union_pw_multi_aff(
3120 __isl_keep isl_stream *s)
3121 {
3122 struct isl_obj obj;
3123
3124 obj = obj_read(s);
3125 if (!obj.v)
3126 return NULL;
3127
3128 if (obj.type == isl_obj_map || obj.type == isl_obj_set)
3129 obj = to_union(s->ctx, obj);
3130 if (obj.type == isl_obj_union_map)
3131 return isl_union_pw_multi_aff_from_union_map(obj.v);
3132 if (obj.type == isl_obj_union_set)
3133 return isl_union_pw_multi_aff_from_union_set(obj.v);
3134
3135 obj.type->free(obj.v);
3136 isl_die(s->ctx, isl_error_invalid, "unexpected object type",
3137 return NULL);
3138 }
3139
3140 /* Read an isl_union_pw_multi_aff from "str".
3141 */
3142 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_read_from_str(
3143 isl_ctx *ctx, const char *str)
3144 {
3145 isl_union_pw_multi_aff *upma;
3146 isl_stream *s = isl_stream_new_str(ctx, str);
3147 if (!s)
3148 return NULL;
3149 upma = isl_stream_read_union_pw_multi_aff(s);
3150 isl_stream_free(s);
3151 return upma;
3152 }
3153
3154 /* Assuming "pa" represents a single affine expression defined on a universe
3155 * domain, extract this affine expression.
3156 */
3157 static __isl_give isl_aff *aff_from_pw_aff(__isl_take isl_pw_aff *pa)
3158 {
3159 isl_aff *aff;
3160
3161 if (!pa)
3162 return NULL;
3163 if (pa->n != 1)
3164 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
3165 "expecting single affine expression",
3166 goto error);
3167 if (!isl_set_plain_is_universe(pa->p[0].set))
3168 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
3169 "expecting universe domain",
3170 goto error);
3171
3172 aff = isl_aff_copy(pa->p[0].aff);
3173 isl_pw_aff_free(pa);
3174 return aff;
3175 error:
3176 isl_pw_aff_free(pa);
3177 return NULL;
3178 }
3179
3180 /* This function is called for each element in a tuple inside
3181 * isl_stream_read_multi_val.
3182 * Read an isl_val from "s" and add it to *list.
3183 */
3184 static __isl_give isl_space *read_val_el(__isl_keep isl_stream *s,
3185 struct vars *v, __isl_take isl_space *space, int rational, void *user)
3186 {
3187 isl_val_list **list = (isl_val_list **) user;
3188 isl_val *val;
3189
3190 val = isl_stream_read_val(s);
3191 *list = isl_val_list_add(*list, val);
3192 if (!*list)
3193 return isl_space_free(space);
3194
3195 return space;
3196 }
3197
3198 /* Read an isl_multi_val from "s".
3199 *
3200 * We first read a tuple space, collecting the element values in a list.
3201 * Then we create an isl_multi_val from the space and the isl_val_list.
3202 */
3203 __isl_give isl_multi_val *isl_stream_read_multi_val(__isl_keep isl_stream *s)
3204 {
3205 struct vars *v;
3206 isl_set *dom = NULL;
3207 isl_space *space;
3208 isl_multi_val *mv = NULL;
3209 isl_val_list *list;
3210
3211 v = vars_new(s->ctx);
3212 if (!v)
3213 return NULL;
3214
3215 dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0));
3216 if (next_is_tuple(s)) {
3217 dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0);
3218 if (isl_stream_eat(s, ISL_TOKEN_TO))
3219 goto error;
3220 }
3221 if (!isl_set_plain_is_universe(dom))
3222 isl_die(s->ctx, isl_error_invalid,
3223 "expecting universe parameter domain", goto error);
3224 if (isl_stream_eat(s, '{'))
3225 goto error;
3226
3227 space = isl_set_get_space(dom);
3228
3229 list = isl_val_list_alloc(s->ctx, 0);
3230 space = read_tuple_space(s, v, space, 1, 0, &read_val_el, &list);
3231 mv = isl_multi_val_from_val_list(space, list);
3232
3233 if (isl_stream_eat(s, '}'))
3234 goto error;
3235
3236 vars_free(v);
3237 isl_set_free(dom);
3238 return mv;
3239 error:
3240 vars_free(v);
3241 isl_set_free(dom);
3242 isl_multi_val_free(mv);
3243 return NULL;
3244 }
3245
3246 /* Read an isl_multi_val from "str".
3247 */
3248 __isl_give isl_multi_val *isl_multi_val_read_from_str(isl_ctx *ctx,
3249 const char *str)
3250 {
3251 isl_multi_val *mv;
3252 isl_stream *s = isl_stream_new_str(ctx, str);
3253 if (!s)
3254 return NULL;
3255 mv = isl_stream_read_multi_val(s);
3256 isl_stream_free(s);
3257 return mv;
3258 }
3259
3260 /* Read a multi-affine expression from "s".
3261 * If the multi-affine expression has a domain, then the tuple
3262 * representing this domain cannot involve any affine expressions.
3263 * The tuple representing the actual expressions needs to consist
3264 * of only affine expressions. Moreover, these expressions can
3265 * only depend on parameters and input dimensions and not on other
3266 * output dimensions.
3267 */
3268 __isl_give isl_multi_aff *isl_stream_read_multi_aff(__isl_keep isl_stream *s)
3269 {
3270 struct vars *v;
3271 isl_set *dom = NULL;
3272 isl_multi_pw_aff *tuple = NULL;
3273 int dim, i, n;
3274 isl_space *space, *dom_space;
3275 isl_multi_aff *ma = NULL;
3276
3277 v = vars_new(s->ctx);
3278 if (!v)
3279 return NULL;
3280
3281 dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0));
3282 if (next_is_tuple(s)) {
3283 dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0);
3284 if (isl_stream_eat(s, ISL_TOKEN_TO))
3285 goto error;
3286 }
3287 if (!isl_set_plain_is_universe(dom))
3288 isl_die(s->ctx, isl_error_invalid,
3289 "expecting universe parameter domain", goto error);
3290 if (isl_stream_eat(s, '{'))
3291 goto error;
3292
3293 tuple = read_tuple(s, v, 0, 0);
3294 if (!tuple)
3295 goto error;
3296 if (isl_stream_eat_if_available(s, ISL_TOKEN_TO)) {
3297 isl_set *set;
3298 isl_space *space;
3299 int has_expr;
3300
3301 has_expr = tuple_has_expr(tuple);
3302 if (has_expr < 0)
3303 goto error;
3304 if (has_expr)
3305 isl_die(s->ctx, isl_error_invalid,
3306 "expecting universe domain", goto error);
3307 space = isl_space_range(isl_multi_pw_aff_get_space(tuple));
3308 set = isl_set_universe(space);
3309 dom = isl_set_intersect_params(set, dom);
3310 isl_multi_pw_aff_free(tuple);
3311 tuple = read_tuple(s, v, 0, 0);
3312 if (!tuple)
3313 goto error;
3314 }
3315
3316 if (isl_stream_eat(s, '}'))
3317 goto error;
3318
3319 n = isl_multi_pw_aff_dim(tuple, isl_dim_out);
3320 dim = isl_set_dim(dom, isl_dim_all);
3321 dom_space = isl_set_get_space(dom);
3322 space = isl_space_range(isl_multi_pw_aff_get_space(tuple));
3323 space = isl_space_align_params(space, isl_space_copy(dom_space));
3324 if (!isl_space_is_params(dom_space))
3325 space = isl_space_map_from_domain_and_range(
3326 isl_space_copy(dom_space), space);
3327 isl_space_free(dom_space);
3328 ma = isl_multi_aff_alloc(space);
3329
3330 for (i = 0; i < n; ++i) {
3331 isl_pw_aff *pa;
3332 isl_aff *aff;
3333 pa = isl_multi_pw_aff_get_pw_aff(tuple, i);
3334 aff = aff_from_pw_aff(pa);
3335 if (!aff)
3336 goto error;
3337 if (isl_aff_involves_dims(aff, isl_dim_in, dim, i + 1)) {
3338 isl_aff_free(aff);
3339 isl_die(s->ctx, isl_error_invalid,
3340 "not an affine expression", goto error);
3341 }
3342 aff = isl_aff_drop_dims(aff, isl_dim_in, dim, n);
3343 space = isl_multi_aff_get_domain_space(ma);
3344 aff = isl_aff_reset_domain_space(aff, space);
3345 ma = isl_multi_aff_set_aff(ma, i, aff);
3346 }
3347
3348 isl_multi_pw_aff_free(tuple);
3349 vars_free(v);
3350 isl_set_free(dom);
3351 return ma;
3352 error:
3353 isl_multi_pw_aff_free(tuple);
3354 vars_free(v);
3355 isl_set_free(dom);
3356 isl_multi_aff_free(ma);
3357 return NULL;
3358 }
3359
3360 __isl_give isl_multi_aff *isl_multi_aff_read_from_str(isl_ctx *ctx,
3361 const char *str)
3362 {
3363 isl_multi_aff *maff;
3364 isl_stream *s = isl_stream_new_str(ctx, str);
3365 if (!s)
3366 return NULL;
3367 maff = isl_stream_read_multi_aff(s);
3368 isl_stream_free(s);
3369 return maff;
3370 }
3371
3372 /* Read an isl_multi_pw_aff from "s".
3373 *
3374 * The input format is similar to that of map, except that any conditions
3375 * on the domains should be specified inside the tuple since each
3376 * piecewise affine expression may have a different domain.
3377 *
3378 * Since we do not know in advance if the isl_multi_pw_aff lives
3379 * in a set or a map space, we first read the first tuple and check
3380 * if it is followed by a "->". If so, we convert the tuple into
3381 * the domain of the isl_multi_pw_aff and read in the next tuple.
3382 * This tuple (or the first tuple if it was not followed by a "->")
3383 * is then converted into the isl_multi_pw_aff.
3384 *
3385 * Note that the function read_tuple accepts tuples where some output or
3386 * set dimensions are defined in terms of other output or set dimensions
3387 * since this function is also used to read maps. As a special case,
3388 * read_tuple also accept dimensions that are defined in terms of themselves
3389 * (i.e., that are not defined).
3390 * These cases are not allowed when reading am isl_multi_pw_aff so we check
3391 * that the definition of the output/set dimensions does not involve any
3392 * output/set dimensions.
3393 * We then drop the output dimensions from the domain of the result
3394 * of read_tuple (which is of the form [input, output] -> [output],
3395 * with anonymous domain) and reset the space.
3396 */
3397 __isl_give isl_multi_pw_aff *isl_stream_read_multi_pw_aff(
3398 __isl_keep isl_stream *s)
3399 {
3400 struct vars *v;
3401 isl_set *dom = NULL;
3402 isl_multi_pw_aff *tuple = NULL;
3403 int dim, i, n;
3404 isl_space *space, *dom_space;
3405 isl_multi_pw_aff *mpa = NULL;
3406
3407 v = vars_new(s->ctx);
3408 if (!v)
3409 return NULL;
3410
3411 dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0));
3412 if (next_is_tuple(s)) {
3413 dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0);
3414 if (isl_stream_eat(s, ISL_TOKEN_TO))
3415 goto error;
3416 }
3417 if (isl_stream_eat(s, '{'))
3418 goto error;
3419
3420 tuple = read_tuple(s, v, 0, 0);
3421 if (!tuple)
3422 goto error;
3423 if (isl_stream_eat_if_available(s, ISL_TOKEN_TO)) {
3424 isl_map *map = map_from_tuple(tuple, dom, isl_dim_in, v, 0);
3425 dom = isl_map_domain(map);
3426 tuple = read_tuple(s, v, 0, 0);
3427 if (!tuple)
3428 goto error;
3429 }
3430
3431 if (isl_stream_eat(s, '}'))
3432 goto error;
3433
3434 n = isl_multi_pw_aff_dim(tuple, isl_dim_out);
3435 dim = isl_set_dim(dom, isl_dim_all);
3436 dom_space = isl_set_get_space(dom);
3437 space = isl_space_range(isl_multi_pw_aff_get_space(tuple));
3438 space = isl_space_align_params(space, isl_space_copy(dom_space));
3439 if (!isl_space_is_params(dom_space))
3440 space = isl_space_map_from_domain_and_range(
3441 isl_space_copy(dom_space), space);
3442 isl_space_free(dom_space);
3443 mpa = isl_multi_pw_aff_alloc(space);
3444
3445 for (i = 0; i < n; ++i) {
3446 isl_pw_aff *pa;
3447 pa = isl_multi_pw_aff_get_pw_aff(tuple, i);
3448 if (!pa)
3449 goto error;
3450 if (isl_pw_aff_involves_dims(pa, isl_dim_in, dim, i + 1)) {
3451 isl_pw_aff_free(pa);
3452 isl_die(s->ctx, isl_error_invalid,
3453 "not an affine expression", goto error);
3454 }
3455 pa = isl_pw_aff_drop_dims(pa, isl_dim_in, dim, n);
3456 space = isl_multi_pw_aff_get_domain_space(mpa);
3457 pa = isl_pw_aff_reset_domain_space(pa, space);
3458 mpa = isl_multi_pw_aff_set_pw_aff(mpa, i, pa);
3459 }
3460
3461 isl_multi_pw_aff_free(tuple);
3462 vars_free(v);
3463 mpa = isl_multi_pw_aff_intersect_domain(mpa, dom);
3464 return mpa;
3465 error:
3466 isl_multi_pw_aff_free(tuple);
3467 vars_free(v);
3468 isl_set_free(dom);
3469 isl_multi_pw_aff_free(mpa);
3470 return NULL;
3471 }
3472
3473 /* Read an isl_multi_pw_aff from "str".
3474 */
3475 __isl_give isl_multi_pw_aff *isl_multi_pw_aff_read_from_str(isl_ctx *ctx,
3476 const char *str)
3477 {
3478 isl_multi_pw_aff *mpa;
3479 isl_stream *s = isl_stream_new_str(ctx, str);
3480 if (!s)
3481 return NULL;
3482 mpa = isl_stream_read_multi_pw_aff(s);
3483 isl_stream_free(s);
3484 return mpa;
3485 }
3486
3487 /* Read the body of an isl_union_pw_aff from "s" with parameter domain "dom".
3488 */
3489 static __isl_give isl_union_pw_aff *read_union_pw_aff_with_dom(
3490 __isl_keep isl_stream *s, __isl_take isl_set *dom, struct vars *v)
3491 {
3492 isl_pw_aff *pa;
3493 isl_union_pw_aff *upa = NULL;
3494 isl_set *aff_dom;
3495 int n;
3496
3497 n = v->n;
3498 aff_dom = read_aff_domain(s, isl_set_copy(dom), v);
3499 pa = read_pw_aff_with_dom(s, aff_dom, v);
3500 vars_drop(v, v->n - n);
3501
3502 upa = isl_union_pw_aff_from_pw_aff(pa);
3503
3504 while (isl_stream_eat_if_available(s, ';')) {
3505 isl_pw_aff *pa_i;
3506 isl_union_pw_aff *upa_i;
3507
3508 n = v->n;
3509 aff_dom = read_aff_domain(s, isl_set_copy(dom), v);
3510 pa_i = read_pw_aff_with_dom(s, aff_dom, v);
3511 vars_drop(v, v->n - n);
3512
3513 upa_i = isl_union_pw_aff_from_pw_aff(pa_i);
3514 upa = isl_union_pw_aff_union_add(upa, upa_i);
3515 }
3516
3517 isl_set_free(dom);
3518 return upa;
3519 }
3520
3521 /* This function is called for each element in a tuple inside
3522 * isl_stream_read_multi_union_pw_aff.
3523 *
3524 * Read a '{', the union piecewise affine expression body and a '}' and
3525 * add the isl_union_pw_aff to *list.
3526 */
3527 static __isl_give isl_space *read_union_pw_aff_el(__isl_keep isl_stream *s,
3528 struct vars *v, __isl_take isl_space *space, int rational, void *user)
3529 {
3530 isl_set *dom;
3531 isl_union_pw_aff *upa;
3532 isl_union_pw_aff_list **list = (isl_union_pw_aff_list **) user;
3533
3534 dom = isl_set_universe(isl_space_params(isl_space_copy(space)));
3535 if (isl_stream_eat(s, '{'))
3536 goto error;
3537 upa = read_union_pw_aff_with_dom(s, dom, v);
3538 *list = isl_union_pw_aff_list_add(*list, upa);
3539 if (isl_stream_eat(s, '}'))
3540 return isl_space_free(space);
3541 if (!*list)
3542 return isl_space_free(space);
3543 return space;
3544 error:
3545 isl_set_free(dom);
3546 return isl_space_free(space);
3547 }
3548
3549 /* Do the next tokens in "s" correspond to an empty tuple?
3550 * In particular, does the stream start with a '[', followed by a ']',
3551 * not followed by a "->"?
3552 */
3553 static int next_is_empty_tuple(__isl_keep isl_stream *s)
3554 {
3555 struct isl_token *tok, *tok2, *tok3;
3556 int is_empty_tuple = 0;
3557
3558 tok = isl_stream_next_token(s);
3559 if (!tok)
3560 return 0;
3561 if (tok->type != '[') {
3562 isl_stream_push_token(s, tok);
3563 return 0;
3564 }
3565
3566 tok2 = isl_stream_next_token(s);
3567 if (tok2 && tok2->type == ']') {
3568 tok3 = isl_stream_next_token(s);
3569 is_empty_tuple = !tok || tok->type != ISL_TOKEN_TO;
3570 if (tok3)
3571 isl_stream_push_token(s, tok3);
3572 }
3573 if (tok2)
3574 isl_stream_push_token(s, tok2);
3575 isl_stream_push_token(s, tok);
3576
3577 return is_empty_tuple;
3578 }
3579
3580 /* Do the next tokens in "s" correspond to a tuple of parameters?
3581 * In particular, does the stream start with a '[' that is not
3582 * followed by a '{' or a nested tuple?
3583 */
3584 static int next_is_param_tuple(__isl_keep isl_stream *s)
3585 {
3586 struct isl_token *tok, *tok2;
3587 int is_tuple;
3588
3589 tok = isl_stream_next_token(s);
3590 if (!tok)
3591 return 0;
3592 if (tok->type != '[' || next_is_tuple(s)) {
3593 isl_stream_push_token(s, tok);
3594 return 0;
3595 }
3596
3597 tok2 = isl_stream_next_token(s);
3598 is_tuple = tok2 && tok2->type != '{';
3599 if (tok2)
3600 isl_stream_push_token(s, tok2);
3601 isl_stream_push_token(s, tok);
3602
3603 return is_tuple;
3604 }
3605
3606 /* Read an isl_multi_union_pw_aff from "s".
3607 *
3608 * The input has the form
3609 *
3610 * [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }]
3611 *
3612 * or
3613 *
3614 * [..] -> [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }]
3615 *
3616 * We first check for the special case of an empty tuple "[]".
3617 * Then we check if there are any parameters.
3618 * Finally, we read the tuple, collecting the individual isl_union_pw_aff
3619 * elements in a list and construct the result from the tuple space and
3620 * the list.
3621 */
3622 __isl_give isl_multi_union_pw_aff *isl_stream_read_multi_union_pw_aff(
3623 __isl_keep isl_stream *s)
3624 {
3625 struct vars *v;
3626 isl_set *dom = NULL;
3627 isl_space *space;
3628 isl_multi_union_pw_aff *mupa = NULL;
3629 isl_union_pw_aff_list *list;
3630
3631 if (next_is_empty_tuple(s)) {
3632 if (isl_stream_eat(s, '['))
3633 return NULL;
3634 if (isl_stream_eat(s, ']'))
3635 return NULL;
3636 space = isl_space_set_alloc(s->ctx, 0, 0);
3637 return isl_multi_union_pw_aff_zero(space);
3638 }
3639
3640 v = vars_new(s->ctx);
3641 if (!v)
3642 return NULL;
3643
3644 dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0));
3645 if (next_is_param_tuple(s)) {
3646 dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0);
3647 if (isl_stream_eat(s, ISL_TOKEN_TO))
3648 goto error;
3649 }
3650 space = isl_set_get_space(dom);
3651 isl_set_free(dom);
3652 list = isl_union_pw_aff_list_alloc(s->ctx, 0);
3653 space = read_tuple_space(s, v, space, 1, 0,
3654 &read_union_pw_aff_el, &list);
3655 mupa = isl_multi_union_pw_aff_from_union_pw_aff_list(space, list);
3656
3657 vars_free(v);
3658
3659 return mupa;
3660 error:
3661 vars_free(v);
3662 isl_set_free(dom);
3663 isl_multi_union_pw_aff_free(mupa);
3664 return NULL;
3665 }
3666
3667 /* Read an isl_multi_union_pw_aff from "str".
3668 */
3669 __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_read_from_str(
3670 isl_ctx *ctx, const char *str)
3671 {
3672 isl_multi_union_pw_aff *mupa;
3673 isl_stream *s = isl_stream_new_str(ctx, str);
3674 if (!s)
3675 return NULL;
3676 mupa = isl_stream_read_multi_union_pw_aff(s);
3677 isl_stream_free(s);
3678 return mupa;
3679 }
3680
3681 __isl_give isl_union_pw_qpolynomial *isl_stream_read_union_pw_qpolynomial(
3682 __isl_keep isl_stream *s)
3683 {
3684 struct isl_obj obj;
3685
3686 obj = obj_read(s);
3687 if (obj.type == isl_obj_pw_qpolynomial) {
3688 obj.type = isl_obj_union_pw_qpolynomial;
3689 obj.v = isl_union_pw_qpolynomial_from_pw_qpolynomial(obj.v);
3690 }
3691 if (obj.v)
3692 isl_assert(s->ctx, obj.type == isl_obj_union_pw_qpolynomial,
3693 goto error);
3694
3695 return obj.v;
3696 error:
3697 obj.type->free(obj.v);
3698 return NULL;
3699 }
3700
3701 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_read_from_str(
3702 isl_ctx *ctx, const char *str)
3703 {
3704 isl_union_pw_qpolynomial *upwqp;
3705 isl_stream *s = isl_stream_new_str(ctx, str);
3706 if (!s)
3707 return NULL;
3708 upwqp = isl_stream_read_union_pw_qpolynomial(s);
3709 isl_stream_free(s);
3710 return upwqp;
3711 }
Integer set library