isl_local_space_divs_known: extract out isl_local_divs_known
[isl.git] / isl_output.c
blob2f5b95d18da0d1214f510f3b9a009af3e1194588
1 /*
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
15 #include <stdlib.h>
16 #include <string.h>
17 #include <isl_ctx_private.h>
18 #include <isl_map_private.h>
19 #include <isl/set.h>
20 #include <isl_seq.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>
34 #include <isl_sort.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)
62 int i;
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);
89 return p;
92 static __isl_give isl_printer *print_constraints_polylib(
93 struct isl_basic_map *bmap, __isl_take isl_printer *p)
95 int i;
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);
104 return 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);
121 if (ext) {
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)
148 int i;
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);
158 return p;
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 *dim,
168 enum isl_dim_type type, unsigned pos, const char *name)
170 enum isl_dim_type t;
171 unsigned p, s;
172 int count = 0;
174 for (t = isl_dim_param; t <= type && t <= isl_dim_out; ++t) {
175 s = t == type ? pos : isl_space_dim(dim, t);
176 for (p = 0; p < s; ++p) {
177 const char *n = isl_space_get_dim_name(dim, t, p);
178 if (n && !strcmp(n, name))
179 count++;
182 return count;
185 /* Print the name of the variable of type "type" and position "pos"
186 * in "space" to "p".
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,
190 int latex)
192 const char *name;
193 char buffer[20];
194 int primes;
196 name = type == isl_dim_div ? NULL
197 : isl_space_get_dim_name(space, type, pos);
199 if (!name) {
200 const char *prefix;
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];
207 else
208 prefix = s_output_prefix[latex];
209 snprintf(buffer, sizeof(buffer), "%s%d", prefix, pos);
210 name = buffer;
212 primes = count_same_name(space, name == buffer ? isl_dim_div : type,
213 pos, name);
214 p = isl_printer_print_str(p, name);
215 while (primes-- > 0)
216 p = isl_printer_print_str(p, "'");
217 return p;
220 static enum isl_dim_type pos2type(__isl_keep isl_space *dim, unsigned *pos)
222 enum isl_dim_type type;
223 unsigned n_in = isl_space_dim(dim, isl_dim_in);
224 unsigned n_out = isl_space_dim(dim, isl_dim_out);
225 unsigned nparam = isl_space_dim(dim, isl_dim_param);
227 if (*pos < 1 + nparam) {
228 type = isl_dim_param;
229 *pos -= 1;
230 } else if (*pos < 1 + nparam + n_in) {
231 type = isl_dim_in;
232 *pos -= 1 + nparam;
233 } else if (*pos < 1 + nparam + n_in + n_out) {
234 type = isl_dim_out;
235 *pos -= 1 + nparam + n_in;
236 } else {
237 type = isl_dim_div;
238 *pos -= 1 + nparam + n_in + n_out;
241 return type;
244 /* Can the div expression of the integer division at position "row" of "div"
245 * be printed?
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
249 * to be printed.
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;
256 if (!div)
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;
269 int print_div_def;
271 if (pos == 0)
272 return isl_printer_print_isl_int(p, c);
274 type = pos2type(space, &pos);
275 print_div_def = type == isl_dim_div && can_print_div_expr(p, div, pos);
277 if (isl_int_is_one(c))
279 else if (isl_int_is_negone(c))
280 p = isl_printer_print_str(p, "-");
281 else {
282 p = isl_printer_print_isl_int(p, c);
283 if (p->output_format == ISL_FORMAT_C || print_div_def)
284 p = isl_printer_print_str(p, "*");
286 if (print_div_def)
287 p = print_div(space, div, pos, p);
288 else
289 p = print_name(space, p, type, pos, latex);
290 return p;
293 static __isl_give isl_printer *print_affine_of_len(__isl_keep isl_space *dim,
294 __isl_keep isl_mat *div,
295 __isl_take isl_printer *p, isl_int *c, int len)
297 int i;
298 int first;
300 for (i = 0, first = 1; i < len; ++i) {
301 int flip = 0;
302 if (isl_int_is_zero(c[i]))
303 continue;
304 if (!first) {
305 if (isl_int_is_neg(c[i])) {
306 flip = 1;
307 isl_int_neg(c[i], c[i]);
308 p = isl_printer_print_str(p, " - ");
309 } else
310 p = isl_printer_print_str(p, " + ");
312 first = 0;
313 p = print_term(dim, div, c[i], i, p, 0);
314 if (flip)
315 isl_int_neg(c[i], c[i]);
317 if (first)
318 p = isl_printer_print_str(p, "0");
319 return p;
322 /* Print an affine expression "c"
323 * to "p", with the variable names taken from "space" and
324 * the integer division definitions taken from "div".
326 static __isl_give isl_printer *print_affine(__isl_take isl_printer *p,
327 __isl_keep isl_space *space, __isl_keep isl_mat *div, isl_int *c)
329 unsigned n_div;
330 unsigned len;
332 if (!space || !div)
333 return isl_printer_free(p);
334 n_div = isl_mat_rows(div);
335 len = 1 + isl_space_dim(space, isl_dim_all) + n_div;
336 return print_affine_of_len(space, div, p, c, len);
339 /* offset is the offset of local_dim inside data->type of data->space.
341 static __isl_give isl_printer *print_nested_var_list(__isl_take isl_printer *p,
342 __isl_keep isl_space *local_dim, enum isl_dim_type local_type,
343 struct isl_print_space_data *data, int offset)
345 int i;
347 if (data->space != local_dim && local_type == isl_dim_out)
348 offset += local_dim->n_in;
350 for (i = 0; i < isl_space_dim(local_dim, local_type); ++i) {
351 if (i)
352 p = isl_printer_print_str(p, ", ");
353 if (data->print_dim)
354 p = data->print_dim(p, data, offset + i);
355 else
356 p = print_name(data->space, p, data->type, offset + i,
357 data->latex);
359 return p;
362 static __isl_give isl_printer *print_var_list(__isl_take isl_printer *p,
363 __isl_keep isl_space *space, enum isl_dim_type type)
365 struct isl_print_space_data data = { .space = space, .type = type };
367 return print_nested_var_list(p, space, type, &data, 0);
370 static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p,
371 __isl_keep isl_space *local_dim,
372 struct isl_print_space_data *data, int offset);
374 static __isl_give isl_printer *print_nested_tuple(__isl_take isl_printer *p,
375 __isl_keep isl_space *local_dim, enum isl_dim_type local_type,
376 struct isl_print_space_data *data, int offset)
378 const char *name = NULL;
379 unsigned n = isl_space_dim(local_dim, local_type);
380 if ((local_type == isl_dim_in || local_type == isl_dim_out)) {
381 name = isl_space_get_tuple_name(local_dim, local_type);
382 if (name) {
383 if (data->latex)
384 p = isl_printer_print_str(p, "\\mathrm{");
385 p = isl_printer_print_str(p, name);
386 if (data->latex)
387 p = isl_printer_print_str(p, "}");
390 if (!data->latex || n != 1 || name)
391 p = isl_printer_print_str(p, s_open_list[data->latex]);
392 if ((local_type == isl_dim_in || local_type == isl_dim_out) &&
393 local_dim->nested[local_type - isl_dim_in]) {
394 if (data->space != local_dim && local_type == isl_dim_out)
395 offset += local_dim->n_in;
396 p = print_nested_map_dim(p,
397 local_dim->nested[local_type - isl_dim_in],
398 data, offset);
399 } else
400 p = print_nested_var_list(p, local_dim, local_type, data,
401 offset);
402 if (!data->latex || n != 1 || name)
403 p = isl_printer_print_str(p, s_close_list[data->latex]);
404 return p;
407 static __isl_give isl_printer *print_tuple(__isl_keep isl_space *dim,
408 __isl_take isl_printer *p, enum isl_dim_type type,
409 struct isl_print_space_data *data)
411 data->space = dim;
412 data->type = type;
413 return print_nested_tuple(p, dim, type, data, 0);
416 static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p,
417 __isl_keep isl_space *local_dim,
418 struct isl_print_space_data *data, int offset)
420 p = print_nested_tuple(p, local_dim, isl_dim_in, data, offset);
421 p = isl_printer_print_str(p, s_to[data->latex]);
422 p = print_nested_tuple(p, local_dim, isl_dim_out, data, offset);
424 return p;
427 __isl_give isl_printer *isl_print_space(__isl_keep isl_space *space,
428 __isl_take isl_printer *p, int rational,
429 struct isl_print_space_data *data)
431 if (rational && !data->latex)
432 p = isl_printer_print_str(p, "rat: ");
433 if (isl_space_is_params(space))
435 else if (isl_space_is_set(space))
436 p = print_tuple(space, p, isl_dim_set, data);
437 else {
438 p = print_tuple(space, p, isl_dim_in, data);
439 p = isl_printer_print_str(p, s_to[data->latex]);
440 p = print_tuple(space, p, isl_dim_out, data);
443 return p;
446 static __isl_give isl_printer *print_omega_parameters(__isl_keep isl_space *dim,
447 __isl_take isl_printer *p)
449 if (isl_space_dim(dim, isl_dim_param) == 0)
450 return p;
452 p = isl_printer_start_line(p);
453 p = isl_printer_print_str(p, "symbolic ");
454 p = print_var_list(p, dim, isl_dim_param);
455 p = isl_printer_print_str(p, ";");
456 p = isl_printer_end_line(p);
457 return p;
460 /* Does the inequality constraint following "i" in "bmap"
461 * have an opposite value for the same last coefficient?
462 * "last" is the position of the last coefficient of inequality "i".
463 * If the next constraint is a div constraint, then it is ignored
464 * since div constraints are not printed.
466 static int next_is_opposite(__isl_keep isl_basic_map *bmap, int i, int last)
468 unsigned total = isl_basic_map_total_dim(bmap);
469 unsigned o_div = isl_basic_map_offset(bmap, isl_dim_div);
471 if (i + 1 >= bmap->n_ineq)
472 return 0;
473 if (isl_seq_last_non_zero(bmap->ineq[i + 1], 1 + total) != last)
474 return 0;
475 if (last >= o_div) {
476 isl_bool is_div;
477 is_div = isl_basic_map_is_div_constraint(bmap,
478 bmap->ineq[i + 1], last - o_div);
479 if (is_div < 0)
480 return -1;
481 if (is_div)
482 return 0;
484 return isl_int_abs_eq(bmap->ineq[i][last], bmap->ineq[i + 1][last]) &&
485 !isl_int_eq(bmap->ineq[i][last], bmap->ineq[i + 1][last]);
488 /* Return a string representation of the operator used when
489 * printing a constraint where the LHS is greater than or equal to the LHS
490 * (sign > 0) or smaller than or equal to the LHS (sign < 0).
491 * If "strict" is set, then return the strict version of the comparison
492 * operator.
494 static const char *constraint_op(int sign, int strict, int latex)
496 if (strict)
497 return sign < 0 ? "<" : ">";
498 if (sign < 0)
499 return s_le[latex];
500 else
501 return s_ge[latex];
504 /* Print one side of a constraint "c" to "p", with
505 * the variable names taken from "space" and the integer division definitions
506 * taken from "div".
507 * "last" is the position of the last non-zero coefficient.
508 * Let c' be the result of zeroing out this coefficient, then
509 * the partial constraint
511 * c' op
513 * is printed.
515 static __isl_give isl_printer *print_half_constraint(__isl_take isl_printer *p,
516 __isl_keep isl_space *space, __isl_keep isl_mat *div,
517 isl_int *c, int last, const char *op, int latex)
519 isl_int_set_si(c[last], 0);
520 p = print_affine(p, space, div, c);
522 p = isl_printer_print_str(p, " ");
523 p = isl_printer_print_str(p, op);
524 p = isl_printer_print_str(p, " ");
526 return p;
529 /* Print a constraint "c" to "p", with the variable names
530 * taken from "space" and the integer division definitions taken from "div".
531 * "last" is the position of the last non-zero coefficient, which is
532 * moreover assumed to be negative.
533 * Let c' be the result of zeroing out this coefficient, then
534 * the constraint is printed in the form
536 * -c[last] op c'
538 static __isl_give isl_printer *print_constraint(__isl_take isl_printer *p,
539 __isl_keep isl_space *space, __isl_keep isl_mat *div,
540 isl_int *c, int last, const char *op, int latex)
542 isl_int_abs(c[last], c[last]);
544 p = print_term(space, div, c[last], last, p, latex);
546 p = isl_printer_print_str(p, " ");
547 p = isl_printer_print_str(p, op);
548 p = isl_printer_print_str(p, " ");
550 isl_int_set_si(c[last], 0);
551 p = print_affine(p, space, div, c);
553 return p;
556 /* Given an integer division
558 * floor(f/m)
560 * at position "pos" in "div", print the corresponding modulo expression
562 * (f) mod m
564 * to "p". The variable names are taken from "space", while any
565 * nested integer division definitions are taken from "div".
567 static __isl_give isl_printer *print_mod(__isl_take isl_printer *p,
568 __isl_keep isl_space *space, __isl_keep isl_mat *div, int pos,
569 int latex)
571 if (!p || !div)
572 return isl_printer_free(p);
574 p = isl_printer_print_str(p, "(");
575 p = print_affine_of_len(space, div, p,
576 div->row[pos] + 1, div->n_col - 1);
577 p = isl_printer_print_str(p, ") ");
578 p = isl_printer_print_str(p, s_mod[latex]);
579 p = isl_printer_print_str(p, " ");
580 p = isl_printer_print_isl_int(p, div->row[pos][0]);
581 return p;
584 /* Can the equality constraints "c" be printed as a modulo constraint?
585 * In particular, is of the form
587 * f - a m floor(g/m) = 0,
589 * with c = -a m the coefficient at position "pos"?
590 * Return the position of the corresponding integer division if so.
591 * Return the number of integer divisions if not.
592 * Return -1 on error.
594 * Modulo constraints are currently not printed in C format.
595 * Other than that, "pos" needs to correspond to an integer division
596 * with explicit representation and "c" needs to be a multiple
597 * of the denominator of the integer division.
599 static int print_as_modulo_pos(__isl_keep isl_printer *p,
600 __isl_keep isl_space *space, __isl_keep isl_mat *div, unsigned pos,
601 isl_int c)
603 isl_bool can_print;
604 unsigned n_div;
605 enum isl_dim_type type;
607 if (!p)
608 return -1;
609 n_div = isl_mat_rows(div);
610 if (p->output_format == ISL_FORMAT_C)
611 return n_div;
612 type = pos2type(space, &pos);
613 if (type != isl_dim_div)
614 return n_div;
615 can_print = can_print_div_expr(p, div, pos);
616 if (can_print < 0)
617 return -1;
618 if (!can_print)
619 return n_div;
620 if (!isl_int_is_divisible_by(c, div->row[pos][0]))
621 return n_div;
622 return pos;
625 /* Print equality constraint "c" to "p" as a modulo constraint,
626 * with the variable names taken from "space" and
627 * the integer division definitions taken from "div".
628 * "last" is the position of the last non-zero coefficient, which is
629 * moreover assumed to be negative and a multiple of the denominator
630 * of the corresponding integer division. "div_pos" is the corresponding
631 * position in the sequence of integer divisions.
633 * The equality is of the form
635 * f - a m floor(g/m) = 0.
637 * Print it as
639 * a (g mod m) = -f + a g
641 static __isl_give isl_printer *print_eq_mod_constraint(
642 __isl_take isl_printer *p, __isl_keep isl_space *space,
643 __isl_keep isl_mat *div, unsigned div_pos,
644 isl_int *c, int last, int latex)
646 isl_ctx *ctx;
647 int multiple;
649 ctx = isl_printer_get_ctx(p);
650 isl_int_divexact(c[last], c[last], div->row[div_pos][0]);
651 isl_int_abs(c[last], c[last]);
652 multiple = !isl_int_is_one(c[last]);
653 if (multiple) {
654 p = isl_printer_print_isl_int(p, c[last]);
655 p = isl_printer_print_str(p, "*(");
657 p = print_mod(p, space, div, div_pos, latex);
658 if (multiple)
659 p = isl_printer_print_str(p, ")");
660 p = isl_printer_print_str(p, " = ");
661 isl_seq_combine(c, ctx->negone, c,
662 c[last], div->row[div_pos] + 1, last);
663 isl_int_set_si(c[last], 0);
664 p = print_affine(p, space, div, c);
665 return p;
668 /* Print equality constraint "c" to "p", with the variable names
669 * taken from "space" and the integer division definitions taken from "div".
670 * "last" is the position of the last non-zero coefficient, which is
671 * moreover assumed to be negative.
673 * If possible, print the equality constraint as a modulo constraint.
675 static __isl_give isl_printer *print_eq_constraint(__isl_take isl_printer *p,
676 __isl_keep isl_space *space, __isl_keep isl_mat *div, isl_int *c,
677 int last, int latex)
679 unsigned n_div;
680 int div_pos;
682 n_div = isl_mat_rows(div);
683 div_pos = print_as_modulo_pos(p, space, div, last, c[last]);
684 if (div_pos < 0)
685 return isl_printer_free(p);
686 if (div_pos < n_div)
687 return print_eq_mod_constraint(p, space, div, div_pos,
688 c, last, latex);
689 return print_constraint(p, space, div, c, last, "=", latex);
692 /* Print the constraints of "bmap" to "p".
693 * The names of the variables are taken from "space" and
694 * the integer division definitions are taken from "div".
695 * Div constraints are only printed in "dump" mode.
696 * The constraints are sorted prior to printing (except in "dump" mode).
698 * If x is the last variable with a non-zero coefficient,
699 * then a lower bound
701 * f - a x >= 0
703 * is printed as
705 * a x <= f
707 * while an upper bound
709 * f + a x >= 0
711 * is printed as
713 * a x >= -f
715 * If the next constraint has an opposite sign for the same last coefficient,
716 * then it is printed as
718 * f >= a x
720 * or
722 * -f <= a x
724 * instead. In fact, the "a x" part is not printed explicitly, but
725 * reused from the next constraint, which is therefore treated as
726 * a first constraint in the conjunction.
728 * If the constant term of "f" is -1, then "f" is replaced by "f + 1" and
729 * the comparison operator is replaced by the strict variant.
730 * Essentially, ">= 1" is replaced by "> 0".
732 static __isl_give isl_printer *print_constraints(__isl_keep isl_basic_map *bmap,
733 __isl_keep isl_space *space, __isl_keep isl_mat *div,
734 __isl_take isl_printer *p, int latex)
736 int i;
737 isl_vec *c = NULL;
738 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
739 unsigned total = isl_basic_map_total_dim(bmap);
740 unsigned o_div = isl_basic_map_offset(bmap, isl_dim_div);
741 int first = 1;
742 int dump;
744 if (!p)
745 return NULL;
746 bmap = isl_basic_map_copy(bmap);
747 dump = p->dump;
748 if (!dump)
749 bmap = isl_basic_map_sort_constraints(bmap);
750 if (!bmap)
751 goto error;
753 c = isl_vec_alloc(bmap->ctx, 1 + total);
754 if (!c)
755 goto error;
757 for (i = bmap->n_eq - 1; i >= 0; --i) {
758 int l = isl_seq_last_non_zero(bmap->eq[i], 1 + total);
759 if (l < 0) {
760 if (i != bmap->n_eq - 1)
761 p = isl_printer_print_str(p, s_and[latex]);
762 p = isl_printer_print_str(p, "0 = 0");
763 continue;
765 if (!first)
766 p = isl_printer_print_str(p, s_and[latex]);
767 if (isl_int_is_neg(bmap->eq[i][l]))
768 isl_seq_cpy(c->el, bmap->eq[i], 1 + total);
769 else
770 isl_seq_neg(c->el, bmap->eq[i], 1 + total);
771 p = print_eq_constraint(p, space, div, c->el, l, latex);
772 first = 0;
774 for (i = 0; i < bmap->n_ineq; ++i) {
775 int l = isl_seq_last_non_zero(bmap->ineq[i], 1 + total);
776 int strict;
777 int s;
778 const char *op;
779 if (l < 0)
780 continue;
781 if (!dump && l >= o_div &&
782 can_print_div_expr(p, div, l - o_div)) {
783 isl_bool is_div;
784 is_div = isl_basic_map_is_div_constraint(bmap,
785 bmap->ineq[i], l - o_div);
786 if (is_div < 0)
787 goto error;
788 if (is_div)
789 continue;
791 if (!first)
792 p = isl_printer_print_str(p, s_and[latex]);
793 s = isl_int_sgn(bmap->ineq[i][l]);
794 strict = !rational && isl_int_is_negone(bmap->ineq[i][0]);
795 if (s < 0)
796 isl_seq_cpy(c->el, bmap->ineq[i], 1 + total);
797 else
798 isl_seq_neg(c->el, bmap->ineq[i], 1 + total);
799 if (strict)
800 isl_int_set_si(c->el[0], 0);
801 if (!dump && next_is_opposite(bmap, i, l)) {
802 op = constraint_op(-s, strict, latex);
803 p = print_half_constraint(p, space, div, c->el, l,
804 op, latex);
805 first = 1;
806 } else {
807 op = constraint_op(s, strict, latex);
808 p = print_constraint(p, space, div, c->el, l,
809 op, latex);
810 first = 0;
814 isl_basic_map_free(bmap);
815 isl_vec_free(c);
817 return p;
818 error:
819 isl_basic_map_free(bmap);
820 isl_vec_free(c);
821 isl_printer_free(p);
822 return NULL;
825 static __isl_give isl_printer *print_div(__isl_keep isl_space *dim,
826 __isl_keep isl_mat *div, int pos, __isl_take isl_printer *p)
828 int c;
830 if (!p || !div)
831 return isl_printer_free(p);
833 c = p->output_format == ISL_FORMAT_C;
834 p = isl_printer_print_str(p, c ? "floord(" : "floor((");
835 p = print_affine_of_len(dim, div, p,
836 div->row[pos] + 1, div->n_col - 1);
837 p = isl_printer_print_str(p, c ? ", " : ")/");
838 p = isl_printer_print_isl_int(p, div->row[pos][0]);
839 p = isl_printer_print_str(p, ")");
840 return p;
843 /* Print a comma separated list of div names, except those that have
844 * a definition that can be printed.
845 * If "print_defined_divs" is set, then those div names are printed
846 * as well, along with their definitions.
848 static __isl_give isl_printer *print_div_list(__isl_take isl_printer *p,
849 __isl_keep isl_space *space, __isl_keep isl_mat *div, int latex,
850 int print_defined_divs)
852 int i;
853 int first = 1;
854 unsigned n_div;
856 if (!p || !space || !div)
857 return isl_printer_free(p);
859 n_div = isl_mat_rows(div);
861 for (i = 0; i < n_div; ++i) {
862 if (!print_defined_divs && can_print_div_expr(p, div, i))
863 continue;
864 if (!first)
865 p = isl_printer_print_str(p, ", ");
866 p = print_name(space, p, isl_dim_div, i, latex);
867 first = 0;
868 if (!can_print_div_expr(p, div, i))
869 continue;
870 p = isl_printer_print_str(p, " = ");
871 p = print_div(space, div, i, p);
874 return p;
877 /* Does printing an object with local variables described by "div"
878 * require an "exists" clause?
879 * That is, are there any local variables without an explicit representation?
880 * An exists clause is also needed in "dump" mode because
881 * explicit div representations are not printed inline in that case.
883 static isl_bool need_exists(__isl_keep isl_printer *p, __isl_keep isl_mat *div)
885 int i, n;
887 if (!p || !div)
888 return isl_bool_error;
889 n = isl_mat_rows(div);
890 if (n == 0)
891 return isl_bool_false;
892 if (p->dump)
893 return isl_bool_true;
894 for (i = 0; i < n; ++i)
895 if (!can_print_div_expr(p, div, i))
896 return isl_bool_true;
897 return isl_bool_false;
900 /* Print the start of an exists clause, i.e.,
902 * (exists variables:
904 * In dump mode, local variables with an explicit definition are printed
905 * as well because they will not be printed inline.
907 static __isl_give isl_printer *open_exists(__isl_take isl_printer *p,
908 __isl_keep isl_space *space, __isl_keep isl_mat *div, int latex)
910 int dump;
912 if (!p)
913 return NULL;
915 dump = p->dump;
916 p = isl_printer_print_str(p, s_open_exists[latex]);
917 p = print_div_list(p, space, div, latex, dump);
918 p = isl_printer_print_str(p, ": ");
920 return p;
923 /* Remove the explicit representations of all local variables in "div".
925 static __isl_give isl_mat *mark_all_unknown(__isl_take isl_mat *div)
927 int i, n_div;
929 if (!div)
930 return NULL;
932 n_div = isl_mat_rows(div);
933 for (i = 0; i < n_div; ++i)
934 div = isl_mat_set_element_si(div, i, 0, 0);
935 return div;
938 /* Print the constraints of "bmap" to "p".
939 * The names of the variables are taken from "space".
940 * "latex" is set if the constraints should be printed in LaTeX format.
941 * Do not print inline explicit div representations in "dump" mode.
943 static __isl_give isl_printer *print_disjunct(__isl_keep isl_basic_map *bmap,
944 __isl_keep isl_space *space, __isl_take isl_printer *p, int latex)
946 int dump;
947 isl_mat *div;
948 isl_bool exists;
950 if (!p)
951 return NULL;
952 dump = p->dump;
953 div = isl_basic_map_get_divs(bmap);
954 exists = need_exists(p, div);
955 if (exists >= 0 && exists)
956 p = open_exists(p, space, div, latex);
958 if (dump)
959 div = mark_all_unknown(div);
960 p = print_constraints(bmap, space, div, p, latex);
961 isl_mat_free(div);
963 if (exists >= 0 && exists)
964 p = isl_printer_print_str(p, s_close_exists[latex]);
965 return p;
968 /* Print a colon followed by the constraints of "bmap"
969 * to "p", provided there are any constraints.
970 * The names of the variables are taken from "space".
971 * "latex" is set if the constraints should be printed in LaTeX format.
973 static __isl_give isl_printer *print_optional_disjunct(
974 __isl_keep isl_basic_map *bmap, __isl_keep isl_space *space,
975 __isl_take isl_printer *p, int latex)
977 if (isl_basic_map_plain_is_universe(bmap))
978 return p;
980 p = isl_printer_print_str(p, ": ");
981 p = print_disjunct(bmap, space, p, latex);
983 return p;
986 static __isl_give isl_printer *basic_map_print_omega(
987 __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p)
989 p = isl_printer_print_str(p, "{ [");
990 p = print_var_list(p, bmap->dim, isl_dim_in);
991 p = isl_printer_print_str(p, "] -> [");
992 p = print_var_list(p, bmap->dim, isl_dim_out);
993 p = isl_printer_print_str(p, "] ");
994 p = print_optional_disjunct(bmap, bmap->dim, p, 0);
995 p = isl_printer_print_str(p, " }");
996 return p;
999 static __isl_give isl_printer *basic_set_print_omega(
1000 __isl_keep isl_basic_set *bset, __isl_take isl_printer *p)
1002 p = isl_printer_print_str(p, "{ [");
1003 p = print_var_list(p, bset->dim, isl_dim_set);
1004 p = isl_printer_print_str(p, "] ");
1005 p = print_optional_disjunct(bset, bset->dim, p, 0);
1006 p = isl_printer_print_str(p, " }");
1007 return p;
1010 static __isl_give isl_printer *isl_map_print_omega(__isl_keep isl_map *map,
1011 __isl_take isl_printer *p)
1013 int i;
1015 for (i = 0; i < map->n; ++i) {
1016 if (i)
1017 p = isl_printer_print_str(p, " union ");
1018 p = basic_map_print_omega(map->p[i], p);
1020 return p;
1023 static __isl_give isl_printer *isl_set_print_omega(__isl_keep isl_set *set,
1024 __isl_take isl_printer *p)
1026 int i;
1028 for (i = 0; i < set->n; ++i) {
1029 if (i)
1030 p = isl_printer_print_str(p, " union ");
1031 p = basic_set_print_omega(set->p[i], p);
1033 return p;
1036 /* Print the list of parameters in "space", followed by an arrow, to "p",
1037 * if there are any parameters.
1039 static __isl_give isl_printer *print_param_tuple(__isl_take isl_printer *p,
1040 __isl_keep isl_space *space, struct isl_print_space_data *data)
1042 if (!p || !space)
1043 return isl_printer_free(p);
1044 if (isl_space_dim(space, isl_dim_param) == 0)
1045 return p;
1047 p = print_tuple(space, p, isl_dim_param, data);
1048 p = isl_printer_print_str(p, s_to[data->latex]);
1050 return p;
1053 static __isl_give isl_printer *isl_basic_map_print_isl(
1054 __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p,
1055 int latex)
1057 struct isl_print_space_data data = { .latex = latex };
1058 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
1060 p = print_param_tuple(p, bmap->dim, &data);
1061 p = isl_printer_print_str(p, "{ ");
1062 p = isl_print_space(bmap->dim, p, rational, &data);
1063 p = isl_printer_print_str(p, " : ");
1064 p = print_disjunct(bmap, bmap->dim, p, latex);
1065 p = isl_printer_print_str(p, " }");
1066 return p;
1069 /* Print the disjuncts of a map (or set) "map" to "p".
1070 * The names of the variables are taken from "space".
1071 * "latex" is set if the constraints should be printed in LaTeX format.
1073 static __isl_give isl_printer *print_disjuncts_core(__isl_keep isl_map *map,
1074 __isl_keep isl_space *space, __isl_take isl_printer *p, int latex)
1076 int i;
1078 if (map->n == 0)
1079 p = isl_printer_print_str(p, "false");
1080 for (i = 0; i < map->n; ++i) {
1081 if (i)
1082 p = isl_printer_print_str(p, s_or[latex]);
1083 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1084 p = isl_printer_print_str(p, "(");
1085 p = print_disjunct(map->p[i], space, p, latex);
1086 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1087 p = isl_printer_print_str(p, ")");
1089 return p;
1092 /* Print the disjuncts of a map (or set) "map" to "p".
1093 * The names of the variables are taken from "space".
1094 * "hull" describes constraints shared by all disjuncts of "map".
1095 * "latex" is set if the constraints should be printed in LaTeX format.
1097 * Print the disjuncts as a conjunction of "hull" and
1098 * the result of removing the constraints of "hull" from "map".
1099 * If this result turns out to be the universe, then simply print "hull".
1101 static __isl_give isl_printer *print_disjuncts_in_hull(__isl_keep isl_map *map,
1102 __isl_keep isl_space *space, __isl_take isl_basic_map *hull,
1103 __isl_take isl_printer *p, int latex)
1105 isl_bool is_universe;
1107 p = print_disjunct(hull, space, p, latex);
1108 map = isl_map_plain_gist_basic_map(isl_map_copy(map), hull);
1109 is_universe = isl_map_plain_is_universe(map);
1110 if (is_universe < 0)
1111 goto error;
1112 if (!is_universe) {
1113 p = isl_printer_print_str(p, s_and[latex]);
1114 p = isl_printer_print_str(p, "(");
1115 p = print_disjuncts_core(map, space, p, latex);
1116 p = isl_printer_print_str(p, ")");
1118 isl_map_free(map);
1120 return p;
1121 error:
1122 isl_map_free(map);
1123 isl_printer_free(p);
1124 return NULL;
1127 /* Print the disjuncts of a map (or set) "map" to "p".
1128 * The names of the variables are taken from "space".
1129 * "latex" is set if the constraints should be printed in LaTeX format.
1131 * If there are at least two disjuncts and "dump" mode is not turned out,
1132 * check for any shared constraints among all disjuncts.
1133 * If there are any, then print them separately in print_disjuncts_in_hull.
1135 static __isl_give isl_printer *print_disjuncts(__isl_keep isl_map *map,
1136 __isl_keep isl_space *space, __isl_take isl_printer *p, int latex)
1138 if (isl_map_plain_is_universe(map))
1139 return p;
1141 p = isl_printer_print_str(p, s_such_that[latex]);
1142 if (!p)
1143 return NULL;
1145 if (!p->dump && map->n >= 2) {
1146 isl_basic_map *hull;
1147 isl_bool is_universe;
1149 hull = isl_map_plain_unshifted_simple_hull(isl_map_copy(map));
1150 is_universe = isl_basic_map_plain_is_universe(hull);
1151 if (is_universe < 0)
1152 p = isl_printer_free(p);
1153 else if (!is_universe)
1154 return print_disjuncts_in_hull(map, space, hull,
1155 p, latex);
1156 isl_basic_map_free(hull);
1159 return print_disjuncts_core(map, space, p, latex);
1162 /* Print the disjuncts of a map (or set).
1163 * The names of the variables are taken from "space".
1164 * "latex" is set if the constraints should be printed in LaTeX format.
1166 * If the map turns out to be a universal parameter domain, then
1167 * we need to print the colon. Otherwise, the output looks identical
1168 * to the empty set.
1170 static __isl_give isl_printer *print_disjuncts_map(__isl_keep isl_map *map,
1171 __isl_keep isl_space *space, __isl_take isl_printer *p, int latex)
1173 if (isl_map_plain_is_universe(map) && isl_space_is_params(map->dim))
1174 return isl_printer_print_str(p, s_such_that[latex]);
1175 else
1176 return print_disjuncts(map, space, p, latex);
1179 /* Print the disjuncts of a set.
1180 * The names of the variables are taken from "space".
1181 * "latex" is set if the constraints should be printed in LaTeX format.
1183 static __isl_give isl_printer *print_disjuncts_set(__isl_keep isl_set *set,
1184 __isl_keep isl_space *space, __isl_take isl_printer *p, int latex)
1186 return print_disjuncts_map(set_to_map(set), space, p, latex);
1189 struct isl_aff_split {
1190 isl_basic_map *aff;
1191 isl_map *map;
1194 static void free_split(__isl_take struct isl_aff_split *split, int n)
1196 int i;
1198 if (!split)
1199 return;
1201 for (i = 0; i < n; ++i) {
1202 isl_basic_map_free(split[i].aff);
1203 isl_map_free(split[i].map);
1206 free(split);
1209 static __isl_give isl_basic_map *get_aff(__isl_take isl_basic_map *bmap)
1211 int i, j;
1212 unsigned nparam, n_in, n_out, total;
1214 bmap = isl_basic_map_cow(bmap);
1215 if (!bmap)
1216 return NULL;
1217 if (isl_basic_map_free_inequality(bmap, bmap->n_ineq) < 0)
1218 goto error;
1220 nparam = isl_basic_map_dim(bmap, isl_dim_param);
1221 n_in = isl_basic_map_dim(bmap, isl_dim_in);
1222 n_out = isl_basic_map_dim(bmap, isl_dim_out);
1223 total = isl_basic_map_dim(bmap, isl_dim_all);
1224 for (i = bmap->n_eq - 1; i >= 0; --i) {
1225 j = isl_seq_last_non_zero(bmap->eq[i] + 1, total);
1226 if (j >= nparam && j < nparam + n_in + n_out &&
1227 (isl_int_is_one(bmap->eq[i][1 + j]) ||
1228 isl_int_is_negone(bmap->eq[i][1 + j])))
1229 continue;
1230 if (isl_basic_map_drop_equality(bmap, i) < 0)
1231 goto error;
1234 bmap = isl_basic_map_finalize(bmap);
1236 return bmap;
1237 error:
1238 isl_basic_map_free(bmap);
1239 return NULL;
1242 static int aff_split_cmp(const void *p1, const void *p2, void *user)
1244 const struct isl_aff_split *s1, *s2;
1245 s1 = (const struct isl_aff_split *) p1;
1246 s2 = (const struct isl_aff_split *) p2;
1248 return isl_basic_map_plain_cmp(s1->aff, s2->aff);
1251 static __isl_give isl_basic_map *drop_aff(__isl_take isl_basic_map *bmap,
1252 __isl_keep isl_basic_map *aff)
1254 int i, j;
1255 unsigned total;
1257 if (!bmap || !aff)
1258 goto error;
1260 total = isl_space_dim(bmap->dim, isl_dim_all);
1262 for (i = bmap->n_eq - 1; i >= 0; --i) {
1263 if (isl_seq_first_non_zero(bmap->eq[i] + 1 + total,
1264 bmap->n_div) != -1)
1265 continue;
1266 for (j = 0; j < aff->n_eq; ++j) {
1267 if (!isl_seq_eq(bmap->eq[i], aff->eq[j], 1 + total) &&
1268 !isl_seq_is_neg(bmap->eq[i], aff->eq[j], 1 + total))
1269 continue;
1270 if (isl_basic_map_drop_equality(bmap, i) < 0)
1271 goto error;
1272 break;
1276 return bmap;
1277 error:
1278 isl_basic_map_free(bmap);
1279 return NULL;
1282 static __isl_give struct isl_aff_split *split_aff(__isl_keep isl_map *map)
1284 int i, n;
1285 struct isl_aff_split *split;
1286 isl_ctx *ctx;
1288 ctx = isl_map_get_ctx(map);
1289 split = isl_calloc_array(ctx, struct isl_aff_split, map->n);
1290 if (!split)
1291 return NULL;
1293 for (i = 0; i < map->n; ++i) {
1294 isl_basic_map *bmap;
1295 split[i].aff = get_aff(isl_basic_map_copy(map->p[i]));
1296 bmap = isl_basic_map_copy(map->p[i]);
1297 bmap = isl_basic_map_cow(bmap);
1298 bmap = drop_aff(bmap, split[i].aff);
1299 split[i].map = isl_map_from_basic_map(bmap);
1300 if (!split[i].aff || !split[i].map)
1301 goto error;
1304 if (isl_sort(split, map->n, sizeof(struct isl_aff_split),
1305 &aff_split_cmp, NULL) < 0)
1306 goto error;
1308 n = map->n;
1309 for (i = n - 1; i >= 1; --i) {
1310 if (!isl_basic_map_plain_is_equal(split[i - 1].aff,
1311 split[i].aff))
1312 continue;
1313 isl_basic_map_free(split[i].aff);
1314 split[i - 1].map = isl_map_union(split[i - 1].map,
1315 split[i].map);
1316 if (i != n - 1)
1317 split[i] = split[n - 1];
1318 split[n - 1].aff = NULL;
1319 split[n - 1].map = NULL;
1320 --n;
1323 return split;
1324 error:
1325 free_split(split, map->n);
1326 return NULL;
1329 static int defining_equality(__isl_keep isl_basic_map *eq,
1330 __isl_keep isl_space *dim, enum isl_dim_type type, int pos)
1332 int i;
1333 unsigned total;
1335 if (!eq)
1336 return -1;
1338 pos += isl_space_offset(dim, type);
1339 total = isl_basic_map_total_dim(eq);
1341 for (i = 0; i < eq->n_eq; ++i) {
1342 if (isl_seq_last_non_zero(eq->eq[i] + 1, total) != pos)
1343 continue;
1344 if (isl_int_is_one(eq->eq[i][1 + pos]))
1345 isl_seq_neg(eq->eq[i], eq->eq[i], 1 + total);
1346 return i;
1349 return -1;
1352 /* Print dimension "pos" of data->space to "p".
1354 * data->user is assumed to be an isl_basic_map keeping track of equalities.
1356 * If the current dimension is defined by these equalities, then print
1357 * the corresponding expression, assigned to the name of the dimension
1358 * if there is any. Otherwise, print the name of the dimension.
1360 static __isl_give isl_printer *print_dim_eq(__isl_take isl_printer *p,
1361 struct isl_print_space_data *data, unsigned pos)
1363 isl_basic_map *eq = data->user;
1364 int j;
1366 j = defining_equality(eq, data->space, data->type, pos);
1367 if (j >= 0) {
1368 if (isl_space_has_dim_name(data->space, data->type, pos)) {
1369 p = print_name(data->space, p, data->type, pos,
1370 data->latex);
1371 p = isl_printer_print_str(p, " = ");
1373 pos += 1 + isl_space_offset(data->space, data->type);
1374 p = print_affine_of_len(data->space, NULL, p, eq->eq[j], pos);
1375 } else {
1376 p = print_name(data->space, p, data->type, pos, data->latex);
1379 return p;
1382 static __isl_give isl_printer *print_split_map(__isl_take isl_printer *p,
1383 struct isl_aff_split *split, int n, __isl_keep isl_space *space)
1385 struct isl_print_space_data data = { 0 };
1386 int i;
1387 int rational;
1389 data.print_dim = &print_dim_eq;
1390 for (i = 0; i < n; ++i) {
1391 if (!split[i].map)
1392 break;
1393 rational = split[i].map->n > 0 &&
1394 ISL_F_ISSET(split[i].map->p[0], ISL_BASIC_MAP_RATIONAL);
1395 if (i)
1396 p = isl_printer_print_str(p, "; ");
1397 data.user = split[i].aff;
1398 p = isl_print_space(space, p, rational, &data);
1399 p = print_disjuncts_map(split[i].map, space, p, 0);
1402 return p;
1405 static __isl_give isl_printer *isl_map_print_isl_body(__isl_keep isl_map *map,
1406 __isl_take isl_printer *p)
1408 struct isl_print_space_data data = { 0 };
1409 struct isl_aff_split *split = NULL;
1410 int rational;
1412 if (!p || !map)
1413 return isl_printer_free(p);
1414 if (!p->dump && map->n > 0)
1415 split = split_aff(map);
1416 if (split) {
1417 p = print_split_map(p, split, map->n, map->dim);
1418 } else {
1419 rational = map->n > 0 &&
1420 ISL_F_ISSET(map->p[0], ISL_BASIC_MAP_RATIONAL);
1421 p = isl_print_space(map->dim, p, rational, &data);
1422 p = print_disjuncts_map(map, map->dim, p, 0);
1424 free_split(split, map->n);
1425 return p;
1428 static __isl_give isl_printer *isl_map_print_isl(__isl_keep isl_map *map,
1429 __isl_take isl_printer *p)
1431 struct isl_print_space_data data = { 0 };
1433 p = print_param_tuple(p, map->dim, &data);
1434 p = isl_printer_print_str(p, s_open_set[0]);
1435 p = isl_map_print_isl_body(map, p);
1436 p = isl_printer_print_str(p, s_close_set[0]);
1437 return p;
1440 static __isl_give isl_printer *print_latex_map(__isl_keep isl_map *map,
1441 __isl_take isl_printer *p, __isl_keep isl_basic_map *aff)
1443 struct isl_print_space_data data = { 0 };
1445 data.latex = 1;
1446 p = print_param_tuple(p, map->dim, &data);
1447 p = isl_printer_print_str(p, s_open_set[1]);
1448 data.print_dim = &print_dim_eq;
1449 data.user = aff;
1450 p = isl_print_space(map->dim, p, 0, &data);
1451 p = print_disjuncts_map(map, map->dim, p, 1);
1452 p = isl_printer_print_str(p, s_close_set[1]);
1454 return p;
1457 static __isl_give isl_printer *isl_map_print_latex(__isl_keep isl_map *map,
1458 __isl_take isl_printer *p)
1460 int i;
1461 struct isl_aff_split *split = NULL;
1463 if (map->n > 0)
1464 split = split_aff(map);
1466 if (!split)
1467 return print_latex_map(map, p, NULL);
1469 for (i = 0; i < map->n; ++i) {
1470 if (!split[i].map)
1471 break;
1472 if (i)
1473 p = isl_printer_print_str(p, " \\cup ");
1474 p = print_latex_map(split[i].map, p, split[i].aff);
1477 free_split(split, map->n);
1478 return p;
1481 __isl_give isl_printer *isl_printer_print_basic_map(__isl_take isl_printer *p,
1482 __isl_keep isl_basic_map *bmap)
1484 if (!p || !bmap)
1485 goto error;
1486 if (p->output_format == ISL_FORMAT_ISL)
1487 return isl_basic_map_print_isl(bmap, p, 0);
1488 else if (p->output_format == ISL_FORMAT_OMEGA)
1489 return basic_map_print_omega(bmap, p);
1490 isl_assert(bmap->ctx, 0, goto error);
1491 error:
1492 isl_printer_free(p);
1493 return NULL;
1496 __isl_give isl_printer *isl_printer_print_basic_set(__isl_take isl_printer *p,
1497 __isl_keep isl_basic_set *bset)
1499 if (!p || !bset)
1500 goto error;
1502 if (p->output_format == ISL_FORMAT_ISL)
1503 return isl_basic_map_print_isl(bset, p, 0);
1504 else if (p->output_format == ISL_FORMAT_POLYLIB)
1505 return isl_basic_set_print_polylib(bset, p, 0);
1506 else if (p->output_format == ISL_FORMAT_EXT_POLYLIB)
1507 return isl_basic_set_print_polylib(bset, p, 1);
1508 else if (p->output_format == ISL_FORMAT_POLYLIB_CONSTRAINTS)
1509 return bset_print_constraints_polylib(bset, p);
1510 else if (p->output_format == ISL_FORMAT_OMEGA)
1511 return basic_set_print_omega(bset, p);
1512 isl_assert(p->ctx, 0, goto error);
1513 error:
1514 isl_printer_free(p);
1515 return NULL;
1518 __isl_give isl_printer *isl_printer_print_set(__isl_take isl_printer *p,
1519 __isl_keep isl_set *set)
1521 if (!p || !set)
1522 goto error;
1523 if (p->output_format == ISL_FORMAT_ISL)
1524 return isl_map_print_isl(set_to_map(set), p);
1525 else if (p->output_format == ISL_FORMAT_POLYLIB)
1526 return isl_set_print_polylib(set, p, 0);
1527 else if (p->output_format == ISL_FORMAT_EXT_POLYLIB)
1528 return isl_set_print_polylib(set, p, 1);
1529 else if (p->output_format == ISL_FORMAT_OMEGA)
1530 return isl_set_print_omega(set, p);
1531 else if (p->output_format == ISL_FORMAT_LATEX)
1532 return isl_map_print_latex(set_to_map(set), p);
1533 isl_assert(set->ctx, 0, goto error);
1534 error:
1535 isl_printer_free(p);
1536 return NULL;
1539 __isl_give isl_printer *isl_printer_print_map(__isl_take isl_printer *p,
1540 __isl_keep isl_map *map)
1542 if (!p || !map)
1543 goto error;
1545 if (p->output_format == ISL_FORMAT_ISL)
1546 return isl_map_print_isl(map, p);
1547 else if (p->output_format == ISL_FORMAT_POLYLIB)
1548 return isl_map_print_polylib(map, p, 0);
1549 else if (p->output_format == ISL_FORMAT_EXT_POLYLIB)
1550 return isl_map_print_polylib(map, p, 1);
1551 else if (p->output_format == ISL_FORMAT_OMEGA)
1552 return isl_map_print_omega(map, p);
1553 else if (p->output_format == ISL_FORMAT_LATEX)
1554 return isl_map_print_latex(map, p);
1555 isl_assert(map->ctx, 0, goto error);
1556 error:
1557 isl_printer_free(p);
1558 return NULL;
1561 struct isl_union_print_data {
1562 isl_printer *p;
1563 int first;
1566 static isl_stat print_map_body(__isl_take isl_map *map, void *user)
1568 struct isl_union_print_data *data;
1569 data = (struct isl_union_print_data *)user;
1571 if (!data->first)
1572 data->p = isl_printer_print_str(data->p, "; ");
1573 data->first = 0;
1575 data->p = isl_map_print_isl_body(map, data->p);
1576 isl_map_free(map);
1578 return isl_stat_ok;
1581 /* Print the body of "umap" (everything except the parameter declarations)
1582 * to "p" in isl format.
1584 static __isl_give isl_printer *isl_printer_print_union_map_isl_body(
1585 __isl_take isl_printer *p, __isl_keep isl_union_map *umap)
1587 struct isl_union_print_data data;
1589 p = isl_printer_print_str(p, s_open_set[0]);
1590 data.p = p;
1591 data.first = 1;
1592 isl_union_map_foreach_map(umap, &print_map_body, &data);
1593 p = data.p;
1594 p = isl_printer_print_str(p, s_close_set[0]);
1595 return p;
1598 /* Print the body of "uset" (everything except the parameter declarations)
1599 * to "p" in isl format.
1601 static __isl_give isl_printer *isl_printer_print_union_set_isl_body(
1602 __isl_take isl_printer *p, __isl_keep isl_union_set *uset)
1604 return isl_printer_print_union_map_isl_body(p, uset_to_umap(uset));
1607 /* Print the isl_union_map "umap" to "p" in isl format.
1609 static __isl_give isl_printer *isl_union_map_print_isl(
1610 __isl_keep isl_union_map *umap, __isl_take isl_printer *p)
1612 struct isl_print_space_data space_data = { 0 };
1613 isl_space *space;
1615 space = isl_union_map_get_space(umap);
1616 p = print_param_tuple(p, space, &space_data);
1617 isl_space_free(space);
1619 p = isl_printer_print_union_map_isl_body(p, umap);
1621 return p;
1624 static isl_stat print_latex_map_body(__isl_take isl_map *map, void *user)
1626 struct isl_union_print_data *data;
1627 data = (struct isl_union_print_data *)user;
1629 if (!data->first)
1630 data->p = isl_printer_print_str(data->p, " \\cup ");
1631 data->first = 0;
1633 data->p = isl_map_print_latex(map, data->p);
1634 isl_map_free(map);
1636 return isl_stat_ok;
1639 static __isl_give isl_printer *isl_union_map_print_latex(
1640 __isl_keep isl_union_map *umap, __isl_take isl_printer *p)
1642 struct isl_union_print_data data = { p, 1 };
1643 isl_union_map_foreach_map(umap, &print_latex_map_body, &data);
1644 p = data.p;
1645 return p;
1648 __isl_give isl_printer *isl_printer_print_union_map(__isl_take isl_printer *p,
1649 __isl_keep isl_union_map *umap)
1651 if (!p || !umap)
1652 goto error;
1654 if (p->output_format == ISL_FORMAT_ISL)
1655 return isl_union_map_print_isl(umap, p);
1656 if (p->output_format == ISL_FORMAT_LATEX)
1657 return isl_union_map_print_latex(umap, p);
1659 isl_die(p->ctx, isl_error_invalid,
1660 "invalid output format for isl_union_map", goto error);
1661 error:
1662 isl_printer_free(p);
1663 return NULL;
1666 __isl_give isl_printer *isl_printer_print_union_set(__isl_take isl_printer *p,
1667 __isl_keep isl_union_set *uset)
1669 if (!p || !uset)
1670 goto error;
1672 if (p->output_format == ISL_FORMAT_ISL)
1673 return isl_union_map_print_isl(uset_to_umap(uset), p);
1674 if (p->output_format == ISL_FORMAT_LATEX)
1675 return isl_union_map_print_latex(uset_to_umap(uset), p);
1677 isl_die(p->ctx, isl_error_invalid,
1678 "invalid output format for isl_union_set", goto error);
1679 error:
1680 isl_printer_free(p);
1681 return NULL;
1684 static int upoly_rec_n_non_zero(__isl_keep struct isl_upoly_rec *rec)
1686 int i;
1687 int n;
1689 for (i = 0, n = 0; i < rec->n; ++i)
1690 if (!isl_upoly_is_zero(rec->p[i]))
1691 ++n;
1693 return n;
1696 static __isl_give isl_printer *upoly_print_cst(__isl_keep struct isl_upoly *up,
1697 __isl_take isl_printer *p, int first)
1699 struct isl_upoly_cst *cst;
1700 int neg;
1702 cst = isl_upoly_as_cst(up);
1703 if (!cst)
1704 goto error;
1705 neg = !first && isl_int_is_neg(cst->n);
1706 if (!first)
1707 p = isl_printer_print_str(p, neg ? " - " : " + ");
1708 if (neg)
1709 isl_int_neg(cst->n, cst->n);
1710 if (isl_int_is_zero(cst->d)) {
1711 int sgn = isl_int_sgn(cst->n);
1712 p = isl_printer_print_str(p, sgn < 0 ? "-infty" :
1713 sgn == 0 ? "NaN" : "infty");
1714 } else
1715 p = isl_printer_print_isl_int(p, cst->n);
1716 if (neg)
1717 isl_int_neg(cst->n, cst->n);
1718 if (!isl_int_is_zero(cst->d) && !isl_int_is_one(cst->d)) {
1719 p = isl_printer_print_str(p, "/");
1720 p = isl_printer_print_isl_int(p, cst->d);
1722 return p;
1723 error:
1724 isl_printer_free(p);
1725 return NULL;
1728 static __isl_give isl_printer *print_base(__isl_take isl_printer *p,
1729 __isl_keep isl_space *dim, __isl_keep isl_mat *div, int var)
1731 unsigned total;
1733 total = isl_space_dim(dim, isl_dim_all);
1734 if (var < total)
1735 p = print_term(dim, NULL, dim->ctx->one, 1 + var, p, 0);
1736 else
1737 p = print_div(dim, div, var - total, p);
1738 return p;
1741 static __isl_give isl_printer *print_pow(__isl_take isl_printer *p,
1742 __isl_keep isl_space *dim, __isl_keep isl_mat *div, int var, int exp)
1744 p = print_base(p, dim, div, var);
1745 if (exp == 1)
1746 return p;
1747 if (p->output_format == ISL_FORMAT_C) {
1748 int i;
1749 for (i = 1; i < exp; ++i) {
1750 p = isl_printer_print_str(p, "*");
1751 p = print_base(p, dim, div, var);
1753 } else {
1754 p = isl_printer_print_str(p, "^");
1755 p = isl_printer_print_int(p, exp);
1757 return p;
1760 /* Print the polynomial "up" defined over the domain space "space" and
1761 * local variables defined by "div" to "p".
1763 static __isl_give isl_printer *upoly_print(__isl_keep struct isl_upoly *up,
1764 __isl_keep isl_space *space, __isl_keep isl_mat *div,
1765 __isl_take isl_printer *p)
1767 int i, n, first, print_parens;
1768 struct isl_upoly_rec *rec;
1770 if (!p || !up || !space || !div)
1771 goto error;
1773 if (isl_upoly_is_cst(up))
1774 return upoly_print_cst(up, p, 1);
1776 rec = isl_upoly_as_rec(up);
1777 if (!rec)
1778 goto error;
1779 n = upoly_rec_n_non_zero(rec);
1780 print_parens = n > 1;
1781 if (print_parens)
1782 p = isl_printer_print_str(p, "(");
1783 for (i = 0, first = 1; i < rec->n; ++i) {
1784 if (isl_upoly_is_zero(rec->p[i]))
1785 continue;
1786 if (isl_upoly_is_negone(rec->p[i])) {
1787 if (!i)
1788 p = isl_printer_print_str(p, "-1");
1789 else if (first)
1790 p = isl_printer_print_str(p, "-");
1791 else
1792 p = isl_printer_print_str(p, " - ");
1793 } else if (isl_upoly_is_cst(rec->p[i]) &&
1794 !isl_upoly_is_one(rec->p[i]))
1795 p = upoly_print_cst(rec->p[i], p, first);
1796 else {
1797 if (!first)
1798 p = isl_printer_print_str(p, " + ");
1799 if (i == 0 || !isl_upoly_is_one(rec->p[i]))
1800 p = upoly_print(rec->p[i], space, div, p);
1802 first = 0;
1803 if (i == 0)
1804 continue;
1805 if (!isl_upoly_is_one(rec->p[i]) &&
1806 !isl_upoly_is_negone(rec->p[i]))
1807 p = isl_printer_print_str(p, " * ");
1808 p = print_pow(p, space, div, rec->up.var, i);
1810 if (print_parens)
1811 p = isl_printer_print_str(p, ")");
1812 return p;
1813 error:
1814 isl_printer_free(p);
1815 return NULL;
1818 static __isl_give isl_printer *print_qpolynomial(__isl_take isl_printer *p,
1819 __isl_keep isl_qpolynomial *qp)
1821 if (!p || !qp)
1822 goto error;
1823 p = upoly_print(qp->upoly, qp->dim, qp->div, p);
1824 return p;
1825 error:
1826 isl_printer_free(p);
1827 return NULL;
1830 static __isl_give isl_printer *print_qpolynomial_isl(__isl_take isl_printer *p,
1831 __isl_keep isl_qpolynomial *qp)
1833 struct isl_print_space_data data = { 0 };
1835 if (!p || !qp)
1836 goto error;
1838 p = print_param_tuple(p, qp->dim, &data);
1839 p = isl_printer_print_str(p, "{ ");
1840 if (!isl_space_is_params(qp->dim)) {
1841 p = isl_print_space(qp->dim, p, 0, &data);
1842 p = isl_printer_print_str(p, " -> ");
1844 p = print_qpolynomial(p, qp);
1845 p = isl_printer_print_str(p, " }");
1846 return p;
1847 error:
1848 isl_printer_free(p);
1849 return NULL;
1852 /* Print the quasi-polynomial "qp" to "p" in C format, with the variable names
1853 * taken from the domain space "space".
1855 static __isl_give isl_printer *print_qpolynomial_c(__isl_take isl_printer *p,
1856 __isl_keep isl_space *space, __isl_keep isl_qpolynomial *qp)
1858 isl_int den;
1860 isl_int_init(den);
1861 isl_qpolynomial_get_den(qp, &den);
1862 if (!isl_int_is_one(den)) {
1863 isl_qpolynomial *f;
1864 p = isl_printer_print_str(p, "(");
1865 qp = isl_qpolynomial_copy(qp);
1866 f = isl_qpolynomial_rat_cst_on_domain(isl_space_copy(qp->dim),
1867 den, qp->dim->ctx->one);
1868 qp = isl_qpolynomial_mul(qp, f);
1870 if (qp)
1871 p = upoly_print(qp->upoly, space, qp->div, p);
1872 else
1873 p = isl_printer_free(p);
1874 if (!isl_int_is_one(den)) {
1875 p = isl_printer_print_str(p, ")/");
1876 p = isl_printer_print_isl_int(p, den);
1877 isl_qpolynomial_free(qp);
1879 isl_int_clear(den);
1880 return p;
1883 __isl_give isl_printer *isl_printer_print_qpolynomial(
1884 __isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp)
1886 if (!p || !qp)
1887 goto error;
1889 if (p->output_format == ISL_FORMAT_ISL)
1890 return print_qpolynomial_isl(p, qp);
1891 else if (p->output_format == ISL_FORMAT_C)
1892 return print_qpolynomial_c(p, qp->dim, qp);
1893 else
1894 isl_die(qp->dim->ctx, isl_error_unsupported,
1895 "output format not supported for isl_qpolynomials",
1896 goto error);
1897 error:
1898 isl_printer_free(p);
1899 return NULL;
1902 void isl_qpolynomial_print(__isl_keep isl_qpolynomial *qp, FILE *out,
1903 unsigned output_format)
1905 isl_printer *p;
1907 if (!qp)
1908 return;
1910 isl_assert(qp->dim->ctx, output_format == ISL_FORMAT_ISL, return);
1911 p = isl_printer_to_file(qp->dim->ctx, out);
1912 p = isl_printer_print_qpolynomial(p, qp);
1913 isl_printer_free(p);
1916 static __isl_give isl_printer *qpolynomial_fold_print(
1917 __isl_keep isl_qpolynomial_fold *fold, __isl_take isl_printer *p)
1919 int i;
1921 if (fold->type == isl_fold_min)
1922 p = isl_printer_print_str(p, "min");
1923 else if (fold->type == isl_fold_max)
1924 p = isl_printer_print_str(p, "max");
1925 p = isl_printer_print_str(p, "(");
1926 for (i = 0; i < fold->n; ++i) {
1927 if (i)
1928 p = isl_printer_print_str(p, ", ");
1929 p = print_qpolynomial(p, fold->qp[i]);
1931 p = isl_printer_print_str(p, ")");
1932 return p;
1935 void isl_qpolynomial_fold_print(__isl_keep isl_qpolynomial_fold *fold,
1936 FILE *out, unsigned output_format)
1938 isl_printer *p;
1940 if (!fold)
1941 return;
1943 isl_assert(fold->dim->ctx, output_format == ISL_FORMAT_ISL, return);
1945 p = isl_printer_to_file(fold->dim->ctx, out);
1946 p = isl_printer_print_qpolynomial_fold(p, fold);
1948 isl_printer_free(p);
1951 static __isl_give isl_printer *isl_pwqp_print_isl_body(
1952 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp)
1954 struct isl_print_space_data data = { 0 };
1955 int i = 0;
1957 for (i = 0; i < pwqp->n; ++i) {
1958 isl_space *space;
1960 if (i)
1961 p = isl_printer_print_str(p, "; ");
1962 space = isl_qpolynomial_get_domain_space(pwqp->p[i].qp);
1963 if (!isl_space_is_params(space)) {
1964 p = isl_print_space(space, p, 0, &data);
1965 p = isl_printer_print_str(p, " -> ");
1967 p = print_qpolynomial(p, pwqp->p[i].qp);
1968 p = print_disjuncts(set_to_map(pwqp->p[i].set), space, p, 0);
1969 isl_space_free(space);
1972 return p;
1975 static __isl_give isl_printer *print_pw_qpolynomial_isl(
1976 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp)
1978 struct isl_print_space_data data = { 0 };
1980 if (!p || !pwqp)
1981 goto error;
1983 p = print_param_tuple(p, pwqp->dim, &data);
1984 p = isl_printer_print_str(p, "{ ");
1985 if (pwqp->n == 0) {
1986 if (!isl_space_is_set(pwqp->dim)) {
1987 p = print_tuple(pwqp->dim, p, isl_dim_in, &data);
1988 p = isl_printer_print_str(p, " -> ");
1990 p = isl_printer_print_str(p, "0");
1992 p = isl_pwqp_print_isl_body(p, pwqp);
1993 p = isl_printer_print_str(p, " }");
1994 return p;
1995 error:
1996 isl_printer_free(p);
1997 return NULL;
2000 void isl_pw_qpolynomial_print(__isl_keep isl_pw_qpolynomial *pwqp, FILE *out,
2001 unsigned output_format)
2003 isl_printer *p;
2005 if (!pwqp)
2006 return;
2008 p = isl_printer_to_file(pwqp->dim->ctx, out);
2009 p = isl_printer_set_output_format(p, output_format);
2010 p = isl_printer_print_pw_qpolynomial(p, pwqp);
2012 isl_printer_free(p);
2015 static __isl_give isl_printer *isl_pwf_print_isl_body(
2016 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf)
2018 struct isl_print_space_data data = { 0 };
2019 int i = 0;
2021 for (i = 0; i < pwf->n; ++i) {
2022 isl_space *space;
2024 if (i)
2025 p = isl_printer_print_str(p, "; ");
2026 space = isl_qpolynomial_fold_get_domain_space(pwf->p[i].fold);
2027 if (!isl_space_is_params(space)) {
2028 p = isl_print_space(space, p, 0, &data);
2029 p = isl_printer_print_str(p, " -> ");
2031 p = qpolynomial_fold_print(pwf->p[i].fold, p);
2032 p = print_disjuncts(set_to_map(pwf->p[i].set), space, p, 0);
2033 isl_space_free(space);
2036 return p;
2039 static __isl_give isl_printer *print_pw_qpolynomial_fold_isl(
2040 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf)
2042 struct isl_print_space_data data = { 0 };
2044 p = print_param_tuple(p, pwf->dim, &data);
2045 p = isl_printer_print_str(p, "{ ");
2046 if (pwf->n == 0) {
2047 if (!isl_space_is_set(pwf->dim)) {
2048 p = print_tuple(pwf->dim, p, isl_dim_in, &data);
2049 p = isl_printer_print_str(p, " -> ");
2051 p = isl_printer_print_str(p, "0");
2053 p = isl_pwf_print_isl_body(p, pwf);
2054 p = isl_printer_print_str(p, " }");
2055 return p;
2058 static __isl_give isl_printer *print_affine_c(__isl_take isl_printer *p,
2059 __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c);
2061 static __isl_give isl_printer *print_name_c(__isl_take isl_printer *p,
2062 __isl_keep isl_space *dim,
2063 __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos)
2065 if (type == isl_dim_div) {
2066 p = isl_printer_print_str(p, "floord(");
2067 p = print_affine_c(p, dim, bset, bset->div[pos] + 1);
2068 p = isl_printer_print_str(p, ", ");
2069 p = isl_printer_print_isl_int(p, bset->div[pos][0]);
2070 p = isl_printer_print_str(p, ")");
2071 } else {
2072 const char *name;
2074 name = isl_space_get_dim_name(dim, type, pos);
2075 if (!name)
2076 name = "UNNAMED";
2077 p = isl_printer_print_str(p, name);
2079 return p;
2082 static __isl_give isl_printer *print_term_c(__isl_take isl_printer *p,
2083 __isl_keep isl_space *dim,
2084 __isl_keep isl_basic_set *bset, isl_int c, unsigned pos)
2086 enum isl_dim_type type;
2088 if (pos == 0)
2089 return isl_printer_print_isl_int(p, c);
2091 if (isl_int_is_one(c))
2093 else if (isl_int_is_negone(c))
2094 p = isl_printer_print_str(p, "-");
2095 else {
2096 p = isl_printer_print_isl_int(p, c);
2097 p = isl_printer_print_str(p, "*");
2099 type = pos2type(dim, &pos);
2100 p = print_name_c(p, dim, bset, type, pos);
2101 return p;
2104 static __isl_give isl_printer *print_partial_affine_c(__isl_take isl_printer *p,
2105 __isl_keep isl_space *dim,
2106 __isl_keep isl_basic_set *bset, isl_int *c, unsigned len)
2108 int i;
2109 int first;
2111 for (i = 0, first = 1; i < len; ++i) {
2112 int flip = 0;
2113 if (isl_int_is_zero(c[i]))
2114 continue;
2115 if (!first) {
2116 if (isl_int_is_neg(c[i])) {
2117 flip = 1;
2118 isl_int_neg(c[i], c[i]);
2119 p = isl_printer_print_str(p, " - ");
2120 } else
2121 p = isl_printer_print_str(p, " + ");
2123 first = 0;
2124 p = print_term_c(p, dim, bset, c[i], i);
2125 if (flip)
2126 isl_int_neg(c[i], c[i]);
2128 if (first)
2129 p = isl_printer_print_str(p, "0");
2130 return p;
2133 static __isl_give isl_printer *print_affine_c(__isl_take isl_printer *p,
2134 __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c)
2136 unsigned len = 1 + isl_basic_set_total_dim(bset);
2137 return print_partial_affine_c(p, dim, bset, c, len);
2140 /* We skip the constraint if it is implied by the div expression.
2142 * *first indicates whether this is the first constraint in the conjunction and
2143 * is updated if the constraint is actually printed.
2145 static __isl_give isl_printer *print_constraint_c(__isl_take isl_printer *p,
2146 __isl_keep isl_space *dim,
2147 __isl_keep isl_basic_set *bset, isl_int *c, const char *op, int *first)
2149 unsigned o_div;
2150 unsigned n_div;
2151 int div;
2153 o_div = isl_basic_set_offset(bset, isl_dim_div);
2154 n_div = isl_basic_set_dim(bset, isl_dim_div);
2155 div = isl_seq_last_non_zero(c + o_div, n_div);
2156 if (div >= 0) {
2157 isl_bool is_div = isl_basic_set_is_div_constraint(bset, c, div);
2158 if (is_div < 0)
2159 return isl_printer_free(p);
2160 if (is_div)
2161 return p;
2164 if (!*first)
2165 p = isl_printer_print_str(p, " && ");
2167 p = print_affine_c(p, dim, bset, c);
2168 p = isl_printer_print_str(p, " ");
2169 p = isl_printer_print_str(p, op);
2170 p = isl_printer_print_str(p, " 0");
2172 *first = 0;
2174 return p;
2177 static __isl_give isl_printer *print_basic_set_c(__isl_take isl_printer *p,
2178 __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset)
2180 int i, j;
2181 int first = 1;
2182 unsigned n_div = isl_basic_set_dim(bset, isl_dim_div);
2183 unsigned total = isl_basic_set_total_dim(bset) - n_div;
2185 for (i = 0; i < bset->n_eq; ++i) {
2186 j = isl_seq_last_non_zero(bset->eq[i] + 1 + total, n_div);
2187 if (j < 0)
2188 p = print_constraint_c(p, dim, bset,
2189 bset->eq[i], "==", &first);
2190 else {
2191 if (i)
2192 p = isl_printer_print_str(p, " && ");
2193 p = isl_printer_print_str(p, "(");
2194 p = print_partial_affine_c(p, dim, bset, bset->eq[i],
2195 1 + total + j);
2196 p = isl_printer_print_str(p, ") % ");
2197 p = isl_printer_print_isl_int(p,
2198 bset->eq[i][1 + total + j]);
2199 p = isl_printer_print_str(p, " == 0");
2200 first = 0;
2203 for (i = 0; i < bset->n_ineq; ++i)
2204 p = print_constraint_c(p, dim, bset, bset->ineq[i], ">=",
2205 &first);
2206 return p;
2209 static __isl_give isl_printer *print_set_c(__isl_take isl_printer *p,
2210 __isl_keep isl_space *dim, __isl_keep isl_set *set)
2212 int i;
2214 if (!set)
2215 return isl_printer_free(p);
2217 if (set->n == 0)
2218 p = isl_printer_print_str(p, "0");
2220 for (i = 0; i < set->n; ++i) {
2221 if (i)
2222 p = isl_printer_print_str(p, " || ");
2223 if (set->n > 1)
2224 p = isl_printer_print_str(p, "(");
2225 p = print_basic_set_c(p, dim, set->p[i]);
2226 if (set->n > 1)
2227 p = isl_printer_print_str(p, ")");
2229 return p;
2232 /* Print the piecewise quasi-polynomial "pwqp" to "p" in C format.
2234 static __isl_give isl_printer *print_pw_qpolynomial_c(
2235 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp)
2237 int i;
2238 isl_space *space;
2240 space = isl_pw_qpolynomial_get_domain_space(pwqp);
2241 if (pwqp->n == 1 && isl_set_plain_is_universe(pwqp->p[0].set)) {
2242 p = print_qpolynomial_c(p, space, pwqp->p[0].qp);
2243 isl_space_free(space);
2244 return p;
2247 for (i = 0; i < pwqp->n; ++i) {
2248 p = isl_printer_print_str(p, "(");
2249 p = print_set_c(p, space, pwqp->p[i].set);
2250 p = isl_printer_print_str(p, ") ? (");
2251 p = print_qpolynomial_c(p, space, pwqp->p[i].qp);
2252 p = isl_printer_print_str(p, ") : ");
2255 isl_space_free(space);
2256 p = isl_printer_print_str(p, "0");
2257 return p;
2260 __isl_give isl_printer *isl_printer_print_pw_qpolynomial(
2261 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp)
2263 if (!p || !pwqp)
2264 goto error;
2266 if (p->output_format == ISL_FORMAT_ISL)
2267 return print_pw_qpolynomial_isl(p, pwqp);
2268 else if (p->output_format == ISL_FORMAT_C)
2269 return print_pw_qpolynomial_c(p, pwqp);
2270 isl_assert(p->ctx, 0, goto error);
2271 error:
2272 isl_printer_free(p);
2273 return NULL;
2276 static isl_stat print_pwqp_body(__isl_take isl_pw_qpolynomial *pwqp, void *user)
2278 struct isl_union_print_data *data;
2279 data = (struct isl_union_print_data *)user;
2281 if (!data->first)
2282 data->p = isl_printer_print_str(data->p, "; ");
2283 data->first = 0;
2285 data->p = isl_pwqp_print_isl_body(data->p, pwqp);
2286 isl_pw_qpolynomial_free(pwqp);
2288 return isl_stat_ok;
2291 static __isl_give isl_printer *print_union_pw_qpolynomial_isl(
2292 __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp)
2294 struct isl_union_print_data data;
2295 struct isl_print_space_data space_data = { 0 };
2296 isl_space *space;
2298 space = isl_union_pw_qpolynomial_get_space(upwqp);
2299 p = print_param_tuple(p, space, &space_data);
2300 isl_space_free(space);
2301 p = isl_printer_print_str(p, "{ ");
2302 data.p = p;
2303 data.first = 1;
2304 isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &print_pwqp_body,
2305 &data);
2306 p = data.p;
2307 p = isl_printer_print_str(p, " }");
2308 return p;
2311 __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial(
2312 __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp)
2314 if (!p || !upwqp)
2315 goto error;
2317 if (p->output_format == ISL_FORMAT_ISL)
2318 return print_union_pw_qpolynomial_isl(p, upwqp);
2319 isl_die(p->ctx, isl_error_invalid,
2320 "invalid output format for isl_union_pw_qpolynomial",
2321 goto error);
2322 error:
2323 isl_printer_free(p);
2324 return NULL;
2327 /* Print the quasi-polynomial reduction "fold" to "p" in C format,
2328 * with the variable names taken from the domain space "space".
2330 static __isl_give isl_printer *print_qpolynomial_fold_c(
2331 __isl_take isl_printer *p, __isl_keep isl_space *space,
2332 __isl_keep isl_qpolynomial_fold *fold)
2334 int i;
2336 for (i = 0; i < fold->n - 1; ++i)
2337 if (fold->type == isl_fold_min)
2338 p = isl_printer_print_str(p, "min(");
2339 else if (fold->type == isl_fold_max)
2340 p = isl_printer_print_str(p, "max(");
2342 for (i = 0; i < fold->n; ++i) {
2343 if (i)
2344 p = isl_printer_print_str(p, ", ");
2345 p = print_qpolynomial_c(p, space, fold->qp[i]);
2346 if (i)
2347 p = isl_printer_print_str(p, ")");
2349 return p;
2352 __isl_give isl_printer *isl_printer_print_qpolynomial_fold(
2353 __isl_take isl_printer *p, __isl_keep isl_qpolynomial_fold *fold)
2355 if (!p || !fold)
2356 goto error;
2357 if (p->output_format == ISL_FORMAT_ISL)
2358 return qpolynomial_fold_print(fold, p);
2359 else if (p->output_format == ISL_FORMAT_C)
2360 return print_qpolynomial_fold_c(p, fold->dim, fold);
2361 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
2362 goto error);
2363 error:
2364 isl_printer_free(p);
2365 return NULL;
2368 /* Print the piecewise quasi-polynomial reduction "pwf" to "p" in C format.
2370 static __isl_give isl_printer *print_pw_qpolynomial_fold_c(
2371 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf)
2373 int i;
2374 isl_space *space;
2376 space = isl_pw_qpolynomial_fold_get_domain_space(pwf);
2377 if (pwf->n == 1 && isl_set_plain_is_universe(pwf->p[0].set)) {
2378 p = print_qpolynomial_fold_c(p, space, pwf->p[0].fold);
2379 isl_space_free(space);
2380 return p;
2383 for (i = 0; i < pwf->n; ++i) {
2384 p = isl_printer_print_str(p, "(");
2385 p = print_set_c(p, space, pwf->p[i].set);
2386 p = isl_printer_print_str(p, ") ? (");
2387 p = print_qpolynomial_fold_c(p, space, pwf->p[i].fold);
2388 p = isl_printer_print_str(p, ") : ");
2391 isl_space_free(space);
2392 p = isl_printer_print_str(p, "0");
2393 return p;
2396 __isl_give isl_printer *isl_printer_print_pw_qpolynomial_fold(
2397 __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf)
2399 if (!p || !pwf)
2400 goto error;
2402 if (p->output_format == ISL_FORMAT_ISL)
2403 return print_pw_qpolynomial_fold_isl(p, pwf);
2404 else if (p->output_format == ISL_FORMAT_C)
2405 return print_pw_qpolynomial_fold_c(p, pwf);
2406 isl_assert(p->ctx, 0, goto error);
2407 error:
2408 isl_printer_free(p);
2409 return NULL;
2412 void isl_pw_qpolynomial_fold_print(__isl_keep isl_pw_qpolynomial_fold *pwf,
2413 FILE *out, unsigned output_format)
2415 isl_printer *p;
2417 if (!pwf)
2418 return;
2420 p = isl_printer_to_file(pwf->dim->ctx, out);
2421 p = isl_printer_set_output_format(p, output_format);
2422 p = isl_printer_print_pw_qpolynomial_fold(p, pwf);
2424 isl_printer_free(p);
2427 static isl_stat print_pwf_body(__isl_take isl_pw_qpolynomial_fold *pwf,
2428 void *user)
2430 struct isl_union_print_data *data;
2431 data = (struct isl_union_print_data *)user;
2433 if (!data->first)
2434 data->p = isl_printer_print_str(data->p, "; ");
2435 data->first = 0;
2437 data->p = isl_pwf_print_isl_body(data->p, pwf);
2438 isl_pw_qpolynomial_fold_free(pwf);
2440 return isl_stat_ok;
2443 static __isl_give isl_printer *print_union_pw_qpolynomial_fold_isl(
2444 __isl_take isl_printer *p,
2445 __isl_keep isl_union_pw_qpolynomial_fold *upwf)
2447 struct isl_union_print_data data;
2448 struct isl_print_space_data space_data = { 0 };
2449 isl_space *space;
2451 space = isl_union_pw_qpolynomial_fold_get_space(upwf);
2452 p = print_param_tuple(p, space, &space_data);
2453 isl_space_free(space);
2454 p = isl_printer_print_str(p, "{ ");
2455 data.p = p;
2456 data.first = 1;
2457 isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(upwf,
2458 &print_pwf_body, &data);
2459 p = data.p;
2460 p = isl_printer_print_str(p, " }");
2461 return p;
2464 __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial_fold(
2465 __isl_take isl_printer *p,
2466 __isl_keep isl_union_pw_qpolynomial_fold *upwf)
2468 if (!p || !upwf)
2469 goto error;
2471 if (p->output_format == ISL_FORMAT_ISL)
2472 return print_union_pw_qpolynomial_fold_isl(p, upwf);
2473 isl_die(p->ctx, isl_error_invalid,
2474 "invalid output format for isl_union_pw_qpolynomial_fold",
2475 goto error);
2476 error:
2477 isl_printer_free(p);
2478 return NULL;
2481 /* Print the isl_constraint "c" to "p".
2483 __isl_give isl_printer *isl_printer_print_constraint(__isl_take isl_printer *p,
2484 __isl_keep isl_constraint *c)
2486 struct isl_print_space_data data = { 0 };
2487 isl_local_space *ls;
2488 isl_space *space;
2489 isl_bool exists;
2491 if (!p || !c)
2492 goto error;
2494 ls = isl_constraint_get_local_space(c);
2495 if (!ls)
2496 return isl_printer_free(p);
2497 space = isl_local_space_get_space(ls);
2498 p = print_param_tuple(p, space, &data);
2499 p = isl_printer_print_str(p, "{ ");
2500 p = isl_print_space(space, p, 0, &data);
2501 p = isl_printer_print_str(p, " : ");
2502 exists = need_exists(p, ls->div);
2503 if (exists < 0)
2504 p = isl_printer_free(p);
2505 if (exists >= 0 && exists)
2506 p = open_exists(p, space, ls->div, 0);
2507 p = print_affine_of_len(space, ls->div, p, c->v->el, c->v->size);
2508 if (isl_constraint_is_equality(c))
2509 p = isl_printer_print_str(p, " = 0");
2510 else
2511 p = isl_printer_print_str(p, " >= 0");
2512 if (exists >= 0 && exists)
2513 p = isl_printer_print_str(p, s_close_exists[0]);
2514 p = isl_printer_print_str(p, " }");
2515 isl_space_free(space);
2516 isl_local_space_free(ls);
2518 return p;
2519 error:
2520 isl_printer_free(p);
2521 return NULL;
2524 static __isl_give isl_printer *isl_printer_print_space_isl(
2525 __isl_take isl_printer *p, __isl_keep isl_space *space)
2527 struct isl_print_space_data data = { 0 };
2529 if (!space)
2530 goto error;
2532 p = print_param_tuple(p, space, &data);
2534 p = isl_printer_print_str(p, "{ ");
2535 if (isl_space_is_params(space))
2536 p = isl_printer_print_str(p, s_such_that[0]);
2537 else
2538 p = isl_print_space(space, p, 0, &data);
2539 p = isl_printer_print_str(p, " }");
2541 return p;
2542 error:
2543 isl_printer_free(p);
2544 return NULL;
2547 __isl_give isl_printer *isl_printer_print_space(__isl_take isl_printer *p,
2548 __isl_keep isl_space *space)
2550 if (!p || !space)
2551 return isl_printer_free(p);
2552 if (p->output_format == ISL_FORMAT_ISL)
2553 return isl_printer_print_space_isl(p, space);
2554 else if (p->output_format == ISL_FORMAT_OMEGA)
2555 return print_omega_parameters(space, p);
2557 isl_die(isl_space_get_ctx(space), isl_error_unsupported,
2558 "output format not supported for space",
2559 return isl_printer_free(p));
2562 __isl_give isl_printer *isl_printer_print_local_space(__isl_take isl_printer *p,
2563 __isl_keep isl_local_space *ls)
2565 struct isl_print_space_data data = { 0 };
2566 unsigned n_div;
2568 if (!ls)
2569 goto error;
2571 p = print_param_tuple(p, ls->dim, &data);
2572 p = isl_printer_print_str(p, "{ ");
2573 p = isl_print_space(ls->dim, p, 0, &data);
2574 n_div = isl_local_space_dim(ls, isl_dim_div);
2575 if (n_div > 0) {
2576 p = isl_printer_print_str(p, " : ");
2577 p = isl_printer_print_str(p, s_open_exists[0]);
2578 p = print_div_list(p, ls->dim, ls->div, 0, 1);
2579 p = isl_printer_print_str(p, s_close_exists[0]);
2580 } else if (isl_space_is_params(ls->dim))
2581 p = isl_printer_print_str(p, s_such_that[0]);
2582 p = isl_printer_print_str(p, " }");
2583 return p;
2584 error:
2585 isl_printer_free(p);
2586 return NULL;
2589 static __isl_give isl_printer *print_aff_body(__isl_take isl_printer *p,
2590 __isl_keep isl_aff *aff)
2592 unsigned total;
2594 if (isl_aff_is_nan(aff))
2595 return isl_printer_print_str(p, "NaN");
2597 total = isl_local_space_dim(aff->ls, isl_dim_all);
2598 p = isl_printer_print_str(p, "(");
2599 p = print_affine_of_len(aff->ls->dim, aff->ls->div, p,
2600 aff->v->el + 1, 1 + total);
2601 if (isl_int_is_one(aff->v->el[0]))
2602 p = isl_printer_print_str(p, ")");
2603 else {
2604 p = isl_printer_print_str(p, ")/");
2605 p = isl_printer_print_isl_int(p, aff->v->el[0]);
2608 return p;
2611 static __isl_give isl_printer *print_aff(__isl_take isl_printer *p,
2612 __isl_keep isl_aff *aff)
2614 struct isl_print_space_data data = { 0 };
2616 if (isl_space_is_params(aff->ls->dim))
2618 else {
2619 p = print_tuple(aff->ls->dim, p, isl_dim_set, &data);
2620 p = isl_printer_print_str(p, " -> ");
2622 p = isl_printer_print_str(p, "[");
2623 p = print_aff_body(p, aff);
2624 p = isl_printer_print_str(p, "]");
2626 return p;
2629 static __isl_give isl_printer *print_aff_isl(__isl_take isl_printer *p,
2630 __isl_keep isl_aff *aff)
2632 struct isl_print_space_data data = { 0 };
2634 if (!aff)
2635 goto error;
2637 p = print_param_tuple(p, aff->ls->dim, &data);
2638 p = isl_printer_print_str(p, "{ ");
2639 p = print_aff(p, aff);
2640 p = isl_printer_print_str(p, " }");
2641 return p;
2642 error:
2643 isl_printer_free(p);
2644 return NULL;
2647 /* Print the body of an isl_pw_aff, i.e., a semicolon delimited
2648 * sequence of affine expressions, each followed by constraints.
2650 static __isl_give isl_printer *print_pw_aff_body(
2651 __isl_take isl_printer *p, __isl_keep isl_pw_aff *pa)
2653 int i;
2655 if (!pa)
2656 return isl_printer_free(p);
2658 for (i = 0; i < pa->n; ++i) {
2659 isl_space *space;
2661 if (i)
2662 p = isl_printer_print_str(p, "; ");
2663 p = print_aff(p, pa->p[i].aff);
2664 space = isl_aff_get_domain_space(pa->p[i].aff);
2665 p = print_disjuncts(set_to_map(pa->p[i].set), space, p, 0);
2666 isl_space_free(space);
2669 return p;
2672 static __isl_give isl_printer *print_pw_aff_isl(__isl_take isl_printer *p,
2673 __isl_keep isl_pw_aff *pwaff)
2675 struct isl_print_space_data data = { 0 };
2677 if (!pwaff)
2678 goto error;
2680 p = print_param_tuple(p, pwaff->dim, &data);
2681 p = isl_printer_print_str(p, "{ ");
2682 p = print_pw_aff_body(p, pwaff);
2683 p = isl_printer_print_str(p, " }");
2684 return p;
2685 error:
2686 isl_printer_free(p);
2687 return NULL;
2690 static __isl_give isl_printer *print_ls_affine_c(__isl_take isl_printer *p,
2691 __isl_keep isl_local_space *ls, isl_int *c);
2693 static __isl_give isl_printer *print_ls_name_c(__isl_take isl_printer *p,
2694 __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos)
2696 if (type == isl_dim_div) {
2697 p = isl_printer_print_str(p, "floord(");
2698 p = print_ls_affine_c(p, ls, ls->div->row[pos] + 1);
2699 p = isl_printer_print_str(p, ", ");
2700 p = isl_printer_print_isl_int(p, ls->div->row[pos][0]);
2701 p = isl_printer_print_str(p, ")");
2702 } else {
2703 const char *name;
2705 name = isl_space_get_dim_name(ls->dim, type, pos);
2706 if (!name)
2707 name = "UNNAMED";
2708 p = isl_printer_print_str(p, name);
2710 return p;
2713 static __isl_give isl_printer *print_ls_term_c(__isl_take isl_printer *p,
2714 __isl_keep isl_local_space *ls, isl_int c, unsigned pos)
2716 enum isl_dim_type type;
2718 if (pos == 0)
2719 return isl_printer_print_isl_int(p, c);
2721 if (isl_int_is_one(c))
2723 else if (isl_int_is_negone(c))
2724 p = isl_printer_print_str(p, "-");
2725 else {
2726 p = isl_printer_print_isl_int(p, c);
2727 p = isl_printer_print_str(p, "*");
2729 type = pos2type(ls->dim, &pos);
2730 p = print_ls_name_c(p, ls, type, pos);
2731 return p;
2734 static __isl_give isl_printer *print_ls_partial_affine_c(
2735 __isl_take isl_printer *p, __isl_keep isl_local_space *ls,
2736 isl_int *c, unsigned len)
2738 int i;
2739 int first;
2741 for (i = 0, first = 1; i < len; ++i) {
2742 int flip = 0;
2743 if (isl_int_is_zero(c[i]))
2744 continue;
2745 if (!first) {
2746 if (isl_int_is_neg(c[i])) {
2747 flip = 1;
2748 isl_int_neg(c[i], c[i]);
2749 p = isl_printer_print_str(p, " - ");
2750 } else
2751 p = isl_printer_print_str(p, " + ");
2753 first = 0;
2754 p = print_ls_term_c(p, ls, c[i], i);
2755 if (flip)
2756 isl_int_neg(c[i], c[i]);
2758 if (first)
2759 p = isl_printer_print_str(p, "0");
2760 return p;
2763 static __isl_give isl_printer *print_ls_affine_c(__isl_take isl_printer *p,
2764 __isl_keep isl_local_space *ls, isl_int *c)
2766 unsigned len = 1 + isl_local_space_dim(ls, isl_dim_all);
2767 return print_ls_partial_affine_c(p, ls, c, len);
2770 static __isl_give isl_printer *print_aff_c(__isl_take isl_printer *p,
2771 __isl_keep isl_aff *aff)
2773 unsigned total;
2775 total = isl_local_space_dim(aff->ls, isl_dim_all);
2776 if (!isl_int_is_one(aff->v->el[0]))
2777 p = isl_printer_print_str(p, "(");
2778 p = print_ls_partial_affine_c(p, aff->ls, aff->v->el + 1, 1 + total);
2779 if (!isl_int_is_one(aff->v->el[0])) {
2780 p = isl_printer_print_str(p, ")/");
2781 p = isl_printer_print_isl_int(p, aff->v->el[0]);
2783 return p;
2786 /* In the C format, we cannot express that "pwaff" may be undefined
2787 * on parts of the domain space. We therefore assume that the expression
2788 * will only be evaluated on its definition domain and compute the gist
2789 * of each cell with respect to this domain.
2791 static __isl_give isl_printer *print_pw_aff_c(__isl_take isl_printer *p,
2792 __isl_keep isl_pw_aff *pwaff)
2794 isl_set *domain;
2795 isl_ast_build *build;
2796 isl_ast_expr *expr;
2798 if (pwaff->n < 1)
2799 isl_die(p->ctx, isl_error_unsupported,
2800 "cannot print empty isl_pw_aff in C format",
2801 return isl_printer_free(p));
2803 domain = isl_pw_aff_domain(isl_pw_aff_copy(pwaff));
2804 build = isl_ast_build_from_context(domain);
2805 expr = isl_ast_build_expr_from_pw_aff(build, isl_pw_aff_copy(pwaff));
2806 p = isl_printer_print_ast_expr(p, expr);
2807 isl_ast_expr_free(expr);
2808 isl_ast_build_free(build);
2810 return p;
2813 __isl_give isl_printer *isl_printer_print_aff(__isl_take isl_printer *p,
2814 __isl_keep isl_aff *aff)
2816 if (!p || !aff)
2817 goto error;
2819 if (p->output_format == ISL_FORMAT_ISL)
2820 return print_aff_isl(p, aff);
2821 else if (p->output_format == ISL_FORMAT_C)
2822 return print_aff_c(p, aff);
2823 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
2824 goto error);
2825 error:
2826 isl_printer_free(p);
2827 return NULL;
2830 __isl_give isl_printer *isl_printer_print_pw_aff(__isl_take isl_printer *p,
2831 __isl_keep isl_pw_aff *pwaff)
2833 if (!p || !pwaff)
2834 goto error;
2836 if (p->output_format == ISL_FORMAT_ISL)
2837 return print_pw_aff_isl(p, pwaff);
2838 else if (p->output_format == ISL_FORMAT_C)
2839 return print_pw_aff_c(p, pwaff);
2840 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
2841 goto error);
2842 error:
2843 isl_printer_free(p);
2844 return NULL;
2847 /* Print "pa" in a sequence of isl_pw_affs delimited by semicolons.
2848 * Each isl_pw_aff itself is also printed as semicolon delimited
2849 * sequence of pieces.
2850 * If data->first = 1, then this is the first in the sequence.
2851 * Update data->first to tell the next element that it is not the first.
2853 static isl_stat print_pw_aff_body_wrap(__isl_take isl_pw_aff *pa,
2854 void *user)
2856 struct isl_union_print_data *data;
2857 data = (struct isl_union_print_data *) user;
2859 if (!data->first)
2860 data->p = isl_printer_print_str(data->p, "; ");
2861 data->first = 0;
2863 data->p = print_pw_aff_body(data->p, pa);
2864 isl_pw_aff_free(pa);
2866 return data->p ? isl_stat_ok : isl_stat_error;
2869 /* Print the body of an isl_union_pw_aff, i.e., a semicolon delimited
2870 * sequence of affine expressions, each followed by constraints,
2871 * with the sequence enclosed in braces.
2873 static __isl_give isl_printer *print_union_pw_aff_body(
2874 __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa)
2876 struct isl_union_print_data data = { p, 1 };
2878 p = isl_printer_print_str(p, s_open_set[0]);
2879 data.p = p;
2880 if (isl_union_pw_aff_foreach_pw_aff(upa,
2881 &print_pw_aff_body_wrap, &data) < 0)
2882 data.p = isl_printer_free(p);
2883 p = data.p;
2884 p = isl_printer_print_str(p, s_close_set[0]);
2886 return p;
2889 /* Print the isl_union_pw_aff "upa" to "p" in isl format.
2891 * The individual isl_pw_affs are delimited by a semicolon.
2893 static __isl_give isl_printer *print_union_pw_aff_isl(
2894 __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa)
2896 struct isl_print_space_data data = { 0 };
2897 isl_space *space;
2899 space = isl_union_pw_aff_get_space(upa);
2900 p = print_param_tuple(p, space, &data);
2901 isl_space_free(space);
2902 p = print_union_pw_aff_body(p, upa);
2903 return p;
2906 /* Print the isl_union_pw_aff "upa" to "p".
2908 * We currently only support an isl format.
2910 __isl_give isl_printer *isl_printer_print_union_pw_aff(
2911 __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa)
2913 if (!p || !upa)
2914 return isl_printer_free(p);
2916 if (p->output_format == ISL_FORMAT_ISL)
2917 return print_union_pw_aff_isl(p, upa);
2918 isl_die(isl_printer_get_ctx(p), isl_error_unsupported,
2919 "unsupported output format", return isl_printer_free(p));
2922 /* Print dimension "pos" of data->space to "p".
2924 * data->user is assumed to be an isl_multi_aff.
2926 * If the current dimension is an output dimension, then print
2927 * the corresponding expression. Otherwise, print the name of the dimension.
2929 static __isl_give isl_printer *print_dim_ma(__isl_take isl_printer *p,
2930 struct isl_print_space_data *data, unsigned pos)
2932 isl_multi_aff *ma = data->user;
2934 if (data->type == isl_dim_out)
2935 p = print_aff_body(p, ma->u.p[pos]);
2936 else
2937 p = print_name(data->space, p, data->type, pos, data->latex);
2939 return p;
2942 static __isl_give isl_printer *print_multi_aff(__isl_take isl_printer *p,
2943 __isl_keep isl_multi_aff *maff)
2945 struct isl_print_space_data data = { 0 };
2947 data.print_dim = &print_dim_ma;
2948 data.user = maff;
2949 return isl_print_space(maff->space, p, 0, &data);
2952 static __isl_give isl_printer *print_multi_aff_isl(__isl_take isl_printer *p,
2953 __isl_keep isl_multi_aff *maff)
2955 struct isl_print_space_data data = { 0 };
2957 if (!maff)
2958 goto error;
2960 p = print_param_tuple(p, maff->space, &data);
2961 p = isl_printer_print_str(p, "{ ");
2962 p = print_multi_aff(p, maff);
2963 p = isl_printer_print_str(p, " }");
2964 return p;
2965 error:
2966 isl_printer_free(p);
2967 return NULL;
2970 __isl_give isl_printer *isl_printer_print_multi_aff(__isl_take isl_printer *p,
2971 __isl_keep isl_multi_aff *maff)
2973 if (!p || !maff)
2974 goto error;
2976 if (p->output_format == ISL_FORMAT_ISL)
2977 return print_multi_aff_isl(p, maff);
2978 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
2979 goto error);
2980 error:
2981 isl_printer_free(p);
2982 return NULL;
2985 static __isl_give isl_printer *print_pw_multi_aff_body(
2986 __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma)
2988 int i;
2990 if (!pma)
2991 goto error;
2993 for (i = 0; i < pma->n; ++i) {
2994 isl_space *space;
2996 if (i)
2997 p = isl_printer_print_str(p, "; ");
2998 p = print_multi_aff(p, pma->p[i].maff);
2999 space = isl_multi_aff_get_domain_space(pma->p[i].maff);
3000 p = print_disjuncts(set_to_map(pma->p[i].set), space, p, 0);
3001 isl_space_free(space);
3003 return p;
3004 error:
3005 isl_printer_free(p);
3006 return NULL;
3009 static __isl_give isl_printer *print_pw_multi_aff_isl(__isl_take isl_printer *p,
3010 __isl_keep isl_pw_multi_aff *pma)
3012 struct isl_print_space_data data = { 0 };
3014 if (!pma)
3015 goto error;
3017 p = print_param_tuple(p, pma->dim, &data);
3018 p = isl_printer_print_str(p, "{ ");
3019 p = print_pw_multi_aff_body(p, pma);
3020 p = isl_printer_print_str(p, " }");
3021 return p;
3022 error:
3023 isl_printer_free(p);
3024 return NULL;
3027 /* Print the unnamed, single-dimensional piecewise multi affine expression "pma"
3028 * to "p".
3030 static __isl_give isl_printer *print_unnamed_pw_multi_aff_c(
3031 __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma)
3033 int i;
3034 isl_space *space;
3036 space = isl_pw_multi_aff_get_domain_space(pma);
3037 for (i = 0; i < pma->n - 1; ++i) {
3038 p = isl_printer_print_str(p, "(");
3039 p = print_set_c(p, space, pma->p[i].set);
3040 p = isl_printer_print_str(p, ") ? (");
3041 p = print_aff_c(p, pma->p[i].maff->u.p[0]);
3042 p = isl_printer_print_str(p, ") : ");
3044 isl_space_free(space);
3046 return print_aff_c(p, pma->p[pma->n - 1].maff->u.p[0]);
3049 static __isl_give isl_printer *print_pw_multi_aff_c(__isl_take isl_printer *p,
3050 __isl_keep isl_pw_multi_aff *pma)
3052 int n;
3053 const char *name;
3055 if (!pma)
3056 goto error;
3057 if (pma->n < 1)
3058 isl_die(p->ctx, isl_error_unsupported,
3059 "cannot print empty isl_pw_multi_aff in C format",
3060 goto error);
3061 name = isl_pw_multi_aff_get_tuple_name(pma, isl_dim_out);
3062 if (!name && isl_pw_multi_aff_dim(pma, isl_dim_out) == 1)
3063 return print_unnamed_pw_multi_aff_c(p, pma);
3064 if (!name)
3065 isl_die(p->ctx, isl_error_unsupported,
3066 "cannot print unnamed isl_pw_multi_aff in C format",
3067 goto error);
3069 p = isl_printer_print_str(p, name);
3070 n = isl_pw_multi_aff_dim(pma, isl_dim_out);
3071 if (n != 0)
3072 isl_die(p->ctx, isl_error_unsupported,
3073 "not supported yet", goto error);
3075 return p;
3076 error:
3077 isl_printer_free(p);
3078 return NULL;
3081 __isl_give isl_printer *isl_printer_print_pw_multi_aff(
3082 __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma)
3084 if (!p || !pma)
3085 goto error;
3087 if (p->output_format == ISL_FORMAT_ISL)
3088 return print_pw_multi_aff_isl(p, pma);
3089 if (p->output_format == ISL_FORMAT_C)
3090 return print_pw_multi_aff_c(p, pma);
3091 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
3092 goto error);
3093 error:
3094 isl_printer_free(p);
3095 return NULL;
3098 static isl_stat print_pw_multi_aff_body_wrap(__isl_take isl_pw_multi_aff *pma,
3099 void *user)
3101 struct isl_union_print_data *data;
3102 data = (struct isl_union_print_data *) user;
3104 if (!data->first)
3105 data->p = isl_printer_print_str(data->p, "; ");
3106 data->first = 0;
3108 data->p = print_pw_multi_aff_body(data->p, pma);
3109 isl_pw_multi_aff_free(pma);
3111 return isl_stat_ok;
3114 static __isl_give isl_printer *print_union_pw_multi_aff_isl(
3115 __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma)
3117 struct isl_union_print_data data;
3118 struct isl_print_space_data space_data = { 0 };
3119 isl_space *space;
3121 space = isl_union_pw_multi_aff_get_space(upma);
3122 p = print_param_tuple(p, space, &space_data);
3123 isl_space_free(space);
3124 p = isl_printer_print_str(p, s_open_set[0]);
3125 data.p = p;
3126 data.first = 1;
3127 isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
3128 &print_pw_multi_aff_body_wrap, &data);
3129 p = data.p;
3130 p = isl_printer_print_str(p, s_close_set[0]);
3131 return p;
3134 __isl_give isl_printer *isl_printer_print_union_pw_multi_aff(
3135 __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma)
3137 if (!p || !upma)
3138 goto error;
3140 if (p->output_format == ISL_FORMAT_ISL)
3141 return print_union_pw_multi_aff_isl(p, upma);
3142 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
3143 goto error);
3144 error:
3145 isl_printer_free(p);
3146 return NULL;
3149 /* Print dimension "pos" of data->space to "p".
3151 * data->user is assumed to be an isl_multi_pw_aff.
3153 * If the current dimension is an output dimension, then print
3154 * the corresponding piecewise affine expression.
3155 * Otherwise, print the name of the dimension.
3157 static __isl_give isl_printer *print_dim_mpa(__isl_take isl_printer *p,
3158 struct isl_print_space_data *data, unsigned pos)
3160 int i;
3161 int need_parens;
3162 isl_multi_pw_aff *mpa = data->user;
3163 isl_pw_aff *pa;
3165 if (data->type != isl_dim_out)
3166 return print_name(data->space, p, data->type, pos, data->latex);
3168 pa = mpa->u.p[pos];
3169 if (pa->n == 0)
3170 return isl_printer_print_str(p, "(0 : false)");
3172 need_parens = pa->n != 1 || !isl_set_plain_is_universe(pa->p[0].set);
3173 if (need_parens)
3174 p = isl_printer_print_str(p, "(");
3175 for (i = 0; i < pa->n; ++i) {
3176 isl_space *space;
3178 if (i)
3179 p = isl_printer_print_str(p, "; ");
3180 p = print_aff_body(p, pa->p[i].aff);
3181 space = isl_aff_get_domain_space(pa->p[i].aff);
3182 p = print_disjuncts(pa->p[i].set, space, p, 0);
3183 isl_space_free(space);
3185 if (need_parens)
3186 p = isl_printer_print_str(p, ")");
3188 return p;
3191 /* Print "mpa" to "p" in isl format.
3193 * If "mpa" is zero-dimensional and has a non-trivial explicit domain,
3194 * then it is printed after the tuple of affine expressions.
3196 static __isl_give isl_printer *print_multi_pw_aff_isl(__isl_take isl_printer *p,
3197 __isl_keep isl_multi_pw_aff *mpa)
3199 struct isl_print_space_data data = { 0 };
3200 isl_bool has_domain;
3202 if (!mpa)
3203 return isl_printer_free(p);
3205 p = print_param_tuple(p, mpa->space, &data);
3206 p = isl_printer_print_str(p, "{ ");
3207 data.print_dim = &print_dim_mpa;
3208 data.user = mpa;
3209 p = isl_print_space(mpa->space, p, 0, &data);
3210 has_domain = isl_multi_pw_aff_has_non_trivial_domain(mpa);
3211 if (has_domain < 0)
3212 return isl_printer_free(p);
3213 if (has_domain) {
3214 isl_space *space;
3216 space = isl_space_domain(isl_space_copy(mpa->space));
3217 p = print_disjuncts_set(mpa->u.dom, space, p, 0);
3218 isl_space_free(space);
3220 p = isl_printer_print_str(p, " }");
3221 return p;
3224 __isl_give isl_printer *isl_printer_print_multi_pw_aff(
3225 __isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa)
3227 if (!p || !mpa)
3228 return isl_printer_free(p);
3230 if (p->output_format == ISL_FORMAT_ISL)
3231 return print_multi_pw_aff_isl(p, mpa);
3232 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
3233 return isl_printer_free(p));
3236 /* Print dimension "pos" of data->space to "p".
3238 * data->user is assumed to be an isl_multi_val.
3240 * If the current dimension is an output dimension, then print
3241 * the corresponding value. Otherwise, print the name of the dimension.
3243 static __isl_give isl_printer *print_dim_mv(__isl_take isl_printer *p,
3244 struct isl_print_space_data *data, unsigned pos)
3246 isl_multi_val *mv = data->user;
3248 if (data->type == isl_dim_out)
3249 return isl_printer_print_val(p, mv->u.p[pos]);
3250 else
3251 return print_name(data->space, p, data->type, pos, data->latex);
3254 /* Print the isl_multi_val "mv" to "p" in isl format.
3256 static __isl_give isl_printer *print_multi_val_isl(__isl_take isl_printer *p,
3257 __isl_keep isl_multi_val *mv)
3259 struct isl_print_space_data data = { 0 };
3261 if (!mv)
3262 return isl_printer_free(p);
3264 p = print_param_tuple(p, mv->space, &data);
3265 p = isl_printer_print_str(p, "{ ");
3266 data.print_dim = &print_dim_mv;
3267 data.user = mv;
3268 p = isl_print_space(mv->space, p, 0, &data);
3269 p = isl_printer_print_str(p, " }");
3270 return p;
3273 /* Print the isl_multi_val "mv" to "p".
3275 * Currently only supported in isl format.
3277 __isl_give isl_printer *isl_printer_print_multi_val(
3278 __isl_take isl_printer *p, __isl_keep isl_multi_val *mv)
3280 if (!p || !mv)
3281 return isl_printer_free(p);
3283 if (p->output_format == ISL_FORMAT_ISL)
3284 return print_multi_val_isl(p, mv);
3285 isl_die(p->ctx, isl_error_unsupported, "unsupported output format",
3286 return isl_printer_free(p));
3289 /* Print dimension "pos" of data->space to "p".
3291 * data->user is assumed to be an isl_multi_union_pw_aff.
3293 * The current dimension is necessarily a set dimension, so
3294 * we print the corresponding isl_union_pw_aff, including
3295 * the braces.
3297 static __isl_give isl_printer *print_union_pw_aff_dim(__isl_take isl_printer *p,
3298 struct isl_print_space_data *data, unsigned pos)
3300 isl_multi_union_pw_aff *mupa = data->user;
3301 isl_union_pw_aff *upa;
3303 upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, pos);
3304 p = print_union_pw_aff_body(p, upa);
3305 isl_union_pw_aff_free(upa);
3307 return p;
3310 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3312 * If "mupa" is zero-dimensional and has a non-trivial explicit domain,
3313 * then it is printed after the tuple of affine expressions.
3314 * In order to clarify that this domain belongs to the expression,
3315 * the tuple along with the domain are placed inside parentheses.
3316 * If "mupa" has any parameters, then the opening parenthesis
3317 * appears after the parameter declarations.
3319 static __isl_give isl_printer *print_multi_union_pw_aff_isl(
3320 __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa)
3322 struct isl_print_space_data data = { 0 };
3323 isl_bool has_domain;
3324 isl_space *space;
3326 if (!mupa)
3327 return isl_printer_free(p);
3328 has_domain = isl_multi_union_pw_aff_has_non_trivial_domain(mupa);
3329 if (has_domain < 0)
3330 return isl_printer_free(p);
3332 space = isl_multi_union_pw_aff_get_space(mupa);
3333 p = print_param_tuple(p, space, &data);
3335 if (has_domain)
3336 p = isl_printer_print_str(p, "(");
3338 data.print_dim = &print_union_pw_aff_dim;
3339 data.user = mupa;
3341 p = isl_print_space(space, p, 0, &data);
3342 isl_space_free(space);
3344 if (has_domain) {
3345 p = isl_printer_print_str(p, " : ");
3346 p = isl_printer_print_union_set_isl_body(p, mupa->u.dom);
3347 p = isl_printer_print_str(p, ")");
3350 return p;
3353 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3355 * We currently only support an isl format.
3357 __isl_give isl_printer *isl_printer_print_multi_union_pw_aff(
3358 __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa)
3360 if (!p || !mupa)
3361 return isl_printer_free(p);
3363 if (p->output_format == ISL_FORMAT_ISL)
3364 return print_multi_union_pw_aff_isl(p, mupa);
3365 isl_die(isl_printer_get_ctx(p), isl_error_unsupported,
3366 "unsupported output format", return isl_printer_free(p));