2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
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
18 #include <isl_ctx_private.h>
19 #include <isl_map_private.h>
22 #include <isl_stream_private.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>
30 #include <isl_val_private.h>
35 struct variable
*next
;
44 static struct vars
*vars_new(struct isl_ctx
*ctx
)
47 v
= isl_alloc_type(ctx
, struct vars
);
56 static void variable_free(struct variable
*var
)
59 struct variable
*next
= var
->next
;
66 static void vars_free(struct vars
*v
)
74 static void vars_drop(struct vars
*v
, int n
)
85 struct variable
*next
= var
->next
;
93 static struct variable
*variable_new(struct vars
*v
, const char *name
, int len
,
97 var
= isl_calloc_type(v
->ctx
, struct variable
);
100 var
->name
= strdup(name
);
101 var
->name
[len
] = '\0';
110 static int vars_pos(struct vars
*v
, const char *s
, int len
)
117 for (q
= v
->v
; q
; q
= q
->next
) {
118 if (strncmp(q
->name
, s
, len
) == 0 && q
->name
[len
] == '\0')
125 v
->v
= variable_new(v
, s
, len
, v
->n
);
133 static int vars_add_anon(struct vars
*v
)
135 v
->v
= variable_new(v
, "", 0, v
->n
);
144 /* Obtain next token, with some preprocessing.
145 * In particular, evaluate expressions of the form x^y,
146 * with x and y values.
148 static struct isl_token
*next_token(__isl_keep isl_stream
*s
)
150 struct isl_token
*tok
, *tok2
;
152 tok
= isl_stream_next_token(s
);
153 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
)
155 if (!isl_stream_eat_if_available(s
, '^'))
157 tok2
= isl_stream_next_token(s
);
158 if (!tok2
|| tok2
->type
!= ISL_TOKEN_VALUE
) {
159 isl_stream_error(s
, tok2
, "expecting constant value");
163 isl_int_pow_ui(tok
->u
.v
, tok
->u
.v
, isl_int_get_ui(tok2
->u
.v
));
165 isl_token_free(tok2
);
169 isl_token_free(tok2
);
173 /* Read an isl_val from "s".
175 * The following token sequences are recognized
178 * "-" "infty" -> -infty
183 * where n, d and v are integer constants.
185 __isl_give isl_val
*isl_stream_read_val(__isl_keep isl_stream
*s
)
187 struct isl_token
*tok
= NULL
;
188 struct isl_token
*tok2
= NULL
;
193 isl_stream_error(s
, NULL
, "unexpected EOF");
196 if (tok
->type
== ISL_TOKEN_INFTY
) {
198 return isl_val_infty(s
->ctx
);
200 if (tok
->type
== '-' &&
201 isl_stream_eat_if_available(s
, ISL_TOKEN_INFTY
)) {
203 return isl_val_neginfty(s
->ctx
);
205 if (tok
->type
== ISL_TOKEN_NAN
) {
207 return isl_val_nan(s
->ctx
);
209 if (tok
->type
!= ISL_TOKEN_VALUE
) {
210 isl_stream_error(s
, tok
, "expecting value");
214 if (isl_stream_eat_if_available(s
, '/')) {
215 tok2
= next_token(s
);
217 isl_stream_error(s
, NULL
, "unexpected EOF");
220 if (tok2
->type
!= ISL_TOKEN_VALUE
) {
221 isl_stream_error(s
, tok2
, "expecting value");
224 val
= isl_val_rat_from_isl_int(s
->ctx
, tok
->u
.v
, tok2
->u
.v
);
225 val
= isl_val_normalize(val
);
227 val
= isl_val_int_from_isl_int(s
->ctx
, tok
->u
.v
);
231 isl_token_free(tok2
);
235 isl_token_free(tok2
);
239 /* Read an isl_val from "str".
241 struct isl_val
*isl_val_read_from_str(struct isl_ctx
*ctx
,
245 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
248 val
= isl_stream_read_val(s
);
253 static int accept_cst_factor(__isl_keep isl_stream
*s
, isl_int
*f
)
255 struct isl_token
*tok
;
258 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
259 isl_stream_error(s
, tok
, "expecting constant value");
263 isl_int_mul(*f
, *f
, tok
->u
.v
);
267 if (isl_stream_eat_if_available(s
, '*'))
268 return accept_cst_factor(s
, f
);
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.
280 * We introduce an integer division q = [aff/d] and the result
281 * is set to aff - d q.
283 static __isl_give isl_pw_aff
*affine_mod(__isl_keep isl_stream
*s
,
284 struct vars
*v
, __isl_take isl_pw_aff
*aff
)
286 struct isl_token
*tok
;
290 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
291 isl_stream_error(s
, tok
, "expecting constant value");
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
);
300 aff
= isl_pw_aff_sub(aff
, q
);
305 isl_pw_aff_free(aff
);
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
);
315 static __isl_give isl_pw_aff
*accept_minmax(__isl_keep isl_stream
*s
,
316 __isl_take isl_space
*dim
, struct vars
*v
)
318 struct isl_token
*tok
;
319 isl_pw_aff_list
*list
= NULL
;
322 tok
= isl_stream_next_token(s
);
325 min
= tok
->type
== ISL_TOKEN_MIN
;
328 if (isl_stream_eat(s
, '('))
331 list
= accept_affine_list(s
, isl_space_copy(dim
), v
);
335 if (isl_stream_eat(s
, ')'))
339 return min
? isl_pw_aff_list_min(list
) : isl_pw_aff_list_max(list
);
342 isl_pw_aff_list_free(list
);
346 /* Is "tok" the start of an integer division?
348 static int is_start_of_div(struct isl_token
*tok
)
352 if (tok
->type
== '[')
354 if (tok
->type
== ISL_TOKEN_FLOOR
)
356 if (tok
->type
== ISL_TOKEN_CEIL
)
358 if (tok
->type
== ISL_TOKEN_FLOORD
)
360 if (tok
->type
== ISL_TOKEN_CEILD
)
365 /* Read an integer division from "s" and return it as an isl_pw_aff.
367 * The integer division can be of the form
369 * [<affine expression>]
370 * floor(<affine expression>)
371 * ceil(<affine expression>)
372 * floord(<affine expression>,<denominator>)
373 * ceild(<affine expression>,<denominator>)
375 static __isl_give isl_pw_aff
*accept_div(__isl_keep isl_stream
*s
,
376 __isl_take isl_space
*dim
, struct vars
*v
)
378 struct isl_token
*tok
;
382 isl_pw_aff
*pwaff
= NULL
;
384 if (isl_stream_eat_if_available(s
, ISL_TOKEN_FLOORD
))
386 else if (isl_stream_eat_if_available(s
, ISL_TOKEN_CEILD
))
388 else if (isl_stream_eat_if_available(s
, ISL_TOKEN_FLOOR
))
390 else if (isl_stream_eat_if_available(s
, ISL_TOKEN_CEIL
))
393 if (isl_stream_eat(s
, '('))
396 if (isl_stream_eat(s
, '['))
400 pwaff
= accept_affine(s
, isl_space_copy(dim
), v
);
403 if (isl_stream_eat(s
, ','))
409 if (tok
->type
!= ISL_TOKEN_VALUE
) {
410 isl_stream_error(s
, tok
, "expected denominator");
411 isl_stream_push_token(s
, tok
);
414 isl_pw_aff_scale_down(pwaff
, tok
->u
.v
);
419 pwaff
= isl_pw_aff_ceil(pwaff
);
421 pwaff
= isl_pw_aff_floor(pwaff
);
424 if (isl_stream_eat(s
, ')'))
427 if (isl_stream_eat(s
, ']'))
435 isl_pw_aff_free(pwaff
);
439 static __isl_give isl_pw_aff
*accept_affine_factor(__isl_keep isl_stream
*s
,
440 __isl_take isl_space
*dim
, struct vars
*v
)
442 struct isl_token
*tok
= NULL
;
443 isl_pw_aff
*res
= NULL
;
447 isl_stream_error(s
, NULL
, "unexpected EOF");
451 if (tok
->type
== ISL_TOKEN_AFF
) {
452 res
= isl_pw_aff_copy(tok
->u
.pwaff
);
454 } else if (tok
->type
== ISL_TOKEN_IDENT
) {
456 int pos
= vars_pos(v
, tok
->u
.s
, -1);
462 vars_drop(v
, v
->n
- n
);
463 isl_stream_error(s
, tok
, "unknown identifier");
467 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(isl_space_copy(dim
)));
470 isl_int_set_si(aff
->v
->el
[2 + pos
], 1);
471 res
= isl_pw_aff_from_aff(aff
);
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
);
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
);
486 } else if (tok
->type
== '(') {
489 res
= accept_affine(s
, isl_space_copy(dim
), v
);
492 if (isl_stream_eat(s
, ')'))
494 } else if (is_start_of_div(tok
)) {
495 isl_stream_push_token(s
, tok
);
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
);
501 res
= accept_minmax(s
, isl_space_copy(dim
), v
);
503 isl_stream_error(s
, tok
, "expecting factor");
506 if (isl_stream_eat_if_available(s
, '%') ||
507 isl_stream_eat_if_available(s
, ISL_TOKEN_MOD
)) {
509 return affine_mod(s
, v
, res
);
511 if (isl_stream_eat_if_available(s
, '*')) {
514 isl_int_set_si(f
, 1);
515 if (accept_cst_factor(s
, &f
) < 0) {
519 res
= isl_pw_aff_scale(res
, f
);
522 if (isl_stream_eat_if_available(s
, '/')) {
525 isl_int_set_si(f
, 1);
526 if (accept_cst_factor(s
, &f
) < 0) {
530 res
= isl_pw_aff_scale_down(res
, f
);
539 isl_pw_aff_free(res
);
544 static __isl_give isl_pw_aff
*add_cst(__isl_take isl_pw_aff
*pwaff
, isl_int v
)
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
);
553 return isl_pw_aff_add(pwaff
, isl_pw_aff_from_aff(aff
));
556 /* Return a piecewise affine expression defined on the specified domain
557 * that represents NaN.
559 static __isl_give isl_pw_aff
*nan_on_domain(__isl_keep isl_space
*space
)
563 ls
= isl_local_space_from_space(isl_space_copy(space
));
564 return isl_pw_aff_nan_on_domain(ls
);
567 static __isl_give isl_pw_aff
*accept_affine(__isl_keep isl_stream
*s
,
568 __isl_take isl_space
*space
, struct vars
*v
)
570 struct isl_token
*tok
= NULL
;
575 ls
= isl_local_space_from_space(isl_space_copy(space
));
576 res
= isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
583 isl_stream_error(s
, NULL
, "unexpected EOF");
586 if (tok
->type
== '-') {
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
) {
596 isl_stream_push_token(s
, tok
);
598 term
= accept_affine_factor(s
,
599 isl_space_copy(space
), v
);
601 res
= isl_pw_aff_sub(res
, term
);
603 res
= isl_pw_aff_add(res
, term
);
607 } else if (tok
->type
== ISL_TOKEN_VALUE
) {
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
)) {
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
);
620 res
= add_cst(res
, tok
->u
.v
);
623 } else if (tok
->type
== ISL_TOKEN_NAN
) {
624 res
= isl_pw_aff_add(res
, nan_on_domain(space
));
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
);
635 if (tok
&& tok
->type
== '-') {
638 } else if (tok
&& tok
->type
== '+') {
641 } else if (tok
&& tok
->type
== ISL_TOKEN_VALUE
&&
642 isl_int_is_neg(tok
->u
.v
)) {
643 isl_stream_push_token(s
, tok
);
646 isl_stream_push_token(s
, tok
);
651 isl_space_free(space
);
654 isl_space_free(space
);
656 isl_pw_aff_free(res
);
660 static int is_comparator(struct isl_token
*tok
)
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
);
683 /* Accept a ternary operator, given the first argument.
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
)
689 isl_pw_aff
*pwaff1
= NULL
, *pwaff2
= NULL
, *pa_cond
;
694 if (isl_stream_eat(s
, '?'))
697 dim
= isl_space_wrap(isl_map_get_space(cond
));
698 pwaff1
= accept_extended_affine(s
, dim
, v
, rational
);
702 if (isl_stream_eat(s
, ':'))
705 dim
= isl_pw_aff_get_domain_space(pwaff1
);
706 pwaff2
= accept_extended_affine(s
, dim
, v
, rational
);
710 pa_cond
= isl_set_indicator_function(isl_map_wrap(cond
));
711 return isl_pw_aff_cond(pa_cond
, pwaff1
, pwaff2
);
714 isl_pw_aff_free(pwaff1
);
715 isl_pw_aff_free(pwaff2
);
719 /* Set *line and *col to those of the next token, if any.
721 static void set_current_line_col(__isl_keep isl_stream
*s
, int *line
, int *col
)
723 struct isl_token
*tok
;
725 tok
= isl_stream_next_token(s
);
731 isl_stream_push_token(s
, tok
);
734 /* Push a token encapsulating "pa" onto "s", with the given
737 static int push_aff(__isl_keep isl_stream
*s
, int line
, int col
,
738 __isl_take isl_pw_aff
*pa
)
740 struct isl_token
*tok
;
742 tok
= isl_token_new(s
->ctx
, line
, col
, 0);
745 tok
->type
= ISL_TOKEN_AFF
;
747 isl_stream_push_token(s
, tok
);
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.
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
)
767 struct isl_token
*tok
;
768 int line
= -1, col
= -1;
771 set_current_line_col(s
, &line
, &col
);
773 pwaff
= accept_affine(s
, dim
, v
);
775 pwaff
= isl_pw_aff_set_rational(pwaff
);
779 tok
= isl_stream_next_token(s
);
781 return isl_pw_aff_free(pwaff
);
783 is_comp
= is_comparator(tok
);
784 isl_stream_push_token(s
, tok
);
788 space
= isl_pw_aff_get_domain_space(pwaff
);
789 cond
= isl_map_universe(isl_space_unwrap(space
));
791 if (push_aff(s
, line
, col
, pwaff
) < 0)
792 cond
= isl_map_free(cond
);
796 cond
= read_formula(s
, v
, cond
, rational
);
798 return accept_ternary(s
, cond
, v
, rational
);
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
,
809 if (type
== isl_dim_param
)
810 pos
= isl_map_dim(map
, isl_dim_param
);
812 pos
= isl_map_dim(map
, isl_dim_in
);
813 if (type
== isl_dim_out
)
814 pos
+= isl_map_dim(map
, isl_dim_out
);
819 def
= accept_extended_affine(s
, isl_space_wrap(isl_map_get_space(map
)),
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
));
825 map
= isl_map_intersect(map
, def_map
);
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
)
834 isl_pw_aff_list
*list
;
835 struct isl_token
*tok
= NULL
;
837 pwaff
= accept_affine(s
, isl_space_copy(dim
), v
);
838 list
= isl_pw_aff_list_from_pw_aff(pwaff
);
843 tok
= isl_stream_next_token(s
);
845 isl_stream_error(s
, NULL
, "unexpected EOF");
848 if (tok
->type
!= ',') {
849 isl_stream_push_token(s
, tok
);
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
));
865 isl_pw_aff_list_free(list
);
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
)
872 struct isl_token
*tok
;
874 while ((tok
= isl_stream_next_token(s
)) != NULL
) {
878 if (tok
->type
!= ISL_TOKEN_IDENT
)
881 p
= vars_pos(v
, tok
->u
.s
, -1);
885 isl_stream_error(s
, tok
, "expecting unique identifier");
889 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
892 tok
= isl_stream_next_token(s
);
893 if (tok
&& tok
->type
== '=') {
895 map
= read_var_def(s
, map
, isl_dim_out
, v
, rational
);
896 tok
= isl_stream_next_token(s
);
899 if (!tok
|| tok
->type
!= ',')
905 isl_stream_push_token(s
, tok
);
914 static int next_is_tuple(__isl_keep isl_stream
*s
)
916 struct isl_token
*tok
;
919 tok
= isl_stream_next_token(s
);
922 if (tok
->type
== '[') {
923 isl_stream_push_token(s
, tok
);
926 if (tok
->type
!= ISL_TOKEN_IDENT
&& !tok
->is_keyword
) {
927 isl_stream_push_token(s
, tok
);
931 is_tuple
= isl_stream_next_token_is(s
, '[');
933 isl_stream_push_token(s
, tok
);
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.
945 static int pw_aff_is_expr(__isl_keep isl_pw_aff
*pa
, int i
, int n
)
953 if (!isl_set_plain_is_universe(pa
->p
[0].set
))
957 if (isl_int_is_zero(aff
->v
->el
[aff
->v
->size
- n
+ i
]))
962 /* Does the tuple contain any dimensions that are defined
963 * in terms of earlier dimensions?
965 static int tuple_has_expr(__isl_keep isl_multi_pw_aff
*tuple
)
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
);
978 if (has_expr
< 0 || has_expr
)
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.
990 static __isl_give isl_space
*space_set_dim_name(__isl_take isl_space
*space
,
998 prime
= strchr(name
, '\'');
1001 space
= isl_space_set_dim_name(space
, isl_dim_out
, pos
, name
);
1008 /* Accept a piecewise affine expression.
1010 * At the outer level, the piecewise affine expression may be of the form
1012 * aff1 : condition1; aff2 : conditions2; ...
1018 * each of the affine expressions may in turn include ternary operators.
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".
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
)
1033 isl_space
*res_space
;
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
);
1041 int line
= -1, col
= -1;
1043 set_current_line_col(s
, &line
, &col
);
1044 seen_paren
= isl_stream_eat_if_available(s
, '(');
1046 pa
= accept_piecewise_affine(s
, isl_space_copy(space
),
1049 pa
= accept_extended_affine(s
, isl_space_copy(space
),
1051 if (seen_paren
&& isl_stream_eat_if_available(s
, ')')) {
1053 if (push_aff(s
, line
, col
, pa
) < 0)
1055 pa
= accept_extended_affine(s
, isl_space_copy(space
),
1058 if (isl_stream_eat_if_available(s
, ':')) {
1059 isl_space
*dom_space
;
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
);
1068 res
= isl_pw_aff_union_add(res
, pa
);
1070 if (seen_paren
&& isl_stream_eat(s
, ')'))
1072 } while (isl_stream_eat_if_available(s
, ';'));
1074 isl_space_free(space
);
1078 isl_space_free(space
);
1079 return isl_pw_aff_free(res
);
1082 /* Read an affine expression from "s" for use in read_tuple.
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.
1089 static __isl_give isl_pw_aff
*read_tuple_var_def(__isl_keep isl_stream
*s
,
1090 struct vars
*v
, int rational
)
1095 space
= isl_space_wrap(isl_space_alloc(s
->ctx
, 0, v
->n
, 0));
1097 def
= accept_piecewise_affine(s
, space
, v
, rational
);
1099 space
= isl_space_set_alloc(s
->ctx
, 0, v
->n
);
1100 def
= isl_pw_aff_reset_domain_space(def
, space
);
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.
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
,
1121 space
= isl_space_set_from_params(space
);
1123 if (isl_stream_next_token_is(s
, ']'))
1127 struct isl_token
*tok
;
1129 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
1131 space
= read_el(s
, v
, space
, rational
, user
);
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
!= ',') {
1142 isl_stream_push_token(s
, tok
);
1146 isl_token_free(tok
);
1152 /* Read a tuple space from "s" derived from the parameter space "space".
1153 * Call "read_el" on each element in the tuples.
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
,
1162 struct isl_token
*tok
;
1164 isl_space
*res
= NULL
;
1166 tok
= isl_stream_next_token(s
);
1169 if (tok
->type
== ISL_TOKEN_IDENT
|| tok
->is_keyword
) {
1170 name
= strdup(tok
->u
.s
);
1171 isl_token_free(tok
);
1175 isl_stream_push_token(s
, tok
);
1176 if (isl_stream_eat(s
, '['))
1178 if (next_is_tuple(s
)) {
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
))
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
);
1188 res
= read_tuple_list(s
, v
, isl_space_copy(space
),
1189 rational
, comma
, read_el
, user
);
1190 if (isl_stream_eat(s
, ']'))
1194 res
= isl_space_set_tuple_name(res
, isl_dim_set
, name
);
1198 isl_space_free(space
);
1202 isl_space_free(res
);
1203 isl_space_free(space
);
1207 /* Construct an isl_pw_aff defined on a space with v->n variables
1208 * that is equal to the last of those variables.
1210 static __isl_give isl_pw_aff
*identity_tuple_el(struct vars
*v
)
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
);
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
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.
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
)
1234 isl_pw_aff_list
**list
= (isl_pw_aff_list
**) user
;
1236 struct isl_token
*tok
;
1239 tok
= next_token(s
);
1241 isl_stream_error(s
, NULL
, "unexpected EOF");
1242 return isl_space_free(space
);
1245 if (tok
->type
== ISL_TOKEN_IDENT
) {
1247 int p
= vars_pos(v
, tok
->u
.s
, -1);
1253 if (tok
->type
== '*') {
1254 if (vars_add_anon(v
) < 0)
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
);
1265 pa
= identity_tuple_el(v
);
1267 isl_stream_push_token(s
, tok
);
1269 if (vars_add_anon(v
) < 0)
1271 pa
= read_tuple_var_def(s
, v
, rational
);
1274 *list
= isl_pw_aff_list_add(*list
, pa
);
1276 return isl_space_free(space
);
1280 isl_token_free(tok
);
1281 return isl_space_free(space
);
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.
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.
1299 static __isl_give isl_multi_pw_aff
*read_tuple(__isl_keep isl_stream
*s
,
1300 struct vars
*v
, int rational
, int comma
)
1304 isl_pw_aff_list
*list
;
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
) {
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
);
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
);
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".
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
,
1336 isl_space
*space
= NULL
;
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
));
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",
1353 map
= isl_map_add_dims(map
, type
, n
);
1354 for (i
= 0; i
< n
; ++i
) {
1356 if (!isl_space_has_dim_name(space
, isl_dim_set
, i
))
1357 isl_die(ctx
, isl_error_invalid
,
1358 "parameters must be named",
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
);
1363 } else if (type
== isl_dim_in
) {
1366 set
= isl_set_universe(isl_space_copy(space
));
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
);
1374 set
= isl_set_universe(isl_space_copy(space
));
1376 set
= isl_set_set_rational(set
);
1377 map
= isl_map_from_domain_and_range(isl_map_domain(map
), set
);
1380 for (i
= 0; i
< n
; ++i
) {
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
));
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
);
1401 isl_space_free(space
);
1402 isl_multi_pw_aff_free(tuple
);
1405 isl_space_free(space
);
1406 isl_multi_pw_aff_free(tuple
);
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".
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
)
1419 isl_multi_pw_aff
*tuple
;
1421 tuple
= read_tuple(s
, v
, rational
, comma
);
1423 return isl_map_free(map
);
1425 return map_from_tuple(tuple
, map
, type
, v
, rational
);
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
,
1435 left
= isl_pw_aff_list_copy(left
);
1436 right
= isl_pw_aff_list_copy(right
);
1438 left
= isl_pw_aff_list_set_rational(left
);
1439 right
= isl_pw_aff_list_set_rational(right
);
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
);
1452 cond
= isl_pw_aff_list_eq_set(left
, right
);
1454 return isl_set_intersect(set
, cond
);
1457 static __isl_give isl_map
*add_constraint(__isl_keep isl_stream
*s
,
1458 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1460 struct isl_token
*tok
= NULL
;
1461 isl_pw_aff_list
*list1
= NULL
, *list2
= NULL
;
1464 set
= isl_map_wrap(map
);
1465 list1
= accept_affine_list(s
, isl_set_get_space(set
), v
);
1468 tok
= isl_stream_next_token(s
);
1469 if (!is_comparator(tok
)) {
1470 isl_stream_error(s
, tok
, "missing operator");
1472 isl_stream_push_token(s
, tok
);
1477 list2
= accept_affine_list(s
, isl_set_get_space(set
), v
);
1481 set
= construct_constraints(set
, tok
->type
, list1
, list2
,
1483 isl_token_free(tok
);
1484 isl_pw_aff_list_free(list1
);
1487 tok
= isl_stream_next_token(s
);
1488 if (!is_comparator(tok
)) {
1490 isl_stream_push_token(s
, tok
);
1494 isl_pw_aff_list_free(list1
);
1496 return isl_set_unwrap(set
);
1499 isl_token_free(tok
);
1500 isl_pw_aff_list_free(list1
);
1501 isl_pw_aff_list_free(list2
);
1506 static __isl_give isl_map
*read_exists(__isl_keep isl_stream
*s
,
1507 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1510 int seen_paren
= isl_stream_eat_if_available(s
, '(');
1512 map
= isl_map_from_domain(isl_map_wrap(map
));
1513 map
= read_defined_var_list(s
, v
, map
, rational
);
1515 if (isl_stream_eat(s
, ':'))
1518 map
= read_formula(s
, v
, map
, rational
);
1519 map
= isl_set_unwrap(isl_map_domain(map
));
1521 vars_drop(v
, v
->n
- n
);
1522 if (seen_paren
&& isl_stream_eat(s
, ')'))
1531 /* Parse an expression between parentheses and push the result
1532 * back on the stream.
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.
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.
1546 static int resolve_paren_expr(__isl_keep isl_stream
*s
,
1547 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1549 struct isl_token
*tok
, *tok2
;
1553 tok
= isl_stream_next_token(s
);
1554 if (!tok
|| tok
->type
!= '(')
1557 if (isl_stream_next_token_is(s
, '('))
1558 if (resolve_paren_expr(s
, v
, isl_map_copy(map
), rational
))
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
, ')'))
1569 tok
->type
= ISL_TOKEN_MAP
;
1571 isl_stream_push_token(s
, tok
);
1575 tok2
= isl_stream_next_token(s
);
1580 isl_stream_push_token(s
, tok2
);
1582 pwaff
= accept_affine(s
, isl_space_wrap(isl_map_get_space(map
)), v
);
1586 tok2
= isl_token_new(s
->ctx
, line
, col
, 0);
1589 tok2
->type
= ISL_TOKEN_AFF
;
1590 tok2
->u
.pwaff
= pwaff
;
1592 if (isl_stream_eat_if_available(s
, ')')) {
1593 isl_stream_push_token(s
, tok2
);
1594 isl_token_free(tok
);
1599 isl_stream_push_token(s
, tok2
);
1601 map
= read_formula(s
, v
, map
, rational
);
1602 if (isl_stream_eat(s
, ')'))
1605 tok
->type
= ISL_TOKEN_MAP
;
1607 isl_stream_push_token(s
, tok
);
1611 isl_pw_aff_free(pwaff
);
1613 isl_token_free(tok
);
1618 static __isl_give isl_map
*read_conjunct(__isl_keep isl_stream
*s
,
1619 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1621 if (isl_stream_next_token_is(s
, '('))
1622 if (resolve_paren_expr(s
, v
, isl_map_copy(map
), rational
))
1625 if (isl_stream_next_token_is(s
, ISL_TOKEN_MAP
)) {
1626 struct isl_token
*tok
;
1627 tok
= isl_stream_next_token(s
);
1631 map
= isl_map_copy(tok
->u
.map
);
1632 isl_token_free(tok
);
1636 if (isl_stream_eat_if_available(s
, ISL_TOKEN_EXISTS
))
1637 return read_exists(s
, v
, map
, rational
);
1639 if (isl_stream_eat_if_available(s
, ISL_TOKEN_TRUE
))
1642 if (isl_stream_eat_if_available(s
, ISL_TOKEN_FALSE
)) {
1643 isl_space
*dim
= isl_map_get_space(map
);
1645 return isl_map_empty(dim
);
1648 return add_constraint(s
, v
, map
, rational
);
1654 static __isl_give isl_map
*read_conjuncts(__isl_keep isl_stream
*s
,
1655 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1660 negate
= isl_stream_eat_if_available(s
, ISL_TOKEN_NOT
);
1661 res
= read_conjunct(s
, v
, isl_map_copy(map
), rational
);
1663 res
= isl_map_subtract(isl_map_copy(map
), res
);
1665 while (res
&& isl_stream_eat_if_available(s
, ISL_TOKEN_AND
)) {
1668 negate
= isl_stream_eat_if_available(s
, ISL_TOKEN_NOT
);
1669 res_i
= read_conjunct(s
, v
, isl_map_copy(map
), rational
);
1671 res
= isl_map_subtract(res
, res_i
);
1673 res
= isl_map_intersect(res
, res_i
);
1680 static struct isl_map
*read_disjuncts(__isl_keep isl_stream
*s
,
1681 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1685 if (isl_stream_next_token_is(s
, '}')) {
1686 isl_space
*dim
= isl_map_get_space(map
);
1688 return isl_map_universe(dim
);
1691 res
= read_conjuncts(s
, v
, isl_map_copy(map
), rational
);
1692 while (isl_stream_eat_if_available(s
, ISL_TOKEN_OR
)) {
1695 res_i
= read_conjuncts(s
, v
, isl_map_copy(map
), rational
);
1696 res
= isl_map_union(res
, res_i
);
1703 /* Read a first order formula from "s", add the corresponding
1704 * constraints to "map" and return the result.
1706 * In particular, read a formula of the form
1714 * where a and b are disjunctions.
1716 * In the first case, map is replaced by
1718 * map \cap { [..] : a }
1720 * In the second case, it is replaced by
1722 * (map \setminus { [..] : a}) \cup (map \cap { [..] : b })
1724 static __isl_give isl_map
*read_formula(__isl_keep isl_stream
*s
,
1725 struct vars
*v
, __isl_take isl_map
*map
, int rational
)
1729 res
= read_disjuncts(s
, v
, isl_map_copy(map
), rational
);
1731 if (isl_stream_eat_if_available(s
, ISL_TOKEN_IMPLIES
)) {
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
);
1743 static int polylib_pos_to_isl_pos(__isl_keep isl_basic_map
*bmap
, int pos
)
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
);
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
);
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
);
1760 if (pos
< isl_basic_map_dim(bmap
, isl_dim_param
))
1766 static __isl_give isl_basic_map
*basic_map_read_polylib_constraint(
1767 __isl_keep isl_stream
*s
, __isl_take isl_basic_map
*bmap
)
1770 struct isl_token
*tok
;
1780 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
1781 dim
= isl_basic_map_dim(bmap
, isl_dim_out
);
1783 tok
= isl_stream_next_token(s
);
1784 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
1785 isl_stream_error(s
, tok
, "expecting coefficient");
1787 isl_stream_push_token(s
, tok
);
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
);
1796 type
= isl_int_get_si(tok
->u
.v
);
1797 isl_token_free(tok
);
1799 isl_assert(s
->ctx
, type
== 0 || type
== 1, goto error
);
1801 k
= isl_basic_map_alloc_equality(bmap
);
1804 k
= isl_basic_map_alloc_inequality(bmap
);
1810 for (j
= 0; j
< 1 + isl_basic_map_total_dim(bmap
); ++j
) {
1812 tok
= isl_stream_next_token(s
);
1813 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
1814 isl_stream_error(s
, tok
, "expecting coefficient");
1816 isl_stream_push_token(s
, tok
);
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
);
1825 pos
= polylib_pos_to_isl_pos(bmap
, j
);
1826 isl_int_set(c
[pos
], tok
->u
.v
);
1827 isl_token_free(tok
);
1832 isl_basic_map_free(bmap
);
1836 static __isl_give isl_basic_map
*basic_map_read_polylib(
1837 __isl_keep isl_stream
*s
)
1840 struct isl_token
*tok
;
1841 struct isl_token
*tok2
;
1844 unsigned in
= 0, out
, local
= 0;
1845 struct isl_basic_map
*bmap
= NULL
;
1848 tok
= isl_stream_next_token(s
);
1850 isl_stream_error(s
, NULL
, "unexpected EOF");
1853 tok2
= isl_stream_next_token(s
);
1855 isl_token_free(tok
);
1856 isl_stream_error(s
, NULL
, "unexpected EOF");
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");
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
);
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
);
1882 out
= isl_int_get_si(tok
->u
.v
);
1883 isl_token_free(tok
);
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");
1890 isl_stream_push_token(s
, tok
);
1893 in
= isl_int_get_si(tok
->u
.v
);
1894 isl_token_free(tok
);
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");
1901 isl_stream_push_token(s
, tok
);
1904 local
= isl_int_get_si(tok
->u
.v
);
1905 isl_token_free(tok
);
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");
1912 isl_stream_push_token(s
, tok
);
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");
1923 out
= n_col
- 2 - nparam
;
1924 bmap
= isl_basic_map_alloc(s
->ctx
, nparam
, in
, out
, local
, n_row
, n_row
);
1928 for (i
= 0; i
< local
; ++i
) {
1929 int k
= isl_basic_map_alloc_div(bmap
);
1932 isl_seq_clr(bmap
->div
[k
], 1 + 1 + nparam
+ in
+ out
+ local
);
1935 for (i
= 0; i
< n_row
; ++i
)
1936 bmap
= basic_map_read_polylib_constraint(s
, bmap
);
1938 tok
= isl_stream_next_token_on_same_line(s
);
1940 isl_stream_error(s
, tok
, "unexpected extra token on line");
1941 isl_stream_push_token(s
, tok
);
1945 bmap
= isl_basic_map_simplify(bmap
);
1946 bmap
= isl_basic_map_finalize(bmap
);
1949 isl_basic_map_free(bmap
);
1953 static struct isl_map
*map_read_polylib(__isl_keep isl_stream
*s
)
1955 struct isl_token
*tok
;
1956 struct isl_token
*tok2
;
1958 struct isl_map
*map
;
1960 tok
= isl_stream_next_token(s
);
1962 isl_stream_error(s
, NULL
, "unexpected EOF");
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
));
1972 isl_stream_error(s
, tok2
, "unexpected token");
1973 isl_stream_push_token(s
, tok2
);
1974 isl_stream_push_token(s
, tok
);
1977 n
= isl_int_get_si(tok
->u
.v
);
1978 isl_token_free(tok
);
1980 isl_assert(s
->ctx
, n
>= 1, return NULL
);
1982 map
= isl_map_from_basic_map(basic_map_read_polylib(s
));
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
)));
1991 static int optional_power(__isl_keep isl_stream
*s
)
1994 struct isl_token
*tok
;
1996 tok
= isl_stream_next_token(s
);
1999 if (tok
->type
!= '^') {
2000 isl_stream_push_token(s
, tok
);
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");
2008 isl_stream_push_token(s
, tok
);
2011 pow
= isl_int_get_si(tok
->u
.v
);
2012 isl_token_free(tok
);
2016 static __isl_give isl_pw_qpolynomial
*read_term(__isl_keep isl_stream
*s
,
2017 __isl_keep isl_map
*map
, struct vars
*v
);
2019 static __isl_give isl_pw_qpolynomial
*read_factor(__isl_keep isl_stream
*s
,
2020 __isl_keep isl_map
*map
, struct vars
*v
)
2022 isl_pw_qpolynomial
*pwqp
;
2023 struct isl_token
*tok
;
2025 tok
= next_token(s
);
2027 isl_stream_error(s
, NULL
, "unexpected EOF");
2030 if (tok
->type
== '(') {
2033 isl_token_free(tok
);
2034 pwqp
= read_term(s
, map
, v
);
2037 if (isl_stream_eat(s
, ')'))
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
;
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
);
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
);
2059 isl_stream_push_token(s
, tok2
);
2060 qp
= isl_qpolynomial_cst_on_domain(isl_map_get_space(map
),
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
) {
2077 int pos
= vars_pos(v
, tok
->u
.s
, -1);
2079 isl_qpolynomial
*qp
;
2081 isl_token_free(tok
);
2085 vars_drop(v
, v
->n
- n
);
2086 isl_stream_error(s
, tok
, "unknown identifier");
2087 isl_token_free(tok
);
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
)) {
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
);
2108 isl_stream_error(s
, tok
, "unexpected isl_token");
2109 isl_stream_push_token(s
, tok
);
2113 if (isl_stream_eat_if_available(s
, '*') ||
2114 isl_stream_next_token_is(s
, ISL_TOKEN_IDENT
)) {
2115 isl_pw_qpolynomial
*pwqp2
;
2117 pwqp2
= read_factor(s
, map
, v
);
2118 pwqp
= isl_pw_qpolynomial_mul(pwqp
, pwqp2
);
2123 isl_pw_qpolynomial_free(pwqp
);
2127 static __isl_give isl_pw_qpolynomial
*read_term(__isl_keep isl_stream
*s
,
2128 __isl_keep isl_map
*map
, struct vars
*v
)
2130 struct isl_token
*tok
;
2131 isl_pw_qpolynomial
*pwqp
;
2133 pwqp
= read_factor(s
, map
, v
);
2136 tok
= next_token(s
);
2140 if (tok
->type
== '+') {
2141 isl_pw_qpolynomial
*pwqp2
;
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
;
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
;
2156 isl_stream_push_token(s
, tok
);
2157 pwqp2
= read_factor(s
, map
, v
);
2158 pwqp
= isl_pw_qpolynomial_add(pwqp
, pwqp2
);
2160 isl_stream_push_token(s
, tok
);
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
)
2171 struct isl_token
*tok
;
2173 tok
= isl_stream_next_token(s
);
2175 isl_stream_error(s
, NULL
, "unexpected EOF");
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
);
2183 isl_stream_push_token(s
, tok
);
2191 static struct isl_obj
obj_read_poly(__isl_keep isl_stream
*s
,
2192 __isl_take isl_map
*map
, struct vars
*v
, int n
)
2194 struct isl_obj obj
= { isl_obj_pw_qpolynomial
, NULL
};
2195 isl_pw_qpolynomial
*pwqp
;
2196 struct isl_set
*set
;
2198 pwqp
= read_term(s
, map
, v
);
2199 map
= read_optional_formula(s
, map
, v
, 0);
2200 set
= isl_map_range(map
);
2202 pwqp
= isl_pw_qpolynomial_intersect_domain(pwqp
, set
);
2204 vars_drop(v
, v
->n
- n
);
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
)
2213 struct isl_obj obj
= { isl_obj_pw_qpolynomial_fold
, NULL
};
2214 isl_pw_qpolynomial
*pwqp
;
2215 isl_pw_qpolynomial_fold
*pwf
= NULL
;
2217 if (!isl_stream_eat_if_available(s
, ISL_TOKEN_MAX
))
2218 return obj_read_poly(s
, set
, v
, n
);
2220 if (isl_stream_eat(s
, '('))
2223 pwqp
= read_term(s
, set
, v
);
2224 pwf
= isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max
, pwqp
);
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
,
2231 pwf
= isl_pw_qpolynomial_fold_fold(pwf
, pwf_i
);
2234 if (isl_stream_eat(s
, ')'))
2237 set
= read_optional_formula(s
, set
, v
, 0);
2238 pwf
= isl_pw_qpolynomial_fold_intersect_domain(pwf
, set
);
2240 vars_drop(v
, v
->n
- n
);
2246 isl_pw_qpolynomial_fold_free(pwf
);
2247 obj
.type
= isl_obj_none
;
2251 static int is_rational(__isl_keep isl_stream
*s
)
2253 struct isl_token
*tok
;
2255 tok
= isl_stream_next_token(s
);
2258 if (tok
->type
== ISL_TOKEN_RAT
&& isl_stream_next_token_is(s
, ':')) {
2259 isl_token_free(tok
);
2260 isl_stream_eat(s
, ':');
2264 isl_stream_push_token(s
, tok
);
2269 static struct isl_obj
obj_read_body(__isl_keep isl_stream
*s
,
2270 __isl_take isl_map
*map
, struct vars
*v
)
2272 struct isl_token
*tok
;
2273 struct isl_obj obj
= { isl_obj_set
, NULL
};
2277 rational
= is_rational(s
);
2279 map
= isl_map_set_rational(map
);
2281 if (isl_stream_next_token_is(s
, ':')) {
2282 obj
.type
= isl_obj_set
;
2283 obj
.v
= read_optional_formula(s
, map
, v
, rational
);
2287 if (!next_is_tuple(s
))
2288 return obj_read_poly_or_fold(s
, map
, v
, n
);
2290 map
= read_map_tuple(s
, map
, isl_dim_in
, v
, rational
, 0);
2293 tok
= isl_stream_next_token(s
);
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
);
2303 map
= read_map_tuple(s
, map
, isl_dim_out
, v
, rational
, 0);
2307 map
= isl_map_domain(map
);
2308 isl_stream_push_token(s
, tok
);
2311 map
= read_optional_formula(s
, map
, v
, rational
);
2313 vars_drop(v
, v
->n
- n
);
2319 obj
.type
= isl_obj_none
;
2323 static struct isl_obj
to_union(isl_ctx
*ctx
, struct isl_obj obj
)
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
;
2338 isl_assert(ctx
, 0, goto error
);
2341 obj
.type
->free(obj
.v
);
2342 obj
.type
= isl_obj_none
;
2346 static struct isl_obj
obj_add(__isl_keep isl_stream
*s
,
2347 struct isl_obj obj1
, struct isl_obj obj2
)
2349 if (obj1
.type
== isl_obj_set
&& obj2
.type
== isl_obj_union_set
)
2350 obj1
= to_union(s
->ctx
, obj1
);
2351 if (obj1
.type
== isl_obj_union_set
&& obj2
.type
== isl_obj_set
)
2352 obj2
= to_union(s
->ctx
, obj2
);
2353 if (obj1
.type
== isl_obj_map
&& obj2
.type
== isl_obj_union_map
)
2354 obj1
= to_union(s
->ctx
, obj1
);
2355 if (obj1
.type
== isl_obj_union_map
&& obj2
.type
== isl_obj_map
)
2356 obj2
= to_union(s
->ctx
, obj2
);
2357 if (obj1
.type
== isl_obj_pw_qpolynomial
&&
2358 obj2
.type
== isl_obj_union_pw_qpolynomial
)
2359 obj1
= to_union(s
->ctx
, obj1
);
2360 if (obj1
.type
== isl_obj_union_pw_qpolynomial
&&
2361 obj2
.type
== isl_obj_pw_qpolynomial
)
2362 obj2
= to_union(s
->ctx
, obj2
);
2363 if (obj1
.type
== isl_obj_pw_qpolynomial_fold
&&
2364 obj2
.type
== isl_obj_union_pw_qpolynomial_fold
)
2365 obj1
= to_union(s
->ctx
, obj1
);
2366 if (obj1
.type
== isl_obj_union_pw_qpolynomial_fold
&&
2367 obj2
.type
== isl_obj_pw_qpolynomial_fold
)
2368 obj2
= to_union(s
->ctx
, obj2
);
2369 if (obj1
.type
!= obj2
.type
) {
2370 isl_stream_error(s
, NULL
,
2371 "attempt to combine incompatible objects");
2374 if (!obj1
.type
->add
)
2375 isl_die(s
->ctx
, isl_error_internal
,
2376 "combination not supported on object type", goto error
);
2377 if (obj1
.type
== isl_obj_map
&& !isl_map_has_equal_space(obj1
.v
, obj2
.v
)) {
2378 obj1
= to_union(s
->ctx
, obj1
);
2379 obj2
= to_union(s
->ctx
, obj2
);
2381 if (obj1
.type
== isl_obj_set
&& !isl_set_has_equal_space(obj1
.v
, obj2
.v
)) {
2382 obj1
= to_union(s
->ctx
, obj1
);
2383 obj2
= to_union(s
->ctx
, obj2
);
2385 if (obj1
.type
== isl_obj_pw_qpolynomial
&&
2386 !isl_pw_qpolynomial_has_equal_space(obj1
.v
, obj2
.v
)) {
2387 obj1
= to_union(s
->ctx
, obj1
);
2388 obj2
= to_union(s
->ctx
, obj2
);
2390 if (obj1
.type
== isl_obj_pw_qpolynomial_fold
&&
2391 !isl_pw_qpolynomial_fold_has_equal_space(obj1
.v
, obj2
.v
)) {
2392 obj1
= to_union(s
->ctx
, obj1
);
2393 obj2
= to_union(s
->ctx
, obj2
);
2395 obj1
.v
= obj1
.type
->add(obj1
.v
, obj2
.v
);
2398 obj1
.type
->free(obj1
.v
);
2399 obj2
.type
->free(obj2
.v
);
2400 obj1
.type
= isl_obj_none
;
2405 /* Are the first two tokens on "s", "domain" (either as a string
2406 * or as an identifier) followed by ":"?
2408 static int next_is_domain_colon(__isl_keep isl_stream
*s
)
2410 struct isl_token
*tok
;
2414 tok
= isl_stream_next_token(s
);
2417 if (tok
->type
!= ISL_TOKEN_IDENT
&& tok
->type
!= ISL_TOKEN_STRING
) {
2418 isl_stream_push_token(s
, tok
);
2422 name
= isl_token_get_str(s
->ctx
, tok
);
2423 res
= !strcmp(name
, "domain") && isl_stream_next_token_is(s
, ':');
2426 isl_stream_push_token(s
, tok
);
2431 /* Do the first tokens on "s" look like a schedule?
2433 * The root of a schedule is always a domain node, so the first thing
2434 * we expect in the stream is a domain key, i.e., "domain" followed
2435 * by ":". If the schedule was printed in YAML flow style, then
2436 * we additionally expect a "{" to open the outer mapping.
2438 static int next_is_schedule(__isl_keep isl_stream
*s
)
2440 struct isl_token
*tok
;
2443 tok
= isl_stream_next_token(s
);
2446 if (tok
->type
!= '{') {
2447 isl_stream_push_token(s
, tok
);
2448 return next_is_domain_colon(s
);
2451 is_schedule
= next_is_domain_colon(s
);
2452 isl_stream_push_token(s
, tok
);
2457 /* Read an isl_schedule from "s" and store it in an isl_obj.
2459 static struct isl_obj
schedule_read(__isl_keep isl_stream
*s
)
2463 obj
.type
= isl_obj_schedule
;
2464 obj
.v
= isl_stream_read_schedule(s
);
2469 static struct isl_obj
obj_read(__isl_keep isl_stream
*s
)
2471 isl_map
*map
= NULL
;
2472 struct isl_token
*tok
;
2473 struct vars
*v
= NULL
;
2474 struct isl_obj obj
= { isl_obj_set
, NULL
};
2476 if (next_is_schedule(s
))
2477 return schedule_read(s
);
2479 tok
= next_token(s
);
2481 isl_stream_error(s
, NULL
, "unexpected EOF");
2484 if (tok
->type
== ISL_TOKEN_VALUE
) {
2485 struct isl_token
*tok2
;
2486 struct isl_map
*map
;
2488 tok2
= isl_stream_next_token(s
);
2489 if (!tok2
|| tok2
->type
!= ISL_TOKEN_VALUE
||
2490 isl_int_is_neg(tok2
->u
.v
)) {
2492 isl_stream_push_token(s
, tok2
);
2493 obj
.type
= isl_obj_val
;
2494 obj
.v
= isl_val_int_from_isl_int(s
->ctx
, tok
->u
.v
);
2495 isl_token_free(tok
);
2498 isl_stream_push_token(s
, tok2
);
2499 isl_stream_push_token(s
, tok
);
2500 map
= map_read_polylib(s
);
2503 if (isl_map_may_be_set(map
))
2504 obj
.v
= isl_map_range(map
);
2506 obj
.type
= isl_obj_map
;
2511 v
= vars_new(s
->ctx
);
2513 isl_stream_push_token(s
, tok
);
2516 map
= isl_map_universe(isl_space_params_alloc(s
->ctx
, 0));
2517 if (tok
->type
== '[') {
2518 isl_stream_push_token(s
, tok
);
2519 map
= read_map_tuple(s
, map
, isl_dim_param
, v
, 0, 0);
2522 tok
= isl_stream_next_token(s
);
2523 if (!tok
|| tok
->type
!= ISL_TOKEN_TO
) {
2524 isl_stream_error(s
, tok
, "expecting '->'");
2526 isl_stream_push_token(s
, tok
);
2529 isl_token_free(tok
);
2530 tok
= isl_stream_next_token(s
);
2532 if (!tok
|| tok
->type
!= '{') {
2533 isl_stream_error(s
, tok
, "expecting '{'");
2535 isl_stream_push_token(s
, tok
);
2538 isl_token_free(tok
);
2540 tok
= isl_stream_next_token(s
);
2543 else if (tok
->type
== ISL_TOKEN_IDENT
&& !strcmp(tok
->u
.s
, "Sym")) {
2544 isl_token_free(tok
);
2545 if (isl_stream_eat(s
, '='))
2547 map
= read_map_tuple(s
, map
, isl_dim_param
, v
, 0, 1);
2550 } else if (tok
->type
== '}') {
2551 obj
.type
= isl_obj_union_set
;
2552 obj
.v
= isl_union_set_empty(isl_map_get_space(map
));
2553 isl_token_free(tok
);
2556 isl_stream_push_token(s
, tok
);
2561 o
= obj_read_body(s
, isl_map_copy(map
), v
);
2562 if (o
.type
== isl_obj_none
|| !o
.v
)
2567 obj
= obj_add(s
, obj
, o
);
2568 if (obj
.type
== isl_obj_none
|| !obj
.v
)
2571 tok
= isl_stream_next_token(s
);
2572 if (!tok
|| tok
->type
!= ';')
2574 isl_token_free(tok
);
2575 if (isl_stream_next_token_is(s
, '}')) {
2576 tok
= isl_stream_next_token(s
);
2581 if (tok
&& tok
->type
== '}') {
2582 isl_token_free(tok
);
2584 isl_stream_error(s
, tok
, "unexpected isl_token");
2586 isl_token_free(tok
);
2596 obj
.type
->free(obj
.v
);
2603 struct isl_obj
isl_stream_read_obj(__isl_keep isl_stream
*s
)
2608 __isl_give isl_map
*isl_stream_read_map(__isl_keep isl_stream
*s
)
2614 isl_assert(s
->ctx
, obj
.type
== isl_obj_map
||
2615 obj
.type
== isl_obj_set
, goto error
);
2617 if (obj
.type
== isl_obj_set
)
2618 obj
.v
= isl_map_from_range(obj
.v
);
2622 obj
.type
->free(obj
.v
);
2626 __isl_give isl_set
*isl_stream_read_set(__isl_keep isl_stream
*s
)
2632 if (obj
.type
== isl_obj_map
&& isl_map_may_be_set(obj
.v
)) {
2633 obj
.v
= isl_map_range(obj
.v
);
2634 obj
.type
= isl_obj_set
;
2636 isl_assert(s
->ctx
, obj
.type
== isl_obj_set
, goto error
);
2641 obj
.type
->free(obj
.v
);
2645 __isl_give isl_union_map
*isl_stream_read_union_map(__isl_keep isl_stream
*s
)
2650 if (obj
.type
== isl_obj_map
) {
2651 obj
.type
= isl_obj_union_map
;
2652 obj
.v
= isl_union_map_from_map(obj
.v
);
2654 if (obj
.type
== isl_obj_set
) {
2655 obj
.type
= isl_obj_union_set
;
2656 obj
.v
= isl_union_set_from_set(obj
.v
);
2658 if (obj
.v
&& obj
.type
== isl_obj_union_set
&&
2659 isl_union_set_is_empty(obj
.v
))
2660 obj
.type
= isl_obj_union_map
;
2661 if (obj
.v
&& obj
.type
!= isl_obj_union_map
)
2662 isl_die(s
->ctx
, isl_error_invalid
, "invalid input", goto error
);
2666 obj
.type
->free(obj
.v
);
2670 __isl_give isl_union_set
*isl_stream_read_union_set(__isl_keep isl_stream
*s
)
2675 if (obj
.type
== isl_obj_set
) {
2676 obj
.type
= isl_obj_union_set
;
2677 obj
.v
= isl_union_set_from_set(obj
.v
);
2680 isl_assert(s
->ctx
, obj
.type
== isl_obj_union_set
, goto error
);
2684 obj
.type
->free(obj
.v
);
2688 static __isl_give isl_basic_map
*basic_map_read(__isl_keep isl_stream
*s
)
2691 struct isl_map
*map
;
2692 struct isl_basic_map
*bmap
;
2695 if (obj
.v
&& (obj
.type
!= isl_obj_map
&& obj
.type
!= isl_obj_set
))
2696 isl_die(s
->ctx
, isl_error_invalid
, "not a (basic) set or map",
2703 isl_die(s
->ctx
, isl_error_invalid
,
2704 "set or map description involves "
2705 "more than one disjunct", goto error
);
2708 bmap
= isl_basic_map_empty_like_map(map
);
2710 bmap
= isl_basic_map_copy(map
->p
[0]);
2716 obj
.type
->free(obj
.v
);
2720 static __isl_give isl_basic_set
*basic_set_read(__isl_keep isl_stream
*s
)
2722 isl_basic_map
*bmap
;
2723 bmap
= basic_map_read(s
);
2726 if (!isl_basic_map_may_be_set(bmap
))
2727 isl_die(s
->ctx
, isl_error_invalid
,
2728 "input is not a set", goto error
);
2729 return isl_basic_map_range(bmap
);
2731 isl_basic_map_free(bmap
);
2735 __isl_give isl_basic_map
*isl_basic_map_read_from_file(isl_ctx
*ctx
,
2738 struct isl_basic_map
*bmap
;
2739 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2742 bmap
= basic_map_read(s
);
2747 __isl_give isl_basic_set
*isl_basic_set_read_from_file(isl_ctx
*ctx
,
2750 isl_basic_set
*bset
;
2751 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2754 bset
= basic_set_read(s
);
2759 struct isl_basic_map
*isl_basic_map_read_from_str(struct isl_ctx
*ctx
,
2762 struct isl_basic_map
*bmap
;
2763 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2766 bmap
= basic_map_read(s
);
2771 struct isl_basic_set
*isl_basic_set_read_from_str(struct isl_ctx
*ctx
,
2774 isl_basic_set
*bset
;
2775 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2778 bset
= basic_set_read(s
);
2783 __isl_give isl_map
*isl_map_read_from_file(struct isl_ctx
*ctx
,
2786 struct isl_map
*map
;
2787 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2790 map
= isl_stream_read_map(s
);
2795 __isl_give isl_map
*isl_map_read_from_str(struct isl_ctx
*ctx
,
2798 struct isl_map
*map
;
2799 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2802 map
= isl_stream_read_map(s
);
2807 __isl_give isl_set
*isl_set_read_from_file(struct isl_ctx
*ctx
,
2811 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2814 set
= isl_stream_read_set(s
);
2819 struct isl_set
*isl_set_read_from_str(struct isl_ctx
*ctx
,
2823 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2826 set
= isl_stream_read_set(s
);
2831 __isl_give isl_union_map
*isl_union_map_read_from_file(isl_ctx
*ctx
,
2834 isl_union_map
*umap
;
2835 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2838 umap
= isl_stream_read_union_map(s
);
2843 __isl_give isl_union_map
*isl_union_map_read_from_str(struct isl_ctx
*ctx
,
2846 isl_union_map
*umap
;
2847 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2850 umap
= isl_stream_read_union_map(s
);
2855 __isl_give isl_union_set
*isl_union_set_read_from_file(isl_ctx
*ctx
,
2858 isl_union_set
*uset
;
2859 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2862 uset
= isl_stream_read_union_set(s
);
2867 __isl_give isl_union_set
*isl_union_set_read_from_str(struct isl_ctx
*ctx
,
2870 isl_union_set
*uset
;
2871 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2874 uset
= isl_stream_read_union_set(s
);
2879 static __isl_give isl_vec
*isl_vec_read_polylib(__isl_keep isl_stream
*s
)
2881 struct isl_vec
*vec
= NULL
;
2882 struct isl_token
*tok
;
2886 tok
= isl_stream_next_token(s
);
2887 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
2888 isl_stream_error(s
, tok
, "expecting vector length");
2892 size
= isl_int_get_si(tok
->u
.v
);
2893 isl_token_free(tok
);
2895 vec
= isl_vec_alloc(s
->ctx
, size
);
2897 for (j
= 0; j
< size
; ++j
) {
2898 tok
= isl_stream_next_token(s
);
2899 if (!tok
|| tok
->type
!= ISL_TOKEN_VALUE
) {
2900 isl_stream_error(s
, tok
, "expecting constant value");
2903 isl_int_set(vec
->el
[j
], tok
->u
.v
);
2904 isl_token_free(tok
);
2909 isl_token_free(tok
);
2914 static __isl_give isl_vec
*vec_read(__isl_keep isl_stream
*s
)
2916 return isl_vec_read_polylib(s
);
2919 __isl_give isl_vec
*isl_vec_read_from_file(isl_ctx
*ctx
, FILE *input
)
2922 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2930 __isl_give isl_pw_qpolynomial
*isl_stream_read_pw_qpolynomial(
2931 __isl_keep isl_stream
*s
)
2937 isl_assert(s
->ctx
, obj
.type
== isl_obj_pw_qpolynomial
,
2942 obj
.type
->free(obj
.v
);
2946 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_read_from_str(isl_ctx
*ctx
,
2949 isl_pw_qpolynomial
*pwqp
;
2950 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
2953 pwqp
= isl_stream_read_pw_qpolynomial(s
);
2958 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_read_from_file(isl_ctx
*ctx
,
2961 isl_pw_qpolynomial
*pwqp
;
2962 isl_stream
*s
= isl_stream_new_file(ctx
, input
);
2965 pwqp
= isl_stream_read_pw_qpolynomial(s
);
2970 /* Is the next token an identifer not in "v"?
2972 static int next_is_fresh_ident(__isl_keep isl_stream
*s
, struct vars
*v
)
2976 struct isl_token
*tok
;
2978 tok
= isl_stream_next_token(s
);
2981 fresh
= tok
->type
== ISL_TOKEN_IDENT
&& vars_pos(v
, tok
->u
.s
, -1) >= n
;
2982 isl_stream_push_token(s
, tok
);
2984 vars_drop(v
, v
->n
- n
);
2989 /* First read the domain of the affine expression, which may be
2990 * a parameter space or a set.
2991 * The tricky part is that we don't know if the domain is a set or not,
2992 * so when we are trying to read the domain, we may actually be reading
2993 * the affine expression itself (defined on a parameter domains)
2994 * If the tuple we are reading is named, we assume it's the domain.
2995 * Also, if inside the tuple, the first thing we find is a nested tuple
2996 * or a new identifier, we again assume it's the domain.
2997 * Otherwise, we assume we are reading an affine expression.
2999 static __isl_give isl_set
*read_aff_domain(__isl_keep isl_stream
*s
,
3000 __isl_take isl_set
*dom
, struct vars
*v
)
3002 struct isl_token
*tok
;
3004 tok
= isl_stream_next_token(s
);
3005 if (tok
&& (tok
->type
== ISL_TOKEN_IDENT
|| tok
->is_keyword
)) {
3006 isl_stream_push_token(s
, tok
);
3007 return read_map_tuple(s
, dom
, isl_dim_set
, v
, 1, 0);
3009 if (!tok
|| tok
->type
!= '[') {
3010 isl_stream_error(s
, tok
, "expecting '['");
3013 if (next_is_tuple(s
) || next_is_fresh_ident(s
, v
)) {
3014 isl_stream_push_token(s
, tok
);
3015 dom
= read_map_tuple(s
, dom
, isl_dim_set
, v
, 1, 0);
3017 isl_stream_push_token(s
, tok
);
3022 isl_stream_push_token(s
, tok
);
3027 /* Read an affine expression from "s".
3029 __isl_give isl_aff
*isl_stream_read_aff(__isl_keep isl_stream
*s
)
3034 ma
= isl_stream_read_multi_aff(s
);
3037 if (isl_multi_aff_dim(ma
, isl_dim_out
) != 1)
3038 isl_die(s
->ctx
, isl_error_invalid
,
3039 "expecting single affine expression",
3042 aff
= isl_multi_aff_get_aff(ma
, 0);
3043 isl_multi_aff_free(ma
);
3046 isl_multi_aff_free(ma
);
3050 /* Read a piecewise affine expression from "s" with domain (space) "dom".
3052 static __isl_give isl_pw_aff
*read_pw_aff_with_dom(__isl_keep isl_stream
*s
,
3053 __isl_take isl_set
*dom
, struct vars
*v
)
3055 isl_pw_aff
*pwaff
= NULL
;
3057 if (!isl_set_is_params(dom
) && isl_stream_eat(s
, ISL_TOKEN_TO
))
3060 if (isl_stream_eat(s
, '['))
3063 pwaff
= accept_affine(s
, isl_set_get_space(dom
), v
);
3065 if (isl_stream_eat(s
, ']'))
3068 dom
= read_optional_formula(s
, dom
, v
, 0);
3069 pwaff
= isl_pw_aff_intersect_domain(pwaff
, dom
);
3074 isl_pw_aff_free(pwaff
);
3078 __isl_give isl_pw_aff
*isl_stream_read_pw_aff(__isl_keep isl_stream
*s
)
3081 isl_set
*dom
= NULL
;
3083 isl_pw_aff
*pa
= NULL
;
3086 v
= vars_new(s
->ctx
);
3090 dom
= isl_set_universe(isl_space_params_alloc(s
->ctx
, 0));
3091 if (next_is_tuple(s
)) {
3092 dom
= read_map_tuple(s
, dom
, isl_dim_param
, v
, 1, 0);
3093 if (isl_stream_eat(s
, ISL_TOKEN_TO
))
3096 if (isl_stream_eat(s
, '{'))
3100 aff_dom
= read_aff_domain(s
, isl_set_copy(dom
), v
);
3101 pa
= read_pw_aff_with_dom(s
, aff_dom
, v
);
3102 vars_drop(v
, v
->n
- n
);
3104 while (isl_stream_eat_if_available(s
, ';')) {
3108 aff_dom
= read_aff_domain(s
, isl_set_copy(dom
), v
);
3109 pa_i
= read_pw_aff_with_dom(s
, aff_dom
, v
);
3110 vars_drop(v
, v
->n
- n
);
3112 pa
= isl_pw_aff_union_add(pa
, pa_i
);
3115 if (isl_stream_eat(s
, '}'))
3124 isl_pw_aff_free(pa
);
3128 __isl_give isl_aff
*isl_aff_read_from_str(isl_ctx
*ctx
, const char *str
)
3131 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3134 aff
= isl_stream_read_aff(s
);
3139 __isl_give isl_pw_aff
*isl_pw_aff_read_from_str(isl_ctx
*ctx
, const char *str
)
3142 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3145 pa
= isl_stream_read_pw_aff(s
);
3150 /* Read an isl_pw_multi_aff from "s".
3151 * We currently read a generic object and if it turns out to be a set or
3152 * a map, we convert that to an isl_pw_multi_aff.
3153 * It would be more efficient if we were to construct the isl_pw_multi_aff
3156 __isl_give isl_pw_multi_aff
*isl_stream_read_pw_multi_aff(
3157 __isl_keep isl_stream
*s
)
3165 if (obj
.type
== isl_obj_map
)
3166 return isl_pw_multi_aff_from_map(obj
.v
);
3167 if (obj
.type
== isl_obj_set
)
3168 return isl_pw_multi_aff_from_set(obj
.v
);
3170 obj
.type
->free(obj
.v
);
3171 isl_die(s
->ctx
, isl_error_invalid
, "unexpected object type",
3175 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_read_from_str(isl_ctx
*ctx
,
3178 isl_pw_multi_aff
*pma
;
3179 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3182 pma
= isl_stream_read_pw_multi_aff(s
);
3187 /* Read an isl_union_pw_multi_aff from "s".
3188 * We currently read a generic object and if it turns out to be a set or
3189 * a map, we convert that to an isl_union_pw_multi_aff.
3190 * It would be more efficient if we were to construct
3191 * the isl_union_pw_multi_aff directly.
3193 __isl_give isl_union_pw_multi_aff
*isl_stream_read_union_pw_multi_aff(
3194 __isl_keep isl_stream
*s
)
3202 if (obj
.type
== isl_obj_map
|| obj
.type
== isl_obj_set
)
3203 obj
= to_union(s
->ctx
, obj
);
3204 if (obj
.type
== isl_obj_union_map
)
3205 return isl_union_pw_multi_aff_from_union_map(obj
.v
);
3206 if (obj
.type
== isl_obj_union_set
)
3207 return isl_union_pw_multi_aff_from_union_set(obj
.v
);
3209 obj
.type
->free(obj
.v
);
3210 isl_die(s
->ctx
, isl_error_invalid
, "unexpected object type",
3214 /* Read an isl_union_pw_multi_aff from "str".
3216 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_read_from_str(
3217 isl_ctx
*ctx
, const char *str
)
3219 isl_union_pw_multi_aff
*upma
;
3220 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3223 upma
= isl_stream_read_union_pw_multi_aff(s
);
3228 /* Assuming "pa" represents a single affine expression defined on a universe
3229 * domain, extract this affine expression.
3231 static __isl_give isl_aff
*aff_from_pw_aff(__isl_take isl_pw_aff
*pa
)
3238 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
3239 "expecting single affine expression",
3241 if (!isl_set_plain_is_universe(pa
->p
[0].set
))
3242 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
3243 "expecting universe domain",
3246 aff
= isl_aff_copy(pa
->p
[0].aff
);
3247 isl_pw_aff_free(pa
);
3250 isl_pw_aff_free(pa
);
3254 /* This function is called for each element in a tuple inside
3255 * isl_stream_read_multi_val.
3256 * Read an isl_val from "s" and add it to *list.
3258 static __isl_give isl_space
*read_val_el(__isl_keep isl_stream
*s
,
3259 struct vars
*v
, __isl_take isl_space
*space
, int rational
, void *user
)
3261 isl_val_list
**list
= (isl_val_list
**) user
;
3264 val
= isl_stream_read_val(s
);
3265 *list
= isl_val_list_add(*list
, val
);
3267 return isl_space_free(space
);
3272 /* Read an isl_multi_val from "s".
3274 * We first read a tuple space, collecting the element values in a list.
3275 * Then we create an isl_multi_val from the space and the isl_val_list.
3277 __isl_give isl_multi_val
*isl_stream_read_multi_val(__isl_keep isl_stream
*s
)
3280 isl_set
*dom
= NULL
;
3282 isl_multi_val
*mv
= NULL
;
3285 v
= vars_new(s
->ctx
);
3289 dom
= isl_set_universe(isl_space_params_alloc(s
->ctx
, 0));
3290 if (next_is_tuple(s
)) {
3291 dom
= read_map_tuple(s
, dom
, isl_dim_param
, v
, 1, 0);
3292 if (isl_stream_eat(s
, ISL_TOKEN_TO
))
3295 if (!isl_set_plain_is_universe(dom
))
3296 isl_die(s
->ctx
, isl_error_invalid
,
3297 "expecting universe parameter domain", goto error
);
3298 if (isl_stream_eat(s
, '{'))
3301 space
= isl_set_get_space(dom
);
3303 list
= isl_val_list_alloc(s
->ctx
, 0);
3304 space
= read_tuple_space(s
, v
, space
, 1, 0, &read_val_el
, &list
);
3305 mv
= isl_multi_val_from_val_list(space
, list
);
3307 if (isl_stream_eat(s
, '}'))
3316 isl_multi_val_free(mv
);
3320 /* Read an isl_multi_val from "str".
3322 __isl_give isl_multi_val
*isl_multi_val_read_from_str(isl_ctx
*ctx
,
3326 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3329 mv
= isl_stream_read_multi_val(s
);
3334 /* Read a multi-affine expression from "s".
3335 * If the multi-affine expression has a domain, then the tuple
3336 * representing this domain cannot involve any affine expressions.
3337 * The tuple representing the actual expressions needs to consist
3338 * of only affine expressions. Moreover, these expressions can
3339 * only depend on parameters and input dimensions and not on other
3340 * output dimensions.
3342 __isl_give isl_multi_aff
*isl_stream_read_multi_aff(__isl_keep isl_stream
*s
)
3345 isl_set
*dom
= NULL
;
3346 isl_multi_pw_aff
*tuple
= NULL
;
3348 isl_space
*space
, *dom_space
;
3349 isl_multi_aff
*ma
= NULL
;
3351 v
= vars_new(s
->ctx
);
3355 dom
= isl_set_universe(isl_space_params_alloc(s
->ctx
, 0));
3356 if (next_is_tuple(s
)) {
3357 dom
= read_map_tuple(s
, dom
, isl_dim_param
, v
, 1, 0);
3358 if (isl_stream_eat(s
, ISL_TOKEN_TO
))
3361 if (!isl_set_plain_is_universe(dom
))
3362 isl_die(s
->ctx
, isl_error_invalid
,
3363 "expecting universe parameter domain", goto error
);
3364 if (isl_stream_eat(s
, '{'))
3367 tuple
= read_tuple(s
, v
, 0, 0);
3370 if (isl_stream_eat_if_available(s
, ISL_TOKEN_TO
)) {
3375 has_expr
= tuple_has_expr(tuple
);
3379 isl_die(s
->ctx
, isl_error_invalid
,
3380 "expecting universe domain", goto error
);
3381 space
= isl_space_range(isl_multi_pw_aff_get_space(tuple
));
3382 set
= isl_set_universe(space
);
3383 dom
= isl_set_intersect_params(set
, dom
);
3384 isl_multi_pw_aff_free(tuple
);
3385 tuple
= read_tuple(s
, v
, 0, 0);
3390 if (isl_stream_eat(s
, '}'))
3393 n
= isl_multi_pw_aff_dim(tuple
, isl_dim_out
);
3394 dim
= isl_set_dim(dom
, isl_dim_all
);
3395 dom_space
= isl_set_get_space(dom
);
3396 space
= isl_space_range(isl_multi_pw_aff_get_space(tuple
));
3397 space
= isl_space_align_params(space
, isl_space_copy(dom_space
));
3398 if (!isl_space_is_params(dom_space
))
3399 space
= isl_space_map_from_domain_and_range(
3400 isl_space_copy(dom_space
), space
);
3401 isl_space_free(dom_space
);
3402 ma
= isl_multi_aff_alloc(space
);
3404 for (i
= 0; i
< n
; ++i
) {
3407 pa
= isl_multi_pw_aff_get_pw_aff(tuple
, i
);
3408 aff
= aff_from_pw_aff(pa
);
3411 if (isl_aff_involves_dims(aff
, isl_dim_in
, dim
, i
+ 1)) {
3413 isl_die(s
->ctx
, isl_error_invalid
,
3414 "not an affine expression", goto error
);
3416 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, dim
, n
);
3417 space
= isl_multi_aff_get_domain_space(ma
);
3418 aff
= isl_aff_reset_domain_space(aff
, space
);
3419 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3422 isl_multi_pw_aff_free(tuple
);
3427 isl_multi_pw_aff_free(tuple
);
3430 isl_multi_aff_free(ma
);
3434 __isl_give isl_multi_aff
*isl_multi_aff_read_from_str(isl_ctx
*ctx
,
3437 isl_multi_aff
*maff
;
3438 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3441 maff
= isl_stream_read_multi_aff(s
);
3446 /* Read an isl_multi_pw_aff from "s".
3448 * The input format is similar to that of map, except that any conditions
3449 * on the domains should be specified inside the tuple since each
3450 * piecewise affine expression may have a different domain.
3452 * Since we do not know in advance if the isl_multi_pw_aff lives
3453 * in a set or a map space, we first read the first tuple and check
3454 * if it is followed by a "->". If so, we convert the tuple into
3455 * the domain of the isl_multi_pw_aff and read in the next tuple.
3456 * This tuple (or the first tuple if it was not followed by a "->")
3457 * is then converted into the isl_multi_pw_aff.
3459 * Note that the function read_tuple accepts tuples where some output or
3460 * set dimensions are defined in terms of other output or set dimensions
3461 * since this function is also used to read maps. As a special case,
3462 * read_tuple also accept dimensions that are defined in terms of themselves
3463 * (i.e., that are not defined).
3464 * These cases are not allowed when reading am isl_multi_pw_aff so we check
3465 * that the definition of the output/set dimensions does not involve any
3466 * output/set dimensions.
3467 * We then drop the output dimensions from the domain of the result
3468 * of read_tuple (which is of the form [input, output] -> [output],
3469 * with anonymous domain) and reset the space.
3471 __isl_give isl_multi_pw_aff
*isl_stream_read_multi_pw_aff(
3472 __isl_keep isl_stream
*s
)
3475 isl_set
*dom
= NULL
;
3476 isl_multi_pw_aff
*tuple
= NULL
;
3478 isl_space
*space
, *dom_space
;
3479 isl_multi_pw_aff
*mpa
= NULL
;
3481 v
= vars_new(s
->ctx
);
3485 dom
= isl_set_universe(isl_space_params_alloc(s
->ctx
, 0));
3486 if (next_is_tuple(s
)) {
3487 dom
= read_map_tuple(s
, dom
, isl_dim_param
, v
, 1, 0);
3488 if (isl_stream_eat(s
, ISL_TOKEN_TO
))
3491 if (isl_stream_eat(s
, '{'))
3494 tuple
= read_tuple(s
, v
, 0, 0);
3497 if (isl_stream_eat_if_available(s
, ISL_TOKEN_TO
)) {
3498 isl_map
*map
= map_from_tuple(tuple
, dom
, isl_dim_in
, v
, 0);
3499 dom
= isl_map_domain(map
);
3500 tuple
= read_tuple(s
, v
, 0, 0);
3505 if (isl_stream_eat(s
, '}'))
3508 n
= isl_multi_pw_aff_dim(tuple
, isl_dim_out
);
3509 dim
= isl_set_dim(dom
, isl_dim_all
);
3510 dom_space
= isl_set_get_space(dom
);
3511 space
= isl_space_range(isl_multi_pw_aff_get_space(tuple
));
3512 space
= isl_space_align_params(space
, isl_space_copy(dom_space
));
3513 if (!isl_space_is_params(dom_space
))
3514 space
= isl_space_map_from_domain_and_range(
3515 isl_space_copy(dom_space
), space
);
3516 isl_space_free(dom_space
);
3517 mpa
= isl_multi_pw_aff_alloc(space
);
3519 for (i
= 0; i
< n
; ++i
) {
3521 pa
= isl_multi_pw_aff_get_pw_aff(tuple
, i
);
3524 if (isl_pw_aff_involves_dims(pa
, isl_dim_in
, dim
, i
+ 1)) {
3525 isl_pw_aff_free(pa
);
3526 isl_die(s
->ctx
, isl_error_invalid
,
3527 "not an affine expression", goto error
);
3529 pa
= isl_pw_aff_drop_dims(pa
, isl_dim_in
, dim
, n
);
3530 space
= isl_multi_pw_aff_get_domain_space(mpa
);
3531 pa
= isl_pw_aff_reset_domain_space(pa
, space
);
3532 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
3535 isl_multi_pw_aff_free(tuple
);
3537 mpa
= isl_multi_pw_aff_intersect_domain(mpa
, dom
);
3540 isl_multi_pw_aff_free(tuple
);
3543 isl_multi_pw_aff_free(mpa
);
3547 /* Read an isl_multi_pw_aff from "str".
3549 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_read_from_str(isl_ctx
*ctx
,
3552 isl_multi_pw_aff
*mpa
;
3553 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3556 mpa
= isl_stream_read_multi_pw_aff(s
);
3561 /* Read the body of an isl_union_pw_aff from "s" with parameter domain "dom".
3563 static __isl_give isl_union_pw_aff
*read_union_pw_aff_with_dom(
3564 __isl_keep isl_stream
*s
, __isl_take isl_set
*dom
, struct vars
*v
)
3567 isl_union_pw_aff
*upa
= NULL
;
3572 aff_dom
= read_aff_domain(s
, isl_set_copy(dom
), v
);
3573 pa
= read_pw_aff_with_dom(s
, aff_dom
, v
);
3574 vars_drop(v
, v
->n
- n
);
3576 upa
= isl_union_pw_aff_from_pw_aff(pa
);
3578 while (isl_stream_eat_if_available(s
, ';')) {
3580 isl_union_pw_aff
*upa_i
;
3583 aff_dom
= read_aff_domain(s
, isl_set_copy(dom
), v
);
3584 pa_i
= read_pw_aff_with_dom(s
, aff_dom
, v
);
3585 vars_drop(v
, v
->n
- n
);
3587 upa_i
= isl_union_pw_aff_from_pw_aff(pa_i
);
3588 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
3595 /* This function is called for each element in a tuple inside
3596 * isl_stream_read_multi_union_pw_aff.
3598 * Read a '{', the union piecewise affine expression body and a '}' and
3599 * add the isl_union_pw_aff to *list.
3601 static __isl_give isl_space
*read_union_pw_aff_el(__isl_keep isl_stream
*s
,
3602 struct vars
*v
, __isl_take isl_space
*space
, int rational
, void *user
)
3605 isl_union_pw_aff
*upa
;
3606 isl_union_pw_aff_list
**list
= (isl_union_pw_aff_list
**) user
;
3608 dom
= isl_set_universe(isl_space_params(isl_space_copy(space
)));
3609 if (isl_stream_eat(s
, '{'))
3611 upa
= read_union_pw_aff_with_dom(s
, dom
, v
);
3612 *list
= isl_union_pw_aff_list_add(*list
, upa
);
3613 if (isl_stream_eat(s
, '}'))
3614 return isl_space_free(space
);
3616 return isl_space_free(space
);
3620 return isl_space_free(space
);
3623 /* Do the next tokens in "s" correspond to an empty tuple?
3624 * In particular, does the stream start with a '[', followed by a ']',
3625 * not followed by a "->"?
3627 static int next_is_empty_tuple(__isl_keep isl_stream
*s
)
3629 struct isl_token
*tok
, *tok2
, *tok3
;
3630 int is_empty_tuple
= 0;
3632 tok
= isl_stream_next_token(s
);
3635 if (tok
->type
!= '[') {
3636 isl_stream_push_token(s
, tok
);
3640 tok2
= isl_stream_next_token(s
);
3641 if (tok2
&& tok2
->type
== ']') {
3642 tok3
= isl_stream_next_token(s
);
3643 is_empty_tuple
= !tok
|| tok
->type
!= ISL_TOKEN_TO
;
3645 isl_stream_push_token(s
, tok3
);
3648 isl_stream_push_token(s
, tok2
);
3649 isl_stream_push_token(s
, tok
);
3651 return is_empty_tuple
;
3654 /* Do the next tokens in "s" correspond to a tuple of parameters?
3655 * In particular, does the stream start with a '[' that is not
3656 * followed by a '{' or a nested tuple?
3658 static int next_is_param_tuple(__isl_keep isl_stream
*s
)
3660 struct isl_token
*tok
, *tok2
;
3663 tok
= isl_stream_next_token(s
);
3666 if (tok
->type
!= '[' || next_is_tuple(s
)) {
3667 isl_stream_push_token(s
, tok
);
3671 tok2
= isl_stream_next_token(s
);
3672 is_tuple
= tok2
&& tok2
->type
!= '{';
3674 isl_stream_push_token(s
, tok2
);
3675 isl_stream_push_token(s
, tok
);
3680 /* Read an isl_multi_union_pw_aff from "s".
3682 * The input has the form
3684 * [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }]
3688 * [..] -> [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }]
3690 * We first check for the special case of an empty tuple "[]".
3691 * Then we check if there are any parameters.
3692 * Finally, we read the tuple, collecting the individual isl_union_pw_aff
3693 * elements in a list and construct the result from the tuple space and
3696 __isl_give isl_multi_union_pw_aff
*isl_stream_read_multi_union_pw_aff(
3697 __isl_keep isl_stream
*s
)
3700 isl_set
*dom
= NULL
;
3702 isl_multi_union_pw_aff
*mupa
= NULL
;
3703 isl_union_pw_aff_list
*list
;
3705 if (next_is_empty_tuple(s
)) {
3706 if (isl_stream_eat(s
, '['))
3708 if (isl_stream_eat(s
, ']'))
3710 space
= isl_space_set_alloc(s
->ctx
, 0, 0);
3711 return isl_multi_union_pw_aff_zero(space
);
3714 v
= vars_new(s
->ctx
);
3718 dom
= isl_set_universe(isl_space_params_alloc(s
->ctx
, 0));
3719 if (next_is_param_tuple(s
)) {
3720 dom
= read_map_tuple(s
, dom
, isl_dim_param
, v
, 1, 0);
3721 if (isl_stream_eat(s
, ISL_TOKEN_TO
))
3724 space
= isl_set_get_space(dom
);
3726 list
= isl_union_pw_aff_list_alloc(s
->ctx
, 0);
3727 space
= read_tuple_space(s
, v
, space
, 1, 0,
3728 &read_union_pw_aff_el
, &list
);
3729 mupa
= isl_multi_union_pw_aff_from_union_pw_aff_list(space
, list
);
3737 isl_multi_union_pw_aff_free(mupa
);
3741 /* Read an isl_multi_union_pw_aff from "str".
3743 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_read_from_str(
3744 isl_ctx
*ctx
, const char *str
)
3746 isl_multi_union_pw_aff
*mupa
;
3747 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3750 mupa
= isl_stream_read_multi_union_pw_aff(s
);
3755 __isl_give isl_union_pw_qpolynomial
*isl_stream_read_union_pw_qpolynomial(
3756 __isl_keep isl_stream
*s
)
3761 if (obj
.type
== isl_obj_pw_qpolynomial
) {
3762 obj
.type
= isl_obj_union_pw_qpolynomial
;
3763 obj
.v
= isl_union_pw_qpolynomial_from_pw_qpolynomial(obj
.v
);
3766 isl_assert(s
->ctx
, obj
.type
== isl_obj_union_pw_qpolynomial
,
3771 obj
.type
->free(obj
.v
);
3775 __isl_give isl_union_pw_qpolynomial
*isl_union_pw_qpolynomial_read_from_str(
3776 isl_ctx
*ctx
, const char *str
)
3778 isl_union_pw_qpolynomial
*upwqp
;
3779 isl_stream
*s
= isl_stream_new_str(ctx
, str
);
3782 upwqp
= isl_stream_read_union_pw_qpolynomial(s
);