2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 * Copyright 2019 Cerebras Systems
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
14 * and Cerebras Systems, 175 S San Antonio Rd, Los Altos, CA, USA
19 #include <isl_ctx_private.h>
20 #include <isl_map_private.h>
23 #include <isl_polynomial_private.h>
24 #include <isl_printer_private.h>
25 #include <isl_space_private.h>
26 #include <isl_mat_private.h>
27 #include <isl_vec_private.h>
28 #include <isl/union_set.h>
29 #include <isl/union_map.h>
30 #include <isl/constraint.h>
31 #include <isl_local.h>
32 #include <isl_local_space_private.h>
33 #include <isl_aff_private.h>
34 #include <isl_id_private.h>
35 #include <isl_val_private.h>
36 #include <isl_constraint_private.h>
37 #include <isl/ast_build.h>
39 #include <isl_output_private.h>
41 #include <bset_to_bmap.c>
42 #include <set_to_map.c>
43 #include <uset_to_umap.c>
45 static const char *s_to
[2] = { " -> ", " \\to " };
46 static const char *s_and
[2] = { " and ", " \\wedge " };
47 static const char *s_or
[2] = { " or ", " \\vee " };
48 static const char *s_le
[2] = { "<=", "\\le" };
49 static const char *s_ge
[2] = { ">=", "\\ge" };
50 static const char *s_open_set
[2] = { "{ ", "\\{\\, " };
51 static const char *s_close_set
[2] = { " }", " \\,\\}" };
52 static const char *s_open_list
[2] = { "[", "(" };
53 static const char *s_close_list
[2] = { "]", ")" };
54 static const char *s_such_that
[2] = { " : ", " \\mid " };
55 static const char *s_open_exists
[2] = { "exists (", "\\exists \\, " };
56 static const char *s_close_exists
[2] = { ")", "" };
57 static const char *s_div_prefix
[2] = { "e", "\\alpha_" };
58 static const char *s_mod
[2] = { "mod", "\\bmod" };
59 static const char *s_param_prefix
[2] = { "p", "p_" };
60 static const char *s_input_prefix
[2] = { "i", "i_" };
61 static const char *s_output_prefix
[2] = { "o", "o_" };
63 static __isl_give isl_printer
*print_constraint_polylib(
64 struct isl_basic_map
*bmap
, int ineq
, int n
, __isl_take isl_printer
*p
)
67 isl_size n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
68 isl_size n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
69 isl_size nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
70 isl_int
*c
= ineq
? bmap
->ineq
[n
] : bmap
->eq
[n
];
72 if (n_in
< 0 || n_out
< 0 || nparam
< 0)
73 return isl_printer_free(p
);
75 p
= isl_printer_start_line(p
);
76 p
= isl_printer_print_int(p
, ineq
);
77 for (i
= 0; i
< n_out
; ++i
) {
78 p
= isl_printer_print_str(p
, " ");
79 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+n_in
+i
]);
81 for (i
= 0; i
< n_in
; ++i
) {
82 p
= isl_printer_print_str(p
, " ");
83 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+i
]);
85 for (i
= 0; i
< bmap
->n_div
; ++i
) {
86 p
= isl_printer_print_str(p
, " ");
87 p
= isl_printer_print_isl_int(p
, c
[1+nparam
+n_in
+n_out
+i
]);
89 for (i
= 0; i
< nparam
; ++i
) {
90 p
= isl_printer_print_str(p
, " ");
91 p
= isl_printer_print_isl_int(p
, c
[1+i
]);
93 p
= isl_printer_print_str(p
, " ");
94 p
= isl_printer_print_isl_int(p
, c
[0]);
95 p
= isl_printer_end_line(p
);
99 static __isl_give isl_printer
*print_constraints_polylib(
100 struct isl_basic_map
*bmap
, __isl_take isl_printer
*p
)
104 p
= isl_printer_set_isl_int_width(p
, 5);
106 for (i
= 0; i
< bmap
->n_eq
; ++i
)
107 p
= print_constraint_polylib(bmap
, 0, i
, p
);
108 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
109 p
= print_constraint_polylib(bmap
, 1, i
, p
);
114 static __isl_give isl_printer
*bset_print_constraints_polylib(
115 struct isl_basic_set
*bset
, __isl_take isl_printer
*p
)
117 return print_constraints_polylib(bset_to_bmap(bset
), p
);
120 static __isl_give isl_printer
*isl_basic_map_print_polylib(
121 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
, int ext
)
125 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
127 return isl_printer_free(p
);
128 p
= isl_printer_start_line(p
);
129 p
= isl_printer_print_int(p
, bmap
->n_eq
+ bmap
->n_ineq
);
130 p
= isl_printer_print_str(p
, " ");
131 p
= isl_printer_print_int(p
, 1 + total
+ 1);
133 isl_size n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
134 isl_size n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
135 isl_size n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
136 isl_size nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
138 if (n_in
< 0 || n_out
< 0 || n_div
< 0 || nparam
< 0)
139 return isl_printer_free(p
);
141 p
= isl_printer_print_str(p
, " ");
142 p
= isl_printer_print_int(p
, n_out
);
143 p
= isl_printer_print_str(p
, " ");
144 p
= isl_printer_print_int(p
, n_in
);
145 p
= isl_printer_print_str(p
, " ");
146 p
= isl_printer_print_int(p
, n_div
);
147 p
= isl_printer_print_str(p
, " ");
148 p
= isl_printer_print_int(p
, nparam
);
150 p
= isl_printer_end_line(p
);
151 return print_constraints_polylib(bmap
, p
);
154 static __isl_give isl_printer
*isl_basic_set_print_polylib(
155 __isl_keep isl_basic_set
*bset
, __isl_take isl_printer
*p
, int ext
)
157 return isl_basic_map_print_polylib(bset_to_bmap(bset
), p
, ext
);
160 static __isl_give isl_printer
*isl_map_print_polylib(__isl_keep isl_map
*map
,
161 __isl_take isl_printer
*p
, int ext
)
165 p
= isl_printer_start_line(p
);
166 p
= isl_printer_print_int(p
, map
->n
);
167 p
= isl_printer_end_line(p
);
168 for (i
= 0; i
< map
->n
; ++i
) {
169 p
= isl_printer_start_line(p
);
170 p
= isl_printer_end_line(p
);
171 p
= isl_basic_map_print_polylib(map
->p
[i
], p
, ext
);
176 static __isl_give isl_printer
*isl_set_print_polylib(__isl_keep isl_set
*set
,
177 __isl_take isl_printer
*p
, int ext
)
179 return isl_map_print_polylib(set_to_map(set
), p
, ext
);
182 static isl_size
count_same_name(__isl_keep isl_space
*space
,
183 enum isl_dim_type type
, unsigned pos
, const char *name
)
190 for (t
= isl_dim_param
; t
<= type
&& t
<= isl_dim_out
; ++t
) {
191 s
= t
== type
? pos
: isl_space_dim(space
, t
);
193 return isl_size_error
;
194 for (p
= 0; p
< s
; ++p
) {
195 const char *n
= isl_space_get_dim_name(space
, t
, p
);
196 if (n
&& !strcmp(n
, name
))
203 /* Print the name of the variable of type "type" and position "pos"
206 static __isl_give isl_printer
*print_name(__isl_keep isl_space
*space
,
207 __isl_take isl_printer
*p
, enum isl_dim_type type
, unsigned pos
,
214 name
= type
== isl_dim_div
? NULL
215 : isl_space_get_dim_name(space
, type
, pos
);
219 if (type
== isl_dim_param
)
220 prefix
= s_param_prefix
[latex
];
221 else if (type
== isl_dim_div
)
222 prefix
= s_div_prefix
[latex
];
223 else if (isl_space_is_set(space
) || type
== isl_dim_in
)
224 prefix
= s_input_prefix
[latex
];
226 prefix
= s_output_prefix
[latex
];
227 snprintf(buffer
, sizeof(buffer
), "%s%d", prefix
, pos
);
230 primes
= count_same_name(space
, name
== buffer
? isl_dim_div
: type
,
233 return isl_printer_free(p
);
234 p
= isl_printer_print_str(p
, name
);
236 p
= isl_printer_print_str(p
, "'");
240 static isl_stat
pos2type(__isl_keep isl_space
*space
,
241 enum isl_dim_type
*type
, unsigned *pos
)
243 isl_size n_in
= isl_space_dim(space
, isl_dim_in
);
244 isl_size n_out
= isl_space_dim(space
, isl_dim_out
);
245 isl_size nparam
= isl_space_dim(space
, isl_dim_param
);
247 if (n_in
< 0 || n_out
< 0 || nparam
< 0)
248 return isl_stat_error
;
250 if (*pos
< 1 + nparam
) {
251 *type
= isl_dim_param
;
253 } else if (*pos
< 1 + nparam
+ n_in
) {
256 } else if (*pos
< 1 + nparam
+ n_in
+ n_out
) {
258 *pos
-= 1 + nparam
+ n_in
;
261 *pos
-= 1 + nparam
+ n_in
+ n_out
;
267 /* Can the div expression of the integer division at position "row" of "div"
269 * In particular, are the div expressions available and does the selected
270 * variable have a known explicit representation?
271 * Furthermore, the Omega format does not allow any div expressions
274 static isl_bool
can_print_div_expr(__isl_keep isl_printer
*p
,
275 __isl_keep isl_mat
*div
, int pos
)
277 if (p
->output_format
== ISL_FORMAT_OMEGA
)
278 return isl_bool_false
;
280 return isl_bool_false
;
281 return isl_bool_not(isl_local_div_is_marked_unknown(div
, pos
));
284 static __isl_give isl_printer
*print_div(__isl_keep isl_space
*space
,
285 __isl_keep isl_mat
*div
, int pos
, __isl_take isl_printer
*p
);
287 static __isl_give isl_printer
*print_term(__isl_keep isl_space
*space
,
288 __isl_keep isl_mat
*div
,
289 isl_int c
, unsigned pos
, __isl_take isl_printer
*p
, int latex
)
291 enum isl_dim_type type
;
295 return isl_printer_free(p
);
298 return isl_printer_print_isl_int(p
, c
);
300 if (pos2type(space
, &type
, &pos
) < 0)
301 return isl_printer_free(p
);
302 print_div_def
= type
== isl_dim_div
&& can_print_div_expr(p
, div
, pos
);
304 if (isl_int_is_one(c
))
306 else if (isl_int_is_negone(c
))
307 p
= isl_printer_print_str(p
, "-");
309 p
= isl_printer_print_isl_int(p
, c
);
310 if (p
->output_format
== ISL_FORMAT_C
|| print_div_def
)
311 p
= isl_printer_print_str(p
, "*");
314 p
= print_div(space
, div
, pos
, p
);
316 p
= print_name(space
, p
, type
, pos
, latex
);
320 static __isl_give isl_printer
*print_affine_of_len(__isl_keep isl_space
*space
,
321 __isl_keep isl_mat
*div
,
322 __isl_take isl_printer
*p
, isl_int
*c
, int len
)
327 for (i
= 0, first
= 1; i
< len
; ++i
) {
329 if (isl_int_is_zero(c
[i
]))
332 if (isl_int_is_neg(c
[i
])) {
334 isl_int_neg(c
[i
], c
[i
]);
335 p
= isl_printer_print_str(p
, " - ");
337 p
= isl_printer_print_str(p
, " + ");
340 p
= print_term(space
, div
, c
[i
], i
, p
, 0);
342 isl_int_neg(c
[i
], c
[i
]);
345 p
= isl_printer_print_str(p
, "0");
349 /* Print an affine expression "c"
350 * to "p", with the variable names taken from "space" and
351 * the integer division definitions taken from "div".
353 static __isl_give isl_printer
*print_affine(__isl_take isl_printer
*p
,
354 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, isl_int
*c
)
356 isl_size n_div
, total
;
359 total
= isl_space_dim(space
, isl_dim_all
);
360 n_div
= isl_mat_rows(div
);
361 if (total
< 0 || n_div
< 0)
362 return isl_printer_free(p
);
363 len
= 1 + total
+ n_div
;
364 return print_affine_of_len(space
, div
, p
, c
, len
);
367 /* offset is the offset of local_space inside data->type of data->space.
369 static __isl_give isl_printer
*print_nested_var_list(__isl_take isl_printer
*p
,
370 __isl_keep isl_space
*local_space
, enum isl_dim_type local_type
,
371 struct isl_print_space_data
*data
, int offset
)
376 if (data
->space
!= local_space
&& local_type
== isl_dim_out
)
377 offset
+= local_space
->n_in
;
379 dim
= isl_space_dim(local_space
, local_type
);
381 return isl_printer_free(p
);
382 for (i
= 0; i
< dim
; ++i
) {
384 p
= isl_printer_print_str(p
, ", ");
386 p
= data
->print_dim(p
, data
, offset
+ i
);
388 p
= print_name(data
->space
, p
, data
->type
, offset
+ i
,
394 static __isl_give isl_printer
*print_var_list(__isl_take isl_printer
*p
,
395 __isl_keep isl_space
*space
, enum isl_dim_type type
)
397 struct isl_print_space_data data
= { .space
= space
, .type
= type
};
399 return print_nested_var_list(p
, space
, type
, &data
, 0);
402 static __isl_give isl_printer
*print_nested_map_dim(__isl_take isl_printer
*p
,
403 __isl_keep isl_space
*local_dim
,
404 struct isl_print_space_data
*data
, int offset
);
406 static __isl_give isl_printer
*print_nested_tuple(__isl_take isl_printer
*p
,
407 __isl_keep isl_space
*local_space
, enum isl_dim_type local_type
,
408 struct isl_print_space_data
*data
, int offset
)
410 const char *name
= NULL
;
411 isl_size n
= isl_space_dim(local_space
, local_type
);
414 return isl_printer_free(p
);
415 if ((local_type
== isl_dim_in
|| local_type
== isl_dim_out
)) {
416 name
= isl_space_get_tuple_name(local_space
, local_type
);
419 p
= isl_printer_print_str(p
, "\\mathrm{");
420 p
= isl_printer_print_str(p
, name
);
422 p
= isl_printer_print_str(p
, "}");
425 if (!data
->latex
|| n
!= 1 || name
)
426 p
= isl_printer_print_str(p
, s_open_list
[data
->latex
]);
427 if ((local_type
== isl_dim_in
|| local_type
== isl_dim_out
) &&
428 local_space
->nested
[local_type
- isl_dim_in
]) {
429 if (data
->space
!= local_space
&& local_type
== isl_dim_out
)
430 offset
+= local_space
->n_in
;
431 p
= print_nested_map_dim(p
,
432 local_space
->nested
[local_type
- isl_dim_in
],
435 p
= print_nested_var_list(p
, local_space
, local_type
, data
,
437 if (!data
->latex
|| n
!= 1 || name
)
438 p
= isl_printer_print_str(p
, s_close_list
[data
->latex
]);
442 static __isl_give isl_printer
*print_tuple(__isl_keep isl_space
*space
,
443 __isl_take isl_printer
*p
, enum isl_dim_type type
,
444 struct isl_print_space_data
*data
)
448 return print_nested_tuple(p
, space
, type
, data
, 0);
451 static __isl_give isl_printer
*print_nested_map_dim(__isl_take isl_printer
*p
,
452 __isl_keep isl_space
*local_dim
,
453 struct isl_print_space_data
*data
, int offset
)
455 p
= print_nested_tuple(p
, local_dim
, isl_dim_in
, data
, offset
);
456 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
457 p
= print_nested_tuple(p
, local_dim
, isl_dim_out
, data
, offset
);
462 __isl_give isl_printer
*isl_print_space(__isl_keep isl_space
*space
,
463 __isl_take isl_printer
*p
, int rational
,
464 struct isl_print_space_data
*data
)
466 if (rational
&& !data
->latex
)
467 p
= isl_printer_print_str(p
, "rat: ");
468 if (isl_space_is_params(space
))
470 else if (isl_space_is_set(space
))
471 p
= print_tuple(space
, p
, isl_dim_set
, data
);
473 p
= print_tuple(space
, p
, isl_dim_in
, data
);
474 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
475 p
= print_tuple(space
, p
, isl_dim_out
, data
);
481 static __isl_give isl_printer
*print_omega_parameters(
482 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
)
484 isl_size nparam
= isl_space_dim(space
, isl_dim_param
);
487 return isl_printer_free(p
);
491 p
= isl_printer_start_line(p
);
492 p
= isl_printer_print_str(p
, "symbolic ");
493 p
= print_var_list(p
, space
, isl_dim_param
);
494 p
= isl_printer_print_str(p
, ";");
495 p
= isl_printer_end_line(p
);
499 /* Does the inequality constraint following "i" in "bmap"
500 * have an opposite value for the same last coefficient?
501 * "last" is the position of the last coefficient of inequality "i".
502 * If the next constraint is a div constraint, then it is ignored
503 * since div constraints are not printed.
505 static isl_bool
next_is_opposite(__isl_keep isl_basic_map
*bmap
, int i
,
509 isl_size total
= isl_basic_map_dim(bmap
, isl_dim_all
);
510 unsigned o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
513 return isl_bool_error
;
514 if (i
+ 1 >= bmap
->n_ineq
)
515 return isl_bool_false
;
516 if (isl_seq_last_non_zero(bmap
->ineq
[i
+ 1], 1 + total
) != last
)
517 return isl_bool_false
;
520 is_div
= isl_basic_map_is_div_constraint(bmap
,
521 bmap
->ineq
[i
+ 1], last
- o_div
);
523 return isl_bool_error
;
525 return isl_bool_false
;
527 r
= isl_int_abs_eq(bmap
->ineq
[i
][last
], bmap
->ineq
[i
+ 1][last
]) &&
528 !isl_int_eq(bmap
->ineq
[i
][last
], bmap
->ineq
[i
+ 1][last
]);
529 return isl_bool_ok(r
);
532 /* Return a string representation of the operator used when
533 * printing a constraint where the LHS is greater than or equal to the LHS
534 * (sign > 0) or smaller than or equal to the LHS (sign < 0).
535 * If "strict" is set, then return the strict version of the comparison
538 static const char *constraint_op(int sign
, int strict
, int latex
)
541 return sign
< 0 ? "<" : ">";
548 /* Print one side of a constraint "c" to "p", with
549 * the variable names taken from "space" and the integer division definitions
551 * "last" is the position of the last non-zero coefficient.
552 * Let c' be the result of zeroing out this coefficient, then
553 * the partial constraint
559 static __isl_give isl_printer
*print_half_constraint(__isl_take isl_printer
*p
,
560 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
561 isl_int
*c
, int last
, const char *op
, int latex
)
563 isl_int_set_si(c
[last
], 0);
564 p
= print_affine(p
, space
, div
, c
);
566 p
= isl_printer_print_str(p
, " ");
567 p
= isl_printer_print_str(p
, op
);
568 p
= isl_printer_print_str(p
, " ");
573 /* Print a constraint "c" to "p", with the variable names
574 * taken from "space" and the integer division definitions taken from "div".
575 * "last" is the position of the last non-zero coefficient, which is
576 * moreover assumed to be negative.
577 * Let c' be the result of zeroing out this coefficient, then
578 * the constraint is printed in the form
582 static __isl_give isl_printer
*print_constraint(__isl_take isl_printer
*p
,
583 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
584 isl_int
*c
, int last
, const char *op
, int latex
)
586 isl_int_abs(c
[last
], c
[last
]);
588 p
= print_term(space
, div
, c
[last
], last
, p
, latex
);
590 p
= isl_printer_print_str(p
, " ");
591 p
= isl_printer_print_str(p
, op
);
592 p
= isl_printer_print_str(p
, " ");
594 isl_int_set_si(c
[last
], 0);
595 p
= print_affine(p
, space
, div
, c
);
600 /* Given an integer division
604 * at position "pos" in "div", print the corresponding modulo expression
608 * to "p". The variable names are taken from "space", while any
609 * nested integer division definitions are taken from "div".
611 static __isl_give isl_printer
*print_mod(__isl_take isl_printer
*p
,
612 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int pos
,
616 return isl_printer_free(p
);
618 p
= isl_printer_print_str(p
, "(");
619 p
= print_affine_of_len(space
, div
, p
,
620 div
->row
[pos
] + 1, div
->n_col
- 1);
621 p
= isl_printer_print_str(p
, ") ");
622 p
= isl_printer_print_str(p
, s_mod
[latex
]);
623 p
= isl_printer_print_str(p
, " ");
624 p
= isl_printer_print_isl_int(p
, div
->row
[pos
][0]);
628 /* Given an equality constraint with a non-zero coefficient "c"
629 * in position "pos", is this term of the form
634 * Return the position of the corresponding integer division if so.
635 * Return the number of integer divisions if not.
636 * Return isl_size_error on error.
638 * Modulo constraints are currently not printed in C format.
639 * Other than that, "pos" needs to correspond to an integer division
640 * with explicit representation and "c" needs to be a multiple
641 * of the denominator of the integer division.
643 static isl_size
print_as_modulo_pos(__isl_keep isl_printer
*p
,
644 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, unsigned pos
,
649 enum isl_dim_type type
;
651 n_div
= isl_mat_rows(div
);
652 if (!p
|| !space
|| n_div
< 0)
653 return isl_size_error
;
654 if (p
->output_format
== ISL_FORMAT_C
)
656 if (pos2type(space
, &type
, &pos
) < 0)
657 return isl_size_error
;
658 if (type
!= isl_dim_div
)
660 can_print
= can_print_div_expr(p
, div
, pos
);
662 return isl_size_error
;
665 if (!isl_int_is_divisible_by(c
, div
->row
[pos
][0]))
670 /* Print equality constraint "c" to "p" as a modulo constraint,
671 * with the variable names taken from "space" and
672 * the integer division definitions taken from "div".
673 * "last" is the position of the last non-zero coefficient, which is
674 * moreover assumed to be negative and a multiple of the denominator
675 * of the corresponding integer division. "div_pos" is the corresponding
676 * position in the sequence of integer divisions.
678 * The equality is of the form
680 * f - a m floor(g/m) = 0.
684 * a (g mod m) = -f + a g
686 static __isl_give isl_printer
*print_eq_mod_constraint(
687 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
,
688 __isl_keep isl_mat
*div
, unsigned div_pos
,
689 isl_int
*c
, int last
, int latex
)
694 ctx
= isl_printer_get_ctx(p
);
695 isl_int_divexact(c
[last
], c
[last
], div
->row
[div_pos
][0]);
696 isl_int_abs(c
[last
], c
[last
]);
697 multiple
= !isl_int_is_one(c
[last
]);
699 p
= isl_printer_print_isl_int(p
, c
[last
]);
700 p
= isl_printer_print_str(p
, "*(");
702 p
= print_mod(p
, space
, div
, div_pos
, latex
);
704 p
= isl_printer_print_str(p
, ")");
705 p
= isl_printer_print_str(p
, " = ");
706 isl_seq_combine(c
, ctx
->negone
, c
,
707 c
[last
], div
->row
[div_pos
] + 1, last
);
708 isl_int_set_si(c
[last
], 0);
709 p
= print_affine(p
, space
, div
, c
);
713 /* Print equality constraint "c" to "p", with the variable names
714 * taken from "space" and the integer division definitions taken from "div".
715 * "last" is the position of the last non-zero coefficient, which is
716 * moreover assumed to be negative.
718 * If possible, print the equality constraint as a modulo constraint.
720 static __isl_give isl_printer
*print_eq_constraint(__isl_take isl_printer
*p
,
721 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, isl_int
*c
,
727 n_div
= isl_mat_rows(div
);
728 div_pos
= print_as_modulo_pos(p
, space
, div
, last
, c
[last
]);
729 if (n_div
< 0 || div_pos
< 0)
730 return isl_printer_free(p
);
732 return print_eq_mod_constraint(p
, space
, div
, div_pos
,
734 return print_constraint(p
, space
, div
, c
, last
, "=", latex
);
737 /* Print the constraints of "bmap" to "p".
738 * The names of the variables are taken from "space" and
739 * the integer division definitions are taken from "div".
740 * Div constraints are only printed in "dump" mode.
741 * The constraints are sorted prior to printing (except in "dump" mode).
743 * If x is the last variable with a non-zero coefficient,
752 * while an upper bound
760 * If the next constraint has an opposite sign for the same last coefficient,
761 * then it is printed as
769 * instead. In fact, the "a x" part is not printed explicitly, but
770 * reused from the next constraint, which is therefore treated as
771 * a first constraint in the conjunction.
773 * If the constant term of "f" is -1, then "f" is replaced by "f + 1" and
774 * the comparison operator is replaced by the strict variant.
775 * Essentially, ">= 1" is replaced by "> 0".
777 static __isl_give isl_printer
*print_constraints(__isl_keep isl_basic_map
*bmap
,
778 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
779 __isl_take isl_printer
*p
, int latex
)
783 int rational
= ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
784 isl_size total
= isl_basic_map_dim(bmap
, isl_dim_all
);
785 unsigned o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
790 return isl_printer_free(p
);
791 bmap
= isl_basic_map_copy(bmap
);
794 bmap
= isl_basic_map_sort_constraints(bmap
);
798 c
= isl_vec_alloc(bmap
->ctx
, 1 + total
);
802 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
803 int l
= isl_seq_last_non_zero(bmap
->eq
[i
], 1 + total
);
805 if (i
!= bmap
->n_eq
- 1)
806 p
= isl_printer_print_str(p
, s_and
[latex
]);
807 p
= isl_printer_print_str(p
, "0 = 0");
811 p
= isl_printer_print_str(p
, s_and
[latex
]);
812 if (isl_int_is_neg(bmap
->eq
[i
][l
]))
813 isl_seq_cpy(c
->el
, bmap
->eq
[i
], 1 + total
);
815 isl_seq_neg(c
->el
, bmap
->eq
[i
], 1 + total
);
816 p
= print_eq_constraint(p
, space
, div
, c
->el
, l
, latex
);
819 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
821 int l
= isl_seq_last_non_zero(bmap
->ineq
[i
], 1 + total
);
827 if (!dump
&& l
>= o_div
&&
828 can_print_div_expr(p
, div
, l
- o_div
)) {
830 is_div
= isl_basic_map_is_div_constraint(bmap
,
831 bmap
->ineq
[i
], l
- o_div
);
838 p
= isl_printer_print_str(p
, s_and
[latex
]);
839 s
= isl_int_sgn(bmap
->ineq
[i
][l
]);
840 strict
= !rational
&& isl_int_is_negone(bmap
->ineq
[i
][0]);
842 isl_seq_cpy(c
->el
, bmap
->ineq
[i
], 1 + total
);
844 isl_seq_neg(c
->el
, bmap
->ineq
[i
], 1 + total
);
846 isl_int_set_si(c
->el
[0], 0);
847 combine
= dump
? isl_bool_false
: next_is_opposite(bmap
, i
, l
);
851 op
= constraint_op(-s
, strict
, latex
);
852 p
= print_half_constraint(p
, space
, div
, c
->el
, l
,
856 op
= constraint_op(s
, strict
, latex
);
857 p
= print_constraint(p
, space
, div
, c
->el
, l
,
863 isl_basic_map_free(bmap
);
868 isl_basic_map_free(bmap
);
874 static __isl_give isl_printer
*print_div(__isl_keep isl_space
*space
,
875 __isl_keep isl_mat
*div
, int pos
, __isl_take isl_printer
*p
)
880 return isl_printer_free(p
);
882 c
= p
->output_format
== ISL_FORMAT_C
;
883 p
= isl_printer_print_str(p
, c
? "floord(" : "floor((");
884 p
= print_affine_of_len(space
, div
, p
,
885 div
->row
[pos
] + 1, div
->n_col
- 1);
886 p
= isl_printer_print_str(p
, c
? ", " : ")/");
887 p
= isl_printer_print_isl_int(p
, div
->row
[pos
][0]);
888 p
= isl_printer_print_str(p
, ")");
892 /* Print a comma separated list of div names, except those that have
893 * a definition that can be printed.
894 * If "print_defined_divs" is set, then those div names are printed
895 * as well, along with their definitions.
897 static __isl_give isl_printer
*print_div_list(__isl_take isl_printer
*p
,
898 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int latex
,
899 int print_defined_divs
)
905 n_div
= isl_mat_rows(div
);
906 if (!p
|| !space
|| n_div
< 0)
907 return isl_printer_free(p
);
909 for (i
= 0; i
< n_div
; ++i
) {
910 if (!print_defined_divs
&& can_print_div_expr(p
, div
, i
))
913 p
= isl_printer_print_str(p
, ", ");
914 p
= print_name(space
, p
, isl_dim_div
, i
, latex
);
916 if (!can_print_div_expr(p
, div
, i
))
918 p
= isl_printer_print_str(p
, " = ");
919 p
= print_div(space
, div
, i
, p
);
925 /* Does printing an object with local variables described by "div"
926 * require an "exists" clause?
927 * That is, are there any local variables without an explicit representation?
928 * An exists clause is also needed in "dump" mode because
929 * explicit div representations are not printed inline in that case.
931 static isl_bool
need_exists(__isl_keep isl_printer
*p
, __isl_keep isl_mat
*div
)
936 n
= isl_mat_rows(div
);
938 return isl_bool_error
;
940 return isl_bool_false
;
942 return isl_bool_true
;
943 for (i
= 0; i
< n
; ++i
)
944 if (!can_print_div_expr(p
, div
, i
))
945 return isl_bool_true
;
946 return isl_bool_false
;
949 /* Print the start of an exists clause, i.e.,
953 * In dump mode, local variables with an explicit definition are printed
954 * as well because they will not be printed inline.
956 static __isl_give isl_printer
*open_exists(__isl_take isl_printer
*p
,
957 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int latex
)
965 p
= isl_printer_print_str(p
, s_open_exists
[latex
]);
966 p
= print_div_list(p
, space
, div
, latex
, dump
);
967 p
= isl_printer_print_str(p
, ": ");
972 /* Remove the explicit representations of all local variables in "div".
974 static __isl_give isl_mat
*mark_all_unknown(__isl_take isl_mat
*div
)
979 n_div
= isl_mat_rows(div
);
981 return isl_mat_free(div
);
983 for (i
= 0; i
< n_div
; ++i
)
984 div
= isl_mat_set_element_si(div
, i
, 0, 0);
988 /* Print the constraints of "bmap" to "p".
989 * The names of the variables are taken from "space".
990 * "latex" is set if the constraints should be printed in LaTeX format.
991 * Do not print inline explicit div representations in "dump" mode.
993 static __isl_give isl_printer
*print_disjunct(__isl_keep isl_basic_map
*bmap
,
994 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1003 div
= isl_basic_map_get_divs(bmap
);
1004 exists
= need_exists(p
, div
);
1005 if (exists
>= 0 && exists
)
1006 p
= open_exists(p
, space
, div
, latex
);
1009 div
= mark_all_unknown(div
);
1010 p
= print_constraints(bmap
, space
, div
, p
, latex
);
1013 if (exists
>= 0 && exists
)
1014 p
= isl_printer_print_str(p
, s_close_exists
[latex
]);
1018 /* Print a colon followed by the constraints of "bmap"
1019 * to "p", provided there are any constraints.
1020 * The names of the variables are taken from "space".
1021 * "latex" is set if the constraints should be printed in LaTeX format.
1023 static __isl_give isl_printer
*print_optional_disjunct(
1024 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_space
*space
,
1025 __isl_take isl_printer
*p
, int latex
)
1027 if (isl_basic_map_plain_is_universe(bmap
))
1030 p
= isl_printer_print_str(p
, ": ");
1031 p
= print_disjunct(bmap
, space
, p
, latex
);
1036 static __isl_give isl_printer
*basic_map_print_omega(
1037 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
)
1039 p
= isl_printer_print_str(p
, "{ [");
1040 p
= print_var_list(p
, bmap
->dim
, isl_dim_in
);
1041 p
= isl_printer_print_str(p
, "] -> [");
1042 p
= print_var_list(p
, bmap
->dim
, isl_dim_out
);
1043 p
= isl_printer_print_str(p
, "] ");
1044 p
= print_optional_disjunct(bmap
, bmap
->dim
, p
, 0);
1045 p
= isl_printer_print_str(p
, " }");
1049 static __isl_give isl_printer
*basic_set_print_omega(
1050 __isl_keep isl_basic_set
*bset
, __isl_take isl_printer
*p
)
1052 p
= isl_printer_print_str(p
, "{ [");
1053 p
= print_var_list(p
, bset
->dim
, isl_dim_set
);
1054 p
= isl_printer_print_str(p
, "] ");
1055 p
= print_optional_disjunct(bset
, bset
->dim
, p
, 0);
1056 p
= isl_printer_print_str(p
, " }");
1060 static __isl_give isl_printer
*isl_map_print_omega(__isl_keep isl_map
*map
,
1061 __isl_take isl_printer
*p
)
1065 for (i
= 0; i
< map
->n
; ++i
) {
1067 p
= isl_printer_print_str(p
, " union ");
1068 p
= basic_map_print_omega(map
->p
[i
], p
);
1073 static __isl_give isl_printer
*isl_set_print_omega(__isl_keep isl_set
*set
,
1074 __isl_take isl_printer
*p
)
1078 for (i
= 0; i
< set
->n
; ++i
) {
1080 p
= isl_printer_print_str(p
, " union ");
1081 p
= basic_set_print_omega(set
->p
[i
], p
);
1086 /* Print the list of parameters in "space", followed by an arrow, to "p",
1087 * if there are any parameters.
1089 static __isl_give isl_printer
*print_param_tuple(__isl_take isl_printer
*p
,
1090 __isl_keep isl_space
*space
, struct isl_print_space_data
*data
)
1094 nparam
= isl_space_dim(space
, isl_dim_param
);
1095 if (!p
|| nparam
< 0)
1096 return isl_printer_free(p
);
1100 p
= print_tuple(space
, p
, isl_dim_param
, data
);
1101 p
= isl_printer_print_str(p
, s_to
[data
->latex
]);
1106 static __isl_give isl_printer
*isl_basic_map_print_isl(
1107 __isl_keep isl_basic_map
*bmap
, __isl_take isl_printer
*p
,
1110 struct isl_print_space_data data
= { .latex
= latex
};
1111 int rational
= ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
1113 p
= print_param_tuple(p
, bmap
->dim
, &data
);
1114 p
= isl_printer_print_str(p
, "{ ");
1115 p
= isl_print_space(bmap
->dim
, p
, rational
, &data
);
1116 p
= isl_printer_print_str(p
, " : ");
1117 p
= print_disjunct(bmap
, bmap
->dim
, p
, latex
);
1118 p
= isl_printer_print_str(p
, " }");
1122 /* Print the disjuncts of a map (or set) "map" to "p".
1123 * The names of the variables are taken from "space".
1124 * "latex" is set if the constraints should be printed in LaTeX format.
1126 static __isl_give isl_printer
*print_disjuncts_core(__isl_keep isl_map
*map
,
1127 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1132 p
= isl_printer_print_str(p
, "false");
1133 for (i
= 0; i
< map
->n
; ++i
) {
1135 p
= isl_printer_print_str(p
, s_or
[latex
]);
1136 if (map
->n
> 1 && map
->p
[i
]->n_eq
+ map
->p
[i
]->n_ineq
> 1)
1137 p
= isl_printer_print_str(p
, "(");
1138 p
= print_disjunct(map
->p
[i
], space
, p
, latex
);
1139 if (map
->n
> 1 && map
->p
[i
]->n_eq
+ map
->p
[i
]->n_ineq
> 1)
1140 p
= isl_printer_print_str(p
, ")");
1145 /* Print the disjuncts of a map (or set) "map" to "p".
1146 * The names of the variables are taken from "space".
1147 * "hull" describes constraints shared by all disjuncts of "map".
1148 * "latex" is set if the constraints should be printed in LaTeX format.
1150 * Print the disjuncts as a conjunction of "hull" and
1151 * the result of removing the constraints of "hull" from "map".
1152 * If this result turns out to be the universe, then simply print "hull".
1154 static __isl_give isl_printer
*print_disjuncts_in_hull(__isl_keep isl_map
*map
,
1155 __isl_keep isl_space
*space
, __isl_take isl_basic_map
*hull
,
1156 __isl_take isl_printer
*p
, int latex
)
1158 isl_bool is_universe
;
1160 p
= print_disjunct(hull
, space
, p
, latex
);
1161 map
= isl_map_plain_gist_basic_map(isl_map_copy(map
), hull
);
1162 is_universe
= isl_map_plain_is_universe(map
);
1163 if (is_universe
< 0)
1166 p
= isl_printer_print_str(p
, s_and
[latex
]);
1167 p
= isl_printer_print_str(p
, "(");
1168 p
= print_disjuncts_core(map
, space
, p
, latex
);
1169 p
= isl_printer_print_str(p
, ")");
1176 isl_printer_free(p
);
1180 /* Print the disjuncts of a map (or set) "map" to "p".
1181 * The names of the variables are taken from "space".
1182 * "latex" is set if the constraints should be printed in LaTeX format.
1184 * If there are at least two disjuncts and "dump" mode is not turned out,
1185 * check for any shared constraints among all disjuncts.
1186 * If there are any, then print them separately in print_disjuncts_in_hull.
1188 static __isl_give isl_printer
*print_disjuncts(__isl_keep isl_map
*map
,
1189 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1191 if (isl_map_plain_is_universe(map
))
1194 p
= isl_printer_print_str(p
, s_such_that
[latex
]);
1198 if (!p
->dump
&& map
->n
>= 2) {
1199 isl_basic_map
*hull
;
1200 isl_bool is_universe
;
1202 hull
= isl_map_plain_unshifted_simple_hull(isl_map_copy(map
));
1203 is_universe
= isl_basic_map_plain_is_universe(hull
);
1204 if (is_universe
< 0)
1205 p
= isl_printer_free(p
);
1206 else if (!is_universe
)
1207 return print_disjuncts_in_hull(map
, space
, hull
,
1209 isl_basic_map_free(hull
);
1212 return print_disjuncts_core(map
, space
, p
, latex
);
1215 /* Print the disjuncts of a map (or set).
1216 * The names of the variables are taken from "space".
1217 * "latex" is set if the constraints should be printed in LaTeX format.
1219 * If the map turns out to be a universal parameter domain, then
1220 * we need to print the colon. Otherwise, the output looks identical
1223 static __isl_give isl_printer
*print_disjuncts_map(__isl_keep isl_map
*map
,
1224 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1226 if (isl_map_plain_is_universe(map
) && isl_space_is_params(map
->dim
))
1227 return isl_printer_print_str(p
, s_such_that
[latex
]);
1229 return print_disjuncts(map
, space
, p
, latex
);
1232 /* Print the disjuncts of a set.
1233 * The names of the variables are taken from "space".
1234 * "latex" is set if the constraints should be printed in LaTeX format.
1236 static __isl_give isl_printer
*print_disjuncts_set(__isl_keep isl_set
*set
,
1237 __isl_keep isl_space
*space
, __isl_take isl_printer
*p
, int latex
)
1239 return print_disjuncts_map(set_to_map(set
), space
, p
, latex
);
1242 struct isl_aff_split
{
1247 static void free_split(__isl_take
struct isl_aff_split
*split
, int n
)
1254 for (i
= 0; i
< n
; ++i
) {
1255 isl_basic_map_free(split
[i
].aff
);
1256 isl_map_free(split
[i
].map
);
1262 static __isl_give isl_basic_map
*get_aff(__isl_take isl_basic_map
*bmap
)
1265 isl_size nparam
, n_in
, n_out
, total
;
1267 bmap
= isl_basic_map_cow(bmap
);
1270 bmap
= isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1272 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
1273 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
1274 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
1275 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1276 if (n_in
< 0 || n_out
< 0 || nparam
< 0 || total
< 0)
1277 return isl_basic_map_free(bmap
);
1279 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
1280 j
= isl_seq_last_non_zero(bmap
->eq
[i
] + 1, total
);
1281 if (j
>= nparam
&& j
< nparam
+ n_in
+ n_out
&&
1282 (isl_int_is_one(bmap
->eq
[i
][1 + j
]) ||
1283 isl_int_is_negone(bmap
->eq
[i
][1 + j
])))
1285 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
1289 bmap
= isl_basic_map_finalize(bmap
);
1293 isl_basic_map_free(bmap
);
1297 static int aff_split_cmp(const void *p1
, const void *p2
, void *user
)
1299 const struct isl_aff_split
*s1
, *s2
;
1300 s1
= (const struct isl_aff_split
*) p1
;
1301 s2
= (const struct isl_aff_split
*) p2
;
1303 return isl_basic_map_plain_cmp(s1
->aff
, s2
->aff
);
1306 static __isl_give isl_basic_map
*drop_aff(__isl_take isl_basic_map
*bmap
,
1307 __isl_keep isl_basic_map
*aff
)
1312 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
1313 if (v_div
< 0 || !aff
)
1316 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
1317 if (isl_seq_any_non_zero(bmap
->eq
[i
] + 1 + v_div
, bmap
->n_div
))
1319 for (j
= 0; j
< aff
->n_eq
; ++j
) {
1320 if (!isl_seq_eq(bmap
->eq
[i
], aff
->eq
[j
], 1 + v_div
) &&
1321 !isl_seq_is_neg(bmap
->eq
[i
], aff
->eq
[j
], 1 + v_div
))
1323 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
1331 isl_basic_map_free(bmap
);
1335 static __isl_give
struct isl_aff_split
*split_aff(__isl_keep isl_map
*map
)
1338 struct isl_aff_split
*split
;
1341 ctx
= isl_map_get_ctx(map
);
1342 split
= isl_calloc_array(ctx
, struct isl_aff_split
, map
->n
);
1346 for (i
= 0; i
< map
->n
; ++i
) {
1347 isl_basic_map
*bmap
;
1348 split
[i
].aff
= get_aff(isl_basic_map_copy(map
->p
[i
]));
1349 bmap
= isl_basic_map_copy(map
->p
[i
]);
1350 bmap
= isl_basic_map_cow(bmap
);
1351 bmap
= drop_aff(bmap
, split
[i
].aff
);
1352 split
[i
].map
= isl_map_from_basic_map(bmap
);
1353 if (!split
[i
].aff
|| !split
[i
].map
)
1357 if (isl_sort(split
, map
->n
, sizeof(struct isl_aff_split
),
1358 &aff_split_cmp
, NULL
) < 0)
1362 for (i
= n
- 1; i
>= 1; --i
) {
1363 if (!isl_basic_map_plain_is_equal(split
[i
- 1].aff
,
1366 isl_basic_map_free(split
[i
].aff
);
1367 split
[i
- 1].map
= isl_map_union(split
[i
- 1].map
,
1370 split
[i
] = split
[n
- 1];
1371 split
[n
- 1].aff
= NULL
;
1372 split
[n
- 1].map
= NULL
;
1378 free_split(split
, map
->n
);
1382 /* Given a set of equality constraints "eq" obtained from get_aff,
1383 * i.e., with a (positive or negative) unit coefficient in the last position,
1384 * look for an equality constraint in "eq" that defines
1385 * the "type" variable at position "pos" in "space",
1386 * i.e., where that last coefficient corresponds to the given variable.
1387 * If so, return the position of that equality constraint.
1388 * Return a value beyond the number of equality constraints
1389 * if no such constraint can be found.
1390 * Return isl_size_error in case of error.
1392 * If a suitable constraint is found, then also make sure
1393 * it has a negative unit coefficient for the given variable.
1395 static isl_size
defining_equality(__isl_keep isl_basic_map
*eq
,
1396 __isl_keep isl_space
*space
, enum isl_dim_type type
, int pos
)
1399 isl_size total
, off
;
1402 total
= isl_basic_map_dim(eq
, isl_dim_all
);
1403 n_eq
= isl_basic_map_n_equality(eq
);
1404 off
= isl_space_offset(space
, type
);
1405 if (total
< 0 || n_eq
< 0 || off
< 0)
1406 return isl_size_error
;
1410 for (i
= 0; i
< n_eq
; ++i
) {
1411 if (isl_seq_last_non_zero(eq
->eq
[i
] + 1, total
) != pos
)
1413 if (isl_int_is_one(eq
->eq
[i
][1 + pos
]))
1414 isl_seq_neg(eq
->eq
[i
], eq
->eq
[i
], 1 + total
);
1421 /* Print dimension "pos" of data->space to "p".
1423 * data->user is assumed to be an isl_basic_map keeping track of equalities.
1425 * If the current dimension is defined by these equalities, then print
1426 * the corresponding expression, assigned to the name of the dimension
1427 * if there is any. Otherwise, print the name of the dimension.
1429 static __isl_give isl_printer
*print_dim_eq(__isl_take isl_printer
*p
,
1430 struct isl_print_space_data
*data
, unsigned pos
)
1432 isl_basic_map
*eq
= data
->user
;
1435 n_eq
= isl_basic_map_n_equality(eq
);
1436 j
= defining_equality(eq
, data
->space
, data
->type
, pos
);
1437 if (j
< 0 || n_eq
< 0)
1438 return isl_printer_free(p
);
1442 if (isl_space_has_dim_name(data
->space
, data
->type
, pos
)) {
1443 p
= print_name(data
->space
, p
, data
->type
, pos
,
1445 p
= isl_printer_print_str(p
, " = ");
1447 off
= isl_space_offset(data
->space
, data
->type
);
1449 return isl_printer_free(p
);
1451 p
= print_affine_of_len(data
->space
, NULL
, p
, eq
->eq
[j
], pos
);
1453 p
= print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
1459 static __isl_give isl_printer
*print_split_map(__isl_take isl_printer
*p
,
1460 struct isl_aff_split
*split
, int n
, __isl_keep isl_space
*space
)
1462 struct isl_print_space_data data
= { 0 };
1466 data
.print_dim
= &print_dim_eq
;
1467 for (i
= 0; i
< n
; ++i
) {
1470 rational
= split
[i
].map
->n
> 0 &&
1471 ISL_F_ISSET(split
[i
].map
->p
[0], ISL_BASIC_MAP_RATIONAL
);
1473 p
= isl_printer_print_str(p
, "; ");
1474 data
.user
= split
[i
].aff
;
1475 p
= isl_print_space(space
, p
, rational
, &data
);
1476 p
= print_disjuncts_map(split
[i
].map
, space
, p
, 0);
1482 static __isl_give isl_printer
*print_body_map(__isl_take isl_printer
*p
,
1483 __isl_keep isl_map
*map
)
1485 struct isl_print_space_data data
= { 0 };
1486 struct isl_aff_split
*split
= NULL
;
1490 return isl_printer_free(p
);
1491 if (!p
->dump
&& map
->n
> 0)
1492 split
= split_aff(map
);
1494 p
= print_split_map(p
, split
, map
->n
, map
->dim
);
1496 rational
= map
->n
> 0 &&
1497 ISL_F_ISSET(map
->p
[0], ISL_BASIC_MAP_RATIONAL
);
1498 p
= isl_print_space(map
->dim
, p
, rational
, &data
);
1499 p
= print_disjuncts_map(map
, map
->dim
, p
, 0);
1501 free_split(split
, map
->n
);
1505 static __isl_give isl_printer
*isl_map_print_isl(__isl_keep isl_map
*map
,
1506 __isl_take isl_printer
*p
)
1508 struct isl_print_space_data data
= { 0 };
1510 p
= print_param_tuple(p
, map
->dim
, &data
);
1511 p
= isl_printer_print_str(p
, s_open_set
[0]);
1512 p
= print_body_map(p
, map
);
1513 p
= isl_printer_print_str(p
, s_close_set
[0]);
1517 static __isl_give isl_printer
*print_latex_map(__isl_keep isl_map
*map
,
1518 __isl_take isl_printer
*p
, __isl_keep isl_basic_map
*aff
)
1520 struct isl_print_space_data data
= { 0 };
1523 p
= print_param_tuple(p
, map
->dim
, &data
);
1524 p
= isl_printer_print_str(p
, s_open_set
[1]);
1525 data
.print_dim
= &print_dim_eq
;
1527 p
= isl_print_space(map
->dim
, p
, 0, &data
);
1528 p
= print_disjuncts_map(map
, map
->dim
, p
, 1);
1529 p
= isl_printer_print_str(p
, s_close_set
[1]);
1534 static __isl_give isl_printer
*isl_map_print_latex(__isl_keep isl_map
*map
,
1535 __isl_take isl_printer
*p
)
1538 struct isl_aff_split
*split
= NULL
;
1541 split
= split_aff(map
);
1544 return print_latex_map(map
, p
, NULL
);
1546 for (i
= 0; i
< map
->n
; ++i
) {
1550 p
= isl_printer_print_str(p
, " \\cup ");
1551 p
= print_latex_map(split
[i
].map
, p
, split
[i
].aff
);
1554 free_split(split
, map
->n
);
1558 __isl_give isl_printer
*isl_printer_print_basic_map(__isl_take isl_printer
*p
,
1559 __isl_keep isl_basic_map
*bmap
)
1563 if (p
->output_format
== ISL_FORMAT_ISL
)
1564 return isl_basic_map_print_isl(bmap
, p
, 0);
1565 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1566 return basic_map_print_omega(bmap
, p
);
1567 isl_assert(bmap
->ctx
, 0, goto error
);
1569 isl_printer_free(p
);
1573 __isl_give isl_printer
*isl_printer_print_basic_set(__isl_take isl_printer
*p
,
1574 __isl_keep isl_basic_set
*bset
)
1579 if (p
->output_format
== ISL_FORMAT_ISL
)
1580 return isl_basic_map_print_isl(bset
, p
, 0);
1581 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1582 return isl_basic_set_print_polylib(bset
, p
, 0);
1583 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1584 return isl_basic_set_print_polylib(bset
, p
, 1);
1585 else if (p
->output_format
== ISL_FORMAT_POLYLIB_CONSTRAINTS
)
1586 return bset_print_constraints_polylib(bset
, p
);
1587 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1588 return basic_set_print_omega(bset
, p
);
1589 isl_assert(p
->ctx
, 0, goto error
);
1591 isl_printer_free(p
);
1595 __isl_give isl_printer
*isl_printer_print_set(__isl_take isl_printer
*p
,
1596 __isl_keep isl_set
*set
)
1600 if (p
->output_format
== ISL_FORMAT_ISL
)
1601 return isl_map_print_isl(set_to_map(set
), p
);
1602 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1603 return isl_set_print_polylib(set
, p
, 0);
1604 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1605 return isl_set_print_polylib(set
, p
, 1);
1606 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1607 return isl_set_print_omega(set
, p
);
1608 else if (p
->output_format
== ISL_FORMAT_LATEX
)
1609 return isl_map_print_latex(set_to_map(set
), p
);
1610 isl_assert(set
->ctx
, 0, goto error
);
1612 isl_printer_free(p
);
1616 __isl_give isl_printer
*isl_printer_print_map(__isl_take isl_printer
*p
,
1617 __isl_keep isl_map
*map
)
1622 if (p
->output_format
== ISL_FORMAT_ISL
)
1623 return isl_map_print_isl(map
, p
);
1624 else if (p
->output_format
== ISL_FORMAT_POLYLIB
)
1625 return isl_map_print_polylib(map
, p
, 0);
1626 else if (p
->output_format
== ISL_FORMAT_EXT_POLYLIB
)
1627 return isl_map_print_polylib(map
, p
, 1);
1628 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
1629 return isl_map_print_omega(map
, p
);
1630 else if (p
->output_format
== ISL_FORMAT_LATEX
)
1631 return isl_map_print_latex(map
, p
);
1632 isl_assert(map
->ctx
, 0, goto error
);
1634 isl_printer_free(p
);
1638 struct isl_union_print_data
{
1645 #include "isl_union_print_templ.c"
1647 /* Print the body of "uset" (everything except the parameter declarations)
1648 * to "p" in isl format.
1650 static __isl_give isl_printer
*isl_printer_print_union_set_isl_body(
1651 __isl_take isl_printer
*p
, __isl_keep isl_union_set
*uset
)
1653 return print_body_union_map(p
, uset_to_umap(uset
));
1656 static isl_stat
print_latex_map_body(__isl_take isl_map
*map
, void *user
)
1658 struct isl_union_print_data
*data
;
1659 data
= (struct isl_union_print_data
*)user
;
1662 data
->p
= isl_printer_print_str(data
->p
, " \\cup ");
1665 data
->p
= isl_map_print_latex(map
, data
->p
);
1671 static __isl_give isl_printer
*isl_union_map_print_latex(
1672 __isl_keep isl_union_map
*umap
, __isl_take isl_printer
*p
)
1674 struct isl_union_print_data data
= { p
, 1 };
1675 isl_union_map_foreach_map(umap
, &print_latex_map_body
, &data
);
1680 __isl_give isl_printer
*isl_printer_print_union_map(__isl_take isl_printer
*p
,
1681 __isl_keep isl_union_map
*umap
)
1686 if (p
->output_format
== ISL_FORMAT_ISL
)
1687 return print_union_map_isl(p
, umap
);
1688 if (p
->output_format
== ISL_FORMAT_LATEX
)
1689 return isl_union_map_print_latex(umap
, p
);
1691 isl_die(p
->ctx
, isl_error_invalid
,
1692 "invalid output format for isl_union_map", goto error
);
1694 isl_printer_free(p
);
1698 __isl_give isl_printer
*isl_printer_print_union_set(__isl_take isl_printer
*p
,
1699 __isl_keep isl_union_set
*uset
)
1704 if (p
->output_format
== ISL_FORMAT_ISL
)
1705 return print_union_map_isl(p
, uset_to_umap(uset
));
1706 if (p
->output_format
== ISL_FORMAT_LATEX
)
1707 return isl_union_map_print_latex(uset_to_umap(uset
), p
);
1709 isl_die(p
->ctx
, isl_error_invalid
,
1710 "invalid output format for isl_union_set", goto error
);
1712 isl_printer_free(p
);
1716 static isl_size
poly_rec_n_non_zero(__isl_keep isl_poly_rec
*rec
)
1722 return isl_size_error
;
1724 for (i
= 0, n
= 0; i
< rec
->n
; ++i
) {
1725 isl_bool is_zero
= isl_poly_is_zero(rec
->p
[i
]);
1728 return isl_size_error
;
1736 static __isl_give isl_printer
*poly_print_cst(__isl_keep isl_poly
*poly
,
1737 __isl_take isl_printer
*p
, int first
)
1742 cst
= isl_poly_as_cst(poly
);
1745 neg
= !first
&& isl_int_is_neg(cst
->n
);
1747 p
= isl_printer_print_str(p
, neg
? " - " : " + ");
1749 isl_int_neg(cst
->n
, cst
->n
);
1750 if (isl_int_is_zero(cst
->d
)) {
1751 int sgn
= isl_int_sgn(cst
->n
);
1752 p
= isl_printer_print_str(p
, sgn
< 0 ? "-infty" :
1753 sgn
== 0 ? "NaN" : "infty");
1755 p
= isl_printer_print_isl_int(p
, cst
->n
);
1757 isl_int_neg(cst
->n
, cst
->n
);
1758 if (!isl_int_is_zero(cst
->d
) && !isl_int_is_one(cst
->d
)) {
1759 p
= isl_printer_print_str(p
, "/");
1760 p
= isl_printer_print_isl_int(p
, cst
->d
);
1764 isl_printer_free(p
);
1768 static __isl_give isl_printer
*print_base(__isl_take isl_printer
*p
,
1769 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int var
)
1773 total
= isl_space_dim(space
, isl_dim_all
);
1775 return isl_printer_free(p
);
1777 p
= print_term(space
, NULL
, space
->ctx
->one
, 1 + var
, p
, 0);
1779 p
= print_div(space
, div
, var
- total
, p
);
1783 static __isl_give isl_printer
*print_pow(__isl_take isl_printer
*p
,
1784 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
, int var
, int exp
)
1786 p
= print_base(p
, space
, div
, var
);
1789 if (p
->output_format
== ISL_FORMAT_C
) {
1791 for (i
= 1; i
< exp
; ++i
) {
1792 p
= isl_printer_print_str(p
, "*");
1793 p
= print_base(p
, space
, div
, var
);
1796 p
= isl_printer_print_str(p
, "^");
1797 p
= isl_printer_print_int(p
, exp
);
1802 /* Print the polynomial "poly" defined over the domain space "space" and
1803 * local variables defined by "div" to "p".
1805 static __isl_give isl_printer
*poly_print(__isl_keep isl_poly
*poly
,
1806 __isl_keep isl_space
*space
, __isl_keep isl_mat
*div
,
1807 __isl_take isl_printer
*p
)
1809 int i
, first
, print_parens
;
1814 is_cst
= isl_poly_is_cst(poly
);
1815 if (!p
|| is_cst
< 0 || !space
|| !div
)
1819 return poly_print_cst(poly
, p
, 1);
1821 rec
= isl_poly_as_rec(poly
);
1822 n
= poly_rec_n_non_zero(rec
);
1824 return isl_printer_free(p
);
1825 print_parens
= n
> 1;
1827 p
= isl_printer_print_str(p
, "(");
1828 for (i
= 0, first
= 1; i
< rec
->n
; ++i
) {
1829 isl_bool is_zero
= isl_poly_is_zero(rec
->p
[i
]);
1830 isl_bool is_one
= isl_poly_is_one(rec
->p
[i
]);
1831 isl_bool is_negone
= isl_poly_is_negone(rec
->p
[i
]);
1832 isl_bool is_cst
= isl_poly_is_cst(rec
->p
[i
]);
1834 if (is_zero
< 0 || is_one
< 0 || is_negone
< 0)
1835 return isl_printer_free(p
);
1840 p
= isl_printer_print_str(p
, "-1");
1842 p
= isl_printer_print_str(p
, "-");
1844 p
= isl_printer_print_str(p
, " - ");
1845 } else if (is_cst
&& !is_one
)
1846 p
= poly_print_cst(rec
->p
[i
], p
, first
);
1849 p
= isl_printer_print_str(p
, " + ");
1850 if (i
== 0 || !is_one
)
1851 p
= poly_print(rec
->p
[i
], space
, div
, p
);
1856 if (!is_one
&& !is_negone
)
1857 p
= isl_printer_print_str(p
, " * ");
1858 p
= print_pow(p
, space
, div
, rec
->poly
.var
, i
);
1861 p
= isl_printer_print_str(p
, ")");
1864 isl_printer_free(p
);
1868 static __isl_give isl_printer
*print_qpolynomial(__isl_take isl_printer
*p
,
1869 __isl_keep isl_qpolynomial
*qp
)
1873 p
= poly_print(qp
->poly
, qp
->dim
, qp
->div
, p
);
1876 isl_printer_free(p
);
1880 static __isl_give isl_printer
*print_qpolynomial_isl(__isl_take isl_printer
*p
,
1881 __isl_keep isl_qpolynomial
*qp
)
1883 struct isl_print_space_data data
= { 0 };
1888 p
= print_param_tuple(p
, qp
->dim
, &data
);
1889 p
= isl_printer_print_str(p
, "{ ");
1890 if (!isl_space_is_params(qp
->dim
)) {
1891 p
= isl_print_space(qp
->dim
, p
, 0, &data
);
1892 p
= isl_printer_print_str(p
, " -> ");
1894 p
= print_qpolynomial(p
, qp
);
1895 p
= isl_printer_print_str(p
, " }");
1898 isl_printer_free(p
);
1902 /* Print the quasi-polynomial "qp" to "p" in C format, with the variable names
1903 * taken from the domain space "space".
1905 static __isl_give isl_printer
*print_qpolynomial_c(__isl_take isl_printer
*p
,
1906 __isl_keep isl_space
*space
, __isl_keep isl_qpolynomial
*qp
)
1911 den
= isl_qpolynomial_get_den(qp
);
1912 qp
= isl_qpolynomial_copy(qp
);
1913 qp
= isl_qpolynomial_scale_val(qp
, isl_val_copy(den
));
1914 is_one
= isl_val_is_one(den
);
1916 p
= isl_printer_free(p
);
1918 p
= isl_printer_print_str(p
, "(");
1920 p
= poly_print(qp
->poly
, space
, qp
->div
, p
);
1922 p
= isl_printer_free(p
);
1924 p
= isl_printer_print_str(p
, ")/");
1925 p
= isl_printer_print_val(p
, den
);
1927 isl_qpolynomial_free(qp
);
1932 __isl_give isl_printer
*isl_printer_print_qpolynomial(
1933 __isl_take isl_printer
*p
, __isl_keep isl_qpolynomial
*qp
)
1938 if (p
->output_format
== ISL_FORMAT_ISL
)
1939 return print_qpolynomial_isl(p
, qp
);
1940 else if (p
->output_format
== ISL_FORMAT_C
)
1941 return print_qpolynomial_c(p
, qp
->dim
, qp
);
1943 isl_die(qp
->dim
->ctx
, isl_error_unsupported
,
1944 "output format not supported for isl_qpolynomials",
1947 isl_printer_free(p
);
1951 void isl_qpolynomial_print(__isl_keep isl_qpolynomial
*qp
, FILE *out
,
1952 unsigned output_format
)
1959 isl_assert(qp
->dim
->ctx
, output_format
== ISL_FORMAT_ISL
, return);
1960 p
= isl_printer_to_file(qp
->dim
->ctx
, out
);
1961 p
= isl_printer_print_qpolynomial(p
, qp
);
1962 isl_printer_free(p
);
1965 static __isl_give isl_printer
*qpolynomial_fold_print(
1966 __isl_keep isl_qpolynomial_fold
*fold
, __isl_take isl_printer
*p
)
1969 isl_qpolynomial_list
*list
;
1972 list
= isl_qpolynomial_fold_peek_list(fold
);
1973 n
= isl_qpolynomial_list_size(list
);
1975 return isl_printer_free(p
);
1976 if (fold
->type
== isl_fold_min
)
1977 p
= isl_printer_print_str(p
, "min");
1978 else if (fold
->type
== isl_fold_max
)
1979 p
= isl_printer_print_str(p
, "max");
1980 p
= isl_printer_print_str(p
, "(");
1981 for (i
= 0; i
< n
; ++i
) {
1982 isl_qpolynomial
*qp
;
1985 p
= isl_printer_print_str(p
, ", ");
1986 qp
= isl_qpolynomial_list_peek(list
, i
);
1987 p
= print_qpolynomial(p
, qp
);
1989 p
= isl_printer_print_str(p
, ")");
1993 void isl_qpolynomial_fold_print(__isl_keep isl_qpolynomial_fold
*fold
,
1994 FILE *out
, unsigned output_format
)
2001 isl_assert(fold
->dim
->ctx
, output_format
== ISL_FORMAT_ISL
, return);
2003 p
= isl_printer_to_file(fold
->dim
->ctx
, out
);
2004 p
= isl_printer_print_qpolynomial_fold(p
, fold
);
2006 isl_printer_free(p
);
2009 static __isl_give isl_printer
*print_body_pw_qpolynomial(
2010 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2012 struct isl_print_space_data data
= { 0 };
2015 for (i
= 0; i
< pwqp
->n
; ++i
) {
2019 p
= isl_printer_print_str(p
, "; ");
2020 space
= isl_qpolynomial_get_domain_space(pwqp
->p
[i
].qp
);
2021 if (!isl_space_is_params(space
)) {
2022 p
= isl_print_space(space
, p
, 0, &data
);
2023 p
= isl_printer_print_str(p
, " -> ");
2025 p
= print_qpolynomial(p
, pwqp
->p
[i
].qp
);
2026 p
= print_disjuncts(set_to_map(pwqp
->p
[i
].set
), space
, p
, 0);
2027 isl_space_free(space
);
2033 static __isl_give isl_printer
*print_pw_qpolynomial_isl(
2034 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2036 struct isl_print_space_data data
= { 0 };
2041 p
= print_param_tuple(p
, pwqp
->dim
, &data
);
2042 p
= isl_printer_print_str(p
, "{ ");
2044 if (!isl_space_is_set(pwqp
->dim
)) {
2045 p
= print_tuple(pwqp
->dim
, p
, isl_dim_in
, &data
);
2046 p
= isl_printer_print_str(p
, " -> ");
2048 p
= isl_printer_print_str(p
, "0");
2050 p
= print_body_pw_qpolynomial(p
, pwqp
);
2051 p
= isl_printer_print_str(p
, " }");
2054 isl_printer_free(p
);
2058 void isl_pw_qpolynomial_print(__isl_keep isl_pw_qpolynomial
*pwqp
, FILE *out
,
2059 unsigned output_format
)
2066 p
= isl_printer_to_file(pwqp
->dim
->ctx
, out
);
2067 p
= isl_printer_set_output_format(p
, output_format
);
2068 p
= isl_printer_print_pw_qpolynomial(p
, pwqp
);
2070 isl_printer_free(p
);
2073 static __isl_give isl_printer
*print_body_pw_qpolynomial_fold(
2074 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2076 struct isl_print_space_data data
= { 0 };
2079 for (i
= 0; i
< pwf
->n
; ++i
) {
2083 p
= isl_printer_print_str(p
, "; ");
2084 space
= isl_qpolynomial_fold_get_domain_space(pwf
->p
[i
].fold
);
2085 if (!isl_space_is_params(space
)) {
2086 p
= isl_print_space(space
, p
, 0, &data
);
2087 p
= isl_printer_print_str(p
, " -> ");
2089 p
= qpolynomial_fold_print(pwf
->p
[i
].fold
, p
);
2090 p
= print_disjuncts(set_to_map(pwf
->p
[i
].set
), space
, p
, 0);
2091 isl_space_free(space
);
2097 static __isl_give isl_printer
*print_pw_qpolynomial_fold_isl(
2098 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2100 struct isl_print_space_data data
= { 0 };
2102 p
= print_param_tuple(p
, pwf
->dim
, &data
);
2103 p
= isl_printer_print_str(p
, "{ ");
2105 if (!isl_space_is_set(pwf
->dim
)) {
2106 p
= print_tuple(pwf
->dim
, p
, isl_dim_in
, &data
);
2107 p
= isl_printer_print_str(p
, " -> ");
2109 p
= isl_printer_print_str(p
, "0");
2111 p
= print_body_pw_qpolynomial_fold(p
, pwf
);
2112 p
= isl_printer_print_str(p
, " }");
2116 static __isl_give isl_printer
*print_ls_affine_c(__isl_take isl_printer
*p
,
2117 __isl_keep isl_local_space
*ls
, isl_int
*c
);
2119 /* We skip the constraint if it is implied by the div expression.
2121 * *first indicates whether this is the first constraint in the conjunction and
2122 * is updated if the constraint is actually printed.
2124 static __isl_give isl_printer
*print_constraint_c(__isl_take isl_printer
*p
,
2125 __isl_keep isl_local_space
*ls
, isl_int
*c
, const char *op
, int *first
)
2131 o_div
= isl_local_space_offset(ls
, isl_dim_div
);
2132 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
2134 return isl_printer_free(p
);
2135 div
= isl_seq_last_non_zero(c
+ o_div
, n_div
);
2137 isl_bool is_div
= isl_local_space_is_div_constraint(ls
, c
, div
);
2139 return isl_printer_free(p
);
2145 p
= isl_printer_print_str(p
, " && ");
2147 p
= print_ls_affine_c(p
, ls
, c
);
2148 p
= isl_printer_print_str(p
, " ");
2149 p
= isl_printer_print_str(p
, op
);
2150 p
= isl_printer_print_str(p
, " 0");
2157 static __isl_give isl_printer
*print_ls_partial_affine_c(
2158 __isl_take isl_printer
*p
, __isl_keep isl_local_space
*ls
,
2159 isl_int
*c
, unsigned len
);
2161 static __isl_give isl_printer
*print_basic_set_c(__isl_take isl_printer
*p
,
2162 __isl_keep isl_space
*space
, __isl_keep isl_basic_set
*bset
)
2166 isl_size n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
2167 isl_size total
= isl_basic_set_dim(bset
, isl_dim_all
);
2169 isl_local_space
*ls
;
2171 if (n_div
< 0 || total
< 0)
2172 return isl_printer_free(p
);
2175 div
= isl_basic_set_get_divs(bset
);
2176 ls
= isl_local_space_alloc_div(isl_space_copy(space
), div
);
2177 for (i
= 0; i
< bset
->n_eq
; ++i
) {
2178 j
= isl_seq_last_non_zero(bset
->eq
[i
] + 1 + total
, n_div
);
2180 p
= print_constraint_c(p
, ls
,
2181 bset
->eq
[i
], "==", &first
);
2184 p
= isl_printer_print_str(p
, " && ");
2185 p
= isl_printer_print_str(p
, "(");
2186 p
= print_ls_partial_affine_c(p
, ls
, bset
->eq
[i
],
2188 p
= isl_printer_print_str(p
, ") % ");
2189 p
= isl_printer_print_isl_int(p
,
2190 bset
->eq
[i
][1 + total
+ j
]);
2191 p
= isl_printer_print_str(p
, " == 0");
2195 for (i
= 0; i
< bset
->n_ineq
; ++i
)
2196 p
= print_constraint_c(p
, ls
, bset
->ineq
[i
], ">=", &first
);
2197 isl_local_space_free(ls
);
2201 static __isl_give isl_printer
*print_set_c(__isl_take isl_printer
*p
,
2202 __isl_keep isl_space
*space
, __isl_keep isl_set
*set
)
2207 return isl_printer_free(p
);
2210 p
= isl_printer_print_str(p
, "0");
2212 for (i
= 0; i
< set
->n
; ++i
) {
2214 p
= isl_printer_print_str(p
, " || ");
2216 p
= isl_printer_print_str(p
, "(");
2217 p
= print_basic_set_c(p
, space
, set
->p
[i
]);
2219 p
= isl_printer_print_str(p
, ")");
2224 /* Print the piecewise quasi-polynomial "pwqp" to "p" in C format.
2226 static __isl_give isl_printer
*print_pw_qpolynomial_c(
2227 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2232 space
= isl_pw_qpolynomial_get_domain_space(pwqp
);
2233 if (pwqp
->n
== 1 && isl_set_plain_is_universe(pwqp
->p
[0].set
)) {
2234 p
= print_qpolynomial_c(p
, space
, pwqp
->p
[0].qp
);
2235 isl_space_free(space
);
2239 for (i
= 0; i
< pwqp
->n
; ++i
) {
2240 p
= isl_printer_print_str(p
, "(");
2241 p
= print_set_c(p
, space
, pwqp
->p
[i
].set
);
2242 p
= isl_printer_print_str(p
, ") ? (");
2243 p
= print_qpolynomial_c(p
, space
, pwqp
->p
[i
].qp
);
2244 p
= isl_printer_print_str(p
, ") : ");
2247 isl_space_free(space
);
2248 p
= isl_printer_print_str(p
, "0");
2252 __isl_give isl_printer
*isl_printer_print_pw_qpolynomial(
2253 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial
*pwqp
)
2258 if (p
->output_format
== ISL_FORMAT_ISL
)
2259 return print_pw_qpolynomial_isl(p
, pwqp
);
2260 else if (p
->output_format
== ISL_FORMAT_C
)
2261 return print_pw_qpolynomial_c(p
, pwqp
);
2262 isl_assert(p
->ctx
, 0, goto error
);
2264 isl_printer_free(p
);
2269 #define BASE pw_qpolynomial
2270 #include "isl_union_print_templ.c"
2272 __isl_give isl_printer
*isl_printer_print_union_pw_qpolynomial(
2273 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_qpolynomial
*upwqp
)
2278 if (p
->output_format
== ISL_FORMAT_ISL
)
2279 return print_union_pw_qpolynomial_isl(p
, upwqp
);
2280 isl_die(p
->ctx
, isl_error_invalid
,
2281 "invalid output format for isl_union_pw_qpolynomial",
2284 isl_printer_free(p
);
2288 /* Print the quasi-polynomial reduction "fold" to "p" in C format,
2289 * with the variable names taken from the domain space "space".
2291 static __isl_give isl_printer
*print_qpolynomial_fold_c(
2292 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
,
2293 __isl_keep isl_qpolynomial_fold
*fold
)
2296 isl_qpolynomial_list
*list
;
2299 list
= isl_qpolynomial_fold_peek_list(fold
);
2300 n
= isl_qpolynomial_list_size(list
);
2302 return isl_printer_free(p
);
2303 for (i
= 0; i
< n
- 1; ++i
)
2304 if (fold
->type
== isl_fold_min
)
2305 p
= isl_printer_print_str(p
, "min(");
2306 else if (fold
->type
== isl_fold_max
)
2307 p
= isl_printer_print_str(p
, "max(");
2309 for (i
= 0; i
< n
; ++i
) {
2310 isl_qpolynomial
*qp
;
2313 p
= isl_printer_print_str(p
, ", ");
2314 qp
= isl_qpolynomial_list_peek(list
, i
);
2315 p
= print_qpolynomial_c(p
, space
, qp
);
2317 p
= isl_printer_print_str(p
, ")");
2322 __isl_give isl_printer
*isl_printer_print_qpolynomial_fold(
2323 __isl_take isl_printer
*p
, __isl_keep isl_qpolynomial_fold
*fold
)
2327 if (p
->output_format
== ISL_FORMAT_ISL
)
2328 return qpolynomial_fold_print(fold
, p
);
2329 else if (p
->output_format
== ISL_FORMAT_C
)
2330 return print_qpolynomial_fold_c(p
, fold
->dim
, fold
);
2331 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2334 isl_printer_free(p
);
2338 /* Print the piecewise quasi-polynomial reduction "pwf" to "p" in C format.
2340 static __isl_give isl_printer
*print_pw_qpolynomial_fold_c(
2341 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2346 space
= isl_pw_qpolynomial_fold_get_domain_space(pwf
);
2347 if (pwf
->n
== 1 && isl_set_plain_is_universe(pwf
->p
[0].set
)) {
2348 p
= print_qpolynomial_fold_c(p
, space
, pwf
->p
[0].fold
);
2349 isl_space_free(space
);
2353 for (i
= 0; i
< pwf
->n
; ++i
) {
2354 p
= isl_printer_print_str(p
, "(");
2355 p
= print_set_c(p
, space
, pwf
->p
[i
].set
);
2356 p
= isl_printer_print_str(p
, ") ? (");
2357 p
= print_qpolynomial_fold_c(p
, space
, pwf
->p
[i
].fold
);
2358 p
= isl_printer_print_str(p
, ") : ");
2361 isl_space_free(space
);
2362 p
= isl_printer_print_str(p
, "0");
2366 __isl_give isl_printer
*isl_printer_print_pw_qpolynomial_fold(
2367 __isl_take isl_printer
*p
, __isl_keep isl_pw_qpolynomial_fold
*pwf
)
2372 if (p
->output_format
== ISL_FORMAT_ISL
)
2373 return print_pw_qpolynomial_fold_isl(p
, pwf
);
2374 else if (p
->output_format
== ISL_FORMAT_C
)
2375 return print_pw_qpolynomial_fold_c(p
, pwf
);
2376 isl_assert(p
->ctx
, 0, goto error
);
2378 isl_printer_free(p
);
2382 void isl_pw_qpolynomial_fold_print(__isl_keep isl_pw_qpolynomial_fold
*pwf
,
2383 FILE *out
, unsigned output_format
)
2390 p
= isl_printer_to_file(pwf
->dim
->ctx
, out
);
2391 p
= isl_printer_set_output_format(p
, output_format
);
2392 p
= isl_printer_print_pw_qpolynomial_fold(p
, pwf
);
2394 isl_printer_free(p
);
2398 #define BASE pw_qpolynomial_fold
2399 #include "isl_union_print_templ.c"
2401 __isl_give isl_printer
*isl_printer_print_union_pw_qpolynomial_fold(
2402 __isl_take isl_printer
*p
,
2403 __isl_keep isl_union_pw_qpolynomial_fold
*upwf
)
2408 if (p
->output_format
== ISL_FORMAT_ISL
)
2409 return print_union_pw_qpolynomial_fold_isl(p
, upwf
);
2410 isl_die(p
->ctx
, isl_error_invalid
,
2411 "invalid output format for isl_union_pw_qpolynomial_fold",
2414 isl_printer_free(p
);
2418 /* Print the isl_constraint "c" to "p".
2420 __isl_give isl_printer
*isl_printer_print_constraint(__isl_take isl_printer
*p
,
2421 __isl_keep isl_constraint
*c
)
2423 struct isl_print_space_data data
= { 0 };
2424 isl_local_space
*ls
;
2431 ls
= isl_constraint_get_local_space(c
);
2433 return isl_printer_free(p
);
2434 space
= isl_local_space_get_space(ls
);
2435 p
= print_param_tuple(p
, space
, &data
);
2436 p
= isl_printer_print_str(p
, "{ ");
2437 p
= isl_print_space(space
, p
, 0, &data
);
2438 p
= isl_printer_print_str(p
, " : ");
2439 exists
= need_exists(p
, ls
->div
);
2441 p
= isl_printer_free(p
);
2442 if (exists
>= 0 && exists
)
2443 p
= open_exists(p
, space
, ls
->div
, 0);
2444 p
= print_affine_of_len(space
, ls
->div
, p
, c
->v
->el
, c
->v
->size
);
2445 if (isl_constraint_is_equality(c
))
2446 p
= isl_printer_print_str(p
, " = 0");
2448 p
= isl_printer_print_str(p
, " >= 0");
2449 if (exists
>= 0 && exists
)
2450 p
= isl_printer_print_str(p
, s_close_exists
[0]);
2451 p
= isl_printer_print_str(p
, " }");
2452 isl_space_free(space
);
2453 isl_local_space_free(ls
);
2457 isl_printer_free(p
);
2461 static __isl_give isl_printer
*isl_printer_print_space_isl(
2462 __isl_take isl_printer
*p
, __isl_keep isl_space
*space
)
2464 struct isl_print_space_data data
= { 0 };
2469 p
= print_param_tuple(p
, space
, &data
);
2471 p
= isl_printer_print_str(p
, "{ ");
2472 if (isl_space_is_params(space
))
2473 p
= isl_printer_print_str(p
, s_such_that
[0]);
2475 p
= isl_print_space(space
, p
, 0, &data
);
2476 p
= isl_printer_print_str(p
, " }");
2480 isl_printer_free(p
);
2484 __isl_give isl_printer
*isl_printer_print_space(__isl_take isl_printer
*p
,
2485 __isl_keep isl_space
*space
)
2488 return isl_printer_free(p
);
2489 if (p
->output_format
== ISL_FORMAT_ISL
)
2490 return isl_printer_print_space_isl(p
, space
);
2491 else if (p
->output_format
== ISL_FORMAT_OMEGA
)
2492 return print_omega_parameters(space
, p
);
2494 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
2495 "output format not supported for space",
2496 return isl_printer_free(p
));
2499 __isl_give isl_printer
*isl_printer_print_local_space(__isl_take isl_printer
*p
,
2500 __isl_keep isl_local_space
*ls
)
2502 struct isl_print_space_data data
= { 0 };
2505 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
2509 p
= print_param_tuple(p
, ls
->dim
, &data
);
2510 p
= isl_printer_print_str(p
, "{ ");
2511 p
= isl_print_space(ls
->dim
, p
, 0, &data
);
2513 p
= isl_printer_print_str(p
, " : ");
2514 p
= isl_printer_print_str(p
, s_open_exists
[0]);
2515 p
= print_div_list(p
, ls
->dim
, ls
->div
, 0, 1);
2516 p
= isl_printer_print_str(p
, s_close_exists
[0]);
2517 } else if (isl_space_is_params(ls
->dim
))
2518 p
= isl_printer_print_str(p
, s_such_that
[0]);
2519 p
= isl_printer_print_str(p
, " }");
2522 isl_printer_free(p
);
2526 /* Look for the last of the "n" integer divisions that is used in "aff" and
2527 * that can be printed as a modulo and
2528 * return the position of this integer division.
2529 * Return "n" if no such integer division can be found.
2530 * Return isl_size_error on error.
2532 * In particular, look for an integer division that appears in "aff"
2533 * with a coefficient that is a multiple of the denominator
2534 * of the integer division.
2535 * That is, check if the numerator of "aff" is of the form
2537 * f(...) + a m floor(g/m)
2539 * and return the position of "floor(g/m)".
2541 * Note that, unlike print_as_modulo_pos, no check needs to be made
2542 * for whether the integer division can be printed, since it will
2543 * need to be printed as an integer division anyway if it is not printed
2546 static isl_size
last_modulo(__isl_keep isl_printer
*p
, __isl_keep isl_aff
*aff
,
2554 o_div
= isl_aff_domain_offset(aff
, isl_dim_div
);
2556 return isl_size_error
;
2557 for (i
= n
- 1; i
>= 0; --i
) {
2558 if (isl_int_is_zero(aff
->v
->el
[1 + o_div
+ i
]))
2560 if (isl_int_is_divisible_by(aff
->v
->el
[1 + o_div
+ i
],
2561 aff
->ls
->div
->row
[i
][0]))
2568 /* Print the numerator of the affine expression "aff" to "p",
2569 * with the variable names taken from "space".
2571 static __isl_give isl_printer
*print_aff_num_base(__isl_take isl_printer
*p
,
2572 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
)
2576 total
= isl_aff_domain_dim(aff
, isl_dim_all
);
2578 return isl_printer_free(p
);
2579 p
= print_affine_of_len(space
, aff
->ls
->div
, p
,
2580 aff
->v
->el
+ 1, 1 + total
);
2585 static __isl_give isl_printer
*print_aff_num(__isl_take isl_printer
*p
,
2586 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
);
2588 /* Print the modulo term "c" * ("aff" mod "mod") to "p",
2589 * with the variable names taken from "space".
2590 * If "first" is set, then this is the first term of an expression.
2592 static __isl_give isl_printer
*print_mod_term(__isl_take isl_printer
*p
,
2593 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
, int first
,
2594 __isl_take isl_val
*c
, __isl_keep isl_val
*mod
)
2596 isl_bool is_one
, is_neg
;
2598 is_neg
= isl_val_is_neg(c
);
2600 p
= isl_printer_free(p
);
2604 p
= isl_printer_print_str(p
, is_neg
? " - " : " + ");
2606 is_one
= isl_val_is_one(c
);
2608 p
= isl_printer_free(p
);
2610 p
= isl_printer_print_val(p
, c
);
2611 p
= isl_printer_print_str(p
, "*(");
2613 p
= isl_printer_print_str(p
, "(");
2614 p
= print_aff_num(p
, space
, aff
);
2615 p
= isl_printer_print_str(p
, ")");
2616 p
= isl_printer_print_str(p
, " mod ");
2617 p
= isl_printer_print_val(p
, mod
);
2619 p
= isl_printer_print_str(p
, ")");
2626 /* Print the numerator of the affine expression "aff" to "p",
2627 * with the variable names taken from "space",
2628 * given that the numerator of "aff" is of the form
2630 * f(...) + a m floor(g/m)
2632 * with "floor(g/m)" the integer division at position "last".
2634 * First replace "aff" by its numerator and rewrite it as
2636 * f(...) + a g - a (g mod m)
2638 * Recursively write out (the numerator of) "f(...) + a g"
2639 * (which may involve other modulo expressions) and
2640 * then write out "- a (g mod m)".
2642 static __isl_give isl_printer
*print_aff_num_mod(__isl_take isl_printer
*p
,
2643 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
, unsigned last
)
2647 isl_aff
*div
, *term
;
2649 aff
= isl_aff_copy(aff
);
2650 aff
= isl_aff_scale_val(aff
, isl_aff_get_denominator_val(aff
));
2651 a
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, last
);
2652 aff
= isl_aff_set_coefficient_si(aff
, isl_dim_div
, last
, 0);
2653 div
= isl_aff_get_div(aff
, last
);
2654 m
= isl_aff_get_denominator_val(div
);
2655 a
= isl_val_div(a
, isl_val_copy(m
));
2656 div
= isl_aff_scale_val(div
, isl_val_copy(m
));
2657 term
= isl_aff_scale_val(isl_aff_copy(div
), isl_val_copy(a
));
2658 aff
= isl_aff_add(aff
, term
);
2660 is_zero
= isl_aff_plain_is_zero(aff
);
2662 p
= isl_printer_free(p
);
2665 p
= print_aff_num(p
, space
, aff
);
2667 p
= print_mod_term(p
, space
, div
, is_zero
, isl_val_copy(a
), m
);
2678 /* Print the numerator of the affine expression "aff" to "p",
2679 * with the variable names taken from "space",
2680 * separating out any (obvious) modulo expressions.
2682 * In particular, look for modulo expressions in "aff",
2683 * separating them out if found and simply printing out "aff" otherwise.
2685 static __isl_give isl_printer
*print_aff_num(__isl_take isl_printer
*p
,
2686 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
)
2688 isl_size n_div
, mod
;
2690 n_div
= isl_aff_dim(aff
, isl_dim_div
);
2692 return isl_printer_free(p
);
2693 mod
= last_modulo(p
, aff
, n_div
);
2695 return isl_printer_free(p
);
2697 return print_aff_num_mod(p
, space
, aff
, mod
);
2699 return print_aff_num_base(p
, space
, aff
);
2702 /* Print the (potentially rational) affine expression "aff" to "p",
2703 * with the variable names taken from "space".
2705 static __isl_give isl_printer
*print_aff_body(__isl_take isl_printer
*p
,
2706 __isl_keep isl_space
*space
, __isl_keep isl_aff
*aff
)
2708 if (isl_aff_is_nan(aff
))
2709 return isl_printer_print_str(p
, "NaN");
2711 p
= isl_printer_print_str(p
, "(");
2712 p
= print_aff_num(p
, space
, aff
);
2713 if (isl_int_is_one(aff
->v
->el
[0]))
2714 p
= isl_printer_print_str(p
, ")");
2716 p
= isl_printer_print_str(p
, ")/");
2717 p
= isl_printer_print_isl_int(p
, aff
->v
->el
[0]);
2723 static __isl_give isl_printer
*print_body_aff(__isl_take isl_printer
*p
,
2724 __isl_keep isl_aff
*aff
)
2726 struct isl_print_space_data data
= { 0 };
2728 if (isl_space_is_params(aff
->ls
->dim
))
2731 p
= print_tuple(aff
->ls
->dim
, p
, isl_dim_set
, &data
);
2732 p
= isl_printer_print_str(p
, " -> ");
2734 p
= isl_printer_print_str(p
, "[");
2735 p
= print_aff_body(p
, aff
->ls
->dim
, aff
);
2736 p
= isl_printer_print_str(p
, "]");
2741 static __isl_give isl_printer
*print_aff_isl(__isl_take isl_printer
*p
,
2742 __isl_keep isl_aff
*aff
)
2744 struct isl_print_space_data data
= { 0 };
2749 p
= print_param_tuple(p
, aff
->ls
->dim
, &data
);
2750 p
= isl_printer_print_str(p
, "{ ");
2751 p
= print_body_aff(p
, aff
);
2752 p
= isl_printer_print_str(p
, " }");
2755 isl_printer_free(p
);
2759 /* Print dimension "pos" of data->space to "p" as a zero.
2761 static __isl_give isl_printer
*print_dim_zero(__isl_take isl_printer
*p
,
2762 struct isl_print_space_data
*data
, unsigned pos
)
2764 return isl_printer_print_str(p
, "0");
2769 #include "isl_pw_print_templ.c"
2771 static __isl_give isl_printer
*print_ls_name_c(__isl_take isl_printer
*p
,
2772 __isl_keep isl_local_space
*ls
, enum isl_dim_type type
, unsigned pos
)
2774 if (type
== isl_dim_div
) {
2775 p
= isl_printer_print_str(p
, "floord(");
2776 p
= print_ls_affine_c(p
, ls
, ls
->div
->row
[pos
] + 1);
2777 p
= isl_printer_print_str(p
, ", ");
2778 p
= isl_printer_print_isl_int(p
, ls
->div
->row
[pos
][0]);
2779 p
= isl_printer_print_str(p
, ")");
2783 name
= isl_space_get_dim_name(ls
->dim
, type
, pos
);
2786 p
= isl_printer_print_str(p
, name
);
2791 static __isl_give isl_printer
*print_ls_term_c(__isl_take isl_printer
*p
,
2792 __isl_keep isl_local_space
*ls
, isl_int c
, unsigned pos
)
2794 enum isl_dim_type type
;
2797 return isl_printer_free(p
);
2800 return isl_printer_print_isl_int(p
, c
);
2802 if (isl_int_is_one(c
))
2804 else if (isl_int_is_negone(c
))
2805 p
= isl_printer_print_str(p
, "-");
2807 p
= isl_printer_print_isl_int(p
, c
);
2808 p
= isl_printer_print_str(p
, "*");
2810 if (pos2type(ls
->dim
, &type
, &pos
) < 0)
2811 return isl_printer_free(p
);
2812 p
= print_ls_name_c(p
, ls
, type
, pos
);
2816 static __isl_give isl_printer
*print_ls_partial_affine_c(
2817 __isl_take isl_printer
*p
, __isl_keep isl_local_space
*ls
,
2818 isl_int
*c
, unsigned len
)
2823 for (i
= 0, first
= 1; i
< len
; ++i
) {
2825 if (isl_int_is_zero(c
[i
]))
2828 if (isl_int_is_neg(c
[i
])) {
2830 isl_int_neg(c
[i
], c
[i
]);
2831 p
= isl_printer_print_str(p
, " - ");
2833 p
= isl_printer_print_str(p
, " + ");
2836 p
= print_ls_term_c(p
, ls
, c
[i
], i
);
2838 isl_int_neg(c
[i
], c
[i
]);
2841 p
= isl_printer_print_str(p
, "0");
2845 static __isl_give isl_printer
*print_ls_affine_c(__isl_take isl_printer
*p
,
2846 __isl_keep isl_local_space
*ls
, isl_int
*c
)
2848 isl_size total
= isl_local_space_dim(ls
, isl_dim_all
);
2851 return isl_printer_free(p
);
2852 return print_ls_partial_affine_c(p
, ls
, c
, 1 + total
);
2855 static __isl_give isl_printer
*print_aff_c(__isl_take isl_printer
*p
,
2856 __isl_keep isl_aff
*aff
)
2860 total
= isl_aff_domain_dim(aff
, isl_dim_all
);
2862 return isl_printer_free(p
);
2863 if (!isl_int_is_one(aff
->v
->el
[0]))
2864 p
= isl_printer_print_str(p
, "(");
2865 p
= print_ls_partial_affine_c(p
, aff
->ls
, aff
->v
->el
+ 1, 1 + total
);
2866 if (!isl_int_is_one(aff
->v
->el
[0])) {
2867 p
= isl_printer_print_str(p
, ")/");
2868 p
= isl_printer_print_isl_int(p
, aff
->v
->el
[0]);
2873 /* In the C format, we cannot express that "pwaff" may be undefined
2874 * on parts of the domain space. We therefore assume that the expression
2875 * will only be evaluated on its definition domain and compute the gist
2876 * of each cell with respect to this domain.
2878 static __isl_give isl_printer
*print_pw_aff_c(__isl_take isl_printer
*p
,
2879 __isl_keep isl_pw_aff
*pwaff
)
2882 isl_ast_build
*build
;
2886 isl_die(p
->ctx
, isl_error_unsupported
,
2887 "cannot print empty isl_pw_aff in C format",
2888 return isl_printer_free(p
));
2890 domain
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff
));
2891 build
= isl_ast_build_from_context(domain
);
2892 expr
= isl_ast_build_expr_from_pw_aff(build
, isl_pw_aff_copy(pwaff
));
2893 p
= isl_printer_print_ast_expr(p
, expr
);
2894 isl_ast_expr_free(expr
);
2895 isl_ast_build_free(build
);
2900 __isl_give isl_printer
*isl_printer_print_aff(__isl_take isl_printer
*p
,
2901 __isl_keep isl_aff
*aff
)
2906 if (p
->output_format
== ISL_FORMAT_ISL
)
2907 return print_aff_isl(p
, aff
);
2908 else if (p
->output_format
== ISL_FORMAT_C
)
2909 return print_aff_c(p
, aff
);
2910 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2913 isl_printer_free(p
);
2917 __isl_give isl_printer
*isl_printer_print_pw_aff(__isl_take isl_printer
*p
,
2918 __isl_keep isl_pw_aff
*pwaff
)
2923 if (p
->output_format
== ISL_FORMAT_ISL
)
2924 return print_pw_aff_isl(p
, pwaff
);
2925 else if (p
->output_format
== ISL_FORMAT_C
)
2926 return print_pw_aff_c(p
, pwaff
);
2927 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
2930 isl_printer_free(p
);
2936 #include "isl_union_print_templ.c"
2938 /* Print the isl_union_pw_aff "upa" to "p".
2940 * We currently only support an isl format.
2942 __isl_give isl_printer
*isl_printer_print_union_pw_aff(
2943 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_aff
*upa
)
2946 return isl_printer_free(p
);
2948 if (p
->output_format
== ISL_FORMAT_ISL
)
2949 return print_union_pw_aff_isl(p
, upa
);
2950 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
2951 "unsupported output format", return isl_printer_free(p
));
2954 /* Print dimension "pos" of data->space to "p".
2956 * data->user is assumed to be an isl_multi_aff.
2958 * If the current dimension is an output dimension, then print
2959 * the corresponding expression. Otherwise, print the name of the dimension.
2960 * Make sure to use the domain space for printing names as
2961 * that is the space that will be used for printing constraints (if any).
2963 static __isl_give isl_printer
*print_dim_ma(__isl_take isl_printer
*p
,
2964 struct isl_print_space_data
*data
, unsigned pos
)
2966 isl_multi_aff
*ma
= data
->user
;
2969 space
= isl_multi_aff_get_domain_space(ma
);
2970 if (data
->type
== isl_dim_out
) {
2971 p
= print_aff_body(p
, space
, ma
->u
.p
[pos
]);
2973 enum isl_dim_type type
= data
->type
;
2975 if (type
== isl_dim_in
)
2977 p
= print_name(space
, p
, type
, pos
, data
->latex
);
2979 isl_space_free(space
);
2984 static __isl_give isl_printer
*print_body_multi_aff(__isl_take isl_printer
*p
,
2985 __isl_keep isl_multi_aff
*maff
)
2987 struct isl_print_space_data data
= { 0 };
2989 data
.print_dim
= &print_dim_ma
;
2991 return isl_print_space(maff
->space
, p
, 0, &data
);
2994 static __isl_give isl_printer
*print_multi_aff_isl(__isl_take isl_printer
*p
,
2995 __isl_keep isl_multi_aff
*maff
)
2997 struct isl_print_space_data data
= { 0 };
3002 p
= print_param_tuple(p
, maff
->space
, &data
);
3003 p
= isl_printer_print_str(p
, "{ ");
3004 p
= print_body_multi_aff(p
, maff
);
3005 p
= isl_printer_print_str(p
, " }");
3008 isl_printer_free(p
);
3012 __isl_give isl_printer
*isl_printer_print_multi_aff(__isl_take isl_printer
*p
,
3013 __isl_keep isl_multi_aff
*maff
)
3018 if (p
->output_format
== ISL_FORMAT_ISL
)
3019 return print_multi_aff_isl(p
, maff
);
3020 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3023 isl_printer_free(p
);
3028 #define BASE multi_aff
3029 #include "isl_pw_print_templ.c"
3031 /* Print the unnamed, single-dimensional piecewise multi affine expression "pma"
3034 static __isl_give isl_printer
*print_unnamed_pw_multi_aff_c(
3035 __isl_take isl_printer
*p
, __isl_keep isl_pw_multi_aff
*pma
)
3040 space
= isl_pw_multi_aff_get_domain_space(pma
);
3041 for (i
= 0; i
< pma
->n
- 1; ++i
) {
3042 p
= isl_printer_print_str(p
, "(");
3043 p
= print_set_c(p
, space
, pma
->p
[i
].set
);
3044 p
= isl_printer_print_str(p
, ") ? (");
3045 p
= print_aff_c(p
, pma
->p
[i
].maff
->u
.p
[0]);
3046 p
= isl_printer_print_str(p
, ") : ");
3048 isl_space_free(space
);
3050 return print_aff_c(p
, pma
->p
[pma
->n
- 1].maff
->u
.p
[0]);
3053 static __isl_give isl_printer
*print_pw_multi_aff_c(__isl_take isl_printer
*p
,
3054 __isl_keep isl_pw_multi_aff
*pma
)
3062 isl_die(p
->ctx
, isl_error_unsupported
,
3063 "cannot print empty isl_pw_multi_aff in C format",
3065 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
3067 return isl_printer_free(p
);
3068 name
= isl_pw_multi_aff_get_tuple_name(pma
, isl_dim_out
);
3069 if (!name
&& n
== 1)
3070 return print_unnamed_pw_multi_aff_c(p
, pma
);
3072 isl_die(p
->ctx
, isl_error_unsupported
,
3073 "cannot print unnamed isl_pw_multi_aff in C format",
3076 p
= isl_printer_print_str(p
, name
);
3078 isl_die(p
->ctx
, isl_error_unsupported
,
3079 "not supported yet", goto error
);
3083 isl_printer_free(p
);
3087 __isl_give isl_printer
*isl_printer_print_pw_multi_aff(
3088 __isl_take isl_printer
*p
, __isl_keep isl_pw_multi_aff
*pma
)
3093 if (p
->output_format
== ISL_FORMAT_ISL
)
3094 return print_pw_multi_aff_isl(p
, pma
);
3095 if (p
->output_format
== ISL_FORMAT_C
)
3096 return print_pw_multi_aff_c(p
, pma
);
3097 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3100 isl_printer_free(p
);
3105 #define BASE pw_multi_aff
3106 #include "isl_union_print_templ.c"
3108 __isl_give isl_printer
*isl_printer_print_union_pw_multi_aff(
3109 __isl_take isl_printer
*p
, __isl_keep isl_union_pw_multi_aff
*upma
)
3114 if (p
->output_format
== ISL_FORMAT_ISL
)
3115 return print_union_pw_multi_aff_isl(p
, upma
);
3116 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3119 isl_printer_free(p
);
3123 /* Print dimension "pos" of data->space to "p".
3125 * data->user is assumed to be an isl_multi_pw_aff.
3127 * If the current dimension is an output dimension, then print
3128 * the corresponding piecewise affine expression.
3129 * Otherwise, print the name of the dimension.
3130 * Make sure to use the same space in both cases.
3131 * In particular, use the domain space for printing names as
3132 * that is the space that is used for printing constraints.
3134 static __isl_give isl_printer
*print_dim_mpa(__isl_take isl_printer
*p
,
3135 struct isl_print_space_data
*data
, unsigned pos
)
3140 isl_multi_pw_aff
*mpa
= data
->user
;
3143 if (data
->type
!= isl_dim_out
) {
3144 enum isl_dim_type type
= data
->type
;
3146 if (type
== isl_dim_in
)
3148 space
= isl_multi_pw_aff_get_domain_space(mpa
);
3149 p
= print_name(space
, p
, type
, pos
, data
->latex
);
3150 isl_space_free(space
);
3156 return isl_printer_print_str(p
, "(0 : false)");
3158 need_parens
= pa
->n
!= 1 || !isl_set_plain_is_universe(pa
->p
[0].set
);
3160 p
= isl_printer_print_str(p
, "(");
3161 space
= isl_multi_pw_aff_get_domain_space(mpa
);
3162 for (i
= 0; i
< pa
->n
; ++i
) {
3165 p
= isl_printer_print_str(p
, "; ");
3166 p
= print_aff_body(p
, space
, pa
->p
[i
].aff
);
3167 p
= print_disjuncts(pa
->p
[i
].set
, space
, p
, 0);
3169 isl_space_free(space
);
3171 p
= isl_printer_print_str(p
, ")");
3176 /* Print "mpa" to "p" in isl format.
3178 * If "mpa" is zero-dimensional and has a non-trivial explicit domain,
3179 * then it is printed after the tuple of affine expressions.
3181 static __isl_give isl_printer
*print_multi_pw_aff_isl(__isl_take isl_printer
*p
,
3182 __isl_keep isl_multi_pw_aff
*mpa
)
3184 struct isl_print_space_data data
= { 0 };
3185 isl_bool has_domain
;
3188 return isl_printer_free(p
);
3190 p
= print_param_tuple(p
, mpa
->space
, &data
);
3191 p
= isl_printer_print_str(p
, "{ ");
3192 data
.print_dim
= &print_dim_mpa
;
3194 p
= isl_print_space(mpa
->space
, p
, 0, &data
);
3195 has_domain
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
3197 return isl_printer_free(p
);
3201 space
= isl_space_domain(isl_space_copy(mpa
->space
));
3202 p
= print_disjuncts_set(mpa
->u
.dom
, space
, p
, 0);
3203 isl_space_free(space
);
3205 p
= isl_printer_print_str(p
, " }");
3209 __isl_give isl_printer
*isl_printer_print_multi_pw_aff(
3210 __isl_take isl_printer
*p
, __isl_keep isl_multi_pw_aff
*mpa
)
3213 return isl_printer_free(p
);
3215 if (p
->output_format
== ISL_FORMAT_ISL
)
3216 return print_multi_pw_aff_isl(p
, mpa
);
3217 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3218 return isl_printer_free(p
));
3221 /* Print dimension "pos" of data->space to "p".
3223 * data->user is assumed to be an isl_multi_val.
3225 * If the current dimension is an output dimension, then print
3226 * the corresponding value. Otherwise, print the name of the dimension.
3228 static __isl_give isl_printer
*print_dim_mv(__isl_take isl_printer
*p
,
3229 struct isl_print_space_data
*data
, unsigned pos
)
3231 isl_multi_val
*mv
= data
->user
;
3233 if (data
->type
== isl_dim_out
)
3234 return isl_printer_print_val(p
, mv
->u
.p
[pos
]);
3236 return print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
3239 /* Print the isl_multi_val "mv" to "p" in isl format.
3241 static __isl_give isl_printer
*print_multi_val_isl(__isl_take isl_printer
*p
,
3242 __isl_keep isl_multi_val
*mv
)
3244 struct isl_print_space_data data
= { 0 };
3247 return isl_printer_free(p
);
3249 p
= print_param_tuple(p
, mv
->space
, &data
);
3250 p
= isl_printer_print_str(p
, "{ ");
3251 data
.print_dim
= &print_dim_mv
;
3253 p
= isl_print_space(mv
->space
, p
, 0, &data
);
3254 p
= isl_printer_print_str(p
, " }");
3258 /* Print the isl_multi_val "mv" to "p".
3260 * Currently only supported in isl format.
3262 __isl_give isl_printer
*isl_printer_print_multi_val(
3263 __isl_take isl_printer
*p
, __isl_keep isl_multi_val
*mv
)
3266 return isl_printer_free(p
);
3268 if (p
->output_format
== ISL_FORMAT_ISL
)
3269 return print_multi_val_isl(p
, mv
);
3270 isl_die(p
->ctx
, isl_error_unsupported
, "unsupported output format",
3271 return isl_printer_free(p
));
3274 /* Print dimension "pos" of data->space to "p".
3276 * data->user is assumed to be an isl_multi_id.
3278 * If the current dimension is an output dimension, then print
3279 * the corresponding identifier. Otherwise, print the name of the dimension.
3281 static __isl_give isl_printer
*print_dim_mi(__isl_take isl_printer
*p
,
3282 struct isl_print_space_data
*data
, unsigned pos
)
3284 isl_multi_id
*mi
= data
->user
;
3286 if (data
->type
== isl_dim_out
)
3287 return isl_printer_print_id(p
, mi
->u
.p
[pos
]);
3289 return print_name(data
->space
, p
, data
->type
, pos
, data
->latex
);
3292 /* Print the isl_multi_id "mi" to "p" in isl format.
3294 static __isl_give isl_printer
*print_multi_id_isl(__isl_take isl_printer
*p
,
3295 __isl_keep isl_multi_id
*mi
)
3298 struct isl_print_space_data data
= { 0 };
3300 space
= isl_multi_id_peek_space(mi
);
3301 p
= print_param_tuple(p
, space
, &data
);
3302 p
= isl_printer_print_str(p
, "{ ");
3303 data
.print_dim
= &print_dim_mi
;
3305 p
= isl_print_space(space
, p
, 0, &data
);
3306 p
= isl_printer_print_str(p
, " }");
3310 /* Print the isl_multi_id "mi" to "p".
3312 * Currently only supported in isl format.
3314 __isl_give isl_printer
*isl_printer_print_multi_id(
3315 __isl_take isl_printer
*p
, __isl_keep isl_multi_id
*mi
)
3318 return isl_printer_free(p
);
3320 if (p
->output_format
== ISL_FORMAT_ISL
)
3321 return print_multi_id_isl(p
, mi
);
3322 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
3323 "unsupported output format", return isl_printer_free(p
));
3326 /* Print dimension "pos" of data->space to "p".
3328 * data->user is assumed to be an isl_multi_union_pw_aff.
3330 * The current dimension is necessarily a set dimension, so
3331 * we print the corresponding isl_union_pw_aff, including
3334 static __isl_give isl_printer
*print_union_pw_aff_dim(__isl_take isl_printer
*p
,
3335 struct isl_print_space_data
*data
, unsigned pos
)
3337 isl_multi_union_pw_aff
*mupa
= data
->user
;
3338 isl_union_pw_aff
*upa
;
3340 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, pos
);
3341 p
= print_body_union_pw_aff(p
, upa
);
3342 isl_union_pw_aff_free(upa
);
3347 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3349 * If "mupa" is zero-dimensional and has a non-trivial explicit domain,
3350 * then it is printed after the tuple of affine expressions.
3351 * In order to clarify that this domain belongs to the expression,
3352 * the tuple along with the domain are placed inside parentheses.
3353 * If "mupa" has any parameters, then the opening parenthesis
3354 * appears after the parameter declarations.
3356 static __isl_give isl_printer
*print_multi_union_pw_aff_isl(
3357 __isl_take isl_printer
*p
, __isl_keep isl_multi_union_pw_aff
*mupa
)
3359 struct isl_print_space_data data
= { 0 };
3360 isl_bool has_domain
;
3364 return isl_printer_free(p
);
3365 has_domain
= isl_multi_union_pw_aff_has_non_trivial_domain(mupa
);
3367 return isl_printer_free(p
);
3369 space
= isl_multi_union_pw_aff_get_space(mupa
);
3370 p
= print_param_tuple(p
, space
, &data
);
3373 p
= isl_printer_print_str(p
, "(");
3375 data
.print_dim
= &print_union_pw_aff_dim
;
3378 p
= isl_print_space(space
, p
, 0, &data
);
3379 isl_space_free(space
);
3382 p
= isl_printer_print_str(p
, " : ");
3383 p
= isl_printer_print_union_set_isl_body(p
, mupa
->u
.dom
);
3384 p
= isl_printer_print_str(p
, ")");
3390 /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format.
3392 * We currently only support an isl format.
3394 __isl_give isl_printer
*isl_printer_print_multi_union_pw_aff(
3395 __isl_take isl_printer
*p
, __isl_keep isl_multi_union_pw_aff
*mupa
)
3398 return isl_printer_free(p
);
3400 if (p
->output_format
== ISL_FORMAT_ISL
)
3401 return print_multi_union_pw_aff_isl(p
, mupa
);
3402 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
3403 "unsupported output format", return isl_printer_free(p
));