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>
46 #include <isl/deprecated/map_int.h>
47 #include <isl/deprecated/set_int.h>
49 #include <bset_to_bmap.c>
50 #include <bset_from_bmap.c>
51 #include <set_to_map.c>
52 #include <set_from_map.c>
54 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
57 case isl_dim_param
: return dim
->nparam
;
58 case isl_dim_in
: return dim
->n_in
;
59 case isl_dim_out
: return dim
->n_out
;
60 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
65 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
68 case isl_dim_param
: return 1;
69 case isl_dim_in
: return 1 + dim
->nparam
;
70 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
75 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
76 enum isl_dim_type type
)
81 case isl_dim_cst
: return 1;
84 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
85 case isl_dim_div
: return bmap
->n_div
;
86 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
91 /* Return the space of "map".
93 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
95 return map
? map
->dim
: NULL
;
98 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
100 return map
? n(map
->dim
, type
) : 0;
103 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
105 return set
? n(set
->dim
, type
) : 0;
108 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
109 enum isl_dim_type type
)
118 case isl_dim_cst
: return 0;
119 case isl_dim_param
: return 1;
120 case isl_dim_in
: return 1 + space
->nparam
;
121 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
122 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
128 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
129 enum isl_dim_type type
)
131 return isl_basic_map_offset(bset
, type
);
134 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
136 return pos(map
->dim
, type
);
139 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
140 enum isl_dim_type type
)
142 return isl_basic_map_dim(bset
, type
);
145 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
147 return isl_basic_set_dim(bset
, isl_dim_set
);
150 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
152 return isl_basic_set_dim(bset
, isl_dim_param
);
155 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
159 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
162 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
164 return isl_set_dim(set
, isl_dim_set
);
167 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
169 return isl_set_dim(set
, isl_dim_param
);
172 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
174 return bmap
? bmap
->dim
->n_in
: 0;
177 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
179 return bmap
? bmap
->dim
->n_out
: 0;
182 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
184 return bmap
? bmap
->dim
->nparam
: 0;
187 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
189 return bmap
? bmap
->n_div
: 0;
192 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
194 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
197 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
199 return map
? map
->dim
->n_in
: 0;
202 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
204 return map
? map
->dim
->n_out
: 0;
207 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
209 return map
? map
->dim
->nparam
: 0;
212 /* Return the number of equality constraints in the description of "bmap".
213 * Return -1 on error.
215 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
222 /* Return the number of equality constraints in the description of "bset".
223 * Return -1 on error.
225 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
227 return isl_basic_map_n_equality(bset_to_bmap(bset
));
230 /* Return the number of inequality constraints in the description of "bmap".
231 * Return -1 on error.
233 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
240 /* Return the number of inequality constraints in the description of "bset".
241 * Return -1 on error.
243 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
245 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
248 /* Do "bmap1" and "bmap2" have the same parameters?
250 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
251 __isl_keep isl_basic_map
*bmap2
)
253 isl_space
*space1
, *space2
;
255 space1
= isl_basic_map_peek_space(bmap1
);
256 space2
= isl_basic_map_peek_space(bmap2
);
257 return isl_space_has_equal_params(space1
, space2
);
260 /* Do "map1" and "map2" have the same parameters?
262 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
263 __isl_keep isl_map
*map2
)
265 isl_space
*space1
, *space2
;
267 space1
= isl_map_peek_space(map1
);
268 space2
= isl_map_peek_space(map2
);
269 return isl_space_has_equal_params(space1
, space2
);
272 /* Do "map" and "set" have the same parameters?
274 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
275 __isl_keep isl_set
*set
)
277 return isl_map_has_equal_params(map
, set_to_map(set
));
280 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
281 __isl_keep isl_set
*set
)
285 return isl_bool_error
;
286 m
= isl_map_has_equal_params(map
, set_to_map(set
));
289 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
290 set
->dim
, isl_dim_set
);
293 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
294 __isl_keep isl_basic_set
*bset
)
298 return isl_bool_error
;
299 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
302 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
303 bset
->dim
, isl_dim_set
);
306 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
307 __isl_keep isl_set
*set
)
311 return isl_bool_error
;
312 m
= isl_map_has_equal_params(map
, set_to_map(set
));
315 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
316 set
->dim
, isl_dim_set
);
319 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
320 __isl_keep isl_basic_set
*bset
)
324 return isl_bool_error
;
325 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
328 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
329 bset
->dim
, isl_dim_set
);
332 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
334 return bmap
? bmap
->ctx
: NULL
;
337 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
339 return bset
? bset
->ctx
: NULL
;
342 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
344 return map
? map
->ctx
: NULL
;
347 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
349 return set
? set
->ctx
: NULL
;
352 /* Return the space of "bmap".
354 __isl_keep isl_space
*isl_basic_map_peek_space(
355 __isl_keep
const isl_basic_map
*bmap
)
357 return bmap
? bmap
->dim
: NULL
;
360 /* Return the space of "bset".
362 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
364 return isl_basic_map_peek_space(bset_to_bmap(bset
));
367 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
369 return isl_space_copy(isl_basic_map_peek_space(bmap
));
372 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
374 return isl_basic_map_get_space(bset_to_bmap(bset
));
377 /* Extract the divs in "bmap" as a matrix.
379 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
390 ctx
= isl_basic_map_get_ctx(bmap
);
391 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
392 cols
= 1 + 1 + total
+ bmap
->n_div
;
393 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
397 for (i
= 0; i
< bmap
->n_div
; ++i
)
398 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
403 /* Extract the divs in "bset" as a matrix.
405 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
407 return isl_basic_map_get_divs(bset
);
410 __isl_give isl_local_space
*isl_basic_map_get_local_space(
411 __isl_keep isl_basic_map
*bmap
)
418 div
= isl_basic_map_get_divs(bmap
);
419 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
422 __isl_give isl_local_space
*isl_basic_set_get_local_space(
423 __isl_keep isl_basic_set
*bset
)
425 return isl_basic_map_get_local_space(bset
);
428 /* For each known div d = floor(f/m), add the constraints
431 * -(f-(m-1)) + m d >= 0
433 * Do not finalize the result.
435 static __isl_give isl_basic_map
*add_known_div_constraints(
436 __isl_take isl_basic_map
*bmap
)
443 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
446 bmap
= isl_basic_map_cow(bmap
);
447 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
450 for (i
= 0; i
< n_div
; ++i
) {
451 if (isl_int_is_zero(bmap
->div
[i
][0]))
453 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
454 return isl_basic_map_free(bmap
);
460 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
461 __isl_take isl_local_space
*ls
)
470 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
471 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
472 n_div
, 0, 2 * n_div
);
474 for (i
= 0; i
< n_div
; ++i
)
475 if (isl_basic_map_alloc_div(bmap
) < 0)
478 for (i
= 0; i
< n_div
; ++i
)
479 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
480 bmap
= add_known_div_constraints(bmap
);
482 isl_local_space_free(ls
);
485 isl_local_space_free(ls
);
486 isl_basic_map_free(bmap
);
490 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
491 __isl_take isl_local_space
*ls
)
493 return isl_basic_map_from_local_space(ls
);
496 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
498 return isl_space_copy(isl_map_peek_space(map
));
501 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
505 return isl_space_copy(set
->dim
);
508 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
509 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
511 bmap
= isl_basic_map_cow(bmap
);
514 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
517 bmap
= isl_basic_map_finalize(bmap
);
520 isl_basic_map_free(bmap
);
524 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
525 __isl_take isl_basic_set
*bset
, const char *s
)
527 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
530 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
531 enum isl_dim_type type
)
533 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
536 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
537 enum isl_dim_type type
, const char *s
)
541 map
= isl_map_cow(map
);
545 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
549 for (i
= 0; i
< map
->n
; ++i
) {
550 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
561 /* Replace the identifier of the tuple of type "type" by "id".
563 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
564 __isl_take isl_basic_map
*bmap
,
565 enum isl_dim_type type
, __isl_take isl_id
*id
)
567 bmap
= isl_basic_map_cow(bmap
);
570 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
572 return isl_basic_map_free(bmap
);
573 bmap
= isl_basic_map_finalize(bmap
);
580 /* Replace the identifier of the tuple by "id".
582 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
583 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
585 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
588 /* Does the input or output tuple have a name?
590 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
592 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
595 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
596 enum isl_dim_type type
)
598 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
601 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
604 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
608 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
609 enum isl_dim_type type
, __isl_take isl_id
*id
)
611 map
= isl_map_cow(map
);
615 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
617 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
623 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
624 __isl_take isl_id
*id
)
626 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
629 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
630 enum isl_dim_type type
)
632 map
= isl_map_cow(map
);
636 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
638 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
641 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
643 return isl_map_reset_tuple_id(set
, isl_dim_set
);
646 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
648 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
651 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
652 enum isl_dim_type type
)
654 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
657 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
659 return isl_map_has_tuple_id(set
, isl_dim_set
);
662 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
664 return isl_map_get_tuple_id(set
, isl_dim_set
);
667 /* Does the set tuple have a name?
669 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
672 return isl_bool_error
;
673 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
677 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
679 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
682 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
684 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
687 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
688 enum isl_dim_type type
, unsigned pos
)
690 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
693 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
694 enum isl_dim_type type
, unsigned pos
)
696 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
699 /* Does the given dimension have a name?
701 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
702 enum isl_dim_type type
, unsigned pos
)
705 return isl_bool_error
;
706 return isl_space_has_dim_name(map
->dim
, type
, pos
);
709 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
710 enum isl_dim_type type
, unsigned pos
)
712 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
715 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
716 enum isl_dim_type type
, unsigned pos
)
718 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
721 /* Does the given dimension have a name?
723 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
724 enum isl_dim_type type
, unsigned pos
)
727 return isl_bool_error
;
728 return isl_space_has_dim_name(set
->dim
, type
, pos
);
731 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
732 __isl_take isl_basic_map
*bmap
,
733 enum isl_dim_type type
, unsigned pos
, const char *s
)
735 bmap
= isl_basic_map_cow(bmap
);
738 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
741 return isl_basic_map_finalize(bmap
);
743 isl_basic_map_free(bmap
);
747 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
748 enum isl_dim_type type
, unsigned pos
, const char *s
)
752 map
= isl_map_cow(map
);
756 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
760 for (i
= 0; i
< map
->n
; ++i
) {
761 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
772 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
773 __isl_take isl_basic_set
*bset
,
774 enum isl_dim_type type
, unsigned pos
, const char *s
)
776 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
780 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
781 enum isl_dim_type type
, unsigned pos
, const char *s
)
783 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
787 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
788 enum isl_dim_type type
, unsigned pos
)
791 return isl_bool_error
;
792 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
795 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
796 enum isl_dim_type type
, unsigned pos
)
798 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
801 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
802 enum isl_dim_type type
, unsigned pos
)
804 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
807 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
808 enum isl_dim_type type
, unsigned pos
)
810 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
813 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
814 enum isl_dim_type type
, unsigned pos
)
816 return isl_map_has_dim_id(set
, type
, pos
);
819 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
820 enum isl_dim_type type
, unsigned pos
)
822 return isl_map_get_dim_id(set
, type
, pos
);
825 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
826 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
828 map
= isl_map_cow(map
);
832 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
834 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
840 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
841 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
843 return isl_map_set_dim_id(set
, type
, pos
, id
);
846 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
847 __isl_keep isl_id
*id
)
851 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
854 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
855 __isl_keep isl_id
*id
)
857 return isl_map_find_dim_by_id(set
, type
, id
);
860 /* Return the position of the dimension of the given type and name
862 * Return -1 if no such dimension can be found.
864 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
865 enum isl_dim_type type
, const char *name
)
869 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
872 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
877 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
880 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
883 return isl_map_find_dim_by_name(set
, type
, name
);
886 /* Check whether equality i of bset is a pure stride constraint
887 * on a single dimension, i.e., of the form
891 * with k a constant and e an existentially quantified variable.
893 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
902 return isl_bool_error
;
904 if (!isl_int_is_zero(bset
->eq
[i
][0]))
905 return isl_bool_false
;
907 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
908 d
= isl_basic_set_dim(bset
, isl_dim_set
);
909 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
911 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
912 return isl_bool_false
;
913 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
915 return isl_bool_false
;
916 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
918 return isl_bool_false
;
920 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
922 return isl_bool_false
;
923 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
924 n_div
- pos2
- 1) != -1)
925 return isl_bool_false
;
926 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
927 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
928 return isl_bool_false
;
930 return isl_bool_true
;
933 /* Reset the user pointer on all identifiers of parameters and tuples
934 * of the space of "map".
936 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
940 space
= isl_map_get_space(map
);
941 space
= isl_space_reset_user(space
);
942 map
= isl_map_reset_space(map
, space
);
947 /* Reset the user pointer on all identifiers of parameters and tuples
948 * of the space of "set".
950 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
952 return isl_map_reset_user(set
);
955 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
958 return isl_bool_error
;
959 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
962 /* Has "map" been marked as a rational map?
963 * In particular, have all basic maps in "map" been marked this way?
964 * An empty map is not considered to be rational.
965 * Maps where only some of the basic maps are marked rational
968 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
974 return isl_bool_error
;
976 return isl_bool_false
;
977 rational
= isl_basic_map_is_rational(map
->p
[0]);
980 for (i
= 1; i
< map
->n
; ++i
) {
983 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
986 if (rational
!= rational_i
)
987 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
988 "mixed rational and integer basic maps "
989 "not supported", return isl_bool_error
);
995 /* Has "set" been marked as a rational set?
996 * In particular, have all basic set in "set" been marked this way?
997 * An empty set is not considered to be rational.
998 * Sets where only some of the basic sets are marked rational
1001 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1003 return isl_map_is_rational(set
);
1006 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1008 return isl_basic_map_is_rational(bset
);
1011 /* Does "bmap" contain any rational points?
1013 * If "bmap" has an equality for each dimension, equating the dimension
1014 * to an integer constant, then it has no rational points, even if it
1015 * is marked as rational.
1017 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1019 isl_bool has_rational
= isl_bool_true
;
1023 return isl_bool_error
;
1024 if (isl_basic_map_plain_is_empty(bmap
))
1025 return isl_bool_false
;
1026 if (!isl_basic_map_is_rational(bmap
))
1027 return isl_bool_false
;
1028 bmap
= isl_basic_map_copy(bmap
);
1029 bmap
= isl_basic_map_implicit_equalities(bmap
);
1031 return isl_bool_error
;
1032 total
= isl_basic_map_total_dim(bmap
);
1033 if (bmap
->n_eq
== total
) {
1035 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1036 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1039 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1040 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1042 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1047 if (i
== bmap
->n_eq
)
1048 has_rational
= isl_bool_false
;
1050 isl_basic_map_free(bmap
);
1052 return has_rational
;
1055 /* Does "map" contain any rational points?
1057 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1060 isl_bool has_rational
;
1063 return isl_bool_error
;
1064 for (i
= 0; i
< map
->n
; ++i
) {
1065 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1066 if (has_rational
< 0 || has_rational
)
1067 return has_rational
;
1069 return isl_bool_false
;
1072 /* Does "set" contain any rational points?
1074 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1076 return isl_map_has_rational(set
);
1079 /* Is this basic set a parameter domain?
1081 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1084 return isl_bool_error
;
1085 return isl_space_is_params(bset
->dim
);
1088 /* Is this set a parameter domain?
1090 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1093 return isl_bool_error
;
1094 return isl_space_is_params(set
->dim
);
1097 /* Is this map actually a parameter domain?
1098 * Users should never call this function. Outside of isl,
1099 * a map can never be a parameter domain.
1101 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1104 return isl_bool_error
;
1105 return isl_space_is_params(map
->dim
);
1108 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1109 struct isl_basic_map
*bmap
, unsigned extra
,
1110 unsigned n_eq
, unsigned n_ineq
)
1113 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1118 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1119 if (isl_blk_is_error(bmap
->block
))
1122 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1123 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1127 bmap
->block2
= isl_blk_empty();
1130 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1131 if (isl_blk_is_error(bmap
->block2
))
1134 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1139 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1140 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1142 for (i
= 0; i
< extra
; ++i
)
1143 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1147 bmap
->c_size
= n_eq
+ n_ineq
;
1148 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1149 bmap
->extra
= extra
;
1153 bmap
->sample
= NULL
;
1157 isl_basic_map_free(bmap
);
1161 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1162 unsigned nparam
, unsigned dim
, unsigned extra
,
1163 unsigned n_eq
, unsigned n_ineq
)
1165 struct isl_basic_map
*bmap
;
1168 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1172 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1173 return bset_from_bmap(bmap
);
1176 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1177 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1179 struct isl_basic_map
*bmap
;
1182 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1183 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1184 return bset_from_bmap(bmap
);
1186 isl_space_free(dim
);
1190 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1191 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1193 struct isl_basic_map
*bmap
;
1197 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1202 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1204 isl_space_free(dim
);
1208 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1209 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1210 unsigned n_eq
, unsigned n_ineq
)
1212 struct isl_basic_map
*bmap
;
1215 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1219 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1223 static void dup_constraints(
1224 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1227 unsigned total
= isl_basic_map_total_dim(src
);
1229 for (i
= 0; i
< src
->n_eq
; ++i
) {
1230 int j
= isl_basic_map_alloc_equality(dst
);
1231 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1234 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1235 int j
= isl_basic_map_alloc_inequality(dst
);
1236 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1239 for (i
= 0; i
< src
->n_div
; ++i
) {
1240 int j
= isl_basic_map_alloc_div(dst
);
1241 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1243 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1246 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1248 struct isl_basic_map
*dup
;
1252 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1253 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1256 dup_constraints(dup
, bmap
);
1257 dup
->flags
= bmap
->flags
;
1258 dup
->sample
= isl_vec_copy(bmap
->sample
);
1262 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1264 struct isl_basic_map
*dup
;
1266 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1267 return bset_from_bmap(dup
);
1270 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1275 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1279 return isl_basic_set_dup(bset
);
1282 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1291 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1296 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1300 bmap
= isl_basic_map_dup(bmap
);
1302 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1306 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1315 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1320 if (--bmap
->ref
> 0)
1323 isl_ctx_deref(bmap
->ctx
);
1325 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1327 isl_blk_free(bmap
->ctx
, bmap
->block
);
1328 isl_vec_free(bmap
->sample
);
1329 isl_space_free(bmap
->dim
);
1335 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1337 return isl_basic_map_free(bset_to_bmap(bset
));
1340 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1342 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1345 /* Check that "map" has only named parameters, reporting an error
1348 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1350 return isl_space_check_named_params(isl_map_peek_space(map
));
1353 /* Check that "bmap1" and "bmap2" have the same parameters,
1354 * reporting an error if they do not.
1356 static isl_stat
isl_basic_map_check_equal_params(
1357 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1361 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1363 return isl_stat_error
;
1365 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1366 "parameters don't match", return isl_stat_error
);
1370 __isl_give isl_map
*isl_map_align_params_map_map_and(
1371 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1372 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1373 __isl_take isl_map
*map2
))
1377 if (isl_map_has_equal_params(map1
, map2
))
1378 return fn(map1
, map2
);
1379 if (isl_map_check_named_params(map1
) < 0)
1381 if (isl_map_check_named_params(map2
) < 0)
1383 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1384 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1385 return fn(map1
, map2
);
1392 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1393 __isl_keep isl_map
*map2
,
1394 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1399 return isl_bool_error
;
1400 if (isl_map_has_equal_params(map1
, map2
))
1401 return fn(map1
, map2
);
1402 if (isl_map_check_named_params(map1
) < 0)
1403 return isl_bool_error
;
1404 if (isl_map_check_named_params(map2
) < 0)
1405 return isl_bool_error
;
1406 map1
= isl_map_copy(map1
);
1407 map2
= isl_map_copy(map2
);
1408 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1409 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1416 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1418 struct isl_ctx
*ctx
;
1422 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1423 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1426 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1427 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1428 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1429 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1430 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1432 int j
= isl_basic_map_alloc_inequality(bmap
);
1436 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1437 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1444 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1445 bmap
->extra
- bmap
->n_div
);
1446 return bmap
->n_eq
++;
1449 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1451 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1454 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1458 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1463 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1465 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1468 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1473 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1475 if (pos
!= bmap
->n_eq
- 1) {
1477 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1478 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1484 /* Turn inequality "pos" of "bmap" into an equality.
1486 * In particular, we move the inequality in front of the equalities
1487 * and move the last inequality in the position of the moved inequality.
1488 * Note that isl_tab_make_equalities_explicit depends on this particular
1489 * change in the ordering of the constraints.
1491 void isl_basic_map_inequality_to_equality(
1492 struct isl_basic_map
*bmap
, unsigned pos
)
1496 t
= bmap
->ineq
[pos
];
1497 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1498 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1504 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1505 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1506 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1509 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1511 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1514 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1516 struct isl_ctx
*ctx
;
1520 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1523 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1524 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1525 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1526 1 + isl_basic_map_total_dim(bmap
),
1527 bmap
->extra
- bmap
->n_div
);
1528 return bmap
->n_ineq
++;
1531 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1533 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1536 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1540 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1545 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1547 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1550 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1555 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1557 if (pos
!= bmap
->n_ineq
- 1) {
1558 t
= bmap
->ineq
[pos
];
1559 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1560 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1561 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1567 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1569 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1572 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1577 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1580 k
= isl_basic_map_alloc_equality(bmap
);
1583 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1586 isl_basic_map_free(bmap
);
1590 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1593 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1596 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1601 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1604 k
= isl_basic_map_alloc_inequality(bmap
);
1607 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1610 isl_basic_map_free(bmap
);
1614 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1617 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1620 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1624 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1625 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1626 1 + 1 + isl_basic_map_total_dim(bmap
),
1627 bmap
->extra
- bmap
->n_div
);
1628 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1629 return bmap
->n_div
++;
1632 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1634 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1637 /* Check that there are "n" dimensions of type "type" starting at "first"
1640 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1641 enum isl_dim_type type
, unsigned first
, unsigned n
)
1646 return isl_stat_error
;
1647 dim
= isl_basic_map_dim(bmap
, type
);
1648 if (first
+ n
> dim
|| first
+ n
< first
)
1649 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1650 "position or range out of bounds",
1651 return isl_stat_error
);
1655 /* Insert an extra integer division, prescribed by "div", to "bmap"
1656 * at (integer division) position "pos".
1658 * The integer division is first added at the end and then moved
1659 * into the right position.
1661 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1662 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1666 bmap
= isl_basic_map_cow(bmap
);
1668 return isl_basic_map_free(bmap
);
1670 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1671 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1672 "unexpected size", return isl_basic_map_free(bmap
));
1673 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1674 return isl_basic_map_free(bmap
);
1676 bmap
= isl_basic_map_extend_space(bmap
,
1677 isl_basic_map_get_space(bmap
), 1, 0, 2);
1678 k
= isl_basic_map_alloc_div(bmap
);
1680 return isl_basic_map_free(bmap
);
1681 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1682 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1684 for (i
= k
; i
> pos
; --i
)
1685 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1690 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1693 return isl_stat_error
;
1694 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1699 /* Copy constraint from src to dst, putting the vars of src at offset
1700 * dim_off in dst and the divs of src at offset div_off in dst.
1701 * If both sets are actually map, then dim_off applies to the input
1704 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1705 struct isl_basic_map
*src_map
, isl_int
*src
,
1706 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1708 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1709 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1710 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1711 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1712 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1713 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1714 isl_int_set(dst
[0], src
[0]);
1715 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1716 if (dst_nparam
> src_nparam
)
1717 isl_seq_clr(dst
+1+src_nparam
,
1718 dst_nparam
- src_nparam
);
1719 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1720 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1722 isl_min(dst_in
-in_off
, src_in
));
1723 if (dst_in
-in_off
> src_in
)
1724 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1725 dst_in
- in_off
- src_in
);
1726 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1727 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1728 src
+1+src_nparam
+src_in
,
1729 isl_min(dst_out
-out_off
, src_out
));
1730 if (dst_out
-out_off
> src_out
)
1731 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1732 dst_out
- out_off
- src_out
);
1733 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1734 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1735 src
+1+src_nparam
+src_in
+src_out
,
1736 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1737 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1738 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1739 div_off
+src_map
->n_div
,
1740 dst_map
->n_div
- div_off
- src_map
->n_div
);
1743 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1744 struct isl_basic_map
*src_map
, isl_int
*src
,
1745 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1747 isl_int_set(dst
[0], src
[0]);
1748 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1751 static __isl_give isl_basic_map
*add_constraints(
1752 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1753 unsigned i_pos
, unsigned o_pos
)
1758 if (!bmap1
|| !bmap2
)
1761 div_off
= bmap1
->n_div
;
1763 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1764 int i1
= isl_basic_map_alloc_equality(bmap1
);
1767 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1768 i_pos
, o_pos
, div_off
);
1771 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1772 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1775 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1776 i_pos
, o_pos
, div_off
);
1779 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1780 int i1
= isl_basic_map_alloc_div(bmap1
);
1783 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1784 i_pos
, o_pos
, div_off
);
1787 isl_basic_map_free(bmap2
);
1792 isl_basic_map_free(bmap1
);
1793 isl_basic_map_free(bmap2
);
1797 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1798 struct isl_basic_set
*bset2
, unsigned pos
)
1800 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1801 bset_to_bmap(bset2
), 0, pos
));
1804 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1805 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1806 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1808 struct isl_basic_map
*ext
;
1818 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1819 base
->extra
>= base
->n_div
+ extra
;
1821 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1822 room_for_ineq(base
, n_ineq
)) {
1823 isl_space_free(dim
);
1827 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1828 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1829 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1830 extra
+= base
->extra
;
1832 n_ineq
+= base
->n_ineq
;
1834 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1840 ext
->sample
= isl_vec_copy(base
->sample
);
1841 flags
= base
->flags
;
1842 ext
= add_constraints(ext
, base
, 0, 0);
1845 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1851 isl_space_free(dim
);
1852 isl_basic_map_free(base
);
1856 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1857 __isl_take isl_space
*dim
, unsigned extra
,
1858 unsigned n_eq
, unsigned n_ineq
)
1860 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1861 dim
, extra
, n_eq
, n_ineq
));
1864 struct isl_basic_map
*isl_basic_map_extend_constraints(
1865 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1869 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1873 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1874 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 struct isl_basic_map
*bmap
;
1882 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1886 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1889 isl_basic_map_free(base
);
1893 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1894 unsigned nparam
, unsigned dim
, unsigned extra
,
1895 unsigned n_eq
, unsigned n_ineq
)
1897 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1898 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1901 struct isl_basic_set
*isl_basic_set_extend_constraints(
1902 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1904 isl_basic_map
*bmap
= bset_to_bmap(base
);
1905 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1906 return bset_from_bmap(bmap
);
1909 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1911 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1914 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1919 if (bmap
->ref
> 1) {
1921 bmap
= isl_basic_map_dup(bmap
);
1924 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1925 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1930 /* Clear all cached information in "map", either because it is about
1931 * to be modified or because it is being freed.
1932 * Always return the same pointer that is passed in.
1933 * This is needed for the use in isl_map_free.
1935 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1937 isl_basic_map_free(map
->cached_simple_hull
[0]);
1938 isl_basic_map_free(map
->cached_simple_hull
[1]);
1939 map
->cached_simple_hull
[0] = NULL
;
1940 map
->cached_simple_hull
[1] = NULL
;
1944 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1946 return isl_map_cow(set
);
1949 /* Return an isl_map that is equal to "map" and that has only
1950 * a single reference.
1952 * If the original input already has only one reference, then
1953 * simply return it, but clear all cached information, since
1954 * it may be rendered invalid by the operations that will be
1955 * performed on the result.
1957 * Otherwise, create a duplicate (without any cached information).
1959 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1965 return clear_caches(map
);
1967 return isl_map_dup(map
);
1970 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1971 unsigned a_len
, unsigned b_len
)
1973 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1974 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1975 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1978 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1979 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1987 isl_assert(bmap
->ctx
,
1988 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1990 if (n1
== 0 || n2
== 0)
1993 bmap
= isl_basic_map_cow(bmap
);
1997 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1998 if (isl_blk_is_error(blk
))
2001 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2003 bmap
->eq
[i
] + pos
, n1
, n2
);
2005 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2007 bmap
->ineq
[i
] + pos
, n1
, n2
);
2009 for (i
= 0; i
< bmap
->n_div
; ++i
)
2011 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2013 isl_blk_free(bmap
->ctx
, blk
);
2015 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2016 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2017 return isl_basic_map_finalize(bmap
);
2019 isl_basic_map_free(bmap
);
2023 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2024 __isl_take isl_basic_map
*bmap
)
2030 total
= isl_basic_map_total_dim(bmap
);
2031 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2032 return isl_basic_map_free(bmap
);
2033 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2035 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2037 i
= isl_basic_map_alloc_equality(bmap
);
2041 isl_int_set_si(bmap
->eq
[i
][0], 1);
2042 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2043 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2044 isl_vec_free(bmap
->sample
);
2045 bmap
->sample
= NULL
;
2046 return isl_basic_map_finalize(bmap
);
2048 isl_basic_map_free(bmap
);
2052 struct isl_basic_set
*isl_basic_set_set_to_empty(struct 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 struct isl_basic_set
*isl_basic_set_drop_dims(
2175 struct 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 struct isl_basic_set
*isl_basic_map_underlying_set(
5304 struct 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 struct isl_basic_map
*isl_basic_map_overlying_set(
5359 struct isl_basic_set
*bset
, struct 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 struct isl_set
*isl_map_underlying_set(struct 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 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5507 __isl_take isl_space
*dim
)
5511 map
= isl_map_cow(map
);
5515 for (i
= 0; i
< map
->n
; ++i
) {
5516 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5517 isl_space_copy(dim
));
5521 isl_space_free(map
->dim
);
5527 isl_space_free(dim
);
5531 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5532 __isl_take isl_space
*dim
)
5534 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5537 /* Compute the parameter domain of the given basic set.
5539 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5545 is_params
= isl_basic_set_is_params(bset
);
5547 return isl_basic_set_free(bset
);
5551 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5552 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5553 space
= isl_basic_set_get_space(bset
);
5554 space
= isl_space_params(space
);
5555 bset
= isl_basic_set_reset_space(bset
, space
);
5559 /* Construct a zero-dimensional basic set with the given parameter domain.
5561 __isl_give isl_basic_set
*isl_basic_set_from_params(
5562 __isl_take isl_basic_set
*bset
)
5565 space
= isl_basic_set_get_space(bset
);
5566 space
= isl_space_set_from_params(space
);
5567 bset
= isl_basic_set_reset_space(bset
, space
);
5571 /* Compute the parameter domain of the given set.
5573 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5578 if (isl_set_is_params(set
))
5581 n
= isl_set_dim(set
, isl_dim_set
);
5582 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5583 space
= isl_set_get_space(set
);
5584 space
= isl_space_params(space
);
5585 set
= isl_set_reset_space(set
, space
);
5589 /* Construct a zero-dimensional set with the given parameter domain.
5591 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5594 space
= isl_set_get_space(set
);
5595 space
= isl_space_set_from_params(space
);
5596 set
= isl_set_reset_space(set
, space
);
5600 /* Compute the parameter domain of the given map.
5602 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5607 n
= isl_map_dim(map
, isl_dim_in
);
5608 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5609 n
= isl_map_dim(map
, isl_dim_out
);
5610 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5611 space
= isl_map_get_space(map
);
5612 space
= isl_space_params(space
);
5613 map
= isl_map_reset_space(map
, space
);
5617 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5624 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5626 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5627 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5629 return isl_basic_map_reset_space(bmap
, space
);
5632 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5635 return isl_bool_error
;
5636 return isl_space_may_be_set(bmap
->dim
);
5639 /* Is this basic map actually a set?
5640 * Users should never call this function. Outside of isl,
5641 * the type should indicate whether something is a set or a map.
5643 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5646 return isl_bool_error
;
5647 return isl_space_is_set(bmap
->dim
);
5650 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5654 is_set
= isl_basic_map_is_set(bmap
);
5659 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5661 isl_basic_map_free(bmap
);
5665 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5666 __isl_take isl_basic_map
*bmap
)
5670 isl_basic_map
*domain
;
5671 int nparam
, n_in
, n_out
;
5673 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5674 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5675 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5677 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5678 domain
= isl_basic_map_universe(dim
);
5680 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5681 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5682 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5684 for (i
= 0; i
< n_in
; ++i
)
5685 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5688 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5689 return isl_basic_map_finalize(bmap
);
5692 __isl_give isl_basic_map
*isl_basic_map_range_map(
5693 __isl_take isl_basic_map
*bmap
)
5697 isl_basic_map
*range
;
5698 int nparam
, n_in
, n_out
;
5700 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5701 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5702 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5704 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5705 range
= isl_basic_map_universe(dim
);
5707 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5708 bmap
= isl_basic_map_apply_range(bmap
, range
);
5709 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5711 for (i
= 0; i
< n_out
; ++i
)
5712 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5715 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5716 return isl_basic_map_finalize(bmap
);
5719 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5723 return isl_space_may_be_set(map
->dim
);
5726 /* Is this map actually a set?
5727 * Users should never call this function. Outside of isl,
5728 * the type should indicate whether something is a set or a map.
5730 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5733 return isl_bool_error
;
5734 return isl_space_is_set(map
->dim
);
5737 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5741 struct isl_set
*set
;
5743 is_set
= isl_map_is_set(map
);
5747 return set_from_map(map
);
5749 map
= isl_map_cow(map
);
5753 set
= set_from_map(map
);
5754 set
->dim
= isl_space_range(set
->dim
);
5757 for (i
= 0; i
< map
->n
; ++i
) {
5758 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5762 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5763 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5770 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5774 map
= isl_map_cow(map
);
5778 map
->dim
= isl_space_domain_map(map
->dim
);
5781 for (i
= 0; i
< map
->n
; ++i
) {
5782 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5786 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5787 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5794 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5797 isl_space
*range_dim
;
5799 map
= isl_map_cow(map
);
5803 range_dim
= isl_space_range(isl_map_get_space(map
));
5804 range_dim
= isl_space_from_range(range_dim
);
5805 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5806 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5809 for (i
= 0; i
< map
->n
; ++i
) {
5810 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5814 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5815 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5822 /* Given a wrapped map of the form A[B -> C],
5823 * return the map A[B -> C] -> B.
5825 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5832 if (!isl_set_has_tuple_id(set
))
5833 return isl_map_domain_map(isl_set_unwrap(set
));
5835 id
= isl_set_get_tuple_id(set
);
5836 map
= isl_map_domain_map(isl_set_unwrap(set
));
5837 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5842 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5843 __isl_take isl_basic_set
*bset
)
5845 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5848 __isl_give isl_basic_map
*isl_basic_map_from_range(
5849 __isl_take isl_basic_set
*bset
)
5852 space
= isl_basic_set_get_space(bset
);
5853 space
= isl_space_from_range(space
);
5854 bset
= isl_basic_set_reset_space(bset
, space
);
5855 return bset_to_bmap(bset
);
5858 /* Create a relation with the given set as range.
5859 * The domain of the created relation is a zero-dimensional
5860 * flat anonymous space.
5862 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5865 space
= isl_set_get_space(set
);
5866 space
= isl_space_from_range(space
);
5867 set
= isl_set_reset_space(set
, space
);
5868 return set_to_map(set
);
5871 /* Create a relation with the given set as domain.
5872 * The range of the created relation is a zero-dimensional
5873 * flat anonymous space.
5875 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5877 return isl_map_reverse(isl_map_from_range(set
));
5880 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5881 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5883 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5886 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5887 __isl_take isl_set
*range
)
5889 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5892 /* Return a newly allocated isl_map with given space and flags and
5893 * room for "n" basic maps.
5894 * Make sure that all cached information is cleared.
5896 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5899 struct isl_map
*map
;
5904 isl_die(space
->ctx
, isl_error_internal
,
5905 "negative number of basic maps", goto error
);
5906 map
= isl_calloc(space
->ctx
, struct isl_map
,
5907 sizeof(struct isl_map
) +
5908 (n
- 1) * sizeof(struct isl_basic_map
*));
5912 map
->ctx
= space
->ctx
;
5913 isl_ctx_ref(map
->ctx
);
5921 isl_space_free(space
);
5925 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5927 struct isl_basic_map
*bmap
;
5928 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5929 bmap
= isl_basic_map_set_to_empty(bmap
);
5933 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5935 struct isl_basic_set
*bset
;
5936 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5937 bset
= isl_basic_set_set_to_empty(bset
);
5941 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5943 struct isl_basic_map
*bmap
;
5944 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5945 bmap
= isl_basic_map_finalize(bmap
);
5949 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5951 struct isl_basic_set
*bset
;
5952 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5953 bset
= isl_basic_set_finalize(bset
);
5957 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5960 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5961 isl_basic_map
*bmap
;
5963 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5964 for (i
= 0; i
< total
; ++i
) {
5965 int k
= isl_basic_map_alloc_inequality(bmap
);
5968 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5969 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5973 isl_basic_map_free(bmap
);
5977 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5979 return isl_basic_map_nat_universe(dim
);
5982 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5984 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5987 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5989 return isl_map_nat_universe(dim
);
5992 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5994 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5997 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5999 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
6002 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
6004 struct isl_map
*map
;
6007 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
6008 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
6012 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
6014 struct isl_set
*set
;
6017 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
6018 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
6022 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6025 struct isl_map
*dup
;
6029 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6030 for (i
= 0; i
< map
->n
; ++i
)
6031 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6035 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6036 __isl_take isl_basic_map
*bmap
)
6040 if (isl_basic_map_plain_is_empty(bmap
)) {
6041 isl_basic_map_free(bmap
);
6044 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6045 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6046 map
->p
[map
->n
] = bmap
;
6048 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6054 isl_basic_map_free(bmap
);
6058 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6069 isl_ctx_deref(map
->ctx
);
6070 for (i
= 0; i
< map
->n
; ++i
)
6071 isl_basic_map_free(map
->p
[i
]);
6072 isl_space_free(map
->dim
);
6078 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6079 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6083 bmap
= isl_basic_map_cow(bmap
);
6084 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6085 j
= isl_basic_map_alloc_equality(bmap
);
6088 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6089 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6090 isl_int_set_si(bmap
->eq
[j
][0], value
);
6091 bmap
= isl_basic_map_simplify(bmap
);
6092 return isl_basic_map_finalize(bmap
);
6094 isl_basic_map_free(bmap
);
6098 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6099 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6103 bmap
= isl_basic_map_cow(bmap
);
6104 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6105 j
= isl_basic_map_alloc_equality(bmap
);
6108 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6109 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6110 isl_int_set(bmap
->eq
[j
][0], value
);
6111 bmap
= isl_basic_map_simplify(bmap
);
6112 return isl_basic_map_finalize(bmap
);
6114 isl_basic_map_free(bmap
);
6118 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6119 enum isl_dim_type type
, unsigned pos
, int value
)
6121 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6122 return isl_basic_map_free(bmap
);
6123 return isl_basic_map_fix_pos_si(bmap
,
6124 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6127 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6128 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6130 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6131 return isl_basic_map_free(bmap
);
6132 return isl_basic_map_fix_pos(bmap
,
6133 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6136 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6137 * to be equal to "v".
6139 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6140 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6144 if (!isl_val_is_int(v
))
6145 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6146 "expecting integer value", goto error
);
6147 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6149 pos
+= isl_basic_map_offset(bmap
, type
);
6150 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6154 isl_basic_map_free(bmap
);
6159 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6160 * to be equal to "v".
6162 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6163 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6165 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6168 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6169 enum isl_dim_type type
, unsigned pos
, int value
)
6171 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6175 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6176 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6178 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6182 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6183 unsigned input
, int value
)
6185 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6188 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6189 unsigned dim
, int value
)
6191 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6192 isl_dim_set
, dim
, value
));
6195 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6197 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6204 isl_basic_map_free(map
->p
[i
]);
6205 if (i
!= map
->n
- 1) {
6206 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6207 map
->p
[i
] = map
->p
[map
->n
- 1];
6214 /* Perform "fn" on each basic map of "map", where we may not be holding
6215 * the only reference to "map".
6216 * In particular, "fn" should be a semantics preserving operation
6217 * that we want to apply to all copies of "map". We therefore need
6218 * to be careful not to modify "map" in a way that breaks "map"
6219 * in case anything goes wrong.
6221 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6222 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6224 struct isl_basic_map
*bmap
;
6230 for (i
= map
->n
- 1; i
>= 0; --i
) {
6231 bmap
= isl_basic_map_copy(map
->p
[i
]);
6235 isl_basic_map_free(map
->p
[i
]);
6237 if (remove_if_empty(map
, i
) < 0)
6247 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6248 enum isl_dim_type type
, unsigned pos
, int value
)
6252 map
= isl_map_cow(map
);
6256 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6257 for (i
= map
->n
- 1; i
>= 0; --i
) {
6258 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6259 if (remove_if_empty(map
, i
) < 0)
6262 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6269 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6270 enum isl_dim_type type
, unsigned pos
, int value
)
6272 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6275 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6276 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6280 map
= isl_map_cow(map
);
6284 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6285 for (i
= 0; i
< map
->n
; ++i
) {
6286 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6290 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6297 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6298 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6300 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6303 /* Fix the value of the variable at position "pos" of type "type" of "map"
6304 * to be equal to "v".
6306 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6307 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6311 map
= isl_map_cow(map
);
6315 if (!isl_val_is_int(v
))
6316 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6317 "expecting integer value", goto error
);
6318 if (pos
>= isl_map_dim(map
, type
))
6319 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6320 "index out of bounds", goto error
);
6321 for (i
= map
->n
- 1; i
>= 0; --i
) {
6322 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6324 if (remove_if_empty(map
, i
) < 0)
6327 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6336 /* Fix the value of the variable at position "pos" of type "type" of "set"
6337 * to be equal to "v".
6339 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6340 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6342 return isl_map_fix_val(set
, type
, pos
, v
);
6345 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6346 unsigned input
, int value
)
6348 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6351 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6353 return set_from_map(isl_map_fix_si(set_to_map(set
),
6354 isl_dim_set
, dim
, value
));
6357 static __isl_give isl_basic_map
*basic_map_bound_si(
6358 __isl_take isl_basic_map
*bmap
,
6359 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6363 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6364 return isl_basic_map_free(bmap
);
6365 pos
+= isl_basic_map_offset(bmap
, type
);
6366 bmap
= isl_basic_map_cow(bmap
);
6367 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6368 j
= isl_basic_map_alloc_inequality(bmap
);
6371 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6373 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6374 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6376 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6377 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6379 bmap
= isl_basic_map_simplify(bmap
);
6380 return isl_basic_map_finalize(bmap
);
6382 isl_basic_map_free(bmap
);
6386 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6387 __isl_take isl_basic_map
*bmap
,
6388 enum isl_dim_type type
, unsigned pos
, int value
)
6390 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6393 /* Constrain the values of the given dimension to be no greater than "value".
6395 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6396 __isl_take isl_basic_map
*bmap
,
6397 enum isl_dim_type type
, unsigned pos
, int value
)
6399 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6402 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6403 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6407 map
= isl_map_cow(map
);
6411 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6412 for (i
= 0; i
< map
->n
; ++i
) {
6413 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6414 type
, pos
, value
, upper
);
6418 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6425 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6426 enum isl_dim_type type
, unsigned pos
, int value
)
6428 return map_bound_si(map
, type
, pos
, value
, 0);
6431 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6432 enum isl_dim_type type
, unsigned pos
, int value
)
6434 return map_bound_si(map
, type
, pos
, value
, 1);
6437 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6438 enum isl_dim_type type
, unsigned pos
, int value
)
6440 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6444 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6445 enum isl_dim_type type
, unsigned pos
, int value
)
6447 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6450 /* Bound the given variable of "bmap" from below (or above is "upper"
6451 * is set) to "value".
6453 static __isl_give isl_basic_map
*basic_map_bound(
6454 __isl_take isl_basic_map
*bmap
,
6455 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6459 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6460 return isl_basic_map_free(bmap
);
6461 pos
+= isl_basic_map_offset(bmap
, type
);
6462 bmap
= isl_basic_map_cow(bmap
);
6463 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6464 j
= isl_basic_map_alloc_inequality(bmap
);
6467 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6469 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6470 isl_int_set(bmap
->ineq
[j
][0], value
);
6472 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6473 isl_int_neg(bmap
->ineq
[j
][0], value
);
6475 bmap
= isl_basic_map_simplify(bmap
);
6476 return isl_basic_map_finalize(bmap
);
6478 isl_basic_map_free(bmap
);
6482 /* Bound the given variable of "map" from below (or above is "upper"
6483 * is set) to "value".
6485 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6486 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6490 map
= isl_map_cow(map
);
6494 if (pos
>= isl_map_dim(map
, type
))
6495 isl_die(map
->ctx
, isl_error_invalid
,
6496 "index out of bounds", goto error
);
6497 for (i
= map
->n
- 1; i
>= 0; --i
) {
6498 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6499 if (remove_if_empty(map
, i
) < 0)
6502 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6509 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6510 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6512 return map_bound(map
, type
, pos
, value
, 0);
6515 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6516 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6518 return map_bound(map
, type
, pos
, value
, 1);
6521 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6522 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6524 return isl_map_lower_bound(set
, type
, pos
, value
);
6527 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6528 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6530 return isl_map_upper_bound(set
, type
, pos
, value
);
6533 /* Force the values of the variable at position "pos" of type "type" of "set"
6534 * to be no smaller than "value".
6536 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6537 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6541 if (!isl_val_is_int(value
))
6542 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6543 "expecting integer value", goto error
);
6544 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6545 isl_val_free(value
);
6548 isl_val_free(value
);
6553 /* Force the values of the variable at position "pos" of type "type" of "set"
6554 * to be no greater than "value".
6556 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6557 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6561 if (!isl_val_is_int(value
))
6562 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6563 "expecting integer value", goto error
);
6564 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6565 isl_val_free(value
);
6568 isl_val_free(value
);
6573 /* Bound the given variable of "bset" from below (or above is "upper"
6574 * is set) to "value".
6576 static __isl_give isl_basic_set
*isl_basic_set_bound(
6577 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6578 isl_int value
, int upper
)
6580 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6581 type
, pos
, value
, upper
));
6584 /* Bound the given variable of "bset" from below (or above is "upper"
6585 * is set) to "value".
6587 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6588 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6589 __isl_take isl_val
*value
, int upper
)
6593 if (!isl_val_is_int(value
))
6594 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6595 "expecting integer value", goto error
);
6596 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6597 isl_val_free(value
);
6600 isl_val_free(value
);
6601 isl_basic_set_free(bset
);
6605 /* Bound the given variable of "bset" from below to "value".
6607 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6608 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6609 __isl_take isl_val
*value
)
6611 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6614 /* Bound the given variable of "bset" from above to "value".
6616 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6617 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6618 __isl_take isl_val
*value
)
6620 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6623 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6627 map
= isl_map_cow(map
);
6631 map
->dim
= isl_space_reverse(map
->dim
);
6634 for (i
= 0; i
< map
->n
; ++i
) {
6635 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6639 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6647 #define TYPE isl_pw_multi_aff
6649 #define SUFFIX _pw_multi_aff
6651 #define EMPTY isl_pw_multi_aff_empty
6653 #define ADD isl_pw_multi_aff_union_add
6654 #include "isl_map_lexopt_templ.c"
6656 /* Given a map "map", compute the lexicographically minimal
6657 * (or maximal) image element for each domain element in dom,
6658 * in the form of an isl_pw_multi_aff.
6659 * If "empty" is not NULL, then set *empty to those elements in dom that
6660 * do not have an image element.
6661 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6662 * should be computed over the domain of "map". "empty" is also NULL
6665 * We first compute the lexicographically minimal or maximal element
6666 * in the first basic map. This results in a partial solution "res"
6667 * and a subset "todo" of dom that still need to be handled.
6668 * We then consider each of the remaining maps in "map" and successively
6669 * update both "res" and "todo".
6670 * If "empty" is NULL, then the todo sets are not needed and therefore
6671 * also not computed.
6673 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6674 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6675 __isl_give isl_set
**empty
, unsigned flags
)
6679 isl_pw_multi_aff
*res
;
6682 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6683 if (!map
|| (!full
&& !dom
))
6686 if (isl_map_plain_is_empty(map
)) {
6691 return isl_pw_multi_aff_from_map(map
);
6694 res
= basic_map_partial_lexopt_pw_multi_aff(
6695 isl_basic_map_copy(map
->p
[0]),
6696 isl_set_copy(dom
), empty
, flags
);
6700 for (i
= 1; i
< map
->n
; ++i
) {
6701 isl_pw_multi_aff
*res_i
;
6703 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6704 isl_basic_map_copy(map
->p
[i
]),
6705 isl_set_copy(dom
), empty
, flags
);
6707 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6708 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6710 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6713 todo
= isl_set_intersect(todo
, *empty
);
6732 #define TYPE isl_map
6736 #define EMPTY isl_map_empty
6738 #define ADD isl_map_union_disjoint
6739 #include "isl_map_lexopt_templ.c"
6741 /* Given a map "map", compute the lexicographically minimal
6742 * (or maximal) image element for each domain element in "dom",
6743 * in the form of an isl_map.
6744 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6745 * do not have an image element.
6746 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6747 * should be computed over the domain of "map". "empty" is also NULL
6750 * If the input consists of more than one disjunct, then first
6751 * compute the desired result in the form of an isl_pw_multi_aff and
6752 * then convert that into an isl_map.
6754 * This function used to have an explicit implementation in terms
6755 * of isl_maps, but it would continually intersect the domains of
6756 * partial results with the complement of the domain of the next
6757 * partial solution, potentially leading to an explosion in the number
6758 * of disjuncts if there are several disjuncts in the input.
6759 * An even earlier implementation of this function would look for
6760 * better results in the domain of the partial result and for extra
6761 * results in the complement of this domain, which would lead to
6762 * even more splintering.
6764 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6765 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6766 __isl_give isl_set
**empty
, unsigned flags
)
6769 struct isl_map
*res
;
6770 isl_pw_multi_aff
*pma
;
6772 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6773 if (!map
|| (!full
&& !dom
))
6776 if (isl_map_plain_is_empty(map
)) {
6785 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6791 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6793 return isl_map_from_pw_multi_aff(pma
);
6802 __isl_give isl_map
*isl_map_partial_lexmax(
6803 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6804 __isl_give isl_set
**empty
)
6806 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6809 __isl_give isl_map
*isl_map_partial_lexmin(
6810 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6811 __isl_give isl_set
**empty
)
6813 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6816 __isl_give isl_set
*isl_set_partial_lexmin(
6817 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6818 __isl_give isl_set
**empty
)
6820 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6824 __isl_give isl_set
*isl_set_partial_lexmax(
6825 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6826 __isl_give isl_set
**empty
)
6828 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6832 /* Compute the lexicographic minimum (or maximum if "flags" includes
6833 * ISL_OPT_MAX) of "bset" over its parametric domain.
6835 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6838 return isl_basic_map_lexopt(bset
, flags
);
6841 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6843 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6846 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6848 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6851 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6853 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6856 /* Compute the lexicographic minimum of "bset" over its parametric domain
6857 * for the purpose of quantifier elimination.
6858 * That is, find an explicit representation for all the existentially
6859 * quantified variables in "bset" by computing their lexicographic
6862 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6863 __isl_take isl_basic_set
*bset
)
6865 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6868 /* Extract the first and only affine expression from list
6869 * and then add it to *pwaff with the given dom.
6870 * This domain is known to be disjoint from other domains
6871 * because of the way isl_basic_map_foreach_lexmax works.
6873 static isl_stat
update_dim_opt(__isl_take isl_basic_set
*dom
,
6874 __isl_take isl_aff_list
*list
, void *user
)
6876 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6878 isl_pw_aff
**pwaff
= user
;
6879 isl_pw_aff
*pwaff_i
;
6883 if (isl_aff_list_n_aff(list
) != 1)
6884 isl_die(ctx
, isl_error_internal
,
6885 "expecting single element list", goto error
);
6887 aff
= isl_aff_list_get_aff(list
, 0);
6888 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6890 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6892 isl_aff_list_free(list
);
6896 isl_basic_set_free(dom
);
6897 isl_aff_list_free(list
);
6898 return isl_stat_error
;
6901 /* Given a basic map with one output dimension, compute the minimum or
6902 * maximum of that dimension as an isl_pw_aff.
6904 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6905 * call update_dim_opt on each leaf of the result.
6907 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6910 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6914 dim
= isl_space_from_domain(isl_space_domain(dim
));
6915 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6916 pwaff
= isl_pw_aff_empty(dim
);
6918 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6920 return isl_pw_aff_free(pwaff
);
6925 /* Compute the minimum or maximum of the given output dimension
6926 * as a function of the parameters and the input dimensions,
6927 * but independently of the other output dimensions.
6929 * We first project out the other output dimension and then compute
6930 * the "lexicographic" maximum in each basic map, combining the results
6931 * using isl_pw_aff_union_max.
6933 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6940 n_out
= isl_map_dim(map
, isl_dim_out
);
6941 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6942 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6947 isl_space
*dim
= isl_map_get_space(map
);
6949 return isl_pw_aff_empty(dim
);
6952 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6953 for (i
= 1; i
< map
->n
; ++i
) {
6954 isl_pw_aff
*pwaff_i
;
6956 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6957 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6965 /* Compute the minimum of the given output dimension as a function of the
6966 * parameters and input dimensions, but independently of
6967 * the other output dimensions.
6969 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6971 return map_dim_opt(map
, pos
, 0);
6974 /* Compute the maximum of the given output dimension as a function of the
6975 * parameters and input dimensions, but independently of
6976 * the other output dimensions.
6978 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6980 return map_dim_opt(map
, pos
, 1);
6983 /* Compute the minimum or maximum of the given set dimension
6984 * as a function of the parameters,
6985 * but independently of the other set dimensions.
6987 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6990 return map_dim_opt(set
, pos
, max
);
6993 /* Compute the maximum of the given set dimension as a function of the
6994 * parameters, but independently of the other set dimensions.
6996 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6998 return set_dim_opt(set
, pos
, 1);
7001 /* Compute the minimum of the given set dimension as a function of the
7002 * parameters, but independently of the other set dimensions.
7004 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7006 return set_dim_opt(set
, pos
, 0);
7009 /* Apply a preimage specified by "mat" on the parameters of "bset".
7010 * bset is assumed to have only parameters and divs.
7012 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7013 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7020 bset
->dim
= isl_space_cow(bset
->dim
);
7024 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7026 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7028 bset
->dim
->nparam
= 0;
7029 bset
->dim
->n_out
= nparam
;
7030 bset
= isl_basic_set_preimage(bset
, mat
);
7032 bset
->dim
->nparam
= bset
->dim
->n_out
;
7033 bset
->dim
->n_out
= 0;
7038 isl_basic_set_free(bset
);
7042 /* Apply a preimage specified by "mat" on the parameters of "set".
7043 * set is assumed to have only parameters and divs.
7045 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7046 __isl_take isl_mat
*mat
)
7054 nparam
= isl_set_dim(set
, isl_dim_param
);
7056 if (mat
->n_row
!= 1 + nparam
)
7057 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7058 "unexpected number of rows", goto error
);
7060 space
= isl_set_get_space(set
);
7061 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7062 isl_dim_param
, 0, nparam
);
7063 set
= isl_set_reset_space(set
, space
);
7064 set
= isl_set_preimage(set
, mat
);
7065 nparam
= isl_set_dim(set
, isl_dim_out
);
7066 space
= isl_set_get_space(set
);
7067 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7068 isl_dim_out
, 0, nparam
);
7069 set
= isl_set_reset_space(set
, space
);
7077 /* Intersect the basic set "bset" with the affine space specified by the
7078 * equalities in "eq".
7080 static __isl_give isl_basic_set
*basic_set_append_equalities(
7081 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7089 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7094 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7095 for (i
= 0; i
< eq
->n_row
; ++i
) {
7096 k
= isl_basic_set_alloc_equality(bset
);
7099 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7100 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7104 bset
= isl_basic_set_gauss(bset
, NULL
);
7105 bset
= isl_basic_set_finalize(bset
);
7110 isl_basic_set_free(bset
);
7114 /* Intersect the set "set" with the affine space specified by the
7115 * equalities in "eq".
7117 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7125 for (i
= 0; i
< set
->n
; ++i
) {
7126 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7139 /* Given a basic set "bset" that only involves parameters and existentially
7140 * quantified variables, return the index of the first equality
7141 * that only involves parameters. If there is no such equality then
7142 * return bset->n_eq.
7144 * This function assumes that isl_basic_set_gauss has been called on "bset".
7146 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7149 unsigned nparam
, n_div
;
7154 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7155 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7157 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7158 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7165 /* Compute an explicit representation for the existentially quantified
7166 * variables in "bset" by computing the "minimal value" of the set
7167 * variables. Since there are no set variables, the computation of
7168 * the minimal value essentially computes an explicit representation
7169 * of the non-empty part(s) of "bset".
7171 * The input only involves parameters and existentially quantified variables.
7172 * All equalities among parameters have been removed.
7174 * Since the existentially quantified variables in the result are in general
7175 * going to be different from those in the input, we first replace
7176 * them by the minimal number of variables based on their equalities.
7177 * This should simplify the parametric integer programming.
7179 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7181 isl_morph
*morph1
, *morph2
;
7187 if (bset
->n_eq
== 0)
7188 return isl_basic_set_lexmin_compute_divs(bset
);
7190 morph1
= isl_basic_set_parameter_compression(bset
);
7191 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7192 bset
= isl_basic_set_lift(bset
);
7193 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7194 bset
= isl_morph_basic_set(morph2
, bset
);
7195 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7196 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7198 set
= isl_basic_set_lexmin_compute_divs(bset
);
7200 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7205 /* Project the given basic set onto its parameter domain, possibly introducing
7206 * new, explicit, existential variables in the constraints.
7207 * The input has parameters and (possibly implicit) existential variables.
7208 * The output has the same parameters, but only
7209 * explicit existentially quantified variables.
7211 * The actual projection is performed by pip, but pip doesn't seem
7212 * to like equalities very much, so we first remove the equalities
7213 * among the parameters by performing a variable compression on
7214 * the parameters. Afterward, an inverse transformation is performed
7215 * and the equalities among the parameters are inserted back in.
7217 * The variable compression on the parameters may uncover additional
7218 * equalities that were only implicit before. We therefore check
7219 * if there are any new parameter equalities in the result and
7220 * if so recurse. The removal of parameter equalities is required
7221 * for the parameter compression performed by base_compute_divs.
7223 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7227 struct isl_mat
*T
, *T2
;
7228 struct isl_set
*set
;
7231 bset
= isl_basic_set_cow(bset
);
7235 if (bset
->n_eq
== 0)
7236 return base_compute_divs(bset
);
7238 bset
= isl_basic_set_gauss(bset
, NULL
);
7241 if (isl_basic_set_plain_is_empty(bset
))
7242 return isl_set_from_basic_set(bset
);
7244 i
= first_parameter_equality(bset
);
7245 if (i
== bset
->n_eq
)
7246 return base_compute_divs(bset
);
7248 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7249 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7251 eq
= isl_mat_cow(eq
);
7252 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7253 if (T
&& T
->n_col
== 0) {
7257 bset
= isl_basic_set_set_to_empty(bset
);
7258 return isl_set_from_basic_set(bset
);
7260 bset
= basic_set_parameter_preimage(bset
, T
);
7262 i
= first_parameter_equality(bset
);
7265 else if (i
== bset
->n_eq
)
7266 set
= base_compute_divs(bset
);
7268 set
= parameter_compute_divs(bset
);
7269 set
= set_parameter_preimage(set
, T2
);
7270 set
= set_append_equalities(set
, eq
);
7274 /* Insert the divs from "ls" before those of "bmap".
7276 * The number of columns is not changed, which means that the last
7277 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7278 * The caller is responsible for removing the same number of dimensions
7279 * from the space of "bmap".
7281 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7282 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7288 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7292 old_n_div
= bmap
->n_div
;
7293 bmap
= insert_div_rows(bmap
, n_div
);
7297 for (i
= 0; i
< n_div
; ++i
) {
7298 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7299 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7305 /* Replace the space of "bmap" by the space and divs of "ls".
7307 * If "ls" has any divs, then we simplify the result since we may
7308 * have discovered some additional equalities that could simplify
7309 * the div expressions.
7311 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7312 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7316 bmap
= isl_basic_map_cow(bmap
);
7320 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7321 bmap
= insert_divs_from_local_space(bmap
, ls
);
7325 isl_space_free(bmap
->dim
);
7326 bmap
->dim
= isl_local_space_get_space(ls
);
7330 isl_local_space_free(ls
);
7332 bmap
= isl_basic_map_simplify(bmap
);
7333 bmap
= isl_basic_map_finalize(bmap
);
7336 isl_basic_map_free(bmap
);
7337 isl_local_space_free(ls
);
7341 /* Replace the space of "map" by the space and divs of "ls".
7343 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7344 __isl_take isl_local_space
*ls
)
7348 map
= isl_map_cow(map
);
7352 for (i
= 0; i
< map
->n
; ++i
) {
7353 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7354 isl_local_space_copy(ls
));
7358 isl_space_free(map
->dim
);
7359 map
->dim
= isl_local_space_get_space(ls
);
7363 isl_local_space_free(ls
);
7366 isl_local_space_free(ls
);
7371 /* Compute an explicit representation for the existentially
7372 * quantified variables for which do not know any explicit representation yet.
7374 * We first sort the existentially quantified variables so that the
7375 * existentially quantified variables for which we already have an explicit
7376 * representation are placed before those for which we do not.
7377 * The input dimensions, the output dimensions and the existentially
7378 * quantified variables for which we already have an explicit
7379 * representation are then turned into parameters.
7380 * compute_divs returns a map with the same parameters and
7381 * no input or output dimensions and the dimension specification
7382 * is reset to that of the input, including the existentially quantified
7383 * variables for which we already had an explicit representation.
7385 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7387 struct isl_basic_set
*bset
;
7388 struct isl_set
*set
;
7389 struct isl_map
*map
;
7391 isl_local_space
*ls
;
7398 bmap
= isl_basic_map_sort_divs(bmap
);
7399 bmap
= isl_basic_map_cow(bmap
);
7403 n_known
= isl_basic_map_first_unknown_div(bmap
);
7405 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7407 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7408 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7409 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7410 dim
= isl_space_set_alloc(bmap
->ctx
,
7411 nparam
+ n_in
+ n_out
+ n_known
, 0);
7415 ls
= isl_basic_map_get_local_space(bmap
);
7416 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7417 n_known
, bmap
->n_div
- n_known
);
7419 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7420 swap_div(bmap
, i
- n_known
, i
);
7421 bmap
->n_div
-= n_known
;
7422 bmap
->extra
-= n_known
;
7424 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7425 bset
= bset_from_bmap(bmap
);
7427 set
= parameter_compute_divs(bset
);
7428 map
= set_to_map(set
);
7429 map
= replace_space_by_local_space(map
, ls
);
7433 isl_basic_map_free(bmap
);
7437 /* Remove the explicit representation of local variable "div",
7440 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7441 __isl_take isl_basic_map
*bmap
, int div
)
7445 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7447 return isl_basic_map_free(bmap
);
7451 bmap
= isl_basic_map_cow(bmap
);
7454 isl_int_set_si(bmap
->div
[div
][0], 0);
7458 /* Is local variable "div" of "bmap" marked as not having an explicit
7460 * Note that even if "div" is not marked in this way and therefore
7461 * has an explicit representation, this representation may still
7462 * depend (indirectly) on other local variables that do not
7463 * have an explicit representation.
7465 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7468 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7469 return isl_bool_error
;
7470 return isl_int_is_zero(bmap
->div
[div
][0]);
7473 /* Return the position of the first local variable that does not
7474 * have an explicit representation.
7475 * Return the total number of local variables if they all have
7476 * an explicit representation.
7477 * Return -1 on error.
7479 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7486 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7487 if (!isl_basic_map_div_is_known(bmap
, i
))
7493 /* Return the position of the first local variable that does not
7494 * have an explicit representation.
7495 * Return the total number of local variables if they all have
7496 * an explicit representation.
7497 * Return -1 on error.
7499 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7501 return isl_basic_map_first_unknown_div(bset
);
7504 /* Does "bmap" have an explicit representation for all local variables?
7506 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7510 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7511 first
= isl_basic_map_first_unknown_div(bmap
);
7513 return isl_bool_error
;
7517 /* Do all basic maps in "map" have an explicit representation
7518 * for all local variables?
7520 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7525 return isl_bool_error
;
7527 for (i
= 0; i
< map
->n
; ++i
) {
7528 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7533 return isl_bool_true
;
7536 /* If bmap contains any unknown divs, then compute explicit
7537 * expressions for them. However, this computation may be
7538 * quite expensive, so first try to remove divs that aren't
7541 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7544 struct isl_map
*map
;
7546 known
= isl_basic_map_divs_known(bmap
);
7550 return isl_map_from_basic_map(bmap
);
7552 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7554 known
= isl_basic_map_divs_known(bmap
);
7558 return isl_map_from_basic_map(bmap
);
7560 map
= compute_divs(bmap
);
7563 isl_basic_map_free(bmap
);
7567 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7571 struct isl_map
*res
;
7578 known
= isl_map_divs_known(map
);
7586 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7587 for (i
= 1 ; i
< map
->n
; ++i
) {
7589 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7590 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7591 res
= isl_map_union_disjoint(res
, r2
);
7593 res
= isl_map_union(res
, r2
);
7600 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7602 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7605 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7607 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7610 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7613 struct isl_set
*set
;
7618 map
= isl_map_cow(map
);
7622 set
= set_from_map(map
);
7623 set
->dim
= isl_space_domain(set
->dim
);
7626 for (i
= 0; i
< map
->n
; ++i
) {
7627 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7631 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7632 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7639 /* Return the union of "map1" and "map2", where we assume for now that
7640 * "map1" and "map2" are disjoint. Note that the basic maps inside
7641 * "map1" or "map2" may not be disjoint from each other.
7642 * Also note that this function is also called from isl_map_union,
7643 * which takes care of handling the situation where "map1" and "map2"
7644 * may not be disjoint.
7646 * If one of the inputs is empty, we can simply return the other input.
7647 * Similarly, if one of the inputs is universal, then it is equal to the union.
7649 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7650 __isl_take isl_map
*map2
)
7654 struct isl_map
*map
= NULL
;
7660 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7661 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7662 "spaces don't match", goto error
);
7673 is_universe
= isl_map_plain_is_universe(map1
);
7674 if (is_universe
< 0)
7681 is_universe
= isl_map_plain_is_universe(map2
);
7682 if (is_universe
< 0)
7689 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7690 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7691 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7693 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7694 map1
->n
+ map2
->n
, flags
);
7697 for (i
= 0; i
< map1
->n
; ++i
) {
7698 map
= isl_map_add_basic_map(map
,
7699 isl_basic_map_copy(map1
->p
[i
]));
7703 for (i
= 0; i
< map2
->n
; ++i
) {
7704 map
= isl_map_add_basic_map(map
,
7705 isl_basic_map_copy(map2
->p
[i
]));
7719 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7720 * guaranteed to be disjoint by the caller.
7722 * Note that this functions is called from within isl_map_make_disjoint,
7723 * so we have to be careful not to touch the constraints of the inputs
7726 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7727 __isl_take isl_map
*map2
)
7729 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7732 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7733 * not be disjoint. The parameters are assumed to have been aligned.
7735 * We currently simply call map_union_disjoint, the internal operation
7736 * of which does not really depend on the inputs being disjoint.
7737 * If the result contains more than one basic map, then we clear
7738 * the disjoint flag since the result may contain basic maps from
7739 * both inputs and these are not guaranteed to be disjoint.
7741 * As a special case, if "map1" and "map2" are obviously equal,
7742 * then we simply return "map1".
7744 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7745 __isl_take isl_map
*map2
)
7752 equal
= isl_map_plain_is_equal(map1
, map2
);
7760 map1
= map_union_disjoint(map1
, map2
);
7764 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7772 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7775 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7776 __isl_take isl_map
*map2
)
7778 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7781 struct isl_set
*isl_set_union_disjoint(
7782 struct isl_set
*set1
, struct isl_set
*set2
)
7784 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7788 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7790 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7793 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7796 * "map" and "set" are assumed to be compatible and non-NULL.
7798 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7799 __isl_take isl_set
*set
,
7800 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7801 __isl_take isl_basic_set
*bset
))
7804 struct isl_map
*result
;
7807 if (isl_set_plain_is_universe(set
)) {
7812 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7813 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7814 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7816 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7817 map
->n
* set
->n
, flags
);
7818 for (i
= 0; result
&& i
< map
->n
; ++i
)
7819 for (j
= 0; j
< set
->n
; ++j
) {
7820 result
= isl_map_add_basic_map(result
,
7821 fn(isl_basic_map_copy(map
->p
[i
]),
7822 isl_basic_set_copy(set
->p
[j
])));
7832 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7833 __isl_take isl_set
*set
)
7837 ok
= isl_map_compatible_range(map
, set
);
7841 isl_die(set
->ctx
, isl_error_invalid
,
7842 "incompatible spaces", goto error
);
7844 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7851 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7852 __isl_take isl_set
*set
)
7854 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7857 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7858 __isl_take isl_set
*set
)
7862 ok
= isl_map_compatible_domain(map
, set
);
7866 isl_die(set
->ctx
, isl_error_invalid
,
7867 "incompatible spaces", goto error
);
7869 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7876 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7877 __isl_take isl_set
*set
)
7879 return isl_map_align_params_map_map_and(map
, set
,
7880 &map_intersect_domain
);
7883 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7884 * in the space B -> C, return the intersection.
7885 * The parameters are assumed to have been aligned.
7887 * The map "factor" is first extended to a map living in the space
7888 * [A -> B] -> C and then a regular intersection is computed.
7890 static __isl_give isl_map
*map_intersect_domain_factor_range(
7891 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7894 isl_map
*ext_factor
;
7896 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7897 ext_factor
= isl_map_universe(space
);
7898 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7899 return map_intersect(map
, ext_factor
);
7902 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7903 * in the space B -> C, return the intersection.
7905 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7906 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7908 return isl_map_align_params_map_map_and(map
, factor
,
7909 &map_intersect_domain_factor_range
);
7912 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7913 __isl_take isl_map
*map2
)
7917 map1
= isl_map_reverse(map1
);
7918 map1
= isl_map_apply_range(map1
, map2
);
7919 return isl_map_reverse(map1
);
7926 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7927 __isl_take isl_map
*map2
)
7929 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7932 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7933 __isl_take isl_map
*map2
)
7935 isl_space
*dim_result
;
7936 struct isl_map
*result
;
7942 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7943 isl_space_copy(map2
->dim
));
7945 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7948 for (i
= 0; i
< map1
->n
; ++i
)
7949 for (j
= 0; j
< map2
->n
; ++j
) {
7950 result
= isl_map_add_basic_map(result
,
7951 isl_basic_map_apply_range(
7952 isl_basic_map_copy(map1
->p
[i
]),
7953 isl_basic_map_copy(map2
->p
[j
])));
7959 if (result
&& result
->n
<= 1)
7960 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7968 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7969 __isl_take isl_map
*map2
)
7971 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7975 * returns range - domain
7977 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
7979 isl_space
*target_space
;
7980 struct isl_basic_set
*bset
;
7987 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7988 bmap
->dim
, isl_dim_out
),
7990 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7991 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
7992 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7993 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7994 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7995 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7996 for (i
= 0; i
< dim
; ++i
) {
7997 int j
= isl_basic_map_alloc_equality(bmap
);
7999 bmap
= isl_basic_map_free(bmap
);
8002 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8003 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8004 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8005 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8007 bset
= isl_basic_map_domain(bmap
);
8008 bset
= isl_basic_set_reset_space(bset
, target_space
);
8011 isl_basic_map_free(bmap
);
8016 * returns range - domain
8018 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8022 struct isl_set
*result
;
8027 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8028 map
->dim
, isl_dim_out
),
8030 dim
= isl_map_get_space(map
);
8031 dim
= isl_space_domain(dim
);
8032 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8035 for (i
= 0; i
< map
->n
; ++i
)
8036 result
= isl_set_add_basic_set(result
,
8037 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8046 * returns [domain -> range] -> range - domain
8048 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8049 __isl_take isl_basic_map
*bmap
)
8053 isl_basic_map
*domain
;
8057 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8058 bmap
->dim
, isl_dim_out
))
8059 isl_die(bmap
->ctx
, isl_error_invalid
,
8060 "domain and range don't match", goto error
);
8062 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8063 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8065 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8066 domain
= isl_basic_map_universe(dim
);
8068 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8069 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8070 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8072 total
= isl_basic_map_total_dim(bmap
);
8074 for (i
= 0; i
< n
; ++i
) {
8075 k
= isl_basic_map_alloc_equality(bmap
);
8078 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8079 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8080 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8081 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8084 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8085 return isl_basic_map_finalize(bmap
);
8087 isl_basic_map_free(bmap
);
8092 * returns [domain -> range] -> range - domain
8094 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8097 isl_space
*domain_dim
;
8102 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8103 map
->dim
, isl_dim_out
))
8104 isl_die(map
->ctx
, isl_error_invalid
,
8105 "domain and range don't match", goto error
);
8107 map
= isl_map_cow(map
);
8111 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8112 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8113 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8116 for (i
= 0; i
< map
->n
; ++i
) {
8117 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8121 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8128 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8130 struct isl_basic_map
*bmap
;
8138 nparam
= dims
->nparam
;
8140 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8144 for (i
= 0; i
< dim
; ++i
) {
8145 int j
= isl_basic_map_alloc_equality(bmap
);
8148 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8149 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8150 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8152 return isl_basic_map_finalize(bmap
);
8154 isl_basic_map_free(bmap
);
8158 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8162 if (dim
->n_in
!= dim
->n_out
)
8163 isl_die(dim
->ctx
, isl_error_invalid
,
8164 "number of input and output dimensions needs to be "
8165 "the same", goto error
);
8166 return basic_map_identity(dim
);
8168 isl_space_free(dim
);
8172 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8174 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8177 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8179 isl_space
*dim
= isl_set_get_space(set
);
8181 id
= isl_map_identity(isl_space_map_from_set(dim
));
8182 return isl_map_intersect_range(id
, set
);
8185 /* Construct a basic set with all set dimensions having only non-negative
8188 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8189 __isl_take isl_space
*space
)
8194 struct isl_basic_set
*bset
;
8198 nparam
= space
->nparam
;
8200 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8203 for (i
= 0; i
< dim
; ++i
) {
8204 int k
= isl_basic_set_alloc_inequality(bset
);
8207 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8208 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8212 isl_basic_set_free(bset
);
8216 /* Construct the half-space x_pos >= 0.
8218 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8222 isl_basic_set
*nonneg
;
8224 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8225 k
= isl_basic_set_alloc_inequality(nonneg
);
8228 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8229 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8231 return isl_basic_set_finalize(nonneg
);
8233 isl_basic_set_free(nonneg
);
8237 /* Construct the half-space x_pos <= -1.
8239 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8244 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8245 k
= isl_basic_set_alloc_inequality(neg
);
8248 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8249 isl_int_set_si(neg
->ineq
[k
][0], -1);
8250 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8252 return isl_basic_set_finalize(neg
);
8254 isl_basic_set_free(neg
);
8258 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8259 enum isl_dim_type type
, unsigned first
, unsigned n
)
8263 isl_basic_set
*nonneg
;
8271 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8273 offset
= pos(set
->dim
, type
);
8274 for (i
= 0; i
< n
; ++i
) {
8275 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8276 offset
+ first
+ i
);
8277 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8279 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8288 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8290 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8296 return isl_stat_error
;
8297 if (isl_set_plain_is_empty(set
)) {
8302 return fn(set
, signs
, user
);
8305 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8307 half
= isl_set_intersect(half
, isl_set_copy(set
));
8308 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8312 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8314 half
= isl_set_intersect(half
, set
);
8315 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8318 return isl_stat_error
;
8321 /* Call "fn" on the intersections of "set" with each of the orthants
8322 * (except for obviously empty intersections). The orthant is identified
8323 * by the signs array, with each entry having value 1 or -1 according
8324 * to the sign of the corresponding variable.
8326 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8327 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8336 return isl_stat_error
;
8337 if (isl_set_plain_is_empty(set
))
8340 nparam
= isl_set_dim(set
, isl_dim_param
);
8341 nvar
= isl_set_dim(set
, isl_dim_set
);
8343 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8345 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8353 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8355 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8358 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8359 __isl_keep isl_basic_map
*bmap2
)
8362 struct isl_map
*map1
;
8363 struct isl_map
*map2
;
8365 if (!bmap1
|| !bmap2
)
8366 return isl_bool_error
;
8368 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8369 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8371 is_subset
= isl_map_is_subset(map1
, map2
);
8379 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8380 __isl_keep isl_basic_set
*bset2
)
8382 return isl_basic_map_is_subset(bset1
, bset2
);
8385 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8386 __isl_keep isl_basic_map
*bmap2
)
8390 if (!bmap1
|| !bmap2
)
8391 return isl_bool_error
;
8392 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8393 if (is_subset
!= isl_bool_true
)
8395 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8399 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8400 __isl_keep isl_basic_set
*bset2
)
8402 return isl_basic_map_is_equal(
8403 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8406 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8412 return isl_bool_error
;
8413 for (i
= 0; i
< map
->n
; ++i
) {
8414 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8416 return isl_bool_error
;
8418 return isl_bool_false
;
8420 return isl_bool_true
;
8423 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8425 return map
? map
->n
== 0 : isl_bool_error
;
8428 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8430 return set
? set
->n
== 0 : isl_bool_error
;
8433 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8435 return isl_map_is_empty(set_to_map(set
));
8438 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8439 __isl_keep isl_map
*map2
)
8442 return isl_bool_error
;
8444 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8447 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8448 __isl_keep isl_set
*set2
)
8451 return isl_bool_error
;
8453 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8456 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8461 return isl_bool_error
;
8462 is_subset
= isl_map_is_subset(map1
, map2
);
8463 if (is_subset
!= isl_bool_true
)
8465 is_subset
= isl_map_is_subset(map2
, map1
);
8469 /* Is "map1" equal to "map2"?
8471 * First check if they are obviously equal.
8472 * If not, then perform a more detailed analysis.
8474 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8478 equal
= isl_map_plain_is_equal(map1
, map2
);
8479 if (equal
< 0 || equal
)
8481 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8484 isl_bool
isl_basic_map_is_strict_subset(
8485 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8489 if (!bmap1
|| !bmap2
)
8490 return isl_bool_error
;
8491 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8492 if (is_subset
!= isl_bool_true
)
8494 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8495 if (is_subset
== isl_bool_error
)
8500 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8501 __isl_keep isl_map
*map2
)
8506 return isl_bool_error
;
8507 is_subset
= isl_map_is_subset(map1
, map2
);
8508 if (is_subset
!= isl_bool_true
)
8510 is_subset
= isl_map_is_subset(map2
, map1
);
8511 if (is_subset
== isl_bool_error
)
8516 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8517 __isl_keep isl_set
*set2
)
8519 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8522 /* Is "bmap" obviously equal to the universe with the same space?
8524 * That is, does it not have any constraints?
8526 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8529 return isl_bool_error
;
8530 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8533 /* Is "bset" obviously equal to the universe with the same space?
8535 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8537 return isl_basic_map_plain_is_universe(bset
);
8540 /* If "c" does not involve any existentially quantified variables,
8541 * then set *univ to false and abort
8543 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8545 isl_bool
*univ
= user
;
8548 n
= isl_constraint_dim(c
, isl_dim_div
);
8549 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8550 isl_constraint_free(c
);
8551 if (*univ
< 0 || !*univ
)
8552 return isl_stat_error
;
8556 /* Is "bmap" equal to the universe with the same space?
8558 * First check if it is obviously equal to the universe.
8559 * If not and if there are any constraints not involving
8560 * existentially quantified variables, then it is certainly
8561 * not equal to the universe.
8562 * Otherwise, check if the universe is a subset of "bmap".
8564 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8567 isl_basic_map
*test
;
8569 univ
= isl_basic_map_plain_is_universe(bmap
);
8570 if (univ
< 0 || univ
)
8572 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8573 return isl_bool_false
;
8574 univ
= isl_bool_true
;
8575 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8577 return isl_bool_error
;
8578 if (univ
< 0 || !univ
)
8580 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8581 univ
= isl_basic_map_is_subset(test
, bmap
);
8582 isl_basic_map_free(test
);
8586 /* Is "bset" equal to the universe with the same space?
8588 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8590 return isl_basic_map_is_universe(bset
);
8593 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8598 return isl_bool_error
;
8600 for (i
= 0; i
< map
->n
; ++i
) {
8601 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8606 return isl_bool_false
;
8609 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8611 return isl_map_plain_is_universe(set_to_map(set
));
8614 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8616 struct isl_basic_set
*bset
= NULL
;
8617 struct isl_vec
*sample
= NULL
;
8618 isl_bool empty
, non_empty
;
8621 return isl_bool_error
;
8623 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8624 return isl_bool_true
;
8626 if (isl_basic_map_plain_is_universe(bmap
))
8627 return isl_bool_false
;
8629 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8630 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8631 copy
= isl_basic_map_remove_redundancies(copy
);
8632 empty
= isl_basic_map_plain_is_empty(copy
);
8633 isl_basic_map_free(copy
);
8637 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8639 return isl_bool_error
;
8641 return isl_bool_false
;
8642 isl_vec_free(bmap
->sample
);
8643 bmap
->sample
= NULL
;
8644 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8646 return isl_bool_error
;
8647 sample
= isl_basic_set_sample_vec(bset
);
8649 return isl_bool_error
;
8650 empty
= sample
->size
== 0;
8651 isl_vec_free(bmap
->sample
);
8652 bmap
->sample
= sample
;
8654 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8659 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8662 return isl_bool_error
;
8663 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8666 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8669 return isl_bool_error
;
8670 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8673 /* Is "bmap" known to be non-empty?
8675 * That is, is the cached sample still valid?
8677 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8682 return isl_bool_error
;
8684 return isl_bool_false
;
8685 total
= 1 + isl_basic_map_total_dim(bmap
);
8686 if (bmap
->sample
->size
!= total
)
8687 return isl_bool_false
;
8688 return isl_basic_map_contains(bmap
, bmap
->sample
);
8691 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8693 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8696 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8697 __isl_take isl_basic_map
*bmap2
)
8699 struct isl_map
*map
;
8700 if (!bmap1
|| !bmap2
)
8703 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8705 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8708 map
= isl_map_add_basic_map(map
, bmap1
);
8709 map
= isl_map_add_basic_map(map
, bmap2
);
8712 isl_basic_map_free(bmap1
);
8713 isl_basic_map_free(bmap2
);
8717 struct isl_set
*isl_basic_set_union(
8718 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8720 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8721 bset_to_bmap(bset2
)));
8724 /* Order divs such that any div only depends on previous divs */
8725 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8726 __isl_take isl_basic_map
*bmap
)
8734 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8736 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8738 if (isl_int_is_zero(bmap
->div
[i
][0]))
8740 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8745 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8746 "integer division depends on itself",
8747 return isl_basic_map_free(bmap
));
8748 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8754 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8756 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8759 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8766 for (i
= 0; i
< map
->n
; ++i
) {
8767 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8778 /* Sort the local variables of "bset".
8780 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8781 __isl_take isl_basic_set
*bset
)
8783 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8786 /* Apply the expansion computed by isl_merge_divs.
8787 * The expansion itself is given by "exp" while the resulting
8788 * list of divs is given by "div".
8790 * Move the integer divisions of "bmap" into the right position
8791 * according to "exp" and then introduce the additional integer
8792 * divisions, adding div constraints.
8793 * The moving should be done first to avoid moving coefficients
8794 * in the definitions of the extra integer divisions.
8796 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8797 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8802 bmap
= isl_basic_map_cow(bmap
);
8806 if (div
->n_row
< bmap
->n_div
)
8807 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8808 "not an expansion", goto error
);
8810 n_div
= bmap
->n_div
;
8811 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8812 div
->n_row
- n_div
, 0,
8813 2 * (div
->n_row
- n_div
));
8815 for (i
= n_div
; i
< div
->n_row
; ++i
)
8816 if (isl_basic_map_alloc_div(bmap
) < 0)
8819 for (j
= n_div
- 1; j
>= 0; --j
) {
8822 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8825 for (i
= 0; i
< div
->n_row
; ++i
) {
8826 if (j
< n_div
&& exp
[j
] == i
) {
8829 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8830 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8832 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8840 isl_basic_map_free(bmap
);
8845 /* Apply the expansion computed by isl_merge_divs.
8846 * The expansion itself is given by "exp" while the resulting
8847 * list of divs is given by "div".
8849 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8850 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8852 return isl_basic_map_expand_divs(bset
, div
, exp
);
8855 /* Look for a div in dst that corresponds to the div "div" in src.
8856 * The divs before "div" in src and dst are assumed to be the same.
8858 * Returns -1 if no corresponding div was found and the position
8859 * of the corresponding div in dst otherwise.
8861 static int find_div(__isl_keep isl_basic_map
*dst
,
8862 __isl_keep isl_basic_map
*src
, unsigned div
)
8866 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8868 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8869 for (i
= div
; i
< dst
->n_div
; ++i
)
8870 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8871 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8872 dst
->n_div
- div
) == -1)
8877 /* Align the divs of "dst" to those of "src", adding divs from "src"
8878 * if needed. That is, make sure that the first src->n_div divs
8879 * of the result are equal to those of src.
8881 * The result is not finalized as by design it will have redundant
8882 * divs if any divs from "src" were copied.
8884 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8885 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8888 int known
, extended
;
8892 return isl_basic_map_free(dst
);
8894 if (src
->n_div
== 0)
8897 known
= isl_basic_map_divs_known(src
);
8899 return isl_basic_map_free(dst
);
8901 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8902 "some src divs are unknown",
8903 return isl_basic_map_free(dst
));
8905 src
= isl_basic_map_order_divs(src
);
8908 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8909 for (i
= 0; i
< src
->n_div
; ++i
) {
8910 int j
= find_div(dst
, src
, i
);
8913 int extra
= src
->n_div
- i
;
8914 dst
= isl_basic_map_cow(dst
);
8917 dst
= isl_basic_map_extend_space(dst
,
8918 isl_space_copy(dst
->dim
),
8919 extra
, 0, 2 * extra
);
8922 j
= isl_basic_map_alloc_div(dst
);
8924 return isl_basic_map_free(dst
);
8925 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8926 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8927 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8928 return isl_basic_map_free(dst
);
8931 isl_basic_map_swap_div(dst
, i
, j
);
8936 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8944 map
= isl_map_compute_divs(map
);
8945 map
= isl_map_cow(map
);
8949 for (i
= 1; i
< map
->n
; ++i
)
8950 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8951 for (i
= 1; i
< map
->n
; ++i
) {
8952 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8954 return isl_map_free(map
);
8957 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8961 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
8963 return isl_map_align_divs_internal(map
);
8966 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8968 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
8971 /* Align the divs of the basic maps in "map" to those
8972 * of the basic maps in "list", as well as to the other basic maps in "map".
8973 * The elements in "list" are assumed to have known divs.
8975 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8976 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8980 map
= isl_map_compute_divs(map
);
8981 map
= isl_map_cow(map
);
8983 return isl_map_free(map
);
8987 n
= isl_basic_map_list_n_basic_map(list
);
8988 for (i
= 0; i
< n
; ++i
) {
8989 isl_basic_map
*bmap
;
8991 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8992 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8993 isl_basic_map_free(bmap
);
8996 return isl_map_free(map
);
8998 return isl_map_align_divs_internal(map
);
9001 /* Align the divs of each element of "list" to those of "bmap".
9002 * Both "bmap" and the elements of "list" are assumed to have known divs.
9004 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9005 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9010 return isl_basic_map_list_free(list
);
9012 n
= isl_basic_map_list_n_basic_map(list
);
9013 for (i
= 0; i
< n
; ++i
) {
9014 isl_basic_map
*bmap_i
;
9016 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9017 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9018 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9024 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9025 __isl_take isl_map
*map
)
9029 ok
= isl_map_compatible_domain(map
, set
);
9033 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9034 "incompatible spaces", goto error
);
9035 map
= isl_map_intersect_domain(map
, set
);
9036 set
= isl_map_range(map
);
9044 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9045 __isl_take isl_map
*map
)
9047 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9050 /* There is no need to cow as removing empty parts doesn't change
9051 * the meaning of the set.
9053 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9060 for (i
= map
->n
- 1; i
>= 0; --i
)
9061 remove_if_empty(map
, i
);
9066 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9068 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9071 /* Given two basic sets bset1 and bset2, compute the maximal difference
9072 * between the values of dimension pos in bset1 and those in bset2
9073 * for any common value of the parameters and dimensions preceding pos.
9075 static enum isl_lp_result
basic_set_maximal_difference_at(
9076 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9077 int pos
, isl_int
*opt
)
9079 isl_basic_map
*bmap1
;
9080 isl_basic_map
*bmap2
;
9081 struct isl_ctx
*ctx
;
9082 struct isl_vec
*obj
;
9086 enum isl_lp_result res
;
9088 if (!bset1
|| !bset2
)
9089 return isl_lp_error
;
9091 nparam
= isl_basic_set_n_param(bset1
);
9092 dim1
= isl_basic_set_n_dim(bset1
);
9094 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9095 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9096 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9097 isl_dim_out
, 0, pos
);
9098 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9099 isl_dim_out
, 0, pos
);
9100 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
9102 return isl_lp_error
;
9104 total
= isl_basic_map_total_dim(bmap1
);
9106 obj
= isl_vec_alloc(ctx
, 1 + total
);
9109 isl_seq_clr(obj
->block
.data
, 1 + total
);
9110 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9111 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9112 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9114 isl_basic_map_free(bmap1
);
9118 isl_basic_map_free(bmap1
);
9119 return isl_lp_error
;
9122 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9123 * for any common value of the parameters and dimensions preceding pos
9124 * in both basic sets, the values of dimension pos in bset1 are
9125 * smaller or larger than those in bset2.
9128 * 1 if bset1 follows bset2
9129 * -1 if bset1 precedes bset2
9130 * 0 if bset1 and bset2 are incomparable
9131 * -2 if some error occurred.
9133 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9134 struct isl_basic_set
*bset2
, int pos
)
9137 enum isl_lp_result res
;
9142 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9144 if (res
== isl_lp_empty
)
9146 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9147 res
== isl_lp_unbounded
)
9149 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9158 /* Given two basic sets bset1 and bset2, check whether
9159 * for any common value of the parameters and dimensions preceding pos
9160 * there is a value of dimension pos in bset1 that is larger
9161 * than a value of the same dimension in bset2.
9164 * 1 if there exists such a pair
9165 * 0 if there is no such pair, but there is a pair of equal values
9167 * -2 if some error occurred.
9169 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9170 __isl_keep isl_basic_set
*bset2
, int pos
)
9173 enum isl_lp_result res
;
9178 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9180 if (res
== isl_lp_empty
)
9182 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9183 res
== isl_lp_unbounded
)
9185 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9187 else if (res
== isl_lp_ok
)
9196 /* Given two sets set1 and set2, check whether
9197 * for any common value of the parameters and dimensions preceding pos
9198 * there is a value of dimension pos in set1 that is larger
9199 * than a value of the same dimension in set2.
9202 * 1 if there exists such a pair
9203 * 0 if there is no such pair, but there is a pair of equal values
9205 * -2 if some error occurred.
9207 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9208 __isl_keep isl_set
*set2
, int pos
)
9216 for (i
= 0; i
< set1
->n
; ++i
)
9217 for (j
= 0; j
< set2
->n
; ++j
) {
9219 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9220 if (f
== 1 || f
== -2)
9229 static isl_bool
isl_basic_map_plain_has_fixed_var(
9230 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9237 return isl_bool_error
;
9238 total
= isl_basic_map_total_dim(bmap
);
9239 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9240 for (; d
+1 > pos
; --d
)
9241 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9245 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9246 return isl_bool_false
;
9247 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9248 return isl_bool_false
;
9249 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9250 return isl_bool_false
;
9252 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9253 return isl_bool_true
;
9255 return isl_bool_false
;
9258 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9259 unsigned pos
, isl_int
*val
)
9267 return isl_bool_error
;
9269 return isl_bool_false
;
9271 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9274 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9275 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9276 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9277 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9278 fixed
= isl_bool_false
;
9281 isl_int_set(*val
, v
);
9287 static isl_bool
isl_basic_set_plain_has_fixed_var(
9288 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9290 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9294 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9295 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9297 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9298 return isl_bool_error
;
9299 return isl_basic_map_plain_has_fixed_var(bmap
,
9300 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9303 /* If "bmap" obviously lies on a hyperplane where the given dimension
9304 * has a fixed value, then return that value.
9305 * Otherwise return NaN.
9307 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9308 __isl_keep isl_basic_map
*bmap
,
9309 enum isl_dim_type type
, unsigned pos
)
9317 ctx
= isl_basic_map_get_ctx(bmap
);
9318 v
= isl_val_alloc(ctx
);
9321 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9323 return isl_val_free(v
);
9325 isl_int_set_si(v
->d
, 1);
9329 return isl_val_nan(ctx
);
9332 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9333 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9335 if (pos
>= isl_map_dim(map
, type
))
9336 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9337 "position out of bounds", return isl_bool_error
);
9338 return isl_map_plain_has_fixed_var(map
,
9339 map_offset(map
, type
) - 1 + pos
, val
);
9342 /* If "map" 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_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9347 enum isl_dim_type type
, unsigned pos
)
9355 ctx
= isl_map_get_ctx(map
);
9356 v
= isl_val_alloc(ctx
);
9359 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9361 return isl_val_free(v
);
9363 isl_int_set_si(v
->d
, 1);
9367 return isl_val_nan(ctx
);
9370 /* If "set" obviously lies on a hyperplane where the given dimension
9371 * has a fixed value, then return that value.
9372 * Otherwise return NaN.
9374 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9375 enum isl_dim_type type
, unsigned pos
)
9377 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9380 isl_bool
isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
9381 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9383 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
9386 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9387 * then return this fixed value in *val.
9389 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9390 unsigned dim
, isl_int
*val
)
9392 return isl_basic_set_plain_has_fixed_var(bset
,
9393 isl_basic_set_n_param(bset
) + dim
, val
);
9396 /* Return -1 if the constraint "c1" should be sorted before "c2"
9397 * and 1 if it should be sorted after "c2".
9398 * Return 0 if the two constraints are the same (up to the constant term).
9400 * In particular, if a constraint involves later variables than another
9401 * then it is sorted after this other constraint.
9402 * uset_gist depends on constraints without existentially quantified
9403 * variables sorting first.
9405 * For constraints that have the same latest variable, those
9406 * with the same coefficient for this latest variable (first in absolute value
9407 * and then in actual value) are grouped together.
9408 * This is useful for detecting pairs of constraints that can
9409 * be chained in their printed representation.
9411 * Finally, within a group, constraints are sorted according to
9412 * their coefficients (excluding the constant term).
9414 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9416 isl_int
**c1
= (isl_int
**) p1
;
9417 isl_int
**c2
= (isl_int
**) p2
;
9419 unsigned size
= *(unsigned *) arg
;
9422 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9423 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9428 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9431 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9435 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9438 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9439 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9440 * and 0 if the two constraints are the same (up to the constant term).
9442 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9443 isl_int
*c1
, isl_int
*c2
)
9449 total
= isl_basic_map_total_dim(bmap
);
9450 return sort_constraint_cmp(&c1
, &c2
, &total
);
9453 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9454 __isl_take isl_basic_map
*bmap
)
9460 if (bmap
->n_ineq
== 0)
9462 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9464 total
= isl_basic_map_total_dim(bmap
);
9465 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9466 &sort_constraint_cmp
, &total
) < 0)
9467 return isl_basic_map_free(bmap
);
9471 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9472 __isl_take isl_basic_set
*bset
)
9474 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9475 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9478 __isl_give isl_basic_map
*isl_basic_map_normalize(
9479 __isl_take isl_basic_map
*bmap
)
9483 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9485 bmap
= isl_basic_map_remove_redundancies(bmap
);
9486 bmap
= isl_basic_map_sort_constraints(bmap
);
9488 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9491 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9492 __isl_keep isl_basic_map
*bmap2
)
9496 isl_space
*space1
, *space2
;
9498 if (!bmap1
|| !bmap2
)
9503 space1
= isl_basic_map_peek_space(bmap1
);
9504 space2
= isl_basic_map_peek_space(bmap2
);
9505 cmp
= isl_space_cmp(space1
, space2
);
9508 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9509 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9510 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9511 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9512 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9514 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9516 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9518 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9519 return bmap1
->n_eq
- bmap2
->n_eq
;
9520 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9521 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9522 if (bmap1
->n_div
!= bmap2
->n_div
)
9523 return bmap1
->n_div
- bmap2
->n_div
;
9524 total
= isl_basic_map_total_dim(bmap1
);
9525 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9526 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9530 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9531 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9535 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9536 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9543 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9544 __isl_keep isl_basic_set
*bset2
)
9546 return isl_basic_map_plain_cmp(bset1
, bset2
);
9549 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9555 if (set1
->n
!= set2
->n
)
9556 return set1
->n
- set2
->n
;
9558 for (i
= 0; i
< set1
->n
; ++i
) {
9559 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9567 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9568 __isl_keep isl_basic_map
*bmap2
)
9570 if (!bmap1
|| !bmap2
)
9571 return isl_bool_error
;
9572 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9575 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9576 __isl_keep isl_basic_set
*bset2
)
9578 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9579 bset_to_bmap(bset2
));
9582 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9584 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9585 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9587 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9590 /* Sort the basic maps of "map" and remove duplicate basic maps.
9592 * While removing basic maps, we make sure that the basic maps remain
9593 * sorted because isl_map_normalize expects the basic maps of the result
9596 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9600 map
= isl_map_remove_empty_parts(map
);
9603 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9604 for (i
= map
->n
- 1; i
>= 1; --i
) {
9605 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9607 isl_basic_map_free(map
->p
[i
-1]);
9608 for (j
= i
; j
< map
->n
; ++j
)
9609 map
->p
[j
- 1] = map
->p
[j
];
9616 /* Remove obvious duplicates among the basic maps of "map".
9618 * Unlike isl_map_normalize, this function does not remove redundant
9619 * constraints and only removes duplicates that have exactly the same
9620 * constraints in the input. It does sort the constraints and
9621 * the basic maps to ease the detection of duplicates.
9623 * If "map" has already been normalized or if the basic maps are
9624 * disjoint, then there can be no duplicates.
9626 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9629 isl_basic_map
*bmap
;
9635 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9637 for (i
= 0; i
< map
->n
; ++i
) {
9638 bmap
= isl_basic_map_copy(map
->p
[i
]);
9639 bmap
= isl_basic_map_sort_constraints(bmap
);
9641 return isl_map_free(map
);
9642 isl_basic_map_free(map
->p
[i
]);
9646 map
= sort_and_remove_duplicates(map
);
9650 /* We normalize in place, but if anything goes wrong we need
9651 * to return NULL, so we need to make sure we don't change the
9652 * meaning of any possible other copies of map.
9654 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9657 struct isl_basic_map
*bmap
;
9661 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9663 for (i
= 0; i
< map
->n
; ++i
) {
9664 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9667 isl_basic_map_free(map
->p
[i
]);
9671 map
= sort_and_remove_duplicates(map
);
9673 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9680 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9682 return set_from_map(isl_map_normalize(set_to_map(set
)));
9685 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9686 __isl_keep isl_map
*map2
)
9692 return isl_bool_error
;
9695 return isl_bool_true
;
9696 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9697 return isl_bool_false
;
9699 map1
= isl_map_copy(map1
);
9700 map2
= isl_map_copy(map2
);
9701 map1
= isl_map_normalize(map1
);
9702 map2
= isl_map_normalize(map2
);
9705 equal
= map1
->n
== map2
->n
;
9706 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9707 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9717 return isl_bool_error
;
9720 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9721 __isl_keep isl_set
*set2
)
9723 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9726 /* Return the basic maps in "map" as a list.
9728 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9729 __isl_keep isl_map
*map
)
9733 isl_basic_map_list
*list
;
9737 ctx
= isl_map_get_ctx(map
);
9738 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9740 for (i
= 0; i
< map
->n
; ++i
) {
9741 isl_basic_map
*bmap
;
9743 bmap
= isl_basic_map_copy(map
->p
[i
]);
9744 list
= isl_basic_map_list_add(list
, bmap
);
9750 /* Return the intersection of the elements in the non-empty list "list".
9751 * All elements are assumed to live in the same space.
9753 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9754 __isl_take isl_basic_map_list
*list
)
9757 isl_basic_map
*bmap
;
9761 n
= isl_basic_map_list_n_basic_map(list
);
9763 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9764 "expecting non-empty list", goto error
);
9766 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9767 for (i
= 1; i
< n
; ++i
) {
9768 isl_basic_map
*bmap_i
;
9770 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9771 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9774 isl_basic_map_list_free(list
);
9777 isl_basic_map_list_free(list
);
9781 /* Return the intersection of the elements in the non-empty list "list".
9782 * All elements are assumed to live in the same space.
9784 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9785 __isl_take isl_basic_set_list
*list
)
9787 return isl_basic_map_list_intersect(list
);
9790 /* Return the union of the elements of "list".
9791 * The list is required to have at least one element.
9793 __isl_give isl_set
*isl_basic_set_list_union(
9794 __isl_take isl_basic_set_list
*list
)
9798 isl_basic_set
*bset
;
9803 n
= isl_basic_set_list_n_basic_set(list
);
9805 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9806 "expecting non-empty list", goto error
);
9808 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9809 space
= isl_basic_set_get_space(bset
);
9810 isl_basic_set_free(bset
);
9812 set
= isl_set_alloc_space(space
, n
, 0);
9813 for (i
= 0; i
< n
; ++i
) {
9814 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9815 set
= isl_set_add_basic_set(set
, bset
);
9818 isl_basic_set_list_free(list
);
9821 isl_basic_set_list_free(list
);
9825 /* Return the union of the elements in the non-empty list "list".
9826 * All elements are assumed to live in the same space.
9828 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9835 n
= isl_set_list_n_set(list
);
9837 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9838 "expecting non-empty list", goto error
);
9840 set
= isl_set_list_get_set(list
, 0);
9841 for (i
= 1; i
< n
; ++i
) {
9844 set_i
= isl_set_list_get_set(list
, i
);
9845 set
= isl_set_union(set
, set_i
);
9848 isl_set_list_free(list
);
9851 isl_set_list_free(list
);
9855 __isl_give isl_basic_map
*isl_basic_map_product(
9856 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9858 isl_space
*dim_result
= NULL
;
9859 struct isl_basic_map
*bmap
;
9860 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9861 struct isl_dim_map
*dim_map1
, *dim_map2
;
9863 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9865 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9866 isl_space_copy(bmap2
->dim
));
9868 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9869 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9870 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9871 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9872 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9874 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9875 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9876 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9877 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9878 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9879 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9880 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9881 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9882 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9883 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9884 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9886 bmap
= isl_basic_map_alloc_space(dim_result
,
9887 bmap1
->n_div
+ bmap2
->n_div
,
9888 bmap1
->n_eq
+ bmap2
->n_eq
,
9889 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9890 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9891 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9892 bmap
= isl_basic_map_simplify(bmap
);
9893 return isl_basic_map_finalize(bmap
);
9895 isl_basic_map_free(bmap1
);
9896 isl_basic_map_free(bmap2
);
9900 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9901 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9903 isl_basic_map
*prod
;
9905 prod
= isl_basic_map_product(bmap1
, bmap2
);
9906 prod
= isl_basic_map_flatten(prod
);
9910 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9911 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9913 return isl_basic_map_flat_range_product(bset1
, bset2
);
9916 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9917 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9919 isl_space
*space_result
= NULL
;
9920 isl_basic_map
*bmap
;
9921 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9922 struct isl_dim_map
*dim_map1
, *dim_map2
;
9924 if (!bmap1
|| !bmap2
)
9927 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9928 isl_space_copy(bmap2
->dim
));
9930 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9931 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9932 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9933 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9935 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9936 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9937 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9938 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9939 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9940 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9941 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9942 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9943 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9944 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9945 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9947 bmap
= isl_basic_map_alloc_space(space_result
,
9948 bmap1
->n_div
+ bmap2
->n_div
,
9949 bmap1
->n_eq
+ bmap2
->n_eq
,
9950 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9951 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9952 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9953 bmap
= isl_basic_map_simplify(bmap
);
9954 return isl_basic_map_finalize(bmap
);
9956 isl_basic_map_free(bmap1
);
9957 isl_basic_map_free(bmap2
);
9961 __isl_give isl_basic_map
*isl_basic_map_range_product(
9962 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9965 isl_space
*dim_result
= NULL
;
9966 isl_basic_map
*bmap
;
9967 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9968 struct isl_dim_map
*dim_map1
, *dim_map2
;
9970 rational
= isl_basic_map_is_rational(bmap1
);
9971 if (rational
>= 0 && rational
)
9972 rational
= isl_basic_map_is_rational(bmap2
);
9973 if (!bmap1
|| !bmap2
|| rational
< 0)
9976 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9979 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9980 isl_space_copy(bmap2
->dim
));
9982 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9983 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9984 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9985 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9987 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9988 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9989 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9990 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9991 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9992 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9993 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9994 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9995 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9996 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9997 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9999 bmap
= isl_basic_map_alloc_space(dim_result
,
10000 bmap1
->n_div
+ bmap2
->n_div
,
10001 bmap1
->n_eq
+ bmap2
->n_eq
,
10002 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10003 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10004 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10006 bmap
= isl_basic_map_set_rational(bmap
);
10007 bmap
= isl_basic_map_simplify(bmap
);
10008 return isl_basic_map_finalize(bmap
);
10010 isl_basic_map_free(bmap1
);
10011 isl_basic_map_free(bmap2
);
10015 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10016 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10018 isl_basic_map
*prod
;
10020 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10021 prod
= isl_basic_map_flatten_range(prod
);
10025 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10026 * and collect the results.
10027 * The result live in the space obtained by calling "space_product"
10028 * on the spaces of "map1" and "map2".
10029 * If "remove_duplicates" is set then the result may contain duplicates
10030 * (even if the inputs do not) and so we try and remove the obvious
10033 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10034 __isl_take isl_map
*map2
,
10035 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10036 __isl_take isl_space
*right
),
10037 __isl_give isl_basic_map
*(*basic_map_product
)(
10038 __isl_take isl_basic_map
*left
,
10039 __isl_take isl_basic_map
*right
),
10040 int remove_duplicates
)
10042 unsigned flags
= 0;
10043 struct isl_map
*result
;
10047 m
= isl_map_has_equal_params(map1
, map2
);
10051 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10052 "parameters don't match", goto error
);
10054 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10055 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10056 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10058 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10059 isl_space_copy(map2
->dim
)),
10060 map1
->n
* map2
->n
, flags
);
10063 for (i
= 0; i
< map1
->n
; ++i
)
10064 for (j
= 0; j
< map2
->n
; ++j
) {
10065 struct isl_basic_map
*part
;
10066 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10067 isl_basic_map_copy(map2
->p
[j
]));
10068 if (isl_basic_map_is_empty(part
))
10069 isl_basic_map_free(part
);
10071 result
= isl_map_add_basic_map(result
, part
);
10075 if (remove_duplicates
)
10076 result
= isl_map_remove_obvious_duplicates(result
);
10077 isl_map_free(map1
);
10078 isl_map_free(map2
);
10081 isl_map_free(map1
);
10082 isl_map_free(map2
);
10086 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10088 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10089 __isl_take isl_map
*map2
)
10091 return map_product(map1
, map2
, &isl_space_product
,
10092 &isl_basic_map_product
, 0);
10095 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10096 __isl_take isl_map
*map2
)
10098 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10101 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10103 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10104 __isl_take isl_map
*map2
)
10108 prod
= isl_map_product(map1
, map2
);
10109 prod
= isl_map_flatten(prod
);
10113 /* Given two set A and B, construct its Cartesian product A x B.
10115 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10117 return isl_map_range_product(set1
, set2
);
10120 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10121 __isl_take isl_set
*set2
)
10123 return isl_map_flat_range_product(set1
, set2
);
10126 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10128 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10129 __isl_take isl_map
*map2
)
10131 return map_product(map1
, map2
, &isl_space_domain_product
,
10132 &isl_basic_map_domain_product
, 1);
10135 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10137 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10138 __isl_take isl_map
*map2
)
10140 return map_product(map1
, map2
, &isl_space_range_product
,
10141 &isl_basic_map_range_product
, 1);
10144 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10145 __isl_take isl_map
*map2
)
10147 return isl_map_align_params_map_map_and(map1
, map2
,
10148 &map_domain_product_aligned
);
10151 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10152 __isl_take isl_map
*map2
)
10154 return isl_map_align_params_map_map_and(map1
, map2
,
10155 &map_range_product_aligned
);
10158 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10160 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10163 int total1
, keep1
, total2
, keep2
;
10167 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10168 !isl_space_range_is_wrapping(map
->dim
))
10169 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10170 "not a product", return isl_map_free(map
));
10172 space
= isl_map_get_space(map
);
10173 total1
= isl_space_dim(space
, isl_dim_in
);
10174 total2
= isl_space_dim(space
, isl_dim_out
);
10175 space
= isl_space_factor_domain(space
);
10176 keep1
= isl_space_dim(space
, isl_dim_in
);
10177 keep2
= isl_space_dim(space
, isl_dim_out
);
10178 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10179 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10180 map
= isl_map_reset_space(map
, space
);
10185 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10187 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10190 int total1
, keep1
, total2
, keep2
;
10194 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10195 !isl_space_range_is_wrapping(map
->dim
))
10196 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10197 "not a product", return isl_map_free(map
));
10199 space
= isl_map_get_space(map
);
10200 total1
= isl_space_dim(space
, isl_dim_in
);
10201 total2
= isl_space_dim(space
, isl_dim_out
);
10202 space
= isl_space_factor_range(space
);
10203 keep1
= isl_space_dim(space
, isl_dim_in
);
10204 keep2
= isl_space_dim(space
, isl_dim_out
);
10205 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10206 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10207 map
= isl_map_reset_space(map
, space
);
10212 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10214 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10221 if (!isl_space_domain_is_wrapping(map
->dim
))
10222 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10223 "domain is not a product", return isl_map_free(map
));
10225 space
= isl_map_get_space(map
);
10226 total
= isl_space_dim(space
, isl_dim_in
);
10227 space
= isl_space_domain_factor_domain(space
);
10228 keep
= isl_space_dim(space
, isl_dim_in
);
10229 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10230 map
= isl_map_reset_space(map
, space
);
10235 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10237 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10244 if (!isl_space_domain_is_wrapping(map
->dim
))
10245 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10246 "domain is not a product", return isl_map_free(map
));
10248 space
= isl_map_get_space(map
);
10249 total
= isl_space_dim(space
, isl_dim_in
);
10250 space
= isl_space_domain_factor_range(space
);
10251 keep
= isl_space_dim(space
, isl_dim_in
);
10252 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10253 map
= isl_map_reset_space(map
, space
);
10258 /* Given a map A -> [B -> C], extract the map A -> B.
10260 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10267 if (!isl_space_range_is_wrapping(map
->dim
))
10268 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10269 "range is not a product", return isl_map_free(map
));
10271 space
= isl_map_get_space(map
);
10272 total
= isl_space_dim(space
, isl_dim_out
);
10273 space
= isl_space_range_factor_domain(space
);
10274 keep
= isl_space_dim(space
, isl_dim_out
);
10275 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10276 map
= isl_map_reset_space(map
, space
);
10281 /* Given a map A -> [B -> C], extract the map A -> C.
10283 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10290 if (!isl_space_range_is_wrapping(map
->dim
))
10291 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10292 "range is not a product", return isl_map_free(map
));
10294 space
= isl_map_get_space(map
);
10295 total
= isl_space_dim(space
, isl_dim_out
);
10296 space
= isl_space_range_factor_range(space
);
10297 keep
= isl_space_dim(space
, isl_dim_out
);
10298 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10299 map
= isl_map_reset_space(map
, space
);
10304 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10306 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10307 __isl_take isl_map
*map2
)
10311 prod
= isl_map_domain_product(map1
, map2
);
10312 prod
= isl_map_flatten_domain(prod
);
10316 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10318 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10319 __isl_take isl_map
*map2
)
10323 prod
= isl_map_range_product(map1
, map2
);
10324 prod
= isl_map_flatten_range(prod
);
10328 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10331 uint32_t hash
= isl_hash_init();
10336 bmap
= isl_basic_map_copy(bmap
);
10337 bmap
= isl_basic_map_normalize(bmap
);
10340 total
= isl_basic_map_total_dim(bmap
);
10341 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10342 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10344 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10345 isl_hash_hash(hash
, c_hash
);
10347 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10348 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10350 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10351 isl_hash_hash(hash
, c_hash
);
10353 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10354 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10356 if (isl_int_is_zero(bmap
->div
[i
][0]))
10358 isl_hash_byte(hash
, i
& 0xFF);
10359 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10360 isl_hash_hash(hash
, c_hash
);
10362 isl_basic_map_free(bmap
);
10366 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10368 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10371 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10378 map
= isl_map_copy(map
);
10379 map
= isl_map_normalize(map
);
10383 hash
= isl_hash_init();
10384 for (i
= 0; i
< map
->n
; ++i
) {
10385 uint32_t bmap_hash
;
10386 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10387 isl_hash_hash(hash
, bmap_hash
);
10395 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10397 return isl_map_get_hash(set_to_map(set
));
10400 /* Return the number of basic maps in the (current) representation of "map".
10402 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10404 return map
? map
->n
: 0;
10407 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10409 return set
? set
->n
: 0;
10412 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10413 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10418 return isl_stat_error
;
10420 for (i
= 0; i
< map
->n
; ++i
)
10421 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10422 return isl_stat_error
;
10424 return isl_stat_ok
;
10427 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10428 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10433 return isl_stat_error
;
10435 for (i
= 0; i
< set
->n
; ++i
)
10436 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10437 return isl_stat_error
;
10439 return isl_stat_ok
;
10442 /* Return a list of basic sets, the union of which is equal to "set".
10444 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10445 __isl_keep isl_set
*set
)
10448 isl_basic_set_list
*list
;
10453 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10454 for (i
= 0; i
< set
->n
; ++i
) {
10455 isl_basic_set
*bset
;
10457 bset
= isl_basic_set_copy(set
->p
[i
]);
10458 list
= isl_basic_set_list_add(list
, bset
);
10464 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10471 bset
= isl_basic_set_cow(bset
);
10475 dim
= isl_basic_set_get_space(bset
);
10476 dim
= isl_space_lift(dim
, bset
->n_div
);
10479 isl_space_free(bset
->dim
);
10481 bset
->extra
-= bset
->n_div
;
10484 bset
= isl_basic_set_finalize(bset
);
10488 isl_basic_set_free(bset
);
10492 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10498 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10503 set
= isl_set_cow(set
);
10507 n_div
= set
->p
[0]->n_div
;
10508 dim
= isl_set_get_space(set
);
10509 dim
= isl_space_lift(dim
, n_div
);
10512 isl_space_free(set
->dim
);
10515 for (i
= 0; i
< set
->n
; ++i
) {
10516 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10527 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10535 dim
= isl_basic_set_total_dim(bset
);
10536 size
+= bset
->n_eq
* (1 + dim
);
10537 size
+= bset
->n_ineq
* (1 + dim
);
10538 size
+= bset
->n_div
* (2 + dim
);
10543 int isl_set_size(__isl_keep isl_set
*set
)
10551 for (i
= 0; i
< set
->n
; ++i
)
10552 size
+= isl_basic_set_size(set
->p
[i
]);
10557 /* Check if there is any lower bound (if lower == 0) and/or upper
10558 * bound (if upper == 0) on the specified dim.
10560 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10561 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10565 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10566 return isl_bool_error
;
10568 pos
+= isl_basic_map_offset(bmap
, type
);
10570 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10571 if (isl_int_is_zero(bmap
->div
[i
][0]))
10573 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10574 return isl_bool_true
;
10577 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10578 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10579 return isl_bool_true
;
10581 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10582 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10589 return lower
&& upper
;
10592 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10593 enum isl_dim_type type
, unsigned pos
)
10595 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10598 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10599 enum isl_dim_type type
, unsigned pos
)
10601 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10604 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10605 enum isl_dim_type type
, unsigned pos
)
10607 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10610 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10611 enum isl_dim_type type
, unsigned pos
)
10616 return isl_bool_error
;
10618 for (i
= 0; i
< map
->n
; ++i
) {
10620 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10621 if (bounded
< 0 || !bounded
)
10625 return isl_bool_true
;
10628 /* Return true if the specified dim is involved in both an upper bound
10629 * and a lower bound.
10631 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10632 enum isl_dim_type type
, unsigned pos
)
10634 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10637 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10639 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10640 enum isl_dim_type type
, unsigned pos
,
10641 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10642 enum isl_dim_type type
, unsigned pos
))
10647 return isl_bool_error
;
10649 for (i
= 0; i
< map
->n
; ++i
) {
10651 bounded
= fn(map
->p
[i
], type
, pos
);
10652 if (bounded
< 0 || bounded
)
10656 return isl_bool_false
;
10659 /* Return 1 if the specified dim is involved in any lower bound.
10661 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10662 enum isl_dim_type type
, unsigned pos
)
10664 return has_any_bound(set
, type
, pos
,
10665 &isl_basic_map_dim_has_lower_bound
);
10668 /* Return 1 if the specified dim is involved in any upper bound.
10670 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10671 enum isl_dim_type type
, unsigned pos
)
10673 return has_any_bound(set
, type
, pos
,
10674 &isl_basic_map_dim_has_upper_bound
);
10677 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10679 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10680 enum isl_dim_type type
, unsigned pos
,
10681 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10682 enum isl_dim_type type
, unsigned pos
))
10687 return isl_bool_error
;
10689 for (i
= 0; i
< map
->n
; ++i
) {
10691 bounded
= fn(map
->p
[i
], type
, pos
);
10692 if (bounded
< 0 || !bounded
)
10696 return isl_bool_true
;
10699 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10701 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10702 enum isl_dim_type type
, unsigned pos
)
10704 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10707 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10709 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10710 enum isl_dim_type type
, unsigned pos
)
10712 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10715 /* For each of the "n" variables starting at "first", determine
10716 * the sign of the variable and put the results in the first "n"
10717 * elements of the array "signs".
10719 * 1 means that the variable is non-negative
10720 * -1 means that the variable is non-positive
10721 * 0 means the variable attains both positive and negative values.
10723 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10724 unsigned first
, unsigned n
, int *signs
)
10726 isl_vec
*bound
= NULL
;
10727 struct isl_tab
*tab
= NULL
;
10728 struct isl_tab_undo
*snap
;
10731 if (!bset
|| !signs
)
10732 return isl_stat_error
;
10734 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10735 tab
= isl_tab_from_basic_set(bset
, 0);
10736 if (!bound
|| !tab
)
10739 isl_seq_clr(bound
->el
, bound
->size
);
10740 isl_int_set_si(bound
->el
[0], -1);
10742 snap
= isl_tab_snap(tab
);
10743 for (i
= 0; i
< n
; ++i
) {
10746 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10747 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10749 empty
= tab
->empty
;
10750 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10751 if (isl_tab_rollback(tab
, snap
) < 0)
10759 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10760 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10762 empty
= tab
->empty
;
10763 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10764 if (isl_tab_rollback(tab
, snap
) < 0)
10767 signs
[i
] = empty
? -1 : 0;
10771 isl_vec_free(bound
);
10772 return isl_stat_ok
;
10775 isl_vec_free(bound
);
10776 return isl_stat_error
;
10779 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10780 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10782 if (!bset
|| !signs
)
10783 return isl_stat_error
;
10784 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10785 return isl_stat_error
);
10787 first
+= pos(bset
->dim
, type
) - 1;
10788 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10791 /* Is it possible for the integer division "div" to depend (possibly
10792 * indirectly) on any output dimensions?
10794 * If the div is undefined, then we conservatively assume that it
10795 * may depend on them.
10796 * Otherwise, we check if it actually depends on them or on any integer
10797 * divisions that may depend on them.
10799 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10802 unsigned n_out
, o_out
;
10803 unsigned n_div
, o_div
;
10805 if (isl_int_is_zero(bmap
->div
[div
][0]))
10806 return isl_bool_true
;
10808 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10809 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10811 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10812 return isl_bool_true
;
10814 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10815 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10817 for (i
= 0; i
< n_div
; ++i
) {
10818 isl_bool may_involve
;
10820 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10822 may_involve
= div_may_involve_output(bmap
, i
);
10823 if (may_involve
< 0 || may_involve
)
10824 return may_involve
;
10827 return isl_bool_false
;
10830 /* Return the first integer division of "bmap" in the range
10831 * [first, first + n[ that may depend on any output dimensions and
10832 * that has a non-zero coefficient in "c" (where the first coefficient
10833 * in "c" corresponds to integer division "first").
10835 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10836 isl_int
*c
, int first
, int n
)
10843 for (k
= first
; k
< first
+ n
; ++k
) {
10844 isl_bool may_involve
;
10846 if (isl_int_is_zero(c
[k
]))
10848 may_involve
= div_may_involve_output(bmap
, k
);
10849 if (may_involve
< 0)
10858 /* Look for a pair of inequality constraints in "bmap" of the form
10860 * -l + i >= 0 or i >= l
10862 * n + l - i >= 0 or i <= l + n
10864 * with n < "m" and i the output dimension at position "pos".
10865 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10866 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10867 * and earlier output dimensions, as well as integer divisions that do
10868 * not involve any of the output dimensions.
10870 * Return the index of the first inequality constraint or bmap->n_ineq
10871 * if no such pair can be found.
10873 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10874 int pos
, isl_int m
)
10879 unsigned n_div
, o_div
;
10880 unsigned n_out
, o_out
;
10886 ctx
= isl_basic_map_get_ctx(bmap
);
10887 total
= isl_basic_map_total_dim(bmap
);
10888 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10889 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10890 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10891 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10892 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10893 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10895 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10896 n_out
- (pos
+ 1)) != -1)
10898 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10901 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10902 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10905 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10906 bmap
->ineq
[j
] + 1, total
))
10910 if (j
>= bmap
->n_ineq
)
10912 isl_int_add(bmap
->ineq
[i
][0],
10913 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10914 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10915 isl_int_sub(bmap
->ineq
[i
][0],
10916 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10919 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10925 return bmap
->n_ineq
;
10928 /* Return the index of the equality of "bmap" that defines
10929 * the output dimension "pos" in terms of earlier dimensions.
10930 * The equality may also involve integer divisions, as long
10931 * as those integer divisions are defined in terms of
10932 * parameters or input dimensions.
10933 * In this case, *div is set to the number of integer divisions and
10934 * *ineq is set to the number of inequality constraints (provided
10935 * div and ineq are not NULL).
10937 * The equality may also involve a single integer division involving
10938 * the output dimensions (typically only output dimension "pos") as
10939 * long as the coefficient of output dimension "pos" is 1 or -1 and
10940 * there is a pair of constraints i >= l and i <= l + n, with i referring
10941 * to output dimension "pos", l an expression involving only earlier
10942 * dimensions and n smaller than the coefficient of the integer division
10943 * in the equality. In this case, the output dimension can be defined
10944 * in terms of a modulo expression that does not involve the integer division.
10945 * *div is then set to this single integer division and
10946 * *ineq is set to the index of constraint i >= l.
10948 * Return bmap->n_eq if there is no such equality.
10949 * Return -1 on error.
10951 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10952 int pos
, int *div
, int *ineq
)
10955 unsigned n_out
, o_out
;
10956 unsigned n_div
, o_div
;
10961 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10962 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10963 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10964 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10967 *ineq
= bmap
->n_ineq
;
10970 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10971 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10973 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10974 n_out
- (pos
+ 1)) != -1)
10976 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10980 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10981 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10983 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10984 k
+ 1, n_div
- (k
+1)) < n_div
)
10986 l
= find_modulo_constraint_pair(bmap
, pos
,
10987 bmap
->eq
[j
][o_div
+ k
]);
10990 if (l
>= bmap
->n_ineq
)
11002 /* Check if the given basic map is obviously single-valued.
11003 * In particular, for each output dimension, check that there is
11004 * an equality that defines the output dimension in terms of
11005 * earlier dimensions.
11007 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11013 return isl_bool_error
;
11015 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11017 for (i
= 0; i
< n_out
; ++i
) {
11020 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11023 return isl_bool_error
;
11024 if (eq
>= bmap
->n_eq
)
11025 return isl_bool_false
;
11028 return isl_bool_true
;
11031 /* Check if the given basic map is single-valued.
11032 * We simply compute
11036 * and check if the result is a subset of the identity mapping.
11038 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11041 isl_basic_map
*test
;
11045 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11049 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11050 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11052 space
= isl_basic_map_get_space(bmap
);
11053 space
= isl_space_map_from_set(isl_space_range(space
));
11054 id
= isl_basic_map_identity(space
);
11056 sv
= isl_basic_map_is_subset(test
, id
);
11058 isl_basic_map_free(test
);
11059 isl_basic_map_free(id
);
11064 /* Check if the given map is obviously single-valued.
11066 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11069 return isl_bool_error
;
11071 return isl_bool_true
;
11073 return isl_bool_false
;
11075 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11078 /* Check if the given map is single-valued.
11079 * We simply compute
11083 * and check if the result is a subset of the identity mapping.
11085 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11092 sv
= isl_map_plain_is_single_valued(map
);
11096 test
= isl_map_reverse(isl_map_copy(map
));
11097 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11099 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11100 id
= isl_map_identity(dim
);
11102 sv
= isl_map_is_subset(test
, id
);
11104 isl_map_free(test
);
11110 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11114 map
= isl_map_copy(map
);
11115 map
= isl_map_reverse(map
);
11116 in
= isl_map_is_single_valued(map
);
11122 /* Check if the given map is obviously injective.
11124 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11128 map
= isl_map_copy(map
);
11129 map
= isl_map_reverse(map
);
11130 in
= isl_map_plain_is_single_valued(map
);
11136 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11140 sv
= isl_map_is_single_valued(map
);
11144 return isl_map_is_injective(map
);
11147 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11149 return isl_map_is_single_valued(set_to_map(set
));
11152 /* Does "map" only map elements to themselves?
11154 * If the domain and range spaces are different, then "map"
11155 * is considered not to be an identity relation, even if it is empty.
11156 * Otherwise, construct the maximal identity relation and
11157 * check whether "map" is a subset of this relation.
11159 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11163 isl_bool equal
, is_identity
;
11165 space
= isl_map_get_space(map
);
11166 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11167 isl_space_free(space
);
11168 if (equal
< 0 || !equal
)
11171 id
= isl_map_identity(isl_map_get_space(map
));
11172 is_identity
= isl_map_is_subset(map
, id
);
11175 return is_identity
;
11178 int isl_map_is_translation(__isl_keep isl_map
*map
)
11183 delta
= isl_map_deltas(isl_map_copy(map
));
11184 ok
= isl_set_is_singleton(delta
);
11185 isl_set_free(delta
);
11190 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11192 if (isl_seq_first_non_zero(p
, pos
) != -1)
11194 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11199 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11206 return isl_bool_error
;
11208 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11209 return isl_bool_false
;
11211 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11212 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11213 for (j
= 0; j
< nvar
; ++j
) {
11214 int lower
= 0, upper
= 0;
11215 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11216 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11218 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11219 return isl_bool_false
;
11222 if (i
< bset
->n_eq
)
11224 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11225 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11227 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11228 return isl_bool_false
;
11229 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11234 if (!lower
|| !upper
)
11235 return isl_bool_false
;
11238 return isl_bool_true
;
11241 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11244 return isl_bool_error
;
11246 return isl_bool_false
;
11248 return isl_basic_set_is_box(set
->p
[0]);
11251 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11254 return isl_bool_error
;
11256 return isl_space_is_wrapping(bset
->dim
);
11259 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11262 return isl_bool_error
;
11264 return isl_space_is_wrapping(set
->dim
);
11267 /* Modify the space of "map" through a call to "change".
11268 * If "can_change" is set (not NULL), then first call it to check
11269 * if the modification is allowed, printing the error message "cannot_change"
11272 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11273 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11274 const char *cannot_change
,
11275 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11283 ok
= can_change
? can_change(map
) : isl_bool_true
;
11285 return isl_map_free(map
);
11287 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11288 return isl_map_free(map
));
11290 space
= change(isl_map_get_space(map
));
11291 map
= isl_map_reset_space(map
, space
);
11296 /* Is the domain of "map" a wrapped relation?
11298 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11301 return isl_bool_error
;
11303 return isl_space_domain_is_wrapping(map
->dim
);
11306 /* Does "map" have a wrapped relation in both domain and range?
11308 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11310 return isl_space_is_product(isl_map_peek_space(map
));
11313 /* Is the range of "map" a wrapped relation?
11315 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11318 return isl_bool_error
;
11320 return isl_space_range_is_wrapping(map
->dim
);
11323 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11325 bmap
= isl_basic_map_cow(bmap
);
11329 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11333 bmap
= isl_basic_map_finalize(bmap
);
11335 return bset_from_bmap(bmap
);
11337 isl_basic_map_free(bmap
);
11341 /* Given a map A -> B, return the set (A -> B).
11343 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11345 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11348 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11350 bset
= isl_basic_set_cow(bset
);
11354 bset
->dim
= isl_space_unwrap(bset
->dim
);
11358 bset
= isl_basic_set_finalize(bset
);
11360 return bset_to_bmap(bset
);
11362 isl_basic_set_free(bset
);
11366 /* Given a set (A -> B), return the map A -> B.
11367 * Error out if "set" is not of the form (A -> B).
11369 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11371 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11372 "not a wrapping set", &isl_space_unwrap
);
11375 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11376 enum isl_dim_type type
)
11381 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11384 bmap
= isl_basic_map_cow(bmap
);
11388 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11392 bmap
= isl_basic_map_finalize(bmap
);
11396 isl_basic_map_free(bmap
);
11400 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11401 enum isl_dim_type type
)
11408 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11411 map
= isl_map_cow(map
);
11415 for (i
= 0; i
< map
->n
; ++i
) {
11416 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11420 map
->dim
= isl_space_reset(map
->dim
, type
);
11430 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11435 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11438 bmap
= isl_basic_map_cow(bmap
);
11442 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11446 bmap
= isl_basic_map_finalize(bmap
);
11450 isl_basic_map_free(bmap
);
11454 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11456 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11459 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11460 __isl_take isl_basic_map
*bmap
)
11465 if (!bmap
->dim
->nested
[0])
11468 bmap
= isl_basic_map_cow(bmap
);
11472 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11476 bmap
= isl_basic_map_finalize(bmap
);
11480 isl_basic_map_free(bmap
);
11484 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11485 __isl_take isl_basic_map
*bmap
)
11490 if (!bmap
->dim
->nested
[1])
11493 bmap
= isl_basic_map_cow(bmap
);
11497 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11501 bmap
= isl_basic_map_finalize(bmap
);
11505 isl_basic_map_free(bmap
);
11509 /* Remove any internal structure from the spaces of domain and range of "map".
11511 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11516 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11519 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11522 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11524 return set_from_map(isl_map_flatten(set_to_map(set
)));
11527 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11529 isl_space
*dim
, *flat_dim
;
11532 dim
= isl_set_get_space(set
);
11533 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11534 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11535 map
= isl_map_intersect_domain(map
, set
);
11540 /* Remove any internal structure from the space of the domain of "map".
11542 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11547 if (!map
->dim
->nested
[0])
11550 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11553 /* Remove any internal structure from the space of the range of "map".
11555 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11560 if (!map
->dim
->nested
[1])
11563 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11566 /* Reorder the dimensions of "bmap" according to the given dim_map
11567 * and set the dimension specification to "dim" and
11568 * perform Gaussian elimination on the result.
11570 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11571 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11573 isl_basic_map
*res
;
11576 bmap
= isl_basic_map_cow(bmap
);
11577 if (!bmap
|| !dim
|| !dim_map
)
11580 flags
= bmap
->flags
;
11581 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11582 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11583 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11584 res
= isl_basic_map_alloc_space(dim
,
11585 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11586 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11588 res
->flags
= flags
;
11589 res
= isl_basic_map_gauss(res
, NULL
);
11590 res
= isl_basic_map_finalize(res
);
11594 isl_basic_map_free(bmap
);
11595 isl_space_free(dim
);
11599 /* Reorder the dimensions of "map" according to given reordering.
11601 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11602 __isl_take isl_reordering
*r
)
11605 struct isl_dim_map
*dim_map
;
11607 map
= isl_map_cow(map
);
11608 dim_map
= isl_dim_map_from_reordering(r
);
11609 if (!map
|| !r
|| !dim_map
)
11612 for (i
= 0; i
< map
->n
; ++i
) {
11613 struct isl_dim_map
*dim_map_i
;
11615 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11617 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11618 isl_space_copy(r
->dim
), dim_map_i
);
11624 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11626 isl_reordering_free(r
);
11632 isl_reordering_free(r
);
11636 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11637 __isl_take isl_reordering
*r
)
11639 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11642 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11643 __isl_take isl_space
*model
)
11648 if (!map
|| !model
)
11651 ctx
= isl_space_get_ctx(model
);
11652 if (!isl_space_has_named_params(model
))
11653 isl_die(ctx
, isl_error_invalid
,
11654 "model has unnamed parameters", goto error
);
11655 if (isl_map_check_named_params(map
) < 0)
11657 aligned
= isl_map_space_has_equal_params(map
, model
);
11661 isl_reordering
*exp
;
11663 model
= isl_space_drop_dims(model
, isl_dim_in
,
11664 0, isl_space_dim(model
, isl_dim_in
));
11665 model
= isl_space_drop_dims(model
, isl_dim_out
,
11666 0, isl_space_dim(model
, isl_dim_out
));
11667 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11668 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11669 map
= isl_map_realign(map
, exp
);
11672 isl_space_free(model
);
11675 isl_space_free(model
);
11680 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11681 __isl_take isl_space
*model
)
11683 return isl_map_align_params(set
, model
);
11686 /* Align the parameters of "bmap" to those of "model", introducing
11687 * additional parameters if needed.
11689 __isl_give isl_basic_map
*isl_basic_map_align_params(
11690 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11693 isl_bool equal_params
;
11695 if (!bmap
|| !model
)
11698 ctx
= isl_space_get_ctx(model
);
11699 if (!isl_space_has_named_params(model
))
11700 isl_die(ctx
, isl_error_invalid
,
11701 "model has unnamed parameters", goto error
);
11702 if (!isl_space_has_named_params(bmap
->dim
))
11703 isl_die(ctx
, isl_error_invalid
,
11704 "relation has unnamed parameters", goto error
);
11705 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11706 if (equal_params
< 0)
11708 if (!equal_params
) {
11709 isl_reordering
*exp
;
11710 struct isl_dim_map
*dim_map
;
11712 model
= isl_space_drop_dims(model
, isl_dim_in
,
11713 0, isl_space_dim(model
, isl_dim_in
));
11714 model
= isl_space_drop_dims(model
, isl_dim_out
,
11715 0, isl_space_dim(model
, isl_dim_out
));
11716 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11717 exp
= isl_reordering_extend_space(exp
,
11718 isl_basic_map_get_space(bmap
));
11719 dim_map
= isl_dim_map_from_reordering(exp
);
11720 bmap
= isl_basic_map_realign(bmap
,
11721 exp
? isl_space_copy(exp
->dim
) : NULL
,
11722 isl_dim_map_extend(dim_map
, bmap
));
11723 isl_reordering_free(exp
);
11727 isl_space_free(model
);
11730 isl_space_free(model
);
11731 isl_basic_map_free(bmap
);
11735 /* Do "bset" and "space" have the same parameters?
11737 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11738 __isl_keep isl_space
*space
)
11740 isl_space
*bset_space
;
11742 bset_space
= isl_basic_set_peek_space(bset
);
11743 return isl_space_has_equal_params(bset_space
, space
);
11746 /* Do "map" and "space" have the same parameters?
11748 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11749 __isl_keep isl_space
*space
)
11751 isl_space
*map_space
;
11753 map_space
= isl_map_peek_space(map
);
11754 return isl_space_has_equal_params(map_space
, space
);
11757 /* Do "set" and "space" have the same parameters?
11759 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11760 __isl_keep isl_space
*space
)
11762 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11765 /* Align the parameters of "bset" to those of "model", introducing
11766 * additional parameters if needed.
11768 __isl_give isl_basic_set
*isl_basic_set_align_params(
11769 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11771 return isl_basic_map_align_params(bset
, model
);
11774 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11775 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11776 enum isl_dim_type c2
, enum isl_dim_type c3
,
11777 enum isl_dim_type c4
, enum isl_dim_type c5
)
11779 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11780 struct isl_mat
*mat
;
11786 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11787 isl_basic_map_total_dim(bmap
) + 1);
11790 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11791 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11792 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11793 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11794 isl_int_set(mat
->row
[i
][pos
],
11795 bmap
->eq
[i
][off
+ k
]);
11803 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11804 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11805 enum isl_dim_type c2
, enum isl_dim_type c3
,
11806 enum isl_dim_type c4
, enum isl_dim_type c5
)
11808 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11809 struct isl_mat
*mat
;
11815 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11816 isl_basic_map_total_dim(bmap
) + 1);
11819 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11820 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11821 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11822 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11823 isl_int_set(mat
->row
[i
][pos
],
11824 bmap
->ineq
[i
][off
+ k
]);
11832 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11833 __isl_take isl_space
*dim
,
11834 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11835 enum isl_dim_type c2
, enum isl_dim_type c3
,
11836 enum isl_dim_type c4
, enum isl_dim_type c5
)
11838 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11839 isl_basic_map
*bmap
;
11845 if (!dim
|| !eq
|| !ineq
)
11848 if (eq
->n_col
!= ineq
->n_col
)
11849 isl_die(dim
->ctx
, isl_error_invalid
,
11850 "equalities and inequalities matrices should have "
11851 "same number of columns", goto error
);
11853 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11855 if (eq
->n_col
< total
)
11856 isl_die(dim
->ctx
, isl_error_invalid
,
11857 "number of columns too small", goto error
);
11859 extra
= eq
->n_col
- total
;
11861 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11862 eq
->n_row
, ineq
->n_row
);
11865 for (i
= 0; i
< extra
; ++i
) {
11866 k
= isl_basic_map_alloc_div(bmap
);
11869 isl_int_set_si(bmap
->div
[k
][0], 0);
11871 for (i
= 0; i
< eq
->n_row
; ++i
) {
11872 l
= isl_basic_map_alloc_equality(bmap
);
11875 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11876 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11877 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11878 isl_int_set(bmap
->eq
[l
][off
+ k
],
11884 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11885 l
= isl_basic_map_alloc_inequality(bmap
);
11888 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11889 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11890 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11891 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11892 ineq
->row
[i
][pos
]);
11898 isl_space_free(dim
);
11900 isl_mat_free(ineq
);
11902 bmap
= isl_basic_map_simplify(bmap
);
11903 return isl_basic_map_finalize(bmap
);
11905 isl_space_free(dim
);
11907 isl_mat_free(ineq
);
11911 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11912 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11913 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11915 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11916 c1
, c2
, c3
, c4
, isl_dim_in
);
11919 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11920 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11921 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11923 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11924 c1
, c2
, c3
, c4
, isl_dim_in
);
11927 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11928 __isl_take isl_space
*dim
,
11929 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11930 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11932 isl_basic_map
*bmap
;
11933 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11934 c1
, c2
, c3
, c4
, isl_dim_in
);
11935 return bset_from_bmap(bmap
);
11938 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11941 return isl_bool_error
;
11943 return isl_space_can_zip(bmap
->dim
);
11946 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11949 return isl_bool_error
;
11951 return isl_space_can_zip(map
->dim
);
11954 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11955 * (A -> C) -> (B -> D).
11957 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11966 if (!isl_basic_map_can_zip(bmap
))
11967 isl_die(bmap
->ctx
, isl_error_invalid
,
11968 "basic map cannot be zipped", goto error
);
11969 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11970 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11971 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11972 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11973 bmap
= isl_basic_map_cow(bmap
);
11974 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11977 bmap
->dim
= isl_space_zip(bmap
->dim
);
11980 bmap
= isl_basic_map_mark_final(bmap
);
11983 isl_basic_map_free(bmap
);
11987 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11988 * (A -> C) -> (B -> D).
11990 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11997 if (!isl_map_can_zip(map
))
11998 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12001 map
= isl_map_cow(map
);
12005 for (i
= 0; i
< map
->n
; ++i
) {
12006 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12011 map
->dim
= isl_space_zip(map
->dim
);
12021 /* Can we apply isl_basic_map_curry to "bmap"?
12022 * That is, does it have a nested relation in its domain?
12024 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12027 return isl_bool_error
;
12029 return isl_space_can_curry(bmap
->dim
);
12032 /* Can we apply isl_map_curry to "map"?
12033 * That is, does it have a nested relation in its domain?
12035 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12038 return isl_bool_error
;
12040 return isl_space_can_curry(map
->dim
);
12043 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12046 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12052 if (!isl_basic_map_can_curry(bmap
))
12053 isl_die(bmap
->ctx
, isl_error_invalid
,
12054 "basic map cannot be curried", goto error
);
12055 bmap
= isl_basic_map_cow(bmap
);
12058 bmap
->dim
= isl_space_curry(bmap
->dim
);
12061 bmap
= isl_basic_map_mark_final(bmap
);
12064 isl_basic_map_free(bmap
);
12068 /* Given a map (A -> B) -> C, return the corresponding map
12071 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12073 return isl_map_change_space(map
, &isl_map_can_curry
,
12074 "map cannot be curried", &isl_space_curry
);
12077 /* Can isl_map_range_curry be applied to "map"?
12078 * That is, does it have a nested relation in its range,
12079 * the domain of which is itself a nested relation?
12081 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12084 return isl_bool_error
;
12086 return isl_space_can_range_curry(map
->dim
);
12089 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12090 * A -> (B -> (C -> D)).
12092 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12094 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12095 "map range cannot be curried",
12096 &isl_space_range_curry
);
12099 /* Can we apply isl_basic_map_uncurry to "bmap"?
12100 * That is, does it have a nested relation in its domain?
12102 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12105 return isl_bool_error
;
12107 return isl_space_can_uncurry(bmap
->dim
);
12110 /* Can we apply isl_map_uncurry to "map"?
12111 * That is, does it have a nested relation in its domain?
12113 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12116 return isl_bool_error
;
12118 return isl_space_can_uncurry(map
->dim
);
12121 /* Given a basic map A -> (B -> C), return the corresponding basic map
12124 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12130 if (!isl_basic_map_can_uncurry(bmap
))
12131 isl_die(bmap
->ctx
, isl_error_invalid
,
12132 "basic map cannot be uncurried",
12133 return isl_basic_map_free(bmap
));
12134 bmap
= isl_basic_map_cow(bmap
);
12137 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12139 return isl_basic_map_free(bmap
);
12140 bmap
= isl_basic_map_mark_final(bmap
);
12144 /* Given a map A -> (B -> C), return the corresponding map
12147 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12149 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12150 "map cannot be uncurried", &isl_space_uncurry
);
12153 /* Construct a basic map mapping the domain of the affine expression
12154 * to a one-dimensional range prescribed by the affine expression.
12155 * If "rational" is set, then construct a rational basic map.
12157 * A NaN affine expression cannot be converted to a basic map.
12159 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12160 __isl_take isl_aff
*aff
, int rational
)
12165 isl_local_space
*ls
;
12166 isl_basic_map
*bmap
= NULL
;
12170 is_nan
= isl_aff_is_nan(aff
);
12174 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12175 "cannot convert NaN", goto error
);
12177 ls
= isl_aff_get_local_space(aff
);
12178 bmap
= isl_basic_map_from_local_space(ls
);
12179 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12180 k
= isl_basic_map_alloc_equality(bmap
);
12184 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12185 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12186 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12187 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12188 aff
->v
->size
- (pos
+ 1));
12192 bmap
= isl_basic_map_set_rational(bmap
);
12193 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12194 bmap
= isl_basic_map_finalize(bmap
);
12198 isl_basic_map_free(bmap
);
12202 /* Construct a basic map mapping the domain of the affine expression
12203 * to a one-dimensional range prescribed by the affine expression.
12205 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12207 return isl_basic_map_from_aff2(aff
, 0);
12210 /* Construct a map mapping the domain of the affine expression
12211 * to a one-dimensional range prescribed by the affine expression.
12213 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12215 isl_basic_map
*bmap
;
12217 bmap
= isl_basic_map_from_aff(aff
);
12218 return isl_map_from_basic_map(bmap
);
12221 /* Construct a basic map mapping the domain the multi-affine expression
12222 * to its range, with each dimension in the range equated to the
12223 * corresponding affine expression.
12224 * If "rational" is set, then construct a rational basic map.
12226 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12227 __isl_take isl_multi_aff
*maff
, int rational
)
12231 isl_basic_map
*bmap
;
12236 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12237 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12238 "invalid space", goto error
);
12240 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12241 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12243 bmap
= isl_basic_map_set_rational(bmap
);
12245 for (i
= 0; i
< maff
->n
; ++i
) {
12247 isl_basic_map
*bmap_i
;
12249 aff
= isl_aff_copy(maff
->p
[i
]);
12250 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12252 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12255 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12257 isl_multi_aff_free(maff
);
12260 isl_multi_aff_free(maff
);
12264 /* Construct a basic map mapping the domain the multi-affine expression
12265 * to its range, with each dimension in the range equated to the
12266 * corresponding affine expression.
12268 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12269 __isl_take isl_multi_aff
*ma
)
12271 return isl_basic_map_from_multi_aff2(ma
, 0);
12274 /* Construct a map mapping the domain the multi-affine expression
12275 * to its range, with each dimension in the range equated to the
12276 * corresponding affine expression.
12278 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12280 isl_basic_map
*bmap
;
12282 bmap
= isl_basic_map_from_multi_aff(maff
);
12283 return isl_map_from_basic_map(bmap
);
12286 /* Construct a basic map mapping a domain in the given space to
12287 * to an n-dimensional range, with n the number of elements in the list,
12288 * where each coordinate in the range is prescribed by the
12289 * corresponding affine expression.
12290 * The domains of all affine expressions in the list are assumed to match
12293 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12294 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12298 isl_basic_map
*bmap
;
12303 dim
= isl_space_from_domain(domain_dim
);
12304 bmap
= isl_basic_map_universe(dim
);
12306 for (i
= 0; i
< list
->n
; ++i
) {
12308 isl_basic_map
*bmap_i
;
12310 aff
= isl_aff_copy(list
->p
[i
]);
12311 bmap_i
= isl_basic_map_from_aff(aff
);
12313 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12316 isl_aff_list_free(list
);
12320 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12321 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12323 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12326 /* Construct a basic map where the given dimensions are equal to each other.
12328 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12329 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12331 isl_basic_map
*bmap
= NULL
;
12337 if (pos1
>= isl_space_dim(space
, type1
))
12338 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12339 "index out of bounds", goto error
);
12340 if (pos2
>= isl_space_dim(space
, type2
))
12341 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12342 "index out of bounds", goto error
);
12344 if (type1
== type2
&& pos1
== pos2
)
12345 return isl_basic_map_universe(space
);
12347 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12348 i
= isl_basic_map_alloc_equality(bmap
);
12351 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12352 pos1
+= isl_basic_map_offset(bmap
, type1
);
12353 pos2
+= isl_basic_map_offset(bmap
, type2
);
12354 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12355 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12356 bmap
= isl_basic_map_finalize(bmap
);
12357 isl_space_free(space
);
12360 isl_space_free(space
);
12361 isl_basic_map_free(bmap
);
12365 /* Add a constraint imposing that the given two dimensions are equal.
12367 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12368 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12372 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12374 bmap
= isl_basic_map_intersect(bmap
, eq
);
12379 /* Add a constraint imposing that the given two dimensions are equal.
12381 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12382 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12384 isl_basic_map
*bmap
;
12386 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12388 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12393 /* Add a constraint imposing that the given two dimensions have opposite values.
12395 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12396 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12398 isl_basic_map
*bmap
= NULL
;
12404 if (pos1
>= isl_map_dim(map
, type1
))
12405 isl_die(map
->ctx
, isl_error_invalid
,
12406 "index out of bounds", goto error
);
12407 if (pos2
>= isl_map_dim(map
, type2
))
12408 isl_die(map
->ctx
, isl_error_invalid
,
12409 "index out of bounds", goto error
);
12411 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12412 i
= isl_basic_map_alloc_equality(bmap
);
12415 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12416 pos1
+= isl_basic_map_offset(bmap
, type1
);
12417 pos2
+= isl_basic_map_offset(bmap
, type2
);
12418 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12419 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12420 bmap
= isl_basic_map_finalize(bmap
);
12422 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12426 isl_basic_map_free(bmap
);
12431 /* Construct a constraint imposing that the value of the first dimension is
12432 * greater than or equal to that of the second.
12434 static __isl_give isl_constraint
*constraint_order_ge(
12435 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12436 enum isl_dim_type type2
, int pos2
)
12443 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12445 if (pos1
>= isl_constraint_dim(c
, type1
))
12446 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12447 "index out of bounds", return isl_constraint_free(c
));
12448 if (pos2
>= isl_constraint_dim(c
, type2
))
12449 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12450 "index out of bounds", return isl_constraint_free(c
));
12452 if (type1
== type2
&& pos1
== pos2
)
12455 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12456 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12461 /* Add a constraint imposing that the value of the first dimension is
12462 * greater than or equal to that of the second.
12464 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12465 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12470 if (type1
== type2
&& pos1
== pos2
)
12472 space
= isl_basic_map_get_space(bmap
);
12473 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12474 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12479 /* Add a constraint imposing that the value of the first dimension is
12480 * greater than or equal to that of the second.
12482 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12483 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12488 if (type1
== type2
&& pos1
== pos2
)
12490 space
= isl_map_get_space(map
);
12491 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12492 map
= isl_map_add_constraint(map
, c
);
12497 /* Add a constraint imposing that the value of the first dimension is
12498 * less than or equal to that of the second.
12500 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12501 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12503 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12506 /* Construct a basic map where the value of the first dimension is
12507 * greater than that of the second.
12509 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12510 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12512 isl_basic_map
*bmap
= NULL
;
12518 if (pos1
>= isl_space_dim(space
, type1
))
12519 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12520 "index out of bounds", goto error
);
12521 if (pos2
>= isl_space_dim(space
, type2
))
12522 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12523 "index out of bounds", goto error
);
12525 if (type1
== type2
&& pos1
== pos2
)
12526 return isl_basic_map_empty(space
);
12528 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12529 i
= isl_basic_map_alloc_inequality(bmap
);
12531 return isl_basic_map_free(bmap
);
12532 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12533 pos1
+= isl_basic_map_offset(bmap
, type1
);
12534 pos2
+= isl_basic_map_offset(bmap
, type2
);
12535 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12536 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12537 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12538 bmap
= isl_basic_map_finalize(bmap
);
12542 isl_space_free(space
);
12543 isl_basic_map_free(bmap
);
12547 /* Add a constraint imposing that the value of the first dimension is
12548 * greater than that of the second.
12550 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12551 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12555 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12557 bmap
= isl_basic_map_intersect(bmap
, gt
);
12562 /* Add a constraint imposing that the value of the first dimension is
12563 * greater than that of the second.
12565 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12566 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12568 isl_basic_map
*bmap
;
12570 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12572 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12577 /* Add a constraint imposing that the value of the first dimension is
12578 * smaller than that of the second.
12580 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12581 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12583 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12586 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12590 isl_local_space
*ls
;
12595 if (!isl_basic_map_divs_known(bmap
))
12596 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12597 "some divs are unknown", return NULL
);
12599 ls
= isl_basic_map_get_local_space(bmap
);
12600 div
= isl_local_space_get_div(ls
, pos
);
12601 isl_local_space_free(ls
);
12606 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12609 return isl_basic_map_get_div(bset
, pos
);
12612 /* Plug in "subs" for dimension "type", "pos" of "bset".
12614 * Let i be the dimension to replace and let "subs" be of the form
12618 * Any integer division with a non-zero coefficient for i,
12620 * floor((a i + g)/m)
12624 * floor((a f + d g)/(m d))
12626 * Constraints of the form
12634 * We currently require that "subs" is an integral expression.
12635 * Handling rational expressions may require us to add stride constraints
12636 * as we do in isl_basic_set_preimage_multi_aff.
12638 __isl_give isl_basic_set
*isl_basic_set_substitute(
12639 __isl_take isl_basic_set
*bset
,
12640 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12646 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12649 bset
= isl_basic_set_cow(bset
);
12650 if (!bset
|| !subs
)
12653 ctx
= isl_basic_set_get_ctx(bset
);
12654 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12655 isl_die(ctx
, isl_error_invalid
,
12656 "spaces don't match", goto error
);
12657 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12658 isl_die(ctx
, isl_error_unsupported
,
12659 "cannot handle divs yet", goto error
);
12660 if (!isl_int_is_one(subs
->v
->el
[0]))
12661 isl_die(ctx
, isl_error_invalid
,
12662 "can only substitute integer expressions", goto error
);
12664 pos
+= isl_basic_set_offset(bset
, type
);
12668 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12669 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12671 isl_int_set(v
, bset
->eq
[i
][pos
]);
12672 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12673 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12674 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12677 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12678 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12680 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12681 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12682 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12683 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12686 for (i
= 0; i
< bset
->n_div
; ++i
) {
12687 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12689 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12690 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12691 isl_seq_combine(bset
->div
[i
] + 1,
12692 subs
->v
->el
[0], bset
->div
[i
] + 1,
12693 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12694 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12699 bset
= isl_basic_set_simplify(bset
);
12700 return isl_basic_set_finalize(bset
);
12702 isl_basic_set_free(bset
);
12706 /* Plug in "subs" for dimension "type", "pos" of "set".
12708 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12709 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12713 if (set
&& isl_set_plain_is_empty(set
))
12716 set
= isl_set_cow(set
);
12720 for (i
= set
->n
- 1; i
>= 0; --i
) {
12721 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12722 if (remove_if_empty(set
, i
) < 0)
12732 /* Check if the range of "ma" is compatible with the domain or range
12733 * (depending on "type") of "bmap".
12735 static isl_stat
check_basic_map_compatible_range_multi_aff(
12736 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12737 __isl_keep isl_multi_aff
*ma
)
12740 isl_space
*ma_space
;
12742 ma_space
= isl_multi_aff_get_space(ma
);
12744 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12748 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12749 "parameters don't match", goto error
);
12750 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12754 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12755 "spaces don't match", goto error
);
12757 isl_space_free(ma_space
);
12758 return isl_stat_ok
;
12760 isl_space_free(ma_space
);
12761 return isl_stat_error
;
12764 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12765 * coefficients before the transformed range of dimensions,
12766 * the "n_after" coefficients after the transformed range of dimensions
12767 * and the coefficients of the other divs in "bmap".
12769 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12770 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12775 isl_local_space
*ls
;
12780 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12784 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12785 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12786 for (i
= 0; i
< n_div
; ++i
) {
12787 int o_bmap
= 0, o_ls
= 0;
12789 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12790 o_bmap
+= 1 + 1 + n_param
;
12791 o_ls
+= 1 + 1 + n_param
;
12792 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12793 o_bmap
+= n_before
;
12794 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12795 ls
->div
->row
[i
] + o_ls
, n_set
);
12798 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12800 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12801 ls
->div
->row
[i
] + o_ls
, n_div
);
12804 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12805 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12809 isl_local_space_free(ls
);
12812 isl_local_space_free(ls
);
12816 /* How many stride constraints does "ma" enforce?
12817 * That is, how many of the affine expressions have a denominator
12818 * different from one?
12820 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12825 for (i
= 0; i
< ma
->n
; ++i
)
12826 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12832 /* For each affine expression in ma of the form
12834 * x_i = (f_i y + h_i)/m_i
12836 * with m_i different from one, add a constraint to "bmap"
12839 * f_i y + h_i = m_i alpha_i
12841 * with alpha_i an additional existentially quantified variable.
12843 * The input variables of "ma" correspond to a subset of the variables
12844 * of "bmap". There are "n_before" variables in "bmap" before this
12845 * subset and "n_after" variables after this subset.
12846 * The integer divisions of the affine expressions in "ma" are assumed
12847 * to have been aligned. There are "n_div_ma" of them and
12848 * they appear first in "bmap", straight after the "n_after" variables.
12850 static __isl_give isl_basic_map
*add_ma_strides(
12851 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12852 int n_before
, int n_after
, int n_div_ma
)
12860 total
= isl_basic_map_total_dim(bmap
);
12861 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12862 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12863 for (i
= 0; i
< ma
->n
; ++i
) {
12864 int o_bmap
= 0, o_ma
= 1;
12866 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12868 div
= isl_basic_map_alloc_div(bmap
);
12869 k
= isl_basic_map_alloc_equality(bmap
);
12870 if (div
< 0 || k
< 0)
12872 isl_int_set_si(bmap
->div
[div
][0], 0);
12873 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12874 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12875 o_bmap
+= 1 + n_param
;
12876 o_ma
+= 1 + n_param
;
12877 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12878 o_bmap
+= n_before
;
12879 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12880 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12883 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12885 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12886 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12887 o_bmap
+= n_div_ma
;
12889 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12890 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12896 isl_basic_map_free(bmap
);
12900 /* Replace the domain or range space (depending on "type) of "space" by "set".
12902 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12903 enum isl_dim_type type
, __isl_take isl_space
*set
)
12905 if (type
== isl_dim_in
) {
12906 space
= isl_space_range(space
);
12907 space
= isl_space_map_from_domain_and_range(set
, space
);
12909 space
= isl_space_domain(space
);
12910 space
= isl_space_map_from_domain_and_range(space
, set
);
12916 /* Compute the preimage of the domain or range (depending on "type")
12917 * of "bmap" under the function represented by "ma".
12918 * In other words, plug in "ma" in the domain or range of "bmap".
12919 * The result is a basic map that lives in the same space as "bmap"
12920 * except that the domain or range has been replaced by
12921 * the domain space of "ma".
12923 * If bmap is represented by
12925 * A(p) + S u + B x + T v + C(divs) >= 0,
12927 * where u and x are input and output dimensions if type == isl_dim_out
12928 * while x and v are input and output dimensions if type == isl_dim_in,
12929 * and ma is represented by
12931 * x = D(p) + F(y) + G(divs')
12933 * then the result is
12935 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12937 * The divs in the input set are similarly adjusted.
12940 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12944 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12945 * B_i G(divs') + c_i(divs))/n_i)
12947 * If bmap is not a rational map and if F(y) involves any denominators
12949 * x_i = (f_i y + h_i)/m_i
12951 * then additional constraints are added to ensure that we only
12952 * map back integer points. That is we enforce
12954 * f_i y + h_i = m_i alpha_i
12956 * with alpha_i an additional existentially quantified variable.
12958 * We first copy over the divs from "ma".
12959 * Then we add the modified constraints and divs from "bmap".
12960 * Finally, we add the stride constraints, if needed.
12962 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12963 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12964 __isl_take isl_multi_aff
*ma
)
12968 isl_basic_map
*res
= NULL
;
12969 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12970 isl_int f
, c1
, c2
, g
;
12979 ma
= isl_multi_aff_align_divs(ma
);
12982 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12985 if (type
== isl_dim_in
) {
12987 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12989 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12992 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12993 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12995 space
= isl_multi_aff_get_domain_space(ma
);
12996 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12997 rational
= isl_basic_map_is_rational(bmap
);
12998 strides
= rational
? 0 : multi_aff_strides(ma
);
12999 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13000 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13002 res
= isl_basic_map_set_rational(res
);
13004 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13005 if (isl_basic_map_alloc_div(res
) < 0)
13008 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13011 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13012 k
= isl_basic_map_alloc_equality(res
);
13015 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13016 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13019 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13020 k
= isl_basic_map_alloc_inequality(res
);
13023 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13024 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13027 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13028 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13029 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13032 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13033 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13038 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13044 isl_basic_map_free(bmap
);
13045 isl_multi_aff_free(ma
);
13046 res
= isl_basic_map_simplify(res
);
13047 return isl_basic_map_finalize(res
);
13053 isl_basic_map_free(bmap
);
13054 isl_multi_aff_free(ma
);
13055 isl_basic_map_free(res
);
13059 /* Compute the preimage of "bset" under the function represented by "ma".
13060 * In other words, plug in "ma" in "bset". The result is a basic set
13061 * that lives in the domain space of "ma".
13063 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13064 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13066 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13069 /* Compute the preimage of the domain of "bmap" under the function
13070 * represented by "ma".
13071 * In other words, plug in "ma" in the domain of "bmap".
13072 * The result is a basic map that lives in the same space as "bmap"
13073 * except that the domain has been replaced by the domain space of "ma".
13075 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13076 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13078 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13081 /* Compute the preimage of the range of "bmap" under the function
13082 * represented by "ma".
13083 * In other words, plug in "ma" in the range of "bmap".
13084 * The result is a basic map that lives in the same space as "bmap"
13085 * except that the range has been replaced by the domain space of "ma".
13087 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13088 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13090 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13093 /* Check if the range of "ma" is compatible with the domain or range
13094 * (depending on "type") of "map".
13095 * Return isl_stat_error if anything is wrong.
13097 static isl_stat
check_map_compatible_range_multi_aff(
13098 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13099 __isl_keep isl_multi_aff
*ma
)
13102 isl_space
*ma_space
;
13104 ma_space
= isl_multi_aff_get_space(ma
);
13105 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13106 isl_space_free(ma_space
);
13108 return isl_stat_error
;
13110 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13111 "spaces don't match", return isl_stat_error
);
13112 return isl_stat_ok
;
13115 /* Compute the preimage of the domain or range (depending on "type")
13116 * of "map" under the function represented by "ma".
13117 * In other words, plug in "ma" in the domain or range of "map".
13118 * The result is a map that lives in the same space as "map"
13119 * except that the domain or range has been replaced by
13120 * the domain space of "ma".
13122 * The parameters are assumed to have been aligned.
13124 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13125 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13130 map
= isl_map_cow(map
);
13131 ma
= isl_multi_aff_align_divs(ma
);
13134 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13137 for (i
= 0; i
< map
->n
; ++i
) {
13138 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13139 isl_multi_aff_copy(ma
));
13144 space
= isl_multi_aff_get_domain_space(ma
);
13145 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13147 isl_space_free(map
->dim
);
13152 isl_multi_aff_free(ma
);
13154 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13155 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13158 isl_multi_aff_free(ma
);
13163 /* Compute the preimage of the domain or range (depending on "type")
13164 * of "map" under the function represented by "ma".
13165 * In other words, plug in "ma" in the domain or range of "map".
13166 * The result is a map that lives in the same space as "map"
13167 * except that the domain or range has been replaced by
13168 * the domain space of "ma".
13170 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13171 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13178 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13182 return map_preimage_multi_aff(map
, type
, ma
);
13184 if (isl_map_check_named_params(map
) < 0)
13186 if (!isl_space_has_named_params(ma
->space
))
13187 isl_die(map
->ctx
, isl_error_invalid
,
13188 "unaligned unnamed parameters", goto error
);
13189 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13190 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13192 return map_preimage_multi_aff(map
, type
, ma
);
13194 isl_multi_aff_free(ma
);
13195 return isl_map_free(map
);
13198 /* Compute the preimage of "set" under the function represented by "ma".
13199 * In other words, plug in "ma" in "set". The result is a set
13200 * that lives in the domain space of "ma".
13202 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13203 __isl_take isl_multi_aff
*ma
)
13205 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13208 /* Compute the preimage of the domain of "map" under the function
13209 * represented by "ma".
13210 * In other words, plug in "ma" in the domain of "map".
13211 * The result is a map that lives in the same space as "map"
13212 * except that the domain has been replaced by the domain space of "ma".
13214 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13215 __isl_take isl_multi_aff
*ma
)
13217 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13220 /* Compute the preimage of the range of "map" under the function
13221 * represented by "ma".
13222 * In other words, plug in "ma" in the range of "map".
13223 * The result is a map that lives in the same space as "map"
13224 * except that the range has been replaced by the domain space of "ma".
13226 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13227 __isl_take isl_multi_aff
*ma
)
13229 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13232 /* Compute the preimage of "map" under the function represented by "pma".
13233 * In other words, plug in "pma" in the domain or range of "map".
13234 * The result is a map that lives in the same space as "map",
13235 * except that the space of type "type" has been replaced by
13236 * the domain space of "pma".
13238 * The parameters of "map" and "pma" are assumed to have been aligned.
13240 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13241 __isl_take isl_map
*map
, enum isl_dim_type type
,
13242 __isl_take isl_pw_multi_aff
*pma
)
13251 isl_pw_multi_aff_free(pma
);
13252 res
= isl_map_empty(isl_map_get_space(map
));
13257 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13258 isl_multi_aff_copy(pma
->p
[0].maff
));
13259 if (type
== isl_dim_in
)
13260 res
= isl_map_intersect_domain(res
,
13261 isl_map_copy(pma
->p
[0].set
));
13263 res
= isl_map_intersect_range(res
,
13264 isl_map_copy(pma
->p
[0].set
));
13266 for (i
= 1; i
< pma
->n
; ++i
) {
13269 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13270 isl_multi_aff_copy(pma
->p
[i
].maff
));
13271 if (type
== isl_dim_in
)
13272 res_i
= isl_map_intersect_domain(res_i
,
13273 isl_map_copy(pma
->p
[i
].set
));
13275 res_i
= isl_map_intersect_range(res_i
,
13276 isl_map_copy(pma
->p
[i
].set
));
13277 res
= isl_map_union(res
, res_i
);
13280 isl_pw_multi_aff_free(pma
);
13284 isl_pw_multi_aff_free(pma
);
13289 /* Compute the preimage of "map" under the function represented by "pma".
13290 * In other words, plug in "pma" in the domain or range of "map".
13291 * The result is a map that lives in the same space as "map",
13292 * except that the space of type "type" has been replaced by
13293 * the domain space of "pma".
13295 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13296 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13303 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13307 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13309 if (isl_map_check_named_params(map
) < 0)
13311 if (!isl_space_has_named_params(pma
->dim
))
13312 isl_die(map
->ctx
, isl_error_invalid
,
13313 "unaligned unnamed parameters", goto error
);
13314 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13315 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13317 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13319 isl_pw_multi_aff_free(pma
);
13320 return isl_map_free(map
);
13323 /* Compute the preimage of "set" under the function represented by "pma".
13324 * In other words, plug in "pma" in "set". The result is a set
13325 * that lives in the domain space of "pma".
13327 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13328 __isl_take isl_pw_multi_aff
*pma
)
13330 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13333 /* Compute the preimage of the domain of "map" under the function
13334 * represented by "pma".
13335 * In other words, plug in "pma" in the domain of "map".
13336 * The result is a map that lives in the same space as "map",
13337 * except that domain space has been replaced by the domain space of "pma".
13339 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13340 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13342 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13345 /* Compute the preimage of the range of "map" under the function
13346 * represented by "pma".
13347 * In other words, plug in "pma" in the range of "map".
13348 * The result is a map that lives in the same space as "map",
13349 * except that range space has been replaced by the domain space of "pma".
13351 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13352 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13354 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13357 /* Compute the preimage of "map" under the function represented by "mpa".
13358 * In other words, plug in "mpa" in the domain or range of "map".
13359 * The result is a map that lives in the same space as "map",
13360 * except that the space of type "type" has been replaced by
13361 * the domain space of "mpa".
13363 * If the map does not involve any constraints that refer to the
13364 * dimensions of the substituted space, then the only possible
13365 * effect of "mpa" on the map is to map the space to a different space.
13366 * We create a separate isl_multi_aff to effectuate this change
13367 * in order to avoid spurious splitting of the map along the pieces
13370 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13371 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13374 isl_pw_multi_aff
*pma
;
13379 n
= isl_map_dim(map
, type
);
13380 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13384 space
= isl_multi_pw_aff_get_space(mpa
);
13385 isl_multi_pw_aff_free(mpa
);
13386 ma
= isl_multi_aff_zero(space
);
13387 return isl_map_preimage_multi_aff(map
, type
, ma
);
13390 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13391 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13394 isl_multi_pw_aff_free(mpa
);
13398 /* Compute the preimage of "map" under the function represented by "mpa".
13399 * In other words, plug in "mpa" in the domain "map".
13400 * The result is a map that lives in the same space as "map",
13401 * except that domain space has been replaced by the domain space of "mpa".
13403 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13404 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13406 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13409 /* Compute the preimage of "set" by the function represented by "mpa".
13410 * In other words, plug in "mpa" in "set".
13412 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13413 __isl_take isl_multi_pw_aff
*mpa
)
13415 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13418 /* Return a copy of the equality constraints of "bset" as a matrix.
13420 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13421 __isl_keep isl_basic_set
*bset
)
13429 ctx
= isl_basic_set_get_ctx(bset
);
13430 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13431 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13434 /* Are the "n" "coefficients" starting at "first" of the integer division
13435 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13437 * The "coefficient" at position 0 is the denominator.
13438 * The "coefficient" at position 1 is the constant term.
13440 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13441 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13442 unsigned first
, unsigned n
)
13444 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13445 return isl_bool_error
;
13446 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13447 return isl_bool_error
;
13448 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13449 bmap2
->div
[pos2
] + first
, n
);
13452 /* Are the integer division expressions at position "pos1" in "bmap1" and
13453 * "pos2" in "bmap2" equal to each other, except that the constant terms
13456 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13457 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13458 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13463 if (!bmap1
|| !bmap2
)
13464 return isl_bool_error
;
13465 total
= isl_basic_map_total_dim(bmap1
);
13466 if (total
!= isl_basic_map_total_dim(bmap2
))
13467 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13468 "incomparable div expressions", return isl_bool_error
);
13469 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13471 if (equal
< 0 || !equal
)
13473 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13475 if (equal
< 0 || equal
)
13476 return isl_bool_not(equal
);
13477 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13481 /* Replace the numerator of the constant term of the integer division
13482 * expression at position "div" in "bmap" by "value".
13483 * The caller guarantees that this does not change the meaning
13486 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13487 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13489 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13490 return isl_basic_map_free(bmap
);
13492 isl_int_set_si(bmap
->div
[div
][1], value
);
13497 /* Is the point "inner" internal to inequality constraint "ineq"
13499 * The point is considered to be internal to the inequality constraint,
13500 * if it strictly lies on the positive side of the inequality constraint,
13501 * or if it lies on the constraint and the constraint is lexico-positive.
13503 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13504 __isl_keep isl_basic_set
*bset
, int ineq
)
13510 if (!inner
|| !bset
)
13511 return isl_bool_error
;
13513 ctx
= isl_basic_set_get_ctx(bset
);
13514 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13515 &ctx
->normalize_gcd
);
13516 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13517 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13519 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13520 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13521 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13524 /* Tighten the inequality constraints of "bset" that are outward with respect
13525 * to the point "vec".
13526 * That is, tighten the constraints that are not satisfied by "vec".
13528 * "vec" is a point internal to some superset S of "bset" that is used
13529 * to make the subsets of S disjoint, by tightening one half of the constraints
13530 * that separate two subsets. In particular, the constraints of S
13531 * are all satisfied by "vec" and should not be tightened.
13532 * Of the internal constraints, those that have "vec" on the outside
13533 * are tightened. The shared facet is included in the adjacent subset
13534 * with the opposite constraint.
13535 * For constraints that saturate "vec", this criterion cannot be used
13536 * to determine which of the two sides should be tightened.
13537 * Instead, the sign of the first non-zero coefficient is used
13538 * to make this choice. Note that this second criterion is never used
13539 * on the constraints of S since "vec" is interior to "S".
13541 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13542 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13546 bset
= isl_basic_set_cow(bset
);
13549 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13552 internal
= is_internal(vec
, bset
, j
);
13554 return isl_basic_set_free(bset
);
13557 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13563 /* Replace the variables x of type "type" starting at "first" in "bmap"
13564 * by x' with x = M x' with M the matrix trans.
13565 * That is, replace the corresponding coefficients c by c M.
13567 * The transformation matrix should be a square matrix.
13569 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13570 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13571 __isl_take isl_mat
*trans
)
13575 bmap
= isl_basic_map_cow(bmap
);
13576 if (!bmap
|| !trans
)
13579 if (trans
->n_row
!= trans
->n_col
)
13580 isl_die(trans
->ctx
, isl_error_invalid
,
13581 "expecting square transformation matrix", goto error
);
13582 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13583 isl_die(trans
->ctx
, isl_error_invalid
,
13584 "oversized transformation matrix", goto error
);
13586 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13588 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13589 isl_mat_copy(trans
)) < 0)
13591 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13592 isl_mat_copy(trans
)) < 0)
13594 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13595 isl_mat_copy(trans
)) < 0)
13598 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13599 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13601 isl_mat_free(trans
);
13604 isl_mat_free(trans
);
13605 isl_basic_map_free(bmap
);
13609 /* Replace the variables x of type "type" starting at "first" in "bset"
13610 * by x' with x = M x' with M the matrix trans.
13611 * That is, replace the corresponding coefficients c by c M.
13613 * The transformation matrix should be a square matrix.
13615 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13616 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13617 __isl_take isl_mat
*trans
)
13619 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);