2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
26 #include <isl/constraint.h>
27 #include "isl_space_private.h"
28 #include "isl_equalities.h"
29 #include <isl_lp_private.h>
33 #include <isl_reordering.h>
34 #include "isl_sample.h"
38 #include <isl_mat_private.h>
39 #include <isl_vec_private.h>
40 #include <isl_dim_map.h>
41 #include <isl_local_space_private.h>
42 #include <isl_aff_private.h>
43 #include <isl_options_private.h>
44 #include <isl_morph.h>
45 #include <isl_val_private.h>
47 #include <bset_to_bmap.c>
48 #include <bset_from_bmap.c>
49 #include <set_to_map.c>
50 #include <set_from_map.c>
52 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
55 case isl_dim_param
: return dim
->nparam
;
56 case isl_dim_in
: return dim
->n_in
;
57 case isl_dim_out
: return dim
->n_out
;
58 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
63 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
66 case isl_dim_param
: return 1;
67 case isl_dim_in
: return 1 + dim
->nparam
;
68 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
73 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
74 enum isl_dim_type type
)
79 case isl_dim_cst
: return 1;
82 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
83 case isl_dim_div
: return bmap
->n_div
;
84 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
89 /* Return the space of "map".
91 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
93 return map
? map
->dim
: NULL
;
96 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
98 return map
? n(map
->dim
, type
) : 0;
101 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
103 return set
? n(set
->dim
, type
) : 0;
106 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
107 enum isl_dim_type type
)
116 case isl_dim_cst
: return 0;
117 case isl_dim_param
: return 1;
118 case isl_dim_in
: return 1 + space
->nparam
;
119 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
120 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
126 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
127 enum isl_dim_type type
)
129 return isl_basic_map_offset(bset
, type
);
132 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
134 return pos(map
->dim
, type
);
137 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
138 enum isl_dim_type type
)
140 return isl_basic_map_dim(bset
, type
);
143 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
145 return isl_basic_set_dim(bset
, isl_dim_set
);
148 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
150 return isl_basic_set_dim(bset
, isl_dim_param
);
153 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
157 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
160 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
162 return isl_set_dim(set
, isl_dim_set
);
165 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
167 return isl_set_dim(set
, isl_dim_param
);
170 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
172 return bmap
? bmap
->dim
->n_in
: 0;
175 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
177 return bmap
? bmap
->dim
->n_out
: 0;
180 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
182 return bmap
? bmap
->dim
->nparam
: 0;
185 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
187 return bmap
? bmap
->n_div
: 0;
190 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
192 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
195 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
197 return map
? map
->dim
->n_in
: 0;
200 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
202 return map
? map
->dim
->n_out
: 0;
205 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
207 return map
? map
->dim
->nparam
: 0;
210 /* Return the number of equality constraints in the description of "bmap".
211 * Return -1 on error.
213 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
220 /* Return the number of equality constraints in the description of "bset".
221 * Return -1 on error.
223 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
225 return isl_basic_map_n_equality(bset_to_bmap(bset
));
228 /* Return the number of inequality constraints in the description of "bmap".
229 * Return -1 on error.
231 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
238 /* Return the number of inequality constraints in the description of "bset".
239 * Return -1 on error.
241 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
243 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
246 /* Do "bmap1" and "bmap2" have the same parameters?
248 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
249 __isl_keep isl_basic_map
*bmap2
)
251 isl_space
*space1
, *space2
;
253 space1
= isl_basic_map_peek_space(bmap1
);
254 space2
= isl_basic_map_peek_space(bmap2
);
255 return isl_space_has_equal_params(space1
, space2
);
258 /* Do "map1" and "map2" have the same parameters?
260 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
261 __isl_keep isl_map
*map2
)
263 isl_space
*space1
, *space2
;
265 space1
= isl_map_peek_space(map1
);
266 space2
= isl_map_peek_space(map2
);
267 return isl_space_has_equal_params(space1
, space2
);
270 /* Do "map" and "set" have the same parameters?
272 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
273 __isl_keep isl_set
*set
)
275 return isl_map_has_equal_params(map
, set_to_map(set
));
278 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
279 __isl_keep isl_set
*set
)
283 return isl_bool_error
;
284 m
= isl_map_has_equal_params(map
, set_to_map(set
));
287 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
288 set
->dim
, isl_dim_set
);
291 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
292 __isl_keep isl_basic_set
*bset
)
296 return isl_bool_error
;
297 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
300 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
301 bset
->dim
, isl_dim_set
);
304 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
305 __isl_keep isl_set
*set
)
309 return isl_bool_error
;
310 m
= isl_map_has_equal_params(map
, set_to_map(set
));
313 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
314 set
->dim
, isl_dim_set
);
317 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
318 __isl_keep isl_basic_set
*bset
)
322 return isl_bool_error
;
323 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
326 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
327 bset
->dim
, isl_dim_set
);
330 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
332 return bmap
? bmap
->ctx
: NULL
;
335 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
337 return bset
? bset
->ctx
: NULL
;
340 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
342 return map
? map
->ctx
: NULL
;
345 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
347 return set
? set
->ctx
: NULL
;
350 /* Return the space of "bmap".
352 __isl_keep isl_space
*isl_basic_map_peek_space(
353 __isl_keep
const isl_basic_map
*bmap
)
355 return bmap
? bmap
->dim
: NULL
;
358 /* Return the space of "bset".
360 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
362 return isl_basic_map_peek_space(bset_to_bmap(bset
));
365 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
367 return isl_space_copy(isl_basic_map_peek_space(bmap
));
370 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
372 return isl_basic_map_get_space(bset_to_bmap(bset
));
375 /* Extract the divs in "bmap" as a matrix.
377 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
388 ctx
= isl_basic_map_get_ctx(bmap
);
389 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
390 cols
= 1 + 1 + total
+ bmap
->n_div
;
391 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
395 for (i
= 0; i
< bmap
->n_div
; ++i
)
396 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
401 /* Extract the divs in "bset" as a matrix.
403 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
405 return isl_basic_map_get_divs(bset
);
408 __isl_give isl_local_space
*isl_basic_map_get_local_space(
409 __isl_keep isl_basic_map
*bmap
)
416 div
= isl_basic_map_get_divs(bmap
);
417 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
420 __isl_give isl_local_space
*isl_basic_set_get_local_space(
421 __isl_keep isl_basic_set
*bset
)
423 return isl_basic_map_get_local_space(bset
);
426 /* For each known div d = floor(f/m), add the constraints
429 * -(f-(m-1)) + m d >= 0
431 * Do not finalize the result.
433 static __isl_give isl_basic_map
*add_known_div_constraints(
434 __isl_take isl_basic_map
*bmap
)
441 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
444 bmap
= isl_basic_map_cow(bmap
);
445 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
448 for (i
= 0; i
< n_div
; ++i
) {
449 if (isl_int_is_zero(bmap
->div
[i
][0]))
451 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
452 return isl_basic_map_free(bmap
);
458 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
459 __isl_take isl_local_space
*ls
)
468 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
469 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
470 n_div
, 0, 2 * n_div
);
472 for (i
= 0; i
< n_div
; ++i
)
473 if (isl_basic_map_alloc_div(bmap
) < 0)
476 for (i
= 0; i
< n_div
; ++i
)
477 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
478 bmap
= add_known_div_constraints(bmap
);
480 isl_local_space_free(ls
);
483 isl_local_space_free(ls
);
484 isl_basic_map_free(bmap
);
488 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
489 __isl_take isl_local_space
*ls
)
491 return isl_basic_map_from_local_space(ls
);
494 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
496 return isl_space_copy(isl_map_peek_space(map
));
499 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
503 return isl_space_copy(set
->dim
);
506 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
507 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
509 bmap
= isl_basic_map_cow(bmap
);
512 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
515 bmap
= isl_basic_map_finalize(bmap
);
518 isl_basic_map_free(bmap
);
522 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
523 __isl_take isl_basic_set
*bset
, const char *s
)
525 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
528 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
529 enum isl_dim_type type
)
531 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
534 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
535 enum isl_dim_type type
, const char *s
)
539 map
= isl_map_cow(map
);
543 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
547 for (i
= 0; i
< map
->n
; ++i
) {
548 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
559 /* Replace the identifier of the tuple of type "type" by "id".
561 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
562 __isl_take isl_basic_map
*bmap
,
563 enum isl_dim_type type
, __isl_take isl_id
*id
)
565 bmap
= isl_basic_map_cow(bmap
);
568 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
570 return isl_basic_map_free(bmap
);
571 bmap
= isl_basic_map_finalize(bmap
);
578 /* Replace the identifier of the tuple by "id".
580 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
581 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
583 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
586 /* Does the input or output tuple have a name?
588 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
590 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
593 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
594 enum isl_dim_type type
)
596 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
599 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
602 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
606 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
607 enum isl_dim_type type
, __isl_take isl_id
*id
)
609 map
= isl_map_cow(map
);
613 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
615 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
621 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
622 __isl_take isl_id
*id
)
624 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
627 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
628 enum isl_dim_type type
)
630 map
= isl_map_cow(map
);
634 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
636 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
639 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
641 return isl_map_reset_tuple_id(set
, isl_dim_set
);
644 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
646 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
649 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
650 enum isl_dim_type type
)
652 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
655 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
657 return isl_map_has_tuple_id(set
, isl_dim_set
);
660 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
662 return isl_map_get_tuple_id(set
, isl_dim_set
);
665 /* Does the set tuple have a name?
667 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
670 return isl_bool_error
;
671 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
675 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
677 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
680 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
682 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
685 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
686 enum isl_dim_type type
, unsigned pos
)
688 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
691 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
692 enum isl_dim_type type
, unsigned pos
)
694 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
697 /* Does the given dimension have a name?
699 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
700 enum isl_dim_type type
, unsigned pos
)
703 return isl_bool_error
;
704 return isl_space_has_dim_name(map
->dim
, type
, pos
);
707 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
708 enum isl_dim_type type
, unsigned pos
)
710 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
713 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
714 enum isl_dim_type type
, unsigned pos
)
716 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
719 /* Does the given dimension have a name?
721 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
722 enum isl_dim_type type
, unsigned pos
)
725 return isl_bool_error
;
726 return isl_space_has_dim_name(set
->dim
, type
, pos
);
729 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
730 __isl_take isl_basic_map
*bmap
,
731 enum isl_dim_type type
, unsigned pos
, const char *s
)
733 bmap
= isl_basic_map_cow(bmap
);
736 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
739 return isl_basic_map_finalize(bmap
);
741 isl_basic_map_free(bmap
);
745 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
746 enum isl_dim_type type
, unsigned pos
, const char *s
)
750 map
= isl_map_cow(map
);
754 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
758 for (i
= 0; i
< map
->n
; ++i
) {
759 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
770 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
771 __isl_take isl_basic_set
*bset
,
772 enum isl_dim_type type
, unsigned pos
, const char *s
)
774 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
778 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
779 enum isl_dim_type type
, unsigned pos
, const char *s
)
781 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
785 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
786 enum isl_dim_type type
, unsigned pos
)
789 return isl_bool_error
;
790 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
793 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
794 enum isl_dim_type type
, unsigned pos
)
796 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
799 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
800 enum isl_dim_type type
, unsigned pos
)
802 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
805 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
806 enum isl_dim_type type
, unsigned pos
)
808 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
811 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
812 enum isl_dim_type type
, unsigned pos
)
814 return isl_map_has_dim_id(set
, type
, pos
);
817 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
818 enum isl_dim_type type
, unsigned pos
)
820 return isl_map_get_dim_id(set
, type
, pos
);
823 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
824 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
826 map
= isl_map_cow(map
);
830 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
832 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
838 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
839 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
841 return isl_map_set_dim_id(set
, type
, pos
, id
);
844 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
845 __isl_keep isl_id
*id
)
849 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
852 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
853 __isl_keep isl_id
*id
)
855 return isl_map_find_dim_by_id(set
, type
, id
);
858 /* Return the position of the dimension of the given type and name
860 * Return -1 if no such dimension can be found.
862 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
863 enum isl_dim_type type
, const char *name
)
867 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
870 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
875 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
878 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
881 return isl_map_find_dim_by_name(set
, type
, name
);
884 /* Check whether equality i of bset is a pure stride constraint
885 * on a single dimension, i.e., of the form
889 * with k a constant and e an existentially quantified variable.
891 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
900 return isl_bool_error
;
902 if (!isl_int_is_zero(bset
->eq
[i
][0]))
903 return isl_bool_false
;
905 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
906 d
= isl_basic_set_dim(bset
, isl_dim_set
);
907 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
909 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
910 return isl_bool_false
;
911 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
913 return isl_bool_false
;
914 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
916 return isl_bool_false
;
918 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
920 return isl_bool_false
;
921 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
922 n_div
- pos2
- 1) != -1)
923 return isl_bool_false
;
924 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
925 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
926 return isl_bool_false
;
928 return isl_bool_true
;
931 /* Reset the user pointer on all identifiers of parameters and tuples
932 * of the space of "map".
934 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
938 space
= isl_map_get_space(map
);
939 space
= isl_space_reset_user(space
);
940 map
= isl_map_reset_space(map
, space
);
945 /* Reset the user pointer on all identifiers of parameters and tuples
946 * of the space of "set".
948 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
950 return isl_map_reset_user(set
);
953 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
956 return isl_bool_error
;
957 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
960 /* Has "map" been marked as a rational map?
961 * In particular, have all basic maps in "map" been marked this way?
962 * An empty map is not considered to be rational.
963 * Maps where only some of the basic maps are marked rational
966 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
972 return isl_bool_error
;
974 return isl_bool_false
;
975 rational
= isl_basic_map_is_rational(map
->p
[0]);
978 for (i
= 1; i
< map
->n
; ++i
) {
981 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
984 if (rational
!= rational_i
)
985 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
986 "mixed rational and integer basic maps "
987 "not supported", return isl_bool_error
);
993 /* Has "set" been marked as a rational set?
994 * In particular, have all basic set in "set" been marked this way?
995 * An empty set is not considered to be rational.
996 * Sets where only some of the basic sets are marked rational
999 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1001 return isl_map_is_rational(set
);
1004 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1006 return isl_basic_map_is_rational(bset
);
1009 /* Does "bmap" contain any rational points?
1011 * If "bmap" has an equality for each dimension, equating the dimension
1012 * to an integer constant, then it has no rational points, even if it
1013 * is marked as rational.
1015 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1017 isl_bool has_rational
= isl_bool_true
;
1021 return isl_bool_error
;
1022 if (isl_basic_map_plain_is_empty(bmap
))
1023 return isl_bool_false
;
1024 if (!isl_basic_map_is_rational(bmap
))
1025 return isl_bool_false
;
1026 bmap
= isl_basic_map_copy(bmap
);
1027 bmap
= isl_basic_map_implicit_equalities(bmap
);
1029 return isl_bool_error
;
1030 total
= isl_basic_map_total_dim(bmap
);
1031 if (bmap
->n_eq
== total
) {
1033 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1034 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1037 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1038 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1040 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1045 if (i
== bmap
->n_eq
)
1046 has_rational
= isl_bool_false
;
1048 isl_basic_map_free(bmap
);
1050 return has_rational
;
1053 /* Does "map" contain any rational points?
1055 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1058 isl_bool has_rational
;
1061 return isl_bool_error
;
1062 for (i
= 0; i
< map
->n
; ++i
) {
1063 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1064 if (has_rational
< 0 || has_rational
)
1065 return has_rational
;
1067 return isl_bool_false
;
1070 /* Does "set" contain any rational points?
1072 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1074 return isl_map_has_rational(set
);
1077 /* Is this basic set a parameter domain?
1079 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1082 return isl_bool_error
;
1083 return isl_space_is_params(bset
->dim
);
1086 /* Is this set a parameter domain?
1088 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1091 return isl_bool_error
;
1092 return isl_space_is_params(set
->dim
);
1095 /* Is this map actually a parameter domain?
1096 * Users should never call this function. Outside of isl,
1097 * a map can never be a parameter domain.
1099 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1102 return isl_bool_error
;
1103 return isl_space_is_params(map
->dim
);
1106 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1107 struct isl_basic_map
*bmap
, unsigned extra
,
1108 unsigned n_eq
, unsigned n_ineq
)
1111 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1116 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1117 if (isl_blk_is_error(bmap
->block
))
1120 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1121 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1125 bmap
->block2
= isl_blk_empty();
1128 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1129 if (isl_blk_is_error(bmap
->block2
))
1132 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1137 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1138 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1140 for (i
= 0; i
< extra
; ++i
)
1141 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1145 bmap
->c_size
= n_eq
+ n_ineq
;
1146 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1147 bmap
->extra
= extra
;
1151 bmap
->sample
= NULL
;
1155 isl_basic_map_free(bmap
);
1159 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1160 unsigned nparam
, unsigned dim
, unsigned extra
,
1161 unsigned n_eq
, unsigned n_ineq
)
1163 struct isl_basic_map
*bmap
;
1166 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1170 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1171 return bset_from_bmap(bmap
);
1174 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1175 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1177 struct isl_basic_map
*bmap
;
1180 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1181 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1182 return bset_from_bmap(bmap
);
1184 isl_space_free(dim
);
1188 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1189 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1191 struct isl_basic_map
*bmap
;
1195 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1200 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1202 isl_space_free(dim
);
1206 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1207 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1208 unsigned n_eq
, unsigned n_ineq
)
1210 struct isl_basic_map
*bmap
;
1213 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1217 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1221 static void dup_constraints(
1222 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1225 unsigned total
= isl_basic_map_total_dim(src
);
1227 for (i
= 0; i
< src
->n_eq
; ++i
) {
1228 int j
= isl_basic_map_alloc_equality(dst
);
1229 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1232 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1233 int j
= isl_basic_map_alloc_inequality(dst
);
1234 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1237 for (i
= 0; i
< src
->n_div
; ++i
) {
1238 int j
= isl_basic_map_alloc_div(dst
);
1239 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1241 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1244 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1246 struct isl_basic_map
*dup
;
1250 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1251 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1254 dup_constraints(dup
, bmap
);
1255 dup
->flags
= bmap
->flags
;
1256 dup
->sample
= isl_vec_copy(bmap
->sample
);
1260 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1262 struct isl_basic_map
*dup
;
1264 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1265 return bset_from_bmap(dup
);
1268 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1273 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1277 return isl_basic_set_dup(bset
);
1280 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1289 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1294 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1298 bmap
= isl_basic_map_dup(bmap
);
1300 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1304 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1313 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1318 if (--bmap
->ref
> 0)
1321 isl_ctx_deref(bmap
->ctx
);
1323 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1325 isl_blk_free(bmap
->ctx
, bmap
->block
);
1326 isl_vec_free(bmap
->sample
);
1327 isl_space_free(bmap
->dim
);
1333 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1335 return isl_basic_map_free(bset_to_bmap(bset
));
1338 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1340 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1343 /* Check that "map" has only named parameters, reporting an error
1346 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1348 return isl_space_check_named_params(isl_map_peek_space(map
));
1351 /* Check that "bmap1" and "bmap2" have the same parameters,
1352 * reporting an error if they do not.
1354 static isl_stat
isl_basic_map_check_equal_params(
1355 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1359 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1361 return isl_stat_error
;
1363 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1364 "parameters don't match", return isl_stat_error
);
1368 __isl_give isl_map
*isl_map_align_params_map_map_and(
1369 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1370 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1371 __isl_take isl_map
*map2
))
1375 if (isl_map_has_equal_params(map1
, map2
))
1376 return fn(map1
, map2
);
1377 if (isl_map_check_named_params(map1
) < 0)
1379 if (isl_map_check_named_params(map2
) < 0)
1381 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1382 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1383 return fn(map1
, map2
);
1390 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1391 __isl_keep isl_map
*map2
,
1392 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1397 return isl_bool_error
;
1398 if (isl_map_has_equal_params(map1
, map2
))
1399 return fn(map1
, map2
);
1400 if (isl_map_check_named_params(map1
) < 0)
1401 return isl_bool_error
;
1402 if (isl_map_check_named_params(map2
) < 0)
1403 return isl_bool_error
;
1404 map1
= isl_map_copy(map1
);
1405 map2
= isl_map_copy(map2
);
1406 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1407 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1414 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1416 struct isl_ctx
*ctx
;
1420 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1421 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1423 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1424 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1426 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1427 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1428 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1430 int j
= isl_basic_map_alloc_inequality(bmap
);
1434 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1435 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1442 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1443 bmap
->extra
- bmap
->n_div
);
1444 return bmap
->n_eq
++;
1447 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1449 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1452 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1456 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1461 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1463 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1466 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1471 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1473 if (pos
!= bmap
->n_eq
- 1) {
1475 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1476 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1482 /* Turn inequality "pos" of "bmap" into an equality.
1484 * In particular, we move the inequality in front of the equalities
1485 * and move the last inequality in the position of the moved inequality.
1486 * Note that isl_tab_make_equalities_explicit depends on this particular
1487 * change in the ordering of the constraints.
1489 void isl_basic_map_inequality_to_equality(
1490 struct isl_basic_map
*bmap
, unsigned pos
)
1494 t
= bmap
->ineq
[pos
];
1495 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1496 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1501 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1504 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1507 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1509 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1512 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1514 struct isl_ctx
*ctx
;
1518 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1519 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1523 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1524 1 + isl_basic_map_total_dim(bmap
),
1525 bmap
->extra
- bmap
->n_div
);
1526 return bmap
->n_ineq
++;
1529 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1531 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1534 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1538 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1543 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1545 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1548 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1553 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1555 if (pos
!= bmap
->n_ineq
- 1) {
1556 t
= bmap
->ineq
[pos
];
1557 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1558 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1559 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1565 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1567 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1570 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1575 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1578 k
= isl_basic_map_alloc_equality(bmap
);
1581 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1584 isl_basic_map_free(bmap
);
1588 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1591 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1594 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1599 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1602 k
= isl_basic_map_alloc_inequality(bmap
);
1605 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1608 isl_basic_map_free(bmap
);
1612 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1615 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1618 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1622 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1623 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1624 1 + 1 + isl_basic_map_total_dim(bmap
),
1625 bmap
->extra
- bmap
->n_div
);
1626 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1627 return bmap
->n_div
++;
1630 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1632 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1635 /* Check that there are "n" dimensions of type "type" starting at "first"
1638 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1639 enum isl_dim_type type
, unsigned first
, unsigned n
)
1644 return isl_stat_error
;
1645 dim
= isl_basic_map_dim(bmap
, type
);
1646 if (first
+ n
> dim
|| first
+ n
< first
)
1647 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1648 "position or range out of bounds",
1649 return isl_stat_error
);
1653 /* Insert an extra integer division, prescribed by "div", to "bmap"
1654 * at (integer division) position "pos".
1656 * The integer division is first added at the end and then moved
1657 * into the right position.
1659 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1660 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1664 bmap
= isl_basic_map_cow(bmap
);
1666 return isl_basic_map_free(bmap
);
1668 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1669 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1670 "unexpected size", return isl_basic_map_free(bmap
));
1671 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1672 return isl_basic_map_free(bmap
);
1674 bmap
= isl_basic_map_extend_space(bmap
,
1675 isl_basic_map_get_space(bmap
), 1, 0, 2);
1676 k
= isl_basic_map_alloc_div(bmap
);
1678 return isl_basic_map_free(bmap
);
1679 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1680 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1682 for (i
= k
; i
> pos
; --i
)
1683 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1688 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1691 return isl_stat_error
;
1692 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1697 /* Copy constraint from src to dst, putting the vars of src at offset
1698 * dim_off in dst and the divs of src at offset div_off in dst.
1699 * If both sets are actually map, then dim_off applies to the input
1702 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1703 struct isl_basic_map
*src_map
, isl_int
*src
,
1704 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1706 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1707 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1708 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1709 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1710 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1711 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1712 isl_int_set(dst
[0], src
[0]);
1713 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1714 if (dst_nparam
> src_nparam
)
1715 isl_seq_clr(dst
+1+src_nparam
,
1716 dst_nparam
- src_nparam
);
1717 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1718 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1720 isl_min(dst_in
-in_off
, src_in
));
1721 if (dst_in
-in_off
> src_in
)
1722 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1723 dst_in
- in_off
- src_in
);
1724 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1725 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1726 src
+1+src_nparam
+src_in
,
1727 isl_min(dst_out
-out_off
, src_out
));
1728 if (dst_out
-out_off
> src_out
)
1729 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1730 dst_out
- out_off
- src_out
);
1731 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1732 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1733 src
+1+src_nparam
+src_in
+src_out
,
1734 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1735 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1736 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1737 div_off
+src_map
->n_div
,
1738 dst_map
->n_div
- div_off
- src_map
->n_div
);
1741 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1742 struct isl_basic_map
*src_map
, isl_int
*src
,
1743 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1745 isl_int_set(dst
[0], src
[0]);
1746 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1749 static __isl_give isl_basic_map
*add_constraints(
1750 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1751 unsigned i_pos
, unsigned o_pos
)
1756 if (!bmap1
|| !bmap2
)
1759 div_off
= bmap1
->n_div
;
1761 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1762 int i1
= isl_basic_map_alloc_equality(bmap1
);
1765 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1766 i_pos
, o_pos
, div_off
);
1769 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1770 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1773 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1774 i_pos
, o_pos
, div_off
);
1777 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1778 int i1
= isl_basic_map_alloc_div(bmap1
);
1781 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1782 i_pos
, o_pos
, div_off
);
1785 isl_basic_map_free(bmap2
);
1790 isl_basic_map_free(bmap1
);
1791 isl_basic_map_free(bmap2
);
1795 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1796 struct isl_basic_set
*bset2
, unsigned pos
)
1798 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1799 bset_to_bmap(bset2
), 0, pos
));
1802 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1803 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1804 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1806 struct isl_basic_map
*ext
;
1816 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1817 base
->extra
>= base
->n_div
+ extra
;
1819 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1820 room_for_ineq(base
, n_ineq
)) {
1821 isl_space_free(dim
);
1825 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1826 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1827 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1828 extra
+= base
->extra
;
1830 n_ineq
+= base
->n_ineq
;
1832 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1838 ext
->sample
= isl_vec_copy(base
->sample
);
1839 flags
= base
->flags
;
1840 ext
= add_constraints(ext
, base
, 0, 0);
1843 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1849 isl_space_free(dim
);
1850 isl_basic_map_free(base
);
1854 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1855 __isl_take isl_basic_set
*base
,
1856 __isl_take isl_space
*dim
, unsigned extra
,
1857 unsigned n_eq
, unsigned n_ineq
)
1859 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1860 dim
, extra
, n_eq
, n_ineq
));
1863 struct isl_basic_map
*isl_basic_map_extend_constraints(
1864 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1868 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1872 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1873 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1874 unsigned n_eq
, unsigned n_ineq
)
1876 struct isl_basic_map
*bmap
;
1881 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1885 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1888 isl_basic_map_free(base
);
1892 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1893 unsigned nparam
, unsigned dim
, unsigned extra
,
1894 unsigned n_eq
, unsigned n_ineq
)
1896 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1897 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1900 struct isl_basic_set
*isl_basic_set_extend_constraints(
1901 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1903 isl_basic_map
*bmap
= bset_to_bmap(base
);
1904 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1905 return bset_from_bmap(bmap
);
1908 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1910 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1913 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1918 if (bmap
->ref
> 1) {
1920 bmap
= isl_basic_map_dup(bmap
);
1923 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1924 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1929 /* Clear all cached information in "map", either because it is about
1930 * to be modified or because it is being freed.
1931 * Always return the same pointer that is passed in.
1932 * This is needed for the use in isl_map_free.
1934 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1936 isl_basic_map_free(map
->cached_simple_hull
[0]);
1937 isl_basic_map_free(map
->cached_simple_hull
[1]);
1938 map
->cached_simple_hull
[0] = NULL
;
1939 map
->cached_simple_hull
[1] = NULL
;
1943 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1945 return isl_map_cow(set
);
1948 /* Return an isl_map that is equal to "map" and that has only
1949 * a single reference.
1951 * If the original input already has only one reference, then
1952 * simply return it, but clear all cached information, since
1953 * it may be rendered invalid by the operations that will be
1954 * performed on the result.
1956 * Otherwise, create a duplicate (without any cached information).
1958 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1964 return clear_caches(map
);
1966 return isl_map_dup(map
);
1969 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1970 unsigned a_len
, unsigned b_len
)
1972 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1973 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1974 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1977 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1978 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1986 isl_assert(bmap
->ctx
,
1987 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1989 if (n1
== 0 || n2
== 0)
1992 bmap
= isl_basic_map_cow(bmap
);
1996 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1997 if (isl_blk_is_error(blk
))
2000 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2002 bmap
->eq
[i
] + pos
, n1
, n2
);
2004 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2006 bmap
->ineq
[i
] + pos
, n1
, n2
);
2008 for (i
= 0; i
< bmap
->n_div
; ++i
)
2010 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2012 isl_blk_free(bmap
->ctx
, blk
);
2014 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2015 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2016 return isl_basic_map_finalize(bmap
);
2018 isl_basic_map_free(bmap
);
2022 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2023 __isl_take isl_basic_map
*bmap
)
2029 total
= isl_basic_map_total_dim(bmap
);
2030 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2031 return isl_basic_map_free(bmap
);
2032 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2034 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2036 i
= isl_basic_map_alloc_equality(bmap
);
2040 isl_int_set_si(bmap
->eq
[i
][0], 1);
2041 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2042 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2043 isl_vec_free(bmap
->sample
);
2044 bmap
->sample
= NULL
;
2045 return isl_basic_map_finalize(bmap
);
2047 isl_basic_map_free(bmap
);
2051 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2052 __isl_take isl_basic_set
*bset
)
2054 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2057 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2058 __isl_take isl_basic_map
*bmap
)
2063 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2066 bmap
= isl_basic_map_cow(bmap
);
2070 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2072 return isl_basic_map_finalize(bmap
);
2075 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2076 __isl_take isl_basic_set
*bset
)
2078 return isl_basic_map_set_rational(bset
);
2081 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2082 __isl_take isl_basic_set
*bset
)
2087 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2090 bset
= isl_basic_set_cow(bset
);
2094 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2096 return isl_basic_set_finalize(bset
);
2099 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2103 map
= isl_map_cow(map
);
2106 for (i
= 0; i
< map
->n
; ++i
) {
2107 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2117 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2119 return isl_map_set_rational(set
);
2122 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2125 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2127 isl_int
*t
= bmap
->div
[a
];
2128 bmap
->div
[a
] = bmap
->div
[b
];
2132 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2133 * div definitions accordingly.
2135 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2138 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2140 swap_div(bmap
, a
, b
);
2142 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2143 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2145 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2146 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2148 for (i
= 0; i
< bmap
->n_div
; ++i
)
2149 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2150 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2153 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2154 * div definitions accordingly.
2156 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2158 isl_basic_map_swap_div(bset
, a
, b
);
2161 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2163 isl_seq_cpy(c
, c
+ n
, rem
);
2164 isl_seq_clr(c
+ rem
, n
);
2167 /* Drop n dimensions starting at first.
2169 * In principle, this frees up some extra variables as the number
2170 * of columns remains constant, but we would have to extend
2171 * the div array too as the number of rows in this array is assumed
2172 * to be equal to extra.
2174 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2175 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2177 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2180 /* Move "n" divs starting at "first" to the end of the list of divs.
2182 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2183 unsigned first
, unsigned n
)
2188 if (first
+ n
== bmap
->n_div
)
2191 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2194 for (i
= 0; i
< n
; ++i
)
2195 div
[i
] = bmap
->div
[first
+ i
];
2196 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2197 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2198 for (i
= 0; i
< n
; ++i
)
2199 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2203 isl_basic_map_free(bmap
);
2207 /* Drop "n" dimensions of type "type" starting at "first".
2209 * In principle, this frees up some extra variables as the number
2210 * of columns remains constant, but we would have to extend
2211 * the div array too as the number of rows in this array is assumed
2212 * to be equal to extra.
2214 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2215 enum isl_dim_type type
, unsigned first
, unsigned n
)
2225 dim
= isl_basic_map_dim(bmap
, type
);
2226 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2228 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2231 bmap
= isl_basic_map_cow(bmap
);
2235 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2236 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2237 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2238 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2240 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2241 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2243 for (i
= 0; i
< bmap
->n_div
; ++i
)
2244 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2246 if (type
== isl_dim_div
) {
2247 bmap
= move_divs_last(bmap
, first
, n
);
2250 if (isl_basic_map_free_div(bmap
, n
) < 0)
2251 return isl_basic_map_free(bmap
);
2253 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2257 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2258 bmap
= isl_basic_map_simplify(bmap
);
2259 return isl_basic_map_finalize(bmap
);
2261 isl_basic_map_free(bmap
);
2265 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2266 enum isl_dim_type type
, unsigned first
, unsigned n
)
2268 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2272 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2273 enum isl_dim_type type
, unsigned first
, unsigned n
)
2280 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2282 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2284 map
= isl_map_cow(map
);
2287 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2291 for (i
= 0; i
< map
->n
; ++i
) {
2292 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2296 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2304 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2305 enum isl_dim_type type
, unsigned first
, unsigned n
)
2307 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2311 * We don't cow, as the div is assumed to be redundant.
2313 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2314 __isl_take isl_basic_map
*bmap
, unsigned div
)
2322 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2324 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2326 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2327 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2329 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2330 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2331 isl_basic_map_drop_inequality(bmap
, i
);
2335 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2338 for (i
= 0; i
< bmap
->n_div
; ++i
)
2339 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2341 if (div
!= bmap
->n_div
- 1) {
2343 isl_int
*t
= bmap
->div
[div
];
2345 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2346 bmap
->div
[j
] = bmap
->div
[j
+1];
2348 bmap
->div
[bmap
->n_div
- 1] = t
;
2350 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2351 if (isl_basic_map_free_div(bmap
, 1) < 0)
2352 return isl_basic_map_free(bmap
);
2356 isl_basic_map_free(bmap
);
2360 /* Eliminate the specified n dimensions starting at first from the
2361 * constraints, without removing the dimensions from the space.
2362 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2364 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2365 enum isl_dim_type type
, unsigned first
, unsigned n
)
2374 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2375 isl_die(map
->ctx
, isl_error_invalid
,
2376 "index out of bounds", goto error
);
2378 map
= isl_map_cow(map
);
2382 for (i
= 0; i
< map
->n
; ++i
) {
2383 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2393 /* Eliminate the specified n dimensions starting at first from the
2394 * constraints, without removing the dimensions from the space.
2395 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2397 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2398 enum isl_dim_type type
, unsigned first
, unsigned n
)
2400 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2403 /* Eliminate the specified n dimensions starting at first from the
2404 * constraints, without removing the dimensions from the space.
2405 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2407 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2408 unsigned first
, unsigned n
)
2410 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2413 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2414 __isl_take isl_basic_map
*bmap
)
2418 bmap
= isl_basic_map_eliminate_vars(bmap
,
2419 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2423 return isl_basic_map_finalize(bmap
);
2426 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2427 __isl_take isl_basic_set
*bset
)
2429 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2432 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2441 map
= isl_map_cow(map
);
2445 for (i
= 0; i
< map
->n
; ++i
) {
2446 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2456 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2458 return isl_map_remove_divs(set
);
2461 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2462 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2463 unsigned first
, unsigned n
)
2465 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2466 return isl_basic_map_free(bmap
);
2467 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2469 bmap
= isl_basic_map_eliminate_vars(bmap
,
2470 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2473 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2475 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2479 /* Return true if the definition of the given div (recursively) involves
2480 * any of the given variables.
2482 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2483 unsigned first
, unsigned n
)
2486 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2488 if (isl_int_is_zero(bmap
->div
[div
][0]))
2489 return isl_bool_false
;
2490 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2491 return isl_bool_true
;
2493 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2496 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2498 involves
= div_involves_vars(bmap
, i
, first
, n
);
2499 if (involves
< 0 || involves
)
2503 return isl_bool_false
;
2506 /* Try and add a lower and/or upper bound on "div" to "bmap"
2507 * based on inequality "i".
2508 * "total" is the total number of variables (excluding the divs).
2509 * "v" is a temporary object that can be used during the calculations.
2510 * If "lb" is set, then a lower bound should be constructed.
2511 * If "ub" is set, then an upper bound should be constructed.
2513 * The calling function has already checked that the inequality does not
2514 * reference "div", but we still need to check that the inequality is
2515 * of the right form. We'll consider the case where we want to construct
2516 * a lower bound. The construction of upper bounds is similar.
2518 * Let "div" be of the form
2520 * q = floor((a + f(x))/d)
2522 * We essentially check if constraint "i" is of the form
2526 * so that we can use it to derive a lower bound on "div".
2527 * However, we allow a slightly more general form
2531 * with the condition that the coefficients of g(x) - f(x) are all
2533 * Rewriting this constraint as
2537 * adding a + f(x) to both sides and dividing by d, we obtain
2539 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2541 * Taking the floor on both sides, we obtain
2543 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2547 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2549 * In the case of an upper bound, we construct the constraint
2551 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2554 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2555 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2556 unsigned total
, isl_int v
, int lb
, int ub
)
2560 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2562 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2563 bmap
->div
[div
][1 + 1 + j
]);
2564 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2567 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2568 bmap
->div
[div
][1 + 1 + j
]);
2569 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2575 bmap
= isl_basic_map_cow(bmap
);
2576 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2578 int k
= isl_basic_map_alloc_inequality(bmap
);
2581 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2582 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2583 bmap
->div
[div
][1 + j
]);
2584 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2585 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2587 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2590 int k
= isl_basic_map_alloc_inequality(bmap
);
2593 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2594 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2595 bmap
->div
[div
][1 + j
]);
2596 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2597 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2599 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2602 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2605 isl_basic_map_free(bmap
);
2609 /* This function is called right before "div" is eliminated from "bmap"
2610 * using Fourier-Motzkin.
2611 * Look through the constraints of "bmap" for constraints on the argument
2612 * of the integer division and use them to construct constraints on the
2613 * integer division itself. These constraints can then be combined
2614 * during the Fourier-Motzkin elimination.
2615 * Note that it is only useful to introduce lower bounds on "div"
2616 * if "bmap" already contains upper bounds on "div" as the newly
2617 * introduce lower bounds can then be combined with the pre-existing
2618 * upper bounds. Similarly for upper bounds.
2619 * We therefore first check if "bmap" contains any lower and/or upper bounds
2622 * It is interesting to note that the introduction of these constraints
2623 * can indeed lead to more accurate results, even when compared to
2624 * deriving constraints on the argument of "div" from constraints on "div".
2625 * Consider, for example, the set
2627 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2629 * The second constraint can be rewritten as
2631 * 2 * [(-i-2j+3)/4] + k >= 0
2633 * from which we can derive
2635 * -i - 2j + 3 >= -2k
2641 * Combined with the first constraint, we obtain
2643 * -3 <= 3 + 2k or k >= -3
2645 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2646 * the first constraint, we obtain
2648 * [(i + 2j)/4] >= [-3/4] = -1
2650 * Combining this constraint with the second constraint, we obtain
2654 static __isl_give isl_basic_map
*insert_bounds_on_div(
2655 __isl_take isl_basic_map
*bmap
, int div
)
2658 int check_lb
, check_ub
;
2665 if (isl_int_is_zero(bmap
->div
[div
][0]))
2668 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2672 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2673 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2680 if (!check_lb
&& !check_ub
)
2685 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2686 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2689 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2690 check_lb
, check_ub
);
2698 /* Remove all divs (recursively) involving any of the given dimensions
2699 * in their definitions.
2701 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2702 __isl_take isl_basic_map
*bmap
,
2703 enum isl_dim_type type
, unsigned first
, unsigned n
)
2707 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2708 return isl_basic_map_free(bmap
);
2709 first
+= isl_basic_map_offset(bmap
, type
);
2711 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2714 involves
= div_involves_vars(bmap
, i
, first
, n
);
2716 return isl_basic_map_free(bmap
);
2719 bmap
= insert_bounds_on_div(bmap
, i
);
2720 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2729 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2730 __isl_take isl_basic_set
*bset
,
2731 enum isl_dim_type type
, unsigned first
, unsigned n
)
2733 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2736 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2737 enum isl_dim_type type
, unsigned first
, unsigned n
)
2746 map
= isl_map_cow(map
);
2750 for (i
= 0; i
< map
->n
; ++i
) {
2751 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2762 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2763 enum isl_dim_type type
, unsigned first
, unsigned n
)
2765 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2769 /* Does the description of "bmap" depend on the specified dimensions?
2770 * We also check whether the dimensions appear in any of the div definitions.
2771 * In principle there is no need for this check. If the dimensions appear
2772 * in a div definition, they also appear in the defining constraints of that
2775 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2776 enum isl_dim_type type
, unsigned first
, unsigned n
)
2780 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2781 return isl_bool_error
;
2783 first
+= isl_basic_map_offset(bmap
, type
);
2784 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2785 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2786 return isl_bool_true
;
2787 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2788 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2789 return isl_bool_true
;
2790 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2791 if (isl_int_is_zero(bmap
->div
[i
][0]))
2793 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2794 return isl_bool_true
;
2797 return isl_bool_false
;
2800 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2801 enum isl_dim_type type
, unsigned first
, unsigned n
)
2806 return isl_bool_error
;
2808 if (first
+ n
> isl_map_dim(map
, type
))
2809 isl_die(map
->ctx
, isl_error_invalid
,
2810 "index out of bounds", return isl_bool_error
);
2812 for (i
= 0; i
< map
->n
; ++i
) {
2813 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2815 if (involves
< 0 || involves
)
2819 return isl_bool_false
;
2822 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2823 enum isl_dim_type type
, unsigned first
, unsigned n
)
2825 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2828 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2829 enum isl_dim_type type
, unsigned first
, unsigned n
)
2831 return isl_map_involves_dims(set
, type
, first
, n
);
2834 /* Drop all constraints in bmap that involve any of the dimensions
2835 * first to first+n-1.
2837 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2838 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2845 bmap
= isl_basic_map_cow(bmap
);
2850 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2851 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2853 isl_basic_map_drop_equality(bmap
, i
);
2856 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2857 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2859 isl_basic_map_drop_inequality(bmap
, i
);
2862 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2866 /* Drop all constraints in bset that involve any of the dimensions
2867 * first to first+n-1.
2869 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2870 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2872 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2875 /* Drop all constraints in bmap that do not involve any of the dimensions
2876 * first to first + n - 1 of the given type.
2878 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2879 __isl_take isl_basic_map
*bmap
,
2880 enum isl_dim_type type
, unsigned first
, unsigned n
)
2885 isl_space
*space
= isl_basic_map_get_space(bmap
);
2886 isl_basic_map_free(bmap
);
2887 return isl_basic_map_universe(space
);
2889 bmap
= isl_basic_map_cow(bmap
);
2893 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2894 return isl_basic_map_free(bmap
);
2896 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2898 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2899 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2901 isl_basic_map_drop_equality(bmap
, i
);
2904 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2905 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2907 isl_basic_map_drop_inequality(bmap
, i
);
2910 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2914 /* Drop all constraints in bset that do not involve any of the dimensions
2915 * first to first + n - 1 of the given type.
2917 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2918 __isl_take isl_basic_set
*bset
,
2919 enum isl_dim_type type
, unsigned first
, unsigned n
)
2921 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2925 /* Drop all constraints in bmap that involve any of the dimensions
2926 * first to first + n - 1 of the given type.
2928 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2929 __isl_take isl_basic_map
*bmap
,
2930 enum isl_dim_type type
, unsigned first
, unsigned n
)
2937 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2938 return isl_basic_map_free(bmap
);
2940 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2941 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2942 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2945 /* Drop all constraints in bset that involve any of the dimensions
2946 * first to first + n - 1 of the given type.
2948 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2949 __isl_take isl_basic_set
*bset
,
2950 enum isl_dim_type type
, unsigned first
, unsigned n
)
2952 return isl_basic_map_drop_constraints_involving_dims(bset
,
2956 /* Drop constraints from "map" by applying "drop" to each basic map.
2958 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2959 enum isl_dim_type type
, unsigned first
, unsigned n
,
2960 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2961 enum isl_dim_type type
, unsigned first
, unsigned n
))
2969 dim
= isl_map_dim(map
, type
);
2970 if (first
+ n
> dim
|| first
+ n
< first
)
2971 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2972 "index out of bounds", return isl_map_free(map
));
2974 map
= isl_map_cow(map
);
2978 for (i
= 0; i
< map
->n
; ++i
) {
2979 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2981 return isl_map_free(map
);
2985 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2990 /* Drop all constraints in map that involve any of the dimensions
2991 * first to first + n - 1 of the given type.
2993 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2994 __isl_take isl_map
*map
,
2995 enum isl_dim_type type
, unsigned first
, unsigned n
)
2999 return drop_constraints(map
, type
, first
, n
,
3000 &isl_basic_map_drop_constraints_involving_dims
);
3003 /* Drop all constraints in "map" that do not involve any of the dimensions
3004 * first to first + n - 1 of the given type.
3006 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3007 __isl_take isl_map
*map
,
3008 enum isl_dim_type type
, unsigned first
, unsigned n
)
3011 isl_space
*space
= isl_map_get_space(map
);
3013 return isl_map_universe(space
);
3015 return drop_constraints(map
, type
, first
, n
,
3016 &isl_basic_map_drop_constraints_not_involving_dims
);
3019 /* Drop all constraints in set that involve any of the dimensions
3020 * first to first + n - 1 of the given type.
3022 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3023 __isl_take isl_set
*set
,
3024 enum isl_dim_type type
, unsigned first
, unsigned n
)
3026 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3029 /* Drop all constraints in "set" that do not involve any of the dimensions
3030 * first to first + n - 1 of the given type.
3032 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3033 __isl_take isl_set
*set
,
3034 enum isl_dim_type type
, unsigned first
, unsigned n
)
3036 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3039 /* Does local variable "div" of "bmap" have a complete explicit representation?
3040 * Having a complete explicit representation requires not only
3041 * an explicit representation, but also that all local variables
3042 * that appear in this explicit representation in turn have
3043 * a complete explicit representation.
3045 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3048 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3051 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3052 if (marked
< 0 || marked
)
3053 return isl_bool_not(marked
);
3055 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3058 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3060 known
= isl_basic_map_div_is_known(bmap
, i
);
3061 if (known
< 0 || !known
)
3065 return isl_bool_true
;
3068 /* Remove all divs that are unknown or defined in terms of unknown divs.
3070 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3071 __isl_take isl_basic_map
*bmap
)
3078 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3079 if (isl_basic_map_div_is_known(bmap
, i
))
3081 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3090 /* Remove all divs that are unknown or defined in terms of unknown divs.
3092 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3093 __isl_take isl_basic_set
*bset
)
3095 return isl_basic_map_remove_unknown_divs(bset
);
3098 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3107 map
= isl_map_cow(map
);
3111 for (i
= 0; i
< map
->n
; ++i
) {
3112 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3122 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3124 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3127 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3128 __isl_take isl_basic_set
*bset
,
3129 enum isl_dim_type type
, unsigned first
, unsigned n
)
3131 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3132 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3133 return bset_from_bmap(bmap
);
3136 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3137 enum isl_dim_type type
, unsigned first
, unsigned n
)
3144 map
= isl_map_cow(map
);
3147 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3149 for (i
= 0; i
< map
->n
; ++i
) {
3150 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3151 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3155 map
= isl_map_drop(map
, type
, first
, n
);
3162 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3163 enum isl_dim_type type
, unsigned first
, unsigned n
)
3165 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3169 /* Project out n inputs starting at first using Fourier-Motzkin */
3170 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3171 unsigned first
, unsigned n
)
3173 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3176 static void dump_term(struct isl_basic_map
*bmap
,
3177 isl_int c
, int pos
, FILE *out
)
3180 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3181 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3182 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3184 isl_int_print(out
, c
, 0);
3186 if (!isl_int_is_one(c
))
3187 isl_int_print(out
, c
, 0);
3188 if (pos
< 1 + nparam
) {
3189 name
= isl_space_get_dim_name(bmap
->dim
,
3190 isl_dim_param
, pos
- 1);
3192 fprintf(out
, "%s", name
);
3194 fprintf(out
, "p%d", pos
- 1);
3195 } else if (pos
< 1 + nparam
+ in
)
3196 fprintf(out
, "i%d", pos
- 1 - nparam
);
3197 else if (pos
< 1 + nparam
+ dim
)
3198 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3200 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3204 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3205 int sign
, FILE *out
)
3209 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3213 for (i
= 0, first
= 1; i
< len
; ++i
) {
3214 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3217 fprintf(out
, " + ");
3219 isl_int_abs(v
, c
[i
]);
3220 dump_term(bmap
, v
, i
, out
);
3227 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3228 const char *op
, FILE *out
, int indent
)
3232 fprintf(out
, "%*s", indent
, "");
3234 dump_constraint_sign(bmap
, c
, 1, out
);
3235 fprintf(out
, " %s ", op
);
3236 dump_constraint_sign(bmap
, c
, -1, out
);
3240 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3241 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3243 fprintf(out
, "%*s", indent
, "");
3244 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3249 static void dump_constraints(struct isl_basic_map
*bmap
,
3250 isl_int
**c
, unsigned n
,
3251 const char *op
, FILE *out
, int indent
)
3255 for (i
= 0; i
< n
; ++i
)
3256 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3259 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3263 unsigned total
= isl_basic_map_total_dim(bmap
);
3265 for (j
= 0; j
< 1 + total
; ++j
) {
3266 if (isl_int_is_zero(exp
[j
]))
3268 if (!first
&& isl_int_is_pos(exp
[j
]))
3270 dump_term(bmap
, exp
[j
], j
, out
);
3275 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3279 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3280 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3282 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3283 fprintf(out
, "%*s", indent
, "");
3284 fprintf(out
, "e%d = [(", i
);
3285 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3287 isl_int_print(out
, bmap
->div
[i
][0], 0);
3288 fprintf(out
, "]\n");
3292 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3293 FILE *out
, int indent
)
3296 fprintf(out
, "null basic set\n");
3300 fprintf(out
, "%*s", indent
, "");
3301 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3302 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3303 bset
->extra
, bset
->flags
);
3304 dump(bset_to_bmap(bset
), out
, indent
);
3307 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3308 FILE *out
, int indent
)
3311 fprintf(out
, "null basic map\n");
3315 fprintf(out
, "%*s", indent
, "");
3316 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3317 "flags: %x, n_name: %d\n",
3319 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3320 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3321 dump(bmap
, out
, indent
);
3324 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3329 total
= isl_basic_map_total_dim(bmap
);
3330 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3331 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3332 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3333 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3337 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3342 if (isl_space_dim(space
, isl_dim_in
) != 0)
3343 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3344 "set cannot have input dimensions", goto error
);
3345 return isl_map_alloc_space(space
, n
, flags
);
3347 isl_space_free(space
);
3351 /* Make sure "map" has room for at least "n" more basic maps.
3353 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3356 struct isl_map
*grown
= NULL
;
3360 isl_assert(map
->ctx
, n
>= 0, goto error
);
3361 if (map
->n
+ n
<= map
->size
)
3363 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3366 for (i
= 0; i
< map
->n
; ++i
) {
3367 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3375 isl_map_free(grown
);
3380 /* Make sure "set" has room for at least "n" more basic sets.
3382 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3384 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3387 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3389 return isl_map_from_basic_map(bset
);
3392 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3394 struct isl_map
*map
;
3399 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3400 return isl_map_add_basic_map(map
, bmap
);
3403 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3404 __isl_take isl_basic_set
*bset
)
3406 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3407 bset_to_bmap(bset
)));
3410 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3412 return isl_map_free(set
);
3415 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3420 fprintf(out
, "null set\n");
3424 fprintf(out
, "%*s", indent
, "");
3425 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3426 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3428 for (i
= 0; i
< set
->n
; ++i
) {
3429 fprintf(out
, "%*s", indent
, "");
3430 fprintf(out
, "basic set %d:\n", i
);
3431 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3435 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3440 fprintf(out
, "null map\n");
3444 fprintf(out
, "%*s", indent
, "");
3445 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3446 "flags: %x, n_name: %d\n",
3447 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3448 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3449 for (i
= 0; i
< map
->n
; ++i
) {
3450 fprintf(out
, "%*s", indent
, "");
3451 fprintf(out
, "basic map %d:\n", i
);
3452 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3456 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3457 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3459 struct isl_basic_map
*bmap_domain
;
3461 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3464 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3465 isl_assert(bset
->ctx
,
3466 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3468 bmap
= isl_basic_map_cow(bmap
);
3471 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3472 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3473 bmap_domain
= isl_basic_map_from_domain(bset
);
3474 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3476 bmap
= isl_basic_map_simplify(bmap
);
3477 return isl_basic_map_finalize(bmap
);
3479 isl_basic_map_free(bmap
);
3480 isl_basic_set_free(bset
);
3484 /* Check that the space of "bset" is the same as that of the range of "bmap".
3486 static isl_stat
isl_basic_map_check_compatible_range(
3487 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3491 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3493 return isl_stat_error
;
3495 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3496 "incompatible spaces", return isl_stat_error
);
3501 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3502 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3504 struct isl_basic_map
*bmap_range
;
3506 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3509 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3510 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3513 if (isl_basic_set_plain_is_universe(bset
)) {
3514 isl_basic_set_free(bset
);
3518 bmap
= isl_basic_map_cow(bmap
);
3521 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3522 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3523 bmap_range
= bset_to_bmap(bset
);
3524 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3526 bmap
= isl_basic_map_simplify(bmap
);
3527 return isl_basic_map_finalize(bmap
);
3529 isl_basic_map_free(bmap
);
3530 isl_basic_set_free(bset
);
3534 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3535 __isl_keep isl_vec
*vec
)
3542 return isl_bool_error
;
3544 total
= 1 + isl_basic_map_total_dim(bmap
);
3545 if (total
!= vec
->size
)
3546 return isl_bool_false
;
3550 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3551 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3552 if (!isl_int_is_zero(s
)) {
3554 return isl_bool_false
;
3558 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3559 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3560 if (isl_int_is_neg(s
)) {
3562 return isl_bool_false
;
3568 return isl_bool_true
;
3571 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3572 __isl_keep isl_vec
*vec
)
3574 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3577 __isl_give isl_basic_map
*isl_basic_map_intersect(
3578 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3580 struct isl_vec
*sample
= NULL
;
3582 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3584 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3585 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3586 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3587 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3588 return isl_basic_map_intersect(bmap2
, bmap1
);
3590 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3591 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3592 isl_assert(bmap1
->ctx
,
3593 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3595 if (isl_basic_map_plain_is_empty(bmap1
)) {
3596 isl_basic_map_free(bmap2
);
3599 if (isl_basic_map_plain_is_empty(bmap2
)) {
3600 isl_basic_map_free(bmap1
);
3604 if (bmap1
->sample
&&
3605 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3606 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3607 sample
= isl_vec_copy(bmap1
->sample
);
3608 else if (bmap2
->sample
&&
3609 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3610 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3611 sample
= isl_vec_copy(bmap2
->sample
);
3613 bmap1
= isl_basic_map_cow(bmap1
);
3616 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3617 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3618 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3621 isl_vec_free(sample
);
3623 isl_vec_free(bmap1
->sample
);
3624 bmap1
->sample
= sample
;
3627 bmap1
= isl_basic_map_simplify(bmap1
);
3628 return isl_basic_map_finalize(bmap1
);
3631 isl_vec_free(sample
);
3632 isl_basic_map_free(bmap1
);
3633 isl_basic_map_free(bmap2
);
3637 struct isl_basic_set
*isl_basic_set_intersect(
3638 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3640 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3641 bset_to_bmap(bset2
)));
3644 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3645 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3647 return isl_basic_set_intersect(bset1
, bset2
);
3650 /* Special case of isl_map_intersect, where both map1 and map2
3651 * are convex, without any divs and such that either map1 or map2
3652 * contains a single constraint. This constraint is then simply
3653 * added to the other map.
3655 static __isl_give isl_map
*map_intersect_add_constraint(
3656 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3658 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3659 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3660 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3661 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3663 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3664 return isl_map_intersect(map2
, map1
);
3666 map1
= isl_map_cow(map1
);
3669 if (isl_map_plain_is_empty(map1
)) {
3673 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3674 if (map2
->p
[0]->n_eq
== 1)
3675 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3677 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3678 map2
->p
[0]->ineq
[0]);
3680 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3681 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3685 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3686 isl_basic_map_free(map1
->p
[0]);
3699 /* map2 may be either a parameter domain or a map living in the same
3702 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3703 __isl_take isl_map
*map2
)
3712 if ((isl_map_plain_is_empty(map1
) ||
3713 isl_map_plain_is_universe(map2
)) &&
3714 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3718 if ((isl_map_plain_is_empty(map2
) ||
3719 isl_map_plain_is_universe(map1
)) &&
3720 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3725 if (map1
->n
== 1 && map2
->n
== 1 &&
3726 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3727 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3728 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3729 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3730 return map_intersect_add_constraint(map1
, map2
);
3732 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3733 isl_space_dim(map2
->dim
, isl_dim_param
))
3734 isl_assert(map1
->ctx
,
3735 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3737 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3738 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3739 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3741 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3742 map1
->n
* map2
->n
, flags
);
3745 for (i
= 0; i
< map1
->n
; ++i
)
3746 for (j
= 0; j
< map2
->n
; ++j
) {
3747 struct isl_basic_map
*part
;
3748 part
= isl_basic_map_intersect(
3749 isl_basic_map_copy(map1
->p
[i
]),
3750 isl_basic_map_copy(map2
->p
[j
]));
3751 if (isl_basic_map_is_empty(part
) < 0)
3752 part
= isl_basic_map_free(part
);
3753 result
= isl_map_add_basic_map(result
, part
);
3766 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3767 __isl_take isl_map
*map2
)
3771 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3772 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3773 "spaces don't match", goto error
);
3774 return map_intersect_internal(map1
, map2
);
3781 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3782 __isl_take isl_map
*map2
)
3784 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3787 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3789 return set_from_map(isl_map_intersect(set_to_map(set1
),
3793 /* map_intersect_internal accepts intersections
3794 * with parameter domains, so we can just call that function.
3796 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3797 __isl_take isl_set
*params
)
3799 return map_intersect_internal(map
, params
);
3802 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3803 __isl_take isl_map
*map2
)
3805 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3808 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3809 __isl_take isl_set
*params
)
3811 return isl_map_intersect_params(set
, params
);
3814 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3817 unsigned pos
, n1
, n2
;
3821 bmap
= isl_basic_map_cow(bmap
);
3824 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3825 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3826 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3827 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3828 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3829 return isl_basic_map_reset_space(bmap
, space
);
3832 static __isl_give isl_basic_map
*basic_map_space_reset(
3833 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3839 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3842 space
= isl_basic_map_get_space(bmap
);
3843 space
= isl_space_reset(space
, type
);
3844 bmap
= isl_basic_map_reset_space(bmap
, space
);
3848 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3849 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3850 unsigned pos
, unsigned n
)
3854 struct isl_basic_map
*res
;
3855 struct isl_dim_map
*dim_map
;
3856 unsigned total
, off
;
3857 enum isl_dim_type t
;
3860 return basic_map_space_reset(bmap
, type
);
3865 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3867 total
= isl_basic_map_total_dim(bmap
) + n
;
3868 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3870 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3872 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3874 unsigned size
= isl_basic_map_dim(bmap
, t
);
3875 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3877 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3878 pos
, size
- pos
, off
+ pos
+ n
);
3880 off
+= isl_space_dim(res_dim
, t
);
3882 isl_dim_map_div(dim_map
, bmap
, off
);
3884 res
= isl_basic_map_alloc_space(res_dim
,
3885 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3886 rational
= isl_basic_map_is_rational(bmap
);
3888 res
= isl_basic_map_free(res
);
3890 res
= isl_basic_map_set_rational(res
);
3891 if (isl_basic_map_plain_is_empty(bmap
)) {
3892 isl_basic_map_free(bmap
);
3894 return isl_basic_map_set_to_empty(res
);
3896 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3897 return isl_basic_map_finalize(res
);
3900 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3901 __isl_take isl_basic_set
*bset
,
3902 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3904 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3907 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3908 enum isl_dim_type type
, unsigned n
)
3912 return isl_basic_map_insert_dims(bmap
, type
,
3913 isl_basic_map_dim(bmap
, type
), n
);
3916 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3917 enum isl_dim_type type
, unsigned n
)
3921 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3922 return isl_basic_map_add_dims(bset
, type
, n
);
3924 isl_basic_set_free(bset
);
3928 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3929 enum isl_dim_type type
)
3933 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3936 space
= isl_map_get_space(map
);
3937 space
= isl_space_reset(space
, type
);
3938 map
= isl_map_reset_space(map
, space
);
3942 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3943 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3948 return map_space_reset(map
, type
);
3950 map
= isl_map_cow(map
);
3954 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3958 for (i
= 0; i
< map
->n
; ++i
) {
3959 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3970 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3971 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3973 return isl_map_insert_dims(set
, type
, pos
, n
);
3976 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3977 enum isl_dim_type type
, unsigned n
)
3981 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3984 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3985 enum isl_dim_type type
, unsigned n
)
3989 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3990 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3996 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3997 __isl_take isl_basic_map
*bmap
,
3998 enum isl_dim_type dst_type
, unsigned dst_pos
,
3999 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4001 struct isl_dim_map
*dim_map
;
4002 struct isl_basic_map
*res
;
4003 enum isl_dim_type t
;
4004 unsigned total
, off
;
4009 bmap
= isl_basic_map_reset(bmap
, src_type
);
4010 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4014 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4015 return isl_basic_map_free(bmap
);
4017 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4020 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4022 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4023 pos(bmap
->dim
, src_type
) + src_pos
+
4024 ((src_type
< dst_type
) ? n
: 0)) {
4025 bmap
= isl_basic_map_cow(bmap
);
4029 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4030 src_type
, src_pos
, n
);
4034 bmap
= isl_basic_map_finalize(bmap
);
4039 total
= isl_basic_map_total_dim(bmap
);
4040 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4043 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4044 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4045 if (t
== dst_type
) {
4046 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4049 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4052 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4053 dst_pos
, size
- dst_pos
, off
);
4054 off
+= size
- dst_pos
;
4055 } else if (t
== src_type
) {
4056 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4059 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4060 src_pos
+ n
, size
- src_pos
- n
, off
);
4061 off
+= size
- src_pos
- n
;
4063 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4067 isl_dim_map_div(dim_map
, bmap
, off
);
4069 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4070 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4071 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4075 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4076 src_type
, src_pos
, n
);
4080 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4081 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4082 bmap
= isl_basic_map_finalize(bmap
);
4086 isl_basic_map_free(bmap
);
4090 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4091 enum isl_dim_type dst_type
, unsigned dst_pos
,
4092 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4094 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4095 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4096 src_type
, src_pos
, n
);
4097 return bset_from_bmap(bmap
);
4100 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4101 enum isl_dim_type dst_type
, unsigned dst_pos
,
4102 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4106 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4107 return set_from_map(isl_map_move_dims(set_to_map(set
),
4108 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4114 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4115 enum isl_dim_type dst_type
, unsigned dst_pos
,
4116 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4123 map
= isl_map_reset(map
, src_type
);
4124 map
= isl_map_reset(map
, dst_type
);
4128 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
4131 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4134 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4136 map
= isl_map_cow(map
);
4140 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4144 for (i
= 0; i
< map
->n
; ++i
) {
4145 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4147 src_type
, src_pos
, n
);
4158 /* Move the specified dimensions to the last columns right before
4159 * the divs. Don't change the dimension specification of bmap.
4160 * That's the responsibility of the caller.
4162 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4163 enum isl_dim_type type
, unsigned first
, unsigned n
)
4165 struct isl_dim_map
*dim_map
;
4166 struct isl_basic_map
*res
;
4167 enum isl_dim_type t
;
4168 unsigned total
, off
;
4172 if (pos(bmap
->dim
, type
) + first
+ n
==
4173 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4176 total
= isl_basic_map_total_dim(bmap
);
4177 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4180 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4181 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4183 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4186 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4187 first
, n
, total
- bmap
->n_div
- n
);
4188 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4189 first
+ n
, size
- (first
+ n
), off
);
4190 off
+= size
- (first
+ n
);
4192 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4196 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4198 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4199 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4200 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4204 /* Insert "n" rows in the divs of "bmap".
4206 * The number of columns is not changed, which means that the last
4207 * dimensions of "bmap" are being reintepreted as the new divs.
4208 * The space of "bmap" is not adjusted, however, which means
4209 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4210 * from the space of "bmap" is the responsibility of the caller.
4212 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4220 bmap
= isl_basic_map_cow(bmap
);
4224 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4225 old
= bmap
->block2
.data
;
4226 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4227 (bmap
->extra
+ n
) * (1 + row_size
));
4228 if (!bmap
->block2
.data
)
4229 return isl_basic_map_free(bmap
);
4230 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4232 return isl_basic_map_free(bmap
);
4233 for (i
= 0; i
< n
; ++i
) {
4234 new_div
[i
] = bmap
->block2
.data
+
4235 (bmap
->extra
+ i
) * (1 + row_size
);
4236 isl_seq_clr(new_div
[i
], 1 + row_size
);
4238 for (i
= 0; i
< bmap
->extra
; ++i
)
4239 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4241 bmap
->div
= new_div
;
4248 /* Drop constraints from "bmap" that only involve the variables
4249 * of "type" in the range [first, first + n] that are not related
4250 * to any of the variables outside that interval.
4251 * These constraints cannot influence the values for the variables
4252 * outside the interval, except in case they cause "bmap" to be empty.
4253 * Only drop the constraints if "bmap" is known to be non-empty.
4255 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4256 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4257 unsigned first
, unsigned n
)
4261 unsigned dim
, n_div
;
4264 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4266 return isl_basic_map_free(bmap
);
4270 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4271 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4272 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4274 return isl_basic_map_free(bmap
);
4275 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4276 for (i
= 0; i
< first
; ++i
)
4278 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4281 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4286 /* Turn the n dimensions of type type, starting at first
4287 * into existentially quantified variables.
4289 * If a subset of the projected out variables are unrelated
4290 * to any of the variables that remain, then the constraints
4291 * involving this subset are simply dropped first.
4293 __isl_give isl_basic_map
*isl_basic_map_project_out(
4294 __isl_take isl_basic_map
*bmap
,
4295 enum isl_dim_type type
, unsigned first
, unsigned n
)
4300 return basic_map_space_reset(bmap
, type
);
4301 if (type
== isl_dim_div
)
4302 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4303 "cannot project out existentially quantified variables",
4304 return isl_basic_map_free(bmap
));
4306 empty
= isl_basic_map_plain_is_empty(bmap
);
4308 return isl_basic_map_free(bmap
);
4310 bmap
= isl_basic_map_set_to_empty(bmap
);
4312 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4316 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4317 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4319 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4320 return isl_basic_map_free(bmap
);
4322 bmap
= move_last(bmap
, type
, first
, n
);
4323 bmap
= isl_basic_map_cow(bmap
);
4324 bmap
= insert_div_rows(bmap
, n
);
4328 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4331 bmap
= isl_basic_map_simplify(bmap
);
4332 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4333 return isl_basic_map_finalize(bmap
);
4335 isl_basic_map_free(bmap
);
4339 /* Turn the n dimensions of type type, starting at first
4340 * into existentially quantified variables.
4342 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4343 enum isl_dim_type type
, unsigned first
, unsigned n
)
4345 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4349 /* Turn the n dimensions of type type, starting at first
4350 * into existentially quantified variables.
4352 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4353 enum isl_dim_type type
, unsigned first
, unsigned n
)
4361 return map_space_reset(map
, type
);
4363 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
4365 map
= isl_map_cow(map
);
4369 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4373 for (i
= 0; i
< map
->n
; ++i
) {
4374 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4385 /* Turn the n dimensions of type type, starting at first
4386 * into existentially quantified variables.
4388 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4389 enum isl_dim_type type
, unsigned first
, unsigned n
)
4391 return set_from_map(isl_map_project_out(set_to_map(set
),
4395 /* Return a map that projects the elements in "set" onto their
4396 * "n" set dimensions starting at "first".
4397 * "type" should be equal to isl_dim_set.
4399 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4400 enum isl_dim_type type
, unsigned first
, unsigned n
)
4408 if (type
!= isl_dim_set
)
4409 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4410 "only set dimensions can be projected out", goto error
);
4411 dim
= isl_set_dim(set
, isl_dim_set
);
4412 if (first
+ n
> dim
|| first
+ n
< first
)
4413 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4414 "index out of bounds", goto error
);
4416 map
= isl_map_from_domain(set
);
4417 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4418 for (i
= 0; i
< n
; ++i
)
4419 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4427 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4431 for (i
= 0; i
< n
; ++i
) {
4432 j
= isl_basic_map_alloc_div(bmap
);
4435 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4439 isl_basic_map_free(bmap
);
4443 struct isl_basic_map
*isl_basic_map_apply_range(
4444 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4446 isl_space
*dim_result
= NULL
;
4447 struct isl_basic_map
*bmap
;
4448 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4449 struct isl_dim_map
*dim_map1
, *dim_map2
;
4451 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4453 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4454 bmap2
->dim
, isl_dim_in
))
4455 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4456 "spaces don't match", goto error
);
4458 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4459 isl_space_copy(bmap2
->dim
));
4461 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4462 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4463 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4464 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4466 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4467 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4468 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4469 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4470 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4471 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4472 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4473 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4474 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4475 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4476 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4478 bmap
= isl_basic_map_alloc_space(dim_result
,
4479 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4480 bmap1
->n_eq
+ bmap2
->n_eq
,
4481 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4482 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4483 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4484 bmap
= add_divs(bmap
, n
);
4485 bmap
= isl_basic_map_simplify(bmap
);
4486 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4487 return isl_basic_map_finalize(bmap
);
4489 isl_basic_map_free(bmap1
);
4490 isl_basic_map_free(bmap2
);
4494 struct isl_basic_set
*isl_basic_set_apply(
4495 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4500 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4503 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4506 isl_basic_set_free(bset
);
4507 isl_basic_map_free(bmap
);
4511 struct isl_basic_map
*isl_basic_map_apply_domain(
4512 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4514 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4516 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4517 bmap2
->dim
, isl_dim_in
))
4518 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4519 "spaces don't match", goto error
);
4521 bmap1
= isl_basic_map_reverse(bmap1
);
4522 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4523 return isl_basic_map_reverse(bmap1
);
4525 isl_basic_map_free(bmap1
);
4526 isl_basic_map_free(bmap2
);
4530 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4531 * A \cap B -> f(A) + f(B)
4533 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4534 __isl_take isl_basic_map
*bmap2
)
4536 unsigned n_in
, n_out
, nparam
, total
, pos
;
4537 struct isl_basic_map
*bmap
= NULL
;
4538 struct isl_dim_map
*dim_map1
, *dim_map2
;
4541 if (!bmap1
|| !bmap2
)
4544 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4547 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4548 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4549 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4551 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4552 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4553 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4554 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4555 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4556 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4557 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4558 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4559 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4560 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4561 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4563 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4564 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4565 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4566 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4567 for (i
= 0; i
< n_out
; ++i
) {
4568 int j
= isl_basic_map_alloc_equality(bmap
);
4571 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4572 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4573 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4574 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4576 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4577 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4578 bmap
= add_divs(bmap
, 2 * n_out
);
4580 bmap
= isl_basic_map_simplify(bmap
);
4581 return isl_basic_map_finalize(bmap
);
4583 isl_basic_map_free(bmap
);
4584 isl_basic_map_free(bmap1
);
4585 isl_basic_map_free(bmap2
);
4589 /* Given two maps A -> f(A) and B -> g(B), construct a map
4590 * A \cap B -> f(A) + f(B)
4592 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4593 __isl_take isl_map
*map2
)
4595 struct isl_map
*result
;
4601 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4603 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4604 map1
->n
* map2
->n
, 0);
4607 for (i
= 0; i
< map1
->n
; ++i
)
4608 for (j
= 0; j
< map2
->n
; ++j
) {
4609 struct isl_basic_map
*part
;
4610 part
= isl_basic_map_sum(
4611 isl_basic_map_copy(map1
->p
[i
]),
4612 isl_basic_map_copy(map2
->p
[j
]));
4613 if (isl_basic_map_is_empty(part
))
4614 isl_basic_map_free(part
);
4616 result
= isl_map_add_basic_map(result
, part
);
4629 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4630 __isl_take isl_set
*set2
)
4632 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4635 /* Given a basic map A -> f(A), construct A -> -f(A).
4637 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4642 bmap
= isl_basic_map_cow(bmap
);
4646 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4647 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4648 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4649 for (j
= 0; j
< n
; ++j
)
4650 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4651 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4652 for (j
= 0; j
< n
; ++j
)
4653 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4654 for (i
= 0; i
< bmap
->n_div
; ++i
)
4655 for (j
= 0; j
< n
; ++j
)
4656 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4657 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4658 return isl_basic_map_finalize(bmap
);
4661 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4663 return isl_basic_map_neg(bset
);
4666 /* Given a map A -> f(A), construct A -> -f(A).
4668 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4672 map
= isl_map_cow(map
);
4676 for (i
= 0; i
< map
->n
; ++i
) {
4677 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4688 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4690 return set_from_map(isl_map_neg(set_to_map(set
)));
4693 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4694 * A -> floor(f(A)/d).
4696 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4699 unsigned n_in
, n_out
, nparam
, total
, pos
;
4700 struct isl_basic_map
*result
= NULL
;
4701 struct isl_dim_map
*dim_map
;
4707 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4708 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4709 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4711 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4712 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4713 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4714 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4715 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4716 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4718 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4719 bmap
->n_div
+ n_out
,
4720 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4721 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4722 result
= add_divs(result
, n_out
);
4723 for (i
= 0; i
< n_out
; ++i
) {
4725 j
= isl_basic_map_alloc_inequality(result
);
4728 isl_seq_clr(result
->ineq
[j
], 1+total
);
4729 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4730 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4731 j
= isl_basic_map_alloc_inequality(result
);
4734 isl_seq_clr(result
->ineq
[j
], 1+total
);
4735 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4736 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4737 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4740 result
= isl_basic_map_simplify(result
);
4741 return isl_basic_map_finalize(result
);
4743 isl_basic_map_free(result
);
4747 /* Given a map A -> f(A) and an integer d, construct a map
4748 * A -> floor(f(A)/d).
4750 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4754 map
= isl_map_cow(map
);
4758 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4759 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4760 for (i
= 0; i
< map
->n
; ++i
) {
4761 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4772 /* Given a map A -> f(A) and an integer d, construct a map
4773 * A -> floor(f(A)/d).
4775 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4776 __isl_take isl_val
*d
)
4780 if (!isl_val_is_int(d
))
4781 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4782 "expecting integer denominator", goto error
);
4783 map
= isl_map_floordiv(map
, d
->n
);
4792 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4799 i
= isl_basic_map_alloc_equality(bmap
);
4802 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4803 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4804 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4805 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4806 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4807 return isl_basic_map_finalize(bmap
);
4809 isl_basic_map_free(bmap
);
4813 /* Add a constraint to "bmap" expressing i_pos < o_pos
4815 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4822 i
= isl_basic_map_alloc_inequality(bmap
);
4825 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4826 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4827 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4828 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4829 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4830 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4831 return isl_basic_map_finalize(bmap
);
4833 isl_basic_map_free(bmap
);
4837 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4839 static __isl_give isl_basic_map
*var_less_or_equal(
4840 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4846 i
= isl_basic_map_alloc_inequality(bmap
);
4849 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4850 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4851 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4852 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4853 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4854 return isl_basic_map_finalize(bmap
);
4856 isl_basic_map_free(bmap
);
4860 /* Add a constraint to "bmap" expressing i_pos > o_pos
4862 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4869 i
= isl_basic_map_alloc_inequality(bmap
);
4872 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4873 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4874 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4875 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4876 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4877 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4878 return isl_basic_map_finalize(bmap
);
4880 isl_basic_map_free(bmap
);
4884 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4886 static __isl_give isl_basic_map
*var_more_or_equal(
4887 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4893 i
= isl_basic_map_alloc_inequality(bmap
);
4896 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4897 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4898 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4899 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4900 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4901 return isl_basic_map_finalize(bmap
);
4903 isl_basic_map_free(bmap
);
4907 __isl_give isl_basic_map
*isl_basic_map_equal(
4908 __isl_take isl_space
*dim
, unsigned n_equal
)
4911 struct isl_basic_map
*bmap
;
4912 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4915 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4916 bmap
= var_equal(bmap
, i
);
4917 return isl_basic_map_finalize(bmap
);
4920 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4922 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4926 struct isl_basic_map
*bmap
;
4927 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4930 for (i
= 0; i
< pos
&& bmap
; ++i
)
4931 bmap
= var_equal(bmap
, i
);
4933 bmap
= var_less(bmap
, pos
);
4934 return isl_basic_map_finalize(bmap
);
4937 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4939 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4940 __isl_take isl_space
*dim
, unsigned pos
)
4943 isl_basic_map
*bmap
;
4945 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4946 for (i
= 0; i
< pos
; ++i
)
4947 bmap
= var_equal(bmap
, i
);
4948 bmap
= var_less_or_equal(bmap
, pos
);
4949 return isl_basic_map_finalize(bmap
);
4952 /* Return a relation on "dim" expressing i_pos > o_pos
4954 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4958 struct isl_basic_map
*bmap
;
4959 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4962 for (i
= 0; i
< pos
&& bmap
; ++i
)
4963 bmap
= var_equal(bmap
, i
);
4965 bmap
= var_more(bmap
, pos
);
4966 return isl_basic_map_finalize(bmap
);
4969 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4971 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4972 __isl_take isl_space
*dim
, unsigned pos
)
4975 isl_basic_map
*bmap
;
4977 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4978 for (i
= 0; i
< pos
; ++i
)
4979 bmap
= var_equal(bmap
, i
);
4980 bmap
= var_more_or_equal(bmap
, pos
);
4981 return isl_basic_map_finalize(bmap
);
4984 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4985 unsigned n
, int equal
)
4987 struct isl_map
*map
;
4990 if (n
== 0 && equal
)
4991 return isl_map_universe(dims
);
4993 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4995 for (i
= 0; i
+ 1 < n
; ++i
)
4996 map
= isl_map_add_basic_map(map
,
4997 isl_basic_map_less_at(isl_space_copy(dims
), i
));
5000 map
= isl_map_add_basic_map(map
,
5001 isl_basic_map_less_or_equal_at(dims
, n
- 1));
5003 map
= isl_map_add_basic_map(map
,
5004 isl_basic_map_less_at(dims
, n
- 1));
5006 isl_space_free(dims
);
5011 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5015 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5018 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5020 return map_lex_lte_first(dim
, n
, 0);
5023 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5025 return map_lex_lte_first(dim
, n
, 1);
5028 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5030 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5033 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5035 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5038 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5039 unsigned n
, int equal
)
5041 struct isl_map
*map
;
5044 if (n
== 0 && equal
)
5045 return isl_map_universe(dims
);
5047 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5049 for (i
= 0; i
+ 1 < n
; ++i
)
5050 map
= isl_map_add_basic_map(map
,
5051 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5054 map
= isl_map_add_basic_map(map
,
5055 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5057 map
= isl_map_add_basic_map(map
,
5058 isl_basic_map_more_at(dims
, n
- 1));
5060 isl_space_free(dims
);
5065 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5069 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5072 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5074 return map_lex_gte_first(dim
, n
, 0);
5077 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5079 return map_lex_gte_first(dim
, n
, 1);
5082 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5084 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5087 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5089 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5092 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5093 __isl_take isl_set
*set2
)
5096 map
= isl_map_lex_le(isl_set_get_space(set1
));
5097 map
= isl_map_intersect_domain(map
, set1
);
5098 map
= isl_map_intersect_range(map
, set2
);
5102 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5103 __isl_take isl_set
*set2
)
5106 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5107 map
= isl_map_intersect_domain(map
, set1
);
5108 map
= isl_map_intersect_range(map
, set2
);
5112 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5113 __isl_take isl_set
*set2
)
5116 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5117 map
= isl_map_intersect_domain(map
, set1
);
5118 map
= isl_map_intersect_range(map
, set2
);
5122 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5123 __isl_take isl_set
*set2
)
5126 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5127 map
= isl_map_intersect_domain(map
, set1
);
5128 map
= isl_map_intersect_range(map
, set2
);
5132 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5133 __isl_take isl_map
*map2
)
5136 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5137 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5138 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5142 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5143 __isl_take isl_map
*map2
)
5146 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5147 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5148 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5152 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5153 __isl_take isl_map
*map2
)
5156 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5157 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5158 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5162 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5163 __isl_take isl_map
*map2
)
5166 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5167 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5168 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5172 /* For a div d = floor(f/m), add the constraint
5176 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5177 unsigned pos
, isl_int
*div
)
5180 unsigned total
= isl_basic_map_total_dim(bmap
);
5182 i
= isl_basic_map_alloc_inequality(bmap
);
5184 return isl_stat_error
;
5185 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5186 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5191 /* For a div d = floor(f/m), add the constraint
5193 * -(f-(m-1)) + m d >= 0
5195 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5196 unsigned pos
, isl_int
*div
)
5199 unsigned total
= isl_basic_map_total_dim(bmap
);
5201 i
= isl_basic_map_alloc_inequality(bmap
);
5203 return isl_stat_error
;
5204 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5205 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5206 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5207 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5212 /* For a div d = floor(f/m), add the constraints
5215 * -(f-(m-1)) + m d >= 0
5217 * Note that the second constraint is the negation of
5221 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5222 unsigned pos
, isl_int
*div
)
5224 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5226 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5231 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5232 unsigned pos
, isl_int
*div
)
5234 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5238 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5240 unsigned total
= isl_basic_map_total_dim(bmap
);
5241 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5243 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5247 /* For each known div d = floor(f/m), add the constraints
5250 * -(f-(m-1)) + m d >= 0
5252 * Remove duplicate constraints in case of some these div constraints
5253 * already appear in "bmap".
5255 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5256 __isl_take isl_basic_map
*bmap
)
5262 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5266 bmap
= add_known_div_constraints(bmap
);
5267 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5268 bmap
= isl_basic_map_finalize(bmap
);
5272 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5274 * In particular, if this div is of the form d = floor(f/m),
5275 * then add the constraint
5279 * if sign < 0 or the constraint
5281 * -(f-(m-1)) + m d >= 0
5285 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5286 unsigned div
, int sign
)
5294 total
= isl_basic_map_total_dim(bmap
);
5295 div_pos
= total
- bmap
->n_div
+ div
;
5298 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5300 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5303 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5304 __isl_take isl_basic_map
*bmap
)
5308 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5310 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5311 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5312 return bset_from_bmap(bmap
);
5313 bmap
= isl_basic_map_cow(bmap
);
5316 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5319 bmap
->extra
-= bmap
->n_div
;
5321 bmap
= isl_basic_map_finalize(bmap
);
5322 return bset_from_bmap(bmap
);
5324 isl_basic_map_free(bmap
);
5328 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5329 __isl_take isl_basic_set
*bset
)
5331 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5334 /* Replace each element in "list" by the result of applying
5335 * isl_basic_map_underlying_set to the element.
5337 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5338 __isl_take isl_basic_map_list
*list
)
5345 n
= isl_basic_map_list_n_basic_map(list
);
5346 for (i
= 0; i
< n
; ++i
) {
5347 isl_basic_map
*bmap
;
5348 isl_basic_set
*bset
;
5350 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5351 bset
= isl_basic_set_underlying_set(bmap
);
5352 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5358 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5359 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5361 struct isl_basic_map
*bmap
;
5362 struct isl_ctx
*ctx
;
5369 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5370 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5371 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5373 if (like
->n_div
== 0) {
5374 isl_space
*space
= isl_basic_map_get_space(like
);
5375 isl_basic_map_free(like
);
5376 return isl_basic_map_reset_space(bset
, space
);
5378 bset
= isl_basic_set_cow(bset
);
5381 total
= bset
->dim
->n_out
+ bset
->extra
;
5382 bmap
= bset_to_bmap(bset
);
5383 isl_space_free(bmap
->dim
);
5384 bmap
->dim
= isl_space_copy(like
->dim
);
5387 bmap
->n_div
= like
->n_div
;
5388 bmap
->extra
+= like
->n_div
;
5392 ltotal
= total
- bmap
->extra
+ like
->extra
;
5395 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5396 bmap
->extra
* (1 + 1 + total
));
5397 if (isl_blk_is_error(bmap
->block2
))
5399 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5403 for (i
= 0; i
< bmap
->extra
; ++i
)
5404 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5405 for (i
= 0; i
< like
->n_div
; ++i
) {
5406 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5407 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5409 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5411 isl_basic_map_free(like
);
5412 bmap
= isl_basic_map_simplify(bmap
);
5413 bmap
= isl_basic_map_finalize(bmap
);
5416 isl_basic_map_free(like
);
5417 isl_basic_set_free(bset
);
5421 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5422 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5424 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5425 bset_to_bmap(like
)));
5428 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5432 map
= isl_map_cow(map
);
5435 map
->dim
= isl_space_cow(map
->dim
);
5439 for (i
= 1; i
< map
->n
; ++i
)
5440 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5442 for (i
= 0; i
< map
->n
; ++i
) {
5443 map
->p
[i
] = bset_to_bmap(
5444 isl_basic_map_underlying_set(map
->p
[i
]));
5449 map
->dim
= isl_space_underlying(map
->dim
, 0);
5451 isl_space_free(map
->dim
);
5452 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5456 return set_from_map(map
);
5462 /* Replace the space of "bmap" by "space".
5464 * If the space of "bmap" is identical to "space" (including the identifiers
5465 * of the input and output dimensions), then simply return the original input.
5467 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5468 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5471 isl_space
*bmap_space
;
5473 bmap_space
= isl_basic_map_peek_space(bmap
);
5474 equal
= isl_space_is_equal(bmap_space
, space
);
5475 if (equal
>= 0 && equal
)
5476 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5480 isl_space_free(space
);
5483 bmap
= isl_basic_map_cow(bmap
);
5484 if (!bmap
|| !space
)
5487 isl_space_free(bmap
->dim
);
5490 bmap
= isl_basic_map_finalize(bmap
);
5494 isl_basic_map_free(bmap
);
5495 isl_space_free(space
);
5499 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5500 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5502 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5506 /* Check that the total dimensions of "map" and "space" are the same.
5508 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5509 __isl_keep isl_space
*space
)
5511 unsigned dim1
, dim2
;
5514 return isl_stat_error
;
5515 dim1
= isl_map_dim(map
, isl_dim_all
);
5516 dim2
= isl_space_dim(space
, isl_dim_all
);
5519 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5520 "total dimensions do not match", return isl_stat_error
);
5523 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5524 __isl_take isl_space
*dim
)
5528 map
= isl_map_cow(map
);
5532 for (i
= 0; i
< map
->n
; ++i
) {
5533 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5534 isl_space_copy(dim
));
5538 isl_space_free(map
->dim
);
5544 isl_space_free(dim
);
5548 /* Replace the space of "map" by "space", without modifying
5549 * the dimension of "map".
5551 * If the space of "map" is identical to "space" (including the identifiers
5552 * of the input and output dimensions), then simply return the original input.
5554 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5555 __isl_take isl_space
*space
)
5558 isl_space
*map_space
;
5560 map_space
= isl_map_peek_space(map
);
5561 equal
= isl_space_is_equal(map_space
, space
);
5562 if (equal
>= 0 && equal
)
5563 equal
= isl_space_has_equal_ids(map_space
, space
);
5567 isl_space_free(space
);
5570 if (check_map_space_equal_total_dim(map
, space
) < 0)
5572 return isl_map_reset_space(map
, space
);
5575 isl_space_free(space
);
5579 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5580 __isl_take isl_space
*dim
)
5582 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5585 /* Compute the parameter domain of the given basic set.
5587 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5593 is_params
= isl_basic_set_is_params(bset
);
5595 return isl_basic_set_free(bset
);
5599 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5600 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5601 space
= isl_basic_set_get_space(bset
);
5602 space
= isl_space_params(space
);
5603 bset
= isl_basic_set_reset_space(bset
, space
);
5607 /* Construct a zero-dimensional basic set with the given parameter domain.
5609 __isl_give isl_basic_set
*isl_basic_set_from_params(
5610 __isl_take isl_basic_set
*bset
)
5613 space
= isl_basic_set_get_space(bset
);
5614 space
= isl_space_set_from_params(space
);
5615 bset
= isl_basic_set_reset_space(bset
, space
);
5619 /* Compute the parameter domain of the given set.
5621 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5626 if (isl_set_is_params(set
))
5629 n
= isl_set_dim(set
, isl_dim_set
);
5630 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5631 space
= isl_set_get_space(set
);
5632 space
= isl_space_params(space
);
5633 set
= isl_set_reset_space(set
, space
);
5637 /* Construct a zero-dimensional set with the given parameter domain.
5639 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5642 space
= isl_set_get_space(set
);
5643 space
= isl_space_set_from_params(space
);
5644 set
= isl_set_reset_space(set
, space
);
5648 /* Compute the parameter domain of the given map.
5650 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5655 n
= isl_map_dim(map
, isl_dim_in
);
5656 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5657 n
= isl_map_dim(map
, isl_dim_out
);
5658 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5659 space
= isl_map_get_space(map
);
5660 space
= isl_space_params(space
);
5661 map
= isl_map_reset_space(map
, space
);
5665 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5672 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5674 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5675 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5677 return isl_basic_map_reset_space(bmap
, space
);
5680 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5683 return isl_bool_error
;
5684 return isl_space_may_be_set(bmap
->dim
);
5687 /* Is this basic map actually a set?
5688 * Users should never call this function. Outside of isl,
5689 * the type should indicate whether something is a set or a map.
5691 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5694 return isl_bool_error
;
5695 return isl_space_is_set(bmap
->dim
);
5698 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5702 is_set
= isl_basic_map_is_set(bmap
);
5707 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5709 isl_basic_map_free(bmap
);
5713 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5714 __isl_take isl_basic_map
*bmap
)
5718 isl_basic_map
*domain
;
5719 int nparam
, n_in
, n_out
;
5721 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5722 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5723 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5725 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5726 domain
= isl_basic_map_universe(dim
);
5728 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5729 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5730 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5732 for (i
= 0; i
< n_in
; ++i
)
5733 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5736 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5737 return isl_basic_map_finalize(bmap
);
5740 __isl_give isl_basic_map
*isl_basic_map_range_map(
5741 __isl_take isl_basic_map
*bmap
)
5745 isl_basic_map
*range
;
5746 int nparam
, n_in
, n_out
;
5748 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5749 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5750 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5752 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5753 range
= isl_basic_map_universe(dim
);
5755 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5756 bmap
= isl_basic_map_apply_range(bmap
, range
);
5757 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5759 for (i
= 0; i
< n_out
; ++i
)
5760 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5763 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5764 return isl_basic_map_finalize(bmap
);
5767 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5771 return isl_space_may_be_set(map
->dim
);
5774 /* Is this map actually a set?
5775 * Users should never call this function. Outside of isl,
5776 * the type should indicate whether something is a set or a map.
5778 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5781 return isl_bool_error
;
5782 return isl_space_is_set(map
->dim
);
5785 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5789 struct isl_set
*set
;
5791 is_set
= isl_map_is_set(map
);
5795 return set_from_map(map
);
5797 map
= isl_map_cow(map
);
5801 set
= set_from_map(map
);
5802 set
->dim
= isl_space_range(set
->dim
);
5805 for (i
= 0; i
< map
->n
; ++i
) {
5806 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5810 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5811 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5818 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5822 map
= isl_map_cow(map
);
5826 map
->dim
= isl_space_domain_map(map
->dim
);
5829 for (i
= 0; i
< map
->n
; ++i
) {
5830 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5834 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5835 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5842 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5845 isl_space
*range_dim
;
5847 map
= isl_map_cow(map
);
5851 range_dim
= isl_space_range(isl_map_get_space(map
));
5852 range_dim
= isl_space_from_range(range_dim
);
5853 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5854 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5857 for (i
= 0; i
< map
->n
; ++i
) {
5858 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5862 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5863 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5870 /* Given a wrapped map of the form A[B -> C],
5871 * return the map A[B -> C] -> B.
5873 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5880 if (!isl_set_has_tuple_id(set
))
5881 return isl_map_domain_map(isl_set_unwrap(set
));
5883 id
= isl_set_get_tuple_id(set
);
5884 map
= isl_map_domain_map(isl_set_unwrap(set
));
5885 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5890 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5891 __isl_take isl_basic_set
*bset
)
5893 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5896 __isl_give isl_basic_map
*isl_basic_map_from_range(
5897 __isl_take isl_basic_set
*bset
)
5900 space
= isl_basic_set_get_space(bset
);
5901 space
= isl_space_from_range(space
);
5902 bset
= isl_basic_set_reset_space(bset
, space
);
5903 return bset_to_bmap(bset
);
5906 /* Create a relation with the given set as range.
5907 * The domain of the created relation is a zero-dimensional
5908 * flat anonymous space.
5910 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5913 space
= isl_set_get_space(set
);
5914 space
= isl_space_from_range(space
);
5915 set
= isl_set_reset_space(set
, space
);
5916 return set_to_map(set
);
5919 /* Create a relation with the given set as domain.
5920 * The range of the created relation is a zero-dimensional
5921 * flat anonymous space.
5923 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5925 return isl_map_reverse(isl_map_from_range(set
));
5928 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5929 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5931 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5934 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5935 __isl_take isl_set
*range
)
5937 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5940 /* Return a newly allocated isl_map with given space and flags and
5941 * room for "n" basic maps.
5942 * Make sure that all cached information is cleared.
5944 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5947 struct isl_map
*map
;
5952 isl_die(space
->ctx
, isl_error_internal
,
5953 "negative number of basic maps", goto error
);
5954 map
= isl_calloc(space
->ctx
, struct isl_map
,
5955 sizeof(struct isl_map
) +
5956 (n
- 1) * sizeof(struct isl_basic_map
*));
5960 map
->ctx
= space
->ctx
;
5961 isl_ctx_ref(map
->ctx
);
5969 isl_space_free(space
);
5973 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
5975 struct isl_basic_map
*bmap
;
5976 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
5977 bmap
= isl_basic_map_set_to_empty(bmap
);
5981 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
5983 struct isl_basic_set
*bset
;
5984 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
5985 bset
= isl_basic_set_set_to_empty(bset
);
5989 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
5991 struct isl_basic_map
*bmap
;
5992 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
5993 bmap
= isl_basic_map_finalize(bmap
);
5997 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
5999 struct isl_basic_set
*bset
;
6000 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6001 bset
= isl_basic_set_finalize(bset
);
6005 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
6008 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
6009 isl_basic_map
*bmap
;
6011 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
6012 for (i
= 0; i
< total
; ++i
) {
6013 int k
= isl_basic_map_alloc_inequality(bmap
);
6016 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6017 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6021 isl_basic_map_free(bmap
);
6025 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6027 return isl_basic_map_nat_universe(dim
);
6030 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6032 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6035 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6037 return isl_map_nat_universe(dim
);
6040 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6042 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6045 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6047 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6050 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6052 struct isl_map
*map
;
6055 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6056 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6060 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6062 struct isl_set
*set
;
6065 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6066 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6070 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6073 struct isl_map
*dup
;
6077 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6078 for (i
= 0; i
< map
->n
; ++i
)
6079 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6083 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6084 __isl_take isl_basic_map
*bmap
)
6088 if (isl_basic_map_plain_is_empty(bmap
)) {
6089 isl_basic_map_free(bmap
);
6092 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6093 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6094 map
->p
[map
->n
] = bmap
;
6096 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6102 isl_basic_map_free(bmap
);
6106 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6117 isl_ctx_deref(map
->ctx
);
6118 for (i
= 0; i
< map
->n
; ++i
)
6119 isl_basic_map_free(map
->p
[i
]);
6120 isl_space_free(map
->dim
);
6126 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6127 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6131 bmap
= isl_basic_map_cow(bmap
);
6132 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6133 j
= isl_basic_map_alloc_equality(bmap
);
6136 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6137 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6138 isl_int_set_si(bmap
->eq
[j
][0], value
);
6139 bmap
= isl_basic_map_simplify(bmap
);
6140 return isl_basic_map_finalize(bmap
);
6142 isl_basic_map_free(bmap
);
6146 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6147 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6151 bmap
= isl_basic_map_cow(bmap
);
6152 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6153 j
= isl_basic_map_alloc_equality(bmap
);
6156 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6157 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6158 isl_int_set(bmap
->eq
[j
][0], value
);
6159 bmap
= isl_basic_map_simplify(bmap
);
6160 return isl_basic_map_finalize(bmap
);
6162 isl_basic_map_free(bmap
);
6166 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6167 enum isl_dim_type type
, unsigned pos
, int value
)
6169 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6170 return isl_basic_map_free(bmap
);
6171 return isl_basic_map_fix_pos_si(bmap
,
6172 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6175 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6176 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6178 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6179 return isl_basic_map_free(bmap
);
6180 return isl_basic_map_fix_pos(bmap
,
6181 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6184 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6185 * to be equal to "v".
6187 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6188 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6192 if (!isl_val_is_int(v
))
6193 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6194 "expecting integer value", goto error
);
6195 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6197 pos
+= isl_basic_map_offset(bmap
, type
);
6198 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6202 isl_basic_map_free(bmap
);
6207 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6208 * to be equal to "v".
6210 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6211 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6213 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6216 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6217 enum isl_dim_type type
, unsigned pos
, int value
)
6219 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6223 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6224 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6226 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6230 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6231 unsigned input
, int value
)
6233 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6236 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6237 unsigned dim
, int value
)
6239 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6240 isl_dim_set
, dim
, value
));
6243 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6245 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6252 isl_basic_map_free(map
->p
[i
]);
6253 if (i
!= map
->n
- 1) {
6254 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6255 map
->p
[i
] = map
->p
[map
->n
- 1];
6262 /* Perform "fn" on each basic map of "map", where we may not be holding
6263 * the only reference to "map".
6264 * In particular, "fn" should be a semantics preserving operation
6265 * that we want to apply to all copies of "map". We therefore need
6266 * to be careful not to modify "map" in a way that breaks "map"
6267 * in case anything goes wrong.
6269 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6270 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6272 struct isl_basic_map
*bmap
;
6278 for (i
= map
->n
- 1; i
>= 0; --i
) {
6279 bmap
= isl_basic_map_copy(map
->p
[i
]);
6283 isl_basic_map_free(map
->p
[i
]);
6285 if (remove_if_empty(map
, i
) < 0)
6295 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6296 enum isl_dim_type type
, unsigned pos
, int value
)
6300 map
= isl_map_cow(map
);
6304 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6305 for (i
= map
->n
- 1; i
>= 0; --i
) {
6306 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6307 if (remove_if_empty(map
, i
) < 0)
6310 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6317 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6318 enum isl_dim_type type
, unsigned pos
, int value
)
6320 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6323 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6324 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6328 map
= isl_map_cow(map
);
6332 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6333 for (i
= 0; i
< map
->n
; ++i
) {
6334 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6338 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6345 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6346 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6348 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6351 /* Fix the value of the variable at position "pos" of type "type" of "map"
6352 * to be equal to "v".
6354 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6355 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6359 map
= isl_map_cow(map
);
6363 if (!isl_val_is_int(v
))
6364 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6365 "expecting integer value", goto error
);
6366 if (pos
>= isl_map_dim(map
, type
))
6367 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6368 "index out of bounds", goto error
);
6369 for (i
= map
->n
- 1; i
>= 0; --i
) {
6370 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6372 if (remove_if_empty(map
, i
) < 0)
6375 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6384 /* Fix the value of the variable at position "pos" of type "type" of "set"
6385 * to be equal to "v".
6387 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6388 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6390 return isl_map_fix_val(set
, type
, pos
, v
);
6393 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6394 unsigned input
, int value
)
6396 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6399 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6401 return set_from_map(isl_map_fix_si(set_to_map(set
),
6402 isl_dim_set
, dim
, value
));
6405 static __isl_give isl_basic_map
*basic_map_bound_si(
6406 __isl_take isl_basic_map
*bmap
,
6407 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6411 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6412 return isl_basic_map_free(bmap
);
6413 pos
+= isl_basic_map_offset(bmap
, type
);
6414 bmap
= isl_basic_map_cow(bmap
);
6415 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6416 j
= isl_basic_map_alloc_inequality(bmap
);
6419 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6421 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6422 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6424 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6425 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6427 bmap
= isl_basic_map_simplify(bmap
);
6428 return isl_basic_map_finalize(bmap
);
6430 isl_basic_map_free(bmap
);
6434 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6435 __isl_take isl_basic_map
*bmap
,
6436 enum isl_dim_type type
, unsigned pos
, int value
)
6438 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6441 /* Constrain the values of the given dimension to be no greater than "value".
6443 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6444 __isl_take isl_basic_map
*bmap
,
6445 enum isl_dim_type type
, unsigned pos
, int value
)
6447 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6450 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6451 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6455 map
= isl_map_cow(map
);
6459 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6460 for (i
= 0; i
< map
->n
; ++i
) {
6461 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6462 type
, pos
, value
, upper
);
6466 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6473 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6474 enum isl_dim_type type
, unsigned pos
, int value
)
6476 return map_bound_si(map
, type
, pos
, value
, 0);
6479 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6480 enum isl_dim_type type
, unsigned pos
, int value
)
6482 return map_bound_si(map
, type
, pos
, value
, 1);
6485 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6486 enum isl_dim_type type
, unsigned pos
, int value
)
6488 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6492 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6493 enum isl_dim_type type
, unsigned pos
, int value
)
6495 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6498 /* Bound the given variable of "bmap" from below (or above is "upper"
6499 * is set) to "value".
6501 static __isl_give isl_basic_map
*basic_map_bound(
6502 __isl_take isl_basic_map
*bmap
,
6503 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6507 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6508 return isl_basic_map_free(bmap
);
6509 pos
+= isl_basic_map_offset(bmap
, type
);
6510 bmap
= isl_basic_map_cow(bmap
);
6511 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6512 j
= isl_basic_map_alloc_inequality(bmap
);
6515 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6517 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6518 isl_int_set(bmap
->ineq
[j
][0], value
);
6520 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6521 isl_int_neg(bmap
->ineq
[j
][0], value
);
6523 bmap
= isl_basic_map_simplify(bmap
);
6524 return isl_basic_map_finalize(bmap
);
6526 isl_basic_map_free(bmap
);
6530 /* Bound the given variable of "map" from below (or above is "upper"
6531 * is set) to "value".
6533 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6534 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6538 map
= isl_map_cow(map
);
6542 if (pos
>= isl_map_dim(map
, type
))
6543 isl_die(map
->ctx
, isl_error_invalid
,
6544 "index out of bounds", goto error
);
6545 for (i
= map
->n
- 1; i
>= 0; --i
) {
6546 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6547 if (remove_if_empty(map
, i
) < 0)
6550 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6557 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6558 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6560 return map_bound(map
, type
, pos
, value
, 0);
6563 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6564 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6566 return map_bound(map
, type
, pos
, value
, 1);
6569 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6570 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6572 return isl_map_lower_bound(set
, type
, pos
, value
);
6575 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6576 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6578 return isl_map_upper_bound(set
, type
, pos
, value
);
6581 /* Force the values of the variable at position "pos" of type "type" of "set"
6582 * to be no smaller than "value".
6584 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6585 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6589 if (!isl_val_is_int(value
))
6590 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6591 "expecting integer value", goto error
);
6592 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6593 isl_val_free(value
);
6596 isl_val_free(value
);
6601 /* Force the values of the variable at position "pos" of type "type" of "set"
6602 * to be no greater than "value".
6604 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6605 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6609 if (!isl_val_is_int(value
))
6610 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6611 "expecting integer value", goto error
);
6612 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6613 isl_val_free(value
);
6616 isl_val_free(value
);
6621 /* Bound the given variable of "bset" from below (or above is "upper"
6622 * is set) to "value".
6624 static __isl_give isl_basic_set
*isl_basic_set_bound(
6625 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6626 isl_int value
, int upper
)
6628 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6629 type
, pos
, value
, upper
));
6632 /* Bound the given variable of "bset" from below (or above is "upper"
6633 * is set) to "value".
6635 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6636 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6637 __isl_take isl_val
*value
, int upper
)
6641 if (!isl_val_is_int(value
))
6642 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6643 "expecting integer value", goto error
);
6644 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6645 isl_val_free(value
);
6648 isl_val_free(value
);
6649 isl_basic_set_free(bset
);
6653 /* Bound the given variable of "bset" from below to "value".
6655 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6656 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6657 __isl_take isl_val
*value
)
6659 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6662 /* Bound the given variable of "bset" from above to "value".
6664 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6665 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6666 __isl_take isl_val
*value
)
6668 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6671 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6675 map
= isl_map_cow(map
);
6679 map
->dim
= isl_space_reverse(map
->dim
);
6682 for (i
= 0; i
< map
->n
; ++i
) {
6683 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6687 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6695 #define TYPE isl_pw_multi_aff
6697 #define SUFFIX _pw_multi_aff
6699 #define EMPTY isl_pw_multi_aff_empty
6701 #define ADD isl_pw_multi_aff_union_add
6702 #include "isl_map_lexopt_templ.c"
6704 /* Given a map "map", compute the lexicographically minimal
6705 * (or maximal) image element for each domain element in dom,
6706 * in the form of an isl_pw_multi_aff.
6707 * If "empty" is not NULL, then set *empty to those elements in dom that
6708 * do not have an image element.
6709 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6710 * should be computed over the domain of "map". "empty" is also NULL
6713 * We first compute the lexicographically minimal or maximal element
6714 * in the first basic map. This results in a partial solution "res"
6715 * and a subset "todo" of dom that still need to be handled.
6716 * We then consider each of the remaining maps in "map" and successively
6717 * update both "res" and "todo".
6718 * If "empty" is NULL, then the todo sets are not needed and therefore
6719 * also not computed.
6721 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6722 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6723 __isl_give isl_set
**empty
, unsigned flags
)
6727 isl_pw_multi_aff
*res
;
6730 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6731 if (!map
|| (!full
&& !dom
))
6734 if (isl_map_plain_is_empty(map
)) {
6739 return isl_pw_multi_aff_from_map(map
);
6742 res
= basic_map_partial_lexopt_pw_multi_aff(
6743 isl_basic_map_copy(map
->p
[0]),
6744 isl_set_copy(dom
), empty
, flags
);
6748 for (i
= 1; i
< map
->n
; ++i
) {
6749 isl_pw_multi_aff
*res_i
;
6751 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6752 isl_basic_map_copy(map
->p
[i
]),
6753 isl_set_copy(dom
), empty
, flags
);
6755 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6756 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6758 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6761 todo
= isl_set_intersect(todo
, *empty
);
6780 #define TYPE isl_map
6784 #define EMPTY isl_map_empty
6786 #define ADD isl_map_union_disjoint
6787 #include "isl_map_lexopt_templ.c"
6789 /* Given a map "map", compute the lexicographically minimal
6790 * (or maximal) image element for each domain element in "dom",
6791 * in the form of an isl_map.
6792 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6793 * do not have an image element.
6794 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6795 * should be computed over the domain of "map". "empty" is also NULL
6798 * If the input consists of more than one disjunct, then first
6799 * compute the desired result in the form of an isl_pw_multi_aff and
6800 * then convert that into an isl_map.
6802 * This function used to have an explicit implementation in terms
6803 * of isl_maps, but it would continually intersect the domains of
6804 * partial results with the complement of the domain of the next
6805 * partial solution, potentially leading to an explosion in the number
6806 * of disjuncts if there are several disjuncts in the input.
6807 * An even earlier implementation of this function would look for
6808 * better results in the domain of the partial result and for extra
6809 * results in the complement of this domain, which would lead to
6810 * even more splintering.
6812 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6813 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6814 __isl_give isl_set
**empty
, unsigned flags
)
6817 struct isl_map
*res
;
6818 isl_pw_multi_aff
*pma
;
6820 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6821 if (!map
|| (!full
&& !dom
))
6824 if (isl_map_plain_is_empty(map
)) {
6833 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6839 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6841 return isl_map_from_pw_multi_aff(pma
);
6850 __isl_give isl_map
*isl_map_partial_lexmax(
6851 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6852 __isl_give isl_set
**empty
)
6854 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6857 __isl_give isl_map
*isl_map_partial_lexmin(
6858 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6859 __isl_give isl_set
**empty
)
6861 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6864 __isl_give isl_set
*isl_set_partial_lexmin(
6865 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6866 __isl_give isl_set
**empty
)
6868 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6872 __isl_give isl_set
*isl_set_partial_lexmax(
6873 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6874 __isl_give isl_set
**empty
)
6876 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6880 /* Compute the lexicographic minimum (or maximum if "flags" includes
6881 * ISL_OPT_MAX) of "bset" over its parametric domain.
6883 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6886 return isl_basic_map_lexopt(bset
, flags
);
6889 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6891 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6894 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6896 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6899 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6901 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6904 /* Compute the lexicographic minimum of "bset" over its parametric domain
6905 * for the purpose of quantifier elimination.
6906 * That is, find an explicit representation for all the existentially
6907 * quantified variables in "bset" by computing their lexicographic
6910 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6911 __isl_take isl_basic_set
*bset
)
6913 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6916 /* Given a basic map with one output dimension, compute the minimum or
6917 * maximum of that dimension as an isl_pw_aff.
6919 * Compute the optimum as a lexicographic optimum over the single
6920 * output dimension and extract the single isl_pw_aff from the result.
6922 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6925 isl_pw_multi_aff
*pma
;
6928 bmap
= isl_basic_map_copy(bmap
);
6929 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6930 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6931 isl_pw_multi_aff_free(pma
);
6936 /* Compute the minimum or maximum of the given output dimension
6937 * as a function of the parameters and the input dimensions,
6938 * but independently of the other output dimensions.
6940 * We first project out the other output dimension and then compute
6941 * the "lexicographic" maximum in each basic map, combining the results
6942 * using isl_pw_aff_union_max.
6944 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6951 n_out
= isl_map_dim(map
, isl_dim_out
);
6952 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6953 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6958 isl_space
*dim
= isl_map_get_space(map
);
6960 return isl_pw_aff_empty(dim
);
6963 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6964 for (i
= 1; i
< map
->n
; ++i
) {
6965 isl_pw_aff
*pwaff_i
;
6967 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6968 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6976 /* Compute the minimum of the given output dimension as a function of the
6977 * parameters and input dimensions, but independently of
6978 * the other output dimensions.
6980 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6982 return map_dim_opt(map
, pos
, 0);
6985 /* Compute the maximum of the given output dimension as a function of the
6986 * parameters and input dimensions, but independently of
6987 * the other output dimensions.
6989 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6991 return map_dim_opt(map
, pos
, 1);
6994 /* Compute the minimum or maximum of the given set dimension
6995 * as a function of the parameters,
6996 * but independently of the other set dimensions.
6998 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7001 return map_dim_opt(set
, pos
, max
);
7004 /* Compute the maximum of the given set dimension as a function of the
7005 * parameters, but independently of the other set dimensions.
7007 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7009 return set_dim_opt(set
, pos
, 1);
7012 /* Compute the minimum of the given set dimension as a function of the
7013 * parameters, but independently of the other set dimensions.
7015 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7017 return set_dim_opt(set
, pos
, 0);
7020 /* Apply a preimage specified by "mat" on the parameters of "bset".
7021 * bset is assumed to have only parameters and divs.
7023 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7024 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7031 bset
->dim
= isl_space_cow(bset
->dim
);
7035 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7037 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7039 bset
->dim
->nparam
= 0;
7040 bset
->dim
->n_out
= nparam
;
7041 bset
= isl_basic_set_preimage(bset
, mat
);
7043 bset
->dim
->nparam
= bset
->dim
->n_out
;
7044 bset
->dim
->n_out
= 0;
7049 isl_basic_set_free(bset
);
7053 /* Apply a preimage specified by "mat" on the parameters of "set".
7054 * set is assumed to have only parameters and divs.
7056 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7057 __isl_take isl_mat
*mat
)
7065 nparam
= isl_set_dim(set
, isl_dim_param
);
7067 if (mat
->n_row
!= 1 + nparam
)
7068 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7069 "unexpected number of rows", goto error
);
7071 space
= isl_set_get_space(set
);
7072 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7073 isl_dim_param
, 0, nparam
);
7074 set
= isl_set_reset_space(set
, space
);
7075 set
= isl_set_preimage(set
, mat
);
7076 nparam
= isl_set_dim(set
, isl_dim_out
);
7077 space
= isl_set_get_space(set
);
7078 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7079 isl_dim_out
, 0, nparam
);
7080 set
= isl_set_reset_space(set
, space
);
7088 /* Intersect the basic set "bset" with the affine space specified by the
7089 * equalities in "eq".
7091 static __isl_give isl_basic_set
*basic_set_append_equalities(
7092 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7100 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7105 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7106 for (i
= 0; i
< eq
->n_row
; ++i
) {
7107 k
= isl_basic_set_alloc_equality(bset
);
7110 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7111 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7115 bset
= isl_basic_set_gauss(bset
, NULL
);
7116 bset
= isl_basic_set_finalize(bset
);
7121 isl_basic_set_free(bset
);
7125 /* Intersect the set "set" with the affine space specified by the
7126 * equalities in "eq".
7128 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7136 for (i
= 0; i
< set
->n
; ++i
) {
7137 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7150 /* Given a basic set "bset" that only involves parameters and existentially
7151 * quantified variables, return the index of the first equality
7152 * that only involves parameters. If there is no such equality then
7153 * return bset->n_eq.
7155 * This function assumes that isl_basic_set_gauss has been called on "bset".
7157 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7160 unsigned nparam
, n_div
;
7165 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7166 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7168 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7169 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7176 /* Compute an explicit representation for the existentially quantified
7177 * variables in "bset" by computing the "minimal value" of the set
7178 * variables. Since there are no set variables, the computation of
7179 * the minimal value essentially computes an explicit representation
7180 * of the non-empty part(s) of "bset".
7182 * The input only involves parameters and existentially quantified variables.
7183 * All equalities among parameters have been removed.
7185 * Since the existentially quantified variables in the result are in general
7186 * going to be different from those in the input, we first replace
7187 * them by the minimal number of variables based on their equalities.
7188 * This should simplify the parametric integer programming.
7190 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7192 isl_morph
*morph1
, *morph2
;
7198 if (bset
->n_eq
== 0)
7199 return isl_basic_set_lexmin_compute_divs(bset
);
7201 morph1
= isl_basic_set_parameter_compression(bset
);
7202 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7203 bset
= isl_basic_set_lift(bset
);
7204 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7205 bset
= isl_morph_basic_set(morph2
, bset
);
7206 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7207 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7209 set
= isl_basic_set_lexmin_compute_divs(bset
);
7211 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7216 /* Project the given basic set onto its parameter domain, possibly introducing
7217 * new, explicit, existential variables in the constraints.
7218 * The input has parameters and (possibly implicit) existential variables.
7219 * The output has the same parameters, but only
7220 * explicit existentially quantified variables.
7222 * The actual projection is performed by pip, but pip doesn't seem
7223 * to like equalities very much, so we first remove the equalities
7224 * among the parameters by performing a variable compression on
7225 * the parameters. Afterward, an inverse transformation is performed
7226 * and the equalities among the parameters are inserted back in.
7228 * The variable compression on the parameters may uncover additional
7229 * equalities that were only implicit before. We therefore check
7230 * if there are any new parameter equalities in the result and
7231 * if so recurse. The removal of parameter equalities is required
7232 * for the parameter compression performed by base_compute_divs.
7234 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7238 struct isl_mat
*T
, *T2
;
7239 struct isl_set
*set
;
7242 bset
= isl_basic_set_cow(bset
);
7246 if (bset
->n_eq
== 0)
7247 return base_compute_divs(bset
);
7249 bset
= isl_basic_set_gauss(bset
, NULL
);
7252 if (isl_basic_set_plain_is_empty(bset
))
7253 return isl_set_from_basic_set(bset
);
7255 i
= first_parameter_equality(bset
);
7256 if (i
== bset
->n_eq
)
7257 return base_compute_divs(bset
);
7259 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7260 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7262 eq
= isl_mat_cow(eq
);
7263 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7264 if (T
&& T
->n_col
== 0) {
7268 bset
= isl_basic_set_set_to_empty(bset
);
7269 return isl_set_from_basic_set(bset
);
7271 bset
= basic_set_parameter_preimage(bset
, T
);
7273 i
= first_parameter_equality(bset
);
7276 else if (i
== bset
->n_eq
)
7277 set
= base_compute_divs(bset
);
7279 set
= parameter_compute_divs(bset
);
7280 set
= set_parameter_preimage(set
, T2
);
7281 set
= set_append_equalities(set
, eq
);
7285 /* Insert the divs from "ls" before those of "bmap".
7287 * The number of columns is not changed, which means that the last
7288 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7289 * The caller is responsible for removing the same number of dimensions
7290 * from the space of "bmap".
7292 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7293 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7299 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7303 old_n_div
= bmap
->n_div
;
7304 bmap
= insert_div_rows(bmap
, n_div
);
7308 for (i
= 0; i
< n_div
; ++i
) {
7309 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7310 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7316 /* Replace the space of "bmap" by the space and divs of "ls".
7318 * If "ls" has any divs, then we simplify the result since we may
7319 * have discovered some additional equalities that could simplify
7320 * the div expressions.
7322 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7323 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7327 bmap
= isl_basic_map_cow(bmap
);
7331 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7332 bmap
= insert_divs_from_local_space(bmap
, ls
);
7336 isl_space_free(bmap
->dim
);
7337 bmap
->dim
= isl_local_space_get_space(ls
);
7341 isl_local_space_free(ls
);
7343 bmap
= isl_basic_map_simplify(bmap
);
7344 bmap
= isl_basic_map_finalize(bmap
);
7347 isl_basic_map_free(bmap
);
7348 isl_local_space_free(ls
);
7352 /* Replace the space of "map" by the space and divs of "ls".
7354 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7355 __isl_take isl_local_space
*ls
)
7359 map
= isl_map_cow(map
);
7363 for (i
= 0; i
< map
->n
; ++i
) {
7364 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7365 isl_local_space_copy(ls
));
7369 isl_space_free(map
->dim
);
7370 map
->dim
= isl_local_space_get_space(ls
);
7374 isl_local_space_free(ls
);
7377 isl_local_space_free(ls
);
7382 /* Compute an explicit representation for the existentially
7383 * quantified variables for which do not know any explicit representation yet.
7385 * We first sort the existentially quantified variables so that the
7386 * existentially quantified variables for which we already have an explicit
7387 * representation are placed before those for which we do not.
7388 * The input dimensions, the output dimensions and the existentially
7389 * quantified variables for which we already have an explicit
7390 * representation are then turned into parameters.
7391 * compute_divs returns a map with the same parameters and
7392 * no input or output dimensions and the dimension specification
7393 * is reset to that of the input, including the existentially quantified
7394 * variables for which we already had an explicit representation.
7396 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7398 struct isl_basic_set
*bset
;
7399 struct isl_set
*set
;
7400 struct isl_map
*map
;
7402 isl_local_space
*ls
;
7409 bmap
= isl_basic_map_sort_divs(bmap
);
7410 bmap
= isl_basic_map_cow(bmap
);
7414 n_known
= isl_basic_map_first_unknown_div(bmap
);
7416 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7418 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7419 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7420 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7421 dim
= isl_space_set_alloc(bmap
->ctx
,
7422 nparam
+ n_in
+ n_out
+ n_known
, 0);
7426 ls
= isl_basic_map_get_local_space(bmap
);
7427 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7428 n_known
, bmap
->n_div
- n_known
);
7430 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7431 swap_div(bmap
, i
- n_known
, i
);
7432 bmap
->n_div
-= n_known
;
7433 bmap
->extra
-= n_known
;
7435 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7436 bset
= bset_from_bmap(bmap
);
7438 set
= parameter_compute_divs(bset
);
7439 map
= set_to_map(set
);
7440 map
= replace_space_by_local_space(map
, ls
);
7444 isl_basic_map_free(bmap
);
7448 /* Remove the explicit representation of local variable "div",
7451 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7452 __isl_take isl_basic_map
*bmap
, int div
)
7456 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7458 return isl_basic_map_free(bmap
);
7462 bmap
= isl_basic_map_cow(bmap
);
7465 isl_int_set_si(bmap
->div
[div
][0], 0);
7469 /* Is local variable "div" of "bmap" marked as not having an explicit
7471 * Note that even if "div" is not marked in this way and therefore
7472 * has an explicit representation, this representation may still
7473 * depend (indirectly) on other local variables that do not
7474 * have an explicit representation.
7476 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7479 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7480 return isl_bool_error
;
7481 return isl_int_is_zero(bmap
->div
[div
][0]);
7484 /* Return the position of the first local variable that does not
7485 * have an explicit representation.
7486 * Return the total number of local variables if they all have
7487 * an explicit representation.
7488 * Return -1 on error.
7490 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7497 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7498 if (!isl_basic_map_div_is_known(bmap
, i
))
7504 /* Return the position of the first local variable that does not
7505 * have an explicit representation.
7506 * Return the total number of local variables if they all have
7507 * an explicit representation.
7508 * Return -1 on error.
7510 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7512 return isl_basic_map_first_unknown_div(bset
);
7515 /* Does "bmap" have an explicit representation for all local variables?
7517 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7521 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7522 first
= isl_basic_map_first_unknown_div(bmap
);
7524 return isl_bool_error
;
7528 /* Do all basic maps in "map" have an explicit representation
7529 * for all local variables?
7531 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7536 return isl_bool_error
;
7538 for (i
= 0; i
< map
->n
; ++i
) {
7539 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7544 return isl_bool_true
;
7547 /* If bmap contains any unknown divs, then compute explicit
7548 * expressions for them. However, this computation may be
7549 * quite expensive, so first try to remove divs that aren't
7552 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7555 struct isl_map
*map
;
7557 known
= isl_basic_map_divs_known(bmap
);
7561 return isl_map_from_basic_map(bmap
);
7563 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7565 known
= isl_basic_map_divs_known(bmap
);
7569 return isl_map_from_basic_map(bmap
);
7571 map
= compute_divs(bmap
);
7574 isl_basic_map_free(bmap
);
7578 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7582 struct isl_map
*res
;
7589 known
= isl_map_divs_known(map
);
7597 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7598 for (i
= 1 ; i
< map
->n
; ++i
) {
7600 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7601 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7602 res
= isl_map_union_disjoint(res
, r2
);
7604 res
= isl_map_union(res
, r2
);
7611 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7613 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7616 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7618 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7621 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7624 struct isl_set
*set
;
7629 map
= isl_map_cow(map
);
7633 set
= set_from_map(map
);
7634 set
->dim
= isl_space_domain(set
->dim
);
7637 for (i
= 0; i
< map
->n
; ++i
) {
7638 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7642 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7643 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7650 /* Return the union of "map1" and "map2", where we assume for now that
7651 * "map1" and "map2" are disjoint. Note that the basic maps inside
7652 * "map1" or "map2" may not be disjoint from each other.
7653 * Also note that this function is also called from isl_map_union,
7654 * which takes care of handling the situation where "map1" and "map2"
7655 * may not be disjoint.
7657 * If one of the inputs is empty, we can simply return the other input.
7658 * Similarly, if one of the inputs is universal, then it is equal to the union.
7660 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7661 __isl_take isl_map
*map2
)
7665 struct isl_map
*map
= NULL
;
7671 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7672 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7673 "spaces don't match", goto error
);
7684 is_universe
= isl_map_plain_is_universe(map1
);
7685 if (is_universe
< 0)
7692 is_universe
= isl_map_plain_is_universe(map2
);
7693 if (is_universe
< 0)
7700 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7701 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7702 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7704 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7705 map1
->n
+ map2
->n
, flags
);
7708 for (i
= 0; i
< map1
->n
; ++i
) {
7709 map
= isl_map_add_basic_map(map
,
7710 isl_basic_map_copy(map1
->p
[i
]));
7714 for (i
= 0; i
< map2
->n
; ++i
) {
7715 map
= isl_map_add_basic_map(map
,
7716 isl_basic_map_copy(map2
->p
[i
]));
7730 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7731 * guaranteed to be disjoint by the caller.
7733 * Note that this functions is called from within isl_map_make_disjoint,
7734 * so we have to be careful not to touch the constraints of the inputs
7737 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7738 __isl_take isl_map
*map2
)
7740 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7743 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7744 * not be disjoint. The parameters are assumed to have been aligned.
7746 * We currently simply call map_union_disjoint, the internal operation
7747 * of which does not really depend on the inputs being disjoint.
7748 * If the result contains more than one basic map, then we clear
7749 * the disjoint flag since the result may contain basic maps from
7750 * both inputs and these are not guaranteed to be disjoint.
7752 * As a special case, if "map1" and "map2" are obviously equal,
7753 * then we simply return "map1".
7755 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7756 __isl_take isl_map
*map2
)
7763 equal
= isl_map_plain_is_equal(map1
, map2
);
7771 map1
= map_union_disjoint(map1
, map2
);
7775 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7783 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7786 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7787 __isl_take isl_map
*map2
)
7789 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7792 __isl_give isl_set
*isl_set_union_disjoint(
7793 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7795 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7799 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7801 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7804 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7807 * "map" and "set" are assumed to be compatible and non-NULL.
7809 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7810 __isl_take isl_set
*set
,
7811 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7812 __isl_take isl_basic_set
*bset
))
7815 struct isl_map
*result
;
7818 if (isl_set_plain_is_universe(set
)) {
7823 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7824 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7825 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7827 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7828 map
->n
* set
->n
, flags
);
7829 for (i
= 0; result
&& i
< map
->n
; ++i
)
7830 for (j
= 0; j
< set
->n
; ++j
) {
7831 result
= isl_map_add_basic_map(result
,
7832 fn(isl_basic_map_copy(map
->p
[i
]),
7833 isl_basic_set_copy(set
->p
[j
])));
7843 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7844 __isl_take isl_set
*set
)
7848 ok
= isl_map_compatible_range(map
, set
);
7852 isl_die(set
->ctx
, isl_error_invalid
,
7853 "incompatible spaces", goto error
);
7855 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7862 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7863 __isl_take isl_set
*set
)
7865 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7868 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7869 __isl_take isl_set
*set
)
7873 ok
= isl_map_compatible_domain(map
, set
);
7877 isl_die(set
->ctx
, isl_error_invalid
,
7878 "incompatible spaces", goto error
);
7880 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7887 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7888 __isl_take isl_set
*set
)
7890 return isl_map_align_params_map_map_and(map
, set
,
7891 &map_intersect_domain
);
7894 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7895 * in the space B -> C, return the intersection.
7896 * The parameters are assumed to have been aligned.
7898 * The map "factor" is first extended to a map living in the space
7899 * [A -> B] -> C and then a regular intersection is computed.
7901 static __isl_give isl_map
*map_intersect_domain_factor_range(
7902 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7905 isl_map
*ext_factor
;
7907 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7908 ext_factor
= isl_map_universe(space
);
7909 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7910 return map_intersect(map
, ext_factor
);
7913 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7914 * in the space B -> C, return the intersection.
7916 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7917 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7919 return isl_map_align_params_map_map_and(map
, factor
,
7920 &map_intersect_domain_factor_range
);
7923 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7924 * in the space A -> C, return the intersection.
7926 * The map "factor" is first extended to a map living in the space
7927 * A -> [B -> C] and then a regular intersection is computed.
7929 static __isl_give isl_map
*map_intersect_range_factor_range(
7930 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7933 isl_map
*ext_factor
;
7935 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7936 ext_factor
= isl_map_universe(space
);
7937 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7938 return isl_map_intersect(map
, ext_factor
);
7941 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7942 * in the space A -> C, return the intersection.
7944 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7945 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7947 return isl_map_align_params_map_map_and(map
, factor
,
7948 &map_intersect_range_factor_range
);
7951 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7952 __isl_take isl_map
*map2
)
7956 map1
= isl_map_reverse(map1
);
7957 map1
= isl_map_apply_range(map1
, map2
);
7958 return isl_map_reverse(map1
);
7965 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7966 __isl_take isl_map
*map2
)
7968 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7971 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7972 __isl_take isl_map
*map2
)
7974 isl_space
*dim_result
;
7975 struct isl_map
*result
;
7981 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7982 isl_space_copy(map2
->dim
));
7984 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7987 for (i
= 0; i
< map1
->n
; ++i
)
7988 for (j
= 0; j
< map2
->n
; ++j
) {
7989 result
= isl_map_add_basic_map(result
,
7990 isl_basic_map_apply_range(
7991 isl_basic_map_copy(map1
->p
[i
]),
7992 isl_basic_map_copy(map2
->p
[j
])));
7998 if (result
&& result
->n
<= 1)
7999 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8007 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8008 __isl_take isl_map
*map2
)
8010 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8014 * returns range - domain
8016 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8018 isl_space
*target_space
;
8019 struct isl_basic_set
*bset
;
8026 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8027 bmap
->dim
, isl_dim_out
),
8029 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8030 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8031 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8032 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8033 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8034 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8035 for (i
= 0; i
< dim
; ++i
) {
8036 int j
= isl_basic_map_alloc_equality(bmap
);
8038 bmap
= isl_basic_map_free(bmap
);
8041 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8042 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8043 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8044 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8046 bset
= isl_basic_map_domain(bmap
);
8047 bset
= isl_basic_set_reset_space(bset
, target_space
);
8050 isl_basic_map_free(bmap
);
8055 * returns range - domain
8057 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8061 struct isl_set
*result
;
8066 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8067 map
->dim
, isl_dim_out
),
8069 dim
= isl_map_get_space(map
);
8070 dim
= isl_space_domain(dim
);
8071 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8074 for (i
= 0; i
< map
->n
; ++i
)
8075 result
= isl_set_add_basic_set(result
,
8076 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8085 * returns [domain -> range] -> range - domain
8087 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8088 __isl_take isl_basic_map
*bmap
)
8092 isl_basic_map
*domain
;
8096 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8097 bmap
->dim
, isl_dim_out
))
8098 isl_die(bmap
->ctx
, isl_error_invalid
,
8099 "domain and range don't match", goto error
);
8101 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8102 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8104 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8105 domain
= isl_basic_map_universe(dim
);
8107 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8108 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8109 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8111 total
= isl_basic_map_total_dim(bmap
);
8113 for (i
= 0; i
< n
; ++i
) {
8114 k
= isl_basic_map_alloc_equality(bmap
);
8117 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8118 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8119 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8120 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8123 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8124 return isl_basic_map_finalize(bmap
);
8126 isl_basic_map_free(bmap
);
8131 * returns [domain -> range] -> range - domain
8133 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8136 isl_space
*domain_dim
;
8141 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8142 map
->dim
, isl_dim_out
))
8143 isl_die(map
->ctx
, isl_error_invalid
,
8144 "domain and range don't match", goto error
);
8146 map
= isl_map_cow(map
);
8150 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8151 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8152 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8155 for (i
= 0; i
< map
->n
; ++i
) {
8156 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8160 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8167 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8169 struct isl_basic_map
*bmap
;
8177 nparam
= dims
->nparam
;
8179 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8183 for (i
= 0; i
< dim
; ++i
) {
8184 int j
= isl_basic_map_alloc_equality(bmap
);
8187 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8188 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8189 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8191 return isl_basic_map_finalize(bmap
);
8193 isl_basic_map_free(bmap
);
8197 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8201 if (dim
->n_in
!= dim
->n_out
)
8202 isl_die(dim
->ctx
, isl_error_invalid
,
8203 "number of input and output dimensions needs to be "
8204 "the same", goto error
);
8205 return basic_map_identity(dim
);
8207 isl_space_free(dim
);
8211 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8213 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8216 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8218 isl_space
*dim
= isl_set_get_space(set
);
8220 id
= isl_map_identity(isl_space_map_from_set(dim
));
8221 return isl_map_intersect_range(id
, set
);
8224 /* Construct a basic set with all set dimensions having only non-negative
8227 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8228 __isl_take isl_space
*space
)
8233 struct isl_basic_set
*bset
;
8237 nparam
= space
->nparam
;
8239 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8242 for (i
= 0; i
< dim
; ++i
) {
8243 int k
= isl_basic_set_alloc_inequality(bset
);
8246 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8247 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8251 isl_basic_set_free(bset
);
8255 /* Construct the half-space x_pos >= 0.
8257 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8261 isl_basic_set
*nonneg
;
8263 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8264 k
= isl_basic_set_alloc_inequality(nonneg
);
8267 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8268 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8270 return isl_basic_set_finalize(nonneg
);
8272 isl_basic_set_free(nonneg
);
8276 /* Construct the half-space x_pos <= -1.
8278 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8283 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8284 k
= isl_basic_set_alloc_inequality(neg
);
8287 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8288 isl_int_set_si(neg
->ineq
[k
][0], -1);
8289 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8291 return isl_basic_set_finalize(neg
);
8293 isl_basic_set_free(neg
);
8297 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8298 enum isl_dim_type type
, unsigned first
, unsigned n
)
8302 isl_basic_set
*nonneg
;
8310 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8312 offset
= pos(set
->dim
, type
);
8313 for (i
= 0; i
< n
; ++i
) {
8314 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8315 offset
+ first
+ i
);
8316 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8318 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8327 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8329 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8335 return isl_stat_error
;
8336 if (isl_set_plain_is_empty(set
)) {
8341 return fn(set
, signs
, user
);
8344 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8346 half
= isl_set_intersect(half
, isl_set_copy(set
));
8347 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8351 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8353 half
= isl_set_intersect(half
, set
);
8354 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8357 return isl_stat_error
;
8360 /* Call "fn" on the intersections of "set" with each of the orthants
8361 * (except for obviously empty intersections). The orthant is identified
8362 * by the signs array, with each entry having value 1 or -1 according
8363 * to the sign of the corresponding variable.
8365 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8366 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8375 return isl_stat_error
;
8376 if (isl_set_plain_is_empty(set
))
8379 nparam
= isl_set_dim(set
, isl_dim_param
);
8380 nvar
= isl_set_dim(set
, isl_dim_set
);
8382 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8384 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8392 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8394 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8397 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8398 __isl_keep isl_basic_map
*bmap2
)
8401 struct isl_map
*map1
;
8402 struct isl_map
*map2
;
8404 if (!bmap1
|| !bmap2
)
8405 return isl_bool_error
;
8407 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8408 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8410 is_subset
= isl_map_is_subset(map1
, map2
);
8418 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8419 __isl_keep isl_basic_set
*bset2
)
8421 return isl_basic_map_is_subset(bset1
, bset2
);
8424 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8425 __isl_keep isl_basic_map
*bmap2
)
8429 if (!bmap1
|| !bmap2
)
8430 return isl_bool_error
;
8431 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8432 if (is_subset
!= isl_bool_true
)
8434 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8438 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8439 __isl_keep isl_basic_set
*bset2
)
8441 return isl_basic_map_is_equal(
8442 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8445 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8451 return isl_bool_error
;
8452 for (i
= 0; i
< map
->n
; ++i
) {
8453 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8455 return isl_bool_error
;
8457 return isl_bool_false
;
8459 return isl_bool_true
;
8462 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8464 return map
? map
->n
== 0 : isl_bool_error
;
8467 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8469 return set
? set
->n
== 0 : isl_bool_error
;
8472 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8474 return isl_map_is_empty(set_to_map(set
));
8477 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8478 __isl_keep isl_map
*map2
)
8481 return isl_bool_error
;
8483 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8486 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8487 __isl_keep isl_set
*set2
)
8490 return isl_bool_error
;
8492 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8495 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8500 return isl_bool_error
;
8501 is_subset
= isl_map_is_subset(map1
, map2
);
8502 if (is_subset
!= isl_bool_true
)
8504 is_subset
= isl_map_is_subset(map2
, map1
);
8508 /* Is "map1" equal to "map2"?
8510 * First check if they are obviously equal.
8511 * If not, then perform a more detailed analysis.
8513 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8517 equal
= isl_map_plain_is_equal(map1
, map2
);
8518 if (equal
< 0 || equal
)
8520 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8523 isl_bool
isl_basic_map_is_strict_subset(
8524 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8528 if (!bmap1
|| !bmap2
)
8529 return isl_bool_error
;
8530 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8531 if (is_subset
!= isl_bool_true
)
8533 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8534 if (is_subset
== isl_bool_error
)
8539 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8540 __isl_keep isl_map
*map2
)
8545 return isl_bool_error
;
8546 is_subset
= isl_map_is_subset(map1
, map2
);
8547 if (is_subset
!= isl_bool_true
)
8549 is_subset
= isl_map_is_subset(map2
, map1
);
8550 if (is_subset
== isl_bool_error
)
8555 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8556 __isl_keep isl_set
*set2
)
8558 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8561 /* Is "bmap" obviously equal to the universe with the same space?
8563 * That is, does it not have any constraints?
8565 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8568 return isl_bool_error
;
8569 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8572 /* Is "bset" obviously equal to the universe with the same space?
8574 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8576 return isl_basic_map_plain_is_universe(bset
);
8579 /* If "c" does not involve any existentially quantified variables,
8580 * then set *univ to false and abort
8582 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8584 isl_bool
*univ
= user
;
8587 n
= isl_constraint_dim(c
, isl_dim_div
);
8588 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8589 isl_constraint_free(c
);
8590 if (*univ
< 0 || !*univ
)
8591 return isl_stat_error
;
8595 /* Is "bmap" equal to the universe with the same space?
8597 * First check if it is obviously equal to the universe.
8598 * If not and if there are any constraints not involving
8599 * existentially quantified variables, then it is certainly
8600 * not equal to the universe.
8601 * Otherwise, check if the universe is a subset of "bmap".
8603 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8606 isl_basic_map
*test
;
8608 univ
= isl_basic_map_plain_is_universe(bmap
);
8609 if (univ
< 0 || univ
)
8611 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8612 return isl_bool_false
;
8613 univ
= isl_bool_true
;
8614 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8616 return isl_bool_error
;
8617 if (univ
< 0 || !univ
)
8619 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8620 univ
= isl_basic_map_is_subset(test
, bmap
);
8621 isl_basic_map_free(test
);
8625 /* Is "bset" equal to the universe with the same space?
8627 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8629 return isl_basic_map_is_universe(bset
);
8632 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8637 return isl_bool_error
;
8639 for (i
= 0; i
< map
->n
; ++i
) {
8640 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8645 return isl_bool_false
;
8648 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8650 return isl_map_plain_is_universe(set_to_map(set
));
8653 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8655 struct isl_basic_set
*bset
= NULL
;
8656 struct isl_vec
*sample
= NULL
;
8657 isl_bool empty
, non_empty
;
8660 return isl_bool_error
;
8662 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8663 return isl_bool_true
;
8665 if (isl_basic_map_plain_is_universe(bmap
))
8666 return isl_bool_false
;
8668 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8669 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8670 copy
= isl_basic_map_remove_redundancies(copy
);
8671 empty
= isl_basic_map_plain_is_empty(copy
);
8672 isl_basic_map_free(copy
);
8676 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8678 return isl_bool_error
;
8680 return isl_bool_false
;
8681 isl_vec_free(bmap
->sample
);
8682 bmap
->sample
= NULL
;
8683 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8685 return isl_bool_error
;
8686 sample
= isl_basic_set_sample_vec(bset
);
8688 return isl_bool_error
;
8689 empty
= sample
->size
== 0;
8690 isl_vec_free(bmap
->sample
);
8691 bmap
->sample
= sample
;
8693 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8698 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8701 return isl_bool_error
;
8702 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8705 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8708 return isl_bool_error
;
8709 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8712 /* Is "bmap" known to be non-empty?
8714 * That is, is the cached sample still valid?
8716 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8721 return isl_bool_error
;
8723 return isl_bool_false
;
8724 total
= 1 + isl_basic_map_total_dim(bmap
);
8725 if (bmap
->sample
->size
!= total
)
8726 return isl_bool_false
;
8727 return isl_basic_map_contains(bmap
, bmap
->sample
);
8730 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8732 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8735 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8736 __isl_take isl_basic_map
*bmap2
)
8738 struct isl_map
*map
;
8739 if (!bmap1
|| !bmap2
)
8742 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8744 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8747 map
= isl_map_add_basic_map(map
, bmap1
);
8748 map
= isl_map_add_basic_map(map
, bmap2
);
8751 isl_basic_map_free(bmap1
);
8752 isl_basic_map_free(bmap2
);
8756 struct isl_set
*isl_basic_set_union(
8757 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8759 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8760 bset_to_bmap(bset2
)));
8763 /* Order divs such that any div only depends on previous divs */
8764 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8765 __isl_take isl_basic_map
*bmap
)
8773 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8775 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8777 if (isl_int_is_zero(bmap
->div
[i
][0]))
8779 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8784 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8785 "integer division depends on itself",
8786 return isl_basic_map_free(bmap
));
8787 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8793 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8795 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8798 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8805 for (i
= 0; i
< map
->n
; ++i
) {
8806 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8817 /* Sort the local variables of "bset".
8819 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8820 __isl_take isl_basic_set
*bset
)
8822 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8825 /* Apply the expansion computed by isl_merge_divs.
8826 * The expansion itself is given by "exp" while the resulting
8827 * list of divs is given by "div".
8829 * Move the integer divisions of "bmap" into the right position
8830 * according to "exp" and then introduce the additional integer
8831 * divisions, adding div constraints.
8832 * The moving should be done first to avoid moving coefficients
8833 * in the definitions of the extra integer divisions.
8835 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8836 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8841 bmap
= isl_basic_map_cow(bmap
);
8845 if (div
->n_row
< bmap
->n_div
)
8846 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8847 "not an expansion", goto error
);
8849 n_div
= bmap
->n_div
;
8850 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8851 div
->n_row
- n_div
, 0,
8852 2 * (div
->n_row
- n_div
));
8854 for (i
= n_div
; i
< div
->n_row
; ++i
)
8855 if (isl_basic_map_alloc_div(bmap
) < 0)
8858 for (j
= n_div
- 1; j
>= 0; --j
) {
8861 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8864 for (i
= 0; i
< div
->n_row
; ++i
) {
8865 if (j
< n_div
&& exp
[j
] == i
) {
8868 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8869 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8871 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8879 isl_basic_map_free(bmap
);
8884 /* Apply the expansion computed by isl_merge_divs.
8885 * The expansion itself is given by "exp" while the resulting
8886 * list of divs is given by "div".
8888 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8889 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8891 return isl_basic_map_expand_divs(bset
, div
, exp
);
8894 /* Look for a div in dst that corresponds to the div "div" in src.
8895 * The divs before "div" in src and dst are assumed to be the same.
8897 * Returns -1 if no corresponding div was found and the position
8898 * of the corresponding div in dst otherwise.
8900 static int find_div(__isl_keep isl_basic_map
*dst
,
8901 __isl_keep isl_basic_map
*src
, unsigned div
)
8905 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8907 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8908 for (i
= div
; i
< dst
->n_div
; ++i
)
8909 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8910 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8911 dst
->n_div
- div
) == -1)
8916 /* Align the divs of "dst" to those of "src", adding divs from "src"
8917 * if needed. That is, make sure that the first src->n_div divs
8918 * of the result are equal to those of src.
8920 * The result is not finalized as by design it will have redundant
8921 * divs if any divs from "src" were copied.
8923 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8924 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8927 int known
, extended
;
8931 return isl_basic_map_free(dst
);
8933 if (src
->n_div
== 0)
8936 known
= isl_basic_map_divs_known(src
);
8938 return isl_basic_map_free(dst
);
8940 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8941 "some src divs are unknown",
8942 return isl_basic_map_free(dst
));
8944 src
= isl_basic_map_order_divs(src
);
8947 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8948 for (i
= 0; i
< src
->n_div
; ++i
) {
8949 int j
= find_div(dst
, src
, i
);
8952 int extra
= src
->n_div
- i
;
8953 dst
= isl_basic_map_cow(dst
);
8956 dst
= isl_basic_map_extend_space(dst
,
8957 isl_space_copy(dst
->dim
),
8958 extra
, 0, 2 * extra
);
8961 j
= isl_basic_map_alloc_div(dst
);
8963 return isl_basic_map_free(dst
);
8964 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8965 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8966 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8967 return isl_basic_map_free(dst
);
8970 isl_basic_map_swap_div(dst
, i
, j
);
8975 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8983 map
= isl_map_compute_divs(map
);
8984 map
= isl_map_cow(map
);
8988 for (i
= 1; i
< map
->n
; ++i
)
8989 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8990 for (i
= 1; i
< map
->n
; ++i
) {
8991 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8993 return isl_map_free(map
);
8996 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
9000 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9002 return isl_map_align_divs_internal(map
);
9005 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9007 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9010 /* Align the divs of the basic maps in "map" to those
9011 * of the basic maps in "list", as well as to the other basic maps in "map".
9012 * The elements in "list" are assumed to have known divs.
9014 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9015 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9019 map
= isl_map_compute_divs(map
);
9020 map
= isl_map_cow(map
);
9022 return isl_map_free(map
);
9026 n
= isl_basic_map_list_n_basic_map(list
);
9027 for (i
= 0; i
< n
; ++i
) {
9028 isl_basic_map
*bmap
;
9030 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9031 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9032 isl_basic_map_free(bmap
);
9035 return isl_map_free(map
);
9037 return isl_map_align_divs_internal(map
);
9040 /* Align the divs of each element of "list" to those of "bmap".
9041 * Both "bmap" and the elements of "list" are assumed to have known divs.
9043 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9044 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9049 return isl_basic_map_list_free(list
);
9051 n
= isl_basic_map_list_n_basic_map(list
);
9052 for (i
= 0; i
< n
; ++i
) {
9053 isl_basic_map
*bmap_i
;
9055 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9056 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9057 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9063 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9064 __isl_take isl_map
*map
)
9068 ok
= isl_map_compatible_domain(map
, set
);
9072 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9073 "incompatible spaces", goto error
);
9074 map
= isl_map_intersect_domain(map
, set
);
9075 set
= isl_map_range(map
);
9083 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9084 __isl_take isl_map
*map
)
9086 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9089 /* There is no need to cow as removing empty parts doesn't change
9090 * the meaning of the set.
9092 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9099 for (i
= map
->n
- 1; i
>= 0; --i
)
9100 remove_if_empty(map
, i
);
9105 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9107 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9110 /* Given two basic sets bset1 and bset2, compute the maximal difference
9111 * between the values of dimension pos in bset1 and those in bset2
9112 * for any common value of the parameters and dimensions preceding pos.
9114 static enum isl_lp_result
basic_set_maximal_difference_at(
9115 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9116 int pos
, isl_int
*opt
)
9118 isl_basic_map
*bmap1
;
9119 isl_basic_map
*bmap2
;
9120 struct isl_ctx
*ctx
;
9121 struct isl_vec
*obj
;
9125 enum isl_lp_result res
;
9127 if (!bset1
|| !bset2
)
9128 return isl_lp_error
;
9130 nparam
= isl_basic_set_n_param(bset1
);
9131 dim1
= isl_basic_set_n_dim(bset1
);
9133 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9134 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9135 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9136 isl_dim_out
, 0, pos
);
9137 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9138 isl_dim_out
, 0, pos
);
9139 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
9141 return isl_lp_error
;
9143 total
= isl_basic_map_total_dim(bmap1
);
9145 obj
= isl_vec_alloc(ctx
, 1 + total
);
9148 isl_seq_clr(obj
->block
.data
, 1 + total
);
9149 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9150 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9151 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9153 isl_basic_map_free(bmap1
);
9157 isl_basic_map_free(bmap1
);
9158 return isl_lp_error
;
9161 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9162 * for any common value of the parameters and dimensions preceding pos
9163 * in both basic sets, the values of dimension pos in bset1 are
9164 * smaller or larger than those in bset2.
9167 * 1 if bset1 follows bset2
9168 * -1 if bset1 precedes bset2
9169 * 0 if bset1 and bset2 are incomparable
9170 * -2 if some error occurred.
9172 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9173 struct isl_basic_set
*bset2
, int pos
)
9176 enum isl_lp_result res
;
9181 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9183 if (res
== isl_lp_empty
)
9185 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9186 res
== isl_lp_unbounded
)
9188 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9197 /* Given two basic sets bset1 and bset2, check whether
9198 * for any common value of the parameters and dimensions preceding pos
9199 * there is a value of dimension pos in bset1 that is larger
9200 * than a value of the same dimension in bset2.
9203 * 1 if there exists such a pair
9204 * 0 if there is no such pair, but there is a pair of equal values
9206 * -2 if some error occurred.
9208 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9209 __isl_keep isl_basic_set
*bset2
, int pos
)
9212 enum isl_lp_result res
;
9217 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9219 if (res
== isl_lp_empty
)
9221 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9222 res
== isl_lp_unbounded
)
9224 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9226 else if (res
== isl_lp_ok
)
9235 /* Given two sets set1 and set2, check whether
9236 * for any common value of the parameters and dimensions preceding pos
9237 * there is a value of dimension pos in set1 that is larger
9238 * than a value of the same dimension in set2.
9241 * 1 if there exists such a pair
9242 * 0 if there is no such pair, but there is a pair of equal values
9244 * -2 if some error occurred.
9246 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9247 __isl_keep isl_set
*set2
, int pos
)
9255 for (i
= 0; i
< set1
->n
; ++i
)
9256 for (j
= 0; j
< set2
->n
; ++j
) {
9258 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9259 if (f
== 1 || f
== -2)
9268 static isl_bool
isl_basic_map_plain_has_fixed_var(
9269 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9276 return isl_bool_error
;
9277 total
= isl_basic_map_total_dim(bmap
);
9278 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9279 for (; d
+1 > pos
; --d
)
9280 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9284 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9285 return isl_bool_false
;
9286 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9287 return isl_bool_false
;
9288 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9289 return isl_bool_false
;
9291 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9292 return isl_bool_true
;
9294 return isl_bool_false
;
9297 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9298 unsigned pos
, isl_int
*val
)
9306 return isl_bool_error
;
9308 return isl_bool_false
;
9310 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9313 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9314 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9315 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9316 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9317 fixed
= isl_bool_false
;
9320 isl_int_set(*val
, v
);
9326 static isl_bool
isl_basic_set_plain_has_fixed_var(
9327 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9329 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9333 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9334 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9336 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9337 return isl_bool_error
;
9338 return isl_basic_map_plain_has_fixed_var(bmap
,
9339 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9342 /* If "bmap" obviously lies on a hyperplane where the given dimension
9343 * has a fixed value, then return that value.
9344 * Otherwise return NaN.
9346 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9347 __isl_keep isl_basic_map
*bmap
,
9348 enum isl_dim_type type
, unsigned pos
)
9356 ctx
= isl_basic_map_get_ctx(bmap
);
9357 v
= isl_val_alloc(ctx
);
9360 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9362 return isl_val_free(v
);
9364 isl_int_set_si(v
->d
, 1);
9368 return isl_val_nan(ctx
);
9371 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9372 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9374 if (pos
>= isl_map_dim(map
, type
))
9375 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9376 "position out of bounds", return isl_bool_error
);
9377 return isl_map_plain_has_fixed_var(map
,
9378 map_offset(map
, type
) - 1 + pos
, val
);
9381 /* If "map" obviously lies on a hyperplane where the given dimension
9382 * has a fixed value, then return that value.
9383 * Otherwise return NaN.
9385 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9386 enum isl_dim_type type
, unsigned pos
)
9394 ctx
= isl_map_get_ctx(map
);
9395 v
= isl_val_alloc(ctx
);
9398 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9400 return isl_val_free(v
);
9402 isl_int_set_si(v
->d
, 1);
9406 return isl_val_nan(ctx
);
9409 /* If "set" obviously lies on a hyperplane where the given dimension
9410 * has a fixed value, then return that value.
9411 * Otherwise return NaN.
9413 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9414 enum isl_dim_type type
, unsigned pos
)
9416 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9419 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9420 * then return this fixed value in *val.
9422 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9423 unsigned dim
, isl_int
*val
)
9425 return isl_basic_set_plain_has_fixed_var(bset
,
9426 isl_basic_set_n_param(bset
) + dim
, val
);
9429 /* Return -1 if the constraint "c1" should be sorted before "c2"
9430 * and 1 if it should be sorted after "c2".
9431 * Return 0 if the two constraints are the same (up to the constant term).
9433 * In particular, if a constraint involves later variables than another
9434 * then it is sorted after this other constraint.
9435 * uset_gist depends on constraints without existentially quantified
9436 * variables sorting first.
9438 * For constraints that have the same latest variable, those
9439 * with the same coefficient for this latest variable (first in absolute value
9440 * and then in actual value) are grouped together.
9441 * This is useful for detecting pairs of constraints that can
9442 * be chained in their printed representation.
9444 * Finally, within a group, constraints are sorted according to
9445 * their coefficients (excluding the constant term).
9447 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9449 isl_int
**c1
= (isl_int
**) p1
;
9450 isl_int
**c2
= (isl_int
**) p2
;
9452 unsigned size
= *(unsigned *) arg
;
9455 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9456 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9461 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9464 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9468 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9471 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9472 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9473 * and 0 if the two constraints are the same (up to the constant term).
9475 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9476 isl_int
*c1
, isl_int
*c2
)
9482 total
= isl_basic_map_total_dim(bmap
);
9483 return sort_constraint_cmp(&c1
, &c2
, &total
);
9486 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9487 __isl_take isl_basic_map
*bmap
)
9493 if (bmap
->n_ineq
== 0)
9495 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9497 total
= isl_basic_map_total_dim(bmap
);
9498 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9499 &sort_constraint_cmp
, &total
) < 0)
9500 return isl_basic_map_free(bmap
);
9504 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9505 __isl_take isl_basic_set
*bset
)
9507 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9508 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9511 __isl_give isl_basic_map
*isl_basic_map_normalize(
9512 __isl_take isl_basic_map
*bmap
)
9516 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9518 bmap
= isl_basic_map_remove_redundancies(bmap
);
9519 bmap
= isl_basic_map_sort_constraints(bmap
);
9521 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9524 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9525 __isl_keep isl_basic_map
*bmap2
)
9529 isl_space
*space1
, *space2
;
9531 if (!bmap1
|| !bmap2
)
9536 space1
= isl_basic_map_peek_space(bmap1
);
9537 space2
= isl_basic_map_peek_space(bmap2
);
9538 cmp
= isl_space_cmp(space1
, space2
);
9541 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9542 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9543 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9544 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9545 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9547 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9549 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9551 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9552 return bmap1
->n_eq
- bmap2
->n_eq
;
9553 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9554 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9555 if (bmap1
->n_div
!= bmap2
->n_div
)
9556 return bmap1
->n_div
- bmap2
->n_div
;
9557 total
= isl_basic_map_total_dim(bmap1
);
9558 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9559 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9563 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9564 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9568 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9569 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9576 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9577 __isl_keep isl_basic_set
*bset2
)
9579 return isl_basic_map_plain_cmp(bset1
, bset2
);
9582 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9588 if (set1
->n
!= set2
->n
)
9589 return set1
->n
- set2
->n
;
9591 for (i
= 0; i
< set1
->n
; ++i
) {
9592 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9600 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9601 __isl_keep isl_basic_map
*bmap2
)
9603 if (!bmap1
|| !bmap2
)
9604 return isl_bool_error
;
9605 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9608 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9609 __isl_keep isl_basic_set
*bset2
)
9611 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9612 bset_to_bmap(bset2
));
9615 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9617 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9618 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9620 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9623 /* Sort the basic maps of "map" and remove duplicate basic maps.
9625 * While removing basic maps, we make sure that the basic maps remain
9626 * sorted because isl_map_normalize expects the basic maps of the result
9629 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9633 map
= isl_map_remove_empty_parts(map
);
9636 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9637 for (i
= map
->n
- 1; i
>= 1; --i
) {
9638 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9640 isl_basic_map_free(map
->p
[i
-1]);
9641 for (j
= i
; j
< map
->n
; ++j
)
9642 map
->p
[j
- 1] = map
->p
[j
];
9649 /* Remove obvious duplicates among the basic maps of "map".
9651 * Unlike isl_map_normalize, this function does not remove redundant
9652 * constraints and only removes duplicates that have exactly the same
9653 * constraints in the input. It does sort the constraints and
9654 * the basic maps to ease the detection of duplicates.
9656 * If "map" has already been normalized or if the basic maps are
9657 * disjoint, then there can be no duplicates.
9659 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9662 isl_basic_map
*bmap
;
9668 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9670 for (i
= 0; i
< map
->n
; ++i
) {
9671 bmap
= isl_basic_map_copy(map
->p
[i
]);
9672 bmap
= isl_basic_map_sort_constraints(bmap
);
9674 return isl_map_free(map
);
9675 isl_basic_map_free(map
->p
[i
]);
9679 map
= sort_and_remove_duplicates(map
);
9683 /* We normalize in place, but if anything goes wrong we need
9684 * to return NULL, so we need to make sure we don't change the
9685 * meaning of any possible other copies of map.
9687 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9690 struct isl_basic_map
*bmap
;
9694 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9696 for (i
= 0; i
< map
->n
; ++i
) {
9697 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9700 isl_basic_map_free(map
->p
[i
]);
9704 map
= sort_and_remove_duplicates(map
);
9706 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9713 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9715 return set_from_map(isl_map_normalize(set_to_map(set
)));
9718 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9719 __isl_keep isl_map
*map2
)
9725 return isl_bool_error
;
9728 return isl_bool_true
;
9729 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9730 return isl_bool_false
;
9732 map1
= isl_map_copy(map1
);
9733 map2
= isl_map_copy(map2
);
9734 map1
= isl_map_normalize(map1
);
9735 map2
= isl_map_normalize(map2
);
9738 equal
= map1
->n
== map2
->n
;
9739 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9740 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9750 return isl_bool_error
;
9753 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9754 __isl_keep isl_set
*set2
)
9756 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9759 /* Return the basic maps in "map" as a list.
9761 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9762 __isl_keep isl_map
*map
)
9766 isl_basic_map_list
*list
;
9770 ctx
= isl_map_get_ctx(map
);
9771 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9773 for (i
= 0; i
< map
->n
; ++i
) {
9774 isl_basic_map
*bmap
;
9776 bmap
= isl_basic_map_copy(map
->p
[i
]);
9777 list
= isl_basic_map_list_add(list
, bmap
);
9783 /* Return the intersection of the elements in the non-empty list "list".
9784 * All elements are assumed to live in the same space.
9786 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9787 __isl_take isl_basic_map_list
*list
)
9790 isl_basic_map
*bmap
;
9794 n
= isl_basic_map_list_n_basic_map(list
);
9796 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9797 "expecting non-empty list", goto error
);
9799 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9800 for (i
= 1; i
< n
; ++i
) {
9801 isl_basic_map
*bmap_i
;
9803 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9804 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9807 isl_basic_map_list_free(list
);
9810 isl_basic_map_list_free(list
);
9814 /* Return the intersection of the elements in the non-empty list "list".
9815 * All elements are assumed to live in the same space.
9817 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9818 __isl_take isl_basic_set_list
*list
)
9820 return isl_basic_map_list_intersect(list
);
9823 /* Return the union of the elements of "list".
9824 * The list is required to have at least one element.
9826 __isl_give isl_set
*isl_basic_set_list_union(
9827 __isl_take isl_basic_set_list
*list
)
9831 isl_basic_set
*bset
;
9836 n
= isl_basic_set_list_n_basic_set(list
);
9838 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9839 "expecting non-empty list", goto error
);
9841 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9842 space
= isl_basic_set_get_space(bset
);
9843 isl_basic_set_free(bset
);
9845 set
= isl_set_alloc_space(space
, n
, 0);
9846 for (i
= 0; i
< n
; ++i
) {
9847 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9848 set
= isl_set_add_basic_set(set
, bset
);
9851 isl_basic_set_list_free(list
);
9854 isl_basic_set_list_free(list
);
9858 /* Return the union of the elements in the non-empty list "list".
9859 * All elements are assumed to live in the same space.
9861 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9868 n
= isl_set_list_n_set(list
);
9870 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9871 "expecting non-empty list", goto error
);
9873 set
= isl_set_list_get_set(list
, 0);
9874 for (i
= 1; i
< n
; ++i
) {
9877 set_i
= isl_set_list_get_set(list
, i
);
9878 set
= isl_set_union(set
, set_i
);
9881 isl_set_list_free(list
);
9884 isl_set_list_free(list
);
9888 __isl_give isl_basic_map
*isl_basic_map_product(
9889 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9891 isl_space
*dim_result
= NULL
;
9892 struct isl_basic_map
*bmap
;
9893 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9894 struct isl_dim_map
*dim_map1
, *dim_map2
;
9896 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9898 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9899 isl_space_copy(bmap2
->dim
));
9901 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9902 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9903 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9904 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9905 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9907 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9908 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9909 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9910 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9911 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9912 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9913 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9914 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9915 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9916 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9917 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9919 bmap
= isl_basic_map_alloc_space(dim_result
,
9920 bmap1
->n_div
+ bmap2
->n_div
,
9921 bmap1
->n_eq
+ bmap2
->n_eq
,
9922 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9923 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9924 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9925 bmap
= isl_basic_map_simplify(bmap
);
9926 return isl_basic_map_finalize(bmap
);
9928 isl_basic_map_free(bmap1
);
9929 isl_basic_map_free(bmap2
);
9933 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9934 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9936 isl_basic_map
*prod
;
9938 prod
= isl_basic_map_product(bmap1
, bmap2
);
9939 prod
= isl_basic_map_flatten(prod
);
9943 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9944 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9946 return isl_basic_map_flat_range_product(bset1
, bset2
);
9949 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9950 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9952 isl_space
*space_result
= NULL
;
9953 isl_basic_map
*bmap
;
9954 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9955 struct isl_dim_map
*dim_map1
, *dim_map2
;
9957 if (!bmap1
|| !bmap2
)
9960 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9961 isl_space_copy(bmap2
->dim
));
9963 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9964 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9965 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9966 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9968 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9969 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9970 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9971 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9972 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9973 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9974 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9975 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9976 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9977 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9978 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9980 bmap
= isl_basic_map_alloc_space(space_result
,
9981 bmap1
->n_div
+ bmap2
->n_div
,
9982 bmap1
->n_eq
+ bmap2
->n_eq
,
9983 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9984 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9985 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9986 bmap
= isl_basic_map_simplify(bmap
);
9987 return isl_basic_map_finalize(bmap
);
9989 isl_basic_map_free(bmap1
);
9990 isl_basic_map_free(bmap2
);
9994 __isl_give isl_basic_map
*isl_basic_map_range_product(
9995 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9998 isl_space
*dim_result
= NULL
;
9999 isl_basic_map
*bmap
;
10000 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10001 struct isl_dim_map
*dim_map1
, *dim_map2
;
10003 rational
= isl_basic_map_is_rational(bmap1
);
10004 if (rational
>= 0 && rational
)
10005 rational
= isl_basic_map_is_rational(bmap2
);
10006 if (!bmap1
|| !bmap2
|| rational
< 0)
10009 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10012 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10013 isl_space_copy(bmap2
->dim
));
10015 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10016 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10017 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10018 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10020 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10021 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10022 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10023 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10024 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10025 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10026 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10027 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10028 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10029 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10030 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10032 bmap
= isl_basic_map_alloc_space(dim_result
,
10033 bmap1
->n_div
+ bmap2
->n_div
,
10034 bmap1
->n_eq
+ bmap2
->n_eq
,
10035 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10036 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10037 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10039 bmap
= isl_basic_map_set_rational(bmap
);
10040 bmap
= isl_basic_map_simplify(bmap
);
10041 return isl_basic_map_finalize(bmap
);
10043 isl_basic_map_free(bmap1
);
10044 isl_basic_map_free(bmap2
);
10048 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10049 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10051 isl_basic_map
*prod
;
10053 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10054 prod
= isl_basic_map_flatten_range(prod
);
10058 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10059 * and collect the results.
10060 * The result live in the space obtained by calling "space_product"
10061 * on the spaces of "map1" and "map2".
10062 * If "remove_duplicates" is set then the result may contain duplicates
10063 * (even if the inputs do not) and so we try and remove the obvious
10066 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10067 __isl_take isl_map
*map2
,
10068 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10069 __isl_take isl_space
*right
),
10070 __isl_give isl_basic_map
*(*basic_map_product
)(
10071 __isl_take isl_basic_map
*left
,
10072 __isl_take isl_basic_map
*right
),
10073 int remove_duplicates
)
10075 unsigned flags
= 0;
10076 struct isl_map
*result
;
10080 m
= isl_map_has_equal_params(map1
, map2
);
10084 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10085 "parameters don't match", goto error
);
10087 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10088 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10089 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10091 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10092 isl_space_copy(map2
->dim
)),
10093 map1
->n
* map2
->n
, flags
);
10096 for (i
= 0; i
< map1
->n
; ++i
)
10097 for (j
= 0; j
< map2
->n
; ++j
) {
10098 struct isl_basic_map
*part
;
10099 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10100 isl_basic_map_copy(map2
->p
[j
]));
10101 if (isl_basic_map_is_empty(part
))
10102 isl_basic_map_free(part
);
10104 result
= isl_map_add_basic_map(result
, part
);
10108 if (remove_duplicates
)
10109 result
= isl_map_remove_obvious_duplicates(result
);
10110 isl_map_free(map1
);
10111 isl_map_free(map2
);
10114 isl_map_free(map1
);
10115 isl_map_free(map2
);
10119 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10121 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10122 __isl_take isl_map
*map2
)
10124 return map_product(map1
, map2
, &isl_space_product
,
10125 &isl_basic_map_product
, 0);
10128 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10129 __isl_take isl_map
*map2
)
10131 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10134 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10136 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10137 __isl_take isl_map
*map2
)
10141 prod
= isl_map_product(map1
, map2
);
10142 prod
= isl_map_flatten(prod
);
10146 /* Given two set A and B, construct its Cartesian product A x B.
10148 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10150 return isl_map_range_product(set1
, set2
);
10153 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10154 __isl_take isl_set
*set2
)
10156 return isl_map_flat_range_product(set1
, set2
);
10159 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10161 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10162 __isl_take isl_map
*map2
)
10164 return map_product(map1
, map2
, &isl_space_domain_product
,
10165 &isl_basic_map_domain_product
, 1);
10168 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10170 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10171 __isl_take isl_map
*map2
)
10173 return map_product(map1
, map2
, &isl_space_range_product
,
10174 &isl_basic_map_range_product
, 1);
10177 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10178 __isl_take isl_map
*map2
)
10180 return isl_map_align_params_map_map_and(map1
, map2
,
10181 &map_domain_product_aligned
);
10184 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10185 __isl_take isl_map
*map2
)
10187 return isl_map_align_params_map_map_and(map1
, map2
,
10188 &map_range_product_aligned
);
10191 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10193 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10196 int total1
, keep1
, total2
, keep2
;
10200 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10201 !isl_space_range_is_wrapping(map
->dim
))
10202 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10203 "not a product", return isl_map_free(map
));
10205 space
= isl_map_get_space(map
);
10206 total1
= isl_space_dim(space
, isl_dim_in
);
10207 total2
= isl_space_dim(space
, isl_dim_out
);
10208 space
= isl_space_factor_domain(space
);
10209 keep1
= isl_space_dim(space
, isl_dim_in
);
10210 keep2
= isl_space_dim(space
, isl_dim_out
);
10211 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10212 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10213 map
= isl_map_reset_space(map
, space
);
10218 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10220 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10223 int total1
, keep1
, total2
, keep2
;
10227 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10228 !isl_space_range_is_wrapping(map
->dim
))
10229 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10230 "not a product", return isl_map_free(map
));
10232 space
= isl_map_get_space(map
);
10233 total1
= isl_space_dim(space
, isl_dim_in
);
10234 total2
= isl_space_dim(space
, isl_dim_out
);
10235 space
= isl_space_factor_range(space
);
10236 keep1
= isl_space_dim(space
, isl_dim_in
);
10237 keep2
= isl_space_dim(space
, isl_dim_out
);
10238 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10239 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10240 map
= isl_map_reset_space(map
, space
);
10245 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10247 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10254 if (!isl_space_domain_is_wrapping(map
->dim
))
10255 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10256 "domain is not a product", return isl_map_free(map
));
10258 space
= isl_map_get_space(map
);
10259 total
= isl_space_dim(space
, isl_dim_in
);
10260 space
= isl_space_domain_factor_domain(space
);
10261 keep
= isl_space_dim(space
, isl_dim_in
);
10262 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10263 map
= isl_map_reset_space(map
, space
);
10268 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10270 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10277 if (!isl_space_domain_is_wrapping(map
->dim
))
10278 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10279 "domain is not a product", return isl_map_free(map
));
10281 space
= isl_map_get_space(map
);
10282 total
= isl_space_dim(space
, isl_dim_in
);
10283 space
= isl_space_domain_factor_range(space
);
10284 keep
= isl_space_dim(space
, isl_dim_in
);
10285 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10286 map
= isl_map_reset_space(map
, space
);
10291 /* Given a map A -> [B -> C], extract the map A -> B.
10293 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10300 if (!isl_space_range_is_wrapping(map
->dim
))
10301 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10302 "range is not a product", return isl_map_free(map
));
10304 space
= isl_map_get_space(map
);
10305 total
= isl_space_dim(space
, isl_dim_out
);
10306 space
= isl_space_range_factor_domain(space
);
10307 keep
= isl_space_dim(space
, isl_dim_out
);
10308 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10309 map
= isl_map_reset_space(map
, space
);
10314 /* Given a map A -> [B -> C], extract the map A -> C.
10316 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10323 if (!isl_space_range_is_wrapping(map
->dim
))
10324 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10325 "range is not a product", return isl_map_free(map
));
10327 space
= isl_map_get_space(map
);
10328 total
= isl_space_dim(space
, isl_dim_out
);
10329 space
= isl_space_range_factor_range(space
);
10330 keep
= isl_space_dim(space
, isl_dim_out
);
10331 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10332 map
= isl_map_reset_space(map
, space
);
10337 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10339 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10340 __isl_take isl_map
*map2
)
10344 prod
= isl_map_domain_product(map1
, map2
);
10345 prod
= isl_map_flatten_domain(prod
);
10349 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10351 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10352 __isl_take isl_map
*map2
)
10356 prod
= isl_map_range_product(map1
, map2
);
10357 prod
= isl_map_flatten_range(prod
);
10361 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10364 uint32_t hash
= isl_hash_init();
10369 bmap
= isl_basic_map_copy(bmap
);
10370 bmap
= isl_basic_map_normalize(bmap
);
10373 total
= isl_basic_map_total_dim(bmap
);
10374 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10375 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10377 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10378 isl_hash_hash(hash
, c_hash
);
10380 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10381 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10383 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10384 isl_hash_hash(hash
, c_hash
);
10386 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10387 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10389 if (isl_int_is_zero(bmap
->div
[i
][0]))
10391 isl_hash_byte(hash
, i
& 0xFF);
10392 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10393 isl_hash_hash(hash
, c_hash
);
10395 isl_basic_map_free(bmap
);
10399 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10401 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10404 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10411 map
= isl_map_copy(map
);
10412 map
= isl_map_normalize(map
);
10416 hash
= isl_hash_init();
10417 for (i
= 0; i
< map
->n
; ++i
) {
10418 uint32_t bmap_hash
;
10419 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10420 isl_hash_hash(hash
, bmap_hash
);
10428 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10430 return isl_map_get_hash(set_to_map(set
));
10433 /* Return the number of basic maps in the (current) representation of "map".
10435 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10437 return map
? map
->n
: 0;
10440 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10442 return set
? set
->n
: 0;
10445 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10446 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10451 return isl_stat_error
;
10453 for (i
= 0; i
< map
->n
; ++i
)
10454 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10455 return isl_stat_error
;
10457 return isl_stat_ok
;
10460 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10461 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10466 return isl_stat_error
;
10468 for (i
= 0; i
< set
->n
; ++i
)
10469 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10470 return isl_stat_error
;
10472 return isl_stat_ok
;
10475 /* Return a list of basic sets, the union of which is equal to "set".
10477 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10478 __isl_keep isl_set
*set
)
10481 isl_basic_set_list
*list
;
10486 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10487 for (i
= 0; i
< set
->n
; ++i
) {
10488 isl_basic_set
*bset
;
10490 bset
= isl_basic_set_copy(set
->p
[i
]);
10491 list
= isl_basic_set_list_add(list
, bset
);
10497 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10504 bset
= isl_basic_set_cow(bset
);
10508 dim
= isl_basic_set_get_space(bset
);
10509 dim
= isl_space_lift(dim
, bset
->n_div
);
10512 isl_space_free(bset
->dim
);
10514 bset
->extra
-= bset
->n_div
;
10517 bset
= isl_basic_set_finalize(bset
);
10521 isl_basic_set_free(bset
);
10525 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10531 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10536 set
= isl_set_cow(set
);
10540 n_div
= set
->p
[0]->n_div
;
10541 dim
= isl_set_get_space(set
);
10542 dim
= isl_space_lift(dim
, n_div
);
10545 isl_space_free(set
->dim
);
10548 for (i
= 0; i
< set
->n
; ++i
) {
10549 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10560 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10568 dim
= isl_basic_set_total_dim(bset
);
10569 size
+= bset
->n_eq
* (1 + dim
);
10570 size
+= bset
->n_ineq
* (1 + dim
);
10571 size
+= bset
->n_div
* (2 + dim
);
10576 int isl_set_size(__isl_keep isl_set
*set
)
10584 for (i
= 0; i
< set
->n
; ++i
)
10585 size
+= isl_basic_set_size(set
->p
[i
]);
10590 /* Check if there is any lower bound (if lower == 0) and/or upper
10591 * bound (if upper == 0) on the specified dim.
10593 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10594 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10598 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10599 return isl_bool_error
;
10601 pos
+= isl_basic_map_offset(bmap
, type
);
10603 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10604 if (isl_int_is_zero(bmap
->div
[i
][0]))
10606 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10607 return isl_bool_true
;
10610 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10611 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10612 return isl_bool_true
;
10614 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10615 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10622 return lower
&& upper
;
10625 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10626 enum isl_dim_type type
, unsigned pos
)
10628 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10631 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10632 enum isl_dim_type type
, unsigned pos
)
10634 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10637 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10638 enum isl_dim_type type
, unsigned pos
)
10640 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10643 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10644 enum isl_dim_type type
, unsigned pos
)
10649 return isl_bool_error
;
10651 for (i
= 0; i
< map
->n
; ++i
) {
10653 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10654 if (bounded
< 0 || !bounded
)
10658 return isl_bool_true
;
10661 /* Return true if the specified dim is involved in both an upper bound
10662 * and a lower bound.
10664 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10665 enum isl_dim_type type
, unsigned pos
)
10667 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10670 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10672 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10673 enum isl_dim_type type
, unsigned pos
,
10674 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10675 enum isl_dim_type type
, unsigned pos
))
10680 return isl_bool_error
;
10682 for (i
= 0; i
< map
->n
; ++i
) {
10684 bounded
= fn(map
->p
[i
], type
, pos
);
10685 if (bounded
< 0 || bounded
)
10689 return isl_bool_false
;
10692 /* Return 1 if the specified dim is involved in any lower bound.
10694 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10695 enum isl_dim_type type
, unsigned pos
)
10697 return has_any_bound(set
, type
, pos
,
10698 &isl_basic_map_dim_has_lower_bound
);
10701 /* Return 1 if the specified dim is involved in any upper bound.
10703 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10704 enum isl_dim_type type
, unsigned pos
)
10706 return has_any_bound(set
, type
, pos
,
10707 &isl_basic_map_dim_has_upper_bound
);
10710 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10712 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10713 enum isl_dim_type type
, unsigned pos
,
10714 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10715 enum isl_dim_type type
, unsigned pos
))
10720 return isl_bool_error
;
10722 for (i
= 0; i
< map
->n
; ++i
) {
10724 bounded
= fn(map
->p
[i
], type
, pos
);
10725 if (bounded
< 0 || !bounded
)
10729 return isl_bool_true
;
10732 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10734 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10735 enum isl_dim_type type
, unsigned pos
)
10737 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10740 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10742 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10743 enum isl_dim_type type
, unsigned pos
)
10745 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10748 /* For each of the "n" variables starting at "first", determine
10749 * the sign of the variable and put the results in the first "n"
10750 * elements of the array "signs".
10752 * 1 means that the variable is non-negative
10753 * -1 means that the variable is non-positive
10754 * 0 means the variable attains both positive and negative values.
10756 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10757 unsigned first
, unsigned n
, int *signs
)
10759 isl_vec
*bound
= NULL
;
10760 struct isl_tab
*tab
= NULL
;
10761 struct isl_tab_undo
*snap
;
10764 if (!bset
|| !signs
)
10765 return isl_stat_error
;
10767 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10768 tab
= isl_tab_from_basic_set(bset
, 0);
10769 if (!bound
|| !tab
)
10772 isl_seq_clr(bound
->el
, bound
->size
);
10773 isl_int_set_si(bound
->el
[0], -1);
10775 snap
= isl_tab_snap(tab
);
10776 for (i
= 0; i
< n
; ++i
) {
10779 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10780 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10782 empty
= tab
->empty
;
10783 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10784 if (isl_tab_rollback(tab
, snap
) < 0)
10792 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10793 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10795 empty
= tab
->empty
;
10796 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10797 if (isl_tab_rollback(tab
, snap
) < 0)
10800 signs
[i
] = empty
? -1 : 0;
10804 isl_vec_free(bound
);
10805 return isl_stat_ok
;
10808 isl_vec_free(bound
);
10809 return isl_stat_error
;
10812 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10813 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10815 if (!bset
|| !signs
)
10816 return isl_stat_error
;
10817 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10818 return isl_stat_error
);
10820 first
+= pos(bset
->dim
, type
) - 1;
10821 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10824 /* Is it possible for the integer division "div" to depend (possibly
10825 * indirectly) on any output dimensions?
10827 * If the div is undefined, then we conservatively assume that it
10828 * may depend on them.
10829 * Otherwise, we check if it actually depends on them or on any integer
10830 * divisions that may depend on them.
10832 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10835 unsigned n_out
, o_out
;
10836 unsigned n_div
, o_div
;
10838 if (isl_int_is_zero(bmap
->div
[div
][0]))
10839 return isl_bool_true
;
10841 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10842 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10844 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10845 return isl_bool_true
;
10847 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10848 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10850 for (i
= 0; i
< n_div
; ++i
) {
10851 isl_bool may_involve
;
10853 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10855 may_involve
= div_may_involve_output(bmap
, i
);
10856 if (may_involve
< 0 || may_involve
)
10857 return may_involve
;
10860 return isl_bool_false
;
10863 /* Return the first integer division of "bmap" in the range
10864 * [first, first + n[ that may depend on any output dimensions and
10865 * that has a non-zero coefficient in "c" (where the first coefficient
10866 * in "c" corresponds to integer division "first").
10868 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10869 isl_int
*c
, int first
, int n
)
10876 for (k
= first
; k
< first
+ n
; ++k
) {
10877 isl_bool may_involve
;
10879 if (isl_int_is_zero(c
[k
]))
10881 may_involve
= div_may_involve_output(bmap
, k
);
10882 if (may_involve
< 0)
10891 /* Look for a pair of inequality constraints in "bmap" of the form
10893 * -l + i >= 0 or i >= l
10895 * n + l - i >= 0 or i <= l + n
10897 * with n < "m" and i the output dimension at position "pos".
10898 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10899 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10900 * and earlier output dimensions, as well as integer divisions that do
10901 * not involve any of the output dimensions.
10903 * Return the index of the first inequality constraint or bmap->n_ineq
10904 * if no such pair can be found.
10906 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10907 int pos
, isl_int m
)
10912 unsigned n_div
, o_div
;
10913 unsigned n_out
, o_out
;
10919 ctx
= isl_basic_map_get_ctx(bmap
);
10920 total
= isl_basic_map_total_dim(bmap
);
10921 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10922 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10923 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10924 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10925 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10926 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10928 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10929 n_out
- (pos
+ 1)) != -1)
10931 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10934 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10935 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10938 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10939 bmap
->ineq
[j
] + 1, total
))
10943 if (j
>= bmap
->n_ineq
)
10945 isl_int_add(bmap
->ineq
[i
][0],
10946 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10947 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10948 isl_int_sub(bmap
->ineq
[i
][0],
10949 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10952 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10958 return bmap
->n_ineq
;
10961 /* Return the index of the equality of "bmap" that defines
10962 * the output dimension "pos" in terms of earlier dimensions.
10963 * The equality may also involve integer divisions, as long
10964 * as those integer divisions are defined in terms of
10965 * parameters or input dimensions.
10966 * In this case, *div is set to the number of integer divisions and
10967 * *ineq is set to the number of inequality constraints (provided
10968 * div and ineq are not NULL).
10970 * The equality may also involve a single integer division involving
10971 * the output dimensions (typically only output dimension "pos") as
10972 * long as the coefficient of output dimension "pos" is 1 or -1 and
10973 * there is a pair of constraints i >= l and i <= l + n, with i referring
10974 * to output dimension "pos", l an expression involving only earlier
10975 * dimensions and n smaller than the coefficient of the integer division
10976 * in the equality. In this case, the output dimension can be defined
10977 * in terms of a modulo expression that does not involve the integer division.
10978 * *div is then set to this single integer division and
10979 * *ineq is set to the index of constraint i >= l.
10981 * Return bmap->n_eq if there is no such equality.
10982 * Return -1 on error.
10984 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10985 int pos
, int *div
, int *ineq
)
10988 unsigned n_out
, o_out
;
10989 unsigned n_div
, o_div
;
10994 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10995 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10996 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10997 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11000 *ineq
= bmap
->n_ineq
;
11003 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11004 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11006 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11007 n_out
- (pos
+ 1)) != -1)
11009 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11013 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11014 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11016 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11017 k
+ 1, n_div
- (k
+1)) < n_div
)
11019 l
= find_modulo_constraint_pair(bmap
, pos
,
11020 bmap
->eq
[j
][o_div
+ k
]);
11023 if (l
>= bmap
->n_ineq
)
11035 /* Check if the given basic map is obviously single-valued.
11036 * In particular, for each output dimension, check that there is
11037 * an equality that defines the output dimension in terms of
11038 * earlier dimensions.
11040 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11046 return isl_bool_error
;
11048 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11050 for (i
= 0; i
< n_out
; ++i
) {
11053 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11056 return isl_bool_error
;
11057 if (eq
>= bmap
->n_eq
)
11058 return isl_bool_false
;
11061 return isl_bool_true
;
11064 /* Check if the given basic map is single-valued.
11065 * We simply compute
11069 * and check if the result is a subset of the identity mapping.
11071 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11074 isl_basic_map
*test
;
11078 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11082 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11083 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11085 space
= isl_basic_map_get_space(bmap
);
11086 space
= isl_space_map_from_set(isl_space_range(space
));
11087 id
= isl_basic_map_identity(space
);
11089 sv
= isl_basic_map_is_subset(test
, id
);
11091 isl_basic_map_free(test
);
11092 isl_basic_map_free(id
);
11097 /* Check if the given map is obviously single-valued.
11099 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11102 return isl_bool_error
;
11104 return isl_bool_true
;
11106 return isl_bool_false
;
11108 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11111 /* Check if the given map is single-valued.
11112 * We simply compute
11116 * and check if the result is a subset of the identity mapping.
11118 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11125 sv
= isl_map_plain_is_single_valued(map
);
11129 test
= isl_map_reverse(isl_map_copy(map
));
11130 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11132 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11133 id
= isl_map_identity(dim
);
11135 sv
= isl_map_is_subset(test
, id
);
11137 isl_map_free(test
);
11143 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11147 map
= isl_map_copy(map
);
11148 map
= isl_map_reverse(map
);
11149 in
= isl_map_is_single_valued(map
);
11155 /* Check if the given map is obviously injective.
11157 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11161 map
= isl_map_copy(map
);
11162 map
= isl_map_reverse(map
);
11163 in
= isl_map_plain_is_single_valued(map
);
11169 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11173 sv
= isl_map_is_single_valued(map
);
11177 return isl_map_is_injective(map
);
11180 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11182 return isl_map_is_single_valued(set_to_map(set
));
11185 /* Does "map" only map elements to themselves?
11187 * If the domain and range spaces are different, then "map"
11188 * is considered not to be an identity relation, even if it is empty.
11189 * Otherwise, construct the maximal identity relation and
11190 * check whether "map" is a subset of this relation.
11192 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11196 isl_bool equal
, is_identity
;
11198 space
= isl_map_get_space(map
);
11199 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11200 isl_space_free(space
);
11201 if (equal
< 0 || !equal
)
11204 id
= isl_map_identity(isl_map_get_space(map
));
11205 is_identity
= isl_map_is_subset(map
, id
);
11208 return is_identity
;
11211 int isl_map_is_translation(__isl_keep isl_map
*map
)
11216 delta
= isl_map_deltas(isl_map_copy(map
));
11217 ok
= isl_set_is_singleton(delta
);
11218 isl_set_free(delta
);
11223 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11225 if (isl_seq_first_non_zero(p
, pos
) != -1)
11227 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11232 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11239 return isl_bool_error
;
11241 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11242 return isl_bool_false
;
11244 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11245 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11246 for (j
= 0; j
< nvar
; ++j
) {
11247 int lower
= 0, upper
= 0;
11248 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11249 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11251 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11252 return isl_bool_false
;
11255 if (i
< bset
->n_eq
)
11257 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11258 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11260 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11261 return isl_bool_false
;
11262 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11267 if (!lower
|| !upper
)
11268 return isl_bool_false
;
11271 return isl_bool_true
;
11274 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11277 return isl_bool_error
;
11279 return isl_bool_false
;
11281 return isl_basic_set_is_box(set
->p
[0]);
11284 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11287 return isl_bool_error
;
11289 return isl_space_is_wrapping(bset
->dim
);
11292 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11295 return isl_bool_error
;
11297 return isl_space_is_wrapping(set
->dim
);
11300 /* Modify the space of "map" through a call to "change".
11301 * If "can_change" is set (not NULL), then first call it to check
11302 * if the modification is allowed, printing the error message "cannot_change"
11305 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11306 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11307 const char *cannot_change
,
11308 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11316 ok
= can_change
? can_change(map
) : isl_bool_true
;
11318 return isl_map_free(map
);
11320 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11321 return isl_map_free(map
));
11323 space
= change(isl_map_get_space(map
));
11324 map
= isl_map_reset_space(map
, space
);
11329 /* Is the domain of "map" a wrapped relation?
11331 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11334 return isl_bool_error
;
11336 return isl_space_domain_is_wrapping(map
->dim
);
11339 /* Does "map" have a wrapped relation in both domain and range?
11341 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11343 return isl_space_is_product(isl_map_peek_space(map
));
11346 /* Is the range of "map" a wrapped relation?
11348 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11351 return isl_bool_error
;
11353 return isl_space_range_is_wrapping(map
->dim
);
11356 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11358 bmap
= isl_basic_map_cow(bmap
);
11362 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11366 bmap
= isl_basic_map_finalize(bmap
);
11368 return bset_from_bmap(bmap
);
11370 isl_basic_map_free(bmap
);
11374 /* Given a map A -> B, return the set (A -> B).
11376 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11378 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11381 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11383 bset
= isl_basic_set_cow(bset
);
11387 bset
->dim
= isl_space_unwrap(bset
->dim
);
11391 bset
= isl_basic_set_finalize(bset
);
11393 return bset_to_bmap(bset
);
11395 isl_basic_set_free(bset
);
11399 /* Given a set (A -> B), return the map A -> B.
11400 * Error out if "set" is not of the form (A -> B).
11402 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11404 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11405 "not a wrapping set", &isl_space_unwrap
);
11408 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11409 enum isl_dim_type type
)
11414 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11417 bmap
= isl_basic_map_cow(bmap
);
11421 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11425 bmap
= isl_basic_map_finalize(bmap
);
11429 isl_basic_map_free(bmap
);
11433 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11434 enum isl_dim_type type
)
11441 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11444 map
= isl_map_cow(map
);
11448 for (i
= 0; i
< map
->n
; ++i
) {
11449 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11453 map
->dim
= isl_space_reset(map
->dim
, type
);
11463 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11468 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11471 bmap
= isl_basic_map_cow(bmap
);
11475 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11479 bmap
= isl_basic_map_finalize(bmap
);
11483 isl_basic_map_free(bmap
);
11487 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11489 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11492 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11493 __isl_take isl_basic_map
*bmap
)
11498 if (!bmap
->dim
->nested
[0])
11501 bmap
= isl_basic_map_cow(bmap
);
11505 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11509 bmap
= isl_basic_map_finalize(bmap
);
11513 isl_basic_map_free(bmap
);
11517 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11518 __isl_take isl_basic_map
*bmap
)
11523 if (!bmap
->dim
->nested
[1])
11526 bmap
= isl_basic_map_cow(bmap
);
11530 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11534 bmap
= isl_basic_map_finalize(bmap
);
11538 isl_basic_map_free(bmap
);
11542 /* Remove any internal structure from the spaces of domain and range of "map".
11544 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11549 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11552 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11555 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11557 return set_from_map(isl_map_flatten(set_to_map(set
)));
11560 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11562 isl_space
*dim
, *flat_dim
;
11565 dim
= isl_set_get_space(set
);
11566 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11567 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11568 map
= isl_map_intersect_domain(map
, set
);
11573 /* Remove any internal structure from the space of the domain of "map".
11575 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11580 if (!map
->dim
->nested
[0])
11583 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11586 /* Remove any internal structure from the space of the range of "map".
11588 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11593 if (!map
->dim
->nested
[1])
11596 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11599 /* Reorder the dimensions of "bmap" according to the given dim_map
11600 * and set the dimension specification to "dim" and
11601 * perform Gaussian elimination on the result.
11603 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11604 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11606 isl_basic_map
*res
;
11609 bmap
= isl_basic_map_cow(bmap
);
11610 if (!bmap
|| !dim
|| !dim_map
)
11613 flags
= bmap
->flags
;
11614 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11615 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11616 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11617 res
= isl_basic_map_alloc_space(dim
,
11618 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11619 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11621 res
->flags
= flags
;
11622 res
= isl_basic_map_gauss(res
, NULL
);
11623 res
= isl_basic_map_finalize(res
);
11627 isl_basic_map_free(bmap
);
11628 isl_space_free(dim
);
11632 /* Reorder the dimensions of "map" according to given reordering.
11634 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11635 __isl_take isl_reordering
*r
)
11638 struct isl_dim_map
*dim_map
;
11640 map
= isl_map_cow(map
);
11641 dim_map
= isl_dim_map_from_reordering(r
);
11642 if (!map
|| !r
|| !dim_map
)
11645 for (i
= 0; i
< map
->n
; ++i
) {
11646 struct isl_dim_map
*dim_map_i
;
11648 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11650 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11651 isl_space_copy(r
->dim
), dim_map_i
);
11657 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11659 isl_reordering_free(r
);
11665 isl_reordering_free(r
);
11669 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11670 __isl_take isl_reordering
*r
)
11672 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11675 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11676 __isl_take isl_space
*model
)
11681 if (!map
|| !model
)
11684 ctx
= isl_space_get_ctx(model
);
11685 if (!isl_space_has_named_params(model
))
11686 isl_die(ctx
, isl_error_invalid
,
11687 "model has unnamed parameters", goto error
);
11688 if (isl_map_check_named_params(map
) < 0)
11690 aligned
= isl_map_space_has_equal_params(map
, model
);
11694 isl_reordering
*exp
;
11696 model
= isl_space_drop_dims(model
, isl_dim_in
,
11697 0, isl_space_dim(model
, isl_dim_in
));
11698 model
= isl_space_drop_dims(model
, isl_dim_out
,
11699 0, isl_space_dim(model
, isl_dim_out
));
11700 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11701 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11702 map
= isl_map_realign(map
, exp
);
11705 isl_space_free(model
);
11708 isl_space_free(model
);
11713 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11714 __isl_take isl_space
*model
)
11716 return isl_map_align_params(set
, model
);
11719 /* Align the parameters of "bmap" to those of "model", introducing
11720 * additional parameters if needed.
11722 __isl_give isl_basic_map
*isl_basic_map_align_params(
11723 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11726 isl_bool equal_params
;
11728 if (!bmap
|| !model
)
11731 ctx
= isl_space_get_ctx(model
);
11732 if (!isl_space_has_named_params(model
))
11733 isl_die(ctx
, isl_error_invalid
,
11734 "model has unnamed parameters", goto error
);
11735 if (!isl_space_has_named_params(bmap
->dim
))
11736 isl_die(ctx
, isl_error_invalid
,
11737 "relation has unnamed parameters", goto error
);
11738 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11739 if (equal_params
< 0)
11741 if (!equal_params
) {
11742 isl_reordering
*exp
;
11743 struct isl_dim_map
*dim_map
;
11745 model
= isl_space_drop_dims(model
, isl_dim_in
,
11746 0, isl_space_dim(model
, isl_dim_in
));
11747 model
= isl_space_drop_dims(model
, isl_dim_out
,
11748 0, isl_space_dim(model
, isl_dim_out
));
11749 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11750 exp
= isl_reordering_extend_space(exp
,
11751 isl_basic_map_get_space(bmap
));
11752 dim_map
= isl_dim_map_from_reordering(exp
);
11753 bmap
= isl_basic_map_realign(bmap
,
11754 exp
? isl_space_copy(exp
->dim
) : NULL
,
11755 isl_dim_map_extend(dim_map
, bmap
));
11756 isl_reordering_free(exp
);
11760 isl_space_free(model
);
11763 isl_space_free(model
);
11764 isl_basic_map_free(bmap
);
11768 /* Do "bset" and "space" have the same parameters?
11770 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11771 __isl_keep isl_space
*space
)
11773 isl_space
*bset_space
;
11775 bset_space
= isl_basic_set_peek_space(bset
);
11776 return isl_space_has_equal_params(bset_space
, space
);
11779 /* Do "map" and "space" have the same parameters?
11781 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11782 __isl_keep isl_space
*space
)
11784 isl_space
*map_space
;
11786 map_space
= isl_map_peek_space(map
);
11787 return isl_space_has_equal_params(map_space
, space
);
11790 /* Do "set" and "space" have the same parameters?
11792 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11793 __isl_keep isl_space
*space
)
11795 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11798 /* Align the parameters of "bset" to those of "model", introducing
11799 * additional parameters if needed.
11801 __isl_give isl_basic_set
*isl_basic_set_align_params(
11802 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11804 return isl_basic_map_align_params(bset
, model
);
11807 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11808 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11809 enum isl_dim_type c2
, enum isl_dim_type c3
,
11810 enum isl_dim_type c4
, enum isl_dim_type c5
)
11812 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11813 struct isl_mat
*mat
;
11819 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11820 isl_basic_map_total_dim(bmap
) + 1);
11823 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11824 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11825 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11826 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11827 isl_int_set(mat
->row
[i
][pos
],
11828 bmap
->eq
[i
][off
+ k
]);
11836 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11837 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11838 enum isl_dim_type c2
, enum isl_dim_type c3
,
11839 enum isl_dim_type c4
, enum isl_dim_type c5
)
11841 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11842 struct isl_mat
*mat
;
11848 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11849 isl_basic_map_total_dim(bmap
) + 1);
11852 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11853 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11854 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11855 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11856 isl_int_set(mat
->row
[i
][pos
],
11857 bmap
->ineq
[i
][off
+ k
]);
11865 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11866 __isl_take isl_space
*dim
,
11867 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11868 enum isl_dim_type c2
, enum isl_dim_type c3
,
11869 enum isl_dim_type c4
, enum isl_dim_type c5
)
11871 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11872 isl_basic_map
*bmap
;
11878 if (!dim
|| !eq
|| !ineq
)
11881 if (eq
->n_col
!= ineq
->n_col
)
11882 isl_die(dim
->ctx
, isl_error_invalid
,
11883 "equalities and inequalities matrices should have "
11884 "same number of columns", goto error
);
11886 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11888 if (eq
->n_col
< total
)
11889 isl_die(dim
->ctx
, isl_error_invalid
,
11890 "number of columns too small", goto error
);
11892 extra
= eq
->n_col
- total
;
11894 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11895 eq
->n_row
, ineq
->n_row
);
11898 for (i
= 0; i
< extra
; ++i
) {
11899 k
= isl_basic_map_alloc_div(bmap
);
11902 isl_int_set_si(bmap
->div
[k
][0], 0);
11904 for (i
= 0; i
< eq
->n_row
; ++i
) {
11905 l
= isl_basic_map_alloc_equality(bmap
);
11908 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11909 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11910 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11911 isl_int_set(bmap
->eq
[l
][off
+ k
],
11917 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11918 l
= isl_basic_map_alloc_inequality(bmap
);
11921 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11922 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11923 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11924 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11925 ineq
->row
[i
][pos
]);
11931 isl_space_free(dim
);
11933 isl_mat_free(ineq
);
11935 bmap
= isl_basic_map_simplify(bmap
);
11936 return isl_basic_map_finalize(bmap
);
11938 isl_space_free(dim
);
11940 isl_mat_free(ineq
);
11944 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11945 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11946 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11948 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11949 c1
, c2
, c3
, c4
, isl_dim_in
);
11952 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11953 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11954 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11956 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11957 c1
, c2
, c3
, c4
, isl_dim_in
);
11960 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11961 __isl_take isl_space
*dim
,
11962 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11963 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11965 isl_basic_map
*bmap
;
11966 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11967 c1
, c2
, c3
, c4
, isl_dim_in
);
11968 return bset_from_bmap(bmap
);
11971 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11974 return isl_bool_error
;
11976 return isl_space_can_zip(bmap
->dim
);
11979 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11982 return isl_bool_error
;
11984 return isl_space_can_zip(map
->dim
);
11987 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11988 * (A -> C) -> (B -> D).
11990 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11999 if (!isl_basic_map_can_zip(bmap
))
12000 isl_die(bmap
->ctx
, isl_error_invalid
,
12001 "basic map cannot be zipped", goto error
);
12002 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12003 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12004 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12005 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12006 bmap
= isl_basic_map_cow(bmap
);
12007 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12010 bmap
->dim
= isl_space_zip(bmap
->dim
);
12013 bmap
= isl_basic_map_mark_final(bmap
);
12016 isl_basic_map_free(bmap
);
12020 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12021 * (A -> C) -> (B -> D).
12023 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12030 if (!isl_map_can_zip(map
))
12031 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12034 map
= isl_map_cow(map
);
12038 for (i
= 0; i
< map
->n
; ++i
) {
12039 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12044 map
->dim
= isl_space_zip(map
->dim
);
12054 /* Can we apply isl_basic_map_curry to "bmap"?
12055 * That is, does it have a nested relation in its domain?
12057 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12060 return isl_bool_error
;
12062 return isl_space_can_curry(bmap
->dim
);
12065 /* Can we apply isl_map_curry to "map"?
12066 * That is, does it have a nested relation in its domain?
12068 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12071 return isl_bool_error
;
12073 return isl_space_can_curry(map
->dim
);
12076 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12079 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12085 if (!isl_basic_map_can_curry(bmap
))
12086 isl_die(bmap
->ctx
, isl_error_invalid
,
12087 "basic map cannot be curried", goto error
);
12088 bmap
= isl_basic_map_cow(bmap
);
12091 bmap
->dim
= isl_space_curry(bmap
->dim
);
12094 bmap
= isl_basic_map_mark_final(bmap
);
12097 isl_basic_map_free(bmap
);
12101 /* Given a map (A -> B) -> C, return the corresponding map
12104 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12106 return isl_map_change_space(map
, &isl_map_can_curry
,
12107 "map cannot be curried", &isl_space_curry
);
12110 /* Can isl_map_range_curry be applied to "map"?
12111 * That is, does it have a nested relation in its range,
12112 * the domain of which is itself a nested relation?
12114 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12117 return isl_bool_error
;
12119 return isl_space_can_range_curry(map
->dim
);
12122 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12123 * A -> (B -> (C -> D)).
12125 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12127 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12128 "map range cannot be curried",
12129 &isl_space_range_curry
);
12132 /* Can we apply isl_basic_map_uncurry to "bmap"?
12133 * That is, does it have a nested relation in its domain?
12135 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12138 return isl_bool_error
;
12140 return isl_space_can_uncurry(bmap
->dim
);
12143 /* Can we apply isl_map_uncurry to "map"?
12144 * That is, does it have a nested relation in its domain?
12146 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12149 return isl_bool_error
;
12151 return isl_space_can_uncurry(map
->dim
);
12154 /* Given a basic map A -> (B -> C), return the corresponding basic map
12157 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12163 if (!isl_basic_map_can_uncurry(bmap
))
12164 isl_die(bmap
->ctx
, isl_error_invalid
,
12165 "basic map cannot be uncurried",
12166 return isl_basic_map_free(bmap
));
12167 bmap
= isl_basic_map_cow(bmap
);
12170 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12172 return isl_basic_map_free(bmap
);
12173 bmap
= isl_basic_map_mark_final(bmap
);
12177 /* Given a map A -> (B -> C), return the corresponding map
12180 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12182 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12183 "map cannot be uncurried", &isl_space_uncurry
);
12186 /* Construct a basic map mapping the domain of the affine expression
12187 * to a one-dimensional range prescribed by the affine expression.
12188 * If "rational" is set, then construct a rational basic map.
12190 * A NaN affine expression cannot be converted to a basic map.
12192 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12193 __isl_take isl_aff
*aff
, int rational
)
12198 isl_local_space
*ls
;
12199 isl_basic_map
*bmap
= NULL
;
12203 is_nan
= isl_aff_is_nan(aff
);
12207 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12208 "cannot convert NaN", goto error
);
12210 ls
= isl_aff_get_local_space(aff
);
12211 bmap
= isl_basic_map_from_local_space(ls
);
12212 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12213 k
= isl_basic_map_alloc_equality(bmap
);
12217 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12218 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12219 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12220 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12221 aff
->v
->size
- (pos
+ 1));
12225 bmap
= isl_basic_map_set_rational(bmap
);
12226 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12227 bmap
= isl_basic_map_finalize(bmap
);
12231 isl_basic_map_free(bmap
);
12235 /* Construct a basic map mapping the domain of the affine expression
12236 * to a one-dimensional range prescribed by the affine expression.
12238 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12240 return isl_basic_map_from_aff2(aff
, 0);
12243 /* Construct a map mapping the domain of the affine expression
12244 * to a one-dimensional range prescribed by the affine expression.
12246 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12248 isl_basic_map
*bmap
;
12250 bmap
= isl_basic_map_from_aff(aff
);
12251 return isl_map_from_basic_map(bmap
);
12254 /* Construct a basic map mapping the domain the multi-affine expression
12255 * to its range, with each dimension in the range equated to the
12256 * corresponding affine expression.
12257 * If "rational" is set, then construct a rational basic map.
12259 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12260 __isl_take isl_multi_aff
*maff
, int rational
)
12264 isl_basic_map
*bmap
;
12269 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12270 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12271 "invalid space", goto error
);
12273 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12274 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12276 bmap
= isl_basic_map_set_rational(bmap
);
12278 for (i
= 0; i
< maff
->n
; ++i
) {
12280 isl_basic_map
*bmap_i
;
12282 aff
= isl_aff_copy(maff
->u
.p
[i
]);
12283 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12285 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12288 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12290 isl_multi_aff_free(maff
);
12293 isl_multi_aff_free(maff
);
12297 /* Construct a basic map mapping the domain the multi-affine expression
12298 * to its range, with each dimension in the range equated to the
12299 * corresponding affine expression.
12301 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12302 __isl_take isl_multi_aff
*ma
)
12304 return isl_basic_map_from_multi_aff2(ma
, 0);
12307 /* Construct a map mapping the domain the multi-affine expression
12308 * to its range, with each dimension in the range equated to the
12309 * corresponding affine expression.
12311 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12313 isl_basic_map
*bmap
;
12315 bmap
= isl_basic_map_from_multi_aff(maff
);
12316 return isl_map_from_basic_map(bmap
);
12319 /* Construct a basic map mapping a domain in the given space to
12320 * to an n-dimensional range, with n the number of elements in the list,
12321 * where each coordinate in the range is prescribed by the
12322 * corresponding affine expression.
12323 * The domains of all affine expressions in the list are assumed to match
12326 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12327 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12331 isl_basic_map
*bmap
;
12336 dim
= isl_space_from_domain(domain_dim
);
12337 bmap
= isl_basic_map_universe(dim
);
12339 for (i
= 0; i
< list
->n
; ++i
) {
12341 isl_basic_map
*bmap_i
;
12343 aff
= isl_aff_copy(list
->p
[i
]);
12344 bmap_i
= isl_basic_map_from_aff(aff
);
12346 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12349 isl_aff_list_free(list
);
12353 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12354 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12356 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12359 /* Construct a basic map where the given dimensions are equal to each other.
12361 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12362 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12364 isl_basic_map
*bmap
= NULL
;
12370 if (pos1
>= isl_space_dim(space
, type1
))
12371 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12372 "index out of bounds", goto error
);
12373 if (pos2
>= isl_space_dim(space
, type2
))
12374 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12375 "index out of bounds", goto error
);
12377 if (type1
== type2
&& pos1
== pos2
)
12378 return isl_basic_map_universe(space
);
12380 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12381 i
= isl_basic_map_alloc_equality(bmap
);
12384 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12385 pos1
+= isl_basic_map_offset(bmap
, type1
);
12386 pos2
+= isl_basic_map_offset(bmap
, type2
);
12387 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12388 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12389 bmap
= isl_basic_map_finalize(bmap
);
12390 isl_space_free(space
);
12393 isl_space_free(space
);
12394 isl_basic_map_free(bmap
);
12398 /* Add a constraint imposing that the given two dimensions are equal.
12400 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12401 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12405 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12407 bmap
= isl_basic_map_intersect(bmap
, eq
);
12412 /* Add a constraint imposing that the given two dimensions are equal.
12414 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12415 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12417 isl_basic_map
*bmap
;
12419 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12421 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12426 /* Add a constraint imposing that the given two dimensions have opposite values.
12428 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12429 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12431 isl_basic_map
*bmap
= NULL
;
12437 if (pos1
>= isl_map_dim(map
, type1
))
12438 isl_die(map
->ctx
, isl_error_invalid
,
12439 "index out of bounds", goto error
);
12440 if (pos2
>= isl_map_dim(map
, type2
))
12441 isl_die(map
->ctx
, isl_error_invalid
,
12442 "index out of bounds", goto error
);
12444 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12445 i
= isl_basic_map_alloc_equality(bmap
);
12448 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12449 pos1
+= isl_basic_map_offset(bmap
, type1
);
12450 pos2
+= isl_basic_map_offset(bmap
, type2
);
12451 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12452 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12453 bmap
= isl_basic_map_finalize(bmap
);
12455 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12459 isl_basic_map_free(bmap
);
12464 /* Construct a constraint imposing that the value of the first dimension is
12465 * greater than or equal to that of the second.
12467 static __isl_give isl_constraint
*constraint_order_ge(
12468 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12469 enum isl_dim_type type2
, int pos2
)
12476 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12478 if (pos1
>= isl_constraint_dim(c
, type1
))
12479 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12480 "index out of bounds", return isl_constraint_free(c
));
12481 if (pos2
>= isl_constraint_dim(c
, type2
))
12482 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12483 "index out of bounds", return isl_constraint_free(c
));
12485 if (type1
== type2
&& pos1
== pos2
)
12488 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12489 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12494 /* Add a constraint imposing that the value of the first dimension is
12495 * greater than or equal to that of the second.
12497 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12498 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12503 if (type1
== type2
&& pos1
== pos2
)
12505 space
= isl_basic_map_get_space(bmap
);
12506 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12507 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12512 /* Add a constraint imposing that the value of the first dimension is
12513 * greater than or equal to that of the second.
12515 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12516 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12521 if (type1
== type2
&& pos1
== pos2
)
12523 space
= isl_map_get_space(map
);
12524 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12525 map
= isl_map_add_constraint(map
, c
);
12530 /* Add a constraint imposing that the value of the first dimension is
12531 * less than or equal to that of the second.
12533 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12534 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12536 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12539 /* Construct a basic map where the value of the first dimension is
12540 * greater than that of the second.
12542 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12543 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12545 isl_basic_map
*bmap
= NULL
;
12551 if (pos1
>= isl_space_dim(space
, type1
))
12552 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12553 "index out of bounds", goto error
);
12554 if (pos2
>= isl_space_dim(space
, type2
))
12555 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12556 "index out of bounds", goto error
);
12558 if (type1
== type2
&& pos1
== pos2
)
12559 return isl_basic_map_empty(space
);
12561 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12562 i
= isl_basic_map_alloc_inequality(bmap
);
12564 return isl_basic_map_free(bmap
);
12565 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12566 pos1
+= isl_basic_map_offset(bmap
, type1
);
12567 pos2
+= isl_basic_map_offset(bmap
, type2
);
12568 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12569 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12570 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12571 bmap
= isl_basic_map_finalize(bmap
);
12575 isl_space_free(space
);
12576 isl_basic_map_free(bmap
);
12580 /* Add a constraint imposing that the value of the first dimension is
12581 * greater than that of the second.
12583 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12584 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12588 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12590 bmap
= isl_basic_map_intersect(bmap
, gt
);
12595 /* Add a constraint imposing that the value of the first dimension is
12596 * greater than that of the second.
12598 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12599 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12601 isl_basic_map
*bmap
;
12603 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12605 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12610 /* Add a constraint imposing that the value of the first dimension is
12611 * smaller than that of the second.
12613 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12614 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12616 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12619 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12623 isl_local_space
*ls
;
12628 if (!isl_basic_map_divs_known(bmap
))
12629 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12630 "some divs are unknown", return NULL
);
12632 ls
= isl_basic_map_get_local_space(bmap
);
12633 div
= isl_local_space_get_div(ls
, pos
);
12634 isl_local_space_free(ls
);
12639 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12642 return isl_basic_map_get_div(bset
, pos
);
12645 /* Plug in "subs" for dimension "type", "pos" of "bset".
12647 * Let i be the dimension to replace and let "subs" be of the form
12651 * Any integer division with a non-zero coefficient for i,
12653 * floor((a i + g)/m)
12657 * floor((a f + d g)/(m d))
12659 * Constraints of the form
12667 * We currently require that "subs" is an integral expression.
12668 * Handling rational expressions may require us to add stride constraints
12669 * as we do in isl_basic_set_preimage_multi_aff.
12671 __isl_give isl_basic_set
*isl_basic_set_substitute(
12672 __isl_take isl_basic_set
*bset
,
12673 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12679 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12682 bset
= isl_basic_set_cow(bset
);
12683 if (!bset
|| !subs
)
12686 ctx
= isl_basic_set_get_ctx(bset
);
12687 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12688 isl_die(ctx
, isl_error_invalid
,
12689 "spaces don't match", goto error
);
12690 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12691 isl_die(ctx
, isl_error_unsupported
,
12692 "cannot handle divs yet", goto error
);
12693 if (!isl_int_is_one(subs
->v
->el
[0]))
12694 isl_die(ctx
, isl_error_invalid
,
12695 "can only substitute integer expressions", goto error
);
12697 pos
+= isl_basic_set_offset(bset
, type
);
12701 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12702 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12704 isl_int_set(v
, bset
->eq
[i
][pos
]);
12705 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12706 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12707 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12710 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12711 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12713 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12714 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12715 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12716 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12719 for (i
= 0; i
< bset
->n_div
; ++i
) {
12720 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12722 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12723 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12724 isl_seq_combine(bset
->div
[i
] + 1,
12725 subs
->v
->el
[0], bset
->div
[i
] + 1,
12726 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12727 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12732 bset
= isl_basic_set_simplify(bset
);
12733 return isl_basic_set_finalize(bset
);
12735 isl_basic_set_free(bset
);
12739 /* Plug in "subs" for dimension "type", "pos" of "set".
12741 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12742 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12746 if (set
&& isl_set_plain_is_empty(set
))
12749 set
= isl_set_cow(set
);
12753 for (i
= set
->n
- 1; i
>= 0; --i
) {
12754 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12755 if (remove_if_empty(set
, i
) < 0)
12765 /* Check if the range of "ma" is compatible with the domain or range
12766 * (depending on "type") of "bmap".
12768 static isl_stat
check_basic_map_compatible_range_multi_aff(
12769 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12770 __isl_keep isl_multi_aff
*ma
)
12773 isl_space
*ma_space
;
12775 ma_space
= isl_multi_aff_get_space(ma
);
12777 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12781 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12782 "parameters don't match", goto error
);
12783 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12787 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12788 "spaces don't match", goto error
);
12790 isl_space_free(ma_space
);
12791 return isl_stat_ok
;
12793 isl_space_free(ma_space
);
12794 return isl_stat_error
;
12797 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12798 * coefficients before the transformed range of dimensions,
12799 * the "n_after" coefficients after the transformed range of dimensions
12800 * and the coefficients of the other divs in "bmap".
12802 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12803 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12808 isl_local_space
*ls
;
12813 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12817 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12818 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12819 for (i
= 0; i
< n_div
; ++i
) {
12820 int o_bmap
= 0, o_ls
= 0;
12822 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12823 o_bmap
+= 1 + 1 + n_param
;
12824 o_ls
+= 1 + 1 + n_param
;
12825 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12826 o_bmap
+= n_before
;
12827 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12828 ls
->div
->row
[i
] + o_ls
, n_set
);
12831 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12833 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12834 ls
->div
->row
[i
] + o_ls
, n_div
);
12837 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12838 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12842 isl_local_space_free(ls
);
12845 isl_local_space_free(ls
);
12849 /* How many stride constraints does "ma" enforce?
12850 * That is, how many of the affine expressions have a denominator
12851 * different from one?
12853 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12858 for (i
= 0; i
< ma
->n
; ++i
)
12859 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12865 /* For each affine expression in ma of the form
12867 * x_i = (f_i y + h_i)/m_i
12869 * with m_i different from one, add a constraint to "bmap"
12872 * f_i y + h_i = m_i alpha_i
12874 * with alpha_i an additional existentially quantified variable.
12876 * The input variables of "ma" correspond to a subset of the variables
12877 * of "bmap". There are "n_before" variables in "bmap" before this
12878 * subset and "n_after" variables after this subset.
12879 * The integer divisions of the affine expressions in "ma" are assumed
12880 * to have been aligned. There are "n_div_ma" of them and
12881 * they appear first in "bmap", straight after the "n_after" variables.
12883 static __isl_give isl_basic_map
*add_ma_strides(
12884 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12885 int n_before
, int n_after
, int n_div_ma
)
12893 total
= isl_basic_map_total_dim(bmap
);
12894 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12895 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12896 for (i
= 0; i
< ma
->n
; ++i
) {
12897 int o_bmap
= 0, o_ma
= 1;
12899 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12901 div
= isl_basic_map_alloc_div(bmap
);
12902 k
= isl_basic_map_alloc_equality(bmap
);
12903 if (div
< 0 || k
< 0)
12905 isl_int_set_si(bmap
->div
[div
][0], 0);
12906 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12907 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12908 o_bmap
+= 1 + n_param
;
12909 o_ma
+= 1 + n_param
;
12910 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12911 o_bmap
+= n_before
;
12912 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12913 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12916 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12918 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12919 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12920 o_bmap
+= n_div_ma
;
12922 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12923 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12929 isl_basic_map_free(bmap
);
12933 /* Replace the domain or range space (depending on "type) of "space" by "set".
12935 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12936 enum isl_dim_type type
, __isl_take isl_space
*set
)
12938 if (type
== isl_dim_in
) {
12939 space
= isl_space_range(space
);
12940 space
= isl_space_map_from_domain_and_range(set
, space
);
12942 space
= isl_space_domain(space
);
12943 space
= isl_space_map_from_domain_and_range(space
, set
);
12949 /* Compute the preimage of the domain or range (depending on "type")
12950 * of "bmap" under the function represented by "ma".
12951 * In other words, plug in "ma" in the domain or range of "bmap".
12952 * The result is a basic map that lives in the same space as "bmap"
12953 * except that the domain or range has been replaced by
12954 * the domain space of "ma".
12956 * If bmap is represented by
12958 * A(p) + S u + B x + T v + C(divs) >= 0,
12960 * where u and x are input and output dimensions if type == isl_dim_out
12961 * while x and v are input and output dimensions if type == isl_dim_in,
12962 * and ma is represented by
12964 * x = D(p) + F(y) + G(divs')
12966 * then the result is
12968 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12970 * The divs in the input set are similarly adjusted.
12973 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12977 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12978 * B_i G(divs') + c_i(divs))/n_i)
12980 * If bmap is not a rational map and if F(y) involves any denominators
12982 * x_i = (f_i y + h_i)/m_i
12984 * then additional constraints are added to ensure that we only
12985 * map back integer points. That is we enforce
12987 * f_i y + h_i = m_i alpha_i
12989 * with alpha_i an additional existentially quantified variable.
12991 * We first copy over the divs from "ma".
12992 * Then we add the modified constraints and divs from "bmap".
12993 * Finally, we add the stride constraints, if needed.
12995 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12996 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12997 __isl_take isl_multi_aff
*ma
)
13001 isl_basic_map
*res
= NULL
;
13002 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
13003 isl_int f
, c1
, c2
, g
;
13012 ma
= isl_multi_aff_align_divs(ma
);
13015 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
13018 if (type
== isl_dim_in
) {
13020 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
13022 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13025 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13026 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13028 space
= isl_multi_aff_get_domain_space(ma
);
13029 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13030 rational
= isl_basic_map_is_rational(bmap
);
13031 strides
= rational
? 0 : multi_aff_strides(ma
);
13032 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13033 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13035 res
= isl_basic_map_set_rational(res
);
13037 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13038 if (isl_basic_map_alloc_div(res
) < 0)
13041 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13044 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13045 k
= isl_basic_map_alloc_equality(res
);
13048 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13049 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13052 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13053 k
= isl_basic_map_alloc_inequality(res
);
13056 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13057 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13060 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13061 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13062 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13065 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13066 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13071 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13077 isl_basic_map_free(bmap
);
13078 isl_multi_aff_free(ma
);
13079 res
= isl_basic_map_simplify(res
);
13080 return isl_basic_map_finalize(res
);
13086 isl_basic_map_free(bmap
);
13087 isl_multi_aff_free(ma
);
13088 isl_basic_map_free(res
);
13092 /* Compute the preimage of "bset" under the function represented by "ma".
13093 * In other words, plug in "ma" in "bset". The result is a basic set
13094 * that lives in the domain space of "ma".
13096 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13097 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13099 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13102 /* Compute the preimage of the domain of "bmap" under the function
13103 * represented by "ma".
13104 * In other words, plug in "ma" in the domain of "bmap".
13105 * The result is a basic map that lives in the same space as "bmap"
13106 * except that the domain has been replaced by the domain space of "ma".
13108 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13109 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13111 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13114 /* Compute the preimage of the range of "bmap" under the function
13115 * represented by "ma".
13116 * In other words, plug in "ma" in the range of "bmap".
13117 * The result is a basic map that lives in the same space as "bmap"
13118 * except that the range has been replaced by the domain space of "ma".
13120 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13121 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13123 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13126 /* Check if the range of "ma" is compatible with the domain or range
13127 * (depending on "type") of "map".
13128 * Return isl_stat_error if anything is wrong.
13130 static isl_stat
check_map_compatible_range_multi_aff(
13131 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13132 __isl_keep isl_multi_aff
*ma
)
13135 isl_space
*ma_space
;
13137 ma_space
= isl_multi_aff_get_space(ma
);
13138 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13139 isl_space_free(ma_space
);
13141 return isl_stat_error
;
13143 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13144 "spaces don't match", return isl_stat_error
);
13145 return isl_stat_ok
;
13148 /* Compute the preimage of the domain or range (depending on "type")
13149 * of "map" under the function represented by "ma".
13150 * In other words, plug in "ma" in the domain or range of "map".
13151 * The result is a map that lives in the same space as "map"
13152 * except that the domain or range has been replaced by
13153 * the domain space of "ma".
13155 * The parameters are assumed to have been aligned.
13157 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13158 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13163 map
= isl_map_cow(map
);
13164 ma
= isl_multi_aff_align_divs(ma
);
13167 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13170 for (i
= 0; i
< map
->n
; ++i
) {
13171 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13172 isl_multi_aff_copy(ma
));
13177 space
= isl_multi_aff_get_domain_space(ma
);
13178 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13180 isl_space_free(map
->dim
);
13185 isl_multi_aff_free(ma
);
13187 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13188 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13191 isl_multi_aff_free(ma
);
13196 /* Compute the preimage of the domain or range (depending on "type")
13197 * of "map" under the function represented by "ma".
13198 * In other words, plug in "ma" in the domain or range of "map".
13199 * The result is a map that lives in the same space as "map"
13200 * except that the domain or range has been replaced by
13201 * the domain space of "ma".
13203 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13204 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13211 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13215 return map_preimage_multi_aff(map
, type
, ma
);
13217 if (isl_map_check_named_params(map
) < 0)
13219 if (!isl_space_has_named_params(ma
->space
))
13220 isl_die(map
->ctx
, isl_error_invalid
,
13221 "unaligned unnamed parameters", goto error
);
13222 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13223 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13225 return map_preimage_multi_aff(map
, type
, ma
);
13227 isl_multi_aff_free(ma
);
13228 return isl_map_free(map
);
13231 /* Compute the preimage of "set" under the function represented by "ma".
13232 * In other words, plug in "ma" in "set". The result is a set
13233 * that lives in the domain space of "ma".
13235 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13236 __isl_take isl_multi_aff
*ma
)
13238 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13241 /* Compute the preimage of the domain of "map" under the function
13242 * represented by "ma".
13243 * In other words, plug in "ma" in the domain of "map".
13244 * The result is a map that lives in the same space as "map"
13245 * except that the domain has been replaced by the domain space of "ma".
13247 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13248 __isl_take isl_multi_aff
*ma
)
13250 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13253 /* Compute the preimage of the range of "map" under the function
13254 * represented by "ma".
13255 * In other words, plug in "ma" in the range of "map".
13256 * The result is a map that lives in the same space as "map"
13257 * except that the range has been replaced by the domain space of "ma".
13259 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13260 __isl_take isl_multi_aff
*ma
)
13262 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13265 /* Compute the preimage of "map" under the function represented by "pma".
13266 * In other words, plug in "pma" in the domain or range of "map".
13267 * The result is a map that lives in the same space as "map",
13268 * except that the space of type "type" has been replaced by
13269 * the domain space of "pma".
13271 * The parameters of "map" and "pma" are assumed to have been aligned.
13273 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13274 __isl_take isl_map
*map
, enum isl_dim_type type
,
13275 __isl_take isl_pw_multi_aff
*pma
)
13284 isl_pw_multi_aff_free(pma
);
13285 res
= isl_map_empty(isl_map_get_space(map
));
13290 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13291 isl_multi_aff_copy(pma
->p
[0].maff
));
13292 if (type
== isl_dim_in
)
13293 res
= isl_map_intersect_domain(res
,
13294 isl_map_copy(pma
->p
[0].set
));
13296 res
= isl_map_intersect_range(res
,
13297 isl_map_copy(pma
->p
[0].set
));
13299 for (i
= 1; i
< pma
->n
; ++i
) {
13302 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13303 isl_multi_aff_copy(pma
->p
[i
].maff
));
13304 if (type
== isl_dim_in
)
13305 res_i
= isl_map_intersect_domain(res_i
,
13306 isl_map_copy(pma
->p
[i
].set
));
13308 res_i
= isl_map_intersect_range(res_i
,
13309 isl_map_copy(pma
->p
[i
].set
));
13310 res
= isl_map_union(res
, res_i
);
13313 isl_pw_multi_aff_free(pma
);
13317 isl_pw_multi_aff_free(pma
);
13322 /* Compute the preimage of "map" under the function represented by "pma".
13323 * In other words, plug in "pma" in the domain or range of "map".
13324 * The result is a map that lives in the same space as "map",
13325 * except that the space of type "type" has been replaced by
13326 * the domain space of "pma".
13328 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13329 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13336 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13340 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13342 if (isl_map_check_named_params(map
) < 0)
13344 if (!isl_space_has_named_params(pma
->dim
))
13345 isl_die(map
->ctx
, isl_error_invalid
,
13346 "unaligned unnamed parameters", goto error
);
13347 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13348 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13350 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13352 isl_pw_multi_aff_free(pma
);
13353 return isl_map_free(map
);
13356 /* Compute the preimage of "set" under the function represented by "pma".
13357 * In other words, plug in "pma" in "set". The result is a set
13358 * that lives in the domain space of "pma".
13360 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13361 __isl_take isl_pw_multi_aff
*pma
)
13363 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13366 /* Compute the preimage of the domain of "map" under the function
13367 * represented by "pma".
13368 * In other words, plug in "pma" in the domain of "map".
13369 * The result is a map that lives in the same space as "map",
13370 * except that domain space has been replaced by the domain space of "pma".
13372 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13373 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13375 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13378 /* Compute the preimage of the range of "map" under the function
13379 * represented by "pma".
13380 * In other words, plug in "pma" in the range of "map".
13381 * The result is a map that lives in the same space as "map",
13382 * except that range space has been replaced by the domain space of "pma".
13384 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13385 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13387 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13390 /* Compute the preimage of "map" under the function represented by "mpa".
13391 * In other words, plug in "mpa" in the domain or range of "map".
13392 * The result is a map that lives in the same space as "map",
13393 * except that the space of type "type" has been replaced by
13394 * the domain space of "mpa".
13396 * If the map does not involve any constraints that refer to the
13397 * dimensions of the substituted space, then the only possible
13398 * effect of "mpa" on the map is to map the space to a different space.
13399 * We create a separate isl_multi_aff to effectuate this change
13400 * in order to avoid spurious splitting of the map along the pieces
13402 * If "mpa" has a non-trivial explicit domain, however,
13403 * then the full substitution should be performed.
13405 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13406 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13410 isl_pw_multi_aff
*pma
;
13415 n
= isl_map_dim(map
, type
);
13416 full
= isl_map_involves_dims(map
, type
, 0, n
);
13417 if (full
>= 0 && !full
)
13418 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13425 space
= isl_multi_pw_aff_get_space(mpa
);
13426 isl_multi_pw_aff_free(mpa
);
13427 ma
= isl_multi_aff_zero(space
);
13428 return isl_map_preimage_multi_aff(map
, type
, ma
);
13431 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13432 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13435 isl_multi_pw_aff_free(mpa
);
13439 /* Compute the preimage of "map" under the function represented by "mpa".
13440 * In other words, plug in "mpa" in the domain "map".
13441 * The result is a map that lives in the same space as "map",
13442 * except that domain space has been replaced by the domain space of "mpa".
13444 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13445 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13447 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13450 /* Compute the preimage of "set" by the function represented by "mpa".
13451 * In other words, plug in "mpa" in "set".
13453 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13454 __isl_take isl_multi_pw_aff
*mpa
)
13456 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13459 /* Return a copy of the equality constraints of "bset" as a matrix.
13461 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13462 __isl_keep isl_basic_set
*bset
)
13470 ctx
= isl_basic_set_get_ctx(bset
);
13471 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13472 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13475 /* Are the "n" "coefficients" starting at "first" of the integer division
13476 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13478 * The "coefficient" at position 0 is the denominator.
13479 * The "coefficient" at position 1 is the constant term.
13481 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13482 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13483 unsigned first
, unsigned n
)
13485 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13486 return isl_bool_error
;
13487 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13488 return isl_bool_error
;
13489 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13490 bmap2
->div
[pos2
] + first
, n
);
13493 /* Are the integer division expressions at position "pos1" in "bmap1" and
13494 * "pos2" in "bmap2" equal to each other, except that the constant terms
13497 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13498 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13499 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13504 if (!bmap1
|| !bmap2
)
13505 return isl_bool_error
;
13506 total
= isl_basic_map_total_dim(bmap1
);
13507 if (total
!= isl_basic_map_total_dim(bmap2
))
13508 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13509 "incomparable div expressions", return isl_bool_error
);
13510 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13512 if (equal
< 0 || !equal
)
13514 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13516 if (equal
< 0 || equal
)
13517 return isl_bool_not(equal
);
13518 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13522 /* Replace the numerator of the constant term of the integer division
13523 * expression at position "div" in "bmap" by "value".
13524 * The caller guarantees that this does not change the meaning
13527 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13528 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13530 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13531 return isl_basic_map_free(bmap
);
13533 isl_int_set_si(bmap
->div
[div
][1], value
);
13538 /* Is the point "inner" internal to inequality constraint "ineq"
13540 * The point is considered to be internal to the inequality constraint,
13541 * if it strictly lies on the positive side of the inequality constraint,
13542 * or if it lies on the constraint and the constraint is lexico-positive.
13544 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13545 __isl_keep isl_basic_set
*bset
, int ineq
)
13551 if (!inner
|| !bset
)
13552 return isl_bool_error
;
13554 ctx
= isl_basic_set_get_ctx(bset
);
13555 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13556 &ctx
->normalize_gcd
);
13557 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13558 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13560 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13561 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13562 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13565 /* Tighten the inequality constraints of "bset" that are outward with respect
13566 * to the point "vec".
13567 * That is, tighten the constraints that are not satisfied by "vec".
13569 * "vec" is a point internal to some superset S of "bset" that is used
13570 * to make the subsets of S disjoint, by tightening one half of the constraints
13571 * that separate two subsets. In particular, the constraints of S
13572 * are all satisfied by "vec" and should not be tightened.
13573 * Of the internal constraints, those that have "vec" on the outside
13574 * are tightened. The shared facet is included in the adjacent subset
13575 * with the opposite constraint.
13576 * For constraints that saturate "vec", this criterion cannot be used
13577 * to determine which of the two sides should be tightened.
13578 * Instead, the sign of the first non-zero coefficient is used
13579 * to make this choice. Note that this second criterion is never used
13580 * on the constraints of S since "vec" is interior to "S".
13582 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13583 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13587 bset
= isl_basic_set_cow(bset
);
13590 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13593 internal
= is_internal(vec
, bset
, j
);
13595 return isl_basic_set_free(bset
);
13598 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13604 /* Replace the variables x of type "type" starting at "first" in "bmap"
13605 * by x' with x = M x' with M the matrix trans.
13606 * That is, replace the corresponding coefficients c by c M.
13608 * The transformation matrix should be a square matrix.
13610 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13611 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13612 __isl_take isl_mat
*trans
)
13616 bmap
= isl_basic_map_cow(bmap
);
13617 if (!bmap
|| !trans
)
13620 if (trans
->n_row
!= trans
->n_col
)
13621 isl_die(trans
->ctx
, isl_error_invalid
,
13622 "expecting square transformation matrix", goto error
);
13623 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13624 isl_die(trans
->ctx
, isl_error_invalid
,
13625 "oversized transformation matrix", goto error
);
13627 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13629 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13630 isl_mat_copy(trans
)) < 0)
13632 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13633 isl_mat_copy(trans
)) < 0)
13635 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13636 isl_mat_copy(trans
)) < 0)
13639 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13640 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13642 isl_mat_free(trans
);
13645 isl_mat_free(trans
);
13646 isl_basic_map_free(bmap
);
13650 /* Replace the variables x of type "type" starting at "first" in "bset"
13651 * by x' with x = M x' with M the matrix trans.
13652 * That is, replace the corresponding coefficients c by c M.
13654 * The transformation matrix should be a square matrix.
13656 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13657 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13658 __isl_take isl_mat
*trans
)
13660 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);