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
17 #include <isl_ctx_private.h>
18 #include <isl_map_private.h>
21 #include <isl_polynomial_private.h>
22 #include <isl_printer_private.h>
23 #include <isl_space_private.h>
24 #include <isl_mat_private.h>
25 #include <isl_vec_private.h>
26 #include <isl/union_set.h>
27 #include <isl/union_map.h>
28 #include <isl/constraint.h>
29 #include <isl_local_space_private.h>
30 #include <isl_aff_private.h>
31 #include <isl_val_private.h>
32 #include <isl_constraint_private.h>
33 #include <isl/ast_build.h>
35 #include <isl_output_private.h>
37 #include <bset_to_bmap.c>
38 #include <set_to_map.c>
39 #include <uset_to_umap.c>
41 static const char *s_to
[2] = { " -> ", " \\to " };
42 static const char *s_and
[2] = { " and ", " \\wedge " };
43 static const char *s_or
[2] = { " or ", " \\vee " };
44 static const char *s_le
[2] = { "<=", "\\le" };
45 static const char *s_ge
[2] = { ">=", "\\ge" };
46 static const char *s_open_set
[2] = { "{ ", "\\{\\, " };
47 static const char *s_close_set
[2] = { " }", " \\,\\}" };
48 static const char *s_open_list
[2] = { "[", "(" };
49 static const char *s_close_list
[2] = { "]", ")" };
50 static const char *s_such_that
[2] = { " : ", " \\mid " };
51 static const char *s_open_exists
[2] = { "exists (", "\\exists \\, " };
52 static const char *s_close_exists
[2] = { ")", "" };
53 static const char *s_div_prefix
[2] = { "e", "\\alpha_" };
54 static const char *s_mod
[2] = { "mod", "\\bmod" };
55 static const char *s_param_prefix
[2] = { "p", "p_" };
56 static const char *s_input_prefix
[2] = { "i", "i_" };
57 static const char *s_output_prefix
[2] = { "o", "o_" };
59 static __isl_give isl_printer
*print_constraint_polylib(
60 struct isl_basic_map
*bmap
, int ineq
, int n
, __isl_take isl_printer
*p
)
63 unsigned n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
64 unsigned n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
65 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
66 isl_int
*c
= ineq
? bmap
->ineq
[n
] : bmap
->eq
[n
];
68 p
= isl_printer_start_line(p
);
69 p
= isl_printer_print_int(p
, ineq
);
70 for (i
= 0; i
< n_out
; ++i
) {
71 p
= isl_printer_print_str(p
, " ");
72 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+n_in
+i
]);
74 for (i
= 0; i
< n_in
; ++i
) {
75 p
= isl_printer_print_str(p
, " ");
76 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+i
]);
78 for (i
= 0; i
< bmap
->n_div
; ++i
) {
79 p
= isl_printer_print_str(p
, " ");
80 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+n_in
+n_out
+i
]);
82 for (i
= 0; i
< nparam
; ++i
) {
83 p
= isl_printer_print_str(p
, " ");
84 p
= isl_printer_print_isl_int(p
, c
[1+i
]);
86 p
= isl_printer_print_str(p
, " ");
87 p
= isl_printer_print_isl_int(p
, c
[0]);
88 p
= isl_printer_end_line(p
);
92 static __isl_give isl_printer
*print_constraints_polylib(
93 struct isl_basic_map
*bmap
, __isl_take isl_printer
*p
)
97 p
= isl_printer_set_isl_int_width(p
, 5);
99 for (i
= 0; i
< bmap
->n_eq
; ++i
)
100 p
= print_constraint_polylib(bmap
, 0, i
, p
);
101 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
102 p
= print_constraint_polylib(bmap
, 1, i
, p
);
107 static __isl_give isl_printer
*bset_print_constraints_polylib(
108 struct isl_basic_set
*bset
, __isl_take isl_printer
*p
)
110 return print_constraints_polylib(bset_to_bmap(bset
), p
);
113 static __isl_give isl_printer
*isl_basic_map_print_polylib(
114 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
, int ext
)
116 unsigned total
= isl_basic_map_total_dim(bmap
);
117 p
= isl_printer_start_line(p
);
118 p
= isl_printer_print_int(p
, bmap
->n_eq
+ bmap
->n_ineq
);
119 p
= isl_printer_print_str(p
, " ");
120 p
= isl_printer_print_int(p
, 1 + total
+ 1);
122 p
= isl_printer_print_str(p
, " ");
123 p
= isl_printer_print_int(p
,
124 isl_basic_map_dim(bmap
, isl_dim_out
));
125 p
= isl_printer_print_str(p
, " ");
126 p
= isl_printer_print_int(p
,
127 isl_basic_map_dim(bmap
, isl_dim_in
));
128 p
= isl_printer_print_str(p
, " ");
129 p
= isl_printer_print_int(p
,
130 isl_basic_map_dim(bmap
, isl_dim_div
));
131 p
= isl_printer_print_str(p
, " ");
132 p
= isl_printer_print_int(p
,
133 isl_basic_map_dim(bmap
, isl_dim_param
));
135 p
= isl_printer_end_line(p
);
136 return print_constraints_polylib(bmap
, p
);
139 static __isl_give isl_printer
*isl_basic_set_print_polylib(
140 __isl_keep isl_basic_set
*bset
, __isl_take isl_printer
*p
, int ext
)
142 return isl_basic_map_print_polylib(bset_to_bmap(bset
), p
, ext
);
145 static __isl_give isl_printer
*isl_map_print_polylib(__isl_keep isl_map
*map
,
146 __isl_take isl_printer
*p
, int ext
)
150 p
= isl_printer_start_line(p
);
151 p
= isl_printer_print_int(p
, map
->n
);
152 p
= isl_printer_end_line(p
);
153 for (i
= 0; i
< map
->n
; ++i
) {
154 p
= isl_printer_start_line(p
);
155 p
= isl_printer_end_line(p
);
156 p
= isl_basic_map_print_polylib(map
->p
[i
], p
, ext
);
161 static __isl_give isl_printer
*isl_set_print_polylib(__isl_keep isl_set
*set
,
162 __isl_take isl_printer
*p
, int ext
)
164 return isl_map_print_polylib(set_to_map(set
), p
, ext
);
167 static int count_same_name(__isl_keep isl_space
*space
,
168 enum isl_dim_type type
, unsigned pos
, const char *name
)
174 for (t
= isl_dim_param
; t
<= type
&& t
<= isl_dim_out
; ++t
) {
175 s
= t
== type
? pos
: isl_space_dim(space
, t
);
176 for (p
= 0; p
< s
; ++p
) {
177 const char *n
= isl_space_get_dim_name(space
, t
, p
);
178 if (n
&& !strcmp(n
, name
))
185 /* Print the name of the variable of type "type" and position "pos"
188 static __isl_give isl_printer
*print_name(__isl_keep isl_space
*space
,
189 __isl_take isl_printer
*p
, enum isl_dim_type type
, unsigned pos
,
196 name
= type
== isl_dim_div
? NULL
197 : isl_space_get_dim_name(space
, type
, pos
);
201 if (type
== isl_dim_param
)
202 prefix
= s_param_prefix
[latex
];
203 else if (type
== isl_dim_div
)
204 prefix
= s_div_prefix
[latex
];
205 else if (isl_space_is_set(space
) || type
== isl_dim_in
)
206 prefix
= s_input_prefix
[latex
];
208 prefix
= s_output_prefix
[latex
];
209 snprintf(buffer
, sizeof(buffer
), "%s%d", prefix
, pos
);
212 primes
= count_same_name(space
, name
== buffer
? isl_dim_div
: type
,
214 p
= isl_printer_print_str(p
, name
);
216 p
= isl_printer_print_str(p
, "'");
220 static enum isl_dim_type
pos2type(__isl_keep isl_space
*space
, unsigned *pos
)
222 enum isl_dim_type type
;
223 unsigned n_in
= isl_space_dim(space
, isl_dim_in
);
224 unsigned n_out
= isl_space_dim(space
, isl_dim_out
);
225 unsigned nparam
= isl_space_dim(space
, isl_dim_param
);
227 if (*pos
< 1 + nparam
) {
228 type
= isl_dim_param
;
230 } else if (*pos
< 1 + nparam
+ n_in
) {
233 } else if (*pos
< 1 + nparam
+ n_in
+ n_out
) {
235 *pos
-= 1 + nparam
+ n_in
;
238 *pos
-= 1 + nparam
+ n_in
+ n_out
;
244 /* Can the div expression of the integer division at position "row" of "div"
246 * In particular, are the div expressions available and does the selected
247 * variable have a known explicit representation?
248 * Furthermore, the Omega format does not allow any div expressions
251 static isl_bool
can_print_div_expr(__isl_keep isl_printer
*p
,
252 __isl_keep isl_mat
*div
, int pos
)
254 if (p
->output_format
== ISL_FORMAT_OMEGA
)
255 return isl_bool_false
;
257 return isl_bool_false
;
258 return !isl_int_is_zero(div
->row
[pos
][0]);
261 static __isl_give isl_printer
*print_div(__isl_keep isl_space
*dim
,
262 __isl_keep isl_mat
*div
, int pos
, __isl_take isl_printer
*p
);
264 static __isl_give isl_printer
*print_term(__isl_keep isl_space
*space
,
265 __isl_keep isl_mat
*div
,
266 isl_int c
, unsigned pos
, __isl_take isl_printer
*p
, int latex
)
268 enum isl_dim_type type
;
272 return isl_printer_free(p
);
275 return isl_printer_print_isl_int(p
, c
);
277 type
= pos2type(space
, &pos
);
278 print_div_def
= type
== isl_dim_div
&& can_print_div_expr(p
, div
, pos
);
280 if (isl_int_is_one(c
))
282 else if (isl_int_is_negone(c
))
283 p
= isl_printer_print_str(p
, "-");
285 p
= isl_printer_print_isl_int(p
, c
);
286 if (p
->output_format
== ISL_FORMAT_C
|| print_div_def
)
287 p
= isl_printer_print_str(p
, "*");
290 p
= print_div(space
, div
, pos
, p
);
292 p
= print_name(space
, p
, type
, pos
, latex
);
296 static __isl_give isl_printer
*print_affine_of_len(__isl_keep isl_space
*dim
,
297 __isl_keep isl_mat
*div
,
298 __isl_take isl_printer
*p
, isl_int
*c
, int len
)
303 for (i
= 0, first
= 1; i
< len
; ++i
) {
305 if (isl_int_is_zero(c
[i
]))
308 if (isl_int_is_neg(c
[i
])) {
310 isl_int_neg(c
[i
], c
[i
]);
311 p
= isl_printer_print_str(p
, " - ");
313 p
= isl_printer_print_str(p
, " + ");
316 p
= print_term(dim
, div
, c
[i
], i
, p
, 0);
318 isl_int_neg(c
[i
], c
[i
]);
321 p
= isl_printer_print_str(p
, "0");
325 /* Print an affine expression "c"
326 * to "p", with the variable names taken from "space" and
327 * the integer division definitions taken from "div".
329 static __isl_give isl_printer
*print_affine(__isl_take isl_printer
*p
,
330 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, isl_int
*c
)
336 return isl_printer_free(p
);
337 n_div
= isl_mat_rows(div
);
338 len
= 1 + isl_space_dim(space
, isl_dim_all
) + n_div
;
339 return print_affine_of_len(space
, div
, p
, c
, len
);
342 /* offset is the offset of local_space inside data->type of data->space.
344 static __isl_give isl_printer
*print_nested_var_list(__isl_take isl_printer
*p
,
345 __isl_keep isl_space
*local_space
, enum isl_dim_type local_type
,
346 struct isl_print_space_data
*data
, int offset
)
350 if (data
->space
!= local_space
&& local_type
== isl_dim_out
)
351 offset
+= local_space
->n_in
;
353 for (i
= 0; i
< isl_space_dim(local_space
, local_type
); ++i
) {
355 p
= isl_printer_print_str(p
, ", ");
357 p
= data
->print_dim(p
, data
, offset
+ i
);
359 p
= print_name(data
->space
, p
, data
->type
, offset
+ i
,
365 static __isl_give isl_printer
*print_var_list(__isl_take isl_printer
*p
,
366 __isl_keep isl_space
*space
, enum isl_dim_type type
)
368 struct isl_print_space_data data
= { .space
= space
, .type
= type
};
370 return print_nested_var_list(p
, space
, type
, &data
, 0);
373 static __isl_give isl_printer
*print_nested_map_dim(__isl_take isl_printer
*p
,
374 __isl_keep isl_space
*local_dim
,
375 struct isl_print_space_data
*data
, int offset
);
377 static __isl_give isl_printer
*print_nested_tuple(__isl_take isl_printer
*p
,
378 __isl_keep isl_space
*local_space
, enum isl_dim_type local_type
,
379 struct isl_print_space_data
*data
, int offset
)
381 const char *name
= NULL
;
382 unsigned n
= isl_space_dim(local_space
, local_type
);
383 if ((local_type
== isl_dim_in
|| local_type
== isl_dim_out
)) {
384 name
= isl_space_get_tuple_name(local_space
, local_type
);
387 p
= isl_printer_print_str(p
, "\\mathrm{");
388 p
= isl_printer_print_str(p
, name
);
390 p
= isl_printer_print_str(p
, "}");
393 if (!data
->latex
|| n
!= 1 || name
)
394 p
= isl_printer_print_str(p
, s_open_list
[data
->latex
]);
395 if ((local_type
== isl_dim_in
|| local_type
== isl_dim_out
) &&
396 local_space
->nested
[local_type
- isl_dim_in
]) {
397 if (data
->space
!= local_space
&& local_type
== isl_dim_out
)
398 offset
+= local_space
->n_in
;
399 p
= print_nested_map_dim(p
,
400 local_space
->nested
[local_type
- isl_dim_in
],
403 p
= print_nested_var_list(p
, local_space
, local_type
, data
,
405 if (!data
->latex
|| n
!= 1 || name
)
406 p
= isl_printer_print_str(p
, s_close_list
[data
->latex
]);
410 static __isl_give isl_printer
*print_tuple(__isl_keep isl_space
*dim
,
411 __isl_take isl_printer
*p
, enum isl_dim_type type
,
412 struct isl_print_space_data
*data
)
416 return print_nested_tuple(p
, dim
, type
, data
, 0);
419 static __isl_give isl_printer
*print_nested_map_dim(__isl_take isl_printer
*p
,
420 __isl_keep isl_space
*local_dim
,
421 struct isl_print_space_data
*data
, int offset
)
423 p
= print_nested_tuple(p
, local_dim
, isl_dim_in
, data
, offset
);
424 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
425 p
= print_nested_tuple(p
, local_dim
, isl_dim_out
, data
, offset
);
430 __isl_give isl_printer
*isl_print_space(__isl_keep isl_space
*space
,
431 __isl_take isl_printer
*p
, int rational
,
432 struct isl_print_space_data
*data
)
434 if (rational
&& !data
->latex
)
435 p
= isl_printer_print_str(p
, "rat: ");
436 if (isl_space_is_params(space
))
438 else if (isl_space_is_set(space
))
439 p
= print_tuple(space
, p
, isl_dim_set
, data
);
441 p
= print_tuple(space
, p
, isl_dim_in
, data
);
442 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
443 p
= print_tuple(space
, p
, isl_dim_out
, data
);
449 static __isl_give isl_printer
*print_omega_parameters(
450 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
)
452 if (isl_space_dim(space
, isl_dim_param
) == 0)
455 p
= isl_printer_start_line(p
);
456 p
= isl_printer_print_str(p
, "symbolic ");
457 p
= print_var_list(p
, space
, isl_dim_param
);
458 p
= isl_printer_print_str(p
, ";");
459 p
= isl_printer_end_line(p
);
463 /* Does the inequality constraint following "i" in "bmap"
464 * have an opposite value for the same last coefficient?
465 * "last" is the position of the last coefficient of inequality "i".
466 * If the next constraint is a div constraint, then it is ignored
467 * since div constraints are not printed.
469 static int next_is_opposite(__isl_keep isl_basic_map
*bmap
, int i
, int last
)
471 unsigned total
= isl_basic_map_total_dim(bmap
);
472 unsigned o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
474 if (i
+ 1 >= bmap
->n_ineq
)
476 if (isl_seq_last_non_zero(bmap
->ineq
[i
+ 1], 1 + total
) != last
)
480 is_div
= isl_basic_map_is_div_constraint(bmap
,
481 bmap
->ineq
[i
+ 1], last
- o_div
);
487 return isl_int_abs_eq(bmap
->ineq
[i
][last
], bmap
->ineq
[i
+ 1][last
]) &&
488 !isl_int_eq(bmap
->ineq
[i
][last
], bmap
->ineq
[i
+ 1][last
]);
491 /* Return a string representation of the operator used when
492 * printing a constraint where the LHS is greater than or equal to the LHS
493 * (sign > 0) or smaller than or equal to the LHS (sign < 0).
494 * If "strict" is set, then return the strict version of the comparison
497 static const char *constraint_op(int sign
, int strict
, int latex
)
500 return sign
< 0 ? "<" : ">";
507 /* Print one side of a constraint "c" to "p", with
508 * the variable names taken from "space" and the integer division definitions
510 * "last" is the position of the last non-zero coefficient.
511 * Let c' be the result of zeroing out this coefficient, then
512 * the partial constraint
518 static __isl_give isl_printer
*print_half_constraint(__isl_take isl_printer
*p
,
519 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
520 isl_int
*c
, int last
, const char *op
, int latex
)
522 isl_int_set_si(c
[last
], 0);
523 p
= print_affine(p
, space
, div
, c
);
525 p
= isl_printer_print_str(p
, " ");
526 p
= isl_printer_print_str(p
, op
);
527 p
= isl_printer_print_str(p
, " ");
532 /* Print a constraint "c" to "p", with the variable names
533 * taken from "space" and the integer division definitions taken from "div".
534 * "last" is the position of the last non-zero coefficient, which is
535 * moreover assumed to be negative.
536 * Let c' be the result of zeroing out this coefficient, then
537 * the constraint is printed in the form
541 static __isl_give isl_printer
*print_constraint(__isl_take isl_printer
*p
,
542 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
543 isl_int
*c
, int last
, const char *op
, int latex
)
545 isl_int_abs(c
[last
], c
[last
]);
547 p
= print_term(space
, div
, c
[last
], last
, p
, latex
);
549 p
= isl_printer_print_str(p
, " ");
550 p
= isl_printer_print_str(p
, op
);
551 p
= isl_printer_print_str(p
, " ");
553 isl_int_set_si(c
[last
], 0);
554 p
= print_affine(p
, space
, div
, c
);
559 /* Given an integer division
563 * at position "pos" in "div", print the corresponding modulo expression
567 * to "p". The variable names are taken from "space", while any
568 * nested integer division definitions are taken from "div".
570 static __isl_give isl_printer
*print_mod(__isl_take isl_printer
*p
,
571 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int pos
,
575 return isl_printer_free(p
);
577 p
= isl_printer_print_str(p
, "(");
578 p
= print_affine_of_len(space
, div
, p
,
579 div
->row
[pos
] + 1, div
->n_col
- 1);
580 p
= isl_printer_print_str(p
, ") ");
581 p
= isl_printer_print_str(p
, s_mod
[latex
]);
582 p
= isl_printer_print_str(p
, " ");
583 p
= isl_printer_print_isl_int(p
, div
->row
[pos
][0]);
587 /* Can the equality constraints "c" be printed as a modulo constraint?
588 * In particular, is of the form
590 * f - a m floor(g/m) = 0,
592 * with c = -a m the coefficient at position "pos"?
593 * Return the position of the corresponding integer division if so.
594 * Return the number of integer divisions if not.
595 * Return -1 on error.
597 * Modulo constraints are currently not printed in C format.
598 * Other than that, "pos" needs to correspond to an integer division
599 * with explicit representation and "c" needs to be a multiple
600 * of the denominator of the integer division.
602 static int print_as_modulo_pos(__isl_keep isl_printer
*p
,
603 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, unsigned pos
,
608 enum isl_dim_type type
;
612 n_div
= isl_mat_rows(div
);
613 if (p
->output_format
== ISL_FORMAT_C
)
615 type
= pos2type(space
, &pos
);
616 if (type
!= isl_dim_div
)
618 can_print
= can_print_div_expr(p
, div
, pos
);
623 if (!isl_int_is_divisible_by(c
, div
->row
[pos
][0]))
628 /* Print equality constraint "c" to "p" as a modulo constraint,
629 * with the variable names taken from "space" and
630 * the integer division definitions taken from "div".
631 * "last" is the position of the last non-zero coefficient, which is
632 * moreover assumed to be negative and a multiple of the denominator
633 * of the corresponding integer division. "div_pos" is the corresponding
634 * position in the sequence of integer divisions.
636 * The equality is of the form
638 * f - a m floor(g/m) = 0.
642 * a (g mod m) = -f + a g
644 static __isl_give isl_printer
*print_eq_mod_constraint(
645 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
,
646 __isl_keep isl_mat
*div
, unsigned div_pos
,
647 isl_int
*c
, int last
, int latex
)
652 ctx
= isl_printer_get_ctx(p
);
653 isl_int_divexact(c
[last
], c
[last
], div
->row
[div_pos
][0]);
654 isl_int_abs(c
[last
], c
[last
]);
655 multiple
= !isl_int_is_one(c
[last
]);
657 p
= isl_printer_print_isl_int(p
, c
[last
]);
658 p
= isl_printer_print_str(p
, "*(");
660 p
= print_mod(p
, space
, div
, div_pos
, latex
);
662 p
= isl_printer_print_str(p
, ")");
663 p
= isl_printer_print_str(p
, " = ");
664 isl_seq_combine(c
, ctx
->negone
, c
,
665 c
[last
], div
->row
[div_pos
] + 1, last
);
666 isl_int_set_si(c
[last
], 0);
667 p
= print_affine(p
, space
, div
, c
);
671 /* Print equality constraint "c" to "p", with the variable names
672 * taken from "space" and the integer division definitions taken from "div".
673 * "last" is the position of the last non-zero coefficient, which is
674 * moreover assumed to be negative.
676 * If possible, print the equality constraint as a modulo constraint.
678 static __isl_give isl_printer
*print_eq_constraint(__isl_take isl_printer
*p
,
679 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, isl_int
*c
,
685 n_div
= isl_mat_rows(div
);
686 div_pos
= print_as_modulo_pos(p
, space
, div
, last
, c
[last
]);
688 return isl_printer_free(p
);
690 return print_eq_mod_constraint(p
, space
, div
, div_pos
,
692 return print_constraint(p
, space
, div
, c
, last
, "=", latex
);
695 /* Print the constraints of "bmap" to "p".
696 * The names of the variables are taken from "space" and
697 * the integer division definitions are taken from "div".
698 * Div constraints are only printed in "dump" mode.
699 * The constraints are sorted prior to printing (except in "dump" mode).
701 * If x is the last variable with a non-zero coefficient,
710 * while an upper bound
718 * If the next constraint has an opposite sign for the same last coefficient,
719 * then it is printed as
727 * instead. In fact, the "a x" part is not printed explicitly, but
728 * reused from the next constraint, which is therefore treated as
729 * a first constraint in the conjunction.
731 * If the constant term of "f" is -1, then "f" is replaced by "f + 1" and
732 * the comparison operator is replaced by the strict variant.
733 * Essentially, ">= 1" is replaced by "> 0".
735 static __isl_give isl_printer
*print_constraints(__isl_keep isl_basic_map
*bmap
,
736 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
737 __isl_take isl_printer
*p
, int latex
)
741 int rational
= ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
742 unsigned total
= isl_basic_map_total_dim(bmap
);
743 unsigned o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
749 bmap
= isl_basic_map_copy(bmap
);
752 bmap
= isl_basic_map_sort_constraints(bmap
);
756 c
= isl_vec_alloc(bmap
->ctx
, 1 + total
);
760 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
761 int l
= isl_seq_last_non_zero(bmap
->eq
[i
], 1 + total
);
763 if (i
!= bmap
->n_eq
- 1)
764 p
= isl_printer_print_str(p
, s_and
[latex
]);
765 p
= isl_printer_print_str(p
, "0 = 0");
769 p
= isl_printer_print_str(p
, s_and
[latex
]);
770 if (isl_int_is_neg(bmap
->eq
[i
][l
]))
771 isl_seq_cpy(c
->el
, bmap
->eq
[i
], 1 + total
);
773 isl_seq_neg(c
->el
, bmap
->eq
[i
], 1 + total
);
774 p
= print_eq_constraint(p
, space
, div
, c
->el
, l
, latex
);
777 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
778 int l
= isl_seq_last_non_zero(bmap
->ineq
[i
], 1 + total
);
784 if (!dump
&& l
>= o_div
&&
785 can_print_div_expr(p
, div
, l
- o_div
)) {
787 is_div
= isl_basic_map_is_div_constraint(bmap
,
788 bmap
->ineq
[i
], l
- o_div
);
795 p
= isl_printer_print_str(p
, s_and
[latex
]);
796 s
= isl_int_sgn(bmap
->ineq
[i
][l
]);
797 strict
= !rational
&& isl_int_is_negone(bmap
->ineq
[i
][0]);
799 isl_seq_cpy(c
->el
, bmap
->ineq
[i
], 1 + total
);
801 isl_seq_neg(c
->el
, bmap
->ineq
[i
], 1 + total
);
803 isl_int_set_si(c
->el
[0], 0);
804 if (!dump
&& next_is_opposite(bmap
, i
, l
)) {
805 op
= constraint_op(-s
, strict
, latex
);
806 p
= print_half_constraint(p
, space
, div
, c
->el
, l
,
810 op
= constraint_op(s
, strict
, latex
);
811 p
= print_constraint(p
, space
, div
, c
->el
, l
,
817 isl_basic_map_free(bmap
);
822 isl_basic_map_free(bmap
);
828 static __isl_give isl_printer
*print_div(__isl_keep isl_space
*dim
,
829 __isl_keep isl_mat
*div
, int pos
, __isl_take isl_printer
*p
)
834 return isl_printer_free(p
);
836 c
= p
->output_format
== ISL_FORMAT_C
;
837 p
= isl_printer_print_str(p
, c
? "floord(" : "floor((");
838 p
= print_affine_of_len(dim
, div
, p
,
839 div
->row
[pos
] + 1, div
->n_col
- 1);
840 p
= isl_printer_print_str(p
, c
? ", " : ")/");
841 p
= isl_printer_print_isl_int(p
, div
->row
[pos
][0]);
842 p
= isl_printer_print_str(p
, ")");
846 /* Print a comma separated list of div names, except those that have
847 * a definition that can be printed.
848 * If "print_defined_divs" is set, then those div names are printed
849 * as well, along with their definitions.
851 static __isl_give isl_printer
*print_div_list(__isl_take isl_printer
*p
,
852 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int latex
,
853 int print_defined_divs
)
859 if (!p
|| !space
|| !div
)
860 return isl_printer_free(p
);
862 n_div
= isl_mat_rows(div
);
864 for (i
= 0; i
< n_div
; ++i
) {
865 if (!print_defined_divs
&& can_print_div_expr(p
, div
, i
))
868 p
= isl_printer_print_str(p
, ", ");
869 p
= print_name(space
, p
, isl_dim_div
, i
, latex
);
871 if (!can_print_div_expr(p
, div
, i
))
873 p
= isl_printer_print_str(p
, " = ");
874 p
= print_div(space
, div
, i
, p
);
880 /* Does printing an object with local variables described by "div"
881 * require an "exists" clause?
882 * That is, are there any local variables without an explicit representation?
883 * An exists clause is also needed in "dump" mode because
884 * explicit div representations are not printed inline in that case.
886 static isl_bool
need_exists(__isl_keep isl_printer
*p
, __isl_keep isl_mat
*div
)
891 return isl_bool_error
;
892 n
= isl_mat_rows(div
);
894 return isl_bool_false
;
896 return isl_bool_true
;
897 for (i
= 0; i
< n
; ++i
)
898 if (!can_print_div_expr(p
, div
, i
))
899 return isl_bool_true
;
900 return isl_bool_false
;
903 /* Print the start of an exists clause, i.e.,
907 * In dump mode, local variables with an explicit definition are printed
908 * as well because they will not be printed inline.
910 static __isl_give isl_printer
*open_exists(__isl_take isl_printer
*p
,
911 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int latex
)
919 p
= isl_printer_print_str(p
, s_open_exists
[latex
]);
920 p
= print_div_list(p
, space
, div
, latex
, dump
);
921 p
= isl_printer_print_str(p
, ": ");
926 /* Remove the explicit representations of all local variables in "div".
928 static __isl_give isl_mat
*mark_all_unknown(__isl_take isl_mat
*div
)
935 n_div
= isl_mat_rows(div
);
936 for (i
= 0; i
< n_div
; ++i
)
937 div
= isl_mat_set_element_si(div
, i
, 0, 0);
941 /* Print the constraints of "bmap" to "p".
942 * The names of the variables are taken from "space".
943 * "latex" is set if the constraints should be printed in LaTeX format.
944 * Do not print inline explicit div representations in "dump" mode.
946 static __isl_give isl_printer
*print_disjunct(__isl_keep isl_basic_map
*bmap
,
947 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
956 div
= isl_basic_map_get_divs(bmap
);
957 exists
= need_exists(p
, div
);
958 if (exists
>= 0 && exists
)
959 p
= open_exists(p
, space
, div
, latex
);
962 div
= mark_all_unknown(div
);
963 p
= print_constraints(bmap
, space
, div
, p
, latex
);
966 if (exists
>= 0 && exists
)
967 p
= isl_printer_print_str(p
, s_close_exists
[latex
]);
971 /* Print a colon followed by the constraints of "bmap"
972 * to "p", provided there are any constraints.
973 * The names of the variables are taken from "space".
974 * "latex" is set if the constraints should be printed in LaTeX format.
976 static __isl_give isl_printer
*print_optional_disjunct(
977 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_space
*space
,
978 __isl_take isl_printer
*p
, int latex
)
980 if (isl_basic_map_plain_is_universe(bmap
))
983 p
= isl_printer_print_str(p
, ": ");
984 p
= print_disjunct(bmap
, space
, p
, latex
);
989 static __isl_give isl_printer
*basic_map_print_omega(
990 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
)
992 p
= isl_printer_print_str(p
, "{ [");
993 p
= print_var_list(p
, bmap
->dim
, isl_dim_in
);
994 p
= isl_printer_print_str(p
, "] -> [");
995 p
= print_var_list(p
, bmap
->dim
, isl_dim_out
);
996 p
= isl_printer_print_str(p
, "] ");
997 p
= print_optional_disjunct(bmap
, bmap
->dim
, p
, 0);
998 p
= isl_printer_print_str(p
, " }");
1002 static __isl_give isl_printer
*basic_set_print_omega(
1003 __isl_keep isl_basic_set
*bset
, __isl_take isl_printer
*p
)
1005 p
= isl_printer_print_str(p
, "{ [");
1006 p
= print_var_list(p
, bset
->dim
, isl_dim_set
);
1007 p
= isl_printer_print_str(p
, "] ");
1008 p
= print_optional_disjunct(bset
, bset
->dim
, p
, 0);
1009 p
= isl_printer_print_str(p
, " }");
1013 static __isl_give isl_printer
*isl_map_print_omega(__isl_keep isl_map
*map
,
1014 __isl_take isl_printer
*p
)
1018 for (i
= 0; i
< map
->n
; ++i
) {
1020 p
= isl_printer_print_str(p
, " union ");
1021 p
= basic_map_print_omega(map
->p
[i
], p
);
1026 static __isl_give isl_printer
*isl_set_print_omega(__isl_keep isl_set
*set
,
1027 __isl_take isl_printer
*p
)
1031 for (i
= 0; i
< set
->n
; ++i
) {
1033 p
= isl_printer_print_str(p
, " union ");
1034 p
= basic_set_print_omega(set
->p
[i
], p
);
1039 /* Print the list of parameters in "space", followed by an arrow, to "p",
1040 * if there are any parameters.
1042 static __isl_give isl_printer
*print_param_tuple(__isl_take isl_printer
*p
,
1043 __isl_keep isl_space
*space
, struct isl_print_space_data
*data
)
1046 return isl_printer_free(p
);
1047 if (isl_space_dim(space
, isl_dim_param
) == 0)
1050 p
= print_tuple(space
, p
, isl_dim_param
, data
);
1051 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
1056 static __isl_give isl_printer
*isl_basic_map_print_isl(
1057 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
,
1060 struct isl_print_space_data data
= { .latex
= latex
};
1061 int rational
= ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
1063 p
= print_param_tuple(p
, bmap
->dim
, &data
);
1064 p
= isl_printer_print_str(p
, "{ ");
1065 p
= isl_print_space(bmap
->dim
, p
, rational
, &data
);
1066 p
= isl_printer_print_str(p
, " : ");
1067 p
= print_disjunct(bmap
, bmap
->dim
, p
, latex
);
1068 p
= isl_printer_print_str(p
, " }");
1072 /* Print the disjuncts of a map (or set) "map" to "p".
1073 * The names of the variables are taken from "space".
1074 * "latex" is set if the constraints should be printed in LaTeX format.
1076 static __isl_give isl_printer
*print_disjuncts_core(__isl_keep isl_map
*map
,
1077 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1082 p
= isl_printer_print_str(p
, "false");
1083 for (i
= 0; i
< map
->n
; ++i
) {
1085 p
= isl_printer_print_str(p
, s_or
[latex
]);
1086 if (map
->n
> 1 && map
->p
[i
]->n_eq
+ map
->p
[i
]->n_ineq
> 1)
1087 p
= isl_printer_print_str(p
, "(");
1088 p
= print_disjunct(map
->p
[i
], space
, p
, latex
);
1089 if (map
->n
> 1 && map
->p
[i
]->n_eq
+ map
->p
[i
]->n_ineq
> 1)
1090 p
= isl_printer_print_str(p
, ")");
1095 /* Print the disjuncts of a map (or set) "map" to "p".
1096 * The names of the variables are taken from "space".
1097 * "hull" describes constraints shared by all disjuncts of "map".
1098 * "latex" is set if the constraints should be printed in LaTeX format.
1100 * Print the disjuncts as a conjunction of "hull" and
1101 * the result of removing the constraints of "hull" from "map".
1102 * If this result turns out to be the universe, then simply print "hull".
1104 static __isl_give isl_printer
*print_disjuncts_in_hull(__isl_keep isl_map
*map
,
1105 __isl_keep isl_space
*space
, __isl_take isl_basic_map
*hull
,
1106 __isl_take isl_printer
*p
, int latex
)
1108 isl_bool is_universe
;
1110 p
= print_disjunct(hull
, space
, p
, latex
);
1111 map
= isl_map_plain_gist_basic_map(isl_map_copy(map
), hull
);
1112 is_universe
= isl_map_plain_is_universe(map
);
1113 if (is_universe
< 0)
1116 p
= isl_printer_print_str(p
, s_and
[latex
]);
1117 p
= isl_printer_print_str(p
, "(");
1118 p
= print_disjuncts_core(map
, space
, p
, latex
);
1119 p
= isl_printer_print_str(p
, ")");
1126 isl_printer_free(p
);
1130 /* Print the disjuncts of a map (or set) "map" to "p".
1131 * The names of the variables are taken from "space".
1132 * "latex" is set if the constraints should be printed in LaTeX format.
1134 * If there are at least two disjuncts and "dump" mode is not turned out,
1135 * check for any shared constraints among all disjuncts.
1136 * If there are any, then print them separately in print_disjuncts_in_hull.
1138 static __isl_give isl_printer
*print_disjuncts(__isl_keep isl_map
*map
,
1139 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1141 if (isl_map_plain_is_universe(map
))
1144 p
= isl_printer_print_str(p
, s_such_that
[latex
]);
1148 if (!p
->dump
&& map
->n
>= 2) {
1149 isl_basic_map
*hull
;
1150 isl_bool is_universe
;
1152 hull
= isl_map_plain_unshifted_simple_hull(isl_map_copy(map
));
1153 is_universe
= isl_basic_map_plain_is_universe(hull
);
1154 if (is_universe
< 0)
1155 p
= isl_printer_free(p
);
1156 else if (!is_universe
)
1157 return print_disjuncts_in_hull(map
, space
, hull
,
1159 isl_basic_map_free(hull
);
1162 return print_disjuncts_core(map
, space
, p
, latex
);
1165 /* Print the disjuncts of a map (or set).
1166 * The names of the variables are taken from "space".
1167 * "latex" is set if the constraints should be printed in LaTeX format.
1169 * If the map turns out to be a universal parameter domain, then
1170 * we need to print the colon. Otherwise, the output looks identical
1173 static __isl_give isl_printer
*print_disjuncts_map(__isl_keep isl_map
*map
,
1174 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1176 if (isl_map_plain_is_universe(map
) && isl_space_is_params(map
->dim
))
1177 return isl_printer_print_str(p
, s_such_that
[latex
]);
1179 return print_disjuncts(map
, space
, p
, latex
);
1182 /* Print the disjuncts of a set.
1183 * The names of the variables are taken from "space".
1184 * "latex" is set if the constraints should be printed in LaTeX format.
1186 static __isl_give isl_printer
*print_disjuncts_set(__isl_keep isl_set
*set
,
1187 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1189 return print_disjuncts_map(set_to_map(set
), space
, p
, latex
);
1192 struct isl_aff_split
{
1197 static void free_split(__isl_take
struct isl_aff_split
*split
, int n
)
1204 for (i
= 0; i
< n
; ++i
) {
1205 isl_basic_map_free(split
[i
].aff
);
1206 isl_map_free(split
[i
].map
);
1212 static __isl_give isl_basic_map
*get_aff(__isl_take isl_basic_map
*bmap
)
1215 unsigned nparam
, n_in
, n_out
, total
;
1217 bmap
= isl_basic_map_cow(bmap
);
1220 if (isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
) < 0)
1223 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
1224 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
1225 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
1226 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1227 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
1228 j
= isl_seq_last_non_zero(bmap
->eq
[i
] + 1, total
);
1229 if (j
>= nparam
&& j
< nparam
+ n_in
+ n_out
&&
1230 (isl_int_is_one(bmap
->eq
[i
][1 + j
]) ||
1231 isl_int_is_negone(bmap
->eq
[i
][1 + j
])))
1233 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
1237 bmap
= isl_basic_map_finalize(bmap
);
1241 isl_basic_map_free(bmap
);
1245 static int aff_split_cmp(const void *p1
, const void *p2
, void *user
)
1247 const struct isl_aff_split
*s1
, *s2
;
1248 s1
= (const struct isl_aff_split
*) p1
;
1249 s2
= (const struct isl_aff_split
*) p2
;
1251 return isl_basic_map_plain_cmp(s1
->aff
, s2
->aff
);
1254 static __isl_give isl_basic_map
*drop_aff(__isl_take isl_basic_map
*bmap
,
1255 __isl_keep isl_basic_map
*aff
)
1263 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1265 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
1266 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + total
,
1269 for (j
= 0; j
< aff
->n_eq
; ++j
) {
1270 if (!isl_seq_eq(bmap
->eq
[i
], aff
->eq
[j
], 1 + total
) &&
1271 !isl_seq_is_neg(bmap
->eq
[i
], aff
->eq
[j
], 1 + total
))
1273 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
1281 isl_basic_map_free(bmap
);
1285 static __isl_give
struct isl_aff_split
*split_aff(__isl_keep isl_map
*map
)
1288 struct isl_aff_split
*split
;
1291 ctx
= isl_map_get_ctx(map
);
1292 split
= isl_calloc_array(ctx
, struct isl_aff_split
, map
->n
);
1296 for (i
= 0; i
< map
->n
; ++i
) {
1297 isl_basic_map
*bmap
;
1298 split
[i
].aff
= get_aff(isl_basic_map_copy(map
->p
[i
]));
1299 bmap
= isl_basic_map_copy(map
->p
[i
]);
1300 bmap
= isl_basic_map_cow(bmap
);
1301 bmap
= drop_aff(bmap
, split
[i
].aff
);
1302 split
[i
].map
= isl_map_from_basic_map(bmap
);
1303 if (!split
[i
].aff
|| !split
[i
].map
)
1307 if (isl_sort(split
, map
->n
, sizeof(struct isl_aff_split
),
1308 &aff_split_cmp
, NULL
) < 0)
1312 for (i
= n
- 1; i
>= 1; --i
) {
1313 if (!isl_basic_map_plain_is_equal(split
[i
- 1].aff
,
1316 isl_basic_map_free(split
[i
].aff
);
1317 split
[i
- 1].map
= isl_map_union(split
[i
- 1].map
,
1320 split
[i
] = split
[n
- 1];
1321 split
[n
- 1].aff
= NULL
;
1322 split
[n
- 1].map
= NULL
;
1328 free_split(split
, map
->n
);
1332 static int defining_equality(__isl_keep isl_basic_map
*eq
,
1333 __isl_keep isl_space
*dim
, enum isl_dim_type type
, int pos
)
1341 pos
+= isl_space_offset(dim
, type
);
1342 total
= isl_basic_map_total_dim(eq
);
1344 for (i
= 0; i
< eq
->n_eq
; ++i
) {
1345 if (isl_seq_last_non_zero(eq
->eq
[i
] + 1, total
) != pos
)
1347 if (isl_int_is_one(eq
->eq
[i
][1 + pos
]))
1348 isl_seq_neg(eq
->eq
[i
], eq
->eq
[i
], 1 + total
);
1355 /* Print dimension "pos" of data->space to "p".
1357 * data->user is assumed to be an isl_basic_map keeping track of equalities.
1359 * If the current dimension is defined by these equalities, then print
1360 * the corresponding expression, assigned to the name of the dimension
1361 * if there is any. Otherwise, print the name of the dimension.
1363 static __isl_give isl_printer
*print_dim_eq(__isl_take isl_printer
*p
,
1364 struct isl_print_space_data
*data
, unsigned pos
)
1366 isl_basic_map
*eq
= data
->user
;
1369 j
= defining_equality(eq
, data
->space
, data
->type
, pos
);
1371 if (isl_space_has_dim_name(data
->space
, data
->type
, pos
)) {
1372 p
= print_name(data
->space
, p
, data
->type
, pos
,
1374 p
= isl_printer_print_str(p
, " = ");
1376 pos
+= 1 + isl_space_offset(data
->space
, data
->type
);
1377 p
= print_affine_of_len(data
->space
, NULL
, p
, eq
->eq
[j
], pos
);
1379 p
= print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
1385 static __isl_give isl_printer
*print_split_map(__isl_take isl_printer
*p
,
1386 struct isl_aff_split
*split
, int n
, __isl_keep isl_space
*space
)
1388 struct isl_print_space_data data
= { 0 };
1392 data
.print_dim
= &print_dim_eq
;
1393 for (i
= 0; i
< n
; ++i
) {
1396 rational
= split
[i
].map
->n
> 0 &&
1397 ISL_F_ISSET(split
[i
].map
->p
[0], ISL_BASIC_MAP_RATIONAL
);
1399 p
= isl_printer_print_str(p
, "; ");
1400 data
.user
= split
[i
].aff
;
1401 p
= isl_print_space(space
, p
, rational
, &data
);
1402 p
= print_disjuncts_map(split
[i
].map
, space
, p
, 0);
1408 static __isl_give isl_printer
*isl_map_print_isl_body(__isl_keep isl_map
*map
,
1409 __isl_take isl_printer
*p
)
1411 struct isl_print_space_data data
= { 0 };
1412 struct isl_aff_split
*split
= NULL
;
1416 return isl_printer_free(p
);
1417 if (!p
->dump
&& map
->n
> 0)
1418 split
= split_aff(map
);
1420 p
= print_split_map(p
, split
, map
->n
, map
->dim
);
1422 rational
= map
->n
> 0 &&
1423 ISL_F_ISSET(map
->p
[0], ISL_BASIC_MAP_RATIONAL
);
1424 p
= isl_print_space(map
->dim
, p
, rational
, &data
);
1425 p
= print_disjuncts_map(map
, map
->dim
, p
, 0);
1427 free_split(split
, map
->n
);
1431 static __isl_give isl_printer
*isl_map_print_isl(__isl_keep isl_map
*map
,
1432 __isl_take isl_printer
*p
)
1434 struct isl_print_space_data data
= { 0 };
1436 p
= print_param_tuple(p
, map
->dim
, &data
);
1437 p
= isl_printer_print_str(p
, s_open_set
[0]);
1438 p
= isl_map_print_isl_body(map
, p
);
1439 p
= isl_printer_print_str(p
, s_close_set
[0]);
1443 static __isl_give isl_printer
*print_latex_map(__isl_keep isl_map
*map
,
1444 __isl_take isl_printer
*p
, __isl_keep isl_basic_map
*aff
)
1446 struct isl_print_space_data data
= { 0 };
1449 p
= print_param_tuple(p
, map
->dim
, &data
);
1450 p
= isl_printer_print_str(p
, s_open_set
[1]);
1451 data
.print_dim
= &print_dim_eq
;
1453 p
= isl_print_space(map
->dim
, p
, 0, &data
);
1454 p
= print_disjuncts_map(map
, map
->dim
, p
, 1);
1455 p
= isl_printer_print_str(p
, s_close_set
[1]);
1460 static __isl_give isl_printer
*isl_map_print_latex(__isl_keep isl_map
*map
,
1461 __isl_take isl_printer
*p
)
1464 struct isl_aff_split
*split
= NULL
;
1467 split
= split_aff(map
);
1470 return print_latex_map(map
, p
, NULL
);
1472 for (i
= 0; i
< map
->n
; ++i
) {
1476 p
= isl_printer_print_str(p
, " \\cup ");
1477 p
= print_latex_map(split
[i
].map
, p
, split
[i
].aff
);
1480 free_split(split
, map
->n
);
1484 __isl_give isl_printer
*isl_printer_print_basic_map(__isl_take isl_printer
*p
,
1485 __isl_keep isl_basic_map
*bmap
)
1489 if (p
->output_format
== ISL_FORMAT_ISL
)
1490 return isl_basic_map_print_isl(bmap
, p
, 0);
1491 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1492 return basic_map_print_omega(bmap
, p
);
1493 isl_assert(bmap
->ctx
, 0, goto error
);
1495 isl_printer_free(p
);
1499 __isl_give isl_printer
*isl_printer_print_basic_set(__isl_take isl_printer
*p
,
1500 __isl_keep isl_basic_set
*bset
)
1505 if (p
->output_format
== ISL_FORMAT_ISL
)
1506 return isl_basic_map_print_isl(bset
, p
, 0);
1507 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1508 return isl_basic_set_print_polylib(bset
, p
, 0);
1509 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1510 return isl_basic_set_print_polylib(bset
, p
, 1);
1511 else if (p
->output_format
== ISL_FORMAT_POLYLIB_CONSTRAINTS
)
1512 return bset_print_constraints_polylib(bset
, p
);
1513 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1514 return basic_set_print_omega(bset
, p
);
1515 isl_assert(p
->ctx
, 0, goto error
);
1517 isl_printer_free(p
);
1521 __isl_give isl_printer
*isl_printer_print_set(__isl_take isl_printer
*p
,
1522 __isl_keep isl_set
*set
)
1526 if (p
->output_format
== ISL_FORMAT_ISL
)
1527 return isl_map_print_isl(set_to_map(set
), p
);
1528 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1529 return isl_set_print_polylib(set
, p
, 0);
1530 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1531 return isl_set_print_polylib(set
, p
, 1);
1532 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1533 return isl_set_print_omega(set
, p
);
1534 else if (p
->output_format
== ISL_FORMAT_LATEX
)
1535 return isl_map_print_latex(set_to_map(set
), p
);
1536 isl_assert(set
->ctx
, 0, goto error
);
1538 isl_printer_free(p
);
1542 __isl_give isl_printer
*isl_printer_print_map(__isl_take isl_printer
*p
,
1543 __isl_keep isl_map
*map
)
1548 if (p
->output_format
== ISL_FORMAT_ISL
)
1549 return isl_map_print_isl(map
, p
);
1550 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1551 return isl_map_print_polylib(map
, p
, 0);
1552 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1553 return isl_map_print_polylib(map
, p
, 1);
1554 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1555 return isl_map_print_omega(map
, p
);
1556 else if (p
->output_format
== ISL_FORMAT_LATEX
)
1557 return isl_map_print_latex(map
, p
);
1558 isl_assert(map
->ctx
, 0, goto error
);
1560 isl_printer_free(p
);
1564 struct isl_union_print_data
{
1569 static isl_stat
print_map_body(__isl_take isl_map
*map
, void *user
)
1571 struct isl_union_print_data
*data
;
1572 data
= (struct isl_union_print_data
*)user
;
1575 data
->p
= isl_printer_print_str(data
->p
, "; ");
1578 data
->p
= isl_map_print_isl_body(map
, data
->p
);
1584 /* Print the body of "umap" (everything except the parameter declarations)
1585 * to "p" in isl format.
1587 static __isl_give isl_printer
*isl_printer_print_union_map_isl_body(
1588 __isl_take isl_printer
*p
, __isl_keep isl_union_map
*umap
)
1590 struct isl_union_print_data data
;
1592 p
= isl_printer_print_str(p
, s_open_set
[0]);
1595 isl_union_map_foreach_map(umap
, &print_map_body
, &data
);
1597 p
= isl_printer_print_str(p
, s_close_set
[0]);
1601 /* Print the body of "uset" (everything except the parameter declarations)
1602 * to "p" in isl format.
1604 static __isl_give isl_printer
*isl_printer_print_union_set_isl_body(
1605 __isl_take isl_printer
*p
, __isl_keep isl_union_set
*uset
)
1607 return isl_printer_print_union_map_isl_body(p
, uset_to_umap(uset
));
1610 /* Print the isl_union_map "umap" to "p" in isl format.
1612 static __isl_give isl_printer
*isl_union_map_print_isl(
1613 __isl_keep isl_union_map
*umap
, __isl_take isl_printer
*p
)
1615 struct isl_print_space_data space_data
= { 0 };
1618 space
= isl_union_map_get_space(umap
);
1619 p
= print_param_tuple(p
, space
, &space_data
);
1620 isl_space_free(space
);
1622 p
= isl_printer_print_union_map_isl_body(p
, umap
);
1627 static isl_stat
print_latex_map_body(__isl_take isl_map
*map
, void *user
)
1629 struct isl_union_print_data
*data
;
1630 data
= (struct isl_union_print_data
*)user
;
1633 data
->p
= isl_printer_print_str(data
->p
, " \\cup ");
1636 data
->p
= isl_map_print_latex(map
, data
->p
);
1642 static __isl_give isl_printer
*isl_union_map_print_latex(
1643 __isl_keep isl_union_map
*umap
, __isl_take isl_printer
*p
)
1645 struct isl_union_print_data data
= { p
, 1 };
1646 isl_union_map_foreach_map(umap
, &print_latex_map_body
, &data
);
1651 __isl_give isl_printer
*isl_printer_print_union_map(__isl_take isl_printer
*p
,
1652 __isl_keep isl_union_map
*umap
)
1657 if (p
->output_format
== ISL_FORMAT_ISL
)
1658 return isl_union_map_print_isl(umap
, p
);
1659 if (p
->output_format
== ISL_FORMAT_LATEX
)
1660 return isl_union_map_print_latex(umap
, p
);
1662 isl_die(p
->ctx
, isl_error_invalid
,
1663 "invalid output format for isl_union_map", goto error
);
1665 isl_printer_free(p
);
1669 __isl_give isl_printer
*isl_printer_print_union_set(__isl_take isl_printer
*p
,
1670 __isl_keep isl_union_set
*uset
)
1675 if (p
->output_format
== ISL_FORMAT_ISL
)
1676 return isl_union_map_print_isl(uset_to_umap(uset
), p
);
1677 if (p
->output_format
== ISL_FORMAT_LATEX
)
1678 return isl_union_map_print_latex(uset_to_umap(uset
), p
);
1680 isl_die(p
->ctx
, isl_error_invalid
,
1681 "invalid output format for isl_union_set", goto error
);
1683 isl_printer_free(p
);
1687 static int poly_rec_n_non_zero(__isl_keep isl_poly_rec
*rec
)
1695 for (i
= 0, n
= 0; i
< rec
->n
; ++i
) {
1696 isl_bool is_zero
= isl_poly_is_zero(rec
->p
[i
]);
1707 static __isl_give isl_printer
*poly_print_cst(__isl_keep isl_poly
*poly
,
1708 __isl_take isl_printer
*p
, int first
)
1713 cst
= isl_poly_as_cst(poly
);
1716 neg
= !first
&& isl_int_is_neg(cst
->n
);
1718 p
= isl_printer_print_str(p
, neg
? " - " : " + ");
1720 isl_int_neg(cst
->n
, cst
->n
);
1721 if (isl_int_is_zero(cst
->d
)) {
1722 int sgn
= isl_int_sgn(cst
->n
);
1723 p
= isl_printer_print_str(p
, sgn
< 0 ? "-infty" :
1724 sgn
== 0 ? "NaN" : "infty");
1726 p
= isl_printer_print_isl_int(p
, cst
->n
);
1728 isl_int_neg(cst
->n
, cst
->n
);
1729 if (!isl_int_is_zero(cst
->d
) && !isl_int_is_one(cst
->d
)) {
1730 p
= isl_printer_print_str(p
, "/");
1731 p
= isl_printer_print_isl_int(p
, cst
->d
);
1735 isl_printer_free(p
);
1739 static __isl_give isl_printer
*print_base(__isl_take isl_printer
*p
,
1740 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int var
)
1744 total
= isl_space_dim(space
, isl_dim_all
);
1746 p
= print_term(space
, NULL
, space
->ctx
->one
, 1 + var
, p
, 0);
1748 p
= print_div(space
, div
, var
- total
, p
);
1752 static __isl_give isl_printer
*print_pow(__isl_take isl_printer
*p
,
1753 __isl_keep isl_space
*dim
, __isl_keep isl_mat
*div
, int var
, int exp
)
1755 p
= print_base(p
, dim
, div
, var
);
1758 if (p
->output_format
== ISL_FORMAT_C
) {
1760 for (i
= 1; i
< exp
; ++i
) {
1761 p
= isl_printer_print_str(p
, "*");
1762 p
= print_base(p
, dim
, div
, var
);
1765 p
= isl_printer_print_str(p
, "^");
1766 p
= isl_printer_print_int(p
, exp
);
1771 /* Print the polynomial "poly" defined over the domain space "space" and
1772 * local variables defined by "div" to "p".
1774 static __isl_give isl_printer
*poly_print(__isl_keep isl_poly
*poly
,
1775 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
1776 __isl_take isl_printer
*p
)
1778 int i
, n
, first
, print_parens
;
1781 if (!p
|| !poly
|| !space
|| !div
)
1784 if (isl_poly_is_cst(poly
))
1785 return poly_print_cst(poly
, p
, 1);
1787 rec
= isl_poly_as_rec(poly
);
1788 n
= poly_rec_n_non_zero(rec
);
1790 return isl_printer_free(p
);
1791 print_parens
= n
> 1;
1793 p
= isl_printer_print_str(p
, "(");
1794 for (i
= 0, first
= 1; i
< rec
->n
; ++i
) {
1795 isl_bool is_zero
= isl_poly_is_zero(rec
->p
[i
]);
1798 return isl_printer_free(p
);
1801 if (isl_poly_is_negone(rec
->p
[i
])) {
1803 p
= isl_printer_print_str(p
, "-1");
1805 p
= isl_printer_print_str(p
, "-");
1807 p
= isl_printer_print_str(p
, " - ");
1808 } else if (isl_poly_is_cst(rec
->p
[i
]) &&
1809 !isl_poly_is_one(rec
->p
[i
]))
1810 p
= poly_print_cst(rec
->p
[i
], p
, first
);
1813 p
= isl_printer_print_str(p
, " + ");
1814 if (i
== 0 || !isl_poly_is_one(rec
->p
[i
]))
1815 p
= poly_print(rec
->p
[i
], space
, div
, p
);
1820 if (!isl_poly_is_one(rec
->p
[i
]) &&
1821 !isl_poly_is_negone(rec
->p
[i
]))
1822 p
= isl_printer_print_str(p
, " * ");
1823 p
= print_pow(p
, space
, div
, rec
->poly
.var
, i
);
1826 p
= isl_printer_print_str(p
, ")");
1829 isl_printer_free(p
);
1833 static __isl_give isl_printer
*print_qpolynomial(__isl_take isl_printer
*p
,
1834 __isl_keep isl_qpolynomial
*qp
)
1838 p
= poly_print(qp
->poly
, qp
->dim
, qp
->div
, p
);
1841 isl_printer_free(p
);
1845 static __isl_give isl_printer
*print_qpolynomial_isl(__isl_take isl_printer
*p
,
1846 __isl_keep isl_qpolynomial
*qp
)
1848 struct isl_print_space_data data
= { 0 };
1853 p
= print_param_tuple(p
, qp
->dim
, &data
);
1854 p
= isl_printer_print_str(p
, "{ ");
1855 if (!isl_space_is_params(qp
->dim
)) {
1856 p
= isl_print_space(qp
->dim
, p
, 0, &data
);
1857 p
= isl_printer_print_str(p
, " -> ");
1859 p
= print_qpolynomial(p
, qp
);
1860 p
= isl_printer_print_str(p
, " }");
1863 isl_printer_free(p
);
1867 /* Print the quasi-polynomial "qp" to "p" in C format, with the variable names
1868 * taken from the domain space "space".
1870 static __isl_give isl_printer
*print_qpolynomial_c(__isl_take isl_printer
*p
,
1871 __isl_keep isl_space
*space
, __isl_keep isl_qpolynomial
*qp
)
1876 den
= isl_qpolynomial_get_den(qp
);
1877 qp
= isl_qpolynomial_copy(qp
);
1878 qp
= isl_qpolynomial_scale_val(qp
, isl_val_copy(den
));
1879 is_one
= isl_val_is_one(den
);
1881 p
= isl_printer_free(p
);
1883 p
= isl_printer_print_str(p
, "(");
1885 p
= poly_print(qp
->poly
, space
, qp
->div
, p
);
1887 p
= isl_printer_free(p
);
1889 p
= isl_printer_print_str(p
, ")/");
1890 p
= isl_printer_print_val(p
, den
);
1892 isl_qpolynomial_free(qp
);
1897 __isl_give isl_printer
*isl_printer_print_qpolynomial(
1898 __isl_take isl_printer
*p
, __isl_keep isl_qpolynomial
*qp
)
1903 if (p
->output_format
== ISL_FORMAT_ISL
)
1904 return print_qpolynomial_isl(p
, qp
);
1905 else if (p
->output_format
== ISL_FORMAT_C
)
1906 return print_qpolynomial_c(p
, qp
->dim
, qp
);
1908 isl_die(qp
->dim
->ctx
, isl_error_unsupported
,
1909 "output format not supported for isl_qpolynomials",
1912 isl_printer_free(p
);
1916 void isl_qpolynomial_print(__isl_keep isl_qpolynomial
*qp
, FILE *out
,
1917 unsigned output_format
)
1924 isl_assert(qp
->dim
->ctx
, output_format
== ISL_FORMAT_ISL
, return);
1925 p
= isl_printer_to_file(qp
->dim
->ctx
, out
);
1926 p
= isl_printer_print_qpolynomial(p
, qp
);
1927 isl_printer_free(p
);
1930 static __isl_give isl_printer
*qpolynomial_fold_print(
1931 __isl_keep isl_qpolynomial_fold
*fold
, __isl_take isl_printer
*p
)
1935 if (fold
->type
== isl_fold_min
)
1936 p
= isl_printer_print_str(p
, "min");
1937 else if (fold
->type
== isl_fold_max
)
1938 p
= isl_printer_print_str(p
, "max");
1939 p
= isl_printer_print_str(p
, "(");
1940 for (i
= 0; i
< fold
->n
; ++i
) {
1942 p
= isl_printer_print_str(p
, ", ");
1943 p
= print_qpolynomial(p
, fold
->qp
[i
]);
1945 p
= isl_printer_print_str(p
, ")");
1949 void isl_qpolynomial_fold_print(__isl_keep isl_qpolynomial_fold
*fold
,
1950 FILE *out
, unsigned output_format
)
1957 isl_assert(fold
->dim
->ctx
, output_format
== ISL_FORMAT_ISL
, return);
1959 p
= isl_printer_to_file(fold
->dim
->ctx
, out
);
1960 p
= isl_printer_print_qpolynomial_fold(p
, fold
);
1962 isl_printer_free(p
);
1965 static __isl_give isl_printer
*isl_pwqp_print_isl_body(
1966 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
1968 struct isl_print_space_data data
= { 0 };
1971 for (i
= 0; i
< pwqp
->n
; ++i
) {
1975 p
= isl_printer_print_str(p
, "; ");
1976 space
= isl_qpolynomial_get_domain_space(pwqp
->p
[i
].qp
);
1977 if (!isl_space_is_params(space
)) {
1978 p
= isl_print_space(space
, p
, 0, &data
);
1979 p
= isl_printer_print_str(p
, " -> ");
1981 p
= print_qpolynomial(p
, pwqp
->p
[i
].qp
);
1982 p
= print_disjuncts(set_to_map(pwqp
->p
[i
].set
), space
, p
, 0);
1983 isl_space_free(space
);
1989 static __isl_give isl_printer
*print_pw_qpolynomial_isl(
1990 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
1992 struct isl_print_space_data data
= { 0 };
1997 p
= print_param_tuple(p
, pwqp
->dim
, &data
);
1998 p
= isl_printer_print_str(p
, "{ ");
2000 if (!isl_space_is_set(pwqp
->dim
)) {
2001 p
= print_tuple(pwqp
->dim
, p
, isl_dim_in
, &data
);
2002 p
= isl_printer_print_str(p
, " -> ");
2004 p
= isl_printer_print_str(p
, "0");
2006 p
= isl_pwqp_print_isl_body(p
, pwqp
);
2007 p
= isl_printer_print_str(p
, " }");
2010 isl_printer_free(p
);
2014 void isl_pw_qpolynomial_print(__isl_keep isl_pw_qpolynomial
*pwqp
, FILE *out
,
2015 unsigned output_format
)
2022 p
= isl_printer_to_file(pwqp
->dim
->ctx
, out
);
2023 p
= isl_printer_set_output_format(p
, output_format
);
2024 p
= isl_printer_print_pw_qpolynomial(p
, pwqp
);
2026 isl_printer_free(p
);
2029 static __isl_give isl_printer
*isl_pwf_print_isl_body(
2030 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2032 struct isl_print_space_data data
= { 0 };
2035 for (i
= 0; i
< pwf
->n
; ++i
) {
2039 p
= isl_printer_print_str(p
, "; ");
2040 space
= isl_qpolynomial_fold_get_domain_space(pwf
->p
[i
].fold
);
2041 if (!isl_space_is_params(space
)) {
2042 p
= isl_print_space(space
, p
, 0, &data
);
2043 p
= isl_printer_print_str(p
, " -> ");
2045 p
= qpolynomial_fold_print(pwf
->p
[i
].fold
, p
);
2046 p
= print_disjuncts(set_to_map(pwf
->p
[i
].set
), space
, p
, 0);
2047 isl_space_free(space
);
2053 static __isl_give isl_printer
*print_pw_qpolynomial_fold_isl(
2054 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2056 struct isl_print_space_data data
= { 0 };
2058 p
= print_param_tuple(p
, pwf
->dim
, &data
);
2059 p
= isl_printer_print_str(p
, "{ ");
2061 if (!isl_space_is_set(pwf
->dim
)) {
2062 p
= print_tuple(pwf
->dim
, p
, isl_dim_in
, &data
);
2063 p
= isl_printer_print_str(p
, " -> ");
2065 p
= isl_printer_print_str(p
, "0");
2067 p
= isl_pwf_print_isl_body(p
, pwf
);
2068 p
= isl_printer_print_str(p
, " }");
2072 static __isl_give isl_printer
*print_affine_c(__isl_take isl_printer
*p
,
2073 __isl_keep isl_space
*space
, __isl_keep isl_basic_set
*bset
,
2076 static __isl_give isl_printer
*print_name_c(__isl_take isl_printer
*p
,
2077 __isl_keep isl_space
*dim
,
2078 __isl_keep isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
)
2080 if (type
== isl_dim_div
) {
2081 p
= isl_printer_print_str(p
, "floord(");
2082 p
= print_affine_c(p
, dim
, bset
, bset
->div
[pos
] + 1);
2083 p
= isl_printer_print_str(p
, ", ");
2084 p
= isl_printer_print_isl_int(p
, bset
->div
[pos
][0]);
2085 p
= isl_printer_print_str(p
, ")");
2089 name
= isl_space_get_dim_name(dim
, type
, pos
);
2092 p
= isl_printer_print_str(p
, name
);
2097 static __isl_give isl_printer
*print_term_c(__isl_take isl_printer
*p
,
2098 __isl_keep isl_space
*space
,
2099 __isl_keep isl_basic_set
*bset
, isl_int c
, unsigned pos
)
2101 enum isl_dim_type type
;
2104 return isl_printer_free(p
);
2107 return isl_printer_print_isl_int(p
, c
);
2109 if (isl_int_is_one(c
))
2111 else if (isl_int_is_negone(c
))
2112 p
= isl_printer_print_str(p
, "-");
2114 p
= isl_printer_print_isl_int(p
, c
);
2115 p
= isl_printer_print_str(p
, "*");
2117 type
= pos2type(space
, &pos
);
2118 p
= print_name_c(p
, space
, bset
, type
, pos
);
2122 static __isl_give isl_printer
*print_partial_affine_c(__isl_take isl_printer
*p
,
2123 __isl_keep isl_space
*dim
,
2124 __isl_keep isl_basic_set
*bset
, isl_int
*c
, unsigned len
)
2129 for (i
= 0, first
= 1; i
< len
; ++i
) {
2131 if (isl_int_is_zero(c
[i
]))
2134 if (isl_int_is_neg(c
[i
])) {
2136 isl_int_neg(c
[i
], c
[i
]);
2137 p
= isl_printer_print_str(p
, " - ");
2139 p
= isl_printer_print_str(p
, " + ");
2142 p
= print_term_c(p
, dim
, bset
, c
[i
], i
);
2144 isl_int_neg(c
[i
], c
[i
]);
2147 p
= isl_printer_print_str(p
, "0");
2151 static __isl_give isl_printer
*print_affine_c(__isl_take isl_printer
*p
,
2152 __isl_keep isl_space
*space
, __isl_keep isl_basic_set
*bset
, isl_int
*c
)
2154 unsigned len
= 1 + isl_basic_set_total_dim(bset
);
2155 return print_partial_affine_c(p
, space
, bset
, c
, len
);
2158 /* We skip the constraint if it is implied by the div expression.
2160 * *first indicates whether this is the first constraint in the conjunction and
2161 * is updated if the constraint is actually printed.
2163 static __isl_give isl_printer
*print_constraint_c(__isl_take isl_printer
*p
,
2164 __isl_keep isl_space
*dim
,
2165 __isl_keep isl_basic_set
*bset
, isl_int
*c
, const char *op
, int *first
)
2171 o_div
= isl_basic_set_offset(bset
, isl_dim_div
);
2172 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
2173 div
= isl_seq_last_non_zero(c
+ o_div
, n_div
);
2175 isl_bool is_div
= isl_basic_set_is_div_constraint(bset
, c
, div
);
2177 return isl_printer_free(p
);
2183 p
= isl_printer_print_str(p
, " && ");
2185 p
= print_affine_c(p
, dim
, bset
, c
);
2186 p
= isl_printer_print_str(p
, " ");
2187 p
= isl_printer_print_str(p
, op
);
2188 p
= isl_printer_print_str(p
, " 0");
2195 static __isl_give isl_printer
*print_basic_set_c(__isl_take isl_printer
*p
,
2196 __isl_keep isl_space
*space
, __isl_keep isl_basic_set
*bset
)
2200 unsigned n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
2201 unsigned total
= isl_basic_set_total_dim(bset
) - n_div
;
2203 for (i
= 0; i
< bset
->n_eq
; ++i
) {
2204 j
= isl_seq_last_non_zero(bset
->eq
[i
] + 1 + total
, n_div
);
2206 p
= print_constraint_c(p
, space
, bset
,
2207 bset
->eq
[i
], "==", &first
);
2210 p
= isl_printer_print_str(p
, " && ");
2211 p
= isl_printer_print_str(p
, "(");
2212 p
= print_partial_affine_c(p
, space
, bset
, bset
->eq
[i
],
2214 p
= isl_printer_print_str(p
, ") % ");
2215 p
= isl_printer_print_isl_int(p
,
2216 bset
->eq
[i
][1 + total
+ j
]);
2217 p
= isl_printer_print_str(p
, " == 0");
2221 for (i
= 0; i
< bset
->n_ineq
; ++i
)
2222 p
= print_constraint_c(p
, space
, bset
, bset
->ineq
[i
], ">=",
2227 static __isl_give isl_printer
*print_set_c(__isl_take isl_printer
*p
,
2228 __isl_keep isl_space
*space
, __isl_keep isl_set
*set
)
2233 return isl_printer_free(p
);
2236 p
= isl_printer_print_str(p
, "0");
2238 for (i
= 0; i
< set
->n
; ++i
) {
2240 p
= isl_printer_print_str(p
, " || ");
2242 p
= isl_printer_print_str(p
, "(");
2243 p
= print_basic_set_c(p
, space
, set
->p
[i
]);
2245 p
= isl_printer_print_str(p
, ")");
2250 /* Print the piecewise quasi-polynomial "pwqp" to "p" in C format.
2252 static __isl_give isl_printer
*print_pw_qpolynomial_c(
2253 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2258 space
= isl_pw_qpolynomial_get_domain_space(pwqp
);
2259 if (pwqp
->n
== 1 && isl_set_plain_is_universe(pwqp
->p
[0].set
)) {
2260 p
= print_qpolynomial_c(p
, space
, pwqp
->p
[0].qp
);
2261 isl_space_free(space
);
2265 for (i
= 0; i
< pwqp
->n
; ++i
) {
2266 p
= isl_printer_print_str(p
, "(");
2267 p
= print_set_c(p
, space
, pwqp
->p
[i
].set
);
2268 p
= isl_printer_print_str(p
, ") ? (");
2269 p
= print_qpolynomial_c(p
, space
, pwqp
->p
[i
].qp
);
2270 p
= isl_printer_print_str(p
, ") : ");
2273 isl_space_free(space
);
2274 p
= isl_printer_print_str(p
, "0");
2278 __isl_give isl_printer
*isl_printer_print_pw_qpolynomial(
2279 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2284 if (p
->output_format
== ISL_FORMAT_ISL
)
2285 return print_pw_qpolynomial_isl(p
, pwqp
);
2286 else if (p
->output_format
== ISL_FORMAT_C
)
2287 return print_pw_qpolynomial_c(p
, pwqp
);
2288 isl_assert(p
->ctx
, 0, goto error
);
2290 isl_printer_free(p
);
2294 static isl_stat
print_pwqp_body(__isl_take isl_pw_qpolynomial
*pwqp
, void *user
)
2296 struct isl_union_print_data
*data
;
2297 data
= (struct isl_union_print_data
*)user
;
2300 data
->p
= isl_printer_print_str(data
->p
, "; ");
2303 data
->p
= isl_pwqp_print_isl_body(data
->p
, pwqp
);
2304 isl_pw_qpolynomial_free(pwqp
);
2309 static __isl_give isl_printer
*print_union_pw_qpolynomial_isl(
2310 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_qpolynomial
*upwqp
)
2312 struct isl_union_print_data data
;
2313 struct isl_print_space_data space_data
= { 0 };
2316 space
= isl_union_pw_qpolynomial_get_space(upwqp
);
2317 p
= print_param_tuple(p
, space
, &space_data
);
2318 isl_space_free(space
);
2319 p
= isl_printer_print_str(p
, "{ ");
2322 isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp
, &print_pwqp_body
,
2325 p
= isl_printer_print_str(p
, " }");
2329 __isl_give isl_printer
*isl_printer_print_union_pw_qpolynomial(
2330 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_qpolynomial
*upwqp
)
2335 if (p
->output_format
== ISL_FORMAT_ISL
)
2336 return print_union_pw_qpolynomial_isl(p
, upwqp
);
2337 isl_die(p
->ctx
, isl_error_invalid
,
2338 "invalid output format for isl_union_pw_qpolynomial",
2341 isl_printer_free(p
);
2345 /* Print the quasi-polynomial reduction "fold" to "p" in C format,
2346 * with the variable names taken from the domain space "space".
2348 static __isl_give isl_printer
*print_qpolynomial_fold_c(
2349 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
,
2350 __isl_keep isl_qpolynomial_fold
*fold
)
2354 for (i
= 0; i
< fold
->n
- 1; ++i
)
2355 if (fold
->type
== isl_fold_min
)
2356 p
= isl_printer_print_str(p
, "min(");
2357 else if (fold
->type
== isl_fold_max
)
2358 p
= isl_printer_print_str(p
, "max(");
2360 for (i
= 0; i
< fold
->n
; ++i
) {
2362 p
= isl_printer_print_str(p
, ", ");
2363 p
= print_qpolynomial_c(p
, space
, fold
->qp
[i
]);
2365 p
= isl_printer_print_str(p
, ")");
2370 __isl_give isl_printer
*isl_printer_print_qpolynomial_fold(
2371 __isl_take isl_printer
*p
, __isl_keep isl_qpolynomial_fold
*fold
)
2375 if (p
->output_format
== ISL_FORMAT_ISL
)
2376 return qpolynomial_fold_print(fold
, p
);
2377 else if (p
->output_format
== ISL_FORMAT_C
)
2378 return print_qpolynomial_fold_c(p
, fold
->dim
, fold
);
2379 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2382 isl_printer_free(p
);
2386 /* Print the piecewise quasi-polynomial reduction "pwf" to "p" in C format.
2388 static __isl_give isl_printer
*print_pw_qpolynomial_fold_c(
2389 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2394 space
= isl_pw_qpolynomial_fold_get_domain_space(pwf
);
2395 if (pwf
->n
== 1 && isl_set_plain_is_universe(pwf
->p
[0].set
)) {
2396 p
= print_qpolynomial_fold_c(p
, space
, pwf
->p
[0].fold
);
2397 isl_space_free(space
);
2401 for (i
= 0; i
< pwf
->n
; ++i
) {
2402 p
= isl_printer_print_str(p
, "(");
2403 p
= print_set_c(p
, space
, pwf
->p
[i
].set
);
2404 p
= isl_printer_print_str(p
, ") ? (");
2405 p
= print_qpolynomial_fold_c(p
, space
, pwf
->p
[i
].fold
);
2406 p
= isl_printer_print_str(p
, ") : ");
2409 isl_space_free(space
);
2410 p
= isl_printer_print_str(p
, "0");
2414 __isl_give isl_printer
*isl_printer_print_pw_qpolynomial_fold(
2415 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2420 if (p
->output_format
== ISL_FORMAT_ISL
)
2421 return print_pw_qpolynomial_fold_isl(p
, pwf
);
2422 else if (p
->output_format
== ISL_FORMAT_C
)
2423 return print_pw_qpolynomial_fold_c(p
, pwf
);
2424 isl_assert(p
->ctx
, 0, goto error
);
2426 isl_printer_free(p
);
2430 void isl_pw_qpolynomial_fold_print(__isl_keep isl_pw_qpolynomial_fold
*pwf
,
2431 FILE *out
, unsigned output_format
)
2438 p
= isl_printer_to_file(pwf
->dim
->ctx
, out
);
2439 p
= isl_printer_set_output_format(p
, output_format
);
2440 p
= isl_printer_print_pw_qpolynomial_fold(p
, pwf
);
2442 isl_printer_free(p
);
2445 static isl_stat
print_pwf_body(__isl_take isl_pw_qpolynomial_fold
*pwf
,
2448 struct isl_union_print_data
*data
;
2449 data
= (struct isl_union_print_data
*)user
;
2452 data
->p
= isl_printer_print_str(data
->p
, "; ");
2455 data
->p
= isl_pwf_print_isl_body(data
->p
, pwf
);
2456 isl_pw_qpolynomial_fold_free(pwf
);
2461 static __isl_give isl_printer
*print_union_pw_qpolynomial_fold_isl(
2462 __isl_take isl_printer
*p
,
2463 __isl_keep isl_union_pw_qpolynomial_fold
*upwf
)
2465 struct isl_union_print_data data
;
2466 struct isl_print_space_data space_data
= { 0 };
2469 space
= isl_union_pw_qpolynomial_fold_get_space(upwf
);
2470 p
= print_param_tuple(p
, space
, &space_data
);
2471 isl_space_free(space
);
2472 p
= isl_printer_print_str(p
, "{ ");
2475 isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(upwf
,
2476 &print_pwf_body
, &data
);
2478 p
= isl_printer_print_str(p
, " }");
2482 __isl_give isl_printer
*isl_printer_print_union_pw_qpolynomial_fold(
2483 __isl_take isl_printer
*p
,
2484 __isl_keep isl_union_pw_qpolynomial_fold
*upwf
)
2489 if (p
->output_format
== ISL_FORMAT_ISL
)
2490 return print_union_pw_qpolynomial_fold_isl(p
, upwf
);
2491 isl_die(p
->ctx
, isl_error_invalid
,
2492 "invalid output format for isl_union_pw_qpolynomial_fold",
2495 isl_printer_free(p
);
2499 /* Print the isl_constraint "c" to "p".
2501 __isl_give isl_printer
*isl_printer_print_constraint(__isl_take isl_printer
*p
,
2502 __isl_keep isl_constraint
*c
)
2504 struct isl_print_space_data data
= { 0 };
2505 isl_local_space
*ls
;
2512 ls
= isl_constraint_get_local_space(c
);
2514 return isl_printer_free(p
);
2515 space
= isl_local_space_get_space(ls
);
2516 p
= print_param_tuple(p
, space
, &data
);
2517 p
= isl_printer_print_str(p
, "{ ");
2518 p
= isl_print_space(space
, p
, 0, &data
);
2519 p
= isl_printer_print_str(p
, " : ");
2520 exists
= need_exists(p
, ls
->div
);
2522 p
= isl_printer_free(p
);
2523 if (exists
>= 0 && exists
)
2524 p
= open_exists(p
, space
, ls
->div
, 0);
2525 p
= print_affine_of_len(space
, ls
->div
, p
, c
->v
->el
, c
->v
->size
);
2526 if (isl_constraint_is_equality(c
))
2527 p
= isl_printer_print_str(p
, " = 0");
2529 p
= isl_printer_print_str(p
, " >= 0");
2530 if (exists
>= 0 && exists
)
2531 p
= isl_printer_print_str(p
, s_close_exists
[0]);
2532 p
= isl_printer_print_str(p
, " }");
2533 isl_space_free(space
);
2534 isl_local_space_free(ls
);
2538 isl_printer_free(p
);
2542 static __isl_give isl_printer
*isl_printer_print_space_isl(
2543 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
)
2545 struct isl_print_space_data data
= { 0 };
2550 p
= print_param_tuple(p
, space
, &data
);
2552 p
= isl_printer_print_str(p
, "{ ");
2553 if (isl_space_is_params(space
))
2554 p
= isl_printer_print_str(p
, s_such_that
[0]);
2556 p
= isl_print_space(space
, p
, 0, &data
);
2557 p
= isl_printer_print_str(p
, " }");
2561 isl_printer_free(p
);
2565 __isl_give isl_printer
*isl_printer_print_space(__isl_take isl_printer
*p
,
2566 __isl_keep isl_space
*space
)
2569 return isl_printer_free(p
);
2570 if (p
->output_format
== ISL_FORMAT_ISL
)
2571 return isl_printer_print_space_isl(p
, space
);
2572 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
2573 return print_omega_parameters(space
, p
);
2575 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
2576 "output format not supported for space",
2577 return isl_printer_free(p
));
2580 __isl_give isl_printer
*isl_printer_print_local_space(__isl_take isl_printer
*p
,
2581 __isl_keep isl_local_space
*ls
)
2583 struct isl_print_space_data data
= { 0 };
2589 p
= print_param_tuple(p
, ls
->dim
, &data
);
2590 p
= isl_printer_print_str(p
, "{ ");
2591 p
= isl_print_space(ls
->dim
, p
, 0, &data
);
2592 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
2594 p
= isl_printer_print_str(p
, " : ");
2595 p
= isl_printer_print_str(p
, s_open_exists
[0]);
2596 p
= print_div_list(p
, ls
->dim
, ls
->div
, 0, 1);
2597 p
= isl_printer_print_str(p
, s_close_exists
[0]);
2598 } else if (isl_space_is_params(ls
->dim
))
2599 p
= isl_printer_print_str(p
, s_such_that
[0]);
2600 p
= isl_printer_print_str(p
, " }");
2603 isl_printer_free(p
);
2607 /* Print the (potentially rational) affine expression "aff" to "p",
2608 * with the variable names taken from "space".
2610 static __isl_give isl_printer
*print_aff_body(__isl_take isl_printer
*p
,
2611 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
)
2615 if (isl_aff_is_nan(aff
))
2616 return isl_printer_print_str(p
, "NaN");
2618 total
= isl_local_space_dim(aff
->ls
, isl_dim_all
);
2619 p
= isl_printer_print_str(p
, "(");
2620 p
= print_affine_of_len(space
, aff
->ls
->div
, p
,
2621 aff
->v
->el
+ 1, 1 + total
);
2622 if (isl_int_is_one(aff
->v
->el
[0]))
2623 p
= isl_printer_print_str(p
, ")");
2625 p
= isl_printer_print_str(p
, ")/");
2626 p
= isl_printer_print_isl_int(p
, aff
->v
->el
[0]);
2632 static __isl_give isl_printer
*print_aff(__isl_take isl_printer
*p
,
2633 __isl_keep isl_aff
*aff
)
2635 struct isl_print_space_data data
= { 0 };
2637 if (isl_space_is_params(aff
->ls
->dim
))
2640 p
= print_tuple(aff
->ls
->dim
, p
, isl_dim_set
, &data
);
2641 p
= isl_printer_print_str(p
, " -> ");
2643 p
= isl_printer_print_str(p
, "[");
2644 p
= print_aff_body(p
, aff
->ls
->dim
, aff
);
2645 p
= isl_printer_print_str(p
, "]");
2650 static __isl_give isl_printer
*print_aff_isl(__isl_take isl_printer
*p
,
2651 __isl_keep isl_aff
*aff
)
2653 struct isl_print_space_data data
= { 0 };
2658 p
= print_param_tuple(p
, aff
->ls
->dim
, &data
);
2659 p
= isl_printer_print_str(p
, "{ ");
2660 p
= print_aff(p
, aff
);
2661 p
= isl_printer_print_str(p
, " }");
2664 isl_printer_free(p
);
2668 /* Print the body of an isl_pw_aff, i.e., a semicolon delimited
2669 * sequence of affine expressions, each followed by constraints.
2671 static __isl_give isl_printer
*print_pw_aff_body(
2672 __isl_take isl_printer
*p
, __isl_keep isl_pw_aff
*pa
)
2677 return isl_printer_free(p
);
2679 for (i
= 0; i
< pa
->n
; ++i
) {
2683 p
= isl_printer_print_str(p
, "; ");
2684 p
= print_aff(p
, pa
->p
[i
].aff
);
2685 space
= isl_aff_get_domain_space(pa
->p
[i
].aff
);
2686 p
= print_disjuncts(set_to_map(pa
->p
[i
].set
), space
, p
, 0);
2687 isl_space_free(space
);
2693 static __isl_give isl_printer
*print_pw_aff_isl(__isl_take isl_printer
*p
,
2694 __isl_keep isl_pw_aff
*pwaff
)
2696 struct isl_print_space_data data
= { 0 };
2701 p
= print_param_tuple(p
, pwaff
->dim
, &data
);
2702 p
= isl_printer_print_str(p
, "{ ");
2703 p
= print_pw_aff_body(p
, pwaff
);
2704 p
= isl_printer_print_str(p
, " }");
2707 isl_printer_free(p
);
2711 static __isl_give isl_printer
*print_ls_affine_c(__isl_take isl_printer
*p
,
2712 __isl_keep isl_local_space
*ls
, isl_int
*c
);
2714 static __isl_give isl_printer
*print_ls_name_c(__isl_take isl_printer
*p
,
2715 __isl_keep isl_local_space
*ls
, enum isl_dim_type type
, unsigned pos
)
2717 if (type
== isl_dim_div
) {
2718 p
= isl_printer_print_str(p
, "floord(");
2719 p
= print_ls_affine_c(p
, ls
, ls
->div
->row
[pos
] + 1);
2720 p
= isl_printer_print_str(p
, ", ");
2721 p
= isl_printer_print_isl_int(p
, ls
->div
->row
[pos
][0]);
2722 p
= isl_printer_print_str(p
, ")");
2726 name
= isl_space_get_dim_name(ls
->dim
, type
, pos
);
2729 p
= isl_printer_print_str(p
, name
);
2734 static __isl_give isl_printer
*print_ls_term_c(__isl_take isl_printer
*p
,
2735 __isl_keep isl_local_space
*ls
, isl_int c
, unsigned pos
)
2737 enum isl_dim_type type
;
2740 return isl_printer_free(p
);
2743 return isl_printer_print_isl_int(p
, c
);
2745 if (isl_int_is_one(c
))
2747 else if (isl_int_is_negone(c
))
2748 p
= isl_printer_print_str(p
, "-");
2750 p
= isl_printer_print_isl_int(p
, c
);
2751 p
= isl_printer_print_str(p
, "*");
2753 type
= pos2type(ls
->dim
, &pos
);
2754 p
= print_ls_name_c(p
, ls
, type
, pos
);
2758 static __isl_give isl_printer
*print_ls_partial_affine_c(
2759 __isl_take isl_printer
*p
, __isl_keep isl_local_space
*ls
,
2760 isl_int
*c
, unsigned len
)
2765 for (i
= 0, first
= 1; i
< len
; ++i
) {
2767 if (isl_int_is_zero(c
[i
]))
2770 if (isl_int_is_neg(c
[i
])) {
2772 isl_int_neg(c
[i
], c
[i
]);
2773 p
= isl_printer_print_str(p
, " - ");
2775 p
= isl_printer_print_str(p
, " + ");
2778 p
= print_ls_term_c(p
, ls
, c
[i
], i
);
2780 isl_int_neg(c
[i
], c
[i
]);
2783 p
= isl_printer_print_str(p
, "0");
2787 static __isl_give isl_printer
*print_ls_affine_c(__isl_take isl_printer
*p
,
2788 __isl_keep isl_local_space
*ls
, isl_int
*c
)
2790 unsigned len
= 1 + isl_local_space_dim(ls
, isl_dim_all
);
2791 return print_ls_partial_affine_c(p
, ls
, c
, len
);
2794 static __isl_give isl_printer
*print_aff_c(__isl_take isl_printer
*p
,
2795 __isl_keep isl_aff
*aff
)
2799 total
= isl_local_space_dim(aff
->ls
, isl_dim_all
);
2800 if (!isl_int_is_one(aff
->v
->el
[0]))
2801 p
= isl_printer_print_str(p
, "(");
2802 p
= print_ls_partial_affine_c(p
, aff
->ls
, aff
->v
->el
+ 1, 1 + total
);
2803 if (!isl_int_is_one(aff
->v
->el
[0])) {
2804 p
= isl_printer_print_str(p
, ")/");
2805 p
= isl_printer_print_isl_int(p
, aff
->v
->el
[0]);
2810 /* In the C format, we cannot express that "pwaff" may be undefined
2811 * on parts of the domain space. We therefore assume that the expression
2812 * will only be evaluated on its definition domain and compute the gist
2813 * of each cell with respect to this domain.
2815 static __isl_give isl_printer
*print_pw_aff_c(__isl_take isl_printer
*p
,
2816 __isl_keep isl_pw_aff
*pwaff
)
2819 isl_ast_build
*build
;
2823 isl_die(p
->ctx
, isl_error_unsupported
,
2824 "cannot print empty isl_pw_aff in C format",
2825 return isl_printer_free(p
));
2827 domain
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff
));
2828 build
= isl_ast_build_from_context(domain
);
2829 expr
= isl_ast_build_expr_from_pw_aff(build
, isl_pw_aff_copy(pwaff
));
2830 p
= isl_printer_print_ast_expr(p
, expr
);
2831 isl_ast_expr_free(expr
);
2832 isl_ast_build_free(build
);
2837 __isl_give isl_printer
*isl_printer_print_aff(__isl_take isl_printer
*p
,
2838 __isl_keep isl_aff
*aff
)
2843 if (p
->output_format
== ISL_FORMAT_ISL
)
2844 return print_aff_isl(p
, aff
);
2845 else if (p
->output_format
== ISL_FORMAT_C
)
2846 return print_aff_c(p
, aff
);
2847 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2850 isl_printer_free(p
);
2854 __isl_give isl_printer
*isl_printer_print_pw_aff(__isl_take isl_printer
*p
,
2855 __isl_keep isl_pw_aff
*pwaff
)
2860 if (p
->output_format
== ISL_FORMAT_ISL
)
2861 return print_pw_aff_isl(p
, pwaff
);
2862 else if (p
->output_format
== ISL_FORMAT_C
)
2863 return print_pw_aff_c(p
, pwaff
);
2864 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2867 isl_printer_free(p
);
2871 /* Print "pa" in a sequence of isl_pw_affs delimited by semicolons.
2872 * Each isl_pw_aff itself is also printed as semicolon delimited
2873 * sequence of pieces.
2874 * If data->first = 1, then this is the first in the sequence.
2875 * Update data->first to tell the next element that it is not the first.
2877 static isl_stat
print_pw_aff_body_wrap(__isl_take isl_pw_aff
*pa
,
2880 struct isl_union_print_data
*data
;
2881 data
= (struct isl_union_print_data
*) user
;
2884 data
->p
= isl_printer_print_str(data
->p
, "; ");
2887 data
->p
= print_pw_aff_body(data
->p
, pa
);
2888 isl_pw_aff_free(pa
);
2890 return data
->p
? isl_stat_ok
: isl_stat_error
;
2893 /* Print the body of an isl_union_pw_aff, i.e., a semicolon delimited
2894 * sequence of affine expressions, each followed by constraints,
2895 * with the sequence enclosed in braces.
2897 static __isl_give isl_printer
*print_union_pw_aff_body(
2898 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_aff
*upa
)
2900 struct isl_union_print_data data
= { p
, 1 };
2902 p
= isl_printer_print_str(p
, s_open_set
[0]);
2904 if (isl_union_pw_aff_foreach_pw_aff(upa
,
2905 &print_pw_aff_body_wrap
, &data
) < 0)
2906 data
.p
= isl_printer_free(p
);
2908 p
= isl_printer_print_str(p
, s_close_set
[0]);
2913 /* Print the isl_union_pw_aff "upa" to "p" in isl format.
2915 * The individual isl_pw_affs are delimited by a semicolon.
2917 static __isl_give isl_printer
*print_union_pw_aff_isl(
2918 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_aff
*upa
)
2920 struct isl_print_space_data data
= { 0 };
2923 space
= isl_union_pw_aff_get_space(upa
);
2924 p
= print_param_tuple(p
, space
, &data
);
2925 isl_space_free(space
);
2926 p
= print_union_pw_aff_body(p
, upa
);
2930 /* Print the isl_union_pw_aff "upa" to "p".
2932 * We currently only support an isl format.
2934 __isl_give isl_printer
*isl_printer_print_union_pw_aff(
2935 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_aff
*upa
)
2938 return isl_printer_free(p
);
2940 if (p
->output_format
== ISL_FORMAT_ISL
)
2941 return print_union_pw_aff_isl(p
, upa
);
2942 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
2943 "unsupported output format", return isl_printer_free(p
));
2946 /* Print dimension "pos" of data->space to "p".
2948 * data->user is assumed to be an isl_multi_aff.
2950 * If the current dimension is an output dimension, then print
2951 * the corresponding expression. Otherwise, print the name of the dimension.
2953 static __isl_give isl_printer
*print_dim_ma(__isl_take isl_printer
*p
,
2954 struct isl_print_space_data
*data
, unsigned pos
)
2956 isl_multi_aff
*ma
= data
->user
;
2958 if (data
->type
== isl_dim_out
) {
2961 space
= isl_multi_aff_get_domain_space(ma
);
2962 p
= print_aff_body(p
, space
, ma
->u
.p
[pos
]);
2963 isl_space_free(space
);
2965 p
= print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
2971 static __isl_give isl_printer
*print_multi_aff(__isl_take isl_printer
*p
,
2972 __isl_keep isl_multi_aff
*maff
)
2974 struct isl_print_space_data data
= { 0 };
2976 data
.print_dim
= &print_dim_ma
;
2978 return isl_print_space(maff
->space
, p
, 0, &data
);
2981 static __isl_give isl_printer
*print_multi_aff_isl(__isl_take isl_printer
*p
,
2982 __isl_keep isl_multi_aff
*maff
)
2984 struct isl_print_space_data data
= { 0 };
2989 p
= print_param_tuple(p
, maff
->space
, &data
);
2990 p
= isl_printer_print_str(p
, "{ ");
2991 p
= print_multi_aff(p
, maff
);
2992 p
= isl_printer_print_str(p
, " }");
2995 isl_printer_free(p
);
2999 __isl_give isl_printer
*isl_printer_print_multi_aff(__isl_take isl_printer
*p
,
3000 __isl_keep isl_multi_aff
*maff
)
3005 if (p
->output_format
== ISL_FORMAT_ISL
)
3006 return print_multi_aff_isl(p
, maff
);
3007 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3010 isl_printer_free(p
);
3014 static __isl_give isl_printer
*print_pw_multi_aff_body(
3015 __isl_take isl_printer
*p
, __isl_keep isl_pw_multi_aff
*pma
)
3022 for (i
= 0; i
< pma
->n
; ++i
) {
3026 p
= isl_printer_print_str(p
, "; ");
3027 p
= print_multi_aff(p
, pma
->p
[i
].maff
);
3028 space
= isl_multi_aff_get_domain_space(pma
->p
[i
].maff
);
3029 p
= print_disjuncts(set_to_map(pma
->p
[i
].set
), space
, p
, 0);
3030 isl_space_free(space
);
3034 isl_printer_free(p
);
3038 static __isl_give isl_printer
*print_pw_multi_aff_isl(__isl_take isl_printer
*p
,
3039 __isl_keep isl_pw_multi_aff
*pma
)
3041 struct isl_print_space_data data
= { 0 };
3046 p
= print_param_tuple(p
, pma
->dim
, &data
);
3047 p
= isl_printer_print_str(p
, "{ ");
3048 p
= print_pw_multi_aff_body(p
, pma
);
3049 p
= isl_printer_print_str(p
, " }");
3052 isl_printer_free(p
);
3056 /* Print the unnamed, single-dimensional piecewise multi affine expression "pma"
3059 static __isl_give isl_printer
*print_unnamed_pw_multi_aff_c(
3060 __isl_take isl_printer
*p
, __isl_keep isl_pw_multi_aff
*pma
)
3065 space
= isl_pw_multi_aff_get_domain_space(pma
);
3066 for (i
= 0; i
< pma
->n
- 1; ++i
) {
3067 p
= isl_printer_print_str(p
, "(");
3068 p
= print_set_c(p
, space
, pma
->p
[i
].set
);
3069 p
= isl_printer_print_str(p
, ") ? (");
3070 p
= print_aff_c(p
, pma
->p
[i
].maff
->u
.p
[0]);
3071 p
= isl_printer_print_str(p
, ") : ");
3073 isl_space_free(space
);
3075 return print_aff_c(p
, pma
->p
[pma
->n
- 1].maff
->u
.p
[0]);
3078 static __isl_give isl_printer
*print_pw_multi_aff_c(__isl_take isl_printer
*p
,
3079 __isl_keep isl_pw_multi_aff
*pma
)
3087 isl_die(p
->ctx
, isl_error_unsupported
,
3088 "cannot print empty isl_pw_multi_aff in C format",
3090 name
= isl_pw_multi_aff_get_tuple_name(pma
, isl_dim_out
);
3091 if (!name
&& isl_pw_multi_aff_dim(pma
, isl_dim_out
) == 1)
3092 return print_unnamed_pw_multi_aff_c(p
, pma
);
3094 isl_die(p
->ctx
, isl_error_unsupported
,
3095 "cannot print unnamed isl_pw_multi_aff in C format",
3098 p
= isl_printer_print_str(p
, name
);
3099 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
3101 isl_die(p
->ctx
, isl_error_unsupported
,
3102 "not supported yet", goto error
);
3106 isl_printer_free(p
);
3110 __isl_give isl_printer
*isl_printer_print_pw_multi_aff(
3111 __isl_take isl_printer
*p
, __isl_keep isl_pw_multi_aff
*pma
)
3116 if (p
->output_format
== ISL_FORMAT_ISL
)
3117 return print_pw_multi_aff_isl(p
, pma
);
3118 if (p
->output_format
== ISL_FORMAT_C
)
3119 return print_pw_multi_aff_c(p
, pma
);
3120 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3123 isl_printer_free(p
);
3127 static isl_stat
print_pw_multi_aff_body_wrap(__isl_take isl_pw_multi_aff
*pma
,
3130 struct isl_union_print_data
*data
;
3131 data
= (struct isl_union_print_data
*) user
;
3134 data
->p
= isl_printer_print_str(data
->p
, "; ");
3137 data
->p
= print_pw_multi_aff_body(data
->p
, pma
);
3138 isl_pw_multi_aff_free(pma
);
3143 static __isl_give isl_printer
*print_union_pw_multi_aff_isl(
3144 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_multi_aff
*upma
)
3146 struct isl_union_print_data data
;
3147 struct isl_print_space_data space_data
= { 0 };
3150 space
= isl_union_pw_multi_aff_get_space(upma
);
3151 p
= print_param_tuple(p
, space
, &space_data
);
3152 isl_space_free(space
);
3153 p
= isl_printer_print_str(p
, s_open_set
[0]);
3156 isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
3157 &print_pw_multi_aff_body_wrap
, &data
);
3159 p
= isl_printer_print_str(p
, s_close_set
[0]);
3163 __isl_give isl_printer
*isl_printer_print_union_pw_multi_aff(
3164 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_multi_aff
*upma
)
3169 if (p
->output_format
== ISL_FORMAT_ISL
)
3170 return print_union_pw_multi_aff_isl(p
, upma
);
3171 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3174 isl_printer_free(p
);
3178 /* Print dimension "pos" of data->space to "p".
3180 * data->user is assumed to be an isl_multi_pw_aff.
3182 * If the current dimension is an output dimension, then print
3183 * the corresponding piecewise affine expression.
3184 * Otherwise, print the name of the dimension.
3186 static __isl_give isl_printer
*print_dim_mpa(__isl_take isl_printer
*p
,
3187 struct isl_print_space_data
*data
, unsigned pos
)
3192 isl_multi_pw_aff
*mpa
= data
->user
;
3195 if (data
->type
!= isl_dim_out
)
3196 return print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
3200 return isl_printer_print_str(p
, "(0 : false)");
3202 need_parens
= pa
->n
!= 1 || !isl_set_plain_is_universe(pa
->p
[0].set
);
3204 p
= isl_printer_print_str(p
, "(");
3205 space
= isl_multi_pw_aff_get_domain_space(mpa
);
3206 for (i
= 0; i
< pa
->n
; ++i
) {
3209 p
= isl_printer_print_str(p
, "; ");
3210 p
= print_aff_body(p
, space
, pa
->p
[i
].aff
);
3211 p
= print_disjuncts(pa
->p
[i
].set
, space
, p
, 0);
3213 isl_space_free(space
);
3215 p
= isl_printer_print_str(p
, ")");
3220 /* Print "mpa" to "p" in isl format.
3222 * If "mpa" is zero-dimensional and has a non-trivial explicit domain,
3223 * then it is printed after the tuple of affine expressions.
3225 static __isl_give isl_printer
*print_multi_pw_aff_isl(__isl_take isl_printer
*p
,
3226 __isl_keep isl_multi_pw_aff
*mpa
)
3228 struct isl_print_space_data data
= { 0 };
3229 isl_bool has_domain
;
3232 return isl_printer_free(p
);
3234 p
= print_param_tuple(p
, mpa
->space
, &data
);
3235 p
= isl_printer_print_str(p
, "{ ");
3236 data
.print_dim
= &print_dim_mpa
;
3238 p
= isl_print_space(mpa
->space
, p
, 0, &data
);
3239 has_domain
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
3241 return isl_printer_free(p
);
3245 space
= isl_space_domain(isl_space_copy(mpa
->space
));
3246 p
= print_disjuncts_set(mpa
->u
.dom
, space
, p
, 0);
3247 isl_space_free(space
);
3249 p
= isl_printer_print_str(p
, " }");
3253 __isl_give isl_printer
*isl_printer_print_multi_pw_aff(
3254 __isl_take isl_printer
*p
, __isl_keep isl_multi_pw_aff
*mpa
)
3257 return isl_printer_free(p
);
3259 if (p
->output_format
== ISL_FORMAT_ISL
)
3260 return print_multi_pw_aff_isl(p
, mpa
);
3261 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3262 return isl_printer_free(p
));
3265 /* Print dimension "pos" of data->space to "p".
3267 * data->user is assumed to be an isl_multi_val.
3269 * If the current dimension is an output dimension, then print
3270 * the corresponding value. Otherwise, print the name of the dimension.
3272 static __isl_give isl_printer
*print_dim_mv(__isl_take isl_printer
*p
,
3273 struct isl_print_space_data
*data
, unsigned pos
)
3275 isl_multi_val
*mv
= data
->user
;
3277 if (data
->type
== isl_dim_out
)
3278 return isl_printer_print_val(p
, mv
->u
.p
[pos
]);
3280 return print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
3283 /* Print the isl_multi_val "mv" to "p" in isl format.
3285 static __isl_give isl_printer
*print_multi_val_isl(__isl_take isl_printer
*p
,
3286 __isl_keep isl_multi_val
*mv
)
3288 struct isl_print_space_data data
= { 0 };
3291 return isl_printer_free(p
);
3293 p
= print_param_tuple(p
, mv
->space
, &data
);
3294 p
= isl_printer_print_str(p
, "{ ");
3295 data
.print_dim
= &print_dim_mv
;
3297 p
= isl_print_space(mv
->space
, p
, 0, &data
);
3298 p
= isl_printer_print_str(p
, " }");
3302 /* Print the isl_multi_val "mv" to "p".
3304 * Currently only supported in isl format.
3306 __isl_give isl_printer
*isl_printer_print_multi_val(
3307 __isl_take isl_printer
*p
, __isl_keep isl_multi_val
*mv
)
3310 return isl_printer_free(p
);
3312 if (p
->output_format
== ISL_FORMAT_ISL
)
3313 return print_multi_val_isl(p
, mv
);
3314 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3315 return isl_printer_free(p
));
3318 /* Print dimension "pos" of data->space to "p".
3320 * data->user is assumed to be an isl_multi_union_pw_aff.
3322 * The current dimension is necessarily a set dimension, so
3323 * we print the corresponding isl_union_pw_aff, including
3326 static __isl_give isl_printer
*print_union_pw_aff_dim(__isl_take isl_printer
*p
,
3327 struct isl_print_space_data
*data
, unsigned pos
)
3329 isl_multi_union_pw_aff
*mupa
= data
->user
;
3330 isl_union_pw_aff
*upa
;
3332 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, pos
);
3333 p
= print_union_pw_aff_body(p
, upa
);
3334 isl_union_pw_aff_free(upa
);
3339 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3341 * If "mupa" is zero-dimensional and has a non-trivial explicit domain,
3342 * then it is printed after the tuple of affine expressions.
3343 * In order to clarify that this domain belongs to the expression,
3344 * the tuple along with the domain are placed inside parentheses.
3345 * If "mupa" has any parameters, then the opening parenthesis
3346 * appears after the parameter declarations.
3348 static __isl_give isl_printer
*print_multi_union_pw_aff_isl(
3349 __isl_take isl_printer
*p
, __isl_keep isl_multi_union_pw_aff
*mupa
)
3351 struct isl_print_space_data data
= { 0 };
3352 isl_bool has_domain
;
3356 return isl_printer_free(p
);
3357 has_domain
= isl_multi_union_pw_aff_has_non_trivial_domain(mupa
);
3359 return isl_printer_free(p
);
3361 space
= isl_multi_union_pw_aff_get_space(mupa
);
3362 p
= print_param_tuple(p
, space
, &data
);
3365 p
= isl_printer_print_str(p
, "(");
3367 data
.print_dim
= &print_union_pw_aff_dim
;
3370 p
= isl_print_space(space
, p
, 0, &data
);
3371 isl_space_free(space
);
3374 p
= isl_printer_print_str(p
, " : ");
3375 p
= isl_printer_print_union_set_isl_body(p
, mupa
->u
.dom
);
3376 p
= isl_printer_print_str(p
, ")");
3382 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3384 * We currently only support an isl format.
3386 __isl_give isl_printer
*isl_printer_print_multi_union_pw_aff(
3387 __isl_take isl_printer
*p
, __isl_keep isl_multi_union_pw_aff
*mupa
)
3390 return isl_printer_free(p
);
3392 if (p
->output_format
== ISL_FORMAT_ISL
)
3393 return print_multi_union_pw_aff_isl(p
, mupa
);
3394 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
3395 "unsupported output format", return isl_printer_free(p
));